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.

A normed space is locally compact if and only if it is finite-dimensional

Statement

Let X be a normed space over K∈{R,C}, equipped with its norm topology. Then the following are equivalent.

  1. X is locally compact (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space).
  2. X admits an ordered basis of finite length.

This is the page's precise reading of "finite-dimensional".

Facts & Assumptions

Given: A normed space X over K∈{R,C}.

[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: for every proper closed normed subspace M⊊X and 0<α<1 there is a unit vector at distance >α from M (Riesz lemma).

[L4]

Rn is locally compact for n≥1 (Rn is locally compact and σ-compact).

[L6]

In a metric space, local compactness at a point is equivalent to the existence of an open ball around that point contained in a compact subset (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space).

Proof

technique · direct
1.1L1L4L5

Assume X admits an ordered basis of length n. If K=R, the coordinate space Rn is locally compact by [L4] when n≥1, and R0={0} is compact, hence locally compact. If K=C, then Cn identifies with R2n by [L5], so the same conclusion holds there. By [L1], X is homeomorphic to that coordinate space, hence locally compact.

1.2L6choose

Assume now that X is locally compact. By [L6], applied to the norm metric, 0 has a compact neighbourhood K containing some open ball B(0,r) with r>0. The closed ball B‾(0,r2):={x∈X:∥x∥≤r2} is a closed subset of K and is therefore compact.

1.3

For the successor step, let Mm:=span⁡{x0,…,xm}. The finite list x0,…,xm generates Mm, so by deleting dependent terms if necessary one gets an ordered basis of finite length for Mm. Thus Mm⊊X by the contradiction hypothesis, and A finite-dimensional normed subspace is closed makes Mm closed. Applying [L2] with α=1/2 yields a unit vector xm+1 with dist⁡(xm+1,Mm)>1/2. In particular ∥xm+1−xj∥>1/2 for every j≤m. [L2, A finite-dimensional normed subspace is closed, choose]

2.1step 1.2assume-contrachoose

Suppose for contradiction that X admits no ordered basis of finite length. We recursively build, for each m≥0, unit vectors x0,…,xm∈X such that ∥xj−xk∥>12(j≠k). For m=0 choose any nonzero x0 and normalize it.

3.1step 2.1step 1.3algebra

Every xj lies in the closed ball B‾(0,r/2) after rescaling by r/2: namely yj:=(r/2)xj satisfies ∥yj∥=r/2, so yj lies in that compact set. Also ∥yj−yk∥=r2∥xj−xk∥>r4(j≠k).

4.1L3step 3.1assume-contra

By [L3], the compact metric space B‾(0,r/2) is totally bounded. Taking ε=r/8, it admits a finite ε-net. But one ε-ball can contain at most one of the points yj, since distinct ones are more than r/4=2ε apart. Therefore a finite ε-net cannot cover arbitrarily large finite sets {y0,…,ym}, contradiction.

5.1step 1.1step 4.1discharge-contradiction∎

The contradiction in step 4.1 shows that X must admit an ordered basis of finite length. Together with step 1.1, this proves the equivalence.

Remarks

  • The reverse implication uses only one finite recursion at a time. No choice principle is needed.

Depends on

Used by

Dependency tree · two levels

63 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