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.
Jensen's inequality for expectation
Statement
Let be a probability space, let be an integrable real random variable, let be an interval containing for almost every , and let be convex.
Assume additionally that is either integrable or nonnegative, so its expectation is defined by Expectation of a nonnegative or integrable random variable. Then In the nonnegative case the right-hand side may be .
Facts & Assumptions
Given: A probability space, an integrable real random variable , an interval containing its almost-everywhere range, and a convex such that is integrable or nonnegative.
Expectation is integration against the underlying probability measure (Expectation of a nonnegative or integrable random variable).
Jensen's integral inequality holds for a probability measure whenever the composed function is integrable (Jensen's integral inequality for a probability measure).
Proof
If is nonnegative and , then the claimed inequality is automatic, because is a real number while the right-hand side is .
In every remaining case, is integrable: this is assumed directly, or follows from nonnegativity and finite expectation. Thus [L1] and [L2] applied to the probability measure give
Steps 1.1 and 1.2 cover the infinite and finite expectation cases.
Depends on
Used by
Dependency tree · two levels
9 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.1 (standard reference, not scraped)
- J. R. Norris, Probability and Measure, Theorem 4.3.2 (standard reference, not scraped)