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)iI be an orthogonal family in a real or complex Hilbert space H whose square sum is finite,

S:=iIxi2<+

in the finite-subset-supremum convention (Square-summable families on an arbitrary index set and the space 2(I)), and for finite FI put sF:=iFxi.

  1. The finite-subset net (sF)FFin(I) converges in H; its limit s satisfies s2=iIxi2=S.
  2. In particular, if (ei)iI is an orthonormal family in H (Orthonormal families, complete orthonormal systems and Hilbert bases) and a=(ai)iI2(I,F), then the finite-subset net iFaiei converges to a limit s with s2=iIai2, and s,ej=aj for every jI.

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, jzj2=jzj2; in particular the identity applies to sums indexed by finite subsets and to differences of nested finite sums (Pythagoras and finite orthogonal sums).

[A2]

iIxi2 is the supremum of the finite subsums; since S<+ and S=iFxi2+iIFxi2 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 iIFxi2<ε (Square-summable families on an arbitrary index set and the space 2(I)).

[A3]

For every real ε>0 there is a natural n1 with 1/n<ε; and squaring is monotone on the nonnegatives, so 0uv implies u2v2 and, for u,v0, u<v implies u2<v2 (For every ε>0 in a complete ordered field there is a natural n1 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,vuv, so for fixed v the scalar net zF,v converges to z,v whenever zFz (Cauchy–Schwarz: x,yxy, with equality exactly for dependent pairs).

[A6]

uvuv, 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)iI is orthogonal with iIaiei2=iIai2 (Orthonormal families, complete orthonormal systems and Hilbert bases).

Proof

technique · direct

Given: Countable Choice; an orthogonal family (xi)iI in the Hilbert space H with S=iIxi2<+; and sF=iFxi for finite F.

1.1

For every finite FI Pythagoras gives sF2=iFxi2, and then sF2S because a finite subsum is at most the supremum S.

A1A2
1.2

For finite FGI, the difference sGsF=iGFxi is a sum of pairwise orthogonal vectors, so sGsF2=iGFxi2, a value at most iIFxi2.

A1A2
1.3

The net tF:=iFxi2 is nondecreasing with respect to inclusion and has supremum S, so for every real ε>0 there is a finite F0 with StF<ε for every finite FF0.

A2algebra
1.4

For each natural n1 the set of finite F with iIFxi2<1/n is nonempty by [A2], so Countable Choice selects one such finite set Fn for every n1; replacing Fn by F1Fn gives finite sets with F1F2 and iIFnxi2<1/n still, since the tail of a larger set is smaller.

A2A7algebra
2.1

For mn the estimate of step 1.2 gives sFmsFn2iIFnxi2<1/n, so (sFn)n1 is a Cauchy sequence: for ε>0 choose n with 1/n<ε2, then sFmsFn<ε for all mn by monotonicity of squaring on nonnegative reals. Hence (sFn) converges to some sH by completeness.

step 1.2step 1.4A3A4algebra
3.1

The limit satisfies s2=S: the splitting identity for the nonnegative family gives tFn=SiIFnxi2, and the subtracted tails are below 1/n and hence tend to 0, so tFnS; by step 1.1, step 2.1 and continuity of the norm, s2=limnsFn2=limntFn=S.

step 1.1step 2.1A2A6algebra
3.2

The whole finite-subset net converges to s: given a real δ>0, choose n with 1/n<δ2/4 and sFns<δ/2, which is possible because (sFn) converges to s; then every finite FFn satisfies sFsFn2iIFnxi2<1/n<δ2/4, hence sFssFsFn+sFns<δ.

step 1.2step 1.4step 2.1A3algebra
4.1

For the orthonormal case let xi:=aiei; the family (xi) is orthogonal with xi=ai, and iIxi2=iIai2<+ because a2(I,F), so steps 3.2 and 3.1 give a limit s of the net iFaiei with s2=iIai2; and for each fixed jI, sF,ej=aj for every finite Fj, so the coefficients converge, s,ej=limFsF,ej=aj, by continuity of the pairing in the first variable.

step 3.1step 3.2A5A8

Depends on

Used by

Dependency tree · two levels

48 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