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 probability spaces are exactly finite full-power-set probability spaces
Statement
Let be a finite set.
- If is a finite probability space in the sense of Finite probability spaces, outcome weights, events, and event probabilities, then is a probability measure on .
- Conversely, if is a probability measure on , then makes a finite probability space and
These two constructions are inverse to each other. In particular, zero-weight outcomes remain genuine outcomes in both descriptions.
Facts & Assumptions
Given: A finite set .
A finite probability space is a finite set with nonnegative weights summing to , every subset is an event, and event probabilities are the corresponding sub-weight sums (Finite probability spaces, outcome weights, events, and event probabilities).
A probability measure is a measure of total mass (Probability measures and probability spaces).
On a finite sigma-algebra, the atoms partition the space, every measurable set is the union of the atoms it contains, and a measure is the sum of the atom masses over those atoms (A measure on a finite sigma-algebra is a finite weighted sum over its atoms).
Proof
If is a finite probability space, then [L1] already states that every subset of is an event and that is its probability. Therefore is a probability measure on by [L2].
Conversely, let be a probability measure on and put . Each singleton is an atom of the full power-set sigma-algebra, and every is the union of the singletons it contains. Thus [L3] gives Taking yields , and nonnegativity of comes from the measure axioms inside [L2]. So is a finite probability space.
Step 1.1 constructs a full-power-set probability measure from any finite weight model, and step 1.2 recovers exactly those singleton weights from any full-power-set probability measure. Hence the two descriptions are equivalent, including the boundary case of outcomes with weight .
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
- Rick Durrett, Probability: Theory and Examples, 5th ed., Section 1.1 (standard reference, not scraped)
- J. R. Norris, Probability and Measure, Section 1.9 (standard reference, not scraped)