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.

Uniform time-derivative bounds for Galerkin solutions in every H^j, j at most s minus one

Statement

Assume the Axiom of Countable Choice ACω (The Axiom of Countable Choice (ACω)). Let s≥5 be an integer, fix a compact interval I0 inside the coefficient time domain, and assume J⊆I0. Let Aμ,B be a periodic symmetric hyperbolic coefficient family on the open set O⊆Rm (Periodic first-order symmetric hyperbolic systems: coefficients, admissible values, data classes and solutions), let K⊆O be compact and R≥0, and let uN:J→XN be a Galerkin solution of The Galerkin system is a smooth finite-dimensional ODE: local existence, smooth dependence and the continuation criterion for some N≥0. Suppose that uN(t) takes values in K and satisfies ∥uN(t)∥Hs≤R for every t∈J. Then there is C=C(Aμ,B,K,R,s,I0) such that for every integer 0≤j≤s−1 and every t∈J ∥∂tuN(t)∥Hj≤C (1+∥uN(t)∥Hs).

Facts & Assumptions

Given: Countable Choice, integer s≥5, the coefficient family on O, the compact K, the bound R, a Galerkin solution uN on J with values in K and ∥uN∥Hs≤R.

[L2]

The Galerkin solution satisfies, at every t∈J, PN[A0(t,⋅,uN)∂tuN+Ai(t,⋅,uN)∂iuN+B(t,⋅,uN)]=0 in L2, ∂tuN(t)∈XN, and uN∈C1(J;XN) (The Galerkin system is a smooth finite-dimensional ODE: local existence, smooth dependence and the continuation criterion, Periodic first-order symmetric hyperbolic systems: coefficients, admissible values, data classes and solutions).

[L3]

Uniform positivity of A0 on the coefficient set: there is a>0 with zTA0(t,x,u)z≥a∣z∣2 for all (t,x,u)∈J×T2π3×K (Uniform quadratic-form bounds for positive definite symmetric matrices and smoothness of the inverse clause (c)).

[L4]

Composition, product and commutator estimates: for the stated coefficient maps and the bound ∥uN∥Hs≤R and values in K, ∥F(t,⋅,uN)w∥Hj≤CR∥w∥Hj for 0≤j≤s−1, and ∥[Dα,A(t,⋅,uN)]w∥2≤CR∥w∥H∣α∣−1 for 1≤∣α∣≤s−1 (Smooth composition, difference, coefficient product and commutator estimates on bounded H^s data clauses (c),(d)); and composition into Hj is bounded by CR(1+∥uN∥Hs) for 0≤j≤s (clause (a)).

[L5]

Multi-index Leibniz expansion Dα(Fw)=∑β≤α(αβ)Dα−βF Dβw and the fact that DαuN∈XN for uN∈XN (Ck maps and multi-index derivative notation in Euclidean space, 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 clause (b)).

Proof

technique · direct
1.1L1L2L3L4algebra

(Order zero.) Pair the Galerkin equation [L2] with ∂tuN: since ∂tuN∈XN, self-adjointness [L1] gives ∫(∂tuN)TPN[A0∂tuN]=∫(∂tuN)TA0∂tuN≥a∥∂tuN∥22 by [L3]; the right-hand side is −∫(∂tuN)TPN[Ai∂iuN+B]≤∥∂tuN∥2∥Ai∂iuN+B∥2, and ∥Ai∂iuN+B∥L2≤CR(1+∥uN∥Hs) by [L4] (the composition Ai(t,⋅,uN) lies in Hs⊆C0, so its sup norm is at most CR, and ∥∂iuN∥2≤∥uN∥Hs; the term B is similar). Hence a∥∂tuN∥2≤CR(1+∥uN∥Hs).

2.1step 1.1L1L2L3L4L5algebra

(Induction on the order: the estimate at order j.) Fix an integer j with 1≤j≤s−1 and suppose the bound holds for all orders below j; fix ∣α∣=j. Applying PNDα to the Galerkin equation [L2] (legitimate by commutation [L1]) and pairing with Dα∂tuN∈XN gives, after moving the leading term and using self-adjointness [L1], a∥Dα∂tuN∥2≤∥[Dα,A0(t,⋅,uN)]∂tuN∥2+∥Dα(Ai(t,⋅,uN)∂iuN+B(t,⋅,uN))∥2: indeed Dα(A0∂tuN)=A0Dα∂tuN+[Dα,A0]∂tuN by [L5], and the pairing of PNDα(A0∂tuN) with Dα∂tuN removes PN. The first term is at most CR∥∂tuN∥Hj−1 by [L4], hence at most CR′(1+∥uN∥Hs) by the induction hypothesis; the second is at most CR(1+∥uN∥Hs) by [L4] applied to the compositions Ai(t,⋅,uN) and the product bound, since ∥∂iuN∥Hj≤∥uN∥Hs. Summing over the finitely many ∣α∣≤j gives the estimate at order j.

3.1step 1.1step 2.1discharge-induction∎

(Conclusion.) The induction of step 2.1, starting from step 1.1, gives the stated bound for every 0≤j≤s−1 after enlarging the constant to be independent of j.

Remarks

Depends on

Dependency tree · 2 levels

Sources