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.
Finite measures agreeing on a generating pi-system and on the whole space are equal
Statement
Let be a pi-system on and let . If finite measures and on agree on and satisfy , then on .
The total-mass equality is separate because this library's pi-system convention does not require .
Facts & Assumptions
Given: A pi-system generating , and finite measures agreeing on and on .
A pi-system is a nonempty family closed under binary intersections and need not contain (Pi-systems).
If a lambda-system contains a pi-system , then it contains (Dynkin's pi-lambda theorem).
Measures are finitely and countably additive (Measures on sigma-algebras) and continuous from below (Continuity from below for measures).
For finite measures, the value on a relative difference is obtained by subtracting the smaller-set value (Measure of a set difference when the smaller set has finite measure).
The generated sigma-algebra is the intersection of all sigma-algebras containing the generating family (The sigma-algebra generated by a family of sets).
Proof
Let . Then by the total-mass hypothesis and by the agreement hypothesis.
If lie in , finiteness and [L4] give , so .
If and each , continuity from below gives , so .
Steps 1.1, 1.2 and 1.3 show that is a lambda-system containing .
Dynkin's theorem gives , so for every .
Depends on
Used by
Dependency tree · two levels
15 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
- D. Pollard, A User's Guide to Measure Theoretic Probability, §10 (standard reference, not scraped)