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. ().
Proof
Subsets of nowhere dense sets are nowhere dense, and a subset of a countable union of nowhere dense sets is covered by the same family.
Flatten a countable family of countable covers using the published countability of the natural-number square; include the empty union and empty subset explicitly.
The preceding construction and implications establish the assertion.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 46 results over 16 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
- 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)