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.
Product weights normalize, and coordinate events are mutually independent
Statement
The weights in every finite product of finite probability spaces are nonnegative and sum to . For events , the coordinate events are mutually independent, and for every ,
Facts & Assumptions
Given: A finite family of finite probability spaces and coordinate events .
Product outcomes and their weights are defined coordinatewise, with the empty product equal to (The finite product of finite probability spaces).
Finite Fubini interchanges and factors iterated finite sums, while finite products of nonnegative reals are nonnegative (Laws of finite sums and finite products, Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule).
Mutual independence is the intersection product identity for every nonempty subfamily (Independent events, pairwise independence, and mutual independence of a finite family).
Proof
For , the unique product outcome has weight , so normalization holds.
If normalization holds for and another factor is appended, finite Fubini gives .
For , summing the product weights over factors coordinatewise: a coordinate in contributes and a coordinate outside contributes .
Induction proves normalization for every finite product; nonnegativity follows from nonnegativity of all factor weights.
Thus . The empty gives , so [L3] proves mutual independence in all cases.
Depends on
- The finite product of finite probability spaces
- Laws of finite sums and finite products
- Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule
- Independent events, pairwise independence, and mutual independence of a finite family
Used by
- A prescribed set of present and absent edges in G(n,p) has product probability Lemma
- An n-vertex graph of minimum degree δ>1 has a dominating set of size at most n(log(δ+1)+1)/(δ+1) Theorem
- Every finite graph with m edges has a cut containing at least m/2 edges Theorem
- Every k-uniform hypergraph with fewer than 2ᵏ⁻¹ edges is 2-colourable Theorem
- If k≥1 and n≥3k² 2ᵏ, an n-vertex tournament with property Sₖ exists Theorem
- Szele's bound: for every n≥1, some n-vertex tournament has at least n!/2ⁿ⁻¹ Hamilton paths Theorem
Cited to discharge well-definedness by The finite product of finite probability spaces.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 59 results over 15 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- C. M. Grinstead and J. L. Snell, Introduction to Probability, 2nd ed., Section 4.1 (standard reference, not scraped)
- H. Pishro-Nik, Introduction to Probability, Statistics, and Random Processes, Section 1.4.1 (standard reference, not scraped)