Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

The Galerkin coefficient system: finite-dimensional invariance, local Lipschitz property, and the unique maximal approximation on the torus

Statement

Assume the Axiom of Countable Choice ACω (The Axiom of Countable Choice (ACω)), used through the Fourier-coefficient suppliers. Fix N≥1, a real viscosity parameter ν≥0 and a real exponent s>3/2. Work in the notation of Periodic vector Sobolev spaces on the three-torus, the weight family, and the Leray projection: Hs=Hs(T3;R3) with coefficients u^(k), weights wk, Leray projection P, differential operators ∂j,Δ and divergence-free subspace Hσs.

Definitions. For a coefficient family c let (PNc)(k):=c(k) if ∣k∣∞≤N and (PNc)(k):=0 otherwise (\emph{Fourier truncation}); let XN:={ u∈H0:u^(k)=0 for ∣k∣∞>N, k⋅u^(k)=0 ∀k, u^(−k)=u^(k)‾ ∀k } be the space of real divergence-free trigonometric-polynomial fields of frequency at most N, and define the Galerkin field FN:XN⟶H0,FN(u):=−PNP((u⋅∇)u)+νΔu.

Then:

  1. XN is a finite-dimensional real-linear subspace of Hs for every s∈R, PN restricted to the real divergence-free subspace Hσs is the orthogonal projection onto XN for the Hs inner product and ∥PNu∥Hs≤∥u∥Hs; moreover FN maps XN into XN, and ∫T3FN(u) dx=0 and FN(PNu)=FN(u) for u∈XN.
  2. Local Lipschitz property. For every R>0 there is LN(R)<+∞ such that ∥FN(u)−FN(v)∥Hs≤LN(R)∥u−v∥Hs whenever u,v∈XN with ∥u∥Hs,∥v∥Hs≤R; the proof exhibits LN(R)=12π2νN2+6CscNR with cN=(1+12π2N2)1/2 and Cs the product constant of Discrete Young inequality, the Sobolev product bound, and the transport product bound on the torus.
  3. Galerkin IVP. For every u0∈XN the initial value problem u′(t)=FN(u(t)),u(0)=u0 has a unique maximal solution uN:I→XN with open interval I∋0; if the maximal interval has finite right endpoint Tmax⁡<+∞, then lim⁡t↑Tmax⁡∥uN(t)∥Hs′=+∞ for every s′>3/2, and conversely if ∥uN∥Hs′≤R on [0,T) for some s′>3/2 with T<+∞ then the solution extends past T. For u0∈Hσ0 arbitrary, PNu0∈XN and the corresponding solution is written uN(⋅;PNu0).
  4. Basic bounds. Along the maximal solution: (a) for every real m>3/2, ∥uN′(t)∥Hm≤ν∥uN(t)∥Hm+2+3Cm∥uN(t)∥Hm+12, where Cm is the product constant of Discrete Young inequality, the Sobolev product bound, and the transport product bound on the torus at order m; (b) for every real 0≤m≤2, with cN=(1+12π2N2)1/2 and eN=(1+48π2N2)1/2, ∥uN′(t)∥Hm≤12π2νN2∥uN(t)∥Hm+3CscNeN2∥uN(t)∥Hs2; (c) ∥PNu−u∥Hr≤(2π(N+1))−1∥u∥Hr+1 for every real r and every u∈Hr+1.

Facts & Assumptions

Given: The finite support ∣k∣∞≤N, the weight family with wk≥max⁡(1,2π∣k∣∞,2π∣k∣j), and the operators of Periodic vector Sobolev spaces on the three-torus, the weight family, and the Leray projection.

[F1]

For a finitely supported family with ∣k∣∞≤N one has ∥u∥Hr+1≤cN∥u∥Hr for every real r, and ∥Δu∥Hr≤12π2N2∥u∥Hr, because wk≤cN:=(1+12π2N2)1/2 and ∣2πk∣22≤12π2N2 on the support, where ∣k∣22≤3N2 (Periodic vector Sobolev spaces on the three-torus, the weight family, and the Leray projection).

[F2]

For σ>3/2 the product bounds ∥fg∥Hσ≤Cσ∥f∥Hσ∥g∥Hσ and ∥(f⋅∇)g∥Hσ≤3Cσ∥f∥Hσ∥g∥Hσ+1 hold with Cσ=2σWσ (Discrete Young inequality, the Sobolev product bound, and the transport product bound on the torus, claims 2 and 3); Cs denotes this constant at order s.

[F3]

P is an orthogonal projection (self-adjoint, idempotent, norm nonincreasing) in every Hs; P commutes with Δ and ∂j; P∇f=0; and div⁡(Pu)=0 (Periodic vector Sobolev spaces on the three-torus, the weight family, and the Leray projection).

[F4]

A locally Lipschitz field on an open subset of Rn has a unique local solution through every initial point (Picard-Lindelöf local existence and uniqueness for first-order systems), and every initial value problem satisfying the Picard-Lindelof hypotheses has a unique maximal solution whose domain is an open interval containing the initial time (Every Picard–Lindelöf initial value problem has one maximal solution on an open interval, Extensions, maximal solutions, maximal intervals, and global solutions).

[F5]

Let v0,…,vM−1 be an ordered basis (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis) of the finite-dimensional real vector space XN and T(a):=∑i<Maivi. Then T is a topological isomorphism onto its span (A chosen algebraic basis identifies a finite-dimensional normed space with a coordinate space), so there are constants 0<b≤B<+∞ with b∥a∥1≤∥T(a)∥Hs≤B∥a∥1 for every a∈RM; the same holds with ∥⋅∥Hs′ in place of ∥⋅∥Hs for every real s′, with constants b′,B′ depending on s′. Moreover ∥a∥2≤∥a∥1≤M∥a∥2 for every a∈RM (The Cauchy-Schwarz inequality for finite sums).

[F6]

For a trigonometric polynomial W on T3 one has ∫T3div⁡W dx=0; for divergence-free u, the i-th component satisfies ∑j=13uj∂jui=∑j=13∂j(ujui), by the product rule and ∑j∂juj=0; each scalar derivative has zero coefficient at k=0 (Periodic vector Sobolev spaces on the three-torus, the weight family, and the Leray projection, The Fourier basis and Parseval's identity on the finite torus).

[F7]

∥PNu−u∥Hr≤(2π(N+1))−1∥u∥Hr+1 for u∈Hr+1: the tail sum over ∣k∣∞>N is bounded by (2π(N+1))−2 times the Hr+1-weighted sum (Lattice ball and shell counts and weight sums on the frequency lattice, claim 5).

[F8]

If v∈H0 has Fourier support in ∣k∣∞≤2N and 0≤m≤2 then ∥v∥Hm≤eNm∥v∥H0≤eN2∥v∥H0 with eN:=(1+48π2N2)1/2, because wk≤eN on that support and wk≥1 (Periodic vector Sobolev spaces on the three-torus, the weight family, and the Leray projection).

Proof

technique · direct; the finite-dimensional coefficient space carries a polynomial vector field, so Picard-Lindelof supplies the maximal solution, while the invariance and Lipschitz bounds are explicit finite-sum estimates

Given: N≥1, ν≥0, the space XN, the field FN and the facts [F1]-[F8].

1.1givenF1

XN is a real-linear subspace of the coefficient space: the support condition ∣k∣∞≤N and the two linear conditions k⋅u^(k)=0, u^(−k)=u^(k)‾ are preserved by sums and real multiples. It is spanned by P((Re⁡ek)ei) and P((Im⁡ek)ei) for ∣k∣∞≤N and standard coordinate vectors ei∈R3: these are real divergence-free polynomials in XN, and applying P to the ordinary finite Fourier expansion of any u∈XN fixes u. Order this finite spanning list, then process it in order, retaining a vector exactly when it is not in the span of the vectors already retained. Induction gives a linearly independent list spanning all processed vectors, hence an ordered basis after the final vector. Thus XN is finite-dimensional, and it is contained in Hs for every s because only finitely many coefficients are nonzero. The truncation PN is the orthogonal projection onto the support condition: it commutes with the weights wk2s, is idempotent and self-adjoint, and ∥PNu∥Hs≤∥u∥Hs.

2.1step 1.1F3F6

FN maps XN into XN: for u∈XN, the field (u⋅∇)u is a trigonometric polynomial with support in ∣k∣∞≤2N (a finite convolution of supports), and P, PN and Δ preserve finite support, reality and the divergence-free condition (for P by [F3], for PN and Δ coefficientwise), so FN(u)∈XN. Moreover FN(u)^(0)=−P((u⋅∇)u)^(0)+νΔu^(0) and Δu^(0)=−4π2⋅0⋅u^(0)=0, while each component of (u⋅∇)u is a sum of scalar derivatives by [F6], each with zero coefficient at 0; hence ∫FN(u) dx=0. Finally PN is the identity on XN, so FN(PNu)=FN(u) for u∈XN.

3.1step 2.1F1F2F3

Local Lipschitz bound. For u,v∈XN put h:=u−v. Then FN(u)−FN(v)=−PNP((u⋅∇)h+(h⋅∇)v)+νΔh. By [F1], ∥Δh∥Hs≤12π2N2∥h∥Hs and ∥h∥Hs+1≤cN∥h∥Hs; by [F2], ∥(u⋅∇)h∥Hs≤3Cs∥u∥Hs∥h∥Hs+1≤3CscN∥u∥Hs∥h∥Hs and likewise ∥(h⋅∇)v∥Hs≤3CscN∥v∥Hs∥h∥Hs. Since P and PN are norm nonincreasing [F3], ∥FN(u)−FN(v)∥Hs≤(12π2νN2+3CscN(∥u∥Hs+∥v∥Hs))∥h∥Hs, which is at most LN(R)∥u−v∥Hs with LN(R):=12π2νN2+6CscNR whenever ∥u∥Hs,∥v∥Hs≤R.

3.2step 2.1F1F8F2F3F7

Derivative bounds. Part (a): for m>3/2, by [F2] and [F3], ∥FN(u)∥Hm≤ν∥Δu∥Hm+∥(u⋅∇)u∥Hm≤ν∥u∥Hm+2+3Cm∥u∥Hm∥u∥Hm+1≤ν∥u∥Hm+2+3Cm∥u∥Hm+12. Part (b): let 0≤m≤2 and v:=(u⋅∇)u, a trigonometric polynomial with support in ∣k∣∞≤2N (step 2.1); by [F8], ∥PNPv∥Hm≤∥v∥Hm≤eN2∥v∥H0, and by [F2] with [F1], ∥v∥H0≤∥v∥Hs≤3Cs∥u∥Hs∥u∥Hs+1≤3CscN∥u∥Hs2; since ∥Δu∥Hm≤12π2N2∥u∥Hm by [F1], adding the two terms gives (b). Part (c) is [F7]. This is claim 4.

4.1step 3.1F4F5

The maximal solution. Fix an ordered basis v0,…,vM−1 of XN (M:=dim⁡RXN) and put T(a):=∑i<Maivi, so that T−1:XN→RM is well defined. Let G:=T−1∘FN∘T:RM→RM. For ∥a∥2,∥a′∥2≤ρ put R:=BMρ, so that ∥T(a)∥Hs,∥T(a′)∥Hs≤R by [F5], and step 3.1 gives ∥G(a)−G(a′)∥2≤∥G(a)−G(a′)∥1≤b−1∥FN(Ta)−FN(Ta′)∥Hs≤b−1LN(R)∥T(a−a′)∥Hs≤b−1BLN(R)∥a−a′∥1≤b−1BLN(R)M∥a−a′∥2, using [F5]. Hence G is locally Lipschitz, and [F4] gives a unique maximal solution x:I→RM of x′=G(x), x(0)=T−1(u0), with I an open interval containing 0; uN:=T∘x is the unique maximal solution of the XN-valued initial value problem u′=FN(u), u(0)=u0, and every other solution is a restriction of it.

5.1step 3.1step 4.1F4F5

Blow-up alternative. Let Tmax⁡<+∞ be the right endpoint of I. If the asserted norm divergence fails, there are R<∞ and times tj↑Tmax⁡ with ∥uN(tj)∥Hs≤R; then x(tj)=T−1uN(tj) satisfies ∥x(tj)∥1≤b−1R, so the points x(tj) lie in the Euclidean ball of radius ρ:=b−1R and, by step 4.1, G is bounded by some M0<+∞ and Lipschitz with constant K:=b−1BLN(BM(ρ+1))M on the ball of radius ρ+1. The quantitative Picard-Lindelof theorem [F4] applied to G on that ball therefore gives one fixed η>0, depending only on ρ,K,M0 (hence only on R,N,ν), such that every initial value problem for G with datum in the ball of radius ρ has a solution on an interval of length 2η; restarting at tj>Tmax⁡−η extends x, hence uN, beyond Tmax⁡, contradicting maximality. Hence ∥uN(t)∥Hs→+∞ as t↑Tmax⁡; for any other exponent s′>3/2 the norms ∥⋅∥Hs and ∥⋅∥Hs′ are equivalent on the finite-dimensional space XN by [F5], so ∥uN(t)∥Hs′ diverges as well. Conversely, if ∥uN(t)∥Hs′≤R on [0,T), T<+∞, for some s′>3/2, then [F5] transfers the bound to the exponent s and the same restarting argument extends the solution past T.

6.1step 1.1step 2.1step 3.1step 4.1step 5.1step 3.2∎

Claims 1-4 are established by steps 1.1, 2.1, 3.1, 4.1, 5.1 and 3.2; the identity PNu0∈XN for u0∈Hσ0 holds by definition of XN and [F3].

Remarks

  • The ordered basis of step 4.1 is a bookkeeping device for the finite-dimensional ODE theory; the estimates use only the two-sided bound of [F5] and, for the blow-up alternative, the equivalence of the norms ∥⋅∥Hs on the finite-dimensional space XN.
  • The blow-up alternative is stated for the Hs norm with s>3/2 because that is the norm in which the restarting argument is quantitative; the local Lipschitz bound is proved in the same norm.

Depends on

Dependency tree · 2 levels

Sources