In probability theory, the conditional expectation of a random variable is another random variable equal to the average of the former over each possible "condition". In the case when the random variable is defined over a discrete probability space, the "conditions" are a partition of this probability space. This definition is then generalized to any probability space using measure theory.
Conditional expectation is also known as conditional expected value or conditional mean.
In modern probability theory the concept of conditional probability is defined in terms of conditional expectation.
- 1 Concept
- 2 History
- 3 Classical definition
- 4 Formal definition
- 5 Conditioning as factorization
- 6 Computation
- 7 Basic properties
- 8 See also
- 9 Notes
- 10 References
- 11 External links
The concept of conditional probability can be nicely illustrated through the following example. Suppose we have daily rainfall data (mm of rain each day) collected by a weather station on every day of the ten year period from Jan 1, 1990 to Dec 31, 1999. The conditional expectation of daily rainfall knowing the month of the year is the average of daily rainfall over all days of the ten year period that fall in a given month. This data then may be considered either as function of each day (so for example its value for Mar 3, 1992 would be the sum of daily rainfalls on all days that are in a month of March during the ten years, divided by the number of these days which is 310) or as a function of just the month (so for example the value for March would be equal to the value of the previous example).
It is important to note the following.
- The conditional expectation of daily rainfall knowing that we are in a month of March of the given ten years is not a monthly rainfall data, that is it is not the average of the ten monthly total March rainfalls. That number would be 31 times higher.
- The average daily rainfall in March 1992 is not equal to the conditional expectation of daily rainfall knowing that we are in a month of March of the given ten years, because we have restricted ourselves to 1992, that is we have more conditions than just that of being in March. This shows that reasoning as "we are in March 1992, so I know we are in March, so the average daily rainfall is the March average daily rainfall" is incorrect. Stated differently, although we use the expression "conditional expectation knowing that we are in March" this really means "conditional expectation knowing nothing else than that we are in March".
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. In works of Paul Halmos 1950 and Joseph L. Doob 1953 conditional expectation was generalized to its now usual definition using sub-sigma-algebras.
Conditional expectation with respect to an event
In classical probability theory the conditional expectation of X given an event H (which may be the event Y=y for a random variable Y) is the average of X over all outcomes in H, that is
The sum above can be grouped by different values of , to get a sum over the range of X
In modern probability theory, when H is an event with strictly positive probability, it is possible to give a similar formula. This is notably the case for a discrete random variable Y and for y in the range of Y if the event H is Y=y. Let be a probability space, X a random variable on that probability space, and an event with strictly positive probability . Then the conditional expectation of X given the event H is
where is the range of X and is the conditional probability of A knowing H.
When P(H) = 0 (for instance if Y is a continuous random variable and H is the event Y=y, this is in general the case), the Borel–Kolmogorov paradox demonstrates the ambiguity of attempting to define the conditional probability knowing the event H. The above formula shows that this problem transposes to the conditional expectation. So instead one only defines the conditional expectation with respect to a sigma-algebra or a random variable.
Conditional expectation with respect to a random variable
If Y is a discrete random variable with range , then we can define on the function
Sometimes this function is called the conditional expectation of X with respect to Y. In fact, according to the modern definition, it is that is called the conditional expectation of X with respect to Y, so that we have
which is a random variable. As mentioned above, if Y is a continuous random variable, it is not possible to define by this method. However the modern definition does define as a random variable.
Conditional expectation with respect to a sigma-algebra
Consider the following
Then a conditional expectation of X given , denoted as , is any -measurable function () which satisfies:
The existence of can be established by noting that for is a measure on that is absolutely continuous with respect to . Furthermore, if is the natural injection from to then is the restriction of to and is the restriction of to and is absolutely continuous with respect to since . Thus, we have
where the derivatives are Radon–Nikodym derivatives of measures.
Conditional expectation with respect to a random variable
Consider further to the above
- is a measurable space
- is a random variable
Then for any -measurable function which satisfies:
the random variable , denoted as , is a conditional expectation of X given .
This definition is equivalent to defining the conditional expectation using the pre-image of Σ with respect to Y. If we define
A couple of points worth noting about the definition:
- This is not a constructive definition; we are merely given the required property that a conditional expectation must satisfy.
- The definition of may resemble that of but these are very different objects, the former being a -measurable function , while the latter is an element of for fixed , or a function if considered as the function .
- Existence of a conditional expectation function is determined by the Radon–Nikodym theorem, a sufficient condition is that the (unconditional) expected value for X exist.
- 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 controls the "granularity" of the conditioning. A conditional expectation over a finer-grained σ-algebra will allow us to condition on a wider variety of events.
Conditioning as factorization
In the definition of conditional expectation that we provided above, the fact that Y is a real random variable is irrelevant: Let U be a measurable space, that is, a set equipped with a σ-algebra of subsets. A U-valued random variable is a function such that for any measurable subset of U.
We consider the measure Q on U given as above: Q(B) = P(Y−1(B)) for every measurable subset B of U. Then Q is a probability measure on the measurable space U defined on its σ-algebra of measurable sets.
Theorem. If X is an integrable random variable on Ω then there is one and, up to equivalence a.e. relative to Q, only one integrable function g on U, which is written or , such that for any measurable subset B of U:
There are a number of ways of proving this; one as suggested above, is to note that the expression on the left hand side defines, as a function of the set B, a countably additive signed measure μ on the measurable subsets of U. Moreover, this measure μ is absolutely continuous relative to Q. Indeed Q(B) = 0 means exactly that Y−1(B) has probability 0. The integral of an integrable function on a set of probability 0 is itself 0. This proves absolute continuity. Then the Radon–Nikodym theorem provides the function g, equal to the density of μ with respect to Q.
The defining condition of conditional expectation then is the equation
and it holds that
We can further interpret this equality by considering the abstract change of variables formula to transport the integral on the right hand side to an integral over Ω:
The equation means that the integrals of X and the composition over sets of the form Y−1(B), for B a measurable subset of U, are identical.
This equation can be interpreted to say that the following diagram is commutative in the average.
When X and Y are both discrete random variables, then the conditional expectation of X given the event Y=y can be considered as function of y for y in the range of Y
where is the range of X.
If X is a continuous random variable, while Y remains a discrete variable, the conditional expectation is:
All the following formulas are to be understood in an almost sure sense. The sigma-algebra could be replaced by a random variable
- Pulling out independent factors:
- If is independent of , then .
The proof is done when is a continuous variable, denoted Y:
- If is independent of and of , then .
- If are independent, are independent, is independent of and is independent of , then
- If is -measurable, then .
- If Z is a random variable, then and in its simplest form:
- Pulling out known factors:
- If is -measurable, then .
- If Z is a random variable, then
- Tower property: for sub-σ-Algebras we have .
- A special case is when Z is a -measurable random variable. Then and thus
- Doob martingale property: the above with (which is -measurable), and using also , gives .
- Linearity: we have and for .
- Positivity: If then .
- Monotonicity: If then .
- Monotone convergence: If and then .
- Dominated convergence: If and with then .
- Fatou's lemma: If then .
- 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
- Martingale convergence: For a random variable , that has finite expectation, we have , if either is an increasing series of sub-σ-Algebras and or if is a decreasing series of sub-σ-Algebras and .
- Conditional expectation as -projection: If are in the Hilbert space of square-integrable real random variables (real random variables with finite second moment) then
- for -measurable we have , i.e. the conditional expectation is in the sense of the L2(P) scalar product the orthogonal projection from to the linear subspace of -measurable functions. (This allows to define and prove the existence of the conditional expectation based on the Hilbert projection theorem.)
- the mapping is self-adjoint:
- Non-commutative conditional expectation
- Law of total probability
- Law of total expectation
- Law of total variance
- Law of total cumulance (generalizes the other three)
- Conditioning (probability)
- Joint probability distribution
- Disintegration theorem
- Kolmogorov, Andrey (1933). Grundbegriffe der Wahrscheinlichkeitsrechnung (in German). Berlin: Julius Springer. p. 46.[page needed]
- 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.
- J. L. Doob (1953). Stochastic Processes. John Wiley & Sons. ISBN 0-471-52369-0.
- Olav Kallenberg: Foundations of Modern Probability. 2. edition. Springer, New York 2002, ISBN 0-387-95313-2, S. 573.
- Loève, Michel (1978). "Chapter 27. Concept of Conditioning". Probability Theory vol. II (4th ed.). Springer. ISBN 0-387-90262-7.[page needed]
||This article includes a list of references, but its sources remain unclear because it has insufficient inline citations. (November 2010)|
- 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 needed]
- Grimmett, Geoffrey; Stirzaker, David (2001). Probability and Random Processes (3rd ed.). Oxford University Press. ISBN 0-19-857222-0., pages 67–69