Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck pending
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 system is a smooth finite-dimensional ODE: local existence, smooth dependence and the continuation criterion

Statement

Assume the Axiom of Countable Choice ACω (The Axiom of Countable Choice (ACω)). Let s≥5 be an integer, let O⊆Rm be open, let Aμ,B be a periodic symmetric hyperbolic coefficient family on O over an open interval I∋0 (Periodic first-order symmetric hyperbolic systems: coefficients, admissible values, data classes and solutions), let u0∈Hs(T2π3;Rm) take values in a compact K⊆O with ∥u0∥Hs≤R, and let PN, XN be the Galerkin projection and space (Fourier modes on the periodic three-torus and the Galerkin projection P_N). Fix N≥0 for which PNu0 takes values in O. Then:

(a) there is an open interval JN∋0 and a C1 map uN:JN→XN such that for all t∈JN PN[A0(t,⋅,uN(t)) ∂tuN(t)+∑i=13Ai(t,⋅,uN(t)) ∂iuN(t)+B(t,⋅,uN(t))]=0in L2, with uN(0)=PNu0;

(b) [continuation criterion] if [0,T∗) is the forward-maximal interval of existence of uN and there are a compact C⊆O and a constant R1≥0 with uN(t) taking values in C and ∥uN(t)∥Hs≤R1 for all t∈[0,T∗), and T∗∈I, then uN does not have T∗ as a finite forward endpoint: the solution extends beyond T∗;

(c) the solution is unique and its local flow depends smoothly on the finite-dimensional coordinates of the initial data.

Facts & Assumptions

Given: Countable Choice, integer s≥5, the coefficient family on O, the data u0 with values in the compact K and ∥u0∥Hs≤R, and N≥0 with admissible PNu0.

[L1]

XN is a finite-dimensional real vector space of dimension dN=m∣ΛN∣, and PN is linear, self-adjoint, idempotent with range XN and commutes with all spatial derivatives (Fourier modes on the periodic three-torus and the Galerkin projection P_N, The Galerkin projection is self-adjoint, commutes with derivatives, is a contraction in every H^r, converges to the identity and has the sharp Fourier-tail bound).

[L2]

Uniform positivity: for every compact C⊆O and every compact time interval I0 with I0⊆I there is a>0 with zTA0(t,x,u)z≥a∣z∣2 for all z∈Rm, (t,x,u)∈I0×T2π3×C (Uniform quadratic-form bounds for positive definite symmetric matrices and smoothness of the inverse clause (c)).

[L3]

Picard--Lindelöf: for G continuous and locally Lipschitz on an open subset of R×Rd, every initial point has a unique local solution; the solution map is smooth when G is smooth (Picard-Lindelöf local existence and uniqueness for first-order systems, Smooth dependence of ODE solutions on parameters, Ck Euclidean maps and diffeomorphisms).

[L4]

The coefficient evaluations t↦Aμ(t,⋅,π(z)) and B(t,⋅,π(z)) are smooth functions of (t,z) for z in the open set V:={z:π(z) takes values in O}, and the map z↦PN[F(⋅,π(z))v] is smooth for fixed smooth F and v∈XN, because all maps involved act between finite-dimensional spaces and PN is linear (Smooth composition, difference, coefficient product and commutator estimates on bounded H^s data, Ck Euclidean maps and diffeomorphisms).

Proof

technique · direct
1.1L1L2L4algebra

(The finite-dimensional form of the Galerkin system.) Fix a basis of XN and let π:RdN→XN be the coordinate isomorphism. Define V:={z∈RdN:π(z)(x)∈O ∀x}, an open set containing the coordinates of PNu0, and for z∈V and v∈XN define M(t,z)v:=PN[A0(t,⋅,π(z)) v]. For v≠0, self-adjointness [L1] gives ⟨v,M(t,z)v⟩L2=∫vTA0(t,⋅,π(z))v dμ≥az∥v∥22 with az>0 by [L2] applied to a compact set containing the values of π(z); on compact subsets of V the bound is uniform, so M(t,z) is invertible with smooth inverse there by Uniform quadratic-form bounds for positive definite symmetric matrices and smoothness of the inverse clause (d). Define G(t,z):=π−1 ⁣(M(t,z)−1(−PN[∑iAi(t,⋅,π(z))∂iπ(z)+B(t,⋅,π(z))])), which is smooth in (t,z) on I×V by [L4] and the smoothness of the inverse; then uN(t)=π(z(t)) solves the Galerkin system iff z′(t)=G(t,z(t)), and z(0) is the coordinate of PNu0.

2.1step 1.1L3

(Local existence and smooth dependence (a), (c).) Since G is continuous and locally Lipschitz on the open set I×V and the initial point lies in it, Picard--Lindelöf [L3] gives a unique local solution through the initial point, defined on an open interval JN∋0; smoothness of G and the smooth-dependence theorem [L3] give the smooth finite-dimensional flow, hence (c), and (a) follows by transporting through π.

3.1step 1.1step 2.1L3L5algebra∎

(Continuation within the coefficient time domain.) Suppose T∗∈I is finite and the stated value and norm bounds hold. The coordinate set Q of fields in XN whose values lie in compact C⊆O and whose Hs norms are at most R1 is closed and bounded in a finite-dimensional space, hence compact, and it lies inside V. Choose δ>0 with [T∗−δ,T∗+δ]⊆I. The smooth field G is bounded by some L on this compact time interval times Q. Thus for T∗−δ<t<t′<T∗ the equation and the ordinary fundamental theorem of calculus give ∣z(t′)−z(t)∣≤L∣t′−t∣. The coordinate curve has a limit z∗∈Q as t↑T∗, by completeness of Euclidean space and closedness of Q. Extend it to z(T∗)=z∗. Continuity of G gives G(t,z(t))→G(T∗,z∗), so its integral identity extends to T∗ and the extended curve is C1 there from the left. Picard--Lindelöf [L3] at the interior point (T∗,z∗) supplies a local solution on both sides of T∗. The original curve and this local solution agree on their overlap by uniqueness, hence glue to a solution beyond T∗. This contradicts maximality and proves (b). The backward criterion follows by reversing time.

Depends on

Dependency tree · 2 levels

Sources