Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Finite-dimensional Euclidean space with its Borel sigma-algebra is standard Borel

Statement

For every natural n≥1, let Rn be the set of functions x:n→R with its finite-product topology and Borel sigma-algebra (The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, The Borel sigma-algebra of a topological space). Then (Rn,B(Rn)) is standard Borel.

Facts & Assumptions

Given: A natural n≥1; Rn with its finite-product topology; the Euclidean metric d2 and maximum metric d∞ from Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it.

[F2]

Every nonempty finite set of real numbers has a maximum and minimum, each belonging to the set and bounding it on the corresponding side (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[F3]

For u∈R, u2=∣u∣2; finite sums of nonnegative terms are nonnegative, each term is at most the sum, sums are monotone, and ∑i<nc=nc (Basic properties of the absolute value, Laws of finite sums and finite products).

[F4]

Nonnegative numbers have unique nonnegative square roots; square-root order is monotone, and the real image of a natural n≥1 is positive (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Squaring is monotone on the nonnegatives, Canonical naturals are positive and strictly increasing).

[F6]

Qn is at most countable and dense, and rational open boxes form a basis for the finite-product topology on Rn (Qn is a countable dense subset of Rn, and rational open boxes form a countable basis).

[F7]

Polish means separable and admitting a compatible complete metric; separable means having an at most countable dense subset (Polish spaces are separable completely metrizable spaces, Separability: the existence of an at most countable dense subset).

[F8]

Standard Borel means measurably isomorphic to the Borel space of a Polish topology; a Borel sigma-algebra is generated by the open sets (Standard Borel spaces, The Borel sigma-algebra of a topological space).

[F9]

A metric Cauchy sequence has tails whose pairwise distances are below each positive rational tolerance, and metric convergence means distance to the limit tends to zero (Cauchy sequence in a metric space, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R).

[F10]

Every nonempty real interval contains a rational number, so each positive real tolerance has a smaller positive rational tolerance (The rationals embed densely in the reals).

Proof

Proof technique: compare the maximum metric topology with the product topology, then use completeness and rational density.

1.1F1F2F6

Every d∞-ball about x of radius r>0 is the product box ∏i<n(xi−r,xi+r), so it is open in the product topology. Conversely, let U be product-open and x∈U. By [F6], choose a rational box Q=∏i<n(ai,bi) with x∈Q⊆U. The finite set S={xi−ai,bi−xi:i<n} is nonempty because n≥1, and every member is positive. By [F2], r=min⁡S exists and is positive. If d∞(x,y)<r, then ∣xi−yi∣≤d∞(x,y)<r≤xi−ai and ∣xi−yi∣<r≤bi−xi for every i<n, hence y∈Q⊆U. Thus each product-open set is d∞-open, and the topologies agree.

1.2F1F2F3F4algebra

Fix x,y∈Rn, put ui=xi−yi and M=d∞(x,y). By [F1] and [F2], M=∣uj∣ for some j<n and 0≤∣ui∣≤M for every i<n. Hence [F3] gives M2=uj2≤∑i<nui2=d2(x,y)2, so [F4] yields M≤d2(x,y). Also ui2=∣ui∣2≤M2 for each i, whence d2(x,y)2=∑i<nui2≤∑i<nM2=nM2 by [F3]. Since n>0, [F4] makes n M nonnegative and (n M)2=nM2; square-root monotonicity now gives d2(x,y)≤n M. Thus d∞≤d2≤n d∞ for all pairs.

2.1F9F10step 1.2algebra

Let (x(m)) be d∞-Cauchy and fix a positive rational ε. By [F10], choose a positive rational ρ<ε/(1+n). The Cauchy condition [F9] gives a tail on which d∞(x(m),x(l))<ρ. Step 1.2 then gives d2(x(m),x(l))≤n d∞(x(m),x(l))<nρ<ε, so the sequence is d2-Cauchy.

3.1F5F9step 1.2step 2.1

By [F5], this sequence has a d2-limit x∈Rn. Step 1.2 gives d∞(x(m),x)≤d2(x(m),x)→0; by [F9] this is convergence in d∞. Therefore d∞ is complete.

4.1F6F7step 1.1step 3.1

By [F6], Qn is at most countable and dense in the product topology. Step 1.1 identifies that topology with the d∞ topology, so the same subset is dense for d∞. Thus the product topology is separable by [F7], and step 3.1 supplies its compatible complete metric. Consequently Rn with the product topology is Polish.

5.1F8step 1.1step 4.1∎

The identity from (Rn,B(Rn)) to the Polish space of step 4.1 is a bijection. The topologies are identical by step 1.1, so they have the same open sets and therefore, by [F8], the same Borel sigma-algebra. The identity is thus a measurable isomorphism as required by the definition of standard Borel.

Depends on

Used by

Dependency tree · two levels

83 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