Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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 X is separable metrizable and 1α<ω1, there are universal sets UαΣα0(C×X) and VαΠα0(C×X): their sections at parameters in C=2N exhaust the respective classes on X. For each such rank both Πα0(C)Σα0(C) and its dual difference are nonempty. The same holds on any metrizable space containing a subspace homeomorphic to C.

Proof

Given: A separable metric X. Sections mean (U)c={x:(c,x)U}.

1.1

If X is nonempty, fix a countable dense sequence. Balls at its centres of positive rational radii form a countable basis: for xO choose ϵ>0 with B(x,ϵ)O, a centre within ϵ/4 of x and a rational radius between that distance and ϵ/2. This ball contains x and is inside O by the triangle inequality. Enumerate this basis as Wn; if X= take all Wn=. Set U1=n{c:c(n)=1}×Wn. This is open by F4. For open O, the parameter c(n)=1 iff WnO has section exactly O by the basis property. Put V1=(C×X)U1; its sections exhaust the closed sets.

F4
1.2

For each countable α>1 choose a nondecreasing positive sequence βnα<α with supn(βnα+1)=α. At successor α=γ+1 take constant γ. At a limit enumerate its ordinals and take the maximum of 1 and the first n+1 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

Uα={(c,x):n (cn,x)Vβnα},Vα=(C×X)Uα,

where (cn)n 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 (c,x)(cn,x) is continuous by F3 and F4. F2 puts its preimage in the indicated lower Π rank, so the union is Σα0. Its complement has the required dual rank. [F2, F3, F4, F5, A1]

2.1

Suppose B=jBj with BjΠγj0(X) and 1γj<α. Recursively choose nj>nj1 least with βnjαγj. Such indices occur arbitrarily late: otherwise the nondecreasing sequence would be bounded below γj, contradicting its cofinal property. By F1 place Bj in rank βnjα, 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 c. Then (Uα)c=jBj=B. Complementation proves universality of Vα. This proves the recursive universality assertion, including the empty set, without matching the original jth rank to the jth cofinal rank.

F1F3A1step 1.2
3.1

Apply this to X=C and put D={c:(c,c)Uα}. The diagonal is continuous since the preimage of a basic product O×P is OP, so F2 gives DΠα0. If DΣα0, universality gives d with D=(Uα)d. At d this says dD iff (d,d)Uα iff dD, impossible. The complement of D lies in the opposite difference.

F2F4step 1.1step 2.1
4.1

Let YZ be homeomorphic to C and Z metrizable. By F2 the homeomorphism and its inverse preserve both classes, so step 3.1 supplies DYΠα0(Y)Σα0(Y). F2 lifts DY to a Πα0(Z) set DZ. Were DZ also Σα0(Z), its trace would contradict the choice of DY. Thus DZ lies in the required difference, and its complement proves the dual difference. QED.

F2step 3.1

Depends on

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