Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

The closed unit ball is compact if and only if the normed space is finite-dimensional

Statement

Let X be a normed space over K∈{R,C} and write

B‾X:={x∈X:∥x∥≤1}.

Then the following are equivalent.

  1. B‾X is compact in the norm metric (Open cover, subcover, compact metric space, and compact subset of a metric space).
  2. X admits an ordered basis of finite length.

Facts & Assumptions

Given: A normed space X over K∈{R,C} and its closed unit ball B‾X.

[L1]

A chosen ordered basis yields a topological isomorphism with a coordinate space (A chosen algebraic basis identifies a finite-dimensional normed space with a coordinate space).

[L2]

Riesz's lemma gives a unit vector at distance >α from every proper closed subspace (Riesz lemma).

[L3]

Finite-dimensional normed subspaces are closed (A finite-dimensional normed subspace is closed).

Proof

technique · direct
1.1L1

Assume X admits an ordered basis of length n, and let T:Kn→X be the coordinate isomorphism from [L1]. Then T−1[B‾X] is closed in Kn, because T is continuous, and bounded in the coordinate ℓ1 norm, because T−1 is bounded.

1.2L4assume-contra

Assume conversely that B‾X is compact. Then [L4] makes it totally bounded. Suppose for contradiction that X admits no ordered basis of finite length.

1.3L3choose

Let F⊆B‾X be a finite 1/2-net, and put M:=span⁡(F). The finite set F generates M, so by deleting dependent terms one gets an ordered basis of finite length for M; thus [L3] makes M closed. Since X is not finitely generated, M⊊X.

2.1step 1.1L5

In the real case K=R, if n=0 then B‾X={0} is compact. If n≥1, step 1.1 and [L5] show that T−1[B‾X] is compact in Rn, hence B‾X is compact as its homeomorphic image.

2.2step 1.1L5L6

In the complex case K=C, [L6] identifies Cn with R2n. Under that identification the coordinate ℓ1 norm is equivalent to a real norm on R2n, so the bounded closed set T−1[B‾X] is also closed and bounded in Euclidean space. If n=0 it is a singleton; if n≥1, [L5] makes it compact in R2n, hence compact in Cn and therefore in X.

2.3L2step 1.3assume-contra

Applying [L2] with α=1/2 gives a unit vector x∈X with dist⁡(x,M)>1/2. Since F is a 1/2-net in the unit ball and x∈B‾X, some y∈F satisfies ∥x−y∥<1/2. But y∈M, which contradicts dist⁡(x,M)>1/2.

3.1step 2.1step 2.2step 2.3discharge-contradiction∎

Therefore X must admit an ordered basis of finite length. Together with steps 2.1 and 2.2, this proves the equivalence.

Remarks

  • The reverse implication is choice free: compactness gives one finite net, and one application of Riesz's lemma is enough.

Depends on

Used by

Dependency tree · two levels

67 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