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.
Borel separation of disjoint analytic sets
Statement
In ZFC, if are disjoint analytic subsets of a Polish space , a Borel satisfies and .
Facts & Assumptions
Equivalent analytic normal forms and Borel maps parametrizes every nonempty analytic set continuously by .
The countable Borel hierarchy and its limit convention makes opens Borel and gives Borel closure under complements and countable unions.
Assume The Axiom of Choice.
Proof
Given: The disjoint analytic pair in the statement.
If take ; if take . Otherwise by F1, licensed by A1, fix continuous with images . For finite words write and .
Suppose every child pair has a Borel separator. A1 selects separators from the nonempty subsets of satisfying this property. Then is Borel by F2 and De Morgan's identity. Every point of lies in a child and hence in every for that n, so in . Every point of lies in some and hence outside for each n, so outside . Thus separates the parent pair.
If were inseparable, step 1.2 implies that each inseparable pair has an inseparable child pair. Recursively take the least such pair of child indices in a fixed enumeration of . This produces words of length n whose image pairs remain inseparable. Let and . Disjointness gives . Choose disjoint metric open neighbourhoods of these points. Continuity gives a common n with and . Then Borel separates this pair, a contradiction. Therefore a Borel separator exists. The two branches have been constructed independently; no equality between them is assumed. QED.
Depends on
Used by
Dependency tree · two levels
10 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
- Theorem 4.13, printed p37, complete proof (standard reference, not scraped)