Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-04 (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.

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

Statement

Let (X,d) be a metric space (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric), with compactness as in Open cover, subcover, compact metric space, and compact subset of a metric space and the three variants as in Countably compact, sequentially compact and limit point compact metric spaces. Then:

  1. If (X,d) is compact, it is countably compact.
  2. If (X,d) is compact, it is limit point compact.
  3. If (X,d) is countably compact, it is sequentially compact.
  4. If (X,d) is limit point compact, it is sequentially compact.

Every one of the four is a theorem of ZF. Where a subsequence is extracted, the index at each stage is the least admissible one, which The well-ordering principle makes canonical and The recursion theorem then assembles into a function; where finitely many indices have to be recovered from finitely many sets, Every natural-number-indexed list of nonempty sets has a choice function on its family of values supplies them and is itself a theorem of ZF. Nothing below appeals to countable or to dependent choice.

Facts & Assumptions

Given: A metric space (X,d), whichever of the four properties is assumed in the claim under proof.

[L1]

The definitions: (X,d) is compact when every family of open subsets with union X has a finite subfamily with union X; countably compact when every such family that is at most countable does; sequentially compact when every sequence has a subsequence converging in X; limit point compact when every infinite subset has a limit point in X, where p is a limit point of A when B(p,r)∩(A∖{p})≠∅ for every real r>0 (Open cover, subcover, compact metric space, and compact subset of a metric space, Countably compact, sequentially compact and limit point compact metric spaces, Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L4]

The closure S‾ is closed, contains S and is the smallest closed superset of S; and x∈S‾ exactly when B(x,r)∩S≠∅ for every real r>0 (The closure of a nonempty A is {x:d(x,A)=0}, equals A together with its limit points, and is the smallest closed superset, Interior, closure, boundary, limit point, isolated point and dense subset of a metric space).

[L5]

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)); when the recursion rule depends on the stage, it is applied to A=N×Z and the first coordinate of g(n) is n, by the small induction recorded in Finite sums and finite products, by recursion (The recursion theorem).

[L6]

Every nonempty subset of N has a least element (The well-ordering principle).

[L7]

A finite list n0,…,np of natural numbers has a greatest member: the reals ι(n0+1),…,ι(np+1), with ι the canonical natural of R (The canonical natural ι(n)=n⋅1F of a field), form a nonempty finite set of reals and so have a maximum, which is one of them, say ι(nj+1) (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set); m↦ι(m) is strictly increasing on the naturals ≥1 (Canonical naturals are positive and strictly increasing) and the order of N is linear (≤ is a linear order on N), so ni≤nj for every i≤p.

[L8]

A nonempty finite set of reals has a minimum, which is one of its members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L9]

Finiteness: a set listed as {a0,…,an} is finite, a nonempty finite set can be listed, and a subset of N bounded above is finite (Open cover, subcover, compact metric space, and compact subset of a metric space, Finite, countably infinite, countable, uncountable, Every subset of an at most countable set is at most countable); an injection carries a set to a set in bijection with its image (Injection, surjection, bijection).

[L10]

A family indexed by N is at most countable, being the image of a surjection from N (Finite, countably infinite, countable, uncountable, A nonempty set is at most countable iff it is a surjective image of N).

[L11]

xk→p when for every rational ε>0 there is K with d(xk,p)<ε for k≥K; and for every real ε>0 there is a natural N≥1 with 1/N<ε (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R, For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Every complete ordered field is Archimedean).

[L12]

An index map n:N→N with nk<nk+1 for every k is strictly increasing, and then nk≥k (A strictly increasing index map satisfies nk≥k).

[L13]

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

[L14]

A metric is symmetric and satisfies the triangle inequality, and d(x,y)=0 exactly when x=y (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

Proof

technique · direct
1.1

Claim 1 is immediate: an at most countable family of open sets with union X is in particular a family of open sets with union X, so compactness supplies the finite subfamily that countable compactness asks for.

L1
2.1

For claim 2, assume (X,d) compact, let A⊆X have no limit point in X, and put U:={ U⊆X:U open in X and U∩A has at most one element }, a family cut out by a property; U has union X, because each p∈X fails to be a limit point of A and so admits r>0 with B(p,r)∩(A∖{p})=∅, whence B(p,r)∈U and p∈B(p,r).

L1L3step 1.1
3.1

Compactness gives n∈N and U0,…,Un∈U with X=U0∪⋯∪Un, unless X=∅, in which case A=∅ is finite.

L1step 2.1
4.1

Define φ:A→σ(n) by letting φ(a) be the least i≤n with a∈Ui; this is well defined and canonical, and it is injective, since φ(a)=φ(b)=i puts both a and b in Ui∩A, a set with at most one element. Hence A is in bijection with φ[A], a subset of N bounded above by n, so A is finite.

L6L9step 3.1
5.1

So a subset of X with no limit point in X is finite; contrapositively every infinite subset of X has a limit point in X, and (X,d) is limit point compact: claim 2.

L1step 4.1
6.1

For claim 3, assume (X,d) countably compact, let (xk) be a sequence in X and put Tn:={ xk:k≥n }‾ for n∈N.

L1L4step 5.1
7.1

Each Tn is closed and contains xn, and Tm⊆Tn whenever m≥n, because {xk:k≥m}⊆{xk:k≥n}⊆Tn and Tm is the smallest closed superset of the first set.

L4step 6.1
8.1

Suppose for contradiction that ⋂n∈NTn=∅; then V:={ X∖Tn:n∈N } is an at most countable family of open subsets of X whose union is X∖⋂nTn=X.

L3L10step 7.1assume-contra
9.1

Countable compactness gives a finite subfamily V0,…,Vp of V with union X; putting Wi:=X∖Vi, each Wi equals Tn for at least one n, so finite choice applied to i↦{ n∈N:Tn=Wi } yields indices n0,…,np with Wi=Tni, and a greatest member nj of that list satisfies Tnj⊆Tni for every i≤p.

L7L13step 8.1
10.1

Then Tnj=Tn0∩⋯∩Tnp=X∖(V0∪⋯∪Vp)=∅, contradicting xnj∈Tnj.

step 7.1step 9.1discharge-contradiction
11.1

Hence there is p∈X with p∈Tn for every n∈N.

step 10.1
12.1

For every k∈N and every m∈N the set { j∈N:j>m and d(xj,p)<1/(k+2) } is nonempty, since p∈Tm+1 means that the ball B(p,1/(k+2)) meets {xj:j≥m+1}; so it has a least element, and likewise { j:d(xj,p)<1 } is nonempty and has a least element m0.

L4L6L11step 11.1
13.1

Applying recursion on N×N to the starting value (0,m0) and the rule f(k,m):=(k+1, the least j>m with d(xj,p)<1/(k+2)) produces g:N→N×N whose first coordinate at k is k; write nk for its second coordinate.

L5step 12.1
14.1

Then nk<nk+1 for every k, so k↦nk is strictly increasing, and d(xnk,p)<1/(k+1) for every k, the case k=0 being the choice of m0.

L12step 13.1
15.1

Given a rational ε>0 take a natural N≥1 with 1/N<ε; for k≥N one has k+1>N and so d(xnk,p)<1/(k+1)<1/N<ε. Hence xnk→p, the sequence (xk) has a convergent subsequence, and (X,d) is sequentially compact: claim 3.

L1L11step 14.1
16.1

For claim 4, assume (X,d) limit point compact, let (xk) be a sequence in X and let R:={ xk:k∈N } be its range, a nonempty subset of X.

L1step 15.1
17.1

Suppose first that R is finite, and list it as R={v0,…,vm}; putting Si:={ k∈N:xk=vi } for i≤m gives N=S0∪⋯∪Sm.

L9step 16.1
18.1

Some Si is unbounded in N: otherwise each Si has an upper bound in N and hence a least upper bound Ni, canonical by well-ordering, and a greatest member N of the list N0,…,Nm would satisfy N+1>Ni for every i, so that N+1 lies in no Si, against N=S0∪⋯∪Sm. Let i∗ be the least i≤m for which Si is unbounded.

L6L7step 17.1
19.1

Recursion applied to the starting value min⁡Si∗ and the rule f(m):=min⁡{ k∈Si∗:k>m }, each of these sets being nonempty because Si∗ is unbounded, produces a strictly increasing k↦nk with xnk=vi∗ for every k; a constant sequence converges to its value, so xnk→vi∗∈X.

L5L6L11L12L14step 18.1
20.1

Suppose instead that R is infinite; limit point compactness then gives a limit point p∈X of R.

L1step 19.1
21.1

Suppose for contradiction that some real r>0 and some N∈N satisfy d(xk,p)≥r for every k≥N.

step 20.1assume-contra
22.1

Let E be the set listed by r together with the N entries ek for k<N, where ek:=d(xk,p) if xk≠p and ek:=r otherwise; every listed entry is a positive real, so E is a nonempty finite set of positive reals and s:=min⁡E>0. Then B(p,s) misses R∖{p}: a point of R∖{p} is xk with xk≠p, and d(xk,p)≥r≥s when k≥N, while d(xk,p)=ek≥s when k<N. That contradicts p being a limit point of R.

L1L8L14step 21.1discharge-contradiction
23.1

Hence for every real r>0 and every N∈N there is k≥N with d(xk,p)<r.

step 22.1
24.1

Consequently, for every k and every m the set { j>m:d(xj,p)<1/(k+2) } is nonempty, as is { j:d(xj,p)<1 }, and the recursion of steps 13.1 and 14.1 applies verbatim, producing a strictly increasing k↦nk with d(xnk,p)<1/(k+1); by the estimate of step 15.1, xnk→p.

L5L6L11L12step 13.1step 14.1step 15.1step 23.1
25.1

In both cases (xk) has a subsequence converging in X, so (X,d) is sequentially compact: claim 4.

L1step 19.1step 24.1
26.1

Claims 1, 2, 3 and 4 are proved by steps 1.1, 5.1, 15.1 and 25.1 respectively.

step 1.1step 5.1step 15.1step 25.1∎

Remarks

Why "least" and not "some". At every stage of every recursion above, the next index is the least one meeting the requirement. That is what keeps the four implications inside ZF: a rule that says "take some admissible j" would be a selection made infinitely often, and one made in terms of the previous stage, which is dependent choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain) rather than countable choice. The same device is what A sequentially compact metric space is totally bounded, proved from the axiom of dependent choice cannot use, and that is exactly why that theorem, alone among the implications between the compactness properties on this page, costs dependent choice. It is not the only implication on the page with a choice cost: A complete, totally bounded metric space is compact, proved from countable choice used exactly once spends countable choice, for the different reason that it needs one net for every radius at once. The arrow-by-arrow accounting is 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.

Finite selections are free. Step 9.1 does select, but only over the finite index set {0,…,p}, and Every natural-number-indexed list of nonempty sets has a choice function on its family of values proves that such a selection exists in ZF by induction on the size of the index set. Nothing is being smuggled in: what a choice principle buys is infinitely many selections at once.

The two routes to sequential compactness are genuinely different. Claim 3 works with the closures of the tails of the given sequence and needs the countable cover they generate; claim 4 works with the range of the sequence and splits on whether it is finite. Neither argument subsumes the other, and both are needed, because the equivalence proved in 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 passes through both.

Depends on

Used by

Dependency tree · two levels

70 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