Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 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.

Closed subspaces of Čech-complete spaces are Čech-complete

Statement

Every closed subspace of a Čech-complete space is Čech-complete.

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]

Let (X,T) be a topological space (def-topological-space), with subspaces as in def-subspace-topology-top and compactness as in def-compact-space. Then: 1. Closed in compact is compact. If (X,T) is compact and FX is closed in X, then F is a compact subset of X. 2. Finite unions. If nN and K0,,Kn are compact subsets of X, then K0Kn is a compact subset of X. The union of the empty list is , which is a compact subset of every space. Claim 1 needs X to be compact and claim 2 does not; no hypothesis of any kind is placed on X 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 lem-finite-choice, a theorem of ZF. (A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact).

[F3]

Let (X,T) be a Hausdorff topological space (def-hausdorff-space, def-topological-space), with compact subsets as in def-compact-space. Then: 1. A point and a disjoint compact set are separated. If KX is compact and xXK, there are U,VT with xU,KV,UV=. 2. Two disjoint compact sets are separated. If K,LX are compact and KL=, there are U,VT with LU,KV,UV=. 3. Compact implies closed. Every compact subset of X is closed in X. 4. In a compact Hausdorff space the two classes coincide. If in addition (X,T) is compact, then a subset of X 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 yK choose disjoint open Uy,Vy", 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 V that admit some open Ux 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 lem-finite-choice supplies as a theorem of ZF. (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).

Proof

technique · direct
1.1

The empty closed subspace is Gδ in its empty compactification.

givenF1F2F3
2.1

Otherwise, if the space is Gδ in a compactification and the subspace is closed in the space, take its closure in the compactification.

step 1.1F1F3F2
3.1

Inside that compact closure, the subspace is the intersection of the inherited Gδ with an additional closed set, hence is Gδ.

step 2.1F3F2F1
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: 37 results over 12 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