Alphabeta Math
LemmaStatement: 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.

Square-summable orthogonal families have norm-convergent finite sums

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let (xi)i∈I be an orthogonal family in a real or complex Hilbert space H whose square sum is finite,

S:=∑i∈I∥xi∥2<+∞

in the finite-subset-supremum convention (Square-summable families on an arbitrary index set and the space ℓ2(I)), and for finite F⊆I put sF:=∑i∈Fxi.

  1. The finite-subset net (sF)F∈Fin⁡(I) converges in H; its limit s satisfies ∥s∥2=∑i∈I∥xi∥2=S.
  2. In particular, if (ei)i∈I is an orthonormal family in H (Orthonormal families, complete orthonormal systems and Hilbert bases) and a=(ai)i∈I∈ℓ2(I,F), then the finite-subset net ∑i∈Faiei converges to a limit s with ∥s∥2=∑i∈I∣ai∣2, and ⟨s,ej⟩=aj for every j∈I.

The hypothesis is exactly ACω. It is spent once, in selecting one finite tail-control set for each natural number; no enumeration of I and no maximal orthonormal family is used.

Facts & Assumptions

[A1]

For pairwise orthogonal vectors z1,…,zm, ∥∑jzj∥2=∑j∥zj∥2; in particular the identity applies to sums indexed by finite subsets and to differences of nested finite sums (Pythagoras and finite orthogonal sums).

[A2]

∑i∈I∥xi∥2 is the supremum of the finite subsums; since S<+∞ and S=∑i∈F∥xi∥2+∑i∈I∖F∥xi∥2 for every finite F, and since for every real ε>0 some finite F has finite subsum >S−ε, for every real ε>0 there is a finite F with ∑i∈I∖F∥xi∥2<ε (Square-summable families on an arbitrary index set and the space ℓ2(I)).

[A3]

For every real ε>0 there is a natural n≥1 with 1/n<ε; and squaring is monotone on the nonnegatives, so 0≤u≤v implies u2≤v2 and, for u,v≥0, u<v implies u2<v2 (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Squaring is monotone on the nonnegatives).

[A4]

A Hilbert space is complete for the induced norm: every Cauchy sequence converges (Hilbert space).

[A5]

A convergent net of scalars has at most one limit, and ∣⟨u,v⟩∣≤∥u∥∥v∥, so for fixed v the scalar net ⟨zF,v⟩ converges to ⟨z,v⟩ whenever zF→z (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[A6]

∣∥u∥−∥v∥∣≤∥u−v∥, so the norm is continuous along convergent nets (The reverse triangle inequality in a normed space).

[A7]

Countable Choice selects one element from each of countably many nonempty sets (The Axiom of Countable Choice (ACω)).

[A8]

In an orthonormal family, ⟨ei,ei⟩=1, so ∥aiei∥=∣ai∣ and the family (aiei)i∈I is orthogonal with ∑i∈I∥aiei∥2=∑i∈I∣ai∣2 (Orthonormal families, complete orthonormal systems and Hilbert bases).

Proof

technique · direct

Given: Countable Choice; an orthogonal family (xi)i∈I in the Hilbert space H with S=∑i∈I∥xi∥2<+∞; and sF=∑i∈Fxi for finite F.

1.1A1A2

For every finite F⊆I Pythagoras gives ∥sF∥2=∑i∈F∥xi∥2, and then ∥sF∥2≤S because a finite subsum is at most the supremum S.

1.2A1A2

For finite F⊆G⊆I, the difference sG−sF=∑i∈G∖Fxi is a sum of pairwise orthogonal vectors, so ∥sG−sF∥2=∑i∈G∖F∥xi∥2, a value at most ∑i∈I∖F∥xi∥2.

1.3A2algebra

The net tF:=∑i∈F∥xi∥2 is nondecreasing with respect to inclusion and has supremum S, so for every real ε>0 there is a finite F0 with S−tF<ε for every finite F⊇F0.

1.4A2A7algebra

For each natural n≥1 the set of finite F with ∑i∈I∖F∥xi∥2<1/n is nonempty by [A2], so Countable Choice selects one such finite set Fn for every n≥1; replacing Fn by F1∪⋯∪Fn gives finite sets with F1⊆F2⊆⋯ and ∑i∈I∖Fn∥xi∥2<1/n still, since the tail of a larger set is smaller.

2.1step 1.2step 1.4A3A4algebra

For m≥n the estimate of step 1.2 gives ∥sFm−sFn∥2≤∑i∈I∖Fn∥xi∥2<1/n, so (sFn)n≥1 is a Cauchy sequence: for ε>0 choose n with 1/n<ε2, then ∥sFm−sFn∥<ε for all m≥n by monotonicity of squaring on nonnegative reals. Hence (sFn) converges to some s∈H by completeness.

3.1step 1.1step 2.1A2A6algebra

The limit satisfies ∥s∥2=S: the splitting identity for the nonnegative family gives tFn=S−∑i∈I∖Fn∥xi∥2, and the subtracted tails are below 1/n and hence tend to 0, so tFn→S; by step 1.1, step 2.1 and continuity of the norm, ∥s∥2=lim⁡n∥sFn∥2=lim⁡ntFn=S.

3.2step 1.2step 1.4step 2.1A3algebra

The whole finite-subset net converges to s: given a real δ>0, choose n with 1/n<δ2/4 and ∥sFn−s∥<δ/2, which is possible because (sFn) converges to s; then every finite F⊇Fn satisfies ∥sF−sFn∥2≤∑i∈I∖Fn∥xi∥2<1/n<δ2/4, hence ∥sF−s∥≤∥sF−sFn∥+∥sFn−s∥<δ.

4.1step 3.1step 3.2A5A8∎

For the orthonormal case let xi:=aiei; the family (xi) is orthogonal with ∥xi∥=∣ai∣, and ∑i∈I∥xi∥2=∑i∈I∣ai∣2<+∞ because a∈ℓ2(I,F), so steps 3.2 and 3.1 give a limit s of the net ∑i∈Faiei with ∥s∥2=∑i∈I∣ai∣2; and for each fixed j∈I, ⟨sF,ej⟩=aj for every finite F∋j, so the coefficients converge, ⟨s,ej⟩=lim⁡F⟨sF,ej⟩=aj, by continuity of the pairing in the first variable.

Depends on

Dependency tree · 2 levels

Sources