Skip to content

Adam’s Law with Extra Conditioning

Theorem

For random variables XX, YY and ZZ with E∣Y∣<∞\mathbb{E}|Y|<\infty,

E[E[Y∣X,Z]∣Z]=E[Y∣Z].\begin{aligned} \mathbb{E}[\mathbb{E}[Y\mid X,Z]\mid Z]=\mathbb{E}[Y\mid Z]. \end{aligned}

This is Adam's Law with ZZ kept as background information. Conditioning on (X,Z)(X,Z) retains all the information in ZZ, and no independence assumption is needed.

Taking Y=𝟙1AY=\indicator_{A} for an event AA, letting XX encode a finite or countable partition {Bi}\{B_i\} and letting ZZ indicate an event CC gives LOTP with extra conditioning: once we condition on CC, we treat CC as the new background information and apply the ordinary LOTP inside that conditional world. Assume P(C)>0\mathbb{P}(C)>0 and omit terms with P(Bi∩C)=0\mathbb{P}(B_i\cap C)=0. For the remaining terms, P(A∣Bi,C)\mathbb{P}(A\mid B_i,C) means P(A∣Bi∩C)\mathbb{P}(A\mid B_i\cap C). The events BiB_i still form a partition, but all probabilities are now computed under the assumption that CC has occurred:

P(A∣C)=∑iP(A∣Bi,C)P(Bi∣C).\begin{aligned} \mathbb{P}(A\mid C) &= \sum_i \mathbb{P}(A\mid B_i,C)\mathbb{P}(B_i\mid C). \end{aligned}

Interpretation

Adam’s law still holds when some background information ZZ is kept fixed throughout: averaging the finer prediction E[Y∣X,Z]\mathbb{E}[Y\mid X,Z] over XX, with ZZ held fixed, gives the coarser prediction E[Y∣Z]\mathbb{E}[Y\mid Z]. The extra information is averaged out, the background is kept.

Three parallel lines against z: the predictions 1 + z and 3 + z for X = 1 and X = 3, and between them their average 2 + z, the prediction given Z alone.

Let Y=X+ZY=X+Z, where XX is independent of ZZ and takes 11 and 33 with equal probability. For each zz, the two blue lines 1+z1+z and 3+z3+z are the predictions E[Y∣X,Z]=X+Z\mathbb{E}[Y\mid X,Z]=X+Z, and the red line halfway between them is their average E[E[Y∣X,Z]∣Z]=E[Y∣Z]=2+Z\mathbb{E}[\mathbb{E}[Y\mid X,Z]\mid Z]=\mathbb{E}[Y\mid Z]=2+Z.

On both sides the result is a function of ZZ alone. Conditioning first on more information and then on less leaves the smaller information: for each value zz, the left side is ∑xE[Y∣X=x,Z=z] P(X=x∣Z=z)\displaystyle \sum_x\mathbb{E}[Y\mid X=x,Z=z]\,\mathbb{P}(X=x\mid Z=z) for discrete XX and ZZ. No independence is needed, but the weights are the conditional probabilities of XX given Z=zZ=z; in the figure they are 1/21/2 and 1/21/2 only because XX is independent of ZZ.

With ZZ constant the theorem is Adam’s law, and with indicators it becomes total probability with extra conditioning, as the Theorem explains.

Averaging over XX with its unconditional distribution is the usual slip. If X=ZX=Z and Y=XY=X, then E[Y∣X,Z]=Z\mathbb{E}[Y\mid X,Z]=Z and both sides equal ZZ, whereas weighting by the distribution of XX alone would give the number EX\mathbb{E}X.


Key Results

  • For integrable YY, E[E[Y∣X,Z]∣Z]=E[Y∣Z]\mathbb{E}[\mathbb{E}[Y\mid X,Z]\mid Z]=\mathbb{E}[Y\mid Z] almost surely.
  • Taking YY as an event indicator and XX as a partition label yields total probability with extra conditioning.

Examples

  • If Y=X+ZY=X+Z, XX is independent of ZZ, and EX=2\mathbb{E}X=2, then E[E[Y∣X,Z]∣Z]=2+Z\mathbb{E}[\mathbb{E}[Y\mid X,Z]\mid Z]=2+Z.
  • If ZZ is constant, the identity reduces to E[E[Y∣X]]=EY\mathbb{E}[\mathbb{E}[Y\mid X]]=\mathbb{E}Y.

Prerequisites

Sources

Symbols: infinity, intersection, sum

Last updated: 20 October 2026 03:02