Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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 Dependent Choice, every Čech-complete space is Baire

Statement

Assume Dependent Choice. Every Čech-complete space is a Baire space.

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; under the ultrafilter lemma and Dependent Choice, thm-cech-completeness-is-independent-of-compactification proves the equivalent every-compactification form. (Čech-complete spaces as Gδ subspaces of Hausdorff compactifications).

[F2]

A Hausdorff compactification of a space X is a pair (K,i) in which K is compact (def-compact-space) and Hausdorff (def-hausdorff-space), and i:X→K is an embedding with dense image (def-homeomorphism-and-open-maps, def-dense-top). We identify X with i[X] only after naming i; the density condition is a condition on that named image. (A Hausdorff compactification as a dense embedding into a compact Hausdorff space).

[F3]

A function f:X→Y is an embedding if f is injective and the corestriction f0:X→f[X], f0(x)=f(x), is a homeomorphism onto f[X] carrying the subspace topology inherited from Y (def-subspace-topology-top). (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

[F4]

A subset A of a topological space X is a Gδ set of X when there is a sequence (Vn)n∈N of open subsets of X with A=⋂n∈NVn. As everywhere in this library N contains 0, so the indexing starts at 0. (Gδ and Fσ subsets of a topological space, agreeing with the real-line notion).

[F5]

For S⊆X the subspace topology on S is TS:={ U∩S:U∈T }, the family of traces on S of the open sets of X; a subset of S lying in TS is said to be open in S, and relatively open where the ambient space needs emphasis. Choosing a tracing set needs no choice principle, since U′:=⋃{ U∈T:U∩S⊆W } is a canonical member of T with U′∩S=W, for each W∈TS. (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

[F6]

A⊆X is dense in X if A‾=X, and this is equivalent to U∩A≠∅ for every nonempty open U⊆X. (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets).

[F7]

A topological space (X,T) is a Baire space when for every sequence (Un)n∈N of subsets of X that are open and dense in X (def-dense-top), the intersection ⋂n∈NUn is dense in X. (Baire space: a topological space in which every countable intersection of dense open subsets is dense).

[F8]

Let X be a compact (def-compact-space) Hausdorff (def-hausdorff-space) topological space. Then X is regular (def-regular-and-t3-spaces), X is normal, and X is T1, hence X is T3 and T4. (A compact Hausdorff space is regular and normal, hence T3 and T4).

[F9]

For a topological space (X,T) the following are equivalent: (a) X is regular (def-regular-and-t3-spaces); (b) for every x∈X and every open U with x∈U there is an open V with x∈V⊆V‾⊆U; (c) every point of X has a neighbourhood base consisting of closed neighbourhoods. (A space is regular if and only if every point has a neighbourhood base of closed neighbourhoods, if and only if x∈U open gives an open V with x∈V⊆V‾⊆U).

[F10]

A‾ is closed, contains A, and is contained in every closed F⊆X with A⊆F; so it is the smallest closed superset of A, and A is closed if and only if A=A‾. (A point lies in the closure of A iff every basic neighbourhood of it meets A; the closure is the smallest closed superset and equals A together with its derived set, claim 2).

[F11]

Call a binary relation R⊆X×X entire on X when for every x∈X there is y∈X with xRy. The Axiom of Dependent Choice is the statement: for every nonempty set X, every relation R entire on X, and every a∈X, there is a sequence x:N→X with x0=a and xnRxn+1 for every n∈N. (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F12]

A topological space (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≠∅, where ⋂∅=X. No choice principle is used in either direction. (A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection, claim 1).

Proof

technique · direct
1.1givenF1F2F4

Let X be Čech-complete; by [F1] fix a Hausdorff compactification (K,i) of X such that i[X] is a Gδ subset of K, write Y:=i[X] and let TK be the topology of K, so K is compact Hausdorff and i:X→K is an embedding by [F2], and by [F4] there is a sequence (Gn)n∈N of members of TK with Y=⋂n∈NGn, whence Y⊆Gn for every n∈N.

1.2givenF6F7

By [F7] the assertion to be proved is that for every sequence (Un)n∈N of open dense subsets of X the set ⋂n∈NUn is dense in X, and by [F6] that says exactly that ⋂n∈NUn meets every nonempty open V⊆X; fix such a sequence (Un)n∈N and such a set V, there being nothing to prove when X has no nonempty open subset, in particular when X=∅.

2.1step 1.1step 1.2F3F5F6

By [F3] the corestriction i0:X→Y is a homeomorphism onto Y with the subspace topology inherited from K, so i[V] and every i[Un] are open in Y and i[V]≠∅; each i[Un] is moreover dense in Y, since for nonempty S open in Y the set i0−1[S] is nonempty and open in X, hence meets Un by [F6], and the image under i of a point of i0−1[S]∩Un lies in S∩i[Un]; putting W:=⋃{ O∈TK:O∩Y⊆i[V] } and Wn:=⋃{ O∈TK:O∩Y⊆i[Un] } for n∈N, the canonical tracing construction of [F5] makes these members of TK with W∩Y=i[V] and Wn∩Y=i[Un], and since Wn is defined by a formula in n rather than selected, the sequence (Wn)n∈N is obtained with no appeal to countable choice.

2.2step 1.1F8F9

The space K is compact Hausdorff by step 1.1, hence regular by [F8], so clause (b) of [F9] holds in K: for every y∈K and every P∈TK with y∈P there is O∈TK with y∈O⊆O‾⊆P, all closures being taken in K.

3.1step 1.1step 2.1step 2.2F6

Since i[V] is nonempty and open in Y and i[U0] is dense in Y, there is a point y0∈i[V]∩i[U0]=Y∩W∩W0, and y0∈G0 because Y⊆G0; thus y0 lies in the member W∩W0∩G0 of TK, and the closure form of regularity yields O0∈TK with y0∈O0⊆O0‾⊆W∩W0∩G0, so that O0∩Y≠∅.

3.2step 1.1step 2.1step 2.2F6

Let S:={ (n,O):n∈N, O∈TK, O∩Y≠∅ } and let R hold of ((n,O),(m,O′)) exactly when m=n+1 and O′‾⊆O∩Wm∩Gm; then R is entire on S, for given (n,O)∈S the set O∩Y is nonempty and open in Y, so the dense set i[Un+1]=Y∩Wn+1 meets it in a point y, which lies in Gn+1 because Y⊆Gn+1 and hence lies in the member O∩Wn+1∩Gn+1 of TK, and the closure form of regularity yields O′∈TK with y∈O′⊆O′‾⊆O∩Wn+1∩Gn+1, so that (n+1,O′)∈S and (n,O)R(n+1,O′).

4.1step 3.1step 3.2F11

The class S is a set, being a subset of N×TK, it is nonempty by step 3.1, and R is entire on it by step 3.2, so [F11] applied to S, R and the starting point (0,O0) gives a sequence s:N→S with s0=(0,O0) and snRsn+1 for every n∈N; since R raises the first coordinate by exactly one, induction on n gives sn=(n,On) for members On of TK with On∩Y≠∅, and the definition of R gives On+1‾⊆On∩Wn+1∩Gn+1 for every n∈N, while O0‾⊆W∩W0∩G0 by step 3.1.

5.1step 4.1F10F12

Each On‾ is closed in K and contains the nonempty set On by [F10], hence is nonempty, and On+1‾⊆On⊆On‾ by step 4.1 and [F10], so the family { On‾:n∈N } is decreasing; a nonempty finite subfamily therefore has intersection ON‾≠∅, where N is the largest index occurring in it, and the empty subfamily has intersection K⊇O0‾≠∅, so the family consists of closed sets and has the finite intersection property, and compactness of K with claim 1 of [F12] produces a point y∈⋂n∈NOn‾.

6.1step 1.1step 2.2step 4.1step 5.1F3

For every n≥1 step 4.1 gives y∈On‾⊆Wn∩Gn, and y∈O0‾⊆W∩W0∩G0, so y∈⋂n∈NGn=Y by step 1.1, and therefore y∈Y∩Wn=i[Un] for every n∈N and y∈Y∩W=i[V] by step 2.2; as i is injective by [F3], the point x:=i0−1(y) of X lies in V and in Un for every n∈N.

7.1step 1.2step 6.1∎

Thus ⋂n∈NUn meets the arbitrary nonempty open set V, so it is dense in X by step 1.2, and X is a Baire space.

Remarks

  • The construction has to be run in K, on ambient open sets that MEET Y. It is tempting to build the nested sets inside X itself, or to ask for a nonempty member of TK contained in some i[Un]; the second is impossible in general, because a Čech-complete space may sit in its compactification with empty interior. Take K=[0,1] and Y its set of irrational points, which is a Gδ in K since K∖Y is countable, and take every Un equal to X. A nonempty open subset of [0,1] contains an interval of positive length and hence a rational point, so no nonempty member of TK is contained in Y, and Y has empty interior in K. What steps 3.1 and 3.2 use instead is that O∩Y≠∅, which is preserved because i[Un+1] is dense in Y and the shrinking is done with the closure form of regularity.

  • Where the choice principles enter, and where they do not. Dependent Choice is used once, at step 4.1, and it is genuinely needed: the admissible (n+1)-st open set depends on the n-th, so the family being selected from is not fixed in advance. Nothing else in the proof selects. The sets W and Wn are the canonical tracing sets of [F5], so passing from the relatively open i[Un] to an ambient Wn for all n at once is a definition rather than a countable choice; the Gn arrive as a sequence from [F4]; and the two individual points y0 and y are single existential instantiations.

  • Compact closures are not what the argument needs. Every On‾ is a closed subset of the compact space K, so the intersection at step 5.1 could equally be obtained from the finite intersection property applied inside O0‾. What is load bearing is only that the On‾ are closed in a compact space and decrease, together with On‾⊆Gn, which is what forces the limit point into Y rather than into the remainder K∖Y.

Depends on

Used by

Dependency tree · two levels

48 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