Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableprecheck 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.

Fourier modes on the periodic three-torus and the Galerkin projection P_N

Definition

Assume the Axiom of Countable Choice ACω (The Axiom of Countable Choice (ACω)). Let T2π3, μ, χk and the spaces Hs(T2π3;Rm) be as in The 2 pi-periodic three-torus, its normalized measure, test functions and the Sobolev spaces H^s (m≥1).

(a) Mode sets. For N≥0 put ΛN:={k∈Z3:∣k∣≤N} with ∣k∣ the Euclidean norm, and XN:={∑k∈ΛNakχk: ak∈Cm, a−k=ak‾}⊆C∞(T2π3;Rm), the Galerkin space of modes up to N; it is a finite-dimensional real vector space of dimension dN:=m ∣ΛN∣, and XN⊆XN′ for N≤N′. (The reality condition a−k=ak‾ is exactly the condition that the trigonometric polynomial be real-valued.)

(b) Projection. For u∈L2(T2π3;Rm) define PNu:=∑k∈ΛNu^(k)χk,(PNu)(x)=∑k∈ΛNu^(k)χk(x), with u^(k) the Fourier coefficients of clause (c) of The 2 pi-periodic three-torus, its normalized measure, test functions and the Sobolev spaces H^s; the second expression is a finite sum, so PNu∈XN; and PN:XN→XN is the identity. PN is called the Galerkin (Fourier) projection.

The definition fixes the projection only. Its self-adjointness, derivative-commutation and operator-norm properties are proved in 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.

Depends on

Dependency tree · 2 levels

Sources