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.

A Hilbert space with a given orthonormal basis is 2 of the index set

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let (ei)iI be an orthonormal basis of a real or complex Hilbert space H, that is, a complete orthonormal family (Orthonormal families, complete orthonormal systems and Hilbert bases), and define the Fourier coefficient map

Φ:H2(I,F),Φ(x):=(x,ei)iIwith values in the space of Square-summable families on an arbitrary index set and the space 2(I). Then Φ is a linear bijection satisfyingΦ(x)2=x,Φ(x),Φ(y)2=x,yfor all x,yH.

In particular 2(I,F) is complete, hence a Hilbert space, with the inner product of Square-summable families on an arbitrary index set and the space 2(I).

Facts & Assumptions

[A1]

If an orthonormal family is complete, then Parseval's identity holds: iIx,ei2=x2 for every xH (Parseval equivalences for an orthonormal family).

[A2]

Bessel's inequality iIx,ei2x2 shows that Φ(x) lies in 2(I,F), and Φ is linear because the inner product is linear in its first argument (The Bessel inequality for an arbitrary orthonormal family, Real and complex inner-product spaces and their induced length).

[A3]

If a2(I,F), then the finite-subset net iFaiei converges to a limit s with s,ej=aj for every j (Square-summable orthogonal families have norm-convergent finite sums).

[A4]

For finite F and x,yH, PFx,PFy=iFx,eiy,ei, where PFx=iFx,eiei; and if zFz in H then zF,vz,v (The finite Bessel inequality and best approximation by a finite orthonormal family, Cauchy–Schwarz: x,yxy, with equality exactly for dependent pairs).

[A5]

2(I,F) is an inner-product space with norm 2 and pairing a,b=iIaibi, and H is complete for its norm (Square-summable families on an arbitrary index set and the space 2(I), Hilbert space).

[A6]

Under completeness the finite-subset net of Fourier partial sums PFx converges to x (Fourier expansion in a Hilbert space).

Proof

technique · direct

Given: Countable Choice, an orthonormal basis (ei)iI of H, and the coefficient map Φ.

1.1

The map Φ takes values in 2(I,F) and is linear, and Parseval's identity holds for every x because the family is complete; hence Φ(x)2=x for every x, and Φ(x)=0 forces x=0, so x=0 by definiteness of the norm. Thus Φ is linear, norm preserving and injective.

A1A2
1.2

The finite-subset net iFaiei converges for every a2(I,F), and its limit s has s,ej=aj for every j; hence Φ(s)=a and Φ is surjective.

A3
1.3

For all x,yH the inner products are preserved: for every finite F orthonormality gives PFx,PFy=iFx,eiy,ei, both sides converge along the finite-subset net, the left to x,y by continuity of the pairing and convergence of the partial sums to x and y, the right to the 2 pairing of Φ(x) and Φ(y) by the definition of the sum of a scalar family; limits being unique, Φ(x),Φ(y)2=x,y.

A4A5A6
2.1

Consequently 2(I,F) is complete: if (a(n)) is a Cauchy sequence in 2(I,F), then the vectors xn:=Φ1(a(n)) form a Cauchy sequence in H by norm preservation, hence converge to some xH; then a(n)Φ(x)2=xnx0, so the sequence converges to Φ(x).

step 1.1step 1.2A5
3.1

Steps 1.1 to 1.3 show that Φ is a linear bijection preserving norms and inner products, and step 2.1 shows that 2(I,F) is complete; hence H and 2(I,F) are isometrically isomorphic Hilbert spaces and 2(I,F) is itself a Hilbert space.

step 1.1step 1.2step 1.3step 2.1

Depends on

Used by

Dependency tree · two levels

50 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