Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

DMC makes every compact Hausdorff space Baire

Facts & Assumptions

Given: A compact Hausdorff space X; a sequence (Gn)nN of dense open subsets of X; a nonempty open WX; the principle DMC.

[F2]

Regularity in the shrinking form: if U is open and xU then there is open V with xVVU (A space is regular if and only if every point has a neighbourhood base of closed neighbourhoods, if and only if xU open gives an open V with xVVU).

[F4]

DMC: if R is serial on a nonempty set P, there are nonempty finite FnP with every xFn having an R-successor in Fn+1 (Dependent multiple choice in finite-level tree form).

[L2]

Finite intersections of dense open sets are dense and open, by induction on the number of factors, and finite unions of closed sets are closed (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets, Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

[L3]

A subset of a finite set is finite (A subset of a finite set is finite, with BA, and equality holds if and only if B=A); the empty sequence is not used as a menu.

Proof

technique · direct
1.1

Assume DMC. Let X be compact Hausdorff, let (Gn) be dense open, and let W be nonempty open; if X= there is no such W and the Baire condition is vacuous, so assume henceforth X.

givenF4
2.1

If X= the conclusion of step 1.1 is vacuous: a space with empty underlying set has no nonempty open subset, so every sequence of dense open sets trivially has dense intersection.

step 1.1L1
2.2

Assume X; by [F1] and [F2] X is regular, and by [F3] it is countably compact.

step 1.1F1F2F3
2.3

Put Gk:=j<kGj for kN, so that G0=X, each Gk is dense and open by [L2], and Gk+1Gk.

step 1.1L2
2.4

Let V be the family of nonempty open subsets of W.

step 1.1L1
3.1

Define UV for U,VV to mean that there is k with VUGk and U⊈Gk. If some UV satisfies UGk for every k, then UWkGk and the conclusion already holds; assume therefore that every UV fails this, and note that the relation is then serial on V: given UV, fix xU with xGk for some k, and fix yUGk, which is nonempty because Gk is dense and U is nonempty open; by step 2.2 and [F2] there is nonempty open V with VVUGk, and VUW so VV and UV.

step 2.2step 2.3step 2.4F2L1L2
4.1

Assume from now on that the first alternative of step 3.1 fails, so that is serial on the nonempty V.

step 3.1
5.1

Apply DMC of [F4] to on V: there are nonempty finite sets VnV with every UVn having a -successor in Vn+1.

step 4.1F4
6.1

Prune the menus: put V0:=V0 and Vn+1:={VVn+1:UV for some UVn}. Then each Vn is a nonempty finite subset of Vn: nonemptiness is by induction, since each UVn has a -successor in Vn+1 which then lies in Vn+1, and finiteness is [L3].

step 5.1L3
7.1

Induction on n: every UVn satisfies UGn. For n=0 this is UX=G0. For the step, let VVn+1 and fix UVn with UV; then VUGk for some k with U⊈Gk. By the induction hypothesis UUGn, so k>n: otherwise GkGnU, contradicting U⊈Gk. Hence VGkGn+1.

step 3.1step 6.1step 2.3
8.1

Put Wn:=Vn, a nonempty set with WnGn by step 6.1, and Wn+1Wn: every VVn+1 satisfies VVU for some UVnWn. Put Kn:={V:VVn}, a nonempty closed set by [L2], with Kn+1WnKn and KnGn.

step 6.1step 7.1L2
9.1

The sequence Kn is a decreasing sequence of nonempty closed subsets of the countably compact space X of step 2.2, so nKn: otherwise the open sets XKn would cover X, and a finite subcover XKn1,,XKnm would give Kmaxnj= by [L2], contradicting nonemptiness.

step 2.2step 8.1F3L2
10.1

Fix xnKn; then xK1W0W by steps 7.1 and 8.1, so xW, and for every n we have xKn+1WnGnGn1 for n1, so xnGn; thus WnGn.

step 8.1step 9.1
11.1

Steps 2.1 and 10.1 cover the empty and nonempty cases of the ambient space, and the only choice principle used was DMC in step 5.1; hence every compact Hausdorff space is Baire.

step 2.1step 10.1F4

Remarks

  • Which hypothesis of the source is used. Fossy and Morillon state the result for countably compact regular spaces; compactness makes the space regular and countably compact in step 2.2, and countable compactness gives the common point of the decreasing closed sets in step 9.1. Hausdorffness is used only through the compact-Hausdorff regularity theorem.

  • Why the sets Gk are not closed. They are finite intersections of dense open sets, hence dense and open, and they are decreasing; the closed sets whose intersection is taken in step 9.1 are the finite unions of closures of the pruned menus, which is why the pruning of step 6.1 is needed.

Depends on

Used by

Dependency tree · two levels

59 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