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 countable Borel hierarchy and its limit convention
Definition
Work in ZF. Let be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and let have the meaning in The first uncountable ordinal . Define, for ,
For , set
Thus the summands may have different lower positive ranks, at successors as well as at limits. There is no rank-zero class. A countable union here is an actual sequence, with repetitions allowed.
For existence apply Transfinite recursion to the well-order of positive ordinals below , forming the pair at each stage. The formulas use only power sets, the set of sequences, Union and complements in the fixed , so each value is a set. On histories not consisting of the required pairs of subfamilies of , assign the fixed pair ; this makes the recursion rule total. Actual histories have the required type by its construction. This defines all classes uniquely without choice.
The Borel sigma-algebra is the intersection of all families of subsets of containing and closed under complements and unions of sequences. This indexing family is nonempty, since it contains . Intersections preserve each of the stated closure requirements, so it is the least such family. This definition asserts neither hierarchy exhaustion in ZF nor fixed-rank monotonicity in arbitrary spaces. Empty sets and occur in every class: they are open and closed at rank one, and constant sequences of them supply all subsequent ranks.
Depends on
Used by
- Well-founded Borel evaluation codes Definition
- Baire property sigma-algebra and Borel regularity Lemma
- Borel hierarchy exhaustion and preservation by continuous pullback Lemma
- Metric Borel hierarchy inclusions and fixed-rank operations Lemma
- Borel separation of disjoint analytic sets Theorem
- Equivalent analytic normal forms and Borel maps Theorem
Dependency tree · two levels
13 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
- Definition 2.4, printed p14; Martin 1985 p451 (same positive-rank convention) (standard reference, not scraped)