Exercise 1.7.18 (Product $\sigma$-algebras)

Let (X,X) and (Y,Y ) be measurable spaces.

(i)
Show that X ×Y is the σ-algebra generated by the sets E × F with E X, Y Y . In other words, X ×Y is the coarsest σ-algebra on X × Y with the property that the product of a X-measurable set and a Y -measurable set is always X ×Y measurable.
(ii)
Show that X ×Y is the coarsest σ-algebra on X × Y that makes the projection maps πX,πY both measurable morphisms (see Remark 1.4.33).
(iii)
If E X ×Y , show that the sets Ex := {y Y : (x,y) E} lie in Y for every x X, and similarly that the sets Ey := {x X : (x,y) E} lie in X for every y Y .
(iv)
If f : X × Y [0,+] is measurable (with respect to X ×Y ), show that the function fx : yf(x,y) is Y -measurable for every x X, and similarly that the function fy : xf(x,y) is X-measurable for every y Y .
(v)
If E X ×Y , show that the slices Ex := {y Y : (x,y) E} lie in a countably generated σ-algebra. In other words, show that there exists an at most countable collection 𝒜 = 𝒜E of sets (which can depend on E) such that {Ex : x X}𝒜. Conclude in particular that the number of distinct slices Ex is at most c, the cardinality of the continuum. (The last part of this exercise is only suitable for students who are comfortable with cardinal arithmetic.)

Answers

(i)
We have to demonstrate that both generating sets result in the same σ-algebra, i.e., πX (B X) πY (B Y ) = {E × FE BX,F BY } .

Recall that to show that two families of sets generate the same σ-algebra, it suffices to show that every σ-algebra that contains the former family of sets, contains the latter also, and conversely.

  • Pick an arbitrary A from the generating set of the product σ-algebra. Then either A = πX1(E) for some E BX or A = πY 1(F) for some F BX. In the former case, it is obvious that A = E × Y . But both E BX and Y BY ; thus, A must be contained in the generating set on the right-hand side. The second case follows identically.
  • Pick an arbitrary E × F for some E BX and F BY . Then, it is easy to verify that E × F = (X × F) (E × Y ). The former X × F is the pullback of the set F under the projection πY ; the latter set E × Y is the pullback of the set E under the projection πX. Thus, E × F is the intersection of two pullback sets and is therefore contained in the product σ-algebra.
(ii)
Let F be an arbitrary σ-algebra on the product space X × Y .

For F to make πX : (X × Y,F) (X,BX) and πY : (X × Y,F) (Y,BY ) measurable, it must at least contain the inverse image of every measurable set in BX and BY . From this, we immediate that F must contain the sets of the form πX1(E) for E BX and πY 1(F) for F BY . But this is the same as saying that F must contain the generating set of the product σ-algebra, which is, in turn, equivalent to saying that F contains the product σ-algebra itself.

(iii)
Notice that a more formal way of saying that the section Ex,Ey of any set in BX ×BY is BX×BY {E 2X×Y | y Y :Ey BX x X :Ex BY } .

PIC
Figure 1: Example of a section of a set in R2.

It becomes obvious that the latter form is better suited for our proof as soon as one realises that the right-hand set is a σ-algebra. Denote this set by H.

  • We have H since y = x = BX,BY .
  • Let E H, i.e., Ex BY and Ey BX. Then,

    (Ec) x = {y Y [ x y ] Ec} = {y Y [ x y ]E} = {y Y [ x y ] E}c = (E x) c B Y

    since BY is itself a σ-algebra. Similarly, (Ec) y = (Ey) c BX.

  • Let E1,E2, be a sequence of H-measurable sets. Using elementary set-theoretic laws, we obtain

    ( n=1E n) x = {y Y [ x y ] n=1E n} = n=1 {y Y [ x y ] En} = n=1 (E n) x.

    Similarly ( En) y = n=1 (En) y Bx.

To demonstrate that one σ-algebra is contained in another, it suffices to demonstrate that the generating set of the former σ-algebra is contained in the second σ-algebra. We use the generating set from the part (i) of this proof, i.e., the collection {E × FE BX,F BY }. An important observation that one immediately makes while playing around with sections is that

(E × F)y = E BX,y F (E × F)x = F BY ,x E otherwise

But this practically means that

{E × FE BX,F BY } {E 2X×Y | y Y :Ey BX x X :Ex BY } .

Thus, BX ×BY H, as desired.

(iv)
If f is BX ×BY -measurable then for any set A in the target σ-algebra, (fx)1(A) = (f1(A))x which is in BY because f1(A) BX ×BY . Similarly for (fy)1(A) = (f1(A))y BX.
The property of the section of an inverse that we have used in the previous argument can be proven as follows: y (fx)1(A)f x(y) Af(x,y) A(x,y) f1(A)y (f1(A)) x,

and similarly for (fy)1(A) = (f1(A))y.

(v)
this part is yet to be solved by a student who is comfortable with cardinal arithmetic.
User profile picture
2021-09-13 00:00
Comments