St · Statistics & Probability

How to Prove the Main Properties of Conditional Expectation

Updated 13 October 2026

At a glance

  1. 1. Start from the definition

    Use measurability and matching integrals over every event in the conditioning sigma-algebra.

  2. 2. Verify each property

    Show the proposed expression satisfies the defining conditions, then use uniqueness up to almost-sure equality.

  3. 3. Apply the results

    Use a finite partition to calculate conditional averages and check the tower property.

Conditional expectation is defined relative to the information represented by a sigma-algebra. Its familiar rules—such as linearity and the tower property—can all be proved from the same two conditions. The key technique is to show that a proposed random variable satisfies the definition, then use uniqueness.

Definition and uniqueness

Let XX be integrable and let G\mathcal{G} be a sigma-algebra. A conditional expectation of XX given G\mathcal{G}, written E[X∣G]\mathbb{E}[X\mid\mathcal{G}], is an integrable, G\mathcal{G}-measurable random variable ZZ such that

E[1AZ]=E[1AX]for every A∈G.\mathbb{E}[\mathbf{1}_A Z]=\mathbb{E}[\mathbf{1}_A X] \quad\text{for every }A\in\mathcal{G}.

Here 1A\mathbf{1}_A is the indicator of the event AA. The condition says that ZZ and XX have the same average over every event whose occurrence can be determined from the information in G\mathcal{G}. Conditional expectations are unique almost surely: two random variables satisfying the definition can differ only on an event of probability zero.

That uniqueness is what makes the proofs short. To establish an identity, show its right-hand side is measurable with respect to the required sigma-algebra and has the required integrals.

Linearity

For integrable X,YX,Y and constants a,ba,b, let U=E[X∣G]U=\mathbb{E}[X\mid\mathcal{G}] and V=E[Y∣G]V=\mathbb{E}[Y\mid\mathcal{G}]. The random variable aU+bVaU+bV is G\mathcal{G}-measurable and integrable. For every A∈GA\in\mathcal{G},

E[1A(aU+bV)]=aE[1AU]+bE[1AV]=aE[1AX]+bE[1AY]=E[1A(aX+bY)].\begin{aligned} \mathbb{E}[\mathbf{1}_A(aU+bV)] &=a\mathbb{E}[\mathbf{1}_A U]+b\mathbb{E}[\mathbf{1}_A V]\\ &=a\mathbb{E}[\mathbf{1}_A X]+b\mathbb{E}[\mathbf{1}_A Y]\\ &=\mathbb{E}[\mathbf{1}_A(aX+bY)]. \end{aligned}

Thus aU+bVaU+bV satisfies the definition of the conditional expectation of aX+bYaX+bY. By uniqueness,

E[aX+bY∣G]=aE[X∣G]+bE[Y∣G]almost surely.\mathbb{E}[aX+bY\mid\mathcal{G}] =a\mathbb{E}[X\mid\mathcal{G}]+b\mathbb{E}[Y\mid\mathcal{G}] \quad\text{almost surely}.

Positivity and monotonicity

Suppose X≥0X\geq 0 almost surely, and set Z=E[X∣G]Z=\mathbb{E}[X\mid\mathcal{G}]. If ZZ were negative on a set of positive probability, then for some positive integer nn the event A={Z≤−1/n}A=\{Z\leq -1/n\} would have positive probability. This event belongs to G\mathcal{G}, so the defining property gives

E[1AZ]=E[1AX]≥0.\mathbb{E}[\mathbf{1}_A Z]=\mathbb{E}[\mathbf{1}_A X]\geq 0.

But Z≤−1/nZ\leq -1/n on AA, making the left side at most −P(A)/n<0-\mathbb{P}(A)/n<0. This contradiction shows E[X∣G]≥0\mathbb{E}[X\mid\mathcal{G}]\geq0 almost surely.

If X≤YX\leq Y almost surely, then Y−X≥0Y-X\geq0. Apply positivity and linearity to get

E[X∣G]≤E[Y∣G]almost surely.\mathbb{E}[X\mid\mathcal{G}]\leq\mathbb{E}[Y\mid\mathcal{G}] \quad\text{almost surely}.

Taking out known factors

If HH is bounded and G\mathcal{G}-measurable, then

E[HX∣G]=HE[X∣G]almost surely.\mathbb{E}[HX\mid\mathcal{G}] =H\mathbb{E}[X\mid\mathcal{G}] \quad\text{almost surely}.

To prove this, first take H=1BH=\mathbf{1}_B for B∈GB\in\mathcal{G}. For every A∈GA\in\mathcal{G}, the intersection A∩BA\cap B is also in G\mathcal{G}, so

E[1A1BX]=E[1A1BE[X∣G]].\mathbb{E}[\mathbf{1}_A\mathbf{1}_B X] =\mathbb{E}[\mathbf{1}_A\mathbf{1}_B\mathbb{E}[X\mid\mathcal{G}]].

This proves the identity for indicators, and linearity proves it for simple HH. A bounded measurable HH can be approximated uniformly by simple G\mathcal{G}-measurable functions; passing to the limit gives the stated result. Boundedness ensures the products in this argument are integrable.

The tower property

Let H⊆G\mathcal{H}\subseteq\mathcal{G} be sigma-algebras. Then

E[E[X∣G]∣H]=E[X∣H]almost surely.\mathbb{E}\big[\mathbb{E}[X\mid\mathcal{G}]\mid\mathcal{H}\big] =\mathbb{E}[X\mid\mathcal{H}] \quad\text{almost surely}.

Indeed, the left side is H\mathcal{H}-measurable. For every A∈HA\in\mathcal{H}, the defining property applied twice gives

E[1AE[E[X∣G]∣H]]=E[1AE[X∣G]]=E[1AX],\mathbb{E}\big[\mathbf{1}_A\mathbb{E}[\mathbb{E}[X\mid\mathcal{G}]\mid\mathcal{H}]\big] =\mathbb{E}[\mathbf{1}_A\mathbb{E}[X\mid\mathcal{G}]] =\mathbb{E}[\mathbf{1}_A X],

because A∈GA\in\mathcal{G} as well. The left side therefore satisfies the definition of E[X∣H]\mathbb{E}[X\mid\mathcal{H}], and uniqueness proves the claim. Taking H\mathcal{H} to be the trivial sigma-algebra yields the law of total expectation, E[E[X∣G]]=E[X]\mathbb{E}[\mathbb{E}[X\mid\mathcal{G}]]=\mathbb{E}[X].

Two other useful consequences follow directly from the definition. If XX is already G\mathcal{G}-measurable, then E[X∣G]=X\mathbb{E}[X\mid\mathcal{G}]=X. If XX is independent of G\mathcal{G}, then E[X∣G]=E[X]\mathbb{E}[X\mid\mathcal{G}]=\mathbb{E}[X].

Worked example: conditioning on a partition

Suppose the outcomes 1,2,3,4,5,61,2,3,4,5,6 are equally likely, and XX takes values 1,2,6,0,3,91,2,6,0,3,9 on those outcomes, respectively. Let G\mathcal{G} reveal only whether the outcome is in A={1,2,3}A=\{1,2,3\} or B={4,5,6}B=\{4,5,6\}. A G\mathcal{G}-measurable random variable is constant on each block of this partition. The defining averages give

E[X∣G]={(1+2+6)/3=3,on A,(0+3+9)/3=4,on B.\mathbb{E}[X\mid\mathcal{G}] =\begin{cases} (1+2+6)/3=3,&\text{on }A,\\ (0+3+9)/3=4,&\text{on }B. \end{cases}

The expectation of this conditional expectation is (3+3+3+4+4+4)/6=3.5(3+3+3+4+4+4)/6=3.5. Directly, E[X]=(1+2+6+0+3+9)/6=3.5\mathbb{E}[X]=(1+2+6+0+3+9)/6=3.5 as well, illustrating the tower property.

Common mistakes

  • Treating equality as pointwise. Conditional-expectation identities generally hold almost surely, not necessarily at every outcome.
  • Using the factor rule without measurability. The factor must be measurable with respect to the conditioning sigma-algebra; boundedness is a convenient sufficient condition for the proof above.
  • Confusing conditioning with a number. Given a nontrivial sigma-algebra, the conditional expectation is usually a random variable, not one fixed average.
  • Skipping uniqueness. Matching the integrals alone is not enough: the proposed variable must also be measurable with respect to the conditioning sigma-algebra.

References

  1. Probability with Martingales — David Williams
  2. Probability: Theory and Examples — Rick Durrett

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.