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 complete-metric Baire principle over ZF
Definition
Work in ZF. Let be a metric space. Closure, interior and density are as in Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, with all complements relative to . Families indexed by are functions, as in An indexed family is a function with domain ; is its range, and their unions and intersections are those of , and for .
A set is nowhere dense if . A set is meagre if there exists a sequence of nowhere dense subsets of such that . A set is comeagre if is meagre.
The space is Baire if, for every sequence of open dense subsets of , the intersection is dense in . The complete-metric Baire principle (CM-Baire) asserts that every complete metric space, in the sense of Complete metric space: every Cauchy sequence converges in the space, is Baire.
This includes the empty space: its only subset is open and dense, its -indexed intersection is empty and dense in that space, and there are no Cauchy sequences into it. The empty set is meagre in every space, witnessed by for every .
Remarks
A witness is an actual sequence of nowhere dense sets. These definitions do not assert that a countable union of sets merely known to be meagre is meagre: choosing one decomposition for each such set would require a separate argument. Miller, Definitions 4.2–4.4, p.8, motivates the convention; Karagila's warning after Theorem 16, p.10, identifies the decomposition-selection issue. We use containment in a union, so meagre subsets need not themselves be closed-set unions.
Depends on
- Complete metric space: every Cauchy sequence converges in the space
- Interior, closure, boundary, limit point, isolated point and dense subset of a metric space
- An indexed family $(A_i)_{i \in I}$ is a function with domain $I$; $\{A_i : i \in I\}$ is its range
- $\bigcup_{i \in I} A_i := \bigcup \{A_i : i \in I\}$, and $\bigcap_{i \in I} A_i := \bigcap \{A_i : i \in I\}$ for $I \neq \varnothing$
Used by
Dependency tree · two levels
19 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
- Miller, Lecture notes on set theory without choice; Definitions 4.2–4.4, p.8; Proposition 5.4, p.10 (standard reference, not scraped)
- Karagila, Zornian Functional Analysis, Definition 4 and Chapter 2, pp. 4–5, 8–11 (standard reference, not scraped)