Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Real and complex c0 are Banach

Statement

For either scalar field K∈{R,C}, the space c0(K) with the supremum norm is a Banach space. No choice principle is used.

Facts & Assumptions

Given: A scalar field K∈{R,C} and a supremum-norm Cauchy sequence (x(m))m∈N in c0(K).

[F1]

The space c0(K) consists of the bounded scalar sequences which tend to zero and carries the supremum norm (The sequence spaces c_0 and ell-infinity).

[F2]

Every real Cauchy sequence converges in R, without choice (The reals are complete), and every complex Cauchy sequence converges in C (The complex plane is complete, and convergence is equivalent to convergence of real and imaginary parts).

[F4]

A normed space is Banach exactly when every norm-Cauchy sequence converges to a point of the space (Banach space).

Proof

technique · Take unique coordinatewise limits, prove that convergence is uniform, and then preserve the null-sequence condition
1.1F2F3given

Fix n∈N. Since ∣xn(m)−xn(k)∣≤∥x(m)−x(k)∥∞, the scalar sequence (xn(m))m is Cauchy. By [F2] it has a unique limit, say xn∈K. The formula sending n to the ordered pair (n,xn) is single-valued, so [F3] collects these pairs into the graph of one scalar sequence x=(xn)n∈N. This uses uniqueness and Replacement, not a choice of one limit from each of many non-singleton sets.

2.1step 1.1F1given

The sequence x is bounded. Choose M so that ∥x(m)−x(M)∥∞<1 whenever m≥M. For every coordinate n, letting m tend to infinity in ∣xn(m)−xn(M)∣<1 gives ∣xn−xn(M)∣≤1. Therefore ∣xn∣≤1+∥x(M)∥∞ for every n.

3.1step 1.1step 2.1F1given

In fact x(m)→x in the supremum norm. Given η>0, choose M so that ∥x(m)−x(k)∥∞<η/2 for all m,k≥M. Fix m≥M and n. Passing to the coordinatewise limit as k→∞ yields ∣xn(m)−xn∣≤η/2. Taking the supremum over n gives ∥x(m)−x∥∞≤η/2<η.

4.1step 2.1step 3.1F1

The uniform limit x still tends to zero. Given ε>0, use step 3.1 with tolerance ε/2 to fix an m with ∥x−x(m)∥∞<ε/2. Since x(m)∈c0, [F1] gives N such that ∣xn(m)∣<ε/2 for all n≥N. Hence ∣xn∣≤∣xn−xn(m)∣+∣xn(m)∣<ε(n≥N). Together with boundedness from step 2.1, this says x∈c0(K).

5.1step 1.1step 4.1F4∎

Thus every supremum-norm Cauchy sequence in real or complex c0 converges in that norm to an element of c0. By [F4], both spaces are Banach. The construction in step 1.1 used the unique scalar limits and Replacement, and no choice principle entered any step.

Remarks

This A-page lemma is the direct completeness supplier needed by the companion reflexivity examples. The already published proof that c0 is Banach occurs on another examples page; it cannot be used here because companion B pages are leaves in the page-dependency plan.

Depends on

Used by

Dependency tree · two levels

30 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