User Tools

Site Tools


math105-s22:notes:lecture_12

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
math105-s22:notes:lecture_12 [2022/02/23 23:58]
pzhou
math105-s22:notes:lecture_12 [2022/02/25 00:35] (current)
pzhou
Line 32: Line 32:
 F+(x)dx=F(x)dx \int F_+(x) dx = \int F_- (x) dx  F+(x)dx=F(x)dx \int F_+(x) dx = \int F_- (x) dx
 hence F+(x)=F(x)F_+(x) = F_-(x) for almost all xx. Thus, for a.e. xx, we have $\uint f(x,y) dy = \lint f(x,y) dy$, thus f(x,y)dy\int f(x,y) dy exists for a.e. x.  hence F+(x)=F(x)F_+(x) = F_-(x) for almost all xx. Thus, for a.e. xx, we have $\uint f(x,y) dy = \lint f(x,y) dy$, thus f(x,y)dy\int f(x,y) dy exists for a.e. x. 
 +
 +==== A Lemma ====
 +Suppose AA is measurable, and BAB \In A any subset, with Bc=A\BB^c = A \RM B. Then
 +m(A)=m(B)+m(Bc) m(A) = m^*(B) + m_*(B^c)
 +Proof: 
 +m(B)=inf{m(C)ACB,Cmeasurable}=inf{m(A)m(Cc)ACB,Cmeasurable} m^*(B) = \inf \{ m(C) \mid A \supset C \supset B, C \text{measurable} \} = \inf \{ m(A) - m(C^c) \mid A \supset C \supset B, C \text{measurable} \}
 +=m(A)sup{m(Cc)ACB,Cmeasurable}=m(A)sup{m(Cc)CcBc,Ccmeasurable}=m(A)m(Bc) = m(A) - \sup \{ m(C^c) \mid A \supset C \supset B, C \text{measurable} \} = m(A) - \sup \{ m(C^c) \mid C^c \subset B^c, C^c \text{measurable} \} = m(A) - m_*(B^c)
  
 ===== Pugh 6.8: Vitali Covering ===== ===== Pugh 6.8: Vitali Covering =====
Line 39: Line 46:
 **Vitali Covering Lemma:** Let $\vcal$ be a Vitali covering of a measurable bounded subset AA by closed balls, then for any $\epsilon>0$, there is a countable disjoint subcollection $\vcal' = \{V_1, V_2, \cdots \},suchthat, such that A \RM \cup_k V_kisanullset,and is a null set, and \sum_k m(V_k) \leq m(A) + \epsilon$.  **Vitali Covering Lemma:** Let $\vcal$ be a Vitali covering of a measurable bounded subset AA by closed balls, then for any $\epsilon>0$, there is a countable disjoint subcollection $\vcal' = \{V_1, V_2, \cdots \},suchthat, such that A \RM \cup_k V_kisanullset,and is a null set, and \sum_k m(V_k) \leq m(A) + \epsilon$. 
  
-Proof: The construction is easy, like a 'greedy algorithm'. First, using the given ϵ\epsilon, we find an open subset WAW \supset A, with m(W)m(A)+ϵm(W) \leq m(A) + \epsilon. Let $\vcal_1 = \{V \in \vcal: V \In W\}$, and $d_1 = \sup \{diam V: V \in \vcal_1\}$. We pick $V_1 \in \vcal_1$ where the diameter is sufficiently large, say diamV1>d1/2diam V_1 > d_1 /2. Then, we delete V1V_1 from WW, let W2=W\V1W_2 = W \RM V_1, and consider $\vcal_2 = \{ V \in \vcal_1, V \In W_2\}, and define $d_2 = \sup \{diam V: V \in \vcal_2\},andpick, and pick V_2among among \vcal_2sothat so that diam V_2 > d_2 /2.Repeatthisprocess,wegetacollectionofdisjointclosedballs. Repeat this process, we get a collection of disjoint closed balls \{V_i\}.Sufficetoshowthat. Suffice to show that A \RM \cup V_i$ is a null set. +Proof: The construction is easy, like a 'greedy algorithm'. First, using the given ϵ\epsilon, we find an open subset WAW \supset A, with m(W)m(A)+ϵm(W) \leq m(A) + \epsilon. Let $\vcal_1 = \{V \in \vcal: V \In W\}$, and $d_1 = \sup \{diam V: V \in \vcal_1\}$. We pick $V_1 \in \vcal_1$ where the diameter is sufficiently large, say diamV1>d1/2diam V_1 > d_1 /2. Then, we delete V1V_1 from WW, let W2=W\V1W_2 = W \RM V_1, and consider $\vcal_2 = \{ V \in \vcal_1, V \In W_2\}$, and define $d_2 = \sup \{diam V: V \in \vcal_2\}$, and pick V2V_2 among $\vcal_2$ so that diamV2>d2/2diam V_2 > d_2 /2. Repeat this process, we get a collection of disjoint closed balls {Vi}\{V_i\}. Suffice to show that A\ViA \RM \cup V_i is a null set. 
  
 The crucial claim is the following, for any positive integer NN, we have The crucial claim is the following, for any positive integer NN, we have
math105-s22/notes/lecture_12.1645689482.txt.gz · Last modified: 2022/02/23 23:58 by pzhou