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 ()). Let be a metric space (Metric space: iff , 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 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. is used exactly once, at step 3.1, to fix one finite -net together with a listing of it for every 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 -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 is necessary for the theorem.
Facts & Assumptions
Given: A complete, totally bounded metric space , an open cover of it, and the Axiom of Countable Choice.
is compact when every family of open subsets of with union has a finite subfamily with union ; open means every point of has a ball around it inside (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).
is totally bounded: for every real there is a finite with , 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).
Countable choice: for a family of nonempty sets there is a function with for every (The Axiom of Countable Choice ()).
Recursion: for a set , an element and a function there is a unique with and ; a stage-dependent rule is handled on , the first coordinate of then being (The recursion theorem, Finite sums and finite products, by recursion).
Every nonempty subset of has a least element, and the order of is linear (The well-ordering principle, is a linear order on ).
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).
is complete: every Cauchy sequence converges in ; is Cauchy when for every rational there is with for ; and when for every rational there is with for (Complete metric space: every Cauchy sequence converges in the space, Cauchy sequence in a metric space, Convergence of a sequence in a metric space: iff in , Sequences of reals: bounded, eventually, frequently, tails, subsequences).
For every real there is a natural with , and is a positive rational; reciprocals of positives are positive and reverse the order (For every in a complete ordered field there is a natural with , Every complete ordered field is Archimedean, Inverses of positives are positive, and reciprocation reverses order).
A metric is symmetric and satisfies the triangle inequality (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
Proof
Suppose is complete and totally bounded and that some family of open subsets of with union has no finite subfamily with union ; call a subset finitely covered when some finite subfamily of has union containing , so that itself is not finitely covered.
, since the empty subfamily of has union and would finitely cover an empty ; consequently, for each , the set of pairs with and such that is a finite -net for is nonempty.
Countable choice applied to fixes, once and for all, a function with ; this is the single appeal to a choice principle in this proof, and the family was written down at step 2.1 before any of it was made.
If is not finitely covered and , then fails to be finitely covered for at least one : otherwise finite choice applied to produces one such subfamily for each , and the concatenation of those finitely many finite lists is a finite subfamily of whose union contains .
Let be the least with not finitely covered when such an exists, and otherwise; recursion on with starting value and rule then produces whose first coordinate at is ; write for its second coordinate and .
By induction, no is finitely covered: is not, by step 1.1, and if is not then step 4.1 supplies an admissible , so is one and is not finitely covered either. In particular every is nonempty, since the empty set is finitely covered by the empty subfamily; moreover and .
The sequence is Cauchy: for one has and , and taking gives ; so given a rational , a natural with makes for all .
By completeness for some ; since has union there is with , and openness of gives a real with .
Take a natural with , then with for all , and let be whichever of and is the greater; then and , so every satisfies , that is .
So the one-member subfamily of has union containing , making finitely covered and contradicting step 6.1; the assumption of step 1.1 therefore fails, every family of open sets with union has a finite subfamily with union , and is compact.
Remarks
Why the nets have to be chosen with their listings. Total boundedness asserts that a finite -net exists for each ; 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 , so that the sets 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 and not the net alone.
Non-dependent, and that is the whole point. The sets of step 2.1 depend on and on , and on nothing that the construction produces. Had the net at stage been required to depend on — for instance a net of the set rather than of — 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 -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 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 is totally bounded and not compact, the cover by the intervals having no finite subcover ↗), and a complete space that is not totally bounded need not be compact either, with its usual metric being complete and having no finite -net.
Depends on
- Open cover, subcover, compact metric space, and compact subset of a metric space
- Finite $\varepsilon$-net and totally bounded metric space
- Complete metric space: every Cauchy sequence converges in the space
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Cauchy sequence in a metric space
- Convergence of a sequence in a metric space: $x_k \to x$ iff $d(x_k, x) \to 0$ in $\mathbb{R}$
- Open ball, closed ball and sphere in 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
- The recursion theorem
- Finite sums and finite products, by recursion
- The well-ordering principle
- Every natural-number-indexed list of nonempty sets has a choice function on its family of values
- $\le$ is a linear order on $\mathbb{N}$
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- Every complete ordered field is Archimedean
- Inverses of positives are positive, and reciprocation reverses order
- Sequences of reals: bounded, eventually, frequently, tails, subsequences
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
Used by
- FALSE: a totally bounded metric space is compact False statement
- What each implication between the compactness properties of a metric space costs: which are theorems of ZF, which use countable choice, and which use dependent choice Remark
- For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 96 results over 20 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Totally bounded space (Wikipedia) (standard reference, not scraped)
- Compact space (Wikipedia) (standard reference, not scraped)
- Axiom of countable choice (Wikipedia) (standard reference, not scraped)