User Tools

Site Tools


math105-s22:notes:lecture_6

Table of Contents

Lecture 6

Theorem 21

If ERn,FRkE \In \R^n, F \In \R^k are measurable, then E×FE \times F is measurable, with m(E)×m(F)=m(E×F)m(E) \times m(F) = m(E \times F).

Let's first treat some special case. If m(E)=0m(E)=0, and m(F)=m(F) = \infty, what is m(E×F)m(E \times F)? You have seen a special case as m({0}×R)=0m ( \{ 0 \} \times \R)=0 in R2\R^2. The general proof is similar, for each ϵ\epsilon, and each nNn \in \N, we can find a countable collection of boxes that covers E×B(0,n)E \times B(0, n) with total volume less than ϵ/2n\epsilon/2^n. Then, we let n=1,2,n=1,2,\cdots, and put together these collection of boxes into a bigger collection (still countable), that gives a cover of E×RkE \times \R^k with total area less than ϵ\epsilon.

Next, let's prove some nice cases, that m(E×F)=m(E)m(F)m(E \times F) = m(E) m(F).

  • E,FE, F are open boxes.
  • E,FE, F are open sets (each open set is a disjoint union of open boxes and a measure zero set. See Pugh's dyadic proof).

Now, how to prove that E×F E \times F is measurable? We could use Caratheodory criterion, or, we could use Lebesgue criterion, by constructing outer and inner approximations. Again, we may assume EE is bounded and FF is bounded (otherwise, they can be written as disjoint union of bounded measurable pieces, and we can deal with them pieces by pieces, and do countable union in the end). We may assume EB1,FB2E \In B_1, F \In B_2, for BiB_i some open boxes.

Let HEH_E be a GδG_\delta-set and KEK_E be FδF_\delta, such that HEEKEH_E \supset E \supset K_E, and m(HE\KE)=0m(H_E \RM K_E) = 0. Define HF,KFH_F, K_F for FF similarly. Then, by downward monotone continuity of measure, we have m(HE×HF)=limm(HE,n×HF,n)=limm(HE,n)×m(HF,n)=m(HE)×m(HF)=m(E)×m(F) m(H_E \times H_F) = \lim m(H_{E,n} \times H_{F,n}) = \lim m(H_{E,n}) \times m(H_{F,n}) = m(H_E) \times m(H_F) = m(E) \times m(F) where HE,nH_{E,n} are open sets, with HE,nHE,n+1H_{E,n} \supset H_{E,n+1}, and HE=nHE,nH_E = \cap_n H_{E,n} for all nn.

Also, we have HE×HF\(KE×KF)(HE×KE)×B2B1×(HF×KF) H_E \times H_F \RM (K_E \times K_F) \subset (H_E \times K_E) \times B_2 \cup B_1 \times (H_F \times K_F) where the last term is a null set, hence m(KE×KF)=m(HE×HF)=m(E)×m(F)m(K_E \times K_F) = m(H_E \times H_F) = m(E) \times m(F).

Theorem 26

If ERn×RkE \In \R^n \times \R^k is measurable, then EE is a zero set if and only if almost( = up to a zero set) every slice ExE_x, (xRnx \in \R^n) is measure zero.

Pf: as usual, we may assume n=k=1n=k=1 and EE is contained in the unit square. Suppose EE is measurable, and m(Ex)=0m(E_x)=0 for almost all xIx \in I, then we want to show m(E)=0m(E)=0. Let ZIZ \In I be the set of xx where m(Ex)0m(E_x) \neq 0. Then, m(Z)=0m(Z)=0. Since Z×IZ \times I is measureable and has measure 0, we may replace EE by E\(Z×I)E \RM (Z \times I), and assume for all xIx \in I, m(Ex)=0m(E_x)=0.

By inner regularity, we may replace EE by a closed set KK. Since E is bounded, hence KK is compact. Now, we try to cover KK by open boxes of total area less than ϵ\epsilon. Let K1=π(K)K_1= \pi (K) the projection to the first factor, than K1K_1 is compact.

  • For each xIx \in I, we cover KxK_x by an open set V(x)V(x) of m(V(x))<ϵm(V(x))<\epsilon. We can find U(x)xU(x) \supset x, that U(x)×V(x)π11(U(x))U(x) \times V(x) \supset \pi_1^{-1}(U(x)) . This is possible since KK is compact.
  • We know KxU(x)×V(x)K \subset \cup_x U(x) \times V(x), but that's uncountably many set. We can pass to a finite subcover, indexed by x1,,xNx_1, \cdots, x_N. Let Ui=U(xi)\(j<iU(xj))U_i = U(x_i) \RM (\cup_{j<i} U(x_j)), Vi=V(xi)V_i = V(x_i), then we still have Ui×Viπ1UiU_i \times V_i \supset \pi^{-1} U_i. Thus, UiU_i are disjoint, and we have m(Ui)1m (\cup U_i) \leq 1 and m(K)im(Ui)×m(Vi)ϵm (K) \leq \sum_i m(U_i)\times m(V_i) \leq \epsilon.

Discussion

  1. Can you prove that {y=x}R2\{y=x\} \In \R^2 has measure 00?
  2. In both of the two proofs above, we assumed EE was bounded, how to deal with the general case?
  3. Prove that every closed subset (e.g. your favorite Cantor set is a closed set) in R\R is a GδG_\delta-set. Is it true that every open set is a FσF_\sigma-set?
math105-s22/notes/lecture_6.txt · Last modified: 2022/02/03 16:28 by pzhou