Basic Prerequisites: 02 · Probability Spaces & Filtrations and 03 · Distributions & Expectation.


1. Intuition & Practical Objective

Conditional expectation answers: “given everything I know at time , what is my best guess for the future value ?” It is not a number - it is a random variable that is measurable w.r.t. the available information . On a finite (coin-toss) space it reduces to averaging over the atoms of : for each piece of history, average over all continuations sharing that history (Shreve I §2.3). The measure-theoretic definition replaces this with partial averaging so it works even when the conditioning event has probability zero.

The practical objective: understand the four faces - (1) partial averaging as the defining property; (2) the five properties (linearity, taking-out-what-is-known, tower, independence, conditional Jensen) that make it the pricing tool; (3) the conditional density / bivariate-normal closed form ; (4) the fact that it is the orthogonal projection onto - the exact reason it is the regression function of ESL Ch 2.


2. Mathematical Ground Truth & Derivations

2.1 Partial averaging definition (Shreve II Def 2.3.1; Shreve I §2.3)

Given sub--algebra , is the unique (up to a.s.) random variable that is -measurable and satisfies

Existence is a corollary of the Radon–Nikodym theorem (Shreve I §9.5). On a finite space with atoms, average of over the atom containing .

2.2 The five properties (Shreve II Thm 2.3.2, eqs 2.3.18–2.3.22)

  • (i) Linearity .
  • (ii) Taking out what is known - -measurable .
  • (iii) Tower - .
  • (iv) Independence - independent of .
  • (v) Conditional Jensen - convex .

Property (ii) is what lets you pull a known stock price out of a conditional pricing formula; the tower property is what makes backward induction in trees work; (iv) is how the Independence Lemma yields the Markov property of Brownian motion (Shreve II Lemma 2.3.4, §3.5).

2.3 Conditional densities & the bivariate normal (Shreve I Ch 11)

With joint density and marginal , the conditional density is and with . For bivariate normal (Shreve I Ex 11.1):

This is the best linear/unbiased square-error estimator of from (Shreve I §11, verified p-129/130).

2.4 projection & the regression function (Shreve II Def 2.3.1; ESL Ch 2)

is the orthogonal projection of onto the subspace of -measurable square-integrable variables: the residual is orthogonal to every -measurable , . This is precisely why the optimal predictor in the mean-square sense is the conditional expectation (ESL eq. 2.13), and why the regression MSE decomposes as - the first term is the irreducible noise, the second the reducible part explained by (ESL eq. 2.46).


3. Computational Implementation - verify partial-averaging/tower and the normal conditional mean

Simulate a bivariate normal, bin by , and check that the empirical conditional mean tracks ; verify that the predictor beats the constant predictor. Stdlib only.


4. Failure Modes & First-Principles Breakdowns

  1. "" is undefined by the schoolbook ratio. divides by zero for a zero-probability conditioning event; only partial averaging over the whole -algebra survives (Shreve II §2.3; Shreve I §9.5 existence via Radon–Nikodym).
  2. Treating conditional expectation as a number, not a random variable. is a function of the path (measurable w.r.t. ), so it varies across atoms. Writing it as a scalar loses the information-dependence that makes it a martingale’s engine.
  3. Believing “best linear” = “best.” is the best among linear (and normal) estimators; for non-normal, non-linear dependencies a different function of can beat it. Optimality requires the full conditional expectation (ESL eq. 2.13).
  4. Tower property misdirection. requires ; conditioning in the wrong order or on a finer -algebra first quietly breaks backward induction.

5. References

  • Shreve, Stochastic Calculus for Finance II
  • Shreve, Stochastic Calculus for Finance I
  • ESL (Hastie, Tibshirani, Friedman)
  • Williams, Probability with Martingales

6. Connected Graph Bridges