Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-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.

The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}

Statement

Let m,n≥1. Under the identification Rm+n=Rm×Rn, one has B(Rm)⊗B(Rn)=B(Rm+n).

Facts & Assumptions

Given: Positive integers m,n and the identification Rm+n=Rm×Rn.

[L1]

The Borel sigma-algebra on a topological space is the sigma-algebra generated by its open sets. (The Borel sigma-algebra of a topological space)

[L2]

Continuous maps pull Borel sets back to Borel sets. (A continuous map has Borel preimages of Borel sets)

[A1]

The coordinate projections π1:Rm+n→Rm and π2:Rm+n→Rn are continuous.

[L3]

Rational open boxes form a countable basis of the Euclidean product topology: every point of an open set lies in a rational box contained in that set (Qn is a countable dense subset of Rn, and rational open boxes form a countable basis, For n at least one, open sets, closed sets, compact sets, open balls, boxes, rational open boxes, and rational half-open boxes generate the Borel sigma-algebra on R^n). These results use rational density and only finitely many coordinate choices, not an axiom of countable or arbitrary choice.

Proof

technique · direct
1.1A1L2

If A⊆Rm and B⊆Rn are Borel, then A×B=π1−1(A)∩π2−1(B), so [L2] makes A×B Borel in Rm+n. Therefore every measurable rectangle for B(Rm)⊗B(Rn) belongs to B(Rm+n), and hence B(Rm)⊗B(Rn)⊆B(Rm+n).

2.1L1L3step 1.1∎

Let O be open in Rm+n and let RO be the family of all rational open boxes contained in O. By [L3], every x∈O lies in a member of RO, so O=⋃RO; the reverse containment follows from its definition, including when O is empty. This is a subfamily of one fixed countable basis, hence is at most countable; no choice of a box for each point is made. Each box ∏j=1m+n(aj,bj) splits into the open rectangle U×V, with U=∏j=1m(aj,bj) and V=∏j=m+1m+n(aj,bj). Both factors are Borel, so each box belongs to the product sigma-algebra. Closure under countable unions puts O there as well. Since [L1] says the open sets generate the Euclidean Borel sigma-algebra, this proves the reverse inclusion. Combining with step 1.1 proves the equality, without any choice assumption.

Depends on

Dependency tree · 2 levels

Sources