Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 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.

On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let m,n1. Under the identification Rm+n=Rm×Rn, the product measure λm×λn and the Euclidean Lebesgue measure λm+n agree on every Borel subset of Rm+n.

Facts & Assumptions

Given: The Axiom of Countable Choice, positive integers m,n, and the identification Rm+n=Rm×Rn.

[L1]

The Borel sigma-algebra on Rm+n is B(Rm)B(Rn). (The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n})

[L2]

The product measure on sigma-finite spaces exists and satisfies the rectangle formula. (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique)

[L4]

Assuming countable choice, Lebesgue measure is sigma-finite and finite on bounded sets. (Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure)

[L5]

Two measures that agree on a sigma-finite generating pi-system agree on the generated sigma-algebra. (Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system)

[A1]

Rational half-open boxes in Rm+n form a sigma-finite generating pi-system for B(Rm+n).

Proof

technique · direct
1.1

Let Q=i<m+n(ai,bi] be a rational half-open box. Split it as Q=A×B with ARm and BRn. Then step 2 of [L2] and [L3] give (λm×λn)(Q)=λm(A)λn(B)=i<m+n(biai)=λm+n(Q).

L2L3
2.1

By [L4], both measures are sigma-finite on the pi-system of [A1]. Step 1.1 shows that they agree there, and [L1] identifies the generated sigma-algebra with B(Rm+n). Therefore [L5] implies λm×λn=λm+n on every Borel set.

A1L4L5step 1.1

Depends on

Used by

Dependency tree · two levels

60 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