Let be a real integrable random variable, let be a sub-sigma-algebra, and let be a finite convex function with integrable. Then
almost surely. These explicit integrability assumptions make both conditional expectations well defined.
A finite convex function on the real line is the supremum of a countable family of supporting affine functions, for example choosing supports at rational points and using continuity. Write them as . For each , monotonicity and linearity of conditional expectation give . Countability permits one exceptional null set for every . Taking the supremum proves the inequality.
With and square-integrable , the inequality says that retaining only the information in cannot increase its second moment. More generally it is the convex-loss step behind the Rao-Blackwell theorem.

Ancestors (7)

  1. Conditional expectation
  2. Measure theory
  3. Real analysis
  4. Analysis
  5. Area of mathematics
  6. Mathematics
  7. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.