Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Complete orthonormal bases give norm-convergent projections and Parseval

Statement

Let H be a real Hilbert space and let (ek) be a finite or countable orthonormal family whose finite linear span is dense in H. Here orthonormal means ⟨ej,ek⟩H=1 when j=k and 0 otherwise; density means every x∈H is arbitrarily close in norm to a finite linear combination of the ek. For x∈H, define PNx=∑k≤N⟨x,ek⟩Hek, using all basis vectors once N reaches the size of a finite family. Then PNx→x in norm and ∥x∥H2=lim⁡N→∞∑k≤N∣⟨x,ek⟩H∣2.

Facts & Assumptions

Given: The real Hilbert space, orthonormal family, and density hypothesis in the Statement.

[F1]

Pythagoras holds for finite orthogonal sums: if u⊥v, then ∥u+v∥2=∥u∥2+∥v∥2 (Pythagoras and finite orthogonal sums).

Proof

Given: The objects and hypotheses in the Statement.

1.1givenF1algebra

Fix x∈H and N. Orthonormality gives ⟨x−PNx,ej⟩H=0 for each j≤N, so x−PNx is orthogonal to both PNx and every vector in the first-N span. By [F1], ∥x∥H2=∥PNx∥H2+∥x−PNx∥H2,∥PNx∥H2=∑k≤N∣⟨x,ek⟩H∣2. For any y in that span, PNx−y also lies in the span and is orthogonal to x−PNx, hence ∥x−y∥H2=∥x−PNx∥H2+∥PNx−y∥H2≥∥x−PNx∥H2. Thus PNx is a closest vector to x in the first-N span.

2.1givenstep 1.1choosealgebra∎

Let ε>0. By density choose a finite linear combination y of the ek with ∥x−y∥H<ε, and choose N at least as large as every index used in y. Then y lies in the first-N span, so step 1.1 gives ∥x−PNx∥H≤∥x−y∥H<ε. Hence PNx→x; the first identity in step 1.1 then gives the asserted Parseval limit. For a finite family, PNx=x once all its vectors are included.

Depends on

Used by

Dependency tree · two levels

11 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