Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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 pi-systems generate independent sigma-algebras

Statement

Let (Πi)i∈I be a family of pi-systems in a probability space (Ω,F,P), and assume Ω∈Πi for every i. If the family (Πi)i∈I is independent, then the sigma-algebras (σ(Πi))i∈I are independent.

Facts & Assumptions

Given: Pi-systems (Πi)i∈I with Ω∈Πi for every i, and assume the family (Πi)i∈I is independent.

[L1]

Independence of sigma-algebras and event classes is checked on finite subfamilies. (Independent sigma-algebras and independent events)

[L2]

If a lambda-system contains a pi-system, then it contains the sigma-algebra generated by that pi-system. (Dynkin's pi-lambda theorem)

Proof

technique · direct
1.1givenL1

By [L1], it suffices to fix a finite list of distinct indices i0,…,in−1 and prove that σ(Πi0),…,σ(Πin−1) are independent.

1.2givenL2

Fix Bk∈Πik for k<n−1 and define Λn−1:={A∈σ(Πin−1):P(⋂k<n−1Bk∩A)=(∏k<n−1P(Bk))P(A)}. Because Ω∈Πin−1, the class Λn−1 contains Ω. It is closed under relative differences of nested sets and under increasing countable unions because both sides of the defining identity are countably additive in A. Since the original pi-systems are independent, every A∈Πin−1 lies in Λn−1. Therefore [L2] gives σ(Πin−1)⊆Λn−1.

2.1step 1.2L2

Repeat the construction of step 1.2 for the coordinates n−2,n−3,…,0, each time freezing already-promoted later coordinates in σ(Πij) and keeping the earlier coordinates inside the original pi-systems. Each stage produces a lambda-system containing the relevant pi-system, so [L2] successively replaces every Πij by σ(Πij). Hence P(⋂k<nAk)=∏k<nP(Ak)(Ak∈σ(Πik)).

3.1L1step 1.1step 2.1∎

Since the finite choice of indices was arbitrary, the full family (σ(Πi))i∈I is independent.

Depends on

Used by

Dependency tree · two levels

9 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