Alphabeta Math
TheoremStatement: 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.

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 AX. The set A is nowhere dense when int(A)= (def-interior-closure-boundary-top). It is meagre when there is a sequence (Nn)nN of nowhere dense subsets of X with AnNn. It is residual, or comeagre, when XA 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)nN of subsets of X that are open and dense in X (def-dense-top, def-sequence-convergence-top, def-natural-numbers), the intersection nNUn 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(ab)=(Xa)(Xb),X(ab)=(Xa)(Xb). Let F be a set with F. Then {Xa:aF} is a nonempty set and XF={Xa:aF},XF={Xa:aF}. (X(ab)=(Xa)(Xb) and X(ab)=(Xa)(Xb); and for a nonempty set F, XF={Xa:aF} and XF={Xa:aF}).

Proof

technique · direct
1.1

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

givenF1F2F3
2.1

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

step 1.1F1F2F3
3.1

The preceding construction and implications establish the assertion.

step 2.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 41 results over 13 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