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.
Compact implies countably compact, Lindel"of and limit point compact; countably compact together with Lindel"of implies compact; and, at the cost of countable or dependent choice, sequentially compact implies countably compact, countably compact implies limit point compact, and the converse holds when every singleton is closed
Statement
Let be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), with compactness as in Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right and the variants as in Countably compact, Lindel"of, sequentially compact, limit point compact and -compact spaces, and relatively compact subsets. Then:
- Theorems of ZF.
- (a) If is compact it is countably compact and Lindelöf.
- (b) If is countably compact and Lindelöf it is compact.
- (c) If is compact it is limit point compact.
- (d) If is countably compact then every countably infinite subset of (Finite, countably infinite, countable, uncountable) has a limit point in .
- Assuming the Axiom of Countable Choice (The Axiom of Countable Choice ()): if is sequentially compact it is countably compact.
- Assuming the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain): if is countably compact it is limit point compact.
- Assuming the Axiom of Countable Choice, and that every singleton is closed: if is limit point compact it is countably compact.
Every hypothesis is stated where it is spent. Claim 1 uses no choice principle at all. Claim 2 spends countable choice once, to pick a point outside each of countably many nonempty sets; claim 4 spends it in the same place; claim 3 spends dependent choice once, to extract a countably infinite subset from an infinite set. Each is an upper bound on the cost of the proof given here, never a claim of necessity.
The hypothesis of claim 4 is written out rather than named. "Every singleton is closed" is a separation axiom, and separation axioms are not available at this point in the reading order; the condition is used exactly as stated and nothing about the axiom it belongs to is asserted.
Facts & Assumptions
Given: A topological space .
is compact when every open cover has a finite subcover; countably compact when every at most countable open cover has a finite subcover; Lindelöf when every open cover has an at most countable subcover; sequentially compact when every sequence has a convergent subsequence; limit point compact when every infinite subset has a limit point in (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Countably compact, Lindel"of, sequentially compact, limit point compact and -compact spaces, and relatively compact subsets).
A finite family is at most countable, and infinite means not finite (Finite, countably infinite, countable, uncountable).
, where is the set of limit points of , and is closed exactly when ; a limit point of a subset of is a limit point of , since a neighbourhood meeting the smaller set meets the larger (A point lies in the closure of iff every basic neighbourhood of it meets ; the closure is the smallest closed superset and equals together with its derived set, claim 3; Interior, closure, boundary, exterior, derived set and isolated point in a topological space).
and are open, unions of open sets are open, a union of finitely many closed sets is closed, and a set is closed exactly when its complement is open; a neighbourhood of a point contains an open set containing that point, and an open set containing a point is a neighbourhood of it (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison, Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).
Countable choice: for every family of nonempty sets there is a function on with for every (The Axiom of Countable Choice ()).
Dependent choice: for every nonempty set , every relation entire on and every there is a sequence in with and for every (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
A nonempty at most countable family admits a surjection from , so it may be listed as with repetitions allowed, and no choice principle is involved (A nonempty set is at most countable iff it is a surjective image of , Finite, countably infinite, countable, uncountable).
A sequence is a function on and contains ; means lies in each neighbourhood of from some index on; and a strictly increasing index map satisfies (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure, A strictly increasing index map satisfies , The natural numbers (von Neumann)).
A set is countably infinite exactly when it is equinumerous with , and the range of an injection is a countably infinite subset of (Finite, countably infinite, countable, uncountable, Injection, surjection, bijection).
Proof
Claim 1(a): an at most countable open cover of is in particular an open cover, so compactness gives it a finite subcover, and is countably compact; and a finite subcover of an open cover is an at most countable subcover by [L2], so is Lindelöf.
Claim 1(b): let be an open cover of a countably compact Lindelöf space; Lindelöfness gives an at most countable subcover , countable compactness gives a finite subfamily of with union , and that subfamily is a finite subfamily of with union .
Claim 1(c): let be compact and let have no limit point in ; then covers , since each has a neighbourhood with and an open with , so that ; compactness gives with , whence is listable and so finite by [L2]. Contraposing, every infinite subset of has a limit point.
For claim 2 assume countable choice, let be sequentially compact and let be an at most countable open cover of with no finite subcover; then , since the empty family covers only the empty space, so [L7] lists it as , and is nonempty for every , so [L5] supplies a sequence with for every .
For claim 1(d) let be countably compact and let be countably infinite with no limit point in ; fix a bijection of onto and put . Each is a subset of , so it has no limit point either by [L3], and therefore and is closed.
For claim 3 assume dependent choice and let be infinite. Let be the set of injections with , nonempty because the empty function belongs to it, and relate to when is an injection extending ; this relation is entire on , since an injection cannot have range , as that would make finite, so some gives the extension . By [L6] there is a sequence in with the empty function and each extending , so each is an injection and defines an injection whose range is a countably infinite subset of .
For claim 4 assume countable choice, let be limit point compact with every singleton closed, and let be an at most countable open cover of with no finite subcover; as at step 1.4 the family is nonempty, [L7] lists it as , the sets are nonempty, and [L5] supplies a sequence with for every .
Sequential compactness gives a strictly increasing and with ; some contains and is a neighbourhood of it by [L4], so for all large , while by [L8] gives for all large and hence for those — impossible. So no such exists and is countably compact, which is claim 2.
The sets satisfy : a point outside lies in no , and because is injective. So is an at most countable family of open sets whose union is .
The set of step 2.1 is infinite. Were it finite, then for each the least with exists, since covers , and the largest of those finitely many least indices exists; but misses while lies in for some .
Countable compactness applied to gives a finite subfamily with union ; each is for some , and taking to be the least such and the largest of gives for every , since the decrease. Hence and , contradicting . So a countably infinite subset of a countably compact space has a limit point in it, which is claim 1(d).
Limit point compactness gives a limit point of the infinite set ; some contains , the set is closed by [L4] as a union of finitely many closed singletons, and is therefore open and contains , hence is a neighbourhood of meeting : there is with and .
Claim 3: given an infinite with countably compact, step 1.6 produces a countably infinite , step 3.2 gives a limit point in , and is then a limit point of by [L3], since . So is limit point compact.
If then is one of and differs from , so , contradicting ; hence , so and contradicts . No such exists, so is countably compact, which is claim 4.
Claims 1(a), 1(b), 1(c) and 1(d) are steps 1.1, 1.2, 1.3 and 3.2; claim 2 is step 2.2; claim 3 is step 4.2; and claim 4 is step 5.1.
Remarks
That an infinite set has a countably infinite subset is not a theorem of ZF, which is what claim 3 pays dependent choice for (FALSE: every infinite set has a countably infinite subset, in ZF). Claim 1(d), the part of claim 3 that speaks only about countably infinite subsets, is free of that cost and is proved in ZF.
Why claim 4 needs the singleton hypothesis and claim 1(c) does not. A limit point of the set built at step 2.1 need not be one of the with large index unless the finitely many early terms can be cut away, and cutting them away is exactly what closedness of singletons permits. Without that hypothesis the implication fails, and the witness is worked on this page's companion, as cex-limit-point-compact-without-countable-compactness: a space in which every nonempty subset has a limit point, for the trivial reason that each point has a partner it cannot be separated from, and which has a countable open cover with no finite subcover.
The individual reverse implications fail in general, with the one exception proved above: claim 1(b) is the reverse of claim 1(a) taken jointly, and it holds in every space. Assuming the Axiom of Countable Choice, compactness is strictly stronger than countable compactness (FALSE: every countably compact space is compact) and sequential compactness does not imply compactness (FALSE: every sequentially compact space is compact); assuming the Axiom of Choice, compactness does not imply sequential compactness (FALSE: every compact space is sequentially compact, whose witness is compact by Tychonoff's theorem). Each of those false statements carries a witness reachable from this page, and each states the choice principle its witness spends.
For a metrizable space the picture collapses. Compactness, countable compactness, sequential compactness and limit point compactness are all equivalent there (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), at a choice cost recorded arrow by arrow in 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; the implications proved without choice in the metric setting are In any metric space compactness implies countable compactness and limit point compactness, and each of countable compactness and limit point compactness implies sequential compactness; every implication here is proved without a choice principle. Nothing in that collapse is available here, and the counterexamples of this page are all non-metrizable.
Depends on
- Countably compact, Lindel\"of, sequentially compact, limit point compact and $\sigma$-compact spaces, and relatively compact subsets
- Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
- Finite, countably infinite, countable, uncountable
- A nonempty set is at most countable iff it is a surjective image of $\mathbb{N}$
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure
- Sequences of reals: bounded, eventually, frequently, tails, subsequences
- A strictly increasing index map satisfies $n_k \ge k$
- Interior, closure, boundary, exterior, derived set and isolated point in a topological space
- A point lies in the closure of $A$ iff every basic neighbourhood of it meets $A$; the closure is the smallest closed superset and equals $A$ together with its derived set
- Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open
- Injection, surjection, bijection
- The natural numbers $\mathbb{N}$ (von Neumann)
Used by
- ℕ × {a,b} with the indiscrete topology on the second factor is limit point compact and not countably compact, so the hypothesis that singletons are closed is not decoration Counterexample
- The quasicompact convention, why compactness of a subset is read intrinsically here, and what each result on this page costs in choice Remark
- Every successor ordinal is compact in its order topology and every limit ordinal is not; and, assuming countable choice, ω₁ is countably compact and sequentially compact while ω₁ + 1 is compact Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 117 results over 32 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
- Countably compact space (Wikipedia) (standard reference, not scraped)
- Limit point compact (Wikipedia) (standard reference, not scraped)
- Lindelöf space (Wikipedia) (standard reference, not scraped)
- Sequentially compact space (Wikipedia) (standard reference, not scraped)