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)n∈N of dense open subsets of X; a nonempty open W⊆X; the principle DMC.

[F2]

Regularity in the shrinking form: if U is open and x∈U then there is open V with x∈V⊆V‾⊆U (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).

[F4]

DMC: if R is serial on a nonempty set P, there are nonempty finite Fn⊆P with every x∈Fn 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 ∣B∣≤∣A∣, and equality holds if and only if B=A); the empty sequence is not used as a menu.

Proof

technique · direct
1.1givenF4

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≠∅.

2.1step 1.1L1

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.

2.2step 1.1F1F2F3

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

2.3step 1.1L2

Put Gk′:=⋂j<kGj for k∈N, so that G0′=X, each Gk′ is dense and open by [L2], and Gk+1′⊆Gk′.

2.4step 1.1L1

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

3.1step 2.2step 2.3step 2.4F2L1L2

Define U≻V for U,V∈V to mean that there is k with V‾⊆U∩Gk′ and U⊈Gk′. If some U∈V satisfies U⊆Gk′ for every k, then U⊆W∩⋂kGk≠∅ and the conclusion already holds; assume therefore that every U∈V fails this, and note that the relation ≻ is then serial on V: given U∈V, fix x∈U with x∉Gk′ for some k, and fix y∈U∩Gk′, which is nonempty because Gk′ is dense and U is nonempty open; by step 2.2 and [F2] there is nonempty open V with V⊆V‾⊆U∩Gk′, and V⊆U⊆W so V∈V and U≻V.

4.1step 3.1

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

5.1step 4.1F4

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

6.1step 5.1L3

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

7.1step 3.1step 6.1step 2.3

Induction on n: every U∈Vn′ satisfies U‾⊆Gn′. For n=0 this is U‾⊆X=G0′. For the step, let V∈Vn+1′ and fix U∈Vn′ with U≻V; then V‾⊆U∩Gk′ for some k with U⊈Gk′. By the induction hypothesis U⊆U‾⊆Gn′, so k>n: otherwise Gk′⊇Gn′⊇U, contradicting U⊈Gk′. Hence V‾⊆Gk′⊆Gn+1′.

8.1step 6.1step 7.1L2

Put Wn:=⋃Vn′, a nonempty set with Wn⊆Gn′ by step 6.1, and Wn+1⊆Wn: every V∈Vn+1′ satisfies V⊆V‾⊆U for some U∈Vn′⊆Wn. Put Kn:=⋃{ V‾:V∈Vn′ }, a nonempty closed set by [L2], with Kn+1⊆Wn⊆Kn and Kn⊆Gn′.

9.1step 2.2step 8.1F3L2

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 X∖Kn would cover X, and a finite subcover X∖Kn1,…,X∖Knm would give Kmax⁡nj=∅ by [L2], contradicting nonemptiness.

10.1step 8.1step 9.1

Fix x∈⋂nKn; then x∈K1⊆W0⊆W by steps 7.1 and 8.1, so x∈W, and for every n we have x∈Kn+1⊆Wn⊆Gn′⊆Gn−1 for n≥1, so x∈⋂nGn; thus W∩⋂nGn≠∅.

11.1step 2.1step 10.1F4∎

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.

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

Dependency tree · 2 levels

Sources