Products of Sets and Algebras
Measuring integrals on the real line is all well and good.
However, me way want to extend our definitions of size to higher dimensions.
In particular, our notion of length in a single dimension will extend to notions of area and volume in two and three dimensions, respectively.
To talk about measure in product spaces, we should probably agree on what a product is.
What do we mean when we take products of sets?
In particular, how do combine or extend our notion of σ \sigma σ -algebras ?
The note starts with these topics before moving onto core results.
A picture like the one you probably have in your head is fine.
However, as on the real line, we can have disjoint intervals, a rectangle may include multiple true rectangles .
Definition. Product of algebras
Suppose ( X , S ) (X, \mathcal{S}) ( X , S ) and ( Y , T ) (Y, \mathcal{T}) ( Y , T ) are measurable spaces. Then
the product S ⊗ T \mathcal{S} \otimes \mathcal{T} S ⊗ T is defined to be the smallest σ \sigma σ -algebra on X × Y X \times Y X × Y that contains
{ A × B : A ∈ S , B ∈ T } ; (1) \htmlId{eq-1}{\{ A \times B \,: \, A \in \mathcal{S}, \, B \in \mathcal{T}\};} \tag{1} { A × B : A ∈ S , B ∈ T } ; ( 1 )
a measurable rectangle in S ⊗ T \mathcal{S} \otimes \mathcal{T} S ⊗ T is a set of the form A × B A \times B A × B where A ∈ S , B ∈ T A \in \mathcal{S}, B \in \mathcal{T} A ∈ S , B ∈ T .
We’ll also discuss cross-sections needed for taking iterated integrals.
In essence, one variable becomes fixed as another varies in the integrand.
Great, now we have a common language and notation.
Proposition. Cross sections preserve measurability
Suppose S \mathcal{S} S is a σ \sigma σ -algebra on X X X and T \mathcal{T} T is a σ \sigma σ -algebra on Y.
If E ∈ S ⊗ T E \in \mathcal{S} \otimes \mathcal{T} E ∈ S ⊗ T , then
[ E ] a ∈ T for every a ∈ X and [ E ] b ∈ S for every b ∈ T . (3) \htmlId{eq-3}{[E]_a \in \mathcal{T} \text{ for every } a \in X \quad \text{ and } \quad [E]^b \in \mathcal{S} \text{ for every } b \in \mathcal{T}.} \tag{3} [ E ] a ∈ T for every a ∈ X and [ E ] b ∈ S for every b ∈ T . ( 3 )
Proof.
The core of the proof is to consider the collection of subsets where the conclusion holds.
We will then show that this collection E \mathcal{E} E actually contains S ⊗ T \mathcal{S} \otimes \mathcal{T} S ⊗ T .
So, consider the collection E \mathcal{E} E , the collection of sets where the result holds.
Clearly, A × B ∈ E A \times B \in \mathcal{E} A × B ∈ E for every A ∈ S , B ∈ T A \in \mathcal{S}, B \in \mathcal{T} A ∈ S , B ∈ T .
This collection is closed under complements, since for any E ∈ E E \in \mathcal{E} E ∈ E
[ ( X × Y ) ∖ E ] a = Y ∖ [ E ] a ∈ T . (4) \htmlId{eq-4}{[(X \times Y) \setminus E]_a = Y \setminus [E]_a \in \mathcal{T}.} \tag{4} [( X × Y ) ∖ E ] a = Y ∖ [ E ] a ∈ T . ( 4 ) It is also closed under countable unions since
[ E 1 ∪ E 2 ∪ ⋯ ] a = [ E 1 ] a ∪ [ E 2 ] a ∪ ⋯ . (5) \htmlId{eq-5}{[E_1 \cup E_2 \cup \cdots]_a = [E_1]_a \cup [E_2]_a \cup \cdots.} \tag{5} [ E 1 ∪ E 2 ∪ ⋯ ] a = [ E 1 ] a ∪ [ E 2 ] a ∪ ⋯ . ( 5 ) So, E \mathcal{E} E is a σ \sigma σ -algebra containing all measurable rectangles in S ⊗ T \mathcal{S} \otimes \mathcal{T} S ⊗ T , and so it must contain S ⊗ T \mathcal{S} \otimes \mathcal{T} S ⊗ T .
■ \blacksquare ■
Now, we move on to defining cross sections of functions .
Definition. Cross sections of functions
Suppose X X X and Y Y Y are sets and f : X × Y → R f: X \times Y \to \mathbf{R} f : X × Y → R is a function.
Then for a ∈ X a \in X a ∈ X and b ∈ Y b \in Y b ∈ Y , the cross section functions [ f ] a : Y → R [f]_a: Y \to \mathbf{R} [ f ] a : Y → R and [ f ] b : X → R [f]^b: X \to \mathbf{R} [ f ] b : X → R are defined by
[ f ] a ( y ) = f ( a , y ) for y ∈ Y and [ f ] b ( x ) = f ( x , b ) for x ∈ X . (6) \htmlId{eq-6}{[f]_a(y) = f(a, y) \text{ for } y \in Y \quad \text{ and } \quad [f]^b(x) = f(x, b) \text{ for } x \in X.} \tag{6} [ f ] a ( y ) = f ( a , y ) for y ∈ Y and [ f ] b ( x ) = f ( x , b ) for x ∈ X . ( 6 )
The next result shows that, just as before, cross sections preserve measurability for functions.
Proposition. cross sections of measurable functions are measurable
Suppose S \mathcal{S} S is a σ \sigma σ -algebra on X X X and T \mathcal{T} T is a σ \sigma σ -algebra on Y Y Y .
Suppose f : X × Y → R f: X \times Y \to \mathbf{R} f : X × Y → R is an S ⊗ T \mathcal{S} \otimes \mathcal{T} S ⊗ T -measurable function.
Then
[ f ] a is a T -measurable function on Y for every a ∈ X (7) \htmlId{eq-7}{[f]_a \text{ is a } \mathcal{T}\text{-measurable function on } Y \text{ for every } a \in X} \tag{7} [ f ] a is a T -measurable function on Y for every a ∈ X ( 7 ) and
[ f ] b is an S -measurable function on X for every b ∈ Y . (8) \htmlId{eq-8}{[f]^b \text{ is an } \mathcal{S}\text{-measurable function on } X \text{ for every } b \in Y.} \tag{8} [ f ] b is an S -measurable function on X for every b ∈ Y . ( 8 )
Proof.
Suppose D D D is a Borel subset of R \R R and a ∈ X a \in X a ∈ X .
If y ∈ Y y \in Y y ∈ Y , then
y ∈ ( [ f ] a ) − 1 ( D ) ⟺ [ f ] a ( y ) ∈ D ⟺ f ( a , y ) ∈ D ⟺ ( a , y ) ∈ f − 1 ( D ) ⟺ y ∈ [ f − 1 ( D ) ] a . (9) \htmlId{eq-9}{\begin{aligned}
y \in ([f]_a)^{-1}(D) &\iff [f]_a(y) \in D \\
& \iff f(a, y) \in D \\
& \iff (a, y) \in f^{-1}(D) \\
& \iff y \in [f^{-1}(D)]_{a}.
\end{aligned}} \tag{9} y ∈ ([ f ] a ) − 1 ( D ) ⟺ [ f ] a ( y ) ∈ D ⟺ f ( a , y ) ∈ D ⟺ ( a , y ) ∈ f − 1 ( D ) ⟺ y ∈ [ f − 1 ( D ) ] a . ( 9 ) Thus, ( [ f ] a ) − 1 ( D ) = [ f − 1 ( D ) ] a ([f]_a)^{-1}(D) = [f^{-1}(D)]_{a} ([ f ] a ) − 1 ( D ) = [ f − 1 ( D ) ] a .
Because f f f is an S ⊗ T \mathcal{S} \otimes \mathcal{T} S ⊗ T -measurable function, f − 1 ( D ) ∈ S ⊗ T f^{-1}(D) \in \mathcal{S} \otimes \mathcal{T} f − 1 ( D ) ∈ S ⊗ T .
By the previous proposition, that implies that for any a ∈ X a \in X a ∈ X , [ f − 1 ( D ) ] a ∈ T [f^{-1}(D)]_{a} \in \mathcal{T} [ f − 1 ( D ) ] a ∈ T is therefore T \mathcal{T} T -measurable, as required.
The same logic applies to show that [ f ] b ∈ S [f]^b \in \mathcal{S} [ f ] b ∈ S for every b ∈ Y b \in Y b ∈ Y .
■ \blacksquare ■
Monotone Class Theorem
We used a two-step proof technique for proving that cross sections of measurable sets are measurable.
In general, it can be used to show that every set in a σ \sigma σ -algebra has a desired property.
It goes vaguely like
show that every set in a collection of sets that generate the σ \sigma σ -algebra has the property;
show that the collection of sets that has the property is a σ \sigma σ -algebra .
This should be used when possible, but it may not always be possible.
In some cases, it seems there’s no reasonable way to show that the collection of sets is a σ \sigma σ -algebra .
To deal with this issue, we will introduce another technique which uses what are called monotone classes.
The following result provides an example of an algebra that we will exploit.
Proposition.
Suppose ( X , S ) (X, \mathcal{S}) ( X , S ) and ( Y , T ) (Y, \mathcal{T}) ( Y , T ) are measurable spaces.
Then
(a) the set of finite unions of measurable rectangles in S ⊗ T \mathcal{S} \otimes \mathcal{T} S ⊗ T is an algebra on X × Y X \times Y X × Y ;
(b) every finite union of measurable rectangle in S ⊗ T \mathcal{S} \otimes \mathcal{T} S ⊗ T can be written as a disjoint union of measurable rectangles in S ⊗ T \mathcal{S} \otimes \mathcal{T} S ⊗ T .
Now we define a monotone class as a collection of sets that is closed under countable increasing unions and countable decreasing intersections.
Definition. Monotone class
Suppose W W W is a set and M \mathcal{M} M is a set of subsets of W W W .
If M M M satisfies the following two conditions, then we call it a monotone class .
If E 1 ⊆ E 2 ⊆ ⋯ E_1 \subseteq E_2 \subseteq \cdots E 1 ⊆ E 2 ⊆ ⋯ is an increasing sequence of sets in M \mathcal{M} M , then ⋃ k = 1 ∞ E k ∈ M \bigcup_{k=1}^\infty E_k \in \mathcal{M} ⋃ k = 1 ∞ E k ∈ M .
If E 1 ⊇ E 2 ⊇ ⋯ E_1 \supseteq E_2 \supseteq \cdots E 1 ⊇ E 2 ⊇ ⋯ is a decreasing sequence of sets in M \mathcal{M} M , then ⋂ k = 1 ∞ E k ∈ M \bigcap_{k=1}^\infty E_k \in \mathcal{M} ⋂ k = 1 ∞ E k ∈ M .
Clearly, every σ \sigma σ -algebra is a monotone class .
However, counterintuitively, some monotone classes are not closed even under finite unions, as the next example shows.
Example. A monotone class that is not an algebra
Suppose A \mathcal{A} A is collection of intervals of R \mathbf{R} R .
Then, A \mathcal{A} A must be a closed under increasing unions and decreasing intersections.
However, A \mathcal{A} A is not closed under finite unions, rendering it neither an algebra , nor a σ \sigma σ -algebra .
The next result provides a useful tool when the standard technique for showing that every set in a σ \sigma σ -algebra has a certain property does not work.
theorem. Monotone Class Theorem
Suppose A \mathcal{A} A is an algebra on a set W W W .
Then the smallest σ \sigma σ -algebra containing A \mathcal{A} A is also the smallest monotone class containing A \mathcal{A} A .
Proof.
Let M \mathcal{M} M be the smallest monotone class that contains A \mathcal{A} A .
Because every σ \sigma σ -algebra is a monotone class , M \mathcal{M} M is contained in the smallest σ \sigma σ -algebra containing A \mathcal{A} A .
To prove the inclusion in the other direction, first suppose A ∈ A A \in \mathcal{A} A ∈ A .
Let
E = { E ∈ M : A ∪ E ∈ M } . (10) \htmlId{eq-10}{\mathcal{E} = \left\{ E \in \mathcal{M} \,:\, A \cup E \in \mathcal{M} \right\}.} \tag{10} E = { E ∈ M : A ∪ E ∈ M } . ( 10 ) First, note that A ⊆ E \mathcal{A} \subseteq \mathcal{E} A ⊆ E .
A moment’s thought reveals that E \mathcal{E} E is a monotone class .
Thus, the smallest monotone class that contains A \mathcal{A} A is contained in E \mathcal{E} E , M ⊆ E \mathcal{M} \subseteq \mathcal{E} M ⊆ E .
Hence, A ∪ E ∈ M A \cup E \in \mathcal{M} A ∪ E ∈ M for all E ∈ M E \in \mathcal{M} E ∈ M .
Now consider the collection
D = { D ∈ M : D ∪ E ∈ M for all E ∈ M } . (11) \htmlId{eq-11}{\mathcal{D} = \{ D \in \mathcal{M} \,:\, D \cup E \in \mathcal{M} \text{ for all } E \in \mathcal{M}\}.} \tag{11} D = { D ∈ M : D ∪ E ∈ M for all E ∈ M } . ( 11 ) By the previous paragraph, A ⊆ D \mathcal{A} \subseteq \mathcal{D} A ⊆ D .
It’s also clear that D \mathcal{D} D is a monotone class , and so we must have M ⊆ D \mathcal{M} \subseteq \mathcal{D} M ⊆ D .
Hence, D ∪ E ∈ M D \cup E \in \mathcal{M} D ∪ E ∈ M for all D , E ∈ M D, E \in \mathcal{M} D , E ∈ M , and so M \mathcal{M} M is closed under finite unions.
Notice now that for E 1 , E 2 , … ∈ M E_1, E_2, \dotsc \in \mathcal{M} E 1 , E 2 , … ∈ M , we can write the union as an increasing union:
E 1 ∪ E 2 ∪ ⋯ = E 1 ∪ ( E 1 ∪ E 2 ) ∪ ( E 1 ∪ E 2 ∪ E 3 ) ∪ ⋯ . (12) \htmlId{eq-12}{E_1 \cup E_2 \cup \cdots = E_1 \cup (E_1 \cup E_2) \cup (E_1 \cup E_2 \cup E_3) \cup \cdots.} \tag{12} E 1 ∪ E 2 ∪ ⋯ = E 1 ∪ ( E 1 ∪ E 2 ) ∪ ( E 1 ∪ E 2 ∪ E 3 ) ∪ ⋯ . ( 12 ) Which shows that M \mathcal{M} M is closed under countable unions.
Finally, let
M ′ = { E ∈ M : W ∖ E ∈ M } . (13) \htmlId{eq-13}{\mathcal{M}' = \{E \in \mathcal{M} \,:\, W \setminus E \in \mathcal{M}\}.} \tag{13} M ′ = { E ∈ M : W ∖ E ∈ M } . ( 13 ) Since A \mathcal{A} A is closed under complementation, A ⊆ M ′ \mathcal{A} \subseteq \mathcal{M}' A ⊆ M ′ .
Once again, a bit if thought reveals that M ′ \mathcal{M}' M ′ is a monotone class , and so we must conclude that M ⊆ M ′ \mathcal{M} \subseteq \mathcal{M}' M ⊆ M ′ .
M \mathcal{M} M is closed under complementation.
So, we’ve shown that M \mathcal{M} M is closed under countable unions and finite intersections, and therefore is a σ \sigma σ -algebra .
Hence M \mathcal{M} M is a σ \sigma σ -algebra that contains A \mathcal{A} A , and so must contain the smallest σ \sigma σ -algebra that contains A \mathcal{A} A .
■ \blacksquare ■
Products of Measures
Definition. Finite measure
A measure μ \mu μ on a measurable space ( X , S ) (X, \mathcal{S}) ( X , S ) is called finite if μ ( X ) < ∞ \mu(X) < \infty μ ( X ) < ∞ .
Definition. σ-finite measure
A measure μ \mu μ on a measurable space ( X , S ) (X, \mathcal{S}) ( X , S ) is called σ \sigma σ -finite if the whole space can be written as the countable unions of sets with finite measure.
More precisely, a measure μ \mu μ is σ \sigma σ -finite if there exists a sequence X 1 , X 2 , … X_1, X_2, \dotsc X 1 , X 2 , … of sets in S \mathcal{S} S such that
X = ⋃ k = 1 ∞ X k and μ ( X k ) < ∞ for every k ∈ Z + . (14) \htmlId{eq-14}{X = \bigcup_{k=1}^\infty X_k \quad \text{ and } \quad \mu(X_k) < \infty \ \text{ for every } k \in \Z^+.} \tag{14} X = k = 1 ⋃ ∞ X k and μ ( X k ) < ∞ for every k ∈ Z + . ( 14 )
This next result allows us to define the product of two σ \sigma σ -finite measures .
Proposition. Measure of cross section is a measurable function
Suppose ( X , S , μ ) (X, \mathcal{S}, \mu) ( X , S , μ ) and ( Y , T , ν ) (Y, \mathcal{T}, \nu) ( Y , T , ν ) are σ \sigma σ -finite measure spaces.
If E ∈ S ⊗ T E \in \mathcal{S} \otimes \mathcal{T} E ∈ S ⊗ T , then
x ↦ ν ( [ E ] x ) x \mapsto \nu([E]_x) x ↦ ν ([ E ] x ) is an S \mathcal{S} S -measurable function on X X X ;
y ↦ μ ( [ E ] y ) y \mapsto \mu([E]_y) y ↦ μ ([ E ] y ) is a T \mathcal{T} T -measurable function on Y Y Y .
The proof is informative but omitted for brevity.
Definition. Integration
Suppose ( X , S , μ ) (X, \mathcal{S},\mu ) ( X , S , μ ) is a measure space and g : X → [ − ∞ , ∞ ] g: X \to [-\infty, \infty] g : X → [ − ∞ , ∞ ] .
The notation
∫ g ( x ) d μ ( x ) means ∫ g d μ , (15) \htmlId{eq-15}{\int g(x) d\mu(x) \quad \text{ means } \quad \int g d\mu, } \tag{15} ∫ g ( x ) d μ ( x ) means ∫ g d μ , ( 15 ) where d μ ( x ) d\mu(x) d μ ( x ) indicates that variables other than x x x should be treated as constants.
Now, we define the product of measures .
The definition we give makes sense because the inner and outer integrals are both well-defined.
The restriction to σ \sigma σ -finite measures is not bothersome because the main results we seek are not valid without this hypothesis.
Definition. Product of measures
Suppose ( X , S , μ ) (X, \mathcal{S}, \mu) ( X , S , μ ) and ( Y , T , ν ) (Y, \mathcal{T}, \nu) ( Y , T , ν ) are σ \sigma σ -finite measure spaces.
For E ∈ S ⊗ T E \in \mathcal{S}\otimes \mathcal{T} E ∈ S ⊗ T , define ( μ × ν ) ( E ) ( \mu \times \nu)(E) ( μ × ν ) ( E ) by
( μ × ν ) ( E ) = ∫ X ∫ Y χ E ( x , y ) d ν ( y ) d μ ( x ) . (16) \htmlId{eq-16}{(\mu \times\nu)(E) = \int_X \int_{Y} \chi_{E}(x, y) d\nu(y) d\mu(x).} \tag{16} ( μ × ν ) ( E ) = ∫ X ∫ Y χ E ( x , y ) d ν ( y ) d μ ( x ) . ( 16 )
Example.
Consider two standard measure spaces as above, and consider a rectangle A × B ∈ S ⊗ T A \times B \in \mathcal{S} \otimes \mathcal{T} A × B ∈ S ⊗ T ,
where A ∈ S A \in \mathcal{S} A ∈ S and B ∈ T B \in \mathcal{T} B ∈ T , then we have
( μ × ν ) ( A × B ) = ∫ X ∫ Y χ A × B ( x , y ) d ν ( y ) d μ ( x ) = ∫ X ∫ Y χ A ( x ) χ B ( y ) d ν ( y ) d μ ( x ) = ∫ X χ A ( x ) ∫ Y χ B ( y ) d ν ( y ) d μ ( x ) = ∫ X χ A ( x ) ν ( B ) d μ ( x ) = ν ( B ) ∫ X χ A ( x ) d μ ( x ) = μ ( A ) ν ( B ) . (17) \htmlId{eq-17}{\begin{aligned}
(\mu \times\nu)(A \times B) &= \int_{X}\int_{Y} \chi_{A \times B}(x, y) d\nu(y) d\mu(x) \\
&= \int_{X}\int_{Y} \chi_{A}(x) \chi_{B}(y) d\nu(y) d\mu(x) \\
&= \int_{X}\chi_{A}(x)\int_{Y} \chi_{B}(y) d\nu(y) d\mu(x) \\
&= \int_{X}\chi_{A}(x) \nu(B) d\mu(x) \\
&= \nu(B) \int_{X}\chi_{A}(x) d\mu(x) \\
&= \mu(A) \nu(B).
\end{aligned}} \tag{17} ( μ × ν ) ( A × B ) = ∫ X ∫ Y χ A × B ( x , y ) d ν ( y ) d μ ( x ) = ∫ X ∫ Y χ A ( x ) χ B ( y ) d ν ( y ) d μ ( x ) = ∫ X χ A ( x ) ∫ Y χ B ( y ) d ν ( y ) d μ ( x ) = ∫ X χ A ( x ) ν ( B ) d μ ( x ) = ν ( B ) ∫ X χ A ( x ) d μ ( x ) = μ ( A ) ν ( B ) . ( 17 )
So we defined the product μ × ν \mu \times \nu μ × ν , which is a function.
But we wouldn’t want any function, we’d really want this product to be a measure.
Luckily, the following result show that this is indeed the case.
Proposition. A product of measures is a measure
We have to show that the measure of the empty set is zero, and that it satisfies countable additivity.
Indeed, ( μ × ν ) ( ∅ ) = 0 (\mu \times\nu)(\emptyset) = 0 ( μ × ν ) ( ∅ ) = 0 from the previous example.
Suppose that E 1 , E 2 , E 3 , … E_1, E_2, E_3, \dotsc E 1 , E 2 , E 3 , … is a disjoint sequence of sets in S ⊗ T \mathcal{S} \otimes \mathcal{T} S ⊗ T .
Then we must have
( μ × ν ) ( ⋃ k = 1 ∞ E k ) = ∫ X ν ( [ ⋃ k = 1 ∞ E k ] x ) d μ ( x ) = ∫ X ν ( ⋃ k = 1 ∞ [ E k ] x ) d μ ( x ) = ∫ X ∑ k = 1 ∞ ν ( [ E k ] x ) d μ ( x ) = ∑ k = 1 ∞ ∫ X ν ( [ E k ] x ) d μ ( x ) = ∑ k = 1 ∞ ( μ × ν ) ( E k ) , (18) \htmlId{eq-18}{\begin{aligned}
(\mu \times\nu) \left( \bigcup_{k=1}^\infty E_k \right) &= \int_{X} \nu \left( \left[\bigcup_{k=1}^\infty E_k\right]_x \right) d\mu(x) \\
&= \int_{X} \nu \left( \bigcup_{k=1}^\infty [E_k]_x \right) d\mu(x) \\
&= \int_{X} \sum_{k=1}^\infty \nu \left([E_k]_x \right) d\mu(x) \\
&= \sum_{k=1}^\infty \int_{X} \nu \left([E_k]_x \right) d\mu(x) \\
&= \sum_{k=1}^\infty (\mu \times\nu)(E_k),
\end{aligned}} \tag{18} ( μ × ν ) ( k = 1 ⋃ ∞ E k ) = ∫ X ν ( [ k = 1 ⋃ ∞ E k ] x ) d μ ( x ) = ∫ X ν ( k = 1 ⋃ ∞ [ E k ] x ) d μ ( x ) = ∫ X k = 1 ∑ ∞ ν ( [ E k ] x ) d μ ( x ) = k = 1 ∑ ∞ ∫ X ν ( [ E k ] x ) d μ ( x ) = k = 1 ∑ ∞ ( μ × ν ) ( E k ) , ( 18 ) as desired.