Alphabeta Math
TheoremStatement: AI-adaptedProof: 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 periodic Euler and Navier–Stokes

Statement

Assume the Axiom of Countable Choice. Let d∈{1,2,3}, let s≥4 be an integer, let ν≥0, and let u0:Td→Rd be smooth, real, and divergence-free, where Td=(R/2πZ)d has normalized Lebesgue measure and divergence-free means ∑j=1d∂j(u0)j=0. For a smooth periodic f, set f^(k)=(2π)−d∫[0,2π]df(x)e−ik⋅x dx, wk=(1+∣k∣2)1/2, and ∥f∥Hm2=∑k∈Zdwk2m∣f^(k)∣2. Define the Leray multiplier by P0=I and Pk=I−kkT/∣k∣2 for k≠0. Then there is T>0, depending only on d, s, and ∥u0∥Hs and independent of ν and all higher Sobolev norms of u0, and a unique smooth real field u:[0,T]×Td→Rd satisfying u(0,⋅)=u0,∂tu+P((u⋅∇)u)=νΔu,div⁡u=0. The same time T works for every integer Sobolev order m≥s, and sup⁡0≤t≤T∥u(t)∥Hm<∞ for each such m. There is a unique smooth mean-zero scalar field π for which the equivalent full equation ∂tu+(u⋅∇)u=−∇π+νΔu holds.

Facts & Assumptions

Given: Countable Choice and d,s,ν,u0 as in the Statement; all Fourier and Sobolev conventions are exactly those displayed there.

[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 six FD-S01 suppliers used here; the interfaces below match those actual carriers. The current step1Decision query for each supplier returns ready with a current hash. These are authoring-readiness records 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]

On the unit torus, the Fourier coefficient map is a surjective isometry onto ℓ2(Zd) and Parseval holds; the change of variables x=2πy gives the coefficient and Parseval conventions on this 2π-periodic torus (The Fourier basis and Parseval's identity on the finite torus).

[F3]

The Leray map has P0=I, Pk=I−kkT/∣k∣2 for k≠0, is a real-preserving orthogonal projection bounded on each Hm, and commutes with spatial derivatives; its multiplier formula also gives commutation with Λm (Periodic Leray and pressure maps).

[F4]

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

[F5]

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

[F6]

Picard–Lindelöf: a continuous vector field locally Lipschitz in the state variable has a unique local solution through each point (Picard-Lindelöf local existence and uniqueness for first-order systems).

[F7]

A bounded finite-dimensional polynomial ODE trajectory extends past any finite right endpoint (Continuation of bounded polynomial ODE solutions).

[F8]

Every bounded real sequence has a convergent subsequence (Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence); applying it to finitely many real and imaginary coefficient coordinates uses only finite choice.

[F9]

Under Countable Choice, if s0>d/2+1 and divergence-free u∈Hs0, the mean-zero pressure π=Q(u⊗u) belongs to Hs0 and P(u⋅∇u)=u⋅∇u+∇π in Hs0−1; among mean-zero periodic distributions satisfying this identity it is unique (Pressure recovery for periodic incompressible Sobolev velocity).

[F10]

Under Countable Choice, for already-given smooth divergence-free solutions u,v of the periodic projected incompressible equation with the same ν≥0, ∥u(t)−v(t)∥22≤∥u(0)−v(0)∥22exp⁡(2∫0t∥∇v(τ)∥∞dτ); this is conditional on given solutions and asserts no existence theorem (Difference energy for given smooth incompressible and symmetric solutions).

[A1]

The Axiom of Countable Choice ACω says every countable family of nonempty sets has a choice function. It is retained for the analytic Fourier and Sobolev suppliers [F1]–[F5] and [F9]; the explicit coefficient diagonal below makes no additional selection and uses no dependent choice (The Axiom of Countable Choice (ACω)).

Proof

technique · Fourier Galerkin construction and compact limit using the actual inspected FD-S01 interfaces [F1], [F3]–[F5], [F9], and [F10], whose current authoring-readiness records are recorded in [L1]
1.1givenF1F3F6

Let SN be the orthogonal Fourier cutoff to modes ∣k∣∞≤N, and let XN be its finite-dimensional real divergence-free range. On XN solve ∂tuN+SNP((uN⋅∇)uN)=νΔuN, uN(0)=SNu0. The coefficient vector field is polynomial, hence locally Lipschitz by the finite-monomial estimate in the proof of Continuation of bounded polynomial ODE solutions; [F6] gives a unique local real solution, and its right-hand side preserves XN.

1.2givenF1F2F3F5algebra

Put Λ for the Fourier multiplier wk. Pair the Galerkin equation with Λ2muN; self-adjointness of SN,P, their commutation with Λ, and PuN=SNuN=uN remove the projections. The principal transport term is ∫Td(ΛmuN)⋅(uN⋅∇ΛmuN) dx=12∫uN⋅∇∣ΛmuN∣2 dx=0 by periodicity and div⁡uN=0. The remaining commutator is bounded by [F5], while viscosity contributes −ν∥∇uN∥Hm2, giving 12ddt∥uN∥Hm2+ν∥∇uN∥Hm2≤Cm∥uN∥Hs∥uN∥Hm2.

1.3givenF8constructalgebra

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 [F8] 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.2F6algebra

At m=s, set YN=∥uN∥Hs. When YN>0, the inequality in step 1.2 gives YN′≤CsYN2; if YN(0)=0, uniqueness of the finite-dimensional ODE makes uN≡0. Otherwise, integrating (1/YN)′≥−Cs shows YN(t)≤2∥u0∥Hs for 0≤t≤T, where T=(2Cs∥u0∥Hs)−1. For zero datum take T=1. These bounds do not use ν or higher norms.

3.1step 1.2step 2.1F2F7algebra

For every integer m>s, step 1.2 and step 2.1 give (∥uN∥Hm2)′≤4Cm∥u0∥Hs∥uN∥Hm2. Multiplying by e−4Cm∥u0∥Hst and differentiating proves ∥uN(t)∥Hm≤∥u0∥Hme2Cm∥u0∥HsT on the same interval. Parseval [F2] and the Hs bound control the Euclidean coefficient norm of uN; [F7] therefore extends each finite-dimensional solution through [0,T], even though the constants Cm may depend on m.

4.1step 3.1F3F4

For every integer m≥s+2, the product estimate [F4] and the bounds in step 3.1 give a uniform bound on ∂tuN=−SNP(uN⋅∇uN)+νΔuN in C([0,T],Hm−2). Thus each fixed Fourier coefficient is uniformly bounded and equicontinuous in time.

5.1step 4.1step 1.3A1constructalgebra

Enumerate the tuples (k,j,ε,a,b) with k∈Zd, 1≤j≤d, ε∈{0,1}, integers a≥0,b≥1 with gcd⁡(a,b)=1 and a/b≤T, by increasing height ∑r∣kr∣+a+b and lexicographically within each finite height. Here ε=0,1 specifies the real or imaginary part of component j of u^N(k) at time a/b. Denote the resulting bounded real sequences in N≥1 by b1,b2,…. 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.

6.1step 4.1step 5.1F8algebra

The equicontinuity from step 4.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.

7.1step 6.1step 3.1F1F2

For each integer m≥s, Parseval [F2] and the uniform Hm+1 bound give ∥(I−SK)uN(t)∥Hm≤K−1∥uN(t)∥Hm+1 for K≥1. The right side tends to zero uniformly in N,t as K→∞. Combining this tail estimate with the finite-mode uniform convergence in step 6.1 proves that the diagonal subsequence is Cauchy in C([0,T],Hm) for every integer m≥s. Completeness of the coefficient space [F1] yields a limit u∈⋂m≥sC([0,T],Hm); finite sums show sup⁡t∥u(t)∥Hm≤sup⁡Nsup⁡t∥uN(t)∥Hm, and coefficientwise limits preserve reality, divergence-free constraints, and u(0)=u0.

8.1step 7.1F4

Fix integer m≥s. Product convergence follows from uN→u in CtHm and [F4]: (uN⋅∇)uN−(u⋅∇)u=(uN−u)⋅∇uN+u⋅∇(uN−u)→0 in CtHm−1. Also ΔuN→Δu in CtHm−2.

9.1step 8.1F2F3

The Fourier cutoff converges uniformly on the compact time image of the continuous curve t↦P((u⋅∇)u)(t) in Hm−2: choose a finite ε-net of that image, use strong Fourier-tail convergence at each net point, and use ∥SN∥≤1 to control every point by its net representative. Together with step 8.1 and ∥P∥≤1 from [F3], this gives SNP((uN⋅∇)uN)→P((u⋅∇)u) uniformly in Hm−2.

10.1step 7.1step 8.1step 9.1F1

Each finite-dimensional curve satisfies its integrated ODE. The right-hand sides converge uniformly in Hm−2 by the product-convergence and uniform cutoff-convergence arguments above, and SNu0→u0 by the Fourier tail of the smooth datum. A continuous curve into the complete coefficient Hilbert space has a Riemann integral: uniform continuity makes its Riemann sums Cauchy and completeness gives their limit; the triangle inequality on the sums gives ∥∫0tGN−∫0tG∥Hm−2≤Tsup⁡s∥GN(s)−G(s)∥Hm−2. Passing to the limit therefore yields u(t)=u0+∫0t[−P((u⋅∇)u)+νΔu](s) ds.

11.1step 10.1F1

The integrand in step 10.1 is continuous in Hm−2. For its integral U(t), the difference quotient error satisfies ∥[U(t+h)−U(t)]/h−G(t)∥≤sup⁡s between t and t+h∥G(s)−G(t)∥→0 by continuity. Hence ut=−P((u⋅∇)u)+νΔu in C([0,T],Hm−2). Since m≥s was arbitrary, the equation holds at every spatial Sobolev order covered by the Statement.

12.1step 7.1step 11.1F4

The bounds u∈CtHm for every integer m and the embeddings in [F4] give continuous spatial derivatives of every order. Since step 11.1 holds in Hm−2 for arbitrary m, ut is continuous in every Hr by choosing m≥r+2, so u∈Ct1Hr for every r. If u has j continuous time derivatives in every Sobolev order, differentiating the right side −P((u⋅∇)u)+νΔu j times produces a finite sum of products of spatial derivatives of those time derivatives; [F4] makes each product continuous in every lower Sobolev order. Induction on j therefore gives all mixed derivatives continuously to the endpoints, hence u∈C∞([0,T]×Td).

13.1givenstep 12.1F9algebra

Since d≤3 and s≥4, we have s>d/2+1. The pressure recovery statement [F9] therefore applies to the smooth divergence-free field from step 12.1 and yields the unique mean-zero π=Q(u⊗u) with P(u⋅∇u)=u⋅∇u+∇π. Substitution into the projected equation gives ut+(u⋅∇)u=−∇π+νΔu.

13.2givenF10step 12.1algebra

Let u,v be any two smooth solutions with the same initial datum and viscosity. They satisfy the hypotheses of [F10], so ∥u(t)−v(t)∥22≤0⋅exp⁡(2∫0t∥∇v(s)∥∞ds)=0 for each t∈[0,T]. Thus u=v throughout the interval. This proves uniqueness conditional on the actual smooth-solution difference-energy input.

14.1step 2.1step 3.1step 11.1step 12.1step 13.1step 13.2∎

The construction, regularity, pressure recovery, and uniqueness arguments above establish the claimed smooth solution and same-interval all-order bounds. The existence time was chosen in step 2.1 solely from d, s, and ∥u0∥Hs and was independent of ν and higher norms.

Depends on

Dependency tree · 2 levels

Sources