Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Square-Summable Complex Families Form a Hilbert Space

Statement

For every set I, the complex square-summable family space ℓ2(I,C) with its canonical norm and inner product from Square-summable families on an arbitrary index set and the space ℓ2(I) is complete. Thus it is a complex Hilbert space. Its finitely supported families are dense, and the coordinate vectors form an orthonormal basis. This result uses no choice principle.

Facts & Assumptions

Given: A set I and a Cauchy sequence (x(m))m∈N in ℓ2(I,C).

[F1]

For x∈ℓ2(I,C), ∥x∥22=sup⁡F⊆I, F finite∑i∈F∣xi∣2, and the canonical inner product is defined by the absolutely summable family ∑i∈Ixiyi‾ (Square-summable families on an arbitrary index set and the space ℓ2(I)).

[F2]

The complex plane is complete: every Cauchy sequence in C has a unique limit (The complex plane is complete, and convergence is equivalent to convergence of real and imaginary parts).

[F3]

A complex Hilbert space is a complete complex inner-product space (Hilbert space).

[A1]

Proof

1.1givenA1F1F2construct

For each i∈I, the singleton finite-sum bound gives ∣xi(m)−xi(n)∣≤∥x(m)−x(n)∥2, so (xi(m))m is Cauchy in C. By [F2] it has a unique limit xi. These uniquely determined coordinates form a function x:I→C by [A1]; no choices are made.

1.2F1choosealgebra

Let x∈ℓ2(I,C) and ε>0. By [F1], s=∥x∥22 is the supremum of its finite coordinate sums, so there is a finite F⊆I with ∑i∈F∣xi∣2>s−ε2/4. For every finite G⊆I∖F, disjointness gives ∑i∈G∣xi∣2≤s−∑i∈F∣xi∣2<ε2/4. Taking the supremum over such G yields ∥x−x∣F∥2≤ε/2<ε, proving finite-support families are dense. The coordinate vectors have inner products ⟨ei,ej⟩=δij by the canonical inner product in [F1], and their finite span is exactly the finitely supported families, so they form an orthonormal basis.

2.1F1step 1.1algebra

Since (x(m)) is Cauchy, choose N such that ∥x(m)−x(n)∥2<1 whenever m,n≥N. Then ∥x(m)∥2≤∥x(N)∥2+1 for m≥N; the finitely many earlier norms have a finite maximum, so there is M<∞ with ∥x(m)∥2≤M for every m. For any finite F⊆I, coordinate convergence and continuity of the finite sum give ∑i∈F∣xi∣2=lim⁡m∑i∈F∣xi(m)∣2≤M2. Taking the supremum over finite F in [F1] shows x∈ℓ2(I,C).

3.1F1step 1.1step 2.1algebra

Given ε>0, choose N so that ∥x(m)−x(n)∥2<ε/2 for all m,n≥N. Fix m≥N. For every finite F⊆I, coordinate convergence yields ∑i∈F∣xi(m)−xi∣2=lim⁡n∑i∈F∣xi(m)−xi(n)∣2≤ε2/4. Taking the supremum over finite F gives ∥x(m)−x∥2≤ε/2<ε. Hence x(m)→x in ℓ2(I,C) and every Cauchy sequence converges.

4.1F1F3step 3.1∎

By [F1], ℓ2(I,C) is an inner-product space, and step 3.1 proves it is complete. It is therefore a Hilbert space by [F3]. The proof used no family of choices.

Remarks

The proof works for arbitrary index sets, including I=∅, and does not require a countable enumeration or Countable Choice.

Depends on

Used by

Dependency tree · two levels

26 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