Conditional expectation

From HandWiki
Short description: Expected value of a random variable given that certain conditions are known to occur


In probability theory, the conditional expectation, conditional expected value, or conditional mean of a random variable is its expected value – the value it would take “on average” over an arbitrarily large number of occurrences – given that a certain set of "conditions" is known to occur. If the random variable can take on only a finite number of values, the “conditions” are that the variable can only take on a subset of those values. More formally, in the case when the random variable is defined over a discrete probability space, the "conditions" are a partition of this probability space.

Depending on the context, the conditional expectation can be either a random variable or a function. The random variable is denoted [math]\displaystyle{ E(X\mid Y) }[/math] analogously to conditional probability. The function form is either denoted [math]\displaystyle{ E(X\mid Y=y) }[/math] or a separate function symbol such as [math]\displaystyle{ f(y) }[/math] is introduced with the meaning [math]\displaystyle{ E(X\mid Y) = f(Y) }[/math].

Examples

Example 1: Dice rolling

Consider the roll of a fair die and let A = 1 if the number is even (i.e., 2, 4, or 6) and A = 0 otherwise. Furthermore, let B = 1 if the number is prime (i.e., 2, 3, or 5) and B = 0 otherwise.

1 2 3 4 5 6
A 0 1 0 1 0 1
B 0 1 1 0 1 0

The unconditional expectation of A is [math]\displaystyle{ E[A] = (0+1+0+1+0+1)/6 = 1/2 }[/math], but the expectation of A conditional on B = 1 (i.e., conditional on the die roll being 2, 3, or 5) is [math]\displaystyle{ E[A\mid B=1]=(1+0+0)/3=1/3 }[/math], and the expectation of A conditional on B = 0 (i.e., conditional on the die roll being 1, 4, or 6) is [math]\displaystyle{ E[A\mid B=0]=(0+1+1)/3=2/3 }[/math]. Likewise, the expectation of B conditional on A = 1 is [math]\displaystyle{ E[B\mid A=1]= (1+0+0)/3=1/3 }[/math], and the expectation of B conditional on A = 0 is [math]\displaystyle{ E[B\mid A=0]=(0+1+1)/3=2/3 }[/math].

Example 2: Rainfall data

Suppose we have daily rainfall data (mm of rain each day) collected by a weather station on every day of the ten–year (3652–day) period from January 1, 1990 to December 31, 1999. The unconditional expectation of rainfall for an unspecified day is the average of the rainfall amounts for those 3652 days. The conditional expectation of rainfall for an otherwise unspecified day known to be (conditional on being) in the month of March, is the average of daily rainfall over all 310 days of the ten–year period that falls in March. And the conditional expectation of rainfall conditional on days dated March 2 is the average of the rainfall amounts that occurred on the ten days with that specific date.

History

The related concept of conditional probability dates back at least to Laplace, who calculated conditional distributions. It was Andrey Kolmogorov who, in 1933, formalized it using the Radon–Nikodym theorem.[1] In works of Paul Halmos[2] and Joseph L. Doob[3] from 1953, conditional expectation was generalized to its modern definition using sub-σ-algebras.[4]

Definitions

Conditioning on an event

If A is an event in [math]\displaystyle{ \mathcal{F} }[/math] with nonzero probability, and X is a discrete random variable, the conditional expectation of X given A is

[math]\displaystyle{ \begin{aligned} \operatorname{E} (X \mid A) &= \sum_x x P(X = x \mid A) \\ & =\sum_x x \frac{P(\{X = x\} \cap A)}{P(A)} \end{aligned} }[/math]

where the sum is taken over all possible outcomes of X.

Note that if [math]\displaystyle{ P(A) = 0 }[/math], the conditional expectation is undefined due to the division by zero.

Discrete random variables

If X and Y are discrete random variables, the conditional expectation of X given Y is

[math]\displaystyle{ \begin{aligned} \operatorname{E} (X \mid Y=y) &= \sum_x x P(X = x \mid Y = y) \\ &= \sum_x x \frac{P(X = x, Y = y)}{P(Y=y)} \end{aligned} }[/math]

where [math]\displaystyle{ P(X = x, Y = y) }[/math] is the joint probability mass function of X and Y. The sum is taken over all possible outcomes of X.

Note that conditioning on a discrete random variable is the same as conditioning on the corresponding event:

[math]\displaystyle{ \operatorname{E} (X \mid Y=y) = \operatorname{E} (X \mid A) }[/math]

where A is the set [math]\displaystyle{ \{ Y = y \} }[/math].

Continuous random variables

Let [math]\displaystyle{ X }[/math] and [math]\displaystyle{ Y }[/math] be continuous random variables with joint density [math]\displaystyle{ f_{X,Y}(x,y), }[/math] [math]\displaystyle{ Y }[/math]'s density [math]\displaystyle{ f_{Y}(y), }[/math] and conditional density [math]\displaystyle{ \textstyle f_{X|Y}(x|y) = \frac{ f_{X,Y}(x,y) }{f_{Y}(y)} }[/math] of [math]\displaystyle{ X }[/math] given the event [math]\displaystyle{ Y=y. }[/math] The conditional expectation of [math]\displaystyle{ X }[/math] given [math]\displaystyle{ Y=y }[/math] is

[math]\displaystyle{ \begin{aligned} \operatorname{E} (X \mid Y=y) &= \int_{-\infty}^\infty x f_{X|Y}(x|y) \mathrm{d}x \\ &= \frac{1}{f_{Y}(y)}\int_{-\infty}^\infty x f_{X,Y}(x,y) \mathrm{d}x. \end{aligned} }[/math]

When the denominator is zero, the expression is undefined.

Note that conditioning on a continuous random variable is not the same as conditioning on the event [math]\displaystyle{ \{ Y = y \} }[/math] as it was in the discrete case. For a discussion, see Conditioning on an event of probability zero. Not respecting this distinction can lead to contradictory conclusions as illustrated by the Borel-Kolmogorov paradox.

L2 random variables

All random variables in this section are assumed to be in [math]\displaystyle{ L^2 }[/math], that is square integrable. In its full generality, conditional expectation is developed without this assumption, see below under Conditional expectation with respect to a sub-σ-algebra. The [math]\displaystyle{ L^2 }[/math] theory is, however, considered more intuitive[5] and admits important generalizations. In the context of [math]\displaystyle{ L^2 }[/math] random variables, conditional expectation is also called regression.

In what follows let [math]\displaystyle{ (\Omega, \mathcal{F}, P) }[/math] be a probability space, and [math]\displaystyle{ X: \Omega \to \mathbb{R} }[/math] in [math]\displaystyle{ L^2 }[/math] with mean [math]\displaystyle{ \mu_X }[/math] and variance [math]\displaystyle{ \sigma_X^2 }[/math]. The expectation [math]\displaystyle{ \mu_X }[/math] minimizes the mean squared error:

[math]\displaystyle{ \min_{x \in \mathbb{R}} \operatorname{E}\left((X - x)^2\right) = \operatorname{E}\left((X - \mu_X)^2\right) = \sigma_X^2 }[/math].

The conditional expectation of X is defined analogously, except instead of a single number [math]\displaystyle{ \mu_X }[/math], the result will be a function [math]\displaystyle{ e_X(y) }[/math]. Let [math]\displaystyle{ Y: \Omega \to \mathbb{R}^n }[/math] be a random vector. The conditional expectation [math]\displaystyle{ e_X: \mathbb{R}^n \to \mathbb{R} }[/math] is a measurable function such that

[math]\displaystyle{ \min_{g \text{ measurable }} \operatorname{E}\left((X - g(Y))^2\right) = \operatorname{E}\left((X - e_X(Y))^2\right) }[/math].

Note that unlike [math]\displaystyle{ \mu_X }[/math], the conditional expectation [math]\displaystyle{ e_X }[/math] is not generally unique: there may be multiple minimizers of the mean squared error.

Uniqueness

Example 1: Consider the case where Y is the constant random variable that's always 1. Then the mean squared error is minimized by any function of the form

[math]\displaystyle{ e_X(y) = \begin{cases} \mu_X & \text{ if } y = 1 \\ \text{any number} & \text{ otherwise} \end{cases} }[/math]

Example 2: Consider the case where Y is the 2-dimensional random vector [math]\displaystyle{ (X, 2X) }[/math]. Then clearly

[math]\displaystyle{ \operatorname{E}(X \mid Y) = X }[/math]

but in terms of functions it can be expressed as [math]\displaystyle{ e_X(y_1, y_2) = 3y_1-y_2 }[/math] or [math]\displaystyle{ e'_X(y_1, y_2) = y_2 - y_1 }[/math] or infinitely many other ways. In the context of linear regression, this lack of uniqueness is called multicollinearity.

Conditional expectation is unique up to a set of measure zero in [math]\displaystyle{ \mathbb{R}^n }[/math]. The measure used is the pushforward measure induced by Y.

In the first example, the pushforward measure is a Dirac distribution at 1. In the second it is concentrated on the "diagonal" [math]\displaystyle{ \{ y : y_2 = 2 y_1 \} }[/math], so that any set not intersecting it has measure 0.

Existence

The existence of a minimizer for [math]\displaystyle{ \min_g \operatorname{E}\left((X - g(Y))^2\right) }[/math] is non-trivial. It can be shown that

[math]\displaystyle{ M := \{ g(Y) : g \text{ is measurable and }\operatorname{E}(g(Y)^2) \lt \infty \} = L^2(\Omega, \sigma(Y)) }[/math]

is a closed subspace of the Hilbert space [math]\displaystyle{ L^2(\Omega) }[/math].[6] By the Hilbert projection theorem, the necessary and sufficient condition for [math]\displaystyle{ e_X }[/math] to be a minimizer is that for all [math]\displaystyle{ f(Y) }[/math] in M we have

[math]\displaystyle{ \langle X - e_X(Y), f(Y) \rangle = 0 }[/math].

In words, this equation says that the residual [math]\displaystyle{ X - e_X(Y) }[/math] is orthogonal to the space M of all functions of Y. This orthogonality condition, applied to the indicator functions [math]\displaystyle{ f(Y) = 1_{Y \in H} }[/math], is used below to extend conditional expectation to the case that X and Y are not necessarily in [math]\displaystyle{ L^2 }[/math].

Connections to regression

The conditional expectation is often approximated in applied mathematics and statistics due to the difficulties in analytically calculating it, and for interpolation.[7]

The Hilbert subspace

[math]\displaystyle{ M = \{ g(Y) : \operatorname{E}(g(Y)^2) \lt \infty \} }[/math]

defined above is replaced with subsets thereof by restricting the functional form of g, rather than allowing any measureable function. Examples of this are decision tree regression when g is required to be a simple function, linear regression when g is required to be affine, etc.

These generalizations of conditional expectation come at the cost of many of its properties no longer holding. For example, let M be the space of all linear functions of Y and let [math]\displaystyle{ \mathcal{E}_{M} }[/math] denote this generalized conditional expectation/[math]\displaystyle{ L^2 }[/math] projection. If [math]\displaystyle{ M }[/math] does not contain the constant functions, the tower property [math]\displaystyle{ \operatorname{E}(\mathcal{E}_M(X)) = \operatorname{E}(X) }[/math] will not hold.

An important special case is when X and Y are jointly normally distributed. In this case it can be shown that the conditional expectation is equivalent to linear regression:

[math]\displaystyle{ e_X(Y) = \alpha_0 + \sum_i \alpha_i Y_i }[/math]

for coefficients [math]\displaystyle{ \{\alpha_i\}_{i = 0..n} }[/math] described in Multivariate normal distribution.

Conditional expectation with respect to a sub-σ-algebra

Conditional expectation with respect to a σ-algebra: in this example the probability space [math]\displaystyle{ (\Omega, \mathcal{F}, P) }[/math] is the [0,1] interval with the Lebesgue measure. We define the following σ-algebras: [math]\displaystyle{ \mathcal{A} = \mathcal{F} }[/math]; [math]\displaystyle{ \mathcal{B} }[/math] is the σ-algebra generated by the intervals with end-points 0, ¼, ½, ¾, 1; and [math]\displaystyle{ \mathcal{C} }[/math] is the σ-algebra generated by the intervals with end-points 0, ½, 1. Here the conditional expectation is effectively the average over the minimal sets of the σ-algebra.

Consider the following:

  • [math]\displaystyle{ (\Omega, \mathcal{F}, P) }[/math] is a probability space.
  • [math]\displaystyle{ X\colon\Omega \to \mathbb{R}^n }[/math] is a random variable on that probability space with finite expectation.
  • [math]\displaystyle{ \mathcal{H} \subseteq \mathcal{F} }[/math] is a sub-σ-algebra of [math]\displaystyle{ \mathcal{F} }[/math].

Since [math]\displaystyle{ \mathcal{H} }[/math] is a sub [math]\displaystyle{ \sigma }[/math]-algebra of [math]\displaystyle{ \mathcal{F} }[/math], the function [math]\displaystyle{ X\colon\Omega \to \mathbb{R}^n }[/math] is usually not [math]\displaystyle{ \mathcal{H} }[/math]-measurable, thus the existence of the integrals of the form [math]\displaystyle{ \int_H X \,dP|_\mathcal{H} }[/math], where [math]\displaystyle{ H\in\mathcal{H} }[/math] and [math]\displaystyle{ P|_\mathcal{H} }[/math] is the restriction of [math]\displaystyle{ P }[/math] to [math]\displaystyle{ \mathcal{H} }[/math], cannot be stated in general. However, the local averages [math]\displaystyle{ \int_H X\,dP }[/math] can be recovered in [math]\displaystyle{ (\Omega, \mathcal{H}, P|_\mathcal{H}) }[/math] with the help of the conditional expectation. A conditional expectation of X given [math]\displaystyle{ \mathcal{H} }[/math], denoted as [math]\displaystyle{ \operatorname{E}(X\mid\mathcal{H}) }[/math], is any [math]\displaystyle{ \mathcal{H} }[/math]-measurable function [math]\displaystyle{ \Omega \to \mathbb{R}^n }[/math] which satisfies:

[math]\displaystyle{ \int_H \operatorname{E}(X \mid \mathcal{H}) \,\mathrm{d}P = \int_H X \,\mathrm{d}P }[/math]

for each [math]\displaystyle{ H \in \mathcal{H} }[/math].[8]

As noted in the [math]\displaystyle{ L^2 }[/math] discussion, this is condition equivalent to saying that the residual [math]\displaystyle{ X - \operatorname{E}(X \mid \mathcal{H}) }[/math] be orthogonal to the indicator functions [math]\displaystyle{ 1_H }[/math]:

[math]\displaystyle{ \langle X - \operatorname{E}(X \mid \mathcal{H}), 1_H \rangle = 0 }[/math]

Existence

The existence of [math]\displaystyle{ \operatorname{E}(X\mid\mathcal{H}) }[/math] can be established by noting that [math]\displaystyle{ \mu^X\colon F \mapsto \int_F X \, \mathrm{d}P }[/math] for [math]\displaystyle{ F \in \mathcal{F} }[/math] is a finite measure on [math]\displaystyle{ (\Omega, \mathcal{F}) }[/math] that is absolutely continuous with respect to [math]\displaystyle{ P }[/math]. If [math]\displaystyle{ h }[/math] is the natural injection from [math]\displaystyle{ \mathcal{H} }[/math] to [math]\displaystyle{ \mathcal{F} }[/math], then [math]\displaystyle{ \mu^X \circ h = \mu^X|_\mathcal{H} }[/math] is the restriction of [math]\displaystyle{ \mu^X }[/math] to [math]\displaystyle{ \mathcal{H} }[/math] and [math]\displaystyle{ P \circ h = P|_\mathcal{H} }[/math] is the restriction of [math]\displaystyle{ P }[/math] to [math]\displaystyle{ \mathcal{H} }[/math]. Furthermore, [math]\displaystyle{ \mu^X \circ h }[/math] is absolutely continuous with respect to [math]\displaystyle{ P \circ h }[/math], because the condition

[math]\displaystyle{ P \circ h (H) = 0 \iff P(h(H)) = 0 }[/math]

implies

[math]\displaystyle{ \mu^X(h(H)) = 0 \iff \mu^X \circ h(H) = 0. }[/math]

Thus, we have

[math]\displaystyle{ \operatorname{E}(X\mid\mathcal{H}) = \frac{\mathrm{d}\mu^X|_\mathcal{H}}{\mathrm{d}P|_\mathcal{H}} = \frac{\mathrm{d}(\mu^X \circ h)}{\mathrm{d}(P \circ h)}, }[/math]

where the derivatives are Radon–Nikodym derivatives of measures.

Conditional expectation with respect to a random variable

Consider, in addition to the above,

  • A measurable space [math]\displaystyle{ (U, \Sigma) }[/math], and
  • A random variable [math]\displaystyle{ Y\colon\Omega \to U }[/math].

The conditional expectation of X given Y is defined by applying the above construction on the σ-algebra generated by Y:

[math]\displaystyle{ \operatorname{E}[X|Y] := \operatorname{E}[X|\sigma(Y)] }[/math].

By the Doob-Dynkin lemma, there exists a function [math]\displaystyle{ e_X \colon U \to \mathbb{R}^n }[/math] such that

[math]\displaystyle{ \operatorname{E}[X|Y] = e_X(Y) }[/math].

Discussion

  • This is not a constructive definition; we are merely given the required property that a conditional expectation must satisfy.
    • The definition of [math]\displaystyle{ \operatorname{E}(X \mid \mathcal{H}) }[/math] may resemble that of [math]\displaystyle{ \operatorname{E}(X \mid H) }[/math] for an event [math]\displaystyle{ H }[/math] but these are very different objects. The former is a [math]\displaystyle{ \mathcal{H} }[/math]-measurable function [math]\displaystyle{ \Omega \to \mathbb{R}^n }[/math], while the latter is an element of [math]\displaystyle{ \mathbb{R}^n }[/math] and [math]\displaystyle{ \operatorname{E}(X \mid H)\ P(H)= \int_H X \,\mathrm{d}P= \int_H \operatorname{E} (X\mid\mathcal{H})\,\mathrm{d}P }[/math] for [math]\displaystyle{ H\in\mathcal{H} }[/math].
    • Uniqueness can be shown to be almost sure: that is, versions of the same conditional expectation will only differ on a set of probability zero.
  • The σ-algebra [math]\displaystyle{ \mathcal{H} }[/math] controls the "granularity" of the conditioning. A conditional expectation [math]\displaystyle{ E(X\mid\mathcal{H}) }[/math] over a finer (larger) σ-algebra [math]\displaystyle{ \mathcal{H} }[/math] retains information about the probabilities of a larger class of events. A conditional expectation over a coarser (smaller) σ-algebra averages over more events.

Conditional probability

Main page: Regular conditional probability

For a Borel subset B in [math]\displaystyle{ \mathcal{B}(\mathbb{R}^n) }[/math], one can consider the collection of random variables

[math]\displaystyle{ \kappa_\mathcal{H}(\omega, B) := \operatorname{E}(1_{X \in B}|\mathcal{H})(\omega) }[/math].

It can be shown that they form a Markov kernel, that is, for almost all [math]\displaystyle{ \omega }[/math], [math]\displaystyle{ \kappa_\mathcal{H}(\omega, -) }[/math] is a probability measure.[9]

The Law of the unconscious statistician is then

[math]\displaystyle{ \operatorname{E}[f(X)|\mathcal{H}] = \int f(x) \kappa_\mathcal{H}(-, \mathrm{d}x) }[/math].

This shows that conditional expectations are, like their unconditional counterparts, integrations, against a conditional measure.

Basic properties

All the following formulas are to be understood in an almost sure sense. The σ-algebra [math]\displaystyle{ \mathcal{H} }[/math] could be replaced by a random variable [math]\displaystyle{ Z }[/math], i.e. [math]\displaystyle{ \mathcal{H}=\sigma(Z) }[/math].

  • Pulling out independent factors:
    • If [math]\displaystyle{ X }[/math] is independent of [math]\displaystyle{ \mathcal{H} }[/math], then [math]\displaystyle{ E(X\mid\mathcal{H}) = E(X) }[/math].
Proof

Let [math]\displaystyle{ B \in \mathcal{H} }[/math]. Then [math]\displaystyle{ X }[/math] is independent of [math]\displaystyle{ 1_B }[/math], so we get that

[math]\displaystyle{ \int_B X\,dP = E(X1_B) = E(X)E(1_B) = E(X)P(B) = \int_B E(X)\,dP. }[/math]

Thus the definition of conditional expectation is satisfied by the constant random variable [math]\displaystyle{ E(X) }[/math], as desired.

    • If [math]\displaystyle{ X }[/math] is independent of [math]\displaystyle{ \sigma(Y, \mathcal{H}) }[/math], then [math]\displaystyle{ E(XY\mid \mathcal{H}) = E(X) \, E(Y\mid\mathcal{H}) }[/math]. Note that this is not necessarily the case if [math]\displaystyle{ X }[/math] is only independent of [math]\displaystyle{ \mathcal{H} }[/math] and of [math]\displaystyle{ Y }[/math].
    • If [math]\displaystyle{ X,Y }[/math] are independent, [math]\displaystyle{ \mathcal{G},\mathcal{H} }[/math] are independent, [math]\displaystyle{ X }[/math] is independent of [math]\displaystyle{ \mathcal{H} }[/math] and [math]\displaystyle{ Y }[/math] is independent of [math]\displaystyle{ \mathcal{G} }[/math], then [math]\displaystyle{ E(E(XY\mid\mathcal{G})\mid\mathcal{H}) = E(X) E(Y) = E(E(XY\mid\mathcal{H})\mid\mathcal{G}) }[/math].
  • Stability:
    • If [math]\displaystyle{ X }[/math] is [math]\displaystyle{ \mathcal{H} }[/math]-measurable, then [math]\displaystyle{ E(X\mid\mathcal{H}) = X }[/math].
    • In particular, for sub-σ-algebras [math]\displaystyle{ \mathcal{H}_1\subset\mathcal{H}_2 \subset\mathcal{F} }[/math] we have [math]\displaystyle{ E(E(X\mid\mathcal{H}_1)\mid\mathcal{H}_2) = E(X\mid\mathcal{H}_1) }[/math].
    • If Z is a random variable, then [math]\displaystyle{ \operatorname{E}(f(Z) \mid Z)=f(Z) }[/math]. In its simplest form, this says [math]\displaystyle{ \operatorname{E}(Z \mid Z)=Z }[/math].
  • Pulling out known factors:
    • If [math]\displaystyle{ X }[/math] is [math]\displaystyle{ \mathcal{H} }[/math]-measurable, then [math]\displaystyle{ E(XY\mid\mathcal{H}) = X \, E(Y\mid\mathcal{H}) }[/math].
    • If Z is a random variable, then [math]\displaystyle{ \operatorname{E}(f(Z) Y \mid Z)=f(Z)\operatorname{E}(Y \mid Z) }[/math].
  • Law of total expectation: [math]\displaystyle{ E(E(X \mid \mathcal{H})) = E(X) }[/math].[10]
  • Tower property:
    • For sub-σ-algebras [math]\displaystyle{ \mathcal{H}_1\subset\mathcal{H}_2 \subset\mathcal{F} }[/math] we have [math]\displaystyle{ E(E(X\mid\mathcal{H}_2)\mid\mathcal{H}_1) = E(X\mid\mathcal{H}_1) }[/math].
      • A special case [math]\displaystyle{ \mathcal{H}_1=\{\emptyset, \Omega\} }[/math] recovers the Law of total expectation: [math]\displaystyle{ E(E(X\mid\mathcal{H}_1) ) = E(X ) }[/math].
      • A special case is when Z is a [math]\displaystyle{ \mathcal{H} }[/math]-measurable random variable. Then [math]\displaystyle{ \sigma(Z) \subset \mathcal{H} }[/math] and thus [math]\displaystyle{ E(E(X \mid \mathcal{H}) \mid Z) = E(X \mid Z) }[/math].
      • Doob martingale property: the above with [math]\displaystyle{ Z = E(X \mid \mathcal{H}) }[/math] (which is [math]\displaystyle{ \mathcal{H} }[/math]-measurable), and using also [math]\displaystyle{ \operatorname{E}(Z \mid Z)=Z }[/math], gives [math]\displaystyle{ E(X \mid E(X \mid \mathcal{H})) = E(X \mid \mathcal{H}) }[/math].
    • For random variables [math]\displaystyle{ X,Y }[/math] we have [math]\displaystyle{ E(E(X\mid Y)\mid f(Y)) = E(X\mid f(Y)) }[/math].
    • For random variables [math]\displaystyle{ X,Y,Z }[/math] we have [math]\displaystyle{ E(E(X\mid Y,Z)\mid Y) = E(X\mid Y) }[/math].
  • Linearity: we have [math]\displaystyle{ E(X_1 + X_2 \mid \mathcal{H}) = E(X_1 \mid \mathcal{H}) + E(X_2 \mid \mathcal{H}) }[/math] and [math]\displaystyle{ E(a X \mid \mathcal{H}) = a\,E(X \mid \mathcal{H}) }[/math] for [math]\displaystyle{ a\in\R }[/math].
  • Positivity: If [math]\displaystyle{ X \ge 0 }[/math] then [math]\displaystyle{ E(X \mid \mathcal{H}) \ge 0 }[/math].
  • Monotonicity: If [math]\displaystyle{ X_1 \le X_2 }[/math] then [math]\displaystyle{ E(X_1 \mid \mathcal{H}) \le E(X_2 \mid \mathcal{H}) }[/math].
  • Monotone convergence: If [math]\displaystyle{ 0\leq X_n \uparrow X }[/math] then [math]\displaystyle{ E(X_n \mid \mathcal{H}) \uparrow E(X \mid \mathcal{H}) }[/math].
  • Dominated convergence: If [math]\displaystyle{ X_n \to X }[/math] and [math]\displaystyle{ |X_n| \le Y }[/math] with [math]\displaystyle{ Y \in L^1 }[/math], then [math]\displaystyle{ E(X_n \mid \mathcal{H}) \to E(X \mid \mathcal{H}) }[/math].
  • Fatou's lemma: If [math]\displaystyle{ \textstyle E(\inf_n X_n \mid \mathcal{H}) \gt -\infty }[/math] then [math]\displaystyle{ \textstyle E(\liminf_{n\to\infty} X_n \mid \mathcal{H}) \le \liminf_{n\to\infty} E(X_n \mid \mathcal{H}) }[/math].
  • Jensen's inequality: If [math]\displaystyle{ f \colon \mathbb{R} \rightarrow \mathbb{R} }[/math] is a convex function, then [math]\displaystyle{ f(E(X\mid \mathcal{H})) \le E(f(X)\mid\mathcal{H}) }[/math].
  • Conditional variance: Using the conditional expectation we can define, by analogy with the definition of the variance as the mean square deviation from the average, the conditional variance
    • Definition: [math]\displaystyle{ \operatorname{Var}(X \mid \mathcal{H}) = \operatorname{E}\bigl( (X - \operatorname{E}(X \mid \mathcal{H}))^2 \mid \mathcal{H} \bigr) }[/math]
    • Algebraic formula for the variance: [math]\displaystyle{ \operatorname{Var}(X \mid \mathcal{H}) = \operatorname{E}(X^2 \mid \mathcal{H}) - \bigl(\operatorname{E}(X \mid \mathcal{H})\bigr)^2 }[/math]
    • Law of total variance: [math]\displaystyle{ \operatorname{Var}(X) = \operatorname{E}(\operatorname{Var}(X \mid \mathcal{H})) + \operatorname{Var}(\operatorname{E}(X \mid \mathcal{H})) }[/math].
  • Martingale convergence: For a random variable [math]\displaystyle{ X }[/math], that has finite expectation, we have [math]\displaystyle{ E(X\mid\mathcal{H}_n) \to E(X\mid\mathcal{H}) }[/math], if either [math]\displaystyle{ \mathcal{H}_1 \subset \mathcal{H}_2 \subset \dotsb }[/math] is an increasing series of sub-σ-algebras and [math]\displaystyle{ \textstyle \mathcal{H} = \sigma(\bigcup_{n=1}^\infty \mathcal{H}_n) }[/math] or if [math]\displaystyle{ \mathcal{H}_1 \supset \mathcal{H}_2 \supset \dotsb }[/math] is a decreasing series of sub-σ-algebras and [math]\displaystyle{ \textstyle \mathcal{H} = \bigcap_{n=1}^\infty \mathcal{H}_n }[/math].
  • Conditional expectation as [math]\displaystyle{ L^2 }[/math]-projection: If [math]\displaystyle{ X,Y }[/math] are in the Hilbert space of square-integrable real random variables (real random variables with finite second moment) then
    • for [math]\displaystyle{ \mathcal{H} }[/math]-measurable [math]\displaystyle{ Y }[/math], we have [math]\displaystyle{ E(Y(X - E(X\mid\mathcal{H}))) = 0 }[/math], i.e. the conditional expectation [math]\displaystyle{ E(X\mid\mathcal{H}) }[/math] is in the sense of the L2(P) scalar product the orthogonal projection from [math]\displaystyle{ X }[/math] to the linear subspace of [math]\displaystyle{ \mathcal{H} }[/math]-measurable functions. (This allows to define and prove the existence of the conditional expectation based on the Hilbert projection theorem.)
    • the mapping [math]\displaystyle{ X \mapsto \operatorname{E}(X\mid\mathcal{H}) }[/math] is self-adjoint: [math]\displaystyle{ \operatorname E(X \operatorname E(Y \mid \mathcal{H})) = \operatorname E\left(\operatorname E(X \mid \mathcal{H}) \operatorname E(Y \mid \mathcal{H})\right) = \operatorname E(\operatorname E(X \mid \mathcal{H}) Y) }[/math]
  • Conditioning is a contractive projection of Lp spaces [math]\displaystyle{ L^p(\Omega, \mathcal{F}, P) \rightarrow L^p(\Omega, \mathcal{H}, P) }[/math]. I.e., [math]\displaystyle{ \operatorname{E}\big(|\operatorname{E}(X \mid\mathcal{H})|^p \big) \le \operatorname{E}\big(|X|^p\big) }[/math] for any p ≥ 1.
  • Doob's conditional independence property:[11] If [math]\displaystyle{ X,Y }[/math] are conditionally independent given [math]\displaystyle{ Z }[/math], then [math]\displaystyle{ P(X \in B\mid Y,Z) = P(X \in B\mid Z) }[/math] (equivalently, [math]\displaystyle{ E(1_{\{X \in B\}}\mid Y,Z) = E(1_{\{X \in B\}} \mid Z) }[/math]).

See also


Probability laws

Notes

  1. Kolmogorov, Andrey (1933) (in de). Grundbegriffe der Wahrscheinlichkeitsrechnung. Berlin: Julius Springer. p. 46. 
  2. Oxtoby, J. C. (1953). "Review: Measure theory, by P. R. Halmos". Bull. Amer. Math. Soc. 59 (1): 89–91. doi:10.1090/s0002-9904-1953-09662-8. https://www.ams.org/journals/bull/1953-59-01/S0002-9904-1953-09662-8/S0002-9904-1953-09662-8.pdf. 
  3. J. L. Doob (1953). Stochastic Processes. John Wiley & Sons. ISBN 0-471-52369-0. 
  4. Olav Kallenberg: Foundations of Modern Probability. 2. edition. Springer, New York 2002, ISBN:0-387-95313-2, p. 573.
  5. "probability - Intuition behind Conditional Expectation". https://math.stackexchange.com/a/23613/357269. 
  6. Brockwell, Peter J. (1991). Time series : theory and methods (2nd ed.). New York: Springer-Verlag. ISBN 978-1-4419-0320-4. 
  7. Hastie, Trevor. The elements of statistical learning : data mining, inference, and prediction (Second, corrected 7th printing ed.). New York. ISBN 978-0-387-84858-7. https://web.stanford.edu/~hastie/Papers/ESLII.pdf. 
  8. Billingsley, Patrick (1995). Probability and Measure (3rd ed.). John Wiley & Sons. p. 445. ISBN 0-471-00710-2. 
  9. Klenke, Achim. Probability theory : a comprehensive course (Second ed.). London. ISBN 978-1-4471-5361-0. 
  10. "Conditional expectation". https://www.statlect.com/fundamentals-of-probability/conditional-expectation. 
  11. Kallenberg, Olav (2001). Foundations of Modern Probability (2nd ed.). York, PA, USA: Springer. pp. 110. ISBN 0-387-95313-2. 

References

  • William Feller, An Introduction to Probability Theory and its Applications, vol 1, 1950, page 223
  • Paul A. Meyer, Probability and Potentials, Blaisdell Publishing Co., 1966, page 28
  • Grimmett, Geoffrey; Stirzaker, David (2001). Probability and Random Processes (3rd ed.). Oxford University Press. ISBN 0-19-857222-0. , pages 67–69

External links