Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31
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.

Assuming countable choice, every countably compact paracompact Hausdorff space is compact

Statement

Assume the Axiom of Countable Choice. Every countably compact paracompact Hausdorff space is compact.

Facts & Assumptions

Given: Countable choice and a countably compact paracompact Hausdorff space X.

[A1]

Countable choice supplies a choice function for every sequence of nonempty sets (The Axiom of Countable Choice (ACω)).

[F1]

Countable compactness tests at most countable open covers, while compactness tests all open covers (Countably compact, Lindel"of, sequentially compact, limit point compact and σ-compact spaces, and relatively compact subsets).

[L2]

Under countable choice, a countable union of at most countable sets is at most countable (Countable unions of at most countable sets, assuming ACω, Finite, countably infinite, countable, uncountable).

Proof

technique · direct
1.1

Let U be an arbitrary open cover, and take a locally finite open refining cover V by [F2].

F2choose
2.1

Suppose V were infinite. For every n the family of (n+1)-element subsets of V is nonempty; [A1] chooses one En. Then E=⋃nEn is at most countable by [L2] and infinite because it has finite subsets of arbitrarily large size. Hence, by the definition of at-most-countable, E is countably infinite; enumerate its distinct members as (Vn)n∈N.

A1L2step 1.1construct
3.1

By [A1] choose dn∈Vn for every n. The range D={dn:n∈N} is infinite: if it were finite, local finiteness would make only finitely many distinct Vn meet D, but every Vn contains dn∈D. Moreover the singleton family {{d}:d∈D} is locally finite, since a neighbourhood meeting only finitely many Vn can contain only finitely many points d∈D.

A1F2step 2.1construct
4.1

Hausdorffness makes points closed, so [L1] makes D closed. For each d∈D, local finiteness gives a neighbourhood meeting only finitely many points of D; pass to an open subneighbourhood and remove those finitely many other closed points. Using [A1] along an enumeration of D yields open sets Od with Od∩D={d}.

A1F3L1step 3.1construct
5.1

The open set X∖D, together with the at most countable family {Od:d∈D}, is an open cover with no finite subcover, contradicting countable compactness in [F1].

F1step 3.1step 4.1
6.1

Hence V is finite. By [L3], select for each member of this finite refining family one containing member of U; the selected members form a finite subcover of U.

step 1.1step 5.1L3
7.1

Since U was arbitrary, [F1] proves that X is compact.

F1step 6.1∎

Remarks

Countable choice is spent twice: first to extract a countably infinite subfamily from a putatively infinite locally finite cover, and then to choose one point from each member of that subfamily. The final selection is only finite choice, which is available in ZF.

Depends on

Used by

Dependency tree · two levels

38 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources