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 Borel hierarchy on the real line never stabilizes at a countable stage
Statement
For an uncountable Polish space and every countable ordinal , Marker, Corollary 2.38, proves and, in particular, . Applied to , this says that alternating countable unions and countable intersections does not stabilize at any countable stage.
The strictness proof uses universal Borel sets and diagonalisation. Those descriptive-set-theoretic constructions are not developed here, so this result is recorded with its source rather than presented as a local theorem.
Used by
Dependency tree · next 3 levels
Nothing. This result depends on no other item in the library.
Sources
- D. Marker, Descriptive Set Theory, Section 2, Corollary 2.38 (standard reference, not scraped)
- M. Christ, Math 202B Lecture 1, Comment on the Borel hierarchy (standard reference, not scraped)