Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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 series converge in mean square

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). For every fL2(T;C) and every real ε>0 there is NN with

fkNf^(k)ek2<ε.

Thus the symmetric partial sums of the Fourier series converge to f in the L2 norm, and the finite-subset net of Fourier partial sums converges to f as well. This is norm convergence only: no pointwise or uniform assertion is made, and no ordering of Z other than the symmetric one is required.

Facts & Assumptions

[A1]

The characters form an orthonormal basis of L2(T;C), and for a complete orthonormal family x is the norm limit of the finite-subset net of the partial sums iFx,eiei (The trigonometric system is complete in L2 of the torus, Fourier expansion in a Hilbert space).

[A2]

The Fourier coefficient satisfies f^(k)=f,ek, so the partial sums displayed above are exactly the values kFf,ekek of the net at the symmetric index sets F=[N,N] (Fourier coefficients and trigonometric polynomials on the torus, The trigonometric characters are orthonormal in L2 of the torus).

[A3]

For every finite FZ there is NN with F{k:kN}. If F=, take N=0; otherwise the nonempty finite set {k:kF} has a maximum and one may take that maximum (Every nonempty finite set of reals has a maximum and a minimum).

[A4]

If a net in a metric space converges to x then every cofinal sub-net converges to x: given ε>0 the net is eventually in the ball of radius ε around x at some index, and any cofinal sub-net passes beyond that index (Directed preorders and nets, Square-summable families on an arbitrary index set and the space 2(I)).

Proof

technique · direct

Given: Countable Choice and fL2(T;C).

1.1

The finite-subset net (kFf,ekek)F converges to f, by completeness of the character basis and the general Fourier expansion theorem.

A1
2.1

The index sets of the symmetric partial sums, FN:={kZ:kN}, are cofinal in the directed set of finite subsets of Z: every finite F is contained in some FN by [A3]. Hence the sub-net indexed by the FN converges to the same limit f, and its terms are kNf^(k)ek by [A2].

step 1.1A2A3A4
3.1

Therefore for every real ε>0 there is N with fkNf^(k)ek2<ε, which is the mean-square convergence of the Fourier series; the finite-subset net statement is step 1.1.

step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

60 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources