Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01
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.

Series criterion for Banach spaces

Statement

For a normed space V, the following are equivalent.

  1. V is a Banach space.
  2. Every absolutely convergent series in V converges.

Facts & Assumptions

Given: A normed space V.

[L1]

A Banach space is complete for its norm metric (Banach space).

[L2]

An absolutely convergent series has Cauchy partial sums (An absolutely convergent series has Cauchy partial sums).

[A1]

Every absolutely convergent series in V converges.

Proof

technique · direct
1.1L1L2

Assume V is Banach. If ∑xn is absolutely convergent, [L2] makes its partial sums Cauchy, and [L1] then makes those partial sums converge in V. So every absolutely convergent series converges.

1.2A1givenchoose

Assume [A1]. Let (ym) be a Cauchy sequence in V. Choose inductively a strictly increasing sequence (nk) with ∥ym−yn∥<2−k whenever m,n≥nk. Then ∥ynk+1−ynk∥<2−k for every k.

2.1step 1.2A1

The series ∑k=0∞(ynk+1−ynk) is absolutely convergent because ∑2−k converges and each term has norm at most 2−k. By [A1] it therefore converges to some z∈V.

3.1step 2.1algebra

Its partial sums are ynm−yn0, so the subsequence (ynm) converges to yn0+z.

4.1step 3.1givenalgebra

Given ε>0, choose K so that ∥ym−yn∥<ε/2 for m,n≥K, and choose m with nm≥K and ∥ynm−(yn0+z)∥<ε/2. Then for every n≥K, ∥yn−(yn0+z)∥≤∥yn−ynm∥+∥ynm−(yn0+z)∥<ε. So (yn) converges, and V is complete.

5.1step 1.1step 4.1∎

Step 1.1 proves (1)⇒(2) and steps 1.2 through 4.1 prove (2)⇒(1), so the two conditions are equivalent.

Depends on

Used by

Dependency tree · two levels

17 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