Alphabeta Math
Session-authored (Fable 5 assisted)
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.

25 results · all verified · 11 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full by a delegated reviewing agent on the owner's instruction; the judge is an additional, independent cross-model AI review of the proofs. The 14 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Compactness

1 · Prerequisites

2 · Summary

Objective. Compactness is the hypothesis under which an infinite covering argument collapses to a finite one. This page defines it for an arbitrary topological space, proves what it gives — closedness in a Hausdorff space, separation of disjoint compact sets, attainment of extreme values, automatic continuity of an inverse — and settles how it behaves under the constructions of general topology: subspaces, products of any size, continuous images, and the adjunction of a single point at infinity.

Compactness of a subset is intrinsic. Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right defines a compact space by open covers and calls a subset compact when the subspace it carries is compact. That is a statement about the topological subspace, so it is invariant under homeomorphism. For the same underlying set in another ambient, the answer is guaranteed to agree when the induced topology agrees. The bridge to the working form is A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it: a subset is compact exactly when every family of ambient open sets covering it has finitely many members that already cover it, in the indexed form as well as the unindexed one. Almost every proof below uses the indexed form, because a cover is normally produced by a rule attaching an open set to each point or to each index, and a bare set of open sets forgets the rule. The same reading was already fixed for metric spaces, and For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide shows that the two developments describe one notion, which is what makes the whole metric theory of compactness available here once a metric inducing the topology is named.

What compactness gives. A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection converts the covering condition into a statement about closed sets with the finite intersection property, which is the form used whenever a common point has to be produced. A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact and In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones are the two halves of the relationship between compactness and closedness, and the second carries more than its name: in a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, lie in disjoint open sets. Those separation clauses are proved choice-free, by collecting the family of all open sets that work rather than choosing one for each point, and they are what later pages use to separate closed sets in a compact Hausdorff space. A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism collects the payoff: a continuous image of a compact space is compact, a continuous real-valued function on a nonempty compact space attains a maximum and a minimum, and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism.

Products. Tube lemma: if KK is compact and an open NX×ZN \subseteq X \times Z contains K×{z0}K \times \{z_0\}, then NN contains K×WK \times W for some open Wz0W \ni z_0 is the step that makes a product of two compact spaces compact, and it is proved with no choice principle at all by indexing its cover with pairs of open sets; A product of finitely many compact spaces is compact in the product topology runs the induction. For an arbitrary index set the argument changes character: Alexander's subbase lemma: if every cover by members of a fixed subbasis has a finite subcover then the space is compact; the proof is an application of Zorn's lemma reduces compactness to covers by members of a fixed subbasis, using Zorn's lemma, and Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice then follows because a subbasic cover of a product restricts one coordinate at a time. Tychonoff's theorem implies the Axiom of Choice, so no proof of it can be free.

Weaker cousins, and what each implication costs. Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets introduces countable compactness, the Lindelöf property, sequential compactness, limit point compactness, σ\sigma-compactness and relative compactness, and identifies those of them that the metric development had already defined. 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 proves the implications one at a time rather than as a single equivalence, because an equivalence proved round a cycle charges every arrow the maximum: compactness gives countable compactness, the Lindelöf property and limit point compactness in ZF; sequential compactness gives countable compactness at the cost of countable choice; countable compactness gives limit point compactness at the cost of dependent choice, and the converse holds when singletons are closed, again at the cost of countable choice. A subset of Rn\mathbb{R}^n with the product topology is compact exactly when it is closed and bounded, the product topology being the Euclidean metric topology records that on Rn\mathbb{R}^n the product topology is the Euclidean one, so Heine-Borel applies unchanged.

Local compactness and the Baire property. Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space asks only that every point have a compact neighbourhood, and In a locally compact Hausdorff space every point has a neighbourhood base of compact sets, every open subspace and every closed subspace is locally compact, every open set around a point contains an open set with compact closure inside it, and every compact set sits inside an open set with compact closure shows what a Hausdorff hypothesis adds: a neighbourhood base of compact sets, the shrinking of any open set around a point to an open set with compact closure inside it, heredity along open and closed subspaces, and an open set with compact closure around any compact set. That shrinking clause is exactly what a nested construction needs, and Assuming dependent choice, every locally compact Hausdorff space is a Baire space runs one: every locally compact Hausdorff space is a Baire space (Baire space: a topological space in which every countable intersection of dense open subsets is dense), assuming dependent choice. The construction shrinks at stage nn into the nn-th dense open set, so the relation governing it changes with the stage; Dependent choice along a sequence of relations: if RnR_n is entire on AA for every nn, then from any aa there is a sequence with anRnan+1a_n \mathbin{R_n} a_{n+1} is the bridge from the single-relation form of dependent choice to that situation, and it is needed because a family of relations is not a relation.

One point at infinity. The one-point (Alexandroff) compactification X=X{}X^{*} = X \cup \{\infty\}, whose open sets are the open sets of XX together with the complements in XX^{*} of the closed compact subsets of XX adjoins a single point, constructed from the space rather than assumed to exist, and declares open the complements of the closed compact sets; the verification that this is a topology is carried out there. XX^{*} is compact and contains XX as an open subspace; XX is dense in XX^{*} exactly when XX is not compact; and XX^{*} is Hausdorff exactly when XX is locally compact and Hausdorff proves that the result is compact, that the original space sits inside it as an open subspace with its own topology, that it is dense exactly when the original space is not compact, and that the result is Hausdorff exactly when the original space is locally compact and Hausdorff.

Ordinals and the long ray. On an ordinal with its order topology the sets [0,β][0,\beta] and (α,β](\alpha,\beta] form a basis of clopen sets, the isolated points are exactly the non-limit ordinals, and the space is Hausdorff gives an ordinal space a basis of clopen sets and identifies its isolated points; Every successor ordinal is compact in its order topology and every limit ordinal is not; and, assuming countable choice, ω1\omega_1 is countably compact and sequentially compact while ω1+1\omega_1 + 1 is compact shows that a successor ordinal is compact and a limit ordinal is not, and that ω1\omega_1 is sequentially compact and countably compact without being compact, assuming countable choice. Every closed initial segment of the long ray is compact; the long ray is not compact; and, assuming countable choice, it is countably compact and not Lindel"of proves a Heine-Borel theorem for the closed initial segments of the long ray, using only order density and the least upper bound property, and deduces that the ray is not compact — a theorem of ZF — and, assuming countable choice, that it is countably compact and not Lindelöf. Both spaces are the standard witnesses for the false statements that close the page. In a compact Hausdorff space every quasicomponent is connected, so quasicomponents and components coincide is the last theorem: in a compact Hausdorff space the quasicomponents are connected, so the two decompositions of a space into connected pieces agree.

The ledger. The quasicompact convention, why compactness of a subset is read intrinsically here, and what each result on this page costs in choice settles the conventions in force — that compact means the covering condition alone and never includes a Hausdorff hypothesis, that compactness of a subset is intrinsic, and that relative compactness is the one notion here that is not — and then records, result by result, which arguments are theorems of ZF and which spend the Axiom of Choice, countable choice or dependent choice. Every entry is a statement about the proof given here and never a claim that a choice principle is necessary.

False statements close the page, each with a witness: that a compact subset is closed in every space, that compactness and sequential compactness imply each other, that countable compactness implies compactness, and that local compactness is hereditary. The worked witnesses, together with the compactness of the interval, the Cantor set and the Hilbert cube, are on the companion page.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right

Definition

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

  • An open cover of (X,T)(X,\mathcal{T}) is a family UT\mathcal{U} \subseteq \mathcal{T} of open sets with X=UX = \bigcup \mathcal{U}, where U={xX:xU for some UU}\bigcup \mathcal{U} = \{\, x \in X : x \in U \text{ for some } U \in \mathcal{U} \,\}.
  • A subcover of U\mathcal{U} is a subfamily VU\mathcal{V} \subseteq \mathcal{U} that is itself an open cover.
  • A family V\mathcal{V} of sets is finite when V=\mathcal{V} = \varnothing or there are nNn \in \mathbb{N} and sets V0,,VnV_0, \dots, V_n with V={V0,,Vn}\mathcal{V} = \{V_0, \dots, V_n\}; repetitions in the list are allowed and harmless.
  • (X,T)(X,\mathcal{T}) is compact when every open cover of it has a finite subcover: for every open cover U\mathcal{U}, either X=X = \varnothing and the empty subfamily covers it, or there are nNn \in \mathbb{N} and U0,,UnUU_0, \dots, U_n \in \mathcal{U} with X=U0Un.X = U_0 \cup \dots \cup U_n .
  • A subset AXA \subseteq X is a compact subset of XX when the subspace (A,TA)(A, \mathcal{T}_A) is a compact topological space, TA\mathcal{T}_A being the subspace topology (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

Compactness of a subset is defined intrinsically, and only intrinsically. The last clause speaks about the subspace (A,TA)(A, \mathcal{T}_A) and its own open sets, not about families of open subsets of the ambient XX. The two readings do agree, but that is a theorem and not a convention: it is A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, and no item of this library may use the ambient reading without citing it. Taking the intrinsic reading makes compactness a property of the topological space (A,TA)(A, \mathcal{T}_A) alone. Hence it is preserved when AA is embedded homeomorphically as a subspace, or when another ambient space induces the same topology on AA; it need not be preserved if the induced topology changes. This is exactly the convention already fixed for metric spaces by Open cover, subcover, compact metric space, and compact subset of a metric space, and the agreement of that definition with this one is For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide.

The empty space is compact, since the empty subfamily of any family covers it; this is the reason the clause above is written with the two cases. Every space listed as {x0,,xn}\{x_0, \dots, x_n\} is compact too: given a cover, each xix_i lies in some member, and finitely many members named in this way already cover. So every finite space is compact, whatever its topology, and in particular the discrete topology on a finite set is compact while the discrete topology on an infinite set is not (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

The finiteness convention. "Finite" above is the listing form. It agrees with the definition of finiteness by equinumerosity with a natural number (Finite, countably infinite, countable, uncountable), in both directions, and the agreement is the one already discharged in Open cover, subcover, compact metric space, and compact subset of a metric space: a nonempty set equinumerous with m1m \ge 1 is listable, and a set listed as {a0,,an}\{a_0, \dots, a_n\} injects into σ(n)\sigma(n) by sending xx to the least ini \le n with ai=xa_i = x. Neither direction uses a choice principle; the second selects nothing, taking a least index instead.

Quasicompact is not used here. Some authors, following Bourbaki, reserve compact for a space that is both compact in the above sense and Hausdorff, and call the open-cover condition alone quasicompact. This library follows the more widely adopted convention: compact means the open-cover condition and nothing more, and a Hausdorff hypothesis is always written out. The fork is recorded in The quasicompact convention, why compactness of a subset is read intrinsically here, and what each result on this page costs in choice.

Remarks

Why open covers rather than covers by arbitrary sets. Nothing in the definition would break if U\mathcal{U} were allowed to consist of arbitrary subsets of XX, but the resulting notion would be uninteresting: every space is covered by its singletons, and only a finite space would survive. Openness of the members is what makes the condition a genuine restriction, and it is what A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it has to keep track of when the ambient space changes.

A warning about the word "cover". A family may cover AXA \subseteq X without being a family of subsets of AA: the members are open subsets of XX and their union merely contains AA. That is the ambient reading, and it is a different statement from "U\mathcal{U} is an open cover of the space (A,TA)(A, \mathcal{T}_A)", whose members are open subsets of AA. Which of the two is meant is written out everywhere on this page.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it

Statement

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), let AXA \subseteq X and let (A,TA)(A, \mathcal{T}_A) be the subspace (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace). Then:

  1. Compactness read in the ambient space. AA is a compact subset of XX (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right), that is (A,TA)(A, \mathcal{T}_A) is a compact space, if and only if for every family UT\mathcal{U} \subseteq \mathcal{T} with AUA \subseteq \bigcup \mathcal{U} there are nNn \in \mathbb{N} and U0,,UnUU_0, \dots, U_n \in \mathcal{U} with AU0UnA \subseteq U_0 \cup \dots \cup U_n, or else A=A = \varnothing.
  2. The same in indexed form. AA is a compact subset of XX if and only if for every set II and every family (Ui)iI(U_i)_{i \in I} of open subsets of XX with AiIUiA \subseteq \bigcup_{i \in I} U_i there are nNn \in \mathbb{N} and indices i0,,inIi_0, \dots, i_n \in I with AUi0UinA \subseteq U_{i_0} \cup \dots \cup U_{i_n}, or else A=A = \varnothing.

Claim 2 is the form used by almost every later proof on this page, because a cover is usually produced by a rule that attaches an open set to each point or to each index, and a set of open sets forgets that rule. No choice principle is used anywhere below; the one place a selection is made is over a finite index set, and Every natural-number-indexed list of nonempty sets has a choice function on its family of values is a theorem of ZF.

Facts & Assumptions

Given: A topological space (X,T)(X, \mathcal{T}), a subset AXA \subseteq X, and the subspace (A,TA)(A, \mathcal{T}_A) with TA={UA:UT}\mathcal{T}_A = \{\, U \cap A : U \in \mathcal{T} \,\}.

[L1]

A subset of AA is open in (A,TA)(A, \mathcal{T}_A) exactly when it is the trace UAU \cap A of a set UU open in XX, this being the definition of the subspace topology (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

[L2]

(A,TA)(A, \mathcal{T}_A) is compact exactly when every family of sets open in (A,TA)(A, \mathcal{T}_A) whose union is AA has a finite subfamily whose union is AA; a family is finite when it is empty or listable as {V0,,Vn}\{V_0, \dots, V_n\} (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

[L3]

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

Proof

technique · direct
1.1

Suppose (A,TA)(A, \mathcal{T}_A) is compact, let II be a set and let (Ui)iI(U_i)_{i \in I} be open subsets of XX with AiIUiA \subseteq \bigcup_{i \in I} U_i; then each UiAU_i \cap A is open in (A,TA)(A, \mathcal{T}_A) and V:={UiA:iI}\mathcal{V} := \{\, U_i \cap A : i \in I \,\} is a family of open subsets of AA whose union is AA.

L1L2
2.1

If A=A = \varnothing the conclusion of claim 2 holds by its second alternative, so assume AA \ne \varnothing; then V\mathcal{V} is an open cover of (A,TA)(A, \mathcal{T}_A), and compactness yields nNn \in \mathbb{N} and V0,,VnVV_0, \dots, V_n \in \mathcal{V} with A=V0VnA = V_0 \cup \dots \cup V_n.

L2step 1.1
3.1

For each jnj \le n the set Sj:={iI:UiA=Vj}S_j := \{\, i \in I : U_i \cap A = V_j \,\} is nonempty by the definition of V\mathcal{V}, and jSjj \mapsto S_j is a function with domain the natural number σ(n)\sigma(n), so a choice function for its values supplies i0,,inIi_0, \dots, i_n \in I with UijA=VjU_{i_j} \cap A = V_j for every jnj \le n.

L3step 2.1
4.1

Hence A=V0Vn=(Ui0A)(UinA)Ui0UinA = V_0 \cup \dots \cup V_n = (U_{i_0} \cap A) \cup \dots \cup (U_{i_n} \cap A) \subseteq U_{i_0} \cup \dots \cup U_{i_n}, which is the conclusion of claim 2 for the family (Ui)iI(U_i)_{i \in I}, so the forward implication of claim 2 holds.

step 2.1step 3.1
5.1

The converse of claim 2 remains, the forward implication having been settled at step 4.1; so assume the displayed condition, let G\mathcal{G} be a family of sets open in (A,TA)(A, \mathcal{T}_A) with union AA, and put W:={UT:UAG}\mathcal{W} := \{\, U \in \mathcal{T} : U \cap A \in \mathcal{G} \,\}, a family cut out by a property and indexed by itself.

L1step 4.1construct
6.1

AWA \subseteq \bigcup \mathcal{W}: given aAa \in A there is GGG \in \mathcal{G} with aGa \in G, and by [L1] there is UU open in XX with UA=GU \cap A = G; that UU lies in W\mathcal{W} and contains aa.

L1step 5.1
7.1

If A=A = \varnothing the empty subfamily of G\mathcal{G} covers AA; otherwise the assumed condition applied to the family W\mathcal{W} indexed by itself gives mNm \in \mathbb{N} and W0,,WmWW_0, \dots, W_m \in \mathcal{W} with AW0WmA \subseteq W_0 \cup \dots \cup W_m.

step 5.1step 6.1
8.1

Putting Gj:=WjAG_j := W_j \cap A for jmj \le m gives members of G\mathcal{G} with A=(W0A)(WmA)=G0GmA = (W_0 \cap A) \cup \dots \cup (W_m \cap A) = G_0 \cup \dots \cup G_m, so G\mathcal{G} has a finite subcover and (A,TA)(A, \mathcal{T}_A) is compact.

L2step 7.1
9.1

Claim 2 is proved by steps 4.1 and 8.1, and claim 1 is the special case of claim 2 in which I=UI = \mathcal{U} is a family of open subsets of XX and Ui:=iU_i := i, the conclusion of claim 2 then naming members of U\mathcal{U} itself.

step 4.1step 8.1

Remarks

Why the ambient reading needed a proof at all. A subset AA of XX carries two candidate notions of open cover: families of sets open in (A,TA)(A, \mathcal{T}_A), and families of sets open in XX whose union contains AA. The trace description of the subspace topology is what turns one into the other, and it shows that compactness can be checked using ambient open sets for this fixed induced topology. Another ambient is guaranteed to give the same answer when it induces the same topology on AA; if the induced topology changes, the answer may change. Every later item on this page that covers a subset by ambient open sets is using claim 1 or claim 2, and says so.

The traces do not remember their sources. A single relatively open VV is usually the trace of many different ambient open sets, and that is exactly why step 3.1 has to recover indices at all. Recovering infinitely many at once would be a choice principle; recovering finitely many is not, and the proof is arranged so that only finitely many are ever needed.

The metric statement of the same fact is A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, whose claims 2 and 3 are claims 1 and 2 above with the open subsets of a metric space in place of the members of an abstract topology. Its proof carries an extra first claim, that relative openness in a metric subspace is a trace, which here is the definition of the subspace topology and so needs no argument. Neither statement is used in the proof of the other; that the two agree is For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide

Statement

Let (X,d)(X,d) be a metric space (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric) and let Td\mathcal{T}_d be its metric topology (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), so that (X,Td)(X, \mathcal{T}_d) is a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and is metrizable (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). Then:

  1. (X,d)(X,d) is a compact metric space (Open cover, subcover, compact metric space, and compact subset of a metric space) if and only if (X,Td)(X, \mathcal{T}_d) is a compact topological space (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).
  2. For every AXA \subseteq X: AA is a compact subset of the metric space (X,d)(X,d) if and only if AA is a compact subset of the topological space (X,Td)(X, \mathcal{T}_d), the two readings of "compact subset" being the metric subspace (A,dA)(A, d_A) (Isometry, isometric embedding, and the subspace metric on a subset) and the topological subspace (A,(Td)A)(A, (\mathcal{T}_d)_A) (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

Nothing here is a coincidence and nothing is transported. The open-cover condition of Open cover, subcover, compact metric space, and compact subset of a metric space quantifies over families of subsets open in (X,d)(X,d), and by 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 those are exactly the members of Td\mathcal{T}_d; so the two conditions are not merely equivalent, they are the same condition written twice. No choice principle is used.

Facts & Assumptions

Given: A metric space (X,d)(X,d), its metric topology Td\mathcal{T}_d, and a subset AXA \subseteq X.

[L1]

A subset UXU \subseteq X is open in (X,d)(X,d) exactly when UTdU \in \mathcal{T}_d, and Td\mathcal{T}_d satisfies (T1), (T2) and (T3), so (X,Td)(X, \mathcal{T}_d) is a topological space and is metrizable (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, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).

[L2]

(X,d)(X,d) is a compact metric space exactly when every family of subsets open in (X,d)(X,d) whose union is XX has a finite subfamily whose union is XX; and AA is a compact subset of (X,d)(X,d) exactly when the metric subspace (A,dA)(A, d_A) is a compact metric space (Open cover, subcover, compact metric space, and compact subset of a metric space, Isometry, isometric embedding, and the subspace metric on a subset).

[L3]

(X,Td)(X, \mathcal{T}_d) is a compact topological space exactly when every family of members of Td\mathcal{T}_d whose union is XX has a finite subfamily whose union is XX; and AA is a compact subset of (X,Td)(X, \mathcal{T}_d) exactly when the subspace (A,(Td)A)(A, (\mathcal{T}_d)_A) is a compact topological space (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

Proof

technique · direct
1.1

The subsets of XX open in the metric space (X,d)(X,d) and the subsets of XX open in the topological space (X,Td)(X, \mathcal{T}_d) are one and the same family, namely Td\mathcal{T}_d.

L1
1.2

The subspace topology (Td)A(\mathcal{T}_d)_A and the metric topology of dAd_A are one and the same topology on AA, so the topological subspace of (X,Td)(X, \mathcal{T}_d) carried by AA and the metric subspace (A,dA)(A, d_A) with its own metric topology are one topological space.

L4
2.1

Hence a family of subsets of XX is an open cover of the metric space (X,d)(X,d) exactly when it is an open cover of the topological space (X,Td)(X, \mathcal{T}_d), and a subfamily of one is a subfamily of the other; so "every open cover has a finite subcover" is one condition and not two, and (X,d)(X,d) is a compact metric space exactly when (X,Td)(X, \mathcal{T}_d) is a compact topological space, which is claim 1.

L2L3step 1.1
3.1

Step 2.1 was proved for an arbitrary metric space, so it applies to (A,dA)(A, d_A): the metric space (A,dA)(A, d_A) is compact exactly when AA carrying the metric topology of dAd_A is a compact topological space.

step 2.1
4.1

Combining, AA is a compact subset of (X,d)(X,d) exactly when (A,dA)(A,d_A) is a compact metric space, exactly when AA with the metric topology of dAd_A is a compact topological space, exactly when (A,(Td)A)(A, (\mathcal{T}_d)_A) is a compact topological space, exactly when AA is a compact subset of (X,Td)(X, \mathcal{T}_d); this is claim 2.

L2L3step 1.2step 3.1

Remarks

What this theorem buys, and why it is stated so early on the page. Every theorem proved on compactness-in-metric-spaces about compact metric spaces and their compact subsets is, by this theorem, a theorem about metrizable topological spaces and their compact subsets, once a metric inducing the topology has been named. Heine-Borel in Rn\mathbb{R}^n (Heine-Borel in Rn\mathbb{R}^n: with the Euclidean metric a subset of Rn\mathbb{R}^n is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line), the extreme value theorem (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value) and the equivalence of the four compactness conditions for metric spaces (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) are all available in that form and are used below without being reproved.

It also forbids a second notion. Since the metric development already fixed the intrinsic reading of "compact subset" (Open cover, subcover, compact metric space, and compact subset of a metric space) and this page fixes the same reading (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right), claim 2 says that the phrase means one thing throughout the library, whichever of the two developments a reader arrives from. Had either page taken the ambient reading as its definition the phrase would have meant two things, and the agreement would have had to be proved through A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it and A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it rather than directly.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (claude-sonnet-5 + deepseek-v4-pro)verified 2026-08-05 (claude-sonnet-5)Open item page →

A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection

Statement

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison). For a family A\mathcal{A} of subsets of XX write

A  :=  {xX:xA for every AA},\bigcap \mathcal{A} \;:=\; \{\, x \in X : x \in A \text{ for every } A \in \mathcal{A} \,\},

so that =X\bigcap \varnothing = X, matching the convention for the empty finite intersection in Finite intersection property. Then:

  1. (X,T)(X, \mathcal{T}) is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right) if and only if every family A\mathcal{A} of closed subsets of XX with the finite intersection property (Finite intersection property) satisfies A\bigcap \mathcal{A} \ne \varnothing.
  2. Equivalently: (X,T)(X, \mathcal{T}) is compact if and only if every family of closed subsets of XX that is contained in some filter on XX (Filter on a set) has nonempty intersection, a family of subsets of XX lying in a filter exactly when it has the finite intersection property (A family lies in a filter exactly when it has the finite intersection property).

No choice principle is used in either direction: complementation is a canonical bijection, so no member of a family ever has to be selected.

Facts & Assumptions

Given: A topological space (X,T)(X, \mathcal{T}).

[A1]

For a family A\mathcal{A} of subsets of XX write Ac:={XA:AA}\mathcal{A}^{c} := \{\, X \setminus A : A \in \mathcal{A} \,\}.

[L1]

A subset FXF \subseteq X is closed exactly when XFTX \setminus F \in \mathcal{T}, and X(XF)=FX \setminus (X \setminus F) = F for every FXF \subseteq X (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L2]

(X,T)(X, \mathcal{T}) is compact exactly when every family UT\mathcal{U} \subseteq \mathcal{T} with U=X\bigcup \mathcal{U} = X has a finite subfamily with union XX, a family being finite when it is empty or listable as {V0,,Vn}\{V_0, \dots, V_n\} for some nNn \in \mathbb{N} (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

[L3]

A\mathcal{A} has the finite intersection property when ins(i)\bigcap_{i \in n} s(i) \ne \varnothing for every nNn \in \mathbb{N} and every finite list s:nAs : n \to \mathcal{A}, the intersection over n=0n = 0 being XX (Finite intersection property).

[L4]

A family of subsets of XX is contained in some filter on XX if and only if it has the finite intersection property (A family lies in a filter exactly when it has the finite intersection property, Filter on a set).

Proof

technique · direct
1.1

The operation AAc\mathcal{A} \mapsto \mathcal{A}^{c} of [A1] carries families of closed subsets of XX to families of open subsets of XX and back, and satisfies (Ac)c=A(\mathcal{A}^{c})^{c} = \mathcal{A}, so it is a bijection between the two collections.

A1L1
1.2

For every family A\mathcal{A} of subsets of XX one has XA=AcX \setminus \bigcap \mathcal{A} = \bigcup \mathcal{A}^{c}, since a point of XX fails to lie in every member of A\mathcal{A} exactly when it lies in the complement of some member; with =X\bigcap \varnothing = X and =\bigcup \varnothing = \varnothing the identity also holds at A=\mathcal{A} = \varnothing. Hence A=\bigcap \mathcal{A} = \varnothing if and only if Ac=X\bigcup \mathcal{A}^{c} = X.

A1L1L3
2.1

The same identity applied to finitely many members: for nNn \in \mathbb{N} and a finite list s:nAs : n \to \mathcal{A} one has ins(i)=\bigcap_{i \in n} s(i) = \varnothing exactly when {Xs(i):in}\{\, X \setminus s(i) : i \in n \,\}, a finite subfamily of Ac\mathcal{A}^{c}, has union XX; and every finite subfamily of Ac\mathcal{A}^{c} arises from such a list. So A\mathcal{A} has the finite intersection property if and only if no finite subfamily of Ac\mathcal{A}^{c} has union XX.

L2L3step 1.1step 1.2
3.1

Assume (X,T)(X, \mathcal{T}) is compact and let A\mathcal{A} be a family of closed subsets of XX with A=\bigcap \mathcal{A} = \varnothing; then Ac\mathcal{A}^{c} is a family of open sets by step 1.1 and has union XX by step 1.2, so it is an open cover, compactness supplies a finite subfamily of it with union XX, and by step 2.1 the family A\mathcal{A} fails the finite intersection property. Contraposing over A\mathcal{A}: every family of closed subsets of XX with the finite intersection property has nonempty intersection.

L2step 1.1step 1.2step 2.1
3.2

Conversely assume every family of closed subsets of XX with the finite intersection property has nonempty intersection, and let U\mathcal{U} be an open cover of XX; then A:=Uc\mathcal{A} := \mathcal{U}^{c} is a family of closed subsets of XX with Ac=U\mathcal{A}^{c} = \mathcal{U} by step 1.1 and A=\bigcap \mathcal{A} = \varnothing by step 1.2, so A\mathcal{A} fails the finite intersection property, and by step 2.1 some finite subfamily of U\mathcal{U} has union XX. So every open cover of XX has a finite subcover and (X,T)(X, \mathcal{T}) is compact.

L2step 1.1step 1.2step 2.1
4.1

Claim 1 is proved by steps 3.1 and 3.2, and claim 2 follows from it by [L4], which replaces the phrase "has the finite intersection property" by "is contained in some filter on XX" without changing what is being quantified over.

L4step 3.1step 3.2

Remarks

What the condition says, and why it is the useful form. Compactness in the open-cover form is a statement about families that already cover; the closed-set form is a statement about families that already have all their finite intersections nonempty. In practice the second is easier to apply, because a nested family of nonempty closed sets has the finite intersection property for free, and the theorem then produces a point lying in all of them at once. That is how it is used below in Assuming dependent choice, every locally compact Hausdorff space is a Baire space, whose step 7.1 turns a decreasing sequence of nonempty closed sets into a point common to all of them. In a compact Hausdorff space every quasicomponent is connected, so quasicomponents and components coincide uses the theorem in the opposite direction: from a family of closed sets whose intersection is empty it extracts a finite subfamily whose intersection is already empty.

The finite intersection property is not a topological notion. Finite intersection property is a condition on an arbitrary family of subsets of a set, and A family lies in a filter exactly when it has the finite intersection property shows it is exactly the condition for the family to sit inside a filter. The topology enters this theorem only through the word "closed"; the theorem is that compactness of the topology is what makes that combinatorial condition detect a common point.

The metric special case is A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection, stated there for a metric space and its closed sets. It is not used above, and it is not needed: by For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide the metric statement is the present one applied to a metric topology.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact

Statement

Let (X,T)(X, \mathcal{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 subspaces as in Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace and compactness as in Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right. Then:

  1. Closed in compact is compact. If (X,T)(X, \mathcal{T}) is compact and FXF \subseteq X is closed in XX, then FF is a compact subset of XX.
  2. Finite unions. If nNn \in \mathbb{N} and K0,,KnK_0, \dots, K_n are compact subsets of XX, then K0KnK_0 \cup \dots \cup K_n is a compact subset of XX. The union of the empty list is \varnothing, which is a compact subset of every space.

Claim 1 needs XX to be compact and claim 2 does not; no hypothesis of any kind is placed on XX in claim 2. No choice principle is used: claim 1 selects nothing, taking a least index where a selection would be natural, and claim 2 makes finitely many selections through Every natural-number-indexed list of nonempty sets has a choice function on its family of values, a theorem of ZF.

Facts & Assumptions

Given: A topological space (X,T)(X, \mathcal{T}).

[L1]

(X,T)(X, \mathcal{T}) is compact exactly when every family of open subsets of XX with union XX has a finite subfamily with union XX; a subset AXA \subseteq X is a compact subset when the subspace (A,TA)(A, \mathcal{T}_A) is compact; and a family is finite when it is empty or listable as {V0,,Vn}\{V_0, \dots, V_n\} for some nNn \in \mathbb{N}, repetitions allowed (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

[L2]

AXA \subseteq X is a compact subset of XX exactly when for every family U\mathcal{U} of open subsets of XX with AUA \subseteq \bigcup \mathcal{U} there are nNn \in \mathbb{N} and U0,,UnUU_0, \dots, U_n \in \mathcal{U} with AU0UnA \subseteq U_0 \cup \dots \cup U_n, or else A=A = \varnothing (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, claim 1).

[L3]

FXF \subseteq X is closed exactly when XFX \setminus F is open (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L4]

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

Proof

technique · direct
1.1

For claim 1, let (X,T)(X, \mathcal{T}) be compact, let FXF \subseteq X be closed and let U\mathcal{U} be a family of open subsets of XX with FUF \subseteq \bigcup \mathcal{U}; put W:=U{XF}\mathcal{W} := \mathcal{U} \cup \{\, X \setminus F \,\}, a family of open subsets of XX with W=X\bigcup \mathcal{W} = X, since every point outside FF lies in XFX \setminus F and every point of FF lies in some member of U\mathcal{U}.

L2L3construct
1.2

For claim 2, let nNn \in \mathbb{N}, let K0,,KnK_0, \dots, K_n be compact subsets of XX, put K:=K0KnK := K_0 \cup \dots \cup K_n and let U\mathcal{U} be a family of open subsets of XX with KUK \subseteq \bigcup \mathcal{U}; then KmUK_m \subseteq \bigcup \mathcal{U} for every mnm \le n, so by [L2] the set TmT_m of finite subfamilies of U\mathcal{U} whose union contains KmK_m is nonempty, the empty subfamily belonging to it when Km=K_m = \varnothing.

L1L2construct
2.1

If X=X = \varnothing then F=F = \varnothing and the second alternative of [L2] holds for FF; otherwise compactness of XX applied to W\mathcal{W} gives nNn \in \mathbb{N} and W0,,WnWW_0, \dots, W_n \in \mathcal{W} with X=W0WnX = W_0 \cup \dots \cup W_n.

L1step 1.1
2.2

The assignment mTmm \mapsto T_m is a function with domain the natural number σ(n)\sigma(n) all of whose values are nonempty, so a choice function for its values supplies finite subfamilies V0,,Vn\mathcal{V}_0, \dots, \mathcal{V}_n of U\mathcal{U} with KmVmK_m \subseteq \bigcup \mathcal{V}_m for every mnm \le n.

L4step 1.2
3.1

Assume FF \ne \varnothing, the case F=F = \varnothing being settled at step 2.1, and fix xFx \in F; then xWjx \in W_j for some jnj \le n, and xXFx \notin X \setminus F, so that WjXFW_j \ne X \setminus F and hence WjUW_j \in \mathcal{U}. Let j0j_0 be the least jnj \le n with WjUW_j \in \mathcal{U}, which exists by the previous sentence, and put Vj:=WjV_j := W_j when WjUW_j \in \mathcal{U} and Vj:=Wj0V_j := W_{j_0} otherwise; then V0,,VnUV_0, \dots, V_n \in \mathcal{U}, and nothing has been selected, j0j_0 being the least admissible index.

step 2.1construct
3.2

The family V:=V0Vn\mathcal{V} := \mathcal{V}_0 \cup \dots \cup \mathcal{V}_n is a subfamily of U\mathcal{U}; it is finite, a union of finitely many listable families being listed by concatenating their lists; and K=K0KnVK = K_0 \cup \dots \cup K_n \subseteq \bigcup \mathcal{V}, since each KmK_m lies inside VmV\bigcup \mathcal{V}_m \subseteq \bigcup \mathcal{V}. So V\mathcal{V} is empty, in which case K=K = \varnothing, or listable as {U0,,Up}\{U_0, \dots, U_p\} with KU0UpK \subseteq U_0 \cup \dots \cup U_p; by [L2] the set KK is a compact subset of XX, which is claim 2.

L1L2algebrastep 2.2
4.1

FV0VnF \subseteq V_0 \cup \dots \cup V_n: given yFy \in F there is jnj \le n with yWjy \in W_j, and yFy \in F forces WjXFW_j \ne X \setminus F, hence WjUW_j \in \mathcal{U} and Vj=WjyV_j = W_j \ni y. Since V0,,VnV_0, \dots, V_n are members of U\mathcal{U}, [L2] gives that FF is a compact subset of XX, the case F=F = \varnothing having been settled at step 2.1.

L2step 2.1step 3.1
5.1

Claim 1 is step 4.1 and claim 2 is step 3.2, and the final sentence of claim 2 is the compactness of the empty space, which holds because the empty subfamily of any family covers it.

L1step 3.2step 4.1

Remarks

Claim 1 is where the two hypotheses do different work. Compactness of XX supplies a finite subcover of XX; closedness of FF is what makes XFX \setminus F available as one more open set, so that a cover of FF can be enlarged to a cover of XX by adding a single member. Neither hypothesis can be dropped: an open subspace of a compact space need not be compact, and without compactness of XX there is nothing to thin.

The converse of claim 1 fails, and that is the subject of the next item. A compact subset of an arbitrary space need not be closed; it is closed as soon as the ambient space is Hausdorff (In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones), and FALSE: a compact subset of a topological space is closed records the failure without that hypothesis.

The metric special case is A closed subset of a compact metric space is compact. It is stated there for a closed subset of a compact metric space and is not used above; by For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide it is claim 1 applied to a metric topology. The general theorem is proved from the general definitions and borrows nothing from the metric development, which is why the metric statement does not appear among its dependencies.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones

Statement

Let (X,T)(X, \mathcal{T}) be a Hausdorff topological space (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), with compact subsets as in Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right. Then:

  1. A point and a disjoint compact set are separated. If KXK \subseteq X is compact and xXKx \in X \setminus K, there are U,VTU, V \in \mathcal{T} with xU,KV,UV=.x \in U, \qquad K \subseteq V, \qquad U \cap V = \varnothing .
  2. Two disjoint compact sets are separated. If K,LXK, L \subseteq X are compact and KL=K \cap L = \varnothing, there are U,VTU, V \in \mathcal{T} with LU,KV,UV=.L \subseteq U, \qquad K \subseteq V, \qquad U \cap V = \varnothing .
  3. Compact implies closed. Every compact subset of XX is closed in XX.
  4. In a compact Hausdorff space the two classes coincide. If in addition (X,T)(X, \mathcal{T}) is compact, then a subset of XX is compact if and only if it is closed.

The proof is written choice-free, and that is not a stylistic preference. The textbook argument says "for each yKy \in K choose disjoint open Uy,VyU_y, V_y", which is a selection over an arbitrary index set and therefore an appeal to the full Axiom of Choice. What is done below instead is to take the family of all open VV that admit some open UxU \ni x disjoint from them — a family cut out by a formula, with nothing selected — extract a finite subcover from it, and only then make finitely many selections, which Every natural-number-indexed list of nonempty sets has a choice function on its family of values supplies as a theorem of ZF.

Facts & Assumptions

Given: A Hausdorff topological space (X,T)(X, \mathcal{T}).

[A1]

For all x,yXx, y \in X with xyx \ne y there are U,VTU, V \in \mathcal{T} with xUx \in U, yVy \in V and UV=U \cap V = \varnothing (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not).

[L1]

\varnothing and XX are open, an arbitrary union of open sets is open, the intersection of finitely many open sets is open when at least one is taken, and a subset is closed exactly when its complement is open (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L2]

A subset AXA \subseteq X is a compact subset of XX exactly when for every family U\mathcal{U} of open subsets of XX with AUA \subseteq \bigcup \mathcal{U} there are nNn \in \mathbb{N} and U0,,UnUU_0, \dots, U_n \in \mathcal{U} with AU0UnA \subseteq U_0 \cup \dots \cup U_n, or else A=A = \varnothing (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, claim 1; Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

[L3]

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

[L4]

A closed subset of a compact space is a compact subset of it (A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact, claim 1).

Proof

technique · direct
1.1

For claim 1 fix a compact KXK \subseteq X and a point xXKx \in X \setminus K, and put V:={VT:UV= for some UT with xU}\mathcal{V} := \{\, V \in \mathcal{T} : U \cap V = \varnothing \text{ for some } U \in \mathcal{T} \text{ with } x \in U \,\}, a family cut out by a property of VV alone and not by any selection.

construct
2.1

KVK \subseteq \bigcup \mathcal{V}: given yKy \in K we have yxy \ne x, since xKx \notin K, so [A1] provides U,VTU, V \in \mathcal{T} with xUx \in U, yVy \in V and UV=U \cap V = \varnothing; that VV belongs to V\mathcal{V} and contains yy.

A1step 1.1
3.1

If K=K = \varnothing then U:=XU := X and V:=V := \varnothing satisfy claim 1; otherwise [L2] applied to the family V\mathcal{V} gives nNn \in \mathbb{N} and V0,,VnVV_0, \dots, V_n \in \mathcal{V} with KV0VnK \subseteq V_0 \cup \dots \cup V_n.

L1L2step 1.1step 2.1
4.1

For each jnj \le n the set Sj:={UT:xU and UVj=}S_j := \{\, U \in \mathcal{T} : x \in U \text{ and } U \cap V_j = \varnothing \,\} is nonempty, because VjVV_j \in \mathcal{V}; and jSjj \mapsto S_j is a function with domain the natural number σ(n)\sigma(n), so a choice function for its values supplies U0,,UnTU_0, \dots, U_n \in \mathcal{T} with xUjx \in U_j and UjVj=U_j \cap V_j = \varnothing for every jnj \le n.

L3step 3.1
5.1

Put U:=U0UnU := U_0 \cap \dots \cap U_n and V:=V0VnV := V_0 \cup \dots \cup V_n; both are open by [L1], xUx \in U because xUjx \in U_j for every jj, KVK \subseteq V by step 3.1, and UV=U \cap V = \varnothing because a point of UVU \cap V would lie in some VjV_j and in UUjU \subseteq U_j, contradicting UjVj=U_j \cap V_j = \varnothing. So claim 1 holds.

L1step 3.1step 4.1
6.1

For claim 3 let KXK \subseteq X be compact and put G:={WT:WK=}G := \bigcup \{\, W \in \mathcal{T} : W \cap K = \varnothing \,\}, which is open by [L1]. Every member of the union misses KK, so GXKG \subseteq X \setminus K; conversely for xXKx \in X \setminus K claim 1, proved at step 5.1, gives disjoint open UxU \ni x and VKV \supseteq K, whence UK=U \cap K = \varnothing and xUGx \in U \subseteq G. So G=XKG = X \setminus K is open, KK is closed, and claim 3 holds.

L1step 5.1
6.2

For claim 2 let K,LXK, L \subseteq X be compact with KL=K \cap L = \varnothing, and put W:={WT:VW= for some VT with KV}\mathcal{W} := \{\, W \in \mathcal{T} : V \cap W = \varnothing \text{ for some } V \in \mathcal{T} \text{ with } K \subseteq V \,\}, again cut out by a property. Then LWL \subseteq \bigcup \mathcal{W}: for yLy \in L we have yKy \notin K, so claim 1, proved at step 5.1, gives disjoint open UyU \ni y and VKV \supseteq K, and that UU lies in W\mathcal{W} and contains yy.

step 5.1construct
7.1

If L=L = \varnothing then U:=U := \varnothing and V:=XV := X satisfy claim 2; otherwise [L2] applied to W\mathcal{W} gives mNm \in \mathbb{N} and W0,,WmWW_0, \dots, W_m \in \mathcal{W} with LW0WmL \subseteq W_0 \cup \dots \cup W_m.

L1L2step 6.2
8.1

For each jmj \le m the set Tj:={VT:KV and VWj=}T_j := \{\, V \in \mathcal{T} : K \subseteq V \text{ and } V \cap W_j = \varnothing \,\} is nonempty, because WjWW_j \in \mathcal{W}; and jTjj \mapsto T_j is a function with domain the natural number σ(m)\sigma(m), so a choice function for its values supplies V0,,VmTV_0, \dots, V_m \in \mathcal{T} with KVjK \subseteq V_j and VjWj=V_j \cap W_j = \varnothing for every jmj \le m.

L3step 7.1
9.1

Put U:=W0WmU := W_0 \cup \dots \cup W_m and V:=V0VmV := V_0 \cap \dots \cap V_m; both are open by [L1], LUL \subseteq U by step 7.1, KVK \subseteq V because KVjK \subseteq V_j for every jj, and UV=U \cap V = \varnothing because a point of UVU \cap V would lie in some WjW_j and in VVjV \subseteq V_j, contradicting VjWj=V_j \cap W_j = \varnothing. So claim 2 holds.

L1step 7.1step 8.1
10.1

For claim 4 assume (X,T)(X, \mathcal{T}) is also compact: a compact subset of XX is closed by step 6.1, and a closed subset of XX is compact by [L4], so the two classes of subsets coincide; with claims 1, 2 and 3 settled at steps 5.1, 9.1 and 6.1 the theorem is proved.

L4step 6.1step 9.1

Remarks

Where each hypothesis is spent. The Hausdorff condition is used exactly once, at step 2.1, to know that the family V\mathcal{V} covers KK; compactness of KK is used exactly once, at step 3.1, to cut that cover down to finitely many members. Claim 2 then reuses claim 1 in the same shape, with the roles of point and compact set played by a point of LL and the compact set KK.

Why the family is defined and not chosen. For each yKy \in K the Hausdorff condition asserts that some pair (U,V)(U, V) exists; it provides no rule for naming one. A proof that writes UyU_y and VyV_y has selected a pair for every yKy \in K at once, and for an arbitrary compact KK that is the Axiom of Choice. Collecting instead every VV that works for some UU replaces the selection by a formula, and the only selection left is over the finite index set σ(n)\sigma(n), where Every natural-number-indexed list of nonempty sets has a choice function on its family of values applies.

Claim 3 fails without the Hausdorff hypothesis, and FALSE: a compact subset of a topological space is closed records the failure with a witness. Claim 4 is the converse pairing: closedness is enough for compactness only when the ambient space is compact (A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact), and compactness is enough for closedness only when it is Hausdorff.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism

Statement

Let (X,TX)(X, \mathcal{T}_X) and (Y,TY)(Y, \mathcal{T}_Y) be topological spaces (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), and let R\mathbb{R} carry its usual topology, the metric topology of dR(s,t)=std_{\mathbb{R}}(s,t) = |s-t| (The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded, 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, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). Then:

  1. Continuous images. If f:XYf : X \to Y is continuous (Continuity of a map of topological spaces at a point and globally) and (X,TX)(X, \mathcal{T}_X) is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right), then f[X]f[X] is a compact subset of YY. More generally, if KXK \subseteq X is a compact subset of XX then f[K]f[K] is a compact subset of YY.
  2. Extreme values. If (X,TX)(X, \mathcal{T}_X) is compact and nonempty and g:XRg : X \to \mathbb{R} is continuous, then g[X]g[X] has a maximum and a minimum (Maximum and minimum of a set): there are xmax,xminXx_{\max}, x_{\min} \in X with g(xmin)    g(x)    g(xmax)for every xX.g(x_{\min}) \;\le\; g(x) \;\le\; g(x_{\max}) \qquad \text{for every } x \in X .
  3. Compact to Hausdorff. If (X,TX)(X, \mathcal{T}_X) is compact, (Y,TY)(Y, \mathcal{T}_Y) is Hausdorff (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not) and f:XYf : X \to Y is a continuous bijection, then ff is a homeomorphism (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

Nonemptiness in claim 2 is a hypothesis and not an oversight: for X=X = \varnothing the image is empty and has neither a maximum nor a minimum. No choice principle is used: the one selection made below is over a finite index set, where Every natural-number-indexed list of nonempty sets has a choice function on its family of values is a theorem of ZF.

Facts & Assumptions

Given: Topological spaces (X,TX)(X, \mathcal{T}_X) and (Y,TY)(Y, \mathcal{T}_Y), and R\mathbb{R} with its usual topology.

[L2]

A space is compact exactly when every family of open sets with union the space has a finite subfamily with union the space; a subset AA is a compact subset when the subspace (A,TA)(A, \mathcal{T}_A) is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

[L3]

AA is a compact subset of a space ZZ exactly when for every family U\mathcal{U} of open subsets of ZZ with AUA \subseteq \bigcup \mathcal{U} there are nNn \in \mathbb{N} and U0,,UnUU_0, \dots, U_n \in \mathcal{U} with AU0UnA \subseteq U_0 \cup \dots \cup U_n, or else A=A = \varnothing (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, claim 1).

[L4]

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

[L5]

For SXS \subseteq X the restriction fS:SYf|_S : S \to Y of a continuous ff is continuous, since (fS)1[V]=f1[V]S(f|_S)^{-1}[V] = f^{-1}[V] \cap S (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace, Continuity of a map of topological spaces at a point and globally).

[L7]

Every set of reals listable as {a0,,an}\{a_0, \dots, a_n\} with nNn \in \mathbb{N} has a maximum and a minimum, each of them one of the listed members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L8]

The order of Order on the reals makes R\mathbb{R} a totally ordered field (The reals form a totally ordered field), so no real satisfies s<ss < s, and s<ts < t together with tst \le s is impossible (Complete ordered field (least-upper-bound property)).

[L9]

A closed subset of a compact space is a compact subset of it (A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact, claim 1).

Proof

technique · direct
1.1

For claim 1 assume (X,TX)(X, \mathcal{T}_X) is compact, let f:XYf : X \to Y be continuous, and let U\mathcal{U} be a family of open subsets of YY with f[X]Uf[X] \subseteq \bigcup \mathcal{U}; put G:={f1[U]:UU}\mathcal{G} := \{\, f^{-1}[U] : U \in \mathcal{U} \,\}, a family of open subsets of XX by [L1], whose union is XX because every xXx \in X has f(x)Uf(x) \in U for some UUU \in \mathcal{U}.

L1construct
2.1

If X=X = \varnothing then f[X]=f[X] = \varnothing and the second alternative of [L3] holds; otherwise compactness of XX applied to G\mathcal{G} gives nNn \in \mathbb{N} and G0,,GnGG_0, \dots, G_n \in \mathcal{G} with X=G0GnX = G_0 \cup \dots \cup G_n.

L2step 1.1
3.1

For each jnj \le n the set Sj:={UU:f1[U]=Gj}S_j := \{\, U \in \mathcal{U} : f^{-1}[U] = G_j \,\} is nonempty by the definition of G\mathcal{G}, and jSjj \mapsto S_j is a function with domain the natural number σ(n)\sigma(n), so a choice function for its values supplies U0,,UnUU_0, \dots, U_n \in \mathcal{U} with f1[Uj]=Gjf^{-1}[U_j] = G_j for every jnj \le n.

L4step 2.1
4.1

Every point of f[X]f[X] is f(x)f(x) for some xXx \in X, and xx lies in some Gj=f1[Uj]G_j = f^{-1}[U_j], so f(x)Ujf(x) \in U_j; hence f[X]U0Unf[X] \subseteq U_0 \cup \dots \cup U_n, and by [L3] the set f[X]f[X] is a compact subset of YY.

L3step 2.1step 3.1
5.1

For the second sentence of claim 1 let KXK \subseteq X be a compact subset, so that the subspace (K,(TX)K)(K, (\mathcal{T}_X)_K) is a compact space by [L2] and fK:KYf|_K : K \to Y is continuous by [L5]; step 4.1, proved for an arbitrary compact space and an arbitrary continuous map out of it, applies to fKf|_K and gives that fK[K]=f[K]f|_K[K] = f[K] is a compact subset of YY.

L2L5step 4.1
5.2

For claim 2 assume XX is compact and nonempty and let g:XRg : X \to \mathbb{R} be continuous; by step 4.1 the set S:=g[X]S := g[X] is a nonempty compact subset of R\mathbb{R}. Suppose for the moment that SS has no maximum; then every xSx \in S admits sSs \in S with x<sx < s, so the family R:={(,s):sS}\mathcal{R} := \{\, (-\infty, s) : s \in S \,\} covers SS, and its members are open by [L6], since x<sx < s gives (xr,x+r)(,s)(x - r, x + r) \subseteq (-\infty, s) for r:=sx>0r := s - x > 0.

L6L8step 4.1
6.1

By [L3] there are nNn \in \mathbb{N} and s0,,snSs_0, \dots, s_n \in S with S(,s0)(,sn)S \subseteq (-\infty, s_0) \cup \dots \cup (-\infty, s_n); by [L7] the set {s0,,sn}\{s_0, \dots, s_n\} has a maximum, one of the sis_i and hence a member of SS, so it lies in some (,sj)(-\infty, s_j), giving that maximum <sj< s_j while sjs_j \le that maximum, which [L8] forbids. So SS has a maximum; the same argument with the rays (s,)(s, \infty), open by [L6], and the minimum supplied by [L7] shows that SS has a minimum.

L3L6L7L8step 5.2
6.2

For claim 3 let f:XYf : X \to Y be a continuous bijection with XX compact and YY Hausdorff, and let FXF \subseteq X be closed; then FF is a compact subset of XX by [L9], so f[F]f[F] is a compact subset of YY by step 5.1, and hence closed in YY by [L10].

L9L10step 5.1
7.1

The maximum and the minimum of SS are members of S=g[X]S = g[X], so there are xmax,xminXx_{\max}, x_{\min} \in X with g(xmax)g(x_{\max}) the maximum and g(xmin)g(x_{\min}) the minimum, and then g(xmin)g(x)g(xmax)g(x_{\min}) \le g(x) \le g(x_{\max}) for every xXx \in X; this is claim 2.

L7step 6.1
8.1

Step 6.2 says that ff carries closed sets to closed sets, so ff is a closed map, and by [L11] a continuous bijection that is closed is a homeomorphism, which is claim 3; claims 1 and 2 were proved at steps 5.1 and 7.1.

L11step 5.1step 6.2step 7.1

Remarks

Claim 2 is the extreme value theorem, and compactness is the whole of it. No metric, no completeness argument and no sequence appears: the rays (,s)(-\infty, s) with sSs \in S cover a set with no maximum, and a finite subcover of them is impossible because finitely many reals do have a maximum. The metric statement of the same result is A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, proved there for a compact metric space; by For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide it is the present claim applied to a metric topology.

Claim 3 is the reason compactness is worth having when identifying spaces. Constructing a continuous bijection is usually easy and constructing the inverse explicitly is usually not; claim 3 removes the second task whenever the source is compact and the target is Hausdorff. Both hypotheses are needed: the identity from a set with a finer topology to the same set with a coarser one is a continuous bijection and is not a homeomorphism, and it becomes one under these hypotheses precisely because the finer topology is then compact and the coarser Hausdorff.

The metric special cases are The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset and A continuous bijection from a compact metric space onto a metric space carries open sets to open sets, so its inverse is continuous. Neither is used above; both are the corresponding claim read in a metric topology.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

Tube lemma: if KK is compact and an open NX×ZN \subseteq X \times Z contains K×{z0}K \times \{z_0\}, then NN contains K×WK \times W for some open Wz0W \ni z_0

Statement

Let (X,TX)(X, \mathcal{T}_X) and (Z,TZ)(Z, \mathcal{T}_Z) be topological spaces (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and give X×ZX \times Z the product topology (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space). Let KXK \subseteq X be a compact subset (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right), let z0Zz_0 \in Z, and let NX×ZN \subseteq X \times Z be open with

K×{z0}    N.K \times \{z_0\} \;\subseteq\; N .

Then there is an open WZW \subseteq Z with z0Wz_0 \in W and

K×W    N.K \times W \;\subseteq\; N .

The set K×WK \times W is the tube of the name. The case K=K = \varnothing is included and is settled by W=ZW = Z. No choice principle is used at all: the cover produced below is indexed by pairs of open sets, so the indexed form of the ambient compactness criterion (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, claim 2) returns the second entries together with the indices and nothing has to be selected afterwards.

Facts & Assumptions

Given: Topological spaces (X,TX)(X, \mathcal{T}_X) and (Z,TZ)(Z, \mathcal{T}_Z), the product X×ZX \times Z with the product topology, a compact KXK \subseteq X, a point z0Zz_0 \in Z, and an open NX×ZN \subseteq X \times Z with K×{z0}NK \times \{z_0\} \subseteq N.

[L2]

If B\mathcal{B} is a basis for a topology, then for every open OO and every pOp \in O there is BBB \in \mathcal{B} with pBOp \in B \subseteq O (Basis and subbasis for a topology, and the topology generated by a family of sets).

[L3]

KK is a compact subset of XX exactly when for every set II and every family (Ui)iI(U_i)_{i \in I} of open subsets of XX with KiIUiK \subseteq \bigcup_{i \in I} U_i there are nNn \in \mathbb{N} and i0,,inIi_0, \dots, i_n \in I with KUi0UinK \subseteq U_{i_0} \cup \dots \cup U_{i_n}, or else K=K = \varnothing (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, claim 2; Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

[L4]

\varnothing and ZZ are open, and the intersection of finitely many open sets is open when at least one is taken (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

Proof

technique · direct
1.1

Put P:={(U,V)TX×TZ:z0V and U×VN}\mathcal{P} := \{\, (U,V) \in \mathcal{T}_X \times \mathcal{T}_Z : z_0 \in V \text{ and } U \times V \subseteq N \,\}, a set of pairs cut out by a property of the pair and not by any selection, and for p=(U,V)Pp = (U,V) \in \mathcal{P} write Up:=UU_p := U and Vp:=VV_p := V.

construct
2.1

KpPUpK \subseteq \bigcup_{p \in \mathcal{P}} U_p: given xKx \in K we have (x,z0)K×{z0}N(x, z_0) \in K \times \{z_0\} \subseteq N, so by [L1] and [L2] there are UTXU \in \mathcal{T}_X and VTZV \in \mathcal{T}_Z with (x,z0)U×VN(x, z_0) \in U \times V \subseteq N; then xUx \in U, z0Vz_0 \in V, and p:=(U,V)p := (U,V) lies in P\mathcal{P} with xUpx \in U_p.

L1L2step 1.1
3.1

If K=K = \varnothing then W:=ZW := Z is open, contains z0z_0 and satisfies K×W=NK \times W = \varnothing \subseteq N; otherwise [L3] applied to the family (Up)pP(U_p)_{p \in \mathcal{P}} gives nNn \in \mathbb{N} and p0,,pnPp_0, \dots, p_n \in \mathcal{P} with KUp0UpnK \subseteq U_{p_0} \cup \dots \cup U_{p_n}.

L3L4step 1.1step 2.1
4.1

Put W:=Vp0VpnW := V_{p_0} \cap \dots \cap V_{p_n}; it is open by [L4], being an intersection of finitely many open sets with at least one taken, and z0Wz_0 \in W because z0Vpjz_0 \in V_{p_j} for every jnj \le n by the definition of P\mathcal{P}.

L4step 1.1step 3.1
5.1

K×WNK \times W \subseteq N: given xKx \in K and wWw \in W, step 3.1 gives jnj \le n with xUpjx \in U_{p_j}, and wWVpjw \in W \subseteq V_{p_j}, so (x,w)Upj×VpjN(x,w) \in U_{p_j} \times V_{p_j} \subseteq N by the definition of P\mathcal{P}. With the case K=K = \varnothing settled at step 3.1, the lemma is proved.

step 1.1step 3.1step 4.1

Remarks

What the lemma is for. It is the step that makes a product of two compact spaces compact (A product of finitely many compact spaces is compact in the product topology): a cover of X×ZX \times Z restricted to the slice X×{z0}X \times \{z_0\} can be thinned by compactness of XX, and the tube lemma is what turns the resulting cover of the slice into a cover of a whole open band X×WX \times W around it. Compactness of KK is essential and cannot be weakened to closedness: an open set containing the slice over a non-compact KK need not contain any tube. Finiteness is what does the work — a union of finitely many basic boxes containing the slice always contains a tube, since intersecting the finitely many second factors that meet z0z_0 leaves an open Wz0W \ni z_0 — and it is compactness of KK that produces the finite subfamily.

Why the pairs are carried along. A proof that says "for each xKx \in K choose open UxxU_x \ni x and Vxz0V_x \ni z_0 with Ux×VxNU_x \times V_x \subseteq N" has selected a pair for every point of KK at once, which for an arbitrary compact KK is the Axiom of Choice. Indexing the cover by the pairs themselves removes the selection: the compactness criterion hands back finitely many indices, and an index here already carries its own VV.

A metric special case is stated elsewhere in the library, as lem-tube-lemma-for-a-compact-metric-factor, which assumes XX metric and carries the alias lem-tube-lemma; it is named here in plain text because its page comes after this one in the reading order. It is not used above, and the present lemma assumes nothing about XX beyond compactness of KK.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

A product of finitely many compact spaces is compact in the product topology

Statement

For every nNn \in \mathbb{N} (The natural numbers N\mathbb{N} (von Neumann)) and every family (Xk)k<n(X_k)_{k < n} of compact topological spaces (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), the product

k<nXk\prod_{k < n} X_k

with the product topology (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space) is compact. In particular a binary product X×YX \times Y of compact spaces is compact, and the empty product, a one-point space, is compact.

No choice principle is used beyond Every natural-number-indexed list of nonempty sets has a choice function on its family of values, which is a theorem of ZF. That is what separates the finite case from the arbitrary one, where the Axiom of Choice is genuinely spent.

Facts & Assumptions

Given: A natural number nn, a family (Xk)k<n(X_k)_{k < n} of compact topological spaces, and the product Pn:=k<nXkP_n := \prod_{k<n} X_k with the product topology and projections πk\pi_k.

[A1]

An element of k<nXk\prod_{k<n} X_k is a function xx with domain nn and x(k)Xkx(k) \in X_k for every k<nk < n; the von Neumann natural satisfies σ(n)=n{n}\sigma(n) = n \cup \{n\} with nnn \notin n; and the empty product is a one-point space (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, The natural numbers N\mathbb{N} (von Neumann)).

[L1]

The projections of a product are continuous, and a map hh into a product is continuous exactly when every component πih\pi_i \circ h is continuous (A map into a product is continuous iff each of its components is; the projections are continuous and open; and each projection is surjective when every factor is nonempty, which for an infinite index set uses the Axiom of Choice, claims 1 and 2).

[L5]

Tube lemma: if KXK \subseteq X is compact, NX×ZN \subseteq X \times Z is open and K×{z0}NK \times \{z_0\} \subseteq N, then K×WNK \times W \subseteq N for some open Wz0W \ni z_0 (Tube lemma: if KK is compact and an open NX×ZN \subseteq X \times Z contains K×{z0}K \times \{z_0\}, then NN contains K×WK \times W for some open Wz0W \ni z_0).

[L6]

AA is a compact subset of a space ZZ exactly when every family U\mathcal{U} of open subsets of ZZ with AUA \subseteq \bigcup \mathcal{U} has finitely many members whose union contains AA, or else A=A = \varnothing (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, claim 1).

[L7]

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

[L8]

A space is compact exactly when every open cover of it has a finite subcover; a one-point space and the empty space are compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

[L9]

If 0SN0 \in S \subseteq \mathbb{N} and σ(m)S\sigma(m) \in S whenever mSm \in S, then S=NS = \mathbb{N} (The principle of mathematical induction).

Proof

technique · induction
1.1

At n=0n = 0 the index set is empty, so k<0Xk\prod_{k<0} X_k is a one-point space by [A1] and is compact by [L8]; this is the case n=0n = 0 of the statement.

A1L8base
1.2

Let mNm \in \mathbb{N} and assume, as the induction hypothesis, that k<mYk\prod_{k<m} Y_k is compact for every family (Yk)k<m(Y_k)_{k<m} of compact spaces.

ih
1.3

For the binary case let XX and ZZ be compact, let U\mathcal{U} be an open cover of X×ZX \times Z, and for zZz \in Z let jz:XX×Zj_z : X \to X \times Z be jz(x):=(x,z)j_z(x) := (x,z); its components are the identity of XX and the constant map with value zz, so it is continuous by [L1] and [L3], and X×{z}=jz[X]X \times \{z\} = j_z[X] is therefore a compact subset of X×ZX \times Z by [L4].

L1L3L4construct
1.4

Put W:={WZ:W is open and X×WV for some finite VU}\mathcal{W} := \{\, W \subseteq Z : W \text{ is open and } X \times W \subseteq \bigcup \mathcal{V} \text{ for some finite } \mathcal{V} \subseteq \mathcal{U} \,\}, a family cut out by a property of WW and not by any selection.

construct
1.5

For the splitting, let pNp \in \mathbb{N}, let (Xk)k<σ(p)(X_k)_{k < \sigma(p)} be a family of spaces, and define r:k<σ(p)Xk(k<pXk)×Xpr : \prod_{k<\sigma(p)} X_k \to \big(\prod_{k<p} X_k\big) \times X_p by r(x):=(xp, x(p))r(x) := (x \restriction p,\ x(p)) and ss in the opposite direction by s(y,a):=y{(p,a)}s(y,a) := y \cup \{(p,a)\}; by [A1] these are mutually inverse bijections, since σ(p)=p{p}\sigma(p) = p \cup \{p\} and ppp \notin p.

A1construct
2.1

ZWZ \subseteq \bigcup \mathcal{W}: given zZz \in Z, the set X×{z}X \times \{z\} is compact by step 1.3 and lies in U\bigcup \mathcal{U}, so [L6] supplies a finite VU\mathcal{V} \subseteq \mathcal{U} with X×{z}N:=VX \times \{z\} \subseteq N := \bigcup \mathcal{V}, an open set, the case X=X = \varnothing being covered by V=\mathcal{V} = \varnothing; since XX is compact, [L5] gives an open WzW \ni z with X×WNX \times W \subseteq N, and that WW lies in W\mathcal{W}.

L5L6step 1.3step 1.4
2.2

rr is continuous: by [L1] it suffices that its two components are, and they are xxpx \mapsto x \restriction p and πp\pi_p; the second is a projection, and the first is continuous by [L1] applied again, its own components being πk\pi_k for k<pk < p.

L1step 1.5
2.3

ss is continuous: by [L1] it suffices that πks\pi_k \circ s is continuous for every k<σ(p)k < \sigma(p); for k<pk < p that map is the kk-th projection of k<pXk\prod_{k<p} X_k composed with the first projection of the binary product, a composite of continuous maps, and for k=pk = p it is the second projection of the binary product.

L1L2step 1.5
3.1

If Z=Z = \varnothing then X×Z=X \times Z = \varnothing is compact by [L8]; otherwise W\mathcal{W} is an open cover of the compact ZZ by step 2.1, so [L8] gives qNq \in \mathbb{N} and W0,,WqWW_0, \dots, W_q \in \mathcal{W} with Z=W0WqZ = W_0 \cup \dots \cup W_q.

L8step 2.1
3.2

So rr is a continuous bijection with continuous inverse ss, hence a homeomorphism, and k<σ(p)Xk\prod_{k<\sigma(p)} X_k is homeomorphic to (k<pXk)×Xp\big(\prod_{k<p} X_k\big) \times X_p.

L4step 1.5step 2.2step 2.3
4.1

For each jqj \le q the set TjT_j of finite subfamilies VU\mathcal{V} \subseteq \mathcal{U} with X×WjVX \times W_j \subseteq \bigcup \mathcal{V} is nonempty because WjWW_j \in \mathcal{W}, and jTjj \mapsto T_j is a function with domain the natural number σ(q)\sigma(q), so [L7] supplies V0,,Vq\mathcal{V}_0, \dots, \mathcal{V}_q; their union V\mathcal{V} is a finite subfamily of U\mathcal{U}, a union of finitely many listable families being listed by concatenation, and X×Z=(X×W0)(X×Wq)VX \times Z = (X \times W_0) \cup \dots \cup (X \times W_q) \subseteq \bigcup \mathcal{V}. So every open cover of X×ZX \times Z has a finite subcover and X×ZX \times Z is compact.

L7L8step 3.1
5.1

Now let (Xk)k<σ(m)(X_k)_{k < \sigma(m)} be a family of compact spaces. By step 1.2 the product k<mXk\prod_{k<m} X_k is compact, and XmX_m is compact, so step 4.1 makes (k<mXk)×Xm\big(\prod_{k<m} X_k\big) \times X_m compact; by step 3.2 with p:=mp := m the product k<σ(m)Xk\prod_{k<\sigma(m)} X_k is homeomorphic to it, and a continuous image of a compact space is compact by [L4], so k<σ(m)Xk\prod_{k<\sigma(m)} X_k is compact.

L4step 1.2step 3.2step 4.1
6.1

The set of nNn \in \mathbb{N} for which the statement holds contains 00 by step 1.1 and contains σ(m)\sigma(m) whenever it contains mm by step 5.1, so by [L9] it is all of N\mathbb{N}; the binary case is n=2n = 2 and the empty product is n=0n = 0.

L9step 1.1discharge-induction: step 5.1

Remarks

Where the tube lemma does the work. Compactness of XX alone thins a cover on one slice X×{z}X \times \{z\}; what is needed is a cover of a whole band around that slice, and producing the band is exactly Tube lemma: if KK is compact and an open NX×ZN \subseteq X \times Z contains K×{z0}K \times \{z_0\}, then NN contains K×WK \times W for some open Wz0W \ni z_0. Compactness of ZZ then thins the family of bands. Both factors are used, and in different ways.

Why the bands are collected rather than chosen. The family W\mathcal{W} of step 1.4 consists of every open WW admitting some finite subfamily of U\mathcal{U} over X×WX \times W; it is defined by a formula. Writing WzW_z for each zZz \in Z instead would select a band for every point of ZZ at once, which for an arbitrary ZZ is the Axiom of Choice. The only selection made is over the finite index set σ(q)\sigma(q) at step 4.1.

The hypothesis "finitely many" is not removable by this argument. The induction runs on N\mathbb{N} and gives nothing about an infinite index set; Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice, later on this page, handles that case and pays the Axiom of Choice for it.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

Alexander's subbase lemma: if every cover by members of a fixed subbasis has a finite subcover then the space is compact; the proof is an application of Zorn's lemma

Statement

Assume the Axiom of Choice (The Axiom of Choice), in the form of Zorn's lemma (Zorn's lemma), the two being equivalent over ZF (The Axiom of Choice and Zorn's lemma are equivalent).

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and let S\mathcal{S} be a subbasis for T\mathcal{T} (Basis and subbasis for a topology, and the topology generated by a family of sets). Suppose that

every family S0S\mathcal{S}_0 \subseteq \mathcal{S} with X=S0X = \bigcup \mathcal{S}_0 has a finite subfamily whose union is XX.

Then (X,T)(X, \mathcal{T}) is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

The converse is immediate and is not the content: a compact space has a finite subcover for every open cover, subbasic or not. What the lemma says is that the subbasic covers alone already decide compactness, and that is what makes it usable — a product topology is presented by a subbasis, and the subbasic covers of a product are far easier to handle than its arbitrary open covers.

Facts & Assumptions

Given: A topological space (X,T)(X, \mathcal{T}), a subbasis S\mathcal{S} for T\mathcal{T}, and the Axiom of Choice.

[A1]

Every family S0S\mathcal{S}_0 \subseteq \mathcal{S} with X=S0X = \bigcup \mathcal{S}_0 has a finite subfamily whose union is XX.

[L1]

A space is compact exactly when every family of open sets with union the space has a finite subfamily with union the space, a family being finite when it is empty or listable as {V0,,Vn}\{V_0, \dots, V_n\} for some nNn \in \mathbb{N}; the empty space is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

[L2]

Inclusion is a partial order on any family of sets, and a chain in it is a subfamily any two of whose members are comparable under inclusion (Partial order and partially ordered set, Chain in a poset).

[L3]

Of finitely many pairwise comparable sets one contains all the others: for D0,,Dn\mathcal{D}_0, \dots, \mathcal{D}_n pairwise comparable, induction on nn gives such a member, the successor step comparing the member found for D0,,Dn\mathcal{D}_0, \dots, \mathcal{D}_n with Dn+1\mathcal{D}_{n+1} (Chain in a poset, The principle of mathematical induction).

[L4]

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

[L5]

An upper bound of a subset of a poset is an element above all of its members (Upper bound, least upper bound, and strict upper bound); a maximal element is one with nothing strictly above it (Maximal element and greatest element).

[L6]

Zorn's lemma: a nonempty poset in which every chain has an upper bound has a maximal element (Zorn's lemma).

[L7]

The intersections of finitely many members of S\mathcal{S} form a basis for T\mathcal{T}, the intersection of none being XX; and for a basis B\mathcal{B}, every open OO and every xOx \in O admit BBB \in \mathcal{B} with xBOx \in B \subseteq O (A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis, claim 2; Basis and subbasis for a topology, and the topology generated by a family of sets).

Proof

technique · contradiction
1.1

Suppose (X,T)(X, \mathcal{T}) is not compact. Then XX \ne \varnothing, the empty space being compact by [L1], and the family P\mathcal{P} of those open covers of XX that have no finite subcover is a nonempty subfamily of the power set of T\mathcal{T}, partially ordered by inclusion.

L1L2assume-contra
2.1

Every chain CP\mathcal{C} \subseteq \mathcal{P} has an upper bound in P\mathcal{P}. For C=\mathcal{C} = \varnothing any member of P\mathcal{P} is an upper bound, and P\mathcal{P} is nonempty by step 1.1. For C\mathcal{C} \ne \varnothing take B:=C\mathcal{B} := \bigcup \mathcal{C}, a family of open sets whose union is XX because the union of any one member of C\mathcal{C} already is; were B\mathcal{B} to have a finite subcover U0,,UnU_0, \dots, U_n, then for each jnj \le n the set of members of C\mathcal{C} containing UjU_j is nonempty, [L4] would supply D0,,DnC\mathcal{D}_0, \dots, \mathcal{D}_n \in \mathcal{C} with UjDjU_j \in \mathcal{D}_j, and [L3] would put all of them inside one DC\mathcal{D} \in \mathcal{C}, which would then have the finite subcover U0,,UnU_0, \dots, U_n and could not lie in P\mathcal{P}. So BP\mathcal{B} \in \mathcal{P}, and it contains every member of C\mathcal{C}.

L2L3L4L5step 1.1
3.1

By [L6] the poset P\mathcal{P} has a maximal element M\mathcal{M}: an open cover of XX with no finite subcover such that the only member of P\mathcal{P} containing it is itself.

L5L6step 1.1step 2.1
4.1

For every open UMU \notin \mathcal{M} there is a finite FM\mathcal{F} \subseteq \mathcal{M} with X=UFX = U \cup \bigcup \mathcal{F}. Indeed M{U}\mathcal{M} \cup \{U\} is an open cover strictly containing M\mathcal{M}, so by maximality it is not in P\mathcal{P} and has a finite subcover; that subcover must contain UU, since otherwise it would be a finite subcover of M\mathcal{M} itself, and the members other than UU form the required finite FM\mathcal{F} \subseteq \mathcal{M}.

L1step 3.1
4.2

Let xXx \in X. Since M\mathcal{M} covers XX there is MMM \in \mathcal{M} with xMx \in M, and by [L7] there are mNm \in \mathbb{N} and S0,,SmSS_0, \dots, S_m \in \mathcal{S} with xS0SmMx \in S_0 \cap \dots \cap S_m \subseteq M; the remaining alternative of [L7], that no member of S\mathcal{S} is taken and the basic set is XX itself, would give XMX \subseteq M and so make {M}\{M\} a finite subcover of M\mathcal{M}, which step 3.1 forbids.

L7step 3.1
5.1

Some SjS_j lies in M\mathcal{M}. For if none did, then by step 4.1 the set of finite FM\mathcal{F} \subseteq \mathcal{M} with X=SjFX = S_j \cup \bigcup \mathcal{F} is nonempty for each jmj \le m, so [L4] supplies F0,,Fm\mathcal{F}_0, \dots, \mathcal{F}_m; every yXy \in X either lies in S0SmS_0 \cap \dots \cap S_m or fails to lie in some SjS_j and then lies in Fj\bigcup \mathcal{F}_j, so X=(S0Sm)F0FmMF0FmX = (S_0 \cap \dots \cap S_m) \cup \bigcup \mathcal{F}_0 \cup \dots \cup \bigcup \mathcal{F}_m \subseteq M \cup \bigcup \mathcal{F}_0 \cup \dots \cup \bigcup \mathcal{F}_m, exhibiting a finite subfamily of M\mathcal{M} with union XX — a union of finitely many listable families being listed by concatenation — which step 3.1 forbids.

L1L4step 3.1step 4.1step 4.2
6.1

Hence SM\mathcal{S} \cap \mathcal{M} covers XX: every xXx \in X lies in some SjS_j of step 4.2 that belongs to M\mathcal{M} by step 5.1, and xS0SmSjx \in S_0 \cap \dots \cap S_m \subseteq S_j.

step 4.2step 5.1
7.1

By [A1] the cover SM\mathcal{S} \cap \mathcal{M} of XX by members of S\mathcal{S} has a finite subfamily with union XX; that subfamily is a finite subfamily of M\mathcal{M} with union XX, contradicting the choice of M\mathcal{M} at step 3.1. So the supposition of step 1.1 is untenable and (X,T)(X, \mathcal{T}) is compact.

A1step 3.1step 6.1discharge-contradiction

Remarks

Where the Axiom of Choice is spent. Exactly once, at step 3.1, through Zorn's lemma. The finite selections at steps 2.1 and 5.1 are instances of Every natural-number-indexed list of nonempty sets has a choice function on its family of values and cost nothing. That single use is inherited by Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice, which is proved from this lemma, and it cannot be avoided there: Tychonoff's theorem implies the Axiom of Choice.

Why maximality is the right tool. A cover with no finite subcover that cannot be enlarged is very close to being a filter of complements, and step 4.1 is what that closeness amounts to: any open set outside M\mathcal{M} already finishes the job when finitely many members of M\mathcal{M} are added. Step 5.1 then says a basic set of M\mathcal{M} cannot have all of its subbasic factors outside M\mathcal{M}, which is the only place the subbasis hypothesis is used.

The hypothesis is about one fixed subbasis. A space may have many subbases, and the lemma is applied with whichever one presents the topology most conveniently. For a product that is the family of preimages of open sets under the projections (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space), and it is exactly the fact that a subbasic cover of a product moves one coordinate at a time that makes Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice a short argument.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice

Statement

Assume the Axiom of Choice (The Axiom of Choice).

Let II be a set and let (Xi,Ti)iI(X_i, \mathcal{T}_i)_{i \in I} be a family of compact topological spaces (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). Then the product

P  :=  iIXiP \;:=\; \prod_{i \in I} X_i

with the product topology (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space) is compact.

The Axiom of Choice is spent twice, and both uses are flagged below. Once inside Alexander's subbase lemma: if every cover by members of a fixed subbasis has a finite subcover then the space is compact; the proof is an application of Zorn's lemma, through Zorn's lemma (Zorn's lemma), and once directly at step 2.1, to produce a point of a product of nonempty sets.

Facts & Assumptions

Given: A set II, a family (Xi,Ti)iI(X_i, \mathcal{T}_i)_{i \in I} of compact spaces, the product P=iIXiP = \prod_{i \in I} X_i with the product topology, and the projections πi:PXi\pi_i : P \to X_i.

[A1]

The Axiom of Choice, in the form: if YiY_i \ne \varnothing for every iIi \in I then iIYi\prod_{i \in I} Y_i \ne \varnothing (The Axiom of Choice).

[L2]

Preimage commutes with unions: πi1[V]={πi1[V]:VV}\pi_i^{-1}[\bigcup \mathcal{V}] = \bigcup \{\, \pi_i^{-1}[V] : V \in \mathcal{V} \,\}, and πi1[Xi]=P\pi_i^{-1}[X_i] = P (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).

[L3]

Each (Xi,Ti)(X_i, \mathcal{T}_i) is compact: every family of open subsets of XiX_i with union XiX_i has a finite subfamily with union XiX_i, or Xi=X_i = \varnothing and the empty subfamily covers it (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

[L4]

Alexander's subbase lemma: if S\mathcal{S} is a subbasis for the topology of a space YY and every family S0S\mathcal{S}_0 \subseteq \mathcal{S} with S0=Y\bigcup \mathcal{S}_0 = Y has a finite subfamily with union YY, then YY is compact (Alexander's subbase lemma: if every cover by members of a fixed subbasis has a finite subcover then the space is compact; the proof is an application of Zorn's lemma).

Proof

technique · direct
1.1

Let S0G\mathcal{S}_0 \subseteq \mathcal{G} satisfy S0=P\bigcup \mathcal{S}_0 = P, and for each iIi \in I put Ui:={UTi:πi1[U]S0}\mathcal{U}_i := \{\, U \in \mathcal{T}_i : \pi_i^{-1}[U] \in \mathcal{S}_0 \,\}, a family of open subsets of XiX_i cut out by a property and not by any selection; every member of S0\mathcal{S}_0 is πi1[U]\pi_i^{-1}[U] for some iIi \in I and some UUiU \in \mathcal{U}_i.

L1construct
2.1

There is i0Ii_0 \in I with Ui0=Xi0\bigcup \mathcal{U}_{i_0} = X_{i_0}. For if XiUiX_i \setminus \bigcup \mathcal{U}_i were nonempty for every iIi \in I, then [A1] would give a point aa of iI(XiUi)\prod_{i \in I} (X_i \setminus \bigcup \mathcal{U}_i); that aa lies in PP, and it lies in no member of S0\mathcal{S}_0, since such a member is πi1[U]\pi_i^{-1}[U] with UUiU \in \mathcal{U}_i while aiUia_i \notin \bigcup \mathcal{U}_i and so aiUa_i \notin U — contradicting S0=P\bigcup \mathcal{S}_0 = P.

A1step 1.1
3.1

The family Ui0\mathcal{U}_{i_0} consists of open subsets of Xi0X_{i_0} with union Xi0X_{i_0}, so by [L3] either Xi0=X_{i_0} = \varnothing, or there are nNn \in \mathbb{N} and U0,,UnUi0U_0, \dots, U_n \in \mathcal{U}_{i_0} with Xi0=U0UnX_{i_0} = U_0 \cup \dots \cup U_n.

L3step 2.1
4.1

In the first case P=πi01[Xi0]=P = \pi_{i_0}^{-1}[X_{i_0}] = \varnothing by [L2] and the empty subfamily of S0\mathcal{S}_0 has union PP; in the second, πi01[U0],,πi01[Un]\pi_{i_0}^{-1}[U_0], \dots, \pi_{i_0}^{-1}[U_n] are members of S0\mathcal{S}_0 by step 1.1 and their union is πi01[U0Un]=πi01[Xi0]=P\pi_{i_0}^{-1}[U_0 \cup \dots \cup U_n] = \pi_{i_0}^{-1}[X_{i_0}] = P by [L2]. Either way S0\mathcal{S}_0 has a finite subfamily with union PP.

L2step 1.1step 3.1
5.1

Since S0\mathcal{S}_0 was an arbitrary subfamily of the subbasis G\mathcal{G} with union PP, [L4] applies and PP is compact.

L1L4step 1.1step 4.1

Remarks

Why a subbasic cover is easy and an arbitrary cover is not. A member of G\mathcal{G} restricts exactly one coordinate, so a subbasic cover of PP sorts itself into the families Ui\mathcal{U}_i, one per coordinate, and the whole argument is the observation that one of those families must already cover its own factor. A member of an arbitrary open cover is a union of basic sets, each restricting its own finite set of coordinates, so such a member need not be determined by any finite set of coordinates and the cover admits no such sorting; that is why the theorem is proved through Alexander's subbase lemma: if every cover by members of a fixed subbasis has a finite subcover then the space is compact; the proof is an application of Zorn's lemma rather than directly.

The theorem implies the Axiom of Choice, so the hypothesis cannot be dropped; that implication is not proved in this library, and the exact form it takes is recorded in Schechter 2006: Kelley's cofinite proof yields BPI, not the Axiom of Choice , which corrects the classical derivation. The choice ledger for this page is The quasicompact convention, why compactness of a subset is read intrinsically here, and what each result on this page costs in choice.

For an index set that is a natural number neither use of choice is needed, and the result is then A product of finitely many compact spaces is compact in the product topology, a theorem of ZF proved on this page by induction and the tube lemma.

A product of compact spaces is compact for the product topology and in general not for the box topology. Nothing above survives the substitution: the box topology has no subbasis of one-coordinate restrictions, and the sorting carried out in the first step of the proof is exactly what disappears.

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets

Definition

Let (X,T)(X, \mathcal{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 open covers, subcovers, finiteness and compactness as in Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, and finite, at most countable and uncountable as in Finite, countably infinite, countable, uncountable.

A subset AXA \subseteq X is called countably compact, Lindelöf, sequentially compact, limit point compact or σ\sigma-compact when the subspace (A,TA)(A, \mathcal{T}_A) is (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace), exactly as for compactness. Relative compactness is the exception and is deliberately not of that form: it is a statement about AA inside XX, since A\overline{A} is computed in XX, and a set may be relatively compact in one space and not in another that contains it. Every other notion on this list is intrinsic to the subspace.

The countable covers may be listed. A nonempty at most countable family U\mathcal{U} admits a surjection NU\mathbb{N} \to \mathcal{U} (A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}), so countable compactness says: for every sequence (Un)nN(U_n)_{n \in \mathbb{N}} of open sets with X=nNUnX = \bigcup_{n \in \mathbb{N}} U_n there are finitely many indices whose sets already cover XX. That surjection is produced from the countability assumption alone and no choice principle is involved; the empty family covers only the empty space, which is compact anyway.

Indexing starts at 00. A sequence here is a function on N\mathbb{N} and N\mathbb{N} contains 00 (Sequences of reals: bounded, eventually, frequently, tails, subsequences), so a subsequence is (xnj)jN(x_{n_j})_{j \in \mathbb{N}} with n0<n1<n_0 < n_1 < \cdots and njjn_j \ge j (A strictly increasing index map satisfies nkkn_k \ge k). An index range taken from a text that starts at 11 must be shifted before it is used here.

Agreement with the metric definitions. Let (X,d)(X,d) be a metric space carrying its metric topology Td\mathcal{T}_d (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, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). Then the three notions that Countably compact, sequentially compact and limit point compact metric spaces defines metrically are the three defined above, read in (X,Td)(X, \mathcal{T}_d):

So no statement below about a metrizable space introduces a second notion, and every theorem of the metric development about these three properties may be quoted here once a metric inducing the topology is named. Lindelöfness, σ\sigma-compactness and relative compactness have no metric counterpart in this library and are defined here for the first time.

Remarks

None of the conditions listed above is compactness by definition. Countable compactness restricts the covers tested; Lindelöfness weakens the conclusion from finite to at most countable; sequential compactness speaks about sequences instead of covers; limit point compactness speaks about subsets; σ\sigma-compactness asks only that the space be assembled from at most countably many compact pieces; relative compactness is a condition on a subset of an ambient space. Which implications hold between them, and which need a choice principle, is 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; that some of them fail to be equivalent is witnessed by the false statements at the end of this page.

Why σ\sigma-compactness is not a compactness property at all. The real line is σ\sigma-compact, being the union of the compact intervals [n,n][-n, n], and it is not compact; the definition is useful precisely because it names a class of spaces built out of compact pieces without being compact. The same remark explains why a σ\sigma-compact space need not be countably compact.

Limit point compactness is sometimes called the Bolzano-Weierstrass property, and countably compact is occasionally used for what is called limit point compact here. This library uses the four names above with the meanings given, and writes the condition out whenever the risk of confusion is real.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

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)(X, \mathcal{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 σ\sigma-compact spaces, and relatively compact subsets. Then:

  1. Theorems of ZF.
    • (a) If XX is compact it is countably compact and Lindelöf.
    • (b) If XX is countably compact and Lindelöf it is compact.
    • (c) If XX is compact it is limit point compact.
    • (d) If XX is countably compact then every countably infinite subset of XX (Finite, countably infinite, countable, uncountable) has a limit point in XX.
  2. Assuming the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)): if XX 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\mathbb{N}-indexed chain): if XX is countably compact it is limit point compact.
  4. Assuming the Axiom of Countable Choice, and that every singleton {x}X\{x\} \subseteq X is closed: if XX 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)(X, \mathcal{T}).

[L1]

XX 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 XX (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 σ\sigma-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=AA\overline{A} = A \cup A', where AA' is the set of limit points of AA, and AA is closed exactly when A=AA = \overline{A}; a limit point of a subset of BB is a limit point of BB, since a neighbourhood meeting the smaller set meets the larger (A point lies in the closure of AA iff every basic neighbourhood of it meets AA; the closure is the smallest closed superset and equals AA together with its derived set, claim 3; Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

[L4]

\varnothing and XX 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)nN(Y_n)_{n \in \mathbb{N}} of nonempty sets there is a function ff on N\mathbb{N} with f(n)Ynf(n) \in Y_n for every nn (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[L6]

Dependent choice: for every nonempty set SS, every relation RR entire on SS and every aSa \in S there is a sequence (sk)(s_k) in SS with s0=as_0 = a and skRsk+1s_k \mathbin{R} s_{k+1} for every kk (The axiom of dependent choice: a relation in which every element is related to something admits an N\mathbb{N}-indexed chain).

[L7]

A nonempty at most countable family admits a surjection from N\mathbb{N}, so it may be listed as (Un)nN(U_n)_{n \in \mathbb{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\mathbb{N}, Finite, countably infinite, countable, uncountable).

[L8]

A sequence is a function on N\mathbb{N} and N\mathbb{N} contains 00; xkpx_k \to p means xkx_k lies in each neighbourhood of pp from some index on; and a strictly increasing index map satisfies njjn_j \ge 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 nkkn_k \ge k, The natural numbers N\mathbb{N} (von Neumann)).

[L9]

A set is countably infinite exactly when it is equinumerous with N\mathbb{N}, and the range of an injection NA\mathbb{N} \to A is a countably infinite subset of AA (Finite, countably infinite, countable, uncountable, Injection, surjection, bijection).

Proof

technique · direct
1.1

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

L1L2
1.2

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

L1L2
1.3

Claim 1(c): let XX be compact and let AXA \subseteq X have no limit point in XX; then U:={UT:UA has at most one element}\mathcal{U} := \{\, U \in \mathcal{T} : U \cap A \text{ has at most one element} \,\} covers XX, since each xXx \in X has a neighbourhood NN with N(A{x})=N \cap (A \setminus \{x\}) = \varnothing and an open UU with xUNx \in U \subseteq N, so that UA{x}U \cap A \subseteq \{x\}; compactness gives U0,,UnUU_0, \dots, U_n \in \mathcal{U} with X=U0UnX = U_0 \cup \dots \cup U_n, whence A=(U0A)(UnA)A = (U_0 \cap A) \cup \dots \cup (U_n \cap A) is listable and so finite by [L2]. Contraposing, every infinite subset of XX has a limit point.

L1L2L4algebra
1.4

For claim 2 assume countable choice, let XX be sequentially compact and let U\mathcal{U} be an at most countable open cover of XX with no finite subcover; then U\mathcal{U} \ne \varnothing, since the empty family covers only the empty space, so [L7] lists it as (Un)nN(U_n)_{n \in \mathbb{N}}, and En:=X(U0Un)E_n := X \setminus (U_0 \cup \dots \cup U_n) is nonempty for every nn, so [L5] supplies a sequence (xn)(x_n) with xnEnx_n \in E_n for every nn.

L1L5L7
1.5

For claim 1(d) let XX be countably compact and let BXB \subseteq X be countably infinite with no limit point in XX; fix a bijection kbkk \mapsto b_k of N\mathbb{N} onto BB and put Cn:={bk:kn}C_n := \{\, b_k : k \ge n \,\}. Each CnC_n is a subset of BB, so it has no limit point either by [L3], and therefore Cn=Cn=Cn\overline{C_n} = C_n \cup \varnothing = C_n and CnC_n is closed.

L1L3L9
1.6

For claim 3 assume dependent choice and let AXA \subseteq X be infinite. Let SS be the set of injections s:nAs : n \to A with nNn \in \mathbb{N}, nonempty because the empty function belongs to it, and relate ss to tt when tt is an injection σ(n)A\sigma(n) \to A extending s:nAs : n \to A; this relation is entire on SS, since an injection s:nAs : n \to A cannot have range AA, as that would make AA finite, so some aAran(s)a \in A \setminus \operatorname{ran}(s) gives the extension s{(n,a)}s \cup \{(n,a)\}. By [L6] there is a sequence (sk)(s_k) in SS with s0s_0 the empty function and each sk+1s_{k+1} extending sks_k, so each sks_k is an injection kAk \to A and bk:=sk+1(k)b_k := s_{k+1}(k) defines an injection NA\mathbb{N} \to A whose range is a countably infinite subset of AA.

L2L6L9
2.1

For claim 4 assume countable choice, let XX be limit point compact with every singleton closed, and let U\mathcal{U} be an at most countable open cover of XX with no finite subcover; as at step 1.4 the family is nonempty, [L7] lists it as (Un)nN(U_n)_{n \in \mathbb{N}}, the sets En:=X(U0Un)E_n := X \setminus (U_0 \cup \dots \cup U_n) are nonempty, and [L5] supplies a sequence (xn)(x_n) with xnEnx_n \in E_n for every nn.

L1L5L7
2.2

Sequential compactness gives a strictly increasing jnjj \mapsto n_j and pXp \in X with xnjpx_{n_j} \to p; some UmU_m contains pp and is a neighbourhood of it by [L4], so xnjUmx_{n_j} \in U_m for all large jj, while njjn_j \ge j by [L8] gives njmn_j \ge m for all large jj and hence xnjU0UnjUmx_{n_j} \notin U_0 \cup \dots \cup U_{n_j} \supseteq U_m for those jj — impossible. So no such U\mathcal{U} exists and XX is countably compact, which is claim 2.

L1L4L8step 1.4
2.3

The sets CnC_n satisfy nNCn=\bigcap_{n \in \mathbb{N}} C_n = \varnothing: a point outside BB lies in no CnC_n, and bkCk+1b_k \notin C_{k+1} because kbkk \mapsto b_k is injective. So V:={XCn:nN}\mathcal{V} := \{\, X \setminus C_n : n \in \mathbb{N} \,\} is an at most countable family of open sets whose union is XX.

L4L7step 1.5
3.1

The set A:={xn:nN}A := \{\, x_n : n \in \mathbb{N} \,\} of step 2.1 is infinite. Were it finite, then for each aAa \in A the least mm with aUma \in U_m exists, since (Un)(U_n) covers XX, and the largest MM of those finitely many least indices exists; but xMEMx_M \in E_M misses U0UMU_0 \cup \dots \cup U_M while xMAx_M \in A lies in UmU_{m} for some mMm \le M.

L1algebrastep 2.1
3.2

Countable compactness applied to V\mathcal{V} gives a finite subfamily V0,,VpV_0, \dots, V_p with union XX; each VjV_j is XCmX \setminus C_{m} for some mm, and taking NjN_j to be the least such mm and NN the largest of N0,,NpN_0, \dots, N_p gives Vj=XCNjXCNV_j = X \setminus C_{N_j} \subseteq X \setminus C_N for every jj, since the CnC_n decrease. Hence X=XCNX = X \setminus C_N and CN=C_N = \varnothing, contradicting bNCNb_N \in C_N. 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 pp of the infinite set AA; some UmU_m contains pp, the set F:={x0,,xm}{p}F := \{x_0, \dots, x_m\} \setminus \{p\} is closed by [L4] as a union of finitely many closed singletons, and W:=UmFW := U_m \setminus F is therefore open and contains pp, hence is a neighbourhood of pp meeting A{p}A \setminus \{p\}: there is nn with xnWx_n \in W and xnpx_n \ne p.

L1L4step 2.1step 3.1
4.2

Claim 3: given an infinite AXA \subseteq X with XX countably compact, step 1.6 produces a countably infinite BAB \subseteq A, step 3.2 gives BB a limit point pp in XX, and pp is then a limit point of AA by [L3], since BAB \subseteq A. So XX is limit point compact.

L1L3step 1.6step 3.2
5.1

If nmn \le m then xnx_n is one of x0,,xmx_0, \dots, x_m and differs from pp, so xnFx_n \in F, contradicting xnW=UmFx_n \in W = U_m \setminus F; hence n>mn > m, so UmU0UnU_m \subseteq U_0 \cup \dots \cup U_n and xnWUmx_n \in W \subseteq U_m contradicts xnEnx_n \in E_n. No such U\mathcal{U} exists, so XX 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

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 AA built at step 2.1 need not be one of the xnx_n 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.

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

A subset of Rn\mathbb{R}^n with the product topology is compact exactly when it is closed and bounded, the product topology being the Euclidean metric topology

Statement

Let nNn \in \mathbb{N} with n1n \ge 1, let Rn\mathbb{R}^n be the set of functions nRn \to \mathbb{R} (Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it) carrying the product topology of nn copies of the usual topology of R\mathbb{R} (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space), and let d2d_2 be the Euclidean metric. Then:

  1. The product topology on Rn\mathbb{R}^n is the metric topology of d2d_2 (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), so Rn\mathbb{R}^n as a product and Rn\mathbb{R}^n as a metric space are one topological space, and it is metrizable (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).
  2. A subset KRnK \subseteq \mathbb{R}^n is a compact subset for the product topology (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right) if and only if KK is closed in Rn\mathbb{R}^n and bounded (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).

The hypothesis n1n \ge 1 is inherited from Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it, which defines Rn\mathbb{R}^n and its three metrics only there; for n=0n = 0 the product is a one-point space and is compact. No choice principle is used: the metric statement it is read off from is proved by bisection (Heine-Borel in Rn\mathbb{R}^n: with the Euclidean metric a subset of Rn\mathbb{R}^n is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).

Facts & Assumptions

Given: A natural number n1n \ge 1, the set Rn\mathbb{R}^n of functions nRn \to \mathbb{R}, the product topology on it, and the Euclidean metric d2d_2.

[L2]

For a metric space with its metric topology, a subset is a compact subset in the metric sense exactly when it is a compact subset in the topological sense (For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide, claim 2).

Proof

technique · direct
1.1

By [L1] the product topology on Rn\mathbb{R}^n and the metric topology of d2d_2 are the same family of subsets of Rn\mathbb{R}^n, so a subset is open, or closed, for one exactly when it is for the other; this is claim 1.

L1
2.1

Applying [L2] to the metric space (Rn,d2)(\mathbb{R}^n, d_2), a subset KK is a compact subset of Rn\mathbb{R}^n for the topology of d2d_2 exactly when it is a compact subset of the metric space (Rn,d2)(\mathbb{R}^n, d_2); and by step 1.1 that topology is the product topology, so the same holds for the product topology.

L2L4step 1.1
3.1

Combining with [L3]: KK is a compact subset of Rn\mathbb{R}^n with the product topology exactly when KK is closed in Rn\mathbb{R}^n and bounded, which is claim 2.

L3step 1.1step 2.1

Remarks

This is a corollary in the strict sense. Nothing is reproved: claim 1 is For n1n \ge 1 the product topology on nn copies of the usual topology of R\mathbb{R} is the metric topology of dd_\infty on Rn\mathbb{R}^n, and hence also of d1d_1 and d2d_2, so Rn\mathbb{R}^n as a product and Rn\mathbb{R}^n as a metric space are one space, the passage between the two readings of "compact subset" is For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide, and the mathematical content of claim 2 is Heine-Borel in Rn\mathbb{R}^n: with the Euclidean metric a subset of Rn\mathbb{R}^n is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line. What the corollary records is that the three fit together, so that a reader working in the product topology may use Heine-Borel without translating.

A second route to the compactness of a box. For reals akbka_k \le b_k the box k<n[ak,bk]\prod_{k<n} [a_k, b_k] is a product of finitely many compact spaces, each [ak,bk][a_k,b_k] being compact by claim 2 applied with n=1n = 1, so A product of finitely many compact spaces is compact in the product topology makes it compact using only the one-dimensional case of claim 2, and with it only the one-dimensional bisection. The two routes agree, as claim 1 requires; the bisection proof is the one that also delivers the converse.

Boundedness is metric and compactness is not. "Bounded" in claim 2 is a property of the metric d2d_2, not of the topology it induces: a metrizable space with at least two points carries, for every positive real DD, a compatible metric of diameter DD. What claim 2 says is that for this particular metric on this particular space the conjunction of closedness and boundedness detects compactness; the same conjunction fails to do so in a general metric space (FALSE: a closed and bounded subset of a metric space is compact).

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space

Definition

A topological space (X,T)(X, \mathcal{T}) (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) is locally compact when

every point of XX has a compact neighbourhood:

that is, for every xXx \in X there is a neighbourhood NN of xx (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open) that is a compact subset of XX (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

A neighbourhood need not be open here, and that is what makes the condition the weak one it is meant to be: NN is required only to contain some open set containing xx. Writing "compact open neighbourhood" instead would define a strictly stronger property, satisfied by no space in which a point has no compact open neighbourhood, R\mathbb{R} among them; and requiring the compact set merely to contain xx would define a property so weak that every space with a singleton has it, singletons being compact.

Every compact space is locally compact, since XX itself is a neighbourhood of each of its points and is a compact subset of itself. The converse fails, and Rn\mathbb{R}^n is the standard witness.

What the condition says in a metric space. Let (X,d)(X,d) be a metric space carrying its metric topology (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, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), with balls as in Open ball, closed ball and sphere in a metric space, and let xXx \in X. Then

xx has a compact neighbourhood if and only if there are a real r>0r > 0 and a compact KXK \subseteq X with B(x,r)KB(x,r) \subseteq K.

Both directions are immediate and are discharged here. If NN is a compact neighbourhood of xx, fix an open UU with xUNx \in U \subseteq N; by 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 there is r>0r > 0 with B(x,r)UNB(x,r) \subseteq U \subseteq N, so K:=NK := N serves. Conversely, if B(x,r)KB(x,r) \subseteq K with KK compact, then KK contains the open set B(x,r)B(x,r), which contains xx, so KK is a neighbourhood of xx and is compact. Compactness of a subset of (X,d)(X,d) means the same thing read metrically and read topologically (For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide), so the criterion may be applied with either development's theorems.

Rn\mathbb{R}^n is locally compact for every n1n \ge 1. Give Rn\mathbb{R}^n the product topology, which is the metric topology of the Euclidean metric d2d_2 (Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it, A subset of Rn\mathbb{R}^n with the product topology is compact exactly when it is closed and bounded, the product topology being the Euclidean metric topology). For pRnp \in \mathbb{R}^n the set

Qp  :=  {xRn:d2(x,p)1}Q_p \;:=\; \{\, x \in \mathbb{R}^n : d_2(x,p) \le 1 \,\}

is closed, being the complement of the union of the open balls B(y,d2(y,p)1)B(y, d_2(y,p) - 1) over the points yy with d2(y,p)>1d_2(y,p) > 1, and it is bounded (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space), lying inside B(p,2)B(p, 2); so QpQ_p is compact by A subset of Rn\mathbb{R}^n with the product topology is compact exactly when it is closed and bounded, the product topology being the Euclidean metric topology. It contains the open ball B(p,1)B(p,1), which contains pp, so it is a compact neighbourhood of pp. The space Rn\mathbb{R}^n is not compact, so local compactness is strictly weaker than compactness.

Remarks

Local compactness is a local condition and compactness is not. The definition quantifies over points and asks for something in a neighbourhood of each; nothing is asserted about covers of the whole space. That is why a locally compact space may be as large as one likes, and why the two properties separate.

Where the extra strength is needed. For an arbitrary space, "every point has a compact neighbourhood" does not by itself give a base of compact neighbourhoods at each point, nor an open set with compact closure around each compact set. Both of those do follow once the space is also Hausdorff, and that is In a locally compact Hausdorff space every point has a neighbourhood base of compact sets, every open subspace and every closed subspace is locally compact, every open set around a point contains an open set with compact closure inside it, and every compact set sits inside an open set with compact closure; several authors build the stronger condition into the definition and then note the agreement in the Hausdorff case. This library takes the weak definition and proves the strengthening under the hypothesis that licenses it.

Local compactness is not hereditary, unlike metrizability. A subspace of a locally compact space need not be locally compact, and FALSE: every subspace of a locally compact space is locally compact records the failure with a witness; what does survive is heredity along open and along closed subspaces of a locally compact Hausdorff space (In a locally compact Hausdorff space every point has a neighbourhood base of compact sets, every open subspace and every closed subspace is locally compact, every open set around a point contains an open set with compact closure inside it, and every compact set sits inside an open set with compact closure).

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (claude-sonnet-5 + deepseek-v4-pro)verified 2026-08-05 (claude-sonnet-5)Open item page →

In a locally compact Hausdorff space every point has a neighbourhood base of compact sets, every open subspace and every closed subspace is locally compact, every open set around a point contains an open set with compact closure inside it, and every compact set sits inside an open set with compact closure

Statement

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison). Then:

  1. A neighbourhood base of compact sets. If XX is locally compact (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space) and Hausdorff (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not), then every neighbourhood NN of a point xXx \in X (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open) contains a compact neighbourhood of xx; so the compact neighbourhoods of xx form a neighbourhood base at xx.
  2. Heredity along open and closed subspaces. If XX is locally compact and Hausdorff and SXS \subseteq X is open, then the subspace SS is locally compact (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace). If XX is locally compact and FXF \subseteq X is closed, then the subspace FF is locally compact; no Hausdorff hypothesis is used for this half.
  3. Shrinking inside an open set. If XX is locally compact and Hausdorff, OXO \subseteq X is open and xOx \in O, there is an open VV with xVVOx \in V \subseteq \overline{V} \subseteq O and V\overline{V} a compact subset of XX.
  4. Compact sets sit in open sets with compact closure. If XX is locally compact and Hausdorff and KXK \subseteq X is compact, there is an open VXV \subseteq X with KVK \subseteq V and V\overline{V} a compact subset of XX (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

No choice principle is used; every cover produced below is defined by a formula and thinned by A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, which returns members rather than indices.

Facts & Assumptions

Given: A topological space (X,T)(X, \mathcal{T}).

[L4]

A closed subset of a compact space is a compact subset of it, and a finite union of compact subsets is compact (A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact).

[L5]

A\overline{A} is the smallest closed superset of AA, so AF\overline{A} \subseteq F for every closed FAF \supseteq A, and AA is closed exactly when A=AA = \overline{A}; int(A)\operatorname{int}(A) is the largest open subset of AA, and xint(A)x \in \operatorname{int}(A) exactly when AA is a neighbourhood of xx (Interior, closure, boundary, exterior, derived set and isolated point in a topological space, A point lies in the closure of AA iff every basic neighbourhood of it meets AA; the closure is the smallest closed superset and equals AA together with its derived set, claim 2).

[L6]

The open sets of a subspace SS are the traces USU \cap S of the open sets of XX and its closed sets are the traces of the closed sets; and for ASXA \subseteq S \subseteq X the topology AA inherits from SS is the one it inherits from XX, so compactness of AA does not depend on which of the two it is read in (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace, Hereditary, open-hereditary and closed-hereditary properties of topological spaces).

[L7]

An open set is a neighbourhood of each of its points, a superset of a neighbourhood of xx is a neighbourhood of xx, and a union of finitely many closed sets is closed (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L8]

AA is a compact subset of XX exactly when every family of open subsets of XX covering AA has finitely many members covering AA, or else A=A = \varnothing (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, claim 1).

Proof

technique · direct
1.1

For claim 1 let XX be locally compact and Hausdorff, let xXx \in X and let NN be a neighbourhood of xx; fix a compact neighbourhood KK of xx and open sets U,VU, V with xUKx \in U \subseteq K and xVNx \in V \subseteq N, and put W:=UVW := U \cap V, an open set with xWKNx \in W \subseteq K \cap N. By [L3] the compact set KK is closed.

L1L2L3L7construct
1.2

For the closed half of claim 2 let XX be locally compact, let FXF \subseteq X be closed and let xFx \in F; a compact neighbourhood KK of xx in XX contains an open UxU \ni x, and KFK \cap F is the trace of the closed FF on KK, hence closed in the subspace KK and so a compact subset by [L4] and [L6], while xUFKFx \in U \cap F \subseteq K \cap F with UFU \cap F open in FF exhibits KFK \cap F as a neighbourhood of xx in the subspace FF. So FF is locally compact.

L1L4L6L7
2.1

The set F0:=KW=K(XW)F_0 := K \setminus W = K \cap (X \setminus W) is the trace of a closed set on KK, hence closed in the subspace KK and a compact subset of XX by [L4] and [L6]; and xF0x \notin F_0, since xWx \in W.

L4L6step 1.1
3.1

By [L3] there are disjoint open sets AxA \ni x and BF0B \supseteq F_0; put G:=AWG := A \cap W, an open set with xGx \in G.

L3step 1.1step 2.1
4.1

GKG \subseteq K and KK is closed, so GK\overline{G} \subseteq K by [L5]; and GAXBG \subseteq A \subseteq X \setminus B, a closed set, so GXB\overline{G} \subseteq X \setminus B. Hence GKBKF0=KWWN\overline{G} \subseteq K \setminus B \subseteq K \setminus F_0 = K \cap W \subseteq W \subseteq N.

L5L7step 1.1step 3.1
5.1

G\overline{G} is closed and contained in KK, so it is the trace of a closed set on KK, closed in the subspace KK, and a compact subset of XX by [L4] and [L6]; and it is a neighbourhood of xx by [L7], since the open GG satisfies xGGx \in G \subseteq \overline{G}. With step 4.1 it lies inside NN, so claim 1 holds.

L4L6L7step 4.1
6.1

For the open half of claim 2 let SXS \subseteq X be open and let xSx \in S; then SS is a neighbourhood of xx by [L7], so claim 1 supplies a compact neighbourhood CC of xx in XX with CSC \subseteq S. An open UU of XX with xUCx \in U \subseteq C satisfies USU \subseteq S, so U=USU = U \cap S is open in SS and CC is a neighbourhood of xx in the subspace SS; and by [L6] compactness of CC read in SS is compactness read in XX. So SS is locally compact and claim 2 is proved.

L1L6L7step 5.1
6.2

For claim 4 put V:={UT:U is a compact subset of X}\mathcal{V} := \{\, U \in \mathcal{T} : \overline{U} \text{ is a compact subset of } X \,\}, a family cut out by a property. It covers XX: given yXy \in X, claim 1 applied with N:=XN := X gives a compact neighbourhood CC of yy, which is closed by [L3], and an open UU with yUCy \in U \subseteq C; then UC\overline{U} \subseteq C by [L5], U\overline{U} is closed in the subspace CC by [L6], and [L4] makes it a compact subset of XX, so UVU \in \mathcal{V}.

L3L4L5L6step 5.1construct
6.3

For claim 3 let OO be open and xOx \in O; then OO is a neighbourhood of xx by [L7], so claim 1, proved at step 5.1, gives a compact neighbourhood CC of xx with COC \subseteq O, and CC is closed by [L3]. Put V:=int(C)V := \operatorname{int}(C), which is open and contains xx by [L5], CC being a neighbourhood of xx; then VCV \subseteq C gives VC=CO\overline{V} \subseteq \overline{C} = C \subseteq O by [L5], and V\overline{V} is a closed subset of the compact CC, hence closed in the subspace CC by [L6] and a compact subset of XX by [L4]. So xVVOx \in V \subseteq \overline{V} \subseteq O with V\overline{V} compact, which is claim 3.

L3L4L5L6L7step 5.1
7.1

Let KXK \subseteq X be compact. If K=K = \varnothing then V:=V := \varnothing has V=\overline{V} = \varnothing compact; otherwise [L8] gives nNn \in \mathbb{N} and U0,,UnVU_0, \dots, U_n \in \mathcal{V} with KU0Un=:VK \subseteq U_0 \cup \dots \cup U_n =: V, an open set.

L8step 6.2
8.1

The set U0Un\overline{U_0} \cup \dots \cup \overline{U_n} is closed by [L7] and contains VV, so V\overline{V} is contained in it by [L5]; that union is a compact subset by [L4], and V\overline{V} is a closed subset of it, hence closed in the subspace it carries and compact by [L4] and [L6]. So KVK \subseteq V with V\overline{V} compact, which is claim 4; claims 1, 2 and 3 were proved at steps 5.1, 6.1 with 6.2, and 6.3.

L4L5L6L7step 6.3step 7.1

Remarks

Where the Hausdorff hypothesis is spent. Twice, and both times through In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones: to know that the compact neighbourhood KK is closed, and to separate the point xx from the compact KWK \setminus W. Without it the compact neighbourhood cannot be shrunk, and claim 1 is exactly the shrinking.

Claim 3 is the form the rest of the library asks for. "Every neighbourhood contains a compact neighbourhood" and "every open set around a point contains an open VV with V\overline{V} compact inside it" are the same statement in different clothes, and the second is the one a nested-shrinking construction needs, since it hands back an open set whose closure is already inside the target. It is used in Assuming dependent choice, every locally compact Hausdorff space is a Baire space.

Claim 2 splits into two halves of different strength. The closed half is true in any locally compact space and its proof is three lines; the open half runs through claim 1 and therefore through the Hausdorff hypothesis. Together they do not give heredity: an arbitrary subspace of a locally compact Hausdorff space need not be locally compact, and FALSE: every subspace of a locally compact space is locally compact carries the witness.

Claim 4 pads a compact set, not a point. It says a compact set can always be padded to an open set that is still "bounded" in the only sense available here, namely having compact closure. Separating a single point of XX from the added point \infty costs less than that: XX^{*} is compact and contains XX as an open subspace; XX is dense in XX^{*} exactly when XX is not compact; and XX^{*} is Hausdorff exactly when XX is locally compact and Hausdorff does it at step 1.4 from claim 1 alone, taking a compact neighbourhood of the point and using that it is closed.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

Dependent choice along a sequence of relations: if RnR_n is entire on AA for every nn, then from any aa there is a sequence with anRnan+1a_n \mathbin{R_n} a_{n+1}

Statement

Assume the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N\mathbb{N}-indexed chain).

Let AA be a nonempty set and let (Rn)nN(R_n)_{n \in \mathbb{N}} be a family of binary relations on AA, indexed by N\mathbb{N} (The natural numbers N\mathbb{N} (von Neumann)), such that

for every nN and every uA there is vA with uRnv.\text{for every } n \in \mathbb{N} \text{ and every } u \in A \text{ there is } v \in A \text{ with } u \mathbin{R_n} v .

Then for every a0Aa_0 \in A there is a function a:NAa : \mathbb{N} \to A (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure) with

a(0)=a0anda(n)Rna(n+1)  for every nN.a(0) = a_0 \qquad \text{and} \qquad a(n) \mathbin{R_n} a(n+1) \ \text{ for every } n \in \mathbb{N} .

Why this is not The axiom of dependent choice: a relation in which every element is related to something admits an N\mathbb{N}-indexed chain read off. That axiom is stated for one relation RR, entire on one set, fixed before any step is taken. What is needed here is a relation that changes with the stage: at step nn the admissible successors are the RnR_n-successors, and RnR_n is a different relation for each nn. A family of relations on AA is not a relation on AA, so the axiom does not apply to it directly, and applying it as if it did would be a genuine gap. The proof below removes the gap by carrying the stage inside the set.

Facts & Assumptions

Given: A nonempty set AA, a family (Rn)nN(R_n)_{n \in \mathbb{N}} of binary relations on AA, a point a0Aa_0 \in A, and the Axiom of Dependent Choice.

[A1]

For every nNn \in \mathbb{N} and every uAu \in A there is vAv \in A with uRnvu \mathbin{R_n} v.

[L1]

Dependent choice: for every nonempty set XX, every relation SS on XX that is entire on XX — meaning every element of XX is related to some element of XX — and every pXp \in X, there is a function x:NXx : \mathbb{N} \to X with x0=px_0 = p and xnSxn+1x_n \mathbin{S} x_{n+1} for every nNn \in \mathbb{N} (The axiom of dependent choice: a relation in which every element is related to something admits an N\mathbb{N}-indexed chain, Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure).

[L2]

N\mathbb{N} contains 00 and every natural has the successor n+1n+1 (The natural numbers N\mathbb{N} (von Neumann)).

[L3]

If SNS \subseteq \mathbb{N} contains 00 and contains n+1n+1 whenever it contains nn, then S=NS = \mathbb{N} (The principle of mathematical induction).

Proof

technique · direct
1.1

Put X:=N×AX := \mathbb{N} \times A, a nonempty set since AA is nonempty and 0N0 \in \mathbb{N}, and define a relation SS on XX by declaring (n,u)S(m,v)(n,u) \mathbin{S} (m,v) to hold exactly when m=n+1m = n+1 and uRnvu \mathbin{R_n} v.

L2construct
2.1

SS is entire on XX: given (n,u)X(n,u) \in X, [A1] supplies vAv \in A with uRnvu \mathbin{R_n} v, and then (n+1,v)(n+1, v) lies in XX and satisfies (n,u)S(n+1,v)(n,u) \mathbin{S} (n+1,v).

A1L2step 1.1
3.1

By [L1] applied to XX, SS and the point (0,a0)(0, a_0) there is x:NXx : \mathbb{N} \to X with x0=(0,a0)x_0 = (0,a_0) and xnSxn+1x_n \mathbin{S} x_{n+1} for every nn; write xn=(kn,an)x_n = (k_n, a_n) with knNk_n \in \mathbb{N} and anAa_n \in A, so that k0=0k_0 = 0, a0a_0 is the given point, and kn+1=kn+1k_{n+1} = k_n + 1 with anRknan+1a_n \mathbin{R_{k_n}} a_{n+1} for every nn.

L1step 1.1step 2.1
4.1

kn=nk_n = n for every nNn \in \mathbb{N}: the set {nN:kn=n}\{\, n \in \mathbb{N} : k_n = n \,\} contains 00 because k0=0k_0 = 0, and contains n+1n+1 whenever it contains nn because kn+1=kn+1=n+1k_{n+1} = k_n + 1 = n + 1; so [L3] makes it all of N\mathbb{N}.

L3step 3.1
5.1

Therefore a:nana : n \mapsto a_n is a function NA\mathbb{N} \to A with a(0)=a0a(0) = a_0 and a(n)Rna(n+1)a(n) \mathbin{R_n} a(n+1) for every nn, the relation at stage nn being Rkn=RnR_{k_n} = R_n by step 4.1.

step 3.1step 4.1

Remarks

The device is the standard one and it is worth naming. Carrying the stage as a first coordinate turns a family of relations into a single relation on a larger set, at the cost of having to check afterwards that the first coordinate really counts 0,1,2,0, 1, 2, \dots; that check is step 4.1 and it is an ordinary induction on N\mathbb{N}, not a second appeal to choice.

Nothing beyond dependent choice is spent. The hypothesis [A1] is a pure existence statement, asserting for each stage and each element that some successor exists; it names none. All the selecting is done once, by [L1], and the lemma adds nothing to its cost.

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

Baire space: a topological space in which every countable intersection of dense open subsets is dense

Definition

A topological space (X,T)(X, \mathcal{T}) (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) is a Baire space when

for every sequence (Un)nN(U_n)_{n \in \mathbb{N}} of subsets of XX that are open and dense in XX (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets, Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure, The natural numbers N\mathbb{N} (von Neumann)), the intersection nNUn\bigcap_{n \in \mathbb{N}} U_n is dense in XX.

As everywhere in this library N\mathbb{N} contains 00, so the sequence starts at U0U_0 and an index range copied from a text that starts at 11 must be shifted before it is used here.

The condition unwound. Denseness of AXA \subseteq X says A=X\overline{A} = X (Interior, closure, boundary, exterior, derived set and isolated point in a topological space), equivalently that AA meets every nonempty open subset of XX (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets). So the Baire condition reads:

for every sequence (Un)(U_n) of dense open sets and every nonempty open WXW \subseteq X there is a point of WW lying in every UnU_n.

That is the form every proof below uses, and it is the form in which the condition is checked: one produces a single point, in a given nonempty open set, belonging to all of the UnU_n at once.

The intersection itself need not be open. Nothing in the definition asserts that nUn\bigcap_n U_n is open, and in general it is not; what is asserted is only that it is dense. A finite intersection of dense open sets is dense and open, and that much holds in every space; the content of the definition is entirely in the passage to a countable family.

Why the meager formulation is not given here. The usual equivalent phrasing says that a countable union of nowhere dense sets has empty interior, or that a nonempty open set is not meager. This page does not state it, because the notions of nowhere dense and meager available to it are Nowhere dense, meager (first category), residual, and second category subsets of R\mathbb{R}, which is stated for subsets of R\mathbb{R} and not for subsets of an arbitrary topological space; restating them here in general would create a second notion under the same name. The definition above is stated in terms of denseness alone, which Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets does define for an arbitrary space, and it is equivalent to the meager formulation wherever both are available.

Remarks

What the definition is for. It isolates exactly the hypothesis under which a countable family of "large" open sets still has a large intersection, and that is the hypothesis a great many existence arguments run on: to produce an object with countably many properties, one shows that each property is enjoyed by a dense open set and then takes a point of the intersection. Nothing about the ambient space is assumed here beyond the definition, so the notion applies to spaces with no metric and no countability property.

Which spaces satisfy it, and at what cost. Every locally compact Hausdorff space is a Baire space, assuming dependent choice (Assuming dependent choice, every locally compact Hausdorff space is a Baire space); the corresponding statement for complete metric spaces, and the exact choice principles the several versions of the Baire category theorem are equivalent to over ZF, are recorded in The Baire category theorem is four inequivalent statements over ZF , which this library states and does not prove.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription) rests on unproved materialOpen item page →

Assuming dependent choice, every locally compact Hausdorff space is a Baire space

Statement

Assume the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N\mathbb{N}-indexed chain).

Let (X,T)(X, \mathcal{T}) be a locally compact Hausdorff space (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison). Then XX is a Baire space (Baire space: a topological space in which every countable intersection of dense open subsets is dense): for every sequence (Un)nN(U_n)_{n \in \mathbb{N}} of dense open subsets of XX (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets, Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure), the intersection nNUn\bigcap_{n \in \mathbb{N}} U_n is dense in XX.

Dependent choice is sufficient here and no claim of necessity is made. The several statements that go by the name "Baire category theorem" are inequivalent over ZF, and the choice principles they correspond to differ; that account, including the fact that the compact Hausdorff version is equivalent to a principle strictly weaker than dependent choice, is The Baire category theorem is four inequivalent statements over ZF , which this library states and does not prove. Nothing below asserts that dependent choice is needed for the statement above.

Facts & Assumptions

Given: A locally compact Hausdorff space (X,T)(X, \mathcal{T}), a sequence (Un)nN(U_n)_{n \in \mathbb{N}} of dense open subsets of XX, and the Axiom of Dependent Choice.

[L1]

AXA \subseteq X is dense exactly when A=X\overline{A} = X, exactly when AA meets every nonempty open subset of XX; and XX is a Baire space when every sequence of dense open sets has dense intersection (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets, Interior, closure, boundary, exterior, derived set and isolated point in a topological space, Baire space: a topological space in which every countable intersection of dense open subsets is dense).

[L5]

A space is compact exactly when every family of its closed subsets with the finite intersection property has nonempty intersection (A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection).

[L6]

Assuming dependent choice: if AA is nonempty and (Rn)nN(R_n)_{n \in \mathbb{N}} are relations on AA such that every uAu \in A has some vAv \in A with uRnvu \mathbin{R_n} v, then for every a0Aa_0 \in A there is a:NAa : \mathbb{N} \to A with a(0)=a0a(0) = a_0 and a(n)Rna(n+1)a(n) \mathbin{R_n} a(n+1) for every nn (Dependent choice along a sequence of relations: if RnR_n is entire on AA for every nn, then from any aa there is a sequence with anRnan+1a_n \mathbin{R_n} a_{n+1}, Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure, The natural numbers N\mathbb{N} (von Neumann)).

Proof

technique · direct
1.1

By [L1] it suffices to show that every nonempty open WXW \subseteq X meets nNUn\bigcap_{n \in \mathbb{N}} U_n; if XX has no nonempty open subset the requirement is vacuous and there is nothing to prove, so fix a nonempty open WW.

L1suffices: every nonempty open W meets the intersection
2.1

WU0W \cap U_0 is open and nonempty, U0U_0 being dense and WW nonempty open; fixing a point of it, [L2] gives an open V0V_0 with that point in V0V_0 and V0WU0\overline{V_0} \subseteq W \cap U_0, with V0\overline{V_0} a compact subset of XX. In particular V0V_0 is nonempty.

L1L2step 1.1
3.1

Let A\mathcal{A} be the set of nonempty open VXV \subseteq X whose closure V\overline{V} is a compact subset of XX; it contains V0V_0 by step 2.1, so it is nonempty. For nNn \in \mathbb{N} define a relation RnR_n on A\mathcal{A} by declaring VRnVV \mathbin{R_n} V' to hold exactly when VVUn+1\overline{V'} \subseteq V \cap U_{n+1}.

L1step 2.1construct
4.1

Each RnR_n is entire on A\mathcal{A}: given VAV \in \mathcal{A}, the set VUn+1V \cap U_{n+1} is open and nonempty, Un+1U_{n+1} being dense and VV nonempty open, so fixing a point of it and applying [L2] gives an open VV' containing that point with VVUn+1\overline{V'} \subseteq V \cap U_{n+1} and V\overline{V'} compact; then VAV' \in \mathcal{A} and VRnVV \mathbin{R_n} V'. This is a pure existence statement and selects nothing, which is why dependent choice and nothing stronger is spent below.

L1L2step 3.1
5.1

By [L6] applied to A\mathcal{A}, the relations RnR_n and the point V0V_0, there is a sequence (Vn)nN(V_n)_{n \in \mathbb{N}} in A\mathcal{A} with V0V_0 as given and Vn+1VnUn+1\overline{V_{n+1}} \subseteq V_n \cap U_{n+1} for every nNn \in \mathbb{N}.

L6step 3.1step 4.1
6.1

The sets Vn\overline{V_n} are nonempty, since VnV_n is nonempty and VnVnV_n \subseteq \overline{V_n} by [L3], and they decrease: Vn+1VnVn\overline{V_{n+1}} \subseteq V_n \subseteq \overline{V_n} by step 5.1 and [L3]. Each is a compact subset of XX and hence closed in XX by [L3], so each is the trace of a closed set on V0\overline{V_0} and therefore closed in the subspace V0\overline{V_0} by [L4].

L3L4step 5.1
7.1

The family {Vn:nN}\{\, \overline{V_n} : n \in \mathbb{N} \,\} of closed subsets of the compact space V0\overline{V_0} has the finite intersection property: the intersection of the empty list is V0\overline{V_0}, which is nonempty, and the intersection of a nonempty finite list is VN\overline{V_N} for NN the greatest of the indices occurring, the sets being decreasing, and that is nonempty. So [L5] gives a point xnNVnx \in \bigcap_{n \in \mathbb{N}} \overline{V_n}.

L4L5step 6.1
8.1

That point lies in WnNUnW \cap \bigcap_{n \in \mathbb{N}} U_n: from xV0WU0x \in \overline{V_0} \subseteq W \cap U_0 it lies in WW and in U0U_0, and for every nNn \in \mathbb{N} it lies in Vn+1VnUn+1Un+1\overline{V_{n+1}} \subseteq V_n \cap U_{n+1} \subseteq U_{n+1}, so it lies in UmU_m for m=0m = 0 and for every mm of the form n+1n+1, that is in every UmU_m.

step 2.1step 5.1step 7.1
9.1

So every nonempty open WW meets nNUn\bigcap_{n \in \mathbb{N}} U_n, which by [L1] makes that intersection dense; as (Un)(U_n) was an arbitrary sequence of dense open sets, XX is a Baire space.

L1step 1.1step 8.1

Remarks

Where each hypothesis is spent. Local compactness and the Hausdorff condition enter only through [L2], the shrinking clause of In a locally compact Hausdorff space every point has a neighbourhood base of compact sets, every open subspace and every closed subspace is locally compact, every open set around a point contains an open set with compact closure inside it, and every compact set sits inside an open set with compact closure, which is used twice: once to start the construction and once to continue it. Compactness of V0\overline{V_0} is used once, at step 7.1, to turn a decreasing sequence of nonempty closed sets into a common point; that is the finite intersection characterisation A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection and nothing else.

Why the stage-dependent form of dependent choice is needed. The nn-th shrinking must land inside Un+1U_{n+1}, so the admissible successors of VV change with nn; that is a family of relations and not a relation, and The axiom of dependent choice: a relation in which every element is related to something admits an N\mathbb{N}-indexed chain as stated applies to a single relation on a single set. Dependent choice along a sequence of relations: if RnR_n is entire on AA for every nn, then from any aa there is a sequence with anRnan+1a_n \mathbin{R_n} a_{n+1} is exactly the bridge, and it costs nothing beyond dependent choice itself.

Each UnU_n is used exactly once. The base step consumes U0U_0 and the step from VnV_n to Vn+1V_{n+1} consumes Un+1U_{n+1}, so as nn ranges over N\mathbb{N} every index is consumed and none twice. Since N\mathbb{N} contains 00, dropping the base step would leave U0U_0 untouched and the conclusion false as stated; the accounting is checked at step 8.1, where membership in UmU_m is established separately for m=0m = 0 and for m=n+1m = n+1.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

The one-point (Alexandroff) compactification X=X{}X^{*} = X \cup \{\infty\}, whose open sets are the open sets of XX together with the complements in XX^{*} of the closed compact subsets of XX

Definition

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

A point outside XX, named rather than assumed. Put

  :=  {yX:yy},\infty \;:=\; \{\, y \in X : y \notin y \,\},

a set by Separation. Then X\infty \notin X: were X\infty \in X, the defining condition applied to \infty itself would give     \infty \in \infty \iff \infty \notin \infty. So no hypothesis about XX is needed to obtain a point outside it, and the construction below is available for every space.

The space. Put X:=X{}X^{*} := X \cup \{\infty\} and

T  :=  T    {XC  :  CX, C closed in X and a compact subset of X}.\mathcal{T}^{*} \;:=\; \mathcal{T} \;\cup\; \{\, X^{*} \setminus C \;:\; C \subseteq X,\ C \text{ closed in } X \text{ and a compact subset of } X \,\} .

The pair (X,T)(X^{*}, \mathcal{T}^{*}) is the one-point compactification, or Alexandroff compactification, of XX. Members of T\mathcal{T} are said to be of the first kind and the sets XCX^{*} \setminus C of the second kind; a set of the second kind is exactly an open set of T\mathcal{T}^{*} containing \infty, since a member of T\mathcal{T} is a subset of XX, and the set CC is recovered from it as C=X(XC)C = X^{*} \setminus (X^{*} \setminus C).

T\mathcal{T}^{*} is a topology on XX^{*}, and this is discharged here. Throughout, "closed" and "compact" without qualification mean closed in XX and a compact subset of XX (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right); two facts about such sets are used and both are A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact: a subset of a compact CC that is closed in XX is closed in the subspace CC (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace) and hence compact, and a union of two compact subsets is compact.

(T1). T\varnothing \in \mathcal{T}, and X=XX^{*} = X^{*} \setminus \varnothing is of the second kind, \varnothing being closed in XX and compact.

(T2). Let ST\mathcal{S} \subseteq \mathcal{T}^{*}, let S1\mathcal{S}_1 be the members of S\mathcal{S} lying in T\mathcal{T} and S2\mathcal{S}_2 the rest, so that every member of S2\mathcal{S}_2 is of the second kind. If S2=\mathcal{S}_2 = \varnothing then S=S1\bigcup \mathcal{S} = \bigcup \mathcal{S}_1 lies in T\mathcal{T} by (T2) in XX. Otherwise put U:=S1TU := \bigcup \mathcal{S}_1 \in \mathcal{T} and D:={XO:OS2}\mathcal{D} := \{\, X^{*} \setminus O : O \in \mathcal{S}_2 \,\}, a nonempty family of closed compact subsets of XX, and C0:=DC_0 := \bigcap \mathcal{D}. Then C0C_0 is closed by (C2) of Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison, and it is a closed subset of any one member of D\mathcal{D}, hence compact. Now

S  =  U(XC0)  =  X(C0U),\bigcup \mathcal{S} \;=\; U \cup (X^{*} \setminus C_0) \;=\; X^{*} \setminus (C_0 \setminus U),

and C0U=C0(XU)C_0 \setminus U = C_0 \cap (X \setminus U) is closed in XX and a subset of the compact C0C_0, hence compact; so S\bigcup \mathcal{S} is of the second kind.

(T3). For U,VTU, V \in \mathcal{T} the intersection lies in T\mathcal{T} by (T3) in XX. For two sets of the second kind, (XC)(XD)=X(CD)(X^{*} \setminus C) \cap (X^{*} \setminus D) = X^{*} \setminus (C \cup D), and CDC \cup D is closed in XX and compact as a union of two compact subsets. For one of each, U\infty \notin U gives U(XC)=U(XC)U \cap (X^{*} \setminus C) = U \cap (X \setminus C), an intersection of two members of T\mathcal{T}.

Why the compact sets are also required to be closed. The complement of a compact set that is not closed in XX would not make \infty's neighbourhoods behave: the union computation in (T2) uses that an intersection of the discarded sets is again closed, and the intersection of arbitrary compact subsets of a non-Hausdorff space need not be compact. When XX is Hausdorff every compact subset is closed (In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones) and the two descriptions agree, which is why many texts state the definition without the word "closed" and silently assume the Hausdorff case.

Remarks

What the name promises is proved, not assumed. That XX^{*} is compact, that XX sits inside it as an open subspace carrying its own topology, and the exact conditions under which XX is dense in XX^{*} or XX^{*} is Hausdorff, are XX^{*} is compact and contains XX as an open subspace; XX is dense in XX^{*} exactly when XX is not compact; and XX^{*} is Hausdorff exactly when XX is locally compact and Hausdorff . Nothing above uses any of them.

The added point is a genuine construction and not a choice. The set \infty above is determined by XX; no appeal to any principle of choice is made, and no "take a point not in XX" is left unexplained.

XX^{*} is Hausdorff exactly when XX is locally compact and Hausdorff (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space), which is the reason local compactness and this construction always appear together.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

XX^{*} is compact and contains XX as an open subspace; XX is dense in XX^{*} exactly when XX is not compact; and XX^{*} is Hausdorff exactly when XX is locally compact and Hausdorff

Statement

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and let (X,T)(X^{*}, \mathcal{T}^{*}) be its one-point compactification, with added point \infty (The one-point (Alexandroff) compactification X=X{}X^{*} = X \cup \{\infty\}, whose open sets are the open sets of XX together with the complements in XX^{*} of the closed compact subsets of XX). Then:

  1. XX^{*} is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).
  2. XX is an open subspace of XX^{*}: XTX \in \mathcal{T}^{*}, and the subspace topology that XX inherits from XX^{*} (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace) is T\mathcal{T} itself.
  3. XX is dense in XX^{*} (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets) if and only if XX is not compact.
  4. XX^{*} is Hausdorff (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not) if and only if XX is locally compact (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space) and Hausdorff.

In particular, a locally compact Hausdorff space is an open subspace of a compact Hausdorff space, which is the reason the construction is made. No choice principle is used: the only cover thinned below is thinned by the indexed form of A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, which returns its own indices.

Facts & Assumptions

Given: A topological space (X,T)(X, \mathcal{T}), its one-point compactification X=X{}X^{*} = X \cup \{\infty\} with X\infty \notin X, and the topology T\mathcal{T}^{*}.

[L1]

T\mathcal{T}^{*} consists of the members of T\mathcal{T} together with the sets XCX^{*} \setminus C for CXC \subseteq X closed in XX and a compact subset of XX; an open subset of XX^{*} containing \infty is exactly one of the latter, and CC is recovered from it by complementation (The one-point (Alexandroff) compactification X=X{}X^{*} = X \cup \{\infty\}, whose open sets are the open sets of XX together with the complements in XX^{*} of the closed compact subsets of XX).

[L3]

AA is a compact subset of a space ZZ exactly when for every set II and every family (Wi)iI(W_i)_{i \in I} of open subsets of ZZ with AiIWiA \subseteq \bigcup_{i \in I} W_i there are nNn \in \mathbb{N} and i0,,inIi_0, \dots, i_n \in I with AWi0WinA \subseteq W_{i_0} \cup \dots \cup W_{i_n}, or else A=A = \varnothing (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, claim 2).

Proof

technique · direct
1.1

Claim 2: XTX \in \mathcal{T}, so XTX \in \mathcal{T}^{*} by [L1] and XX is open in XX^{*}; and the traces on XX of the members of T\mathcal{T}^{*} are the sets UX=UU \cap X = U for UTU \in \mathcal{T} and the sets (XC)X=XC(X^{*} \setminus C) \cap X = X \setminus C for CC closed in XX, all of which lie in T\mathcal{T}, while every UTU \in \mathcal{T} is its own trace. So the subspace topology is T\mathcal{T}.

L1L4
1.2

Claim 1: let UT\mathcal{U} \subseteq \mathcal{T}^{*} have union XX^{*}; some OUO \in \mathcal{U} contains \infty, so O=XCO = X^{*} \setminus C with CC closed in XX and a compact subset of XX, by [L1].

L1L2
1.3

For claim 3, the open subsets of XX^{*} containing \infty are exactly the sets XCX^{*} \setminus C with CXC \subseteq X closed and compact, and (XC)X=XC(X^{*} \setminus C) \cap X = X \setminus C; so by [L5] the point \infty lies in the closure of XX exactly when XCX \setminus C \ne \varnothing for every such CC.

L1L5
1.4

For the backward half of claim 4 assume XX is locally compact and Hausdorff, and let uvu \ne v in XX^{*}. If both lie in XX, disjoint open subsets of XX separating them are open in XX^{*} by [L1]. If v=v = \infty and u=xXu = x \in X, then [L7] applied to the neighbourhood XX of xx gives a compact neighbourhood CC of xx, closed by [L6], and an open UU of XX with xUCx \in U \subseteq C; then UU and XCX^{*} \setminus C are disjoint members of T\mathcal{T}^{*} containing xx and \infty.

L1L6L7
2.1

For the forward half of claim 4 assume XX^{*} is Hausdorff. Distinct points of XX are separated in XX^{*} by disjoint open P,QP, Q, and PXP \cap X, QXQ \cap X are disjoint sets open in XX by claim 2, so XX is Hausdorff.

L4L6step 1.1
2.2

The traces WXW \cap X for WUW \in \mathcal{U} are open in XX by step 1.1, and they cover CC, since CXC \subseteq X and U=X\bigcup \mathcal{U} = X^{*}; so [L3], applied with index set U\mathcal{U} and the family WWXW \mapsto W \cap X, gives nNn \in \mathbb{N} and W0,,WnUW_0, \dots, W_n \in \mathcal{U} with C(W0X)(WnX)C \subseteq (W_0 \cap X) \cup \dots \cup (W_n \cap X), or else C=C = \varnothing.

L3step 1.1step 1.2
2.3

A closed compact CXC \subseteq X equals XX exactly when XX is compact, since XX is closed in XX and, by [L2], XX is a compact subset of itself exactly when it is a compact space. So the condition of step 1.3 fails for some CC exactly when XX is compact.

L2step 1.3
3.1

For xXx \in X the Hausdorff property of XX^{*} gives disjoint open UxU \ni x and OO \ni \infty; by [L1] O=XCO = X^{*} \setminus C with CC closed in XX and compact, and UO=U \cap O = \varnothing forces UXO=CU \subseteq X^{*} \setminus O = C. As UU is open in XX by step 1.1 and contains xx, the compact set CC is a neighbourhood of xx in XX by [L4], so XX is locally compact.

L1L4L7step 1.1step 2.1
3.2

Claim 1 follows: X=OW0WnX^{*} = O \cup W_0 \cup \dots \cup W_n, since a point of XX^{*} is either \infty or a point of XX, a point of XX outside CC lies in O=XCO = X^{*} \setminus C, and a point of CC lies in some WjW_j by step 2.2; in the alternative C=C = \varnothing already X=OX^{*} = O. So every open cover of XX^{*} has a finite subcover.

L2step 1.2step 2.2
3.3

Claim 3 follows: X=X\overline{X} = X^{*} holds exactly when X\infty \in \overline{X}, since XXX \subseteq \overline{X} and X=X{}X^{*} = X \cup \{\infty\}; by steps 1.3 and 2.3 that holds exactly when XX is not compact.

L5step 1.3step 2.3
4.1

Claims 1, 2, 3 and 4 are established: claim 1 at step 3.2, claim 2 at step 1.1, claim 3 at step 3.3, and claim 4 by steps 1.4 for one direction and 2.1 and 3.1 for the other.

step 1.1step 1.4step 3.1step 3.2step 3.3

Remarks

Claim 3 is the reason the added point is called a point at infinity. When XX is compact the set {}\{\infty\} is itself open, so XX^{*} is the disjoint sum of XX and an isolated point and nothing has been compactified; the construction is of interest exactly when XX is not compact, and then every neighbourhood of \infty contains all of XX outside a compact set.

Claim 4 is where local compactness is forced. Separating a point xx from \infty means finding an open UxU \ni x and a closed compact CC with U(XC)=U \cap (X^{*} \setminus C) = \varnothing, that is UCU \subseteq C; and that is precisely a compact neighbourhood of xx. So the Hausdorff property of XX^{*} and local compactness of XX are the same requirement read on the two sides of the construction.

XX open in XX^{*} is claim 2 and is not automatic for a compactification in general. What claim 2 asserts is that no open set of XX is lost and none is gained: the topology XX inherits back from XX^{*} is the one it started with, so every statement about XX may be read inside XX^{*} without translation.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

On an ordinal with its order topology the sets [0,β][0,\beta] and (α,β](\alpha,\beta] form a basis of clopen sets, the isolated points are exactly the non-limit ordinals, and the space is Hausdorff

Statement

Let γ\gamma be an ordinal (Ordinal (von Neumann)), regarded as the set of ordinals below it, linearly ordered by membership (Trichotomy and well-ordering of the ordinals), and give it the order topology (The order topology of a linearly ordered set, with the open rays as a subbasis; order-convex sets, order-density, the least upper bound property, and linear continua). For α,βγ\alpha, \beta \in \gamma write

[0,β]:={ξγ:ξβ},(α,β]:={ξγ:α<ξβ}.[0,\beta] := \{\, \xi \in \gamma : \xi \le \beta \,\}, \qquad (\alpha,\beta] := \{\, \xi \in \gamma : \alpha < \xi \le \beta \,\} .

Then:

  1. Every set of either form is clopen (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), and Bγ  :=  {[0,β]:βγ}    {(α,β]:α,βγ}\mathcal{B}_\gamma \;:=\; \{\, [0,\beta] : \beta \in \gamma \,\} \;\cup\; \{\, (\alpha,\beta] : \alpha, \beta \in \gamma \,\} is a basis for the order topology of γ\gamma (Basis and subbasis for a topology, and the topology generated by a family of sets).
  2. The isolated points of γ\gamma (Interior, closure, boundary, exterior, derived set and isolated point in a topological space) are exactly the ordinals ξγ\xi \in \gamma that are 00 or a successor; a limit ordinal ξγ\xi \in \gamma (Successor and limit ordinals) is not isolated.
  3. γ\gamma with its order topology is Hausdorff (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not).

Regularity is not claimed here, and nothing below asserts any separation property beyond claim 3; the finer separation axioms are not available at this point in the reading order.

Facts & Assumptions

Given: An ordinal γ\gamma with the order topology of the membership order on it.

[L1]

γ\gamma is the set of the ordinals below it; membership is a strict linear order on it, αβ\alpha \le \beta abbreviates "αβ\alpha \in \beta or α=β\alpha = \beta", and αβ\alpha \subseteq \beta holds exactly when αβ\alpha \le \beta (Ordinal (von Neumann), Basic closure properties of ordinals, Trichotomy and well-ordering of the ordinals, Partial order and partially ordered set).

[L3]

A family of open sets is a basis for a topology exactly when every open UU and every xUx \in U admit a member BB of the family with xBUx \in B \subseteq U (Basis and subbasis for a topology, and the topology generated by a family of sets).

[L4]

Arbitrary unions and finite intersections of open sets are open, and a set is closed exactly when its complement is open (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L5]

β+=β{β}\beta^{+} = \beta \cup \{\beta\} is an ordinal, and for ordinals β<α\beta < \alpha holds exactly when β+α\beta^{+} \le \alpha: from βα\beta \in \alpha one gets βα\beta \subseteq \alpha and {β}α\{\beta\} \subseteq \alpha, hence β+α\beta^{+} \subseteq \alpha, and conversely ββ+α\beta \in \beta^{+} \subseteq \alpha. Every ordinal is 00, a successor or a limit ordinal (Basic closure properties of ordinals, Successor and limit ordinals, Ordinal (von Neumann)).

[L6]

A point xx of a space XX is isolated exactly when {x}\{x\} is open, since a neighbourhood NN of xx with NX={x}N \cap X = \{x\} contains an open UU with xU{x}x \in U \subseteq \{x\}, and conversely (Interior, closure, boundary, exterior, derived set and isolated point in a topological space, Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

Proof

technique · direct
1.1

For βγ\beta \in \gamma the set [0,β][0,\beta] is open: if β+γ\beta^{+} \in \gamma then ξβ\xi \le \beta is equivalent to ξ<β+\xi < \beta^{+} by [L5], so [0,β]=γ<β+[0,\beta] = \gamma_{<\beta^{+}}, an open ray; and if β+γ\beta^{+} \notin \gamma then β+γ\beta^{+} \subseteq \gamma, since every ordinal below β+\beta^{+} is β\le \beta and so lies in γ\gamma, whence β+=γ\beta^{+} = \gamma by [L1] and [0,β]=γ[0,\beta] = \gamma, which is open.

L1L2L4L5
1.2

For ξη\xi \ne \eta in γ\gamma the trichotomy of [L1] gives ξ<η\xi < \eta after renaming. By [L5] the inequality ξ<η\xi < \eta gives ξ+η\xi^{+} \le \eta, and since ηγ\eta \in \gamma, [L1] puts ξ+\xi^{+} in γ\gamma as well; so γ<ξ+\gamma_{<\xi^{+}} and γ>ξ\gamma_{>\xi} are open rays, and they contain ξ\xi and η\eta respectively, since ξ<ξ+\xi < \xi^{+} and ξ<η\xi < \eta. They are disjoint: a common point ζ\zeta would satisfy ζ<ξ+\zeta < \xi^{+}, hence ζξ\zeta \le \xi by [L5] and trichotomy, and ξ<ζ\xi < \zeta at once, which [L1] forbids. So claim 3 holds by [L7].

L1L2L5L7
2.1

For α,βγ\alpha, \beta \in \gamma the set (α,β]=γ>α[0,β](\alpha,\beta] = \gamma_{>\alpha} \cap [0,\beta] is open by [L4], being an intersection of two open sets.

L2L4step 1.1
2.2

Every set [0,β][0,\beta] is closed, its complement being the open ray γ>β\gamma_{>\beta}.

L2L4step 1.1
3.1

Every set (α,β](\alpha,\beta] is closed: its complement in γ\gamma is [0,α]γ>β[0,\alpha] \cup \gamma_{>\beta}, a union of an open set by step 1.1 and an open ray, hence open by [L4]. So every member of Bγ\mathcal{B}_\gamma is clopen.

L2L4step 1.1step 2.1step 2.2
3.2

Claim 2, the isolated points. The point 00 is isolated when 0γ0 \in \gamma, since {0}=[0,0]\{0\} = [0,0] is open by step 1.1; and a successor ξ=η+γ\xi = \eta^{+} \in \gamma is isolated, since η<ξ\eta < \xi puts η\eta in γ\gamma and {ξ}=(η,ξ]\{\xi\} = (\eta,\xi] is open by step 2.1.

L5L6step 1.1step 2.1
4.1

Bγ\mathcal{B}_\gamma is a basis. Let UU be open and ξU\xi \in U; by [L2] and [L3] there is a set BB among γ\gamma, the open rays and the open intervals with ξBU\xi \in B \subseteq U. If B=γB = \gamma or B=γ<bB = \gamma_{<b}, then [0,ξ][0,\xi] contains ξ\xi and lies inside BB, since ηξ\eta \le \xi gives η<b\eta < b in the second case. If B=γ>aB = \gamma_{>a} or B=(a,b)B = (a,b), then a<ξa < \xi and (a,ξ](a,\xi] contains ξ\xi and lies inside BB. In each case a member of Bγ\mathcal{B}_\gamma sits between ξ\xi and UU, and its members are open by step 1.1 and step 2.1, so [L3] applies and claim 1 is proved.

L2L3step 1.1step 2.1step 3.1
5.1

Conversely let ξγ\xi \in \gamma be a limit ordinal. Were {ξ}\{\xi\} open, step 4.1 would supply BBγB \in \mathcal{B}_\gamma with ξB{ξ}\xi \in B \subseteq \{\xi\}, so B={ξ}B = \{\xi\}. If B=[0,β]B = [0,\beta] then β=ξ\beta = \xi and 0B0 \in B, forcing ξ=0\xi = 0, which no limit ordinal is. If B=(α,ξ]B = (\alpha,\xi] with α<ξ\alpha < \xi then α+ξ\alpha^{+} \le \xi by [L5], and α+ξ\alpha^{+} \ne \xi because ξ\xi is not a successor, so α<α+<ξ\alpha < \alpha^{+} < \xi puts α+\alpha^{+} in BB alongside ξ\xi. Both cases are impossible, so {ξ}\{\xi\} is not open and ξ\xi is not isolated by [L6]; with step 3.2 this is claim 2.

L5L6step 3.2step 4.1

Remarks

Why the half-open sets and not the open intervals. In an ordinal every point other than a limit is isolated, and the sets (α,β](\alpha,\beta] are the convenient basic sets that always stay clopen: an open interval (α,β)(\alpha,\beta) need not be closed, while (α,β](\alpha,\beta] always is, because its complement is again a union of sets of the two admissible forms. That every basic set is clopen is what makes an ordinal space totally disconnected in the naive sense and is used repeatedly in Every successor ordinal is compact in its order topology and every limit ordinal is not; and, assuming countable choice, ω1\omega_1 is countably compact and sequentially compact while ω1+1\omega_1 + 1 is compact.

The topology defined here is the general order topology and not a second notion. It is The order topology of a linearly ordered set, with the open rays as a subbasis; order-convex sets, order-density, the least upper bound property, and linear continua applied to the linearly ordered set γ\gamma, and claim 1 says only that the general basis of rays and intervals may be replaced by the more convenient Bγ\mathcal{B}_\gamma. A published item elsewhere in the library states the same topology on an ordinal directly, as def-order-topology-on-an-ordinal; it is named here in plain text because its page comes later in the reading order, and the agreement between the two descriptions is exactly claim 1.

The greatest-element case is not an edge case to be waved through. When γ\gamma is a successor δ+\delta^{+} its greatest element is δ\delta and [0,δ]=γ[0,\delta] = \gamma; step 1.1 treats that case explicitly, and it is the case that makes a successor ordinal compact (Every successor ordinal is compact in its order topology and every limit ordinal is not; and, assuming countable choice, ω1\omega_1 is countably compact and sequentially compact while ω1+1\omega_1 + 1 is compact).

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

Every successor ordinal is compact in its order topology and every limit ordinal is not; and, assuming countable choice, ω1\omega_1 is countably compact and sequentially compact while ω1+1\omega_1 + 1 is compact

Statement

Every ordinal carries the order topology of the membership order on it (Ordinal (von Neumann), The order topology of a linearly ordered set, with the open rays as a subbasis; order-convex sets, order-density, the least upper bound property, and linear continua), with the clopen basis Bγ\mathcal{B}_\gamma of On an ordinal with its order topology the sets [0,β][0,\beta] and (α,β](\alpha,\beta] form a basis of clopen sets, the isolated points are exactly the non-limit ordinals, and the space is Hausdorff. Then:

  1. Successors are compact. For every ordinal δ\delta the successor ordinal δ+\delta^{+} is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).
  2. Limits are not. No limit ordinal (Successor and limit ordinals) is compact.
  3. Assuming the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)): the first uncountable ordinal ω1\omega_1 (The first uncountable ordinal ω1:=(ω)\omega_1 := \aleph(\omega)) is sequentially compact and countably compact (Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets), and it is not compact; while ω1+1\omega_1 + 1 is compact (Ordinal addition α+β\alpha + \beta).

Claims 1 and 2 are theorems of ZF. Claim 3 spends countable choice twice, both times through cited results that carry the hypothesis in their own statements: Assuming countable choice: every at most countable subset of ω1\omega_1 is bounded below ω1\omega_1, so no at most countable subset of ω1\omega_1 is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable, which supplies the boundedness of at most countable subsets of ω1\omega_1, and claim 2 of 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, which converts sequential compactness into countable compactness; the extraction of a subsequence below selects nothing, taking least elements throughout.

Facts & Assumptions

[A1]

The Axiom of Countable Choice, for claim 3 only (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[L2]

On an ordinal γ\gamma the sets [0,β][0,\beta] and (α,β](\alpha,\beta] with α,βγ\alpha, \beta \in \gamma are clopen and form a basis Bγ\mathcal{B}_\gamma, so every open UU and every ηU\eta \in U admit a member of Bγ\mathcal{B}_\gamma between them (On an ordinal with its order topology the sets [0,β][0,\beta] and (α,β](\alpha,\beta] form a basis of clopen sets, the isolated points are exactly the non-limit ordinals, and the space is Hausdorff, claim 1; Basis and subbasis for a topology, and the topology generated by a family of sets).

[L3]

Ordinals are linearly ordered by membership; β<α\beta < \alpha holds exactly when β+α\beta^{+} \le \alpha; a nonempty set of ordinals has a least element, and a nonempty set listed as {β0,,βn}\{\beta_0, \dots, \beta_n\} has a greatest, by induction on nn using trichotomy; and βλ\beta \in \lambda with λ\lambda a limit ordinal gives β+λ\beta^{+} \in \lambda (Ordinal (von Neumann), Basic closure properties of ordinals, Trichotomy and well-ordering of the ordinals, Successor and limit ordinals).

[L4]

Transfinite induction: if SS is a subset of a well-ordered set WW containing every aa all of whose strict predecessors lie in SS, then S=WS = W (Transfinite induction).

[L6]

Assuming ACω\mathrm{AC}_\omega, every at most countable Aω1A \subseteq \omega_1 satisfies supA=Aω1\sup A = \bigcup A \in \omega_1 (Assuming countable choice: every at most countable subset of ω1\omega_1 is bounded below ω1\omega_1, so no at most countable subset of ω1\omega_1 is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable, claim (a)).

[L8]

An infinite subset PNP \subseteq \mathbb{N} carries a strictly increasing enumeration imii \mapsto m_i of N\mathbb{N} onto PP, built by taking least elements and using no choice principle; and a strictly increasing index map satisfies miim_i \ge i (Every subset of an at most countable set is at most countable, A strictly increasing index map satisfies nkkn_k \ge k).

[L9]

A sequence in a space is a function on N\mathbb{N}, and ykpy_k \to p means that every open set containing pp contains yky_k from some index on; a subsequence is given by a strictly increasing index map (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).

[L11]

α+1=α+\alpha + 1 = \alpha^{+} for every ordinal α\alpha (Ordinal addition α+β\alpha + \beta).

Proof

technique · direct
1.1

For claim 1 let γ:=δ+\gamma := \delta^{+}, so that δ\delta is the greatest element of γ\gamma and [0,δ]=γ[0,\delta] = \gamma; let U\mathcal{U} be an open cover of γ\gamma and put S:={ηγ:finitely many members of U cover [0,η]}S := \{\, \eta \in \gamma : \text{finitely many members of } \mathcal{U} \text{ cover } [0,\eta] \,\}.

L1L3construct
1.2

For claim 2 let λ\lambda be a limit ordinal; the family {[0,β]:βλ}\{\, [0,\beta] : \beta \in \lambda \,\} consists of open sets by [L2] and covers λ\lambda, since ξ[0,ξ]\xi \in [0,\xi] for every ξλ\xi \in \lambda.

L2L3
1.3

For claim 3 assume ACω\mathrm{AC}_\omega and let (yk)(y_k) be a sequence in ω1\omega_1; its range is at most countable by [L7], so [L6] gives σ:=sup{yk:kN}ω1\sigma := \sup\{\, y_k : k \in \mathbb{N} \,\} \in \omega_1, and the set {kN:ykσ}\{\, k \in \mathbb{N} : y_k \le \sigma \,\} is all of N\mathbb{N} and in particular infinite.

A1L6L7
2.1

Let ηγ\eta \in \gamma and suppose [0,ζ][0,\zeta] is covered by finitely many members of U\mathcal{U} for every ζ<η\zeta < \eta. Some UUU \in \mathcal{U} contains η\eta, and [L2] gives BBγB \in \mathcal{B}_\gamma with ηBU\eta \in B \subseteq U. If B=[0,β]B = [0,\beta] then ηβ\eta \le \beta and [0,η][0,β]U[0,\eta] \subseteq [0,\beta] \subseteq U, so {U}\{U\} covers [0,η][0,\eta]. If B=(α,β]B = (\alpha,\beta] then α<ηβ\alpha < \eta \le \beta, and [0,η][0,α](α,η][0,α]U[0,\eta] \subseteq [0,\alpha] \cup (\alpha,\eta] \subseteq [0,\alpha] \cup U by [L3], so a finite cover of [0,α][0,\alpha] with UU adjoined covers [0,η][0,\eta]. Either way ηS\eta \in S.

L2L3step 1.1
2.2

A finite subfamily of the cover of step 1.2 is empty, and then covers only λ\varnothing \ne \lambda, or is [0,β0],,[0,βn][0,\beta_0], \dots, [0,\beta_n] with union [0,β][0,\beta] for β\beta the greatest of the βj\beta_j, which exists by [L3]; and β+λ\beta^{+} \in \lambda by [L3] while β+[0,β]\beta^{+} \notin [0,\beta]. So no finite subfamily covers λ\lambda and λ\lambda is not compact, which is claim 2.

L1L3step 1.2
2.3

By [L5] and [L6] the set {ξω1:{k:ykξ} is infinite}\{\, \xi \in \omega_1 : \{k : y_k \le \xi\} \text{ is infinite} \,\} is a nonempty set of ordinals, σ\sigma belonging to it by step 1.3, so it has a least element τ\tau by [L3]; then P:={kN:ykτ}P := \{\, k \in \mathbb{N} : y_k \le \tau \,\} is infinite while {k:ykα}\{\, k : y_k \le \alpha \,\} is finite for every α<τ\alpha < \tau.

L3L5step 1.3
3.1

By [L4] applied to the well-ordered γ\gamma, step 2.1 gives S=γS = \gamma; in particular δS\delta \in S, so finitely many members of U\mathcal{U} cover [0,δ]=γ[0,\delta] = \gamma. As U\mathcal{U} was arbitrary, γ=δ+\gamma = \delta^{+} is compact, which is claim 1.

L1L4step 1.1step 2.1
3.2

Let imii \mapsto m_i be the strictly increasing enumeration of PP given by [L8]; then (ymi)(y_{m_i}) is a subsequence of (yk)(y_k) by [L9], and every one of its terms satisfies ymiτy_{m_i} \le \tau.

L8L9step 2.3
4.1

ymiτy_{m_i} \to \tau. Let UU be open with τU\tau \in U and take BBω1B \in \mathcal{B}_{\omega_1} with τBU\tau \in B \subseteq U by [L2]. If B=[0,β]B = [0,\beta] then τβ\tau \le \beta and every term satisfies ymiτβy_{m_i} \le \tau \le \beta, so all terms lie in BB. If B=(α,β]B = (\alpha,\beta] then α<τβ\alpha < \tau \le \beta, the set {k:ykα}\{k : y_k \le \alpha\} is finite by step 2.3, so {i:ymiα}\{\, i : y_{m_i} \le \alpha \,\} is finite, the map imii \mapsto m_i being injective; hence α<ymiτβ\alpha < y_{m_i} \le \tau \le \beta for all large ii and the terms lie in BB from some index on. So ω1\omega_1 is sequentially compact.

L2L9step 2.3step 3.2
5.1

By [L10] the space ω1\omega_1 is therefore countably compact; it is not compact by step 2.2, being a limit ordinal by [L5]; and ω1+1=ω1+\omega_1 + 1 = \omega_1^{+} is compact by step 3.1 and [L11]. This is claim 3, and with claims 1 and 2 at steps 3.1 and 2.2 the theorem is proved.

L5L10L11step 2.2step 3.1step 4.1

Remarks

Why claim 1 is a transfinite induction and not an ordinary one. The statement being proved at η\eta uses the statement at α\alpha for a single α<η\alpha < \eta produced by the cover, not at the predecessor of η\eta, and η\eta may have no predecessor. What the induction of [L4] gives is exactly the right shape: the step assumes the statement below η\eta and proves it at η\eta, with no separate limit clause to write.

ω1\omega_1 separates sequential compactness from compactness. It is sequentially compact and countably compact and not compact, so neither of those two properties implies compactness; that is the content of FALSE: every sequentially compact space is compact and FALSE: every countably compact space is compact, both of which take their witness from here. The reason is visible in the proof: countably many terms cannot escape from ω1\omega_1, because a countable set of countable ordinals has a countable supremum, while the uncountable cover by the initial segments has no finite subfamily covering everything.

The hypothesis of countable choice is inherited, not added. It enters through two cited results whose own statements carry it — Assuming countable choice: every at most countable subset of ω1\omega_1 is bounded below ω1\omega_1, so no at most countable subset of ω1\omega_1 is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable at the boundedness step, and claim 2 of 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 at the passage from sequential to countable compactness; the boundedness of an at most countable subset of ω1\omega_1 is what claim 3 rests on, and everything else in the argument takes least elements.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

Every closed initial segment of the long ray is compact; the long ray is not compact; and, assuming countable choice, it is countably compact and not Lindel"of

Statement

Let R=ω1×[0,1)R = \omega_1 \times [0,1) be the closed long ray with its lexicographic order and its order topology (The closed long ray ω1×[0,1)\omega_1 \times [0,1) under the lexicographic order, and the long line, with the order topology), with least element 0R0_R and no greatest element. For yRy \in R write [0R,y]:={zR:zy}[0_R, y] := \{\, z \in R : z \le y \,\}. Then:

  1. Initial segments are compact. For every uRu \in R the set [0R,u][0_R, u] is a compact subset of RR (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).
  2. Countable compactness, assuming the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)): RR is countably compact (Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets).
  3. RR is not compact, and this needs no choice principle.
  4. RR is not Lindelöf, assuming the Axiom of Countable Choice.

Claims 1 and 3 are theorems of ZF. Claims 2 and 4 spend countable choice, in both cases only through claim 3 of The long ray is a linear continuum, hence connected; every one of its at most countable subsets is bounded above, assuming countable choice, which carries the hypothesis in its own statement; claim 2 spends it once more to pick a point in each of countably many nonempty sets.

Facts & Assumptions

Given: The closed long ray RR with its lexicographic order and order topology, its least element 0R0_R, the open rays R<b={z:z<b}R_{<b} = \{z : z < b\} and R>a={z:a<z}R_{>a} = \{z : a < z\}, and the open intervals (a,b)(a,b).

[A1]

The Axiom of Countable Choice, for claims 2 and 4 only (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[L1]

RR is a linearly ordered set with least element 0R0_R and no greatest element, carrying the order topology; RR itself, the open rays and the open intervals form a basis for that topology, so every open UU and every xUx \in U admit one of them between them (The closed long ray ω1×[0,1)\omega_1 \times [0,1) under the lexicographic order, and the long line, with the order topology, The order topology of a linearly ordered set, with the open rays as a subbasis; order-convex sets, order-density, the least upper bound property, and linear continua, Basis and subbasis for a topology, and the topology generated by a family of sets).

[L2]

RR is a linear continuum: it is order-dense, so between any two of its elements lies a third, and every nonempty subset bounded above has a least upper bound (The long ray is a linear continuum, hence connected; every one of its at most countable subsets is bounded above, assuming countable choice, claim 1; Upper bound, least upper bound, and strict upper bound).

[L5]

AA is a compact subset of RR exactly when every family of open subsets of RR covering AA has finitely many members covering AA, or else A=A = \varnothing (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, claim 1).

[L6]

For a nonempty set, being at most countable and admitting a surjection from N\mathbb{N} are the same thing: a nonempty at most countable family may be listed as (Un)nN(U_n)_{n \in \mathbb{N}} with repetitions allowed, and conversely the range of any such list is at most countable; no choice principle is involved (A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}, Finite, countably infinite, countable, uncountable).

Proof

technique · direct
1.1

For claim 1 fix uRu \in R and a family U\mathcal{U} of open subsets of RR with [0R,u]U[0_R,u] \subseteq \bigcup \mathcal{U}, and put D:={y[0R,u]:finitely many members of U cover [0R,y]}D := \{\, y \in [0_R,u] : \text{finitely many members of } \mathcal{U} \text{ cover } [0_R,y] \,\}. Then 0RD0_R \in D, since 0R0_R lies in some member of U\mathcal{U} and [0R,0R]={0R}[0_R, 0_R] = \{0_R\}, and uu is an upper bound of DD; so [L2] gives s:=supDs := \sup D, and sus \le u because uu is an upper bound.

L1L2L5construct
1.2

For claim 3 the family R:={R<x:xR}\mathcal{R} := \{\, R_{<x} : x \in R \,\} is an open cover of RR: its members are open by [L1], and every yRy \in R lies in R<xR_{<x} for some xx, since RR has no greatest element.

L1
1.3

For claim 2 assume ACω\mathrm{AC}_\omega and let U\mathcal{U} be an at most countable open cover of RR with no finite subcover; it is nonempty, so [L6] lists it as (Un)nN(U_n)_{n \in \mathbb{N}}, and En:=R(U0Un)E_n := R \setminus (U_0 \cup \dots \cup U_n) is nonempty for every nn, so countable choice supplies a sequence (xn)(x_n) with xnEnx_n \in E_n. The range {xn:nN}\{\, x_n : n \in \mathbb{N} \,\} is at most countable by [L6], so [L3] gives an upper bound uRu \in R for it.

A1L3L4L6
2.1

ss lies in some UUU \in \mathcal{U}, and [L1] gives a basic BB with sBUs \in B \subseteq U, where BB is RR, an open ray or an open interval. If BB is RR or a lower ray R<bR_{<b}, then every zsz \le s satisfies z<bz < b, so [0R,s]BU[0_R,s] \subseteq B \subseteq U and {U}\{U\} covers [0R,s][0_R,s]. Otherwise BB is R>aR_{>a} or (a,b)(a,b) with a<sa < s, and aa is not an upper bound of DD, so some yDy \in D has a<ysa < y \le s; a finite FU\mathcal{F} \subseteq \mathcal{U} covers [0R,y][0_R,y], and [0R,s][0R,y](a,s]FB[0_R,s] \subseteq [0_R,y] \cup (a,s] \subseteq \bigcup \mathcal{F} \cup B, so F{U}\mathcal{F} \cup \{U\} covers [0R,s][0_R,s]. In every case sDs \in D.

L1L2step 1.1
2.2

No finite subfamily of R\mathcal{R} covers RR: the empty subfamily covers \varnothing and RR is nonempty, while a subfamily R<x0,,R<xnR_{<x_0}, \dots, R_{<x_n} has union R<xR_{<x} for xx the greatest of the xjx_j, which exists because the order is linear and the list finite, and xR<xx \notin R_{<x}. So RR is not compact, which is claim 3.

L1L4step 1.2
3.1

s=us = u. Suppose s<us < u, and keep BB and UU from step 2.1, together with a finite GU\mathcal{G} \subseteq \mathcal{U} covering [0R,s][0_R,s], which step 2.1 provides. If BB is RR or R>aR_{>a}, then (s,u]BU(s,u] \subseteq B \subseteq U and G{U}\mathcal{G} \cup \{U\} covers [0R,u][0_R,u], putting uu in DD and forcing usu \le s, contrary to s<us < u. If BB is R<bR_{<b} or (a,b)(a,b), then s<bs < b and s<us < u, so the lesser of bb and uu is strictly above ss and [L2] gives zz with s<zs < z and zz below that lesser element; then zuz \le u and (s,z]B(s,z] \subseteq B, so G{U}\mathcal{G} \cup \{U\} covers [0R,z][0_R,z] and zDz \in D with z>sz > s, contradicting s=supDs = \sup D.

L1L2step 1.1step 2.1
4.1

By steps 2.1 and 3.1 the element uu lies in DD, so finitely many members of U\mathcal{U} cover [0R,u][0_R,u]; as U\mathcal{U} was arbitrary, [L5] makes [0R,u][0_R,u] a compact subset of RR, which is claim 1.

L5step 1.1step 2.1step 3.1
5.1

By claim 1 the set [0R,u][0_R,u] is covered by finitely many of the UnU_n, say by Un0,,UnpU_{n_0}, \dots, U_{n_p}; let NN be the greatest of n0,,npn_0, \dots, n_p. Then xNux_N \le u, so xN[0R,u]Un0UnpU0UNx_N \in [0_R,u] \subseteq U_{n_0} \cup \dots \cup U_{n_p} \subseteq U_0 \cup \dots \cup U_N, contradicting xNENx_N \in E_N. So no such U\mathcal{U} exists and RR is countably compact, which is claim 2.

L4L5step 1.3step 4.1
6.1

For claim 4 assume ACω\mathrm{AC}_\omega and let VR\mathcal{V} \subseteq \mathcal{R} be an at most countable subfamily of the cover of step 1.2. The map xR<xx \mapsto R_{<x} is injective, since x<xx < x' puts xx in R<xR_{<x'} and not in R<xR_{<x}, so A:={xR:R<xV}A := \{\, x \in R : R_{<x} \in \mathcal{V} \,\} is at most countable and [L3] gives it an upper bound wRw \in R; then R<xR<wR_{<x} \subseteq R_{<w} for every xAx \in A, so VR<w\bigcup \mathcal{V} \subseteq R_{<w} and ww is covered by no member of V\mathcal{V}. So R\mathcal{R} has no at most countable subcover and RR is not Lindelöf, which is claim 4; with claims 1, 2 and 3 at steps 4.1, 5.1 and 2.2 the theorem is proved.

A1L3L4step 1.2step 2.2step 5.1

Remarks

The long ray is the standard example of a countably compact space that is not compact. Both halves come from the same feature: an at most countable subset of RR is bounded above, so countably many open sets can never exhaust it unless finitely many of them already do, while the uncountable cover by initial rays climbs forever. The ordinal ω1\omega_1 behaves the same way (Every successor ordinal is compact in its order topology and every limit ordinal is not; and, assuming countable choice, ω1\omega_1 is countably compact and sequentially compact while ω1+1\omega_1 + 1 is compact) and for the same reason, which is why both are proved from a boundedness theorem rather than from any covering argument.

Claim 1 is a Heine-Borel theorem for a linear continuum. Its proof uses only that RR is order-dense with the least upper bound property, together with the description of the order topology by rays and intervals; no metric and no countability appears. The same argument proves that a closed bounded interval of R\mathbb{R} is compact, which is why the two look alike.

What is not claimed. Nothing above says RR is sequentially compact, and nothing says it is metrizable or first countable; a countably compact space need not be sequentially compact without further hypotheses, and the implications that do hold are collected in 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.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

In a compact Hausdorff space every quasicomponent is connected, so quasicomponents and components coincide

Statement

Let (X,T)(X, \mathcal{T}) be a compact Hausdorff space (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and let xXx \in X. Then the quasicomponent Q(x)Q(x) is connected (Connected components, quasicomponents, and totally disconnected spaces, Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets), and consequently

C(x)  =  Q(x):C(x) \;=\; Q(x) :

the component of xx and the quasicomponent of xx are the same set, so the components and the quasicomponents of XX are the same family of subsets.

The inclusion C(x)Q(x)C(x) \subseteq Q(x) holds in every space (Every quasicomponent is a closed union of components, so each component is contained in a quasicomponent, and the quasicomponents partition the space, claim 1) and can be strict; what the two hypotheses buy is the reverse inclusion. No choice principle is used.

Facts & Assumptions

Given: A compact Hausdorff space (X,T)(X, \mathcal{T}) and a point xXx \in X.

[L1]

Q(x)Q(x) is the intersection of all clopen subsets of XX containing xx, a nonempty family since XX itself is one; so a clopen set containing xx contains Q(x)Q(x) (Connected components, quasicomponents, and totally disconnected spaces).

[L2]
[L3]

C(x)C(x) is connected, contains xx, and contains every connected subset of XX that contains xx (The components of a space are its maximal connected subsets, they partition it, and each of them is closed, claim 1).

[L4]

A separation of a space is a pair of disjoint nonempty open subsets whose union is the space, and each piece of a separation is also closed, being the complement of the other; a subset is connected when the subspace it carries is (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

[L5]

The closed subsets of a subspace SS are the traces of the closed subsets of XX, so a subset closed in a closed SS is closed in XX (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

[L6]

A closed subset of a compact space is a compact subset of it (A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact, claim 1).

[L8]

A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection; a family has that property when the intersection of every finite list in it is nonempty, the intersection of the empty list being the whole space (A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection, Finite intersection property).

[L9]

Finite intersections of open sets are open and finite intersections of closed sets are closed; a set is clopen when it is both (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

Proof

technique · direct
1.1

Write Q:=Q(x)Q := Q(x) and suppose QQ carries a separation: disjoint nonempty sets A,BA, B, open in the subspace QQ, with AB=QA \cup B = Q, and xAx \in A after renaming, since xQx \in Q by [L1]. By [L4] each of AA and BB is also closed in QQ; QQ is closed in XX by [L2], so AA and BB are closed in XX by [L5] and compact subsets of XX by [L6].

L1L2L4L5L6construct
2.1

By [L7] there are disjoint open UAU \supseteq A and VBV \supseteq B in XX, and then Q=ABUVQ = A \cup B \subseteq U \cup V.

L7step 1.1
3.1

Let K\mathcal{K} be the family of clopen subsets of XX containing xx and put F:={K(UV):KK}\mathcal{F} := \{\, K \setminus (U \cup V) : K \in \mathcal{K} \,\}, a family of closed subsets of XX by [L9]. Its intersection is Q(UV)Q \setminus (U \cup V) by [L1], which is empty by step 2.1.

L1L9step 2.1
4.1

By [L8] the family F\mathcal{F} therefore fails the finite intersection property, so some finite list in it has empty intersection; the empty list is not such a list, its intersection being XX, which contains the nonempty AA. So there are nNn \in \mathbb{N} and K0,,KnKK_0, \dots, K_n \in \mathcal{K} with (K0Kn)(UV)=(K_0 \cap \dots \cap K_n) \setminus (U \cup V) = \varnothing, and K:=K0KnK := K_0 \cap \dots \cap K_n is a clopen set containing xx with KUVK \subseteq U \cup V.

L8L9step 1.1step 3.1
5.1

KUK \cap U is clopen: it is open as an intersection of two open sets, and it equals KVK \setminus V, since KUVK \subseteq U \cup V and UV=U \cap V = \varnothing, so it is the intersection of the closed KK with the closed complement of VV. It contains xx, because xAUx \in A \subseteq U and xKx \in K.

L9step 2.1step 4.1
6.1

So KUK \cap U belongs to K\mathcal{K} and [L1] gives QKUUQ \subseteq K \cap U \subseteq U; but BB is a nonempty subset of QQ contained in VV, so it lies in UV=U \cap V = \varnothing. This is impossible, so QQ admits no separation and is connected by [L4].

L1L4step 1.1step 2.1step 5.1
7.1

Hence Q(x)Q(x) is a connected subset of XX containing xx, so Q(x)C(x)Q(x) \subseteq C(x) by [L3], while C(x)Q(x)C(x) \subseteq Q(x) by [L2]; the two sets are equal, and since every component and every quasicomponent is of the form C(y)C(y) and Q(y)Q(y) for a point yy, the two families coincide.

L2L3step 6.1

Remarks

Both hypotheses are used, and each does one thing. The Hausdorff condition turns the two closed pieces of a hypothetical separation into sets that can be surrounded by disjoint open sets; compactness turns the intersection of all clopen sets through xx into a finite intersection, which is again clopen. Drop either and the argument stops: without compactness the clopen sets through xx need not shrink to Q(x)Q(x) finitely, and without the Hausdorff condition the two pieces need not be separated at all.

The inclusion that can be strict. In an arbitrary space a quasicomponent may properly contain a component, and the witness is a space that is not compact; the general containment is Every quasicomponent is a closed union of components, so each component is contained in a quasicomponent, and the quasicomponents partition the space, which explicitly declines to assert equality. This theorem is the standard hypothesis under which the two notions agree, and it is the reason the distinction is rarely visible in the compact Hausdorff spaces of everyday use.

What is not claimed. Nothing above says the components are open. If every component of XX is a singleton then XX is totally disconnected, that being the definition; what the theorem adds is that the quasicomponents are then singletons too. Components need not be open (The components of a space are its maximal connected subsets, they partition it, and each of them is closed); local connectedness is a separate hypothesis, and it is exactly the condition that every component of every open subspace is open, which also makes the components of XX itself clopen (A space is locally connected exactly when every component of every open subspace is open; in that case the components of the space itself are clopen).

RemarkRemark: AI-adaptedProof: Not applicableverified 2026-08-05 (gpt-5.6-sol-codex-subscription) rests on unproved material (inherited)Open item page →
Rests on 2 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Feferman 1965: ZF does not prove that a free ultrafilter on the naturals exists and Halpern and Lévy 1971: the Boolean prime ideal theorem does not imply the Axiom of Choice. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The quasicompact convention, why compactness of a subset is read intrinsically here, and what each result on this page costs in choice

Three conventions, fixed once

1. Compact means the open-cover condition and nothing more. Following Bourbaki, some authors reserve compact for a space that is both quasicompact, meaning every open cover has a finite subcover, and Hausdorff, and then say quasicompact for the cover condition alone. This library takes the more widely adopted convention: Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right defines compact as the cover condition, the word quasicompact is not used, and every Hausdorff hypothesis is written into the statement that needs it — as in In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones and In a locally compact Hausdorff space every point has a neighbourhood base of compact sets, every open subspace and every closed subspace is locally compact, every open set around a point contains an open set with compact closure inside it, and every compact set sits inside an open set with compact closure. A reader arriving from the other convention should read every unqualified "compact" here as "quasicompact".

2. Compactness of a subset is intrinsic. Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right calls AXA \subseteq X compact when the subspace AA carries is a compact space, not when every family of open subsets of XX covering AA has finitely many members covering it. The two conditions agree, and that is a theorem, A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it; no proof here uses the ambient reading without citing it. Compactness belongs to AA together with its topology. It is preserved under a homeomorphic realization as a subspace, but a different ambient may induce a different topology and a different compactness answer. The metric development fixed the same reading, and that the two developments describe one notion is For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide.

Relative compactness is the exception, and deliberately so: Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets defines AA to be relatively compact in XX when A\overline{A} is compact, and the closure is taken in XX. That condition really is about AA inside XX and changes when the ambient space changes.

3. A separation axiom is written out rather than named where it is not available. Claim 4 of 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 needs every singleton to be closed. That condition is a named separation axiom, and the page naming it is not among this page's declared prerequisites, so the hypothesis is stated in the vocabulary of open and closed sets and nothing is asserted about the axiom it belongs to. On this page a neighbourhood need not be open, and the intersection of no sets is the whole space; these two general conventions are in force without further comment.

The choice ledger

Every entry below is a statement about the proof given in this library, and about nothing else. Each is an upper bound on what that proof spends; no item on this page claims that a choice principle is necessary, because that would be an independence result and this library proves none.

Theorems of ZF, spending no choice principle at all. A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide, A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection, A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact, In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones, A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism, Tube lemma: if KK is compact and an open NX×ZN \subseteq X \times Z contains K×{z0}K \times \{z_0\}, then NN contains K×WK \times W for some open Wz0W \ni z_0, A product of finitely many compact spaces is compact in the product topology, A subset of Rn\mathbb{R}^n with the product topology is compact exactly when it is closed and bounded, the product topology being the Euclidean metric topology, In a locally compact Hausdorff space every point has a neighbourhood base of compact sets, every open subspace and every closed subspace is locally compact, every open set around a point contains an open set with compact closure inside it, and every compact set sits inside an open set with compact closure, XX^{*} is compact and contains XX as an open subspace; XX is dense in XX^{*} exactly when XX is not compact; and XX^{*} is Hausdorff exactly when XX is locally compact and Hausdorff, On an ordinal with its order topology the sets [0,β][0,\beta] and (α,β](\alpha,\beta] form a basis of clopen sets, the isolated points are exactly the non-limit ordinals, and the space is Hausdorff, In a compact Hausdorff space every quasicomponent is connected, so quasicomponents and components coincide, claim 1 of 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, claims 1 and 2 of Every successor ordinal is compact in its order topology and every limit ordinal is not; and, assuming countable choice, ω1\omega_1 is countably compact and sequentially compact while ω1+1\omega_1 + 1 is compact, and claims 1 and 3 of Every closed initial segment of the long ray is compact; the long ray is not compact; and, assuming countable choice, it is countably compact and not Lindel"of. The refutations of FALSE: a compact subset of a topological space is closed and of FALSE: every subspace of a locally compact space is locally compact are also theorems of ZF: each exhibits a single explicit witness and spends no choice principle.

Where a proof in that list does make a selection, the selection is over a finite index set, and Every natural-number-indexed list of nonempty sets has a choice function on its family of values is itself a theorem of ZF. Tube lemma: if KK is compact and an open NX×ZN \subseteq X \times Z contains K×{z0}K \times \{z_0\}, then NN contains K×WK \times W for some open Wz0W \ni z_0 avoids even the finite selection: it indexes its cover by pairs of open sets, so the compactness criterion hands back the second entries with the indices. In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones avoids the arbitrary selection by collecting the family of all open sets that work rather than choosing one for each point, and then makes only the finite selections that Every natural-number-indexed list of nonempty sets has a choice function on its family of values supplies. The textbook phrase "for each yKy \in K choose disjoint open Uy,VyU_y, V_y" is a selection over an arbitrary index set, that is the full Axiom of Choice (The Axiom of Choice), and it is avoided throughout this page.

Spending the Axiom of Choice, through Zorn's lemma (Zorn's lemma). Alexander's subbase lemma: if every cover by members of a fixed subbasis has a finite subcover then the space is compact; the proof is an application of Zorn's lemma spends it exactly once, to obtain a maximal open cover without a finite subcover; Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice inherits that use and spends it a second time directly, to produce a point of a product of nonempty sets; and FALSE: every compact space is sequentially compact inherits both, since its witness is compact by Tychonoff. Tychonoff's theorem implies the Axiom of Choice, so, under the standing assumption that ZF is consistent, no proof of it in ZF alone can exist; the exact form of that implication, and the correction of the classical derivation, are recorded in Schechter 2006: Kelley's cofinite proof yields BPI, not the Axiom of Choice , which this library states and does not prove. Where the ultrafilter lemma sits between the two is What the ultrafilter lemma costs: a choice principle strictly weaker than AC.

Spending the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)). Claims 2 and 4 of 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, each of which picks a point outside each of countably many nested unions; claim 3 of Every successor ordinal is compact in its order topology and every limit ordinal is not; and, assuming countable choice, ω1\omega_1 is countably compact and sequentially compact while ω1+1\omega_1 + 1 is compact; claims 2 and 4 of Every closed initial segment of the long ray is compact; the long ray is not compact; and, assuming countable choice, it is countably compact and not Lindel"of; and the two false statements whose witnesses those are, FALSE: every sequentially compact space is compact and FALSE: every countably compact space is compact. In the ordinal and long-ray results the principle enters through a boundedness theorem for at most countable subsets, which carries the hypothesis in its own statement — and not only through it: claim 2 of Every closed initial segment of the long ray is compact; the long ray is not compact; and, assuming countable choice, it is countably compact and not Lindel"of spends it once more directly, to pick a point in each of countably many nonempty sets, and claim 3 of Every successor ordinal is compact in its order topology and every limit ordinal is not; and, assuming countable choice, ω1\omega_1 is countably compact and sequentially compact while ω1+1\omega_1 + 1 is compact inherits a further use through claim 2 of 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.

Spending the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N\mathbb{N}-indexed chain). Claim 3 of 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, where it is spent to extract a countably infinite subset from an infinite set, which is not a theorem of ZF; the claim about countably infinite subsets alone, claim 1(d) of the same theorem, is free of that cost. And Assuming dependent choice, every locally compact Hausdorff space is a Baire space, which spends it once, through Dependent choice along a sequence of relations: if RnR_n is entire on AA for every nn, then from any aa there is a sequence with anRnan+1a_n \mathbin{R_n} a_{n+1}, to run a shrinking construction whose admissible successors change with the stage. In both cases dependent choice is an upper bound on the cost of the argument given here and is not asserted to be necessary; for the Baire theorem in particular the several versions of the statement correspond to different principles over ZF, as The Baire category theorem is four inequivalent statements over ZF records.

The metric ledger is separate and remains in force. What each implication between the compactness properties of a metric space costs is recorded 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. Nothing here supersedes it: by For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide for compactness itself, and by the agreement clauses of Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets for countable compactness, sequential compactness and limit point compactness, the metric statements are the statements of this page read in a metric topology, so the two ledgers describe the same arrows wherever they overlap and different arrows elsewhere.

A warning about equivalences. 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 is deliberately stated as a list of implications rather than as one equivalence, because an equivalence proved by going round a cycle charges every arrow in it the maximum cost. The same discipline is what 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 exists to enforce on the metric side.

5 · Examples, counterexamples and false statements

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

FALSE: a compact subset of a topological space is closed

Statement

False claim: in every topological space (X,T)(X, \mathcal{T}) (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), a compact subset (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right) is closed.

Where the claim comes from, and what is actually true. In a Hausdorff space a compact subset is closed, and that is In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones, claim 3. The claim above is that theorem with its hypothesis dropped. The refutation builds its own witness: Sierpinski space, the two-point space with exactly one non-trivial open set (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

Facts & Assumptions

Given: The two-element set S={a,b}S = \{a,b\} with aba \ne b, and the family TSier={,{b},S}\mathcal{T}_{\mathrm{Sier}} = \{\varnothing, \{b\}, S\}.

[A1]

The false claim: in every topological space a compact subset is closed.

[L1]

TSier\mathcal{T}_{\mathrm{Sier}} is a topology on SS, the particular-point topology with particular point bb; a subset of SS is closed exactly when its complement lies in TSier\mathcal{T}_{\mathrm{Sier}} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L2]

A subset AA of a space is a compact subset when the subspace (A,TA)(A, \mathcal{T}_A) is compact, and every space listed as {x0,,xn}\{x_0, \dots, x_n\} is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

Refutation

technique · contradiction
1.1

Suppose the claim [A1] holds, so that in every topological space every compact subset is closed.

A1assume-contra
1.2

(S,TSier)(S, \mathcal{T}_{\mathrm{Sier}}) is a topological space by [L1], and its closed sets are SS, {a}\{a\} and \varnothing, the complements of \varnothing, {b}\{b\} and SS.

L1
2.1

{b}\{b\} is a compact subset of SS: the subspace it carries is a one-point space, which is compact by [L2].

L2step 1.2
2.2

{b}\{b\} is not closed in SS, since its complement {a}\{a\} is not a member of TSier\mathcal{T}_{\mathrm{Sier}}.

L1step 1.2
3.1

By [A1] applied to the space of step 1.2 and the compact subset of step 2.1, the set {b}\{b\} would be closed, which step 2.2 denies. So the claim [A1] is false.

A1step 2.1step 2.2discharge-contradiction

Remarks

The witness is as small as a witness can be. Sierpinski space has two points and three open sets, and it fails the Hausdorff condition for the only reason available: the only open set containing aa is SS, which also contains bb (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not). Since every finite space is compact, every subset of it is a compact subset, so the failure is not about compactness being hard to achieve; it is entirely about closedness.

What survives without a separation hypothesis. A compact subset remains compact in any other ambient inducing the same topology on it — in particular, compactness is invariant under homeomorphism — that being the content of the intrinsic definition (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right), and a closed subset of a compact space is still compact (A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact). It is only the converse direction, from compact to closed, that needs the ambient space to separate points.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

FALSE: every compact space is sequentially compact

Statement

False claim: every compact topological space (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right) is sequentially compact (Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets).

Where the claim comes from, and what is actually true. For a metric space the two conditions are equivalent, and the claim above is that equivalence transplanted to an arbitrary topological space. The refutation builds its own witness out of Tychonoff's theorem (Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice): the product

Y  :=  xD{0,1},D:={0,1}N,Y \;:=\; \prod_{x \in D} \{0,1\}, \qquad D := \{0,1\}^{\mathbb{N}},

of one copy of the two-point discrete space for every 00-11 sequence, together with the sequence (Fn)(F_n) in YY whose nn-th term reads off the nn-th coordinate, Fn(x):=xnF_n(x) := x_n. The Axiom of Choice is assumed, since Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice carries it.

Facts & Assumptions

Given: The two-point discrete space {0,1}\{0,1\} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), the set D={0,1}ND = \{0,1\}^{\mathbb{N}} of functions N{0,1}\mathbb{N} \to \{0,1\} (The natural numbers N\mathbb{N} (von Neumann)), the product Y=xD{0,1}Y = \prod_{x \in D} \{0,1\} with the product topology (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space), the projections πx:Y{0,1}\pi_x : Y \to \{0,1\}, and the elements FnYF_n \in Y defined by Fn(x):=xnF_n(x) := x_n for nNn \in \mathbb{N} and xDx \in D.

[A1]

The false claim: every compact topological space is sequentially compact.

[L3]

A sequence in a space is a function on N\mathbb{N}; it converges to pp when every open set containing pp contains all but finitely many of its terms; a subsequence is given by a strictly increasing index map jnjj \mapsto n_j, which satisfies njjn_j \ge j; and a space is sequentially compact when every sequence has a convergent subsequence (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 nkkn_k \ge k, Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets).

Refutation

technique · contradiction
1.1

Suppose the claim [A1] holds, so that every compact space is sequentially compact.

A1assume-contra
1.2

YY is compact by [L1], being a product of copies of the compact two-point discrete space.

L1
2.1

By [A1] and step 1.2 the sequence (Fn)(F_n) in YY has a subsequence (Fnj)(F_{n_j}) converging to some GYG \in Y, the index map jnjj \mapsto n_j being strictly increasing.

A1L3step 1.2
3.1

Define xDx \in D by xk:=0x_k := 0 when k=njk = n_j for an even jj, xk:=1x_k := 1 when k=njk = n_j for an odd jj, and xk:=0x_k := 0 for every kk not of the form njn_j; this is well defined because jnjj \mapsto n_j is injective, being strictly increasing. Then Fnj(x)=xnjF_{n_j}(x) = x_{n_j} is 00 for even jj and 11 for odd jj.

L3step 2.1construct
4.1

The set πx1[{G(x)}]\pi_x^{-1}[\{G(x)\}] is open by [L2] and contains GG, so by step 2.1 it contains FnjF_{n_j} for all large jj; that is, Fnj(x)=G(x)F_{n_j}(x) = G(x) for all large jj. But step 3.1 makes Fnj(x)F_{n_j}(x) take the value 00 at every even jj and 11 at every odd jj, so it is constant on no set of large indices. This contradiction refutes the claim [A1].

A1L2step 2.1step 3.1discharge-contradiction

Remarks

What the witness exploits. Compactness of a product is a statement about covers and survives an index set of any size; sequential compactness is a statement about countably many terms and does not. The index set DD here is the set of all 00-11 sequences, and the point xx built at step 3.1 is chosen to disagree with the given subsequence at exactly the places that matter, which is possible precisely because every 00-11 sequence is available as an index.

No binary expansion of a real number is used, and none is needed: the witness is built from {0,1}\{0,1\}-valued functions directly, so nothing here rests on the representation of reals by digits.

The Axiom of Choice is assumed only through Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice, which is where compactness of YY comes from. Nothing else in the refutation selects anything; the point xx is defined by a rule.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

FALSE: every sequentially compact space is compact

Statement

False claim: every sequentially compact topological space (Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets) is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

Where the claim comes from, and what is actually true. For a metric space the two conditions are equivalent, and that equivalence is proved elsewhere in this library at a stated choice cost; the claim above is that equivalence transplanted to an arbitrary topological space, where it fails. What does hold in general is only that sequential compactness implies countable compactness, and that at the cost of countable choice.

The refutation assumes the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)), because that is what makes the witness sequentially compact; without it the witness is not known to have the property the claim would have to preserve. The witness is ω1\omega_1 with its order topology (The first uncountable ordinal ω1:=(ω)\omega_1 := \aleph(\omega), On an ordinal with its order topology the sets [0,β][0,\beta] and (α,β](\alpha,\beta] form a basis of clopen sets, the isolated points are exactly the non-limit ordinals, and the space is Hausdorff).

Facts & Assumptions

Refutation

technique · contradiction
1.1

Suppose the claim [A1] holds, so that every sequentially compact space is compact.

A1assume-contra
1.2

Assuming [A2], the space ω1\omega_1 with its order topology is sequentially compact.

A2L1
2.1

By [A1] and step 1.2 the space ω1\omega_1 would be compact.

A1step 1.2
2.2

But ω1\omega_1 is a limit ordinal, so it is not compact by [L2]; equivalently, the cover of ω1\omega_1 by the initial segments [0,β][0,\beta] with βω1\beta \in \omega_1 has no finite subcover, the union of finitely many of them being a single [0,β][0,\beta] and β+\beta^{+} lying in ω1\omega_1 outside it.

L1L2step 1.2
3.1

Steps 2.1 and 2.2 contradict each other, so the claim [A1] is false.

A1step 2.1step 2.2discharge-contradiction

Remarks

Why the two conditions can diverge at all. Sequential compactness tests countably many points at a time and compactness tests covers of any size. In ω1\omega_1 a sequence is a countable object and is therefore bounded below ω1\omega_1, while the cover by initial segments is uncountable and climbs the whole ordinal; the two conditions are simply looking at different cardinalities. For a metric space the topology is determined by countably many balls at each point and the divergence disappears.

The implication that does survive is sequential compactness to countable compactness, assuming countable choice (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, claim 2).

The converse claim also fails, and its witness is a different space entirely: a compact space that is not sequentially compact is exhibited in FALSE: every compact space is sequentially compact. Neither of the two implications holds in general, so sequential compactness and compactness are incomparable conditions on topological spaces.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

FALSE: every countably compact space is compact

Statement

False claim: every countably compact topological space (Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets) is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

Where the claim comes from, and what is actually true. Countable compactness tests only the at most countable open covers, and the claim above asserts that testing those is enough. It is enough when the space is also Lindelöf, and the claim above drops that hypothesis.

The refutation assumes the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)), which is what makes each witness countably compact. Two witnesses are available and both are refutations on their own: the first uncountable ordinal ω1\omega_1 with its order topology (The first uncountable ordinal ω1:=(ω)\omega_1 := \aleph(\omega), On an ordinal with its order topology the sets [0,β][0,\beta] and (α,β](\alpha,\beta] form a basis of clopen sets, the isolated points are exactly the non-limit ordinals, and the space is Hausdorff), and the closed long ray (The closed long ray ω1×[0,1)\omega_1 \times [0,1) under the lexicographic order, and the long line, with the order topology).

Facts & Assumptions

Given: The first uncountable ordinal ω1\omega_1 with its order topology, the closed long ray RR with its order topology, and the Axiom of Countable Choice.

[A1]

The false claim: every countably compact topological space is compact.

Refutation

technique · contradiction
1.1

Suppose the claim [A1] holds, so that every countably compact space is compact.

A1assume-contra
1.2

Assuming [A2], the space ω1\omega_1 with its order topology is countably compact by [L1], and the closed long ray RR is countably compact by [L2].

A2L1L2
2.1

By [A1] and step 1.2 both ω1\omega_1 and RR would be compact.

A1step 1.2
2.2

Neither is: ω1\omega_1 is not compact by [L1], and RR is not compact by [L2].

L1L2step 1.2
3.1

Steps 2.1 and 2.2 contradict each other, so the claim [A1] is false, and each of the two spaces refutes it on its own.

A1step 2.1step 2.2discharge-contradiction

Remarks

Why the missing hypothesis is Lindelöfness and not something weaker. Countable compactness plus Lindelöfness does give compactness (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, claim 1(b)), so a countably compact non-compact space must fail to be Lindelöf. The long ray is checked to fail it directly (Every closed initial segment of the long ray is compact; the long ray is not compact; and, assuming countable choice, it is countably compact and not Lindel"of, claim 4), and ω1\omega_1 fails it for the same reason: the cover by initial segments has no at most countable subcover, an at most countable set of countable ordinals being bounded.

The two witnesses are not the same space and neither is redundant. The ordinal ω1\omega_1 is also sequentially compact, so it separates compactness from sequential compactness as well (FALSE: every sequentially compact space is compact); the long ray is a linear continuum and is connected, so it also shows that connectedness contributes nothing to compactness.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)Open item page →

FALSE: every subspace of a locally compact space is locally compact

Statement

False claim: local compactness (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space) is a hereditary property (Hereditary, open-hereditary and closed-hereditary properties of topological spaces): every subspace (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace) of a locally compact space is locally compact.

Where the claim comes from, and what is actually true. Metrizability is hereditary, and so are several other properties of the same shape, so the expectation is natural. What is true for local compactness is heredity along open subspaces and along closed subspaces of a locally compact Hausdorff space; an arbitrary subspace need not inherit it. The witness below is the rationals inside the real line, which is neither open nor closed in it.

Facts & Assumptions

Given: The real line R\mathbb{R} with its usual topology, the metric dR(s,t)=std_{\mathbb{R}}(s,t) = |s-t|, the subset QR\mathbb{Q} \subseteq \mathbb{R} of rationals with the subspace topology, and the bounded open intervals (c,d)(c,d).

[A1]

The false claim: every subspace of a locally compact space is locally compact.

[L4]

A subset AA of a space is a compact subset when the subspace it carries is compact, and for ASXA \subseteq S \subseteq X the topology AA inherits from SS is the one it inherits from XX, so compactness of AA does not depend on which of the two it is read in (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace, Hereditary, open-hereditary and closed-hereditary properties of topological spaces).

Refutation

technique · contradiction
1.1

Suppose the claim [A1] holds, so that every subspace of a locally compact space is locally compact.

A1assume-contra
1.2

R\mathbb{R} with its usual topology is locally compact by [L2].

L1L2
2.1

By [A1] and step 1.2 the subspace Q\mathbb{Q} would be locally compact, so the point 00 of Q\mathbb{Q} would have a compact neighbourhood KK in Q\mathbb{Q}: a set KQK \subseteq \mathbb{Q}, compact as a subspace, containing a set open in Q\mathbb{Q} that contains 00. By [L1] and the definition of the subspace topology that open set contains (ε,ε)Q(-\varepsilon, \varepsilon) \cap \mathbb{Q} for some real ε>0\varepsilon > 0, so (ε,ε)QK(-\varepsilon, \varepsilon) \cap \mathbb{Q} \subseteq K.

A1L1L4step 1.2
3.1

By [L4] the set KK is a compact subset of R\mathbb{R} as well, and hence closed in R\mathbb{R} and bounded by [L5].

L4L5step 2.1
4.1

By [L3] there is an irrational tt with 0<t<ε0 < t < \varepsilon. Every neighbourhood of tt in R\mathbb{R} contains an interval (c,d)(c,d) with c<t<dc < t < d, which may be shrunk so that 0<c0 < c and d<εd < \varepsilon, and [L3] then puts a rational qq with c<q<dc < q < d in it; that qq lies in (ε,ε)QK(-\varepsilon,\varepsilon) \cap \mathbb{Q} \subseteq K. So every neighbourhood of tt meets KK, and KK being closed, [L5] gives tKQt \in K \subseteq \mathbb{Q} — but tt is irrational. This contradiction refutes the claim [A1].

A1L1L3L5step 2.1step 3.1discharge-contradiction

Remarks

Why Q\mathbb{Q} fails at every point, not just at 00. The argument uses nothing about 00 beyond its being rational: for any qQq \in \mathbb{Q} a compact neighbourhood would have to be a closed subset of R\mathbb{R} containing all rationals near qq, and hence would contain the irrationals near qq as well, which it cannot. So Q\mathbb{Q} is nowhere locally compact, and the witness is not an isolated defect at one point.

What the failure is about. A compact subset of R\mathbb{R} is closed in R\mathbb{R}, and a subset of Q\mathbb{Q} that is closed in R\mathbb{R} has empty interior in R\mathbb{R}; so no compact subset of Q\mathbb{Q} can contain a whole interval's worth of rationals. The two facts pull in opposite directions, and Q\mathbb{Q} is caught between them precisely because it is dense in R\mathbb{R} and is not all of it.

Heredity does hold in two special cases and they are proved rather than assumed: along open subspaces of a locally compact Hausdorff space and along closed subspaces of any locally compact space (In a locally compact Hausdorff space every point has a neighbourhood base of compact sets, every open subspace and every closed subspace is locally compact, every open set around a point contains an open set with compact closure inside it, and every compact set sits inside an open set with compact closure, claim 2). The set Q\mathbb{Q} is neither open nor closed in R\mathbb{R}, so it escapes both.

Sources

Standard references

Recommended treatments; not extraction sources.