Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)
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 (X,T) 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:

  1. Theorems of ZF.
    • (a) If X is compact it is countably compact and Lindelöf.
    • (b) If X is countably compact and Lindelöf it is compact.
    • (c) If X is compact it is limit point compact.
    • (d) If X is countably compact then every countably infinite subset of X (Finite, countably infinite, countable, uncountable) has a limit point in X.
  2. Assuming the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)): if X is sequentially compact it is countably compact.
  3. Assuming the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain): if X is countably compact it is limit point compact.
  4. Assuming the Axiom of Countable Choice, and that every singleton {x}⊆X is closed: if X 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 (X,T).

[L1]

X 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 X (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).

[L2]

A finite family is at most countable, and infinite means not finite (Finite, countably infinite, countable, uncountable).

[L3]

A‾=A∪A′, where A′ is the set of limit points of A, and A is closed exactly when A=A‾; a limit point of a subset of B is a limit point of B, since a neighbourhood meeting the smaller set meets the larger (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, claim 3; Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

[L4]

∅ and X 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).

[L5]

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

[L6]

Dependent choice: for every nonempty set S, every relation R entire on S and every a∈S there is a sequence (sk) in S with s0=a and skRsk+1 for every k (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[L7]

A nonempty at most countable family admits a surjection from N, so it may be listed as (Un)n∈N with repetitions allowed, and no choice principle is involved (A nonempty set is at most countable iff it is a surjective image of N, Finite, countably infinite, countable, uncountable).

[L8]

A sequence is a function on N and N contains 0; xk→p means xk lies in each neighbourhood of p from some index on; and a strictly increasing index map satisfies nj≥j (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 nk≥k, The natural numbers N (von Neumann)).

[L9]

A set is countably infinite exactly when it is equinumerous with N, and the range of an injection N→A is a countably infinite subset of A (Finite, countably infinite, countable, uncountable, Injection, surjection, bijection).

Proof

technique · direct
1.1

Claim 1(a): an at most countable open cover of X is in particular an open cover, so compactness gives it a finite subcover, and X is countably compact; and a finite subcover of an open cover is an at most countable subcover by [L2], so X is Lindelöf.

L1L2
1.2

Claim 1(b): let U be an open cover of a countably compact Lindelöf space; Lindelöfness gives an at most countable subcover V⊆U, countable compactness gives a finite subfamily of V with union X, and that subfamily is a finite subfamily of U with union X.

L1L2
1.3

Claim 1(c): let X be compact and let A⊆X have no limit point in X; then U:={ U∈T:U∩A has at most one element } covers X, since each x∈X has a neighbourhood N with N∩(A∖{x})=∅ and an open U with x∈U⊆N, so that U∩A⊆{x}; compactness gives U0,…,Un∈U with X=U0∪⋯∪Un, whence A=(U0∩A)∪⋯∪(Un∩A) is listable and so finite by [L2]. Contraposing, every infinite subset of X has a limit point.

L1L2L4algebra
1.4

For claim 2 assume countable choice, let X be sequentially compact and let U be an at most countable open cover of X with no finite subcover; then U≠∅, since the empty family covers only the empty space, so [L7] lists it as (Un)n∈N, and En:=X∖(U0∪⋯∪Un) is nonempty for every n, so [L5] supplies a sequence (xn) with xn∈En for every n.

L1L5L7
1.5

For claim 1(d) let X be countably compact and let B⊆X be countably infinite with no limit point in X; fix a bijection k↦bk of N onto B and put Cn:={ bk:k≥n }. Each Cn is a subset of B, so it has no limit point either by [L3], and therefore Cn‾=Cn∪∅=Cn and Cn is closed.

L1L3L9
1.6

For claim 3 assume dependent choice and let A⊆X be infinite. Let S be the set of injections s:n→A with n∈N, nonempty because the empty function belongs to it, and relate s to t when t is an injection σ(n)→A extending s:n→A; this relation is entire on S, since an injection s:n→A cannot have range A, as that would make A finite, so some a∈A∖ran⁡(s) gives the extension s∪{(n,a)}. By [L6] there is a sequence (sk) in S with s0 the empty function and each sk+1 extending sk, so each sk is an injection k→A and bk:=sk+1(k) defines an injection N→A whose range is a countably infinite subset of A.

L2L6L9
2.1

For claim 4 assume countable choice, let X be limit point compact with every singleton closed, and let U be an at most countable open cover of X with no finite subcover; as at step 1.4 the family is nonempty, [L7] lists it as (Un)n∈N, the sets En:=X∖(U0∪⋯∪Un) are nonempty, and [L5] supplies a sequence (xn) with xn∈En for every n.

L1L5L7
2.2

Sequential compactness gives a strictly increasing j↦nj and p∈X with xnj→p; some Um contains p and is a neighbourhood of it by [L4], so xnj∈Um for all large j, while nj≥j by [L8] gives nj≥m for all large j and hence xnj∉U0∪⋯∪Unj⊇Um for those j — impossible. So no such U exists and X is countably compact, which is claim 2.

L1L4L8step 1.4
2.3

The sets Cn satisfy ⋂n∈NCn=∅: a point outside B lies in no Cn, and bk∉Ck+1 because k↦bk is injective. So V:={ X∖Cn:n∈N } is an at most countable family of open sets whose union is X.

L4L7step 1.5
3.1

The set A:={ xn:n∈N } of step 2.1 is infinite. Were it finite, then for each a∈A the least m with a∈Um exists, since (Un) covers X, and the largest M of those finitely many least indices exists; but xM∈EM misses U0∪⋯∪UM while xM∈A lies in Um for some m≤M.

L1algebrastep 2.1
3.2

Countable compactness applied to V gives a finite subfamily V0,…,Vp with union X; each Vj is X∖Cm for some m, and taking Nj to be the least such m and N the largest of N0,…,Np gives Vj=X∖CNj⊆X∖CN for every j, since the Cn decrease. Hence X=X∖CN and CN=∅, contradicting bN∈CN. So a countably infinite subset of a countably compact space has a limit point in it, which is claim 1(d).

L1algebrastep 1.5step 2.3
4.1

Limit point compactness gives a limit point p of the infinite set A; some Um contains p, the set F:={x0,…,xm}∖{p} is closed by [L4] as a union of finitely many closed singletons, and W:=Um∖F is therefore open and contains p, hence is a neighbourhood of p meeting A∖{p}: there is n with xn∈W and xn≠p.

L1L4step 2.1step 3.1
4.2

Claim 3: given an infinite A⊆X with X countably compact, step 1.6 produces a countably infinite B⊆A, step 3.2 gives B a limit point p in X, and p is then a limit point of A by [L3], since B⊆A. So X is limit point compact.

L1L3step 1.6step 3.2
5.1

If n≤m then xn is one of x0,…,xm and differs from p, so xn∈F, contradicting xn∈W=Um∖F; hence n>m, so Um⊆U0∪⋯∪Un and xn∈W⊆Um contradicts xn∈En. No such U exists, so X is countably compact, which is claim 4.

L1step 2.1step 4.1
6.1

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.

step 1.1step 1.2step 1.3step 2.2step 4.2step 5.1∎

Remarks

The supplied proof of claim 3 pays dependent choice to construct a countably infinite subset of the given infinite set. Claim 1(d), the part of claim 3 that begins with an already supplied countably infinite subset, is free of that cost and is proved in ZF. No lower-bound claim is used here.

Why claim 4 needs the singleton hypothesis and claim 1(c) does not. A limit point of the set A built at step 2.1 need not be one of the xn 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

Used by

Dependency tree · two levels

56 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