Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-23 (gpt-6.1-sol)
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 d∈{1,2,3}, κ>0, γ>1, a=(γ−1)/2, integer s≥4, and smooth real periodic maps ρ0:Td→(0,∞) and u0:Td→Rd, where Td=(R/2πZ)d, with min⁡x∈Tdρ0(x)>0. Use normalized measure dμ=(2π)−ddx, coefficients f^(k)=∫f(x)e−ik⋅x dμ(x), weights wk=(1+∣k∣2)1/2, and componentwise norms ∥f∥Hm2=∑k∈Zdwk2m∣f^(k)∣2. For ρ>0, set p(ρ)=κργ and r(ρ)=κγ ρa/a. Then there is T>0, depending only on d,s,κ,γ, ∥(r(ρ0),u0)∥Hs, and min⁡r(ρ0), and a unique smooth real solution (ρ,u) on [0,T]×Td of ρt+div⁡(ρu)=0,ut+u⋅∇u+ρ−1∇(κργ)=0, with initial data (ρ0,u0) and ρ(t,x)>0. For every integer m≥s, sup⁡0≤t≤T(∥ρ(t)∥Hm+∥u(t)∥Hm)<∞. 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.

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.

[L1]

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.

[F1]

The Fourier-space definition uses normalized measure (2π)−ddx, coefficients q^(k)=∫q(x)e−ik⋅x dμ(x), conjugate symmetry for real fields, and the weighted coefficient completion; for m≥0 it has the coefficient-isometry L2 representative (Periodic fluid Fourier Sobolev spaces).

[F2]

The Fourier coefficient map on the normalized unit torus is a surjective isometry onto ℓ2(Zd) and satisfies Parseval; rescaling x=2πy gives the normalized 2π-periodic convention in [F1] (The Fourier basis and Parseval's identity on the finite torus).

[F3]

Under Countable Choice, for d≤3 and every integer j≥0, Hσ↪Cj when σ>j+d/2; for σ>d/2 pointwise multiplication is continuous on Hσ (Periodic Fourier embeddings and products).

[F4]

Under Countable Choice, for d≤3, integers m≥s0≥4, smooth periodic scalar f,g, and each coordinate j, ∥[Λm,f]∂jg∥L2≤Cd,m,s0(∥f∥Hm∥g∥Hs0+∥f∥Hs0∥g∥Hm) (Tame transport commutator).

[F5]

With a=(γ−1)/2, r=κγρa/a, q=(r,u), and Aj(q)=ujI+ar(e0ejT+eje0T), each Aj is symmetric and linear in q, and qt+∑jAj(q)∂jq=0 is the positive-density polytropic Euler system (Sound-speed variables for polytropic Euler).

[F6]

Countable Choice permits choosing one member from each countable sequence of nonempty sets (The Axiom of Countable Choice (ACω)).

[F7]

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).

[F8]

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).

[F10]

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.

[A1]

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 (ACω)).

Proof

technique · Symmetric Fourier Galerkin approximation, conditional on [F1], [F3], and [F4], followed by positivity and an explicit inverse change of variables
1.1givenF5algebra

For a positive smooth solution of the mass equation, Dtρ=−ρdiv⁡u, where Dt=∂t+u⋅∇. Since r′(ρ)=κγρa−1=c(ρ)/ρ and c(ρ)=ar, the chain rule gives Dtr=−ardiv⁡u. Also ρ−1p′(ρ)∇ρ=c(ρ)2∇ρ/ρ=c(ρ)∇r=ar∇r. Conversely, for r>0, the inverse ρ(r)=(ar/κγ)1/a has ρ′(r)=ρ/(ar); the first symmetric equation therefore gives Dtρ=−ρdiv⁡u, and the second gives Dtu+ρ−1∇p(ρ)=0 using ρ−1∇p=c(ρ)∇r=ar∇r. Thus the two smooth systems are equivalent on the positive-density region.

1.2givenF1F5F7algebra

Put q0=(r(ρ0),u0). For N≥1, let SN be the componentwise orthogonal Fourier projection to ∣k∣∞≤N and solve ∂tqN+SN∑j=1dAj(qN)∂jqN=0, qN(0)=SNq0. Each coefficient of its finite-dimensional vector field is polynomial. On any bounded coefficient box, the identity xn−yn=(x−y)∑i=0n−1xn−1−iyi, 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.

1.3givenF2F3F4F5F6A1algebra

The analytic suppliers [F2]–[F4] apply under the standing Countable Choice assumption [F6, A1]. For integer m≥s, put Q=ΛmqN with Λ the multiplier (1+∣k∣2)1/2. Pair the projected equation with Q. Since SN is self-adjoint and commutes with Λ, the projection disappears in the inner product. For each j, expand Λm(Aj(qN)∂jqN)=Aj(qN)∂jQ+[Λm,Aj(qN)]∂jqN. Symmetry and periodic integration by parts give ∫QTAj(qN)∂jQ=−12∫QT(∂jAj(qN))Q, whose absolute value is at most C∥∇qN∥∞∥qN∥Hm2. The embedding in [F3] bounds this by Cm∥qN∥Hs∥qN∥Hm2. Because each Aj is linear in qN, [F4] bounds all commutator terms by the same expression. Thus 12ddt∥qN∥Hm2≤Cm∥qN∥Hs∥qN∥Hm2.

1.4givenF10constructalgebra

Define a canonical extraction E for a bounded real sequence (bn)n≥1. Let B≥1 be the least integer with ∣bn∣≤B for every n, and put I0=[−B,B]. Having defined Iℓ, bisect it into its two closed halves and define Iℓ+1 to be the left half if that half contains bn for infinitely many indices n, and the right half otherwise. At least one half contains infinitely many such indices, so this rule is defined and unique. Set e0=0 and let eℓ be the least n>eℓ−1 with bn∈Iℓ. These minima exist because the corresponding index sets are infinite. Then E(b)(ℓ)=eℓ is strictly increasing and (beℓ) is Cauchy: for p,q≥ℓ, both values lie in Iℓ, whose length is 2B2−ℓ. 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 E without any choice principle.

2.1givenstep 1.3F2F8F9algebra

At m=s, let YN=∥qN∥Hs. If YN(0)>0, step 1.3 gives YN′≤CsYN2 while YN>0; integrating (1/YN)′≥−Cs yields YN(t)≤2∥q0∥Hs for 0≤t≤T0=(2Cs∥q0∥Hs)−1. If q0=0, the unique finite-dimensional solution is zero and take T0=1. For each m>s, substituting this Hs bound into step 1.3 and multiplying the squared-norm inequality by the corresponding decreasing exponential gives ∥qN(t)∥Hm≤∥q0∥Hme2Cm∥q0∥HsT0. Parseval [F2] bounds the Euclidean coefficient norm by ∥qN∥Hs; since the finite-dimensional state space is RM with M≥1, completeness [F9] supplies the endpoint limit used by the continuation argument [F8]. Thus every finite-dimensional polynomial trajectory continues throughout [0,T0].

2.2givenstep 1.1F5algebra

Let q,v be two smooth solutions of the symmetric system with the same initial data and positive first component. Their difference w=q−v satisfies wt+∑jAj(q)∂jw=−∑j(Aj(q)−Aj(v))∂jv. Pair with w, integrate over the torus, and use symmetry of Aj(q) to integrate the principal term into −12∫wT(∂jAj(q))w. Linearity of Aj bounds the right side by C(∥∇q∥∞+∥∇v∥∞)∥w∥22, so z(t)=∥w(t)∥22 satisfies z′≤C(t)z, with continuous nonnegative C. Multiplying by e−∫0tC(s)ds gives a nonincreasing nonnegative function initially zero, hence w=0. The inverse change of variables then makes the positive-density Euler solution unique.

3.1step 2.1F1F3F5

For every integer m≥s+1, the product estimate [F3] and the bounds in step 2.1 bound ∂tqN=−SN∑jAj(qN)∂jqN uniformly in C([0,T0],Hm−1). Hence each fixed Fourier coefficient is uniformly bounded and equicontinuous in time.

4.1step 3.1step 1.4constructalgebra

Enumerate tuples (k,A,B,j,ϵ) with k∈Zd, integers A≥0, B≥1, gcd⁡(A,B)=1, A/B≤T0, 0≤j≤d, and ϵ∈{0,1} by increasing ∣k∣1+A+B+j+ϵ, then lexicographically within each finite level. At tuple i, let bNi be the real (ϵ=0) or imaginary (ϵ=1) part of the jth component of q^N(k,A/B). Starting with h0(n)=n, define recursively hi=hi−1∘E(bi∘hi−1) and put Nℓ=hℓ(ℓ). The successor in this recursion is a specified function of hi−1, so this is ordinary recursion, not a succession of unspecified dependent selections. Each hi is strictly increasing and its range is contained in every preceding range. Moreover Nℓ+1=hℓ(E(bℓ+1∘hℓ)(ℓ+1))≥hℓ(ℓ+1)>Nℓ. For each fixed i, the tail (Nℓ)ℓ≥i is an increasing subsequence of the range of hi, on which bi 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.

5.1step 3.1step 4.1F10algebra

The equicontinuity from step 3.1 upgrades convergence at rational times to uniform-in-time convergence of each fixed Fourier coefficient. Given ε>0, 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 ε/3; choose the subsequence indices large enough that the finitely many grid values differ by less than ε/3. The triangle inequality makes each coordinate uniformly Cauchy, and scalar completeness supplies its uniform limit.

6.1step 2.1step 5.1F1F2

For every integer m≥s, the Hm+1 bound from step 2.1 and the coefficient weight give ∥(I−SK)qN(t)∥Hm≤K−1∥qN(t)∥Hm+1 for K≥1. This tail tends to zero uniformly in N,t. Combining it with finite-mode convergence from step 5.1 makes the diagonal subsequence Cauchy in C([0,T0],Hm) for every integer m≥s. Completeness of the weighted coefficient space [F1] yields a limit q∈⋂m≥sC([0,T0],Hm) with all these uniform bounds; coefficientwise limits preserve reality and the initial data.

7.1step 6.1F1F3

Since qN→q in CtHm for every m≥s, the algebra estimate [F3] gives Aj(qN)∂jqN→Aj(q)∂jq in CtHm−1. The Fourier cutoffs SN converge strongly to the identity in that space. They converge uniformly on the compact time image of the continuous curve t↦∑jAj(q)∂jq: choose a finite ε-net, use strong convergence at its finitely many points, and use ∥SN∥≤1 for the net errors. Thus the Galerkin right-hand sides converge uniformly in CtHm−1.

8.1step 6.1step 7.1F1F3

Integrate each Galerkin equation from 0 to t. 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 ∥∫GN−∫G∥Hm−1≤T0sup⁡t∥GN(t)−G(t)∥Hm−1. The right-hand-side convergence in step 7.1 and SNq0→q0 therefore let the integrals pass to the limit, giving q(t)=q0−∫0t∑jAj(q(s))∂jq(s) ds. The integrand is continuous in every Hm−1; 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 qt+∑jAj(q)∂jq=0 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.

9.1givenstep 1.1step 2.1step 8.1F3F5algebra

The first component satisfies rt=−u⋅∇r−ardiv⁡u. By [F3], the uniform Hs bound in step 2.1 bounds the right side in L∞ by C∥q0∥Hs2. Hence ∥r(t)−r(0)∥∞≤Ct∥q0∥Hs2. Choose 0<T≤T0 so that this is less than 12min⁡r(0); then r(t,x)≥12min⁡r(0)>0. The smooth inverse ρ=(ar/κγ)1/a and step 1.1 give a smooth positive-density solution of the stated Euler equations. On the compact spacetime cylinder, r stays in a compact subinterval of (0,∞); all derivatives of this inverse power are therefore bounded on the range of r, and the repeated chain rule gives ρ∈CtHm for every m. The choice of T uses only the stated parameters, ∥q0∥Hs, and min⁡r(0).

10.1step 6.1step 8.1step 9.1step 2.2∎

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

Dependency tree · 2 levels

Sources