Lebesgue Differentiation

Lebesgue Differentiation

LEBESGUE DIFFERENTIATION ANUSH TSERUNYAN Throughout, we work in the Lebesgue measure space Rd;L(Rd);λ , where L(Rd) is the σ-algebra of Lebesgue-measurable sets and λ is the Lebesgue measure. 2 Rd For r > 0 and x , let Br(x) denote the open ball of radius r centered at x. The spaces 0 and 1 1. L Lloc The space L0 of measurable functions. By a measurable function we mean an L(Rd)- measurable function f : Rd ! R and we let L0(Rd) (or just L0) denote the vector space of all measurable functions modulo the usual equivalence relation =a:e: of a.e. equality. There are two natural notions of convergence (topologies) on L0: a.e. convergence and convergence in measure. As we know, these two notions are related, but neither implies the other. However, convergence in measure of a sequence implies a.e. convergence of a subsequence, which in many situations can be boosted to a.e. convergence of the entire sequence (recall Problem 3 of Midterm 2). Convergence in measure is captured by the following family of norm-like maps: for each α > 0 and f 2 L0, k k . · f α∗ .= α λ ∆α(f ) ; n o . 2 Rd j j k k where ∆α(f ) .= x : f (x) > α . Note that f α∗ can be infinite. 2 0 k k 6 k k Observation 1 (Chebyshev’s inequality). For any α > 0 and any f L , f α∗ f 1. 1 2 Rd The space Lloc of locally integrable functions. Differentiation at a point x is a local notion as it only depends on the values of the function in some open neighborhood of x, so, in this context, it is natural to work with a class of functions defined via a local property, as opposed to global (e.g. being in L1(Rd)). Definition 2. Call a measurable function f locally integrable if it is integrable on every Rd 1 2 1 bounded subset of , i.e. for any r > 0, f Br (x) L . 1 Rd Denote by Lloc( ) the vector space of all locally integrable functions modulo the 1 ⊆ 1 Rd equivalence relation =a:e:. Obviously, L Lloc. Moreover, letting C( ) denote the space Rd Rd ⊆ 1 2 Rd of continuous functions on , we have C( ) Lloc because each f C( ) is bounded on every ball. 1 1 The natural notion of convergence in Lloc is the local L -convergence, namely, ! ., 8 1 ! 1 fn 1 f . r > 0 fn B (0) L1 f B (0) : Lloc r r ! ! Clearly, fn L1 fn implies fn 1 f . Lloc Date: August 27, 2018. 1 2. Averaging operators > 2 1 2 Rd For r 0, f Lloc, and x , we define Z Z 1 1 1 A f (x) .= f dλ = f dλ. r d λ Br(x) Br (x) λ B1(0) r Br (x) We refer to Arf (x) as the average of f at x within radius r. Proposition 3. Let r > 0. 1 Rd 2 1 (3.a) Ar is a linear transformation from Lloc to C( ). Moreover, for any f Lloc, the map 7! 1 × Rd ! R (r;x) Arf (x) is continuous as a function (0; ) . 1 1 (3.b) Ar is continuous with respect to Lloc-convergence on Lloc and pointwise convergence on Rd ! ! C( ), i.e. if fn 1 f , then Arfn Arf pointwise. Lloc 1 1 Proof. Part (3.a) follows by the absolute continuity of f B in L -norm, where B is any ball ! R ! R (bounded set). Part (3.b) is obvious because fn 1 f implies fndλ f dλ. Lloc B(x;r) B(x;r) 3. Vitali covers d Lemma 4 (Vitali). Any finite collection C of open balls in R admits a subcollection C0 ⊆ C of pairwise disjoint balls, whose union is a constant proportion of the total union, more precisely: G [ d λ C0 > 3− λ C : Proof. Let B0 be a ball in C with maximum radius. If there is no ball in C disjoint from B0, stop; otherwise let B1 be a ball of maximum radius among those balls in C that are disjoint t from B0. Continue. If there is no ball in C disjoint from B0 B1, stop. Otherwise, let B2 be t a ball of maximum radius among those balls in C that are disjoint from B0 B1. And so on and so forth. Because C is finite, this process terminates, i.e. there is n 2 N such that there F . f g is no ball in C disjoint from i<n Bi and we put C0 .= Bi : i < n . To check that C is as desired, it is enough to show that if all balls in C are made 3 times 0 S 0 bigger, than they cover C. More precisely, letting Bi0 be the ball with the same center as S ⊇ S Bi but with radius 3 times bigger than that of Bi, we want to show that i<n Bi0 C. To this end, fix a ball B 2 C and suppose it is not one of the balls in C , so it must F 0 intersect i<n Bi (otherwise, the above process wouldn’t stop at n). Let i be the least such \ that B Bi , 0. By the choice of Bi at the step i of the above algorithm, the radius of B is ⊇ not bigger than that of Bi, so Bi0 B and we are done. Lemma 5 (Vitali Covering). Let a measurable A ⊆ Rd be covered by a (possibly infinite) ⊆ collection C of open balls. For every 0 6 a < λ(A), there is a finite subcollection Ca C of pairwise disjoint balls such that G d λ Ca > 3− a: Proof. By the inner regularity of the Lebesgue measure (Problem 4(c) of Midterm 1), there is a compact set K ⊆ A with λ(K) > a. C is an open cover of K, so there is a finite subcover ⊆ ⊆ CK C of K. Apply Lemma4 to CK to obtain a pairwise disjoint subcollection Ca CK as desired. 2 The rest of this section is devoted to a proof of a stronger form of the last lemma, which is not used anywhere in this note, but is very useful in general. We start with an easy observation. d Lemma 6 (Outer measure via open covers). For A ⊆ R , λ∗(A) < r if and only if there is an open set U ⊇ A with λ(U) < r. Proof. (: Follows from the fact that any open set U is a countable disjoint union of boxes. To see the latter, recall that open boxes form a bases for Rd and write U as a countable S . nS union of open boxes U = n Bn. Make these disjoint by replacing Bn with Bn0 .= Bn i<n Bi and observe that Bn0 itself is a disjoint union of finitely many boxes. ) f g . P : Let Bn be a countable cover of A with boxes witnessing λ∗(A) < r, i.e. s .= n λ(Bn) < r. ⊇ (n+2) − Replacing each box Bn by an open box Bn0 Bn with λ(Bn0 ) < λ(Bn) + 2− (r s), we see . S P (n+2) − that U .= n Bn0 is open, contains A, and has measure at most s + n 2− (r s) < r. Definition 7. A collection C of open balls in Rd is called a Vitali cover of a set A ⊆ Rd if for each x 2 A there are arbitrarily small balls in C containing x. Lemma 8 (Strong Vitali Covering). Let C be a Vitali cover of a (not necessarily measurable) set ⊆ Rd 1 ⊆ A with λ∗(A) < . For every " > 0, there is a pairwise disjoint finite subcollection C" C n S ⊇ n S such that λ∗ (A C") < ": Equivalently (by Lemma6), there is an open set U A C" with λ(U) < ". Proof. By Lemma6, there is an open set V ⊇ A with finite measure. The subcollection of C \ P(V ) is still a Vitali cover of A, so replacing C by it, we may assume that C ⊆ P(V ). 2 2 S We recursively define a sequence (Bn)n N C by letting Bn C be disjoint from i<n Bi and of radius at least half of what’s available,2 i.e. 8 9 1 > [ > sup<raduis(B): B 2 C disjoint from B =: 2 > i> : i<n ; If for some n, such a Bn does not exist, i.e. the above supremum is 0, then we are done . f g by taking C" .= B0;:::;Bn 1 . Thus, suppose that the above procedure defined an infinite − P F sequence (B ) N ⊆ C of necessarily pairwise disjoint sets. Because λ(B ) = λ( B ) 6 n n P n n n n λ(V ) < 1, there2 is N 2 N such that λ(B ) < " . We show that C .= fB ;:::;B g is as n>N n 5d " 0 N 1 desired. Because a boundary of a ball is null, it is enough to show that the outer measure− of . n S ⊇ A0 .= A n<N Bn is less than ", which we do by building an open set U A0 with λ(U) < " and using Lemma6. To this end, let 8 9 > [ > C .= <B 2 C : B \ B = ;= 0 > n > : n<N ; . S and U .= C0. Note that U ⊇ A0 since for each x 2 A0 there is a ball B 2 C0 containing x S because n<N Bn is closed and C is a Vitali cover.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    6 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us