Alphabeta Math
CorollaryStatement: 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.

Strict Borel hierarchy in every uncountable Polish space

Statement

In ZFC, for every uncountable Polish X and 1≤α<β<ω1, Σα0(X) is a proper subset of Σβ0(X), and Πα0(X) is a proper subset of Πβ0(X).

Facts & Assumptions

[F1]

Universal Borel sets and strictness on Cantor space supplies both pointclass differences in every metrizable space containing a Cantor copy.

[F2]

Uncountable analytic sets contain compact Cantor copies supplies a Cantor copy in every uncountable Polish space.

Proof

Given: The space and positive countable ranks of the statement.

1.1F1F2A1

Apply F2 with A1 to X itself, obtaining a Cantor subspace. X is metrizable since it is Polish. Thus F1 with A1 gives D∈Πα0(X)∖Σα0(X).

2.1step 1.1

For α>1, each union of sets of lower Π rank allowed at rank α is also allowed at rank β. For α=1, fix a compatible metric d: every open U is ⋃n{x:(∀y∉U) d(x,y)≥1/(n+1)}, a union of closed sets. Closedness follows from the triangle inequality, and equality from the ball criterion for openness; if U=X the condition is vacuous, and if U is empty take y=x to exclude every x. Thus Σα0⊆Σβ0 also at rank one. The constant sequence D puts D in Σβ0, proving this inclusion proper by step 1.1. Complementation gives Πα0⊆Πβ0 and its properness, since X∖D belongs to the latter but not the former. QED.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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