Let ( X , F 1 , μ 1 ) (X, \mathcal{F}_1, \mu_1) ( X , F 1 , μ 1 )
and ( Y , F 2 , μ 2 ) (Y, \mathcal{F}_2, \mu_2) ( Y , F 2 , μ 2 )
be two σ \sigma σ -finite measure space.
Produce Measure Space
Consider the product space Ω = X × Y \Omega = X \times Y Ω = X × Y .
Definition. A measurable rectangle is a product A × B A \times B A × B for which A ∈ F 1 A \in \mathcal{F}_1 A ∈ F 1 and B ∈ F 2 B \in \mathcal{F}_2 B ∈ F 2 .
Denote the collection of measurable rectangles as
S ≐ { A × B , A ∈ F 1 , B ∈ F 2 } .
\mathcal{S} \doteq \begin{Bmatrix} A \times B, A \in \mathcal{F}_1, B \in \mathcal{F}_2 \end{Bmatrix}.
S ≐ { A × B , A ∈ F 1 , B ∈ F 2 } . We would like to construct a measure μ \mu μ on σ ( S ) \sigma(\mathcal{S}) σ ( S ) , the σ \sigma σ -field generated by S \mathcal{S} S , thus
For each A × B ∈ S A \times B \in \mathcal{S} A × B ∈ S , it's natural to define μ ( A × B ) = μ 1 ( A ) ⋅ μ 2 ( B ) \mu (A \times B) = \mu_1(A) \cdot \mu_2(B) μ ( A × B ) = μ 1 ( A ) ⋅ μ 2 ( B ) .
We prove that S \mathcal{S} S is a semialgebra.
We show that μ \mu μ is a measure on S \mathcal{S} S .
Finally, it follows by the Caratheodory’s Extension Theorem , μ \mu μ has a unique extension on σ ( S ) \sigma(\mathcal{S}) σ ( S ) .
Lemma 1. S \mathcal{S} S is a semialgebra.
Proof.
S \mathcal{S} S is close under intersection: if A × B , C × D ∈ S A \times B, C \times D \in \mathcal{S} A × B , C × D ∈ S , then( A × B ) ∩ ( C × D ) = ( A ∩ C ) × ( B ∩ D ) .
(A \times B) \cap (C \times D) = (A \cap C) \times (B \cap D).
( A × B ) ∩ ( C × D ) = ( A ∩ C ) × ( B ∩ D ) .
The complement of element in S \mathcal{S} S is a finite disjoint union of elements in S \mathcal{S} S : if A × B ∈ S A \times B \in \mathcal{S} A × B ∈ S , sinceΩ = ( A × B ) + ( A ˉ × B ) + ( A × B ˉ ) + ( A ˉ × B ˉ ) ,
\Omega = (A \times B) + ( \bar A \times B ) + ( A \times \bar B ) + ( \bar A \times \bar B ),
Ω = ( A × B ) + ( A ˉ × B ) + ( A × B ˉ ) + ( A ˉ × B ˉ ) , it holds thatA × B ‾ = ( A ˉ × B ) + ( A × B ˉ ) + ( A ˉ × B ˉ ) .
\overline{ A \times B } = ( \bar A \times B ) + ( A \times \bar B ) + ( \bar A \times \bar B ).
A × B = ( A ˉ × B ) + ( A × B ˉ ) + ( A ˉ × B ˉ ) .
□ \square □
Lemma 2. μ \mu μ is a measure on S \mathcal{S} S .
Proof. It suffices to prove σ \sigma σ -additivity of μ \mu μ .
Suppose A × B = + i ≥ 1 ( A i × B i ) A \times B = +_{i \ge 1} (A_i \times B_i) A × B = + i ≥ 1 ( A i × B i ) is a countable disjoint union of elements in S \mathcal{S} S .
Fix an x ∈ A x \in A x ∈ A .
For each y ∈ B y \in B y ∈ B , we have ( x , y ) ∈ A × B (x, y) \in A \times B ( x , y ) ∈ A × B .
As the sets { A i × B i } \begin{Bmatrix} A_i \times B_i \end{Bmatrix} { A i × B i } consists of a partition of A × B A \times B A × B , it follows that ( x , y ) (x, y) ( x , y ) belongs to exactly one A i × B i A_i \times B_i A i × B i .
Denote
I ( x ) ≐ { i : ∃ y ∈ B , s.t. , ( x , y ) ∈ A i × B i } = { i : x ∈ A i } .
I(x)
\doteq \begin{Bmatrix} i : \exists y \in B,\, \text{s.t.},\, (x, y) \in A_i \times B_i \end{Bmatrix}
= \begin{Bmatrix} i : x \in A_i \end{Bmatrix}.
I ( x ) ≐ { i : ∃ y ∈ B , s.t. , ( x , y ) ∈ A i × B i } = { i : x ∈ A i } . Then B = + i ∈ I ( x ) B i B = +_{i \in I(x) } B_i B = + i ∈ I ( x ) B i .
As μ 2 \mu_2 μ 2 is a measure on Y Y Y , it is countably additive:
μ 2 ( B ) = ∑ i ∈ I ( x ) μ ( B i ) ⟹ I A ( x ) μ 2 ( B ) = ∑ i ≥ 1 I A i ( x ) ⋅ μ 2 ( B ) .
\mu_2 (B)
= \sum_{i \in I(x) } \mu(B_i ) \implies \mathbb{I}_A (x) \mu_2(B)
= \sum_{i \ge 1} \mathbb{I}_{ A_i } (x) \cdot \mu_2 (B).
μ 2 ( B ) = i ∈ I ( x ) ∑ μ ( B i ) ⟹ I A ( x ) μ 2 ( B ) = i ≥ 1 ∑ I A i ( x ) ⋅ μ 2 ( B ) . By monotone convergence theorem,
∫ X I A ( x ) μ 2 ( B ) d μ 1 = ∑ i ≥ 1 ∫ X I A i ( x ) ⋅ μ 2 ( B ) d μ 1 ,
\int_X \mathbb{I}_A(x) \mu_2(B) \, d\, \mu_1
= \sum_{i \ge 1} \int_X \mathbb{I}_{ A_i } (x) \cdot \mu_2 (B) d\, \mu_1,
∫ X I A ( x ) μ 2 ( B ) d μ 1 = i ≥ 1 ∑ ∫ X I A i ( x ) ⋅ μ 2 ( B ) d μ 1 , which is
μ 1 ( A ) ⋅ μ 2 ( B ) = ∑ i ≥ 1 μ 1 ( A i ) ⋅ μ 2 ( B i ) .
\mu_1 (A) \cdot \mu_2 (B) = \sum_{i \ge 1} \mu_1 (A_i) \cdot \mu_2 (B_i).
μ 1 ( A ) ⋅ μ 2 ( B ) = i ≥ 1 ∑ μ 1 ( A i ) ⋅ μ 2 ( B i ) . □ \square □
Theorem. μ \mu μ has a unique extension μ ˉ \bar \mu μ ˉ on σ ( S ) \sigma( \mathcal{S} ) σ ( S ) , the σ \sigma σ -field generated by S \mathcal{S} S .
Proof. Note that S \mathcal{S} S is a semialgebra and μ \mu μ is a σ \sigma σ -finite measure.
Applying
Caratheodory’s Extension Theorem
directly finishes the proof.
□ \square □
Fubini's Theorem
Let { a i : i ∈ N } \begin{Bmatrix} a_i : i \in \mathbb{N} \end{Bmatrix} { a i : i ∈ N } be a countably sequence of numbers.
Then the series converges to the same limit under permutation, if
a i ≥ 0 , ∀ i ∈ N a_i \ge 0, \forall i \in \mathbb{N} a i ≥ 0 , ∀ i ∈ N . Note that ∑ i ≥ 1 a i \sum_{i \ge 1} a_i ∑ i ≥ 1 a i can equal ∞ \infty ∞ .
∑ i ≥ 1 ∣ a i ∣ < ∞ \sum_{i \ge 1} | a_i | < \infty ∑ i ≥ 1 ∣ a i ∣ < ∞ .
Integration is a generalization of discrete sum.
Given a measure space ( Ω , σ ( S ) , μ ˉ ) (\Omega, \sigma( \mathcal{S} ), \bar \mu) ( Ω , σ ( S ) , μ ˉ ) , and a measure function f f f , the integral of f f f exists, if
f ≥ 0 f \ge 0 f ≥ 0 ;
Or ∫ ∣ f ∣ d μ ˉ < ∞ \int |f| d\, \bar \mu < \infty ∫ ∣ f ∣ d μ ˉ < ∞ .
In case that ( Ω , σ ( S ) , μ ˉ ) (\Omega, \sigma( \mathcal{S} ), \bar \mu) ( Ω , σ ( S ) , μ ˉ ) is a produce measure space, the Fubini's theorem states that if the double integral exists, it can be computed by iterated integrals.
Theorem (Fubini's Theorem). If f ≥ 0 f \ge 0 f ≥ 0 or ∫ ∣ f ∣ d μ ˉ < ∞ \int |f| d\, \bar \mu < \infty ∫ ∣ f ∣ d μ ˉ < ∞ , then there exists A ∈ F 1 A \in \mathcal{F}_1 A ∈ F 1 , B ∈ F 2 B \in \mathcal{F}_2 B ∈ F 2 , s.t., μ 1 ( A ) = μ 2 ( B ) = 0 \mu_1 (A) = \mu_2 (B) = 0 μ 1 ( A ) = μ 2 ( B ) = 0 , and
∫ X − A ∫ Y f ( x , y ) d μ 2 d μ 1 = ∫ Ω f ( x , y ) d μ ˉ = ∫ Y − B ∫ X f ( x , y ) d μ 1 d μ 2 .
\int_{X - A} \int_Y f(x, y) d\, \mu_2 \, d\, \mu_1
= \int_{\Omega } f(x, y) d\, \bar \mu
= \int_{Y - B} \int_X f(x, y) d\, \mu_1 \, d\, \mu_2.
∫ X − A ∫ Y f ( x , y ) d μ 2 d μ 1 = ∫ Ω f ( x , y ) d μ ˉ = ∫ Y − B ∫ X f ( x , y ) d μ 1 d μ 2 .
Remark. For the case concerning f ≥ 0 f \ge 0 f ≥ 0 , we have A = B = ∅ A = B = \emptyset A = B = ∅ , and the Theorem is called Tonelli’s theorem .
Comparison with Discrete Sum
Let X = Y = N X = Y = \mathbb{N} X = Y = N , and μ 1 = μ 2 \mu_1 = \mu_2 μ 1 = μ 2 be counting measures.
Let { a i , j : i , j ∈ N } \begin{Bmatrix} a_{i,j} : i, j \in \mathbb{N} \end{Bmatrix} { a i , j : i , j ∈ N } be a sequency of numbers and define f ( i , j ) = a i , j f(i, j) = a_{i,j} f ( i , j ) = a i , j .
Denote
E 1 ≐ { ( i , j ) ∈ N × N : a i , j ≥ 0 } , E 2 ≐ { ( i , j ) ∈ N × N : a i , j < 0 } .
E_1 \doteq \begin{Bmatrix} (i, j) \in \mathbb{N} \times \mathbb{N} : a_{i,j} \ge 0 \end{Bmatrix}, \\
E_2 \doteq \begin{Bmatrix} (i, j) \in \mathbb{N} \times \mathbb{N} : a_{i,j} < 0 \end{Bmatrix}.
E 1 ≐ { ( i , j ) ∈ N × N : a i , j ≥ 0 } , E 2 ≐ { ( i , j ) ∈ N × N : a i , j < 0 } . By definition of integration ,
∫ Ω f ( x , y ) d μ ˉ \int_\Omega f(x, y) \, d\, \bar \mu ∫ Ω f ( x , y ) d μ ˉ exists if
Either f ≥ 0 f \ge 0 f ≥ 0 . In this case
∫ Ω f ( x , y ) d μ ˉ = sup { ∑ ( i , j ) ∈ S a i , j : S ⊆ N × N ∣ S ∣ < ∞ } ,
\int_\Omega f(x, y) \, d\, \bar \mu
= \sup \begin{Bmatrix}
\sum_{ ( i,j ) \in S } a_{i,j} :
\begin{array}{l}
S \subseteq \mathbb{N} \times \mathbb{N} \\
|S| < \infty
\end{array}
\end{Bmatrix},
∫ Ω f ( x , y ) d μ ˉ = sup { ∑ ( i , j ) ∈ S a i , j : S ⊆ N × N ∣ S ∣ < ∞ } ,
Or ∫ Ω ∣ f ( x , y ) ∣ d μ ˉ < ∞ \int_\Omega | f(x, y) | \, d\, \bar \mu < \infty ∫ Ω ∣ f ( x , y ) ∣ d μ ˉ < ∞ . In this case,
∫ Ω f ( x , y ) d μ ˉ = ∫ Ω f + d μ ˉ − ∫ Ω f − d μ ˉ = sup { ∑ ( i , j ) ∈ S a i , j : S ⊆ E 1 ∣ S ∣ < ∞ } − sup { ∑ ( i , j ) ∈ S a i , j : S ⊆ E 2 ∣ S ∣ < ∞ } .
\begin{aligned}
&\int_\Omega f(x, y) \, d\, \bar \mu
= \int_\Omega f_+ \, d\, \bar \mu -
\int_\Omega f_- \, d\, \bar \mu \\
&= \sup \begin{Bmatrix}
\sum_{ ( i,j ) \in S } a_{i,j}:
\,
\begin{matrix}
S \subseteq E_1 \\
|S| < \infty
\end{matrix}
\end{Bmatrix}
-
\sup \begin{Bmatrix}
\sum_{ ( i,j ) \in S } a_{i,j}:
\,
\begin{matrix}
S \subseteq E_2 \\
|S| < \infty
\end{matrix}
\end{Bmatrix}
.
\end{aligned}
∫ Ω f ( x , y ) d μ ˉ = ∫ Ω f + d μ ˉ − ∫ Ω f − d μ ˉ = sup { ∑ ( i , j ) ∈ S a i , j : S ⊆ E 1 ∣ S ∣ < ∞ } − sup { ∑ ( i , j ) ∈ S a i , j : S ⊆ E 2 ∣ S ∣ < ∞ } .
In the former case, the summation of elements in a chosen set S S S grows in one direction. While in the later, the summation converges absolutely.
When ∫ Ω f ( x , y ) d μ ˉ \int_\Omega f(x, y) \, d\, \bar \mu ∫ Ω f ( x , y ) d μ ˉ exists, the following iterated integrals exist:
∫ X ∫ Y f ( x , y ) d μ 2 d μ 1 = ∑ i ≥ 1 ∑ j ≥ 1 a i , j , ∫ Y ∫ X f ( x , y ) d μ 1 d μ 2 = ∑ j ≥ 1 ∑ i ≥ 1 a i , j .
\int_X \int_Y f(x, y) d\, \mu_2 \, d\, \mu_1
= \sum_{i \ge 1} \sum_{j \ge 1} a_{i,j}, \\
\int_Y \int_X f(x, y) d\, \mu_1 \, d\, \mu_2
= \sum_{j \ge 1} \sum_{i \ge 1} a_{i,j}.
∫ X ∫ Y f ( x , y ) d μ 2 d μ 1 = i ≥ 1 ∑ j ≥ 1 ∑ a i , j , ∫ Y ∫ X f ( x , y ) d μ 1 d μ 2 = j ≥ 1 ∑ i ≥ 1 ∑ a i , j . Further, their values are equal.
□ \square □
Proof of Fubini's Theorem
By symmetry, it suffices to prove that
∫ X ∫ Y f ( x , y ) d μ 2 d μ 1 = ∫ Ω f ( x , y ) d μ ˉ .
\int_X \int_Y f(x, y) d\, \mu_2 \, d\, \mu_1
= \int_{\Omega } f(x, y) d\, \bar \mu.
∫ X ∫ Y f ( x , y ) d μ 2 d μ 1 = ∫ Ω f ( x , y ) d μ ˉ . Sketch of the Proof
Before proving that the iterated integral equals the double integral, we need to make sure that the first iterated integral is well-defined.
Specifically,
When x x x is fixed, the function f x : Y → R f_x : Y \rightarrow \mathbb{R} f x : Y → R defined by f x ( y ) ≐ f ( x , y ) f_x(y) \doteq f(x, y) f x ( y ) ≐ f ( x , y ) is F 2 \mathcal{F}_2 F 2 measurable, and the integral ∫ Y f ( x , y ) d μ 2 \int_Y f(x, y) \, d\, \mu_2 ∫ Y f ( x , y ) d μ 2 exists.
There is F 1 \mathcal{F}_1 F 1 measurable function g : X → R g : X \rightarrow \mathbb{R} g : X → R such that g ( x ) = ∫ Y f ( x , y ) d μ 2 g(x) = \int_Y f(x, y) \, d\, \mu_2 g ( x ) = ∫ Y f ( x , y ) d μ 2 almost everywhere.
We will first establish the theorem for indicator functions I E \mathbb{I}_E I E for sets E ∈ σ ( S ) E \in \sigma( \mathcal{S} ) E ∈ σ ( S ) , which serve as basic building blocks for extending the theorem for more general functions.
Lemma. Given E ∈ σ ( S ) E \in \sigma( \mathcal{S} ) E ∈ σ ( S ) , let I E \mathbb{I}_E I E be the indicator for ( x , y ) ∈ E (x, y) \in E ( x , y ) ∈ E . Then
For each x ∈ X x \in X x ∈ X , the function f x ( y ) ≐ I E ( x , y ) f_x(y) \doteq \mathbb{I}_E (x, y) f x ( y ) ≐ I E ( x , y ) is F 2 \mathcal{F}_2 F 2 measurable.
The function g ( x ) ≐ ∫ Y I E ( x , y ) d μ 2 g(x) \doteq \int_Y \mathbb{I}_E (x, y) d\, \mu_2 g ( x ) ≐ ∫ Y I E ( x , y ) d μ 2 is F 1 \mathcal{F}_1 F 1 measurable.
∫ X ∫ Y I E ( x , y ) d μ 2 d μ 1 = ∫ Ω I E ( x , y ) d μ ˉ .
\int_X \int_Y \mathbb{I}_E (x, y) d\, \mu_2 \, d\, \mu_1
= \int_{\Omega } \mathbb{I}_E (x, y) d\, \bar \mu.
∫ X ∫ Y I E ( x , y ) d μ 2 d μ 1 = ∫ Ω I E ( x , y ) d μ ˉ .
The proof of the lemma is deferred to the end of the article.
Proof of the Theorem
For now, we apply it to prove Theorem for the following three increasingly more general cases.
Case One. f f f is a simple function on ( X × Y , σ ( S ) ) (X \times Y, \sigma(\mathcal{S})) ( X × Y , σ ( S )) .
Case Two. f ≥ 0 f \ge 0 f ≥ 0 and is σ ( S ) \sigma(\mathcal{S}) σ ( S ) measurable.
Case Three. f f f is measurable and integrable.
Remark: this follows exactly the same order with which we define Lebesgue integrals.
Proof.
Case 1. Suppose that f ( x , y ) = ∑ i ∈ [ n ] c i ⋅ I E i ( x , y ) f(x, y) = \sum_{i \in [n]} c_i \cdot \mathbb{I}_{E_i} (x, y) f ( x , y ) = ∑ i ∈ [ n ] c i ⋅ I E i ( x , y ) is a simple function on ( X × Y , σ ( S ) ) (X \times Y, \sigma(\mathcal{S})) ( X × Y , σ ( S )) .
For fixed x ∈ X x \in X x ∈ X , according the lemma, the functions f x ( i ) ( y ) ≐ I E i ( x , y ) , i ∈ [ n ] f_x^{ (i) } (y) \doteq \mathbb{I}_{E_i} (x, y), i \in [n] f x ( i ) ( y ) ≐ I E i ( x , y ) , i ∈ [ n ] are F 2 \mathcal{F}_2 F 2 measurable.
It follows that function f x ( y ) = ∑ i ∈ [ n ] c i ⋅ f x ( i ) ( y ) f_x (y) = \sum_{i \in [n]} c_i \cdot f_x^{ (i) } (y) f x ( y ) = ∑ i ∈ [ n ] c i ⋅ f x ( i ) ( y ) is F 2 \mathcal{F}_2 F 2 measurable.
Since g ( i ) ( x ) ≐ ∫ Y I E i ( x , y ) d μ 2 g^{(i)} (x) \doteq \int_Y \mathbb{I}_{E_i} (x, y) d\, \mu_2 g ( i ) ( x ) ≐ ∫ Y I E i ( x , y ) d μ 2 is F 1 \mathcal{F}_1 F 1 measurable, so is the function
g ( x ) = ∫ Y f x ( y ) d μ 2 = ∑ i ∈ [ n ] c i ⋅ ∫ Y I E i ( x , y ) d μ 2
g(x) =
\int_Y f_x(y) d\, \mu_2
=
\sum_{i \in [n]} c_i \cdot \int_Y \mathbb{I}_{E_i} (x, y) d\, \mu_2
g ( x ) = ∫ Y f x ( y ) d μ 2 = i ∈ [ n ] ∑ c i ⋅ ∫ Y I E i ( x , y ) d μ 2
Since ∫ X ∫ Y I E i ( x , y ) d μ 2 d μ 1 = ∫ Ω I E i ( x , y ) d μ ˉ \int_X \int_Y \mathbb{I}_{E_i} (x, y) d\, \mu_2 \, d\, \mu_1 = \int_{\Omega } \mathbb{I}_{E_i} (x, y) d\, \bar \mu ∫ X ∫ Y I E i ( x , y ) d μ 2 d μ 1 = ∫ Ω I E i ( x , y ) d μ ˉ ,
∫ X ∫ Y f ( x , y ) d μ 2 d μ 1 = ∑ i ∈ [ n ] c i ⋅ ∫ X ∫ Y I E i ( x , y ) d μ 2 d μ 1 = ∑ i ∈ [ n ] c i ⋅ ∫ Ω I E i ( x , y ) d μ ˉ = ∫ Ω ∑ i ∈ [ n ] c i ⋅ I E i ( x , y ) d μ ˉ = ∫ Ω f ( x , y ) d μ ˉ .
\begin{aligned}
\int_X \int_Y f(x, y) d\, \mu_2 \, d\, \mu_1
&=
\sum_{i \in [n]} c_i \cdot \int_X \int_Y \mathbb{I}_{E_i} (x, y) d\, \mu_2 \, d\, \mu_1 \\
&=
\sum_{i \in [n]} c_i \cdot \int_{\Omega } \mathbb{I}_{E_i} (x, y) d\, \bar \mu \\
&=
\int_{\Omega } \sum_{i \in [n]} c_i \cdot\mathbb{I}_{E_i} (x, y) d\, \bar \mu \\
&= \int_{\Omega } f(x, y) d\, \bar \mu.
\end{aligned}
∫ X ∫ Y f ( x , y ) d μ 2 d μ 1 = i ∈ [ n ] ∑ c i ⋅ ∫ X ∫ Y I E i ( x , y ) d μ 2 d μ 1 = i ∈ [ n ] ∑ c i ⋅ ∫ Ω I E i ( x , y ) d μ ˉ = ∫ Ω i ∈ [ n ] ∑ c i ⋅ I E i ( x , y ) d μ ˉ = ∫ Ω f ( x , y ) d μ ˉ . Case Two. Suppose that f ≥ 0 f \ge 0 f ≥ 0 and is σ ( S ) \sigma(\mathcal{S}) σ ( S ) measurable.
Then there exists simple, nonnegative functions f ( n ) ↑ f f^{ (n) } \uparrow f f ( n ) ↑ f .
For fixed x ∈ X x \in X x ∈ X . The functions f x ( n ) ( y ) ≐ f ( n ) ( x , y ) ↑ f x ( y ) f_x^{ (n) } (y) \doteq f^{ (n) } (x, y) \uparrow f_x(y) f x ( n ) ( y ) ≐ f ( n ) ( x , y ) ↑ f x ( y ) . Since they are F 2 \mathcal{F}_2 F 2 measurable, so is f x ( y ) ≐ f ( x , y ) f_x (y) \doteq f(x, y) f x ( y ) ≐ f ( x , y ) .
Let g ( n ) ( x ) ≐ ∫ Y f ( n ) ( x , y ) d μ 2 g^{(n)} (x) \doteq \int_Y f^{ (n) } (x, y) d\, \mu_2 g ( n ) ( x ) ≐ ∫ Y f ( n ) ( x , y ) d μ 2 .
Since 0 ≤ f x ( n ) ( y ) ↑ f x ( y ) 0 \le f_x^{ (n) } (y) \uparrow f_x(y) 0 ≤ f x ( n ) ( y ) ↑ f x ( y ) , by monotone convergence theorem:
g ( x ) = ∫ Y f x ( y ) d μ 2 = lim n ∫ Y f ( n ) ( x , y ) d μ 2 = lim n g ( n ) ( x )
g(x) =
\int_Y f_x(y) d\, \mu_2
=
\lim_n \int_Y f^{ (n) } (x, y) d\, \mu_2
=
\lim_n g^{(n)} (x)
g ( x ) = ∫ Y f x ( y ) d μ 2 = n lim ∫ Y f ( n ) ( x , y ) d μ 2 = n lim g ( n ) ( x ) It follows that g ( n ) ( x ) ↑ g ( x ) g^{(n)} (x) \uparrow g(x) g ( n ) ( x ) ↑ g ( x ) .
Since they are F 1 \mathcal{F}_1 F 1 measurable, so is g ( x ) g(x) g ( x ) .
Since ∫ Y f ( n ) ( x , y ) d μ 2 ↑ ∫ Y f ( x , y ) d μ 2 \int_Y f^{ (n) } (x, y) d\, \mu_2 \uparrow \int_Y f(x, y) d\, \mu_2 \, ∫ Y f ( n ) ( x , y ) d μ 2 ↑ ∫ Y f ( x , y ) d μ 2 , ∫ X ∫ Y f ( n ) ( x , y ) d μ 2 d μ 1 = ∫ Ω f ( n ) ( x , y ) d μ ˉ \int_X \int_Y f^{ (n) } (x, y) d\, \mu_2 \, d\, \mu_1 = \int_{\Omega } f^{ (n) } (x, y) d\, \bar \mu \, ∫ X ∫ Y f ( n ) ( x , y ) d μ 2 d μ 1 = ∫ Ω f ( n ) ( x , y ) d μ ˉ , and f ( n ) ( x , y ) ↑ f ( x , y ) f^{(n)} (x, y) \uparrow f(x, y) f ( n ) ( x , y ) ↑ f ( x , y ) , by monotone convergence theorem,
∫ X ∫ Y f ( x , y ) d μ 2 d μ 1 = lim n ∫ X ∫ Y f ( n ) ( x , y ) d μ 2 d μ 1 = lim n ∫ Ω f ( n ) ( x , y ) d μ ˉ = ∫ Ω lim n f ( n ) ( x , y ) d μ ˉ = ∫ Ω f ( x , y ) d μ ˉ .
\begin{aligned}
\int_X \int_Y f(x, y) d\, \mu_2 \, d\, \mu_1
&=
\lim_n \int_X \int_Y f^{ (n) } (x, y) d\, \mu_2 \, d\, \mu_1 \\
&=
\lim_n \int_{\Omega } f^{ (n) } (x, y) d\, \bar \mu \\
&=
\int_{\Omega } \lim_n f^{ (n) } (x, y) d\, \bar \mu \\
&= \int_{\Omega } f (x, y) d\, \bar \mu.
\end{aligned}
∫ X ∫ Y f ( x , y ) d μ 2 d μ 1 = n lim ∫ X ∫ Y f ( n ) ( x , y ) d μ 2 d μ 1 = n lim ∫ Ω f ( n ) ( x , y ) d μ ˉ = ∫ Ω n lim f ( n ) ( x , y ) d μ ˉ = ∫ Ω f ( x , y ) d μ ˉ . Case Three. Suppose that f ( x , y ) f(x, y) f ( x , y ) is a measurable and integrable function on X × Y X \times Y X × Y , i.e., ∫ Ω ∣ f ( x , y ) ∣ d μ ˉ < ∞ \int_{\Omega } |f(x, y)| d\, \bar \mu < \infty ∫ Ω ∣ f ( x , y ) ∣ d μ ˉ < ∞ .
Write f ( x , y ) = f + ( x , y ) − f − ( x , y ) f(x, y) = f^+(x, y) - f^-(x, y) f ( x , y ) = f + ( x , y ) − f − ( x , y ) , such that f + ( x , y ) , f − ( x , y ) ≥ 0 f^+(x, y), f^-(x, y) \ge 0 f + ( x , y ) , f − ( x , y ) ≥ 0 are measurable and integrable.
For a fixed x ∈ X x \in X x ∈ X , since both f x + ( y ) ≐ f + ( x , y ) , f x − ( y ) ≐ f − ( x , y ) f^+_x(y) \doteq f^+(x, y), f^-_x(y) \doteq f^-(x, y) f x + ( y ) ≐ f + ( x , y ) , f x − ( y ) ≐ f − ( x , y ) are F 2 \mathcal{F}_2 F 2 measurable, so is the function f x ( y ) ≐ f ( x , y ) = f + ( x , y ) − f − ( x , y ) f_x (y) \doteq f(x, y) = f^+(x, y) - f^-(x, y) f x ( y ) ≐ f ( x , y ) = f + ( x , y ) − f − ( x , y ) is F 2 \mathcal{F}_2 F 2 .
Since f + ( x , y ) , f − ( x , y ) ≥ 0 f^+(x, y), f^-(x, y) \ge 0 f + ( x , y ) , f − ( x , y ) ≥ 0 are measurable and integrable, we have
∫ X ∫ Y f + ( x , y ) d μ 2 d μ 1 = ∫ Ω f + ( x , y ) d μ ˉ < ∞ , ∫ X ∫ Y f − ( x , y ) d μ 2 d μ 1 = ∫ Ω f − ( x , y ) d μ ˉ < ∞ .
\begin{aligned}
\int_X \int_Y f^+(x, y) d\, \mu_2 \, d\, \mu_1 = \int_{\Omega } f^+(x, y) d\, \bar \mu < \infty,
\\
\int_X \int_Y f^-(x, y) d\, \mu_2 \, d\, \mu_1 = \int_{\Omega } f^-(x, y) d\, \bar \mu < \infty.
\end{aligned}
∫ X ∫ Y f + ( x , y ) d μ 2 d μ 1 = ∫ Ω f + ( x , y ) d μ ˉ < ∞ , ∫ X ∫ Y f − ( x , y ) d μ 2 d μ 1 = ∫ Ω f − ( x , y ) d μ ˉ < ∞. It follows that ∃ A ⊆ F 1 \exists A \subseteq \mathcal{F}_1 ∃ A ⊆ F 1 , s.t., μ 1 ( A ) = 0 \mu_1(A) = 0 μ 1 ( A ) = 0 and g + ( x ) ≐ ∫ Y f + ( x , y ) d μ 2 g^+(x) \doteq \int_Y f^+(x, y) d\, \mu_2 g + ( x ) ≐ ∫ Y f + ( x , y ) d μ 2 and g − ( x ) ≐ ∫ Y f − ( x , y ) d μ 2 g^-(x) \doteq \int_Y f^-(x, y) d\, \mu_2 g − ( x ) ≐ ∫ Y f − ( x , y ) d μ 2 are finite on X ∖ A X \setminus A X ∖ A .
Define
g ( x ) = { ∫ Y f x ( y ) d μ 2 = g + ( x ) − g − ( x ) , if x ∈ X ∖ A 0 , if x ∈ A .
g(x) =
\begin{cases}
\int_Y f_x(y) d\, \mu_2
=
g^+(x) - g^-(x), & \text{if } x \in X \setminus A \\
0, & \text{if } x \in A
\end{cases}.
g ( x ) = { ∫ Y f x ( y ) d μ 2 = g + ( x ) − g − ( x ) , 0 , if x ∈ X ∖ A if x ∈ A . Then g ( x ) g(x) g ( x ) is F 1 \mathcal{F}_1 F 1 measurable.
We have
∫ X ∖ A ∫ Y f ( x , y ) d μ 2 d μ 1 = ∫ X ∖ A g + ( x ) d μ 1 − ∫ X ∖ A g − ( x ) d μ 2 d μ 1 = ∫ X g + ( x ) d μ 1 − ∫ X g − ( x ) d μ 2 d μ 1 = ∫ Ω f + ( x , y ) d μ ˉ − ∫ Ω f − ( x , y ) d μ ˉ = ∫ Ω f + ( x , y ) − f − ( x , y ) d μ ˉ = ∫ Ω f ( x , y ) d μ ˉ .
\begin{aligned}
\int_{X \setminus A} \int_Y f(x, y) d\, \mu_2 \, d\, \mu_1
&=
\int_{X \setminus A} g^+(x) \, d\, \mu_1 -
\int_{X \setminus A} g^-(x) d\, \mu_2 \, d\, \mu_1 \\
&=
\int_X g^+(x) \, d\, \mu_1 -
\int_X g^-(x) d\, \mu_2 \, d\, \mu_1 \\
&=
\int_{\Omega } f^+(x, y) d\, \bar \mu - \int_{\Omega } f^-(x, y) d\, \bar \mu \\
&=
\int_{\Omega } f^+(x, y) - f^-(x, y) d\, \bar \mu \\
&= \int_{\Omega } f (x, y) d\, \bar \mu.
\end{aligned}
∫ X ∖ A ∫ Y f ( x , y ) d μ 2 d μ 1 = ∫ X ∖ A g + ( x ) d μ 1 − ∫ X ∖ A g − ( x ) d μ 2 d μ 1 = ∫ X g + ( x ) d μ 1 − ∫ X g − ( x ) d μ 2 d μ 1 = ∫ Ω f + ( x , y ) d μ ˉ − ∫ Ω f − ( x , y ) d μ ˉ = ∫ Ω f + ( x , y ) − f − ( x , y ) d μ ˉ = ∫ Ω f ( x , y ) d μ ˉ . □ \square □
Proof of the Lemma
Lemma. Given E ∈ σ ( S ) E \in \sigma( \mathcal{S} ) E ∈ σ ( S ) , let I E \mathbb{I}_E I E be the indicator for ( x , y ) ∈ E (x, y) \in E ( x , y ) ∈ E . Then
For each x ∈ X x \in X x ∈ X , the function f x ( y ) ≐ I E ( x , y ) f_x(y) \doteq \mathbb{I}_E (x, y) f x ( y ) ≐ I E ( x , y ) is F 2 \mathcal{F}_2 F 2 measurable.
The function g ( x ) ≐ ∫ Y I E ( x , y ) d μ 2 g(x) \doteq \int_Y \mathbb{I}_E (x, y) d\, \mu_2 g ( x ) ≐ ∫ Y I E ( x , y ) d μ 2 is F 1 \mathcal{F}_1 F 1 measurable.
∫ X ∫ Y I E ( x , y ) d μ 2 d μ 1 = ∫ Ω I E ( x , y ) d μ ˉ .
\int_X \int_Y \mathbb{I}_E (x, y) d\, \mu_2 \, d\, \mu_1
= \int_{\Omega } \mathbb{I}_E (x, y) d\, \bar \mu.
∫ X ∫ Y I E ( x , y ) d μ 2 d μ 1 = ∫ Ω I E ( x , y ) d μ ˉ .
There are various ways to prove this lemma.
We present two proofs here.
Proof One
Since X X X and Y Y Y are both σ \sigma σ -finite, there exists A k ∈ F 1 , μ 1 ( A k ) < ∞ , ∀ n ∈ N + A_k \in \mathcal{F}_1, \mu_1(A_k) < \infty, \forall n \in \mathbb{N}^+ A k ∈ F 1 , μ 1 ( A k ) < ∞ , ∀ n ∈ N + , s.t., A k ↑ X A_k \uparrow X A k ↑ X , and B k ∈ F 2 , μ 2 ( B k ) < ∞ , ∀ n ∈ N + B_k \in \mathcal{F}_2, \mu_2(B_k) < \infty, \forall n \in \mathbb{N}^+ B k ∈ F 2 , μ 2 ( B k ) < ∞ , ∀ n ∈ N + , s.t., B k ↑ Y B_k \uparrow Y B k ↑ Y .
It follows that Ω k ≐ A k × B k ↑ Ω \Omega_k \doteq A_k \times B_k \uparrow \Omega Ω k ≐ A k × B k ↑ Ω , and that μ ( Ω k ) < ∞ \mu(\Omega_k) < \infty μ ( Ω k ) < ∞ .
Define
L k ≐ { E ∈ σ ( S ) : E ∩ Ω k satisfies the conditions in the Lemma } .
\mathcal{L}_k \doteq \{
E \in \sigma(\mathcal{S}) :
E \cap \Omega_k \, \text{ satisfies the conditions in the Lemma }
\}.
L k ≐ { E ∈ σ ( S ) : E ∩ Ω k satisfies the conditions in the Lemma } .
Claim. If L k = σ ( S ) \mathcal{L}_k = \sigma(\mathcal{S}) L k = σ ( S ) ,
then the lemma holds.
Proof of the Claim.
For each E ∈ σ ( S ) E \in \sigma(\mathcal{S}) E ∈ σ ( S ) ,
For fixed x ∈ X x \in X x ∈ X . The functions f x ( k ) ( y ) ≐ I E ∩ Ω k ( x , y ) ↑ f x ( y ) f_x^{ (k) } (y) \doteq \mathbb{I}_{E \cap \Omega_k} (x, y) \uparrow f_x(y) f x ( k ) ( y ) ≐ I E ∩ Ω k ( x , y ) ↑ f x ( y ) . Since they are F 2 \mathcal{F}_2 F 2 measurable, so is f x ( y ) ≐ f ( x , y ) f_x (y) \doteq f(x, y) f x ( y ) ≐ f ( x , y ) .
Let g ( k ) ( x ) ≐ ∫ Y I E ∩ Ω k ( x , y ) d μ 2 g^{(k)} (x) \doteq \int_Y \mathbb{I}_{E \cap \Omega_k} (x, y) d\, \mu_2 g ( k ) ( x ) ≐ ∫ Y I E ∩ Ω k ( x , y ) d μ 2 are increasing.
Since 0 ≤ f x ( n ) ( y ) ↑ f x ( y ) 0 \le f_x^{ (n) } (y) \uparrow f_x(y) 0 ≤ f x ( n ) ( y ) ↑ f x ( y ) , by monotone convergence theorem: by monotone convergence theorem:
g ( x ) = ∫ Y f x ( y ) d μ 2 = lim k ∫ Y I E ∩ Ω k ( x , y ) d μ 2 = lim k g ( k ) ( x )
g(x) =
\int_Y f_x(y) d\, \mu_2
=
\lim_k \int_Y \mathbb{I}_{E \cap \Omega_k} (x, y) d\, \mu_2
=
\lim_k g^{(k)} (x)
g ( x ) = ∫ Y f x ( y ) d μ 2 = k lim ∫ Y I E ∩ Ω k ( x , y ) d μ 2 = k lim g ( k ) ( x ) It follows that g ( k ) ( x ) ↑ g ( x ) g^{(k)} (x) \uparrow g(x) g ( k ) ( x ) ↑ g ( x ) .
Since they are F 1 \mathcal{F}_1 F 1 measurable, so is g ( x ) g(x) g ( x ) .
Since ∫ Y I E ∩ Ω k ( x , y ) d μ 2 ↑ ∫ Y I E ( x , y ) d μ 2 \int_Y \mathbb{I}_{E \cap \Omega_k} (x, y) d\, \mu_2 \uparrow \int_Y \mathbb{I}_E (x, y) d\, \mu_2 \, ∫ Y I E ∩ Ω k ( x , y ) d μ 2 ↑ ∫ Y I E ( x , y ) d μ 2 , ∫ X ∫ Y I E ∩ Ω k ( x , y ) d μ 2 d μ 1 = ∫ Ω I E ∩ Ω k ( x , y ) d μ ˉ \int_X \int_Y \mathbb{I}_{E \cap \Omega_k} (x, y) d\, \mu_2 \, d\, \mu_1 = \int_{\Omega } \mathbb{I}_{E \cap \Omega_k} (x, y) d\, \bar \mu \, ∫ X ∫ Y I E ∩ Ω k ( x , y ) d μ 2 d μ 1 = ∫ Ω I E ∩ Ω k ( x , y ) d μ ˉ , and I E ∩ Ω k ( x , y ) ↑ I E ( x , y ) \mathbb{I}_{E \cap \Omega_k} (x, y) \uparrow \mathbb{I}_E (x, y) I E ∩ Ω k ( x , y ) ↑ I E ( x , y ) , by monotone convergence theorem,
∫ X ∫ Y I E ( x , y ) d μ 2 d μ 1 = lim k ∫ X ∫ Y I E ∩ Ω k ( x , y ) d μ 2 d μ 1 = lim k ∫ Ω I E ∩ Ω k ( x , y ) d μ ˉ = ∫ Ω lim k I E ∩ Ω k ( x , y ) d μ ˉ = ∫ Ω I E ( x , y ) d μ ˉ .
\begin{aligned}
\int_X \int_Y \mathbb{I}_E (x, y) d\, \mu_2 \, d\, \mu_1
&=
\lim_k \int_X \int_Y \mathbb{I}_{E \cap \Omega_k} (x, y) d\, \mu_2 \, d\, \mu_1 \\
&=
\lim_k \int_{\Omega } \mathbb{I}_{E \cap \Omega_k} (x, y) d\, \bar \mu \\
&=
\int_{\Omega } \lim_k \mathbb{I}_{E \cap \Omega_k} (x, y) d\, \bar \mu \\
&= \int_{\Omega } \mathbb{I}_E (x, y) d\, \bar \mu.
\end{aligned}
∫ X ∫ Y I E ( x , y ) d μ 2 d μ 1 = k lim ∫ X ∫ Y I E ∩ Ω k ( x , y ) d μ 2 d μ 1 = k lim ∫ Ω I E ∩ Ω k ( x , y ) d μ ˉ = ∫ Ω k lim I E ∩ Ω k ( x , y ) d μ ˉ = ∫ Ω I E ( x , y ) d μ ˉ . □ \square □
It is left to prove that L k = σ ( S ) \mathcal{L}_k = \sigma(\mathcal{S}) L k = σ ( S ) .
The proof relies on the following fact.
Fact. If S ~ \tilde{S} S ~ is an algebra, then the monotone class M ( S ~ ) \mathcal{M}(\tilde{S}) M ( S ~ ) generated by S ~ \tilde{S} S ~ equals σ ( S ~ ) \sigma(\tilde{S}) σ ( S ~ ) .
The proof consists of two steps:
In what follows, to ease the notations, we write L k \mathcal{L}_k L k as L \mathcal{L} L and assume that μ ( Ω ) < ∞ \mu(\Omega) < \infty μ ( Ω ) < ∞ .
L \mathcal{L} L contains the algebra S ~ \tilde{S} S ~ generated by S S S .
Let E = + i ( A i × B i ) E = +_i \big( A_i \times B_i \big) E = + i ( A i × B i ) for a finite sequence of disjoint rectangles A i × B i A_i \times B_i A i × B i .
For each x ∈ X x \in X x ∈ X , the function f x ( y ) ≐ I E ( x , y ) f_x(y) \doteq \mathbb{I}_E (x, y) f x ( y ) ≐ I E ( x , y ) is a simple function on Y Y Y and there F 2 \mathcal{F}_2 F 2 measurable.
The function
g ( x ) = ∫ Y I E ( x , y ) d μ 2 = ∑ i I A i ( x ) ⋅ μ 2 ( B i )
g(x) =
\int_Y \mathbb{I}_E (x, y) d\, \mu_2
=
\sum_i \mathbb{I}_{A_i} (x) \cdot \mu_2(B_i)
g ( x ) = ∫ Y I E ( x , y ) d μ 2 = i ∑ I A i ( x ) ⋅ μ 2 ( B i ) is a simple function on X X X and there F 1 \mathcal{F}_1 F 1 measurable.
∫ X g ( x ) d μ 1 = μ 1 ( A ) ⋅ μ 2 ( B ) = μ ˉ ( E ) = ∫ Ω I E ( x , y ) d μ ˉ .
\int_X g(x) \, d\, \mu_1
= \mu_1 (A) \cdot \mu_2 (B)
= \bar \mu (E)
= \int_{\Omega } \mathbb{I}_E (x, y) d\, \bar \mu.
∫ X g ( x ) d μ 1 = μ 1 ( A ) ⋅ μ 2 ( B ) = μ ˉ ( E ) = ∫ Ω I E ( x , y ) d μ ˉ . L \mathcal{L} L is a monotone class.
Case One E n ∈ L , n ∈ N + E_n \in \mathcal{L}, n \in \mathbb{N}^+ E n ∈ L , n ∈ N + , s.t., E n ↑ E E_n \uparrow E E n ↑ E
For each x ∈ X x \in X x ∈ X , we have f x ( n ) ( y ) = I E n ( x , y ) ↑ f x ( y ) f_x^{ (n) } (y) = \mathbb{I}_{E_n} (x, y) \uparrow f_x(y) f x ( n ) ( y ) = I E n ( x , y ) ↑ f x ( y ) .
Since the f x ( n ) ( y ) f_x^{ (n) } (y) f x ( n ) ( y ) F 2 \mathcal{F}_2 F 2 measurable, so is the function f x ( y ) f_x(y) f x ( y ) .
Let g ( n ) ( x ) ≐ ∫ Y f ( n ) ( x , y ) d μ 2 g^{(n)} (x) \doteq \int_Y f^{ (n) } (x, y) d\, \mu_2 g ( n ) ( x ) ≐ ∫ Y f ( n ) ( x , y ) d μ 2 .
Since 0 ≤ f x ( n ) ( y ) ↑ f x ( y ) 0 \le f_x^{ (n) } (y) \uparrow f_x(y) 0 ≤ f x ( n ) ( y ) ↑ f x ( y ) , by monotone convergence theorem:
g ( x ) = ∫ Y f x ( y ) d μ 2 = lim n ∫ Y f x ( n ) ( y ) d μ 2 = lim n g ( n ) ( x )
g(x) =
\int_Y f_x(y) d\, \mu_2
=
\lim_n \int_Y f_x^{ (n) } (y) d\, \mu_2
=
\lim_n g^{(n)} (x)
g ( x ) = ∫ Y f x ( y ) d μ 2 = n lim ∫ Y f x ( n ) ( y ) d μ 2 = n lim g ( n ) ( x ) It follows that g ( n ) ( x ) ↑ g ( x ) g^{(n)} (x) \uparrow g(x) g ( n ) ( x ) ↑ g ( x ) .
Since they are F 1 \mathcal{F}_1 F 1 measurable, so is g ( x ) g(x) g ( x ) .
Since ∫ Y f ( n ) ( x , y ) d μ 2 ↑ ∫ Y f ( x , y ) d μ 2 \int_Y f^{ (n) } (x, y) d\, \mu_2 \uparrow \int_Y f(x, y) d\, \mu_2 \, ∫ Y f ( n ) ( x , y ) d μ 2 ↑ ∫ Y f ( x , y ) d μ 2 , ∫ X ∫ Y f ( n ) ( x , y ) d μ 2 d μ 1 = ∫ Ω f ( n ) ( x , y ) d μ ˉ \int_X \int_Y f^{ (n) } (x, y) d\, \mu_2 \, d\, \mu_1 = \int_{\Omega } f^{ (n) } (x, y) d\, \bar \mu \, ∫ X ∫ Y f ( n ) ( x , y ) d μ 2 d μ 1 = ∫ Ω f ( n ) ( x , y ) d μ ˉ , and f ( n ) ( x , y ) ↑ f ( x , y ) f^{(n)} (x, y) \uparrow f(x, y) f ( n ) ( x , y ) ↑ f ( x , y ) , by monotone convergence theorem,
∫ X ∫ Y f ( x , y ) d μ 2 d μ 1 = lim n ∫ X ∫ Y f ( n ) ( x , y ) d μ 2 d μ 1 = lim n ∫ Ω f ( n ) ( x , y ) d μ ˉ = ∫ Ω lim n f ( n ) ( x , y ) d μ ˉ = ∫ Ω f ( x , y ) d μ ˉ .
\begin{aligned}
\int_X \int_Y f(x, y) d\, \mu_2 \, d\, \mu_1
&=
\lim_n \int_X \int_Y f^{ (n) } (x, y) d\, \mu_2 \, d\, \mu_1 \\
&=
\lim_n \int_{\Omega } f^{ (n) } (x, y) d\, \bar \mu \\
&=
\int_{\Omega } \lim_n f^{ (n) } (x, y) d\, \bar \mu \\
&= \int_{\Omega } f (x, y) d\, \bar \mu.
\end{aligned}
∫ X ∫ Y f ( x , y ) d μ 2 d μ 1 = n lim ∫ X ∫ Y f ( n ) ( x , y ) d μ 2 d μ 1 = n lim ∫ Ω f ( n ) ( x , y ) d μ ˉ = ∫ Ω n lim f ( n ) ( x , y ) d μ ˉ = ∫ Ω f ( x , y ) d μ ˉ . Case Two E n ∈ L , n ∈ N + E_n \in \mathcal{L}, n \in \mathbb{N}^+ E n ∈ L , n ∈ N + , s.t., E n ↓ E E_n \downarrow E E n ↓ E
For each x ∈ X x \in X x ∈ X , we have f x ( n ) ( y ) = I E n ( x , y ) ↓ f x ( y ) f_x^{ (n) } (y) = \mathbb{I}_{E_n} (x, y) \downarrow f_x(y) f x ( n ) ( y ) = I E n ( x , y ) ↓ f x ( y ) .
Since the f x ( n ) ( y ) f_x^{ (n) } (y) f x ( n ) ( y ) are F 2 \mathcal{F}_2 F 2 measurable, so is the function f x ( y ) f_x(y) f x ( y ) .
Since f x ( n ) ( y ) = I E n ( x , y ) ↓ f x ( y ) f_x^{ (n) } (y) = \mathbb{I}_{E_n} (x, y) \downarrow f_x(y) f x ( n ) ( y ) = I E n ( x , y ) ↓ f x ( y ) and f x ( n ) ( y ) ≤ 1 f_x^{ (n) } (y) \le 1 f x ( n ) ( y ) ≤ 1 , 0 ≤ 1 − f x ( n ) ( y ) ↑ 1 − f x ( y ) 0 \le 1 - f_x^{ (n) } (y) \uparrow 1 - f_x(y) 0 ≤ 1 − f x ( n ) ( y ) ↑ 1 − f x ( y ) .
By monotone convergence theorem:
μ 2 ( Y ) − lim n g ( n ) ( x ) = lim n ∫ Y ( 1 − f x ( n ) ( y ) ) d μ 2 = ∫ Y ( 1 − f x ( y ) ) d μ 2 = μ 2 ( Y ) − g ( x ) .
\begin{aligned}
\mu_2(Y) - \lim_n g^{(n)} (x)
&= \lim_n \int_Y \left( 1 - f_x^{ (n) } (y) \right) d\, \mu_2 \\
&= \int_Y \left( 1 - f_x(y) \right) d\, \mu_2 \\
&= \mu_2(Y) - g(x).
\end{aligned}
μ 2 ( Y ) − n lim g ( n ) ( x ) = n lim ∫ Y ( 1 − f x ( n ) ( y ) ) d μ 2 = ∫ Y ( 1 − f x ( y ) ) d μ 2 = μ 2 ( Y ) − g ( x ) . Since μ 2 ( Y ) < ∞ \mu_2(Y) < \infty μ 2 ( Y ) < ∞ , lim n g ( n ) ( x ) = g ( x ) \lim_n g^{(n)} (x) = g(x) lim n g ( n ) ( x ) = g ( x ) .
Since they are F 1 \mathcal{F}_1 F 1 measurable, so is g ( x ) g(x) g ( x ) .
Since 0 ≤ μ 2 ( Y ) − ∫ Y f ( n ) ( x , y ) d μ 2 ↑ μ 2 ( Y ) − ∫ Y f ( x , y ) d μ 2 0 \le \mu_2(Y) - \int_Y f^{ (n) } (x, y) d\, \mu_2 \uparrow \mu_2(Y) - \int_Y f(x, y) d\, \mu_2 \, 0 ≤ μ 2 ( Y ) − ∫ Y f ( n ) ( x , y ) d μ 2 ↑ μ 2 ( Y ) − ∫ Y f ( x , y ) d μ 2 , ∫ X ∫ Y f ( n ) ( x , y ) d μ 2 d μ 1 = ∫ Ω f ( n ) ( x , y ) d μ ˉ \int_X \int_Y f^{ (n) } (x, y) d\, \mu_2 \, d\, \mu_1 = \int_{\Omega } f^{ (n) } (x, y) d\, \bar \mu \, ∫ X ∫ Y f ( n ) ( x , y ) d μ 2 d μ 1 = ∫ Ω f ( n ) ( x , y ) d μ ˉ , and 0 ≤ 1 − f ( n ) ( x , y ) ↑ 1 − f ( x , y ) 0 \le 1 - f^{(n)} (x, y) \uparrow 1 - f(x, y) 0 ≤ 1 − f ( n ) ( x , y ) ↑ 1 − f ( x , y ) , by monotone convergence theorem,
μ ( Ω ) − ∫ X ∫ Y f ( x , y ) d μ 2 d μ 1 = ∫ X ( μ 2 ( Y ) − ∫ Y f ( x , y ) d μ 2 ) d μ 1 = lim n ∫ X ( μ 2 ( Y ) − ∫ Y f ( n ) ( x , y ) d μ 2 ) d μ 1 = μ ( Ω ) − lim n ∫ Ω f ( n ) ( x , y ) d μ ˉ = lim n ∫ Ω ( 1 − f ( n ) ( x , y ) ) d μ ˉ = ∫ Ω lim n ( 1 − f ( n ) ( x , y ) ) d μ ˉ = μ ( Ω ) − ∫ Ω f ( x , y ) d μ ˉ .
\begin{aligned}
\mu(\Omega) - \int_X \int_Y f(x, y) d\, \mu_2 \, d\, \mu_1
&=
\int_X \left( \mu_2(Y) - \int_Y f(x, y) d\, \mu_2 \right) \, d\, \mu_1 \\
&=
\lim_n \int_X \left( \mu_2(Y) - \int_Y f^{ (n) } (x, y) d\, \mu_2 \right) \, d\, \mu_1 \\
&=
\mu(\Omega) - \lim_n \int_{\Omega } f^{ (n) } (x, y) d\, \bar \mu \\
&=
\lim_n \int_{\Omega } \left( 1 - f^{ (n) } (x, y) \right) d\, \bar \mu \\
&=
\int_{\Omega } \lim_n \left(1 - f^{ (n) } (x, y) \right) d\, \bar \mu \\
&= \mu(\Omega) - \int_{\Omega } f (x, y) d\, \bar \mu.
\end{aligned}
μ ( Ω ) − ∫ X ∫ Y f ( x , y ) d μ 2 d μ 1 = ∫ X ( μ 2 ( Y ) − ∫ Y f ( x , y ) d μ 2 ) d μ 1 = n lim ∫ X ( μ 2 ( Y ) − ∫ Y f ( n ) ( x , y ) d μ 2 ) d μ 1 = μ ( Ω ) − n lim ∫ Ω f ( n ) ( x , y ) d μ ˉ = n lim ∫ Ω ( 1 − f ( n ) ( x , y ) ) d μ ˉ = ∫ Ω n lim ( 1 − f ( n ) ( x , y ) ) d μ ˉ = μ ( Ω ) − ∫ Ω f ( x , y ) d μ ˉ . Observing that μ ( Ω ) < ∞ \mu(\Omega) < \infty μ ( Ω ) < ∞ finishes the proof.
□ \square □
Proof Two
Lemma. Given E ∈ σ ( S ) E \in \sigma( \mathcal{S} ) E ∈ σ ( S ) , let f ( x , y ) = I E ( x , y ) f(x, y) = \mathbb{I}_E (x, y) f ( x , y ) = I E ( x , y ) be the indicator for ( x , y ) ∈ E (x, y) \in E ( x , y ) ∈ E . Then
For each x ∈ X x \in X x ∈ X , the function f x ( y ) ≐ I E ( x , y ) f_x(y) \doteq \mathbb{I}_E (x, y) f x ( y ) ≐ I E ( x , y ) is F 2 \mathcal{F}_2 F 2 measurable.
The function g ( x ) ≐ ∫ Y I E ( x , y ) d μ 2 g(x) \doteq \int_Y \mathbb{I}_E (x, y) d\, \mu_2 g ( x ) ≐ ∫ Y I E ( x , y ) d μ 2 is F 1 \mathcal{F}_1 F 1 measurable.
∫ X ∫ Y I E ( x , y ) d μ 2 d μ 1 = ∫ Ω I E ( x , y ) d μ ˉ .
\int_X \int_Y \mathbb{I}_E (x, y) d\, \mu_2 \, d\, \mu_1
= \int_{\Omega } \mathbb{I}_E (x, y) d\, \bar \mu.
∫ X ∫ Y I E ( x , y ) d μ 2 d μ 1 = ∫ Ω I E ( x , y ) d μ ˉ .
Proof of (1).
Definition. Let E x ≐ { y : ( x , y ) ∈ E } E_x \doteq \begin{Bmatrix} y : (x, y) \in E \end{Bmatrix} E x ≐ { y : ( x , y ) ∈ E } be the cross-section at x x x .
It suffices to show that
Claim. For each x ∈ X x \in X x ∈ X and E ∈ σ ( S ) E \in \sigma(\mathcal{S}) E ∈ σ ( S ) , E x ∈ F 2 E_x \in \mathcal{F}_2 E x ∈ F 2 .
Proof of the Claim.
Fix an x ∈ X x \in X x ∈ X .
Define the function T x : Y → X × Y T_x : Y \rightarrow X \times Y T x : Y → X × Y by T x ( y ) ≐ ( x , y ) . T_x (y) \doteq (x, y). T x ( y ) ≐ ( x , y ) .
Then for each E = A × B ∈ S E = A \times B \in \mathcal{S} E = A × B ∈ S ,
T x − 1 ( E ) = E x = { B , if x ∈ A , ∅ , otherwise .
T_x^{-1} (E)
= E_x
= \begin{cases}
B, &\text{ if } x \in A, \\
\emptyset, & \text{ otherwise }.
\end{cases}
T x − 1 ( E ) = E x = { B , ∅ , if x ∈ A , otherwise . Therefore T x − 1 ( E ) = E x ∈ F 2 T_x^{-1} (E) = E_x \in \mathcal{F}_2 T x − 1 ( E ) = E x ∈ F 2 .
Since S \mathcal{S} S generates σ ( S ) \sigma(\mathcal{S}) σ ( S ) , we conclude that T x T_x T x is measurable F 2 / σ ( S ) \mathcal{F}_2 / \sigma(\mathcal{S}) F 2 / σ ( S ) .
□ \square □
Proof of (2) and (3).
Define the set L ⊆ σ ( S ) \mathcal{L} \subseteq \sigma(\mathcal{S}) L ⊆ σ ( S ) as the collection of E E E for which the condition (2) and (3) hold.
Clearly it holds that S ⊆ L \mathcal{S} \subseteq \mathcal{L} S ⊆ L ;
We show that L \mathcal{L} L is a λ \lambda λ system.
Since S \mathcal{S} S is a π \pi π system, via Dynkin's π − λ \pi-\lambda π − λ theorem, L \mathcal{L} L is a σ \sigma σ -algebra, and hence L = σ ( S ) \mathcal{L} = \sigma(\mathcal{S}) L = σ ( S ) .
We will now check that L \mathcal{L} L is a λ \lambda λ -system.
With the same technique applied in previous proof, we can suppose without loss of generality that μ ( Ω ) < ∞ \mu(\Omega) < \infty μ ( Ω ) < ∞ .
Ω ∈ L \Omega \in \mathcal{L} Ω ∈ L .
If E ∈ L E \in \mathcal{L} E ∈ L , then E ˉ ∈ L \bar E \in \mathcal{L} E ˉ ∈ L .
First, observe that E ˉ x = Ω x − E x = B − E x ∈ F 2 \bar E_x = \Omega_x - E_x = B - E_x \in \mathcal{F}_2 E ˉ x = Ω x − E x = B − E x ∈ F 2 .
Since μ 2 ( B ) < ∞ \mu_2(B) < \infty μ 2 ( B ) < ∞ ,
g E ˉ ( x ) = μ 2 ( E ˉ x ) = μ 2 ( Ω x − E x ) = μ 2 ( B ) − μ 2 ( E x ) .
g_{\bar E} (x) = \mu_2 ( \bar E_x ) = \mu_2 (\Omega_x - E_x) = \mu_2 (B) - \mu_2 (E_x).
g E ˉ ( x ) = μ 2 ( E ˉ x ) = μ 2 ( Ω x − E x ) = μ 2 ( B ) − μ 2 ( E x ) . Since g E ( x ) = μ 2 ( E x ) g_E(x) = \mu_2 (E_x) g E ( x ) = μ 2 ( E x ) is F 1 \mathcal{F}_1 F 1 measurable, so is g E ˉ ( x ) g_{\bar E}(x) g E ˉ ( x ) .
Integrating over x x x gives
∫ X μ 2 ( E ˉ x ) d μ 1 = ∫ X μ 2 ( B ) d μ 1 − ∫ X μ 2 ( E x ) d μ 1 = μ ( Ω ) − μ ( E ) .
\begin{aligned}
\int_X \mu_2 ( \bar E_x ) \, d\, \mu_1
&= \int_X \mu_2 (B) \, d\, \mu_1 - \int_X \mu_2 (E_x) \, d\, \mu_1 \\
&= \mu (\Omega) - \mu(E).
\end{aligned}
∫ X μ 2 ( E ˉ x ) d μ 1 = ∫ X μ 2 ( B ) d μ 1 − ∫ X μ 2 ( E x ) d μ 1 = μ ( Ω ) − μ ( E ) . Since μ ( Ω ) < ∞ \mu(\Omega) < \infty μ ( Ω ) < ∞ , we have μ ( E ˉ ) = μ ( Ω ) − μ ( E ) = ∫ X μ 2 ( E ˉ x ) d μ 1 \mu(\bar E) = \mu (\Omega) - \mu(E) = \int_X \mu_2 ( \bar E_x ) \, d\, \mu_1 μ ( E ˉ ) = μ ( Ω ) − μ ( E ) = ∫ X μ 2 ( E ˉ x ) d μ 1 .
If E n ∈ L , n ∈ N + E_n \in \mathcal{L}, n \in \mathbb{N}^+ E n ∈ L , n ∈ N + is a disjoint sequence of sets, then ∪ n ≥ 1 E n ∈ L \cup_{n \ge 1} E_n \in \mathcal{L} ∪ n ≥ 1 E n ∈ L . Define g E n ( x ) ≐ μ 2 ( ( E n ) x ) g_{E_n} (x) \doteq \mu_2 ( (E_n)_x ) g E n ( x ) ≐ μ 2 (( E n ) x ) .
Then g ( x ) ≐ ∑ n ≥ 1 g E n ( x ) g(x) \doteq \sum_{n \ge 1} g_{E_n} (x) g ( x ) ≐ ∑ n ≥ 1 g E n ( x ) is F 1 \mathcal{F}_1 F 1 measurable, since g = sup n ≥ 1 ∑ k ∈ [ n ] g E k g = \sup_{n \ge 1} \sum_{k \in [n]} g_{E_k} g = sup n ≥ 1 ∑ k ∈ [ n ] g E k .
By monotone convergence theorem and that μ \mu μ is a measure, it holds that
∫ X g d μ 1 = ∫ X ∑ n ≥ 1 g E n d μ 1 = ∑ n ≥ 1 ∫ X g E n d μ 1 = ∑ n ≥ 1 μ ( E n ) = μ ( E ) .
\int_X g \, d\, \mu_1 = \int_X \sum_{n \ge 1} g_{E_n} \, d\, \mu_1 = \sum_{n \ge 1} \int_X g_{E_n} \, d\, \mu_1 = \sum_{n \ge 1} \mu (E_n) = \mu (E).
∫ X g d μ 1 = ∫ X n ≥ 1 ∑ g E n d μ 1 = n ≥ 1 ∑ ∫ X g E n d μ 1 = n ≥ 1 ∑ μ ( E n ) = μ ( E ) . Therefore, E ∈ L E \in \mathcal{L} E ∈ L .
□ \square □
Given a function f ( x , y ) f(x, y) f ( x , y ) , there is an easier way to prove that it is measurable F 2 / B \mathcal{F}_2 / \mathcal{B} F 2 / B when x x x is fixed, without approximating it by simple functions.
However, to prove the measurability of ∫ Y f ( x , y ) d μ 2 \int_Y f(x, y) \, d \mu_2 ∫ Y f ( x , y ) d μ 2 (as a function of x x x ), we still need to write it as the limit of simple functions.
Lemma. Let f : X × Y → R f: X \times Y \rightarrow \mathbb{R} f : X × Y → R be measurable σ ( S ) / B \sigma(\mathcal{S}) / \mathcal{B} σ ( S ) / B .
For each x ∈ X x \in X x ∈ X , the function f x : Y → R f_x : Y \rightarrow \mathbb{R} f x : Y → R defined by f x ( y ) = f ( x , y ) f_x(y) = f(x, y) f x ( y ) = f ( x , y ) is measurable F 2 / B \mathcal{F}_2 / \mathcal{B} F 2 / B .
Proof.
Note that f x = f ∘ T x f_x = f \circ T_x f x = f ∘ T x .
Since T x T_x T x is measurable F 2 / σ ( S ) \mathcal{F}_2 / \sigma(\mathcal{S}) F 2 / σ ( S ) and f f f is measurable σ ( S ) / B \sigma(\mathcal{S}) / \mathcal{B} σ ( S ) / B , it follows that f x f_x f x is measurable F 2 / B \mathcal{F}_2 / \mathcal{B} F 2 / B .
Or, specifically, for each Borel set W ∈ B W \in \mathcal{B} W ∈ B , since f f f is measurable σ ( S ) / B \sigma(\mathcal{S}) / \mathcal{B} σ ( S ) / B ,
E = f − 1 ( W ) = { ( x , y ) : f ( x , y ) ∈ W } ∈ σ ( S ) .
E = f^{-1} (W)
= \{ (x, y) : f(x, y) \in W \} \in \sigma (\mathcal{S}).
E = f − 1 ( W ) = {( x , y ) : f ( x , y ) ∈ W } ∈ σ ( S ) . Then
f x − 1 ( W ) = { y : f ( x , y ) ∈ W } = E x ∈ F 2 .
f_x^{-1} (W)
= \{ y : f(x, y) \in W \}
= E_x \in \mathcal{F}_2.
f x − 1 ( W ) = { y : f ( x , y ) ∈ W } = E x ∈ F 2 . □ \square □
For completeness, we include a proof for the following fact.
Observe that the technique applied here is similar to the one used in the proof for π \pi π -λ \lambda λ theorem.
Fact. If S ~ \tilde{S} S ~ is an algebra, then the monotone class M ( S ~ ) \mathcal{M}(\tilde{S}) M ( S ~ ) generated by S ~ \tilde{S} S ~ equals σ ( S ~ ) \sigma(\tilde{S}) σ ( S ~ ) .
Proof.
It is trivial to see M ( S ~ ) ⊆ σ ( S ~ ) \mathcal{M}(\tilde{S}) \subseteq \sigma(\tilde{S}) M ( S ~ ) ⊆ σ ( S ~ ) .
We prove the other direction by showing that M ( S ~ ) \mathcal{M}(\tilde{S}) M ( S ~ ) is an algebra.
The proof consists of two steps:
For each E ∈ S ~ E \in \tilde{S} E ∈ S ~ , we prove that
R ( E ) ≐ { F ∈ M ( S ~ ) : E ∪ F , F − E , E − F ∈ M ( S ~ ) } = M ( S ~ ) .
\mathcal{R}(E) \doteq \left\{
F \in \mathcal{M}(\tilde{S}) : E \cup F, F - E, E - F \in \mathcal{M}(\tilde{S})
\right\}
= \mathcal{M}(\tilde{S}).
R ( E ) ≐ { F ∈ M ( S ~ ) : E ∪ F , F − E , E − F ∈ M ( S ~ ) } = M ( S ~ ) . Clearly S ~ ⊆ R ( E ) \tilde{S} \subseteq \mathcal{R}(E) S ~ ⊆ R ( E ) .
We prove that R ( E ) \mathcal{R}(E) R ( E ) is a monotone class.
Suppose that F n → F F_n \rightarrow F F n → F is an increasing or decreasing sequence.
Then E ∪ F n , F n − E , E − F n E \cup F_n, F_n - E, E - F_n E ∪ F n , F n − E , E − F n are also increasing or decreasing sequences.
Therefore, E ∪ F , F − E , E − F ∈ R ( E ) E \cup F, F - E, E - F \in \mathcal{R}(E) E ∪ F , F − E , E − F ∈ R ( E ) .
For each E ∈ M ( S ~ ) E \in \mathcal{M}(\tilde{S}) E ∈ M ( S ~ ) , we prove that
R ( E ) ≐ { F ∈ M ( S ~ ) : E ∪ F , F − E , E − F ∈ M ( S ~ ) } = M ( S ~ ) .
\mathcal{R}(E) \doteq \left\{
F \in \mathcal{M}(\tilde{S}) : E \cup F, F - E, E - F \in \mathcal{M}(\tilde{S})
\right\}
= \mathcal{M}(\tilde{S}).
R ( E ) ≐ { F ∈ M ( S ~ ) : E ∪ F , F − E , E − F ∈ M ( S ~ ) } = M ( S ~ ) . If F ∈ S ~ F \in \tilde{S} F ∈ S ~ , then the previous claim E ∈ R ( F ) E \in \mathcal{R}(F) E ∈ R ( F ) .
Therefore, F ∈ R ( E ) F \in \mathcal{R}(E) F ∈ R ( E ) .
Following similar vein, we can also prove that R ( E ) \mathcal{R}(E) R ( E ) is a monotone class.
□ \square □
Reference
[1] R. Durrett, “Probability : theory and examples,” p. 432.
[2] S. J. Taylor, Introduction to measure and integration. Cambridge University Press, 1973.
[3] P. Billingsley, Probability and measure Anniversary Edition, 3rd ed. New York: Wiley, 1995.
← Back to all notes Back to top ↑