Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-16
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.

Under the ultrafilter lemma, Frolík's internal open-cover characterisation of Čech-completeness

Statement

Assume the ultrafilter lemma and Dependent Choice, the hypotheses carried by the compactification-independence theorem this proof uses. A Tychonoff space X is Čech-complete if and only if there is a sequence (Un) of open covers of X such that every centred family of closed subsets of X which is subordinate to every Un has nonempty intersection.

Facts & Assumptions

Given: The objects, hypotheses, and choice principles stated above.

[F1]

A Tychonoff space X is Čech-complete when there is a Hausdorff compactification (K,i) of X (def-compactification-of-a-tychonoff-space) for which i[X] is a Gδ subset of K (def-g-delta-and-f-sigma-in-a-topological-space). The definition asks for one compactification; thm-cech-completeness-is-independent-of-compactification proves the equivalent every-compactification form. (Čech-complete spaces as Gδ subspaces of Hausdorff compactifications).

[F2]

Assume the ultrafilter lemma and Dependent Choice. A Tychonoff space is a Gδ subset of some Hausdorff compactification if and only if it is a Gδ subset of every Hausdorff compactification. (Under the ultrafilter lemma and Dependent Choice, a Tychonoff space is Gδ in some Hausdorff compactification exactly when it is Gδ in every one).

[F3]

Let (X,T) be a topological space (def-topological-space). For a family A of subsets of X write A  :=  {xX:xA for every AA}, so that =X, matching the convention for the empty finite intersection in def-finite-intersection-property. Then: 1. (X,T) is compact (def-compact-space) if and only if every family A of closed subsets of X with the finite intersection property (def-finite-intersection-property) satisfies A. 2. Equivalently: (X,T) is compact if and only if every family of closed subsets of X that is contained in some filter on X (def-filter) has nonempty intersection, a family of subsets of X lying in a filter exactly when it has the finite intersection property (lem-fip-generates-filter). No choice principle is used in either direction: complementation is a canonical bijection, so no member of a family ever has to be selected. (A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection).

[F4]

Let (X,T) be a topological space (def-topological-space). The following implications hold, and each is proved by an earlier item of this page. 1. Perfectly normal implies completely normal, assuming the Axiom of Countable Choice (def-countable-choice). 2. Completely normal implies normal, and perfectly normal implies normal. 3. Normal together with T1 implies T3, that is regular together with T1. 4. Completely regular implies regular, and Tychonoff implies T3. 5. Regular together with T1 implies Urysohn, which implies Hausdorff, which implies T1, which implies T0. 6. Metrizable implies every property named above: a metrizable space is perfectly normal, completely normal, normal, Tychonoff, completely regular, T3, regular, Urysohn, Hausdorff, T1 and T0, with no choice principle used. Reading the numbered axioms in order, clauses 1 to 5 give T6T5T4T3T212T2T1T0, the first arrow under ACω, together with T312T3. This is the whole of the classical chain that this page proves, and it is one arrow short of the classical chain. The implication T4T312 — a normal T1 space is completely regular — is Urysohn's lemma and is not available at this point in the reading order. Its absence is recorded, with what would license it, in this page's conventions remark; it is deliberately not asserted here, and no clause above may be read as giving it. (The implications proved on this page: perfectly normal gives completely normal under countable choice, and completely normal gives normal; normal with T1 gives T3; completely regular gives regular; regular with T1 gives Urysohn, hence Hausdorff, hence T1, hence T0; and metrizable gives every one of them).

[F5]

Let X be a set. A family BP(X) is a filter base on X when it satisfies: - (B1) nonemptiness: B; - (B2) properness: B; - (B3) downward directedness: for all B1,B2B there is B3B with B3B1B2. (Filter base and the filter it generates).

[F6]

Let X be a compact Hausdorff topological space. Then X is regular, and X is normal (A compact Hausdorff space is regular and normal, hence T3 and T4).

Proof

technique · direct
1.1

From a Gδ presentation in a compactification, use regularity of the compactification to choose open covers whose ambient closures lie in the successive layers. The compactification is compact Hausdorff, so [F6] supplies exactly that regularity; [F4] is the separation chain and does not state the compact-Hausdorff-to-regular implication.

givenF1F2F3F6
2.1

A centred family subordinate to every cover has centred ambient closures, hence a compactness cluster point; the layer condition puts that point back in the original space and closedness puts it in every family member.

step 1.1F3F4F1
3.1

Conversely, apply the centred-family condition to neighbourhood traces of each remainder point to construct countably many ambient open sets whose intersection excludes the whole remainder.

step 2.1F3F4F5
4.1

The preceding construction and implications establish the assertion.

step 3.1

Depends on

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: 99 results over 17 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