\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
Real-Valued Random Variable Variance ›
Needed by:
Expectation Deviation Upper Bound ›
Links:
Sheet PDF ›
Graph PDF ›
Wikipedia ›

Tail Measure Upper Bound

Why

Consider bounding the measure where two functions differ. We would look at their absolute value, and the measure of where this is greater than zero. The absolute value of their difference is a non-negative measurable random variable.

Result

We bound the measure that a non-negative measurable real-valued function exceeds some value by its integral.

Suppose $g: X \to \R _+$ is measurable on $(X, \mathcal{A} , \mu )$. Then

\[ \mu (\Set*{x \in X}{g(x) \geq t}) \leq \frac{\int g d\mu }{t} \quad \text{ for all } t > 0 \]

Let $A = \Set*{x \in X}{g(x) \geq t}$. Define $h: X \to R$ by

\[ h(x) = \begin{cases} 1 & \text{ if } g(x) \geq t \\ 0 & \text{ otherwise. } \end{cases} \]

First, $\mu (A) = \int h d\mu $. Second, $h \leq g$. So:

\[ \mu (\Set*{x \in X}{g(x) \geq t}) = \int h d\mu \leq \int g/t d\mu = \frac{\int g d\mu }{t}. \]

This proposition is universally referred to as Markov's inequality (or the Markov inequality).1


  1. We eschew this terminology in accordance with the project's policy on naming. ↩︎
Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc — About — Show the old page view