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

Statement

Assume the Axiom of Countable Choice ACω (The Axiom of Countable Choice (ACω)). Let m≥1, N≥0, and let PN be the Galerkin projection and XN the Galerkin space of Fourier modes on the periodic three-torus and the Galerkin projection P_N on T2π3. Then:

(a) PN is linear on L2(T2π3;Rm), self-adjoint (⟨PNu,v⟩2=⟨u,PNv⟩2 for all u,v∈L2) and idempotent (PN2=PN), with range XN and kernel the classes with vanishing coefficients on ΛN;

(b) for every integer s≥0, every multi-index α with ∣α∣≤s and every u∈Hs, PNDαu=DαPNu;

(c) for every integer r≥0 and every u∈Hr, ∥PNu∥Hr≤∥u∥Hr;

(d) for every integer r≥0 and every u∈Hr, PNu→u in Hr as N→∞;

(e) for every integer s≥1, every u∈Hs and every N≥0, ∥u−PNu∥Hs−1≤Cs (1+N2)−1/2 ∥u∥Hs with Cs depending only on s.

Facts & Assumptions

Given: Countable Choice, m≥1, N≥0, and the torus, characters, Fourier coefficients, projection PN and spaces Hr of The 2 pi-periodic three-torus, its normalized measure, test functions and the Sobolev spaces H^s and Fourier modes on the periodic three-torus and the Galerkin projection P_N.

[L1]

Orthonormal basis and pairing: for f,g∈L2 the coefficient map is a surjective isometry and ⟨f,g⟩2=∑kf^(k)⋅g^(k)‾ with absolute convergence; the characters are real-paired through the reality condition u^(−k)=u^(k)‾ for real-valued u.

[L2]

Differentiation and norm equivalence: for u∈Hr and ∣α∣≤r, Dαu^(k)=(ik)αu^(k), and ∥u∥Hr2=∑kqkr∣u^(k)∣2 with qkr:=∑∣α∣≤r∣kα∣2 satisfying 4−r(1+∣k∣2)r≤qkr≤(r+1)3(1+∣k∣2)r (Periodic Fourier differentiation identity and equivalence of the derivative and Fourier-weight Sobolev norms).

[L3]

ΛN is finite and symmetric under k↦−k (Fourier modes on the periodic three-torus and the Galerkin projection P_N).

Proof

technique · direct
1.1L1L3algebra

(Algebraic properties (a).) Linearity is immediate since coefficients are linear in u. For the pairing, [L1] and the finiteness of ΛN give ⟨PNu,v⟩2=∑k∈ΛNu^(k)⋅v^(k)‾ and ⟨u,PNv⟩2=∑l∈ΛNu^(l)⋅v^(l)‾ after reindexing l↦−l and using [L3]; the two sums are equal. Since the coefficients in ΛN are unchanged, PN2=PN; the kernel and range descriptions are read off from the coefficient isometry.

1.2L1L2algebra

(Derivative commutation (b).) For ∣α∣≤s and u∈Hs, both Dαu∈Hs−∣α∣⊆L2 and PNu∈XN are defined; by [L2] the Fourier coefficient of PNDαu at k is (ik)αu^(k) for k∈ΛN and 0 otherwise, and that of DαPNu is (ik)αu^(k) for k∈ΛN and 0 otherwise, since PNu is a finite trigonometric polynomial whose derivatives have the stated coefficients. Equality of coefficients gives (b).

1.3L2L3algebra

(Contraction (c) and convergence (d).) For u∈Hr, [L2] and the definition of PN give ∥PNu∥Hr2=∑k∈ΛNqkr∣u^(k)∣2≤∑kqkr∣u^(k)∣2=∥u∥Hr2, which is (c). Similarly ∥u−PNu∥Hr2=∑k∉ΛNqkr∣u^(k)∣2 is the tail of the convergent series ∑kqkr∣u^(k)∣2, hence tends to 0 as N→∞ with ΛN increasing to Z3; this is (d).

2.1L2algebra∎

(Tail bound (e).) For ∣k∣>N and ∣α∣≤s−1, ∣kα∣2≤(1+∣k∣2)s−1, so qks−1≤(s+1)3(1+∣k∣2)s−1≤(s+1)32(1+N2)−1(1+∣k∣2)s because (1+∣k∣2)≥1+N2; hence ∥u−PNu∥Hs−12≤2(s+1)3(1+N2)−1∑k(1+∣k∣2)s∣u^(k)∣2≤Cs2(1+N2)−1∥u∥Hs2 by the norm equivalence [L2]. Taking square roots gives (e). The decay rate is sharp up to constants: for integers n≥2 take N=n−1 and the real polynomial u(x)=cos⁡(nx1), whose modes ±(n,0,0) lie outside ΛN. By [L2], ∥u−PNu∥Hs−12/∥u∥Hs2=(∑a=0s−1n2a)/(∑a=0sn2a)≥1/((s+1)n2). Hence no bound uniform in u can replace (1+N2)−1/2 by a sequence o(N−1). This is the rate sharpness in the title; no optimal constant is asserted.

Depends on

Dependency tree · 2 levels

Sources