Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-29
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,n1. 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+nRm and π2:Rm+nRn are continuous.

[A2]

Every open set in Rm+n is a countable union of open rectangles U×V with URm and VRn open.

Proof

technique · direct
1.1

If ARm and BRn are Borel, then A×B=π11(A)π21(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).

A1L2
2.1

By [A2], every open set in Rm+n is a countable union of open rectangles, hence belongs to B(Rm)B(Rn). Since [L1] says a Borel sigma-algebra is generated by the open sets, this gives the reverse inclusion. Combining with step 1.1 proves the equality.

step 1.1A2L1

Depends on

Used by

Dependency tree · two levels

25 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