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.
Layer-cake formulas for random variables
Statement
Let be a probability space.
- If is measurable, then where the right-hand side may be .
- If is an integrable real random variable, then
Facts & Assumptions
Given: A probability space and a random variable in the relevant clause.
Expectation is integration against , and with for real (Expectation of a nonnegative or integrable random variable, The positive and negative parts of a function).
For a finite-valued measurable real function , the layer-cake formula with gives (For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function).
The Lebesgue integral is linear on (The Lebesgue integral is linear on ).
Increasing sequences of nonnegative measurable functions have integrals increasing to the integral of their pointwise limit, including infinite values (Monotone convergence for the integral).
Proof
For each integer , set . This is a finite-valued nonnegative measurable real function: for a real , is if , is if , and is empty if . Also , including where . Apply [L2] to to obtain . For , the tail equals when and zero when , so these tails increase pointwise to . Every tail is a nonincreasing Borel function of : each strict upper level set is an initial interval, possibly empty or the whole half-line. Apply [L4] first on and then on to pass to the limits in the identities for . Using [L1] gives with allowed.
If is integrable and real, then and [L1] gives . By step 1.1 applied to and , Subtracting these identities and using [L3] proves the second formula.
Depends on
Used by
- The stated sparse-covariance minimax rate is unbounded for super-exponential dimension Counterexample
- An infinite-mean law requiring diverging centering Example
- An inverse-CDF singularity can be integrable but have infinite variation Example
- Finite mean does not give a finite-variance Monte Carlo error Example
- Recovering an exponential law from its tail Example
- Strong law estimator of an integrable mean Example
- The uniform random variable on [0,1] Example
- A Gaussian tail bound implies a sub-Gaussian MGF bound Lemma
- Centered filtering Feynman–Kac operators contract terminal tests Lemma
- Expected squared operator error of thresholded sparse covariance Lemma
- Geometric tail for hitting in a finite irreducible chain Lemma
- Products of sub-Gaussian coordinates are sub-exponential Lemma
- Products of variables with Gaussian tails are sub-exponential Lemma
- Strong-mixing covariance bound in terms of tail quantiles Lemma
- Tail sum integrability equivalence Lemma
- Capped thresholded minimax rate for weak-lq sparse covariance Theorem
- Rejection sampling is uniform, almost surely terminating, and has expected linear bit cost Theorem
Dependency tree · two levels
26 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.6 (standard reference, not scraped)
- J. R. Norris, Probability and Measure, Section 4.2 (standard reference, not scraped)