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.

Equivalent forms of the Baire property

Statement

For a topological space X, the following are equivalent: every countable intersection of dense open sets is dense; every countable union of closed sets with empty interior has empty interior; no nonempty open subset is meagre in X; and every residual subset meets every nonempty open set. The equivalence includes the empty space.

Facts & Assumptions

Given: The objects, hypotheses, and choice principles stated above.

[F1]

Let X be a topological space and let A⊆X. The set A is nowhere dense when int⁡(A‾)=∅ (def-interior-closure-boundary-top). It is meagre when there is a sequence (Nn)n∈N of nowhere dense subsets of X with A⊆⋃nNn. It is residual, or comeagre, when X∖A is meagre. The empty union shows that ∅ is meagre, including when X=∅. (Nowhere dense, meagre, residual, and comeagre subsets of a topological space).

[F2]

A topological space (X,T) (def-topological-space) 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, def-sequence-convergence-top, def-natural-numbers), the intersection ⋂n∈NUn is dense in X. (Baire space: a topological space in which every countable intersection of dense open subsets is dense).

[F3]

For all sets X, a and b, X∖(a∪b)=(X∖a)∩(X∖b),X∖(a∩b)=(X∖a)∪(X∖b). Let F be a set with F≠∅. Then { X∖a:a∈F } is a nonempty set and X∖⋃F=⋂{ X∖a:a∈F },X∖⋂F=⋃{ X∖a:a∈F }. (X∖(a∪b)=(X∖a)∩(X∖b) and X∖(a∩b)=(X∖a)∪(X∖b); and for a nonempty set F, X∖⋃F=⋂{ X∖a:a∈F } and X∖⋂F=⋃{ X∖a:a∈F }).

Proof

technique · direct
1.1givenF1F2F3

Apply complements and De Morgan's laws to pass between dense intersections of open sets and unions of closed nowhere dense sets.

2.1step 1.1F1F2F3

Then localise to a nonempty open set to prove equivalence with no nonempty open subset being meagre; keep the empty-space convention visible.

3.1step 2.1∎

The preceding construction and implications establish the assertion.

Depends on

Used by

Dependency tree · two levels

17 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