The symmetric difference metric

Jordan Bell
April 12, 2015

Let (Ω,Σ,μ) be a probability space. For A,B∈Σ, define

dμ⁢(A,B)=μ⁢(A⁢△⁢B).

This is a pseduometric on Σ:

dμ⁢(A,C) =μ⁢(A⁢△⁢C)
=μ⁢((A⁢△⁢B)⁢△⁢(B⁢△⁢C))
≤μ⁢((A⁢△⁢B)∪(B⁢△⁢C))
≤μ⁢(A⁢△⁢B)+μ⁢(B⁢△⁢C)
=dμ⁢(A,B)+dμ⁢(B,C).

The relation A∼B if and only if dμ⁢(A,B)=0 is an equivalence relation on Σ, and dμ⁢([A],[B])=dμ⁢(A,B) is a metric on the collection Σμ of equivalence classes. We call dμ the symmetric difference metric.

The following theorem shows that (Σμ,dμ) is a complete metric space.11 1 V. I. Bogachev, Measure Theory, volume I, p. 54, Theorem 1.12.16.

Theorem 1.

If (Ω,Σ,μ) is a probability space, then (Σμ,dμ) is a complete metric space.

Proof.

Suppose that [Bn] is a Cauchy sequence in (Σμ,dμ). As for any Cauchy sequence in a metric space, there is a subsequence [An] of [Bn] such that dμ⁢([Ak],[An])<2-n for k≥n. Define

En=⋃k≥nAk.

We have

En∖An =⋃k=n+1∞(Ak∖An)
=⋃k=n+1(Ak∖⋃j=nk-1Aj)
⊂⋃k=n+1(Ak∖Ak-1)
=⋃k=n∞(Ak+1∖Ak),

hence

μ⁢(En⁢△⁢An)=μ⁢(En∖An)≤∑k=n∞μ⁢(Ak+1∖Ak)<∑k=n∞2-k=2-n+1. (1)

Now, define

A=lim supn→∞⁡An=⋂n=1∞⋃k=n∞Ak=⋂n=1∞En,

for which

μ⁢(An⁢△⁢A) =μ⁢(An∖A)
=μ⁢(An∩(⋂k=1∞Ek)c)
=μ⁢(An∩⋃k=1∞Ekc)
=μ⁢(⋃k=1∞(An∩Ekc))
=limk→∞⁡μ⁢(An∩Ekc)
=limk→∞⁡μ⁢(⋂j≥k(An∖Aj))
≤limk→∞⁡μ⁢(An∖Ak)
<2-n.

Using (1),

dμ⁢(An,A)≤μ⁢(En⁢△⁢An)+μ⁢(An⁢△⁢A)<2-n+1+2-n=3⋅2-n,

showing that [An] converges to [A] as n→∞, and because [An] is a subsequence of the Cauchy sequence [Bn], it follows that [Bn] converges to [A] and therefore that (Σμ,dμ) is a complete metric space. ∎

Lemma 2.

For A,B∈Σ,

|μ⁢(A)-μ⁢(B)|≤μ⁢(A⁢△⁢B).
Proof.
|μ⁢(A)-μ⁢(B)| =|(μ⁢(A∖B)+μ⁢(A∩B))-(μ⁢(B∖A)+μ⁢(B∩B))|
=|μ⁢(A∖B)-μ⁢(B∖A)|
≤μ⁢(A∖B)+μ⁢(B∖A)
=μ⁢((A∖B)∪(B∖A))
≤μ⁢(A⁢△⁢B).

∎

The following theorem connects the metric space (Σμ,dμ) with the Banach space L1⁢(μ).22 2 John B. Conway, A Course in Abstract Analysis, p. 90, Proposition 2.7.13.

Theorem 3.

If (Σμ,dμ) is separable then L1⁢(μ) is separable.