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.

Borel separation of disjoint analytic sets

Statement

In ZFC, if A,B are disjoint analytic subsets of a Polish space X, a Borel CX satisfies AC and CB=.

Facts & Assumptions

[F1]

Equivalent analytic normal forms and Borel maps parametrizes every nonempty analytic set continuously by N.

[F2]

The countable Borel hierarchy and its limit convention makes opens Borel and gives Borel closure under complements and countable unions.

Proof

Given: The disjoint analytic pair in the statement.

1.1

If A= take C=; if B= take C=X. Otherwise by F1, licensed by A1, fix continuous f,g:NX with images A,B. For finite words s,t write As=f[Ns] and Bt=g[Nt].

F1F2A1
1.2

Suppose every child pair Asn,Btm has a Borel separator. A1 selects separators Cnm from the nonempty subsets of P(X) satisfying this property. Then C=nmCnm is Borel by F2 and De Morgan's identity. Every point of As lies in a child Asn and hence in every Cnm for that n, so in C. Every point of Bt lies in some Btm and hence outside Cnm for each n, so outside C. Thus C separates the parent pair.

F2A1
2.1

If A,B 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 N2. This produces words sn,tn of length n whose image pairs remain inseparable. Let a=nsn and b=ntn. Disjointness gives f(a)g(b). Choose disjoint metric open neighbourhoods U,V of these points. Continuity gives a common n with f[Nsn]U and g[Ntn]V. Then Borel U separates this pair, a contradiction. Therefore a Borel separator exists. The two branches a,b have been constructed independently; no equality between them is assumed. QED.

F2step 1.1step 1.2

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