Alphabeta Math
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.

✓ 8 results · all verified · 3 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 5 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Compactness: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (claude-sonnet-5 + deepseek-v4-pro)verified 2026-08-05 (claude-sonnet-5)Open item page →

The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies placed in the compactness hierarchy

Example

Let X be a set and let Tdisc, Tind, Tcof, Tcoc, Tp and TSier be the topologies of The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies. Compactness is as in Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right. Then:

  1. Discrete. (X,Tdisc) is compact if and only if X is finite (Finite, countably infinite, countable, uncountable).
  2. Indiscrete. (X,Tind) is compact, for every X.
  3. Cofinite. (X,Tcof) is compact, for every X.
  4. Particular point. For p∈X, the space (X,Tp) is compact if and only if X is finite.
  5. Cocountable. (R,Tcoc) is neither compact nor countably compact (Countably compact, Lindel"of, sequentially compact, limit point compact and σ-compact spaces, and relatively compact subsets).
  6. Sierpinski. Sierpinski space S={a,b} is compact, being finite, and its subset {b} is a compact subset that is not 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).

Claims 2 and 3 are the ones worth noticing: compactness on its own is a very weak condition, and a space can be compact while separating no two of its points at all.

Facts & Assumptions

Given: A set X, a point p∈X where the particular-point topology is in play, and the six topologies of The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies.

[L1]

A space is compact when every family of open sets with union the space has a finite subfamily with union the space; a family is finite when it is empty or listable; every space listed as {x0,…,xn} is compact (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).

[L2]

Tdisc=P(X); Tind={∅,X}; Tcof consists of ∅ and the sets with finite complement; Tcoc of ∅ and the sets with at most countable complement; Tp of ∅ and the sets containing p; and TSier={∅,{b},S} on S={a,b} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[L3]

A set is finite when it is equinumerous with a natural number, equivalently when it is listable as {x0,…,xn} or empty; a subset of an at most countable set is at most countable; R is uncountable (Finite, countably infinite, countable, uncountable, Every subset of an at most countable set is at most countable, R is uncountable (Cantor's nested intervals, 1874)).

[L6]

The naturals embed in R by the canonical natural ι (The canonical natural ι(n)=n⋅1F of a field, The natural numbers N (von Neumann)); ι is injective, which is a lemma about ordered fields and not part of the definition (Canonical naturals are positive and strictly increasing), so {ι(n):n∈N} is a countably infinite subset of R.

Verification

technique · direct
1.1

Claim 1. If X is finite it is compact by [L1], whatever its topology. If X is compact in the discrete topology, the family of singletons { {x}:x∈X } is an open cover by [L2], so finitely many singletons cover X and X is listable, hence finite by [L3].

L1L2L3
1.2

Claim 2. Let U⊆Tind have union X. If X=∅ the empty subfamily covers it; otherwise some member is nonempty, hence equals X by [L2], and that single member is a finite subcover.

L1L2
1.3

Claim 4. If X is finite it is compact by [L1]. If X is compact in Tp, then { {p,x}:x∈X } is a family of open sets by [L2] with union X, so finitely many of its members cover X; their union is a listable set, so X is finite by [L3].

L1L2L3
1.4

Claim 6. S is finite, hence compact by [L1]; the subspace {b} is a one-point space and so compact by [L1], making {b} a compact subset by [L4]; and {b} is not closed, its complement {a} not lying in TSier by [L2]. By [L5] this forces S not to be Hausdorff, which it is not: the only open set containing a is S.

L1L2L4L5
2.1

Claim 3. Let U⊆Tcof have union X≠∅, the empty case being as in step 1.2. Some U0∈U is nonempty, so X∖U0 is finite by [L2], say X∖U0={y0,…,yk} or empty; in the second case {U0} covers X, and in the first each yj lies in some member of U, and finitely many members named in this way together with U0 cover X.

L1L2L3
2.2

Claim 5. Put an:=ι(n) for n∈N and An:={ am:m>n }, an at most countable subset of R by [L6] and [L3], so that Un:=R∖An lies in Tcoc by [L2]. Every real lies in some Un: a real that is no am lies in U0, and am lies in Um. So { Un:n∈N } is an at most countable open cover of R.

L2L3L6step 1.1
3.1

The sets Un increase with n, since the An decrease, so the union of finitely many of them is a single UN, and aN+1∈AN lies outside it. Hence this at most countable open cover has no finite subcover and (R,Tcoc) is neither countably compact nor compact, which is claim 5.

L1L3step 2.2∎

Remarks

Compactness alone separates nothing. The cofinite topology on an infinite set is compact and has the property that any two nonempty open sets meet, so it is as far from Hausdorff as a topology can be; the indiscrete topology is compact and has only two open sets. Every theorem on the companion page that concludes a separation property from compactness carries a Hausdorff hypothesis for exactly this reason. The purely covering conclusions there carry none: continuous images of compact spaces are compact, a continuous real function on a nonempty compact space attains its bounds, and products of compact spaces are compact, all without any separation hypothesis.

The discrete and the cocountable cases fail for different reasons. A discrete space fails compactness because its singletons already form a cover with nothing to thin; the cocountable topology on R fails it because countably many points can be shaved off one at a time and no finite stage removes them all. The second failure is at the countable level, which is why it kills countable compactness too.

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

[0,1] and the Cantor set are compact, by Heine-Borel and by closedness inside [0,1]; and, assuming the Axiom of Choice, so is [0,1]N, by Tychonoff

Example

Let R carry its usual topology (The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), let [0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length) and the Cantor set C (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds) carry 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), and let

Q  :=  [0,1]N  =  ∏n∈N[0,1]

carry the product topology (The product set ∏i∈IXi 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). Then, with compactness as in Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right:

  1. [0,1] is compact.
  2. C is compact, being closed inside [0,1].
  3. Q is compact, assuming the Axiom of Choice.

Each of the three uses a different tool, and that is the point of putting them together: Heine-Borel for a closed bounded subset of the line, the closed-subspace theorem for a closed subset of something already known to be compact, and Tychonoff for a product over an infinite index set.

Facts & Assumptions

Given: R with its usual topology, the interval [0,1]={t∈R:0≤t≤1}, the Cantor set C, and the product Q=∏n∈N[0,1] with the product topology.

Verification

technique · direct
1.1

By [L3] the set [0,1] is closed in R and bounded, so [L1] makes it a compact subset of the metric space R and [L2] makes it a compact subset of the topological space R; that is, the subspace [0,1] is a compact space, which is claim 1.

L1L2L3
2.1

By [L4] the set C is closed in R and contained in [0,1], so C=C∩[0,1] is the trace of a closed set and hence closed in the subspace [0,1]; by step 1.1 that subspace is compact, so [L5] makes C a compact subset of it, and by [L2] the subspace C is a compact space, which is claim 2.

L2L4L5step 1.1
3.1

Each factor of Q is the compact space [0,1] of step 1.1, so [L6] makes Q compact, which is claim 3.

L6step 1.1∎

Remarks

Claim 2 does not need Heine-Borel a second time. The Cantor set is closed and bounded, so [L1] would give its compactness directly; the route through [0,1] is taken because it uses only that C is closed in a space already known to be compact, which is the argument that generalises to spaces with no metric.

Claim 3 is where the cost appears. Claims 1 and 2 are theorems of ZF, the bisection proof of Heine-Borel selecting nothing; claim 3 rests on Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice and therefore on the Axiom of Choice. For a product over a finite index set no choice is needed (A product of finitely many compact spaces is compact in the product topology), so the cost is attached to the infinite index set and not to the factors.

Q is metrizable, and that is a separate fact. Compactness of Q is proved here from the product structure alone and uses no metric on Q; whether a metric inducing the product topology exists is a separate question, which nothing among this page's declared prerequisites answers and which no claim above needs.

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

R∗ is homeomorphic to the unit circle by inverse stereographic projection, and N∗ is the ordinal space ω+1

Example

Let X∗=X∪{∞} denote the one-point compactification (The one-point (Alexandroff) compactification X∗=X∪{∞}, whose open sets are the open sets of X together with the complements in X∗ of the closed compact subsets of X), whose added point is ∞={ y∈X:y∉y }. Then:

  1. The naturals. Give N the discrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). Then N∗ is the ordinal ω+1 (Ordinal addition α+β) as a set, and the topology T∗ is the order topology of that ordinal (On an ordinal with its order topology the sets [0,β] and (α,β] form a basis of clopen sets, the isolated points are exactly the non-limit ordinals, and the space is Hausdorff); so the identity map is a homeomorphism (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological) and no construction is needed.
  2. The line. Give R its usual topology and let S1  :=  { (x,y)∈R2:x2+y2=1 } carry the subspace topology from R2 (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it, For n≥1 the product topology on n copies of the usual topology of R is the metric topology of d∞ on Rn, and hence also of d1 and d2, so Rn as a product and Rn as a metric space are one space, 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). The map h:R∗→S1,h(t):=(2tt2+1, t2−1t2+1)  (t∈R),h(∞):=(0,1), the inverse of stereographic projection from the north pole, is a homeomorphism.

No trigonometry is used, and no circle is described by angles; the map above and its inverse (x,y)↦x/(1−y) are rational.

Facts & Assumptions

Given: N with the discrete topology, R with its usual topology, the one-point compactifications N∗ and R∗, the circle S1⊆R2, and the map h.

[L2]

Every natural number satisfies n∉n, N=ω is an ordinal, ω+1=ω+=ω∪{ω}, and the elements of ω are exactly the naturals (Basic closure properties of ordinals, Ordinal (von Neumann), ω is the least limit ordinal, Ordinal addition α+β, The natural numbers N (von Neumann)).

[L5]

R2 carries one topology, the product topology and the metric topology of d∞(x,y)=max⁡{∣x0−y0∣,∣x1−y1∣} being the same; a subset of R2 is a compact subset exactly when it is closed and bounded; and every subspace of a metrizable space is metrizable and hence Hausdorff (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it, For n≥1 the product topology on n copies of the usual topology of R is the metric topology of d∞ on Rn, and hence also of d1 and d2, so Rn as a product and Rn as a metric space are one space, A subset of Rn with the product topology is compact exactly when it is closed and bounded, the product topology being the Euclidean metric topology, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not, Every subspace of a metrizable space is metrizable and every subspace of a first countable space is first countable, the metric case being the subspace metric already identified with the subspace topology, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).

[L6]

A map into a product is continuous exactly when both components are; a quotient of polynomial functions with nowhere vanishing denominator is continuous as a map R→R, and continuity there agrees with continuity as a map of metric spaces and hence of topological spaces (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, claim 2; Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function, Dictionary: for A⊆R with the metric d(x,y)=∣x−y∣, continuity and uniform continuity of f:A→R agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of R is compact in the open-cover sense of R exactly when it is a compact metric subspace, claim 1; Continuity of a map of topological spaces at a point and globally, For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and f(A‾)⊆f(A)‾, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not, The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded, The product set ∏i∈IXi 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).

Verification

technique · direct
1.1

For X=N the added point is ∞={ n∈N:n∉n }=N=ω by [L2], since every natural satisfies n∉n. Hence N∗=ω∪{ω}=ω+=ω+1, an equality of sets and not merely a bijection.

L1L2
1.2

For X=R the circle S1⊆R2 carries the subspace topology of R2, which is metrizable by [L5]; so S1 is metrizable and hence Hausdorff by [L5]. Nothing below uses compactness of S1.

L5
2.1

By [L3] the compact subsets of the discrete N are exactly its finite subsets, and every subset is closed; so by [L1] the open sets of N∗ are the subsets of N together with the sets N∗∖F with F⊆N finite.

L1L3step 1.1
2.2

By [L4] a subset V of ω+1 is open in the order topology exactly when each of its points lies in a set [0,β] or (α,β] inside V. A subset of ω is open, each of its naturals n lying in [0,0]={0} or in (n−1,n]={n}; and a set V∋ω is open exactly when it contains [0,ω]=ω+1 or some (α,ω] with α∈ω, that is exactly when (ω+1)∖V⊆[0,α] for some natural α, that is exactly when its complement is finite.

L2L4step 1.1
2.3

h is a bijection R∗→S1. For t∈R one computes (2t)2+(t2−1)2=(t2+1)2, so h(t)∈S1, and h(t)≠(0,1) since t2−1=t2+1 is impossible. Conversely for (x,y)∈S1 with y≠1 put t:=x/(1−y); then t2=x2/(1−y)2=(1−y2)/(1−y)2=(1+y)/(1−y), so t2+1=2/(1−y) and t2−1=2y/(1−y), whence h(t)=(x,y); and t is the unique such real, being recovered from h(t) by the same formula. With h(∞)=(0,1) this makes h a bijection.

L8step 1.2
3.1

h is continuous at every point of R: its two components are t↦2t/(t2+1) and t↦(t2−1)/(t2+1), quotients of polynomials whose denominator never vanishes, hence continuous by [L6], so h restricted to R is continuous into R2 by [L6] and hence into the subspace S1, which contains its image.

L5L6step 2.3
3.2

Claim 1 follows: by steps 2.1 and 2.2 the two topologies on the set ω+1 of step 1.1 are the same family of subsets, so the identity map is a bijection carrying open sets to open sets in both directions and is a homeomorphism.

L1step 1.1step 2.1step 2.2
4.1

h is continuous at ∞. Let V be open in S1 with (0,1)∈V; by [L5] there is a real r>0 with every point of S1 at d∞-distance less than r from (0,1) lying in V. By [L8] fix a natural M≥1 with 1/M<r/2, and put C:={ s∈R:∣s∣≤M }, which is a closed bounded interval of R, hence a compact subset of R by [L9]. For t∉C one has ∣t∣>M≥1, so ∣2t/(t2+1)∣≤2∣t∣/t2=2/∣t∣<2/M<r and ∣(t2−1)/(t2+1)−1∣=2/(t2+1)≤2/t2≤2/M<r; hence h(t)∈V. So W:=R∗∖C is open in R∗ by [L1], contains ∞, and satisfies h[W]⊆V.

L1L5L8L9step 2.3step 3.1
5.1

h is therefore a continuous bijection from R∗, which is compact by [L1], to S1, which is Hausdorff by step 1.2; so [L7] makes it a homeomorphism, which is claim 2. With claim 1 at step 3.2 both statements are proved.

L1L7step 1.2step 2.3step 3.1step 3.2step 4.1∎

Remarks

The naturals need no map at all. The added point of The one-point (Alexandroff) compactification X∗=X∪{∞}, whose open sets are the open sets of X together with the complements in X∗ of the closed compact subsets of X is constructed from the space, and for N that construction returns ω itself; the compactification is then literally the ordinal ω+1 with its order topology, which is compact by Every successor ordinal is compact in its order topology and every limit ordinal is not; and, assuming countable choice, ω1 is countably compact and sequentially compact while ω1+1 is compact, claim 1, as it must be.

Where compactness does the work for the circle. Producing the inverse of h explicitly is possible here and was done at step 2.3, but continuity of that inverse is never checked: [L7] supplies it from compactness of R∗ and the Hausdorff property of S1. That is the standard use of claim 3 of 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.

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

R and Q are σ-compact, and Lindel"of assuming countable choice; R is locally compact and Q is nowhere locally compact

Example

Let R carry its usual topology and let Q, the rationals inside R, carry 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). Then:

  1. R is σ-compact (Countably compact, Lindel"of, sequentially compact, limit point compact and σ-compact spaces, and relatively compact subsets): R=⋃n∈N[−ι(n),ι(n)], and each of those intervals is compact.
  2. Q is σ-compact, being an at most countable union of its own singletons (Q is countably infinite).
  3. Assuming the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), both R and Q are Lindelöf.
  4. R is locally compact (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space) and Q is locally compact at no point of it.

Claims 1, 2 and 4 are theorems of ZF. Claim 3 spends countable choice twice: once to name a finite subcover for each of countably many pieces, and once more through Countable unions of at most countable sets, assuming ACω, which is what makes the union of those countably many finite families at most countable.

Facts & Assumptions

Given: R with its usual topology, the canonical natural ι, the rationals Q⊆R with the subspace topology, and for n∈N the interval In:={ t∈R:−ι(n)≤t≤ι(n) }.

[L4]

Q is countably infinite, so there is a surjection N→Q, and every nonempty at most countable family may be indexed by N (Q is countably infinite, Finite, countably infinite, countable, uncountable, A nonempty set is at most countable iff it is a surjective image of N).

[L5]

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

[L6]

A space is σ-compact when it is the union of an at most countable family of compact subsets, and Lindelöf when every open cover has an at most countable subcover; a space is locally compact when every point has a compact neighbourhood, a neighbourhood of x being a set containing an open set containing x (Countably compact, Lindel"of, sequentially compact, limit point compact and σ-compact spaces, and relatively compact subsets, Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space, Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

[L9]

A subset K of a space X is compact exactly when every family of open subsets of X covering K has a finite subfamily covering K; the intrinsic and ambient readings agree (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).

[L10]

Assuming the Axiom of Countable Choice, a union ⋃n∈NAn of at most countable sets indexed by N is at most countable (Countable unions of at most countable sets, assuming ACω, The Axiom of Countable Choice (ACω)).

Verification

technique · direct
1.1

Each In is closed in R, its complement being the union of the open sets {t:t<−ι(n)} and {t:t>ι(n)}, and it is bounded; so In is a compact subset of R by [L2]. By [L3] every real t satisfies ∣t∣<ι(n) for some n, so R=⋃n∈NIn, an at most countable union of compact subsets: claim 1.

L1L2L3L6
1.2

Each singleton {r} with r∈Q is a compact subset of Q, the subspace it carries being a one-point space; and Q is the union of the family of its singletons, which is at most countable by [L4]. So Q is σ-compact: claim 2.

L4L6
1.3

For claim 4 in R: given p∈R the set {t:∣t−p∣≤1} is closed and bounded, hence compact by [L2], and it contains the open (p−1,p+1)∋p, so it is a compact neighbourhood of p and R is locally compact.

L1L2L6
2.1

For claim 3 assume countable choice and let U be an open cover of R. For n∈N the set Tn of finite subfamilies of U covering In is nonempty, In being compact by step 1.1 and the ambient reading being licensed by [L9], so [L5] supplies Vn∈Tn for every n; the union ⋃n∈NVn is an at most countable subfamily of U by [L10], being a countable union of finite sets, and covers R by step 1.1. The same argument with the singletons of step 1.2 in place of the In shows Q is Lindelöf: claim 3.

L4L5L6L9L10step 1.1step 1.2
2.2

For claim 4 in Q, let r∈Q and suppose K⊆Q were a compact neighbourhood of r in Q; then some set open in Q lies between r and K, so by [L1] there is a real ε>0 with (r−ε,r+ε)∩Q⊆K, and by [L8] the set K is a compact subset of R as well, hence closed in R by [L2].

L1L2L6L8step 1.2
3.1

By [L7] there is an irrational t with r<t<r+ε. Every neighbourhood of t contains an interval (c,d) with r<c<t<d<r+ε, and [L7] puts a rational q with c<q<d in it; that q lies in (r−ε,r+ε)∩Q⊆K. So every neighbourhood of t meets K, and K closed gives t∈K⊆Q by [L8], contradicting the irrationality of t. Hence no point of Q has a compact neighbourhood in Q, which completes claim 4.

L7L8step 2.2∎

Remarks

σ-compactness is much weaker than compactness. Both R and Q are σ-compact and neither is compact; and Q is σ-compact for the cheapest possible reason, being at most countable, which shows that the property says nothing about how the pieces fit together.

Local compactness is what separates the two spaces. The line and the rationals agree on σ-compactness and on Lindelöfness and differ on local compactness, which is why Q is the standard witness that local compactness is not hereditary (FALSE: every subspace of a locally compact space is locally compact).

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passOpen item page →

R with the half-open intervals [a,b) as a basis is not compact and, assuming the Axiom of Countable Choice, is Lindel"of, while its square is not Lindel"of, the antidiagonal being an uncountable closed discrete subspace

Example

Let Bℓ:={ [a,b):a,b∈R, a<b } (Intervals of R: the nine order-convex forms, nondegeneracy, and length) and let Rℓ be R carrying the topology for which Bℓ is a basis (Basis and subbasis for a topology, and the topology generated by a family of sets, 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). Then:

  1. Bℓ is a basis for a topology on R.
  2. Rℓ is not compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).
  3. Rℓ is Lindelöf (Countably compact, Lindel"of, sequentially compact, limit point compact and σ-compact spaces, and relatively compact subsets), assuming the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).
  4. Rℓ×Rℓ with the product topology (The product set ∏i∈IXi 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 not Lindelöf: the antidiagonal Δ:={ (x,−x):x∈R } is an uncountable subset that is closed and carries the discrete topology as a subspace.

So Lindelöfness is not preserved by products, even by the product of a space with itself.

This is the same space that appears elsewhere in the library under the name Sorgenfrey line, re-minted here because the published treatment lives on a page whose items may not be cited from anywhere; nothing below depends on that treatment.

Facts & Assumptions

Given: R with its order, the family Bℓ of half-open intervals [a,b)={t:a≤t<b} with a<b, the space Rℓ, and the product Rℓ×Rℓ.

[L1]

A family B of subsets of a set X is a basis for a unique topology exactly when it covers X and every point of an intersection of two members lies in a member inside that intersection; the topology consists of the sets U such that every x∈U has B∈B with x∈B⊆U (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, Basis and subbasis for a topology, and the topology generated by a family of sets, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L3]

The order of Order on the reals makes R a totally ordered field (The reals form a totally ordered field) with the least-upper-bound property (The Cauchy-sequence reals have the least-upper-bound property), hence a complete ordered field (Complete ordered field (least-upper-bound property)); for every real t there is therefore n∈N with t<ι(n) (Every complete ordered field is Archimedean, The canonical natural ι(n)=n⋅1F of a field); and for reals c<d there is a rational strictly between them (ℚ is dense in every Archimedean ordered field).

[L4]

A set is at most countable when it is finite or countably infinite (Finite, countably infinite, countable, uncountable); Q is countably infinite (Q is countably infinite) and R is uncountable (R is uncountable (Cantor's nested intervals, 1874)); every subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable); if A and B are at most countable then so is A×B (A product of two at most countable sets is at most countable); and a nonempty set is at most countable iff it is a surjective image of N, an injection back into N being obtained from any such surjection (A nonempty set is at most countable iff it is a surjective image of N). The union of two at most countable sets is then at most countable, by interleaving two such surjections.

[L6]

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

[L7]

The open sets of a subspace are the traces of the ambient open sets, and its closed sets the traces of the ambient closed sets (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).

Verification

technique · direct
1.1

Claim 1: Bℓ covers R, since x∈[x,x+1); and [a,b)∩[c,d) is [max⁡{a,c},min⁡{b,d}) when that is nonempty and ∅ otherwise, so it is a member of Bℓ or empty. By [L1] the family is a basis for exactly one topology, and a set is open in Rℓ exactly when each of its points has a half-open interval around it inside it.

L1L3
2.1

Claim 2: the family { [−ι(n),ι(n)):n∈N, n≥1 } consists of members of Bℓ, hence of open sets, and covers R by [L3]; the members increase with n, so a finite subfamily has union [−ι(N),ι(N)) for the largest index N occurring, which omits ι(N). So Rℓ is not compact.

L3L5step 1.1
2.2

For claim 3 let A be an open cover of Rℓ and let D be the family of members of Bℓ contained in some member of A; by step 1.1 the family D covers R. Put C:=⋃{ (a,b):[a,b)∈D }.

L5step 1.1construct
2.3

In Rℓ×Rℓ the antidiagonal Δ is discrete as a subspace: for x∈R the basic set [x,x+1)×[−x,−x+1) meets Δ only in (x,−x), since a point (y,−y) in it satisfies x≤y and −x≤−y, that is y≤x. By [L7] each singleton of Δ is therefore open in the subspace.

L2L3L7step 1.1
2.4

Δ is closed in Rℓ×Rℓ: let (u,v) have u+v≠0. If u+v>0, every point (y1,y2) of [u,u+1)×[v,v+1) has y1+y2≥u+v>0, so the box misses Δ. If u+v<0, put δ:=−(u+v)/2>0; every point of [u,u+δ)×[v,v+δ) has y1+y2 at least u+v and less than u+v+2δ=0, so again the box misses Δ. So the complement of Δ is open.

L2L3step 1.1
3.1

R∖C is at most countable. Fix a surjection N→Q ([L4]) and for x∉C let r(x) be the rational of least index with x<r(x) and [x,r(x))∈D; such rationals exist, since D covers gives [a,b)∈D with a≤x<b, a rational q with x<q<b by [L3] then has [x,q)⊆[a,b) and so [x,q)∈D. Nothing is selected, the least index being determined by x. The map r is injective on R∖C: if x<y lay outside C with r(x)=r(y)=q, then [x,q)∈D gives (x,q)⊆C and x<y<q puts y in C. So R∖C injects into Q, hence is equinumerous with a subset of Q and at most countable by [L4].

L3L4step 2.2
3.2

C is covered by the at most countable family DQ:={ [p,q)∈D:p,q∈Q }, at most countable because [p,q)↦(p,q) injects it into Q×Q, which is at most countable by [L4], as is therefore the image subset: given x∈C there is [a,b)∈D with a<x<b, and [L3] gives rationals p,q with a<p<x<q<b, whence [p,q)⊆[a,b) lies in D and contains x.

L3L4step 2.2
4.1

So D0:=DQ∪{ [x,r(x)):x∈R∖C } is an at most countable subfamily of D by [L4] and covers R by steps 3.1 and 3.2. Every member of D lies inside some member of A, so [L6] applied to an indexing of D0 by N supplies one member of A for each member of D0, and those form an at most countable subcover of A. Hence Rℓ is Lindelöf: claim 3.

L4L5L6step 3.1step 3.2
5.1

Δ is uncountable, being in bijection with R under x↦(x,−x) and R being uncountable by [L4]. Were Rℓ×Rℓ Lindelöf, its closed subspace Δ would be too: given a cover of Δ by traces of ambient open sets, adjoining the complement of Δ gives an ambient open cover, an at most countable subcover of it traces back to an at most countable subcover of Δ. But Δ is discrete by step 2.3, so its singletons form an open cover admitting only itself as a subcover, and that family is uncountable. So Rℓ×Rℓ is not Lindelöf: claim 4.

L4L5L7step 2.3step 2.4∎

Remarks

What fails in the product. Lindelöfness of Rℓ rests on the rationals being dense and at most countable, so that a cover can be thinned to countably many rational-endpoint intervals plus countably many exceptional points. In the square each point (x,−x) of the antidiagonal has a basic box around it meeting the antidiagonal in that point alone, and there are uncountably many such points; no countability of the rationals helps, because those boxes are pairwise distinct and each of them isolates one antidiagonal point, so an at most countable subfamily of the cover they generate can reach only at most countably many of them.

Neither compactness nor Lindelöfness is what separates the topologies. Rℓ is finer than the usual topology of R, since every (a,b) is a union of half-open intervals, and both spaces are Lindelöf and not compact; the difference shows up only in the square.

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

N×{a,b} with the indiscrete topology on the second factor is limit point compact and not countably compact, so the hypothesis that singletons are closed is not decoration

Statement refuted

Refuted: that a limit point compact space is countably compact (Countably compact, Lindel"of, sequentially compact, limit point compact and σ-compact spaces, and relatively compact subsets). The true statement carries a hypothesis: limit point compactness gives countable compactness when every singleton of the space is closed, and 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 4). The witness below satisfies every other part of that theorem's hypotheses and fails the singleton one, and it is not countably compact.

Witness. Let N carry the discrete topology and let D={a,b} with a≠b carry the indiscrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), and give

X  :=  N×D

the product topology (The product set ∏i∈IXi 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). Then every nonempty subset of X has a limit point in X, so X is limit point compact; the family { {n}×D:n∈N } is an at most countable open cover with no finite subcover, so X is not countably compact; and no singleton of X is closed.

Facts & Assumptions

Given: N with the discrete topology, D={a,b} with the indiscrete topology, and X=N×D with the product topology.

[L2]

Every subset of N is open, and the open subsets of D are ∅ and D (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[L3]

p is a limit point of A when every neighbourhood N of p satisfies N∩(A∖{p})≠∅; an open set containing p is a neighbourhood of p, and every neighbourhood of p contains an open set containing p (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).

Counterexample

technique · direct
1.1

The nonempty open subsets of X are exactly the sets U×D with U⊆N nonempty: by [L1] and [L2] every basic open set is U×∅=∅ or U×D, and a union of sets of the second form is again of that form.

L1L2
2.1

Every nonempty A⊆X has a limit point in X. Take (n,c)∈A and let p:=(n,c′) be the point with the same first coordinate and c′≠c, which exists since D has two elements. Every neighbourhood of p contains an open set containing p, hence by step 1.1 a set U×D with n∈U, and that set contains (n,c), which lies in A and differs from p. So p is a limit point of A, and in particular every infinite subset of X has one: X is limit point compact.

L3L4step 1.1
2.2

The family { {n}×D:n∈N } consists of open sets by step 1.1, is at most countable, and covers X; a finite subfamily is {n0}×D,…,{nk}×D and its union misses (m,a) for any m different from all the nj, which exists because N is not finite. So X is not countably compact.

L4step 1.1
3.1

No singleton of X is closed: the complement of {(n,c)} contains (n,c′), and by step 1.1 every open set containing (n,c′) contains {n}×D and hence (n,c), so that complement is not open. This is the hypothesis of 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, and steps 2.1 and 2.2 show that dropping it makes the implication fail.

L4step 1.1step 2.1step 2.2∎

Remarks

What the witness does and does not separate. It separates limit point compactness from countable compactness, and it does so for a reason that is entirely about separation of points: each point has a partner that no open set can distinguish it from, so every point of the space is a limit point of every set containing its partner. Limit point compactness is then satisfied for free.

The space is a product of two very simple spaces, and each factor contributes one half of the behaviour: the discrete factor supplies the countable open cover with no finite subcover, and the indiscrete factor supplies the partners that make every nonempty set have a limit point.

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

Collapsing the set of naturals inside R to a point gives a quotient of R that is not locally compact at the collapsed point

Statement refuted

Refuted: that a continuous image of a locally compact space is locally compact (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space). Local compactness is not preserved by continuous maps, and it is not even preserved by quotient maps.

Witness. Write ι:N→R for the canonical natural (The canonical natural ι(n)=n⋅1F of a field) and put N:={ ι(n):n∈N }, the set of naturals inside R. Let

Y  :=  (R∖N)∪{N},q:R→Y,q(t):=t (t∉N),q(t):=N (t∈N),

and give Y the quotient topology of q (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection). Then q is a continuous surjection, R is locally compact, and Y is not locally compact: the point ∗:=N of Y has no compact neighbourhood.

Facts & Assumptions

Given: R with its usual topology, the set N={ι(n):n∈N}, the set Y, the surjection q, and the quotient topology on Y.

[L3]

The canonical-natural map ι is strictly increasing, hence injective, and satisfies ι(n+1)=ι(n)+1 (Canonical naturals are positive and strictly increasing, The canonical natural ι(n)=n⋅1F of a field, The natural numbers N (von Neumann)), so distinct naturals have distinct canonical naturals and the members of N are spaced at distance at least 1; and for every real t there is a natural n with t<ι(n) (Every complete ordered field is Archimedean, Complete ordered field (least-upper-bound property)).

Counterexample

technique · direct
1.1

q is a continuous surjection by [L1] and R is locally compact by [L2], so any failure of local compactness in Y refutes the claim. Suppose K⊆Y is a compact neighbourhood of ∗, and fix an open O of Y with ∗∈O⊆K; then G:=q−1[O] is open in R and contains N.

L1L2L5construct
2.1

For n∈N put ρn:=12sup⁡{ r∈R:0<r<12 and (ι(n)−r,ι(n)+r)⊆G }, a supremum of a nonempty set of reals bounded above by 12, so 0<ρn<12 and (ι(n)−ρn,ι(n)+ρn)⊆G; nothing is selected, the supremum being determined by n and G. Put xn:=ι(n)+ρn, so that ι(n)<xn<ι(n)+12 and xn∈G.

L2L3step 1.1construct
3.1

No xn lies in N, since ι(n)<xn<ι(n)+1=ι(n+1) and the members of N are the ι(m); and xn≠xm for n≠m, the two lying in disjoint intervals (ι(n),ι(n)+12) and (ι(m),ι(m)+12). So P:={ xn:n∈N } is an infinite subset of R∖N and q is injective on it.

L3step 2.1
4.1

P is closed in R: a real t lies in [ι(m),ι(m)+1) for exactly one natural m when t≥0 by [L3], and in (−∞,0) otherwise; the interval (t−14,t+14) meets at most one of the disjoint intervals (ι(n),ι(n)+12), hence contains at most one member of P, so no real is a limit point of P outside P and the complement of P is open by [L2].

L2L3step 3.1
4.2

The subspace q[P] is discrete: for each n the interval In:=(xn−ηn,xn+ηn) with ηn:=12min⁡{ρn,12} misses N, since ι(n)<xn−ηn and xn+ηn<ι(n)+1, so q−1[q[In]]=In is open by [L1] and q[In] is open in Y; and q[In]∩q[P]={q(xn)}, because In contains no xm with m≠n.

L1L3step 2.1step 3.1
5.1

q[P] is closed in Y: its preimage is P by [L1], since P misses N, and the preimage of the complement of q[P] is the complement of P, which is open by step 4.1, so q[P] is closed by [L1]. Moreover q[P]⊆q[G]=O⊆K, so q[P] is a closed subset of the compact K and hence a compact subset of Y by [L4].

L1L4step 1.1step 2.1step 4.1
6.1

So q[P] is an infinite discrete compact space, which [L4] forbids: its singletons form an open cover with no finite subcover. Hence ∗ has no compact neighbourhood in Y, the space Y is not locally compact, and the claim that a continuous image of a locally compact space is locally compact is refuted.

L4step 1.1step 5.1step 4.2∎

Remarks

Collapsing a compact set would not work, and that is the point. If E is a compact subset of a locally compact Hausdorff space, the quotient collapsing E to a point is again locally compact at the collapsed point: claim 4 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 gives an open V⊇E with V‾ compact, the saturation of V is V itself, so its image is open and lies inside the compact image of V‾. So a convergent sequence together with its limit is the wrong set to collapse; what is needed is an infinite closed discrete set, and N is the simplest one.

What the failure looks like. Every open set of Y containing ∗ pulls back to an open set containing all of N, hence containing an interval around each ι(n); the points xn chosen just to the right of each ι(n) then form a closed discrete infinite set inside it, and no compact set can contain such a thing. There is no way to make the neighbourhood small, because it must be large near infinitely many separated places at once.

Compactness behaves differently. A continuous image of a compact space is compact (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, claim 1); it is only the local condition that fails to survive, and it fails because "locally" is a statement about each point separately and a quotient can glue infinitely many points together.

Quotient maps are the natural place to look. A quotient map is a continuous surjection, so this also refutes the same claim for continuous surjections; and since q here is a closed map with one non-singleton fibre, closedness of the map, even with a single non-singleton fibre, is not enough to restore the conclusion.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (claude-sonnet-5 + deepseek-v4-pro)verified 2026-08-05 (claude-sonnet-5)Open item page →

Assuming the Axiom of Choice, compactness of [0,1] derived from the subbase lemma alone, using only the rays as a subbasis and the least upper bound property

Example

Let L:=[0,1]={ t∈R:0≤t≤1 } (Intervals of R: the nine order-convex forms, nondegeneracy, and length) be linearly ordered by the order of R (Order on the reals) and carry the order topology of that order (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), whose subbasis is the family

S  :=  { L<b:b∈L }∪{ L>a:a∈L },L<b={t∈L:t<b},L>a={t∈L:a<t}.

Then, assuming the Axiom of Choice, L is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right), and the proof below uses only 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, which is where that hypothesis is spent, and the least upper bound property of R (Complete ordered field (least-upper-bound property)): no bisection, no metric, and no sequence.

This is a genuinely different route to the same conclusion. Compactness of [0,1] also follows from Heine-Borel, and that is how it is obtained on the companion page; the point of the present derivation is that the subbase lemma reduces the problem to covers by rays, where the least upper bound property does all the work in one step.

Facts & Assumptions

Given: L=[0,1] with the order inherited from R, its order topology, and the subbasis S of open rays.

[L1]

Alexander's subbase lemma, assuming the Axiom of Choice in the form of Zorn's lemma: if S is a subbasis for the topology of a space Z and every family S0⊆S with ⋃S0=Z has a finite subfamily with union Z, then Z 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, Basis and subbasis for a topology, and the topology generated by a family of sets).

[L3]

Every nonempty subset of R bounded above has a least upper bound, and for such a set S and an upper bound u one has u=sup⁡S exactly when every real ε>0 admits s∈S with u−ε<s (Complete ordered field (least-upper-bound property), Epsilon characterisation of the supremum, Upper bound, least upper bound, and strict upper bound).

[L4]

The order of Order on the reals makes R a totally ordered field, so any two reals are comparable (The reals form a totally ordered field); and 0≤t≤1 for every t∈L (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · direct
1.1

Let S0⊆S satisfy ⋃S0=L, and put A:={ b∈L:L<b∈S0 } and B:={ a∈L:L>a∈S0 }, so that S0 consists of the rays L<b with b∈A and the rays L>a with a∈B.

L2construct
1.2

The point 0 lies in no L>a with a∈L, since a<0 is impossible in L by [L4]; so 0 lies in some L<b with b∈A, and in particular A is nonempty and 0<b for that b.

L4construct
2.1

Put C:={ t∈L:t<b for some b∈A }, which contains 0 by step 1.2 and is bounded above by 1; so [L3] gives s:=sup⁡C, and 0≤s≤1, that is s∈L.

L3L4step 1.1step 1.2
3.1

s lies in some member of S0, and that member cannot be a ray L<b with b∈A: if it were, then s<b, and the point t:=(s+b)/2 would satisfy s<t<b≤1 and t≥s≥0, so t∈L and t∈C by the definition of C, contradicting s=sup⁡C. So s∈L>a for some a∈B, with a<s.

L3L4step 1.1step 2.1
4.1

By [L3] there is t∈C with a<t≤s, and by the definition of C there is b∈A with t<b; in particular a<b. Then L=L<b∪L>a: a point u∈L has u<b, or else u≥b>a and u∈L>a.

L3L4step 2.1step 3.1
5.1

So the two members L<b and L>a of S0 cover L. As S0 was an arbitrary cover of L by members of S, [L1] and [L2] make L compact.

L1L2step 3.1step 4.1∎

Remarks

The order topology of L and the subspace topology L inherits from the usual topology of R are compared nowhere below; every statement here is about the order topology alone (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, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not, The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (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).

Where the least upper bound property enters. Exactly once, at step 2.1, to produce s; everything after that is bookkeeping about which of the two kinds of ray contains s. That is the whole content of the compactness of a closed interval, and the subbase lemma is what allows the argument to be run against rays only, which is why it comes out so short.

The cost is the Axiom of Choice, and it is inherited. 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 is proved from Zorn's lemma, so this derivation spends the Axiom of Choice, whereas the bisection proof of Heine-Borel spends nothing. The two routes therefore have different prices for the same conclusion, and the cheaper one is the metric one.

Sources