Alphabeta Math
PropositionStatement: 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 Axiom of Choice, topological sums of Čech-complete spaces are Čech-complete

Statement

Assume the Axiom of Choice. The topological sum of any family of Čech-complete spaces is Čech-complete; the empty sum is included.

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]

The underlying set. Let I be a set and let Xi be a set for each iI. The disjoint union is iIXi  :=  iI(Xi×{i}), whose elements are the pairs (x,i) with iI and xXi. For jI the j-th canonical injection is κj:XjiIXi,κj(x):=(x,j). The construction is what makes the word "disjoint" honest. Each κj is injective (def-injection-surjection-bijection), since (x,j)=(x,j) forces x=x; the images κj[Xj]=Xj×{j} are pairwise disjoint, since the second coordinate determines j; and their union is the whole set. So no assumption that the Xi are disjoint as sets is needed, and none is made: the tag i separates the copies even when Xi=Xi for ii. (The disjoint union (coproduct) iXi with the final topology of the canonical injections: a set is open exactly when each of its traces is).

[F3]

Let (X,T) be a topological space (def-topological-space) and let (X,T) be its one-point compactification, with added point (def-one-point-compactification). Then: 1. X is compact (def-compact-space). 2. X is an open subspace of X: XT, and the subspace topology that X inherits from X (def-subspace-topology-top) is T itself. 3. X is dense in X (def-dense-top) if and only if X is not compact. 4. X is Hausdorff (def-hausdorff-space) if and only if X is locally compact (def-locally-compact-space) and Hausdorff. In particular, a locally compact Hausdorff space is an open subspace of a compact Hausdorff space, which is the reason the construction is made. No choice principle is used: the only cover thinned below is thinned by the indexed form of lem-compactness-of-a-subspace-is-ambient, which returns its own indices. (X is compact and contains X as an open subspace; X is dense in X exactly when X is not compact; and X is Hausdorff exactly when X is locally compact and Hausdorff).

[F4]

The Axiom of Choice (AC) is the following statement. The statement is: every family of nonempty sets has a choice function; that is, for every set F all of whose members are nonempty there is a function g with domain F satisfying g(S)S for every SF. (The Axiom of Choice).

Proof

technique · direct
1.1

Choose compactification witnesses Ki for the summands and form their topological sum K:=iKi, which is Hausdorff and contains iXi densely. Two cases arise, because [F3] makes K dense in K exactly when K is not compact. If K is compact — in particular whenever the family is finite, as for a single one-point summand — then K is itself a Hausdorff compactification of the sum and no point is adjoined. Otherwise K is noncompact, and its one-point compactification K is a Hausdorff compactification of the sum.

givenF3F1F2F4
2.1

Express the original sum by one countable family of open layers, using the same layer number in every clopen summand.

step 1.1F3F1
3.1

Verify the empty sum separately.

step 2.1F3
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: 55 results over 15 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