Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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 complete, totally bounded metric space is compact, proved from countable choice used exactly once

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let (X,d) be a metric space (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric) that is complete (Complete metric space: every Cauchy sequence converges in the space) and totally bounded (Finite ε-net and totally bounded metric space). Then (X,d) is compact (Open cover, subcover, compact metric space, and compact subset of a metric space).

Where the axiom is spent, and why the weaker principle suffices. ACω is used exactly once, at step 3.1, to fix one finite 1/(n+1)-net together with a listing of it for every n∈N at once. The family of sets being chosen from is written down before any selection is made and does not depend on the earlier selections, which is precisely the situation countable choice covers and dependent choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain) is not needed for. Everything after step 3.1 is canonical: at each stage the construction takes the least admissible index in the listing already fixed.

As always on this page, the claim is an upper bound on the cost of the proof given here, not an assertion that ACω is necessary for the theorem.

Facts & Assumptions

Given: A complete, totally bounded metric space (X,d), an open cover of it, and the Axiom of Countable Choice.

[L1]

(X,d) is compact when every family U of open subsets of X with union X has a finite subfamily with union X; U open means every point of U has a ball around it inside U (Open cover, subcover, compact metric space, and compact subset of a metric space, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space).

[L2]

(X,d) is totally bounded: for every real δ>0 there is a finite F⊆X with X=⋃y∈FB(y,δ), and a nonempty finite set can be listed (Finite ε-net and totally bounded metric space, Open cover, subcover, compact metric space, and compact subset of a metric space).

[L3]

Countable choice: for a family (En)n∈N of nonempty sets there is a function n↦en with en∈En for every n (The Axiom of Countable Choice (ACω)).

[L4]

Recursion: for a set A, an element a∈A and a function f:A→A there is a unique g:N→A with g(0)=a and g(n+1)=f(g(n)); a stage-dependent rule is handled on A=N×Z, the first coordinate of g(n) then being n (The recursion theorem, Finite sums and finite products, by recursion).

[L5]

Every nonempty subset of N has a least element, and the order of N is linear (The well-ordering principle, ≤ is a linear order on N).

[L6]

A function with domain a natural number all of whose values are nonempty sets has a choice function, in ZF (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

[L7]

(X,d) is complete: every Cauchy sequence converges in X; (cn) is Cauchy when for every rational η>0 there is K with d(cn,cm)<η for n,m≥K; and cn→p when for every rational η>0 there is K with d(cn,p)<η for n≥K (Complete metric space: every Cauchy sequence converges in the space, Cauchy sequence in a metric space, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L8]

For every real η>0 there is a natural N≥1 with 1/N<η, and 1/N is a positive rational; reciprocals of positives are positive and reverse the order (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Every complete ordered field is Archimedean, Inverses of positives are positive, and reciprocation reverses order).

Proof

technique · contradiction
1.1

Suppose (X,d) is complete and totally bounded and that some family U of open subsets of X with union X has no finite subfamily with union X; call a subset S⊆X finitely covered when some finite subfamily of U has union containing S, so that X itself is not finitely covered.

L1assume-contra
2.1

X≠∅, since the empty subfamily of U has union ∅ and would finitely cover an empty X; consequently, for each n∈N, the set En of pairs (m,f) with m∈N and f:σ(m)→X such that {f(0),…,f(m)} is a finite 1/(n+1)-net for X is nonempty.

L2L8step 1.1
3.1

Countable choice applied to (En)n∈N fixes, once and for all, a function n↦(mn,fn) with (mn,fn)∈En; this is the single appeal to a choice principle in this proof, and the family (En) was written down at step 2.1 before any of it was made.

L3step 2.1
4.1

If S⊆X is not finitely covered and n∈N, then S∩B(fn(i),1/(n+1)) fails to be finitely covered for at least one i≤mn: otherwise finite choice applied to i↦{finite subfamilies of U covering S∩B(fn(i),1/(n+1))} produces one such subfamily for each i≤mn, and the concatenation of those finitely many finite lists is a finite subfamily of U whose union contains S=⋃i≤mn(S∩B(fn(i),1/(n+1))).

L2L6step 3.1
5.1

Let i(n,S) be the least i≤mn with S∩B(fn(i),1/(n+1)) not finitely covered when such an i exists, and 0 otherwise; recursion on N×P(X) with starting value (0,X) and rule F(n,S):=(n+1, S∩B(fn(i(n,S)),1/(n+1))) then produces g:N→N×P(X) whose first coordinate at n is n; write An for its second coordinate and cn:=fn(i(n,An)).

L4L5step 4.1
6.1

By induction, no An is finitely covered: A0=X is not, by step 1.1, and if An is not then step 4.1 supplies an admissible i, so i(n,An) is one and An+1=An∩B(cn,1/(n+1)) is not finitely covered either. In particular every An is nonempty, since the empty set is finitely covered by the empty subfamily; moreover An+1⊆An and An+1⊆B(cn,1/(n+1)).

step 4.1step 5.1
7.1

The sequence (cn) is Cauchy: for m≥n one has Am+1⊆An+1⊆B(cn,1/(n+1)) and Am+1⊆B(cm,1/(m+1)), and taking z∈Am+1 gives d(cn,cm)≤d(cn,z)+d(z,cm)<1/(n+1)+1/(m+1)≤2/(n+1); so given a rational η>0, a natural N≥1 with 1/N<η/2 makes d(cn,cm)<η for all n,m≥N.

L8L9step 6.1
8.1

By completeness cn→p for some p∈X; since U has union X there is U∈U with p∈U, and openness of U gives a real r>0 with B(p,r)⊆U.

L1L7step 7.1
9.1

Take a natural N≥1 with 1/N<r/2, then K∈N with d(cn,p)<1/N for all n≥K, and let n be whichever of N and K is the greater; then 1/(n+1)<1/N<r/2 and d(cn,p)<r/2, so every y∈An+1⊆B(cn,1/(n+1)) satisfies d(y,p)≤d(y,cn)+d(cn,p)<r, that is An+1⊆B(p,r)⊆U.

L5L7L8L9step 8.1
10.1

So the one-member subfamily {U} of U has union containing An+1, making An+1 finitely covered and contradicting step 6.1; the assumption of step 1.1 therefore fails, every family of open sets with union X has a finite subfamily with union X, and (X,d) is compact.

L1step 6.1step 9.1discharge-contradiction∎

Remarks

Why the nets have to be chosen with their listings. Total boundedness asserts that a finite 1/(n+1)-net exists for each n; it names none, and a bare net is a set, which carries no order in which its points may be scanned. The construction needs both: a net for each n, so that the sets An shrink, and a listing of it, so that "the least admissible index" is meaningful. That is why the chosen object at step 3.1 is the pair (mn,fn) and not the net alone.

Non-dependent, and that is the whole point. The sets En of step 2.1 depend on n and on (X,d), and on nothing that the construction produces. Had the net at stage n+1 been required to depend on An — for instance a net of the set An rather than of X — the selection would have been dependent and countable choice would not have licensed it; the cost would then have been the dependent choice of The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, as in A sequentially compact metric space is totally bounded, proved from the axiom of dependent choice. Keeping the nets fixed in advance and intersecting with balls of X is what holds the price down.

Both hypotheses are needed. A totally bounded space that is not complete need not be compact (FALSE: a totally bounded metric space is compact, The open interval (0,1) is totally bounded and not compact, the cover by the intervals (1/(k+2),1) having no finite subcover ↗), and a complete space that is not totally bounded need not be compact either, R with its usual metric being complete and having no finite 1-net.

Depends on

Used by

Dependency tree · two levels

58 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