Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Independent random elements have product joint law

Statement

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

X=(X0,…,Xn−1):Ω→∏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)

[L5]

Measures agreeing on a generating pi-system with an increasing finite-measure exhaustion from that pi-system are equal (Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system).

Proof

technique · direct
1.1givenL4

First prove that all-coordinate rectangles generate the recursively defined finite product sigma-algebra. This is immediate for one factor. Suppose it holds for k factors, write Tk=∏i<kSi and Ak=⨂i<kΣi, and let H be the sigma-algebra generated by the (k+1)-coordinate rectangles. These rectangles belong to Ak⊗Σk, so H⊆Ak⊗Σk. Fix B∈Σk. The class CB={A∈Ak:A×B∈H} contains Tk, since Tk×B is an all-coordinate rectangle. It is closed under complements relative to Tk, because (Tk∖A)×B=(Tk×B)∖(A×B), and under countable unions because product with B commutes with them. Hence it is a sigma-algebra containing all k-coordinate rectangles. The induction hypothesis gives CB=Ak. As this holds for every B, every binary rectangle A×B generating Ak⊗Σk lies in H, proving equality and completing the finite induction.

2.1givenL4step 1.1

Let D:={E⊆∏i<nSi:X−1(E)∈F}. Preimages preserve complements and countable unions, so D is a sigma-algebra. If R=∏i<nBi is a measurable rectangle, then X−1(R)=⋂i<nXi−1(Bi)∈F. By step 1.1, the product sigma-algebra is generated by these all-coordinate rectangles, so X is measurable for ⨂i<nΣi.

3.1L1L2step 2.1

For every measurable rectangle R=∏i<nBi, [L1] gives PX(R)=P(X0∈B0,…,Xn−1∈Bn−1)=∏i<nP(Xi∈Bi)=∏i<nPXi(Bi).

3.2step 2.1L2

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

4.1step 3.1step 3.2L3algebra

For every n≥1, put ν1:=PX0 and, for 1≤m<n, define recursively νm+1:=νm⊗PXm. For n=1, step 3.1 already identifies PX with ν1. For n≥2, 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.

5.1L2L3L5step 1.1step 3.2step 4.1∎

All-coordinate rectangles are closed under intersections, because intersections are taken coordinatewise; they contain the whole product and generate its sigma-algebra by step 1.1. By step 4.1, PX and νn agree on this pi-system. Both have total mass one: [L2] gives this for the joint law, and the rectangle formula [L3] gives it at every stage of the product-law recursion. The constant exhaustion by the whole product therefore satisfies the finite-measure hypothesis of [L5], which gives PX=νn=⨂i<nPXi. This is the claimed product joint law.

Depends on

Used by

…and 47 more results.

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