Alphabeta Math
Pipeline-generated
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 Real Codings and Determining Classes: Examples

1 · Prerequisites

2 · Summary

Discrete countable spaces, finite-dimensional Euclidean spaces and Borel subsets of Polish spaces illustrate the presentation definition of standard Borel. The examples exhibit complete metrics and dense sets, and the rational-subspace example computes its full trace sigma-algebra. The zero-dimensional and empty cases are included.

3 · Logical flowchart

4 · Definitions, theorems and proofs

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Countable discrete spaces are standard borel

Example

Every at most countable set S with its full power-set sigma-algebra is standard Borel, including the empty set. For example S=N has the discrete complete metric d(m,n)=1{mn}.

Facts & Assumptions

Given: An at most countable set S with its full power-set sigma-algebra.

[F1]

A separable completely metrizable space is Polish. (Polish spaces are separable completely metrizable spaces)

[F2]

A measurable space with a Polish presentation is standard Borel. (Standard Borel spaces)

Verification

technique · direct
1.1

On S define d(x,y)=0 if x=y and d(x,y)=1 otherwise. Symmetry and separation are immediate, and if xz, at least one of xy or yz holds, giving d(x,z)=1d(x,y)+d(y,z). Balls of radius one half are singletons. Every Cauchy sequence is eventually constant, by applying the Cauchy condition with tolerance one half; hence d is complete. On N, for instance, d(2,5)=1 and Bd(2,1/2)={2}.

given
2.1

The countable set S itself is dense. Every subset is a union of singleton opens, so the Borel sigma-algebra is exactly its full power set. By [F1] S is Polish and the identity gives the presentation in [F2]. For empty S there are no Cauchy sequences, the empty metric is complete, and the empty set is a countable dense subset; for a singleton the only sequence is constant.

step 1.1F1F2

Source notes

Marker, Descriptive Set Theory, Example 1.2, printed p.2; Durrett Theorem 2.1.22, printed pp.53–54. The metric and its Cauchy property are explicitly evaluated here.

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Euclidean borel spaces are standard borel

Example

For each finite n0, (Rn,B(Rn)) is standard Borel. For n1 use d(x,y)=maxi<nxiyi; R0 is a singleton.

Facts & Assumptions

Given: A finite integer n0 and the Borel measurable space Rn.

[F2]

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

[F3]

Q is countable. (Q is countably infinite)

[F4]

The product of two countable sets is countable without choice. (A product of two at most countable sets is at most countable)

[F5]

Rational points approximate every real coordinate. (The rationals embed densely in the reals)

[F6]

A separable space with a complete compatible metric is Polish. (Polish spaces are separable completely metrizable spaces)

[F7]

The Borel space of a Polish space is standard Borel. (Standard Borel spaces)

Verification

technique · direct
1.1

For n1, [F1] supplies the metric. A d-infinity Cauchy sequence is Cauchy in each coordinate since xiyid(x,y). The coordinate limits exist by [F2]. For a fixed tolerance take the maximum of the finitely many coordinate convergence thresholds; beyond it all coordinate errors are below that tolerance, so the vectors converge in d-infinity. This metric induces the usual Euclidean topology: dd2nd follows by bounding each squared coordinate by the maximum squared.

F1F2
1.2

Induction using [F3]–[F4] makes Qn countable. Given a vector x and positive epsilon, [F5] gives a rational in each of its finitely many coordinate intervals of radius epsilon; the resulting vector q satisfies d(x,q)<ε. Hence Q to the nth power is dense. For instance in dimension two, d((0,1),(1/3,4/3))=1/3.

F3F4F5
2.1

Steps 1.1–1.2 and [F6] show R to the nth power is Polish. The identity is the presentation of [F7]. For n=0 there is just the empty tuple, with zero metric and itself as a finite dense set; it is complete and Polish. No maximum over an empty index set is used.

step 1.1step 1.2F6F7

Source notes

Durrett Theorem 2.1.22, printed pp.53–54. The explicit complete Euclidean metric and rational density give the Polish presentation directly.

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Borel subspaces of polish spaces are standard borel

Example

Under AC, every Borel subset B of a Polish space P is standard Borel with its trace Borel sigma-algebra. A concrete instance is QR, presented by its discrete topology.

Facts & Assumptions

Given: AC, a Polish space P and a Borel subset B; the concrete instance is Q inside R.

[F1]

Under AC a Borel subset has a finer Polish topology with exactly its trace Borel sets. (Borel subspaces admit polish presentations)

[F2]

Q is countable. (Q is countably infinite)

[F3]

AC supplies the topology and metric choices in the refinement lemma. (The Axiom of Choice)

[F4]

The usual real metric is complete. (The reals are complete)

Verification

technique · direct
1.1

Apply [F1] with its AC hypothesis [F3]. It gives a Polish topology on B whose Borel sigma-algebra is the trace of that of P. The identity map from the trace measurable space to this presentation is therefore bimeasurable, proving the general assertion, including B empty.

F1F3
2.1

For the instance, R is complete by [F4] and separable by [F2]–[F5], hence Polish. Each singleton rational is closed in R (a point outside it has a ball avoiding it), so Q and every subset of Q are Borel by [F2] and countable unions. Thus B(R)Q=P(Q). The discrete metric d(q,r)=1{qr} is complete because a Cauchy sequence is eventually constant; Q itself is countable dense for this topology. Its Borel sets are again all subsets. For example the preimage of {1/2,2/3} under the identity is exactly {1/2,2/3} in both measurable structures. This gives the claimed explicit Polish presentation without requiring the inherited metric to be complete.

F2F4F5

Source notes

Marker Theorem 2.24, printed pp.20–21, and Definition 2.29, pp.21–22; Durrett Theorem 2.1.22, printed pp.53–54. The Q instance is calculated locally.

5 · Examples, counterexamples and false statements

None yet.

Sources