Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

The countable Borel hierarchy and its limit convention

Definition

Work in ZF. Let (X,τ) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and let ω1 have the meaning in The first uncountable ordinal ω1:=(ω). Define, for 1α<ω1,

Σ10(X)=τ,Πα0(X)={XA:AΣα0(X)},Δα0(X)=Σα0(X)Πα0(X).

For 1<α<ω1, set

Σα0(X)={nNAn:(An)nN(1β<αΠβ0(X))N}.

Thus the summands may have different lower positive ranks, at successors as well as at limits. There is no rank-zero class. A countable union here is an actual sequence, with repetitions allowed.

For existence apply Transfinite recursion to the well-order of positive ordinals below ω1, forming the pair (Σα0,Πα0) at each stage. The formulas use only power sets, the set of sequences, Union and complements in the fixed X, so each value is a set. On histories not consisting of the required pairs of subfamilies of P(X), assign the fixed pair (,); this makes the recursion rule total. Actual histories have the required type by its construction. This defines all classes uniquely without choice.

The Borel sigma-algebra B(X) is the intersection of all families of subsets of X containing τ and closed under complements and unions of sequences. This indexing family is nonempty, since it contains P(X). Intersections preserve each of the stated closure requirements, so it is the least such family. This definition asserts neither hierarchy exhaustion in ZF nor fixed-rank monotonicity in arbitrary spaces. Empty sets and X occur in every class: they are open and closed at rank one, and constant sequences of them supply all subsequent ranks.

Depends on

Used by

Dependency tree · two levels

13 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