How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Local smooth positive-density polytropic Euler
Statement
Assume Countable Choice. Let , , , , integer , and smooth real periodic maps and , where , with . Use normalized measure , coefficients , weights , and componentwise norms . For , set and . Then there is , depending only on , , and , and a unique smooth real solution on of with initial data and . For every integer , . This conditional smooth periodic theorem concerns the isentropic barotropic model with strictly positive density; it asserts no continuation through vacuum or shocks and no viscous or temperature-coupled result.
Statement references
Facts & Assumptions
Given: Countable Choice, the data and conventions in the Statement, and the exact current conditional interfaces below. No readiness or proof acceptance is inferred for any FD-S01 item.
The current batch-17 manifest contains the fd-s01 A page with eleven item carriers and its B page with two carriers. I inspected the current statements, hypotheses, and complete proofs of the Fourier-space, embedding/product, and tame-commutator suppliers used below; their actual interfaces match this proof. The current step1Decision queries for the six S01 inputs return ready with current hashes. These records document authoring readiness and do not replace later independent proof review.
The Fourier-space definition uses normalized measure , coefficients , conjugate symmetry for real fields, and the weighted coefficient completion; for it has the coefficient-isometry representative (Periodic fluid Fourier Sobolev spaces).
The Fourier coefficient map on the normalized unit torus is a surjective isometry onto and satisfies Parseval; rescaling gives the normalized -periodic convention in [F1] (The Fourier basis and Parseval's identity on the finite torus).
Under Countable Choice, for and every integer , when ; for pointwise multiplication is continuous on (Periodic Fourier embeddings and products).
Under Countable Choice, for , integers , smooth periodic scalar , and each coordinate , (Tame transport commutator).
With , , , and , each is symmetric and linear in , and is the positive-density polytropic Euler system (Sound-speed variables for polytropic Euler).
Countable Choice permits choosing one member from each countable sequence of nonempty sets (The Axiom of Countable Choice ()).
A continuous vector field locally Lipschitz in its state variable has a unique local solution through every initial state (Picard-Lindelöf local existence and uniqueness for first-order systems).
A bounded trajectory of a polynomial vector field on a finite-dimensional real space extends past a finite right endpoint (Continuation of bounded polynomial ODE solutions).
Finite-dimensional Euclidean space is complete ( and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in ).
Every bounded real sequence has a convergent subsequence (Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence); finite extraction over real and imaginary Fourier coordinates uses only finite choice.
Countable Choice is retained for the analytic Fourier and Sobolev suppliers [F1]–[F4]; the explicit coefficient diagonal below makes no additional selection and uses no dependent choice (The Axiom of Countable Choice ()).
Proof
For a positive smooth solution of the mass equation, , where . Since and , the chain rule gives . Also . Conversely, for , the inverse has ; the first symmetric equation therefore gives , and the second gives using . Thus the two smooth systems are equivalent on the positive-density region.
Put . For , let be the componentwise orthogonal Fourier projection to and solve , . Each coefficient of its finite-dimensional vector field is polynomial. On any bounded coefficient box, the identity , telescoped over the finitely many factors of each monomial, bounds every monomial difference by a constant times the Euclidean distance; summing the finitely many monomials proves local Lipschitz continuity. Thus [F7] gives a unique local real solution, and the real Fourier cutoff preserves conjugate symmetry.
The analytic suppliers [F2]–[F4] apply under the standing Countable Choice assumption [F6, A1]. For integer , put with the multiplier . Pair the projected equation with . Since is self-adjoint and commutes with , the projection disappears in the inner product. For each , expand . Symmetry and periodic integration by parts give , whose absolute value is at most . The embedding in [F3] bounds this by . Because each is linear in , [F4] bounds all commutator terms by the same expression. Thus .
Define a canonical extraction for a bounded real sequence . Let be the least integer with for every , and put . Having defined , bisect it into its two closed halves and define to be the left half if that half contains for infinitely many indices , and the right half otherwise. At least one half contains infinitely many such indices, so this rule is defined and unique. Set and let be the least with . These minima exist because the corresponding index sets are infinite. Then is strictly increasing and is Cauchy: for , both values lie in , whose length is . It converges, since [F10] gives a convergent subsequence of this bounded Cauchy sequence and the Cauchy inequality forces the entire sequence to have the same limit. All intervals and indices are uniquely specified; this defines a function without any choice principle.
At , let . If , step 1.3 gives while ; integrating yields for . If , the unique finite-dimensional solution is zero and take . For each , substituting this bound into step 1.3 and multiplying the squared-norm inequality by the corresponding decreasing exponential gives . Parseval [F2] bounds the Euclidean coefficient norm by ; since the finite-dimensional state space is with , completeness [F9] supplies the endpoint limit used by the continuation argument [F8]. Thus every finite-dimensional polynomial trajectory continues throughout .
Let be two smooth solutions of the symmetric system with the same initial data and positive first component. Their difference satisfies . Pair with , integrate over the torus, and use symmetry of to integrate the principal term into . Linearity of bounds the right side by , so satisfies , with continuous nonnegative . Multiplying by gives a nonincreasing nonnegative function initially zero, hence . The inverse change of variables then makes the positive-density Euler solution unique.
For every integer , the product estimate [F3] and the bounds in step 2.1 bound uniformly in . Hence each fixed Fourier coefficient is uniformly bounded and equicontinuous in time.
Enumerate tuples with , integers , , , , , and by increasing , then lexicographically within each finite level. At tuple , let be the real () or imaginary () part of the th component of . Starting with , define recursively and put . The successor in this recursion is a specified function of , so this is ordinary recursion, not a succession of unspecified dependent selections. Each is strictly increasing and its range is contained in every preceding range. Moreover . For each fixed , the tail is an increasing subsequence of the range of , on which converges. Thus this one subsequence converges at every enumerated coefficient-time coordinate. Countable Choice remains the standing analytic Fourier assumption; the diagonal construction itself does not require dependent choice.
The equicontinuity from step 3.1 upgrades convergence at rational times to uniform-in-time convergence of each fixed Fourier coefficient. Given , choose a finite rational time grid so that every time is close enough to a grid point to make each of the two equicontinuity errors below ; choose the subsequence indices large enough that the finitely many grid values differ by less than . The triangle inequality makes each coordinate uniformly Cauchy, and scalar completeness supplies its uniform limit.
For every integer , the bound from step 2.1 and the coefficient weight give for . This tail tends to zero uniformly in . Combining it with finite-mode convergence from step 5.1 makes the diagonal subsequence Cauchy in for every integer . Completeness of the weighted coefficient space [F1] yields a limit with all these uniform bounds; coefficientwise limits preserve reality and the initial data.
Since in for every , the algebra estimate [F3] gives in . The Fourier cutoffs converge strongly to the identity in that space. They converge uniformly on the compact time image of the continuous curve : choose a finite -net, use strong convergence at its finitely many points, and use for the net errors. Thus the Galerkin right-hand sides converge uniformly in .
Integrate each Galerkin equation from to . A continuous curve into the complete weighted coefficient space is Riemann integrable: uniform continuity makes its Riemann sums Cauchy, and completeness supplies the limit; the triangle inequality gives . The right-hand-side convergence in step 7.1 and therefore let the integrals pass to the limit, giving . The integrand is continuous in every ; its integral has derivative equal to the integrand because the difference quotient error is bounded by the maximum oscillation of that continuous integrand on the shrinking time interval. Therefore at every Sobolev order, and the embeddings in [F3] imply spatial smoothness. Differentiating this polynomial first-order identity inductively gives all time derivatives: each new derivative is a finite sum of products of already continuous spatial derivatives.
The first component satisfies . By [F3], the uniform bound in step 2.1 bounds the right side in by . Hence . Choose so that this is less than ; then . The smooth inverse and step 1.1 give a smooth positive-density solution of the stated Euler equations. On the compact spacetime cylinder, stays in a compact subinterval of ; all derivatives of this inverse power are therefore bounded on the range of , and the repeated chain rule gives for every . The choice of uses only the stated parameters, , and .
The compactness, passage, positivity, and uniqueness arguments above give existence, smoothness, positivity, uniqueness, and all-order Sobolev bounds on the same interval. No argument extends the solution through vacuum, a shock, or a finite-time loss of the stated bounds.
Depends on
Sound-speed variables for polytropic Euler
Periodic fluid Fourier Sobolev spaces
The Fourier basis and Parseval's identity on the finite torus
Periodic Fourier embeddings and products
Tame transport commutator
The Axiom of Countable Choice ()
Picard-Lindelöf local existence and uniqueness for first-order systems
Continuation of bounded polynomial ODE solutions
and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in
Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence