Let (X,F1,μ1)(X, \mathcal{F}_1, \mu_1) and (Y,F2,μ2)(Y, \mathcal{F}_2, \mu_2) be two σ\sigma-finite measure space.

Produce Measure Space

Consider the product space Ω=X×Y\Omega = X \times Y.

Definition. A measurable rectangle is a product A×BA \times B for which A∈F1A \in \mathcal{F}_1 and B∈F2B \in \mathcal{F}_2.

Denote the collection of measurable rectangles as

S≐{A×B,A∈F1,B∈F2}. \mathcal{S} \doteq \begin{Bmatrix} A \times B, A \in \mathcal{F}_1, B \in \mathcal{F}_2 \end{Bmatrix}.

We would like to construct a measure μ\mu on σ(S)\sigma(\mathcal{S}), the σ\sigma-field generated by S\mathcal{S}, thus

  1. For each A×B∈SA \times B \in \mathcal{S}, it's natural to define μ(A×B)=μ1(A)⋅μ2(B)\mu (A \times B) = \mu_1(A) \cdot \mu_2(B).

  2. We prove that S\mathcal{S} is a semialgebra.

  3. We show that μ\mu is a measure on S\mathcal{S}.

  4. Finally, it follows by the Caratheodory’s Extension Theorem, μ\mu has a unique extension on σ(S)\sigma(\mathcal{S}).

Lemma 1. S\mathcal{S} is a semialgebra.

Proof.

  • S\mathcal{S} is close under intersection: if A×B,C×D∈SA \times B, C \times D \in \mathcal{S}, then(A×B)∩(C×D)=(A∩C)×(B∩D). (A \times B) \cap (C \times D) = (A \cap C) \times (B \cap D).
  • The complement of element in S\mathcal{S} is a finite disjoint union of elements in S\mathcal{S}: if A×B∈SA \times B \in \mathcal{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 ), 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 ).

□\square

Lemma 2. μ\mu is a measure on S\mathcal{S}.

Proof. It suffices to prove σ\sigma-additivity of μ\mu. Suppose A×B=+i≥1(Ai×Bi)A \times B = +_{i \ge 1} (A_i \times B_i) is a countable disjoint union of elements in S\mathcal{S}.

Fix an x∈Ax \in A. For each y∈By \in B, we have (x,y)∈A×B(x, y) \in A \times B. As the sets {Ai×Bi}\begin{Bmatrix} A_i \times B_i \end{Bmatrix} consists of a partition of A×BA \times B, it follows that (x,y)(x, y) belongs to exactly one Ai×BiA_i \times B_i. Denote

I(x)≐{i:∃y∈B, s.t., (x,y)∈Ai×Bi}={i:x∈Ai}. 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}.

Then B=+i∈I(x)BiB = +_{i \in I(x) } B_i.

As μ2\mu_2 is a measure on YY, it is countably additive:

μ2(B)=∑i∈I(x)μ(Bi)  ⟹  IA(x)μ2(B)=∑i≥1IAi(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).

By monotone convergence theorem,

∫XIA(x)μ2(B) d μ1=∑i≥1∫XIAi(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,

which is

μ1(A)⋅μ2(B)=∑i≥1μ1(Ai)⋅μ2(Bi). \mu_1 (A) \cdot \mu_2 (B) = \sum_{i \ge 1} \mu_1 (A_i) \cdot \mu_2 (B_i).

□\square

Theorem. μ\mu has a unique extension μˉ\bar \mu on σ(S)\sigma( \mathcal{S} ), the σ\sigma-field generated by S\mathcal{S}.

Proof. Note that S\mathcal{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 {ai:i∈N}\begin{Bmatrix} a_i : i \in \mathbb{N} \end{Bmatrix} be a countably sequence of numbers. Then the series converges to the same limit under permutation, if

  1. ai≥0,∀i∈Na_i \ge 0, \forall i \in \mathbb{N}. Note that ∑i≥1ai\sum_{i \ge 1} a_i can equal ∞\infty.

  2. ∑i≥1∣ai∣<∞\sum_{i \ge 1} | a_i | < \infty.

Integration is a generalization of discrete sum. Given a measure space (Ω,σ(S),μˉ)(\Omega, \sigma( \mathcal{S} ), \bar \mu), and a measure function ff, the integral of ff exists, if

  1. f≥0f \ge 0;
  2. Or ∫∣f∣d μˉ<∞\int |f| d\, \bar \mu < \infty.

In case that (Ω,σ(S),μˉ)(\Omega, \sigma( \mathcal{S} ), \bar \mu) 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≥0f \ge 0 or ∫∣f∣d μˉ<∞\int |f| d\, \bar \mu < \infty, then there exists A∈F1A \in \mathcal{F}_1, B∈F2B \in \mathcal{F}_2, s.t., μ1(A)=μ2(B)=0\mu_1 (A) = \mu_2 (B) = 0, and

∫X−A∫Yf(x,y)d μ2 d μ1=∫Ωf(x,y)d μˉ=∫Y−B∫Xf(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.

Remark. For the case concerning f≥0f \ge 0, we have A=B=∅A = B = \emptyset, and the Theorem is called Tonelli’s theorem.

Comparison with Discrete Sum

Let X=Y=NX = Y = \mathbb{N}, and μ1=μ2\mu_1 = \mu_2 be counting measures. Let {ai,j:i,j∈N}\begin{Bmatrix} a_{i,j} : i, j \in \mathbb{N} \end{Bmatrix} be a sequency of numbers and define f(i,j)=ai,jf(i, j) = a_{i,j}. Denote

E1≐{(i,j)∈N×N:ai,j≥0},E2≐{(i,j)∈N×N:ai,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}.

By definition of integration, ∫Ωf(x,y) d μˉ\int_\Omega f(x, y) \, d\, \bar \mu exists if

  1. Either f≥0f \ge 0. In this case

    ∫Ωf(x,y) d μˉ=sup⁡{∑(i,j)∈Sai,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},
  2. Or ∫Ω∣f(x,y)∣ d μˉ<∞\int_\Omega | f(x, y) | \, d\, \bar \mu < \infty. In this case,

    ∫Ωf(x,y) d μˉ=∫Ωf+ d μˉ−∫Ωf− d μˉ=sup⁡{∑(i,j)∈Sai,j: S⊆E1∣S∣<∞}−sup⁡{∑(i,j)∈Sai,j: S⊆E2∣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}

In the former case, the summation of elements in a chosen set SS 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 exists, the following iterated integrals exist:

∫X∫Yf(x,y)d μ2 d μ1=∑i≥1∑j≥1ai,j,∫Y∫Xf(x,y)d μ1 d μ2=∑j≥1∑i≥1ai,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}.

Further, their values are equal.

□\square

Proof of Fubini's Theorem

By symmetry, it suffices to prove that

∫X∫Yf(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.

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 xx is fixed, the function fx:Y→Rf_x : Y \rightarrow \mathbb{R} defined by fx(y)≐f(x,y)f_x(y) \doteq f(x, y) is F2\mathcal{F}_2 measurable, and the integral ∫Yf(x,y) d μ2\int_Y f(x, y) \, d\, \mu_2 exists.

  • There is F1\mathcal{F}_1 measurable function g:X→Rg : X \rightarrow \mathbb{R} such that g(x)=∫Yf(x,y) d μ2g(x) = \int_Y f(x, y) \, d\, \mu_2 almost everywhere.

We will first establish the theorem for indicator functions IE\mathbb{I}_E for sets E∈σ(S)E \in \sigma( \mathcal{S} ), which serve as basic building blocks for extending the theorem for more general functions.

Lemma. Given E∈σ(S)E \in \sigma( \mathcal{S} ), let IE\mathbb{I}_E be the indicator for (x,y)∈E(x, y) \in E. Then

  1. For each x∈Xx \in X, the function fx(y)≐IE(x,y)f_x(y) \doteq \mathbb{I}_E (x, y) is F2\mathcal{F}_2 measurable.

  2. The function g(x)≐∫YIE(x,y)d μ2g(x) \doteq \int_Y \mathbb{I}_E (x, y) d\, \mu_2 is F1\mathcal{F}_1 measurable.

  3. ∫X∫YIE(x,y)d μ2 d μ1=∫ΩIE(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.

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. ff is a simple function on (X×Y,σ(S))(X \times Y, \sigma(\mathcal{S})).

Case Two. f≥0f \ge 0 and is σ(S)\sigma(\mathcal{S}) measurable.

Case Three. ff 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]ci⋅IEi(x,y)f(x, y) = \sum_{i \in [n]} c_i \cdot \mathbb{I}_{E_i} (x, y) is a simple function on (X×Y,σ(S))(X \times Y, \sigma(\mathcal{S})).

  1. For fixed x∈Xx \in X, according the lemma, the functions fx(i)(y)≐IEi(x,y),i∈[n]f_x^{ (i) } (y) \doteq \mathbb{I}_{E_i} (x, y), i \in [n] are F2\mathcal{F}_2 measurable. It follows that function fx(y)=∑i∈[n]ci⋅fx(i)(y)f_x (y) = \sum_{i \in [n]} c_i \cdot f_x^{ (i) } (y) is F2\mathcal{F}_2 measurable.

  2. Since g(i)(x)≐∫YIEi(x,y)d μ2g^{(i)} (x) \doteq \int_Y \mathbb{I}_{E_i} (x, y) d\, \mu_2 is F1\mathcal{F}_1 measurable, so is the function

g(x)=∫Yfx(y)d μ2=∑i∈[n]ci⋅∫YIEi(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
  1. Since ∫X∫YIEi(x,y)d μ2 d μ1=∫ΩIEi(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∫Yf(x,y)d μ2 d μ1=∑i∈[n]ci⋅∫X∫YIEi(x,y)d μ2 d μ1=∑i∈[n]ci⋅∫ΩIEi(x,y)d μˉ=∫Ω∑i∈[n]ci⋅IEi(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}

Case Two. Suppose that f≥0f \ge 0 and is σ(S)\sigma(\mathcal{S}) measurable. Then there exists simple, nonnegative functions f(n)↑ff^{ (n) } \uparrow f.

  1. For fixed x∈Xx \in X. The functions fx(n)(y)≐f(n)(x,y)↑fx(y)f_x^{ (n) } (y) \doteq f^{ (n) } (x, y) \uparrow f_x(y). Since they are F2\mathcal{F}_2 measurable, so is fx(y)≐f(x,y)f_x (y) \doteq f(x, y).

  2. Let g(n)(x)≐∫Yf(n)(x,y)d μ2g^{(n)} (x) \doteq \int_Y f^{ (n) } (x, y) d\, \mu_2. Since 0≤fx(n)(y)↑fx(y)0 \le f_x^{ (n) } (y) \uparrow f_x(y), by monotone convergence theorem:

    g(x)=∫Yfx(y)d μ2=lim⁡n∫Yf(n)(x,y)d μ2=lim⁡ng(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)

    It follows that g(n)(x)↑g(x)g^{(n)} (x) \uparrow g(x). Since they are F1\mathcal{F}_1 measurable, so is g(x)g(x).

  3. Since ∫Yf(n)(x,y)d μ2↑∫Yf(x,y)d μ2 \int_Y f^{ (n) } (x, y) d\, \mu_2 \uparrow \int_Y f(x, y) d\, \mu_2 \,, ∫X∫Yf(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 \,, and f(n)(x,y)↑f(x,y)f^{(n)} (x, y) \uparrow f(x, y), by monotone convergence theorem,

∫X∫Yf(x,y)d μ2 d μ1=lim⁡n∫X∫Yf(n)(x,y)d μ2 d μ1=lim⁡n∫Ωf(n)(x,y)d μˉ=∫Ωlim⁡nf(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}

Case Three. Suppose that f(x,y)f(x, y) is a measurable and integrable function on X×YX \times Y, i.e., ∫Ω∣f(x,y)∣d μˉ<∞\int_{\Omega } |f(x, y)| d\, \bar \mu < \infty. Write 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)≥0f^+(x, y), f^-(x, y) \ge 0 are measurable and integrable.

  1. For a fixed x∈Xx \in X, since both fx+(y)≐f+(x,y),fx−(y)≐f−(x,y)f^+_x(y) \doteq f^+(x, y), f^-_x(y) \doteq f^-(x, y) are F2\mathcal{F}_2 measurable, so is the function fx(y)≐f(x,y)=f+(x,y)−f−(x,y)f_x (y) \doteq f(x, y) = f^+(x, y) - f^-(x, y) is F2\mathcal{F}_2.

  2. Since f+(x,y),f−(x,y)≥0f^+(x, y), f^-(x, y) \ge 0 are measurable and integrable, we have

    ∫X∫Yf+(x,y)d μ2 d μ1=∫Ωf+(x,y)d μˉ<∞,∫X∫Yf−(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}

    It follows that ∃A⊆F1\exists A \subseteq \mathcal{F}_1, s.t., μ1(A)=0\mu_1(A) = 0 and g+(x)≐∫Yf+(x,y)d μ2g^+(x) \doteq \int_Y f^+(x, y) d\, \mu_2 and g−(x)≐∫Yf−(x,y)d μ2g^-(x) \doteq \int_Y f^-(x, y) d\, \mu_2 are finite on X∖AX \setminus A. Define

    g(x)={∫Yfx(y)d μ2=g+(x)−g−(x),if x∈X∖A0,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}.

    Then g(x)g(x) is F1\mathcal{F}_1 measurable.

  3. We have

∫X∖A∫Yf(x,y)d μ2 d μ1=∫X∖Ag+(x) d μ1−∫X∖Ag−(x)d μ2 d μ1=∫Xg+(x) d μ1−∫Xg−(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}

□\square

Proof of the Lemma

Lemma. Given E∈σ(S)E \in \sigma( \mathcal{S} ), let IE\mathbb{I}_E be the indicator for (x,y)∈E(x, y) \in E. Then

  1. For each x∈Xx \in X, the function fx(y)≐IE(x,y)f_x(y) \doteq \mathbb{I}_E (x, y) is F2\mathcal{F}_2 measurable.

  2. The function g(x)≐∫YIE(x,y)d μ2g(x) \doteq \int_Y \mathbb{I}_E (x, y) d\, \mu_2 is F1\mathcal{F}_1 measurable.

  3. ∫X∫YIE(x,y)d μ2 d μ1=∫ΩIE(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.

There are various ways to prove this lemma. We present two proofs here.

Proof One

Since XX and YY are both σ\sigma-finite, there exists Ak∈F1,μ1(Ak)<∞,∀n∈N+A_k \in \mathcal{F}_1, \mu_1(A_k) < \infty, \forall n \in \mathbb{N}^+, s.t., Ak↑XA_k \uparrow X, and Bk∈F2,μ2(Bk)<∞,∀n∈N+B_k \in \mathcal{F}_2, \mu_2(B_k) < \infty, \forall n \in \mathbb{N}^+, s.t., Bk↑YB_k \uparrow Y. It follows that Ωk≐Ak×Bk↑Ω\Omega_k \doteq A_k \times B_k \uparrow \Omega, and that μ(Ωk)<∞\mu(\Omega_k) < \infty.

Define

Lk≐{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 } \}.

Claim. If Lk=σ(S)\mathcal{L}_k = \sigma(\mathcal{S}), then the lemma holds.

Proof of the Claim. For each E∈σ(S)E \in \sigma(\mathcal{S}),

  1. For fixed x∈Xx \in X. The functions fx(k)(y)≐IE∩Ωk(x,y)↑fx(y)f_x^{ (k) } (y) \doteq \mathbb{I}_{E \cap \Omega_k} (x, y) \uparrow f_x(y). Since they are F2\mathcal{F}_2 measurable, so is fx(y)≐f(x,y)f_x (y) \doteq f(x, y).

  2. Let g(k)(x)≐∫YIE∩Ωk(x,y)d μ2g^{(k)} (x) \doteq \int_Y \mathbb{I}_{E \cap \Omega_k} (x, y) d\, \mu_2 are increasing. Since 0≤fx(n)(y)↑fx(y)0 \le f_x^{ (n) } (y) \uparrow f_x(y), by monotone convergence theorem: by monotone convergence theorem:

    g(x)=∫Yfx(y)d μ2=lim⁡k∫YIE∩Ωk(x,y)d μ2=lim⁡kg(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)

    It follows that g(k)(x)↑g(x)g^{(k)} (x) \uparrow g(x). Since they are F1\mathcal{F}_1 measurable, so is g(x)g(x).

  3. Since ∫YIE∩Ωk(x,y)d μ2↑∫YIE(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 \,, ∫X∫YIE∩Ωk(x,y)d μ2 d μ1=∫ΩIE∩Ω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 \,, and IE∩Ωk(x,y)↑IE(x,y)\mathbb{I}_{E \cap \Omega_k} (x, y) \uparrow \mathbb{I}_E (x, y), by monotone convergence theorem,

∫X∫YIE(x,y)d μ2 d μ1=lim⁡k∫X∫YIE∩Ωk(x,y)d μ2 d μ1=lim⁡k∫ΩIE∩Ωk(x,y)d μˉ=∫Ωlim⁡kIE∩Ωk(x,y)d μˉ=∫ΩIE(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}

□\square

It is left to prove that Lk=σ(S)\mathcal{L}_k = \sigma(\mathcal{S}). The proof relies on the following fact.

Fact. If S~\tilde{S} is an algebra, then the monotone class M(S~)\mathcal{M}(\tilde{S}) generated by S~\tilde{S} equals σ(S~)\sigma(\tilde{S}).

The proof consists of two steps:

  • Lk\mathcal{L}_k contains the algebra S~\tilde{S} generated by SS.

  • Lk\mathcal{L}_k is a monotone class.

In what follows, to ease the notations, we write Lk\mathcal{L}_k as L\mathcal{L} and assume that μ(Ω)<∞\mu(\Omega) < \infty.

L\mathcal{L} contains the algebra S~\tilde{S} generated by SS.

Let E=+i(Ai×Bi)E = +_i \big( A_i \times B_i \big) for a finite sequence of disjoint rectangles Ai×BiA_i \times B_i.

  1. For each x∈Xx \in X, the function fx(y)≐IE(x,y)f_x(y) \doteq \mathbb{I}_E (x, y) is a simple function on YY and there F2\mathcal{F}_2 measurable.

  2. The function

    g(x)=∫YIE(x,y)d μ2=∑iIAi(x)⋅μ2(Bi) g(x) = \int_Y \mathbb{I}_E (x, y) d\, \mu_2 = \sum_i \mathbb{I}_{A_i} (x) \cdot \mu_2(B_i)

    is a simple function on XX and there F1\mathcal{F}_1 measurable.

∫Xg(x) d μ1=μ1(A)⋅μ2(B)=μˉ(E)=∫ΩIE(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.

L\mathcal{L} is a monotone class.

Case One En∈L,n∈N+E_n \in \mathcal{L}, n \in \mathbb{N}^+, s.t., En↑EE_n \uparrow E

  1. For each x∈Xx \in X, we have fx(n)(y)=IEn(x,y)↑fx(y)f_x^{ (n) } (y) = \mathbb{I}_{E_n} (x, y) \uparrow f_x(y). Since the fx(n)(y)f_x^{ (n) } (y) F2\mathcal{F}_2 measurable, so is the function fx(y)f_x(y).

  2. Let g(n)(x)≐∫Yf(n)(x,y)d μ2g^{(n)} (x) \doteq \int_Y f^{ (n) } (x, y) d\, \mu_2. Since 0≤fx(n)(y)↑fx(y)0 \le f_x^{ (n) } (y) \uparrow f_x(y), by monotone convergence theorem:

    g(x)=∫Yfx(y)d μ2=lim⁡n∫Yfx(n)(y)d μ2=lim⁡ng(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)

    It follows that g(n)(x)↑g(x)g^{(n)} (x) \uparrow g(x). Since they are F1\mathcal{F}_1 measurable, so is g(x)g(x).

  3. Since ∫Yf(n)(x,y)d μ2↑∫Yf(x,y)d μ2 \int_Y f^{ (n) } (x, y) d\, \mu_2 \uparrow \int_Y f(x, y) d\, \mu_2 \,, ∫X∫Yf(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 \,, and f(n)(x,y)↑f(x,y)f^{(n)} (x, y) \uparrow f(x, y), by monotone convergence theorem,

∫X∫Yf(x,y)d μ2 d μ1=lim⁡n∫X∫Yf(n)(x,y)d μ2 d μ1=lim⁡n∫Ωf(n)(x,y)d μˉ=∫Ωlim⁡nf(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}

Case Two En∈L,n∈N+E_n \in \mathcal{L}, n \in \mathbb{N}^+, s.t., En↓EE_n \downarrow E

  1. For each x∈Xx \in X, we have fx(n)(y)=IEn(x,y)↓fx(y)f_x^{ (n) } (y) = \mathbb{I}_{E_n} (x, y) \downarrow f_x(y). Since the fx(n)(y)f_x^{ (n) } (y) are F2\mathcal{F}_2 measurable, so is the function fx(y)f_x(y).

  2. Since fx(n)(y)=IEn(x,y)↓fx(y)f_x^{ (n) } (y) = \mathbb{I}_{E_n} (x, y) \downarrow f_x(y) and fx(n)(y)≤1f_x^{ (n) } (y) \le 1, 0≤1−fx(n)(y)↑1−fx(y)0 \le 1 - f_x^{ (n) } (y) \uparrow 1 - f_x(y). By monotone convergence theorem:

    μ2(Y)−lim⁡ng(n)(x)=lim⁡n∫Y(1−fx(n)(y))d μ2=∫Y(1−fx(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}

    Since μ2(Y)<∞\mu_2(Y) < \infty, lim⁡ng(n)(x)=g(x)\lim_n g^{(n)} (x) = g(x). Since they are F1\mathcal{F}_1 measurable, so is g(x)g(x).

  3. Since 0≤μ2(Y)−∫Yf(n)(x,y)d μ2↑μ2(Y)−∫Yf(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 \,, ∫X∫Yf(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 \,, and 0≤1−f(n)(x,y)↑1−f(x,y)0 \le 1 - f^{(n)} (x, y) \uparrow 1 - f(x, y), by monotone convergence theorem,

    μ(Ω)−∫X∫Yf(x,y)d μ2 d μ1=∫X(μ2(Y)−∫Yf(x,y)d μ2) d μ1=lim⁡n∫X(μ2(Y)−∫Yf(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}

    Observing that μ(Ω)<∞\mu(\Omega) < \infty finishes the proof.

□\square

Proof Two

Lemma. Given E∈σ(S)E \in \sigma( \mathcal{S} ), let f(x,y)=IE(x,y)f(x, y) = \mathbb{I}_E (x, y) be the indicator for (x,y)∈E(x, y) \in E. Then

  1. For each x∈Xx \in X, the function fx(y)≐IE(x,y)f_x(y) \doteq \mathbb{I}_E (x, y) is F2\mathcal{F}_2 measurable.

  2. The function g(x)≐∫YIE(x,y)d μ2g(x) \doteq \int_Y \mathbb{I}_E (x, y) d\, \mu_2 is F1\mathcal{F}_1 measurable.

  3. ∫X∫YIE(x,y)d μ2 d μ1=∫ΩIE(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.

Proof of (1).

Definition. Let Ex≐{y:(x,y)∈E}E_x \doteq \begin{Bmatrix} y : (x, y) \in E \end{Bmatrix} be the cross-section at xx.

It suffices to show that

Claim. For each x∈Xx \in X and E∈σ(S)E \in \sigma(\mathcal{S}), Ex∈F2E_x \in \mathcal{F}_2.

Proof of the Claim. Fix an x∈Xx \in X. Define the function Tx:Y→X×YT_x : Y \rightarrow X \times Y by Tx(y)≐(x,y).T_x (y) \doteq (x, y). Then for each E=A×B∈SE = A \times B \in \mathcal{S},

Tx−1(E)=Ex={B, if x∈A,∅, otherwise . T_x^{-1} (E) = E_x = \begin{cases} B, &\text{ if } x \in A, \\ \emptyset, & \text{ otherwise }. \end{cases}

Therefore Tx−1(E)=Ex∈F2T_x^{-1} (E) = E_x \in \mathcal{F}_2. Since S\mathcal{S} generates σ(S)\sigma(\mathcal{S}), we conclude that TxT_x is measurable F2/σ(S)\mathcal{F}_2 / \sigma(\mathcal{S}).

□\square

Proof of (2) and (3).

Define the set L⊆σ(S)\mathcal{L} \subseteq \sigma(\mathcal{S}) as the collection of EE for which the condition (2) and (3) hold.

  1. Clearly it holds that S⊆L\mathcal{S} \subseteq \mathcal{L};
  2. We show that L\mathcal{L} is a λ\lambda system.

Since S\mathcal{S} is a π\pi system, via Dynkin's π−λ\pi-\lambda theorem, L\mathcal{L} is a σ\sigma-algebra, and hence L=σ(S)\mathcal{L} = \sigma(\mathcal{S}).

We will now check that L\mathcal{L} is a λ\lambda-system. With the same technique applied in previous proof, we can suppose without loss of generality that μ(Ω)<∞\mu(\Omega) < \infty.

  1. Ω∈L\Omega \in \mathcal{L}.

  2. If E∈LE \in \mathcal{L}, then Eˉ∈L\bar E \in \mathcal{L}. First, observe that Eˉx=Ωx−Ex=B−Ex∈F2\bar E_x = \Omega_x - E_x = B - E_x \in \mathcal{F}_2. Since μ2(B)<∞\mu_2(B) < \infty,

    gEˉ(x)=μ2(Eˉx)=μ2(Ωx−Ex)=μ2(B)−μ2(Ex). g_{\bar E} (x) = \mu_2 ( \bar E_x ) = \mu_2 (\Omega_x - E_x) = \mu_2 (B) - \mu_2 (E_x).

    Since gE(x)=μ2(Ex)g_E(x) = \mu_2 (E_x) is F1\mathcal{F}_1 measurable, so is gEˉ(x)g_{\bar E}(x). Integrating over xx gives

    ∫Xμ2(Eˉx) d μ1=∫Xμ2(B) d μ1−∫Xμ2(Ex) 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}

    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.

  3. If En∈L,n∈N+E_n \in \mathcal{L}, n \in \mathbb{N}^+ is a disjoint sequence of sets, then ∪n≥1En∈L\cup_{n \ge 1} E_n \in \mathcal{L}. Define gEn(x)≐μ2((En)x)g_{E_n} (x) \doteq \mu_2 ( (E_n)_x ). Then g(x)≐∑n≥1gEn(x)g(x) \doteq \sum_{n \ge 1} g_{E_n} (x) is F1\mathcal{F}_1 measurable, since g=sup⁡n≥1∑k∈[n]gEkg = \sup_{n \ge 1} \sum_{k \in [n]} g_{E_k}. By monotone convergence theorem and that μ\mu is a measure, it holds that

    ∫Xg d μ1=∫X∑n≥1gEn d μ1=∑n≥1∫XgEn d μ1=∑n≥1μ(En)=μ(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).

    Therefore, E∈LE \in \mathcal{L}.

□\square

Remarks

Given a function f(x,y)f(x, y), there is an easier way to prove that it is measurable F2/B\mathcal{F}_2 / \mathcal{B} when xx is fixed, without approximating it by simple functions. However, to prove the measurability of ∫Yf(x,y) dμ2\int_Y f(x, y) \, d \mu_2 (as a function of xx), we still need to write it as the limit of simple functions.

Lemma. Let f:X×Y→Rf: X \times Y \rightarrow \mathbb{R} be measurable σ(S)/B\sigma(\mathcal{S}) / \mathcal{B}. For each x∈Xx \in X, the function fx:Y→Rf_x : Y \rightarrow \mathbb{R} defined by fx(y)=f(x,y)f_x(y) = f(x, y) is measurable F2/B\mathcal{F}_2 / \mathcal{B}.

Proof. Note that fx=f∘Txf_x = f \circ T_x. Since TxT_x is measurable F2/σ(S)\mathcal{F}_2 / \sigma(\mathcal{S}) and ff is measurable σ(S)/B\sigma(\mathcal{S}) / \mathcal{B}, it follows that fxf_x is measurable F2/B\mathcal{F}_2 / \mathcal{B}.

Or, specifically, for each Borel set W∈BW \in \mathcal{B}, since ff is measurable σ(S)/B\sigma(\mathcal{S}) / \mathcal{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}).

Then

fx−1(W)={y:f(x,y)∈W}=Ex∈F2. f_x^{-1} (W) = \{ y : f(x, y) \in W \} = E_x \in \mathcal{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} is an algebra, then the monotone class M(S~)\mathcal{M}(\tilde{S}) generated by S~\tilde{S} equals σ(S~)\sigma(\tilde{S}).

Proof. It is trivial to see M(S~)⊆σ(S~)\mathcal{M}(\tilde{S}) \subseteq \sigma(\tilde{S}).

We prove the other direction by showing that M(S~)\mathcal{M}(\tilde{S}) is an algebra. The proof consists of two steps:

  1. For each E∈S~E \in \tilde{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}).

    Clearly S~⊆R(E)\tilde{S} \subseteq \mathcal{R}(E). We prove that R(E)\mathcal{R}(E) is a monotone class. Suppose that Fn→FF_n \rightarrow F is an increasing or decreasing sequence. Then E∪Fn,Fn−E,E−FnE \cup 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).

  2. For each E∈M(S~)E \in \mathcal{M}(\tilde{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}).

    If F∈S~F \in \tilde{S}, then the previous claim E∈R(F)E \in \mathcal{R}(F). Therefore, F∈R(E)F \in \mathcal{R}(E). Following similar vein, we can also prove that R(E)\mathcal{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.