We consider a measure space (Ω,F,μ), where Ω is a set of elements, F is a σ-field, and μ:F→R a σ-finite measure defined on F.
Definition (Mutually Singular). Measures μ and ν on a measurable space (Ω,F) are by definition mutually singular if they have disjoint supports, i.e., if
∃Sμ,Sν∈F, s.t. {Sμ∩Sν=∅,μ(Sˉμ)=ν(Sˉν)=0.
Definition (Absolute Continuous). Measure ν is absolute continuous with μ (or dominated by μ), denoted as ν≪μ, if
μ(E)=0⟹ν(E)=0,∀E∈F.
Motivation. Let f be a nonnegative and measurable function.
Then the measure defined by
ν(E)=∫Efdμ,∀E∈F,
is absolutely continuous with respect to μ.
The The Radon-Nikodym Theorem establishes the opposite direction.
The Radon-Nikodym Theorem.
Let μ,ν be σ-finite measures such that ν≪μ.
There exists a nonnegative measurable function f, a density, such that
ν(E)=∫Efdμ,∀E∈F.
For two such function f and f′, μ[f=f′]=0.
f is called the Radon-Nikodym derivative of ν with respect to μ and is denoted dμ/dν.
The proof of the Theorem relies on the following lemma, the proof of which is deferred to the end of the article.
Lemma. Let μ and ν be two finite measures that are not mutually singular.
Then there exits A∈F and ϵ>0, such that μ(A)>0, and for each measurable set E in A, it holds that ϵ⋅μ(E)≤ν(E).
Proof of the Theorem:
Since both μ and ν are σ-finite, there is a disjoint sequence En∈F such that ∪n≥1En=Ω and that μ(En)<∞, ν(En)<∞ for each n∈N+.
Define finite measures μn and νn by
μn(E)=μ(E∩En),νn(E)=ν(E∩En),∀E∈F.
Suppose that we can find densities fn,n∈N+, such that νn(E)=∫Efndμn.
As μn has density 1En, for each E∈F, it holds that ∫Efndμn=∫Efn⋅1Endμ.
Via monotone convergence theorem,
G is closed under non-decreasing limit: let gn∈G such that gn↑g, then by monotone convergence theorem it holds for each E∈F that
nlim∫Egndμ=∫Enlimgndμ≤ν(E).
Next, consider the supremum of integrals of function in G:
α≐g∈Gsup∫gdμ≤ν(Ω)<∞.
Let gn∈G,n∈N+ be a sequence of functions such that
$
\lim_n \int g_n \ d \mu = \alpha.
$
For each n∈N+, define fn=maxi∈[n]gi.
Then the fn is a non-decreasing sequence of functions in G.
Denote f=limnfn.
We have f∈G, and
∫fdμ=nlim∫gndμ=α.
It is left to show that λ(E)=∫Ef for each measurable set E. Define function λ:F→R as
λ(E)=ν(E)−∫Efdμ
We complete the proof by showing that λ(E)≡0.
It is easy to verify that λ is a measure (λ≥0) as ν(E)≥∫Efdμ. Further, ∫Efdμ≪μ and ν≪μ imply that λ≪μ.
Suppose λ=0. By assumption μ(Ω)<∞, then there exists ϵ>0, such that λ(Ω)−ϵμ(Ω)>0. Let {A,B} be the Hahn decomposition of λ−ϵμ such that A is positive. Let g=f+ϵχA. It satisfies
g∈G, since ∀E∈F,
λ(E)−∫Egdμ=λ(E)−∫Efdμ−∫EϵχAdμ≥0
∫gdμ≥α,
∫gdμ=∫f+ϵχAdμ=∫fdμ+∫ϵχAdμ=α+ϵμ(A)≥α
If follows that μ(A)=0. Now 0<(λ−ϵμ)(Ω)=(λ−ϵμ)(A)+(λ−ϵμ)(B)=0+(λ−ϵμ)(B)≤0. Contradiction. We thus have proved that λ=0.
□
Proof of the Lemma.
For each n∈N+, ν−(1/n)⋅μ is a signed measure.
Let Sn+,Sn− be its Hahn decomposition.
Define S+=∪n≥1Sn+, and S−=∩n≥1Sn−.
Since S−⊂Sn−, we have
ν(S−)≤n1⋅μ(S−),∀n∈N+.
It follows that ν(S−)=0.
Since μ and ν are not mutually singular, S− does not support μ.
Hence μ(S+)>0.
There exits some n∈N+, such that μ(Sn+)>0.
But
ν(E)≥n1⋅μ(E),∀E⊂Sn+,E∈F.
□
Theorem (Chain Rule). Let μ1,μ2,μ3 be σ-finite measures on (Ω,F), s.t., μ1≪μ2, μ2≪μ3.
Prove that μ1≪μ3, and
dμ3dμ1(ω)=dμ2dμ1(ω)⋅dμ3dμ2(ω)a.e. with respect to μ3.
Proof.μ1≪μ3 is straightforward.
Next, to ease the notations, denote
f=dμ3dμ1,h=dμ2dμ1,δ=dμ3dμ2,g=h⋅δ.
Via Radon-Nikodym theorem, for each E∈F, it holds that
μ1(E)=∫Efdμ3,μ1(E)=∫Ehdμ2,μ2(E)=∫Eδdμ3.
The goal is to prove that
Lemma.
∫Efdμ3=μ1(E)=∫Eh⋅δdμ3,∀E∈F.
Define En+≐{f−h⋅δ≥1/n},∀n∈N+.
Then
0=∫En+(f−h⋅δ)dμ3≥n1⋅μ3(En+)⟹μ3(En+)=0.
Let E+≐{f>h⋅δ}.
Since En+↗E, we get μ3(E+)=limnμ3(En+)=0.
In the same vein one can prove that μ3(f<h⋅δ)=0.
It concludes that f=h⋅δ almost everywhere respect to μ3.
Proof of the Lemma.
Consider a fixed E∈F.
Case One.h=IS,S∈F is an indicator random variable.
Then
∫EISdμ2=μ2(E∩S)=∫E∩Sδdμ3=∫EIS⋅δdμ3.
Case Two.h is a simple function.
The claim follows from the linearity of expectation.
Case Two.h is a non-negative function. One can construct a sequence of simple functions which increases to h.
The claim follows from the monotone convergence theorem.
□
Reference
[1]. Billingsley. Patrick, Probability and measure