Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge 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.

Completeness of countable square-summable sequences

Statement

With the inner product and norm of Square-summable families on an arbitrary index set and the space ℓ2(I), the complex sequence space ℓ2(N0,C):={x=(xn)n≥0:∑n≥0∣xn∣2<∞} is complete. Hence it is a complex Hilbert space in the sense of Hilbert space.

Facts & Assumptions

Given: The index set is N0, the scalar field is C, and the square-summable-family norm is the supremum of finite subsums as in [F1].

[F1]

Square-summable families on an arbitrary index set and the space ℓ2(I): the square-summable families form an inner-product space with norm ∥x∥2=(sup⁡F⊆I, F finite∑i∈F∣xi∣2)1/2 and pairing ⟨x,y⟩=∑ixiyi‾, linear in the first argument.

[F3]

Hilbert space: a complex Hilbert space is an inner-product space complete in its induced norm.

Proof

1.1givenF1F2algebra

Let (x(k))k≥1 be Cauchy in ℓ2(N0,C). For each fixed n, ∣xn(k)−xn(ℓ)∣≤∥x(k)−x(ℓ)∥2, so [F2] gives a unique coordinate limit xn. The sequence is norm-bounded: choose k0 so that ∥x(k)−x(k0)∥2<1 for k≥k0, bound those terms by 1+∥x(k0)∥2, and enlarge the bound to include the finitely many earlier norms. Call the resulting bound C. For every finite F⊆N0, finite-sum continuity gives ∑n∈F∣xn∣2=lim⁡k∑n∈F∣xn(k)∣2≤C2. Taking the supremum over finite F shows x∈ℓ2.

2.1givenF1F2F3step 1.1algebra∎

Given δ>0, choose k1 so ∥x(k)−x(ℓ)∥2<δ/2 whenever k,ℓ≥k1. Fix k≥k1. For each finite F, coordinate convergence and the finite sum imply ∑n∈F∣xn(k)−xn∣2=lim⁡ℓ→∞∑n∈F∣xn(k)−xn(ℓ)∣2≤(δ/2)2. Taking the supremum over finite F gives ∥x(k)−x∥2≤δ/2<δ. Thus every Cauchy sequence converges in this norm; [F3] gives the Hilbert-space conclusion. The coordinate limits are uniquely determined, so no choice principle is used.

Depends on

Dependency tree · 2 levels

Sources