17.5: Appendix E to Applied Probability - Properties of Mathematical Expectation
- Page ID
- 11803
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)
( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\id}{\mathrm{id}}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\kernel}{\mathrm{null}\,}\)
\( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\)
\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\)
\( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)
\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)
\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)
\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vectorC}[1]{\textbf{#1}} \)
\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)
\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)
\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)\[E[g(X)] = \int g(X)\ dP \nonumber\]
We suppose, without repeated assertion, that the random variables and Borel functions of random variables or random vectors are integrable. Use of an expression such as \(I_M (X)\) involves the tacit assumption that \(M\) is a Borel set on the codomain of \(X\).
(E1): \(E[aI_A] = aP(A)\), any constant \(a\), any event \(A\)
(E1a): \(E[I_M (X)] = P(X \in M)\) and \(E[I_M (X) I_N (Y)] - P(X \in M, Y \in N)\) for any Borel sets \(M, N\) (Extends to any finite product of such indicator functions of random vectors)
(E2): Linearity. For any constants \(a, b\), \(E[aX + bY) = aE[X] + bE[Y]\) (Extends to any finite linear combination)
(E3): Positivity; monotonicity.
a. \(X \ge 0\) a.s. implies \(E[X] \ge 0\), with equality iff \(X = 0\) a.s.
b. \(X \ge Y\) a.s. implies \(E[X] \ge E[Y]\), with equality iff \(X = Y\) a.s.
(E4): Fundamental lemma. If \(X \ge 0\) is bounded, and \(\{X_n: 1 \le n\}\) is a.s. nonnegative, nondecreasing, with \(\text{lim}_n X_n (\omega) \ge X(\omega)\) for a.e. \(\omega\), then \(\text{lim}_n E[X_n] \ge E[X]\)
(E4a): Monotone convergence. If for all \(n\), \(0 \le X_n \le X_{n + 1}\) a.s. and \(X_n \to X\) a.s.,then \(E[X_n] \to E[X]\) (The theorem also holds if \(E[X] = \infty\))
******
(E5): Uniqueness. * is to be read as one of the symbols \(\le, =\), or \(\ge\)
a. \(E[I_M(X) g(X)]\) * \(E[I_M(X) h(X)]\) for all \(M\) iff \(g(X)\) * \(h(X)\) a.s.
b. \(E[I_M(X) I_N (Z) g(X, Z)] = E[I_M (X) I_N (Z) h(X,Z)]\) for all \(M, N\) iff \(g(X, Z) = h(X, Z)\) a.s.
(E6): Fatou's lemma. If \(X_n \ge 0\) a.s., for all \(n\), then \(E[ \text{lim inf } X_n] \le [\text{lim inf } E[X_n]\)
(E7): Dominated convergence. If real or complex \(X_n \to X\) a.s., \(|X_n| \le Y\) a.s. for all \(n\), and \(Y\) is integrable, then \(\text{lim}_n E[X_n] = E[X]\)
(E8): Countable additivity and countable sums.
a. If \(X\) is integrable over \(E\), and \(E = \bigvee_{i = 1}^{\infty} E_i\) (disjoint union), then \(E[I_E X] = \sum_{i = 1}^{\infty} E[I_{E_i} X]\)
b. If \(\sum_{n = 1}^{\infty} E[|X_n|] < \infty\), then \(\sum_{n = 1}^{\infty} |X_n| < \infty\), a.s. and \(E[\sum_{n = 1}^{\infty} X_n] = \sum_{n = 1}^{\infty} E[X_n]\)
(E9): Some integrability conditions
a. \(X\) is integrable iff both \(X^{+}\) and \(X^{-}\) are integrable iff \(|X|\) is integrable.
b. \(X\) is integrable iff \(E[I_{\{|X| > a\}} |X|] \to 0\) as \(a \to \infty\)
c. If \(X\) is integrable, then \(X\) is a.s. finite
d. If \(E[X]\) exists and \(P(A) = 0\), then \(E[I_A X] = 0\)
(E10): Triangle inequality. For integrable \(X\), real or complex, \(|E[X]| \le E[|X|]\)
(E11): Mean-value theorem. If \(a \le X \le b\) a.s. on \(A\), then \(aP(A) \le E[I_A X] \le bP(A)\)
(E12): For nonnegative, Borel \(g\), \(E[g(X)] \ge aP(g(X) \ge a)\)
(E13): Markov's inequality. If \(g \ge 0\) and nondecreasing for \(t \ge 0\) and \(a \ge 0\), then
\(g(a)P(|X| \ge a) \le E[g(|X|)]\)
(E14): Jensen's inequality. If \(g\) is convex on an interval which contains the range of random variable \(X\), then \(g(E[X]) \le E[g(X)]\)
(E15): Schwarz' inequality. For \(X, Y\) real or complex, \(|E[XY]|^2 \le E[|X|^2] E[|Y|^2]\), with equality iff there is a constant \(c\) such that \(X = cY\) a.s.
(E16): Hölder's inequality. For \(1 \le p, q\), with \(\dfrac{1}{p} + \dfrac{1}{q} = 1\), and \(X, Y\) real or complex.
\(E[|XY|] \le E[|X|^p]^{1/p} E[|Y|^q]^{1/q}\)
(E17): Hölder's inequality. For \(1 < p\) and \(X, Y\) real or complex,
\(E[|X + Y|^p]^{1/p} \le E[|X|^p]^{1/p} + E[|Y|^p]^{1/p}\)
(E18): Independence and expectation. The following conditions are equivalent.
a. The pair \(\{X, Y\}\) is independent
b. \(E[I_M (X) I_N (Y)] = E[I_M (X)] E[I_N (Y)]\) for all Borel \(M, N\)
c. \(E[g(X)h(Y)] = E[g(X)] E[h(Y)]\) for all Borel \(g, h\) such that \(g(X)\), \(h(Y)\) are integrable.
(E19): Special case of the Radon-Nikodym theorem If \(g(Y)\) is integrable and \(X\) is a random vector, then there exists a real-valued Borel function \(e(\cdot)\), defined on the range of \(X\), unique a.s. \([P_X]\), such that \(E[I_M(X) g(X)] = E[I_M (X) e(X)]\) for all Borel sets \(M\) on the codomain of \(X\).
(E20): Some special forms of expectation
a. Suppose \(F\) is nondecreasing, right-continuous on \([0, \infty)\), with \(F(0^{-}) = 0\). Let \(F^{*} (t) = F(t - 0)\). Consider \(X \ge 0\) with \(E[F(X)] < \infty\). Then,
(1) \(E[F(X)] = \int_{0}^{\infty} P(X \ge t) F\ (dt)\) and (2) \(E[F^{*} (X)] = \int_{0}^{\infty} P(X > t) F\ (dt)\)
b. If \(X\) is integrable, then \(E[X] = \int_{-\infty}^{\infty} [u(t) - F_X (t)]\ dt\)
c. If \(X, Y\) are integrable, then \(E[X - Y] = \int_{-\infty}^{\infty} [F_Y (t) - F_X (t)]\ dt\)
d. if \(X \ge 0\) is integrable, then
\(\sum_{n = 0}^{\infty} P(X \ge n + 1) \le E[X] \le \sum_{n = 0}^{\infty} P(X \ge n) \le N \sum_{k = 0}^{\infty} P(X \ge kN)\), for all \(N \ge 1\)
e. If integrable \(X \ge 0\) is integer-valued, then
\(E[X] = \sum_{n = 1}^{\infty} P(X \ge n) = \sum_{n = 0}^{\infty} P(X > n) E[X^2] = \sum_{n = 1}^{\infty} (2n - 1) P(X \ge n) = \sum_{n = 0}^{\infty} (2n + 1) P(X > n)\)
f. If \(Q\) is the quantile function for \(F_X\), then \(E[g(X)] = \int_{0}^{1} g[Q(u)]\ du\)