Lebesgue differentiation theorem

<h2 id="statement">Statement</h2>
For a <a href="/facts/Lebesgue_integrable/f4AgvC6x">Lebesgue integrable</a> real or complex-valued function f on Rn, the indefinite integral is a <a href="/facts/Set_function/Dy46B9EJ">set function</a> which maps a measurable set A to the Lebesgue integral of 
 
 
 
 f
 ⋅
 
 
 1
 
 
 A
 
 
 
 
 {\displaystyle f\cdot \mathbf {1} _{A}}
 
, where 
 
 
 
 
 
 1
 
 
 A
 
 
 
 
 {\displaystyle \mathbf {1} _{A}}
 
 denotes the <a href="/facts/Indicator_function/QEuh04NM">characteristic function</a> of the set A. It is usually written

A
 ↦
 
 ∫
 
 A
 
 
 f
  
 
 d
 
 λ
 ,
 
 
 {\displaystyle A\mapsto \int _{A}f\ \mathrm {d} \lambda ,}
 
 
with λ the n–dimensional <a href="/facts/Lebesgue_measure/8us9cGoW">Lebesgue measure</a>.
The derivative of this integral at x is defined to be

lim
          
            B
            →
            x
          
        
        
          
            1
            
              
                |
              
              B
              
                |
              
            
          
        
        
          ∫
          
            B
          
        
        f
        
        
          d
        
        λ
        ,
      
    
    {\displaystyle \lim _{B\to x}{\frac {1}{|B|}}\int _{B}f\,\mathrm {d} \lambda ,}

where |B| denotes the volume (i.e., the Lebesgue measure) of a <a href="/facts/Ball_(mathematics)/f9vpMVMp">ball</a> B  centered at x, and B → x means that the diameter of B  tends to 0. 
The Lebesgue differentiation theorem (Lebesgue 1910) states that this derivative exists and is equal to f(x) at <a href="/facts/Almost_everywhere/1quRFtJE">almost every</a> point x ∈ Rn.<a class="footnote-ref" id="fnref:1" href="#fn:1">1</a> In fact a slightly stronger statement is true. Note that:

|
          
            
              
                1
                
                  
                    |
                  
                  B
                  
                    |
                  
                
              
            
            
              ∫
              
                B
              
            
            f
            (
            y
            )
            
            
              d
            
            λ
            (
            y
            )
            −
            f
            (
            x
            )
          
          |
        
        =
        
          |
          
            
              
                1
                
                  
                    |
                  
                  B
                  
                    |
                  
                
              
            
            
              ∫
              
                B
              
            
            (
            f
            (
            y
            )
            −
            f
            (
            x
            )
            )
            
            
              d
            
            λ
            (
            y
            )
          
          |
        
        ≤
        
          
            1
            
              
                |
              
              B
              
                |
              
            
          
        
        
          ∫
          
            B
          
        
        
          |
        
        f
        (
        y
        )
        −
        f
        (
        x
        )
        
          |
        
        
        
          d
        
        λ
        (
        y
        )
        .
      
    
    {\displaystyle \left|{\frac {1}{|B|}}\int _{B}f(y)\,\mathrm {d} \lambda (y)-f(x)\right|=\left|{\frac {1}{|B|}}\int _{B}(f(y)-f(x))\,\mathrm {d} \lambda (y)\right|\leq {\frac {1}{|B|}}\int _{B}|f(y)-f(x)|\,\mathrm {d} \lambda (y).}

The stronger assertion is that the right hand side tends to zero for almost every point x. The points x for which this is true are called the <a href="/facts/Lebesgue_point/6kysoUlL">Lebesgue points</a> of f.
A more general version also holds. One may replace the balls B  by a family 
 
 
 
 
 
 V
 
 
 
 
 {\displaystyle {\mathcal {V}}}
 
 of sets U  of bounded eccentricity. This means that there exists some fixed c > 0 such that each set U  from the family is contained in a ball B  with 
 
 
 
 
 |
 
 U
 
 |
 
 ≥
 c
 
 
 |
 
 B
 
 |
 
 
 
 {\displaystyle |U|\geq c\,|B|}
 
. It is also assumed that every point x ∈ Rn is contained in arbitrarily small sets from 
 
 
 
 
 
 V
 
 
 
 
 {\displaystyle {\mathcal {V}}}
 
. When these sets shrink to x, the same result holds: for almost every point x,

f
        (
        x
        )
        =
        
          lim
          
            U
            →
            x
            ,
            
            U
            ∈
            
              
                V
              
            
          
        
        
          
            1
            
              
                |
              
              U
              
                |
              
            
          
        
        
          ∫
          
            U
          
        
        f
        
        
          d
        
        λ
        .
      
    
    {\displaystyle f(x)=\lim _{U\to x,\,U\in {\mathcal {V}}}{\frac {1}{|U|}}\int _{U}f\,\mathrm {d} \lambda .}

The family of cubes is an example of such a family 
 
 
 
 
 
 V
 
 
 
 
 {\displaystyle {\mathcal {V}}}
 
, as is the family 
 
 
 
 
 
 V
 
 
 
 
 {\displaystyle {\mathcal {V}}}
 
(m) of rectangles in R2 such that the ratio of sides stays between m−1 and m, for some fixed m ≥ 1. If an arbitrary norm is given on Rn, the family of balls for the metric associated to the norm is another example.
The one-dimensional case was proved earlier by Lebesgue (1904). If f is integrable on the real line, the function

F
        (
        x
        )
        =
        
          ∫
          
            (
            −
            ∞
            ,
            x
            ]
          
        
        f
        (
        t
        )
        
        
          d
        
        t
      
    
    {\displaystyle F(x)=\int _{(-\infty ,x]}f(t)\,\mathrm {d} t}

is almost everywhere differentiable, with 
 
 
 
 
 F
 ′
 
 (
 x
 )
 =
 f
 (
 x
 )
 .
 
 
 {\displaystyle F'(x)=f(x).}
 
 Were 
 
 
 
 F
 
 
 {\displaystyle F}
 
 defined by a <a href="/facts/Riemann_integral/vWGrPhVh">Riemann integral</a> this would be essentially the <a href="/facts/Fundamental_theorem_of_calculus/pHeSGtUx">fundamental theorem of calculus</a>, but Lebesgue proved that it remains true when using the Lebesgue integral.<a class="footnote-ref" id="fnref:2" href="#fn:2">2</a>

<h2 id="proof">Proof</h2>
The theorem in its stronger form—that almost every point is a Lebesgue point of a <a href="/facts/Locally_integrable_function/HgcUMNG6">locally integrable function</a> f—can be proved as a consequence of the <a href="/facts/Lp_space/gbad0Rv1">weak–L1</a> estimates for the <a href="/facts/Hardy%E2%80%93Littlewood_maximal_function/N5ez7IM5">Hardy–Littlewood maximal function</a>. The proof below follows the standard treatment that can be found in Benedetto & Czaja (2009), Stein & Shakarchi (2005), Wheeden & Zygmund (1977) and Rudin (1987).
Since the statement is local in character, f can be assumed to be zero outside some ball of finite radius and hence integrable. It is then sufficient to prove that the set

E
          
            α
          
        
        =
        
          
            {
          
        
        x
        ∈
        
          
            R
          
          
            n
          
        
        :
        
          lim sup
          
            
              |
            
            B
            
              |
            
            →
            0
            ,
            
            x
            ∈
            B
          
        
        
          
            1
            
              
                |
              
              B
              
                |
              
            
          
        
        
          
            |
          
        
        
          ∫
          
            B
          
        
        f
        (
        y
        )
        −
        f
        (
        x
        )
        
        
          d
        
        y
        
          
            |
          
        
        >
        2
        α
        
          
            }
          
        
      
    
    {\displaystyle E_{\alpha }={\Bigl \{}x\in \mathbf {R} ^{n}:\limsup _{|B|\rightarrow 0,\,x\in B}{\frac {1}{|B|}}{\bigg |}\int _{B}f(y)-f(x)\,\mathrm {d} y{\bigg |}>2\alpha {\Bigr \}}}

has measure 0 for all α > 0.
Let ε > 0 be given. Using the <a href="/facts/Dense_set/nPT9Yxao">density</a> of <a href="/facts/Continuous_functions/sKbl02pB">continuous functions</a> of <a href="/facts/Compact_set/d0cgXJH7">compact</a> <a href="/facts/Support_of_a_function/BTuMGbsb">support</a> in <a href="/facts/Lp_space/gbad0Rv1">L1(Rn)</a>, one can find such a function g satisfying

‖
 f
 −
 g
 
 ‖
 
 
 L
 
 1
 
 
 
 
 =
 
 ∫
 
 
 
 R
 
 
 n
 
 
 
 
 
 |
 
 f
 (
 x
 )
 −
 g
 (
 x
 )
 
 |
 
 
 
 d
 
 x
 <
 ε
 .
 
 
 {\displaystyle \|f-g\|_{L^{1}}=\int _{\mathbf {R} ^{n}}|f(x)-g(x)|\,\mathrm {d} x<\varepsilon .}

It is then helpful to rewrite the main difference as

1
            
              
                |
              
              B
              
                |
              
            
          
        
        
          ∫
          
            B
          
        
        f
        (
        y
        )
        
        
          d
        
        y
        −
        f
        (
        x
        )
        =
        
          
            (
          
        
        
          
            1
            
              
                |
              
              B
              
                |
              
            
          
        
        
          ∫
          
            B
          
        
        
          
            (
          
        
        f
        (
        y
        )
        −
        g
        (
        y
        )
        
          
            )
          
        
        
        
          d
        
        y
        
          
            )
          
        
        +
        
          
            (
          
        
        
          
            1
            
              
                |
              
              B
              
                |
              
            
          
        
        
          ∫
          
            B
          
        
        g
        (
        y
        )
        
        
          d
        
        y
        −
        g
        (
        x
        )
        
          
            )
          
        
        +
        
          
            (
          
        
        g
        (
        x
        )
        −
        f
        (
        x
        )
        
          
            )
          
        
        .
      
    
    {\displaystyle {\frac {1}{|B|}}\int _{B}f(y)\,\mathrm {d} y-f(x)={\Bigl (}{\frac {1}{|B|}}\int _{B}{\bigl (}f(y)-g(y){\bigr )}\,\mathrm {d} y{\Bigr )}+{\Bigl (}{\frac {1}{|B|}}\int _{B}g(y)\,\mathrm {d} y-g(x){\Bigr )}+{\bigl (}g(x)-f(x){\bigr )}.}

The first term can be bounded by the value at x of the maximal function for f − g, denoted here by 
 
 
 
 (
 f
 −
 g
 
 )
 
 ∗
 
 
 (
 x
 )
 
 
 {\displaystyle (f-g)^{*}(x)}
 
:

1
            
              
                |
              
              B
              
                |
              
            
          
        
        
          ∫
          
            B
          
        
        
          |
        
        f
        (
        y
        )
        −
        g
        (
        y
        )
        
          |
        
        
        
          d
        
        y
        ≤
        
          sup
          
            r
            >
            0
          
        
        
          
            1
            
              
                |
              
              
                B
                
                  r
                
              
              (
              x
              )
              
                |
              
            
          
        
        
          ∫
          
            
              B
              
                r
              
            
            (
            x
            )
          
        
        
          |
        
        f
        (
        y
        )
        −
        g
        (
        y
        )
        
          |
        
        
        
          d
        
        y
        =
        (
        f
        −
        g
        
          )
          
            ∗
          
        
        (
        x
        )
        .
      
    
    {\displaystyle {\frac {1}{|B|}}\int _{B}|f(y)-g(y)|\,\mathrm {d} y\leq \sup _{r>0}{\frac {1}{|B_{r}(x)|}}\int _{B_{r}(x)}|f(y)-g(y)|\,\mathrm {d} y=(f-g)^{*}(x).}

The second term disappears in the limit since g is a continuous function, and the third term is bounded by |f(x) − g(x)|. For the absolute value of the original difference to be greater than 2α in the limit, at least one of the first or third terms must be greater than α in absolute value. However, the estimate on the Hardy–Littlewood function says that

|
 
 
 
 {
 
 x
 :
 (
 f
 −
 g
 
 )
 
 ∗
 
 
 (
 x
 )
 >
 α
 
 }
 
 
 
 |
 
 
 ≤
 
 
 
 A
 
 n
 
 
 α
 
 
 
 ‖
 f
 −
 g
 
 ‖
 
 
 L
 
 1
 
 
 
 
 <
 
 
 
 A
 
 n
 
 
 α
 
 
 
 ε
 ,
 
 
 {\displaystyle {\Bigl |}\left\{x:(f-g)^{*}(x)>\alpha \right\}{\Bigr |}\leq {\frac {A_{n}}{\alpha }}\,\|f-g\|_{L^{1}}<{\frac {A_{n}}{\alpha }}\,\varepsilon ,}

for some constant An depending only upon the dimension n. The <a href="/facts/Markov_inequality/Re85kMQJ">Markov inequality</a> (also called Tchebyshev's inequality) says that

|
 
 
 
 {
 
 x
 :
 
 |
 
 f
 (
 x
 )
 −
 g
 (
 x
 )
 
 |
 
 >
 α
 
 }
 
 
 
 |
 
 
 ≤
 
 
 1
 α
 
 
 
 ‖
 f
 −
 g
 
 ‖
 
 
 L
 
 1
 
 
 
 
 <
 
 
 1
 α
 
 
 
 ε
 
 
 {\displaystyle {\Bigl |}\left\{x:|f(x)-g(x)|>\alpha \right\}{\Bigr |}\leq {\frac {1}{\alpha }}\,\|f-g\|_{L^{1}}<{\frac {1}{\alpha }}\,\varepsilon }

thus

|
        
        
          E
          
            α
          
        
        
          |
        
        ≤
        
          
            
              
                A
                
                  n
                
              
              +
              1
            
            α
          
        
        
        ε
        .
      
    
    {\displaystyle |E_{\alpha }|\leq {\frac {A_{n}+1}{\alpha }}\,\varepsilon .}

Since ε was arbitrary, it can be taken to be arbitrarily small, and the theorem follows.

<h2 id="discussion-of-proof">Discussion of proof</h2>
The <a href="/facts/Vitali_covering_lemma/aJpbJgSm">Vitali covering lemma</a> is vital to the proof of this theorem; its role lies in proving the estimate for the <a href="/facts/Hardy%E2%80%93Littlewood_maximal_function/N5ez7IM5">Hardy–Littlewood maximal function</a>.
The theorem also holds if balls are replaced, in the definition of the derivative, by families of sets with diameter tending to zero satisfying the Lebesgue's regularity condition, defined above as family of sets with bounded eccentricity. This follows since the same substitution can be made in the statement of the Vitali covering lemma.

<h2 id="discussion">Discussion</h2>
This is an analogue, and a generalization, of the <a href="/facts/Fundamental_theorem_of_calculus/pHeSGtUx">fundamental theorem of calculus</a>, which equates a <a href="/facts/Riemann_integrable/vWGrPhVh">Riemann integrable</a> function and the derivative of its (indefinite) integral. It is also possible to show a converse – that every differentiable function is equal to the integral of its derivative, but this requires a <a href="/facts/Henstock%E2%80%93Kurzweil_integral/vaaD7UWh">Henstock–Kurzweil integral</a> in order to be able to integrate an arbitrary derivative.
A special case of the Lebesgue differentiation theorem is the <a href="/facts/Lebesgue_density_theorem/anCPE6IX">Lebesgue density theorem</a>, which is equivalent to the differentiation theorem for characteristic functions of measurable sets. The density theorem is usually proved using a simpler method (e.g. see Measure and Category).
This theorem is also true for every finite Borel measure on Rn instead of Lebesgue measure (a proof can be found in e.g. (Ledrappier & Young 1985)). More generally, it is true of any finite Borel measure on a separable metric space such that at least one of the following holds:

<ul><li>the metric space is a <a href="/facts/Riemannian_manifold/5KYnmEgF">Riemannian manifold</a>,</li>
<li>the metric space is a <a href="/facts/Locally_compact/hesalT7q">locally compact</a> <a href="/facts/Ultrametric_space/QhJQBG9N">ultrametric space</a>,</li>
<li>the measure is <a href="/facts/Doubling_space/8y92hNdN">doubling</a>.</li></ul>
A proof of these results can be found in sections 2.8–2.9 of (Federer 1969).

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Lebesgue%27s_density_theorem/anCPE6IX">Lebesgue's density theorem</a></li></ul>

<ul><li><a href="/facts/Henri_Lebesgue/ysngVGXc">Lebesgue, Henri</a> (1904). <a href="https://archive.org/details/leonssurlintgra00lebegoog">Leçons sur l'Intégration et la recherche des fonctions primitives</a>. Paris: Gauthier-Villars.</li>
<li><a href="/facts/Henri_Lebesgue/ysngVGXc">Lebesgue, Henri</a> (1910). <a href="http://www.numdam.org/item?id=ASENS_1910_3_27__361_0">"Sur l'intégration des fonctions discontinues"</a>. Annales Scientifiques de l'École Normale Supérieure. 27: 361–450. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.24033%2Fasens.624">10.24033/asens.624</a>.</li>
<li>Wheeden, Richard L.; <a href="/facts/Antoni_Zygmund/aq3aYDrq">Zygmund, Antoni</a> (1977). Measure and Integral – An introduction to Real Analysis. Marcel Dekker.</li>
<li>Oxtoby, John C. (1980). Measure and Category. Springer Verlag.</li>
<li><a href="/facts/Elias_M._Stein/9IRxdGWp">Stein, Elias M.</a>; Shakarchi, Rami (2005). Real analysis. Princeton Lectures in Analysis, III. Princeton, NJ: Princeton University Press. pp. xx+402. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-691-11386-6. <a href="/facts/MR_(identifier)/uP137L11">MR</a><a href="https://mathscinet.ams.org/mathscinet-getitem?mr=2129625">2129625</a></li>
<li>Benedetto, John J.; Czaja, Wojciech (2009). Integration And Modern Analysis. Birkhäuser Advanced Texts. Springer. pp. 361–364. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0817643065.</li>
<li>Rudin, Walter (1987). Real and complex analysis. International Series in Pure and Applied Mathematics (3rd ed.). McGraw–Hill. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0070542341.</li>
<li>Ledrappier, F.; <a href="/facts/Lai-Sang_Young/ejQP03ol">Young, L.S.</a> (1985). "The Metric Entropy of Diffeomorphisms: Part I: Characterization of Measures Satisfying Pesin's Entropy Formula". Annals of Mathematics. 122 (3): 509–539. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.2307%2F1971328">10.2307/1971328</a>. <a href="/facts/JSTOR_(identifier)/YTeVmaJ7">JSTOR</a> <a href="https://www.jstor.org/stable/1971328">1971328</a>.</li>
<li><a href="/facts/Herbert_Federer/Ue4jg14C">Federer, Herbert</a> (1969). Geometric measure theory. Die Grundlehren der mathematischen Wissenschaften, Band. Vol. 153. New York: Springer-Verlag New York Inc.</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Folland, G. B. (1999). Real analysis : modern techniques and their applications (2 ed.). New York: Wiley. pp. Chapter 3. ISBN 0-471-31716-0. OCLC 39849337. <a href="0-471-31716-0" target="_blank">0-471-31716-0</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">McDonald, John N. (2013). A course in real analysis. N. A. Weiss (2 ed.). Boston, Mass.: Academic Press/Elsevier. ISBN 978-0-12-387774-1. OCLC 754105634. <a href="978-0-12-387774-1" target="_blank">978-0-12-387774-1</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
</ol>

Lebesgue differentiation theorem open-in-new

Lebesgue differentiation theorem