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 random variables are measurable
Statement
Let be a finite probability space, and regard it as the probability space from Finite probability spaces are exactly finite full-power-set probability spaces. Then every function is a real random variable.
In particular, the published finite definition Real random variables on finite probability spaces and their finite distributions is exactly the measure-theoretic definition on that full-power-set probability space.
Facts & Assumptions
Given: A finite probability space and a function .
The theorem on finite probability spaces identifies with a probability measure on (Finite probability spaces are exactly finite full-power-set probability spaces).
A real random variable is a measurable map from the sample-space sigma-algebra to (Random elements and real random variables).
On a finite probability space, a real random variable is simply a function (Real random variables on finite probability spaces and their finite distributions).
Proof
By [L1], every subset of is measurable. Hence for every Borel set , the preimage is a subset of , so it lies in . Therefore is measurable.
Step 1.1 proves that every finite random variable in the sense of [L3] is a real random variable in the sense of [L2], so the two notions agree exactly on finite full-power-set probability spaces.
Depends on
Used by
Dependency tree · two levels
11 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.3 (standard reference, not scraped)
- J. R. Norris, Probability and Measure, Section 2.1 (standard reference, not scraped)