Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-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.

Skew reduced convection and global finite dynamics

Statement

Assume Countable Choice, meaning every sequence of nonempty sets admits a choice function. Let d∈{1,2,3}, r∈N with r≥1, and Qd=Rd/(2πZ)d with probability measure dμ=(2π)−ddx. In the supplied Fourier-Sobolev convention, H0(Qd;Rd) is the completion of finite real trigonometric polynomials in the norm ∥q∥H02=∑k∈Zd∣q^(k)∣2, with unique L2 representatives and conjugate-symmetric coefficients for real classes. Let v1,…,vr∈H0(Qd;Rd) have smooth 2π-periodic representatives satisfying div⁡vi=0 and ∫Qdvi⋅vj dμ=δij. Fix ν≥0 and a0∈Rr, set ua=∑iaivi, and define

Aij=∫Qd∇vj:∇vi dμ,cijk=∫Qd((vj⋅∇)vk)⋅vi dμ,

where ∇vj:∇vi=∑ℓ,m=1d(∂xmvjℓ)(∂xmviℓ) and ((vj⋅∇)vk)ℓ=∑m=1dvjm∂xmvkℓ. Consider the coefficient initial-value system

ai′(t)+∑j,k=1rcijkaj(t)ak(t)+ν∑j=1rAijaj(t)=0,ai(0)=ai0,i=1,…,r.

There is exactly one solution a∈C1([0,∞),Rr) of this system. For every t≥0, it satisfies

12ddt∣a(t)∣2+ν∫Qd∣∇ua(t)∣2 dμ=0,

∣a(t)∣2+2ν∫0t∫Qd∣∇ua(s)∣2 dμ ds=∣a0∣2.

This is a global result for the specified finite coefficient ODE only; it asserts no convergence to, existence of, or uniqueness for a solution of the infinite-dimensional Navier–Stokes equations. The Countable Choice assumption is inherited from the periodic Fourier-Sobolev framework; the finite-dimensional proof makes no further choice.

Facts & Assumptions

Given: The finite smooth solenoidal orthonormal family, normalized periodic measure, parameter ν≥0, initial vector a0, and the coefficient system in the Statement.

[F1]

Finite solenoidal Galerkin coefficient dynamics: The classes lie in the supplied H0(Qd;Rd) Fourier completion with unique normalized-L2 representatives; the chosen representatives are smooth, periodic, divergence-free, and orthonormal, and the coefficient integrals and ODE are defined from them. The supplier assumes Countable Choice.

[F2]

Picard-Lindelöf local existence and uniqueness for first-order systems: A continuous vector field locally Lipschitz in the state variable on an open ODE domain has a unique local solution through each initial point.

[F3]

Picard-Lindelöf local existence and uniqueness for first-order systems: Any two solutions through the same initial data agree on every common subinterval containing the initial time.

[F4]

R and Rn for n≥1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in R: For every natural number n≥1, the Euclidean metric space Rn is complete. Here r∈N and r≥1, so this applies to Rr.

Proof

1.1givenF1F2algebra

Define F:Rr→Rr by Fi(a)=−∑j,kcijkajak−ν∑jAijaj, and lift it to the time-state map F~:R×Rr→Rr, F~(t,a)=F(a), on the open domain D=R×Rr. This lift is continuous. For any compact time-state cylinder K⊂D, its state projection lies in a closed ball B‾R; since F is polynomial, sup⁡a∈B‾R∥DF(a)∥op<∞. The mean-value estimate along line segments in B‾R therefore gives one state-Lipschitz constant for all (t,a),(t,b)∈K with the same t; the constant is independent of t because F~ does not depend on time. Thus F~ is locally Lipschitz in the state variable, locally uniformly in time, and [F2] applies on D.

2.1givenF2F3step 1.1construct

Consider all solutions through (0,a0) on open intervals containing 0. This collection is nonempty by [F2]. Any two such solutions agree on the intersection of their intervals by [F3]; hence their interval union I is an open interval and their common values define one solution a:I→Rr. Every solution through the same data is a restriction of this union solution.

2.2givenF1step 1.1assume-contraalgebra

For each i,j,k, periodic integration by parts and div⁡vj=0 give cijk+ckji=∫Qdvj⋅∇(vk⋅vi) dμ=∫Qddiv⁡(vj(vk⋅vi)) dμ=0, since opposite faces of a periodic cell cancel. Thus ckji=−cijk; the finite contraction S=∑i,j,kcijkaiajak satisfies S=−S after swapping i and k, so S=0. Also ∑i,jAijaiaj=∫Qd∣∇ua∣2 dμ. Multiplying the coefficient equations by ai, summing over i, and using ddt12∣a∣2=∑iaiai′ proves the energy identity on I. Suppose for contradiction that the positive endpoint β:=sup⁡(I∩(0,∞)) is finite.

3.1givenstep 2.2algebra

Integrating the identity from 0 to any t∈I∩[0,∞) gives ∣a(t)∣2+2ν∫0t∫Qd∣∇ua(s)∣2 dμ ds=∣a0∣2. Because ν≥0, this implies ∣a(t)∣≤R:=∣a0∣ for every 0≤t<β.

4.1givenF4step 1.1step 3.1algebra

On ∣a∣≤R, each component of F obeys ∣Fi(a)∣≤R2∑j,k∣cijk∣+νR∑j∣Aij∣, so ∣F(a)∣≤M for the finite constant M=(∑i(R2∑j,k∣cijk∣+νR∑j∣Aij∣)2)1/2. Therefore ∣a(t)−a(s)∣≤M∣t−s∣ for 0≤s<t<β by integrating a′=F(a). Set tn=β(1−1/(n+2)) for n∈N; then tn↑β and (a(tn)) is Cauchy by this bound, so [F4] gives a limit a∗∈Rr. For tn≤t<β, the same bound gives ∣a(t)−a∗∣≤M(β−tn)+∣a(tn)−a∗∣→0 as n→∞, so a(t)→a∗ as t↑β.

5.1F2step 2.1step 4.1discharge-contradiction∎

Extend a continuously by a(β)=a∗. For h<0 sufficiently close to zero, the quotient (a(β+h)−a∗)/h=∣h∣−1∫β+hβF~(s,a(s)) ds tends to F~(β,a∗) as h↑0. Applying [F2] to the same lift F~ at (β,a∗) gives a local solution b on an interval around β with b(β)=a∗ and b′(t)=F~(t,b(t)). Define the joined curve to equal a before β and b at and after β. Its values and one-sided derivatives match at β, and continuity of F~ makes its derivative continuous there, so it is a solution on a strictly larger open interval. This contradicts the construction of I as the union of all solution intervals. Hence β=∞, and uniqueness follows from the overlap agreement in step 2.1.

Depends on

Dependency tree · 2 levels

Sources