Skip to content

Completeness

Consider a set which is even smaller (subset) than a null set. A null set is a set SS such that P(S)=0\Pr(S) = 0.

This subset of the null set also intuitively has P()=0\Pr(\cdot) = 0. However, this small intuitive idea cannot be derived from the definition of a probability measure.

Why? Because there is no guarantee that if AFA \in \cF and BAB \subseteq A, then BFB \in \cF for a σ\sigma-field F\cF.

If BFB \in \cF (i.e. if we knew it was measurable), then by monotonicity the idea above is true. But we don’t know if the subset is even measurable (in F\cF).

If (Ω,F,P)(\Omega, \cF, \Pr) is complete, then for a set AA', if there exists AFA \in \cF such that AΔABA \Delta A' \subseteq B for some BB with P(B)=0\Pr(B) = 0, then AFA' \in \cF and P(A)=P(A)\Pr(A') = \Pr(A).

Note: AΔAA \Delta A' is the symmetric difference, defined as AΔA=(AA)(AA)A \Delta A' = (A \cup A') - (A \cap A').

Since AΔABA \Delta A' \subseteq B and P(B)=0\Pr(B) = 0, the subsets AAcA \cap A'^c and AcAA^c \cap A' are subsets of a null set in a complete space, so they are null sets. This implies P(A)=P(A)=P(AA)\Pr(A) = \Pr(A') = \Pr(A \cap A').

A probability space always has a complete extension.