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.
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 -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 ()), which is what makes each witness countably compact. Two witnesses are available and both are refutations on their own: the first uncountable ordinal with its order topology (The first uncountable ordinal , On an ordinal with its order topology the sets and 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 under the lexicographic order, and the long line, with the order topology).
Facts & Assumptions
Given: The first uncountable ordinal with its order topology, the closed long ray with its order topology, and the Axiom of Countable Choice.
The false claim: every countably compact topological space is compact.
The Axiom of Countable Choice (The Axiom of Countable Choice ()).
Assuming countable choice, with its order topology is countably compact and is not compact (Every successor ordinal is compact in its order topology and every limit ordinal is not; and, assuming countable choice, is countably compact and sequentially compact while is compact, claim 3).
Assuming countable choice, the closed long ray is countably compact, and it is not compact and not Lindelöf (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, claims 2, 3 and 4; The closed long ray under the lexicographic order, and the long line, with the order topology).
Refutation
Suppose the claim [A1] holds, so that every countably compact space is compact.
Assuming [A2], the space with its order topology is countably compact by [L1], and the closed long ray is countably compact by [L2].
By [A1] and step 1.2 both and would be compact.
Neither is: is not compact by [L1], and is not compact by [L2].
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.
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 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 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.
Depends on
- Every successor ordinal is compact in its order topology and every limit ordinal is not; and, assuming countable choice, $\omega_1$ is countably compact and sequentially compact while $\omega_1 + 1$ is compact
- 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
- 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
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- On an ordinal with its order topology the sets $[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
- The first uncountable ordinal $\omega_1 := \aleph(\omega)$
- The closed long ray $\omega_1 \times [0,1)$ under the lexicographic order, and the long line, with the order topology
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 122 results over 25 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Countably compact space (Wikipedia) (standard reference, not scraped)
- Long line (topology) (Wikipedia) (standard reference, not scraped)
- Order topology (Wikipedia) (standard reference, not scraped)