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.

Standard borel spaces admit bimeasurable real codings

Statement

Assume AC. Every standard-Borel space (E,S) is measurably isomorphic to a Borel subset of [0,1], including E=.

Facts & Assumptions

Given: AC and a standard-Borel space (E,S).

[F1]

There is a Polish presentation h:EP preserving Borel sets in both directions. (Standard Borel spaces)

[F2]

A separable metrizable space embeds homeomorphically in the Hilbert cube. (Every separable metrizable space embeds in the Hilbert cube [0,1]N)

[F3]

The weighted sum of complete coordinate metrics bounded by one metrizes the cube. (The standard weighted metric on a countable product of bounded complete metric spaces is complete)

[F4]

Under DC, a completely metrizable subspace of a metric space is Gδ. (Under Dependent Choice, every completely metrizable subspace of a metric space is Gδ)

[F5]

The cube has a bimeasurable coding c onto a Borel C[0,1]. (Hilbert cube has a bimeasurable real coding)

[F6]

AC supplies the choices in the metric interfaces, including DC by selecting a successor for each admissible finite history and recursively iterating. (The Axiom of Choice)

[F7]

Every real Cauchy sequence converges. (The reals are complete)

Proof

technique · direct
1.1

If E=, the empty bijection onto is bimeasurable. Otherwise fix the single Polish presentation h:EP of [F1]. Its separability and metrizability give a homeomorphic embedding e:PQ=[0,1]N by [F2].

F1F2
2.1

The interval [0,1] is complete: a Cauchy sequence converges in R by [F7], and its limit stays between zero and one by the limit inequalities. Its metric is bounded by one. The metric D(x,y)=n02(n+1)xnyn makes Q a metric space by [F3]. The image Y=e[P] is completely metrizable, transporting a complete compatible metric from P. AC supplies DC as described in [F6], so [F4] yields that Y is Gδ and consequently Borel in Q. The currently repaired supplier proves the ambient equality: points in every small open neighbourhood union lie within 1/n of Y, hence in its closure, before the complete-metric limit argument.

step 1.1F3F4F6F7
3.1

Let c:QC be [F5]. Since c1 is measurable, c[Y]=(c1)1[Y] is Borel in C, and therefore in [0,1], because C itself is Borel. Restricting c and its inverse to Y and c[Y] preserves measurability. The homeomorphism e is bimeasurable on trace Borel sets. Thus ceh and h1e1c1 are mutually inverse measurable maps between E and c[Y].

step 1.1step 2.1F5

Source notes

Durrett Theorem 2.1.22, printed pp.53–54, provides the coding route. Its omitted image detail is supplied by the local cube lemma and the current forward completely-metrizable-to-G-delta theorem; no converse or external recorded theorem is imported.

Depends on

Used by

Dependency tree · two levels

42 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