Rough solutions of the 3-D compressible Euler equations

Abstract

We prove the local-in-time well-posedness for the solution of the compressible Euler equations in 3-D, for the Cauchy data of the velocity, density and vorticity (v,, ) ∈ Hs× Hs× Hs', 2<s'<s. The classical local well-posedness result for the compressible Euler equations in 3-D holds for the initial data v, ∈ Hs+12,\, s>2. Due to the works of Smith-Tataru and Wang for the irrotational isentropic case, the local well-posedness can be achieved if the data satisfy v, ∈ Hs, with s>2. In the incompressible case the solution is proven to be ill-posed for the datum ∈ H32 by Bourgain-Li. The solution of the compressible Euler equations is not expected to be well-posed if the data merely satisfy v, ∈ Hs, s>2 with a general rough vorticity. By decomposing the velocity into the term (I-e)-1 and a wave function verifying an improved wave equation, with a series of cancellations for treating the latter, we achieve the Hs-energy bound and complete the linearization for the wave functions by using the Hs-12, \, s>2 norm for the vorticity. The propagation of energy for the vorticity typically requires ∈ C0, 0+ initially, stronger than our assumption by 1/2-derivative. We perform trilinear estimates to gain regularity by observing a div-curl structure when propagating the energy of the normalized double-curl of the vorticity, and also by spacetime integration by parts. To prove the Strichartz estimate for the linearized wave in the rough spacetime, we encounter a strong Ricci defect requiring the bound of \| \|Lx∞ Lt1 on null cones. This difficulty is solved by uncovering the cancellation structures due to the acoustic metric on the angular derivatives of Ricci and the second fundamental form.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…