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.
Universal Borel sets and strictness on Cantor space
Statement
In ZFC, if is separable metrizable and , there are universal sets and : their sections at parameters in exhaust the respective classes on . For each such rank both and its dual difference are nonempty. The same holds on any metrizable space containing a subspace homeomorphic to .
Facts & Assumptions
Metric Borel hierarchy inclusions and fixed-rank operations gives lower-rank inclusions and closure operations.
Borel hierarchy exhaustion and preservation by continuous pullback gives same-rank pullbacks and trace lifting.
Cantor and Baire sequence spaces and coordinate codings supplies the homeomorphism .
Basic product opens and coordinate maps are as in The product set of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space.
Set-valued recursion along a well-order is Transfinite recursion.
Assume The Axiom of Choice.
Proof
Given: A separable metric . Sections mean .
If is nonempty, fix a countable dense sequence. Balls at its centres of positive rational radii form a countable basis: for choose with , a centre within of and a rational radius between that distance and . This ball contains and is inside by the triangle inequality. Enumerate this basis as ; if take all . Set . This is open by F4. For open , the parameter iff has section exactly by the basis property. Put ; its sections exhaust the closed sets.
For each countable choose a nondecreasing positive sequence with . At successor take constant . At a limit enumerate its ordinals and take the maximum of and the first listed ordinals; finite maxima stay below the limit and are cofinal. These choices form a set-indexed family, so A1 applies. Recursively, using F5, set
where is F3's decoding. On malformed histories assign the empty set pair, making the rule total; all actual values are pairs of subsets of the fixed product. Each map is continuous by F3 and F4. F2 puts its preimage in the indicated lower rank, so the union is . Its complement has the required dual rank. [F2, F3, F4, F5, A1]
Suppose with and . Recursively choose least with . Such indices occur arbitrarily late: otherwise the nondecreasing sequence would be bounded below , contradicting its cofinal property. By F1 place in rank , and place the empty set at every unused index. Inductive universality and A1 select a parameter for each of these sets; F3 codes this parameter sequence as . Then . Complementation proves universality of . This proves the recursive universality assertion, including the empty set, without matching the original jth rank to the jth cofinal rank.
Apply this to and put . The diagonal is continuous since the preimage of a basic product is , so F2 gives . If , universality gives with . At this says iff iff , impossible. The complement of lies in the opposite difference.
Let be homeomorphic to and metrizable. By F2 the homeomorphism and its inverse preserve both classes, so step 3.1 supplies . F2 lifts to a set . Were also , its trace would contradict the choice of . Thus lies in the required difference, and its complement proves the dual difference. QED.
Depends on
- Metric Borel hierarchy inclusions and fixed-rank operations
- Borel hierarchy exhaustion and preservation by continuous pullback
- Cantor and Baire sequence spaces and coordinate codings
- The product set $\prod_{i \in I} X_i$ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space
- Transfinite recursion
- The Axiom of Choice
Used by
Dependency tree · two levels
24 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.36, Lemma 2.37 and Corollary 2.38, printed pp23–24; correct source typos and supply the cofinal-index placement step (standard reference, not scraped)