Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-05
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.

Independent random elements have product joint law

Statement

Let n1, and let Xi:(Ω,F,P)(Si,Σi) for i<n be independent random elements. Define

X=(X0,,Xn1):Ωi<nSi.

Then X is a random element of (i<nSi,i<nΣi), and its law is the finite product of the marginal laws:

PX=i<nPXi.

Facts & Assumptions

Given: Independent random elements Xi:(Ω,F,P)(Si,Σi) for i<n.

[L1]

Independence of random elements is equivalent to factorization on measurable rectangles. (Independent random elements are characterized by finite rectangle probabilities)

[L2]
[L3]

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

[L4]

The finite product sigma-algebra is generated recursively by measurable rectangles. (The product sigma-algebra and its finite iterates)

Proof

technique · direct
1.1

Let D:={Ei<nSi:X1(E)F}. Preimages preserve complements and countable unions, so D is a sigma-algebra. If R=i<nBi is a measurable rectangle, then X1(R)=i<nXi1(Bi)F. Since [L4] says the product sigma-algebra is generated by such rectangles, X is measurable for i<nΣi.

givenL4
1.2

For every measurable rectangle R=i<nBi, [L1] gives PX(R)=P(X0B0,,Xn1Bn1)=i<nP(XiBi)=i<nPXi(Bi).

L1L2
2.1

By step 1.1, the law PX is defined, and [L2] makes it a probability measure on the product sigma-algebra.

step 1.1L2
2.2

For n=1, step 1.2 already identifies PX with PX0. For n2, define recursively ν1:=PX0 and νm+1:=νmPXm. Repeated use of the rectangle formula in [L3] shows that νn(i<nBi)=i<nPXi(Bi) for every measurable rectangle. Therefore PX and νn agree on all measurable rectangles.

step 1.2L3algebra
3.1

The measures PX and νn are finite, hence sigma-finite, and step 2.2 shows that they agree on the generating measurable rectangles from [L4]. The uniqueness clause of [L3], applied recursively through the finite product construction, gives PX=νn=i<nPXi. This is the claimed product joint law.

L3L4step 2.1step 2.2

Depends on

Used by

Dependency tree · two levels

19 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