Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 unit interval with its Borel structure is standard Borel

Statement

Let I=[0,1] with the subspace topology from the usual real topology and with its Borel sigma-algebra. Then (I,B(I)) is a standard-Borel space (Standard Borel spaces).

Facts & Assumptions

Given: The usual real metric d(x,y)=∣x−y∣ and the subspace I=[0,1].

[F2]

The reals are complete: every Cauchy sequence in the usual real metric converges in R.

[F3]

Q is countably infinite: Q is countably infinite, so there is a bijection from Q to N.

[F4]

The rationals embed densely in the reals: between any two distinct real numbers lies a rational.

[F5]

Every subset of an at most countable set is at most countable: every subset of an at most countable set is at most countable; countable means finite or bijective with N (Finite, countably infinite, countable, uncountable, Equinumerous sets, A≈B and A⪯B).

[F7]

The Borel sigma-algebra of a topological space: the Borel sigma-algebra is generated by open sets and is closed under complements.

[F9]

Polish spaces are separable completely metrizable spaces: a space is Polish if it is separable and has a compatible complete metric; Standard Borel spaces identifies a measurable space with the Borel structure of a Polish presentation.

[A1]

The closed interval I=[0,1] is {x∈R:0≤x≤1} (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[A3]

The metric on I is the restriction dI=d∣I×I (Isometry, isometric embedding, and the subspace metric on a subset).

Proof

technique · direct

Given: I=[0,1] with the usual subspace topology and Borel sigma-algebra.

1.1F1F6F7F10A1algebra

The interval is closed in R: for z∉I, [F6] and [A1] give either z<0 or z>1. If z<0, set r=−z>0; then every y∈B(z,r) satisfies y<z+r=0. If z>1, set r=z−1>0; then every y∈B(z,r) satisfies y>z−r=1. By [F1] these are open neighborhoods disjoint from I, so its complement is open by [F10]. Thus I is Borel by [F7].

1.2F3F4F5F6A1givenchoose

The set D:=Q∩I is at most countable: restrict the bijection Q→N from [F3] to D, then apply [F5]. It is dense in I. Indeed, for x∈I and ε>0, if x=1 choose q=1. If x<1, then x+ε>x; take b=x+ε when x+ε≤1, and b=1 otherwise. In either case b>x and b−x≤ε, with strict inequality in the second case. By [F4] choose a rational q with x<q<b; then q∈D and ∣q−x∣<ε. The order comparisons use [F6] and the interval endpoints use [A1].

2.1A2A3F2step 1.1given

Let (xn) be a Cauchy sequence in I under dI. By [A2]–[A3], Cauchy distances are the same in I and R, so [F2] gives a real limit x. If x∉I, step 1.1 gives an open ball about x disjoint from I, while convergence puts all sufficiently late xn in that ball, a contradiction. Hence x∈I and the sequence converges in the restricted metric; (I,dI) is complete.

3.1A2F8F9step 1.2step 2.1algebra∎

By steps 1.2 and 2.1, I is separable and completely metrizable, hence Polish by [F9]. Its Borel sigma-algebra is the trace of B(R) by [F8] and [A2]. The identity map from (I,B(R)∣I) to the Polish subspace I is therefore a bimeasurable bijection; [F9] makes (I,B(I)) standard Borel. This proves the claim without any choice axiom.

Depends on

Used by

Dependency tree · two levels

81 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