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.
The meagre subsets of a topological space form a sigma-ideal
Statement
For every topological space , the meagre subsets of contain and are closed under taking subsets; assuming the Axiom of Countable Choice, they are also closed under countable unions. Countable Choice is what selects one witnessing sequence of nowhere dense sets for each member of the countable family, before the flattening bijection is applied.
Facts & Assumptions
Given: The objects, hypotheses, and choice principles stated above.
Let be a topological space and let . The set is nowhere dense when (def-interior-closure-boundary-top). It is meagre when there is a sequence of nowhere dense subsets of with . It is residual, or comeagre, when is meagre. The empty union shows that is meagre, including when . (Nowhere dense, meagre, residual, and comeagre subsets of a topological space).
(def-equinumerous): the plane of pairs of naturals is countably infinite (def-countable). The bijection is exhibited, not merely asserted to exist. Define by recursion on (thm-recursion) by and , and set Then is a bijection from onto , and is a bijection from onto , so is a bijection . What makes bijective is the decomposition of a nonzero natural into a power of two times an odd number, existence and uniqueness both. ().
The Axiom of Countable Choice () selects one member from each nonempty set in a sequence of sets. It is used below for the sets of nowhere dense covering sequences.
Proof
The empty set is meagre, witnessed by the constant sequence of empty nowhere dense sets. If and witnesses that is meagre, the same sequence witnesses that is meagre.
Let be meagre. For each , let be the nonempty set of sequences of nowhere dense subsets of satisfying . Apply [A1] once to to choose all these sequences simultaneously. This is the only use of Countable Choice.
Let be the bijection in [F2], and put . Every is nowhere dense, and . Thus the countable union is meagre; the empty indexed family has union as in step 1.1.
Steps 1.1 and 2.1 prove the stated sigma-ideal properties under the stated choice hypothesis.
Depends on
Used by
Dependency tree · two levels
35 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
- David Marker, Descriptive Set Theory, §§1–2 (standard reference, not scraped)
- Michael Kunzinger, General Topology, §§11.3–11.4 (standard reference, not scraped)
- MFF General Topology course summary, §4.3 (standard reference, not scraped)
- Jesse Peterson, Real Analysis, §§3.6–3.7 (standard reference, not scraped)