A First Course in Sobolev Spaces
Giovanni Leoni
Graduate Studies in Mathematics Volume IOS
American Mathematical Society
A First Course in Sobolev Spaces
A First Course in Sobolev Spaces Giovanni Leoni
Graduate Studies in Mathematics Volume 105
American Mathematical Society Providence, Rhode Island
Editorial Board David Cox (Chair) Steven G. Krantz Rafe Mazzeo Martin Scharlemann 2000 Mathematics Subject Classification. Primary 46E35; Secondary 26A24, 26A27, 26A30, 26A42, 26A45, 26A46, 26A48, 26B30.
For additional information and updates on this book, visit
www.ams.org/bookpages/gsm-105
Library of Congress Cataloging-in-Publication Data Leoni, Giovanni, 1967A first course in Sobolev spaces / Giovanni Leoni.
p. cm. - (Graduate studies in mathematics ; v. 105) Includes bibliographical references and index. ISBN 978-0-8218-4768-8 (alk. paper) 1. Sobolev spaces. I. Title.
QA323.L46 2009 515'.782-dc22
2009007620
Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Acquisitions Department, American Mathematical Society, 201 Charles Street, Providence, Rhode Island 02904-2294, USA. Requests can also be made by e-mail to reprint-peraiasionQams. org. © 2009 by the American Mathematical Society. All rights reserved. The American Mathematical Society retains all rights except those granted to the United States Government. Printed in the United States of America.
® The paper used in this book is acid-free and falls within the guidelines established to ensure permanence and durability.
Visit the AMS home page at http://vw.ams.org/ 10987654321 14131211 1009
Contents
Preface
ix
Acknowledgments
xv
Part 1. Functions of One Variable Chapter 1. Monotone Functions §1.1. Continuity §1.2. Differentiability
3 3
8
Chapter 2. Functions of Bounded Pointwise Variation §2.1. Pointwise Variation §2.2. Composition in BPV (I) §2.3. The Space BPV (I) §2.4. Banach Indicatrix
39
Chapter 3. Absolutely Continuous Functions
73
§3.1.
AC(I) Versus BPV(I)
Chain Rule and Change of Variables §3.3. Singular Functions §3.2.
Chapter 4. Curves §4.1. Rectifiable Curves and Arclength §4.2. Frechet Curves §4.3. Curves and Hausdorff Measure §4.4. Jordan's Curve Theorem
39 55 59 66
73
94 107 115 115 130 134 146
v
Contents
vi
Chapter 5. Lebesgue-Stieltjes Measures §5.1. Radon Measures Versus Increasing Functions §5.2. Signed Borel Measures Versus BPV (1) §5.3. Decomposition of Measures §5.4. Integration by Parts and Change of Variables
155
Chapter 6. Decreasing Rearrangement §6.1. Definition and First Properties §6.2. Absolute Continuity of u*
187
§6.3.
Derivative of u*
Chapter 7. Functions of Bounded Variation and Sobolev Functions §7.1. BV (St) Versus BPV (1) §7.2. Sobolev Functions Versus Absolutely Continuous Functions
155 161
166 181
187 202
209 215 215
222
Part 2. Functions of Several Variables Chapter 8. §8.1. §8.2. §8.3.
Absolutely Continuous Functions and Change of
Variables The Euclidean Space RN Absolutely Continuous Functions of Several Variables Change of Variables for Multiple Integrals
231
231
234 242
255 Chapter 9. Distributions 255 §9.1. The Spaces DK (fl), D (1k), and D' (St) 264 §9.2. Order of a Distribution §9.3. Derivatives of Distributions and Distributions as Derivatives 266 §9.4.
Convolutions
Chapter 10. Sobolev Spaces §10.1. Definition and Main Properties §10.2. Density of Smooth Functions § 10.3. Absolute Continuity on Lines §10.4. Duels and Weak Convergence §10.5. A Characterization of W1,P (St) Chapter 11. Sobolev Spaces: Embeddings §11.1. Embeddings: 1 < p < N §11.2. Embeddings: p = N §11.3. Embeddings: p > N
275 279
279 283 293 298
305 311
312 328 335
Contents
§11.4.
vii
Lipschitz Functions
Chapter 12. Sobolev Spaces: Further Properties §12.1. Extension Domains §12.2. Poincare Inequalities Chapter 13. Functions of Bounded Variation §13.1. Definition and Main Properties §13.2. Approximation by Smooth Functions § 13.3. Bounded Pointwise Variation on Lines §13.4. Coarea Formula for BV Functions §13.5. Embeddings and Isoperimetric Inequalities §13.6. Density of Smooth Sets §13.7. A Characterization of BV (fl) Chapter 14. Besov Spaces §14.1. Besov Spaces B,P,e, 0 < s < 1 §14.2.
Dependence of B8,P,O on s
§14.3.
The Limit of Bs,P.e as s - 0+ and s - 1-
§14.4.
Dependence of Bs.n,e on 0 Dependence of Bs.P.e on s and p Embedding of Bs,P'e into LQ Embedding of W1,P into B1.4 Besov Spaces and Fractional Sobolev Spaces
§14.5. § 14.6.
§14.7. §14.8.
Chapter 15. Sobolev Spaces: Traces §15.1. Traces of Functions in W',' (fl) §15.2. Traces of Functions in BV (St) §15.3. Traces of Functions in W1.P (1k), p > 1 §15.4. A Characterization of W' 1' (fl) in Terms of Traces Chapter 16. Sobolev Spaces: Symmetrization §16.1. Symmetrization in LP Spaces §16.2. Symmetrization of Lipschitz Functions §16.3. Symmetrization of Piecewise Affine Functions §16.4. Symmetrization in W1,P and BV Appendix A. Functional Analysis §A.1. Metric Spaces
341
349 349 359
viii
§A.2. §A.3. §A.4.
§A.5. §A.6.
Contents
Topological Spaces Topological Vector Spaces Normed Spaces Weak Topologies Hilbert Spaces
Appendix B. Measures §B.1. Outer Measures and Measures §B.2. Measurable and Integrable Functions §B.3. Integrals Depending on a Parameter §B.4. Product Spaces §B.5. Radon-Nikodym's and Lebesgue's Decomposition Theorems §B.6. Signed Measures §B.7.
LP Spaces §B.8. Modes of Convergence §B.9. Radon Measures §B.10. Covering Theorems in RN
Appendix C. The Lebesgue and Hausdorff Measures §C.1. The Lebesgue Measure §C.2. The Brunn-Minkowski Inequality and Its Applications
494
497 501
503 506
507 507 511
519
520 522 523
526
534 536
538 543 543 545
§C.3.
Conv olutions
550
§C.4.
Molli fiers
552
Diffe rentiable Functions on Arbitrary Sets §C.6. Maxi mal Functions §C.7. Anis otropic L Spaces §C.8. Haus dorff Measures §C.5.
Appendix D.
Notes
560 564
568 572 581
Appendix E. Notation and List of Symbols
587
Bibliography
593
Index
603
Preface The Author List, I. giving credit where credit is due. The first author: Senior grad student in the project. Made the figures. -Jorge Chaut, www.phdcomics.com
There are two ways to introduce Sobolev spaces: The first is through the elegant (and abstract) theory of distributions developed by Laurent Schwartz in the late 1940s; the second is to look at them as the natural development and unfolding of monotone, absolutely continuous, and BV functions' of one variable.
To my knowledge, this is one of the first books to follow the second approach. I was more or less forced into it: This book is based on a series of lecture notes that I wrote for the graduate course "Sobolev Spaces", which
I taught in the fall of 2006 and then again in the fall of 2008 at Carnegie Mellon University. In 2006, during the first lecture, I found out that half of the students were beginning graduate students with no background in functional analysis (which was offered only in the spring) and very little in measure theory (which, luckily, was offered in the fall). At that point I had two choices: continue with a classical course on Sobolev spaces and thus loose half the class after the second lecture or toss my notes and rethink the entire operation, which is what I ended up doing. I decided to begin with monotone functions and with the Lebesgue differentiation theorem. To my surprise, none of the students taking the class had actually seen its proof. I then continued with functions of bounded pointwise variation and absolutely continuous functions. While these are included in most books on real analysis/measure theory, here the perspective and focus are rather different, in view of their applications to Sobolev functions. Just to give an example, 1BV functions are functions of bounded variation. ix
x
Preface
most books study these functions when the domain is either the closed interval [a, b] or R. I needed, of course, open intervals (possibly unbounded). This changed things quite a bit. A lot of the simple characterizations that hold in [a, b) fall apart when working with arbitrary unbounded intervals. After the first three chapters, in the course I actually jumped to Chapter 7, which relates absolutely continuous functions with Sobolev functions of one variable, and then started with Sobolev functions of several variables. In the book I included three more chapters: Chapter 4 studies curves and arclength. I think it is useful for students to see the relation between rectifiable curves and functions with bounded pointwise variation. Some classical results on curves that most students in analysis have heard of, but whose proof they have not seen, are included, among them Peano's filling curve and the Jordan curve theorem. Section 4.3 is more advanced. It relates rectifiable curves with the flI Hausdorff measure. Besides Hausdorff measures, it also makes use of the Vitali-Besicovitch covering theorem. All these results are listed in Appendices B and C. Chapter 5 introduces Lebesgue-Stieltjes measures. The reading of this chapter requires some notions and results from abstract measure theory. Again it departs slightly from modern books on measure theory, which introduce Lebesgue-Stieltjes measures only for right continuous (or left) functions. I needed them for an arbitrary function, increasing or with bounded pointwise variation. Here, I used the monograph of Saks 11451. I am not completely satisfied with this chapter: I have the impression that some of the proofs could have been simplified more using the results in the previous chapters. Readers' comments will be welcome. Chapter 6 introduces the notion of decreasing rearrangement. I used some of these results in the second part of the book (for Sobolev and Besov functions). But I also thought that this chapter would be appropriate for the first part. The basic question is how to modify a function that is not monotone into one that is, keeping most of the good properties of the original function. While the first part of the chapter is standard, the results in the last two sections are not covered in detail in classical books on the subject. As a final comment, the first part of the book could be used for an advanced undergraduate course or beginning graduate course on real analysis or functions of one variable. The second part of the book starts with one chapter on absolutely continuous transformations from domains of RN into RN. I did not cover this chapter in class, but I do think it is important in the book in view of its ties with the previous chapters and their applications to the change of variables
Preface
xi
formula for multiple integrals and of the renewed interest in the subject in recent years. I only scratched the surface here. Chapter 9 introduces briefly the theory of distributions. The book is structured in such a way that an instructor could actually skip it in case the students do not have the necessary background in functional analysis (as was true in my case). However, if the students do have the proper background, then I would definitely recommend including the chapter in a course. It is really important. Chapter 10 starts (at long last) with Sobolev functions of several variables. Here, I would like to warn the reader about two quite common misconceptions. Believe it or not, if you ask a student what a Sobolev function is, often the answer is "A Sobolev function is a function in L" whose derivative is in Lv" This makes the Cantor function a Sobolev function :( I hope that the first part of the book will help students to avoid this danger. The other common misconception is, in a sense, quite the opposite, namely to think of weak derivatives in a very abstract way not related to the classical derivatives. One of the main points of this book is that weak derivatives of a Sobolev function (but not of a function in BV!) are simply (classical) derivatives of a good representative. Again, I hope that the first part of the volume will help here. Chapters 10, 11, and 12 cover most of the classical theorems (density, absolute continuity on lines, embeddings, chain rule, change of variables, extensions, duals). This part of the book is more classical, although it contains a few results published in recent years. Chapter 13 deals with functions of bounded variation of several variables.
I covered here only those parts that did not require too much background in measure theory and geometric measure theory. This means that the fundamental results of De Giorgi, Federer, and many others are not included here. Again, I only scratched the surface of functions of bounded variation. My hope is that this volume will help students to build a solid background, which will allow them to read more advanced texts on the subject. Chapter 14 is dedicated to the theory of Besov spaces. There are essentially three ways to look at these spaces. One of the most successful is to see them as an example/by-product of interpolation theory (see [7], [166], and [167]). Interpolation is very elegant, and its abstract framework can be used to treat quite general situations well beyond Sobolev and Besov spaces. There are two reasons for why I decided not to use it: First, it would depart from the spirit of the book, which leans more towards measure theory and real analysis and less towards functional analysis. The second reason
xii
Preface
is that in recent years in calculus of variations there has been an increased interest in nonlocal functionals. I thought it could be useful to present some techniques and tricks for fractional integrals. The second approach is to use tempered distributions and Fourier theory to introduce Besov spaces. This approach has been particularly successful for its applications to harmonic analysis. Again it is not consistent with the remainder of the book. This left me with the approach of the Russian school, which relies mostly on the inequalities of Hardy, Holder, and Young, together with some integral identities. The main references for this chapter are the books of Besov, Win, and Nikol'skii [18J, [191.
I spent an entire summer working on this chapter, but I am still not happy with it. In particular, I kept thinking that there should be easier and more elegant proofs of some of the results (e.g., Theorem 14.32, or Theorem 14.29), but I could not find one. In Chapter 15 I discuss traces of Sobolev and BV functions. Although
in this book I only treat first-order Sobolev spaces, the reason I decided to use Besov spaces over fractional Sobolev spaces (note that in the range of exponents treated in this book these spaces coincide, since their norms are equivalent) is that the traces of functions in Wk,1(1) live in the Besov space $k-1,1(8 ) (see [28] and [120]), and thus a unified theory of traces for Sobolev spaces can only be done in the framework of Besov spaces. Finally, Chapter 16 is devoted to the theory of symmetrization in Sobolev
and BV spaces. This part of the theory of Sobolev spaces, which is often missing in classical textbooks, has important applications in sharp embedding constants, in the embedding N = p, as well as in partial differential equations. In Appendices A, B, and C I included essentially all the results from functional analysis and measure theory that I used in the text. I only proved those results that cannot be found in classical textbooks.
What is missing in this book: For didactical purposes, when I started to write this book, I decided to focus on first-order Sobolev spaces. In my original plan I actually meant to write a few chapters on higher-order Sobolev and Besov spaces to be put at the end of the book. Eventually I gave up: It would have taken too much time to do a good job, and the book was already too long. As a consequence, interpolation inequalities between intermediate derivatives are missing. They are treated extensively in [7]. Another important theorem that I considered adding and then abandoned for lack of time was Jones's extension theorem [92].
Preface
xiii
Chapter 13, the chapter on BV functions of several variables, is quite minimal. As I wrote there, I only touched the tip of the iceberg. Good reference books of all the fundamental results that are not included here are (10], (54], and [182].
References: The rule of thumb here is simple: I only quoted papers and books that I actually read at some point (well, there are a few papers in German, and although I do have a copy of them, I only "read" them in a weak sense, since I do not know the language). I believe that misquoting a paper is somewhat worse than not quoting it. Hence, if an important and relevant paper is not listed in the references, very likely it is because I either
forgot to add it or was not aware of it. While most authors write books because they are experts in a particular field, I write them because I want to learn a particular topic. I claim no expertise on Sobolev spaces.
Web page for mistakes, comments, and exercises: In a book of this length and with an author a bit absent-minded, typos and errors are almost inevitable. I will be very grateful to those readers who write to
[email protected] indicating those errors that they have found. The AMS is hosting a webpage for this book at http://www.ams.org/bookpages/gsm-105/ where updates, corrections, and other material may be found. The book contains more than 200 exercises, but they are not equally distributed. There are several on the parts of the book that I actually taught, while other chapters do not have as many. If you have any interesting exercises, I will be happy to post them on the web page. Giovanni Leoni
Acknowledgments The Author List, II. The second author: Grad student in the lab that has nothing to do with this project, but was included because he/she hung around the group meetings (usually for the food). The third author: First year student who actually did the experiments, performed the analysis and wrote the whole paper. Thinks being third author is "fair". -Jorge Cham, www.phdcomies.com
I am profoundly indebted to Pietro Siorpaes for his careful and critical reading of the manuscript and for catching 2a° mistakes in previous drafts. All remaining errors are, of course, mine. Several iterations of the manuscript benefited from the input, suggestions, and encouragement of many colleagues and students, in particular, Filippo Cagnetti, Irene Fonseca, Nicola Fusco, Bill Hrusa, Bernd Kawohl, Francesco Maggi, Jan Maly, Massimiliano Morini, Roy Nicolaides, Ernest
Schimmerling, and all the students who took the Ph.D. courses "Sobolev spaces" (fall 2006 and fall 2008) and "Measure and Integration" (fall 2007 and fall 2008) taught at Carnegie Mellon University. A special thanks to Eva Eggeling who translated an entire paper from German for me (and only after I realized I did not need it; sorry, Eva!). The picture on the back cover of the book was taken by Monica Montagnani with the assistance of Alessandrini Alessandra (always trust your high school friends for a good laugh... at your expense). I am really grateful to Edward Dunne and Cristin Zannella for their constant help and technical support during the preparation of this book. I would also like to thank Arlene O'Sean for editing the manuscript, Lori Nero for drawing the pictures, and all the other staff at the AMS I interacted with.
xv
xvi
Acknowledgments
I would like to thank three anonymous referees for useful suggestions that led me to change and add several parts of the manuscript. Many thanks must
go to all the people who work at the interlibrary loan of Carnegie Mellon University for always finding in a timely fashion all the articles I needed. I would like to acknowledge the Center for Nonlinear Analysis (NSF Grant Nos. DMS-9803791 and DMS-0405343) for its support during the preparation of this book. This research was partially supported by the National Science Foundation under Grant No. DMS-0708039. Finally, I would like to thank Jorge Cham for giving me permission to use some of the quotes from www.phdcomics.com. They are really funny.
Part 1
Functions of One Variable
Chapter 1
Monotone Functions Undergradese, I. "Is it going to be an open book exam?" Translation: "I don't have to actually memorize anything, do I?" -Jorge Cham, www.phdcomics.coui
In this chapter we study continuity and differentiability properties of monotone functions. The central result of this chapter is the Lebesgue differentiation theorem.
1.1. Continuity In this section we study regularity properties of monotone functions.
Definition 1.1. Let E C R. A function u : E -p R is called (i) increasing if u (x) < u (y) for all x, y E E with x < y, (ii) strictly increasing if u (x) < u (y) for all x, y E E with x < y, (iii) decreasing if u (x) > u (y) for all x, y E E with x < y, (iv) strictly decreasing if u (x) > u (y) for all x, y E E with x < y, (v) monotone if any of the above holds. A monotone function is not continuous in general, so a natural question is how discontinuous it can be. The answer is given by the following theorem.
In what follows an interval I C R is a set of R such that if x, y E I and x < y, then [x, y] C I.
Theorem 1.2. Let I C R be an interval and let u : I - R be a monotone function. Then u has at most countably many discontinuity points. Conversely, given a countable set E C R, there exists a monotone function u : R - R whose set of discontinuity points is exactly E. 3
1. Monotone Functions
Proof. Step 1: Assume that I = (a, b] and, without loss of generality, that u is increasing. For every x E (a, b) there exist lim u (y) =: u+ (T),
lim u (y) _: u_ (x) .
vex
Let S (x) := u+ (x) -u- (x) > 0 be the jump of u at x. Then u is continuous at x if and only if S (x) = 0. For each n E N define
En:=
S(x) >
! }, 1
JJ1
let J C E. be any finite subset, and write
J = {xi,...) xk}, where x1 <... <xk. Since u is increasing, we have that
u (a) C u- (x1) < u+ (x1) C u- (x2) < u+ (x2) < ... < u- (xk) < u+ (Xk) < u (b) , and so, also using the definition of En, k
k
_
(u+ (xi) - u- (xi)) C u (b) - u (a),
< F, S (x) _ xEJ
i=1
cEJ
which implies that k < n (u (b) - u (a)). Hence, the cardinality of En is at most the integer part of n (u (b) - u (a)). Since {discontinuity points of u} = U 00 En. n=1
it follows that the set of discontinuity points of u is at most countable.
Step 2: If I is an arbitrary interval, construct an increasing sequence of intervals [an, b,] such that
an\infI, bn/supI. Since the union of countable sets is countable and on each interval [an, bn] the set of discontinuity points of u is at most countable, by the previous step it follows that the set of discontinuity points of u in I is at most countable.
Step 3: Conversely, let E C I be a countable set. If E is finite, then an increasing function with discontinuity set E may be constructed by hand. Consider now the more interesting case in which E is denumerable, so that E = {xn},N. For each n E N define the increasing function un : R R as un {x)
-I ifx<xn, - if x > xn.
1.1. Continuity
5
Note that un is discontinuous only at the point xn. Set 00
u(x):_Euf,(x), xER. n=1
n for all x E R, the series of functions is uniformly convergent, and so it is continuous at every point at which all the functions u, are continuous. In particular, u is continuous in R \ E. We now prove that u is discontinuous at every point of E. Indeed, for every k E N write Since Iu,, (x)I
u=uk+>un. n5&k
Then E un is continuous at xk while uk is not. Hence, u is discontinuous n#k
at each x E E. To conclude, observe that u is increasing, since it is the pointwise limit of a sequence of increasing functions.
By taking E :_ Q, we obtain the following result.
Corollary 1.3. There exists an increasing function u : K --> R that is continuous at all irrational points and discontinuous at all rational points.
Definition 1.4. Given an interval I C R, an increasing function u : I - 1[8 is called an increasing saltus or jump function if it can be written in the form
u (x) _
un (x) ,
x E I,
nEE
where E C N,
U. (x) =
0 8n
ifx < an, ifx = an.,
sn+t,, ifx>an,
for some sequences {an}nEE C I, {sn}nEE C [0, oo), {tl}nEE C [0, oo), with
>0 for allnEE. Exercise 1.5 (The jump function). Let I C P. be an interval and let u : I-t R be increasing. For each x E I define
uj(x) = F, (u+(p)-u-(V))+u(x)-u-(x), vr=I, y<s
where u_ (inf I) := u (inf I) if inf I E I and u+ (sup I) := u (sup I) if sup I E I. Prove that uJ is a jump function, that uj and u - uj are increasing, and that u - uJ is continuous. The function uj is called the jump function of u.
1. Monotone Functions
Exercise 1.6. Let I C R be an interval and let xo E I. Prove that every increasing function u : I - R can be written uniquely as the sum of an increasing jump function v : I -* R and of an increasing continuous function
w:I->Rwith w(xo)=0. We conclude this section by studying the continuity of the inverse of an increasing function.
Theorem 1.7 (Inverse of an increasing function). Let I C R be an interval bounded from below, let u : I -, R be an increasing function, let J C R be the smallest interval that contains u (I), and let v : J -+ R be the function defined by (see Figure 1)
v(y):=inf{zEI: u(z)>y}, yEJ.
(1.1) Then
(i) v is increasing and left continuous, (ii) v jumps at some point yo E J \ {sup,, u} if and only if u (x) - yo for all x in some interval (xi, x2) C I, with vi < x2,
(iii) v (u (x)) < x for every x E I, with the strict inequality holding if and only if u is constant on some interval [z, x] C I, with z < x, (iv) v (y) - xo for ally in some interval (yl, y2) C J, with yi < y2, and for some xo E I° if and only if u jumps at xo and (yl, y2) C (u- (v0) , u+ (xo)). In particular, if the function u is strictly increasing, then v is a left inverse of u and is continuous. Proof. (i) If y1, y2 E J, with yi < y2, then
{zEI: u(z) 2y2}C{zEI: u(z) - V1 I, and so
v(yi)=inf{zEI: u(z)>-yi}
-y2}=v(y2), which shows that v is increasing. To prove that v is left continuous, fix yo E J, with yo > inf J = inf r u. By the definition of v (yo) we have that u (z) < yo for all z E I with z < v (yo). Let e > 0 and fix zo E Ifl [v (yo) - e, v (yo)). Then for every y E (u (zo) , yo), we have that
v(y)=inf{zEI: u(z)>y}>zo>v(yo)-e, which shows that v is left continuous at yo.
(ii) Assume that v (yo) < v+ (yo) for some yo E J, with yo < sup J = sups u. By the definition of v (yo) and the fact that u is increasing, we have
1.1. Continuity
7
y d
c
I b+
x=v(y)
a}z
d
Figure 1. The graphs of u and its generalized inverse v.
that u (z) >_ yo for all z > v (yo). On the other hand, if v (yo) < x < v+ (yo),
then, since v is increasing, v (y) > x for all y > yo, and so u (x) < y for all y > yo, which implies that u (x) < yo. Thus, u (z) - yo for all z E (v (yo) , v+ (yo)).
Conversely, assume that u (x) - to in some interval (xl, x2) C I, with xl < x2 and yo < sup J = sup, u. Then v (yo) < xi, by the definition of v (yo). On the other hand, if y E (yo, sup J), then for every x E (xi, x2), we have that u (x) = yo < y, and so v (y) >_ x by the definition of v (y). Letting x -r x2 , we get that v (y) > x2 for ally E (yo, sup J). In particular, v+ (yo) > x2. Thus, we have shown that v (yo) < X1 < X2:5 v+ (yo) .
(iii) Taking y = u (x) in the definition of v (y), yields v (u (x)) < x. If v (u (x)) < x for some x E I, then there exists z E I, with z < x, such that u (z) >_ u (x), but since u is increasing, it follows that u - u (x) in (z, x]. Conversely, if u -const. in some interval [z, x] c I, then v (u (x)) < z < x.
1. Monotone Functions
(iv) Assume that v = xo E I° in some interval (yi i 3(2) C J, with y1 < y2.
If z E I with z > xo, then u (z) > y for all y E (yl, y2) by the definition of v (y). Letting y y2 , we get that u(z) > y2, and so u+ (xo) > 112. On the other hand, if z E I with z < xo, then u (z) < y for all y E (y1, y2) by the definition of v (y). Letting y - yi , we get that u (z) < y1, and so u_ (xo) < Y1 -
Conversely, let y E (u_ (xo) , u+ (xo)). If z < xo, then u (z) < y, and so v (y) > xo. On the other hand, since u and v are increasing and by part (iii), for every x E I with x > xo,
xo < v (y) < v (u+ (xo)) < v (u (x)) < X.
Letting x -+ xo , we get that v (y) = xo for all y E (u_ (xo) , u+ (xo)). Finally, assume that u is strictly increasing. Then by parts (i) and (ii) the function v is continuous. By part (iii), v (u (x)) = x for every x E I, which proves that v is a left inverse of u. This concludes the proof.
Remark 1.8. Note that the fact that I is bounded from below is used to guarantee that the function v does not take the value -oo.
Exercise 1.9. Let I = [a, b], let u : [a, b] - R be increasing and left continuous, and let v [u (a), u (b)] -> I8 be defined as in the previous theorem. Prove that u (x) = inf {y E [u (a), u (b)] : v (y) > x), x E [a, b) . Remark 1.10. The previous theorem continues to hold if u is decreasing, with the only changes that the function v : J -* R is now defined by v (y) := inf {z E I : u (z) < Y1,
that in part (i) one should replace increasing and left continuous with decreasing and right continuous, that in part (ii) one should take J \ (infj u) in place of J \ {sup, u}, and that in part (iv) the interval (u_ (xo) , u+ (xo)) should be replaced by (u+ (xo) , u_ (xo)).
1.2. Differentiability We now study the differentiability of monotone functions.
Definition 1.11. Let E C R and let xo E E be an accumulation point of E. Given a function u : E - R, if there exists in [-oo, oo] the limit lim
u(x-u(xo) W
xEE,x- o x - xp then the limit is called the derivative of u at xo and is denoted u' (xo) or du (xo). The function u is difemntsable at xo if ui (xo) exists in R.
1.2. Differentiability
9
From now on we will write lima o in place of liznxEE, x_,xo . The central theorem of this section is Lebesgue's theorem, which shows that a monotone function is differentiable everywhere except possibly on a set of Lebesgue measure zero. Note that this result relies strongly on monotonicity. Indeed, most (continuous) functions are nowhere differentiable. A classical example is due to Weierstrass.
Theorem 1.12 (Weierstrass). Let 0 < a < 1 and let b E N be an odd integer such that ab > 1 + 7r. Then the function
i
00
u (x) := E an cos (bn7rx)
,
x E 18,
n=o is continuous, but nowhere differentiable.
Proof. Since Ia" cos (b"irx) I C a' and the geometric series E00 0 a'L converges (0 < a < 1), we have that the series of functions converges uniformly, and so u is continuous. To prove that u is nowhere differentiable, fix x E R. Since u (x) = u (-x), we can assume, without loss of generality, that x > 0. For every h E R\ {0} and m E N we write 1a (x + h) - u (x) =
00
1 E an [cos (bn7r (x + h)) - cos (bn7ra:)] n=o
M-1
= h1
a" [cos (bnlr (x + h)) - cos (bmirx)] n--o 00
+h
a' [cos (bnir (x + h)) - cos (b'Lirx)] n=m
Since Icos xl - cosx2I < Ixl - x21, we have that m-1 (ab)
1Im1 < 7r
1L
= (ab)et - 1
(ab)t
ab-1 < gab -1'
-o
1L
where we have used the fact that ab > 1. To estimate write bmx = km + rm, where km E No andz- < rm < .
Define
hm :=
1
bra m
0+
m -r
as m - oo. We will estimate Ilm for h = h,n. For every n > m we have bn (x + hm) = bn-m (bmx + b'nh,n) = bn-m (k", + 1)
,
and so, since b = 2p + 1 is odd, it follows that cos
(bnir (x + hm)) = cos ((2p +
1)'°-m
Tr (km + 1)) _ (-1)k"'+1,
1. Monotone Functions
10
while (7rbn-m (bmx))
cos (bnirx) = cos
= cos (7rbn-'' (km +
cos (7rbn-mk,n) cos (7rr-mrm) = (-1)k- cos (?rbn-mrm)
,
where we have used the fact that sin (7rb"-'k,,,) = 0. Hence, taking h = hm in II,,, we have
_1km+l 00 IIm =
a" [1 + Cos (7rbn-mrm) J
(
,
and, in turn, 00
III,nI =
hm n=m
Since -2 < r,,,
am [1 + cos (7rrm)]
an [1 + cos (7rbn-mrm)]
0, and so III1I > -hin am. It
2, we have that cos(7rrm)
follows that
Iu(x+hm) - u(x)I
.
IIImI - IjmI >
hm
am _7r
1
h,,,
(ab)m
ab-1
Recalling that -1
=
1 - rm b'n
31 2 bm'
which implies that
u(x+hm)-u(x)I >(ab)mt! 2- ir \3 ab-1 hm 0. Letting m -> co and using
Since ab > 1 + 27r, we have that s the fact that ab > 1, we have that
m o lu(x+hm)-u(x)I-0O. h
0
This concludes the proof.
Remark 1.13. More generally one can show that the same result holds if 0 < a < 1, b > 1 (not necessarily an integer) and ab > 1 (see (82)). Exercise 1.14. Modify the proof of the Weierstrass theorem to show that for every x E R,
u (y) - u (x) lim inf u (_) - U (x) < lim sup Y--+x
y-x
y"z
y-x
so that u' (x) does not exist in (-oo, oo] for every x E R.
1.2. Differentiability
11
Remark 1.15. It is actually possible to construct a continuous function u : (-1,1) -> R such that u (x + h) - u (x) u (x + h) u (x) _ hm inf
< lim sup
h
h
h-+0
= o0
for all x E (-1,1) (see 1128]). Next we show that the Weierstrass function is actually Holder continuous
of exponent a for every a E (0, 1). More generally, we will show that u belongs to the Zyginund space Al (R).
Definition 1.16. Given an interval I C R, we say that a function u : I - R belongs to the Zygmund space Al (1) if IItIIAI(I) =_ up lu (x)I + IUTAI(I) < 00, XEI
where IuI A, (I) :=
sup
Iu (x + h) -2u(x) + u (x - h)I
hAo,zElh
Ihl
and Ih:= {xE I: x+h,x-hE I}. Remark 1.17. Note that if u : I -r R is a Lipschitz function, then I1IA1(I) < oo. Indeed, for every h # 0 and x E Ih, we have that
Iu(x+h)-2u(x)+u(x-h)I
The next exercise shows that the Weierstrass nowhere differentiable func-
tion belongs to A1(I). Thus, the space of bounded Lipschitz functions is strictly contained in Al (I).'
Exercise 1.18. Let u be the function defined in Theorem 1.12. Prove that u belongs to Al (R). Hint: If 0 < Ihl < 1, let m E No be such that 2
<- IhI < z-n and write
lu (x + h) - 2u (x) + u (x - h) I m
< E a' Icos Wrr (x + h)) - 2 cos (bnirx) + cos (b" it (x - h)) I n=0 00
+4Ea"=:Im+II,,,. n=m
It is interesting to observe that there are nowhere continuous functions u : R --+ R such that IUTA1(I) = 0. 'We will see later on that a Lipschitz function is differentiable £1-a.e. in I.
1. Monotone Functions
12
Exercise 1.19. Prove that there exists a nowhere continuous function u : ][8 - R such that IUTA,II) = 0. Hint: Use a Hamel basis2. It can be shown that the function u constructed in the previous exercise is nonmeasurable (see [161]). The next result shows that the function u in the previous exercise must also be unbounded.
Proposition 1.20. Given an interval I C R, let u E A, (I). Then D
1
Iu (y) - u (r)I < (21og 2 + 4) II44A1(I) Iy - XI 1 + Ilog Iy 1 xI for all x, y E I with x y. In particular, u is H61der continuous of order a for every a E (0, 1).
Proof. Fix x, y E I. Without loss of generality, we may assume that y > x. Seth := y - x. We first consider the case 0 < h < . Let m E N be such that < h < 21 . Define the function
2r
where Ix
v(t) := u (x + t) - u (x) , t E Ix, It > 0: x + t E I}. Then by hypothesis, for all t r= Ix and 2n-1v` 2n-1J
-2"y(2n}I
=2n-1lulx+2n-1}-2ulx+
\
IItIIA1(I)2n-1
u
2t =
2n) +u(x)I
2'(I)t.
Hence, for all t E I,,
v (t) - 2'-v 2"L
I
=
E (2-1v
2n-1
2's41 (;r))
n=1
E
n=1
IIuIIAI(I)
2
IIklIA,(I)mt. 2
2Consider It as a vector space over Q. By the axiom of choice, this vector space has a basis !8 :_ {xa}CEO C R, called an Hamel basis. More precisely, {z4, satisfies the following conditions:
(1) ifzl,...,xn E S,it EPd,and r,x, + ... + rnxn =0 for some r,, ... , rn E Q, then r, = ... = r,s = 0, (ii) if x E R, then there exist x, , ... , xn E 8 and r,, ... , rn E Q, n E N, such that
z=rizj +...+rnxn.
1.2. Differentiability
Taking t Iv (h)I =
13
2m'h, by the previous inequality we get TM
2"`v i
27nt v (t)< m'2mh+
2
2)
, (t) - 2my 21n} + 2m Iv (t) I <- IIUIIA,(I)
(2ig2hlog h +4h)
where we have used the facts that IvI < 2IIuIIA,(I) and that 2 This shows that 1
Iu(x+h)-u(x)I <- IIUIIA,(I) (2log2
+4 f h 1+log 1)
for all 0
then Iu (x + h) - u (x)I <_ 2 IIUIIA,(I) < 4 IIuIIA,(I) h <_ IIuII A, (I) (21g2 + 4) h (i-i- Ilog 11)
/
,
and the proof is complete.
O
In contrast to the Weierstrass theorem, a monotone function is differentiable everywhere except possibly on a set of Lebesgue measure zero. Note that this result implies, in particular, that the Weierstrass function is monotone on no interval.
Theorem 1.21 (Lebesgue). Let I C R be an interval and let u : I -> R be a monotone function. Then there exists a set E C R, with LL (E) = 0, such that u is everywhere differentiable on I \ E. We will present two different proofs of Lebesgue's theorem. The first one,
due to Faure 156], only requires the definition of Lebesgue outer measure and thus could be taught in an undergraduate course. The second one, more classical, relies on Vitali's covering theorem and thus is more appropriate for a graduate course. We recall that the Lebesgue outer measure of a set E C R is defined as 00
00
La (E) := inf E (bn - an) : ECU (an, bn)
.
n=1
n=1
The first proof will use the following properties of the outer measure C.
(L1) If E C F C R, then Lo (E)
'Cl
00
U En < FLo (En) n=1
n=1
1. Monotone Functions
14
(L3) If A C R can be written as a countable disjoint union of intervals (a,,, b,,) C R, then
,£o(A)=>(bn-an). n
(L4) If E C R, then Go (E) = inf {,C' (A) : A open , E C A} .
(L5) Lo ([a, b]) = b - a and Lo0 ({a}) = 0We begin with some auxiliary results. We recall the following definition.
Definition 1.22. A set E C RN is said to be (i) disconnected if there exist two open sets A and B in RN such that A n E and B fl E are nonempty, A n B= 0, and E C A U B, (ii) connected if E is not disconnected. Given a set E C RN, a connected component of E is a maximal connected
subset of E, that is, a connected subset of E that is properly contained in no other connected subset of E.
Proposition 1.23. Let u : [a, b] -' R be a continuous increasing function and let R > 0. If E C (a, b) is such that D_n (x) := lim sup u (y) -
y-xu
(x) > R
for every x E E, then RLo (E) < Lo (u (E)) The proof relies on the following result, which is a slight modification of Riesz's rising sun lemma (see [141] and (1711).
Lemma 1.24. Let v : [a, b] -* R be a continuous function and consider an open set A C (a, b). Then the set A,, :_ {x E A : there exists y E A such that y < x, (y, x) C A, and v (y) < v (x) J
is open. Moreover, if (c, d) is a connected component of A,,, then v (c) < v (d).
Proof. To prove that A is open, note that we can write it as a union of finite intersections of open sets, precisely,
A,,=UAY, YEA
1.2. Differentiability
15
vy)=d 1 vI
1
V
b
Figure 2. The graph of v is a mountainous region. The sun is rising from the right. The elevation at z is v(z). Given y E (a, b), the set A" is the interior of the set of all x that are shadowing y.
where (see Figure 2)
Ay:= {x E A n (y, oo) : (y, x) C A} n {x E A.-v(y) < v(x)l. Next, let (c, d) C A,, be a connected component of A,,. We claim that v (c) < v (x) for all x E (c, d]. To see this, fix x E (c, d), let a := min {y E [c, x] : v (y) < v (x)},
and suppose by contradiction that c < a. Hence, a E (c, x] C Az, and v (c) > v (x). Since a E A,,, there exists z E A such that z < a, the interval (z, a) is contained in A, and v (z) < v (a). There are now two cases. If z < c, then V (Z) < v (a) < v (x) < V(C),
which, together with the fact that (z, a) C A, implies that c E A. This fact contradicts the fact that (c, d) is a connected component of A. If z _ c, then V (Z) < v (a) <_ v (x) ,
which contradicts the definition of a. Therefore, a = c and v (c) < v (x) for all x E (c, d). By continuity we have that v (c) < v (d). This completes the
0
proof.
We turn to the proof of Proposition 1.23.
Proof of Proposition 1.23. Let e > 0. By (L4) there exists an open set V such that u (E) C V and (1.2)
£ (V) !5 (u (E)) + e.
1. Monotone Functions
16
Since u is continuous, the set A := u 1(V) fl (a, b) is open. Define the function v (x) := u (x) - Rx, x r= [a, b]. Then D_v (x) > 0 for every x E E, and hence E C Am, where A,, is the set defined in the previous lemma. Let {(ck, dk)} be the family of all connected components of A. By the previous lemma, v (ck) < v (dk), which implies that (1.3)
R (dk - CA,) < u (dk) - u (ck)
.
Since u is continuous, it follows by the intermediate value theorem that U (u (Gk) , u (dk)) C u
(U(ckdk)) = u (A.) .
k
k
Using (L3) twice, (1.3), and (L1) once, in this order, we obtain R1. (A,,,) = R
(dk - Ck) <
(u (dk) - u (CO) k
k
< L o (u (Au))
= Lo U (u (ck) , u (dk))
,
k
where we have used the fact that intervals (u (ck) , u (dk)) are pairwise disjoint, since u is increasing. It follows from (Li), the facts that E C A,, and A := u-1(V) fl (a, b), and (1.2), that
R1 (E):5 RC.
(A )) $ 41(u (A))
Lo (V) < Lo (u (E)) + E.
0
It suffices to let e --+ 0+.
To remove the additional hypothesis that u is continuous, the idea is to use the fact that the generalized inverse of a strictly increasing function is continuous (see Theorem 1.7).
Proposition 1.25. Let u : [a, b] - R be an increasing function and let r > 0. If E C (a, b) is such that D u (x) := lim inf V--+x-
u (y)
u (x)
y-x
for every x E E, then 'CIO (u(E)) <-rLo(E). We make use of the following auxiliary result.
Lemma 1.26. Let u, v : [a, b] -> R be two increasing functions and let E C (a, b). If w := u + v, then
C (u(E))+Lo(v(E))
1.2. Differentiability
17
Proof. Let e > 0. By (L4) there exists an open set V such that in (E) C V and
Go M:5 Go (w (E)) + C. Let {(ck, dk)} be the family of all connected components of V. Since u and v are increasing, for xi, x2, yi, I!2 E w-1 ((ck, dk)), with xi < yi, i = 1, 2, we have U
Hence, u (W-I ((ck, dk))) and v (w-1((ck, dk))) are contained in two intervals Ik and JA., such that
Go(Ik)+Go(Jk) 5 dk -Ck. Since E C Uk w-1((ck, dk)), it follows from (LI), (L2), and (L3) that Go (u (E)) + Go (v (E)) <_ > (dk - ck) < Go (w (E)) + e. k
0
It suffices to let e -' 0. We turn to the proof of Proposition 1.25.
Proof of Proposition 1.25. Step 1: Assume that u is strictly increasing. Let v be the function defined in Theorem 1.7 and let Eo be the set of discontinuity points of u. By Theorem 1.2 the set E0 is countable. Fix a point x E E \ Eo. Since D_u (x) < r, there exist 0 < s < r and a sequence
xn. - x such that
u (x) - u (xn.)
x - x,
for all n E N. Since v (u (x)) = x for every x E [a, b] by Theorem 1.7, we have that v (u (x))
v (u (xn))
U (x) -u(x
1
1'-E.
Using the facts that u is strictly increasing and that x is a continuity point u (x). Hence, D_v (u (x)) > * . Thus, we have of u, we have that u shown that D_v (y) > * for all y E u (E \ Eo). By Proposition 1.23 and (Li), we obtain
14' (u (E \ Eo)) 5 Go (v (u (E \ Eo))) =G0(E\Eo)
2) and (L5), we get Go (u (E)) < rio (E)
.
Step 2: To remove the additional hypothesis that u is strictly increasing, consider the function w (x) := u (x) + x, x E [a, b]. Then in is strictly
1. Monotone Functions
18
increasing and D_w (x) < r + 1 for every x E E. Hence, by the previous lemma and Step 1, £ (u (E)) + Lo (E) < Lo (w (E)) < (r + 1),C'0 (E) , from which we conclude that C (u (E)) < rGo (E).
Corollary 1.27. Let u : [a, b] -> R be an increasing function and let r > 0. If E C (a, b) is such that D,+u (x) := lim inf
u (y)
y-.x+
u (x) <
V-x
for every x E E, then Lo (u. (E)) < rGo (E)
.
Proof. Consider the function w (x) := -u (-x), x E [-b, -a]. Then w is increasing and for all x E -E, D_w (x) = lim inf
-u (-Y) + u (-x)
= lim inf
-u (z) -}- u (-x)
y-x
y-4x-
-z - x
<
and so we may apply the previous proposition to conclude that
£ (u (E)) = £., (-u (E)) = Gp (w (-E)) < rGo (-E) = r1 (E) . Exercise 1.28. Let u : [a, b] -p R be an increasing function. Prove that the set of right endpoints of intervals of constancy of u is at most countable.
Proposition 1.29. Let u :
[a, b]
--+ R be an increasing function and let
R > 0. If E C (a, b) is such that D+u (x) := lim sup u (y) - u (x) > R
/X
for every x E E, then RGo (E) < f-o (u (E))
.
Proof. Let El be the set of all right discontinuities of u and E2 the set of right endpoints of intervals of constancy of u. By Theorem 1.2 and the previous exercise, the set E3 := El U E2 is countable. Fix a point x E E \ E3. Since D+u (x) > r, there exist e > 0 and a sequence x7, - x+ such that u
u (x)
xm-x
>R+.
1.2. Differentiability
19
Let v be the function defined in Theorem 1.7. Since by Theorem 1.7, v (u (y)) = y for every y E E \ E3 and v (u (y)) < y for all y r= [a, b], we have that
v (u (xn)) - v (u (x))
1
u(xn)-u(x)
R+E*
Using the facts that u is increasing and that x is a continuity point of u, we have that u u (x). Hence, D+v (u (x)) < 1F. Thus, we have shown that D + v (y) < R for all y E u (E \ E3). By Corollary 1.27 we obtain
Lo(E\E3) = L' (v(u(E\ E3))) c RL' (u(E\E3)) =
L0 (u (E))
Since Lo (E3) = 0, we get
L;(E) < WL;(u(E)), which concludes the proof.
We are now ready to prove Lebesgue's theorem.
First proof of Lebesgue's theorem. Step 1: Assume that I = [a, b] and, without loss of generality, that u is increasing. For every r, R E Q, with 0 < r < R, define the set
Er,R:=Ix E(a,b): D u(x)
which implies that C; (u (Er,R)) = Lo (Er,R) = 0. Since
U
E,,R = {x E (a, b) : D_ u (x) < D+u (x)
E+,
r,REQ, O
it follows that Lo (u (E+)) = Lo (E+) = 0. To obtain a similar result for the set
E_ ;= {x E (a, b) : D+u (x) < D_u (x)}
we apply the first part of the proof to the function w (x) := -u (-x), x E (-b) -a], to obtain that Lo (u (E_)) = Lo (E_) = 0. For x E (a, b) 1 (E+ U E_) we have
D_u (x) > D+u (x) > D+u (x) > D_u (x) > D_u (x), which shows that there exists u' (x), possibly infinite. Let
{xE (a,b); u`(x)= oo}.
1. Monotone Functions
20
Since for x E Eco, u' (x) > n for every n E N, it follows by Proposition 1.29
that 0 < I (E.) < nGo (u (E.)) <
(u (b) - u (a)) -> 0
as n - oo. Hence, Cl, (Boo) = 0, and so u' (x)n is finite for L,'-a.e. x E [a, b].
Step 2: If I is an arbitrary interval, construct an increasing sequence of intervals [an, such that
b,/'supl. Since the union of sets of Lebesgue outer measure zero still has Lebesgue outer measure zero and since on each interval [an, bn] the set of points in which u is not differentiable has Lebesgue outer measure zero by the previous step, it follows that the set of points of I in which u is not differentiable has Lebesgue outer measure zero.
Remark 1.30. The extended real numbers 2-u (x), 17-u (x), D+u (x), and D+u (x) are called Dini's derivatives of u at x. The second proof of Lebesgue's theorem snakes use of the following covering theorem.
Theorem 1.31 (Vitals). Let E C R be a nonempty set of finite Lebesgue outer measure and let ,? be a family of closed nondegenerate intervals such that for every x E E and b > 0 there exists J E 3, with diam J < 5, such that x E J. Then for every e > 0 there exists a countable family of pairwise disjoint closed intervals {J,,} C .7 such that (1.4)
1;;
(E\UJi) =0, C1 UJ-
n
Proof. By (L4) for every e > 0 there exists an open set U such that E C U and ,C' (U) < Go (E) +:±.
Without loss of generality we may consider only the intervals of ,7 that are contained in U. This will automatically guarantee (1.4)2.3 In turn, (1.5)
Q1 := sup diam J < ,C1(U) < oo.
JEJ We construct the family {Jn} C J by induction. By (1.5) we may choose J1 E 3 such that diem J1 > el . 2 3A subscript on an equation number refers to that expression in the display. For example, (1.4)2 refers to the second expression in (1.4).
1.2. Differentiability
21
Set 31 :_ {J E 3 : J n Jl = 0}. If 3i is empty, then we stop and set M = 1. Otherwise, define e2 := sup diam J < e1 < oo and choose J2 E 31 such that diem J2 >
12-
Set J2 := JJ E J : JnJ1=0fori=1,2}={JE31 JnJ2=O}. If32 is empty, then we stop and set M := 2. We continue in this fashion, and if the selection process does not stop, we put M := oo. Note that by construction the intervals J,,, are pairwise disjoint. It remains to prove (1.4)1. There are two cases. If M < oo, then we claim that M
E \ U J = 0. Indeed, assume by contradiction that this is not the case n=1 M
M
n=1
n=1
and let x e E \ U J. Since the set U J,, is closed, M
1
8:= dist (a;, U Jn > 0, n=1
/
and so we may find J E 3 such that x E J and diam J < S. This implies M
that J does not intersect U Jn, and so J E 3M = 0, which is impossible. n=1
If M = oo, then by construction for all n E N we have (1.6)
3n={JE3: JnJi=Ofori=1,...,n},
(1.7)
e,, := sup diam J, JEJ. _1
J. E 3,,-diam J,, > 2 en.
Note that since the Jn are pairwise disjoint and contained in U, we have that 00
00
E en <_ E diam in <_ G1(U) < oo.
(1.8)
n=1
n=1
In particular, In -' 0 and diam Jn --+ 0 as n - oo. 00
m
n=1
n=1
Fix x E E \ U Jn and a positive integer m E N. Since the set U J,z is closed,
M J"'
n=1
) > 0,
/
and so we may find J E 3 such that x r: J and diam J < S. This implies that m
00
n=1
n=1
J does not intersect U Jn, and so J E 3m. We claim that J n U Jn # 0.
1. Monotone Functions
22
00
Assume by contradiction that J fl U J,, = 0. Then J E .7n for all n. E N, n=1
but then by (1.7),
0 0 as n ->oo, which is again impossible and proves the claim.
Define no := min In: J n Jn 4 0}. Then no > m and J E
so
that, again by (1.7), diam J < Q,a < 2 diam
J fl J,,Q # 0, it follows that 00
JCJnaC U Jn, 7?=m.+1
where Jn is the closed interval with the same center of Jn and five times its length and we have used the fact that no > m. In view of the arbitrariness 00
of the point x in the set E 1 U Jn, we have proved that n=1 00
00
E\UJnC U
Jn,
n=m+l
n=1
and so 00
'Cl
00
E\ U Jn < 5 E diam J. -> 0 n=1
n=m+1
as m-4ooby (1.8). Remark 1.32. Note that (1.9) also shows that from every cover J as in the statement we may extract a countable family {Jn}M 1 of pairwise disjoint closed intervals such that M
E C UJn, n=1
where in is the closed interval with the same center of J. and five times its length.
Remark 1.33. The same proof continues to work if we replace Cl with an outer measure µ* with the property that 1z* (5E) < cµ* (E) for all E C R and for some constant c > 1. This is called a doubling property. For more general covering theorems we refer to 1651.
We are now ready to give the second proof of Lebesgue's theorem.
1.2. Differentiability
23
Second proof of Lebesgue's theorem. Step 1: Assume that I = [a, b] and, without loss of generality, that u is increasing. For each S > 0 let J76 :_ {J is a closed interval, J C [a, b] , 0 < diam J < d}
,
and for x E [a, b] define
u (max J) - u (min J) diam J b>a JEJ6:xEJ u (max J) - u (lain J) D-u (x) := sup inf a>0 JEJ6. rEJ diem J Note that if 0 < b1 < b2, then J6, C j j,, and so u (max J) - u (min J) u (max J) - u (min J) sup diam J diam J < JEJ : EJ JEJ6 P EJ
D+u(x)
inf
sup
Hence,
u (max J) - u (min J) diam J 6--'0+ JEJJ: xEJ
D4-u(x) = lim
sup
D-u (x) = limn
inf
(1.10)
and, similarly, (1.11)
u (max J) - u (min J)
diamJ
6-,0+ JE9a:xEJ
In particular, 0 < D-u (x) < D+u (x) < oo for all x E (a, b). Observe that if D-u (x) = D+u (x) < oo, then u' (x) exists and is finite. Hence, to prove the result, it is enough to shows that the set
F :_ {x E (a, b) : either D-u (x) # D+u (x) or D+u (x) = oo} has Lebesgue outer measure zero. Let
P. := {xE(a,b): D+u(x)=oo}, and for every 0 < r < R, with r, R E Q, define
Fr,R := {x E (a, b) : D-u (x) < r < R < D+u (x)} Since
FCFQQU
U
Fr,R,
0
it suffices to prove that C'
Go (FF,R) = 0 for all 0 < r < R, with r,
REQ. Step 2: We show that Go (F,,.) = 0. Fix m E N and consider the family of intervals
{J is a closed interval, J C [a, b] ,
u(maxJ) - u(min J) > mdiam (J) > 0}.
1. Monotone Functions
24
If x E FOO, then D+u (x) = oo, and so by (1.10) for every S > 0 there exists J E .F., with diam J < S, such that x E J. Hence, by Vitali's theorem there exists a countable family of pairwise disjoint closed intervals {J, } C such
that Ga
(F\UJ).
=0.
It follows that
Lo(Foo)
(F\yJ)n.
+Lo (&nu)J,L <1r1 (u)J n
n
_
n
diam Jn < m > (u (max J,,) - u (min J,,)) < u (b)
u (a)
m
where in the last inequality we have used in an essential way the facts that the intervals J,, are pairwise disjoint and that u is increasing. Letting m -oo, we conclude that Go (F.) = 0.
Step 3: We show that L , (FT,R) = 0 for all 0 < r < R, with r, R E Q. Consider the family of intervals
Q :_ {J is a closed interval, J C [a, b], u (max J) -u (min J) < r diam J} . If x E Fr,R, then D-u (x) < r, and so by (1.11) for every S > 0 sufficiently small there exists J E 19, with diam J < b, such that x E J. By Vitali's theorem once more, for every s > 0 there exists a countable family of pairwise disjoint closed intervals {Jn} C 9 such that (1.12)
'Cl
(FrR\UJn) = 0, G1 U J. n
< Ga (F,T,R) + E.
n
Define the open set
U:=UJJ n
and note that (1.13)
G1 U Jn = L 1(U) . n
Consider the family of intervals
.F := {J closed interval, J C U, u (max J) - u (min J) > R diam J > 0}.
If x E Fr,R fl u, then D+u (x) > R, and so by (1.10) for every d > 0 there
exists J E .F, with diam J < S, such that x E J. By Vitali's theorem,
1.2. Differentiability
25
for every e > 0 there exists a countable family of pairwise disjoint closed intervals {Ik} C.F such that (1.14)
0=£ (F,.,Rf1U)\Ulk =Go Fr,R\UIk k
k
where we have used (1.12) and (1.13). Then by (1.12), (1.13), and (1.14),
£ o (Fr,R) < ,C1 U Ik
U j. <£o (F,.,R) + e. n
k
On the other hand, since every interval Ik must be contained in some interval J,, (note that more than one Ik can be contained in the same J,a), using again (1.14), together with the definition of the families .F and !g, we obtain
Rio (F*,R) <- RG1 U
= R 1: diam I,, < >2 (u (max lk) - u (min lk) ) k
k
k
(u (max J!,) - u (min Jn))
diamJ,s
so that JCo1
(FT,R) <_
RTfi-
r.
Given the arbitrariness of e > 0, we conclude that,C1(F,.,R) = 0.
Step 4: If I is an arbitrary interval, we proceed as in the last step of the first proof of Lebesgue's theorem.
0
Remark 1.34. A similar proof can be used to prove the Vitali-Besicovitch theorem (see Theorem B.118 in Appendix B).
The next theorem shows that Lebesgue's theorem is sharp, precisely, that there exist monotone functions that are not differentiable on sets of Lebesgue measure zero.
Theorem 1.35. For every set E C R of Lebesgue (outer) measure zero theme exists a continuous increasing function that is not differentiable at every point of E.
Proof. Since Z1 (E) = 0, for every k E N we may cover E with a countable family of open intervals { (a, b;,")) } such that 00
(1.15)
f
1. Monotone Functions
26
Let I
(al,"}, b(P) : n, k E N} _ {In}. Note that by (1.15), 00
E diam 4, < 1.
(1.16)
n=1
Moreover, for every x E E we may find infinitely many In such that x E I,,.
For each n E N write In = (an, bn) and define the continuous increasing function un : R - [0, oo) as follows:
un(x)
0
if x < an,
x - a,
if an <x
bn - an if x > bn. Note that 0 < un (x) < diam In for all x E R. Set
u(x) := Eun(x), x E R.
(1.17)
n-1
Then for all x ER and tEN by (1.16), 00
1
0 < u (x) - E un (x) < E diam In < 1, n=1
n=1+1
and so the series of functions is uniformly convergent. In particular, this implies that u is continuous. Since each un is nonnegative and increasing, it follows that u has the same properties. It remains to show that u is not differentiable in E. Thus, fix xo E E and 1 E N. By the way we constructed the family I, we may find I positive integers ni < n2 < < n1 such that xo E Ins for all i = 1, ... ,1. Let x E In, fl n In,, x # xo. Since each un is increasing, the difference quotient is nonnegative, and so
u (x) - u (xo) > r1-. uns (x) - Un, (x0) X - xo x - xo :=1 It follows that lim sup zyzo
z=i
x - anf - (xo - an,) = 1. x - xo
u (x) - u (xo) > x - XO
for every 1 E N. Hence, lim sup zPzo
u (x) - u (xo) = oa,
x - xo
which implies that u is not differentiable at xo.
0
Remark 1.36. Note that the set of points at which the increasing function u (defined in (1.17)) is not differentiable contains the set E, but in general it may be larger. To the author's knowledge an exact characterization of
1.2. Differentiability
27
the class of sets that are sets of nondifferentiability for increasing functions is still an open problem (see Exercise 1.41 below for some properties of this set). We refer to [27] and [171] for more information on this subject.
As a simple consequence of Lebesgue's theorem we obtain that the derivative of a monotone function is always locally Lebesgue integrable_
Corollary 1.37. Let I C R be an interval and let u : I - lR be a monotone function. Then u' is a Lebesgue measurable function and for every [a, b] C I, b
(1.18)
Ja
lu' (x) I dx < ]u (b) - u (a)] .
Moreover, if u is bounded, then u' is Lebesgue integrable and l u' (x) l dx <
(1.19)
Ix
lim u (x)
lim I u (x) < sup u - inf U. I
Z
Proof. Assume that u is increasing, fix [a, b] C I, and let
u(x) if x< b,
v (x)
(1.20)
Let E
u (b)
if x > b.
{x E [a, b] : v is not differentiable at x}. By Lebesgue's theorem,
41 (E) = 0. Moreover,
v' (x) = u' (x)
(1.21)
for all x E (a, b) \ E.
Since v is increasing, we have that v' (x) > 0 for all x E [a, b] \ E and v(x)_ ]in-,m
v(x+n)-v(x) 1
00
n
By Theorem 1.2 the nonnegative functions
y(x+n)1 -v(x)' Wn(x)
xE[a,b],
W
are continuous except for a countable set, and so they are Borel measurable functions. Hence, V: [a, b] \ E -> [0, oo) is a Lebesgue measurable function. Since v is increasing, by (1.20) for every h > 0 we have fb
[v (x + h) - v (x)] dx =
(1.22) h
< h
fJ
b+h v
(x) dx -
ja+h v (x) dx }
h{(u(b)-u(a))h}=u(b)-u(a).
1. Monotone Functions
28
Taking h:= 1, it follows from Fatou's Lemma, (1.21), and (1.22) that
0<
f
u' (x) dx =
a Zb r
b v'
(x) dx
` (x+ n -v(x}J dxCu(b)-u(a). (a). 1
[v
4-+00
Ja
J
This concludes the proof of the first part. Assume next that u is bounded and construct an increasing sequence of intervals such that a, \ inf I, b,, / sup I. By the previous part, bn
u' (x) d.< is (bn) - u (an) < sup u - infu,
0:5 Jan
I
I
and so, letting n - oo and using the Lebesgue monotone convergence theorem, we obtain (1.19).
Remark 1.38. (i) Note that if one of the endpoints of I belongs to I, say a:= inf I E I, and u is, say, increasing, then
lim u (x) = u+ (a),
X +a+
while infl u = u (a). Thus, if u+ (a) > u (a), then the last inequality in (1.19) is strict.
(ii) In Exercise 1.41 below we will show that u' is actually a Borel function.
Exercise 1.39. Let I C R be an interval and let u : I -1I be a monotone function. Prove that if equality holds in (1.18) (respectively, in (1.19)), then u is continuous in [a, b], (respectively, in I). Using the previous corollary, we obtain the following result. We will see its usefulness for functions of bounded pointwise variation in Corollary 2.43.
Corollary 1.40. Let I C R be an interval, let u : I -> R be a monotone function, and let h > 0. Then for every [a, b] C I, with b - a > h, b- h
(1.23)
1Iu(x+h) -u(x)[ dx <- Iu(b) -u(a). L
Moreover, if u is bounded, then (1.24)
if lu(x+h) -u(x)l dx <supu-infu, h
h
wherelh:= {xEI: x+hEl}.
I
I
1.2. Differentiability
29
Proof. Assume that u is increasing, fix (a, b) C I, with b - a > h, and let v be defined as in (1.20). Then by (1.22),
hj
b-h [u
p
(x + h) - u (x)] dx < J b [v (x + h) - v (x)] dx a
Assume next that u is bounded and construct an increasing sequence of intervals [an, b,b] such that an \, inf I, b,, / sup I. Then 1
0<
[u (x+h)-u(x)) dx
f JJ
and so, letting n -> oo and using the Lebesgue monotone convergence theorem, we obtain (1.24). In Corollary 1.37 we have shown that the derivative of a monotone function is Lebesgue measurable. The next exercise shows that the derivative of an arbitrary function is actually Borel measurable. We recall that a set E C R is called an FQ set if it is a countable union of closed sets, a G8 set if it is a countable intersection of open sets.
Exercise 1.41. Let I C R be an open interval, let u : I - R be an arbitrary function, and let
E:={xEI: it is continuous at x}, F {x E I : it is differentiable at x} . Prove that (1) for each n E N the set
Un:={xEI: there isb>0suchthat (x--6,x+6) CI and if y, z E (x - b, x + b) , then Iu (y) - u (z)) <
}
is open,
(ii) the set E is a Ga set, (iii) for each e > 0, d > 0 the set
U"a:={xEE: there isyEIsuch that 0 8 }
y-x
JJJ
is a relatively open subset of E, that is, the intersection of E with an open set,
1. Monotone Functions
30
(iv) {x E E : Du (x) > 0} =
n
U
U.,,6,
where
e>O, eEQ S>0, SEQ
Du (x)
lim sup
u (y) - u (x)
y-x
Y--+X
(v) {x. E E : Du (x) > a}, {x E E : Du (x) < a) are Borel sets for every a E R, where Du (x) := lim inf u (y)
y-s
- u (x)
y-x
(vi) the set F is a Borel set, (vii) the function v : I -> ]R, defined by uf x) ifxEF, v (x) :=
otherwise,
0
is Borel measurable.
Exercise 1.42 (Expansion in base b). Let b E N be such that b > 2 and let
(i) Prove that there exists a sequence {an} of nonnegative integers such that 0 < a < b for all n E N and 00
an bL
n=1
Prove that the sequence {an} is uniquely determined by x, unless x is of the form x = vA for some k, m E N, in which case there are exactly two such sequences. (ii) Conversely, given a sequence {an} of nonnegative integers such that 0 < an < b for all n E N, prove that the series EO0_1 converges to a number x E [0,1]. The next example shows that the inequality in (1.18) may be strict, and so for continuous monotone functions the fundamental theorem of calculus for Lebesgue integration fails.
Example 1.43 (The Cantor function). Divide [0,1) into three equal subintervals, and remove the middle interval Ii,l (N, Divide each of the two remaining closed intervals [0, 1] and [2,1] into three equal subintervals, and remove the middle intervals 11,2 := (3 , 3 ) and 12,2 (a , a ). Continuing in this fashion, at each step n remove 2n-1 middle intervals Il,n, .. , 12n-',,, each of length a . The Cantor set D is defined as 9).
00 2`1
D := 10,1] \ U U Ik,n. n=1 k=1
1.2. Differentiability
31
M III II,
3
I
4
r ---i
II
1
PlII
I
I
II
1
I
II
-9
9
3
9
2:
1
Figure 3. The Cantor function.
The set D is closed (since its complement is given by a family of open intervals), and 00 2"-1
00 2*-1
G1(1D)=1-LE diem(Ik,n)=1- 1: 1: n=1 k=1
n=1 k=1
1
00 28-1 gn=1-E 3n n=1
=0.
Thus, ® has Lebesgue measure zero. To prove that IID is uncountable, observe
that x E D if and only if 00
x=L,3
(1.25)
n=1
where each c,, E {0, 2} (see the previous exercise). For every x E D of the form (1.25) define 00
oft 8=1
where 1
a'`
ifc,,=2,
0
The function u : IlD -p [0, 1] is well-defined (why?), increasing, continuous, and has the same values at the endpoints of each removed interval Ik,n and thus u extends to a continuous function on 10, 11. This function is called the Cantor function (see Figure 3). Since u (D) = [0, 11, it follows that D is uncountable. Note also that ul (x) = 0 for all x E Ikon, k, n E N, so that u' = 0 except on a set of Lebesgue measure zero. Since to (0) = 0 and u (1) = 1, it follows that the inequality in (1.18) is strict, and so the fundamental theorem of calculus for Lebesgue integration fails.
1. Monotone Functions
32
Exercise 1.44. Consider the Banach space X :_ {u : [0,1] - R : u is Continuous, u (0) = 0, and a (1) = 1) , where we take the supremum norm
IIuII, := max Iu(x)I Consider the operator T : X -i X, defined by T (u) (x)
-ju(3x)
if OCx<,
2
if
+2u(3x-2) if
< x < 3, 3
1.
(1) Prove that T is a contraction, precisely, that IIT (ui) - T (u2)II,<, <_
2 Ilui - u21I.
for all u1, u2 E X. (ii) Prove that the Cantor function is the unique fixed point of T. (iii) Define recursively the sequence of functions up (x) := x, u,,+1 (x) T (x), x E [0,1]. Prove that for all n E N,
It (x1) - t (x2)I s Ixl - x21' for all xl, x2 E [0,1], where a := 1$. Deduce that the Cantor function u is Holder's continuous with exponent a. (iv) Prove that the exponent a and the constant one are the best possible for the Cantor function u, in the sense that the inequality
Iu(21) -u(x2)I C1x1 -x21'8 does not hold for all xl, x2 E [0,1] if either A > a or /3 = a but
C<1. Using the Cantor set, we can construct Lebesgue measurable sets that are not Borel sets. Exercise 1.45 (A non-Borel, Lebesgue measurable set). Consider the function v : [0,1] -> R defined by
v(x) := x+u(x), x E [0,1]. (i) Prove that L1 (v (ID)) = 1. (ii) Let E C v (IID) be a set that is not Lebesgue measurable (see Exercise C.2 in Appendix C) and consider the set F := v-1 (E) C D. Prove that F is Lebesgue measurable but not a Borel set.
1.2. Differentiability
33
We have seen that the Cantor function is increasing with u' = 0 G1a.e. in [0, 1]. It is actually possible to construct strictly increasing functions whose derivative is zero except on a set of Lebesgue measure zero. To prove this result, we will need the following exercise.
Exercise 1.46. Let u : [a, b] --+ R be differentiable at xo G (a, b) and let xn,'yn E (a, b), {xo} be such that xn # y n and xn, pn - xo. (i) Prove that if xn < xo < yn for all n E N, then line n'oo
U (yn) - u (xn) = ,ul (x0) Yn - xn \
(ii) Prove that if the condition x, < xo < yn is violated, then the limit lim,j--+0G u(y.)-u(x") may not exist or may be different from u' (xo). y..-x..
Theorem 1.47. There exists a strictly increasing continuous function u : [0, 1] -p R whose derivative is zero except on a set of Lebesgue measure zero.
Proof. For each x E (0, 1] find positive integers (1.26)
as
such that
x=E2 00
(1.27)
1
In view of Exercise 1.42 and (1.26), the representation (1.27) is unique. Moreover for every n, m E No with n > m, (1.28)
an ? n + 1,
an > an + n - m.
Fix r > 0, r # 1. For x = 0 define u (0) := 0, while for each x E (0,1] define 00
n
E O (1 + r)a
u (x)
Note that if x = 1, then an = n + 1, and so
u(1)= 1+r
(TrTr)n = 1 n_0
First, we prove that u is strictly increasing. If x > 0, then u (x) > 0 = u (0). If 0 < x < y < 1, where x is given by (1.27) and 00
y=E n=0
1. Monotone Functions
34
where bo < b1 < < b,< < -, then let m E No be the smallest integer such that an bn. Since x < y, we must have bm < am (why?), and so by (1.26) and (1.28), 00
rn
n=m (1 + r)R"
-
rm+k
CO
Co
rm
= '(1 k=0 ( 1 + r )a"'+k rm rm
.k\ r
k
rm ( 1 + r )am-1
1+
++ r)am 00
'1 + r)b- < (1 + r)b"'
r
+E
rn
(1 +
1
Hence, u (x) < u (y). Next, we prove that u is continuous. If x E (0, 1] is given by (1.27), for
every m E No let km be the number of subscripts n = 0, ... , m for which an < m. Define km
(1.29)
km-1
1
n-o k ,n
1
zm
x>n +
00
2Rn
2Rn
n-o
(1.30)
1
27n
1
+
2akm+j '
j=1
-
1
=
tan +
n-
1
00
1
j=1
2m+j'
By (1.28) and the fact that ak,,, +1 > m + 1, we get that akm +j > m + j for all j N, and so 00
xm < = MM + 2a En- xm +k = xm + urn 00
1
n=k,n+1
zm.
k=m+1
, we have that (why?)
Since xm and zm differ only by
rn
00
(1.31)
1
1
u(z,,)-u(x»i)=
rkn+l 1+r)n+m-km
n=k,,,+1
(1+r}'n.
Using the fact that km < m + 1, it follows that u (z,n) - u (xm) -, 0 as m -* oo, and since u is increasing and xm < x < z,n, this shows that u is continuous at x.
To prove continuity at x = 0, it is enough to observe that as x 0+, where x is given by (1.27), the corresponding coefficient ao = ao (x) approaches infinity, and so U (x)
1
_ (1+r)
00
n --0 00
<
Tn
(1 + r)an-ao
1
rn
(1 + r)a0
(1 + r)n
_
r 0 (1 + r)ao
as x -+ 0+, where we have used the fact that a, - ft > n by (1.28).
1.2. Differentiability
35
Finally, we shall prove that if u is differentiable at some x E (0, 1], then necessarily u' (x) = 0. Indeed, assume by contradiction that u' (x) = e # 0. Then by (1.29) and (1.31),
fl (z,,,) - u (x,) _
zf1-xm
m
2
\l+r
rk,»+1
On the other hand, by the previous exercise, u (zm) - t (Xm) - Q zm. - xm
as m -i oo, and so
(0. This implies that r k_+ m
_1 -11
1
+r 2
Since r # 1 and k,,, is a nonnegative integer, we have that km - km-1 s r= No, so for all m > mo we have that km = k,,,-, + a. Note that a = 0 or s = 1 leads to 1 = 1-' are both impossible. If s > 2. 2 and r =, which 2 we have that km
m mo + (m - mo) as m -> oo, but since km C m + 1, we again have a contradiction.
Exercise 1.48. Let C c R be a closed set and let u (x) := dist (x, C) = inf {fix - tI : y E C},
x E R.
Prove that (i) u is 1-Lipschitz, that is,
Iu (x) - u (01 5 Ix
- uI
for all x)yER, (ii) there exists an increasing function v : R -> R such that v' is continuous and
C={xER:v'(x)=0}, (iii) if C contains no intervals, then every such v is strictly increasing. Another important consequence of the Lebesgue differentiation theorem is the following result.
Theorem 1.49 (Fubini). Let I C R be an interval and let be a sequence of increasing functions, u : I - it Assume that the series of
1. Monotone Functions
36
functions E u, converges pointwise in I. Then E u, converges uniformly n=1
n=1
on compact sets of I, the sum of the series
u(x) := E u,, (x) , x E I, n=1
is differentiable C 1-a. e. in I, and 00
u' (x) _
for G1-a. e. x E I.
un (x) n=1
Proof. Since the result is local, without loss of generality, we may assume that I = [a, b]. Step 1: Assume that un (a) = 0 for all n E N so that uTZ > 0. For every
IENset 81 :_
Ztn.
n=1
Then for x E [a, b], 00
00
0 <- u (x) - 81 (x) _ E un (x) <- E un (b) n=1+1
and so
,
n=1+1 00
0 < sup ] u (x) - s1 (x) (< E un (b) -} 0 [a,b]
n=1+1
as I - oo. Hence, the series is uniformly convergent. Since u and s1 are increasing, by Lebesgue's theorem they are differentiable 41-a.e. in [a, b], and since the countable union of sets of Lebesgue zero measure still has Lebesgue measure zero, we may find a Lebesgue measurable set E C [a, b], with C1 (E) = 0, such that u and all the functions al are everywhere differentiable in [a, b] \ E. Since the functions s1+1 - sl and u - sl are increasing for all l E N, we have that (81+1 s,)' > 0 and (u st)' > 0 in [a, b] \ E. Hence,
-
-
0<si(x):54(x)
(x)
for all x E [a, b] \ E, and so there exists
lim s;, (x) < u (x) < 00.
n-400
In turn, (1.32)
lim U. (x) = lim [s; (x) - s1",_1(x)] = 0
n->oo
for all x E [a, b] \ E.
n-+oo
1.2. Differentiability
37
It remains to show that thu an (x) = u' (x) for G1-a.e. x E [a, b]. Since the limit exists for all x E [a, b] \ E by (1.32), it is enough to show this for a subsequence {8,`nk} of {8n}. So let nk / oo be such that 0 < u (b) - 8nk (b) < and define vk (x)
ti (x) - an, (x) <
.
2k
Then uk is increasing and
00
0
k=1
Hence, we can apply the first part of the proof to the sequence {vk} to conclude that lim vk (x) = 0 for
a.e. x E [a, b] by (1.32). This completes the proof.
Step 2: Write un = un - u,a (a) + un (a) =: wn + un (a) and apply Step 1 to wn.
Exercise 1.50. Let I C R be an interval, let u : I -+ R be an increasing function, and let uJ be the jump function of u. Prove that uJ (x) = 0 for G1-a.e. x E I.
Exercise 1.51. Let u : [0,11 -+ R be the Cantor function. Extend u to be 1 for x > 1 and 0 for x < 0. Consider a countable dense set {an} in III and define
00
V (x)
2 a (2n (x - an)) ,
x r= R.
Prove that v : R - R is continuous, strictly increasing, and v' (x) = 0 for G1-a.e. x E R.
Chapter 2
Functions of Bounded Pointwise Variation Undergradese, II: "Is grading going to be curved?" Translation. "Can I do a mediocre job and still get an A ?" -Jorge Cham, www.phdcomics.com
Let I C ][8 be an interval. The set of monotone functions u : I -> R is not a vector space, since in general the difference of monotone functions is not monotone. In this chapter we characterize the smallest vector space of functions u : I - R that contains all monotone functions.
2.1. Pointwise Variation In what follows, given an interval I C R, a partition of I is a finite set P := {xo,... , xn} C I, where xQ <xl < . . . <xn..
Definition 2.1. Let I C R be an interval and let u : I - R be a function. The pointwise variation of u on the interval I is n
(2.1)
Var u := sup
lu (xi) i=1
-
(x:-1} I
,
where the supremum is taken over all partitions P :_ {xo, ... , x,2} of I, n E N. A function u : I -> R has finite or bounded pointwise variation if Varu < 00. The space of all functions u : I -> R of bounded pointwise variation is denoted by BPV (I).' 'This is not the standard notation for this space, which is usually denoted BV (I) in books on real analysis and measure theory. Although we do not like changing standard notation, unfortunately in the literature the notation BV (I) is also used for a quite different (although strictly 39
2. Functions of Bounded Pointwise Variation
40
Remark 2.2. Note that if one of the endpoints, say b := sup 1, belongs to I, then in the definition of Varu it suffices to restrict our attention to < xn = b. Indeed, if partitions P :_ {xo,... , x,,J such that xo < xl < P :_ {x07.. . , x,,} is a partition with x, < b, then P' :_ {xo, ... , x, , b} is also a partition of I and n
n
Iu(xi) - u (xi-1)I : i=1
1 Iu(x=) - u(xi-1)I + Iu(b) - u(xn)I < Varu.
In the sequel we will often use this property without further mention. To highlight the dependence on the interval I, we will sometimes write Varr u. If the interval I is degenerate, that is, if inf I = sup I, we set Varr u := 0.
A function u : I - R has locally finite or locally bounded pointwise variation if Var1a,b) u < oo for all intervals [a, b] C I. The space of all functions u : I -* R of locally bounded pointwise variation is denoted by BPVOC (I).
It almost goes without saying that if I = [a, b], then BPVOC ([a, b]) = BPV ([a, b])
.
If SZ C R is an open set, then we can write SZ as a countable union of pairwise disjoint open intervals 1 = U In. n
Given a function u : Il - R, we define the pointwise variation of u on SZ as
Varr u,
Var u := n
and we say that u has bounded pointwise variation in Cl if Varu < oo. The space of functions u : fl -), R of bounded pointwise variation is denoted by BPV (Il).
Note that if u : I -> Rd, then we can define its variation exactly as in Definition 2.1, with the only difference that the absolute value is now replaced by the norm in Rd, which we still denote I . I. The space of all functions u : I -> Rd of bounded pointwise variation (respectively, locally bounded pointwise variation) is denoted by BPV (I; Rd) (respectively, BPVIOC (I; Rd)).
The following facts are left as an exercise. related) function space. This book studies both spaces, so we really had to change the notation for one of them.
2.1. Pointwise Variation
41
Exercise 2.3. (i) If u : (a, b] -* R is (everywhere) differentiable with bounded derivative, then u E BPV ([a, b]).
(ii) If u : (a, bJ -* R is (everywhere) differentiable and u' is Riemann integrable, then u e BPV ([a, b]) and rb Var u = lu' (x) I dx.
Ja
Compare this with the Katznelson-Stromberg theorem below.
Exercise 2.4. Let u : (0,1] -, R be defined by it
(X)
xasiny if0<x<1, - {0 ifx=0,
where a, b E R. Study for which a, b the function u has bounded pointwise variation. Prove that there exist values of a, b for which u has bounded pointwise variation but for which u' is unbounded.
Exercise 2.5. Let u,v E BPV ([a,bj). Prove the following. (i) u f v E BPV ((a, b]). (ii) uv G BPV ([a, bJ).
(iii) If v (x) > c > 0 for all x E [a, b] and for some c > 0, then
E
BPV ([a, b)).
(iv) What happens if we replace [a, b] with an arbitrary interval I C R (possibly unbounded)? We turn to some general properties of functions of bounded pointwise variation.
Proposition 2.6. Let I C R be an interval and let u : I --+ R be a function. (i) For every c r= I,
suplu(x)1 <_ Iu(c)I +Varu. xEI
In particular, if u E BPV (I), then u is bounded. (ii) If c E I, then Varin(-oo,cj u + Var fn(a,00) u = Var u.
(iii) If I does not contain its right endpoint, then Varfn(_,,,x( u = Var u, lim x-,(enp I)-
while if I does not contain its left endpoint, then lizn
x-(inf I)+
Varln(x,,o) u = Var u.
2. Functions of Bounded Pointwise Variation
42
Proof. (i) Fix c E I. For every x # c, consider the partition P
{c, x}.
Then
Iu(x)I < Iu (c)I + Iu(x) - u(c)I < Iu(c)I +Varu, and so sup 1u (x) I < Iu (c) I + Varu. xEI
(ii) Let I1 := in (-oo, c] and r2 := in [c, -oo). Let P :_ {xoi... , xn} and Q :_ {yo,... , v,,,} be partitions of I1 and 12, respectively. By Remark 2.2 we may assume that xn = yo = c. Then P U Q is a partition of 1, and so n
m
Iu (xi) - u (xi-1) I +
Iu (yi) - u (yi-1)I
Varu.
:=1
=1
Taking first the supremum over all partitions P of I1 and then over all partitions Q of I2 yields Varl, u + Varj2 u < Varu.
Conversely, let P :_ {x0, ... , x, } be a partition of I. Let m E {1, ... , n} <- c <- x,,,. Then P1 :_ {xo, ... , xm-1 i c} and P2 be such that {c, xr,j, ... , x7z} are partitions of I1 and I2, respectively, and so Iu (xi) - 46 (xi-1) i=1
M-1
_ F, lu (xi) - u (xi-1)I + Iu (xm) ± u (c) - u (xm-1)1 i=1
+
Iu(xi)1 -u(xi-1)1 i=m+1
712-1
Iu(x) - u (xi-1)I + 1U (c) - u (xr-1)1 i=1
+1U(-T-)-U(C)1+
1u (xi) - u' (xi-1) I i=m+1
< Varl, u + VarI2 u.
Taking the supremum over all partitions P of I gives Var u < Varl1 u + Varl, u.
(iii) In view of part (ii), it is enough to consider the case Varu > 0. Assume that I does not contain its right endpoint (the other case is similar) and fix 0 < t < Var u. By the definition of Var u we may find a partition
2.1. Pointwise Variation
43
P:= {x0, ... , xn} of I such that n / t <EIu(xi) -u(xi-1)I i=1
For any x E (x,,, sup I), we have that P is a partition of I fl (-oo, x], and so by part (ii),
t<
Iu (xi) - u (xi-1) I <- Varin(-oo,,;] u < Var u. i=1
Letting x - (supl)-, we obtain t < lim Varin(-oo,x] u < Var u, z-+(sup I)-
where we have used the fact that the function x E I i Varjn(_,o,,l u is increasing by part (ii). It now suffices to let t / Var U.
Remark 2.7. By taking I = [a, b], with a < b, it follows from part (ii) of the previous proposition that for every c E [a, b], Var(a,,l u + Vari,,bj u = Var[Q,b] u.
Exercise 2.8. Let I C R be an interval and let u E BPV (1). Prove that if I contains its right endpoint b := sup I and u is left continuous at b, then Var
lim
u (x) := sin x, x E R, is bounded and belongs to BPVOC (R), but it does not belong to BPV (R) (why?). Next we discuss the relation between monotone functions and functions with bounded pointwise variation.
Proposition 2.10. Let I C R be an interval and let u :
I - R be a
monotone function. Then for every interval J C I, Vary u = sup u - i Jf u.
In particular, u belongs to BPVi0 (I). Moreover, u belongs to BPV (I) if and only if it is bounded.
Proof. Assume that u is increasing and let J C I be an interval. Then for every partition P = {xo, ... , xn} of J, n
n
E Iu i=1
(xi) - u
J (u (xi) - u {xi-1))
{xi-a)I = i=1
= u (xn) - u (xo) < sup u - inf u.
2. Functions of Bounded Pointwise Variation
Taking the supremum over all partitions of J yields
Varj u<supu - info. To prove the opposite inequality, it suffices to consider the case in which J
is nondegenerate. Consider the partition P :_ {a, b} C J, where inf J < a < b < sup J. Then u (b) - u (a) = Iu (b) - u (a)I
Varj u.
If sup J E J, then taking b = sup J gives u (b) = sups u, while if sup J V J, letting b / sup J gives u (b) - sup j u. Reasoning in a similar way for the left endpoint, we obtain that sup u - i of u < Varj U. This concludes the proof.
The function V introduced in the next proposition will play a central role in what follows.
Theorem 2.11 (Indefinite pointwise variation). Let I C R be an interval, let xo E I, and let u E BPYO( (I). For every x E I define (2.2)
V (x)
Var1xo,xl u if x ? xo, Varl,,,ol u if x < xo.
Then for allx,yE1, withx
Iu (F/) - u (x) I < V (y) - V (x) = Varlx,yl u.
In particular, the functions V and V ± u are increasing.
Proof. Fix x, y E I, with x < y. By Remark 2.7, (2.4) Varlx,yl u =
Varlxo,yl u - Varlxa,xI u = V (y) - V(x) if xo < x < y, Varlx,xol u - Variy,xol u = -V (x) + V (y) if x < y <- xo, Varlx,xal u + Var1 ,,yl u = -V (x) + V (y) if x < xo < y.
Since ju {y} - u (x) < Var[x,y] u, the inequality (2.3) follows.
Note that (2.3) implies that V (x) < V (y) and that (2.5) ± (u (y) - u (x)) < lu (y) - u (x) I < V {y) - V (x) . Hence, the functions V and V ± u are increasing.
11
The function is called the indefinite pointwise variation of the function U.
Remark 2.12. To highlight the dependence on xo or on u, when necessary, we will write Vxo or Vxo,.u.
2.1. Pointwise Variation
45
Remark 2.13. Note that when inf I E I, the choice xo = inf I gives the simpler function Voo (x) := Varjn(_00,,] u,
(2.6)
x E I.
However, if inf I does not belong to I or is -oo, then the function V., may not be finite, unless u E BPV (I).
Exercise 2.14. Let I C R be an interval and let u E BPVOC (I). Let V be the function defined in (2.2). (i) Prove that if u is right continuous at some x E I (respectively, left continuous), then so is V. (ii) Prove that if u E BPV (I), then sup1 V - inf. V = Var u.
The previous exercise, together with (2.3), shows that u is continuous
at x if and only if V is. Next we show that one cannot draw the same conclusion for differentiability (see, however, Exercise 2.25).
Exercise 2.15. Let u : 10, 11 - R be defined by u (x}
X0 cosy 0
if 0 < x <
1,
ifx=0,
where a > 0.
(i) Prove that if a = 2, then u' (0) = 0 # V (0) < oo. (ii) Prove that if 1 < a < 2, then u' (0) = 0, while V'(0) = 00. Exercise 2.16. Given u : [a, b] -> R, the extended real numbers
PVar u := suP E (u (x;) - u (x;-1))+ and
n
NVar u := sup F (u (xa) - u (xi-1)) i=1
where the suprema are taken over all partitions P :_ {xo,... , x",} of [a, b], n E N, are called the positive and negative pointwise variation of u in [a, b], respectively. Prove that if u E BPV ([a, b]), then Var u = PVar u + NVar u
and that u (b) - u (a) = PVar u - NVar u. One consequence of Theorem 2.11 is the analog of Corollary 1.40.
2. Functions of Bounded Pointwise Variation
46
Corollary 2.17. Let I C R be an interval and let u : I -+ R be a measurable function. Then for h >0,
If [u(x+h)-u(x)Idx
h
h
whereIh:= {x E I: x+hEI}. Proof. If Varu = oo, then there is nothing to prove. Thus, assume that Var u < oo. Fix [a, b] C I with 0 < h < b - a. By (2.3) and Corollary 1.40 applied to V we have
f(V (x + h) - V (x)) dx fb-[u (x + h) - u (x)( dx <_
Construct an increasing sequence of intervals (a,,, b,,] such that a,, \ inf I, b / sup I. If diam Ih > 0, then for all n sufficiently large we have that 0 < h < b,, - a,,, and so by the previous inequality we have that 1
bn-h
h fan
-
[u (x + h) - u (x) I dx <
- Var u.
Letting n -* oo and using the Lebesgue monotone convergence theorem gives
1I h
[u (x + h) - u (x) I dx < Var u.
,,
The previous inequality continues to hold if diam Ih = 0, since in this case the integral on the left-hand side is zero. This completes the proof. 0 In Corollary 2.43 we will prove a converse of Corollary 2.17.
Another consequence of Theorem 2.11 is the result mentioned at the beginning of the chapter, namely, the characterization of the smallest vector space of functions u : I --+ R that contains all monotone functions.
Theorem 2.18. Let I C R be an interval. The smallest vector space of functions u : I -+ R that contains all monotone functions (respectively, bounded monotone functions) is given by the space BPVOC (I) (respectively,
BPV (I)). Moreover, every function in BPVOC (I) (respectively, BPV (I)) may be written as a difference of two increasing functions (respectively, two bounded increasing functions).
Proof. Let u, v : I - R and let t e R. By (2.1) for every interval J C I we have
VarJ (tu) = jtjVar., u, VarJ (n + v) < Var., u + VarJ v. Hence, the functions in BPY0 (I) (respectively, BPV (I)) form a vector (2.7)
space.
2.1. Pointwise Variation
47
By Proposition 2.10 the space BPV°C (I) (respectively, BPV (I)) contains all monotone functions (respectively, bounded monotone functions). To prove that it is the smallest, it suffices to show that every function u in BPYoc (I) (respectively, in BPV (I)) may be written as the difference of two increasing functions (respectively, bounded increasing). In view of Theorem 2.11, it suffices to write
u=V-(V-u) or u=2(V-{-u)-2(V-u). Exercise 2.19. Let I = [a, b]. (i) Prove that if v : I - R has bounded pointwise variation and the intermediate value property, then v is continuous. (ii) Prove that if u : I -* R is differentiable and ti has bounded pointwise variation, then ti is continuous.
Exercise 2.20. Let I C it be an interval and let u E BPVOC (I) be right continuous (respectively, left continuous). Prove that for every x E I° the functions . (V + u) and ' (V - u) cannot both be discontinuous at x.
Exercise 2.21. Let I, J C R be two intervals, let f E BPV°, (J), and let u : I -> J be monotone. Prove that f o u belongs to BPYOC (I).
Exercise 2.22. Let
unx)=
1 1
2
76
z
s
,
xEIB.
(i) Calculate Var u,s. (ii) Let oo
u(x):=Eun(x), xER. ft=1
Prove that u E BPV (R). (iii) Prove that F,-, u;, (x) does not converge uniformly in [-1, 1]. (iv) Find a formula for u'. (v) What is the relevance of this exercise? The following result is a consequence of Theorem 2.18.
Corollary 2.23. Let I C R be an interval and let u E BPV°C (I). Then for every x E I the limits lim u (y) =: u+ (x) , lim u (y) =: u_ (x) 2With the obvious changes if x is an endpoint.
2. Functions of Bounded Pointwise Variation
48
exist in R, u has at most countably many discontinuity points and is differentiable Ll -a. e. in I, and for every [a, b] C I, /b J' (x) I dx < Var1Q,bi u. /
(2.8)
a
If, in addition, u E BPV (I), then u is bounded, the limits lim
(2.9)
u (y) ,
lim
y-(aup')exist in R, u' is Lebesgue integrable, and y-4inf I)+
dx < f IV'I dx
(2.10)
I
u (y)
sup V - inf V I
Var u.
Proof. Step 1: Since by Theorem 2.18 every function in BPVOC (I) is the difference of two increasing functions, from Theorem 1.2 and Lebesgue's theorem we obtain that u+ (x) and u_ (x) exist in R for every x E I, that u has at most countably many discontinuity points, and that it is differentiable L -a.e. in I. To prove (2.8), let [a, b] C I and consider the increasing function V defined in (2.2). Fix X E (a, b) such that both it and V are differentiable at x. Then from (2.3) it follows that for y > x, lu (y) - u (x)I < V (y) - V (x)
y-x
y-x
and letting y - x+, we obtain Iu' (x)I < V' (X).
(2.11)
By Corollary 1.37 applied to V and (2.3), we obtain
f IV'I dx < V (b) b
(2.12)
f b Iu'I dx < a
- V (a) = Var1a,bj u.
a
This proves the first part of the corollary. Step 2: If it E BPV (I), then again by Theorem 2.18, it is the difference of two bounded increasing functions. Hence u is bounded and the limits (2.9) exist in R. To prove (2.10), we proceed as in the last part of the proof of Proposition 2.10 to conclude from (2.12) that
dxf IV'I dxslpV-infV=Varu, JI
I
where in the last equality we have used Exercise 2.14. This concludes the
0
proof.
Remark 2.24. Note that in the second part of the proof, one could have used the function V. defined in (2.6). Indeed, as in Step 1 we have that for L1-a.e. X E I, (2.13)
In'(x)I
2.1. Pointwise Variation
49
and so by (1.19) applied to the increasing function V co,
(2.14) flit' (x) I dx C 1 I V'' (x) I dx < xle p r V (x) I
xlm I V" (x)
< sup V.. - inf V,,. = Varu. I
I
The next exercise shows that the inequality in (2.11) is actually an equality for ,+Ci-a.e. X E I. An alternative proof will be given in Theorem 4.18.
Exercise 2.25. Let u E BPV ([a, b]) and for every a < x < b define V (x) := Var[,,.] U.
Let P be a partition of [a, b], with and define v : [a, b] --+ R inductively as follows. If u (xo) < u (x1), for every x E [xo, xi] set v (x) := u (x) - u (xo) , while if u (xo) > u (x1), for every x E [xo, xi] set
V (X) := u (xo) - u(s). Let 1 < It < n and suppose that v has been defined on [xo, xk]. If it (xk) < it (xk+1), for every x E (xk, xk+11 set
v (x) := is (x) + v (xk) - u (xk), while if u (xk) > u (xk+1), for every x E (xk, xk+i] set
v(x) :_ -u(x)+v(xk)+U(xk). Prove that
(1) on each interval [xk-1,xk], 1 < k < n, either v - u or v + u is constant, (ii) V (x) = Var(n,xi v for every a < x < b and v (b) _
Iu (xk) - u (xk-1) I k=1
(iii) for every n r= N there is a function v : [a, b) -+ R such that V - vn,
is increasing, V (a) = v (a), V (b) - vn(b)
2n
and Iv'n (x)I = Iu' (x) I for L1-a.e. x E [a, b],
(iv) V' (x) = Iu' (x)I for G1-a.e. x e [a, b].
2. Functions of Bounded Pointwise Variation
50
Theorem 2.18 shows that every function in BPYOC (I) may be written as the difference of two increasing functions. The next result shows that the difference of two increasing functions can lose every kind of monotonicity and be rather pathological.
Theorem 2.26 (Katznelson-Stromberg). There exists a function u : R -* R in BPY0,, (R) which is everywhere differentiable, monotone on no interval, and such that u' is bounded but not Riemann integrable over any interval.
Proof. Step 1: Let s, t E R. Ifs > t > 0, then
s-t
2 ;F--7t2- < s
while if s, t > 1, then
s+t-2
2
s2+t2-2
t
Step 2: Let (2.15)
(x)
xER.
1
V1--+ 1xI
We claim that for every a, b E R, with a 0 b, we have 1
b
-a, fi(x) dx < 4min{¢(a),0(b)}. b Indeed, assume that a < b. If a > 0, then by Step 1 we have
_ 4(x)dx=2(1+b)b-(l+a)a
b
b1af
i.+b-4min {q(a),0 (b)}.
<
The case b < 0 follows from the fact that 0 is even. If a < 0 < b, then Step 1 yields
2( 1+b+ 1-a-2)
1
b-1 ja
fi (x) dx
(1 + b) + (1 - a) - 2
< 4 min {0 (a), i (b)} .
Step 3: Let
cj0 (yj (x - aj)) ,
IP (x)
xER,
s=1
where cj, -y > 0 and aj E R for all j = 1, ... , n. Then for every a, b E IR, with a j b, pb
(2.16)
b
1
a
f
(x) dx <4min {ii(a),0(b)
a
Indeed, this follows from the previous step and the fact that ry(b-a)
b
b
1
a
('Y (x - a)) dx =
7 (b - a) 1 ry (a - a)
(t) dt.
2.1. Pointwise Variation
51
Step 4: Let {*,,} be a sequence of function as in Step 3 and for each n E N define (2.17)
IF,, (x)
x E R.
f x V5n (t) dt, 0
00
We claim that ifn (a)
s < oo for some a E R, then the series of
n=1
functions 00
n (x),
F (x) :=
(2.18)
x E R,
n=1
converges uniformly on bounded subsets of R and is differentiable at a with F' (a) = s. To see this, let b E R be such that lal < b. By Step 3 and (2.15)
for all -b<x
I jn(t) dt+
fin
(t) dta
<4lal b12(a)+4Ix-alt/in(a) < 12bo12(a). This implies uniform convergence on [-b, b].
To prove that F' (a) = s, fix s > 0 and let I E N be so large that 00
(2.19)
n=i+1
Since each i is continuous at a, there exists S > 0 such that 1 ra+h E ip.(t) dt-0n(a)I < (2.20) I1 1
.
2I
TI
for all 0 < I hl < S and for all n = 1, ... , I. Therefore, using Step 3 again, for 0 < IhI < 6 we have
F (a + h - F (a) - sI -
rh
E
(t)
dt - V;,, (a))
U=1
I 1 fah'n h a n_1
(1 f
00
(t) dt - ,O. (a) + I
n=!
1
h Ja
0n (t) dt + 1n (a) ] //
00
< 2 +
50. (a) < E,
n=t+1
where we have used (2.16), (2.17), (2.18), (2.19), and (2.20).
Step 5: Let I, ... , In be disjoint open bounded intervals, let aj be the midpoint of I;, and let e, y
, . .. , yn
> 0. We claim that there exists a
function V ) as in Step 3 such that f o r a l l j = 1, ... , n, (2.21)
0 (a1)>yj,
V'
ii<soutside l1UUIn.
2. Fbnctions of Bounded Pointwise Variation
52
Choose c3 := yj +' and (see (2.15)) let y3 be so large that c30 (y3 (x - aj)) <
F if x 0 I3 (since 0 is even, one needs only to check this inequality at an endpoint of I3). Since the 11's are disjoint and cjo (73 (x - a?)) takes its maximum c3 at a3, properties (2.21) follow from (2.15).
Step 6: Let {a3} and {/3} be disjoint sequences of distinct real numbers. We claim that there exists a differentiable function F : R -- R such that (2.22)
F1 (a3) = 1,
F1 (,6j) < 1 for all j E N,
0 < F1 < 1 in R.
To prove (2.22), we construct by induction a sequence {ion} of functions as
in Step 3 with the properties that (2.23) (2.24)
where u
U. (a3) > 1 -
1 1
u,+<1-n+1
on. (03) < 2n2'; for all j = 1:
'
.,
n,
in R;
E &k. Choose an open interval IM with midpoint ai such k=1
that ,01 0 Ill} and apply Step 5 with e = y1 such that, setting ui i
ui < 1 - 2 in Ill},
u1(a1) >
a to obtain a function '01
O1 < 4 outside P}.
Suppose that n > 2 and that i/i1, ... ,. On-1 have been chosen to satisfy (2.23) and (2.24) up to n-1. Select disjoint open intervals In}, ... , I(n) such that, I(n) , f o r all j = 1, ... , n, a3 is the midpoint of I?n)
(2.25)
fl
Ql,
and, by continuity, (2.26)
un-1 < un_1(a,) + 6 in I(n) ,
S
2n2n > 0.
n (n + 1)
z
By Step 5, with a := zn and y3 = 1 obtain On such that for all j = 1, ... , n, (2.27)
(2 .28)
On (a3) > 1 -
n
we
- ttn-1 (a3) ,
O < 1 - n - u ,,-i (a3 ) + 22 "
( 2 .29 )
1
< 2n2n
ou ts id e
I n) U
in
I4n}
.. U Inn)
i
Then (2.23) 2 is satisfied by (2.25) and (2.29), while for all j = 1, .. Un
(a3)=un-1(a3)+0n(aa)>1--
2.1. Pointwise Variation
53
by (2.27), so that (2.23)1 holds. To check (2.24), note that by (2.26) and
(2.28) in
(a3) + is + 1 -
Utz = 'fin-1 +'On <
_
1
_
1
n(n+1)+
1
-n
- 2Ln.-1 (a,) +
1
2n2fb
1
n+1'
n
, by (2.24) and (2.29) for n - 1, while outside I(") U .. U I(n)
<1- n + 1 u,t=Un-1 +0.<1-+ n 2n2n Thus, we have constructed Now applying Step 4 to the function F defined in (2.18), we have that for all j E N, 00
F' (a3) _ E Ok (a1) = lim un (a3) = 1 k=1
by (2.23) and (2.24), while for n > j,
/ F' (.3j) _
00
00
OA: (03)
.1'
='n-1 (J3,) + F, '`Yk (0i) k=n
k=1 00
<1+00 n k_n
k2
<1-1+ < n 2n
Finally, by (2.24) and the fact that ibk > 0, for all x r= R, 00
(x) =
O < F' (x) k=1
n-40
1-
Step 7: Let {a, } and {$,i } be disjoint dense countable sets of R. Apply the previous step to obtain two differentiable functions F and G such that
0
F'(a3)=G'(33)=1, F'(f,33),G'(a3)<1for all jEN.
Defineu:=F-G. Then-1 0,
u' (Q3) < O for all j r= N.
Since {a,} and {Q?} are dense, the previous inequalities imply that u cannot be monotone on any interval. It follows from Exercise 2.3(i) that u is of bounded pointwise variation on bounded sets.
The proof of the fact that la' is not Riemann integrable on any closed interval [a, b] will make use of the fundamental theorem of calculus for absolutely continuous functions, and so it will be postponed until after Theorem 3.30.
0
2. Functions of Bounded Pointwise Variation
54
Remark 2.27. Note that the function u is actually Lipschitz continuous. Exercise 2.28. Let In := (an, b i), n E N, be a sequence of pairwise disjoint intervals in 10, 1] and choose
an < an < 0, < bn such that an - an = bn - ftn. (i) For each n E N construct a differentiable function un : In -* R such
that (a) un = 0 in I,, \ (an., 0.), (b) 0 < U. < (c - a,,.)2, (c) max ]unl = 1.
1
(ii) Define U(X)
(x)
u x)
if x E In for some nEN,
0
elsewhere.
Prove that if xo E [0,1] \ U In, then for all x E [0, 11, x # xo, n
U (x) -
u (x0) I
x-x0
< Ix - X01.
(iii) Prove that it is differentiable and that lu'l < 1.
(iv) Prove that the intervals In can be chosen so that [0,1] \ U I is n
closed, has positive Lebesgue measure, and is nowhere dense.
(v) Prove that with such a choice of {In} the function u' is discontinuous at every accumulation point of [0, 1] \ U In and u' is not n
Riemann integrable.
Exercise 2.29. Let p ? 1. Given a function u : [a, b] - R, we define the p-variation of u as n
Vart, u := sup
i/p
[u (xt) - u (x;-1) Ip
,
£.1
where the supremum is taken over all partitions P
{x0, ...
, xn} of I,
nEN. (i) Prove that if Varp u < oo, then u is bounded and for every x E (a, b)
there exist in R the limits
lim u (y) =: u+ (X),
v+X+
Jim u (y) =: u_ (X). v--q'X
2.2. Composition in BPV (I)
55
(ii) Prove that if Vary u < oo, then u has at most a countable number of discontinuity points {y,},, and that 1!P
Varpu>
(Iu+Y)__(Y)IP)
(iii) Prove that if Varp u < oo and q > p, then (2IIuIIo,)QgD
Varqu <
(Varyu)e
.
(iv) Prove that for all u, v : [a, b] -> R,
Varp(u+v) 5 Varpu+Varpv. (v) Prove that if u : [a, b] -> R is Holder continuous of exponent then Vary u < oo.
1
P°
2.2. Composition in BPV (I) In this section we study the composition of functions with bounded pointwise variation. Exercise 2.5 shows that BPV ([a, b]) is closed under the operations of addition and multiplication. The next exercise shows that it is not closed under composition (see, however, Exercise 2.21).
Exercise 2.30. Consider the functions f : [0, 1] -> R and u : [0, 1] - [0, 1], defined by
f (z)
/
,
u (x)
t
02 sm2 x
if x < 0.< 1
Prove that f and u have bounded pointwise variation, but f o u does not. Next we discuss necessary and sufficient conditions for a given function f to be such that f ou is a function of bounded pointwise variation for every function u of bounded pointwise variation.
Theorem 2.31 (Josephy). Let I C R be an interval and let f : R -+ R. Then f o u belongs to BPYa (I) (respectively, BPV (I)) for all functions u E BPVOC (I) (respectively, BPV (I)) if and only if f is locally Lipschitz.
Proof. We only prove the result in the case of BPVoo (I), the case of BPV (I) being completely similar. Assume that f is locally Lipschitz and let u E BPVOC (I). Fix an interval [a, b] C I. Since u is bounded in [a, b] (see Proposition 2.6), we have that M := suPXE [a.bl I u (x) I < oo, and so we may find L = L (M) > 0 such that
If(zi)-f(22)1 :5 LIzi-221
2. Functions of Bounded Pointwise Variation
56
for all z1, z2 E [-M, M]. Let P:= {xo, ... , x,,} be a partition of [a, b]. Then n
n
E 1(f o u) (x;) -Y o u) (xz-1)I =Elf (u (xi)) -f (u (x=-1))I s-1
=1
Iu (x;)
- u (x;-1) I <- L Var1a,bj u,
i=1
which implies that Var[a,bl (f o u) < L Var1a,bl u < oo.
Conversely, assume that f o u E BP.. (I) for every u E BPVo, (I). Fix [a, b] C I. We begin by showing that f is locally bounded. Consider an interval [-r, r], where r > 0. We claim that f is bounded in [-r, r]. Indeed, for any zo E [-r, r] consider the function (2.30)
zo + x - e2 if x E [a, b] ,
u (x)
ifxEI\[a,b].
0
Since u belongs to BPVi0 (I), by hypothesis the function f o u belongs to BPV ([a, b]). In particular, f o u is bounded in (a, b] by Proposition 2.6. Thus, there exists a constant 11fzo = M,q (a, b) > 0 such that
If(zo+x-alb] :5M'O for all x E [a, b], which implies that
If (x)I < M for all z E (zo - ,a, zo + a) . A compactness argument shows that f is bounded in [-r, r] by some constant Mr > 0. Next we claim that f is Lipschitz in (-r, r]. Indeed, assume by contradiction that this is not the case. Then we may find two sequences {sn}, {tn} C [-r, r] such that s,a # tn. and (2.31)
If (8,,,) - f (tJ > 2 (n2 + n) Isn.-tnl
for all n E N. Since {s,,} is bounded, we may extract a subsequence (not relabeled) such that sn -+ soo. Take a further subsequence (not relabeled) such that (2.31) continues to hold and
Is -acc I <
(2 32)
n
1
(n+
1)2*
Since f is bounded in [-r, r] by Aft, by (2.31) for all n e N, we have (2.33)
211-1,. >- If (8n) - f (tn)I > 2 (n2 + n) Isn - tnI
Hence, (2.34)
0 < d0 :=
Isn - tn1 (b - a)
21i4
<
b2 a
2(n +n)
0.
.
2.2. Composition in BPV (I)
57
+;a+
bno°) We now define the piecewise For every n E N, set In [a . constant function u : I - R in the following way:
(2.35) u (x)
spp
if x < a,
to
if x E In, x - (a+ b-a ) is not a multiple of d,,,
8n
if x E In, x - (a+ b+i } is a multiple of 5n,
s1
if x > b.
For every n E N, let
b-a 2M,. - 8n(n2+n) Isn-tnl(n2+n) >2 an by (2.33) and set m = max {j E No : j < Q. Note that Mn is the number of times that the function u takes the value sn in the interval In. Since (2.36)
Pn:=
diam In
En > 2, we have
f2
(2.37)
< Mn < Qn.
Consider the partition P. of In = [a +
1, a + --n-] given by
Pn.={a+n+1+21bn: i=0,...,2m,, o
,...
2,n
Then by (2.33)-(2.37), 2
Var7 (fOu)>EIf(u(xr))-1 (U(-T'
an-tn4M,., and so for every n E N by Remark 2.7 we obtain that n
Var1Q.,b] (f ou)Varjk(fou)>4Mn->oo k=1
asn -oo. On the other hand, since u is a step function on In, by (2.32)-(2.37) we have that (why?) Var jn u < 2mn I8n - to l + I8n+1 - Sn I + I Sn+1 - tnl
<2fnlen-tnl+2l8n+1 -soot +2Is. -Snl+Isn - tnl All
4
All
+n2+n
< 2M,. + 4 9t2
2. Functions of Bounded Pointwise Variation
58
Since s -> soo and t,,, --+ soo, it follows by (2.35) that u is right continuous at a. Hence, by Exercise 2.8 (which holds for the left endpoint with the obvious changes) and Remark 2.7 we have that n
Varta,bl u = lim Var b-a ' b] a-.0o [a+ nn+1
u = n-.oo lim
k=1
00
Var-u
k=1
4Mr + 4 k2
< oo,
which shows that u E BPI,, (I). Hence, we have obtained a contradiction. Remark 2.32. Note that the previous proof continues to hold if f : Rd -, R. More precisely, f o u belongs to BP1' (I) (respectively, BPV (I)) for all functions u E BPYOC (I; Rd) (respectively, BPV (I; Rd)) if and only if f is locally Lipschitz. The next exercise gives necessary and sufficient conditions for a function
h to have the property that u o h belongs to BPV (I) for every function
uEBPV(I). Exercise 2.33. For each f E N let ,7e :_ {E C [0, 1] : E can be written as a union of f intervals} ,
where we allow singletons as degenerate closed intervals. A function g [0, 11 -> R is said to be of f-bounded pointwise variation if 9-1 ([a, b]) E 7t for all [a, b] C R.
(i) Prove that if g : 10,1] -> R is of I -bounded pointwise variation and
if Ig(x)I<Mfor allxE[0,11,then Varg<_4M(f+1). (ii) Prove that if u :
11 -+ R is increasing and if g : [0,1] -' [0,1] is of I -bounded pointwise variation for some e E N, then u o g is bounded and of e-bounded pointwise variation. is of bounded pointwise variation and if (iii) Prove that if u . g : [0, 1] -+ [0, 11 is of f-bounded pointwise variation for some f E N,
then u o g is of bounded pointwise variation. (iv) For each n E N let gn : [0, 1] -> {0, '} and let 00
g:= Egn. n=1 Prove that 00
Varg > E Varg,,. n=1
2.3. The Space BPV (1)
59
(v) Prove that if g : [0,1] -+ 10,11 is such that u o g is of bounded pointwise variation for all u : 10,11 -- R of bounded pointwise variation, then g : 10, 1] - R is of £-bounded pointwise variation for some e E N. Hint: If not, then for each n E N find an interval In C [0,1] such that g 0 3Jn and take 00
u:=Eun for an appropriate choice of u,a.
2.3. The Space BPV (I) Note that by (2.7), u H Varu has most of the properties for being a norm in the space of BPV (I). What is missing is the fact that Varu = 0 does not imply that u = 0, but only that u is a constant. However, we have the following.
Corollary 2.34. Let I C R be an interval. Then for any fixed c E I, the application u
Hull := Iu (c) I + Varu
is a norm in the space BPV (I). Proof. By (2.7), Iltull = Iti lull and 11u + ull <_ lull + IIuII for all t E Dz and for all u, v E BPV (I). It remains to show that lull = 0 implies that u = 0. Indeed, if Var u = 0, by taking the partition {x, c} for every x E I, x # c,
we havethatu(x)=u(c)=0.
0
Since the space BPV (I) is a normed space, the next natural question is its completeness. The proof will rely on the following important compactness result.
Theorem 2.35 (Helly's selection theorem). Let 1 C I8 be an interval and let.P be an infinite family of functions in BPV (I). Assume that there exist c E I and a constant C > 0 such that (2.38)
1u(c)I + Varu < C
for all u E F. Then there exists a sequence {un} C F and a function v E BPV (I) such that un (x) -> v (x)
for alEx 1. We divide the proof into a few lemmas, which are of independent interest.
2. Functions of Bounded Pointwise Variation
60
Lemma 2.36. Let I C 1[8 be an interval and let.F be an infinite family of functions u : I -- R. Assume that there exists a constant C > 0 such that
Iu(x)I
xEE. Proof. The proof makes use of the Cantor diagonal argument. Let E {xk}k. Since the set {u (x1) : u r =.F)
is bounded, by the Bolzano-Weierstrass theorem we can find a sequence {u() } C F for which there exists the limit
lim u;,) (x') = el E R-
n-+oo
Since the set {t41') (x2) : n E N}
is bounded, again by the Bolzano-Weierstrass theorem we can find a sequence Ju(n2)j C m
{u} for which there exists the limit n
lien u(2) (x2) = 82 E R.
n--+oo
By induction for every k E N, k > 1, we can find a subsequence {unk)} C
jun(4-')j for which there exists the limit lim un) (xk) = fk E R.
n-.oo
We now consider the diagonal elements of the infinite matrix, that is, the sequence Ju(n) I . For every fixed xk E E we have that the sequence {uin)
n
(xk)100
n=k
is a subsequence of jun";) (xk)}
as n -+ oo. This completes the proof.
n
,
and thus it converges to tk
0
Lemma 2.37. Let I C ]I8 be an interval and let F be an infinite family of increasing functions u : I - R. Assume that there exists a constant C > 0 such that Iu (x)I <_ C
for all x E I and all u E.F. Then there exist a sequence {un} C F and an increasing function v : I -> R such that 1im, un (x) = v (x) for all x E I.
2.3. The Space BPV (1)
61
Proof. Apply the previous lemma with E given by the union of all the rationals in r and the endpoints of I that belong to I (if any) to find a sequence {un} C F such that the limit un (x) exists in JR for all
xEE. Definew:E -Rby
w (x) := lim un (X),
(2.39)
x E E.
n->oo
Since each function un is increasing, if x, y E E and x < y, then un (x) < un (y) for all n E N, and so letting n - oo, we conclude that w (x) < w (y). Thus, w is increasing.
'Ib extend w to I \ E, for x E I \ E we define w (x) :=
sup
w (Y).
yeEn(-CC,x)
Note that in is increasing by construction. We claim that lim un (x) = in (x)
(2.40)
for all those x E I such that in is continuous at x. To see this, fix e > 0 and any such x. In view of (2.39) it is enough to consider the case in which
x E I \ E. Since x is not an endpoint of I, using the continuity of w at x, together with the density of the rational numbers, we may find x1, x2 E E such that xl < x < x2 and w (x2) - in (xl) <
(2.41)
By (2.39) there exists an integer no E N such that n (xl) - w (xl)I < 2, Iun (x2) - w (x2)I < 2 for all n > no. Since w and un are increasing, (2.42)
It
w(x) -e <- w(X2)±w(X1) -e < w (xl) -
< un (X0 < U. (x) < U. (X2):5 w (x2) +
2
2 =w(x2)±w(xl)+2 <w(x)+w(T2)-w(xl)+2 <w(x)+s
for all n > no, where we have used (2.41) and (2.42). This implies that
JU.(x)-w(x)l <E for all n > no. Thus the claim is proved. Now let El be the set of points of discontinuity of in, which is at most countable. Applying the previous lemma once more, with El and {un} in
2. Functions of Bounded Pointwise Variation
62
place of E and F, we may find a subsequence {n,,,, } of at every point of El. The function
that converges
Eli
v (x)
limk-,0 unk (x) if x E El
has all the desired property. Indeed, in view of (2.39) and (2.40), we have
that w (x) = n->oo lim un (x) = lim u, (x) k-oo
for all x E I \ El.
O
We now turn to the proof of the Helly theorem.
Proof of Helly's selection theorem. For every u E .P write
u= Vu-(Vu-u), where Vu is the function defined in (2.2). By Theorems 2.11 and 2.18, Vu and V - u are increasing functions, and by (2.38), IVu(x)I
IVu(x)-u(x)I < IVu(x)I+Iu(x)-u(c)I+Iu(c)I <2C
for all x E 1, and thus we may apply the previous lemma to the family IV,, : U E ..F} to find a sequence {un } C F and an increasing function vl :
I - R such that lim V.u (x) = vi (x) for all x E I. Applying the previous lemma to the family {V,,,, - u.}, we of {u} and an increasing function 'v2: I -* JR
may find a subsequence
such that lim
k-roo
(Yank -
unk) (x) = v2 (x)
for all x E I. By Theorem 2.18, the function v and
lien U-k (x) =k--oo lulu [v4,k (x)
vi -v2 belongs to BPV (I)
- (vlk - unk) (x)]
= v1 (x) - v2 (x) = V (x)
for all xE1.
O
The fact that the function v belongs to BPV (I) can also be derived by the lower semicontinuity of the variations with respect to pointwise convergence. More precisely, we have the following result.
Proposition 2.38. Let I C R be an interval and let
be a sequence of real-valued functions defined on I and converging pointwise to a function
u : I -' R. Then Var u < lim inf Var un. f->oo
2.3. The Space BPV (1)
63
In particular, if the right-hand side of the previous inequality is finite, then u belongs to BPV (I).
Proof. Without loss of generality we may assume that Var u > 0, since otherwise there is nothing to prove. Fix 0 < t < Varu and find a partition P = {xo, ... , xm } of I such that m
lu(xi) -u(xi-1)l.
t< L=1
Since un (xi) - u (xi) a s n - oo f o r all i = 0, ... , m, for every e > 0 we may find is E N such that lun (-Ti) - u (xi)I :5
2m
for all n>nandi=0,...,m. Hence for n>n, m
t<
'n lu (xi) - u (x,i-1)I C i=1
U. (xi) - un (xi-1)I +
1)
i=1
M
I'un(xi)-un(xi-1)l+E
Taking the limit inferior on both sides, we obtain t < lim inf Var un + e. n-poo
Letting E - 0+ and t - (Var u)- yields the desired result. Remark 2.39. If u is continuous, then it is enough to assume that un (x) -+
u (x) for all x in a dense set E of I. To see this, let P = {xo, ... , be as in the previous proof. By the continuity of u and the density of E there exists a partition P' = {ya,... , y,,,} C E such that lu (y4) - u (x0I < m for all i = 0,.. ., m. We may now continue as in the previous proof (working
with P in place of P) to conclude that t < lim inf Var un + 2E. ft--+00
As before it suffices to let E - 0+ and t - (Var u)-. One consequence of the Helly selection theorem and of the previous proposition is the completeness of the space BPV (1).
Corollary 2.40 (Completeness of BPV (I)). Let I C R be an interval and let c E I. Then the space BPV (I) endowed with the norm (2.43)
11 ull := lu(c)I + Varu
2. Functions of Bounded Pointwise Variation
64
is a Banach space.
Proof. Let
be a Cauchy sequence in BPV (I). Since every Cauchy sequence is bounded, there exists a constant C > 0 such that
Iun(c)I+Varun u (x) for all x e I. Since {u,,) is a Cauchy sequence, given e > 0, there exists A E N such that
Iin(C) - Um(e)I + Var(un-um) <E for all n, m > n. In particular, It
(c) I + Var (un - u,) < e (c) for all n, uk. > h. Letting k i oo and using the previous proposition, we
conclude that Iu,z (c) - u (c) l + Var (isn - u) < E
foralln>n. The next exercise shows that the space BPV (I) endowed with the norm defined in (2.43) is not separable.
Exercise 2.41. Consider the space BPV ([0,1]) endowed with the norm (2.43). For every u E BPV (10,1]) and r > 0 let BBpv (u, r) :_ {v E BPV ([0,1]) : I1u - v11 < r} . For every t E [0, 11 define ut := X{t}.
(1) Prove that for every t, s E [0, 11, with t # s, BBPV (ut, 1) n BBPV (U., 1) _ 0
(ii) Prove that for every t E [0, 11, BBPV (Ut, 1) C BBPV (0, 3) .
(iii) Prove that the Banach space (BPV ([0,1]) ,11.11) is not separable.
Exercise 2.42. Consider the space BPV ([0,1]) endowed with the metric
d(u,v) := f Iu(x) - v(x)I dx+ IVaru- VarvI . 0
(i) Prove that if {u,,} C BPV ([0,11) is such that sup d (us, 0) < oo, then there exist a subsequence {u,,,,} of {u,s} and a function u E BPV {10,1]) such that d (u,,, u) - 0. Hint: Use Helly's theorem. (ii) Prove that (BPV (10,1]) , d) is a complete metric space.
2.3. The Space BPV (I)
65
(iii) Prove that (BPV (10,1]) , d) is separable. Hint: Any function can be approximated by an inscribed polygonal function. (iv) Is there any relation between convergence in the norm (2.43) and in the metric d? Is there any difference in the answer if the limit function u is continuous? Another consequence of the Helly selection theorem is the following result, which is the converse of Corollary 2.17.
Corollary 2.43. Let I C R be an interval and let u : I -* R be an integmble function such that
C:= limsup 1 / Iu (x + h) - u (x)I dx < oo, h-0+ h
where
Ih
Ih:={XEI: x+hEI}.
Then there exists a junction v E BPV (I) such that v (x) = u (x) for Ll-a.e. and Vary = C.
Proof. For every n E N we partition the interval I into subintervals of equal length En > 0, with do -' 0 as n -> oo. Let {xP} be the family of
j
endpoints of the intervals. For every x E constant function
(-'Oj-iX(!)) define the piecewise
u (t) dt.
un (x)
Extend un at the endpoints in such a way that it is right continuous and if b E I, extend un at b in such a way that it is left continuous at b. Since u is piecewise constant, 1
Var un = 9
f +i
b J{ n tin
=8 1
Xi")
u (t) dt - J {n) u (t) dt x}-1
(n)
fx(n)
J(am) u(x+5n)dx- J(') u(t)dt n ]-1
.?-1 1
<
<
x(n)
Sn z(n)
16n J
Iu(x+6) - u(x)I dx
Iu (x + an) - u (X) l dx, I8n
and so, by hypothesis, (2.44)
lim sup Var u,z <- C. n.-4oo
2. Functions of Bounded Pointwise Variation
66
Moreover, since u,,, -> u in LiC (I) (why?), we may find c E I and a subsequence, not relabeled, such that sup1, Iu (c) I < oo, sup Var un, < C + s, n
and u,, (x) -r u (x) for 41-a.e. x E I. Thus, we are in a position to apply Helly's selection theorem to find a further subsequence, not relabeled, and a function v E BPV (I) such that
u, (x) -+ v (x) for all x E 1. Hence v (x) = u (x) for £''-a.e.
jIu(x+h)-u(x)I dx= r,
E I, and so
dx
h
by Corollary 2.17. Letting h 0+, we conclude that C <_ Var v. On the other hand, by Proposition 2.38 and (2.44), Var v
inf Var un < C, _ lim n-Poo
and soVarv=C. Results of this type are often useful in the regularity theory of solutions of differential equations (see, e.g., [24] and 153]).
Exercise 2.44. Prove that the sequence {un} constructed in the previous corollary converges to u in Lj0 (I).
2.4. Banach Indicatrix We conclude this chapter with a characterization of continuous functions of bounded pointwise variation due to Banach [14]. It expresses the fact that
the graph of a function in BPV (I) cannot intersect a horizontal line too many times. This result paved the way to the area formula (see [10], [54], [58], and [182]).
Definition 2.45. Given two nonempty sets X, Y, a function u : X
Y,
and a subset E C X, for every y E Y let N. (y; E) be the number of elements (if any) of the set {x E E : u (x) = y}. The function Nu E) : Y -p No U {oo} is called the counting function or Banach indicatrfx of u in
the set E. When E = X, we sometimes omit the dependence on E; namely, we write Nu := Nu X). We begin with a preliminary result due to Federer [57]. For simplicity we present it here only for vector-valued functions defined on an interval and refer to [57] for the general statement.
2.4. Banach Indicatrix
67
Theorem 2.46 (Federer). Let IL : B (Rd) -, [0, oo) be a Borel measure, let I C R be an interval, and let u : I -> Rd be such that u (J) is a Borel set for every interval J C I. For every n E N let 7;4 be a countable family of pairwsse disjoint intervals with the properties that .F,, is a partition of I and
sup diam J - 0 JE.7=n
as n - oo. Then rN.,i (.; I) is a Borel function and
f Nu(y;I) dFa(y)= lim n--+oo Rd
Iz(u(J)) JE.Fn
Proof. We divide the proof into two parts. Step 1: We claim that for every y E Rd, (2.45)
N,, (y; I) = lim
(y)
.
JEFn
T o see this, l e t m E No be such that m < N u (y; I). Then there exist m distinct points x1, ... , x,,, E I such that u (xi) = y. Assume that x1 < . < x,,,
and let &, := min {xi - xi_i : i = 2, ... , m} > 0. Since sup JEF diam J - 0 as n - oo, there exists no E N such that
sup diam J <
JEFn
for all n > n6. Using the fact that each F. is a partition of I, it follows that for n > no there must exist m distinct intervals Jl("), ... , Jmn) E .F, such that x; E J(n) for all i = 1, ... , m and n > n6. Thus, for all n > n6, m
m=
X,,(J(n)) (F!) <_ E Xu(J) (Y) i=1
JEFn
{
and consequently
m < lim inf n-.oo
xu(J) (y) . JE.fn
If N (y; I) < oo, take m := N,, (y; I), while if Nu (y; I) is infinite, let m -> N. (y; I) in the previous inequality to conclude that
N. (y; I) < lnm inf E Xt(J) (y). -400 JEFn
On the other hand, by the definition of N. (y; I), for every integer n E N, we have that (2.46)
E Xu(J) (y) <_ N. (y; I) , JEF.
2. Functions of Bounded Pointwise Variation
68
where we have used again the fact that .p',, is a partition of I. Letting n - 00 in the previous inequality gives Xu(J) (y) < N. (y; I) .
lim sup n--400
JET.
Hence (2.45) holds. Note that since by hypothesis Xv(J) is a Borel function for every J E F,,, (2.45) implies that N. I) is a Borel function.
Step 2: We claim that (u (J)) >_ IR Nu (y; I) dµ (y)
lira inf
.
d
JEYY
By Corollary B.42 in Appendix B, for every n E N, (2.47)
A (u (J)) _ E J Xu(J) dp (y) ,'
JE.Fn
JE Fn
Xu(J) dy. (y) Rd JE.Fn
It now follows from (2.46) that
Jim sup E F(u(J)) S fd n--+00
dis(y)
lF
JEFn
On the other hand, from (2.47), Fatou's lemma, and Step 1, in this order, we get
lim anf E µ (u (J)) = lim in
r Xu(J) dl (y)
J
]R
JE.Fn
fRd
1 nm
JEF,
irlfJEFn 1: Xu(J) dp (y) = fRd N. (y; I) d1 (y)
This completes the proof.
Theorem 2.47 (Banach). Let I C R be an interval and let u : I -' JR be continuous. Then Nu I) is a Borel function and (2.48)
fNu(Y;I) dy
Varu.
In particular, u belongs to BPV (I) if and only if Nu
I) is Lebesgue inte-
grtable.
Lemma 2.48. Let u : [a, b] -> JR be continuous. For every 5 > 0 let P6 be a partition of [a, b], with
xo,s := a < xl,g < ... < xna,a b, such that xi,a - xj-j,,5:5 6 for all i = 1, ... , no. Then n6
Var u = Jim E [u (xs,d) - u (xs_l,a) I a-,o+
s=i
.
2.4. Banach Indicatrix
69
Proof. Without loss of generality we may assume that Var is > 0, since otherwise is is constant and there is nothing to prove. Fix any 0 < t < Varu of [a, b], with xo = a and x,n = b (see and find a partition P = {xo, ... , Remark 2.2), such that m
S :_ E Iu (xj) - u (xj_1)1 > t.
(2.49)
j=1
Since is is uniformly continuous, there exists t > 0 such that (2.50)
Iu (x) - is (x') I < 2m t for all x, x' E [a, b] with Ix - x'l < q. Let 1
-min { ri, min (xj - xj-1) 2 l 3=1,...,m If 0 < 6 C 60, then for each j = 1, ... , nt - 1 there exists a unique index k, then ij E { 1, ... , n6} such that xj E (Ci,-1,5, xi?,d Moreover, if j 0 < So
<Setio:=0andi,,,:=n6.
ij74 ix,andi1 Since
- xj
I
:5 xi,,6 - xi,-1+6
n,
by (2.50) we have
-
l u (xj) -u (xj-1)I :5 1'U (xj) u (xi3,6) I + Is (xif,6) - 46 (xis-1,6) I+ Iu (xi,-1,6) - u (xj-1)I +
S-t rn
It(xis,6) -u(xi,
Summing over all j = 1, ... , m and using (2.49), we get S=
E lu (x3) - u (x,-1}1 < S - t + E I's (Xij,6) - u (xz,-1,6) I
j=1
j=1
n6
<S-t+
lu (xi,6) - 2i (xi-1,6)I , i=1
and so
n6
u(x:,6) -u(xi-1,6)I <- Varu.
t< i=1
In turn, no
t < lim inf'' Its (xi,s) - u (xi-1,6)1 6y0+
Z=1 n6
< lim sup 6-40+
Iu (xi,a) - u (xi-1,6) I < Var is. i=1
2. Functions of Bounded Pointwise Variation
70
Letting t / Var u gives the desired result. Note that in the previous lemma we are not assuming that Varu < oo.
Exercise 2.49. Prove that the previous lemma continues to hold if u : [a, b] -, IR is only assumed to be left continuous (respectively, right continuous). Hint: Use left continuity (respectively, right continuity) at each point xj to find S°. The previous lemma does not hold for the p-variation (see Exercise 2.29).
Exercise 2.50. Let p > 1. Given a function u : [a, b] -> R, define n
Varrp°) u := lira sup b-,0+
11r
lU (.Ti) - u (Xi-1)Ip i=1
where for each fixed 6 > 0 the supremum is taken over all partitions P {x0, ... , x,,} of I such that Ixi - xi-1 I < b, i = 1, ... , n, n E N. (i) Prove that Varp°) u < oo if and only if Vari, u < oo.
(ii) Prove that there exists a function u for which Varp°} u < Var , u < oo.
(iii) Prove that if u is continuous and Varo u < oo, then Var( °)u = 0 for q > p. Hint: Use uniform continuity.
Proof of Banach's theorem. Step 1: Assume that I = [a, bJ . For every n E N let F be the partition of [a, b] given by
I1, := [a, a+
b
2na1
Ik,n:= La+(k-)b2na,a+kb2"aJ
fork=2,...,2".
Since u is continuous, by the Weierstrass theorem and the intermediate value theorem for every interval [a, Q] C [a, b] we may find t1, t2 E [a,131 such that
u([a,/3]) = [u(t1),u(t2)]. Hence, by (2.3), Iu (0) - u MI < £' (u ([a, 01)) = Iu (t1) - u (t2)I <- Var[a,pl u. Using this inequality and Remark 2.7, we get
E lu (sup J) - u (inf J)I < 1 C1 (u (J)) < JE.Fn
JE.F.
Varj u = Var1Q,61 u. JE.F.
2.4. Banach Indicatrix
71
Letting n -> oo and using the previous lemma, we obtain
VarlQ,bl u = l!ino E Iu (sup J) - u (inf J)I JEF.
< lim
C1(u(J)) < Var1a,bl u, JEFn
and so, by Federer's theorem with p given by the Lebesgue measure,
jN(v; [a, b]) dy = lm
,V 1(u (J)) = Var[n,b] u.
JEF Step 2: If I is an arbitrary interval, construct an increasing sequence of intervals [ak, bk] such that
ak \ inf I, bk / sup I, and
00
I= U [ak, bk] k=1
By the definition of N,, (y; -) for every y /E l[i; we have that N. (y; [ak, bk]) C N. (y; [ak+1, bk+1])
and N. (y; [ak, bk]) - N. (y; I). Hence, by Proposition 2.6, Exercise 2.8, the previous step, and the Lebesgue monotone convergence theorem, we get
Varl u =
>n Var(Q,,,bkl u = k m f N(y; [ak, bk]) dy = f N(y;1) dy
This concludes the proof.
11
Corollary 2.51. Let I C R be an interval and let u E BPV (I) be continuous. Then the set o f values y E ]R f o r which u 1({y}) is infinite has Lebesgue measure zero.
Proof. Since by the previous theorem the function Nu is integrable, it follows that it must be finite for £1-a.e. Y E R.
The previous corollary expresses the fact that a function in BPV (I) cannot oscillate too much.
Exercise 2.52. Consider the Cantor set 00 P-1
®:_ [0,1] \ U U Ik,nn=1 k=1
For every interval Ik,, = (ak,n, bk,n), n r= N, k = 1, ... , 2n-1, define 9A;, (x)
(x - 4k,.) -2'1 sin 27r , bk,n - ak,n
x E [ak,nr bk,n]
2. Functions of Bounded Pointwise Variation
72
(i) Prove that the function g : [0, 11 -R, defined by gk,n (x) if x E Ik,n, n E N, k = 1, ... , 2n-1, g (x)
0
ifxED,
is continuous.
(ii) Let f := g+u, where u is the Cantor function. Prove that for every n E N,
[0,1] = f
U Ik,n k<2"-L
(iii) Prove that the counting function Nf : R -* NU{0, oo} is identically 0o in 10, 11.
Exercise 2.53. Let u : (a, b] --+ R be continuous. Using Banach's theorem, give an alternative proof of the fact that if c E (a, b), then Var[a,c] u + Var[,,b) u = Var u
(see Remark 2.7).
Chapter 3
Absolutely Continuous Functions Undergradese, III: "Hmmm, what do you mean by that?" Translation: "What's the answer so we can all go home?" - Jorge Cham, www.phdoomics.com
The Cantor function shows that for monotone functions the fundamental theorem of calculus fails for Lebesgue integration. Indeed, 1
A
u'(t) dt=0
To recover it in the context of Lebesgue integration, we need to restrict ourselves to a subclass of functions of bounded pointwise variation. This leads us to the notion of absolute continuity.
3.1. AC (I) Versus BPV (I) Definition 3.1. Let I C R be an interval. A function u : I -> R is said to be absolutely continuous on I if for every e > 0 there exists b > 0 such that (3.1)
Iu(bk) - u(ak)I < E k=1
for every finite number of nonoverlapping intervals (ak, bk), k with [ak, bkl C I and
(bk-ak) <8. k=1
The space of all absolutely continuous functions u : I -> R is denoted by
AC(I). 73
3. Absolutely Continuous Functions
74
Remark 3.2. Note that since a is arbitrary, we can also take e = oa, namely, replace finite sums by series.
A function u : I -+ R is locally absolutely continuous if it is absolutely continuous in [a, b] for every interval [a, b] C I. The space of all locally absolutely continuous functions u : I -, R is denoted by ACID,, (I). Note
that ACID.. ([a,b]) = AC([a,b]).
If u : I --+ Rd, then we can define the notion of absolute continuity exactly as in Definition 3.1, with the only difference that the absolute value is now replaced by the norm in Rd. The space of all absolutely continuous functions u : I -> Rd (respectively, locally absolutely continuous) is denoted by AC (I; Rd) (respectively, ACID, (I; Rd)). If 0 C R is an open set, then we define the notion of absolute continuity for a function u : SZ -* R as in Definition 3.1, with the only change that we now require the intervals [ak, bkj to be contained in [Z in place of I. The space of all absolutely continuous functions u : 11-> R is denoted by AC (Q).
Exercise 3.3. Let I C R be an interval and let u : I - R. (i) Prove that u belongs to AC (I) if and only if for every s > 0 there
exists b > 0 such that e
k=1
for every finite number of nonoverlapping intervals (ak, bk), k = with [ak, bk] C I and
>(bk-ak) <S. k=1
(ii) Assume that for every > 0 there exists 6 > 0 such that
k=1
for every finite number of intervals (ak, bk), k = 1,...J, with [ak, bk] Cl and
>(bk-ak)<3. k=1
Prove that u is locally Lipschitz.
3.1. AC (I) Versus BPV (1)
75
Part (ii) of the previous exercise shows that in Definition 3.1 we cannot remove the condition that the intervals (ak, bk) are pairwise disjoint. By taking f = 1 in Definition 3.1, it follows that an absolutely continuous
function u : I - R is uniformly continuous. The next exercise shows that the converse is false.
Exercise 3.4. Let u : (0,1] - R be defined by u (x) := x° sin b, x
where a, b E R. Study to see for which a, b the function u is absolutely continuous. Prove that there exist a, b for which u is uniformly continuous but not absolutely continuous.
Exercise 3.5. Let I C R be an interval and let u : I -> R be differentiable with bounded derivative. Prove that u belongs to AC (I). Exercise 3.6. Let u, v E AC ([a, b]). Prove the following.
(i) u±vEAC([a,b]). (ii) uv E; AC ([a, b]).
(iii) If v (x) > 0 for all x E [a, b], then v E AC ([a, b]). (iv) What happens if the interval [a, b] is replaced by an arbitrary interval I C R (possibly unbounded)? We now turn to the relation between absolutely continuous functions and functions of bounded pointwise variation. In Corollary 2.23 we have proved
that if u : I - llt has bounded pointwise variation, then u is bounded and u' is Lebesgue integrable. However, the function u (x) := x, x E R, is absolutely continuous, but it is unbounded and u' (x) = 1, which is not Lebesgue integrable. Also the function u (x) := sin x, x E R, is absolutely continuous, bounded, but ui is not Lebesgue integrable. These simple examples show
that an absolutely continuous function may not have bounded pointwise variation. Proposition 3.8 below will show that this can happen only on unbounded intervals.
Exercise 3.7. Let I C R be an interval and let u : I -i R be uniformly continuous.
(1) Prove that u may be extended uniquely to I in such a way that the extended function is still uniformly continuous.
(ii) Prove that if u belongs to AC (I), then its extension belongs to AC (I). (iii) Prove that there exist A, B > 0 such that for all x E I, Iu(x)l <_A+BIxI.
3. Absolutely Continuous Functions
76
The previous exercise shows that although an absolutely continuous function may be unbounded, it cannot grow faster than linear when Ixl --+ 00.
Next we show that ACI, (1) C BPVio, (I). Proposition 3.8. Let I C R be an interval and let u c ACID, (I) (respectively, AC (I)). Then u belongs to BPVIOC (I) (respectively, BPV (J) for every bounded subinterval J of I). In particular, u is differentiable V-a.e. in I and u' is locally Lebesgue integrable (respectively, Lebesgue integrable on bounded subintervals of I).
Proof. Step 1: Assume that u E ACID, (I) and let [a, b] C I. Take E = 1, and let d > 0 be as in Definition 3.1. Let n be the integer part of 2 b-a and partition [a, b] into n intervals [x;_1 i xs] of equal length b;T
,
a=xp<xl<---<x.=b. Since bnn < b, in view of (3.1), on each interval [xq_l, xi] we have that Var]xt_ u < 1, and so by Remark 2.7,
_
Var[Q,b] u =
n
Var[, l,x;] u < n <
2(b-a)
< oo,
where we have used the fact that bnQ >
Step 2: Assume that u E AC (I) and let J C I be a bounded interval. By Exercise 3.7 we may extend u uniquely to a function u : 7-+ R such that u belongs to AC M. The previous step (applied to 7 in place of I) implies that Var J u < oo, and so, in particular, Var j u < oo. This completes the proof.
0
Corollary 3.9. Let I C R be a bounded interval. Then AC (1) C BPV (I) In particular, if u E AC (I), then u is differentiable Cl-a.e. in I and u' is -
Lebesgue integrable.
The converse of the previous corollary is false, since absolutely continuous functions are always continuous while monotone functions may not be. Even more, there exist continuous monotone functions that are not absolutely continuous. The Cantor function and the function constructed in Theorem 1.47 are such examples. What is missing for a continuous function in BPV (I) to belong to AC (I) is the so-called (N) property. We recall the following definition.
Definition 3.10. If E C R is a Lebesgue measurable set and v : E --I' R is a Lebesgue measurable function, then v is equi-integrable if for every e > 0 there exists 6 > 0 such that fF Iv (x)l dx < e
77
3.1. AC (I) Versus BPV (1)
for every Lebesgue measurable set F C E, with G1 (F) < S.
Exercise 3.11. Let E C R be a Lebesgue measurable set, let 1 < p < 00, and let v E L" (E). Prove that v is equi-integrable. Prove that if we only assume that v c L'10C (E), then the result may no longer be true. Theorem 3.12 (Lusin (N) property). Let I C R be an interval. A function u : I -' R belongs to AC10 (I) if and only if (i) u is continuous on I,
(ii) u is differentiable G1-a.e. in I, and u' E L11.,, (I), (iii) u maps sets of Lebeague measure zero into sets of Lebeague measure zero.
Property (iii) is called the Lusin (N) property. We begin with some preliminary results, which are of interest in themselves.
Lemma 3.13. Let I C R be an interval and let u : I - R. Assume that there exist a set E C I (not necessarily measurable) and M > O such that u is differentiable for all x E E, with
lu'(x)I<M forallxEE. Then
Go(u(E)) :5 M41(E). Proof. Without loss of generality we may assume that E C I°. Fix s > 0 and for each n E N let E. be the set of points x E E such that (3.2)
Go (u (J)) <- (M + s) Lo (J)
for all intervals J C I such that x E J and 0 < length J <
Note that
E,, C
E = U En. n=1
Since each En is contained in E, to prove the claim, it suffices to prove that each point x r= E belongs to some E. Fix x E E. Since lu' (x)I < 1Li and lim
u (y) - u (x)
y-x
= u' (x}
'
there exists 6 > 0 such that
1U(y) -u(x)I <(M+e)Iy-xl
3. Absolutely Continuous Functions
78
for all y E I, with Iy - xI < 5. Hence, if y, y' E I, with Iy - y'I < 8 and
y<x
lu (y) - u (y') I < 1u (y) - u (x)1 + Iu (y') -U(X) I
<(M+E)(x-Y)+(M+E)(y'-x) =(M+E)(y'-y). This implies that x E En for every integer n > We now fix n G N and we prove that
and so the claim is proved.
C (u (E.))< (M + E) (Go (En) + E).
(3.4)
By the definition of £.
we may find an open set U, such that U D En
and
G1 (Un) < Co (En) +
By replacing Un with u,, n I°, if necessary, we may suppose that Un C P. Decompose Un as a countable family JJ,(n)} of pairwise disjoint intervals
with 0 < length J" < n . Define
2:= {k: JJnlnE.
O}.
Note that by (3.2) if k E Z, then
'Co (u (Jk-l)) < (M + E) 4 and so
40' (u (En)) < 40' u u
(Jkn))
E 'C10 (u kET
kEZ
<
(jn)))
(j,n))
(M+E)L
(yJn))
= (M+6)C'(Un) < (M+E) (Co(En)+E),
where we have used the fact that the intervals Jknl are pairwise disjoint. Hence, (3.4) holds.
Since Go is a regular outer measure and {En} (and in turn {u(En)}) is an increasing sequence, by Proposition B.105 in Appendix B we may let n -' oo in the previous inequality to obtain
£ (u (E)) < (M -- e) (Co (E) + E) It now suffices to let e -> 0+.
.
0
As a consequence of the previous lemma we have the following result.
3.1. AC (I) Versus BPV (1)
79
Corollary 3.14. Let I C 1[8 be an interval and let u : I - R. Assume that there exists a set E C I such that u is differentiable for all x E E. If the set E has Lebesgue measure zero or if u' = 0 in E, then Ll (u (E)) = 0. Proof. Assume that E has Lebesgue measure zero. For every n E N write E,, := {x E E : ju' (x) I < n}. Since u is differentiable in E, it follows that 00
E= UEn, n=1
while by the previous lemma
L' (u(En))
By the countable subadditivity of C1 we obtain that tl (u (E)) = 0. If u= 0 in E, then we may take M := 0 in the previous lemma. Remark 3.15. The Cantor function shows that the previous corollary does not hold if we replace everywhere differentiability in E with G1-a.e. differentiability in E. Another important consequence of Lemma 3.13 is the following.
Lemma 3.16. Let I C 1(S be an interval, let u : I - R be a Lebesgue measurable function, and let E C I be a Lebesgue measurable set on which u is differentiable. Then u (E) is Lebesgue measurable and £C1 (u(E)) <
(3.5)
u ' ( x) I dx.
Proof. Step 1: By the properties of the Lebesgue measure we may write E as the union of a set of Lebesgue measure zero and countably many compact sets, precisely,
E= EODUKn, it
where Kn is compact and L1 (Eo) = 0. By the previous corollary C1 (u (Eo))
= 0, while u (Kn) is Lebesgue measurable since u : K -- R is continuous (since differentiable). Hence, u (E) is Lebesgue measurable.
Step 2: Assume that G1 (E) < oo. Fix n E N. For every k E N write
En:= Then
k2-n1
E= UEn, k=1
2 }.
3. Absolutely Continuous Functions
80
and so by the previous lemma 00
00
(Uu(E)) <EI'(u`E.k) ) k
'C1(u(E))=L1
k=1
k=1
00
00
2n,C1(En) _
k2n'i1(.E)+2.1 aF c'(E, k=1
k=1
< E 4. l u' (x) I dx +
k=1
f
V
2 E) <
k_1
Iu' (x) I ax +
V2 E)
and it suffices to letn -->oo. Step 3: If G1(E) = co, for every k E Z write
Ek := En[k,k+i]. Then by the previous step applied to Ek we have 00
G1 (u (E)) =
5
G1 (14
Gl (u (Ek)) k=-oo
k 00
f Iu' (x)I dx = f Iu' (x)I
< k=-00
dx,
E
Ek
0
and the proof is complete.
Remark $.17. Let I C R be an interval and let u : I -p R. If u is differentiable on a interval [a, b] C I, then, in particular, it is continuous on [a, b], and so u ([a, b]) contains the interval of endpoints u (a) and u (b). Hence by (3.5),
fb [u (b) - u (a)I < Z' (u ((a, b))) <_
Ja
Iu' (x) I dx.
We now turn to the proof of Theorem 3.12.
Proof of Theorem 3.12. Step 1: Assume that u satisfies (i)-(iii) and fix [a, b] C L We claim that u belongs to AC ([a, b]). Let {(ak, bk)}k be a finite number of nonoverlapping intervals of [a, b] and let Ek :_ {x E (ak, bk) : u' (x) exists}
.
By (ii), G1((ak, bk) \ Ek) = 0, and so by (iii), G1 (u ((ak,bk), Ek)) = 0. Since u is continuous, by the intermediate value theorem it assumes all values between u (ak) and u (bk), and so the open interval of endpoints u (ak) and
3.1. AC (I) Versus BPV (1)
81
u (bk.) is contained in u ((ak, bk)). Therefore by Lemma 3.16, V (u ((ak, bk))) =
Iu (bk) - u (ak)I <
L1 (u ('rk))
k
k
k bk
k
Ek
lu'(x)Idx=E J In'(x)Id1. k
ak
Since, by (ii), u' is Lebesgue integrable in (a, b), in view of Exercise 3.11, u' is equi-integrable in [a, b]. Hence, given e > 0, we may find S > 0 such that if E (bk - ak) S b, then f bk [u' (x)I dx < e. The absolute continuity of u k
in [a, b] follows from the previous inequality.
Step 2: Conversely, assume that u E ACID (I). Fix [a, b] C I. By Proposition 3.8 and Corollary 2.23, u is differentiable G'-a.e. in [a, b) and n' is Lebesgue integrable in [a, b]. It remains to show that u satisfies property (iii). Thus, fix a Lebesgue measurable set E C [a, b] with L' (E) = 0. Fix s > 0 and let 6 > 0 be as in Definition 3.1. Since ,+C1(E) = 0, we may find an open set A D E such that ,C1(A) < 6. Decompose A n [a, b] into a countable family {Jk} of pairwise disjoint intervals. Since n is continuous, for every k we may find ak, bk E Jk such that
u (ak) = m u (x) ,
n (bk) = m x u (re),
so that u (Jk) = [n (ak) , n (bk)]. Using the fact that 4 1 (A)
6, we have
that 1: Ibk - ak[ < 6, k
and so, by the absolute continuity of u and Remark 3.2,
E Iu (bk) - u (ak)I < s. A:
Hence,
£' (u (E)) :5 C' (u (A n [a, b]))
(u (Jk)) < k
G1 k
1u (Jk))
_ J:/1 ([u (ak) , u (bk)]) k
Iu (bk) - u (ak) I < E. k
Given the arbitrariness of s > 0, we conclude that .C' (u (E)) = 0.
0
Remark 3.18. Note that since the sets Ek defined in the first part of the proof are Borel sets (why?), the previous theorem continues to hold if in place of the (N) property we only require that u map Borel sets of Lebesgue measure zero into sets of Lebesgue measure zero.
3. Absolutely Continuous Functions
82
Remark 3.19. Note that the Cantor function does not satisfy the (N) property since it sends a set of Lebesgue measure zero, the Cantor set D, into the full interval 10, 1].
Exercise 3.20. Let u : [a, b] -+ R be continuous and strictly increasing. Prove that u is absolutely continuous if and only if it maps the set
E:= {xE [a, b) : u'(x)=oo} into a set of Lebesgue measure zero.
Exercise 3.21. Let u
[a, b) - R be continuous and strictly increasing.
Prove that its inverse u-1 [u (a), u (b)] -- R is absolutely continuous if and only if the set E := IT. E [a, b]
0}
has Lebesgue measure zero.
In view of Remark 3.17 and Step 1 of the proof of Theorem 3.12, we have the following.
Corollary 3.22. Let I C R be an interval. If u : I -' R is everywhere differentiable in I and u' E L10C (I), then u belongs to ACIor (1).
Exercise 3.23. Prove that if u : [a, b] -+ R is continuous, differentiable on [a, b] except for at most a countable number of points, and if u' is Lebesgue integrable, then u belongs to AC ([a, bl).
Corollary 3.24. Let I C R be an interval and let u : I - R be such that (i) u is continuous on I, (ii) u is differentiable £1-a.e. in I, and u' belongs to Ll10 (I) and is equi-integraabte,
(iii) u maps sets of Lebesgue measure zero into sets of Lebesgue measure zero.
Then u belongs to AC (I).
Proof. It is enough to repeat Step 1 of the proof of Theorem 3.12 word for word, with the only differences that la, b] should be replaced by I and that Exercise 3.11 is no longer needed, since, by (ii), u' is assumed to be equi-integrable.
0
Remark 3.25. Note that if I is a bounded interval, then u : I -> R belongs to AC (I) if and only if (i)-(iii) of the previous corollary hold. Indeed, if u E AC (I), then by Corollary 3.9, u' is integrable, and so equi-integrable by Exercise 3.11. Thus, property (ii) of the previous corollary holds. Properties (i) and (iii) follow from Theorem 3.12.
3.1. AC (I) Versus BPV (1)
83
We will prove later on (see Corollary 3.41) that conditions (i)-(iii) in the previous corollary are actually necessary and sufficient for u : I -' R to be absolutely continuous. The next corollary will be useful in the study of Sobolev spaces in Chapter 7. Corollary 3.26. Let I C Ill` be an interval and let u : I -> R be such that
(i) u is continuous on I, (ii) u is differentiable £1-a.e. in I, and u' E L"(I) for some 1 < p < 00,
(iii) u maps sets of Lebesgue measure zero into sets of Lebesgue measure zero.
Then u belongs to AC (I),
Proof. In view of the previous corollary, it remains to show that u' is locally Lebesgue integrable and equi-integrable. The fact that u' is locally Lebesgue integrable follows by Holder's inequality, while equi-integrability follows from Exercise 3.11. 0
As a consequence of Theorem 3.12 we can characterize those functions with locally bounded pointwise variation that are locally absolutely continuous functions. Precisely, we have the following result.
Corollary 3.27. Let I C R be an interval. A function u : I - R belongs to ACI.,, (I) if and only if (i) u is continuous on I, (ii) u E BPV0, (I), (iii) u maps sets of Lebesgue measure zero into sets of Lebesgue measure zero.
Proof. In view of Corollary 2.23 we are in a position to apply Theorem 3.12.
The next exercise gives an example of a function that satisfies the (N) property, but it is not of bounded pointwise variation in any interval of (0,1).
Exercise 3.28. Let {(a,,, b s)} be a base for the topology of (0,1) and let be a sequence of positive numbers such that E°°_1 r < oo. We construct inductively a sequence of functions tin : [0, 11 -> 1I and a sequence of intervals (c,,, 4) as follows. Let no (x) := x. Assume that [0,1] - R has been defined and that u, is a continuous piecewise affine function. Let (c,,, be an interval such that un_1 restricted to (c,,, d.,) is linear C (a,,,
3. Absolutely Continuous Functions
84
and C1 (un_1 ((cn,dn))) < rn. We define the continuous function u, to be u,,_1 outside (c, dn), while in (c,,, dn) we define it as a continuous piecewise un > ra. affine function such that G1 (un ((c,a, dn))) < rn and
(1) Prove that {un} converges uniformly to a continuous function u : [0,1] -+R. (ii) Prove that for every interval [a, b] C (0, 1) with a < b, Varla,b] u = 00.
(iii) Prove that u has the (N) property. Hint: Let 00
00
En := (c , dn) \
Eo := [0,1] \ U (ci, di) ,
U (c, di) , i=n+1
i=1
and
00
E00 :
00
f 1 U (Ci,)
n=1i=n
For every set E C [0, 1], with £1 (E) = 0, write 00
E=(EnE00)UU(EnEn). n=0
Exercise 3.29 (The Cantor set and the (N) property). Let D be the Cantor set. (i) Prove that every number x E [0, 21 can be written as 00
x=2E n=1
where cn E {0, 1, 2}, and deduce that every element in [0, 21 can be written as the sum of two elements of D.
Prove that if v : D -> R is continuous and 1C1 (v (D)) = 0, then v can be extended to a continuous function on [0,1] that has the (N) property. Hint: Make v differentiable outside D. (iii) For each x E D write (u)
00
--n (x)
x=2 n=1
3n
where c,, E {O, 1} and prove that there exist two continuous functions ul : [0, 11 - R and u2 : [0, 1] -, R with the (N) property and such that for all x E B, 461 (X)
_ F C2n3n(x) n=1
,
262 (x)[, 00_ j 3n (x) n=1
(iv) Prove that ui + U2 does not have the (N) property.
3.1. AC (I) Versus BPV (1)
85
(v) Why is this example important for absolute continuity? We now show that absolutely continuous functions can be characterized as the family of all functions for which the fundamental theorem of calculus holds (for the Lebesgue integral).
Theorem 3.30 (Fundamental theorem of calculus). Let I C R be an interval. A function u : I -> R belongs to ACID, (I) if and only if
(i) u is continuous in I, (ii) u is differentiable G1-a.e. in I, and u' belongs to L'10l (I), (iii) the fundamental theorem of calculus is valid; that is, for all x, xo E I,
u (x) = u (XO) + f x u' (t) dt.
The proof hinges upon on a preliminary result, which is of independent interest.
Lemma 3.31. Let I C 11 be an interval and let v : I -> R be a Lebesgue integrable function. Fix xo E 1 and let x
U (X) :=
Jz:V(t) dt,
Then the function u is absolutely continuous in I and u' (x) = v (x) for G1-a.e. x E I. Proof. The facts that u is absolutely continuous and differentiable for G1a.e. x E I follow from Exercise 3.11 and Proposition 3.8, respectively. In the remainder of the proof we show that u' (x) = v (x) for Ll-a.e. x E I. Step 1: Assume first that v = xE for some Lebesgue measurable set E C R. Fix a bounded open interval J C I containing xa in its closure. We claim
that
u'(x)=1 forLl-a.e. xEEf1J. By the definition of Lebesgue outer measure we may find a decreasing sequence {U,,} of open sets such that Un ) E fl J and (3.6)
,C1(UU\(EflJ))=0, whereUU:= flUn. n=1
By replacing Un with Un fl j, we may assume that U. C J. Define
f Xu (t) dt, a
un (x)
x E J.
3. Absolutely Continuous Functions
86
Since U1 C J, which is bounded, we are in a position to apply Lebesgue's dominated convergence theorem and (3.6) to conclude that for all x e J,
urn nn (x) n m Jxu(t) dt = Jxu. y =
(t) dt
o
o
f XEnJ (t) dt = J x
px
x0
xo
XE (t) dt = u (x)
where in the fourth equality we have used the fact that the open interval of endpoints x and xo is contained in J. Hence, in the interval J we may write u in terms of the telescopic series 00
2a = 261 + E (un+1 - un) . n=1
Note that since U. D U,a+1, (un - un+1) (x) =
(t) dt,
x E J,
xo
and since 0, the function un - tan+1 is monotone in the intervals (-oo, xo)nJ and [x0, oo, )nJ. By F ubini's theorem (applied in each interval)
we get that for 41-a.e. x E J, 00
4L' (x) = ti (x) + E lun+l (x) -'un (x)) n=1
= n noun
(x) .
On the other hand, if x E Un, then u;, (x) = 1 (why?), and so, if x E U"., then un (x) = 1 for all n E N. Hence, we have proved that u' (x) = 1 for ,C1-a.e. X E Uo and so, in particular, for £1-a.e. T E E fl J. Next we show that u' (x) = 0 for G1-a.e. x E J \ E. Since for all x E J, a
x
XE (t) dt =
U (x) = ITO
L.
(1
- XJ\E) (t) dt,
by applying what we just proved to X.\E, we conclude that u' (x) = 1-1 = 0 for G1-a.e. x E J \ E. Thus, 26' (x) = XE (x) for G1-a.e. x. E J. By letting
J / I, we obtain the same result in I. Step 2: By the linearity of the derivatives and Step 1 we conclude that if v is a simple function, then u' (x) = v (x) for C'-a.e. x E I. If v is a nonnegative Lebesgue measurable function, then we may construct an
'
increasing sequence {sn} of nonnegative simple functions such that s,, (x) v (x) for Cl-a.e. x r= I. Then by Lebesgue's dominated convergence theorem for all x E 1, lim
n-+°0
f8(t) dt = Jv(t) dt = u (x) , x o
o
87
3.1. AC (I) Versus BPV (1)
and so we may proceed as in the first step (using telescopic series) to show that u' (x) = v (x) for L1-a.e. x E 1. In the general case, it suffices to write v = v+ - v-. We are now ready to prove Theorem 3.30.
Proof of Theorem 3.30. Assume that u E ACID, (I). In view of Theorem 3.12, it remains to prove (iii). Let [a, b] c I be so large that xo E [a, b] and define
w (x) = u (x) - (u(a)
+ 1.00 U' (t)
dt)
,
x E [a, b] .
By Lemma 3.31 and Theorem 3.12, there exists a Lebesgue measurable set
E C [a, b], with ,C1 (E) = 0, such that for all x E [a, b] \ E the function w is differentiable at x and w' (x) = 0. By Corollary 3.14 we have that ,C1 (w ([a, b] \ E)) = 0. On the other hand, since to is absolutely continuous in [a, b] (see Exercise 3.6 and Lemma 3.31), by Theorem 3.12 it sends sets of Lebesgue measure zero into sets of Lebesgue measure zero, and so G1 (w (E)) = 0. Thus, we have shown that ,C' (w ([a, b])) = 0. But since to is a continuous function, by the intermediate value theorem w ([a, bJ) is either a point or a proper interval. Thus, it has to be a point. In conclusion, we have proved that to (x) = const. Since to (xo) = 0, it follows that to = 0, and so (iii) holds for all x E [a, b]. Given the arbitrariness of [a, b], we have that (iii) holds for all x E I. Conversely, assume that (i)-(iii) are satisfied. Then again by Lemma 3.31, u belongs to ACID, (I) and the proof is complete. The next corollary follows from the previous theorem and Corollary 3.22.
Corollary 3.32. Let I C R be an interval and let u : I -- R be everywhere differentiable. I f u ' E L10C (I), then for all x, xo E I, U (X) = U (X0) + j u' (t) dt. :ox
Using the previous corollary, we are in a position to complete the proof of the Katznelson-Stromberg theorem. We begin with some well-known results on Riemann integration.
Exercise 3.33 (Riemann integration, I). Let u : [a, b] -p R be a bounded function and for x E [a, b] define
w(x)
.
allies sup{Iu(xl) -u(x2)I : xlox2 E [a,b], IXl - xI < 6, Ix2 - XI <- b}.
(i) Prove that u is continuous at x E [a, b] if and only if w (x) = 0.
S. Absolutely Continuous Functions
88
(ii) Prove that if the set E :_ {x r= [a, b] : u is discontinuous at x.}
has positive Lebesgue outer measure, then there exists a constant a > 0 such that the set
E1:={xEE: w(x)>a} has positive Lebesgue outer measure.
(iii) Let t = C1(E1) > 0 and prove that for every partition P the intervals containing points of El in their interior have total length greater than or equal to t. (iv) Deduce that if u is Riemann integrable, then E has Lebesgue measure zero.
Exercise 3.34 (Riemann integration, II). Let u : [a, b] -> R be a bounded function.
(i) Prove that if g : [a, b] -* R is Lipschitz and 9'(x) = 0 for £1-a.e. x E [a, b], then g is constant. (ii) Let x a
u t dt-
t dt a
a<x
a
where fax and fQ are the upper and lower Riemann integrals. Prove that g is Lipschitz. (iii) Prove that if u is continuous at x, then g is differentiable at x and g' (x) = 0. (iv) Deduce that if u is continuous GL-a.e. in [a, b], then u is Riemann integrable.
Proof of Theorem 2.26, continued. We claim that ua' cannot be Riemann integrable on any closed interval (a, b]. Indeed, by the previous exercises, this would imply that u' is continuous except for a set of Lebesgue outer measure zero. But, since u is nowhere monotone, if u' is continuous
at x, then necessarily u' (x) = 0. Hence u' = 0 41-&.e. on (a, b). By the previous corollary, we would get that u is a constant in [a, b], which is a contradiction.
Remark 3.35. Note that the function constructed in Theorem 2.26 satisfies the hypotheses of Corollary 3.32. Hence, it provides an example of a differentiable function for which the fundamental theorem of calculus holds for Lebesgue integration but not for Riemann integration.
3.1. AC (I) Versus BPV (1)
89
Exercise 3.36. Let I C R be an interval and let f : I -* ][8 be a convex function.
(i) Prove that the left and right derivatives f L (x) and f+ (x) exist in
Rfor all xE1°. (ii) Prove that the functions f'_ and f+ are increasing. (iii) Prove that
1(v)_f (x) =
(3.7)
IV
f' (t) dt =
x
Jx
V
f+ (t) dt
for allx,yEIwith x
Corollary 3.37 (Integration by parts). Let I C ][8 be an interval and let it, v E ACIOC (I). Then for all x, xo E I,
J
y uv'
dt = it (x) u (x) - u (so) v (xo) - 1.0x u'v dt.
Proof. Since u, v E ACI°, (I), by Exercise 3.6, uv E ACIuo (1), and thus, by part (iii) of Theorem 3.30,
u(x)v(x) -u(xo)v(sO) = L0(uv)' dt. Since the functions it, v, and uv are differentiable G1-a.e. in I, the standard calculus rule for a product now gives the desired result. Another consequence of Theorem 3.30 is the following result, which says that for monotone functions, to prove absolute continuity in a fixed interval [a, b], it is sufficient to test the fundamental theorem of calculus only at the endpoints a and b.
Corollary 3.38 (Tonelli). Let I C 18 be an interval, let is . I -- R be a monotone function, and let [a, b] C I. Then u belongs to AC ([a, b]) if and only if fb
lie (x) l dx = ju (b) - u (a) ]
.
Moreover, if it is bounded, then u belongs to AC (I) if and only if
J
dx = sup u - inf u.
I
3. Absolutely Continuous Functions
90
Proof. Without loss of generality we may assume that u is increasing. Step 1: If u E AC ([a, b] ), then by Theorem 3.30 we have (3.8)
b
ta x dx = u b
ua
a
Conversely, assume that (3.8) holds and let w (x) :=
x u' (t) dt,
J
x E [a, b] .
a
If a < x < y:5 b, then by Corollary 1.37, w (y) - w (x} =
(3.9)
u' (t) dt < u (y) - u (x),
J
and so the function u - w is increasing in [a., bJ. But by (3.8),
u(b) -u (a) =
JJ.a
t/ (x) dx = w (b) - w (a),
and so (u - w) (b) = (u - w) (a). This implies that the increasing function u - w must be constant in [a, bJ. Since w E AC ([a, b]) by Lemma 3.31, it follows that u E AC ([a, b]).
Step 2: If u E AC (I), then by the previous step for every inf I < a < b < sup I, we have rb
J u'(x)dx=u(b)-u(a). a
Letting a - (inf I)+ and b -, (sup I)- and using the Lebesgue monotone convergence theorem and the fact that u is continuous and increasing gives
U' (x) dx = sup u - i if u. I.; I Conversely, assume that (3.10) holds. Then u' is Lebesgue integrable. Moreover, by Exercise 1.39, u is continuous in I. Fix c E R and define (3.10)
W (x) := c +
f u' (t) dt,
x E I.
inf I
As in the previous step we have that u - w is increasing (and bounded)
and that (3.9) holds for all inf I < x < y < sup I. Letting x - (inf I)+ and y - (sup I)- in (3.9) and using the Lebesgue monotone convergence theorem, the monotonicity and the continuity of u and to, we obtain that supI
lim
u (x) -
lim
r-4 (sup I)(inf f )+
u (x)
fi. f I
u' (x) dx
lim X--+ (sup I)
W (X) -
lim x-+(inf I)+
w W,
3.1. AC (I) Versus BPV (1)
91
and so, since u - w is increasing and continuous, urn I) _ (u (x) - w (x))
sup (u (x) - w (x)) = XE'r
lim
(u (x) - w (x))
a--.(inf I)+
_ inf (u (x) -w(x)), xE1
which implies as before that u - w must be constant. By choosing c appropriately, we have that u = w, and so u belongs to AC (I), since w does (see Lemma 3.31). Since a function with bounded pointwise variation is the difference of two bounded monotone functions, the previous corollary implies the following result.
Theorem 3.39 (Tonelli). Let I C R be an interval, let u r= BPYOC (I), and let [a, b] C I. Then u belongs to AC ([a, bJ) if and only if frb
(3.11)
lu'
I dx = Var(Q,b] u.
a
In addition, if u belongs to BFV (I), then u belongs to AC (I) if and only if
I
(3.12)
lull dx = Var u.
Proof. Step 1: Let V be the increasing function defined in (2.2). By (2.12), (3.13)
Ja
b
lull dx < J b IV'I dx < V (b) - V (a) = Var1d,b1 U. a
Hence, if
jb .
Jul I dx = Var[a,b] u,
d
then all the previous inequalities are equalities, and so
f IV'I dx=V(b)-V(a). Since V is increasing, it follows by Corollary 3.38 that the function V belongs to AC ([a, b)). In view of (2.3), Iu(bk) - u(ak)I k
and so u E AC ([a, b]).
< > IV (bk) - V (ak)I, k
3. Absolutely Continuous Functions
92
Conversely, if u E AC ([a, bJ), then by Theorem 3.30 for every partition of [a,b],
E Iu (xi) - u (xi-1)I = i=1
i=1
f
xi
px;
4s1 dx <_ i=1
`-1
J
b
u'I dx =
sc-i
Ja
u' dx.
Taking the supremum over all partitions, we get b
lu'I dx,
Var[a,b1 u < a
which, together with (3.13) yields the desired equality.
Step 2: Assume that u E BPV (I). Then by (2.10),
I,
lu'(x)I dx <
JI
IV'(x)I dx <supV -inf V = Varu, F
and so if (3.12) holds, then
I.
IV'(x) I dx=supV - inf V. I
I
In turn, by the previous corollary, V is absolutely continuous. As in the previous step we conclude that u is absolutely continuous. Conversely, if u E AC (I), then by the previous step (3.11) holds for every [a, b] C I. If inf I E I, define an := inf I, and otherwise construct a sequence a, \ inf I. Similarly, if sup I E I, define b,, :- sup I, and otherwise construct a sequence bf, / sup I. It suffices to apply the previous step in [a1z, b,,) and then to let n -- oo using Proposition 2.6 and the Lebesgue monotone convergence theorem.
0
Remark 3.40. From the previous proof it follows that if I C R is an interval, (a, b) C I, and u E BPV0, (I) (respectively, BPV (I)), then u E AC ([a, bJ) (respectively, AC (1)) if and only if V E AC ([a, b]) (respectively,
V E AC (I)).
As a consequence of Tonelli's theorem we can prove the converse of Corollary 3.24.
Corollary 3.41. Let I C R be an interval and let u : I -+ R. Then u belongs to AC (1) if and only if
u is continuous on I, (ii) u is differentiable .C1-a.e. in I, and u' belongs to L'10i (I) and is (i)
equi-integrable, u maps sets of Lebesgue measure zero into sets of Lebesgue measure zero.
3.1. AC (I) Versus BPV (1)
93
Proof. In view of Theorem 3.12 and of Corollary 3.24, it remains to show
that if u E AC (I), then u' is equi-integrable. By Exercise 3.7 we may assume, without loss of regularity, that I is closed. Fix s > 0 and let 6 > 0 be as in Definition 3.1. Consider a Lebesgue measurable set E C 1, with L1 (E) < '6. By the outer regularity of the Lebesgue measure we may find an open set A D E such that Ll (A) < J. Decompose A into a countable family {Jk} of pairwise disjoint intervals. By replacing each JA.' with Jk fl I, we may
assume that Jk C I. Let Wk = [ak, bk]. Using the fact that C1 (A) < 6, we have that 1: Ibk - ak] < d. k
Consider a partition Pk = xOk), ... , x '.k } of [ak, bk] . Since x(k) k
i=1
- x`kll
=>Ibk-ak] <8,
k
it follows from the fact that u e AC (I) that
r k
»rZk
u l xik
i=1 lu
i) < e.
Taking the supremuln over every partition Pk of [ak, bk] for each k, we have
that V [ak,bk] u < s.
Hence, by Tonelli's theorem applied to each interval [ak, bk],
lu'I dx < f E
lu`I
A
This concludes the proof.
dx = k
f
[ak,bk]
lu'I d x =
Var[ak,bk] u < - rk
D
In the discussion before Exercise 3.7 we have shown that an absolutely continuous function defined in an unbounded interval may not have bounded pointwise variation. As a corollary of the previous theorem we can now characterize the absolutely continuous functions that have bounded pointwise variation.
Corollary 3.42. Let I C R be an interval and let u E ACID, (I). Then u belongs to BPV (I) if and only if u' belongs to Li (I). In this case u belongs to AC (I).
Proof. In view of Corollary 2.23, it remains to show that if u' is Lebesgue integrable, then u belongs to BPV (I). By Proposition 3.8 we have that
3. Absolutely Continuous Functions
94
u r= BPVOC (I). Hence by the Theorem 3.39, for every [a, b] C I, fpb
I2a' I dx = Var[a,bi U. a
Taking a and b as in Step 2 of the proof of Theorem 3.39 and using Proposition 2.6 (note that in that proposition the function u is completely arbitrary), Exercise 2.8, and the Lebesgue monotone convergence theorem, we have that Ii/I dx = Var1 u. Since u' is Lebesgue integrable, it follows that Var j u < 00. The last statement follows from Corollary 3.26.
Exercise 3.43. Let p > 1 and let AC, ([a, b]) be the class of all functions u : [a, b] -+ R such that for every e > 0 there exists 5 > 0 such that 1/p
g
(Iu(bk) - u (ak.)IZ'
<E
k=1
for every finite number of nonoverlapping intervals (ak, bk), k with [ak, bk] C I and 1/p
((bi._ak)9)
< d.
k=1
(1) Prove that if u E ACp ([a, b]), then Varp u < oo (see Exercise 2.29).
(ii) Prove that the function 00
u (x) = E n=0
1
/p
cos 2 irx,
x E [0,1] ,
is such that Varp u < oo, but it does not belong to ACp (10, 11).
3.2. Chain Rule and Change of Variables Next we discuss the validity of the chain rule and of the change of variables for absolutely continuous functions. The next result establishes the validity of the chain rule under very weak hypotheses.
Theorem 3.44 (Chain rule). Let I, J C R be two intervals and let f : J R and u : I -> J be such that f, u, and f o u are differentiable G1-a.e. in their respective domains. If f maps sets of Lebesgue measure zero into sets of Lebesgue measure zero, then for G1-a.e. x E I,
(f o u)' (x) = f (u (x)) u' (x) , where f' (u (x)) u' (x) is interpreted to be zero whenever n' (x) = 0 (even if f is not differentiable at u (x)). (3.14)
3.2. Chain Rule and Change of Variables
95
In the proof we will show that (f o u)' (x) = 0 and u' (x) = 0 for £1-a.e. x E I such that f is not differentiable at u (x). To prove Theorem 3.44, we need an auxiliary result, which is a converse of Corollary 3.14.
Lemma 3.45. Let I C l[t be an interval and let u : I -p R. Assume that u has derivative (finite or infinite) on a set E C I (not necessarily measurable), with £1(u (E)) = 0. Then u' (x) = 0 for C1-a.e. X E E.
Proof. Let E* := {x E E : Iu' (x) I > 0}. We claim that Ll (E') = 0. For every integer k E N let
Ek:= {xEE*: Iu(x)-u(y)I? Ixkvl for all yE (x-k,x+ I)nI}. Noting that 00
E*=UEl, k=1
we fix k and we let F:= J fl Ek, where J is an interval of length less than To prove that £1(E") = 0, it suffices to show that ,C' (F) = 0. Since
C1(u (E)) = 0 and F C E, for every e > 0 we may find a sequence of intervals { Jn} such that 00
00
u(F) C U Jn, E V (.fin) < n=1
n=1
Let E. := u-1(Jn) n F. Since {En} covers F, we have 00
00
Go (F) E 40 (En) C E sup Ix - T!I n=1 x,yEE.
n=1 00
k sup Iu(x) -u(y)I =:I, n=1
x,yEE
where we have used the fact that En c J n E. Since u (En) C Jn, we have sup Iu (x) - u (y) I <_ L' (Jn) ,
x,yE E,,
and so
00
I
,C1 (Jn) < ke. n=1
It now suffices to let a - 0+.
Corollary 3.46. Let I C R be an interval and let u : I -+ R, v : I -* R. Assume that there ea,*£sts a set E C I such that u and v are differentiable for
all x E E and u (x) = v (x) for all x. E E. Then u' (x) = v' (x) for G1-a.e.
xEE.
3. Absolutely Continuous Functions
96
Proof. Let to := u - v. Then w (E) = {0}, and so Gl (w (E)) = 0. By the previous lemma, u' (x) - v' (x) = w' (x) = 0 for £'-a.e. x E E. We turn to the proof of Theorem 3.44.
Proof of Theorem 3.44. Let G
F
{z E J : f is not differentiable at z} , {x E I : u or f o u is not differentiable at x} .
By hypothesis £1 (G) = ,C' (F) = 0. Let
E:={xEI°\F: u(x)EG}. Since u (E) C G, we have C' (u (E)) = 0, and since f maps sets of Lebesgue measure zero into sets of Lebesgue measure zero, we obtain that
C1((fou)(E))=0. By Lemma 3.45 applied to u and to f o u, we conclude that
u'(x)=(fou)'(x)=0 for L1-a.e. x e E. On the other hand, if x E I° \ F and u (x) % G, then we may apply the standard chain rule to conclude that f o u is differentiable at x with (f o u)' (x) = f' (u (x)) u' (x). The next example shows the importance of the (N) property. Example 3.47. Let u : [0,1] -+ ]Il; be a strictly increasing function such that u' (x) = 0 for C1-a.e. X E [0, 1] (see Theorem 1.47) and let f := u-1. Note that f is strictly increasing, and so by Lebesgue's theorem it is differentiable for G1-a.e. x E [0, 1], despite the fact that u' (x) = 0 for ,C1-a.e. x E [0, 1].
Moreover, (f o u) (x) = x for all x E [0, 11, and so (f o u)' (x) = 1 for all x E 10, 11, while f' (u (x)) if (x) = 0 for G1-a.e. x E [0, 11, since if (x) = 0 for G1-a.e. x E [0,11.
Corollary 3.48. Let I, J C R be two intervals and let f : J - k and u : I - J be such that f and u are differentiable G1-a. e. in their respective domains. Suppose that if is zero at most on a set of Lebesgue measure zero. Then f o u is differentiable G1-a.e. in I and the chain rule (9.14) holds. Proof. Let G and F be as in the proof of Theorem 3.44 and let
E:={xEI°: u(x)EG}. Since u (E) C G, we have G1 (u (E)) = 0, and so by Lemma 3.45 we conclude
that u' (x) = 0 for ,C1-a.e. x E E. But then, according to our assumption that u' is zero at most on a set of Lebesgue measure zero, E must have
3.2. Chain Rule and Change of Variables
97
Lebesgue measure zero. If x E I° \ E, then f is differentiable at u (x), and so the chain rule (3.14) holds.C1-a.e. in I° \ E.
Corollary 3.49. Let 1, J C K be two intervals and let f : J -+ R and u : I - J be such that u and f o u are differentiable £1-a.e. in their respective domains. If f E ACIoc (J), then the chain rule (3.14) holds.
Proof. In view of Theorem 3.12, all the hypotheses of Theorem 3.44 are satisfied.
A less trivial consequence of Theorem 3.44 is the following result.
Corollary 3.50. Let I, J C R be two intervals, let f E ACi0 (J), and let u : 1 - J be monotone. Then f o u is differentiable £1-a.e. in I and the chain rule (3.14) holds.
Proof. Note that the composite f o u belongs to BPYOC (I) by Exercise 2.21, and so by Corollary 2.23, f o u is differentiable L 1-a.e. in I. We are now in a position to apply the previous corollary.
Exercise 3.51. Let I, J C P be two intervals, let f E AC1oc (J), and let u : I -> J be monotone and AC1, (I). Prove that f o u belongs to ACro, (I).
Corollary 3.52. Let 1, J C R be two intervals, let f : J -, H be locally Lipschitz, and let u E BPVIOC (I). Then f o u is differentiable G1-a.e. in I and the chain rule (8.14) holds.
Proof. By Theorem 2.31, we have that f o u c- BPVI c (1). Hence we can apply Corollary 2.23 to conclude that f o u is differentiable G1-a.e. in I. Since f is locally Lipschitz, it is locally absolutely continuous, and so the result follows from Corollary 3.49.
Before moving to the next topic, we observe that while all the results proved before Theorem 3.44 continue to hold in AC (I; Rd) (respectively, AC1oc (I; Rd)) (see Chapter 4), this is not the case for Theorem 3.44 and its corollaries. Indeed, if f : Rd - R is a Lipschitz continuous function with d > 1 and if u : I -r Rd is absolutely continuous, then f o u E AC (1) (see Step 1 of the proof of Theorem 3.68 below), but the analog of (3.14), which is d
(3.15)
(f o t)I (x) _
u (u' (xW)'ud (x)
where - (u (x)) ui (x) is interpreted to be zero whenever ui (x) = 0, may fail. This is illustrated by the next example.
3. Absolutely Continuous Functions
98
Example 3.53. Let d = 2, and consider the functions f (z) = f (zl, z2) := max {z1, Z21,
z E R2,
and u (x) := (x, x) for x E R. Then v (x) := (f o u) (x) = x so that v' (x) _ 1, while the right-hand side of (3.15) is nowhere defined, since u' (x) = (1, 1).
We will discuss this problem in more detail at the end of Section 4.3. As a corollary of Theorem 3.44 we have the following change of variables formula.
Theorem 3.54 (Change of variables). Let g : [c, d] -p R be an integrable function and let u : [a, b] - [c, d] be differentiable £'-a. e. in [a,b]. Then (g o u) u' is ir&tegrable and the change of variables (6)
(3.16)
J
g (t) dt
g (u (x)) u' (x) dx
holds for all a, f3 E [a, b] if and only if the function f ou belongs to AC ([a, b]), where
f (z) := f z 9 (t) dt,
z E [c, d] .
c
Proof. If f o it e AC ([a, b]), then since f is absolutely continuous (see Lemma 3.31), we can apply Corollary 3.49 to obtain the chain rule formula (3.17)
(f o u)' (x) = g (u (x)) u' (x) for G1-a.e. x E [a, b]. Since f o u E AC ([a, b] ), it follows from Corollary 3.9 and (3.17) that (g o u) u' is integrable, and by the fundamental theorem of calculus (see Theorem 3.30), for all a, 0 E [a, b], -(0)
4u(«) g (t) dt = (f o u) (f3) - (f o u) (a) = 1 (f o u)' (x) dx = J 9 (u (x)) u' (x) dx. Q
Conversely, if (g o u) u' is integrable and the identity (f o u) (f3) - (f o u) (a) =
f
R
a
g (u (x)) u' (x) dx
holds for all a, (3 E I, then, since the right-hand side is absolutely continuous 0 by Lemma 3.31, it follows that f o u is absolutely continuous.
Remark 3.55. The previous proof shows, in particular, that the function x E I -- g (u (x)) u' (x) is measurable (see also Exercise 1.41), since it is the derivative of the function f o u, but this does not imply that the function x E I'- g (u (x)) is measurable (see the next exercise).
3.2. Chain Rule and Change of Variables
99
Exercise 3.56. Let I, J C l1. be intervals. Prove that there exist a continuous increasing function u : I -> J and a Lebesgue measurable function g : J -p R such that g o u = I -, R is not Lebesgue measurable. Hint: See Exercise 1.45.
Corollary 3.57. Assume that g : Jc, dJ - R is an integrable function and that u : [a, b] --+ [c, d] is monotone and absolutely continuous. Then (g o u) u' is integrable and the change of variables formula (3.16) holds.
Exercise 3.58. Prove that under the hypotheses of the previous corollary the function f o u is absolutely continuous and then prove the corollary.
Corollary 3.59. Assume that g : [c, d] --> R is a measurable, bounded function and that u : [a, b] - [c, ci] is absolutely continuous. Then (g o u) u' is integrable and the change of variables formula (3.16) holds.
Exercise 3.60. Prove that under the hypotheses of the previous corollary the function f o u is absolutely continuous and then prove the corollary.
Corollary 3.61. Assume that g : [c, d] - R is an integrable function, that u : [a, b] - [c, d] is absolutely continuous, and that (g o u) u' is integrable. Then the change of variables formula (3.16) holds.
Proof. Let
n gn (z) :=
g (z)
I -n
if g (z) > n,
if - n < g (z) < n, if g (z) < -n.
Applying the Lebesgue dominated convergence theorem and the previous corollary, we obtain rn fUW) g (z) dz = lim gn (z) dz ' '°° Ju(Q)
(")
= slim
f
a
r
gn (u (x)) u' (x) dx
= Ja
(u (x)) u.' (x) dx.
0 To extend the previous results to arbitrary intervals, we consider two functions g : J R and u : I J and we assume that there exist in J the limits Urn
x-(inf I)+
lim
U (X) = P,
u (x) = L.
X--+ (sup 1)
In this case, the analog of (3.16) becomes (3.18)
dt
L g (z) dz =
Indeed, we have the following result.
l
f g (u (x)) u' (x) dx.
3. Absolutely Continuous Functions
100
Theorem 3.62. Let I, J C R be two intervals, let g : J -> R be an integrable function, and let is : I - J be differentiable G1-a.e. in I and such that there exist in R the limits (3.19)
lim u (x) = Q, x-(inf I)+
lim u (x) = L. x-'(sup I)-
Then (g o u) u' is integrable on I and the changes of variables (8.16) and (3.18) hold for all [a, /3] C I if and only if the function f o u belongs to AC (I) fl BPV (I), where
rf
f(z):= Jmz J g(t)dt,
zEJ.
Proof. Assume that f o is E AC (I) fl BPV (I). Then, we can proceed as in the proof of Theorem 3.54 to show that (3.16) holds for all [a, 0] C I. Since f o is E BPV (I), by Corollary 2.23 and (3.17) its derivative (g o u) u' is integrable on I. Hence, by taking limits as a and 6 approach the endpoints of I and using (3.19) and the Lebesgue dominated convergence theorem, we conclude that (3.18) holds. Conversely, if (g o u) u' is integrable and (3.16) and (3.18) hold for all [a, $] C I, then
(f o u) (/j) - (f o u) W=
J
g (u (x)) u' (x) dx
for all a,# E I. As in Theorem 3.54 we deduce that fou E ACI0c {I). In turn, by Corollaries 3.41 and 3.42, it follows that f o is r: AC (I) fl BPV (1). 0
Closely related to the change of variables formula is the area formula, which will be discussed next.
Definition 3.63. Let X be a nonempty set and let 0 : X - [0, oo] be a function. We define the infinite sum of i!i over X as
/ (t) := sup SEX
4' (t) : Y C X finite
.
tEY
Exercise 3.64. Let X be a nonempty set and let 4' : X -' [0, oo] be a function. Prove that if EtEX 0 (t) < oo, then the set
{tEX:4'(t)>0} is countable.
Theorem 3.65 (Area formula). Let I C R be an interval, let 0 : I - [0, oo] be a Borel function, and let u : I - R be differentiable LI-a.e. in 1 and
3.2. Chain Rule and Change of Variables
101
such that u maps sets of Lebesgue measure zero into sets of Lebesgue measure
zero. Then
E 1) (t) dy =
(3.20) dddR
tEu-1({y})
fI
0 (x) lu' (x)I dx.
Proof. Step 1: Assume first that I = (a, b) and that u E C' (I). Consider the open set A :_ {x E I : u' (x) 01 and let {(ak,bk)} be the countable family of connected components of A. If u' > 0 in (ak, bk) and 0 E Loo ((ak, bk)), then by Corollary 3.59 (applied in (ak, bk) to the functions u and g o v, where v (ttI(Okbk))') we get u(bk)
bk
1
j tb (x) u' (x) dx = fu(ak) + ((1LI(O,b))
(3.21)
ll (y))
dy.
k
O n the other hand, since ul(ak
is strictly decreasing and continuous, for bk) every y E (u (ak) , u (bk)) there is one and only one t E (ak, bk) such that u (t) = y, so that (ak, bk) n u-' ({y}) = {t}, while, if y E ]R \ (u (ak) , u (bk)), then (ak, bk) n u-1 ({y}) _ 0. This shows that
f
1
u(bk)
(t) dy = f
(t) dy
u(a,,) tE(ak,bk)nu-1({y})
tE(ak,bk)n*a-1({y})
'++(bk)
=f
( ak )
i ((u) (y)) 1
dy.
Combining this equality with (3.21) gives fk
0 (x) ta' (x) dx =
(3.22)
k tE(ak,bk)nu 1{{y))
0 (t) dy.
To remove the additional assumption that 10 E LO0 ((ak, bk)), it suffices to apply (3.22) to 0,, := min {0, n} and to use the Lebesgue monotone convergence theorem.
A similar argument shows that if u' < 0 in (ak, bk), then bk
ftb(x)Iu'(x)Idx=J k
1:
tP (t) dy.
tE(ak,bk)nu-1({3l})
Adding over k, we obtain fA
i/i (x) I u' (x) I dx =
f
(t) dy tC-Anu-1 Q
)
3. Absolutely Continuous Functions
102
Since u' (x) = 0 in I \ A, by Corollary 3.14, G1 (u (I \ A)) = 0. Hence, the previous equality can be rewritten as
J iP (x) Iu' (x) I dx = J 1u(I\A) tEAlu-1({y})
(t)
dy.
On the other hand, if y E R \ u (I \ A), then
u-1({y}) _ (An u -I ({y})) u ((I \ A) flu 1({y})) = A fl u 1({y}), and so
L\u(l\A) tEAflu -1((y})
i (t) dy
(t) dy = fflt\u(1\A) tEu -1({y))
tEu (W)
(t) dy,
1
where in the last equality we have used the fact that G1 (u (I \ A)) = 0 once more.
This shows that (3.20) holds. Step 2: Assume next that I = (a, b), that there exists a compact set K C I such that i{' = 0 on I \ K, that u is differentiable for all x in K, and that inn
u (y)
yEK,y-'x
-u l/-x
(x) = u' (x)
uniformly for x E K.
Then by Exercise 3.66 below there exists a function v E Q1 (I) such that
v = u and v' = u' on K. Applying the previous step to v and withi replaced by XK',, we obtain
fKh1 dx = f XK (x) V) (x)
I v' (x) I dx
E XK (t)(t) fftEKrW-I([yj)
dy
tEv-1((y))
, (t)
1:
ti (t) dy.
R tEKnu-1({y})
0 on I \ K, we have that (3.20) holds. Step 3: Assume that I = (a, b). Since u is differentiable G1-a.e. in I, the Since
sequence of functions un (x)
sup
I u (y) - u {x)
Y-X
- u' (x)I , x E I,
3.2. Chain Rule and Change of Variables
103
converges to 0 for G1-a.e. x E I. It follows by Egoroff's theorem that there exists an increasing sequence of compact sets {Kj} C I such that ,C1
(o)
=0
and such that {u'} converges to zero uniformly in Kj for every j E W. In particular, u (g) - u (x) = u' (x) uniformly as x E Kj lim &oEKj,y--w
y-x
for all j E N. By the previous step with h 0 replaced by 'XK;,
ii (x) lu' (x) I dx = J
-0 (t) dy. tEKjnu '({y})
Letting j -> oo, it follows by the Lebesgue monotone convergence theorem
that
I
U,
f
ik(x) lu'(x)I dx = 1
Ki
E
ip (f) dy.
tEU,°;°_, Kjnu- I ({y})
Since G1 (I \ U;°_1 Kj) = 0, by hypothesis we have that 00 ,C1
(.u (r\
Kj
I
= 0,
j=1
and so we obtain (3.20).
Step 4: If I is an arbitrary interval, let (a.,, b,) C I be such that a,= (inf I)+, b. -, (sup 1) -. By the previous step, (3.20) holds in each (an, ba). Formula (3.20) now follows in I0 from the Lebesgue monotone convergence
theorem. If one or both endpoints of I belong to I, we can proceed as in last part of Step I to show that (3.20) holds in 1. Choosing tfi (x) := g (u (x)) in (3.20), where g : R -> 10, ooj is a Borel function, yields JRg(y)N.(y;1)
dy=
J(u(x))It/(x)I dx,
where, we recall, N. I) is the Banach indicatrix of u. In particular, for g = 1, we get the analog of Banach's theorem (see (2.48)), that is,
JR N (y; I) dy J u'(x)I dx.
3. Absolutely Continuous Functions
104
Exercise 3.66. Let K C (a, b) be a compact set and let u : K - R be such that u is differentiable on K and lim
yEK,y-yz
u (x) = u' (x) y-x
u (p)
uniformly for x E K.
Prove that there exists a function v : (a, b) -t R, with v E C1 ((a, b)), such that v = u and v' = u' on K. Hint: On each connected component (at., bk) of (a, b) \ K define v to be a suitable third-order polynomial. We conclude this section by discussing the analog of Theorem 2.31. The following exercise (see Exercise 2.30) shows that the composition of absolutely continuous functions is not absolutely continuous (see however Exercise 3.51).
Exercise 3.67. Let f : R --+ R be defined by
ifz<-1,
1
f (z) :=
IzI 1
if - 1 < z < 1, ifz > 1,
and let u : [-1, 1] - R be the function U (X)
.-_
r x2 sin i
0
if x # 0, if x = 0.
Prove that f and u are absolutely continuous but their composition f o u is not.
The next result gives necessary and sufficient conditions on f : R - R for f o u to be absolutely continuous for all absolutely continuous functions
u : [a, b] - R.
Theorem 3.68 (Superposition). Let I C R be an interval and let f : R R. Then f o u E ACIoc (I) for all functions u E ACI,v (I) if and only if f is locally Lipschitz. In particular, if f is locally Lipschitz and u E ACI0, (I), then the chain rule (3.14) holds.
Proof. Step 1: Assume that f is locally Lipschitz and let u E ACtoc (I). Fix an interval [a, b]. In particular, Iul is bounded in [a, b] by some constant e, and so there exists L > 0 such that (3.23)
If (zi) - f (z2)1:5 L Izl - z2I
for all zl, z2 G [-I, UJ. We claim that f o t is absolutely continuous in [a, b]. Indeed, since u E AC ([a, b] ), for every e > 0 there exists b > 0 such that
> Iu (bk) - u (ak) I < k
3.2. Chain Rule and Change of Variables
105
for every finite number of nonoverlapping intervals (ak, bk) C [a, b], with
E(bk - ak) < S. k
Hence, by (3.23),
1: I(fou)(bk)-(f ou)(ak)I
k
which proves the claim. The validity of the chain rule follows from Corollary 3.52. Step 2: Assume that f o u E ACID, (I) for all functions u E ACI,,c (1). We claim that f is locally Lipschitz. The proof follows closely that of Theorem 2.31, with the only difference that instead of discontinuous functions u (see (2.30), (2.35)) we will use piecewise afi ne functions. Fix [a, b] C I. We begin
by showing that f is locally bounded. Consider an interval [-r, r], where r > 0. We claim that f is bounded in [-r, r]. Indeed, for every zo E [-r, r] consider the function
I zo+x-e ifxE[a,b], u (x) :=
zo - 2n
if x < a,
zo+2
ifx>b.
Since u E ACID, (I), by hypothesis (f o u) E AC ([a, b]). In particular, it is bounded in (a, b]. Thus, there exists a constant M,, = M,,, (a, b) > 0 such
that
If( zo+x-a2b)ICMto for all x E [a, b], which implies that if (z)I < MV6
for all z E (zo - j, zo + 2a) . A compactness argument shows that f is as
bounded in [-r, r] by some constant M,. > 0.
Next we claim that f is Lipschitz in (-r, r]. Indeed, assume by contradiction that this is not the case. Then we may find two sequences {a,:} , {tn} C [-r, r] such that s # t,, and If (sn) - f N) I > 2(n 2 + n) Isn - tnI for all n E N. Since {sn} is bounded, we may extract a subsequence (not relabeled) such that sn -+ s.. Take a further subsequence (not relabeled) such that (3.24) continues to hold and (3.24)
(3.25)
Ian - soo I <
1
(n+
1)2
1 Absolutely Continuous Functions
106
Since f is bounded in (-r, rJ by M,., by (3.24) for all n E N we have 2Mr >- If (sn) - f (tn) I > 2 (n2 + n) Is. - tnI.
(3.26)
Hence,
0
(b - a)
Isn - tnl(b - a)
2k1,
For every n E N, we divide the interval Ia + ,+ ii , a + na] into subintervals of length O,a. Thus, let e,L :=
(3.27)
diam In 8n
-
-
b-a do (n2 + n)
>2
2AI,.
Isn - tnI
(n2
+ n)
and set m, := max I j E No : j < en}. Since en > 2, we have
In<mn<
(3.28)
2
b-a , a+ bn"] given by Consider the partition Pn of [a+ n+r
xo
, .
. , 02mn+1
We now define the piecewise affine function u : I - R in the following way. s, if x < a, u (x) := so if x > b, while in each Set so := s1. Define u (x) interval
[a+,a+a),nEN,8et
(3.29) 2(s, -tn
U (X) :=
(x - x(n) 2i-1)
ifx(2;}1 <x<x2i
+ to
1
2(t-3) n l x - x(n)\ + 3 2i n
if x2; < x < x2;+1?
0
\\
(n)
Sn-1-tn
Aft) x2mn-
1
(n) '2mn-l
x - x2mn _1
+ to
if x2mn-1
- X C x2ma+1
-
Note that . < x2"mn+l x2, ,-1 < 26, . We claim that u E AC (1). Since sn - see and to - s,o, we have that u is continuous at x = a. Hence, the function u is continuous and differentiable except for a countable number of points, and so, in view of Exercise 3.23, to prove that it is locally absolutely continuous in I, it remains to show that u' is integrable. By (3.25), (3.26),
3.3. Singular Functions
107
and (3.28) we have fb
I Iu'I dx = J
00
lu'I dx C E (2m,, ISn - tnl + Itn - s,11) n=1
00
E(2enIsn-tnI+Itn-SnI+Isn-Soot+Isoo-Sn-1I) n=1 00
n=1
M
Al',
n2+n+n2+n
+
°°2M+2 < oo.
2
n2
n=1
n2
Since the series E°O 1 n converges, we have that u' is integrable in I. On the other hand, by (3.26)-(3.28),
((n))) -f ) I f \X'n) rrU
i=1
11
(
1
> 2m. If (sn) - f (t, )I > 2en (n2 + n) Isn - tnI = 41vl',-,
and so for every n E N by Remark 2.7 we obtain that n
Val k (f o u)
Var[a,bJ (f o u) >
4M,.n - 00
k=1
as n -p oo. Hence, we have obtained a contradiction.
0
Remark 3.69. Note that in the necessity part of the theorem we have actually proved a much stronger result, namely that if f : R - R is such that f o u E BPYOC (I) for all functions u E AC (I) (z ACIOC (I), then f is locally Lipschitz.
Remark 3.70. Note that the previous proof continues to hold if f : Rd + R; namely f o u belongs to ACi0 (I) for all functions u E ACIOC (I; Rd) if and only if f is locally Lipschitz.
3.3. Singular Functions In this section we prove that every function of bounded pointwise variation may be decomposed into the sum of an absolutely continuous function and a singular function.
Definition 3.71. Let I C R be an interval. A nonconstant function u : I -> R is said to be singular if it is differentiable at,C1-a.e. x E I with u' (x) = 0 for C1-a.e. x E I. The jump function uj of a function u E BPVIOC (I) is an example of a singular function. Another example is the Cantor function or the function given in Theorem 1.47.
3. Absolutely Continuous Functions
108
The following theorem provides a characterization of singular functions.
Theorem 3.72 (Singular functions). Let I C R be an interval and let u : I - R be a nonconstant function such that u' (x) exists (possibly infinite) for,C' -a. e. x E I. Then u is a singular function if and only if there exists a Lebesgue measurable set E C I such that C' (I \ E) = 0 and Ll (u (E)) = 0.
Proof. Assume that u is singular and let E := {x E I : u' (x) = 0}. Then
G'(I\ E) = 0. By Corollary 3.14 we have that G1 (u (E)) = 0. Conversely, assume that there exists a Lebesgue measurable set E C I such that
I' (I \ E) = 0 and £' (u (E)) = 0. Then by Lemma 3.45, u' (x) = 0 for £1-a.e. X E E. Since G1 (I, E) = 0, we have that u' (x) = 0 for ,C1-a.e. As an application of Lemma 3.31 we obtain the standard decomposition of a monotone function into an absolutely continuous monotone function and a singular monotone function.
Theorem 3.73. Let I C ]R be an interval and let u : I -p R be an increasing function. Then u may be decomposed as the sum of three increasing functions
u= uAC+uc+uJ,
(3.30)
where uAC E ACioc (I), uc is continuous and singular, and uj is the jump function of u.
Proof. Define v := u - uj. By Exercises 1.5 and 1.50 we have that v is increasing, continuous, and v' (x) = u' (x) for L1-a.e. x E I. Fix x0 E I and for every x E I define (3.31) uAC (x) :=
x so
v' (t) dt = J x u' (t) dt, uc (x) := v (x) - uAC (x). ..11 xo
Then the decomposition (3.30) holds. Moreover by Lemma 3.31 we have (x) = 0 for 1.'-a.e. X E I. It remains to show that uC is increasing. Let x, y E I, with x < y. By Corollary 1.37, uAC (Y) - uAC (x) = I v v' (t) dt < v (y) - v (x),
and so uc (y) > uc (x) by (3.31)2.
O
The function uC is called the Cantor part of u. Since every function with bounded pointwise variation may be written as a difference of two increasing functions, an analogous result holds for functions of bounded pointwise variation.
3.3. Singular Functions
109
Corollary 3.74. Let I C ][8 be an interval and let u E BPVoc (I). Then u may be decomposed as the sum of three functions in BPVI,, (I), i.e.,
u=uAC+uC+uJ,
(3.32)
where uAC E ACID, (I), uc is continuous and singular, and (3.33)
uJ (x) := E (u+ (y) - u_ (y)) + u (x) - u_ (x) . gE 1, g<s
Moreover for every interval [a, b] C I, (3.34)
Varla,bl u = Varla,bl uAC + Varla,bl uc + Var1a,b) uJ,
where b
(
3.3)
Iu' (x)
Varies bl uAC = Ia
(3.36)
(Iu+ (x) - u (x)I + Iu (x) - u_ (x)I)
Varlatbl uJ = xe(a,b)
+Iu(a)-u+(a)I+Iu(b) -u_(b)I. If, in addition, u E BPV (I), then Var it = Var tAC + Var tic + Var uJ
=J Jul(x)I dx+Varuc+F(Iu+(x)-u(x)I+Iu(x)-u-(x)I), aEI
where u- (inf I) := u (inf I) if inf I E I and u+ (sup I) := u (sup I) if sup I E I.
Proof. The decomposition (3.32) follows either by modifying the proof of the previous theorem or by writing u as a difference of two increasing functions (see Theorem 2.18) and applying the previous theorem to each increasing function. We leave the details as an exercise. By (2.7) for every interval J C I we have Vary u < Vary uAC + Vari uc + Varj uJ.
Thus, to prove (3.34), it remains to show (3.37)
Varlafbl u > Varla,bl UAC + Varla,bl uc + Varla,b) uJ.
We divide the proof of (3.37) into five steps.
Step 1: Assume first that u is continuous, so that uJ = 0. We claim that for every interval [a,,61 C I, (3.38)
Var1Qr,sl it > Varl,,,,,,l UAC + Iuc (Q)
- tic (a)I
To see this, let
E := {xE(a,,3): uc(x)=0}.
3. Absolutely Continuous Functions
110
Fix e > 0 and let d > 0 be as in Definition 3.1 for the absolutely continuous function uAC. Using the definition of differentiability, for every x E E we may find an interval (ax, br) C [a,,31 such that ax and bx are rational numbers, and if ax < xi < x < x2 < bzj then
IuC(x2)-uC(xi)I<0
(3.39)
EaJx2-x11
.
Since, G1 (E) = /3-a, from the countable cover {(ax, bz)}ZEE we may choose a finite subcollection such that n G1
(3.40)
E (ax{, bx=) s=1
By relabeling the points, if necessary, we may assume that XI < x2 < ... < xn,
and, by shortening the intervals where necessary, that b,,,-, :5 a.,, for all i = 2, ... , n. For simplicity of notation we write ai := axf, b1 := bxf for all i = 1, ... , n , bo := a, and a,s+i := /3. Consider now the partition P = {b0, 0,17 bb ... , an, bn, an+i} of
By Remark 2.7, n+l
n
(3.41)
Varla;,bj u +
Var[Q,,l u = i=1
Varlbb_,,a1 ui=1
By Corollary 2.23, the fact that (uAC)' = u' 41-a.e. in I, and Theorem 3.39, in this order, n
(3.42)
n
lu`I dx
Varla;,b;l U > i=1
cF
i=1
_ i=1
J
Va [,,,,b j uAC-
I (uAC)' I dx = i=1
Using (2.7), we obtain that Var[b,-,,,,] u > Varjb,_,,ail uc - Var]b,_,,,,, UAC
>- Iuc (ai) - uc (b;-i)I - Vary_,,,,) uAC, which, together with (3.41) and (3.42), yields n
(3.43)
Var1«,A1
n+l
Varla;tbsj uAC + E Iuc (ai) - uc (bi-1)
U> i=1
-
icl
n+1
Varlb{_, a4j ''AC-
i-1
I
3.3. Singular Functions
111
By (3.40) we have n+l
a-
(ai-bi-1) =
n (bi - ai) < S. i=1
i=1
Hence (see the proof of Corollary 3.41), n+1
(3.44)
Var[b;-i,0,j UAC < E i=1
On the other hand, by (3.39), n+1
n
Iuc (bi) - uc (ai)I
Iuc (ai) - uc (bi-1) I ? Iuc (3) - uc (a) I i=1
i=1
n
? Iuc (i3) - uc (a)I -
(3.45)
E
3
(bi
- ai)
> Iuc (3) - uc (a)I - e. Combining (3.43), (3.44), and (3.45) and using Remark 2.7 for UAC, we obtain u > Var[Q,31 uAC + Iuc (3) - uc (a)I - 3e.
By letting e -' 0+, we obtain (3.38). Step 2: Fix an interval [a, b] C I and consider a partition P of [a, b], with
a=YO
Var[a,,b] u =
Var46
i=1
m
m
>
Iuc (yi) - uC (Vi-i)I
Va [yt-j,31t) uAC + i=1
i=1
= Var[a.,b] uAC +
M
IhC (vi) - uc (yi-1)I
i=1
Taking the supremum over all partitions of [a, b] gives Var[a,bJ u > Varj.,b[ uAC + Varia,bj uc.
Thus, we have proved that (3.37) holds if u is continuous. Step 3: Assume that u has a finite number of discontinuity points in (a, b), say
a
3. Absolutely Continuous Functions
112
Let to := a, tl+l := b and fix d > 0 so small that
0<8<min{ti-ti_l: i= 1,...,8+1}. Using Remark 2.7, we have
l+l Var(a,b) u =
1+1
VarIt.-6,t,+6]n[a,b1 u
Var1ti_1+o.t,-a) U + i=O
i=1
t+1
> E Variti_1+a,ti-a) U i=1 I
+E(Iu(ti+a)-u(ti)J+lu(ti)-u(ti-a)1) i=1
+Iu(a+b)-u(a)J+Iu(b)-u(b-b)[ l+l (Vaft;-1+6,ti-a) UAC + Var[tf_,+a,t,-oI UC) i=1
I
(Iu(ti+6)-u(ti)I+Iu(ti)-u(ti-5)I)
+ i=1
+ lu(a+E) - u(a)J + Iu(b) - u(b -a)[, where we have used the previous step together with the fact that in each interval [ti_i + b, ti - b] the jump function u,j is constant, and so the variation of u in those intervals reduces to the one of uc + uAC. Letting 8 0+ in the previous inequality and using Remark 2.7 and Exercise 2.8 yields t+1
Var[a,bJ U >
(Var[t{-l,t=) UAC + Var[ti-1,&] tC) i=1
t
(I U00 - 001 + 100 - U-001)
+ i=1
+Iu+(a)-u(a)I+Iu(b)-u-(b)I = Var(a,bj uAC + Var[a,b, uC + Var(a,bl Uj.
Step 4: Finally, if u has an infinite number of discontinuity points in (a, b), say {ti}, consider the saltus function uJ,k corresponding to the points ti with i < k. For each k E N and x E [a, b] define uk (x) := uAC (x) + uC (x) + UJ,k.
3.3. Singular Functions
113
Since the discontinuity points of uk in (a) b) are {ti, ... , tk}, by the previous step Var1a,b1 Uk = Var[a,bl uAC + Var1a,b] uC k
+ E (I u+ (ti) -00 I + I U (ti) - u_ (ti) D) i=1
+Iu+(a)-u(a)I+Iu(b)-u-(b)ISince
Var[a,bl uk = Var1a,61 (uk - u + u) < Var]a,b1 (ui. - u) + Varla,bl u 00
E (Iu+ (ti) - u (ti) I + Iu(ti) - u- (ti) I) + V&r]a,b] U, i=k
by the previous equality we have k
Var[a,b] UAC + V&r[a,b] uC +
(Iu+ (ti) - u (ti)I + Iu (ti) - U- (ti) 1) i=1
+ Iu+ (a) - U W1 + Iu (b)
- u_ (b) I
00
(lu+ (ti) - u (ti) I + Iu (ti) - u- (ti) 1) + Var]a,b] u. i=k
Letting k - oo, we obtain (3.37). Step 5: If, in addition, u E BPV (1), taking an. and bn as in Step 2 of the proof of Theorem 3.39, we apply (3.34) in [a,,, and use Proposition 2.6 and the Lebesgue monotone convergence theorem.
Chapter 4
Curves Undergradese, IV: "Are you going to have office hours today?" Ranslation: "Can I do my homework in your office?" -Jorge Cham, www.phdcomics.coui
While the concept of monotonicity is strictly tied to the total order relation
of the real line, it is possible to extend the notion of pointwise variation to functions with values in Euclidean spaces and, more generally, in metric spaces. This brings us to the notion of rectifiable curves. In this chapter we will consider functions u : I --> Rd. We refer to 1111 for the case of metric-valued functions. We begin by introducing curves in W1.
4.1. Rectifiable Curves and Arclength In the literature there are many different definitions of curves. Let I C R be an interval and let u : I - Rd be a (possibly discontinuous) function. As the parameter t traverses 1, u (t) traverses a curve in Rd. Rather than calling u a curve, it is better to regard any vector function v obtained from u by a suitable change of parameter as representing the same curve as u. Thus, one should define a curve as an equivalence class of equivalent parametric representations.
Definition 4.1. Given two intervals I, J C R and two functions u : I - Rd and v : J -* Rd, we say that they are (Lebesgue) equivalent if there exists a continuous, bijective function 0! I -, J such that u (t) = v (
for all t E I. We write u " v and we call u and v parametric representations and the function 0 a parameter change.
Note that in view of Theorem 1.7, 0-1 : J - I is also continuous.
Exercise 4.2. Prove that , is an equivalence relation. 115
4. Curves
116
Definition 4.3. A curve y is an equivalence class of parametric represen-
tations. The curve y is said to be continuous if one (and so all) of its parametric representations is continuous.
By requiring parametric representations and parameter changes to be differentiable Gl-a.e., or Lipschitz, or of class Cn, n E No, etc., we may define curves y that are differentiable G1-a.e., or Lipschitz, or of class Cn, n E No, respectively. Given a curve y with parametric representation u : I -+ Rd, where I C R
is an interval, the multiplicity of a point y E Rd is the (possibly infinite) number of points t E I such that u (t) = V. Note that the multiplicity of a curve can also be expressed in terms of the Banach indicatrix. Since every parameter change 0 : I -p J is bijective, the multiplicity of a point does not depend on the particular parametric representation. The range of y is the set of points of Rd with positive multiplicity, that is, u (I). A point in the range of y with multiplicity one is called a simple point. If every point of the range is simple, then y is called a simple arc. If I = [a, b] and u (a) = u (b), then the curve y is called a closed curve. A closed curve is called simple if every point of the range is simple, with the exception of u (a), which has multiplicity two.
Example 4.4. The curves y, with parametric representations u,s : [0, 1R2, given by
u (t) :_ (sine rat, 0) ,
t E [a,
]-
irl
2
n E N, all have the same range, but are different curves. Indeed, y covers n times the segment of endpoints (0, 0) and (1, 0). The next result shows that the class of continuous curves is somehow too large for our intuitive idea of curve. Indeed, we construct a continuous curve that fills the unit square in R2. The first example of this type was given by Peano in 1890 [136]. We present here another example given by Hilbert [90]. The proof is taken from [125]. Theorem 4.5 (Hilbert). There exists a continuous function u : [0,1] -> R2 such that u ([0,11) = [0,1]2. Proof. For every n r= N divide the interval [0, 1] into 4'h closed intervals Ik,n, k = 1, ... , 4n, of length aL and the square [0, 1] 2 into 4n closed squares Qk,,,, k = 1, ... , 4n, of side length 1. Construct a bijective correspondence between the 4'z intervals IA-,,n and the 41 squares Qk,,, in such a way that (see Figure 1)
(i) to two adjacent intervals there correspond adjacent squares,
4.1. Rectifiable Curves and Arclength
117
Figure 1. Peano's curve.
(ii) to the four intervals of length a contained in some interval IA,,,, there correspond the four squares of side length 2 -TT contained in the square corresponding to Ik,,,. By relabeling the squares, if necessary, we will assume that the square Qk,n corresponds to the interval Ik,n. Let .F
{Ik,,, : n E N, k = 1, ... , 4n} ,
9: = Qk,n: nEN,k=1,. .,4"}. By the axiom of continuity of the reals, if {Jj} C F is any infinite sequence of intervals such that Jj+1 C Jj for all j E N and {R1} C 9 is the corresponding sequence of squares, then there exist unique t E [0, 1] and (x, y) E [0,1]2 such
that
00
00
{t} = n Jj, {(x, y)} = n Rj. j=1
j=1
We set the point t and the point (x, y) in correspondence. We claim that this correspondence defines a continuous function u R2 with all the desired properties. Indeed, a point t E 10, 1J that is [0, 1] not an endpoint of any interval determines uniquely a sequence {Jj} C F to which it belongs and hence a point (x, y) belonging to the corresponding
sequence {Rj } C 9. The same is true for t = 0 and t = 1. A point t that is common to two different intervals Ik,,,n and Ik,,,,, for some m E N is also common to t w o different intervals Ik,n, k = 1, ... , 41, for all n > m. Hence, it belongs to two different sequences {J1}, {J?} C F. Since the squares Rj and R'j, corresponding to Jj and Jj, respectively, are adjacent by property (i), it follows that 00
00
nRj=n ki. j=1
j=1
Thus, to every t E [0, 1J there corresponds a unique (x, y) E [0,1]2 that we denote u (t).
4. Curves
118
Since every (x, y) E [0,1]2 belongs to one, two, three, or four sequences {R, } C 9, there exists one, two, three, or four t E [0, 1J such that u (t) _ (x, y). Hence, u ([0,1]) = [0,1]2.
To prove that u is continuous, write u (t) = (x (t) , y (t)), t E [0,1]. By conditions (i) and (ii) we have that Ix (ti)
- x 001 <
2!_
2n
Iy (ti) - y (t2)I < 22n 1
for all ti, t2 E [0, 11, with It1 - t2I < 41 . This proves the uniform continuity of U.
In view of the previous result, to recover the intuitive idea of a curve, we restrict the class of continuous curves to those with finite or cr-finite length.
Definition 4.6. Given a curve y, let u : I -+ W' be a parametric representation of y, where I C R is an interval. We define the length of y as
L (y) := Var u = sup E Iu (ti) - u (ti-1)I i-=.1
where the supremum is taken over all partitions P := {xa,... , xn} of 1, n E N. We say that the curve y is rectifiable if L (y) < oo. Remark 4.7. Many authors define the notion of length only for continuous curves. This is motivated by the fact that if y is a curve with parametric representation u : I Rd, where I C R is an interval and u is discontinuous at t r= I, then the length of -y also measures the length of the segment joining the points u (t) and u_ (t), as well as the length of the segment joining the points u (t) and u+ (t) (see Corollary 4.19 below), although these segments may not belong to the curve. However, see Theorems 4.25 and 4.35. Rd, where Given a curve y, with parametric representation u : I I C R is an interval, we say that y is locally rectifiable, or that it has a-finite length, if Var1Q,bl u < oo for every interval [a, b] C I.
Note that a function u : I -r 1 d belongs to BPV (I; Rd) (respectively, BPVioc (I; Rd)) if and only if each component ui : I - R, i = 1, ..., d, belongs to BPV (I) (respectively, BPYOC (I)). Indeed, for all i = 1, ... , d and for every interval J C I we have (4.1)
ud.
Given a locally rectifiable curve 'y, with parametric representation u : I -+ Rd, where I C R is an interval, by Corollary 2.23, the function u is
4.1. Rectifiable Curves and Arclength
119
differentiable for G1-a.e. t E I. Fix a point to E I such that u is differentiable
at to and u' (to) # 0. The straight line parametrized by w (t) := u (to) + u' (to) (t - to),
t E R,
is called a tangent line to -y at the point u (to), and the vector u' (to) is called a tangent vector to 7 at the point u (to). Note that if y is a simple arc, then the tangent line at a point y of the range IF of y, if it exists, is unique, while
if the curve is self-intersecting at some point y e r, then there could be more than one tangent line at y. Exercise 4.8. Prove that if two parametric representations u : I -, Rd and v : J - Rd are equivalent, then Varl u = Varj v. Hence, the definitions of rectifiability and of length of a curve do not depend on the particular parametric representation. Exercise 4.9. Let -y be a continuous curve, with parametric representation u : [a, b]
Rd.
(1) Prove that if u E BPV (I; Rd). then b
L (y) >
(' () I dt.
f
(ii) Let g : [a,,$] -> Rd be a continuous function. Prove that if to E [a, 0], then I f p g (t) dt >_ J l
R
Ig (t) l dt - 2
J'8
Ig (t) - g (to) I dt.
(iii) Using part (ii), prove that if u is of class Cl ([a, b] ; Rd), then 'y is rectifiable and b
L (y) = f Iu' (t) I dt. a
(iv) Prove that if each component of u is absolutely continuous, then fb
L (7) =
(u' (t) I dt. a
Remark 4.10. If f : [a, b] - R is absolutely continuous, then by the previous exercise we have that the curve y with parametric representation u (t) :_ (t, f (t)), t E [a, 6], is rectifiable and
jIi b
L('Y)=
+I f'(t)Iadt.
4. Curves
120
Exercise 4.11. Given a continuous convex function f : [a, b] - R, prove that the curve -y of parametric representation a (t) :_ (t, f (t)), t E [a, b], is rectifiable and that
L(y) < f (a) -min f + f (b) -mi f + b - a. la,
We prove that the length of a curve is lower semicontinuous.
Proposition 4.12. Let ry, yk, k E N, be curves with parametric representations u, uk : I -* R", k E N, respectively, where I C ][8 is an interval. If u (t) = klim Uk (t)
(4.2)
for all t E I, then L (y) < 1 m f L (yk) .
(4.3)
Proof. The proof is the same as that of Proposition 2.38.
0
Remark 4.13. As in Remark 2.39, if u is continuous, then it is enough to assume that (4.2) holds for all t in a dense set E of I. The next exercise shows that the equality sign does not necessarily hold in (4.3).
Exercise 4.14. For t E [0,1], let u (t) :_ (t, 0) and uk (t) := (t, "sin 27rk't), k E N, r > 0. Let y and -yk be the corresponding curves. (i) Estimate L (yk) for all k E N and r > 0. (ii) Prove that if r = 2, then L (y) _ ?lim L (y23) -000
.
(iii) Prove that for r = 1 or r = 2 we have strict inequality in (4.3). In the special case of graphs of absolutely continuous functions, equality in (4.3) implies convergence in L' of {u4}. Indeed, we have the following result.
Theorem 4.15. Let u,'uk
:
[a, b] -> R, k E N, be absolutely continuous
functions such that
u (t) = lim uk (t)
(4.4)
for all t E [a, b] and (4.5)
lim /
k->oo
Q
b
a
4.1. Rectifiable Curves and Arclength
Then
b
121
1+IukI2-
kl'n°1°J a
and lim
Zb Iuk-u'I
k-roo
dt=0. 2
1 + luk (t) I2 - 2
1 + lu' (t)12 +
fk (t)
1 + 2 (u' (t) + uk (t)) I
.
1 + y2 is strictly convex, we have that fk (t) > 0 Since the function y unless u' (t) = uk (t). Consider the sequence
u(t)+uk(t),
Vk(t)
2
tE [a,b].
+u'n
By hypothesis, vi. (t) -+ u (t) for every t E [a, b], and so, by Exercise 4.9 and the previous proposition applied to the sequence {vk},
1m fJ1bt/1+
2
(u'+uk)2dt>_
fb 1
V
which, together with (4.5), implies that fb
jb
1+I
limsupJ fkdt= lim k-,oo k->oo
I2
dt
n
-2lim
fb
2
I21
uk))
f
dt<0.
Since fk > 0, we have that fk - 0 in L' ([a, b]). Extract a subsequence { fk1 } of { fk} such that fkj (t) -> 0 for Gl-a.e. t E [a, b]. Let E be the set of t E [a, b] for which A. (t) -> 0.
We claim that ukj (t) -> u' (t) for all t E E. Indeed, assume by contradiction that this is not true. Then there exist to E E and a subsequence
(not relabeled) such that either ukj (to) -' e E R, with e # u' (to), or It kj (to)
I
- oo. In the first case, we have that 2 fkj(to)-
1+Iu'(to)I2+
1+e2-2 1+I2(u'(to)+t)I >0,
which contradicts the fact that fkj (to) -> 0. Thus, assume that Hki (to) oo. Fix y, z e R, and consider the function g (s) :=
1
1Iy + szI2,
s E (0, oo) .
I
4. Curves
122
Since g is convex and differentiable, the function s E (0, oo) H g (s) - 2g ( ) is increasing. To see this, it suffices to differentiate and use the fact that g' is an increasing function. Using this fact with y = u' (to) and z = u' (to) u' (to), we have that for all 0 < s < 1, f k;
(to) =
1 + lu' (to) I2 + 9 (1) - 2g
(2
1+Iul(to)I2+g(s) -2g( .)
>
1+lu'(tp)l2+ -2
1+
I
u'(to)+8(ukf(to)-u,'(t0))12
- u' (to)) 2 R(to)
1 + Jul i
Taking s := Ini (to) - u' (to) I
f
12
.
E (0, 1) for all j sufficiently large, we have
that 1 + lie (to)12 +
fk, (to) ? where
j .-
V+tj ukf(to)_'
(to)
1 V+ Iu' (ta) + k,12 - 2 V1+ I U, (to) +
Since k
relabeled) such that (kJ inequality yields
I
I
= 1, we may find a subsequence (not
with
o=3 m fk,(to)?
2
1. Letting j -r oo in the previous
1+Iu'(to)I2+
-2
2
V1+Ju'(to)+ 1
>0,
where the last inequality follows from the fact that # 0. Thus, we have reached a contradiction even in this case, and so the claim is proved. Next we show that
lb lim
I V- -+
j +00
l+lu'12
at = 0.
Using the fact that 1181 - 18 - rll c Irl for all s, r E R, we have
1+Iuk7I2-
RI
1+luk?I2-
1+lu'l2 < V1+I4,
4.1. Rectifiable Curves and Arclength
123
and thus, by the Lebesgue dominated convergence theorem and the fact that uki (t) --# u' (t) for ,C1-a.e. t E [a, b], hm
f
2
1+ u'kp
2
1+lu'I2
+ luk1) =
+
dt dt,
Ia
which, together with (4.5), implies (4.6). Finally, we prove that slim
J
dt =
b Iuki I
b
J
lull dt.
By Fatou's lemma,
1b11 1im i
b
dt >
J
lull dt.
Thus, if (4.7) fails, then there is a subsequence (not relabeled) and n > 0 such that
fiu"i for all j E N. Since fa that (4.9)
dt + 3rl (b - a) < fb
dt I
1 + lu'I2 dt < oo, we may find E = E (rl) > 0 such
f/1+Iui2dt<,(b_a)
for every Lebesgue measurable set F C I, with Gl (F) < E. By Egoroff's theorem there is a Lebesgue measurable set EE C [a, b], with £' (EE) < e, such that U''j } converges uniformly in [a, b] \ E. Hence, we may find an integer j, E N such that luk; (t) I < Jul (t) I + n for all t E [a, b] \ EE and for
all j > jE. In turn, by (4.8) for all j > jj,
flull dt+3rd(b-a) < Ja
lukil
rb lull
(Ee f
dt=J
lukjl dt+ J
Vl
dt+rl(b-a)+
e
L4 I dt 2
dt.
4. Curves
124
It follows that
2r7(b-a)< E.
F
2
li4Jl dt
l+lukJl2- l+1u'I2 dt
< JEc
<,(b-a)+
1+lukjIZ-
Jb
1+]u'I2 dt
for all j > j,, where we have fused the triangle inequality and (4.9). Letting j -> oo and using (4.6), we obtain a contradiction. Hence, (4.7) holds, and in turn, reasoning as in the proof of (4.6), we have that
fbIte lim
(4.10)
k9
1'400
-u'I dt=0.
To conclude, we observe that, by the uniqueness of the limit, (4.6) and (4.10) actually hold for the whole sequence (why?).
Exercise 4.16. Let g : R -' [0, oo) be strictly convex. (i)
Prove that if g (a) - oo as Isl -> oo, then there exist c > 0 and
S>0such that g(s)>cI al forall]a]>S. Prove that if u, uk : [a, b] --+ R, k E N, are absolutely continuous functions such that u (t) = slim uk (t) for all t E [a, b] and
lim j g (uk (t)) dt =
k--.oo a
Ia g (u' (t)) dt < oo,
then
lim
/'b J
Ig (uk (t))
- g (u (t)) I dt = 0.
(You may use the fact that by (4.4),
lim inf z bg (uk (t)) dt >
Jo
(u' (t)) dt;
see [8] and see also the proof of (13.24) in Chapter 13). Prove that if in part (ii) we also assume that g (s) oo as ]s[ -i oo, then b
lim
k-'oo
fa
u'k-u'Idt=0.
4.1. Rectifiable Curves and Arclength
125
Next we introduce the notion of arclength of a rectifiable curve. Given
a rectifiable curve y, let u : I - Rd be a parametric representation, where I C R is an interval. For every t E I, let s (t) denote the length of the curve of parametric representation ulin(..,tl With a slight abuse of notation, we will denote this curve by We observe that the function s : I -* [0, L (-y)] is increasing, although it may not be strictly increasing, in general. We call s a length function for y.
Remark 4.17. Given a rectifiable curve y, let u : I -. Rd be a parametric representation, where I C R is an interval. For every interval [ti, t2] C I, the difference s (t2) - s (tl) is the length of the curve lilt,,t2l and by (4.1) we have d
(4.11)
V1 (t2)
- Vi (t1) < s (t2) - s (t1) < E (Vj (t2) - Y j (ti)) ,
j-1 1ui(t2) -uY(t1)] < Iu(t2) -u(tl)] C S(t2) -s(ti), for all i = 1,...,d, where, Vi (t) := Varin(-oo,t] ui, t E I. (4.12)
In particular, if u is continuous at some to E I, then by Exercise 2.14 and (4.11), the length function a is continuous at to f=- I. Conversely, in view of (4.12), ifs is continuous at to E I, then so is u. Thus, u and s have the same set of discontinuity points. Moreover, by (4.11), s E AC (I) if and only if Vi E AC (I) f o r all i = 1 , . ,dd,, and hence, by Remark 3.40, if and only if
ui E AC (I) for all i= 1,...,d. The next result is the vectorial version of Theorem 3.39.
Theorem 4.18 (Tonelli). Given a rectifiable curve y with parametric representation u : I Rd, where I C R is an interval, then s' (t) = lu' (t) I
(4.13)
for C1-a.e. t E I and
r (4.14)
J
lu' (t) I dt < L (-y)
.
The equality holds in (4.14) if and only if ui E AC (I) for all i = 1, ... , d.
Proof. By (4.1), ui E BPV (I) for all i = 1, ... , d, and so by Corollary 2.23 the derivative u' (t) exists for ,C1-a.e. t E I and is integrable. Similarly, since
s : I - [0, L (y)] is increasing, we have that s' (t) exists for £1-a.e. t r= I and is integrable. Since for all 4, t2 E I, with t1 < t2,
(4.15)
8 (t2)-8 (tl)> Iu(t2)-u(tl)i,
4. Curves
126
it follows that s' (t) > Jul (t) I whenever all the derivatives involved exist at t, i.e., for L1-a.e. t E I. Let
E := It E I : s' (t) and Iu1(t)I exist and s' (t) > Iu te(tI. For every k E N, let Ek be the set of all points t E E such that s (t2) - s (ti) > Iu (t2) - u (t1) I + 1 (4.16)
t2 - tl
t2
tl
k
for all intervals [tl, t2] such that t E [tl, t2] and 0 < t2 -11 <
.
Since
00
E = U Ek k=1
to prove (4.13), it suffices to show that L1(Ek) = 0. Let e > 0 and consider a partition P :_ {to, ... , t,a} of I such that (4.17)
Iu (ti)
- u (ti-i)I > L (y) - E.
i=1
By adding more points to the partition, without loss of generality, we may assume that I ti - ti-1 I < for all i = 1, ... , n. Fix i E (1,.. . , n-}. We distinguish two cases. If the interval [ti_ 1, ti] contains points of Ek, then multiplying (4.16) by ti - ti_1 yields (ti) - (ti-1) (ti) - u + ti - ti-1 a 8 Iu (4-01 k while if [ti-1, ti] does not intersect Ek, then
8(t1) -a(t4-1)
Iu(ti) -u(ti-1)I
by (4.15). Summing these two inequalities and using (4.17) gives n
L(7) _
n
1
Iu(ti) -u(ti-1)I+ it,(E,)
(a (ti) -a(ti-1)) i=1
i=1
L(y)-E+Lo(Ek), ke. Given the arbitrariness of e > 0, we which implies that Lo (Ek) conclude that L1 (Ek) = 0. This proves (4.13). It now follows from (4.13) and Corollary 1.37 applied to a that
Iu'(t)I dt= f 1(t) dt <sups - infs= L (y).
1, Assume next that
p
J I u' (t) I dt = L (-y) I
4.1. Rectifiable Curves and Arclength
127
Then
J s' (t) di = s jp 8 - inf s, I and so by Theorem 3.39, s belongs to AC (I). In turn, by Remark 4.17, u, E AC (I) for all i = 1, ... , d. Conversely, assume that us E AC (I) for all i = 1, ... , d. Then by Theorem 3.30, for every partition P = {t0,... , tn} of I we have
t
n
n
Iu (ta) - u (t _i)I = j=1
9=1
f
<
n' (t) dt
tf-1
tf
lu.' (t) I dt < JIu'(t)I dt.
ti_1
By taking the supremum over all partitions P, we obtain that L (-y) < f
Iu' (t) I dt,
which, together with the first part of the theorem, shows that equality holds. O
Given a rectifiable curve 7 with parametric representation u : I -> Rd, as in Corollary 3.74, we may decompose each component ui, i = 1,... , d, into an absolutely continuous part, a Cantor part, and a jump part. Thus, we obtain u = UAC + ttc + uJ, where for a fixed to E I and for all t E I, t
UAC (t) :=
f u' (8) ds, to
(u+ (g) - u_ (y)) + u (t) - u_ (t) ,
u, (t) := y
and uC := u - UAc - uJ is continuous, with uC (t) = 0 for G1-a.e. t E I. As u (inf I) if inf I E I, and u+ (sup I) := u (sup I) if usual, we set u_ (inf I) sup I E I. Let 7AC, 7c, and -yj be the rectifiable curves with parametric representations UAC, uc, and UJ, respectively. Then we have the following result. Corollary 4.19. Given a. rectifiable curve y with parametric representation u : I -> Rd, where I C R is an interval, then
L(7) = Lj(7AC) + L (7c) + L(3)
= J lu'(t)I tEl
4. Curves
128
where u_ (inf I) := u (inf I) if inf I E I and u+ (sup I) := u (sup I) if sup I E 1.
Proof. The proof follows exactly as in the proof of Corollary 3.74.
Remark 4.20. If f E BPV ([a, b] ), then its graph is given by the curve y with parametric representation
u:[a,b]->R2, t --p (t, f (t)) Thus, if we decompose f = fAC + f c + f j as in Corollary 3.74, we have that UAC (t) _ (t, AC (t)) and tic (t) _ (0, fc (t)) for all t E [a, b]. Thus,
jb1
L( Grf)=L(y)+If '(t)I2dt+Varfc (If+ (t) - f MI + If (t) - f_ (t) I) .
+ tEfa,b]
In particular, if f is continuous and increasing and if f' (x) = 0 for G1-a.e. x E [a, b], then f = fc, and so by Proposition 2.10, rb
L(Grf) = J 1 dt + Var fc = b - a + f (b) - f (a). a
Hence, if we consider the Cantor function f : 10, 1] i R defined in Example 1.43, then L (Gr f) = 2.
Definition 4.21. Given a rectifiable curve y, we say that y is parametrized
by arclength if it admits a parametrization v : J -> Rd, where J is an interval of endpoints 0 and L (-y), such that v is Lipschitz continuous, for every r E J the length of v : J fl [0,,r] -> Rd is exactly r, and Iv' (T) I = 1 for
G'-a.e. r E J. Note that, if y is parametrized by arclength, then by Tonelli's theorem, Iv'(T)I
Given a rectifiable curve y with parametric representation u : I - Rd, where I C R is an interval, by Remark 4.17 the length function s : I -+ [0, L (y)] corresponding to u is increasing. Moreover, if y (or equivalently u) is continuous, then so is a (again by Remark 4.17). It follows from the intermediate value theorem that s (l) is an interval. However, s may not be injective. Indeed, s is constant on any interval [tl, t2] if and only if u is constant in the same interval. Hence, if we also assume that every point of the curve is simple, so that y is a continuous rectifiable simple arc, then
4.1. Rectifiable Curves and Arclength
129
s : I -, s (I) becomes a continuous bijection (see Theorem 1.7). In turn, the function v : s (I) - Rd, defined by v (T) := u (s 1 (T)) ,
(4.18)
T E s (I) ,
is equivalent to u. In this case we say that y is parametrized by arclength.
Theorem 4.22 (Arclength, I). If y is a continuous rectifiable simple arc, then y can be parametrized by arclength.
Proof. It suffices to consider the case L (y) > 0. Let u : I -' Rd, where I C R is an interval, be any continuous parametric representation of y. By the discussion preceding the theorem, the function v defined in (4.18) is a parametric representation of y. Set J := s (I). Then, for all T, T-' E J, with ,r <,rl, by (4.12) we have (4.19) Iv (r') - v (T) I = lu (s 1 (T1)) - u (s ' (T)) I (s-1 (T'))
- 8 (8-1 (T)) = T - T. Thus, v is Lipschitz continuous with Lipschitz constant less than or equal to 1. In particular, v is absolutely continuous, and so by Remark 4.17 and a
Theorem 4.18,
,C1 (J) = L (y) = Var v = jIv'(i-)I CIT. Since
0 = ,1r1 (J) - f Iv' (T) I dT = /
(1
- It/ (r)I) dT
and I v' (T)I < 1 for G1-a.e. T E J, necessarily Iv' (T)I = 1 for G1-a.e. r E J and the proof is complete.
Remark 4.23. Note that if the interval I in the proof of the previous proposition is closed, then (4.20)
s (I) = 10,L(-y)],
and so we may take J = to, L (y)]. On the other hand, if one of the endpoints of I is finite and not in I, then by (2.9), we can extend u continuously to this endpoint in such a way that the pointwise variation of u does not change. Hence, in the previous theorem we may assume that I is closed.
Remark 4.24. Under the hypotheses of the previous theorem, we have that Iv' (T)I = 1 for 41-a.e. T E J. Thus, at G1-a.e. r E J the curve y admits a tangent line to -t at the point v (T) and the vector v'(7-) is a unit tangent vector. By modifying the previous proof, we can show that if a simple are y is not continuous, then the range of the curve y is contained in the range of a curve parametrized by arclength and with the same length.
4. Curves
130
Theorem 4.25. Given a rectifiable simple arc -y with L (y) > 0, there exists a curve parametrized by arclength whose range contains the range of IF and whose length is L (y).
Proof. Let u : I -* Rd be a parametric representation of y, where I C R is an interval. Since -y may be discontinuous, the length function s : I -+ s (I) is still strictly increasing and invertible, but it may be discontinuous. More precisely, in view of Remark 4.17, u and s have the same set of discontinuity
points. In particular s (I) may not be an interval. Let v be the function defined in (4.18). Then (4.19) continues to hold. Hence, the function v is continuous in a (I), and so it may be uniquely extended to s (I) by continuity. Let {(a,,, b,,)} be the family of connected components of (0, L (y)) \ s (I). Let to E I be a discontinuity point of u. Then by Corollary 3.74, (4.21)
s (to) - s_ (to) = lu (to) - u_ (to)( 8- (to) - s (to) = Iu (to) - u+ (to)(
(4.22)
, .
If s (to) - s_ (to) > 0, then there exists an interval (a,,,
an = s_ (to),
(4.23)
Hence, v (a,,) = u- (to) and v
such that
bn = s (to). u (to). In this case, we extend the
function v to be affine in the interval (an, b,,). More precisely, we set V
(T)
u (to) - qb_ (to) (T
bn - an
- an) + u- (to),
T E (a., b.) .
Then v is continuous in [a1L, b,,] and (v' (T)I = 1 in (an,, b,,) by (4.21) and (4.23).
Similarly, if s+ (to) - s (to) > 0, then there exists an interval (am, bra) such that a,, = s (to) and b,n = s+ (to), and we define v(T)
'u+(to)-u(to) (T-a.)+u(to), T E (ara,bra) bra - ara
Thus, we have extended v to (0, L (-y)] in such a way that v is Lipschitz continuous with Lipschitz constant less than or equal to 1 and (v'(T)( = 1 for 41-a.e. T E (0, L (y)]. The curve y with parametric representation v : [0, L (y)] - Rd has length L (y), and its range contains the range of y.
4.2. Frechet Curves To extend the previous results to rectifiable curves that are not simple arcs, we need to modify the definition of a curve by giving a more general concept of equivalence.
4.2. Frechet Curves
131
Definition 4.26. Given two intervals I, J C R and two functions u : I - Rd and v : J -> Rd, we say that they are &F chet equivalent if for every e > 0 there exists a continuous, bijective function ¢ : I -* J such that
Iu(t) - v(0(t))I < e for all t E I. We write u N V.
Exercise 4.27. Prove that N is an equivalence relation. F
A Frdchet curve y is an equivalence class (with respect to ) of parametric representations. We say that y is continuous (respectively, rectifiable), if it has a representative u that is continuous (respectively, of bounded pointwise variation).
Exercise 4.28. Prove that if a Frechet curve y has a continuous representative, then all its representative are continuous.
The next exercise shows that two functions u : I - Rd and v : J -+ R' may be Frechet equivalent but not (Lebesgue) equivalent. Exercise 4.29. For t, T E 10, 1] let u (t) :_ (t, 0) and /(37-,0) if 0 < T < I, if. CTCg V(T):= 12,0) (1+ (T-1),0) if 'S
The next result shows that for a Frechet curve we may still define its length as the variation Varu of any element in its equivalence class. Proposition 4.30. Assume given two intervals I, J C R and two functions u : I J+ Rd and v : J -+ lad. If u and v are Fr chet equivalent, then Var, j u = Var,r v.
Proof. For every n E N there exists a continuous, bijective function 0n : I - J such that 1
for all t E I. Hence,
IV' (t) - v (On (t))I < n
lim v (0,,. (t)) = u (t)
n "m
for all t E I. Define va (t) := v (On (t)), t E I. Then by Proposition 4.12, Varl u < lim inf Varl vn. On the other hand, since vn is (Lebesgue) equivalent to v, by Exercise 4.8 we have that Varj vn = Varj v for all n E N. Thus Var j u < Van J v. By interchanging the roles of u and v, we obtain the desired result.
4. Curves
132
We are ready to prove that a continuous rectifiable Frechet curve y always has a Lipschitz representative. Since the curve reduces to a point when L (y) = 0, we will assume that L (y) > 0. Theorem 4.31 (Arclength, II). If y is a continuous rectifiable Frechet curve with L (-y) > 0, then y can be paramettrized by an length.
Proof. Let u : I -> Rd be a parametric representation of y, where I C R is an interval. By Remark 4.17 and (4.20) the length function s : I - s (I) corresponding to u is continuous, increasing, and onto. Moreover J := s (I) is an interval. Note that the function s is constant on an interval if and only if u is constant there. Hence, for every T E J there exists either a single point tr such that s (tr) = r or there exists a maximal interval of endpoints
a, and 3, such that s (t) = r for all t E [a,, 0,.] n I. In the latter case, we let t, be any element in [rncT, /3T] n I. For T E J define
v (r) := u (t,). Note that by construction v (s (t)) = u (t)
(4.24)
for all t E I. We claim that v is Lipschitz continuous with Lipschitz constant
less than or equal to 1. To see this, note that for all r, T' E J, with r < T, we have
Iv(r')
- v(T)I = Iv(tom)-u(t,)I:9(tom)-8(tr) =r'-r,
by (4.12) and the facts that a (t,.) = T' and 8 (t,) = T. Thus, v is Lipschitz continuous with Lipschitz constant less than or equal to 1. To prove that v is Frechet equivalent to u, construct a sequence {an} of strictly increasing continuous functions s, : I -> [0, L (y)] such that
Is. (t) -a (t)I < n for all t E I and n e N. Then {v o s,z) converges uniformly to {v o 8} in I (why?); i.e., for every e > 0 there exists N E N such that
-v(8(t))1 <S for all t r= I and n > N, or, equivalently (see (4.24)),
Iv (sn (t)) - u (t)I <e for all t E I and n > N, which shows that v is Fr4chet equivalent to u. Finally, we can proceed as in the last part of the proof of Theorem 4.22 to conclude that L (7) = Var v = JIv'(T)I dT and that Iv' (T) I = 1 for G1-a.e. T E J.
4.2. Frechet Curves
133
Remark 4.32. Under the hypotheses of the previous theorem, we have that ]v' (T)] = 1 for C1-a.e. T E J. Thus, at G1-a.e. T E J the curve y admits a tangent line to y at the point v (r) and the vector v' (T) is a unit tangent vector.
Remark 4.33. The main reason for the introduction of Frechet curves is to allow a nonsimple continuous curve to be "parametrized by arclength". An alternative approach would be to weaken the request that changes of parameters be bijective. Namely given two intervals I, J C R and two continuous functions u : I - Rd and v : J - Rd, an admissible parameter change could be an increasing function (possibly nonstrictly increasing) 0: I -* J such that 0 (I) = J and for every discontinuity point of t E I of 0, the interval [0_ (t), 0+ (t)] is contained in an interval [Ti, Ti] C J on which v is constant. This point of view is taken, e.g., in [77]. Exercise 4.34. Given two intervals I, J C R and two continuous functions u : I -> Rd and v : J -, Rd, we say that u s v if there exists an admissible parameter change (in the sense of the previous remark).
(i) Prove that . is an equivalence relation. (ii) Given a continuous function u : I -> Rd of bounded pointwise variation, prove that the inverse function s-1 : J - I (properly defined) satisfies the conditions for an admissible parameter change
and that the function v (T) := t6 (a-1 (T)) ,
T E J,
is Lipschitz continuous.
Reasoning exactly as in the proof of Theorem 4.25, we can prove the following result;
Theorem 4.35. Given a rectifiable FHchet curve y, there exista a curve parametrized by arclength whose range contains the range of r and whose length is L (y).
Using Theorem 4.31, we may prove the existence of a geodesic curve.
Given a set E C W', an interval [a, b] C R, and two points zl, z2 E E, consider the family F of Frechet curves y that admit a parametric representation u : [a, b] -> Rd such that u is continuous, u (a) = z1, u (b) = z2, and u ([a, b]) C E. We are interested in finding a curve of minimal length, that is, a solution of the problem
inf {L (y) : y E TI. Any solution (if it exists) of the previous minimization problem is called a (4.25)
geodesic joining zl, z2.
4. Curves
134
Exercise 4.36. Prove that the value of the infimum in (4.25) does not depend on the choice of the interval [a, b].
Theorem 4.37 (Existence of geodesics). Let C C Rd be a closed set, let zl, z2 E C, and let F be the family of &echet curves y that admit a parametric representation u : 10, 1] -p Rd such that u is continuous, u (0) = zl, u (1) = z2, and u ([0,1]) C C. If the family F is nonempty, then problem (4.25) admits a solution.
Proof. Let L := inf {L (y) : -y E F).
If L = oo, then any -y E F will do, while if L = 0, then z1 = z2 and the problem becomes trivial. Thus, assume that 0 < L < oo and let {'yn} CT be a family of Frechet curves such that
lim L (yn) = L. n-co By Theorem 4.31, for each n E N there is a representative vn : [0, L (yn)] Rd of yn such that vn is Lipschitz continuous and Iv,,,(T)l = 1 for L1-a.e. T E [0,L(yn)]. Define wn (s)
vn (sL (yn))
,
s E [0,1] .
Then w : 10,1] -, Rd is another representative of yn with Iw; (s)I = L for Ll-a.e. s E [0,1]. In particular, w,, is still Lipschitz continuous. Since wn (0) = zl and Var wn = L (yn) C L + 1 for all n sufficiently large, we can apply the Helly selection theorem (one component at a time) to find a function w : [0,1] --+ Rd and a subsequence (not relabeled) such that wn (a) w (a) as n -+ oo for all a E [0, 1]. Using the facts that
- W. (82)1:5 L (yn) I 81 -821 for all 81, 82 E [0, 1] and that L (yn) - L, letting n - cc, we obtain that w is Lipschitz continuous with Lipschitz constant at most L. Moreover, I wn (81)
w (0) = z1, w (1) = z2i and w ([0,1]) C C, since C is closed. Thus, the curve
y parametrized by w belongs to F, and so L (-y) > L. On the other hand, by Proposition 4.12,
L (y) < lim inf L (yn) = lim L (yn) = L, n-poo
noo
and so L (y) = L and the proof is concluded.
4.3. Curves and Hausdorff Measure In this section we study the relation between the length of a curve and the Hausdorff measure N1 and then we characterize continua.
4.3. Curves and Hausdorff Measure
135
In what follows, given two points z1, z2 E Rd, we denote by z zl segment joining them, that is,
the
z1
== {tz1 + (1 - t) Z2 : t E [0, 1]} .
Theorem 4.38. If y is a continuous simple are -y with range F C Rd, then
W' (r) = L ('y) . In particular, y is rectifiable if and only if its range has finite 1-l1 measure.
Lemma 4.39. Let u : [a, b] -> Rd be a continuous function. Then Iu (b) - u (a)I < ii' (u ([a, b])) < Var(Q,bl u.
(4.26)
Proof. Let proj : Rd -.. Rd be the orthogonal projection from line through u (a) and u (b). Then
R.d
onto the
(proj z1 - proj z2I <_ Iz1 - z2I
for all z1, z2 E Rd. Hence proj is a Lipschitz map. By Proposition C.40 in Appendix C, U' (u ([a, bl)) ? ?i' (proj (u ([a, bl))) ? W1 (u (a) u
) = In (b) - u (a) I ,
where in the last inequality we have used the fact that proj (u([a,b])) D
u(a)u(b). To prove the other inequality, we can assume that Var1n,bj u < oo. Hence, the curve y with parametric representation u is rectifiable. By Theorem 4.22
we can find a representative v : J - Rd, where J := [0, L (-y)], such that v is Lipschitz continuous, for every T E J the length of v : [0, T] -f Rd is exactly T, and Iv' (T)I = 1 for C1-a.e. 7- E J. By Proposition C.40 and Exercise C.47,
x1(P)=f'(v(J))<_N1(J)=C'(J)=L(.7). This concludes the proof.
Proof of Theorem 4.38. Let u : I -, Rd be a continuous parametric representation of y, where I C R is an interval. We claim that
f1(I')?L(y). Fix a partition P :_ {to,... , t,,} of I. Since the curve y is simple and fl' ({z}) = 0 for all z E Rd, by the first inequality in (4.26) we have that n
it, (P) = it1 (u (I)) ? '(1 (u ([to, t-1)) = it, U u ([ti-i, til) i=1
n
n
Iu (ti) - u (ti-1)I
(u ([ti-1, til)) ? i=1
i=1
4. Curves
136
Taking the supremum over all partitions P of I proves the claim. The opposite inequality follows exactly as in the second part of the second inequality in (4.26). This concludes the proof.
Remark 4.40. It follows from the previous result that the Hausdorff dimension of a rectifiable curve is one. This is in sharp contrast to the Peano curve whose Hausdorff dimension is two. Exercise 4.41. Given a rectifiable simple are -y parametrized by arclength,
let v : J ->
Rd
be as in Theorem 4.22. Prove that if E is a Lebesgue
measurable set of J, then v (E) is an fl1-measurable subset of 11d and
N,(v(E)) _'c1(E). Deduce that a simple arc admits a tangent line at 7d1-a.e. point of the range of y. If the continuous curve y is not a simple are, then the second part of the previous proof continues to hold so that
fl1(I') < L (y)
(4.27)
,
but the opposite inequality is no longer true. Indeed, it is enough to consider the curve y given in Example 4.4. The natural extension in this case is the following generalization of Banach's theorem (see Theorem 2.47), due to Federer [57]. Theorem 4.42 (Federer). Given a continuous curare -y with parYametric rep-
resentation u : I - Rd, where I C R is an interval, then Nu function and
I) is a Borel
Nu (y; I) d7-l' (y) = Var u = L (y)
(4.28)
In particular, y is rectifiable if and only if N,,
I) is Lebesgue integr'able
with respect to 7d1.
Proof. The proof is very similar to the one of Theorem 2.47 and we only indicate the main changes. In Step 1 define .F, as before. By Theorem 2.46, with µ given by 7{1, we have that
J N. (y; [a,b]) d7l1(y) = "lim°° d
it 1 (U (j)) JEFr,
By (4.26),
Iu (sup J) - u (inf J) 1 < E 7{1 (u (J)) G E Var j u = Var[a,bj u, JEF.,
JEF.,
JE.F..
4.3. Curves and Hausdorff Measure
137
where in the last equality we have used Remark 2.7. Letting n oo and using Lemma 2.48 (which continues to hold with no changes for continuous functions u : [a, b] -> Rd) gives the desired result in the case I = [a, b]. Step 2 of the proof is the same as that for Theorem 2.47 and we omit it. Since for a simple arc -f we have that N., (y; I) = 1 for all y in the range of it, Theorem 4.38 is a special case of the previous theorem. Next we study compact connected sets with finite V measure.
Definition 4.43. A set E C Rd is (i) a continuum if it is compact and connected, (ii) pathwise connected if for all zi, z2 E E there exists a continuous curve joining zl and z2 and with range contained in E.
Exercise 4.44. Let E C Rd. (i) Prove that if E is pathwise connected, then E is connected. (ii) Prove that the set E = El U E2 of R2, where
El := {(0,x2) : -1 < x2 < 11,
E2 := { X1, sin x ) : xl > 0
\
1///
JJJ
is connected but not pathwise connected. (iii) Assume that E is open and connected, fix zo r= E, and consider the sets
A :_ {z E E : there exists a continuous curve joining z and zo and with range contained in E}
and B := E \ A. Prove that A and B are open and conclude that E is pathwise connected.
Exercise 4.45. Let K C Rd be a continuum and let z, w E K. Prove that for every e > 0 there exists a chain of points (yo,.. ., C K, with yo := z and y,,:= w, such that Iy, - yz_1I < E for all i = 1,... , n.
Theorem 4.46. Let K C Rd be a continuum with J(1 (K) < oo. Then K is pathwise connected.
Lemma 4.47. Let K C Rd be a continuum and let zo, wo E K. Then W1 (K n B (zo, Izo
- woI)) ? Izo - wol .
Proof. Let r := Izo - wo I. Consider the function f : Rd -> (0, oo) defined by f (y) := Izo - yI, y E Rd. Then f is Lipschitz continuous with Lipschitz constant 1. We claim that the set f (K fl B (zo, r)) contains the interval
4. Curves
138
Indeed, if not, then there would exist 0 < p < r such that p 0 f (K fl B (zo, r)) . But then we could write K as the union of the two [0, r].
nonempty disjoint closed sets K fl B (zo, p) and K \ B (zo, p), which would contradict the fact that K is connected. Hence the claim holds. Since f is Lipschitz with Lip f = 1, by Proposition C.40 in Appendix C and what we just proved,
l1 (KflB(zo,r)) 2: 7 1 (f (KriB(zo,r))) >?J1([O,rJ)=r. 0 Proof of Theorem 4.46. Fix two distinct points z, w E K. By the previous exercise for every 0 < e < [z - wI there exists a chain of points {yo, ... , C K with yo := z and y := w such that [yi - Vi-11 < s for all i = 1, ... , n. By deleting some of the points, if necessary, we may assume that Iii - y1I > e for all Ii - jI > 2. This implies that no point of Rd lies in more than two balls B (yi, ), i = 1'...,n, and so, by the previous lemma
2f1(K)>E7dKf1B
yip2
>n2.
i=1
Let y£ be the polygonal curve obtained by joining yo,..., yy.. Using the fact that Iyi - y3I > s for all [i - j[ > 2, we have that yE is a simple arc, with n
L(76) = 1: Iyi - yi-I[ < nE <4W(K). i=1
Hence, we may find a subsequence sn - 0+ such that, setting yn := yFn, we have lim, L (yn) = L. We may now proceed exactly as in the proof of Theorem 4.31 to find a parametrization wn : [0, 1] -> Rd of -In with Iw' (s)I = L (y,) for f-1-a.e. s E [0, 11 and a function w : [0,1] -. Rd such that, up to a subsequence, wn (8) -> w (a) as n -> oo for all s E [0, 1] and [w (81) - w (82)1:5 L 181 - 82l
for all 81, 82 E (0, L). Moreover, w (0) = z, w (1) = w. Since L (yn) L, it follows that {wn} converges to w uniformly. To conclude the proof, it remains to show that w ([0,1]) C K. Fix 6 > 0 and let y E w (10, 11). Then
there exists a E [0,1) such that w (s) = y. Since wn (s) - w (s) = y as n -, oo, there exists naa r= N such that Iwn (s) - y[ < 2 for all n > ns,a. By taking n > na,a sufficiently large, we have that Fn < . From the construction of -yE we may find an endpoint yi E K of one of the
4.3. Curves and Hausdorff Measure
139
segments of -yr. such that Iw7z (s) - yi, I < en < .2, and so IYi,.
- yl
<- Iwn. (s)
- yI + Iwn (s) - y_,. I <8
for all n > n,,6 sufficiently large. Since Yin E K and K is compact, it follows
that y E K, and the proof is complete.
Theorem 4.48. Let K C Rd be a continuum with f' (K) < oo. Then K is given by the union of a countable number of Lipschitz curves and a set of
V-measure zero. Proof. Step 1: We construct by induction a countable family of Lipschitz curves {ryn} C K. Since K is compact, there exist zo, wo E K such that do := Izo - wol = diem K.
By the previous theorem there exists a continuous rectifiable curve 'Yo joining
to and wo, with range ro contained in K and such that
f' (ro) > do, by Lemma 4.47. Assume by induction that the continuous rectifiable curves
yi, ... , yn have been constructed in such a way that their ranges rl,... , r, are contained in K, that for every i = 1, ... , n, the set
rin (;c:ri) consists of a single point, and that
U' (ri) > di, where
d, := max disc zEK
(zSJr2). .9--O
n
do+1 :- maxdist z, U ri zEK
i=0
n
K=Uri i=o
and the proof is completed. If do+1 > 0, let z,,+l E K and E Lli!--O ri be such that Izn+1 - w.+1I = do+,. Using the previous theorem once more, we may find a continuous rectifiable curve i'n+1 joining z,+1 and wn+l, with Rd be a continuous range f n+1 contained in K. Let un+1 : [0,
4. Curves
140
parametric representation of ')'n+1 with u,,+1 (0) = zn+1 W,+1. Let bn+1 := min t E [0, bn+l]
:
and un+1 (+) _
iin+1(t) E U r,
.
==o
Let un+1 be the restriction of tis,,+1 to the interval (0, brs+1J, let yn+1 be the
corresponding curve, and let r,+, be its range. Then the set (4.30)
rn+1 n
Or3)
=o
consists of a single point. Note that by Lemma 4.47,
xl (rn+1) 2 d,1. Thus, we have constructed by induction a countable family of curves
C
K. It remains to show that if 4 > 0 for all n E N, then
nl (K\ Urn
= 0.
Step 2: We claim that 00
K=
(4.31)
Urn.
n=o
Indeed, let z E K and assume by contradiction that d := diet
(zOrn) > 0. n=o
Since 00
00
E dn <_ E W1(rn) < n' (K) < oo, n=0
n=0
we have that do - 0 as n -> oo. Let n E N be so large that d < d. This contradicts the maximality of 4, since z could have been chosen as the endpoint of ryn+1 Thus, the claim holds.
Step 3: We claim that for every m r: N, if z r= K \=o rn and m
B (z, r) n U rn = Q1,
(4.32)
n=0 then 00
(4.33)
1f'
(B(zr)fl U rn >r. n=*n+1
4.3. Curves and Hausdorff Measure
141
To see this, note that since z E K, by (4.31) there exist a subsequence nk and a sequence of points zk E rnk such that zk -> z. Let k1 E N be so large that jzk - zI < r for all k > k1. Then by (4.32) it follows that nk. > m + 1 for all k > k1. Define nA;
Kk:= Urn. n=O
It follows by (4.30) that Kk is a continuum. Fix 0 < r < r'. Since zk -, z, if k > k1 is sufficiently large, say k > k2, we have that B (z, r) D B (zk, r'), and 00
o0
xl B (y, r) n U r
(4.34)
=
W1
B (z, r) n U I'n
.=m+1
n=0
>711(B(zk,r')nKk) where in the first equality we have used (4.32). Fix k > k2. Then B (z, r) J B (zk, r'), and so by (4.32), the set Kk contains points outside B (zk, r'). Since Kk is a continuum, it follows by Lemma 4.47 that
xl
(K&. n B
(z&., r')) > r',
which, together with (4.34), implies that 00
B(z,r)n U rn >r'. n=n,+1
Letting r' / r proves (4.33). Step 4: Fix m E N. We want to construct a fine cover of closed balls centered at K \ U 0 I'f,. Fix e > 0. By the definition of '1 there exists 6 > 0 such that
'HI (K\Ur) < n , (K\Ura) + e.
(4. 35)
n=0
n=0
Let Tn
Y,
z E K 1 Urn, {zir: B n=0
0
Note that if z E K \ U,=O F,, and 0 < r < a min (d,,,+1, d}, then B (z, r) E Thus, F,,, is a .F,,, by (4.29). Moreover, if r > dm+1, then B (z, r) fine cover of K \ U' 0 r,,, and sup {diam B : B E Fn 1 C dm+1
4. Curves
142
Hence, we are in a position to apply the Vitali-Besicovitch covering theorem (see Theorem B.118 in Appendix B) to the finite measure
µ(E):=f1(EnK), EEB(R), to find a disjoint sequence {B (zi, ri) } C
of closed balls such that
m
7H1
((K \ U r \ U B (zi, ri) n=0
m
=µ
K\ Urn \UB(z;,ri} =0. n=0
b
In turn, 74 ((K \ Un= 0 rn) \ Ui B (zi, ri)) = 0, and so, since W,1, is an outer measure, by (4.35), m
m
U rn +E K\ UO r,, <_xa K\ n=o
N1
m
nb
rn ,UB(zi,ri) +
K\ n=0
-
i
(B(zi,r1))
+,E
i
7.16 (T(-ziri)) +E <2alri+E, i
i
where in the last inequality we have used the fact that ri < 46, and so B (zi, r=) is admissible in the definition of fl}. It now follows from (4.33)
that o0
It' K \ U r < 2a1 E xl B (zi, ri) n U r,, n=0
i
+
n=m+1 00
U rn +E.
< 2aiflh
n=m+1
Letting m -, oo and using the facts that 11' (K) < oo and rn c K, it follows from the properties of measures that
(icr)n
<E.
n=0
The proof is concluded, by the arbitrariness of e > 0.
0
The next result shows that the Lipschitz curves in the previous theorem can be taken to be simple area.
4.3. Curves and Hausdorff Measure
143
Proposition 4.49. Given a continuous curve -y with parametric representation u : [a, b] --+ Rd, where u (a) # u (b), there exists a continuous simple are with range contained in u ([a, b]) and joining u (a) and u (b). Proof. Given a point z E u ([a, b]) with multiplicity N,, (z; [a, b]) greater than one, let I., be the largest closed interval [tl, t2] C [a, b] such that u (ti) =
u (t2) = z. Let I be the collection of all such closed intervals I, that are contained in no other. Then any two intervals of Z must be disjoint and I is countable (why?). Construct an increasing function f : [a, b] --+ [0,1] such
that f (a) = 0, f (b) = 1 and with the property that f (ti) = f (t2) if and only if ti and t2 belong to the same interval in Z. Define v : 10, 11 -r Rd by
Jz v (r) )
if f-1({r})=1, for some 17 E1,
u (f
({T}))
otherwise.
By construction v is injective and continuous, and, since u (a) # u (b), v (0) = u (a) and v (1) = u (b). In view of Theorem 4.48 we have the following definitions.
Definition 4.50. A set E C W' is called fl-rectifiable if there exists a sequence of Lipschitz functions u,, : R -' Rd such that
(E\U(R))
7l1
= 0.
n=1
A set E C Rd is purely nl-unrectifiable if
xi(E n u(R)) = 0 for every Lipschitz function u : R
RN.
Exercise 4.51. Let E be purely
N'-unrectifiable.
Prove that for every
interval I C R and for all u E AC (I; Rd), N1(E n u(I)) = 0.
A useful characterization of purely N'-unrectifiable sets is given by the following result.
Theorem 4.52. Let E be a set of Rd. Then the following properties are equivalent:
(i) E is purely xl
-unrectifiable.
(ii) For every interval I C R and for all u E AC (I; Rd), (4.36)
u' (x) = 0 for G1-a.e. x E u -'(E).
4. Curves
144
Proof. Step 1: Assume that E is purely 711-unrectifiable, let I C R be an interval, and consider a function u E AC (I; W). By the previous exercise, 7-11(Enu(I)) = 0. Let F := u 1(Enu(I)). Since the projection on every coordinate axis in Rd is Lipschitz continuous, it follows from Proposition C.40 and Exercise C.47
that for all j = 1, ..., d, Cl (uu (F)) = 7-l' (ua (F)) < N1(E n u(I)) = 0. Hence, by Lemma 3.45,
u?(x)=0 forL1-a.e. xEF for all j = 1, ... , d, which gives (ii). Step 2: Assume that (ii) holds. We claim that E is purely Indeed, assume by contradiction that there exists a Lipschitz function w : W-unrectifiable.
R --i. Rd such that
fl'(Enw(R))>0.
(4.37)
Then
lint ?-ll(E n w([-n, n))) = fl(E n w(R)) > 0.
n-400
Fix n E N so large that
?l'(Enw([-n,n])) > 0. Since w is Lipschitz, 1t1 (w([-n, nj)) < oo. Let ' be the continuous rectifiable F rechet curve parametrized by w : [-n, n] -* Rd. In view of Theorem 4.31 there exists a representative v : [0, L (y)] - Rd such that v is Lipschitz continuous, for every r E J the length of v : 10, 'T] - Rd is exactly T, and Iv' (r) I = 1 for G1-a.e. r E [0, L (y)].
By property (ii) we have that v' (T) = 0 for 41-a.e. T E v-1(E). Since Iv' (7-)I = 1 for G1-a.e. T E [0, L (y)], it follows that the set
0:= Jr E v-1(E) : v is differentiable at r and v'(7-) = 01 has Lebesgue measure zero. Hence, 41 (v-1(E)) = 0. Since v is Lipschitz, it follows from Proposition C.40 that
f'(E n w([-n, n])) = xl (v (v-1(E))) <_ (Lipv) Gl (v 1(E)) = 0, which is a contradiction.
0
Remark 4.53. (i) If I C R is an interval and u, v E ACID, (I; Rd) are such
that u (x) = v (x) for 41-a.e. x E E C I, then by the previous result u' (x) = v' (x) for G1-a.e. x E E.
(ii) When d = 1, condition (i) can be replaced by the equivalent con-
dition that £' (E) = 0.
4.3. Curves and Hausdorff Measure
145
As a consequence of the previous theorem, we can prove a chain rule in AC1oc (I; Rd). We recall (see the discussion above (3.15)) that if f : Rd - R is a Lipschitz continuous function with d > 1 and if u : I -r Rd is absolutely
continuous, then f o u E AC (I), but then the chain rule formula, that is, d
of (u (x)) u4 (x)
(f 0u) ' (x) _
(u (x)) u'i (x) is interpreted to be zero whenever ui (x) = 0, may fail (see Example 3.53). The problem lies in the fact that for a Lipschitz function f the set where
Ef
{14
E Rd : f is not differentiable at u}
has Gd-measure zero by Rademacher's theorem (see Theorem 11.49), but
for d > 2 it is easy to construct a set of 44-measure zero that contains the range of an absolutely continuous curve (see Example 3.53). Thus, to recover (3.15), stronger restrictions on the set Ef are needed. The following theorem is due to Marcus and Mizel [117.
Theorem 4.54 (Chain rule). Let f : Rd -r R be a locally Lipschitz continuous function and let I C R be an interval. Then f o u E ACloc (I) for every u e ACir (I;Rd) . Moreover, if the set Ef is purely 11-unrectifiable, then d
(4.38)
(f 0 u)' (x)
forG1-a.e. x E I, where (x) = 0.
(u (x)) u; (x)
(u (x)) ui (x) is interpreted to be zero whenever
Proof. The fact that f o U. E ACto, (I) follows as in Step 1 of the proof of Theorem 3.68. By Theorem 3.12, we have that u and f o u are differentiable for G1-a.e. x E I. Thus, it suffices to prove (4.38) for G1-a.e. x E I such that f o u and u are differentiable at x. If at any of these points x E I, u (x) E Rd \ Ef, then f is differentiable at u (x), and so (4.38) follows by the classical chain rule.
Thus, it remains to consider those x E I such that x E u 1(Ef) and f o u and u are differentiable at x. By Theorem 4.52, we have that
u' (x) = 0 for G1-a.e. x e u 1(Ef ).
Fix X E I° such that x E u-1(Ef ), u' (x) = 0, and f o u and u are differentiable at x. To conclude the proof, we need to show that (f o u)' (x) = 0. Since u is bounded in [x - 6, x + S] C I, let LL be the Lipschitz constant of
4. Curves
146
f in the ball containing u ([x - 5, x + 91). Then, for all 0 < Ih1 < 6,
I (f ou)(x+h)-(f ou)(x)I
u(x+h)-u(x)I
--Ll Iu'(x)I =0
0
Remark 4.55. Necessary and sufficient conditions for the validity of the chain rule (4.38) have been proved in [1061 and 1126]. If f . R -, R is only assumed to be a locally Lipschitz continuous function, then in place of (4.38) it is still possible to prove a weaker form of the chain rule. This has been established by Ambrosio and Dal Maso in [9].
4.4. Jordan's Curve Theorem We conclude this chapter with the Jordan curve theorem. We recall that a pathwise connected set is connected, but the converse is not true in general (see Exercise 4.44). However, if a set is open, then it is connected if and only if it is pathwise connected. In what follows, we will use this fact without further notice. In this section we use the notation z = (x, y) for a generic point of R2.
Theorem 4.56 (Jordan's curve theorem). Given a continuous closed simpie curve y in R2 with range r, the set R2 \ r consists of two connected components.
We call the unbounded connected component the exterior component of y and the other one the interior component of y.
We divide the proof into four lemmas. We begin by proving that the Jordan curve theorem holds for polygonal curves. We say that a curve -y is a continuous polygonal curve if it admits a continuous parametric representation u : [a, b] --+ R2 that is piecewise afline; that is, there exists a partition
such that on each interval [ti-1, ti1, i = is... , n, the function u is affine, namely,
u (t) = (cit+di,got+fi), t E [ti_1,ti], for some constants ci, di, gi, fz E R, i = 1,. .. , n. The points u (ti), i = 1, ... , n, are called vertices and the segments u ([t;_ 1, til ), i = I.... , n, are called edges.
Lemma 4.57. Given a continuous closed simple polygonal curve y in R2 with range r, the set R2 \ r consists of two components.
4.4. Jordan's Curve Theorem
147
Figure 2. The parity of zo.
Proof. Step 1: Let E1,. .. , E and v1, ... , vn be the edges and the vertices of the curve, respectively. Set E,+1 := El, Eo := En, Vn+1 := vi, to := vvn. To prove that R2 \r has at least two connected components, we partition R2 \ r into "odd" and "even" points and prove that no continuous curve connects an odd point to an even point. By changing the coordinate system, we can assume that the x-coordinates of all vertices vi are all different; i.e., if vi = (X;7 yi) and v3 = (x3, y3), where i, j E { 1, ... , n}, with i # j, then x; j x3. For every zo = (xo, yo) E R21 r, let m (zo) be the number of points in which the upward vertical ray from zo, that is,
{(xo,y)ER2: y>yo}, meets r, with the exception that if one of these points is a vertex vi (and hence only one by our assumption that the x-coordinates of all vertices vi are different), then it is not counted if vi-1 and vi+1 lie to the same side of the vertical through zo. We say that zo is even (respectively, odd) if m (zo) is even (respectively, odd) (see Figure 2). Consider the function
ir :R2\r->{0,1}, defined by (z)
1 0 if m (z) is even, I if m (z) is odd.
We claim that it is continuous. To see this, it suffices to show that for every zo = (xo, yo) E R2 \ r there exists 6 > 0 such that it (z) _ 7r (zo) for all z E R2 \ r with I z - zo I < 6. There are two cases. If xo xi for all i = 1,... n, then by continuity the same property will hold for all z E R2\ r sufficiently close to zo, and so we actually have that m (z) = m (zo) for all z E It21r sufficiently close to zo. If, say, xo = x1, then we need to distinguish a few cases. If v1 lies below zo (so that the upward vertical ray from zo does
4. Curves
148
not meet v1) or (x - xl) (x2 - xl) < 0 (so that v2 and v,, lie on opposite sides of the vertical through zo), then by continuity the same property will hold for all z E R2 \ r sufficiently close to zo, and so we actually have that m (z) = m (zo) for all z r= 1R2 \ P sufficiently close to zo.
Finally, if v1 is not below zo (so that the upward vertical ray from zo meets v1) and (x,t - x1) (x2 - xi) > 0 (so that v2 and v a lie on the same side of the vertical through zo, both to the left of z), then for all z = (x, y) E R2\P sufficiently close to zo one has m (z) = m (zo) if x > x1 and m (z) = m (z8)+2 if x < x1. This proves the claim.
Since it is continuous, it follows that it is constant on each connected component of R2\P. In particular, no continuous curve with range contained in R2 \ r connects an odd point to an even point. Step 2: Next we show that R2 \ r has at least two connected components. Consider an edge, say E1, and choose a point zo = (xo,1lo) E El such that xo # x1, x.,,. This can be done, since E1 is not vertical. Let
r:=diet (zoCiE1). i=2
Note that r > 0, since zo is not one of the vertices of El. Consider the vertical line x = xo- Since E1 is not vertical, we can choose two points zi = (xo, yi)
and z2 = (xo, y2) in (R2 \ r) n B (zo, r), but on opposite sides of El. By construction In (z1) - m (z2)I = 1, and so we have that it (zr) # it (z2). This proves that R2 \ r has at least two connected components. Step 3: To conclude the proof, it remains to show that two even (respectively, odd) points in R2 \ r can be joined by a continuous curve with range contained in R2 \ P. Thus, let zi, x2 E R2 \ P be such that yr (zi) = lr (z2). If the segment joining zi and z2 does not intersect r, then we are done. Thus, assume that the segment Ti-z2' intersects r and let wl and w2 be the first
and last intersections of this segment with r, respectively. By relabeling the edges, if necessary, we may assume that wl E El and that 2x12 E E. for
some 1<m
Ni = (E,)6 := J z E R2 : dist (z, Ei) < 8),
i = 1'... , n,
where
S:=min{dist(Ei,Ej): 1<j-i0. Then Ni n r C E1_1 U Ei U E,+1 and Ni \ P consists of two connected components, N, and Ni", where we may assume that
Nil nNil 100,
Nil' nNi+z #0, i= 1,...,m-1.
4.4. Jordan's Curve Theorem
149
Hence, Nl U ... U N,,, and N1" U ... U N; are connected sets in R2 \ r. Since
contains wl E El, it must intersects Ni U N1". Assume that it enters first in Ni and let wi be a point of the segment in Ni. Since the segment x zlx
Ni U -UN,,, is open and connected, we can construct a continuous polygonal
curve yl with range contained in N11 U ... U N,' joining wi with a point of N. Note that for all z along this path we must have it (z) = Tr (z1). Moreover, since N,;,, C R21 t is connected, we must have it (z) = it (zi) for all z E N. Reasoning as in Step 2 (with E1 replaced by E»,), it follows that v (z) # (zl) = 7r (z2) for all z E N;n. Since the segment zz contains W2 E E2, it must intersect N,' U N,",. If z z2 intersects N," last, then we would have a contradiction, since N' C 1211' is connected and 7r (z)
it (z2)
for all z E N. Thus, zj z2 intersects N,,, last, and so we can extend yl to a continuous polygonal curve arriving at z2 and with range contained in R21 r. This completes the proof. The next lemma shows that every continuous closed simple curve can be approximated by a continuous closed simple polygonal curve. Given a continuous closed simple curve y in R2 with parametric representation u : [a, b] -> R2, since u (a) = u (b), without loss of generality, we may assume that u : S1 -> R2, where Sl is the unit circle of
Lemma 4.58. Given a continuous closed simple curve -y in R2 with parametric representation u : S1 -R2, for every e > 0 there exists a continuous closed simple polygonal curve with parametric representation v : S1 - I12 such that (4.39)
]u (T) - v (T)j< e for alt T E Sl.
Proof. By the uniform continuity of u we may find 61 > 0 such that (4.40)
Iu(Ti) - u(r2)I < 2
for all Ti, 72 E S1 with I ri - r21:5 61. Also using the fact that u is injective,
there exists el > 0 such that if (4.41)
Iu(7-1) - u("2)1:5 el
for some Ti, T2 E S1, then ITl - T2 I < min {d1i v}. Let F2 := min { 2, e1 Since the range of -y is a compact set, it meets only finitely many of the squares 2E2 -eg E2 L21 { (x, y) E II82 : Ix
-
I
2
I - r2
j
where k, l E Z. Call Sl,... , S these squares. Since diam S1 <_ e2 < El, by (4.41) the set u-1 (Si) has diameter less than f, and thus it is contained in a unique minimal are Al shorter than T.
4. Curves
150
We now replace u in Al with a segment joining u (al) and u (bl ), where
al, bl E S1 are the endpoints of the are A1. Let yi be the new curve and ul : S' --+ R2 its parametric representation. By construction and the fact that y is a continuous closed simple curve, it follows that yl is still a continuous closed simple curve.
Note that if i > 2, the (possibly empty) set ui 1(Si) is contained in u-1(Si), and thus, again by (4.41), it has diameter less than xF3. In particular, if u-11 (S2) is nonempty, then it is contained in a unique minimal arc A2 shorter than s . We now replace u2 in A2 with a segment joining U1 (a2) and U1 02), where a2, b2 E S' are the endpoints of the arc A2. Let y2 be the new curve and u2 : S1 - R2 its parametric representation. If ui 1 (S2) is empty, we set y2 := yl and u2 Ul. Continuing in this fashion, we construct a continuous closed simple polygonal curve y,z with parametric representation v := u,z : S1 -+ R2.
To conclude the proof, it remains to show (4.39). Let T E S1 be such that u (T) # v (T). Then we may find i = 1, ... , n such that v (T) = ui (T) # UL-1 (T) (uo := u). By construction r belongs to the are Ai whose endpoints are ai, bi E S1. Since, again by construction, ui (ai) = u (ai) and ui (b,) _ u (bi), we have (4.42)
l u (T) - v (T) I = Iu ('r) - u (ai) + ui (ai) - ui ('r) l < I'u (T) - u (ai) I + E2 :5- J u (T) - u (ai) I +
2$
where we have used the fact that ui (ai) and ui (T) belong to the square Si whose diameter is E2. Since Iu (bi) - u (ai)I
E2 < E1,
it follows from (4.41) that
Ir - aiI < Ibi - aiI < S1, and so by (4.40), In (T) - u (ai)I < E, which, together with (4.42), completes the proof.
Lemma 4.59. Given a closed simple continuous polygonal curve y in R2 with parnmetric representation u : S1 -, R2 and with range r, the interior component of R2 \ I' contains an open ball, on whose boundary there are two points u (T1) and u ('r2), rl, T2 E S1, such that ITl - T2I ? V3-.
Proof. Construct an open ball B contained in the interior component of R2 \r touching r in at least two points a (ri) and u (T2), Tl, n E S1, and with the property that the distance ITl - r2I is maximal. Assume by contradiction that In - T2 I < f. Then ri, r2 are the endpoints of an are A C S1 of length
4.4. Jordan's Curve Theorem
151
greater than air. Note that by the maximality of ITi -raI, the boundary of B cannot meet u (A) \ {u (rl) , u (T2) }, since (4.43)
max {ITl -71, I7'2 - TI} > Iri - 721
for every T E A\ {Ti, r2}. Let u u (a,,,) be the vertices of'' in u (A), as met moving along the curve y when the parameter T goes from Ti to T2.
If al _ Tl and a,,,
T2, then a circle touching the segments u (ri) u (ai) and u (o,,, very close to u (Ti) and u (T2), in points u (Ti) and u (ri), will meet r only at those points. Since In' r2I > Irl - r21, we obtain a contradiction.
-
If, say, al 36 Ti and a,n = T2, then a circle touching the segments u (Ti) u (al) very close to u (rl) and passing through u (T2) will give a contradiction by (4.43). Finally, if ai = ri and a. = r2, consider a circle through u (ri) and u (T2) whose center c moves from the center of B into the domain D bounded by the radii through u (Ti) and u (T2) together with u (A) (note that this domain D exist in view of Lemma 4.57). Eventually the ball either meets u (A) at points other than u (71) and u (r2) or becomes tangent to one of the segments u (Ti) u (a,) and u (o,n) u (r2). In both cases we have reached a contradiction by (4.43) and the proof is complete. O Consider a continuous closed simple polygonal curve ry in R2 with range
r and two points zi and z2 belonging to the same connected component D of R2 \ r. For every chord C, contained in D except for its endpoints, D \ C consists of two connected components (this follows from the proof of Lemma
4.57). Let the distance between r and {zi, z2} be at least 1 and assume that for every chord C of length less than 2 and contained in D except for its endpoints, zi and z2 are in the same connected component of D \ C. Then we have
Lemma 4.60. Under the previous assumptions there exists a continuous curve 71 from zi to z2 with range ri such that dist (r, rl) > 1. Proof. We first observe that if zi is any point of R2, connected to zl by a continuous curve with range r, and such that dist (r, 1") > 1, then the pair zi and z2 satisfy the same conditions of zi and z2. Indeed, for every chord C of length less than 2 and contained in D except for its endpoints, since C does not meet r, (since dist (r, v) > 1), we have that the points zi and z1 are in the same connected component of D \ C, and so are zi and z2 by hypothesis.
4. Curves
152
Hence, by first moving zl and then z2, without loss of generality, we may assume that dist (zl, r) = list (z2, r) = 1. Let rl, r2 E S1 be such that lzl - u (Tl)I = 1z2 - u (T2)I = l and consider an open ball of radius 1 and moving center c initially placed in zl. The desired curve yl will be the curve described by the center c as the boundary of the ball B (c, 1) (confined to D U r) rolls along r starting at u (TI) until c falls in z2.
We first claim that B (c, 1) arrives at least at u (T2). If not, then for some c, the ball B (c, 1) and r will have a common chord C = u (al) u (0,2) of length less than 2. Then D \ C consists of two connected components D1 and D2, with, say, the center of the ball c in D1 and u (T2) on the boundary of D2, somewhere on r, strictly between u (ol) and u (02). Since by construction the center of the ball is in the same connected component of zl, by hypothesis zl and z2 are both in D1. Moreover z2 and c are on the same side of the line through the chord C. Consider the ball B (z2,1) and its radius toward u (T2). This radius starts in Dl and then goes to D2 until it meets r at u (r2). Hence, it crosses the chord C. Since B (z2, 1) does not contain either u (al) or u (a2) in its interior (recall that disc (z2, r) = 1), B (z2, 1) must intersect the chord C at two points. But since c and z2 are on the same side of C and the balls B (c, 1) and B (z2, 1) have both radius 1, we get a contradiction. Thus the claim is proved, and so there is c in D such that B (c, 1) touches u (T2)-
Next we claim that c reaches z2. If u (1-2) is not a vertex, then since disc (z2, r) = 1, necessarily c = z2.
If u (T2) is a vertex, then we claim that even in this case c reaches z2. Indeed, the only problem is if B (c, 1) and r have a common chord C of length less than 2, with u (T2) as one endpoint, and pointing into the angle cu (T2) z2. In this case, however, c and z2 are in different connected components of D \ C, contrary to the hypothesis (c and z1 are in the same connected component of D \ C). This completes the proof. We now turn to the proof of the Jordan curve theorem.
Proof of Jordan's curve theorem. Step 1: We claim R2 \r has at least two connected components. Since r is compact, its complement has an unbounded connected component. To prove the existence of a bounded connected component of R2 \ r, consider a ball B (0, ra) that contains r. Let u : S1 - R2 be a parametric representation of -y and apply Lemma 4.58 to construct a sequence {yn} of continuous closed simple polygonal curves
4.4. Jordan's Curve Theorem
153
with parametric representations vn : S1 -+ R2 such that (4.44)
Iu (T) - v,L (T)I <
!
for all r E S1 and n E N.
Since dist (8B (0, ro) , r) > 0, we have that the range I`,, of -y,,, is contained in B (0, ro) for all n sufficiently large. By Lemma 4.58 for every n E N the
bounded connected component of R2 \ r,, contains an open ball B (zn, rn) on whose boundary there are two points un (T,3) and u (a,,.), T,,, a E S such that I rn - an I > v f3-. Passing to a subsequence, we may assume that z,, -* z E B(0,ro). Since u is uniformly continuous and injective, we may finds > 0 such
that if
Iu(TI)-u(T2)I <E, for some Tl, n E S1, then ITl - T2I < -/3-. Hence Iu (Tn) - u (an) I > s, and so Iun (T,.) - u (a,,.) I > a for all n sufficiently large by (4.44). In turn, 2rn > z and dist (zn, Pn) > . It follows that for all n large the points z and zn are in the same connected component of R2 \ r,, (and also of R2 \ r).
Assume by contradiction that z is in the unbounded connected component of R2 \ IF. Then there exists a continuous curve with parametric representation v : 10,11 -' Rd such that its range is contained in R2 \ r, v (O) = z, and v(1) E 11:2 \ B (0, ro). Let d := dirt (v ([0,1]) , r) > 0. Then for all n sufficiently large dist (v ([0,1]) , r,,) > 7, which shows that for all n large the points z and z,= are in the unbounded connected component of R2 \ .rn. This contradiction proves the claim.
Step 2: To prove that R2 \ r has at most two connected components, assume by contradiction that there exist more than two, and let zl, z2, and z3 be points from three distinct connected components of R2 \ r. Define co := dist ({zl, z2, z3 } , I') > 0. Construct {yn} as in the previous step. Then dist ({zl, z2, z3 1, r) > f" for all n sufficiently large and by Lemma 4.57 two of the three points have to be in the same connected component Dn of R2 \ r,,. Passing to a subsequence, we may assume that zj and z2 are in D for all n E N. There are now two cases. Assume first that there exist 6 E (0, eo) and infinitely many n such that zl is connected to z2 by a continuous curve with range r,, such that dist (rn, r,) > 6. Then dist (I ;L, r) > for all n sufficiently large, which would imply that zl and z2 are in the same2connected
component of R2 \ r, which is a contradiction. If no such 6 exists, then the hypotheses of Lemma 4.60 (with 1 replaced by 6) must be violated, and so there exist a sequence of chords {Ck } and an increasing sequence {nk} such that z1 and z2 are in different connected components of Ck, u., (Tk) - u,,, (ak) -> 0 as k - oo, where u, (Tk)
154
4. Curves
and
(ak) are the endpoints of Ck. It follows from (4.44) that u (Tk) -
u (ak) - 0 as k - oo, which implies that 1k - ok -> 0 as k - oo, since u is uniformly continuous and injective. Then for infinitely many k, say, zi belongs to the connected components of D,ak \ Ch bounded by Ck and by u,,, (Ak), where Ak is the small are on S' with endpoints Tk and ak. Since Tk - ak -* 0, again by (4.44), diem un.; (Ak) - 0, so that diam ufzk (Ak) < co for all k sufficiently large. In particular, we have - u (ak)I < CO for all k sufficiently large, which contradicts the definition of EO and completes the proof. IZi
Chapter 5
Lebesgue-Stieltjes Measures Prospective Grad Students, I: "Will my teachers take personal interest in my learning, or will I be spending all-nighters working on problem sets made by frustrated faculty who would rather be doing research instead?"
-Jorge Cham, www.phdcomics.com
In the previous chapter we have extended the notion of pointwise variation to vector-valued functions u : I -r Rd, where I C R. The next natural question
is the possibility of extending this notion to functions u : R -p Rd, where now R C R is a rectangle of RN. In the literature there have been several attempts in this direction, but they have never been quite satisfactory. As we will see in the next chapters, a more successful approach is to give a different characterization of functions of bounded pointwise variation, namely as the
class of functions whose "derivative" is a finite measure. We will make this concept more precise in the Chapter 7. In this chapter we describe the correspondence between functions of bounded pointwise variation and Radon measures. We will start with increasing functions. We will show that there is a one-to-one correspondence between increasing, right continuous functions and (positive) Radon measures. In this chapter
I C R is an open interval. We recall that a Radon measure p : B (I) -+ 10, oo] is a Borel measure finite on compact sets contained in I.
5.1. Radon Measures Versus Increasing Functions The next result shows that every (positive) Radon measure gives rise to a right (or left) continuous increasing function. 155
5. Lebesgue-Stieltjes Measures
156
Theorem 5.1. Let I C R be an open interval and let p : ,B (I) -> [0, ooj be a Radon measure. Then for every a E I and y E R, the function uµ : I -> R, defined by (5.1)
uj, (x) := y + j
((a, XD -pA ((x, a])
if X >- a a,
if x <
is increasing and right continuos and uµ (b) - up (a) = p ((a, b])
(5.2)
for all a, b E I, with a < b.
Proof. By the properties of measures, if E C F C B (I), we have that
p(E)
uµ (x) = y + p ((a, x]) y + p ((a, yJ) uµ (y) , = while if x < y C a, then p ((x, al) > p ((y, a]), and so
up (x) = y - p ((x, a]) : 'Y - p ((y, aJ) = uµ (y) . Finally, if x < a < y, then u,, (x) < y < uµ (y). Hence, u14 is increasing. To prove that u.. is right continuous, fix x E I and let xn -> x+. Since UP is increasing, it suffices to assume that {xn} is decreasing. There are two cases. If x > a, then, since p ((a, oo, by Proposition B.9(ii) in Appendix B we have that Urn U n,oo
((a, x-]) = p
= p ((a, xD n.1
while if x < a, then by Proposition B.9(i), 00
A ((xn, a]) = A U (.T" a]
= IL ((x, aJ) -
n=1
Thus, uµ is right continuous. Property (5.2) follows from the definition of up.
0
Remark 5.2. (i) Note that if we work with intervals of the type (a, b), then the function u. defined correspondingly is left continuous. (ii) If p : ,B (I) -- 10, oo) is a finite measure, then we could work with the simpler function
u (x) := p (I fl (-oo, xJ), x r= I. (iii) Note that for every x E I we have that (uu)_ (x) < u, (x) if and only if p ({x}) > 0, i.e., the set of discontinuity points of uµ coincides with the set of atoms of p. In particular, if p is monatomic, then up is continuous.
5.1. Radon Measures Versus Increasing Functions
157
Next we prove the converse of Theorem 5.1; that is, we show that to every increasing function we may associate a unique Radon measure.
Theorem 5.3. Let I C R be an open interval and let u : I -> R be an increasing function. Then there exists a unique Radon measure pu : B (I) [0, oo] such that (5.3)
A. ((a, b]) = u+ (b) -u+ (a)
for all a, b E I, with a < b. Moreover, ;
(5.4)
(I) = sup u - inf U. I
In particular, it,, is finite if and only if u is bounded. The measure pu given by the previous theorem is called the LebesgueStieltjes measure generated by u.
To construct p,., we begin by constructing an outer measure. We use Proposition B.3 in Appendix B, taking 9 to be the family of all intervals (a, b), where a, b E I, with a < b, and defining p : G - [0, oo) by p ((a, b)) := u (b) - u (a).
The outer measure p ; : 2 (I) - [0, oo], given by (5.5) 00
00
P* (E) := inf
L n=1
p ((an, b,)) : an, bn E I, an < bn, E C U (an, bn) n=1
for E C I, is called the Lebesgue-Stieltje8 outer measure generated by u.
Exercise 5.4. Let I C R be an open interval and let u : I -> R be an increasing function. Prove that p* is a metric outer measure. It follows from the previous exercise, Carathhodory's theorem (see The-
orem B.13), and Proposition B.19 that the restriction of p* to the Borel a-algebra B (I) is a Borel measure. We define pu to be the restriction of pu to B (I). It follows from the definition of p* that for every interval (a, b) C I, where a, b E I, with a < b, (5.6)
A. ((a, b)) < p ((a, b)) .
In the next lemma we will show that strict inequality occurs, unless u is right continuous. Note that if [a', b'] C I, then, since I is open, u is bounded on an interval [a, b) C I such that (a', b'] C (a, b), and so (5.6) implies that A. is finite on closed intervals [a', b'] C I.
5. Lebesgue-Stieltjes Measures
158
Lemma 5.5. Let I C R be an open interval, let u : I -> R be incr'+easing, and let pu : B (I) - [0, oo] be the Lebesgue-Stieltjes measure generated by u. Then for all a, b E I, with a < b, µu ([a, b]) = u+ (b) - u_ (a). (5.7) Moreover, if u is bounded, then iau is finite with
µu (I) = sup u - inf u. I I
Proof. To prove (5.7), fix a, b E I, with a < b. Since I is open, there exists an integer no E N such that (a - ) b + 1) C I. Hence, the interval (a
-
,b
is an admissible cover of [a, b] for n
+ m)
p.([a,b])
no. By (5.5) we have
Letting n - oo gives M. ([a, b]) < u+ (b) - u- (a).
To prove the opposite inequality, consider a sequence of intervals {(an, bn)} such that [a, b] C U°_1 (an, b ). Since U ;_1 (an, bn) is open, we may find
e > 0 such that [a - e, b + e] C Un 1(an, bn). We claim that the set 00
U [u (an) , u {bn)] n=1
covers (u (a - e) , u (b + e)). Indeed, if t E (u (a - e) , u (b + e)), then there exists x E [a - E, b + E] such that t E [u_ (x), u+ (a)]. Since [a - e, b + e] C U'_1 (an, bn), there exists n E N such that x E (an, bn). Hence, u (an) < u_ (x) < t < u+ (x) < u (bn) . Thus, the claim is proved, and so 00
00
(u (b7L) - u (an)) _ n=1
G1 ([u (an), u (bn)] ) n--1 co
> G1 U [u (an) , u (bn)] n=1
G' ((u(a-e),u(b+e)))
=u(b+e)-u(a-e)_u+(b)-u_(a). Taking the supremum over all admissible sequences {(an, bn)} and using (5.5), we obtain that i ([a, b]) > u+ (b) - u_ (a). Thus, (5.7) holds.
5.1. Radon Measures Versus Increasing Functions
159
Finally, if u is bounded, then letting a , inf I and b / sup I in (5.7) and using Proposition B.9(i) gives (5.8).
Remark 5.6. Note that under the hypotheses of the previous lemma, taking a = b E I in (5.7) gives (5.9)
A. ({a}) = u+ (a) - u- (a) . Hence, also by (5.7), if a, b E I, with a < b, then yu ((a, bJ) = FLu. ([a, b)) - i`, ({a}) = u+ (b) - u+ (a) , Itu ((a, b)) = pu. ((a, b)) - µu ({b}) = u- (b) - u+ (a).
We are now ready to prove Theorem 5.3.
Proof of Theorem 5.3. Let Pu be the restriction to B (I) of the outer measure u* defined in (5.5). By the preceding discussions, p is a Radon measure and by Remark 5.6, (5.3) holds. To prove (5.4), it is enough to let a \ inf I and b / sup I in (5.3) and to use Proposition B.9(i). Uniqueness follows from Corollary B.16. This concludes the proof.
Remark 5.7. (i) If I c R is an open interval and u, v : I -* R are two increasing functions, then by the uniqueness established in the previous theorem, Au+v = 11u + Pt,
(ii) If the interval I is not open, then it contains one of its endpoints, say a := inf I. In this case, if u : I -> R is increasing, then we can extend u to (-co, a) by setting u (x) := u (a) for all x < a. Thus, we can construct the Lebesgue-Stieltjes measure of the extension of u defined on the Borel a-algebra of some open interval containing
I and then consider its restriction to B (I). (iii) If it : B (I) --+ [0, oo] is a Radon measure and uµ : I -y l is the function defined by (5.1), then by the uniqueness proved in the previous theorem, it follows that p is the Lebesgue-Stieltjes measure generated by u1, that is, Au,, = p,. Exercise 5.8. Construct the Lebesgue-Stieltjes outer measures corresponding to ul (x)
- ` (.xJ l0
forx > 0, forx < 0,
where LxJ is the integer part of x. The following is an important property of icu.
forx>0, for x < 0,
5. Lebesgue-Stieltjes Measures
160
Proposition 5.9. Let I C R be an open interval and let u : I --+ R be an increasing function. Then .Co (u (E)) < A* (E)
for every set E C I. Moreover, if E C I is such that u is continuous at all points of E, then Co (u (E)) = µu (E)
(5.12)
Proof. Step 1: Fix e > 0 and let an, bn E I, a,,. < bn, be such that 00
E C U (a1,f b7,) and 00
(u (bn)
- u (an)) < p, (E) + e.
n=1
Then the set U°=1 [u (an.) , u (bn)J covers u (E), and so 00
00
.C (u (E)) < ,C1 U [u (an) , u (bn)] < E C' ([u (an) , u (bn)J) (n=1
n=1
00
(u (b,,,) -u(an)) <14u(E) + e.
_ n=1
Letting e --+ 0 gives C1 (u (E))
IAu (E).
Step 2: Let E C I be a set such that u is continuous at all points of E. Consider an open interval J C R and let F :_ {x E E : u (x) E J}. We claim that
µY (F) < L' (J) .
(5.13)
If J is unbounded, then there is nothing to prove. Thus, assume that
J = (a, $) and let a := inf F and b ;= sup F. Then F C [a, b]. Since u (x) E (a, f3) for all x E F, it follows that u_ (b) < a and u+ (a) > a. Note that since u is continuous in F, if a E F, then lau ({a}) = 0 by (5.9). Similarly, if b E F, then /4 ({b}) = 0. Thus, by (5.11), µu (F) < pu ((a, b)) = u_ (b) - u+ (a) < (3 -
a.
This proves (5.13).
Step 3: Let E C I be a set such that u is continuous at all points of E. To prove that pu (E) < L, (u (E)), fix E > 0 and find a sequence of open intervals {Jk} such that u (E) C U Jk and k
EL1(Jk) <.C (u(E))+e. k
5.2. Signed Borel Measures Versus BPV (1)
161
For each k set Ek := {x E E : u (x) E Jk}. By (5.13),
14(E) 5 E 4u (Ek) < >2 G1(Jk) < Go (u (E)) +S' k
k
and so, letting E -p 0+, we obtain the desired inequality.
Remark 5.10. Note that in general (5.12) does not hold if u is not continuous at all points of E. Indeed, let x be a discontinuity point of u. Take E = {x}. Then
co({u(x)})=0
5.2. Signed Borel Measures Versus BPV (I) Next we extend Theorem 5.1 to differences of positive measures.
Theorem 5.11. Let I C R be an open interval and let it, v : B (I) -> [0, oo] be two Radon measures. Then for every a E I and -y E R, the function uP,,, : I - R, defined by (x) := ry + {
(5.14)
(A - v) ((a, x]) if x > a,
-(i-v)((x,a]) ifx
is right continuous and belongs to BPV1QC (I) and
u,,,,, (b) - u,,,, (a) = (M - v) ((a, b))
(5.15)
for all a, b E I, with a < b. Moreover, for all a, b E I, Var[a,q uu,,, < Ip - vI ([a, b]).
(5.16)
Proof. The first part of the proof follows from Theorems 2.18 and 5.1. To prove (5.16), consider a partition
a = xo < xi < ... < xn = b. By (5.15) we have n
(xi) - uµ,. (xi-i)I
= E I(i - v)
((xi-i,xi-1D1 <- Iµ
- vI ((a,b]),
and so (5.16) follows.
Remark 5.12. (i) If in the previous theorem both {t and v are finite, then we can work with the simpler function (x} := y + (µ - v) (I fl (-oo, x])
,
x E I.
5. Lebesgue-Stieltjes Measures
162
(ii) If A : B (I) - (-oo, oo) is a signed Radon measure, then by the Jordan decomposition theorem (see Theorem B.72) we can write it as the difference of two (positive) Radon measures A+ and )T, one
of which is finite. Thus, by applying the previous theorem with µ = A+ and v = A-, we obtain that for every a E I and -y E R, the function uA : I -* ][l, defined by (5.17)
a ((a, x]) if x > a, -A ((x, a]) if x < a, is right continuous and belongs to BPVOC (I) and
(x) = y +