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.

Parseval equivalences for an orthonormal family

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let (ei)i∈I be an orthonormal family in a real or complex Hilbert space H (Orthonormal families, complete orthonormal systems and Hilbert bases), and for x∈H and finite F⊆I put

PFx:=∑i∈F⟨x,ei⟩ei.

Then the following four assertions are equivalent:

  1. (completeness) the closed linear span of (ei)i∈I is H;
  2. (zero complement) the only vector orthogonal to every ei is 0;
  3. (Parseval) ∑i∈I∣⟨x,ei⟩∣2=∥x∥2 for every x∈H, the sum being the supremum of the finite subsums (Square-summable families on an arbitrary index set and the space ℓ2(I));
  4. (net convergence) the finite-subset net (PFx)F∈Fin⁡(I) converges to x for every x∈H.

Assertion 2 is the statement span⁡{ei:i∈I}⊥={0} (Orthogonality and the orthogonal complement).

Facts & Assumptions

[A1]

If (ei)i∈I is orthonormal and a=(ai)i∈I∈ℓ2(I,F), then the finite-subset net ∑i∈Faiei converges to a limit s with ⟨s,ej⟩=aj for every j and ∥s∥2=∑i∈I∣ai∣2 (Square-summable orthogonal families have norm-convergent finite sums).

[A2]

The Bessel inequality holds: ∑i∈I∣⟨x,ei⟩∣2≤∥x∥2, so the coefficient family lies in ℓ2(I,F) (The Bessel inequality for an arbitrary orthonormal family).

[A3]

For every finite F, ∥x−PFx∥2=∥x∥2−∑i∈F∣⟨x,ei⟩∣2 (The finite Bessel inequality and best approximation by a finite orthonormal family).

[A4]

If z∈H satisfies ⟨z,ei⟩=0 for every i, then ⟨z,v⟩=0 for every v in the closed linear span of the family: conjugate-linearity, and in particular additivity, in the second argument passes the vanishing to the algebraic span, while ∣⟨z,w⟩∣≤∥z∥∥w∥ passes it to norm limits (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, Orthogonality and the orthogonal complement).

[A5]

A‾={x:d(x,A)=0} for nonempty A, so x∈A‾ exactly when vectors of A come arbitrarily close to x (The closure of a nonempty A is {x:d(x,A)=0}, equals A together with its limit points, and is the smallest closed superset).

[A6]

The partial sums tF:=∑i∈F∣⟨x,ei⟩∣2 are nondecreasing under inclusion with supremum ∑i∈I∣⟨x,ei⟩∣2, and a nondecreasing net of reals converges to its supremum. In particular if every real ε>0 satisfies S−ε<tF≤S for some finite F then the net converges to S (Square-summable families on an arbitrary index set and the space ℓ2(I), Epsilon characterisation of the supremum).

[A7]

For a linear subspace M of the Hilbert space H, M⊥⊥=M‾ (The double orthogonal complement of a subspace is its closure), and {0}⊥=H (Orthogonality and the orthogonal complement).

[A8]

The span of {ei:i∈I} is a linear subspace and its closure is the closed linear span of the family (Linear subspace of a vector space, Orthonormal families, complete orthonormal systems and Hilbert bases).

[A9]

The norm is continuous along convergent nets and the square of a convergent scalar net converges to the square of the limit (The reverse triangle inequality in a normed space).

Proof

technique · direct

Given: Countable Choice, an orthonormal family (ei)i∈I in the Hilbert space H, and the partial sums PFx=∑i∈F⟨x,ei⟩ei.

1.1A1A2A4A8

Completeness implies net convergence. Assume the closed linear span of the family is H and let x∈H. The coefficient family lies in ℓ2(I,F) by Bessel, so by [A1] the net (PFx) converges to a limit s with ⟨s,ej⟩=⟨x,ej⟩ for every j; then z:=x−s satisfies ⟨z,ej⟩=0 for every j, so ⟨z,v⟩=0 for every v in the closed linear span by [A4] and hence ⟨z,x⟩=0; therefore ∥z∥2=⟨z,z⟩=⟨z,x⟩−⟨z,s⟩=0 and z=0, that is s=x.

1.2A5A8

Net convergence implies completeness. Assume (PFx) converges to x for every x∈H and fix x. Every PFx lies in the span of the family, so for every real ε>0 some vector of that span is within distance ε of x; hence d(x,span⁡{ei})=0 and x∈span⁡{ei}‾, the closed linear span, by [A5] and [A8]. As x was arbitrary, the closed linear span is H.

1.3A3A6A9

Net convergence implies Parseval. Assume net convergence and fix x. Every finite F satisfies ∥x−PFx∥2=∥x∥2−tF with tF=∑i∈F∣⟨x,ei⟩∣2 by [A3]; since PFx→x, continuity of the norm gives ∥x−PFx∥2→0, so tF→∥x∥2 as a net of reals. But tF is nondecreasing under inclusion with supremum ∑i∈I∣⟨x,ei⟩∣2, so it converges to that supremum by [A6] and the limit is unique; hence ∑i∈I∣⟨x,ei⟩∣2=∥x∥2.

1.4A6A9

Parseval implies zero complement. Assume Parseval for every x and let y satisfy ⟨y,ei⟩=0 for every i. Then all finite subsums ∑i∈F∣⟨y,ei⟩∣2 vanish, so the supremum ∑i∈I∣⟨y,ei⟩∣2 is 0; Parseval applied to y gives ∥y∥2=0, hence y=0 by definiteness of the inner product.

1.5A7A8

Zero complement implies completeness. Assume no nonzero vector is orthogonal to every ei, and let M:=span⁡{ei:i∈I}, a linear subspace with M⊥={0}. Then M⊥⊥=M‾ by [A7], while M⊥⊥=(M⊥)⊥={0}⊥=H by [A7]; hence the closed linear span M‾ of the family is H.

2.1step 1.1step 1.2step 1.3step 1.4step 1.5∎

The five implications of steps 1.1 to 1.5 form the cycle (completeness) ⇒ (net convergence) ⇒ (completeness), (net convergence) ⇒ (Parseval) ⇒ (zero complement) ⇒ (completeness), so any one of the four assertions implies all the others and the four are equivalent.

Depends on

Dependency tree · 2 levels

Sources