EMS Tracts in Mathematics 17
EMS Tracts in Mathematics Editorial Board: Carlos E. Kenig (The University of Chicago, USA) Andrew Ranicki (The University of Edinburgh, Great Britain) Michael Röckner (Universität Bielefeld, Germany, and Purdue University, USA) Vladimir Turaev (Indiana University, Bloomington, USA) Alexander Varchenko (The University of North Carolina at Chapel Hill, USA) This series includes advanced texts and monographs covering all fields in pure and applied mathematics. Tracts will give a reliable introduction and reference to special fields of current research. The books in the series will in most cases be authored monographs, although edited volumes may be published if appropriate. They are addressed to graduate students seeking access to research topics as well as to the experts in the field working at the frontier of research. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
Panagiota Daskalopoulos and Carlos E. Kenig, Degenerate Diffusions Karl H. Hofmann and Sidney A. Morris, The Lie Theory of Connected Pro-Lie Groups Ralf Meyer, Local and Analytic Cyclic Homology Gohar Harutyunyan and B.-Wolfgang Schulze, Elliptic Mixed, Transmission and Singular Crack Problems Gennadiy Feldman, Functional Equations and Characterization Problems on Locally Compact Abelian Groups , Erich Novak and Henryk Wozniakowski, Tractability of Multivariate Problems. Volume I: Linear Information Hans Triebel, Function Spaces and Wavelets on Domains Sergio Albeverio et al., The Statistical Mechanics of Quantum Lattice Systems Gebhard Böckle and Richard Pink, Cohomological Theory of Crystals over Function Fields Vladimir Turaev, Homotopy Quantum Field Theory Hans Triebel, Bases in Function Spaces, Sampling, Discrepancy, Numerical Integration , Erich Novak and Henryk Wozniakowski, Tractability of Multivariate Problems. Volume II: Standard Information for Functionals Laurent Bessières et al., Geometrisation of 3-Manifolds Steffen Börm, Efficient Numerical Methods for Non-local Operators. 2-Matrix Compression, Algorithms and Analysis Ronald Brown, Philip J. Higgins and Rafael Sivera, Nonabelian Algebraic Topology. Filtered Spaces, Crossed Complexes, Cubical Homotopy Groupoids Marek Janicki and Peter Pflug, Separately Analytical Functions
Anders Björn Jana Björn
Nonlinear Potential Theory on Metric Spaces
Authors: Anders Björn Department of Mathematics Linköpings universitet SE-581 83 Linköping Sweden
Jana Björn Department of Mathematics Linköpings universitet SE-581 83 Linköping Sweden
E-mail:
[email protected]
E-mail:
[email protected]
2010 Mathematical Subject Classification: 31-02, 31E05; 28A12, 30L99, 31C05, 31C15, 31C40, 31C45, 35B45, 35B65, 35D30, 35J20, 35J25, 35J60, 35J67, 35J70, 35J92, 46E35, 47J20, 49J10, 49J27, 49J40, 49J52, 49N60, 49Q20, 58C99, 58J05, 58J32 Key words: Boundary regularity, capacity, Dirichlet problem, doubling measure, interior regularity, metric space, minimizer, Newtonian space, nonlinear, obstacle problem, Perron solution, p-harmonic function, Poincaré inequality, potential theory, Sobolev space, upper gradient
ISBN 978-3-03719-099-9 The Swiss National Library lists this publication in The Swiss Book, the Swiss national bibliography, and the detailed bibliographic data are available on the Internet at http://www.helveticat.ch. This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in other ways, and storage in data banks. For any kind of use permission of the copyright owner must be obtained. © 2011
European Mathematical Society Contact address: European Mathematical Society Publishing House Seminar for Applied Mathematics ETH-Zentrum FLI C4 CH-8092 Zürich Switzerland Phone: +41 (0)44 632 34 36 Email: info @ems-ph.org Homepage: www.ems-ph.org
Typeset using the author’s TEX files: I. Zimmermann, Freiburg Printing and binding: Beltz Bad Langensalza GmbH, Bad Langensalza, Germany ∞ Printed on acid free paper 987654321
Preface
In the first half of the 20th century, analysis went from studying smooth functions to nonsmooth ones, introducing such notions as weak solutions, Sobolev spaces and distributions. These concepts were first studied on Rn and later on manifolds and other smooth objects. Around 1970 came the first step towards analysis on nonsmooth objects, when notions such as maximal functions and Lebesgue points were studied on spaces of homogeneous type, i.e. on quasimetric spaces equipped with doubling measures. This theory can be called zero-order analysis, as no derivatives are used. Taking partial derivatives is not possible in metric spaces, but in the 1990s there was a need for studying first-order analysis on nonsmooth spaces. Heinonen and Koskela realized that upper gradients could be used as a substitute for the usual gradient. This gave rise to Newtonian spaces, one of several attempts to define Sobolev spaces on metric spaces, and perhaps the most fruitful one. It turned out that the potential theory of p-harmonic functions can be extended to metric spaces through the use of upper gradients. The nonlinear potential theory of p-harmonic functions on Rn has been developing since the 1960s and has later been generalized to weighted Rn , Riemannian manifolds, graphs, Heisenberg groups and more general Carnot groups and Carnot–Carathéodory spaces, and other situations. Studying potential theory of p-harmonic functions on metric spaces generalizes and gives a unified treatment of all these cases. There are primarily five books devoted to nonlinear potential theory, viz. Adams– Hedberg [5], Heinonen–Kilpeläinen–Martio [171], Malý–Ziemer [258], Mizuta [287] and Turesson [342]. They all study potential theory on unweighted ([5], [258] and [287]) or weighted ([171] and [342]) Rn . In [5] and [342] the focus is on higher order potential theory, whereas the main topic in [171] and [258] is the potential theory of p-harmonic functions (on weighted and unweighted Rn , respectively). The main focus in [287] is on Riesz potentials. The topics covered in our book are closest to [171], but there are also some parts in common with [258]. There is also some overlap, especially in Chapter 8, with the book by Giusti [146] (for unweighted Rn ). Let us also mention the survey papers by Martio [266], which has much in common with this book, and by Björn–Björn [47], which is based on an early version of this book. Moreover, the forthcoming monograph Heinonen–Koskela–Shanmugalingam– Tyson [177] has a certain overlap with the first part of this book. This book consists of two related parts. In the first part we develop the theory of Newtonian (Sobolev) spaces on metric spaces, and in the second part we develop the potential theory associated with p-harmonic functions on metric spaces. Both the Newtonian and the p-harmonic theories on metric spaces have now reached such a maturity that we think they deserve to be written in book form. So far, both theories are scattered over a large number of different research papers published during
vi
Preface
the last two decades, with obvious difficulties for those interested in them. In fact, very few of the results in this book are available in book form. When writing a book, one is faced with many decisions on what to include. Naturally, the choice is influenced by the taste and interests of the authors. Throughout the book we consider solely real-valued Newtonian spaces. We also restrict ourselves to the theory of p-harmonic functions (defined through upper gradients) on complete doubling metric spaces supporting a Poincaré inequality. We do not cover quasiminimizers, nor the noncomplete theory. Neither do we include results that only hold for Cheeger p-harmonic functions, or only in Rn . Related topics that could have been covered but were left out include: Differentiability in metric spaces (in particular, we do not prove Cheeger’s theorem (Theorem B.6)) and the Poincaré inequalities in the various examples discussed in Section 1.7 and Appendix A. Including these topics would have made the book substantially different, and many of these topics would rather deserve books on their own. There are also many recent results which we have not been able to cover, nor have we included a proof of Keith–Zhong’s theorem, Theorem 4.30. (See however the appendices, notes and remarks for some references and comments on the topics mentioned above.) This book is reasonably self-contained and we develop both the Newtonian theory and the p-harmonic theory from scratch. Naturally, we cannot develop all the mathematics needed for this book, and we have most often chosen to omit results which are available elsewhere in book form, but sometimes providing a reference. Thus, the reader is assumed to know measure theory and functional analysis. Apart from comparison results between Newtonian spaces and ordinary Sobolev spaces, there is no background needed in Sobolev space theory. In Chapters 1 and 2 we start developing the theory of upper gradients and Newtonian functions. Here we have collected the theory which works well in general metric spaces, i.e. without any assumptions such as doubling or the validity of a Poincaré inequality. In Chapter 3 we introduce the doubling condition and study some of its consequences. The reader interested only in the Newtonian theory can safely skip Sections 3.3–3.5. The John–Nirenberg lemma and its consequences in Sections 3.3 and 3.4, will be used only in the proof of the weak Harnack inequality for superminimizers (Theorem 8.10). (More specifically, it is Corollary 3.21 which is used there.) The Gehring lemma in Section 3.5, although important, is not used in this book. In Chapter 4 we introduce Poincaré inequalities of various types and look at their relations and some consequences. We discuss, in particular, connections with quasiconvexity. In Chapters 5 and 6 we study various properties of Newtonian spaces, which follow from assuming doubling and a p-Poincaré inequality. Throughout Chapters 1–6 we have taken extra care to see when the proofs are valid for p D 1 and with minimal assumptions, in particular when completeness is not needed. However, as our main interest is in the case p > 1, we have not dwelled further on the case p D 1 when it requires special proofs.
Preface
vii
The second part of the book consists of Chapters 7–14. In it we develop the potential theory associated with p-harmonic functions. Already from the beginning we need to use doubling, a p-Poincaré inequality and that p > 1. We also assume completeness, and these assumptions are general throughout the second part. We have taken special care to cover the case when X is a bounded metric space. In Chapters 7 and 8 we study the basic properties of superminimizers and show interior regularity, whereas Chapter 9 is devoted to superharmonic functions. In Chapter 10 we look closely at the Dirichlet problem, and in Chapter 11 on boundary regularity. In Chapter 12 we consider removable singularities, which are in turn needed to obtain the trichotomy (Theorem 13.2) motivating the study and classification of irregular boundary points in Chapter 13. Finally, in Chapter 14 we show that open sets can be approximated by regular sets and give some consequences thereof, including another formulation of the Dirichlet problem. In Appendix A we give various examples of metric spaces satisfying our basic assumptions (completeness, doubling and the validity of a p-Poincaré inequality). In particular, we show that on weighted Rn our theory coincides with the one developed in Heinonen–Kilpeläinen–Martio [171] and other sources. When specialized to weighted Rn , many of the results in this book appear in [171]. We have refrained from pointing out exactly which ones in the notes at the end of each chapter. Instead, we make [171] as a general reference for comparison throughout the book. The reader is also referred to the comments and references in [171]. In any case, we would like to point out that many of the results in Chapters 10–14 do not appear in [171] (when specialized to weighted Rn ). In Appendix B we take a quick look at Hajłasz–Sobolev and Cheeger–Sobolev spaces, and in Appendix C we give a short overview of the more general potential theory of quasiminimizers. The reader interested in open problems should observe that the item open problem in the index gives references to all open problems stated in the book. We started writing this book when giving a graduate course on this topic during the autumn of 2005 in Linköping. In fact, we gave a similar course in Prague in the autumn of 2003, and the handwritten notes we then obtained are in a sense the very first draft of this book. We thank the participants for their active role in the courses: Jan Kališ, Jan Malý, Petr Pˇrecechtˇel and Jiˇrí Spurný in Prague, and Gunnar Aronsson, Thomas Bäckdahl, Daniel Carlsson, David Färm, Thomas Karlsson, Mats Neymark, Björn Textorius, Johan Thim and Bengt-Ove Turesson in Linköping. Later on we have also given lecture series on these topics: Anders at the Paseky spring school Function Spaces, Inequalities and Interpolation, in June 2009, on Newtonian spaces, and Jana within the Taft Research Seminar at the University of Cincinnati, during the winter term 2010. Again, we thank all the participants. We are also grateful to Zohra Farnana, Heikki Hakkarainen, Stanislav Hencl, David Herron, Tero Kilpeläinen, Juha Kinnunen, Riikka Korte, Visa Latvala, Tero
viii
Preface
Mäkäläinen, Lukáš Malý, Niko Marola, Olli Martio, David Minda, Mikko Parviainen, Nageswari Shanmugalingam, Tomas Sjödin, Heli Tuominen and two anonymous referees for many useful comments given on draft versions of this book, and to Irene Zimmermann for her patience with our typesetting requests. Particular thanks go to Outi Elina Kansanen and Juha Kinnunen who wrote draft versions for Sections 3.3–3.5. Last but not least, we are grateful to Juha Heinonen, who introduced us to analysis on metric spaces during his course in Ann Arbor in 1999. We also encourage all future comments, in particular pointing out any mistakes, for which we apologize. Acknowledgement. The authors have been supported by various sources during their work on this book: the Swedish Science Research Council, Magnuson’s fund of the Royal Swedish Academy of Sciences, the Charles Phelps Taft Research Center at the University of Cincinnati, the Swedish Fulbright Commission, and Linköpings universitet. They also belong to the European Science Foundation Networking Programme Harmonic and Complex Analysis and Applications and to the Scandinavian Research Network Analysis and Application. Linköping, September 2011
Anders and Jana Björn
Contents Preface 1
2
3
4
v
Newtonian spaces 1.1 The metric space X and some notation . . . . . . . . 1.2 Preliminaries . . . . . . . . . . . . . . . . . . . . . . 1.3 Upper gradients and the Newtonian space N 1;p . . . . 1.4 The Sobolev capacity Cp . . . . . . . . . . . . . . . . 1.5 p-weak upper gradients and modulus of curve families 1.6 Banach space and ACCp . . . . . . . . . . . . . . . . 1.7 Examples . . . . . . . . . . . . . . . . . . . . . . . . 1.8 Notes . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
1 1 3 8 12 15 24 31 34
Minimal p-weak upper gradients 2.1 Fuglede’s lemma . . . . . . . . . . . 2.2 Minimal p-weak upper gradients . . 2.3 Calculus for p-weak upper gradients 2.4 The glueing lemma . . . . . . . . . . 2.5 N 1;p ./ . . . . . . . . . . . . . . . 1;p p 2.6 Nloc and Dloc . . . . . . . . . . . . 2.7 N01;p . . . . . . . . . . . . . . . . . p 2.8 Gloc . . . . . . . . . . . . . . . . . . 2.9 Dependence on p in gu . . . . . . . 2.10 Representation formulas for gu . . . 2.11 Notes . . . . . . . . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
37 37 40 45 48 50 52 55 58 59 61 64
Doubling measures 3.1 Doubling . . . . . . . . . . . . . . . . . . 3.2 The maximal function . . . . . . . . . . . 3.3 BMO and John–Nirenberg’s lemma . . . . 3.4 Consequences of John–Nirenberg’s lemma 3.5 Gehring’s lemma . . . . . . . . . . . . . . 3.6 Notes . . . . . . . . . . . . . . . . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
65 65 68 70 75 77 82
Poincaré inequalities 4.1 Poincaré inequalities . . . . . . . . . . . 4.2 Characterizations of Poincaré inequalities 4.3 BiLipschitz invariance . . . . . . . . . . 4.4 .q; p/-Poincaré inequalities . . . . . . . 4.5 Quasiconvexity and connectivity . . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
84 84 88 89 91 99
. . . . . . . . . . .
. . . . . . . . . . .
. . . . .
x
Contents
4.6 4.7 4.8 4.9 4.10 5
6
7
8
9
Poincaré inequalities in quasiconvex spaces Inner metric . . . . . . . . . . . . . . . . The relation between L and . . . . . . . Measurability . . . . . . . . . . . . . . . . Notes . . . . . . . . . . . . . . . . . . . .
Properties of Newtonian functions 5.1 Density of Lipschitz functions . . . . . 5.2 Quasicontinuity of Newtonian functions 5.3 Continuity of Newtonian functions . . 5.4 Density of Lipschitz functions in N01;p 5.5 Sobolev embeddings and inequalities . 5.6 Lebesgue points for N 1;p -functions . . 5.7 Notes . . . . . . . . . . . . . . . . . .
. . . . . . .
. . . . . . .
. . . . .
. . . . . . .
. . . . .
. . . . . . .
. . . . .
. . . . . . .
. . . . .
. . . . . . .
. . . . .
. . . . . . .
. . . . .
. . . . . . .
. . . . .
. . . . . . .
. . . . .
. . . . . . .
. . . . .
. . . . . . .
. . . . .
. . . . . . .
. . . . .
. . . . . . .
. . . . .
. . . . . . .
. . . . .
. . . . . . .
. . . . .
103 106 110 113 113
. . . . . . .
116 116 123 134 138 141 147 150
Capacities 6.1 Mazur’s lemma and its consequences . . . . . . . . . . . 6.2 Properties of Cp in complete doubling p-Poincaré spaces 6.3 The variational capacity capp . . . . . . . . . . . . . . . 6.4 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
154 154 157 161 168
Superminimizers 7.1 Introduction to potential theory . . . . . 7.2 The obstacle problem . . . . . . . . . . . 7.3 Definition of (super)minimizers . . . . . 7.4 Convergence results for superminimizers 7.5 Notes . . . . . . . . . . . . . . . . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
170 170 172 178 183 189
Interior regularity 8.1 Weak Harnack inequalities for subminimizers . . . . . 8.2 Weak Harnack inequalities for superminimizers . . . . 8.3 Hölder continuity for p-harmonic functions . . . . . . 8.4 The need for in Harnack’s inequality . . . . . . . . 8.5 Lsc-regularized superminimizers . . . . . . . . . . . 8.6 Lsc-regularized solutions of obstacle problems . . . . 8.7 p-harmonic extensions . . . . . . . . . . . . . . . . . 8.8 A sharp weak Harnack inequality for superminimizers 8.9 Notes . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
191 191 197 201 205 206 209 212 213 215
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
Superharmonic functions 218 9.1 Definition of superharmonic functions . . . . . . . . . . . . . . . . . 218 9.2 Weak Harnack inequalities for superharmonic functions . . . . . . . 220 9.3 Lsc-regularity and the minimum principle . . . . . . . . . . . . . . . 222
xi
Contents
9.4 9.5 9.6 9.7 9.8 9.9 9.10 9.11
Characterizations . . . . . . . . . . . . . . . . . . . . . . Convergence results for superharmonic functions . . . . . Harnack’s convergence theorem for p-harmonic functions Comparison of sub- and superharmonic functions . . . . . New superharmonic functions from old . . . . . . . . . . Integrability of superharmonic functions . . . . . . . . . Lebesgue points for superharmonic functions . . . . . . . Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . .
10 The Dirichlet problem for p-harmonic functions 10.1 Continuous boundary values . . . . . . . . . 10.2 The Kellogg property . . . . . . . . . . . . . 10.3 Perron solutions . . . . . . . . . . . . . . . 10.4 Resolutivity of Newtonian functions . . . . . 10.5 Resolutivity of continuous functions . . . . . 10.6 Some consequences of resolutivity . . . . . . 10.7 Resolutivity of semicontinuous functions . . 10.8 The p-harmonic measure . . . . . . . . . . . 10.9 Poisson modification . . . . . . . . . . . . . 10.10 The resolutivity problem . . . . . . . . . . . 10.11 Notes . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
226 229 233 234 235 238 244 246
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
249 250 251 253 255 261 263 265 268 271 273 275
11 Boundary regularity 11.1 Barrier characterization of regular points . . 11.2 Boundary regularity for the obstacle problem 11.3 Characterizations of regularity . . . . . . . . 11.4 The Wiener criterion . . . . . . . . . . . . . 11.5 Regularity componentwise . . . . . . . . . . 11.6 Fine continuity . . . . . . . . . . . . . . . . 11.7 Notes . . . . . . . . . . . . . . . . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
277 277 280 285 288 295 298 301
12 Removable singularities 12.1 Removability . . . . . . . . . . . . . 12.2 Nonremovability . . . . . . . . . . . 12.3 Removable sets with positive capacity 12.4 Nonunique removability . . . . . . . 12.5 Notes . . . . . . . . . . . . . . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
303 303 309 312 314 316
13 Irregular boundary points 13.1 Semiregular and strongly irregular points . . . . . . . 13.2 Characterizations of semiregular points . . . . . . . . 13.3 Characterizations of strongly irregular points . . . . . 13.4 The sets of semiregular and of strongly irregular points
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
318 318 320 325 327
. . . . .
. . . . .
. . . . .
. . . . .
xii
Contents
13.5 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 328 14 Regular sets and applications thereof 14.1 Regular sets . . . . . . . . . . . . 14.2 Wiener solutions . . . . . . . . . . 14.3 Classically superharmonic functions 14.4 Notes . . . . . . . . . . . . . . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
329 329 331 333 334
A Examples A.1 N 1;p in Euclidean spaces . . . . . . . . . . . . . . A.2 Weighted Sobolev spaces on Rn . . . . . . . . . . . A.3 Uniform domains and power weights . . . . . . . . A.4 Glueing spaces together . . . . . . . . . . . . . . . A.5 Graphs . . . . . . . . . . . . . . . . . . . . . . . . A.6 Carnot–Carathéodory spaces and Heisenberg groups A.7 Further examples . . . . . . . . . . . . . . . . . . . A.8 Notes . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
337 337 340 348 349 351 354 357 358
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
Appendices
B Hajłasz–Sobolev and Cheeger–Sobolev spaces 360 B.1 Hajłasz–Sobolev spaces . . . . . . . . . . . . . . . . . . . . . . . . 360 B.2 Cheeger–Sobolev spaces and differentiable structures . . . . . . . . . 363 C Quasiminimizers
365
Bibliography
369
Index
389
Chapter 1
Newtonian spaces
Throughout the book we will study potential theory on the metric space X . We make some general assumptions on X in the beginning of Section 1.1 below. These assumptions will hold throughout the book. In many of the chapters we will make some additional assumptions holding throughout that chapter. These assumptions will always be listed at the very beginning of the chapter. Occasionally we will state some additional assumptions at the very beginning of a section. In the first half of this book, Chapters 1–6, we introduce and study Sobolev type spaces on metric measure spaces. These spaces, called Newtonian spaces, will be the natural setting for p-harmonic functions and potential theory in the second half of the book. In Appendix B we mention some other possible definitions of Sobolev type spaces on metric spaces and relate them to our definition. Let us first take a very quick look at first-order Sobolev spaces on Rn . For 1 p < 1 and f 2 Lp .Rn / we define Z p kf kW 1;p .Rn / D .jf jp C jrf jp / dx; Rn
where rf is the weak or distributional gradient of f . The Sobolev space W 1;p .Rn / is then given by W 1;p .Rn / D ff W kf kW 1;p .Rn / < 1g: To define W 1;p .Rn /, one uses the gradient, i.e. the directional derivatives. In metric spaces we cannot talk about directions, so that is problematic. However, we do not really use the vector rf , only the scalar jrf j is necessary to define W 1;p .Rn /, and for jrf j there is a possible counterpart in metric spaces, called upper gradient and introduced by Heinonen–Koskela [173], [174]. Before defining upper gradients, in Section 1.3, we introduce our metric spaces and give some background results. Let us mention here that in Section 1.7 we give a short overview of some examples of metric spaces on which the theory of Newtonian spaces is useful. A more detailed discussion is given in Appendix A.
1.1 The metric space X and some notation We assume throughout the book that 1 p < 1 and that X D .X; d; / is a metric space endowed with a metric d and a positive complete Borel measure such that .B/ < 1
for all balls B X
(we make the convention that balls are nonempty and open).
2
1 Newtonian spaces
We emphasize that to start with we do not assume that X is complete nor locally compact. We will however assume that X contains at least two points (to avoid special formulations needed to cover the pathological cases when X is empty and when X is a singleton). We also emphasize that the -algebra on which is defined is obtained by the completion of the Borel -algebra. We further extend as an outer measure on X , so that for an arbitrary set A X we have .A/ D inff.E/ W E A is a Borel setg: Proposition 1.1. The measure is Borel regular, i.e. for every A X there is a Borel set E A such that .A/ D .E/. Note that this is the definition of Borel regularity used by Federer [123], Section 2.2.3, Mattila [275], Definition 1.5, and Heinonen [169], p. 3, whereas Rudin [311] has a more restrictive definition of Borel regularity which is not always fulfilled for our spaces. Proof. If .A/ D 1, then we may choose E D X . Otherwise weTcan find Borel sets Ej A with .Ej / < .A/ C 1=j , j D 1; 2; ::: . Letting E D j1D1 Ej completes the proof. Let us here record some notation used throughout the book. We use the following notation for balls B.x0 ; r/ WD fx 2 X W d.x; x0 / < rg; and for B D B.x0 ; r/ and > 0, we let B D B.x0 ; r/. Further, we always assume that , 0 , 00 and t , t 2 R, are nonempty open subsets of X . In the metric space X , a.e. always means almost everywhere with respect to the given measure , unless otherwise stated. For a measurable set A X with 0 < .A/ < 1, we define the mean-value integral (or integral average) of f over A as « Z 1 f d WD f d; .A/ A A whenever the right-hand side exists, which it does, in particular, if f 2 L1 .A/ or if f is nonnegative and measurable on A. We shall also use the abbreviation « fA WD f d: A
In general we allow semicontinuous functions to be extended real-valued, i.e. to x D Œ1; 1. On the other hand, continuous functions are always take values in R assumed to be real-valued, unless mentioned otherwise.
1.2 Preliminaries
3
We denote the characteristic function of a set E by E , and let sup ¿ D 1 and inf ¿ D 1. Further, we let fC D maxff; 0g and f D maxff; 0g so that f D fC f and jf j D fC C f . We define 0 1 WD 0 .1/ WD 0. This will, in particular, be useful when multiplying a function by a characteristic function so that we always let f E D 0 outside of E, even when f may take the values ˙1. Moreover, we make the convention that 1 1 D 1 and .1/ .1/ D 1, see the comments after Definition 1.13 for the usefulness of this. For sequences of numbers or sets we will use the words increasing and decreasing in their nonstrict sense, so that e.g. the sequence faj gj1D1 is increasing if aj C1 aj , j D 1; 2; ::: . We also say that E b A if Ex is a compact subset of A, and let Lipc .A/ D ff 2 Lip.A/ W supp f b Ag be the set of Lipschitz functions on A with compact support. We shall later see that this class of functions will play the important role of test functions for us. Throughout the book we present a number of examples with X being Rn , n 1, or some subset thereof. In these cases, unless otherwise stated, we always equip X with the Euclidean metric and the natural Lebesgue measure (or restrictions thereof). Finally, we make the convention that, unless otherwise stated, the letter C denotes various positive constants whose exact values are not important and may vary with each usage.
1.2 Preliminaries We will need the following consequence of the Borel regularity. x is measurable, then there exist Borel functions Proposition 1.2. If f W X ! R x f1 ; f2 W X ! R such that f1 f f2 and f1 D f2 a.e. A Borel function f W X ! Y is by definition a function such that f 1 .G/ X is a Borel set for every open set G Y . It follows that f 1 .E/ X is a Borel set for every Borel set E Y . The following simple lemma will be useful in the proof of Proposition 1.2. x Then f is a Borel function if and only if Lemma 1.3. Let f W X ! R. Eq D fx W f .x/ > qg is a Borel set for every q 2 Q.
4
1 Newtonian spaces
Proof. The necessity is clear, so let us look at the sufficiency. Let I D .a; b/ R, a < b, be an open interval. Then [ \ f 1 .I / D Eq n Eq Q3q>a
Q3q
is a Borel set. Moreover, f 1 .1/ D
\
Eq
and
f 1 .1/ D X n
q2Q
[
Eq
q2Q
x are Borel sets. We conclude that f 1 .I / is a Borel set for any open interval in R (which is now allowed to contain the points ˙1). x be open. Then E can be written as a countable union of pairwise Let now E R S disjoint open intervals, E D j1D1 Ij (where Ij is allowed to contain ˙1), see Lemma 1.4 below. S Since f 1 .E/ D j1D1 f 1 .Ij / is a Borel set, we conclude that f is a Borel function. Proof of Proposition 1.2. For q 2 Q let Eq D fx W f .x/ > qg. A0q be a T Let further 0 0 0 Borel set such that Aq Eq and .Aq n Eq / D 0, and let Aq D Q3q 0 q Aq 0 which is a Borel set. As A0q 0 Eq 0 Eq for every q 0 q, q 0 2 Q, we see that Eq Aq A0q and thus .Aq n Eq / .A0q n Eq / D 0. Note that Aq Aq 0 if q 0 q, q 0 2 Q. Let now f2 .x/ D supfq 2 Q W x 2 Aq g supfq 2 Q W x 2 Eq g D f .x/: Then f2 is a Borel function by Lemma 1.3. Moreover, [ fx W f2 .x/ ¤ f .x/g D fx W f2 .x/ > f .x/g D fx W f2 .x/ > q f .x/g D
[
q2Q
fx W x 2 Aq and x … Eq g D
q2Q
[
.Aq n Eq /;
q2Q
which is a countable union of sets of measure zero and hence itself of measure zero. Thus f2 has the required properties. The construction of f1 is similar, but its existence may also be obtained by applying the already proved half of the proposition to the function f . x be open. Then G can be written as a countable (or finite) Lemma 1.4. Let G R union of pairwise disjoint open intervals (which are allowed to contain ˙1). This lemma is well known, but as the proof is short and we have not found a good reference we give the proof here. Let us point out, for later use, that a countable set may be finite.
1.2 Preliminaries
5
Proof. Write G as a union of its components. Each component is necessarily an open interval. Associate with each component one of its rational points. Then we see that the set of components cannot have larger cardinality than Q. Proposition 1.5. Let Y be a metric space. Then the following are equivalent: (a) Y is separable; (b) Y is second countable, i.e. it has a countable open base; (c) Y is Lindelöf, i.e. every open cover of Y has a countable subcover. It is easily seen that these properties are also inherited by any subset of Y (in the induced topology). This is well known, see e.g. Exercise 5, p. 194, in Munkres [296], or Figure 10 in Steen–Seebach [327]. However, we have not found one good reference with full proofs of all implications. Proof. (a) , (b) See Theorem 2, p. 177, in Kuratowski [235]. (b) ) (c) See Theorem 2, p. 176, in [235]. (c) ) (b) See the second paragraph on p. 35 in Steen–Seebach [327]. In our considerations on the metric measure space X , the support of will be of main interest. The following result is therefore useful. See also Proposition 1.53 and the comment before it. Note, however, that we do not want to assume that X D supp in general, since we want to be able to consider arbitrary subsets of X as metric spaces on their own and it then may not be true that the support of the restriction of the underlying measure is the whole subset under consideration. Recall that x 2 supp , the support of , if and only if .B.x; r// > 0 for every r > 0. Or in other terms X n supp is the union of all balls with zero measure, and is the largest open set with zero measure, in the sense that it contains any open set with zero measure. (The support of a function is similarly defined as the complement of the largest open set on which f is 0.) Proposition 1.6. The metric space supp is separable, second countable and Lindelöf. Before proving Proposition 1.6, let us make some remarks. The following simple but very useful covering lemma is well known. Lemma 1.7 (5-covering lemma). Let B be a family of balls in X with uniformly bounded radii. Then there exists a subfamily B 0 B of pairwise disjoint balls such that [ [ B 5B: B2B
B2B 0
If X is separable, then the subfamily B 0 can be chosen to be countable.
6
1 Newtonian spaces
Proof. For a proof of the first part see e.g. Ambrosio–Tilli [17], Theorem 2.2.3, Heinonen [169], Theorem 1.2, or Federer [123], Theorem 2.8.4 (choose D 2 and let ı be the radius of the balls in Federer’s formulation). For the second part assume that X is separable. Then X is Lindelöf S by Proposi00 0 tion 1.5, and hence we can find a countable subfamily B B such that B2B 00 5B D S B2B 0 5B. Remark 1.8. The constant 5 in the 5-covering lemma is not optimal, but has become standard as one wants to have as simple an argument as possible. With just a slight extra thought most proofs actually show that one may replace 5 by 3 C " for any " > 0. In Federer [123], Theorem 2.8.4, this is even a consequence of the statement, just choose D 1 C 12 ". The following example shows that one cannot replace 5 by 3. Example 1.9. Let X D R and B2j 1 D B.2 2=j; 2 1=j / for j D 1; 2; ::: . In other terms, B2j 1 is the interval .1=j; 4 3=j /. Let also B2j D B2j 1 , j D 1; 2; ::: . Then 0 2 Bj for all j D 1; 2; ::: , and thus any disjoint subfamily must consist of just one ball, say Bk . If k D 2j S11is odd, then 3Bk is the interval .4 C 1=j; 8 5=j / and therefore does not cover j D1 Bj D .4; 4/. The case when k is even is similar, and hence the constant 5 in the 5-covering lemma cannot be replaced by 3. Proof of Proposition 1.6. Fix x0 2 Y WD supp and let " > 0 and R > 0. Let B D fB.x; "/ W x 2 Y \ B.x0 ; R/g: By the 5-covering lemma (Lemma 1.7), we can find a subfamily B 0 B of pairwise disjoint balls so that [ [ B 5B: Y \ B.x0 ; R/ B2B
As
X B2B 0
.B/ D
[
B2B 0
B .B.x0 ; R C "// < 1;
B2B 0
and .B/ > 0 for every B 2 B 0 , we conclude that B 0 is a countable set. The centres of the balls B 2 B 0 make a countable "-net in Y \ B.x0 ; R/. S Letting " D 1=n, n D 1; 2; ::: , shows that Y \ B.x0 ; R/ is separable. Thus Y D j1D1 .Y \ B.x0 ; j // is also separable. That Y is second countable and Lindelöf follows from Proposition 1.5. Lemma 1.10 (Cavalieri’s principle). Let be a measure on X . If f W X ! Œ0; 1 is a -measurable function and 0 < q < 1, then Z 1 Z f q d D q q1 .fx W f .x/ > g/ d : X
0
1.2 Preliminaries
7
The Cavalieri principle is a standard tool in integration theory, we state it here for the reader’s convenience. Sometimes it is the case q D 1 that is called the Cavalieri principle, but the general case follows after the change of variable 7! q . The Cavalieri principle can be proved in several different ways, e.g. using the Fubini theorem. The most convenient way actually depends on how the Lebesgue integral is defined and the proof truly belongs to integration theory. We refer the reader in need to Folland [124], Proposition 6.24. Another result which eventually will be needed is that continuous functions can be approximated by Lipschitz functions on compact sets. Recall that f W Y ! R is Lipschitz on the metric space .Y; d / if there exists a constant C such that jf .x/ f .y/j Cd.x; y/
for all x; y 2 Y:
Proposition 1.11. Let .Y; d / be a compact metric space and let u 2 C.Y / and " > 0. Then there is v 2 Lip.Y / such that supy2Y ju.y/ v.y/j < ". This follows from the Stone–Weierstrass theorem (see e.g. Rudin [312], p. 122), but for the reader’s convenience, we give an elementary proof of this fact. Proof. We can assume that minY u D 0 and let Gk D fx 2 Y W u.x/ > k"g for positive integers k. Clearly, only finitely many Gk are nonempty. As Y is compact, xk , and hence there exists ı > 0 so that dist.Gk ; Y n Gk1 / ı whenever so is each G Gk ¤ ¿. Let, for x 2 Y , u" .x/ D "
X
k1
1
dist.Gk ; x/ ı
; C
where we only sum over nonempty Gk . Then u" 2 Lip.Y / (with constant "=ı) and ju.x/ u" .x/j " for all x 2 Y . We will also need to approximate lower semicontinuous functions by Lipschitz functions from below. Proposition 1.12. Let .Y; d / be a compact metric space and let u W Y ! .1; 1 be lower semicontinuous. Then there exists an increasing sequence fuj gj1D1 of Lipschitz functions such that uj .x/ ! u.x/, as j ! 1, for all x 2 Y . If u 0, then we may choose uj 0, j D 1; 2; ::: . In fact it is fairly easy to see that the uj constructed below is the largest j -Lipschitz function u (apart from the case when u 1 when no such largest function exists). Proof. As u is lower semicontinuous on a compact set, it attains its minimum, which by assumption is not 1. Hence, without loss of generality, we may assume that u 0. If u 1, then we can take uj j , j D 1; 2; ::: , and we therefore exclude this case below. Fix a positive integer j , and let uj .x/ D inf .u.y/ C jd.x; y//: y2Y
8
1 Newtonian spaces
It is easy to see that uj is real-valued and that 0 uj uj C1 u. Let us first show that uj is j -Lipschitz. Let x; y 2 Y and " > 0. Then we can find z 2 Y such that uj .x/ > u.z/ C jd.z; x/ ". It follows that uj .y/ u.z/ C jd.z; y/ u.z/ C jd.z; x/ C jd.x; y/ < uj .x/ C jd.x; y/ C ": Letting " ! 0 shows that uj .y/ uj .x/ C jd.x; y/. As we also have uj .x/ uj .y/ C jd.x; y/, we have shown that uj is j -Lipschitz. Let x 2 Y be arbitrary. It remains to show that uj .x/ ! u.x/, as j ! 1. Let < u.x/. As u is lower semicontinuous we can find a ball B D B.x; r/ in Y such that u > in B. For j =r we have uj .x/ D min inf .u.y/ C jd.x; y//; inf .u.y/ C jd.x; y// y2B y2Y nB min inf ; inf jr D : y2B
y2Y nB
Hence uj .x/ ! u.x/, as j ! 1.
1.3 Upper gradients and the Newtonian space N 1;p In this section we introduce upper gradients as a substitute for the modulus of the usual gradient. We will later see that under some assumptions it is possible to control a function by its upper gradients. On the other hand, in situations as in Example 1.22 the upper gradients do not give any information about the function. To begin with, we will leave this question aside and just concentrate on developing the theory of upper gradients, and p-weak upper gradients, whatever use they may have. In Chapters 3 and 4 we will introduce some conditions that will be sufficient for the upper gradients to control their functions. By a curve in X we will mean a rectifiable nonconstant continuous mapping from a compact interval. (For us only such curves will be interesting, in general a curve is a continuous mapping from an interval. A rectifiable curve is a curve with finite length.) A curve can thus be parameterized by arc length ds, and we will always assume that all curves are parameterized by arc length, see e.g. Ambrosio–Tilli [17], Section 4.2, or Heinonen [169], Section 7.1. Note that every curve is Lipschitz continuous with respect to its arc length parameterization. We let .X / denote the family of all curves on X . By abuse of notation we also denote the image of a curve by . Definition 1.13. A nonnegative Borel function g on X is an upper gradient of an extended real-valued function f on X if for all curves W Œ0; l ! X , Z jf ..0// f ..l //j g ds: (1.1)
1.3 Upper gradients and the Newtonian space N 1;p
9
R Recall our convention that 1 1 D 1 and .1/ .1/ D 1, so that g ds D 1 if at least one Rof f ..0// and f ..l // is infinite. Note that for a Borel function g 0, the integral g ds is defined (with a value in Œ0; 1) for all curves , x is a nonnegative Borel function. since g ı W Œ0; l ! R Note also that upper gradients are not unique. In particular, by adding a nonnegative Borel function to an upper gradient of f we obtain a new upper gradient of f . The function g 1 is an upper gradient of every function. The following simple proposition provides us with plenty nontrivial examples of upper gradients. Proposition 1.14. If f W X ! R is locally Lipschitz, then the lower pointwise dilation lip f .x/ D lim inf
sup
r!0 y2B.x;r/
jf .y/ f .x/j r
(1.2)
is an upper gradient of f . Proof. Let W Œ0; l ! X be a curve. Since is parameterized by arc length, it is 1-Lipschitz, and thus f ı is Lipschitz and hence absolutely continuous on Œ0; l (see Definition 1.57 for the definition of absolute continuity). We thus have Z l Z l Z jf ..0// f ..l //j j.f ı /0 .t /j dt .lip f / ı .t / dt D lip f ds: 0
0
1 Corollary 1.15. If X D Rn and f 2 Cloc .Rn /, then jrf j is an upper gradient of f .
Proof. For all x 2 Rn and all y 2 B.x; r/ we have jf .y/ f .x/j D jru.x/ .y x/ C o.jy xj/j r jru.x/j C o.r/: Inserting this into the definition (1.2) of lip f .x/ finishes the proof. This result will be extended to locally Lipschitz functions in Corollary 1.47, and further refined in Propositions A.3 and A.11. Note that if g and g 0 are upper gradients of u and v, respectively, then g g 0 is in general not an upper gradient of u v. (An easy example is to let u.x/ D x, v.x/ D x and g D g 0 1 on R, in which case g g 0 0 is not an upper gradient of .u v/.x/ D 2x.) However, we have the following subadditivity result. Lemma 1.16. Let g and g 0 be upper gradients of u and v, respectively, and a 2 R. Then jajg and g C g 0 are upper gradients of au and u C v, respectively. Proof. This follows immediately from Definition 1.13. Now that we have upper gradients, it is possible to define analogues of Sobolev spaces on metric measure spaces.
10
1 Newtonian spaces
Definition 1.17. Whenever u 2 Lp .X /, let Z kukN 1;p .X/ D
juj d C inf X
1=p
Z p
g
p
g d
;
X
where the infimum is taken over all upper gradients g of u. The Newtonian space on X is the space N 1;p .X / D fu W kukN 1;p .X/ < 1g: Let us here point out that we assume that functions are defined everywhere, and not just up to an equivalence class in the corresponding function space. When we say that u 2 N 1;p .X / we thus assume that u is a function defined everywhere. Remark 1.18. A minor point here which is easily overlooked is that one of course can use an equivalent norm, such as kukLp C inf g kgkLp , when studying N 1;p .X /. However, when we define the capacity in Definition 1.24 it is important to use our norm to get a subadditive capacity. In some situations we will also have use for some related spaces. Definition 1.19. Let us define the following spaces Nz 1;p .X / D N 1;p .X /= ; where u v if and only if ku vkN 1;p .X/ D 0, and Ny 1;p .X / D fu W u D v a.e. for some v 2 N 1;p .X /g: Note that in ku vkN 1;p .X/ , the infimum is taken over upper gradients of u v, not over upper gradients of u and v. We equip Nz 1;p .X / and Ny 1;p .X / with the norms induced by N 1;p .X / (so that kukNy 1;p .X/ D kvkN 1;p .X/ if Ny 1;p .X / 3 u D v 2 N 1;p .X / a.e.). It is not obvious that the norm on Ny 1;p .X / is well defined, but this follows from Lemma 1.62 below. Let us already here point out that the equivalence classes in Nz 1;p .X / are not up to measure zero, but are finer than that, in fact, as we will see, they are up to capacity zero. In Proposition 1.65 we will find that Ny 1;p .X /= ae Š Nz 1;p .X /, where u ae v if u D v a.e. The space Ny 1;p .X /= ae is closer to traditional Sobolev spaces since it has a.e.-equivalence classes. It will however turn out to be both useful and important for us to have the more refined q.e.-equivalence classes in Nz 1;p .X / (i.e. to study the functions in N 1;p .X /), see e.g. the discussion following Proposition 1.65. That N 1;p .X /, Nz 1;p .X / and Ny 1;p .X / are vector spaces follows directly from Lemma 1.16. The only difficulty with showing that k kN 1;p .X/ is a norm on Nz 1;p .X / (and a seminorm on N 1;p .X /) is to prove the triangle inequality. To see this, let u; v 2
1.3 Upper gradients and the Newtonian space N 1;p
11
N 1;p .X / and " > 0 be arbitrary. Find upper gradients g; g 0 2 Lp .X / of u and v, respectively, so that p p 1=p .kukL kukN 1;p .X/ C "; p .X/ C kgkLp .X/ / p 0 p 1=p .kvkL kvkN 1;p .X/ C ": p .X/ C kg kLp .X/ /
(1.3)
By Lemma 1.16, g C g 0 is an upper gradient of u C v. Now, note that the left-hand sides in (1.3) are l p -norms (on R2 ) of .kukLp .X/ ; kgkLp .X/ /
.kvkLp .X/ ; kg 0 kLp .X/ /;
and
respectively. Similarly, p 0 p 1=p ku C vkN 1;p .X/ .ku C vkL p .X/ C kg C g kLp .X/ /
..kukLp .X/ C kvkLp .X/ /p C .kgkLp .X/ C kg 0 kLp .X/ /p /1=p ; which is the l p -norm of .kukLp .X/ C kvkLp .X/ ; kgkLp .X/ C kg 0 kLp .X/ /: The triangle inequality for the l p -norm now implies that p p p 1=p 0 p 1=p ku C vkN 1;p .X/ .kukL C .kvkL p .X/ C kgkLp .X/ / p .X/ C kg kLp .X/ /
kukN 1;p .X/ C " C kvkN 1;p .X/ C " and letting " ! 0 proves the triangle inequality for k kN 1;p .X/ . The completeness of Nz 1;p .X /, i.e. that it is a Banach space, is harder to prove and will be obtained in Theorem 1.71. Theorem 1.20. The space N 1;p .X / is a lattice, i.e. if u; v 2 N 1;p .X /, then maxfu; vg; minfu; vg 2 N 1;p .X /: Proof. Let w D maxfu; vg 2 Lp .X /. Let further g; g 0 2 Lp .X / be upper gradients of u and v, respectively, and g 00 WD g C g 0 2 Lp .X /. Then for a curve W Œ0; l ! X we have jw..0// w..l //j ju..0// u..l //j C jv..0// v..l //j Z Z Z 0 g ds C g ds D g 00 ds;
and thus g 00 is an upper gradient of w, and w 2 N 1;p .X /. The proof for minfu; vg is similar.
12
1 Newtonian spaces
With a little more care one easily sees that maxfg; g 0 g is an upper gradient of minfu; vg and of maxfu; vg. In Corollary 2.20 we give more precise information about the best upper gradients of minfu; vg and maxfu; vg. The following is an immediate consequence of Theorem 1.20. Corollary 1.21. Assume that u 2 N 1;p .X /. Then uC ; u ; juj 2 N 1;p .X /. The following examples show that in some cases the theory of upper gradients becomes quite pathological. Example 1.22. If the space X contains no nonconstant rectifiable curves, e.g. if X is discrete (or more generally totally disconnected), or the von Koch snowflake curve (see Example 1.23 below), then g 0 is an upper gradient of any function. Hence it follows that N 1;p .X / D Lp .X /. Example 1.23. In this example we consider the von Koch snowflake curve, which is a famous example of a curve of infinite length containing no rectifiable curves. Let K0 R2 , the 0th generation, be an equilateral triangle with side length 1. For each of the three sides, split it into three intervals of equal length and replace the middle one I by two sides I 0 and I 00 of an equilateral triangle (with sides I , I 0 and I 00 ) outside K0 . We have thus produced the 1st generation K1 of the von Koch snowflake curve consisting of 12 pieces of length 13 each. Continuing in this way we obtain the nth generation Kn consisting of 3 4n pieces, each of length 3n . In the limit we obtain the von Koch snowflake curve K, which can formally be defined as K D fx 2 R2 W for every " > 0 there is n > 1=" and y 2 Kn so that jx yj < "g; or, in other terms, K is the Hausdorff limit of Kn , as n ! 1. We equip K with the distance from R2 . In this case, any curve (in the traditional sense) between two distinct points on K has infinite length and thus is not rectifiable. Hence there are no nonconstant rectifiable curves, and as in Example 1.22, g 0 is an upper gradient of any function, and N 1;p .K/ D Lp .K/. This in fact happens regardless of which measure we equip K with. For instance, one can equip K with the d -dimensional Hausdorff measure, with d D log 4=log 3, making it into an Ahlfors d -regular space, see Definition 3.4.
1.4 The Sobolev capacity Cp Definition 1.24. The capacity of a set E X is the number Cp .E/ D inf kukpN 1;p .X/ ; where the infimum is taken over all u 2 N 1;p .X / such that u 1 on E.
1.4 The Sobolev capacity Cp
13
This capacity is sometimes referred to as the Sobolev capacity. We say that a property regarding points in X holds quasieverywhere (q.e.) if the set of points for which it fails has capacity zero. Just as sets of zero measure are important in integration theory, sets of zero capacity will be important to us. Most of the time it is the distinction between sets of zero and positive capacity that will matter, though there are exceptions when the actual value of the capacity is important, e.g. in the Wiener criterion and the fine topology, see Sections 11.4 and 11.6. For most parts of the book we have p fixed and do not discuss dependence on p. However, the dependence of the capacity on p is discussed a little in Section 2.9. Remark 1.25. Maybe some words on our choice of terminology can be useful. The capacity depends on p, but we have refrained from making this dependence explicit in the notation and thus do not write “p-capacity” nor “p-q.e.”. This is in contrast to “p-modulus”, “p-a.e. curve” and “p-weak upper gradient” for which we have decided to make the p explicit. This is partly because they are less used and the dependence on p might otherwise be overlooked by some readers; with “capacity” and “q.e.” we see no such risk. In the later part of the book, Chapters 7–14, we have again refrained from making the dependence on p explicit when writing “minimizer”, “subminimizer”, “superminimizer”, “subharmonic” and “superharmonic”. We however do write “p-harmonic” as “harmonic” sounds too linear to us. When calculating capacities it is often convenient to use the following result. Sometimes we will use the intermediate consequence that the capacity is obtained by taking the infimum over functions u E . Under additional assumptions on X , it is possible to further restrict the collection of functions which are used to test the capacity, see Theorem 6.7. Proposition 1.26. Let E X . Then Cp .E/ D inf kukpN 1;p .X/ ; where the infimum is taken over all u 2 N 1;p .X / such that E u 1 on X . Proof. This follows easily by truncation. Let u 2 N 1;p .X / be such that u 1 on E. Let further v D minfu; 1gC , W Œ0; l ! X be a curve, and g be an upper gradient of u. Then Z jv..0// v..l //j ju..0// u..l //j g ds;
and thus g is an upper gradient also of v. Since jvj juj we have that kvkN 1;p .X/
14
1 Newtonian spaces
kukN 1;p .X/ . It thus follows that Cp .E/
inf
kvkpN 1;p .X/
inf
kukpN 1;p .X/ D Cp .E/:
E v1
u1 on E
inf
vDminfu;1gC u1 on E
kvkpN 1;p .X/
The capacity satisfies a number of properties. To begin with, we will need the following properties. Theorem 1.27. Let E; E1 ; E2 ; ::: be arbitrary subsets of X . Then (i) Cp .¿/ D 0; (ii) .E/ Cp .E/; (iii) if E1 E2 , then Cp .E1 / Cp .E2 /; (iv) Cp is countably subadditive and is also an outer measure, i.e. Cp
1 [ iD1
1 X Ei Cp .Ei /: iD1
In order to prove (iv) we need the following lemma. Lemma 1.28. Let ui 1, i D 1; 2; ::: , be functions with upper gradients gi , and let u D supi ui and g D supi gi . Then g is an upper gradient of u. Remark 1.29. Observe that if we remove the assumption that the functions ui be uniformly bounded from above, then the lemma becomes false. This is due to the special treatment of the function values ˙1 in Definition 1.13, and is most easily seen by letting ui i, u 1, g gi 0, and observing that g is not an upper gradient of u (if there are nonconstant curves in X ). See also Lemma 1.52. Proof. Let W Œ0; l ! X be a curve. Let us first observe that u..0// u..l // D sup.ui ..0// u..l /// sup.ui ..0// ui ..l ///: i
i
Together with the corresponding inequality for u..l // u..0// we get that Z Z ju..0// u..l //j sup jui ..0// ui ..l //j sup gi ds g ds: i
i
Proof of Theorem 1.27. The proofs of (i)–(iii) are trivial. (iv) We may assume that the right-hand side is finite. Let " > 0. Choose ui with Ei ui 1 and upper gradients gi such that p p kui kL p .X/ C kgi kLp .X/ Cp .Ei / C
" : 2i
1.5 p-weak upper gradients and modulus of curve families
15
Let u D sup S i ui and g D supi gi . By Lemma 1.28, g is an upper gradient of u. Clearly u 1 on 1 iD1 Ei . Hence Cp
1 [
Ei kukpN 1;p .X/
iD1
Z
X
D
sup ui
p
Z d C
i
Z X 1 X iD1 1 Z X
upi d C
X iD1 1 X
upi
iD1
D"C
1 X
X 1 X
Z
X iD1
Z
d C
Cp .Ei / C
X
sup gi
p
d
i
gip d
gip
d
" 2i
Cp .Ei /:
iD1
Letting " ! 0 completes the proof of (iv). An easy, but interesting, consequence of the definition of the capacity is the following result. Proposition 1.30. If u 2 N 1;p .X /, then Cp .fx W ju.x/j D 1g/ D 0. Proof. Let E˙ D fx W u.x/ D ˙1g. Then u=k 1 on EC for all k > 0. Thus u p kukpN 1;p .X/ Cp .EC / 1;p D ! 0; k N .X/ kp
as k ! 1:
Similarly Cp .E / D 0 (consider the function v WD u). Thus, by Theorem 1.27 (iv), Cp .fx W ju.x/j D 1g/ Cp .EC / C Cp .E / D 0.
1.5 p-weak upper gradients and modulus of curve families The following example illustrates a drawback of upper gradients, viz. that they are not preserved by Lp -convergence. This will make it necessary for us to study p-weak upper gradients. Example 1.31. Let E D f0g X D R2 and 1 < p < 2. Let also f D E and ´ 1=j jxj; jxj 1; gj .x/ D j D 1; 2; ::: : 0; jxj > 1;
16
1 Newtonian spaces
Then gj is an upper gradient of f and since kgj kLp .X/ ! 0, as j ! 1, we see that kf kN 1;p .X/ D 0 (and also that Cp .E/ D 0). However, the zero function is not an upper gradient of f , nor is, in fact, any function g such that g D 0 a.e. To see this, observe that if g D 0 a.e., then for a.e. ˛, g D 0 a.e. on ˛ , where ˛ .t / D .t cos ˛; t sin ˛/, 0 t 1, by Fubini’s theorem (in polar coordinates). For such ˛ we have Z jf ..0// f ..1//j D 1 > 0 D g ds; ˛
showing that g is not an upper gradient of f . Thus the set of upper gradients of f is not a closed subset of Lp .X / (or more correctly of the cone LpC .X / of nonnegative functions in Lp .X /). To overcome this complication we introduce p-weak upper gradients below. Later, in Section 2.2, we will show that any Newtonian function has a minimal p-weak upper gradient. (In the example above one can alternatively use the upper gradients ´ 1=jxj; jxj 1=j; gQj .x/ D j D 1; 2; ::: :/ 0; jxj > 1=j; Definition 1.32. A nonnegative measurable function g on X is a p-weak upper gradient of an extended real-valued function f on X if for p-a.e. curve W Œ0; l ! X (i.e. with the exception of a curve family of zero p-modulus, see below), Z jf ..0// f ..l //j g ds: (1.4)
R
It is implicitly assumed that g is such that g ds is defined (with a value in Œ0; 1) for p-a.e. curve. However, this is actually a consequence of the fact that g is assumed to be nonnegative and measurable, as we will see in Lemma 1.43. Recall the convention that 1 1 D 1, see also the comments after Definition 1.13. Definition 1.33. Let be a family of curves on X . Then we define the p-modulus of
by Z Modp . / D inf
p d; X
where the infimum is taken over all nonnegative Borel functions such that for all 2 .
R
ds 1
By Proposition 1.2, weRmay as well take the infimum over all nonnegative measurable functions such that ds 1 for all 2 . (In fact, using Proposition 1.37 it is easy to show that the infimum can as well be taken over all nonnegative measurable
1.5 p-weak upper gradients and modulus of curve families
17
R functions such that ds 1 for p-a.e. 2 , but that cannot be used as the definition as the reasoning would be circular.) Just as with the capacity, it is whether the p-modulus is zero or not that will be important to us. The actual value plays a role only in (b) below, but this is a result we will not need; for us the weaker Corollary 1.38 will be sufficient. The reader who so wishes may therefore skip (b) below and its proof. Lemma 1.34. The following are true: (a) if 1 2 , then Modp . 1 / Modp . 2 /; S P (b) Modp j1D1 j j1D1 Modp . j /; (c) if for every 2 there exists a subcurve 0 2 0 of , then Modp . / Modp . 0 /. For the last part we need to make the following definition. Definition 1.35. A curve 0 is a subcurve of a curve W Œ0; l ! X if, after reparameterization and possibly reversion, 0 is equal to jŒa;b for some 0 a < b l . We also say that g is an upper gradient of f along if Z 0 0 jf . .0// f . .l 0 //j g ds 0
for every subcurve 0 W Œ0; l 0 ! X of . Note that, at a first glance, Lemma 1.34 (c) may look counterintuitive. However, as the proof shows, it is actually very natural. A simple illustration of the situation is provided by the following example. Example 1.36. Let X D R, D f g and 0 D f 0 g, where W Œ0; 2 ! R, 0 W Œ0; 1 ! R and .t / D 0 .t / D t . Then 0 is a subcurve of and and 0 satisfy the assumptions of Lemma 1.34 (c). For every admissible in the definition of Modp . /, we have Z
Z
2
1
dt 2
11=p
0
1=p
2 p
dt
;
0
with equalities for 12 . It follows that Modp . / D 21p 1 D Modp . 0 /; where Modp . 0 / is calculated similarly. This also shows that, roughly speaking, the longer the curves in , the smaller Modp . /.
18
1 Newtonian spaces
Proof of Lemma 1.34. (a) This is trivial, since the infimum in the definition of Modp . 1 / is taken over a larger set than the infimum defining Modp . 2 /. (b) Let " > 0 and let j be a nonnegative Borel function such that Z j ds 1 for all 2 j and such that Modp
R
p X j
1 [
d Modp . j / C "=2j . Let D supj j . Then
Z Z p
j p d D sup j d X
j D1
j
X
Z X 1 X j D1
jp
d D
1 Z X j D1 X
jp
d
1 X
Modp . j / C ":
j D1
Letting " ! 0 completes the proof of this part. (c) Let " > 0 and let be a nonnegative Borel function such that Z ds 1 for all 2 0
R
and such that X p d Modp . 0 / C ". Let next 2 . Then there is a subcurve 0 2 0 of . Hence Z Z ds ds 1: Thus Modp . /
R X
0
0
d Modp . / C " ! Modp . 0 /, as " ! 0. p
Proposition 1.37. Let x 2 X . The following are equivalent: (a) Modp . / D 0; (b) there is a nonnegative Borel function 2 Lp .X / such that 2 ;
R
ds D 1 for all
(c) there is a Rnonnegative such that 2 Lp .B.x; j // for all j D 1; 2; ::: , and such that ds D 1 for all 2 . See also Proposition 2.33 for another equivalent condition. Proof. (a) ) (b) For n D 1; 2; ::: there is a nonnegative Borel function n such that Z n and n ds 1 for all 2 : k n kLp .X/ 2 Let D
P1 nD1
n 2 Lp .X /. Then Z ds D 1
for all 2 :
1.5 p-weak upper gradients and modulus of curve families
19
(b) ) (c) This is trivial. (c) ) (a) By Proposition 1.2 there is a nonnegative Borel function O such that O D a.e. Let 1 X j O B.x;j / Q D 2 Lp .X /: j 2 k k O Lp .B.x;j // C 1 j D1
R
If 2 , then Q ds D 1, since is compact and thus contained in B.x; j / for some j . Thus also Z Q ds D 1 1 for all 2 : n p Hence Modp . / k =nk Q ! 0, as n ! 1. Lp .X/
Corollary 1.38. If Modp . j / D 0 for all j , then Modp
S1
j D1
j D 0.
This is a special case of Lemma 1.34 (b), but actually we will only need this special case in this book. We therefore provide a simpler proof, so that the reader who so wishes can skip Lemma 1.34 (b). Proof. By Proposition 1.37, for j D 1; 2; ::: , there exists a nonnegative function j 2 Lp .X / such that Z j ds D 1 for all 2 j :
Let further D
1 X j D1
Then
j j 2 k j kLp .X/
2 Lp .X /:
Z ds D 1
for all 2
Hence Modp
S1
j D1
1 [
j :
j D1
j D 0, by Proposition 1.37.
The following corollary is a direct consequence of Corollary 1.38. Note that, in the same way as upper gradients, p-weak upper gradients are not unique. Corollary 1.39. Let g and g 0 be p-weak upper gradients of u and v, respectively, and a 2 R. Then jajg and g Cg 0 are p-weak upper gradients of au and uCv, respectively. Note that it is not true in general that g g 0 is a p-weak upper gradient of u v. The following lemma strengthens the definition of p-weak upper gradients and will be often used in our proofs, even without notice.
20
1 Newtonian spaces
Lemma 1.40. If g is a p-weak upper gradient of f on X and
D f 2 .X / W g is not an upper gradient of f along g; then Modp . / D 0. Proof. Let 0 consist of those curves 0 W Œ0; l 0 ! X such that Z 0 0 g ds jf . .0// f . .l 0 //j 6 0
(which in particular is true if the integral is not defined). Then Modp . 0 / D 0 by assumption. Moreover, for every 2 there is a subcurve 0 2 0 . It follows that Modp . / D 0, by Lemma 1.34 (c). Definition 1.41. Let
E D f 2 .X / W 1 .E/ ¤ ¿g
C and E D f 2 .X / W ƒ1 . 1 .E// ¤ 0g:
Here ƒ1 is the Lebesgue measure on R, extended as an outer measure to all subsets of R. (Note that X D .X /.) C Lemma 1.42. If .E/ D 0, then Modp . E / D 0. C Proof. Let F E be a Borel set with .F / D 0, and let D 1F . For 2 E , we 1 1 have ƒ1 . .F // ¤ 0. Moreover, .F / is a Borel set, and thus Z C ds D 1 for all 2 E :
Z
Hence C / Modp . E
p d D 0: X
Lemma 1.43. Let g and gQ be nonnegative measurable functions on X such that g D gQ a.e. Then Z Z g ds D gQ ds for p-a.e. curve . In particular,
R
g ds is defined for p-a.e. curve (with a value in Œ0; 1).
Proof. By Proposition 1.2 there is a nonnegative Borel function Rg 0 which equals g a.e. Let E D fx 2 X W g.x/ ¤ g 0 .x/g. As g 0 is a Borel function, g 0 ds is defined for C every curve . For curves 2 .X / n E , Z Z g ds D g 0 ds: (1.5)
C
Since .E/ D 0, we have Modp . E / D 0, by Lemma 1.42, and thus (1.5) holds for p-a.e. curve R. R Similarly gQ ds D g 0 ds for p-a.e. curve .
1.5 p-weak upper gradients and modulus of curve families
21
Corollary 1.44. Let g be a p-weak upper gradient of f , and let gQ D g a.e., gQ 0. Then gQ is also a p-weak upper gradient of f . In particular, there is a Borel p-weak upper gradient g 0 of f such that g 0 D g a.e. The following example shows that the corresponding result for upper gradients is false. Example 1.45. Let f W R2 ! R be given by f ..x1 ; x2 // D x1 . Then g D 1 is an upper gradient of f . Let further g 0 D gR2 nR . Then g 0 D g a.e. and g 0 is a nonnegative Borel function which is not an upper gradient of f . Nevertheless, g 0 is a p-weak upper gradient of f , by Corollary 1.44. The following result shows that the N 1;p -norm is not changed if the infimum in Definition 1.17 is taken over all p-weak upper gradients of u. Note that even though this result is mainly of interest when g 2 Lp .X /, this is not required. Lemma 1.46. Let g be a p-weak upper gradient of f . Then there exist upper gradients gj so that (1.6) lim kgj gkLp .X/ D 0: j !1
Proof. First we can find a nonnegative Borel function g 0 such that g 0 D g a.e. By Lemma 1.43, g 0 is also a p-weak upper gradient of f . Let consist of those curves W Œ0; l ! X such that Z jf ..0// f ..l //j 6 g 0 ds:
By assumption, Modp . / D 0, and hence R by Proposition 1.37, there is a nonnegative Borel function 2 Lp .X / such that ds D 1 for all 2 . Let finally gj D g 0 C =j . Then gj is an upper gradient of f and (1.6) holds. The following result shows that p-weak upper gradients are a natural generalization of the (modulus of the) usual gradients. It is an improvement of Corollary 1.15 and will be further refined in Propositions A.3 and A.11. Corollary 1.47. If X D Rn and f W Rn ! R is locally Lipschitz, then jrf j (or more precisely any of its nonnegative everywhere defined representatives) is a p-weak upper gradient of f . Proof. Proposition 1.14 shows that lip f is an upper gradient of f . By the Rademacher theorem (see e.g. Theorem 2.2.1 in Ziemer [361]), f is differentiable at a.e. x 2 Rn . For such x and all y 2 B.x; r/ we have jf .y/ f .x/j D jrf .x/ .y x/ C o.jy xj/j r jrf .x/j C o.r/ and hence lip f .x/ D jrf .x/j. The result now follows from Corollary 1.44.
22
1 Newtonian spaces
We shall next see that there is an intimate relation between small sets and small curve families. Proposition 1.48. Let E X . Then Cp .E/ D 0 if and only if .E/ D Modp . E / D 0. Proof. Assume first that .E/ D Modp . E / D 0. Let u D E . Then on p-a.e. curve u 0, and therefore g 0 is a p-weak upper gradient of u. It follows that p p Cp .E/ kukpN 1;p .X/ kukL p .X/ C kgkLp .X/ D 0:
Assume conversely that Cp .E/ D 0. It follows directly that .E/ Cp .E/ D 0. For each j D 1; 2; ::: , let uj 2 N 1;p .X / be a nonnegative function with upper gradient gj , such that kuj kN 1;p .X/ < 2j ;
kgj kLp .X / < 2j and uj E : P P Let u D j1D1 uj 2 Lp .X / and g D j1D1 gj 2 Lp .X /. Let further F D fx 2 X W u.x/ D 1g E; ˚ R
D W g ds D 1 ;
.F / D f W F g: Since g 2 Lp .X / we have Modp . / D 0. Moreover, for 2 .F / we have Z Z u ds D 1 ds D 1:
As u 2 Lp .X / we have Modp . .F // D 0, by Proposition 1.37. Let now 2 .X /n. [ .F //. Then, in particular, there is y 2 with u.y/ < 1. So for all x 2 we have u.x/ D lim
k!1
k X
uj .x/ lim
j D1
u.y/ C lim
k!1
k X
k!1
k Z X j D1
uj .y/ C
j D1
k X
juj .x/ uj .y/j
j D1
Z gj ds D u.y/ C
g ds < 1:
Thus x … F , and hence X n F . Therefore E F [ .F / has zero p-modulus. Corollary 1.49. If u D v q.e. and g is a p-weak upper gradient of u, then g is also a p-weak upper gradient of v (and thus, u and v have the same set of p-weak upper gradients).
1.5 p-weak upper gradients and modulus of curve families
23
Proof. Let E D fx W u.x/ ¤ v.x/g. By assumption, Cp .E/ D 0, and by Proposition 1.48, Modp . E / D 0. Hence u v on p-a.e. curve . It then easily follows that if g is a p-weak upper gradient of u, then it is also of v. Proposition 1.50. Assume that .E/ D 0 and that g 0 is such that for p-a.e. curve W Œ0; l ! X it is true that either Z .0/; .l / 2 E or ju..0// u..l //j g ds: (1.7)
Then g is a p-weak upper gradient of u. The following consequence is immediate upon letting E D fx 2 X W ju.x/j D 1g. x be a function which is finite a.e. and assume that Corollary 1.51. Let u W X ! R g 0 is such that for p-a.e. curve W Œ0; l ! X it is true that either Z ju..0//j D ju..l //j D 1 or ju..0// u..l //j g ds:
Then g is a p-weak upper gradient of u. The essence of this corollary is that as long as u is real-valued a.e. it makes no difference how we interpret the inequality (1.4) in Definition 1.32 in the special case when the left-hand side is either j1 1j or j.1/ .1/j. Our main interest is in 1;p N 1;p (and Nloc ) functions, and such functions are necessarily real-valued a.e. Proof of Proposition 1.50. Let be the set of the exceptional curves for which (1.7) does not hold for some subcurve of . Then Modp . / D 0 by Lemma 1.34. Let also C
.E/ D f W Eg. Since .E/ D 0 we have Modp . .E// Modp . E / D 0, by Lemma 1.42. Let 2 .X / n . [ .E//. Then there is t 2 Œ0; l such that .t/ … E. If t D 0 or t D l , then Z ju..0// u..l //j g ds;
by assumption. Otherwise ju..0// u..l //j ju..0// u..t //j C ju..t // u..l //j Z Z Z g ds C g ds D g ds; jŒ0;t
jŒt;l
since the second alternative in (1.7) holds for jŒ0;t and jŒt;l . We have thus shown that g is a p-weak upper gradient of u.
24
1 Newtonian spaces
Recall our convention that 1 1 D 1. In particular, the second alternative in (1.7) does not hold for jŒ0;t if t D 0 and u..0// D ˙1, and therefore the cases t D 0 and t D l needed separate treatment above. Note that in the context of Corollary 1.51 this is not necessary. Lemma 1.28 has a direct counterpart for p-weak upper gradients. (Assuming that gi are merely p-weak upper gradients, we obtain a p-weak upper gradient g with the same proof.) However, using Proposition 1.50 (with E D fx 2 X W u.x/ D 1g), we can show the following stronger result. Lemma 1.52. Let uj be functions with p-weak upper gradients gj , and let u D supj uj , g D supj gj and E D fx W u.x/ D 1g. If .E/ D 0, then g is a p-weak upper gradient of u. Note that unlike in Lemma 1.28, here we do not assume that uj are uniformly bounded from above. Recall also the discussion in Remark 1.29 showing that without any condition on E this lemma would be false. is not an upper Proof. Let j be the set of the exceptional curves along which gj S gradient of uj , j D 1; 2; ::: . Let W Œ0; l ! X be a curve not in j1D1 j and let x D .0/ and y D .l /. Assume that either u.x/ < 1 or u.y/ < 1. Then, as in the proof of Lemma 1.28, Z Z ju.x/ u.y/j sup juj .x/ uj .y/j sup gj ds g ds: j
j
It follows from Corollary 1.51 that g is a p-weak upper gradient of u. Finally, we show that for almost all purposes we can forget about X n supp and replace X by supp . Note, however, that we do not want to assume X D supp in general, see the comment before Proposition 1.6. Proposition 1.53. Let Z D X n supp . Then Cp .Z/ D 0 and Modp . Z / D 0. Proof. As Z is open, the function g D 1Z is an upper gradient of u D Z as R g ds D 1 for any curve starting in Z and ending in supp . Hence Cp .Z/ p kukN 1;p .X/ D 0. That also Modp . Z / D 0 follows from Proposition 1.48.
1.6 Banach space and ACCp On Rn it is well known that every Sobolev function has a representative which is ACL, i.e. absolutely continuous on almost every line parallel to the axes, see e.g. Theorem 2.1.4 in Ziemer [361]. On metric spaces we have no preferred lines, but we can obtain a stronger result, Theorem 1.56 below. In fact, for this we only need the existence of a p-integrable upper gradient, which justifies the following definition.
1.6 Banach space and ACCp
25
Definition 1.54. We say that a measurable function belongs to the Dirichlet space D p .X / if it has an upper gradient in Lp .X /. In view of Lemma 1.46 it is equivalent to assume the existence of a p-weak upper gradient in Lp .X /. Clearly, N 1;p .X / D p .X /, and Lemma 1.16 immediately implies that D p .X / is a vector space. Theorem 1.55. The space D p .X / is a lattice. Proof. The proof of Theorem 1.20 in fact also yields this result. Theorem 1.56. If u 2 D p .X /, then u 2 ACCp .X /, i.e. u is absolutely continuous on p-a.e. curve in the sense that u ı W Œ0; l ! R is absolutely continuous for p-a.e. curve in X . Let us recall the definition of absolute continuity. Definition 1.57. A function f W Œa; b ! R is absolutely continuous on Œa; b if for every " > 0 there is ı > 0 such that n X
jf .bi / f .ai /j < "
iD1
for any n and any a a1 < b1 a2 < b2 an < bn b such that n X
.bi ai / < ı:
iD1
This is not the right place to study the basic facts about absolutely continuous functions. Let us however recall that a large motivation for their study is the fact that f is absolutely continuous on Œa; b if and only if f 0 2 L1 .Œa; b/ and Z f .x/ D f .a/ C
x
f 0 .t / dt
for all x 2 Œa; b:
a
See e.g. Folland [124], Theorem 3.35, or Rudin [311], Theorem 7.20 together with the comments just before Definition 7.17. We will need the following simple facts. Lemma 1.58. If u and v are absolutely continuous on Œa; b, then u C v, maxfu; vg and uv are also absolutely continuous on Œa; b. If u W Œa; b ! Œc; d is absolutely continuous and v W Œc; d ! R is Lipschitz, then v ı u is also absolutely continuous on Œa; b.
26
1 Newtonian spaces
Proof. Let us start with uv: As u and v obviously are continuous they P are bounded on Œa; b, say by M > 0. Let " > 0 and choose ı > 0 so small that if niD1 .bi ai / < ı for any a a1 < b1 a2 < b2 an < bn b, then n X iD1
ju.bi / u.ai /j <
" 2M
and
n X
jv.bi / v.ai /j <
iD1
" : 2M
Thus n X
ju.bi /v.bi / u.ai /v.ai /j
iD1
n X
.ju.bi /v.bi / u.bi /v.ai /j
iD1
D
n X iD1
M
C ju.bi /v.ai / u.ai /v.ai /j/ .ju.bi /j jv.bi / v.ai /j C jv.ai /j ju.bi / u.ai /j/
n X
jv.bi / v.ai /j C M
iD1
n X
ju.bi / u.ai /j
iD1
" " CM <M 2M 2M D ": To show that u C v and maxfu; vg are absolutely continuous is easier and we leave it to the reader. As for the composition v ı u, let " > 0 and choose ı according to the definition of absolute continuity of u. Let also M > 0 be a Lipschitz constant for v. Then n X
j.v ı u/.bi / .v ı u/.ai /j M
iD1
n X
ju.bi / u.ai /j < M "
iD1
for any n and any a a1 < b1 a2 < b2 an < bn b such that n X
.bi ai / < ı:
iD1
Proof of Theorem 1.56. By Definition 1.54, there is an upper Rgradient g 2 Lp .X / of u. Let be the collection of all curves in X such that g ds D 1. Then Modp . / D 0 by Proposition 1.37. Let now 2 .X / n . Then for all a; b 2 Œ0; l , Z g ds < 1; (1.8) j.u ı /.a/ .u ı /.b/j jŒa;b
and, in particular, .u ı /.a/; .u ı /.b/ 2 R.
1.6 Banach space and ACCp
27
Assume that u is not absolutely continuous on , i.e. that f WD uı is not absolutely continuous on Œ0; l . Then there is an " > 0 such that for every j D 1; 2; ::: , there are 0 aj;1 < bj;1 aj;nj < bj;nj l such that nj X
.bj;i
iD1
Let Ej D
Snj
1 aj;i / < j 2
iD1 Œaj;i ; bj;i .
"
nj X iD1
nj X
and
jf .bj;i / f .aj;i /j ":
iD1
Then by (1.8) and dominated convergence, Z
jf .bj;i / f .aj;i /j
g ds ! 0;
as j ! 1:
jEj
But this is a contradiction. Hence f is absolutely continuous on , and u is absolutely continuous on p-a.e. curve. We shall next see that the equivalence classes for Newtonian functions are finer than for Sobolev functions. Remember that functions in N 1;p .X / are defined everywhere and that Nz 1;p .X / is the corresponding quotient space, see Definition 1.19. Proposition 1.59. If u; v 2 ACCp .X / (in particular if u; v 2 N 1;p .X /), and u D v a.e., then u D v q.e. Proof. Without loss of generality we may assume that v 0 (consider otherwise C / D 0. We also u v). Let E D fx W u.x/ ¤ 0g. Since .E/ D 0, we have Modp . E know that u is absolutely continuous on p-a.e. curve. So on p-a.e. curve , u is both absolutely continuous and ƒ1 . 1 .E// D 0. On such curves u D 0 a.e. with respect to arc length, and by continuity everywhere. Thus … E . Hence Modp . E / D 0, and by Proposition 1.48, Cp .E/ D 0. Corollary 1.60. If u; v 2 ACCp .X / (in particular if u; v 2 N 1;p .X /), and u v a.e., then u v q.e. Proof. Let f D minfu; vg 2 ACCp .X /. Since u v a.e. we have f D v a.e. Thus u f D v q.e., by Proposition 1.59. The following result shows that the equivalence classes in Nz 1;p .X / are up to sets of capacity zero, and not up to measure zero as for usual Sobolev spaces on Rn . This also shows that two functions in the same equivalence class in Nz 1;p .X / have the same set of p-weak upper gradients (by Corollary 1.49). x be a function. Then kukN 1;p .X/ D 0 if and only if Proposition 1.61. Let u W X ! R Cp .fx W u.x/ ¤ 0g/ D 0. x then v D u q.e. if and only if Moreover, if u 2 N 1;p .X / and v W X ! R, 1;p v 2 N .X / and v u.
28
1 Newtonian spaces
Proof. Let E D fx W u.x/ ¤ 0g. Assume first that kukN 1;p .X/ D 0. Then u 2 N 1;p .X / and u D 0 a.e., so by Proposition 1.59, u D 0 q.e., and thus Cp .E/ D 0. Conversely, assume that Cp .E/ D 0. Corollary 1.49 shows that 0 is a p-weak upper gradient of u. Moreover, .E/ D 0, by Theorem 1.27. Hence kukN 1;p .X/ D 0. The last part is obtained by applying the first part to u v. We are now ready to show that the norm in Ny 1;p .X /, which was introduced after Definition 1.19, is well defined. Lemma 1.62. Assume that u 2 Ny 1;p .X / and that v; w 2 N 1;p .X / are such that u D v D w a.e. Then kvkN 1;p .X/ D kwkN 1;p .X/ , i.e. kukNy 1;p .X/ is well defined and equal to kvkN 1;p .X/ D kwkN 1;p .X/ . Proof. It follows from Proposition 1.59 that v D w q.e. Hence, by Proposition 1.61, kv wkN 1;p .X/ D 0, which implies that kvkN 1;p .X/ D kwkN 1;p .X/ . As there are sets with zero measure and positive capacity we have shown that N 1;p .X / and Ny 1;p .X / are (in general) different spaces. The following results give some more insight in this direction. Proposition 1.63. Let u 2 Ny 1;p .X /. Then u 2 N 1;p .X / if and only if u 2 ACCp .X /. Proof. The necessity follows from Theorem 1.56. For the sufficiency assume that u 2 ACCp .X /. By assumption, there is v 2 N 1;p .X / ACCp .X / such that u D v a.e., but then u D v q.e., by Proposition 1.59. Hence, by Proposition 1.61, kuvkN 1;p .X/ D 0, and thus also u 2 N 1;p .X /. Example 1.64. The function R equals zero a.e. in R2 and is therefore a representative of a Sobolev function. It is, however, a bad representative of the zero function, as it is not absolutely continuous on any line parallel to the y-axis. In our notation, it belongs to Ny 1;p .R2 /, but not to N 1;p .R2 /. In view of Proposition 1.61, any Newtonian representative of the zero function must be zero q.e. Proposition 1.65. Ny 1;p .X /= ae Š Nz 1;p .X / WD N 1;p .X /= , where u ae v if and only if u D v a.e. In Rn and many other situations, Sobolev spaces are usually defined as sets of a.e.equivalence classes, which corresponds to the left-hand side above. This result shows that we obtain essentially the same Sobolev spaces with our definition, even though we insist on having the smaller q.e.-equivalence classes. We have just weeded out the bad representatives of Sobolev functions, see Example 1.64. Our q.e.-representatives have the additional property of belonging to ACCp .X /, something not shared by general a.e.-representatives. We will later find additional advantages of q.e.-representatives, e.g. in connection with quasicontinuity (see e.g. Proposition 5.33) and resolutivity (see e.g. Theorem 10.12).
1.6 Banach space and ACCp
29
Proof. Let f1 and f2 be two representatives of one equivalence class in Nz 1;p .X /. Then f1 ; f2 2 N 1;p .X / Ny 1;p .X /. Moreover, f1 D f2 q.e., by Proposition 1.61, and hence a.e., by Theorem 1.27. Thus they belong to the same equivalence class in Ny 1;p .X /= ae . Conversely, let f1 and f2 be two representatives of one equivalence class in 1;p y N .X /= ae . Then, by the definition of Ny 1;p .X /, there are f10 ; f20 2 N 1;p .X / such that fj0 D fj a.e., j D 1; 2. Hence also f10 D f20 a.e. and consequently, q.e., by Proposition 1.59. Therefore f10 and f20 both define the same equivalence class in Nz 1;p .X /, and there is thus a one-to-one correspondence between the a.e.-equivalence classes in Ny 1;p .X /= ae and the q.e.-equivalence classes in Nz 1;p .X /. Finally, kf1 kNy 1;p .X/ D kf10 kN 1;p .X/ , showing that the norms are the same for the corresponding equivalence classes. Proposition 1.63 gave us a characterization of “good” representatives, but it is not obvious from this characterization that a continuous representative is always “good”. Let us therefore show this, and a bit more. Proposition 1.66. Let u 2 Ny 1;p .X / and E X be such that Cp .E/ D 0 and ujXnE is continuous. Then u 2 N 1;p .X /. Note that we do not require u to be continuous at all points in X n E, we only require that the restriction of u to X n E is continuous. A function u satisfying our condition is weakly quasicontinuous, see Definition 5.17 (but the converse is not true). In fact, (weak) quasicontinuity characterizes the “good” representatives, under some additional assumptions on X , see Proposition 5.33. We do not know if that characterization holds in general, and therefore the result here is of interest. Proof. By assumption, there is a function v 2 N 1;p .X / such that v D u a.e. Let A D fx W u.x/ ¤ v.x/g so that .A/ D 0. By Lemma 1.42 and Proposition 1.48, Modp . E / D Modp . AC / D 0. As v 2 ACCp .X /, by Theorem 1.56, we thus see that p-a.e. curve is such that v is absolutely continuous on and … E [ AC . Since … E , u is continuous on . Moreover, as … AC , u D v a.e. on . As u and v are continuous on and equal a.e. on , we must have u D v everywhere on . In particular, u is absolutely continuous on , and hence u 2 ACCp .X /. By Proposition 1.59, u D v q.e., and thus u 2 N 1;p .X /, by Proposition 1.61. A corresponding result is true also for D p in the following form. x be such that there is v 2 D p .X / with u D v a.e. Let Proposition 1.67. Let u W X ! R further E X be such that Cp .E/ D 0 and ujXnE is continuous. Then u 2 D p .X /. The proof is the same as above, apart from that rather than applying Proposition 1.61 at the very end, we need to apply its proof. Another consequence of our definition of Newtonian functions is the equality between the essential supremum and the q.e.-essential supremum defined as follows.
30
1 Newtonian spaces
x define Definition 1.68. For A X and f W A ! R, Cp - ess sup f D inffk 2 R W Cp .fx 2 A W f .x/ > kg/ D 0g; A
Cp - ess inf f D supfk 2 R W Cp .fx 2 A W f .x/ < kg/ D 0g: A
As a corollary of Proposition 1.59 we make the following useful observation. Corollary 1.69. If u 2 ACCp .X / (in particular if u 2 N 1;p .X /), then ess sup u D Cp - ess sup u and X
X
ess inf u D Cp - ess inf u: X
X
Proof. Theorem 1.27 (ii), shows that ess supX u Cp - ess supX u. In particular, the equality holds if ess supX u D 1. Otherwise, let > ess supX u, 2 R, be arbitrary. Then u a.e., and thus u q.e., by Corollary 1.60, showing that Cp - ess supX u . Letting ! ess supX u shows that ess supX u Cp - ess supX u. The second equality follows by applying the first equality to u. The following generalization of Proposition 1.30 is also worth pointing out. Corollary 1.70. If u 2 ACCp .X / and u is finite a.e., which in particular holds if u 2 N 1;p .X /, then u is finite q.e. Proof. Let E D fx W u.x/ 2 Rg and let v D uE . Let be a curve on which u is absolutely continuous. Then v D u on . Thus v 2 ACCp .X /. By Proposition 1.59, v D u q.e., and as v is real-valued the conclusion follows. Theorem 1.71. The space Nz 1;p .X / D N 1;p .X /= is a Banach space. Proof. That Nz 1;p .X / is a normed linear space was observed after Definition 1.19. We need to show the completeness. Let fuj gj1D1 be a Cauchy sequence in N 1;p .X /. By passing to a subsequence, if necessary, we can assume that kuj C1 uj kN 1;p .X/ < 2j.pC1/=p < 2j : Let
(1.9)
Ej D fx 2 X W juj C1 .x/ uj .x/j > 2j g:
Then Cp .Ej / 2jp kuj C1 uj kpN 1;p .X/ < 2j . (Note that if juj C1 .x/j D juj .x/j D 1, then we consider juj C1 .x/ uj .x/j D 1, and thus x 2 Ej . In view of Proposition 1.30 this does not cause any trouble.) Let 1 1 [ \ Fk D Ej and F D Fk : j Dk
kD1
1.7 Examples
31
Then Cp .Fk / < 21k and Cp .F / D 0. Let x 2 X n F . Then x 2 X n Fl for some l and juj C1 .x/ uj .x/j 2j for all j l. Hence uj .x/ is a Cauchy sequence in R and we can define u.x/ D lim uj .x/ D uk .x/ C j !1
1 X
.uj C1 .x/ uj .x//:
(1.10)
j Dk
The function u is defined q.e. (and we may define it arbitrarily elsewhere) and ku uk kLp .X/ < 21k , by (1.9). As Cp .F / D 0, p-a.e. curve in X has empty intersection with F , by Proposition 1.48. Let be one such curve, connecting x and y. Then by (1.10), j.u uk /.x/ .u uk /.y/j
1 X
j.uj C1 uj /.x/ .uj C1 uj /.y/j
j Dk
Z X 1
gj ds;
j Dk
where gj is an upper gradient of uj C1 uj such that kgj kLp .X/ < 2j . Hence, P gQ k D j1Dk gj is a p-weak upper gradient of u uk and kgQ k kLp .X/ < 21k . It follows that ku uk kN 1;p .X/ ! 0, as k ! 1. As a corollary of the proof we obtain the following result. Corollary 1.72. Assume that uj ! u in N 1;p .X /, as j ! 1. Then there is a subsequence which converges to u pointwise q.e. Moreover, for every " > 0 there is a set E with Cp .E/ < ", such that the subsequence converges uniformly to u outside of E. Furthermore, if all uj are continuous, then the subsequence converges uniformly (though not necessarily to u) outside open sets of arbitrarily small capacity. Proof. In the notation of the proof of Theorem 1.71, we obtain a subsequence (again denoted by fuj gj1D1 ) which converges to uQ 2 N 1;p .X / uniformly outside of Fk for every k, and thus pointwise outside of F . Note that if all uj are continuous, then all Fk are open. Clearly, u uQ and Proposition 1.61 shows that u D uQ q.e. Letting E D Fk [ fx W u.x/ ¤ u.x/g, Q for suitably large k, finishes the proof.
1.7 Examples Let us take the opportunity to mention some examples of metric spaces on which the Newtonian theory can be interesting. (See also Appendix A, where examples of spaces with doubling measures supporting Poincaré inequalities are discussed in greater detail.) The first example is of course Rn . In this case the Newtonian space N 1;p .Rn / is essentially the standard Sobolev space W 1;p .Rn /. More precisely, if Rn , then
32
1 Newtonian spaces
W 1;p ./ D Ny 1;p ./ and N 1;p ./ is the same space but with less representatives in the equivalence classes, in fact it singles out exactly the nice representatives which are quasicontinuous, as we shall see in Section 5.2. The same is true on weighted Rn with p-admissible weights, see Appendix A.2. The next type of examples that comes to mind are probably Riemannian manifolds. Again, the Newtonian space will be the same as the usual Sobolev space, but with only the good, quasicontinuous, representatives. A particular application here is that one can take limits of sequences of Riemannian manifolds, under Gromov–Hausdorff convergence (which is sometimes called Vietoris convergence). Such limits are typically not manifolds, but are indeed metric spaces and Newtonian spaces are well suited to be defined on them. Another example is the Heisenberg group H1 as well as higher order Heisenberg groups, more general Carnot groups and Carnot–Carathéodory spaces, see Appendix A.6. Yet other examples are simplicial complexes, with simplices glued to each other. Such glueing can be made along different types of faces and it is even possible for the complex to have (highest-order) simplices of different dimension in different parts. The simplest example is probably glueing the segment Œ1; 0 f0g (with the onedimensional Lebesgue measure) to the triangle f.x; y/ W 0 y x 1g (with a weighted two-dimensional measure) at .0; 0/. See Appendix A.4 for more complicated examples. Even discrete objects, such as graphs, can be included in our theory. Here one has to consider the so-called metric graphs, see Appendix A.5. All of the examples above can be equipped with doubling measures and support Poincaré inequalities, under suitable conditions. So in particular, most of the results we show in Chapters 3–6 are valid for these spaces, and they are also under consideration for the potential theory developed in Chapters 7–14. In many of these examples one has a natural vector-valued gradient, and one can also apply Cheeger’s theorem (Theorem B.6) to show that a vector-valued gradient structure exists. A disadvantage of using Cheeger’s theorem is that it does produce a vector-valued gradient structure, but this structure is not unique. Moreover, one always uses an inner product to take the length of the Cheeger gradient. It is thus not easy to understand what the Cheeger gradient, or its length, really determines, in particular its connection with the geometry of the space. The upper gradient on the other hand has a very geometric definition. Nevertheless, the results we obtain in Chapters 7–14 are valid also for Cheeger p-harmonic functions, see Section 7.1 and Appendix B.2. Further examples include open subsets of the spaces above, as well as closed and other nonopen subsets. Such examples usually do not support Poincaré inequalities, nor are the restricted measures usually doubling, see however Appendix A.3, where uniform domains are discussed. For open subsets one still gets a natural gradient from the gradient in the ambient space, a fact that we exploit to deduce many of our results, such as quasicontinuity, for open subsets of (often complete) doubling p-Poincaré spaces.
1.7 Examples
33
For nonopen sets one cannot just restrict the gradient from the ambient space. Here comes another advantage of the Newtonian approach, the Newtonian spaces are directly definable on nonopen subsets of our ambient space. For other types of Sobolev spaces on X one can of course say that a function f is in the Sobolev space on a subset E if there is some open set G E such that f is in the Sobolev space on G (with G being allowed to depend on f ). For Newtonian spaces the advantage is that we do not have to go outside of E to define N 1;p .E/. So, in particular, the Newtonian approach is ideal for defining Sobolev spaces on various closed subsets E of Rn . Of course, one has to remember that if E contains too few curves then N 1;p .E/ may be of little use, as e.g. with the von Koch snowflake curve, see Example 1.23. However, in the case when E is the closure of an open set, then the Newtonian space N 1;p .E/ has applications in the boundary value theory, and does make results more general than what can be achieved using classical Sobolev spaces. In such cases we do not know if all functions in N 1;p .E/ are quasicontinuous, but nevertheless they are better representatives than the usual a.e.-Sobolev functions, see the discussion on the zero p-weak upper gradient property in the notes to Chapter 5. There is yet another reason for studying potential theory on subsets of Rn (or other metric spaces). Consider X D R2 n ..1; 1/ .0; 1// which is a complete doubling p-Poincaré space. The potential theory we develop in the later part of the book can thus be applied. Let D B..0; 0/; 1/ be the unit ball. In X , it has the boundary @X D f.x; y/ 2 R2 W x 2 C y 2 D 1 and y 0g. Let also E D .1; 1/ f0g and f 2 C.@X /. By the methods in Chapter 10 we can solve the Dirichlet problem and find the p-harmonic function Pf in having boundary values f on @X . One can actually show that this solution is the p-harmonic function u D Pf in n E having boundary values f on @X and satisfying the zero Neumann boundary condition @u D0 @n
on E;
see also Example 8.18. This is true in much more general situations. When the missing boundary, denoted by E above, is less regular, we often cannot talk about normal derivatives in the usual sense. Our way of solving the Dirichlet problem in such situations still gives rise to a very general weak-type zero Neumann boundary condition. Theorem A.21 shows that the closure of any uniform domain in Rn serves as a complete doubling p-Poincaré space and thus the above mixed boundary value problem can be considered on subsets of it. For instance, we can let X be the closed bounded set in R2 , whose boundary is the von Koch snowflake curve K, see Example 1.23. Solving the Dirichlet problem on an open subset of X corresponds to solving the mixed boundary value problem on n K with Dirichlet boundary values on @X and zero Neumann boundary values on K \ . Thus we are actually able to handle rather general mixed boundary value problems within our treatment of the Dirichlet problem.
34
1 Newtonian spaces
1.8 Notes Upper gradients were introduced under the name very weak gradients by Heinonen and Koskela in [173], [174]. They were renamed upper gradients, for obvious reasons, when Koskela and MacManus [229] studied p-weak upper gradients for the first time. In Semmes [314], Definition 1.8, upper gradients are called generalized gradients. Cheeger [91] defines generalized upper gradients, which for p > 1 are roughly the same as p-weak upper gradients. Cheeger also defines Sobolev spaces on general metric spaces that coincide with Ny 1;p .X / if p > 1, see Appendix B.2. In some of the early papers on upper and p-weak upper gradients, it is not stated explicitly if the (p-weak) upper gradients are required to be Borel functions or not. However, since Borelness is sometimes used it may have been implicitly assumed. Requiring that upper gradients be Borel functions has some definite advantages. First of all, the concept of upper gradients becomes totally independent of the measure, and second, the curve integrals involved are always defined. As for p-weak upper gradients the situation is different. At first (when care was taken) it was assumed that p-weak upper gradients be Borel, the reasons for this being that it would prevent any problems with the curve integrals not being defined, and in view of Proposition 1.2 it was not believed to do any harm. However, when working on the book Heinonen–Koskela–Shanmugalingam–Tyson [177], it was observed by Heinonen (as communicated to us by Shanmugalingam [322]), that care has to be taken in glueing formulas such as in Section 2.4, as the glued p-weak upper gradient may fail to be Borel even if the initial p-weak upper gradients are Borel. The immediate response was that one has to take extra care when formulating similar results. In Björn–Björn [44], Section 3 (which incidentally does not appear in Björn– Björn [45]), a different remedy was suggested which we follow here: to omit the assumption of Borelness for p-weak upper gradients. Let us name some of the reasons for this: (a) In Definition 1.32 it is enough if the curve integrals are defined for p-a.e. curve, and in fact this is automatic for nonnegative measurable functions, by Lemma 1.43. (b) Just requiring measurability of course means that the concept of p-weak upper gradients, in contrast to that of upper gradients, is dependent on the measure. However, even the concept of Borel p-weak upper gradients is dependent on the measure as the inequality is required to just hold for p-a.e. curve. (c) The glueing formulas in Section 2.4 become more appealing. Also, how to interpret j1 1j is often not mentioned explicitly. However, taking into account Corollary 1.51, it makes no difference for p-weak upper gradients how j1 1j is interpreted, at least not when only Newtonian functions are under consideration. Lemma 1.34 for metric spaces is in Heinonen–Koskela [174], p. 9, where they observe that the proofs of the corresponding Euclidean results in Fuglede [128] carry over verbatim. Fuglede was the first one to study p-modulus. The 2-modulus and its inverse extremal length were introduced by Beurling in the early 1930s, but first published in the joint papers Ahlfors–Beurling [6], [7]. Proposition 1.37 also goes back
1.8 Notes
35
to Fuglede [128]. A thorough study of extremal length and p-modulus for p 1 in weighted Rn is in Ohtsuka [299]. Newtonian spaces were first defined in Shanmugalingam [318] and [319]. Therein one can find Theorems 1.20 and 1.71, Corollaries 1.21 and 1.72, and Lemma 1.42. Also Theorem 1.56 and Proposition 1.59 (stated only for u 2 N 1;p .X /) can be found in [319], as well as the “only if” part of Proposition 1.48. The “if” part seems to be new here. An equivalence between the modulus and a variational capacity (see Section 6.3) has been obtained by Heinonen–Koskela [174] and Kallunki [Rogovin]– Shanmugalingam [194]. Some estimates for the modulus of curve families in ring domains on metric spaces can be found in Adamowicz–Shanmugalingam [3] and Garofalo–Marola [138]. Lemma 1.46 was first proved by Koskela–MacManus [229], Lemma 2.4. Lemma 1.43 is from Björn–Björn [44] (but is not included in [45]), while Corollary 1.51 is from Björn–Björn–Parviainen [54]. The direction in Proposition 1.63 which is not covered by Theorem 1.56, as well as Propositions 1.66 and 1.67, seems to be new here. If X is a complete doubling p-Poincaré space, then any function with an upper gradient in Lp .X / is measurable, by Theorem 4.52. Thus the measurability assumption can be dropped from the definition of the Dirichlet space D p .X /, Definition 1.54, under these assumptions. In general, however, it is easy to see that measurability is not a redundant assumption in Definition 1.54, consider e.g. the von Koch snowflake curve in Example 1.23. For p D 1, one often studies BV-functions, functions of bounded variation, which in some problems appear as the natural limit of W 1;p , as p ! 1C. We have not pursued that, since our main interest is to study the theory for p > 1 and we include the case p D 1 only when it comes for free. BV-functions have been studied on metric spaces by Ambrosio [14], [15], Camfield [83], Miranda [286], Ambrosio– Miranda–Pallara [16], Kinnunen–Korte–Shanmugalingam–Tuominen [210], [211], Hakkarainen–Kinnunen [156] and Hakkarainen–Shanmugalingam [157]. A further generalization of Newtonian spaces are Orlicz–Sobolev spaces based on upper gradients. They have been studied by e.g. Aïssaoui [12], [13], Heikkinen– Tuominen [167], Mocanu [291] and Tuominen [339], [340], [341]. Estimates and inequalities for Orlicz–Sobolev capacities on metric spaces can be found in Aïssaoui [11], J. Björn–Onninen [71], Costea [102] and Tuominen [339]. Mocanu [288], [289], [290] studies Newtonian spaces and capacities in even more general settings. Variable exponent Newtonian spaces N 1;p.x/ were studied by Harjulehto–Hästö–Pere [160] and Futamura–Harjulehto–Hästö–Mizuta–Shimomura [129]. Throughout the book we have restricted ourselves to real-valued Newtonian functions. Newtonian spaces for Banach-space valued functions were studied by Heinonen–Koskela–Shanmugalingam–Tyson [176], [177]. The (first part of the) 5-covering lemma (Lemma 1.7) has many names in the literature, including the basic covering lemma and the simple Vitali lemma and is often attributed to Vitali [348] or Wiener [353]. However, Vitali [348] obtains a much stronger result under stronger assumptions: he requires every point in the set E under
36
1 Newtonian spaces
consideration to be covered by arbitrarily small balls (a so-called Vitali covering) and obtains a disjoint covering of all of E but for a set of measure zero. (Vitali’s formulation is a bit different, but it is relatively easy to see that it is equivalent to the modern formulation, especially for open E.) It is therefore more correct to reserve the name Vitali covering theorem for this result. Wiener [353], on the other hand, may have been the first to consider coverings which need not be arbitrarily small around every point. He assumes that every point in E is the centre of some ball in the covering and finds a disjoint subfamily whose measure is at least a fixed positive portion of the measure of E. However, he does not consider blow-ups of the disjoint balls (not even in the proof). Morse [292], Theorem 3.5, seems to be the first one proving the 5-covering lemma as formulated here, and he does so in metric spaces. In fact, Morse studies coverings by more general sets and the 5-covering lemma is a special case of his result. This may have been the first time when the conclusion is that certain blow-ups of the disjoint sets (balls in our case) cover E, rather than a measure-theoretic conclusion as in Vitali’s and Wiener’s theorems. However, already Banach [27], when giving a new proof of (the modern formulation of) Vitali’s covering theorem, shows that certain blow-ups of the disjoint balls cover E, but he does not obtain the 5-covering lemma since he has stronger assumptions. He too studies coverings by more general sets than balls. Federer [123], Theorem 2.8.4, proves an even more general result than Morse, from which the 5-covering lemma follows by choosing D 2 and letting ı be the radius of the balls. Choosing D 1 C 12 " gives a .3 C "/-covering lemma, cf. Remark 1.8. Let us finally mention that the name Newtonian comes from the fact that the definition of upper gradients is related to the Newton–Leibniz formula, and the notation L1;p was already reserved for other spaces.
Chapter 2
Minimal p-weak upper gradients
By definition, upper gradients are not unique. Nor are the p-weak upper gradients. Indeed, adding a nonnegative Borel (measurable) function to a (p-weak) upper gradient results in a new (p-weak) upper gradient. Later in this book we will study p-harmonic functions as local minimizers of the p-energy integral Z inf g p d (2.1) g
from the definition of k kN 1;p .X/ . It is not obvious that this infimum can be attained. Example 1.31 shows that in general this is impossible for upper gradients, but fortunately, the situation is different for p-weak upper gradients. In this chapter, we shall prove the existence and study some properties of minimal p-weak upper gradients, which minimize (2.1) and are true substitutes for jruj in metric spaces. Note however that unless there are some additional geometrical assumptions on the metric space, the minimal p-weak upper gradient need not provide any control of the function itself, cf. Example 1.22.
2.1 Fuglede’s lemma We start this section by proving a fundamental lemma which guarantees that a minimizing sequence in (2.1) gives rise to a p-weak upper gradient. We also provide several useful consequences of this lemma, which will be needed later. Lemma 2.1 (Fuglede’s lemma). Assume that gj ! g in Lp .X /, as j ! 1. Then there is a subsequence (again denoted by fgj gj1D1 ) such that for p-a.e. curve , Z Z gj ds ! g ds; as j ! 1;
where all the integrals are well defined and real-valued. Moreover, for p-a.e. curve , Z jgj gj ds ! 0; as j ! 1:
In fact, we will only use this with g and gj nonnegative. However, it may be worth observing that the positivity of g and gj are not essential for this result. The second part is an easy consequence of the first part, but will actually not be needed here.
38
2 Minimal p-weak upper gradients
Proof. By passing toRa subsequence we may assume that kgj gkLp .X/ < 2j : By Lemma 1.43, gC ds is well defined with a value in Œ0; 1 for p-a.e. curve. By R R Proposition 1.37, gC ds < 1 for p-a.e. curve. Similarly g ds is well defined R and real-valued for p-a.e. curve. Thus g ds is well defined and real-valued for p-a.e. curve. Arguing similarly for each j and using Corollary 1.38,R we see that there is a curve family with Modp . / D 0 and such that the integrals gj ds, j D 1; 2; ::: , R and g ds are well defined and real-valued for 2 .X / n . Let next ² ³ Z Z z
D 2 .X / n W gj ds 6! g ds; as j ! 1 ; ² ³ Z 1
k D 2 .X / n W lim sup jgj gj ds > ; k D 1; 2; ::: : k j !1 S z 1 k , and that it is enough to show that Modp . k / D 0 It is easy to see that
kD1 for every k. P1 Let m D k j DmC1 jgj gj. Then Z m ds > 1 for all 2 k and m D 1; 2; ::: : p m p So Modp . k / k m kL / ! 0, as m ! 1. p .X/ < .k2 The last part follows directly as Modp . k / D 0 for every k, but can also be deduced by applying the first part to the functions gj0 D jgj gj and g 0 D 0.
For us, the most important application of Fuglede’s lemma will be the following convergence results for p-weak upper gradients. For future references, we formulate them as three propositions, even though they are closely related. In particular, Proposition 2.2 is almost a special case of Proposition 2.4, but the assumptions on f are weaker and the proof is simpler. In fact, as we mainly work with Newtonian functions, Proposition 2.4 is not needed later in the book, but we have chosen to include it for completeness and future references. It combines some features of Propositions 2.2 and 2.3. Note also that in view of Example 1.31 there is no hope for similar convergence results for upper gradients. Proposition 2.2. Assume that f 2 D p .X / and that gj 2 Lp .X / are p-weak upper gradients of f , j D 1; 2; ::: . Assume further that gj ! g in Lp .X /, as j ! 1, and that g is nonnegative. Then g is a p-weak upper gradient of f . Proof. By Lemma 1.40 and Fuglede’s lemma (Lemma 2.1), p-a.e. curve R is such that R gj is an upper gradient of f along for all j D 1; 2; ::: , and gj ds ! g ds 2 R, as j ! 1. Consider such a curve W Œ0; l ! X . Then Z Z jf ..l // f ..0//j lim gj ds D g ds: j !1
39
2.1 Fuglede’s lemma
Hence g is a p-weak upper gradient of f . Sometimes it will be useful to also have the following more general consequence of Fuglede’s lemma (Lemma 2.1). Proposition 2.3. Assume that fj 2 N 1;p .X / and that gj 2 Lp .X / is a p-weak upper gradient of fj , j D 1; 2; ::: . Assume further that fj ! f and gj ! g in Lp .X /, as j ! 1, and that g is nonnegative. Then there is a function fQ D f a.e. such that g is a p-weak upper gradient of fQ, and thus fQ 2 N 1;p .X /. There is also a subsequence such that fjk ! fQ q.e., as k ! 1. ffjk g1 kD1 Moreover, if either f 2 N 1;p .X / or there is a subsequence ffjk g1 such that kD1 fjk ! f q.e., as k ! 1, then we may choose fQ D f . Observe that we do not show that fj ! fQ in N 1;p .X /, as j ! 1. The reason for this is that it is not true in general. To see this we need the concept of minimal p-weak upper gradients, and the counterexample is therefore postponed until the next section, see Example 2.12. Proof. By passing to a subsequence if necessary we may R R assume that fj ! f a.e., and (by Fuglede’s lemma, Lemma 2.1) that gj ds ! g ds 2 R, as j ! 1, for all 2 .X / n , where Modp . / D 0. Let fQ D lim supj !1 fj , and observe that fQ is defined at every point of X and fQ D f a.e. in X . Let E D fx 2 X W jfQ.x/j D 1g. By Lemma 1.40, p-a.e. curve is such that gj is an upper gradient of fj along for all j D 1; 2; ::: , and neither nor any of its subcurves belong to . Consider such a curve W Œ0; l ! X . We see that either .0/; .l / 2 E or Z Z jfQ..l // fQ..0//j lim sup jfj ..l //fj ..0//j lim sup gj ds D g ds: j !1
j !1
As .E/ D 0, Corollary 1.51 shows that g is indeed a p-weak upper gradient of fQ. Let now fO D lim infj !1 fj . Arguing as above we see that g is also a p-weak upper gradient of fO 2 N 1;p .X / and that fO D f D fQ a.e. By Proposition 1.59 we see that fO D fQ q.e., and thus fj ! fQ q.e., as j ! 1. On the other hand, if f 2 N 1;p .X /, then by Proposition 1.59, f D fQ q.e. and hence g is a p-weak upper gradient also of f , by Corollary 1.49. Moreover, fj ! f q.e., as j ! 1. Finally, if fjk ! f q.e., as k ! 1, then again f D fQ q.e., and g is a p-weak upper gradient also of f , by Corollary 1.49. In the following proposition, we relax the assumption fj 2 N 1;p .X / and only concentrate on the convergence of p-weak upper gradients.
40
2 Minimal p-weak upper gradients
Proposition 2.4. Assume that fj 2 D p .X / and that gj 2 Lp .X / is a p-weak upper gradient of fj , j D 1; 2; ::: . Assume further that fj ! f q.e. and gj ! g in Lp .X /, as j ! 1, that f is real-valued a.e. and that g is nonnegative. Then g is a p-weak upper gradient of f . Recall the discussion in Remark 1.29 showing that the condition that f is realvalued a.e. is essential. Proof. By passingR to a subsequence if necessary we may assume (by Fuglede’s lemma, R Lemma 2.1) that gj ds ! g ds 2 R, as j ! 1, for all 2 .X / n , where Modp . / D 0. Let fQ D lim supj !1 fj and E D fx 2 X W jfQ.x/j D 1g. Then fQ D f q.e. By Lemma 1.40, p-a.e. curve is such that gj is an upper gradient of fj along for all j D 1; 2; ::: , and neither nor any of its subcurves belong to . Consider such a curve W Œ0; l ! X . We see that either .0/; .l / 2 E or Z Z jfQ..l // fQ..0//j lim sup jfj ..l //fj ..0//j lim sup gj ds D g ds: j !1
j !1
As .E/ D 0, Corollary 1.51 shows that g is indeed a p-weak upper gradient of fQ. Corollary 1.49 shows that g is also a p-weak upper gradient of f .
2.2 Minimal p-weak upper gradients In this section, we will single out a p-weak upper gradient which minimizes (2.1) both as an integral and pointwise a.e. It will play the role of jruj in the rest of the book. Our main result here is the following theorem. Theorem 2.5. Let u 2 D p .X /. There exists a minimal p-weak upper gradient gu 2 Lp .X / of u, i.e. gu g a.e. for all p-weak upper gradients g 2 Lp .X / of u. Moreover, gu is unique up to sets of measure zero. More precisely, the set of minimal p-weak upper gradients of u consists exactly of one equivalence class in the cone LpC .X /. We will exclusively use the notation gu to denote a minimal p-weak upper gradient of u. As before we assume that gu is defined everywhere, even if there is some freedom in its choice. The proof of Theorem 2.5 depends heavily on the following lemma, which is of independent interest and allows us to take the minimum of two p-weak upper gradients. Note that the corresponding result for upper gradients is not true, see Example 2.8.
2.2 Minimal p-weak upper gradients
41
Lemma 2.6. Let g1 ; g2 2 Lp .X / be p-weak upper gradients of u 2 D p .X /. Then g D minfg1 ; g2 g is also a p-weak upper gradient of u. Proof. By Corollary 1.44, we can assume that g1 and g2 are Borel functions. By R Proposition 1.37 and Lemma 1.40, p-a.e. curve in X is such that .g1 Cg2 / ds < 1 and both g1 and g2 are upper gradients along . Let W Œ0; l ! X be one such curve and let E D ft 2 .0; l / W g1 ..t // g2 ..t //g. Then E R is a Borel set and there exist open sets .0; l / U1 U2 E such that ƒ1 .Un n E/ ! 0, as n ! 1, where ƒ1 is the one-dimensional S Lebesgue measure. For a fixed n, write Un as a pairwise disjoint union Un D 1 iD1 Ii of open intervals Ii D .ai ; bi /, see Lemma 1.4. (Here we allow some of the intervals Ii to be empty.) Then ju..0// u..l //j ju..0// u..a1 //j C ju..a1 // u..b1 //j C ju..b1 // u..l //j Z Z g1 ds C g2 ds: jI1
jI1
Continuing in this way, we obtain for all j D 1; 2; ::: , Z Z ju..0// u..l //j g1 ds C jSj
g2 ds:
jSj
I i D1 i
I i D1 i
Letting j ! 1, monotone and dominated convergence show that Z Z ju..0// u..l //j g1 ds C g2 ds: jUn
jUn
Applying monotone and dominated convergence once more yields Z Z Z ju..0// u..l //j g1 ds C g2 ds D g ds: jE
jE
The following example shows that the assumption g1 ; g2 2 Lp .X / is needed in Lemma 2.6. Example 2.7. Let A be a Borel subset of Œ0; 1 R such that 0 < ƒ1 .A \ I / < ƒ1 .I / for every interval I Œ0; 1 of positive measure, where ƒ1 is the Lebesgue measure on R, see e.g. Exercise 33 in Chapter 1 in Folland [124]. Then both g1 D 1A and g2 D 1.1 A / are upper gradients of any measurable function on Œ0; 1, but their minimum, being zero, is not even a p-weak upper gradient (of any nonconstant function).
42
2 Minimal p-weak upper gradients
The upper gradients in the previous example were not integrable (but on the other hand they were upper gradients of all functions). Next, we will see that the minimum of two Lp -integrable upper gradients need not be an upper gradient. So Lemma 2.6 is the best we can hope for. Example 2.8. Let f D f0g 2 N 1;p .R2 /, 1 < p < 2, and ´ 1=jxj; jxj 1; g.x/ D 0; jxj > 1; which is an upper gradient of f . Let also 1 ° ± [ Œ22j ; 212j ; E1 D x 2 R2 W jxj 2 j D1
E2 D R2 n E1 and gj D gEj , j D 1; 2. We shall show that both g1 and g2 are upper gradients of f . Let W Œ0; l ! R2 be a curve. To show that g1 satisfies (1.1), we can assume that .0/ ¤ 0 D .l /. Let J 1 be an integer such that 212J j.0/j. For j D J; J C 1; ::: , consider the concentric annuli Aj D fx 2 R2 W 22j jxj 212j g; and let aj D infft 2 Œbj 1 ; l W .t / 2 Aj g
and
bj D supft 2 Œbj 1 ; l W .t / 2 Aj g;
where bJ 1 D 0. Note that bj aj 22j , since on its way to the origin has to pass through the annulus Aj , j D J; J C 1; ::: . As g1 D g 22j 1 in Aj , we obtain that Z Z 1 g1 ds g ds .bj aj / min g ; j D J; J C 1; ::: : Aj 2 jŒa ;b jŒa ;b \Aj j
j
j
j
Summing up over all j gives Z g1 ds
1 Z X j DJ
g1 ds D 1;
jŒaj ;bj
which shows that g1 is an upper gradient of f . A similar argument shows that g2 is also an upper gradient of f . Clearly, g1 ; g2 2 Lp .R2 /. The minimum minfg1 ; g2 g 0 is clearly not an upper gradient of f . In fact, as we observed in Example 1.31, no function vanishing a.e. is an upper gradient of f . Nevertheless, 0 is a p-weak upper gradient of f , by Lemma 2.6.
2.2 Minimal p-weak upper gradients
43
Proof of Theorem 2.5. Let I D inf g kgkLp .X/ , where the infimum is taken over all p-weak upper gradients of u, and choose a minimizing sequence fgj gj1D1 of p-weak upper gradients of u, so that kgj kLp .X/ ! I , as j ! 1. Let gNj D minfg1 ; ::: ; gj g, j D 1; 2; ::: . Then by Lemma 2.6, gNj is a p-weak upper gradient of u and gNj C1 gNj . Let gu D limj !1 gNj . The dominated convergence theorem shows that gNj ! gu in Lp .X /, as j ! 1, and by Proposition 2.2, gu is a p-weak upper gradient of u. Thus, I kgu kLp .X/ D lim kgNj kLp .X/ lim kgj kLp .X/ D I: j !1
j !1
Let g be another p-weak upper gradient of u. Lemma 2.6 shows that minfgu ; gg is also a p-weak upper gradient and hence kgu kLp .X/ D I kminfgu ; ggkLp .X/ kgu kLp .X/ : This shows that gu g a.e. As for the uniqueness, if g 0 is another minimal p-weak upper gradient then clearly gu D g 0 a.e. Moreover, if g 0 is nonnegative and g 0 D gu a.e., then g 0 is also a p-weak upper gradient, by Corollary 1.44, and is obviously minimal as well. The following corollary gives us a more elegant expression for the N 1;p -norm. p p Corollary 2.9. If u 2 N 1;p .X /, then kukpN 1;p .X/ D kukL p .X/ C kgu kLp .X/ .
Proof. By Lemma 1.46, we can find upper gradients gj so that kgj gu kLp .X/ ! 0, as j ! 1. Hence p p p p kukpN 1;p .X/ kukL p .X/ C lim kgj kLp .X/ D kukLp .X/ C kgu kLp .X/ : j !1
Conversely, gu g a.e. for every upper gradient g 2 Lp .X / of u. Hence p p p p kukpN 1;p .X/ D kukL p .X/ C inf kgkLp .X/ kukLp .X/ C kgu kLp .X/ ; g
where the infimum is taken over all upper gradients g of u. The following proposition clarifies the problem pointed out in Example 1.31. Proposition 2.10. For f 2 D p .X / let M be the set of all upper gradients of f which S of M in LpC .X / consists precisely of those belong to Lp .X /. Then the closure M p-weak upper gradients of f which are in Lp .X /. Moreover, S D fg 2 LpC .X / W g gf a.e.g: M By LpC .X / we mean the cone of nonnegative functions (not equivalence classes) in Lp .X /, equipped with the seminorm coming from k kLp .X/ .
44
2 Minimal p-weak upper gradients
S by Lemma 1.46. Proof. Let g 2 Lp .X / be a p-weak upper gradient of f . Then g 2 M S . Then there exist upper gradients gj 2 Lp .X / of f such Conversely, let g 2 M p that gj ! g in L .X /, as j ! 1. Proposition 2.2 shows that g is a p-weak upper gradient of f . That the set of p-weak upper gradients of f in Lp .X / is contained in M 0 WD fg 2 LpC .X / W g gf a.e.g follows from the minimality of gf . Conversely, for any function g 2 M 0 , we have g 0 WD minfg; gf g D gf a.e., and thus g 0 is also a p-weak upper gradient of f , by Corollary 1.44. Hence also g g 0 is a p-weak upper gradient of f . Remark 2.11. The requirement g 2 Lp .X / in Theorem 2.5 is essential, as we shall now see. Write all the rational numbers in X D Œ0; 1 R as a sequence, Q \ Œ0; 1 D fq1 ; q2 ; ::: g. For n D 2; 3; ::: , let En D
1 [
.qj nj ; qj C nj /
and gn D 1En :
j D1
Note that .En / 2=.n 1/ ! 0, as n ! 1. R y For all 0 x < y 1 and all n we have x gn ds D 1 and hence gn is an upper gradient of every measurable function on X . In particular, if u.x/ D x, then by Proposition A.3, gu D 1 and thus, gn D 0 < gu in X n En . Also, inf n gn D Q\Œ0;1 D 0 a.e. We are now able to show that (in general) fj 6! fQ in N 1;p .X /, as j ! 1, in Proposition 2.3. Example 2.12. Let X D Œ1; 1 R, F .x/ D jxj on X and extend F periodically to R so that F .x C 2/ D F .x/. Let further fj .x/ D F .jx/=j , gj 1, f 0 and g 1, j D 1; 2; ::: . Then the assumptions in Proposition 2.3 are fulfilled and we conclude that g is a p-weak upper gradient of f . However, fj 6! f in N 1;p .X /, as j ! 1, since the minimal p-weak upper gradient gfj f D jfj0 j D 1 a.e. for all j , by Proposition A.3. We can also observe that even though all gj are minimal p-weak upper gradients of fj (again by Proposition A.3), it does not follow that g is a minimal p-weak upper gradient of f . It is not clear whether we can deduce that fj ! f in N 1;p .X /, as j ! 1, if we assume a bit more as in the following question. Open problem 2.13. Assume that f; fj 2 N 1;p .X /, j D 1; 2; ::: , and that fj ! f and gfj ! gf in Lp .X /, as j ! 1. Is it then true that fj ! f in N 1;p .X /, as j ! 1?
2.3 Calculus for p-weak upper gradients
45
2.3 Calculus for p-weak upper gradients Let us point out that after Remark 2.28 we will refer to the results in this section as holding for the corresponding local spaces, whenever necessary. Even though the gradients dealt with in this book are only p-weak upper gradients, they still share many good properties with usual gradients, which makes it possible to use them in the theory of p-harmonic functions. In particular, we shall see in this and the next section that certain Leibniz and chain rules hold for p-weak upper gradients and that the minimal p-weak upper gradient is local. Lemma 2.14. Assume that u 2 ACCp .X / and that g 2 Lp .X / is a p-weak upper gradient of u. Then for p-a.e. curve W Œ0; l ! X , we have j.u ı /0 .t /j g..t // for a.e. t 2 Œ0; l :
(2.2)
Conversely, if g 0 is measurable, u 2 ACCp .X / and (2.2) holds for p-a.e. curve W Œ0; l ! X , then g is a p-weak upper gradient of u. Observe that the converse holds even if g is not in Lp .X /. However, the first part is false if we allow g to be an arbitrary p-weak upper gradient, see Remark 2.11. Proof. Assume first that u 2 ACCp .X / and that g 2 Lp .X / is a p-weak upper gradient of u. Let W Œ0; l ! X be Ra curve such that u is absolutely continuous on , g is an upper gradient along , and g ds < 1. This holds for p-a.e. curve. For a.e. t 2 .0; l /, u ı is differentiable at t and t is a Lebesgue point for g ı (in the sense that the last equality in (2.3) below holds). For such t we have ˇ ˇ ˇ u..t C h// u..t // ˇˇ ˇ j.u ı / .t /j D lim ˇ ˇ h h!0 0
1 h!0 h
Z
tCh
lim
g.. // d D g..t //:
(2.3)
t
Conversely, assume that g 0 is measurable, u 2 ACCp .X / and (2.2) holds for p-a.e. curve W Œ0; l ! X . RLet W Œ0; l ! X be a curve on which u is absolutely continuous, (2.2) holds, and g ds is well defined. This holds for p-a.e. curve, by Lemma 1.43. Then Z l Z l Z 0 j.u ı / .t /j dt g..t // dt D g ds: ju..0// u..l //j 0
0
Next we prove a Leibniz or product rule for p-weak upper gradients. Theorem 2.15 (Leibniz rule). If u; v 2 D p .X /, then jujgv C jvjgu is a p-weak upper gradient of uv.
46
2 Minimal p-weak upper gradients
Proof. As u, v, gu and gv are measurable, so is g D jujgv C jvjgu , and clearly g 0. Moreover, uv 2 ACCp .X /, by Lemma 1.58. Let W Œ0; l ! X be a curve on which (2.2) holds for both pairs .u; gu / and .v; gv / (in the place of .u; g/) and such that both u and v are absolutely continuous on . This is true for p-a.e. curve . In particular, j.uı /0 .t /j gu ..t // and j.vı /0 .t /j gv ..t // for a.e. t 2 Œ0; l . For such t we have letting w D uv, j.w ı /0 .t /j D ju..t //.v ı /0 .t / C v..t //.u ı /0 .t /j ju..t //jgv ..t // C jv..t //jgu ..t // D g..t //: By Lemma 2.14, g is a p-weak upper gradient of w D uv. Note that the p-weak upper gradient in the Leibniz rule (Theorem 2.15) need not be minimal. This is due to the absolute values, both those explicit and those implicit in gu (and gv ). Recall that gu corresponds to jruj rather than ru. For example, if X D Rn and v D 1=u, then in general, guv D 0 < 2jruj=juj D jujgv C jvjgu . Another example is to let u.x/ D x and v.x/ D x 2 on Œ0; 1 in which case gu .x/ D u0 .x/ D gv .x/ D v 0 .x/ D 1 (so these minimal p-weak upper gradients are equal to the corresponding derivatives, not just their absolute values), while guv .x/ D 2 2x and jujgv C jvjgu D 2. Theorem 2.16 (Chain rule). Let u 2 D p .X / and let ' W I ! R be locally Lipschitz, where I R is an interval. Assume that Cp .fx 2 X W u.x/ … I g/ D 0. Then j' 0 ı ujgu is a minimal p-weak upper gradient of ' ı u, where we consider ' 0 ı u to be 0 if it is not defined. Note that if I D R and u 2 N 1;p .X /, then Cp .fx 2 X W u.x/ … I g/ D 0 is immediate, by Proposition 1.30. Note also that if ' is continuously differentiable on I , then the use below of the chain rule from Theorem 1.74 in Malý–Ziemer [258], can be replaced by the elementary classical chain rule for differentiable functions. In fact, we will only use the chain rule (Theorem 2.16) for continuously differentiable functions '. Proof. We can redefine u on a set of capacity zero without affecting the p-weak upper gradients of u and ' ı u. We may thus assume that u.X / I . Moreover, by Proposition 1.48, such a change only affects u on p-almost no curve and thus we still have u 2 ACCp .X /. Let W Œ0; l ! X be a curve R on which u is absolutely continuous, (2.2) holds (with gu in the place of g), and gu ds < 1. Since both u ı and ' ı u ı are absolutely continuous, by Lemma 1.58, it is true that for a.e. t 2 Œ0; l both .u ı /0 .t / and .' ı u ı /0 .t / exist, and j.u ı /0 .t /j gu ..t //
and
j.' ı u ı /0 .t /j g'ıu ..t //;
(2.4)
47
2.3 Calculus for p-weak upper gradients
by Lemma 2.14. For a.e. such t , we have j.' ı u ı /0 .t /j D j' 0 .u..t ///.u ı /0 .t /j j' 0 .u..t ///jgu ..t //;
(2.5)
by the chain rule in Theorem 1.74 in Malý–Ziemer [258]. (The chain rule in [258] requires ' to be Lipschitz on R. Here J D u..Œ0; l // is a compact interval since u is continuous on . Thus ', by assumption, is Lipschitz on J . We can therefore use Theorem 1.74 in [258] with any Lipschitz extension of 'jJ to R, e.g. one of the McShane extensions given by Lemma 5.2 (applied to X D R).) Lemma 2.14 and (2.5) imply that j' 0 ı ujgu is a p-weak upper gradient of ' ı u and hence j' 0 ı ujgu g'ıu a.e. To show minimality, observe that (2.5) and (2.4) yield j.u ı /0 .t/j D j' 0 .u..t ///j1 j.' ı u ı /0 .t /j j' 0 .u..t ///j1 g'ıu ..t //; where we interpret j' 0 .u..t ///j1 as 1, whenever j' 0 .u..t ///j D 0. Lemma 2.14 again implies that j' 0 ı uj1 g'ıu is a p-weak upper gradient of u and hence gu j' 0 ı uj1 g'ıu a.e. It follows that j' 0 ı ujgu g'ıu a.e., finishing the proof. We finish this section with two concrete applications of Lemma 2.14 and the chain rule (Theorem 2.16), which will be needed later. Proposition 2.17. Assume that u 2 N 1;p .X / is a nonnegative function such that Cp .fx W u.x/ D 0g/ D 0. Then gu =u is a minimal p-weak upper gradient of the function v D log u. If, moreover, .X / < 1 and u " > 0, then v 2 N 1;p .X /. Proof. The first part follows directly from the chain rule (Theorem 2.16). To prove the second part, we have gv D gu =u gu =" a.e., and thus gv 2 Lp .X /. As jvj < u C jlog "j and .X / < 1, it is clear that v 2 Lp .X /. Lemma 2.18. Let u; v 2 N 1;p .X / and 2 Lip.X / be such that 0 1. Set w D u C .v u/ D .1 /u C v. Then g WD .1 /gu C gv C jv ujg is a p-weak upper gradient of w. Proof. Let W Œ0; l ! X be a curve on which u and v are absolutely continuous and such that j.u ı /0 .t/j gu ..t //;
j.v ı /0 .t /j gv ..t //
for a.e. t 2 Œ0; l . This holds for p-a.e. curve.
and
j. ı /0 .t /j g ..t //
48
2 Minimal p-weak upper gradients
Then w ı W Œ0; l ! R is absolutely continuous, by Lemma 1.58, and for a.e. t 2 Œ0; l we have j.w ı /0 .t /j D j.1 . ı /.t //.u ı /0 .t / C . ı /.t /.v ı /0 .t / C ..v ı /.t / .u ı /.t //. ı /0 .t /j .1 . ı /.t //gu ..t // C . ı /.t /gv ..t // C j.v ı /.t / .u ı /.t /jg ..t // D g..t //: Lemma 2.14 shows that g is a p-weak upper gradient of w.
2.4 The glueing lemma Let us point out that after Remark 2.28 we will refer to the results in this section as holding for the corresponding local spaces, whenever necessary. One of the important properties of the minimal p-weak upper gradient is that it is local, i.e. if two functions coincide in an open set, then so do their minimal p-weak upper gradients (a.e.). In fact, we shall see in Corollary 2.21 that this is true even if the coincidence set is not open. This will be essential in our study of p-harmonic functions later in the book. The locality is proved using the following lemma which allows us to glue together functions and to obtain the corresponding minimal p-weak upper gradient by glueing gradients in a similar way. Lemma 2.19 (The glueing lemma). Let E X be a measurable set, f 2 ACCp .X / and u; v 2 D p .X /. Assume that f jE D u and f jXnE D v. Let g 0 2 Lp .X / and g 00 2 Lp .X / be p-weak upper gradients of u and v, respectively. Then g D g 0 E Cg 00 XnE is a p-weak upper gradient of f . Moreover, if g 0 D gu and g 00 D gv are minimal, then g is a minimal p-weak upper gradient of f . Proof. Let g1 D g 0 C g 00 XnE and g2 D g 0 E C g 00 . We will first show that both g1 and g2 are p-weak upper gradients of f . From this and Lemma 2.6 it follows that g D minfg1 ; g2 g is also a p-weak upper gradient of f . By symmetry it is enough to show that g1 is a p-weak upper gradient of f . Take a curve W Œ0; l ! X such that 1 .E/ is measurable, u, v and f are all absolutely continuous on , and g 0 and g 00 are upper gradients of u and v, respectively, along . This is true for p-a.e. curve by Lemmas 1.40 and 1.43 (the latter motivating that 1 .E/ is measurable). If \ E D ¿, then Z Z jf ..0// f ..l //j D jv..0// v..l //j g 00 ds g1 ds:
2.4 The glueing lemma
49
On the other hand, if \ E ¤ ¿, let ˛ D infft 2 Œ0; l W .t / 2 Eg
and
ˇ D supft 2 Œ0; l W .t / 2 Eg:
Then 0 ˛ ˇ l and Z
g 00 ds
jf ..0// f ..˛//j D jv..0// v..˛//j j.0;˛/
Z g1 ds; j.0;˛/
where the equality follows by continuity if ˛ > 0 and is trivial otherwise. Similarly, Z jf ..ˇ// f ..l //j g1 ds: j.ˇ;l /
We also have, using the continuity of u and f along , that Z Z jf ..˛// f ..ˇ//j D ju..˛// u..ˇ//j g 0 ds j.˛;ˇ/
g1 ds: j.˛;ˇ/
By the triangle inequality this shows that g1 is a p-weak upper gradient, and hence g is a p-weak upper gradient and g gf a.e. Now, if g 0 D gu and g 00 D gv , then by applying this lemma (without the minimality part) with the roles of u and f interchanged, we see that gf E C gu XnE is a p-weak upper gradient of u. Since gu and gf are minimal we have that gu gf g D gu
a.e. on E:
Hence gf D g a.e. on E and similarly on X n E. Corollary 2.20. Let u; v 2 D p .X /. Then gu fu>vg C gv fvug is a minimal p-weak upper gradient of maxfu; vg, and gv fu>vg C gu fvug is a minimal p-weak upper gradient of minfu; vg. Lemma 2.14 can be used to give an alternative proof for Corollary 2.20 (with the minimality shown as in the proof of Lemma 2.19). As a direct consequence of Corollary 2.20 we get new proofs of Theorems 1.20 and 1.55. Another consequence is the following locality result, advertised at the beginning of this section. Corollary 2.21. If u; v 2 D p .X /, then gu D gv a.e. on fx 2 X W u.x/ D v.x/g: Moreover, if c 2 R is a constant, then gu D 0 a.e. on fx 2 X W u.x/ D cg.
50
2 Minimal p-weak upper gradients
Proof. Let E D fx W u.x/ D v.x/g and ´ u f D v
in X n E; in E:
Then f D u. On the other hand, by Lemma 2.19, gu XnE C gv E is a minimal p-weak upper gradient of f D u. Since gu is also a minimal p-weak upper gradient of u D f , we must have gu XnE C gv E D gu
a.e.
Therefore gu D gv a.e. on E. As for the second part, let v c, with gv 0, and apply the first part. The following result partially strengthens Theorem 1.27 (iv). Proposition 2.22 (Strong subadditivity). Let E1 ; E2 X . Then Cp .E1 [ E2 / C Cp .E1 \ E2 / Cp .E1 / C Cp .E2 /: Proof. We may assume that the right-hand side is finite. Let " > 0. We can thus find uj Ej such that kuj kpN 1;p .X/ Cp .Ej / C ", j D 1; 2. Let v D maxfu1 ; u2 g and w D minfu1 ; u2 g. By Corollary 2.20, we have Cp .E1 [ E2 / C Cp .E1 \ E2 / kvkpN 1;p .X/ C kwkpN 1;p .X/ Z p D .v p C gvp C w p C gw / d X Z D .up1 C gup1 C up2 C gup2 / d X
Cp .E1 / C Cp .E2 / C 2": Letting " ! 0 completes the proof.
2.5 N 1;p ./ Let A X be measurable. Then we naturally can consider A as a metric space in its own right (with the restrictions of d and ). The Newtonian space N 1;p .A/ and the Dirichlet space D p .A/ are then given by Definitions 1.17 and 1.54, respectively. This is also why we did not want to assume that X D supp from the very beginning. As A is only measurable, it can easily happen that supp jA is a proper subset of A, but the theory presented here is still meaningful on A.
2.5 N 1;p ./
51
A function f 2 N 1;p .X / clearly has a restriction f jA which belongs to N 1;p .A/, and any (p-weak) upper gradient of it remains a (p-weak) upper gradient when restricted. However, the restriction of a minimal p-weak upper gradient is not always minimal. Consider e.g. X D Rn and let A be a totally disconnected subset of Rn of positive Lebesgue measure. Since there are no curves in A, the zero function is a minimal p-weak upper gradient with respect to A of every measurable function u, but it is not the restriction of a corresponding minimal p-weak upper gradient from Rn (except when u D C q.e. on A). Further, for a subset E A it is always true that Cp0 .E/ Cp .E/, where Cp is taken with respect to X and Cp0 with respect to A, but it is possible to have strict inequality and even Cp0 .E/ D 0 < Cp .E/. Thus the concept “q.e.” depends on whether we consider it with respect to A or X . Unless otherwise said, we will always consider Cp and “q.e.” with respect to X . Let us next look at the case when A D is open. It then turns out that we have little of these problems. It can still happen that Cp0 .E/ < Cp .E/, but the capacities have the same zero sets. Furthermore, the restriction of a minimal p-weak upper gradient remains minimal. We start by proving the latter fact. Lemma 2.23. Assume that f 2 D p .X / with a minimal p-weak upper gradient gf (with respect to X ). Then gf j is a minimal p-weak upper gradient of f with respect to . Proof. Let g be a minimal p-weak upper gradient of f with respect to . Since clearly gf j is a p-weak upper gradient of f in , we have g gf a.e. in . Assume that g < gf on a set of positive measure. Then we can find a ball B 2B such that g < gf on a set of positive measure in B. Now let ´ gf in X n B; g0 D g in B: Let be the set of curves along which g 0 is not an upper gradient of f . Let further
1 D f 2 W g and 2 D f 2 W X n Bg. Clearly, g 0 D gf is a p-weak upper gradient of f in X n B. Hence Modp . 2 / D 0, by Lemma 1.40. (Note that as X n B for all 2 F2 , the modulus Modp . 2 / is the same when taken with respect to X n B and X .) On the other hand, by Lemma 2.19, g 0 is a p-weak upper gradient of f in , and thus Modp . 1 / D 0, by Lemma 1.40. Let now 2 . Since 2B we can split into a finite number of pieces 1 ; ::: ; n , each of which lies entirely either in or in X n B. As g 0 is not an upper gradient of f along , there must be at least one j for which g 0 is not an upper gradient of f along j . Hence j 2 1 [ 2 . By Lemma 1.34, we have Modp . / Modp . 1 [ 2 / D 0. Thus g 0 is a p-weak upper gradient of f in X , but this is a contradiction as g 0 < gf on a set of positive measure.
52
2 Minimal p-weak upper gradients
Next, we will see that q.e. is the same when taken with respect to and X . Lemma 2.24. Let E . Then Cp .E/ D 0 if and only if Cp0 .E/ D 0, where Cp0 is the capacity with respect to . Proof. If D X the result is trivial so we may assume that ¤ X . The necessity has already been observed. Assume therefore that Cp0 .E/ D 0. Let Ej D fx 2 E W dist.x; X n / > 1=j g and fj D Ej . Since Cp0 .Ej / D 0, Proposition 1.48 shows that 0 is a p-weak upper gradient of fj with respect to and that .Ej / D 0. Arguing as in the proof of Lemma 2.23, we see that 0 is a p-weak upper gradient of fj with respect to all of X . Hence kfj kN 1;p .X/ D 0, and thus Cp .Ej / D 0. Therefore Cp .E/ D Cp
1 [
1 X Ej Cp .Ej / D 0:
j D1
1;p
j D1
p
2.6 Nloc and Dloc Let us first recall how to define Lploc .X /. Remember that in our theory, X can be replaced by any measurable subset, see the beginning of Section 2.5. A function f on X belongs to Lploc .X / if for every x 2 X there is rx > 0 such that f 2 Lp .B.x; rx //. We similarly say that 1;p f 2 Nloc .X /;
p f 2 Dloc .X /
and
f 2 ACCp;loc .X /
if for every x 2 X there is rx > 0 such that f 2 N 1;p .B.x; rx //;
f 2 D p .B.x; rx //
and
f 2 ACCp .B.x; rx //;
respectively. 1;p p We have trivially that Nloc .X / Dloc .X / ACCp;loc .X /, in view of Theo1;p p rem 1.56, and Nloc .X / Lloc .X /. We will actually show that ACCp;loc .X / D ACCp .X /, see Proposition 2.27 below. As supp is Lindelöf and Cp .X n supp / D 0 (see Propositions 1.6 and 1.53), the 1;p equivalence classes in Lploc and Nloc remain the same as in Lp and N 1;p , respectively, by Lemma 2.24. p We can now extend Theorem 2.5 to functions in Dloc .X /. p Theorem 2.25. Let u 2 Dloc .X /. There exists a minimal p-weak upper gradient p gu 2 Lloc .X / of u, i.e. gu g a.e.
for all p-weak upper gradients g 2 Lploc .X / of u. Moreover, gu is unique up to sets of measure zero.
1;p p 2.6 Nloc and Dloc
53
Proof. By assumption, we have frx gx2X such that u 2 D p .B.x; rx // for x 2 X . As supp is Lindelöf we can find a countable sequence fxj gj1D1 such that supp S1 j D1 Bj , where Bj D B.xj ; rxj /. Let gj be a minimal p-weak upper gradient of ujBj with respect to Bj . Let now gu .x/ D inf gj .x/; x2Bj
where we say that the infimum is 0 (or arbitrary) if there is no Bj 3 x. By Lemma 2.23, each gj is a restriction of a global minimal p-weak upper gradient of u and hence gj D gk
a.e. in Bj \ Bk ;
which implies that gu D gj a.e. in Bj . Moreover, gu 2 Lploc .X /. If g 2 Lploc .X / is another p-weak upper gradient of u and if B is a ball so that g 2 Lp .B/, then gu is a minimal p-weak upper gradient of ujB by Lemma 2.23 and hence gu g a.e. in B. Thus gu g a.e. in X (using again that supp is Lindelöf). The uniqueness is obtained just as in the proof of Theorem 2.5. 1;p p Proposition 2.26. Let A b X . Then f 2 Lploc .X /, f 2 Nloc .X / and f 2 Dloc .X / p 1;p p implies that f 2 L .A/, f 2 N .A/ and f 2 D .A/, respectively. 1;p Proof. We give the proof for Nloc .X /. The other cases are treated similarly. By assumption, for every x 2 X we have rx > 0 so that f 2 N 1;p .B.x; rx //. As AN is compact we can find a finite subcover fB.xj ; rxj /gjND1 of the open cover fB.x; rx /gx2AN N It follows that of A. p kf kL p .A/
n X j D1
and similarly p kgf kL p .A/
n X j D1
p kf kL p .B.x ;r j x
j
p kgf kL p .B.x ;r j x
j
//
<1
//
< 1;
where gf is given by Theorem 2.25. Proposition 2.27. If f 2 ACCp;loc .X /, then f 2 ACCp .X /. Proof. By assumption, for every x 2 X we have rx > 0 so that f 2 ACCp .B.x; rx //. As supp is Lindelöf, there is a countable subcover fBj gj1D1 of balls so that f 2 S ACCp .Bj /, j 1, and supp j1D1 Bj . Let also B0 D X n supp even though this is in general not a ball. (It is nevertheless open.) Let be the set of curves in X on which f is not absolutely continuous, and j be the set of curves in Bj on which f is not absolutely continuous, j D 0; 1; ::: . By the definition of ACCp , in Theorem 1.56, we have Modp . j / D 0, j 1. Moreover, as jB0 is the zero measure, Modp . 0 / D 0 as well. Let now 2 . As
54
2 Minimal p-weak upper gradients
is compact we can split it into pieces 1 ; ::: ; n , so that D 1 C C n and k is a curve in Bjk , k D 1; ::: ; n. As f is not absolutely continuous on , there is at least one k on which f is not absolutely continuous. Thus Lemma 1.34 shows that Modp . / D 0. Remark 2.28. As we have seen, the minimal p-weak upper gradient of a function in p Dloc .X / only depends on the function locally. It is therefore straightforward to extend the results in Sections 2.3 and 2.4 to hold for the corresponding local spaces. Even when we require these extended results we will refer to their original numbers. p 1;p Note, in particular, that the spaces Dloc .X / and Nloc .X / are lattices. The following characterizations of the local spaces are often more useful than the definitions themselves. See also Corollary 2.31. Proposition 2.29. Assume that X is locally compact. Then f 2 Lploc .X /;
1;p p f 2 Nloc .X / and f 2 Dloc .X /
if and only if f 2 Lp ./, f 2 N 1;p ./ and f 2 D p ./, respectively, for all open b X. 1;p Proof. We give the proof for Nloc .X /. The other cases are treated similarly. The necessity follows directly from Proposition 2.26. As for the sufficiency, assume that f 2 N 1;p ./ for every b X . Let x 2 X . By local compactness we can find rx > 0 such that B.x; rx / b X , and hence f 2 N 1;p .B.x; rx //. But this shows that 1;p indeed f 2 Nloc .X /.
Definition 2.30. A metric space is proper if all closed and bounded subsets are compact. If X is proper and X is open, then it follows immediately that is locally compact. Using this we directly obtain the following corollary of Proposition 2.29. 1;p Corollary 2.31. Assume that X is proper. Then f 2 Lploc ./, f 2 Nloc ./ and f 2 p p 0 1;p 0 p Dloc ./ if and only if f 2 L . /, f 2 N . / and f 2 D .0 /, respectively, for all open 0 b . 1;p Remark 2.32. In the nonproper case an alternative definition of Nloc ./, which mimics the conclusion of Corollary 2.31, was given in A. Björn–Marola [59]. The two definitions coincide when X is proper.
We can now also refine Proposition 1.37. Proposition 2.33. RModp . / D 0 if and only if there is a nonnegative function 2 Lploc .X / such that ds D 1 for all 2 .
2.7 N01;p
55
Proof. The necessity follows from Proposition 1.37. As for the sufficiency let Z D X n supp . By assumption, for every x 2 X there is a ball Bx 3 x such that 2 Lp .Bx /. By Proposition 1.6, supp is Lindelöf, and S thus we can find a countable subcover Bj D Bxj , j D 1; 2; ::: , such that supp j1D1 Bj . Let Aj D
1 2j k kLp .Bj / C 1
; j D 1; 2; ::: ;
and
Q D
1 X
Aj jBj 2 Lp .X /:
j D1
Let further 2 n Z . As is compact, there is N < 1 such that Therefore Z Z Q ds min Aj ds D 1:
1j N
SN
j D1
Bj .
Hence, by Proposition 1.37, Modp . n Z / D 0. Moreover, Modp . Z / D 0, by Proposition 1.53, and thus Modp . / D 0.
1;p
2.7 N0
To be able to compare boundary values of Newtonian functions and to solve the Dirichlet problem we shall need the following Newtonian spaces with zero boundary values. These spaces will also be useful as spaces of test functions in the definitions of obstacle problems and (super)minimizers. Definition 2.34. For A; E X , where A is measurable, we introduce the space of Newtonian functions with zero values in A n E as follows, N01;p .EI A/ D ff jE \A W f 2 N 1;p .A/ and f D 0 in A n Eg: We also let N01;p .E/ D N01;p .EI X /. As N01;p .EI A/ is nothing but N01;p .E \ A/ taken with respect to the surrounding space A we concentrate on studying N01;p .E/ below. Note however the subtle point that the capacity of a set and (p-weak) upper gradients of a function can be different when taken with respect to A and X , see the discussion in the beginning of Section 2.5. Note also that obviously N01;p .E/ does not only depend on E but also on X , but in order not to make the notation too cumbersome we have refrained from making this explicit in the notation. It is easy to see that N01;p .E/ D ff jE W f 2 N 1;p .X / and f D 0 q.e. in X n Eg:
(2.6)
Clearly, N01;p .E/ is a subspace of N 1;p .E/, if E is measurable, and we may also consider it as a subspace of N 1;p .X /, in a natural way. Let us also point out that if
56
2 Minimal p-weak upper gradients
we have use for considering values of a function f 2 N01;p .E/ outside of E, then we often implicitly assume f to be identically 0 outside of E. The following result is worth observing. Proposition 2.35. N01;p .E/ D N 1;p .X / holds if and only if Cp .X n E/ D 0. Note that even though it follows that N01;p .E/ D N 1;p .E/ if Cp .X n E/ D 0, it can happen that N01;p .E/ D N 1;p .E/ even when Cp .X n E/ > 0: Let X consist of two connected components and let E be one of them. Then N01;p .E/ D N 1;p .E/. See also Corollary 5.57. Proof. The sufficiency is clear from (2.6). As for the necessity assume on the contrary that Cp .X n E/ > 0. Then we can find a bounded set F X n E with Cp .F / > 0. We can then find a function f 2 Lip.X / with bounded support such that f 1 on F . Now f 2 N 1;p .X / n N01;p .E/, which concludes the proof. Theorem 2.36. The space N01;p .E/ is a closed subspace of N 1;p .X / and thus N01;p .E/= is a Banach space. Proof. This follows from Corollary 1.72. The following lemma is useful for showing that a function belongs to N01;p .E/. Lemma 2.37. Assume that E X is measurable. Let u 2 N 1;p .E/ and v; w 2 N01;p .E/ be such that v u w q.e. in E. Then u 2 N01;p .E/. Proof. By subtracting v from all terms and observing that u 2 N01;p .E/ if and only if u v 2 N01;p .E/, we may assume that v 0. After redefinitions on sets of capacity zero, we may, without loss of generality, assume that 0 u w everywhere in E, and that w 0 in X n E. 0 2 Lp .X / be an upper Let gu0 2 Lp .E/ be an upper gradient of u in E, and let gw gradient of w in X . Define ´ ´ 0 u in E; gu0 C gw in E; uQ D and g D 0 0 in X n E; gw in X n E: We want to show that g is an upper gradient of uQ in X , from which it follows that uQ 2 N 1;p .X / and thus u 2 N01;p .E/. Let W Œ0; l ! X be a curve. If E, then Z Z 0 ju..0// Q u..l Q gu ds g ds: //j D ju..0// u..l //j
On the other hand, if .0/; .l / 2 X n E, then ju..0// Q u..l Q //j D 0
R
g ds.
2.7 N01;p
57
By splitting into two parts, if necessary, and possibly reversing the direction, we may thus assume that .0/ 2 E and .l / 2 X n E. Hence, Z Z 0 //j D ju..0//j jw..0// w..l //j ju..0// Q u..l Q g ds g ds: w
Recall that functions in N01;p .E/ are defined using the global space N 1;p .X /. If E D is open, then it is possible to restrict both the definition and the norm to . This will be done in the following two propositions. Note that none of them is true for general sets E. Proposition 2.38. For f 2 N01;p ./ we have kf kN 1;p .X/ D kf kN 1;p ./ :
(2.7)
Proof. We may assume that f 0 outside of . Let gf be a minimal p-weak upper gradient of f with respect to X . By Lemma 2.23, gf j is a minimal p-weak upper gradient of f with respect to . On the other hand, by Corollary 2.21, gf D 0 a.e. outside of . Hence p p kf kpN 1;p .X/ D kf kL p .X/ C kgf kLp .X/ p p p D kf kL p ./ C kgf j kLp ./ D kf kN 1;p ./ :
x Proposition 2.39. It is true that N01;p ./ D N01;p .I /. x Conversely, let u 2 N 1;p .I / x and Proof. It is clear that N01;p ./ N01;p .I /. 0 define ´ u in ; uQ D 0 in X n : x we can find an upper gradient g 2 Lp ./ x of u in . x Define As u 2 N01;p .I / ´ x g in ; gQ D x 0 in X n : Let W Œ0; l ! X be a curve. If , then Z
Z
ju..0// Q u..l Q //j D ju..0// u..l //j
g ds D
On the other hand, if .0/; .l / 2 X n , then Z ju..0// Q u..l Q //j D 0
gQ ds:
gQ ds:
58
2 Minimal p-weak upper gradients
By splitting into two parts if necessary and possibly reversing the direction, we may thus assume that .0/ 2 and .l / 2 X n . Let c D infft 2 Œ0; l W .t / 2 X n g: x n , and thus u..l By the continuity of , we have .c/ 2 Q Q D 0. // D u..c// Hence, Z Z //j D j u..0// Q u..c//j Q ju..0// Q u..l Q g ds gQ ds: jŒ0;c
p
2.8 Gloc Sometimes a function is too large to have an upper gradient in Lploc but still there may be use of some sort of minimal p-weak upper gradient. We will apply this to superharmonic functions which can have a minimal p-weak upper gradient not belonging to L1loc , see Remark 9.56. p .X / if .fx 2 X W ju.x/j D 1g/ D 0 and the Definition 2.40. We say that u 2 Gloc 1;p truncations uk WD maxfminfu; kg; kg 2 Nloc .X / for every positive k 2 Z. p If u 2 Gloc .X /, then we let Gu D limk!1 guk and say that Gu is a minimal p-weak upper gradient of u.
is an increasing sequence for a.e. x 2 X (after the repreNote that fguk .x/g1 kD1 sentatives guk have been chosen), in view of Corollary 2.21. The minimality should be understood in the sense described below. p .X /, then Gu is a p-weak upper gradient of u which Proposition 2.41. If u 2 Gloc is minimal in the sense that if g is another p-weak upper gradient of u such that gfxWju.x/jkg is a p-weak upper gradient in Lploc .X / of uk WD maxfminfu; kg; kg for every positive k 2 Z, then Gu g a.e.
Proof. We may redefine each guk on a set of measure zero without affecting Gu on more than a set of measure zero. To simplify things we may let gu0 0 and then recursively choose gukC1 so that gukC1 D guk on fx W ju.x/j < kg and gukC1 D 0 on fx W ju.x/j k C 1g. With this choice we will have guk % Gu everywhere in X , as k ! 1. For each positive k 2 Z there is an exceptional set k of curves along which guk S is not an upper gradient of uk . Let D 1
. Then Modp . / D 0. k kD1 For a curve … , W Œ0; l ! X , we have either ju..0//j D ju..l //j D 1 or Z Z guk ds D Gu ds: ju..0// u..l //j D lim juk ..0// uk ..l //j lim k!1
k!1
2.9 Dependence on p in gu
59
It thus follows from Corollary 1.51 that Gu is a p-weak upper gradient of u. For the minimality, we have that gfxWju.x/jkg guk a.e., by the minimality of guk . As .fx W ju.x/j D 1g/ D 0 we see that Gu D lim guk lim gfxWju.x/jkg D g k!1
k!1
a.e.
p Proposition 2.42. If u; v 2 Gloc .X /, then
Gu D Gv a.e. in fx 2 X W u.x/ D v.x/g: In particular, if c 2 R is a constant, then Gu D 0 a.e. in fx 2 X W u.x/ D cg. Proof. This follows directly from Corollary 2.21 applied to uk and vk . p Lemma 2.43. Assume that .fx 2 X W ju.x/j D 1g/ D 0. Then u 2 Dloc .X / if and p p only if u 2 Gloc .X / and Gu 2 Lloc .X /. In this case gu D Gu a.e.
Proof. Let uk D maxfminfu; kg; kg be the truncations at levels ˙k, k D 1; 2; ::: . p 1;p p Assume first that u 2 Dloc .X /. Then uk 2 Nloc .X / and hence u 2 Gloc .X /. p Moreover, gu D limk!1 guk a.e. in X , and hence Gu D gu 2 Lloc .X /. p .X / and Gu 2 Lploc .X /, then u has a p-weak upper gradient Conversely, if u 2 Gloc p p in Lloc .X /, and hence belongs to Dloc .X /. Note that if X satisfies a p-Poincaré inequality, then one implication follows unconditionally in Lemma 2.43, by Corollary 4.11. This is not true in general by Examp ple 1.22, as in that case u 1 2 D p .X / n Gloc .X / (except in the trivial case when is the zero measure). p zloc One can build a (sometimes) more general theory by saying that u 2 G .X / if fx 2 X W ju.x/j D 1g can be written as a union E1 [ E2 with .E1 / D 0 and 1;p .X / for every positive Modp . E2 / D 0, and if uk WD maxfminfu; kg; kg 2 Nloc p p z k 2 Z. In this case one obtains the inclusion Dloc .X / Gloc .X / unconditionally. We p have refrained from this, and also from developing the theory of Gloc further.
2.9 Dependence on p in gu 1;q Assume that 1 p < q. If u 2 Nloc .X /, then Hölder’s inequality shows that 1;p q u 2 Nloc .X /. Indeed if g 2 Lloc .X / is an upper gradient of u, then g 2 Lploc .X /. Even more is true. q p .X /. Then u 2 Dloc .X / and Proposition 2.44. Let 1 p < q and let u 2 Dloc
gu;p gu;q a.e.; where gu;p and gu;q are the minimal p-weak and q-weak upper gradients of u, respectively.
60
2 Minimal p-weak upper gradients
To prove this we will use the following result. Proposition 2.45. Let 1 p < q and assume that Modq . / D 0. Then Modp . / D 0. Proof. By Proposition 2.33, there is a nonnegative function 2 Lqloc .X / such that R p ds D 1 for all 2 . By Hölder’s inequality, 2 Lloc .X /, and hence, by Proposition 2.33 again, Modp . / D 0. Proof of Proposition 2.44. Let
D f 2 .X / W gu;q is not an upper gradient of u along g: Then Modq . / D 0, by Lemma 1.40. By Proposition 2.45, Modp . / D 0, and hence gu;q is a p-weak upper gradient of u. Moreover, gu;q 2 Lqloc .X / Lploc .X /. Thus the minimality of gu;p shows that gu;p gu;q a.e. Another consequence of Proposition 2.45 is the following result. Proposition 2.46. Let 1 p < q. If Cq .E/ D 0, then Cp .E/ D 0. Proof. By Proposition 1.48, .E/ D Modq . E / D 0. Hence, by Proposition 2.45, Modp . E / D 0. Thus, Proposition 1.48 shows that Cp .E/ D 0. It is easy to find an example of a function u 2 N 1;p .X / such that u; gu;p 2 Lq .X /, but still u … N 1;q .X /. Example 2.47. Let 1 p < q and let E be a set such that 0 D Cp .E/ < Cq .E/, e.g. let 1 < p n < q and let E be a singleton in Rn . Other examples of sets such that 0 D Cp .E/ < Cq .E/ can easily be found among Cantor type sets in Rn , see Theorem 5.3.2 in Adams–Hedberg [5] for a criterion when a certain capacity of such sets vanishes. Let u D E . Then kukLp .X/ D kukLq .X/ D 0 and 0 is a p-weak upper gradient of u, so kukN 1;p .X/ D 0. On the other hand, if it were true that u 2 N 1;q .X /, then as u D 0 a.e. we would have u D 0 q-q.e., by Proposition 1.59, which is clearly false. q .X /. Note however that Hence u … N 1;q .X /, and in fact u … ACCq .X / and u … Gloc u 2 Ny 1;q .X /. The problem in this example is that we have chosen a representative of an equivalence class (the 0 equivalence class) which is bad for N 1;q .X /. Let us give another example, of quite different nature. Example 2.48 (Bow-tie). Let n 2 and write x 2 Rn as x D .x1 ; ::: ; xn /. Let XC D fx 2 Rn W xj 0; j D 1; ::: ; ng; X D fx 2 Rn W xj 0; j D 1; ::: ; ng: Let further X D XC [ X , u D XC and 1 p n < q.
2.10 Representation formulas for gu
61
In Examples 5.6 and A.23 we show that u 2 N 1;p .X /, but u … N 1;q .X /. Moreover gu;p D 0. So despite the fact that u; gu;p 2 Lq .X / (and even u; gu;p 2 L1 .X /), it does not follow that u 2 N 1;q .X / nor that u 2 Ny 1;q .X /. (For the latter, assume that u 2 Ny 1;q .X /. Then there is v 2 N 1;q .X / such that v D u a.e. It follows that gv D 0, which violates the q-Poincaré inequality obtained in Example A.23.) After these examples it is natural to ask the following question. Open problem 2.49. Let 1 p < q and assume that u 2 N 1;q .X /. Does it follow that gu;p D gu;q ? A positive answer to Open problem 2.53 would solve this. In Corollary A.9 we show that the answer is yes, if X is a complete doubling p-Poincaré space (see Section 4.1).
2.10 Representation formulas for gu We finish this chapter with some representation formulas for minimal p-weak upper gradients. For these to hold, or rather for our proofs, we need to assume that Lebesgue’s differentiation theorem holds, i.e. that « lim f d D f .x0 / for a.e. x0 2 X r!0 B.x ;r/ 0
whenever f 2 L1loc .X /. Observe that the left-hand side does not make sense if x0 … supp . On the other hand, the set of all such points has measure zero, so the equality may still be true a.e. Lebesgue’s differentiation theorem is known to hold when is doubling, see Chapter 3, and more generally when the Vitali covering theorem holds. In particular, this is true if X D Rn , equipped with any measure satisfying our standard assumption that .B/ < 1 for all balls B X . See Heinonen [169], Chapter 1, for these facts and some further discussion, and the notes to Chapter 1 for the formulation of the Vitali covering theorem. In fact, Lebesgue’s differentiation theorem is equivalent to the validity of a weaker covering theorem, see Hayes–Pauc [161]. Preiss [306] gave a counterexample of a Gaussian measure on a separable Hilbert space for which the Lebesgue’s differentiation theorem does not hold. See also the discussion and references in Tišer [334]. Theorem 2.50. Assume that Lebesgue’s differentiation theorem holds on X . Let u 2 D p .X /. Then gu can be represented by the formulas « 8
62
2 Minimal p-weak upper gradients
and
8 ˆ <
g2 .x/ WD
inf lim sup g r!0 ˆ :0;
«
1=p p
g d
; x 2 supp ;
B.x;r/
x … supp ;
where the infima are taken over all p-weak upper gradients g 2 Lp .X / of u. Let further g10 and g20 be defined similarly but taking the infima only over all upper gradients g 2 Lp .X / of u. Then gu D g1 D g2 D g10 D g20 a.e., and all of them are minimal p-weak upper gradients of u. Proof. Without loss of generality we may assume that supp D X . Let « gu .x/ WD lim sup gu d: r!0
B.x;r/
As gu has Lebesgue points a.e. we have gu D gu a.e. Moreover, for all p-weak upper gradients g 2 Lp .X / of u, « g d: gu .x/ lim sup r!0
B.x;r/
Hence gu g1 g10 . Conversely, the proof of Lemma 1.46 provides us with a function 2 Lp .X / such that gj WD gu C =j 2 Lp .X / are upper gradients of u. Thus for j D 1; 2; ::: , « « 1 0 g1 .x/ lim sup gj d gu .x/ C lim sup d: j r!0 B.x;r/ r!0 B.x;r/ Letting j ! 1 shows that g10 gu a.e. The proof that gu D g2 D g20 a.e. is similar. The representation formulas from Theorem 2.50 can also be extended to local spaces. Theorem 2.51. Assume that Lebesgue’s differentiation theorem holds on X . Let u 2 p Dloc .X /. Then gu can be represented by the following formulas: « 8
2.10 Representation formulas for gu
63
where the infimum is taken over all p-weak upper gradients g 2 Lploc .X / of u; and 8 « 1=p ˆ < p inf lim sup g d ; x 2 supp ; g3 .x/ WD g r!0 (2.11) B.x;r/ ˆ :0; x … supp ; where the infimum is taken over all p-weak upper gradients g of u. Let further gj0 , j D 1; 2; 3, be defined similarly but taking the infima only over upper gradients g (belonging to Lploc .X / for g10 and g20 ) of u. Then gu D g1 D g2 D g3 D g10 D g20 D g30 a.e., and all of them are minimal p-weak upper gradients of u. Proof. Without loss of generality we may assume that supp D X . That gu D g1 D g10 D g2 D g20 a.e. is obtained as in the proof of Theorem 2.50. As g3 g30 g20 it is enough to show that gu g3 a.e. Let g be a p-weak upper gradient of u, and define « 1=p p g d : g .x/ D lim sup r!0
B.x;r/
Then G D fx 2 X W g 2 Lp .B.x; r// for some r > 0g is open, and g 1 in X n G. Since gu jG is a minimal p-weak upper gradient of u with respect to G, by Lemma 2.23, and g 2 Lploc .G/, we have gu g a.e. in G. Hence gu g
in G:
As g 1 in X n G, we see that gu g in X . It follows that gu g3 in X . Since gu D gu a.e., this completes the proof. It is natural to ask the following question. Open problem 2.52. Are the representation formulas in Theorems 2.50 and 2.51 true even when Lebesgue’s differentiation theorem does not hold? Note that in (2.11) we do not require g to be locally Lp -integrable. This leads us to the following open problem. p .X / and p > 1. Is it true, with or without the Open problem 2.53. Let u 2 Dloc assumption that Lebesgue’s differentiation theorem holds, that if g is a (p-weak) upper gradient of u, then «
gu lim sup r!0
g d
a.e.?
B.x;r/
If this is true it would allow the infimum in (2.9) to be taken over all (p-weak) upper gradients of u, not only those belonging to Lp .X / or Lploc .X /. Observe that for p D 1 this is possible by formula (2.11), at least if Lebesgue’s differentiation theorem holds. This would also give a positive answer to Open problem 2.49, at least under the assumption that Lebesgue’s differentiation theorem holds. Unfortunately, the formulas above are not enough to answer Open problem 2.49.
64
2 Minimal p-weak upper gradients
2.11 Notes Fuglede’s lemma (Lemma 2.1) goes back to Fuglede [128]. It was observed in Shanmugalingam [319] that the proof by Fuglede remains valid in metric spaces. Proposition 2.3 is from Björn–Björn–Parviainen [54]. Theorem 2.5 was obtained by Shanmugalingam [320] for p > 1 and by Hajłasz [151] for general p. Open problem 2.13 is due to Marola [263]. Lemma 2.18 (in a slightly different version) is from Kinnunen–Martio [217], this may also be the first use of the calculus for p-weak upper gradients, as described in Section 2.3, in the literature. Lemma 2.19 and Corollaries 2.20 and 2.21 are from Björn–Björn [44] (but are not included in Björn–Björn [45]) and were motivated by results in Heinonen–Koskela–Shanmugalingam–Tyson [177]. For earlier versions see Shanmugalingam [320]. Proposition 2.22 is probably new in the generality of Newtonian spaces. Lemma 2.23 is folklore. It has been generalized to certain nonopen sets in Björn–Björn [49]. Theorem 2.36 is from Shanmugalingam [320]. Lemma 2.37 is from [49], for open E it appeared in [45]. Farnana [120] has also a version of x and Lemma 2.37 when E is open and v and w are merely quasicontinuous on v D w D 0 q.e. on @E. The minimal p-weak upper gradients Gu were introduced for superharmonic u by Kinnunen–Martio [219]. Their definition is well adapted to superharmonic functions, but does not apply e.g. to subharmonic functions. Here we have given a more general definition which directly applies to both sub- and superharmonic functions. Neverthep less we will only apply it, in Section 9.9, to superharmonic functions. The spaces Gloc may be called gradient spaces, and this is the reason for our choice of G in the name. Proposition 2.46 is well known to people in the field, but was probably first explicitly written down for Newtonian spaces by Färm [118], the proof here being different. Example 2.48 is from Kinnunen–Korte–Shanmugalingam–Tuominen [211]. They also showed that if X is a complete doubling p-Poincaré space, u 2 N 1;p .X / and u; gu;p 2 Lq .X /, q > p, then u 2 Ny 1;q .X /. Formula (2.8) in Theorem 2.50 is from J. Björn [63], Lemma 2.3. Formulas (2.10) and (2.11) in Theorem 2.51 seem to be new here.
Chapter 3
Doubling measures
Throughout this chapter we assume that is doubling with doubling constant C , see below. So far we have developed the theory of Newtonian spaces with no special assumptions on the underlying metric space. To get a richer theory it will be essential to make some further assumptions on the metric space. There are three main assumptions that we will eventually add: completeness of X , that is doubling, and that X supports a p-Poincaré inequality. In the nonlinear potential theory developed in the second part of the book (in Chapters 7–14) these three assumptions will all be assumed. In this chapter we introduce the assumption that is doubling. Particular consequences are Lebesgue’s differentiation theorem, and the Lp boundedness of the maximal function (for the former see Heinonen [169], pp. 4, 12–13, and for the latter see Section 3.2). A deeper consequence of doubling is the John–Nirenberg lemma and its connection with functions of bounded mean oscillation (BMO functions), see Sections 3.3 and 3.4. The John–Nirenberg lemma will be essential for us in our proof of the Harnack inequality for p-harmonic functions. We end this chapter by giving a proof of the Gehring lemma, an important result which however will not be used in the rest of the book.
3.1 Doubling The measure is said to be doubling if there exists a constant C 1, called the doubling constant of , such that for all balls B, 0 < .2B/ C .B/ < 1: A metric space is doubling if there exists a constant C < 1 such that every ball B.z; r/ can be covered by at most C balls with radii 12 r. Alternatively and equivalently, for every " > 0 there is a constant C."/ such that every ball B.z; r/ can be covered by at most C."/ balls with radii "r. It is now easy to see that every bounded set in a doubling metric space is totally bounded. A metric space equipped with a doubling measure is doubling, and conversely any complete doubling metric space can be equipped with a doubling measure. See Heinonen [169], Section 10.13, for more on doubling metric spaces. Sections 3.3–3.5 were written with much help from Outi Elina Kansanen and Juha Kinnunen who provided draft versions of them.
66
3 Doubling measures
The following proposition is well known. However, since it does not seem to appear explicitly in the literature, we give a short proof here. Proposition 3.1. Let Y be a doubling metric space. Then Y is proper if and only if Y is complete. Recall that a metric space is proper if all closed and bounded subsets are compact, see Definition 2.30. Let us first show that one direction holds without doubling. Proposition 3.2. Let Y be a proper metric space. Then Y is complete. Proof. Take a Cauchy sequence fxi g1 iD1 in Y . Then for a sufficiently large radius r > 0, xi 2 B.x1 ; r/ Y (where B.x1 ; r/ is a ball in Y ). By the properness of Y , B.x1 ; r/ is compact and the sequence has a limit in Y . Proof of Proposition 3.1. The necessity follows from Proposition 3.2. Conversely, let Y be complete and M Y be closed and bounded. Then M is totally bounded, and hence compact, see e.g. Rudin [312], Theorem A4, or Folland [124], Theorem 0.25. The following lemma provides us with a counterpart of dimension related to the measure. Note that if (3.1) holds with some s, then it holds also with all s 0 s. Lemma 3.3. Let B.x; R/ be a ball in X , y 2 B.x; R/ and 0 < r R < 1. Then r s .B.y; r// ; (3.1) C .B.x; R// R where s D log2 C and C D C2 . The choice s D log2 C may not be optimal. Note also that if (3.1) is satisfied, then is doubling, so that is doubling if and only if there is an exponent s such that (3.1) holds (for all balls B.y; r/ and B.x; R/ as above). Proof. By the assumptions, there exists a nonnegative integer k such that 2k1 r < R 2k r. Then B.x; R/ B.y; 2kC1 r/ and hence .B.x; R// CkC1 .B.y; r//: This and the choice of k imply that r s .B.y; r// : Ck1 D C2 .21k /log2 C > C2 .B.x; R// R The (unweighted) Euclidean space Rn is doubling with the doubling constant 2n and the best exponent in (3.1) is s D n. This suggests that the exponent s in (3.1) is a generalization of the notion of dimension to metric spaces. For some results, an opposite inequality is needed, which is indeed true in connected spaces, see Corollary 3.8. In general, one cannot expect the exponents in the lower and upper estimates of the measure to coincide. This leads us to the following definition, which is clearly stronger than requiring that be doubling.
3.1 Doubling
67
Definition 3.4. The measure is said to be Ahlfors Q-regular if there exist constants C1 > 0 and C2 such that C1 r Q .B.x; r// C2 r Q for all x 2 X and all r > 0. Ahlfors Q-regular sets are sometimes called Ahlfors–David Q-regular, or simply Q-sets in the literature. Example 3.5. Let X be weighted Rn , n 2, equipped with the measure d.x/ D jxj˛ dx, ˛ > n. It is not difficult to verify that is doubling, see Appendix A.2 for more details. For x ¤ 0, .B.x; r// is comparable to r n with comparison constants depending on jxj, and .B.0; r// is comparable to r nC˛ . It follows that (3.1) holds with s maxfn; n C ˛g, while (3.2) below holds with minfn; n C ˛g. Thus, X is not Ahlfors regular (unless ˛ D 0). Note that for ˛ close to n we have close to 0, and for large ˛, s becomes large. The following two simple lemmas will be useful for further references. Lemma 3.6. Let B D B.x; r/ and B 0 D B.x 0 ; r 0 / be two balls such that d.x; x 0 / ar and r=a r 0 ar. Then .B/=C .B 0 / C.B/ with the comparison constant depending only on a > 1 and the doubling constant C . Proof. Clearly, B 0 2aB and hence .B 0 / CN .B/, where N is the smallest integer such that 2a 2N . Similarly, as d.x; x 0 / a2 r 0 , we have B .a2 C a/B 0 and hence .B/ C2N 1 .B 0 /, since a2 C a 22.N 1/ C 2N 1 < 22N 1 . Lemma 3.7. Assume that X is connected. For every 0 < < 1, there exists a constant 0 < < 1 depending only on and C such that if B D B.x; r/ is a ball in X with radius r < 12 diam X , then .B/ .B/: Proof. As X is connected, there is y 2 X with d.y; x/ D 12 .1 C /r. Hence B n B contains the ball B 0 D B y; 12 .1 /r , and B B 0 , where D 4=.1 /. In particular, .B/ CN .B 0 /; where N is the smallest integer such that 2N . Thus .B/ .B/ .B 0 / .1 CN /.B/. Corollary 3.8. Assume that X is connected. Then there exist constants C > 0 and > 0 such that for all balls B.x; R/ in X , all y 2 B.x; R/ and all 0 < r R, r .B.y; r// C : .B.x; R// R
(3.2)
68
3 Doubling measures
Proof. As B.y; R/ B.x; 2R/, the doubling property and an iteration of Lemma 3.7 with D 1=e immediately yield .B.y; r// .B.y; r// C r log C C k ; .B.x; R// .B.y; R// R where k is the smallest integer such that r e k R. Corollary 3.9. Assume that X is connected. Then .fxg/ D 0 for every x 2 X . The space X D Z, with .fxg/ D 1 for all x 2 X , shows that we cannot omit the connectedness assumption.
3.2 The maximal function Rather than considering the usual maximal function, we introduce the noncentred maximal function which is often easier to use. We also make the definition more flexible by considering the restricted maximal function, which will be useful later. The nonrestricted maximal function is obtained by letting D X . Definition 3.10. For f 2 L1 ./, the noncentred maximal function restricted to is « M f .x/ WD sup jf j d; B
B
where the supremum is taken over all balls B containing x. If D X , we write M f instead of MX f . Note that the balls considered are balls with respect to X . Remark 3.11. The noncentred maximal function M f differs somewhat from the usual centred Hardy–Littlewood maximal function « Mf .x/ WD sup jf j d: r>0 B.x;r/
Note, however, that if is doubling, then Mf M f CMf . This implies that both Lemma 3.12 and Theorem 3.13 below hold for Mf as well (the proof of the lower semicontinuity is a bit more involved for the centred maximal function). Lemma 3.12. For f 2 L1 ./, the noncentred maximal function M f .x/ is lower semicontinuous in and satisfies Z C3 .E / jf j d and lim .E / D 0;
!1 E where E D fx 2 W M f .x/ > g.
3.2 The maximal function
69
Proof. Consider first the further restrained noncentred maximal function M;R f in which the supremum is taken only over balls in with radius less than R. Let E R D fx 2 W M;R f .x/ > g:
By definition, for every x 2 E R , there exists a ball Bx 3 x, Bx , with radius less than R such that Z jf j d: .Bx / < Bx
Note that Bx
E R
since for every z 2 Bx , « jf j d > : M;R f .z/ Bx
Hence E R D
[
Bx ;
x2ER which shows that E R is open and M;R f is lower semicontinuous. By the 5-covering lemma (Lemma 1.7) there exist pairwise disjoint balls Bxj E R , j D 1; 2; ::: , such S that E R j1D1 5Bxj . The doubling property and the choice of Bxj imply Z 1 1 X X R 3 3 .E / .5Bxj / C .Bxj / C jf j d C: j D1
j D1
ER
f is lower semicontinuous and that the constant Note that M f D supR>0 M;R C above does not depend on R. Letting R ! 1 proves the first inequality in the 1 statement of the lemma and shows that .E / ! R 0, as ! 1. As f 2 L ./, the dominated convergence theorem implies that E jf j d ! 0, as ! 1, which finishes the proof.
The first inequality in Lemma 3.12 says that the operator M is bounded from L .X / to weak L1 .X / (which is sometimes denoted by L1;1 .X / in the range of Lorentz spaces). The following Hardy–Littlewood theorem shows that for t > 1, the operator M is bounded on Lt .X /. 1
Theorem 3.13. Let t > 1. If f 2 Lt .X /, then M f 2 Lt .X / and Z Z 2t t C3 t .M f / d jf jt d: t 1 X X Proof. For > 0, let f D f fx2XWjf .x/j> =2g . Then M f M f C =2 and Lemma 3.12 implies that .fx 2 X W M f .x/ > g/ .fx 2 X W M f .x/ > =2g/ Z 2C3 jf j d: fx2XWjf .x/j> =2g
70
3 Doubling measures
Hence, by Cavalieri’s principle (Lemma 1.10), Z 1 Z .M f /t d D t t1 .fx 2 X W M f .x/ > g/ d X 0 Z 1 Z 2t C3 t2 jf j d d 0
Z D 2t C3 D
2t t C3 t 1
fx2XWjf .x/j> =2g
Z
2jf j
jf j X
t2 d d 0
Z
jf jt d: X
3.3 BMO and John–Nirenberg’s lemma John–Nirenberg’s lemma and the space of BMO functions, both dating back to the 1961 paper of John and Nirenberg [192], are cornerstones in modern analysis. For us they will play a crucial role when obtaining the interior regularity for p-harmonic functions, more precisely when proving the weak Harnack inequality for superminimizers in Theorem 8.10. Definition 3.14. Let
« kf kBMO.IX/ D sup
jf fB j d;
B B
ª where fB WD B f d is the mean-value of f on B and the supremum is taken over all balls B (and we implicitly require that fB is finite for all balls B ). We define the class of functions of bounded mean oscillation as BMO.I X / D ff W kf kBMO.IX/ < 1g: Note that the balls considered in Definition 3.14 are balls with respect to X . To emphasize this dependence on X , and to avoid misunderstanding, we write X explicitly in the notation. Clearly BMO.I X / L1loc ./. Theorem 3.15 (John–Nirenberg’s lemma). Let B0 D B.x0 ; R/ X be a ball and f 2 BMO.5B0 I X /. Then for every > 0, .fx 2 B0 W jf .x/ fB0 j > g/ 2.B0 /e A=kf kBMO.5B0 IX/ ; where A D log.2/=4C15 only depends on the doubling constant.
71
3.3 BMO and John–Nirenberg’s lemma
Remark 3.16. A ball in a metric space may not have a unique centre and radius. For instance if X D Œ10; 10 R, then B.5; 6/ D B.6; 7/. Moreover, even if we fix the centre, the radius may not be unique as e.g. X D B.0; r/ for every r > 10 (if X D Œ10; 10), and in this case there is not even an optimal (minimal) radius that can be used. This nonuniqueness does play a role when blowing up (or down) a ball. So that e.g. even if B.x; r/ D B.y; s/ it can happen that 2B.x; r/ D B.x; 2r/ ¤ 2B.y; s/ D B.y; 2s/. For this reason we always require a ball to have a fixed centre and radius, even when none are given explicitly. In certain proofs, such as the one below, when e.g. finding a ball B.x; r/ within a larger ball B.y; s/ B.x; r/ we require, without loss of generality, that r 2s. Note that in general it is not possible to require that r s, unless x D y, e.g. if X D Œ9; 10 Œ1; 1, then B..8; 0/; 17/ B..0; 0/; 10/ and both balls have unique centres and radii. Proof. Note that as f5B0 is finite and f 2 BMO.5B0 I X /, we have f 2 L1 .5B0 /. Define the (noncentred) maximal function restricted to 5B0 as « jf fB0 j d M0 f .x/ D M5B0 .f fB0 /.x/ D sup B3x B5B0
B
and let G0 D fx 2 5B0 W M0 f .x/ > 0 g; 4C12 kf
kBMO.5B0 IX/ . Applying Lemma 3.12 to jf fB0 j and 5B0 in where 0 D place of f and yields Z C3 jf fB0 j d .G0 / 0 5B0 Z Z C3 jf f5B0 j d C jf5B0 fB0 j d : 0 5B0 5B0 For the first term in the sum on the right-hand side we have Z jf f5B0 j d .5B0 /kf kBMO.5B0 IX/ C3 .B0 /kf kBMO.5B0 IX/ : 5B0
In the second term the integrand is constant so that ˇ« ˇ Z Z ˇ ˇ .5B0 / ˇ ˇ jf5B0 fB0 j d D .5B0 /ˇ .f f5B0 / dˇ jf f5B0 j d .B0 / 5B0 5B0 B0 C3 .5B0 /kf kBMO.5B0 IX/ C6 .B0 /kf kBMO.5B0 IX/ : By combining the obtained estimates we arrive at .B0 \ G0 / .G0 /
2C9 kf kBMO.5B0 IX/ 0
.B0 /
1 .B0 / < .B0 /; 2
(3.3)
72
3 Doubling measures
from which we conclude that B0 n G0 ¤ ¿. Note that G0 is open by Lemma 3.12. For x 2 B0 define r.x/ D
1 20
dist.x; X n G0 /:
1 Since B0 n G0 ¤ ¿, we have r.x/ 10 R and hence B.x; 5r.x// 5B0 \ G0 for all x 2 B0 \ G0 . As [ B.x; r.x//; B0 \ G0 x2B0 \G0
the 5-covering lemma (Lemma 1.7) provides us with countably many pairwise disjoint balls Bzi D B.xi ; r.xi //, i D 1; 2; ::: , such that B 0 \ G0
1 [
5Bzi 5B0 \ G0 :
(3.4)
iD1
As 25r.xi / > dist.xi ; X n G0 /, we have that 25Bzi n G0 ¤ ¿ for every i D 1; 2; ::: . Note that even though the balls 25Bzi intersect the complement of G0 , we still have 25Bzi 5B0 . This implies that M0 f .x/ 0 and, in particular,
for x 2 25Bzi n G0
« zi 25B
jf fB0 j d 0
for every i:
We denote the balls obtained in the first step of the iteration by Bi D 5Bzi , i D 1; 2; ::: . Then ˇ« ˇ « ˇ ˇ .25Bzi / ˇ jfB0 fBi j D ˇ .f fB0 / dˇˇ jf fB0 j d C3 0 : (3.5) zi .5Bzi / 25Bzi 5B As Bzi G0 are pairwise disjoint, we have by (3.3) that 1 X iD1
.Bi / D
1 X
.5Bzi / C3
iD1
C3 .G0 /
1 X
.Bzi / D C3
iD1 12 2C kf kBMO.5B0 IX/
0
S (We of course also get the estimate 1 iD1 Bi stronger estimate above.) S As B0 \ G0 1 iD1 Bi , we have that M0 f .x/ 0
for x 2 B0 n
1 [
Bzi
iD1
.B0 / D 1 .B0 /, 2
1 [ iD1
Bi :
1 .B0 /: 2
(3.6)
but we will need the
3.3 BMO and John–Nirenberg’s lemma
In particular,
73
« B
jf fB0 j d 0
S for all balls B 5B0 which contain some x 2 B0 n 1 iD1 Bi . Hence, by Lebesgue’s differentiation theorem, « 1 [ jf .x/ fB0 j D lim jf fB0 j d 0 for a.e. x 2 B0 n Bi : (3.7) diam B!0 B
iD1
We would now like to repeat the same argument in every ball Bi . Let « Mi f .x/ D M5B .f f /.x/ D sup jf fBi j d Bi i B
B3x B5Bi
be the noncentred maximal function restricted to 5Bi , Gi D fx 2 5Bi W Mi f .x/ > 0 g
and ri .x/ D
1 20
dist.x; X n Gi / for x 2 Bi :
Recall that 5Bi 5B0 , so that kf kBMO.5Bi IX/ kf kBMO.5B0 IX/ . Repeating the above argument in each ball Bi1 with Mi1 f , Gi1 and ri .x/ in place of M0 f , G0 and r.x/, we obtain the balls Bi1 ;i2 in the second step of the iteration for which (as in (3.4)–(3.7)), 5Bi1 ;i2 5Bi1 ; 1 [
B i1 \ G i1
Bi1 ;i2 5Bi1 \ Gi1 ;
i2 D1
jfBi1 fBi1 ;i2 j C3 0 ; 1 X
.Bi1 ;i2 /
i2 D1
1 .Bi1 / 2
and jf .x/ fBi1 j 0
for a.e. x 2 Bi1 n
1 [
(3.8)
Bi1 ;i2 :
i2 D1
Moreover, from (3.6) and (3.8) we obtain that 1 X i1 ;i2 D1
.Bi1 ;i2 /
1 .B0 / 4
and by (3.5) and (3.9) we have jf .x/ fB0 j jf .x/ fBi1 j C jfBi1 fB0 j 0 C C3 0 2C3 0
(3.9)
74
3 Doubling measures
for a.e. x 2 Bi1 n
S1
i2 D1
Bi1 ;i2 . Consequently,
jf .x/ fB0 j 2C3 0
for a.e. x 2 B0 n
1 [
Bi1 ;i2 :
i1 ;i2 D1
In the kth step of the iteration we obtain balls Bi1 ;:::;ik for which jf .x/ fB0 j kC3 0
1 [
for a.e. x 2 B0 n
Bi1 ;:::;ik
i1 ;:::;ik D1
and
1 X
.Bi1 ;:::;ik / 2k .B0 /:
i1 ;:::;ik D1
Let now > 0 be arbitrary. If > C3 0 , we choose a positive integer k such that kC3 0 < .k C 1/C3 0 : In particular, k>
C3 0
1
3
and 2k < 2e log.2/=C 0 :
This implies that jf .x/ fB0 j kC3 0
1 [
for a.e. x 2 B0 n
Bi1 ;:::;ik :
i1 ;:::;ik D1
Consequently, we have .fx 2 B0 W jf .x/ fB0 j > g/
1 [
Bi1 ;:::;ik
i1 ;:::;ik D1 k
2
.B0 / < 2e
1 X
.Bi1 ;:::;ik /
i1 ;:::;ik D1 3 log.2/=C 0
.B0 /:
If 0 < C3 0 , then we use the trivial estimate 3
.fx 2 B0 W jf .x/ fB0 j > g/ .B0 / 2e log.2/=C 0 .B0 /: Hence for any > 0 we have 3
.fx 2 B0 W jf .x/ fB0 j > g/ 2e log.2/=C 0 .B0 / 2.B0 /e A=kf kBMO.5B0 IX/ ; where A D log.2/kf kBMO.5B0 IX/ =C3 0 D log.2/=4C15 depends only on the doubling constant.
3.4 Consequences of John–Nirenberg’s lemma
75
3.4 Consequences of John–Nirenberg’s lemma In this section, we collect a few consequences of the John–Nirenberg lemma (and the Cavalieri principle), which will be useful for future references. We start by comparing BMO with its Lp -generalization BMOp , defined below. Definition 3.17. Let
«
kf kBMOp .IX/ D sup
1=p jf fB jp d
;
B
B
where the supremum is taken over all balls B (and we implicitly require that fB is finite for all balls B ). We also let BMOp .I X / D ff W kf kBMOp .IX/ < 1g: Lemma 3.18. BMOp .I X / BMO.I X / and if f 2 BMO.I X /, then kf kBMO.IX/ kf kBMOp .IX/ : Proof. This follows directly from Hölder’s inequality as « 1=p « p jf fB j d jf fB j d : B
B
It is an interesting consequence of the John–Nirenberg lemma that BMOp is essentially independent of p. Proposition 3.19. Let f 2 BMO.11BI X / for some ball B D B.x0 ; r0 /. Then there is a constant c > 0, depending only on C and p, such that kf kBMO.BIX/ kf kBMOp .BIX/ ckf kBMO.11BIX/ : Proof. The first inequality follows from Lemma 3.18. We use the John–Nirenberg lemma (Theorem 3.15) to prove the second inequality. Let B 0 D B.x 0 ; r 0 / B, r 0 2r0 , be an arbitrary ball in B. Note that 5B 0 11B. By the Cavalieri principle (Lemma 1.10), we have using the change of variable D skf kBMO.11BIX/ =A, where A is the constant in the John–Nirenberg lemma, « Z 1 p p 0 jf fB j d D p1 .fx 2 B 0 W jf .x/ fB 0 j > g/ d 0/ 0 .B B Z 10 2p p1 e A=kf kBMO.5B 0 IX/ d 0 Z 1 2p p1 e A=kf kBMO.11BIX/ d 0 Z kf kBMO.11BIX/ p 1 p1 s s e ds 2p A 0 2p .p/ D kf kpBMO.11BIX/ : p A
76
3 Doubling measures
This implies that kf kBMOp .BIX/ ckf kBMO.11BIX/ ; where the constant c D .2p .p//1=p =A depends only on p and C . An even stronger consequence of the John–Nirenberg lemma is the following estimate for exponential integrability of BMO functions, which is often used in applications. In some literature, it is this estimate that is called the John–Nirenberg lemma. We shall use it (or rather its corollary) to “jump over zero” when proving the interior regularity of minimizers by means of the Moser iteration method in Chapter 8. Theorem 3.20. Let B X be a ball and f 2 BMO.5BI X /. Let further A be the constant in the John–Nirenberg lemma (Theorem 3.15). Then for every 0 < " < A there is a constant c, only depending on " and C , such that «
e "jf fB j=kf kBMO.5BIX/ d c:
B
Proof. By the Cavalieri principle (Lemma 1.10), we have for h W X ! Œ0; 1, using the change of variable t D e , that « e h d D
1 .B/
Z
1
.fx 2 B W e h.x/ > t g/ dt 0 Z 1 1 C .fx 2 B W e h.x/ > t g/ dt .B/ 1 Z 1 1 1C e .fx 2 B W h.x/ > g/ d : .B/ 0
B
This implies, using also John–Nirenberg’s lemma (Theorem 3.15), that « e "jf fB j=kf kBMO.5BIX/ d B Z 1 .fx 2 B W jf .x/ fB j > kf kBMO.5BIX/ ="g/ 1C e d .B/ 0 Z 1 1C2 e .1A="/ d 0
2 A=" 1 AC" D ; A" D1C
which only depends on " and C .
3.5 Gehring’s lemma
77
Corollary 3.21. Let B X be a ball and f 2 BMO.5BI X /. Then « e qjf fB j d 3; B
where q D log.2/=8C15 kf kBMO.5BIX/ . Proof. This follows directly from Theorem 3.20 after letting " D 12 A.
3.5 Gehring’s lemma The Gehring lemma is also of considerable importance, and we have chosen to include it here even though we do not actually need it in this book. Theorem 3.22. Let 1 < p < 1 and let f be a nonnegative function such that f 2 L1 .B/ for every ball B X . If there exists a constant CH 1 such that f satisfies the reverse Hölder inequality « 1=p « p f d CH f d for all balls B in X ; (3.10) B
2B
then there exists q > p such that 1=q « « f q d Cq B
f d for all balls B in X :
(3.11)
2B
The constants Cq and q depend only on p, CH and the doubling constant C . In fact, we may take q D p C .p 1/=22pC1 CHp C3pC17 and Cq D 8CH C31 . It follows directly, from Hölder’s inequality, that if p < t < q, then (3.11) holds with q replaced by t (and C t D Cq ). Note that if X is complete, then the condition that f 2 L1 .B/ for every ball B X is equivalent to saying that f 2 L1loc .X /, by Corollary 2.31 and Proposition 3.1. In fact, if we had defined L1loc as in A. Björn–Marola [59] this would have been true also in nonproper spaces, see also Remark 2.32. Proof. Let B0 D B.x0 ; r/ X be fixed but arbitrary. We start by constructing a Whitney type covering of B0 . For every x 2 B0 let r.x/ D
dist.x; X n B0 /: Since the balls B x; 15 r.x/ , x 2 B0 , cover B0 , the 5-covering lemma (Lemma 1.7) provides us with countably many balls Bi D B.xi ; ri /, xi 2 B0 , ri D r.xi /, i D 1; 2; ::: , such that 1 [ Bi B0 D
1 10
iD1
78
3 Doubling measures
and the balls 51 Bi are pairwise disjoint. Note that if x 2 5Bi , then dist.x; X n B0 / dist.xi ; X n B0 / C d.x; xi / < 10ri C 5ri D 15ri ; and similarly dist.x; X n B0 / dist.xi ; X n B0 / d.x; xi / > 10ri 5ri D 5ri : If 5Bi \ 5Bj ¤ ¿, then, letting y 2 5Bi \ 5Bj , we have 5rj < dist.y; X n B0 / < 15ri and thus 13 ri < rj < 3ri . Moreover, if z 2 5Bj , then d.z; xi / d.z; xj / C d.xj ; y/ C d.y; xi / 5rj C 5rj C 5ri < 35ri showing that 5Bj 35Bi . Fix x 2 S1Let us next show that the balls 5Bi , i D 1; 2; ::: , have bounded overlap. 1 5B and let I D fi W x 2 5B g. Let further j 2 I be such that r sup i i j i2I ri . iD1 2 For i 2 I we find that .5Bj / .35Bi / C8 15 Bi : Thus using the pairwise disjointness of the balls 15 Bi and that 15 Bi 5Bi 35Bj we find that X X 15 Bi .35Bj / 8 1 C C8 C11 : .5Bj / .5Bj / i2I
i2I
We introduce the auxiliary function h.x/ WD min
5Bi 3x
.5Bi / f .x/: .B0 /
Note that h f in B0 , as 5Bi B0 . Moreover, if x 2 12 B0 and x 2 5Bi , then r dist.x0 ; X n B0 / d.x0 ; x/ C d.x; xi / C dist.xi ; X n B0 / < 12 r C 5ri C 10ri ; and thus r < 30ri . If further y 2 B0 , then d.y; xi / d.y; x0 / C d.x0 ; x/ C d.x; xi / < r C 12 r C 5ri < 50ri ; i.e. B0 50Bi . Hence h.x/ D min
5Bi 3x
.5Bi / .5Bi / f .x/ f .x/ min f .x/ 5Bi 3x .50Bi / .B0 / C4
for x 2 12 B0 : (3.12)
3.5 Gehring’s lemma
79
Further, if B is a ball such that 2B 5Bi for some i , then by the reverse Hölder inequality (3.10) for f , «
1=p p
h d B
« 1=p .5Bi / p f d .B0 / B « CH .5Bi / f d .B0 / 2B « CH .5Bi / h d min .5Bj / 2B 5Bj \5Bi ¤¿ « CH .35Bj / max h d .5Bj / 5Bj \5Bi ¤¿ 2B « 3 CH C h d;
(3.13)
2B
i.e. h satisfies the reverse Hölder inequality on B with the constant CH C3 . Fix Bi D B.xi ; ri / and define the noncentred maximal function restricted to the ball 5Bi as « h d: Mi h.x/ D M5Bi h.x/ D sup B3x B5Bi
B
Let i D inf Mi h Bi
and E D fx 2 5Bi W Mi h.x/ > g, > 0, which is open by Lemma 3.12. For > i and every x 2 E let .x/ D dist.x; 5Bi n E /: Note that .x/ 2ri for x 2 Bi \ E as Bi n E ¤ ¿. Since the balls B x; 15 .x/ , x 2 E \ Bi , cover E \ Bi , the 5-covering lemma (Lemma 1.7) provides us with countably many balls Bj0 D B.xj0 ; .xj0 //, xj0 2 E \Bi , S such that E \ Bi j1D1 Bj0 and the balls 15 Bj0 are pairwise disjoint. It follows that 2Bj0 n E ¤ ¿, 2Bj0 5Bi and Bj0 E . Hence by (3.13) and the choice of .xj0 /, we have for every j D 1; 2; ::: that «
1=p p
Bj0
h d
«
CH C3
2Bj0
h d CH C3 :
80
3 Doubling measures
Thus .Bj0 / CHp C3p p .Bj0 /, where d D hp d. From this we conclude that .E \ Bi /
1 X
.Bj0 / CHp C3p p
j D1
1 X
.Bj0 /
j D1
CHp C3pC3 p
1 X
1 5
Bj0 CHp C3pC3 p .E /:
j D1
˚ Next, writing h D h C h , where h D h 12 C and h D min h; 12 , we have ˚ Mi h Mi h C 12 and hence E x 2 5Bi W Mi h .x/ > 12 . Lemma 3.12 then implies that Z Z 2C3 2C3 .E / h d h d: 5Bi fx25Bi Wh.x/>=2g
For a fixed nonnegative integer k, let hk D minfh; kg and F D fx 2 5Bi W hk .x/ > g: For < k, we have hk .x/ > if and only if h.x/ > and hence F D fx 2 5Bi W h.x/ > g: Since hk h Mi h a.e., the last two estimates imply that for < k, .F \ Bi / .E \ Bi / CHp C3pC3 p .E / Z C 0 p1 h d D C 0 p1 .F Q =2 /;
(3.14)
fx25Bi Wh.x/>=2g
where C 0 D 2CHp C3pC6 and d Q D h d. Since F is empty for k, this estimate holds for all > i . The Cavalieri principle (Lemma 1.10), with d D hp d, and (3.14) then yield for q > p, Z Z hq1 d Q hqp d (3.15) k k F2i \Bi
F2i \Bi
Z
2i
D .q p/
qp1 .F2i \ Bi / d Z 1 C .q p/ qp1 .F \ Bi / d 2i Z 1 qp1 .F \ Bi / d D .2i /qp .F2i \ Bi / C .q p/ 2i Z 1 .2i /qp C 0 .2i /p1 .F Q i / C C 0 .q p/ q2 .F Q =2 / d 0 Z Z 2q1 C 0 .q p/ q1 0 .2i / C h d C hq1 d : Q k q1 5Bi 5Bi 0
3.5 Gehring’s lemma
At the same time, Z Bi nF2i
hq1 d Q .2i /q1 .B Q i / D .2i /q1 k
81
Z h d; Bi
which together with (3.15) implies that Z Z Z 2q1 C 0 .q p/ q1 q 0 q1 hk h d 2 C i h d C hq1 h d: k q1 Bi 5Bi 5Bi
(3.16)
Now, since E \ Bi D Bi for every < i , Lemma 3.12 shows that Z C3 .Bi / h d for < i : 5Bi Letting ! i then yields that whenever i > 0 we have « « 3 .5Bi / 6 i C h d C f d; .Bi / 5Bi B0 which is clearly true also if i D 0. Inserting this into (3.16) and summing over i D 1; 2; ::: together with the bounded overlap C11 of the balls 5Bi gives « B0
hq1 h d k
2q C 0 C6.q1/ .B0 /
« f d
q1 X 1 Z
B0
iD1
h d 5Bi
1 Z 2q1 C 0 .q p/ X hq1 h d k .q 1/.B0 / 5B i iD1 q « « 2q C 000 .q p/ 00 f d C hq1 h d C k q 1 B0 B0
C
(3.17)
< 1; as hk k and h 2 L1 .B0 /. Here C 00 D 2q C 0 C6.q1/ C11 D 2qC1 CHp C3pC6qC11 and C 000 D 12 C 0 C11 D CHp C3pC17 . Choose now qDpC
p1 22pC1 C 000
:
Note that p < q < 2p and that 2q C 000 .q p/ 22p .p 1/ 1 < 2pC1 < : q1 2 .q 1/ 2 Subtracting the second term on the right-hand side in (3.17) thus gives us q « « 00 hq1 h d 2C f d : k B0
B0
82
3 Doubling measures
Letting k ! 1 then yields «
hq d 2C 00
q
« f d
B0
:
B0
Using (3.12) and letting B D 12 B0 shows that « B
f q d C4q
.2B/ .B/
«
hq d Czq
«
2B
q f d
(3.18)
2B
for all balls B such that 2B ¤ X , where Czq D 2C4qC1 C 00 D 2qC2 CHp C3pC10qC12 . finally a ball B with 2B D X and let R D diam X . As the balls Consider 1 R , x 2 X , cover X , the 5-covering lemma (Lemma 1.7) gives us N pairwise B x; 15 S 1 R such that X D N disjoint balls Bi D B xi ; 15 iD1 5Bi (for the moment we may allow for N D 1, but we next give a bound for N ). As .X / D .16Bi / C4 .Bi /; the disjointness shows that N
N X C4 .Bi / iD1
.X /
C4 :
Applying (3.18) to each ball 5Bi , i D 1; 2; ::: ; N , we obtain that « f d q
B
« N X .5Bi /
N X .2B/
Czq
«
q
f d f d .B/ 5Bi .B/ 10Bi iD1 q « q « N X .20Bi / C Czq f d NC1Cq Czq f d : .10Bi / 2B 2B q
iD1
iD1
Let finally Cq D 8CH C31 . Since 1 < p < q, we have that Cqq D 23q CHq C31q NC1Cq Czq Czq , which completes the proof.
3.6 Notes Doubling measures on R appear already in the famous paper by Beurling–Ahlfors [30], where they characterize boundary values of quasiconformal mappings in the upper half plane. The doubling condition makes it possible to prove various classical results such as inequalities for maximal functions and integral operators, Lebesgue’s differentiation theorem and John–Nirenberg’s and Gehring’s lemmas. A lot of analysis has been made
3.6 Notes
83
on so-called spaces of homogeneous type, i.e. on (quasi)metric spaces equipped with a doubling measure, see e.g. Coifman–Weiss [100], [101], Heinonen [169], Kronz [233], Pérez–Wheeden [303] and the references therein. The class BMO was introduced by John and Nirenberg in [192], where they also obtained the first version of the John–Nirenberg lemma. Metric space versions of the John–Nirenberg lemma have been obtained by Buckley [77], Mateu–Mattila–Nicolau– Orobitg [274] and Kronz [233]. Kronz actually obtained this result in the more general spaces of homogeneous type and with metric space targets. Recently, Hytönen [187] proved the John–Nirenberg lemma for certain nondoubling measures on metric spaces. Fix 1 and let ² ³ « BMO -loc .I X / D f W kf kBMO -loc .IX/ ´ sup jf fB j d < 1 ;
B B
where the supremum is taken over all balls B such that B . Assuming that X is a length space and that is doubling, Maasalo [Kansanen] [252] showed that BMO.I X / D BMO -loc .I X /; this is not true for general metric spaces with doubling measures. BMO spaces for nondoubling measures on Rn and metric spaces have been studied by Tolsa [337] and Hytönen [187]. Gehring [139] gave the first version of the Gehring lemma. The Gehring lemma in metric spaces can be found (somewhat hidden) in Strömberg–Torchinsky [330], where they actually work in spaces of homogeneous type. There are also metric space versions of the Gehring lemma in Gianazza [140] (in spaces of homogeneous type) and Zatorska-Goldstein [357]. Martín–Milman [264] gave a proof of the Gehring lemma for nondoubling measures on Rn . The version here is quite close to the metric space version given by Maasalo [Kansanen] [251]. The reverse Hölder inequality in Rn characterizes the class of A1 -weights, which consists of all Ap -weights, 1 p < 1, see e.g. Coifman–Fefferman [99] and Stein [328]. It also implies the open-endedness of the Ap -condition (A.5). In one dimension, the reverse Hölder inequality is closely related to the theory of quasiminimizers, see Martio–Sbordone [273] and Appendix C. The discrete maximal function has been studied by Kinnunen–Latvala [212] and Aalto–Kinnunen [1] on metric spaces equipped with a doubling measure.
Chapter 4
Poincaré inequalities
Upper gradients can be introduced and studied on general metric spaces, as we have done in Chapters 1 and 2. In general, e.g. when there are no curves, the upper gradients of a function give no control of it. Requiring a Poincaré inequality is one possibility of gaining such a control. At the same time as being quite general, this also makes it possible to build a very rich theory. This will be apparent in the second part of the book, where a Poincaré inequality is a standing assumption. In this chapter we introduce different types of Poincaré inequalities and study their connections and consequences, most of the time assuming doubling as well. We shall also see that quasiconvexity and the inner metric are interconnected with the theory of Poincaré inequalities.
4.1 Poincaré inequalities Definition 4.1. Let q 1. We say that X supports a .q; p/-Poincaré inequality if there exist constants CPI > 0 and 1 such that for all balls B X , all integrable functions u on X and all upper gradients g of u, 1=q
« ju uB j d q
B
«
1=p
CPI diam.B/
p
g d
;
(4.1)
B
ª where uB WD B u d. If D 1, then X supports a strong .q; p/-Poincaré inequality. For this to make sense we also make the implicit assumption that .B/ > 0 for all balls B X . In the literature, Poincaré inequalities with > 1 are often called weak Poincaré inequalities, and Poincaré inequality is reserved for the case when D 1, consequently the word “strong” is often omitted. For most of our results, > 1 will be sufficient and we therefore simplify the terminology by omitting the word “weak” instead. A point worth mentioning is that the property of supporting a Poincaré inequality is preserved under biLipschitz transformations of X . On the contrary, strong Poincaré inequalities need not be preserved. See Section 4.3. We shall often say p-Poincaré inequality, instead of .1; p/-Poincaré inequality. Further, we say that a space X is a p-Poincaré space if it supports a p-Poincaré inequality, and, somewhat incorrectly, that X is a doubling p-Poincaré space if also is doubling.
4.1 Poincaré inequalities
85
By the Hölder inequality, it is easy to see that if X supports a .q; p/-Poincaré inequality, then it supports a .q; N p/-Poincaré N inequality for every qN q and pN p. There are also other implications between various types of Poincaré inequalities that we will look at throughout the chapter. We first give several geometrical consequences of the p-Poincaré inequality. Proposition 4.2. Let X be a p-Poincaré space. Then X is connected. Recall that a topological space Y is connected if there do not exist two disjoint nonempty open sets U and V with U [ V D Y . Proof. Assume that X is not connected. Then there exist disjoint nonempty open sets U and V such that U [ V D X . Then u D U has g D 0 as an upper gradient (as there can be no curves going between U and V ). Let B be a ball with centre in U and so large that B \ V ¤ ¿. Then « « 1=p
ju uB j d C diam.B/
0< B
g p d
D 0;
(4.2)
B
a contradiction. Corollary 4.3. Assume that X is a doubling p-Poincaré space. Then .fxg/ D 0 for every x 2 X . Proof. By Proposition 4.2, X is connected. Hence the conclusion follows from Corollary 3.9. We will also use the following direct consequence of Proposition 4.2. Corollary 4.4. Let X be a p-Poincaré space. Then @B.x; r/ is nonempty whenever r < 12 diam X . Note that @B.x; r/ fy W d.x; y/ D rg sometimes without equality. Another consequence of the p-Poincaré inequality is that sets with capacity zero cannot separate X . We deduce this fact as a consequence of the following result. Lemma 4.5. Let X be a p-Poincaré space and assume that X is connected. In particular, we may have D X . If F is relatively closed, then Cp .F / D 0 if and only if Cp .@F \ / D 0. Proof. If D X , then is nonempty, open and connected, by Proposition 4.2, and thus the case D X is just a special case. The necessity is clear. As for the sufficiency, let G D int F . If G D ¿, then F D @F \ and we are done. We can therefore assume that G ¤ ¿. Then Cp .F / Cp .G/ > 0. If @G \ were empty, then both G and n G would be nonempty and open, contradicting the fact that is connected. Thus there is x 2 @G \ . Let B D B.x; r/ 2B ,
86
4 Poincaré inequalities
where is the dilation constant in the p-Poincaré inequality. As B contains points x we have .B \ G/ > 0 and .B n G/ x > 0. both in G and in n G, Assume that Cp .@F \ / D 0. Then Cp .@G \ / Cp .@F \ / D 0, and hence Modp . @G\ / D 0, by Proposition 1.48. Thus 0 is a p-weak upper gradient of u D G in B. The p-Poincaré inequality then shows that «
«
1=p
ju uB j d C diam.B/
0< B
B
gup d
D 0;
a contradiction. Hence Cp .@F \ / > 0. Lemma 4.6. Let X be a p-Poincaré space and assume that X is connected. In particular, we may have D X . If F is relatively closed with Cp .F / D 0, then n F is connected. Proof. Assume, on the contrary, that n F is disconnected, and let G be a component x \ ¤ , as there are other components. Then @E \ F so of n F . Let E D G Cp .@E \ / Cp .F / D 0. By Lemma 4.5, Cp .E/ D 0. But 0 < .G/ .E/ Cp .E/, a contradiction. The following examples show that the connectedness and the p-Poincaré inequality in Lemmas 4.5 and 4.6 are essential. Example 4.7. Let D .0; 1/ [ .2; 3/ X D R and F D .0; 1/. Then @F \ D ¿ and as Cp .F / > 0, the conclusion in Lemma 4.5 fails. With F D ¿ we instead see that the conclusion in Lemma 4.6 fails. Example 4.8. Let D X be the von Koch snowflake curve, see Example 1.23, which is connected, and let x ¤ y. Then Cp .fx; yg/ D 0, while n fx; yg is disconnected, showing that Lemma 4.6 fails. Letting A be a component of nfx; yg and F D fx; yg[A gives a counterexample to Lemma 4.5. The following result strengthens Proposition 1.48. Proposition 4.9. Let X be a p-Poincaré space and E X be measurable. Then Cp .E/ D 0 if and only if Modp . E / D 0. Proof. Assume that Modp . E / D 0. Let us first show that .X n E/ > 0. Assume on C the contrary that .X n E/ D 0. As .X / D E [ XnE , it follows from Lemma 1.42 that Modp . .X // D 0. Hence g 0 is a p-weak upper gradient of every function. Pick x ¤ y 2 X (here we use the assumption from the beginning of Section 1.1 that X is not a singleton). Let r D d.x; y/, u.z/ D .1 d.z; x/=r/C and B D B.x; r/. The p-Poincaré inequality shows as in (4.2) that u D uB a.e. in B. But u > 34 in a neighbourhood of x and u < 14 in a neighbourhood of y, which is a contradiction.
4.1 Poincaré inequalities
87
Thus, we must have .X n E/ > 0. Hence there is a ball B 0 with .B 0 n E/ > 0. Let v D E and E 0 D E \ B 0 . As Modp . E / D 0, g 0 is a p-weak upper gradient of v. So « 1=p « 0 p g d jv vB 0 j d 0 D C diam.B / B 0 B0 .E 0 / .E 0 / 0 0 .E / 1 n E/ C .B 2.E 0 /.B 0 n E 0 / .B 0 / .B 0 / D : D 0 .B / .B 0 /2 This yields that .E 0 / D 0, and, by varying B 0 , .E/ D 0. The result now follows from Proposition 1.48. Another consequence of the p-Poincaré inequality is that functions with Lp -integrable upper gradients are finite q.e. This is not true in general, see Remark 4.12. p Proposition 4.10. Let X be a p-Poincaré space and f 2 Dloc .X /. Then
Cp .fx W jf .x/j D 1g/ D 0: p p Corollary 4.11. Let X be a p-Poincaré space. Then Dloc .X / Gloc .X /.
Proof. This follows directly from Lemma 2.43 and Proposition 4.10. Proof of Proposition 4.10. Let g 2 Lploc .X / be an upper gradient of S f . As X is Lindelöf, we can find a countable family of balls fBj gj1D1 so that X D j1D1 Bj and f; g 2 Lp .Bj / for every j D 1; 2; ::: . Let Ej D fx 2 Bj W jf .x/j D 1g, j D 1; 2; ::: , and E D fx 2 X W jf .x/j D 1g. Let 2 Ej , W Œ0; l ! X . By compactness we can find 0 a < b < c l so that .Œa; c/ Bj and .b/ 2 Ej . As g is an upper gradient of f and jf ..b//j D 1 we see that Z Z gBj ds g ds D 1:
jŒa;b
S Hence, by Proposition 1.37, Modp . Ej / D 0. As E D j1D1 Ej , we also get that Modp . E / D 0 (by Corollary 1.38). Therefore Cp .E/ D 0, by Proposition 4.9. Remark 4.12. If X is a space with no curves (see Example 1.22), then 0 is trivially an upper gradient of every function, including u 1. Assuming that .X / > 0 we have Cp .X / > 0 and we see that the conclusions of Proposition 4.10 and Corollary 4.11 do not hold. Similarly Modp . X / D 0 in this case and the conclusion in Proposition 4.9 does not hold either. This shows that the assumption that X is a p-Poincaré space cannot be omitted in Propositions 4.9 and 4.10, nor in Corollary 4.11.
88
4 Poincaré inequalities
4.2 Characterizations of Poincaré inequalities Before we continue let us give a few simple characterizations of Poincaré inequalities. Proposition 4.13. Let q; 1 and CPI > 0. Then the following are equivalent: (a) X supports a .q; p/-Poincaré inequality with constants CPI and . (b) Inequality (4.1) holds for all balls B X , all bounded measurable functions u on X and all upper gradients g of u. (c) Inequality (4.1) holds for all balls B X , all measurable functions u on X and all upper gradients g of u, where the left-hand side is interpreted as 1 if uB is not defined. (d) Inequality (4.1) holds for all balls B X , all measurable functions u on X and all p-weak upper gradients g of u, where the left-hand side is interpreted as 1 if uB is not defined. Proof. (d) ) (c) ) (a) ) (b) These implications are trivial. (c) ) (d) This implication follows from Lemma 1.46. (Note that we can use Lemma 1.46 even if g … Lp .X /.) (b) ) (a) Let uk D maxfminfu; kg; kg, k D 1; 2; ::: , be the truncations of u at levels ˙k. Then g is an upper gradient also of uk (see the proof of Proposition 1.26). By dominated convergence we get that « « 1=q 1=q D lim ju uB jq d juk .uk /B jq d k!1
B
B
«
1=p
CPI diam.B/
p
g d
;
B
if the last integral is finite, whereas (4.1) is trivial otherwise. (a) ) (c) If uB is finite, then (4.1) follows as in the proof of (b) ) (a). Assume therefore that uB is either infinite or not defined. Then .uC /B D 1 or .u /B D 1 (or both). We may assume that .uC /B D 1. As g is an upper gradient also of uC , we may replace u by uC andªhence assume that u 0. ª We want to show that B g p d D 1. Assume, on the contrary, that B g p d < 1. By Proposition 4.10 (applied to B), we have .fx 2 B W u.x/ D 1g/ Cp .fx 2 B W u.x/ D 1g/ D 0: Hence, by dominated convergence, 1=q 1=q « « ju uB jq d D lim juk .uk /B jq d 1D k!1
B
B
«
1=p
CPI diam.B/ a contradiction. Thus
ª B
g p d B
g p d D 1, and (4.1) holds.
;
4.3 BiLipschitz invariance
89
We can now derive the following consequence of the .p; p/-Poincaré inequality. Proposition 4.14. Assume that X supports a .p; p/-Poincaré inequality. Then p 1;p Dloc ./ D Nloc ./:
Proof. One inclusion is trivial. p For the other, let u 2 Dloc ./ and let g 2 Lploc ./ be an upper gradient of u. Fix x 2 . Then we can find r > 0 such that B D B.x; r/ B is such that g 2 Lp .B/, where is the dilation constant in the .p; p/-Poincaré inequality. Proposition 4.13 implies that « 1=p « 1=p p p ju uB j d C diam.B/ g d < 1: B
B
In particular, uB 2 R and thus u 2 Lp .B/. Hence u 2 Lploc ./, and therefore 1;p u 2 Nloc ./. Let us give one more characterization due to Keith. Keith gives a few other characterizations as well. The proofs of these, as well as of Theorem 4.15, are however beyond this book. We will not use Theorem 4.15 except when proving Proposition A.17 in Appendix A. Theorem 4.15 (Keith [196], Theorem 2). Assume that X is complete and that is doubling. Then X is a p-Poincaré space if and only if there exist constants C > 0 and 1 such that for all balls B X , all functions u 2 Lipc .X / and all upper gradients g 2 Lipc .X / of u, « 1=p « ju uB j d C diam.B/ g p d : B
B
4.3 BiLipschitz invariance In this section, we shall see that Poincaré inequalities are preserved under biLipschitz mappings. Note that this is not true for strong Poincaré inequalities, see Example 4.18. Proposition 4.16. Let X D .X; d; / and Y D .Y; d 0 ; 0 / be two metric spaces, and ˆ W X ! Y be a biLipschitz mapping with biLipschitz constant L such that .E/ 0 .ˆ.E// M.E/ M for all -measurable sets E. Assume that X satisfies a .q; p/-Poincaré inequality with constants C 0 and , and that is doubling. Then Y satisfies a .q; p/-Poincaré inequality with constants C and L2 , where C depends only on p, q, C 0 , M , L and the doubling constant C , but not on .
90
4 Poincaré inequalities
To prove this we will need the following standard lemma, which will often be used in other proofs as well. Lemma 4.17. If u is integrable, 1 q < 1, a 2 R and E is a measurable set with positive measure, then « 1=q « 1=q q q ju uE j d 2 ju aj d : E
Recall that uE D
E
ª E
u d.
Proof. Note first that « 1=q « 1=q « q q juE aj d D juE aj ju aj d ju aj d : E
E
Hence, «
1=q ju uE j d q
E
«
1=q
ju aj d
E
E
« 2
« C
q
ju aj d
juE aj d E
1=q q
1=q q
:
E
Proof of Proposition 4.16. Let B 0 D B.y; r/ Y be a ball (in Y ), v be integrable on Y and g 0 be an upper gradient of v. Let further x D ˆ1 .y/, u D v ı ˆ, g D L.g 0 ı ˆ/ and B D B.x; Lr/. Note that ˆ1 .B 0 / B ˆ1 .L2 B 0 /. As distances are distorted by at most a factor L it follows that g is an upper gradient of u. Hence, using Lemma 4.17 we get that Z « 2q q 0 jv vB 0 j d 0 0 ju uB jq d.0 ı ˆ/ .B / ˆ1 .B 0 / B0 Z 2q M 2 ju uB jq d .ˆ1 .B 0 // ˆ1 .B 0 / Z C ju uB jq d .B/ B « q=p q p C diam.B/ g d B
C diam.B 0 /q
«
.g 0 /p d0
ˆ.B/
C diam.B 0 /q
«
L2 B 0
.g 0 /p d0
q=p q=p :
4.4 .q; p/-Poincaré inequalities
91
Example 4.18. Let 3 < T < , X D ŒT; T R and Y D fz 2 C W jzj D 1 and arg z 2 X g (with the one-dimensional Lebesgue measure along Y , and arg denoting the principal branch). Let further ˆ W X ! Y be given by ˆ.x/ D e ix , where i is the imaginary unit. Then ˆ is biLipschitz, X supports a strong 1-Poincaré inequality, while Y only supports a (weak) 1-Poincaré inequality. Moreover, the dilation constant for the 1-Poincaré inequality in Y tends to 1 as T ! . Example 4.19. Let X D R2 n ..0; 1/ .0; 1//, Y D R2 n ..0; M / .0; 1=M // and ˆ W X ! Y be given by ˆ.x; y/ D .M x; y=M /. The dilation constants in Poincaré inequalities for Y are the same as for Z D R2 n ..0; M 2 / .0; 1//, which by Example 8.20 is at least 21 M 2 . As ˆ has biLipschitz constant M , we see that the blow-up by L2 in Proposition 4.16 is of the right order.
4.4 .q; p/-Poincaré inequalities In this section we shall see that the validity of a p-Poincaré inequality is a self-improving property, i.e. that a doubling p-Poincaré space actually supports a better .q; p/-Poincaré inequality for some q > p. The exponent q is closely related to the “dimension” s of X given by the doubling condition for , see Section 3.1. We start by the following proposition which gives us one direction in the relation between q and s. Note that in Rn , we have s D n and q p D np=.n p/, i.e. the exponents in this section are sharp. See also Remark 9.56. Proposition 4.20. Assume that is doubling and X satisfies a .q; p/-Poincaré inequality for some q > p. Then for all balls B D B.x; r/ X and B 0 D B.x 0 ; r 0 /, with x 0 2 B and r 0 r, the estimate r 0 s .B 0 / C .B/ r
(4.3)
holds with s D qp=.q p/. Proof. Let B D B.x; r/ and B 0 D B.x 0 ; r 0 / be such that x 0 2 B and r 0 r. Note that 2B 0 3B. We shall test the .q; p/-Poincaré inequality on 3B with the .1=r 0 /Lipschitz function u.y/ D minf2 d.y; x 0 /=r 0 ; 1gC . Note that 0 u 1 in X , u D 1 in B 0 and u D 0 outside 2B 0 . We have that u3B
.2B 0 / .3B/
92
4 Poincaré inequalities
and hence the left-hand side in the .q; p/-Poincaré inequality can be estimated from below as « 1=q .B 0 / 1=q .2B 0 / ju u3B jq d 1 : .3B/ .3B/ 3B On the other hand, as gu D 2B 0 nB 0 =r 0 , the right-hand side is « Cr 3B
1=p gup
d
C r .2B 0 / 0 r .3B/
1=p
:
If .2B 0 / 12 .3B/, then these estimates together with the doubling property of give C r .2B 0 / 1=p C r .B 0 / 1=p .B 0 / 1=q 0 0 ; .3B/ r .3B/ r .3B/ which yields (4.3) with 1=s D 1=p 1=q. If .2B 0 / > 12 .3B/, then by the doubling property of , .B 0 / 1 r 0 s .2B 0 / 1 : .B/ C .3B/ 2C 2C r The following theorem shows that a p-Poincaré inequality together with the doubling condition implies the seemingly stronger .q; p/-Poincaré inequality. Together with Proposition 4.20 this also shows that condition (4.3) is both necessary and sufficient for the validity of a .q; p/-Poincaré inequality. Theorem 4.21. Assume that X supports a p-Poincaré inequality with dilation constant and that the measure satisfies (4.3) for some s > p. Then X supports a .p ; p/Poincaré inequality with p D sp=.s p/ and dilation constant 2. Before proving Theorem 4.21 we draw some consequences of it. Corollary 4.22. Assume that X supports a p-Poincaré inequality with dilation constant and that (4.3) holds for some s > p. If u 2 N 1;p .2B/, then u 2 Lp .B/ with p D sp=.s p/. Note that the exponent s in (4.3) is not uniquely determined, in particular, as r 0 r, we can always make s larger. Thus, the assumption s > p in Theorem 4.21 and Corollary 4.22 can always be fulfilled. On the other hand, a smaller s gives a better (larger) exponent p , which is often desirable, e.g. for the embedding results in Section 5.5. We can directly obtain the following Sobolev embedding result. Corollary 4.23 (Local Sobolev embedding). Assume that X is a p-Poincaré space 1;p and that (4.3) holds for some s. Let u 2 Nloc ./. If s > p, then u 2 Lploc ./ with p D sp=.s p/, while if s p, then u 2 Lqloc ./ for all 1 q < 1.
93
4.4 .q; p/-Poincaré inequalities
Proof. If s > p, then this is a direct consequence of Corollary 4.22. On the other hand, if s p and q > p, then (4.3) also holds with s 0 D qp=.q p/ > p s in place of s, and we can apply Corollary 4.22 with s 0 in place of s, obtaining that u 2 Lqloc ./. That u 2 Lqloc ./ also for 1 q p follows from Hölder’s inequality. The limiting case q D 1 is not possible s D p, as shown in Rn , n > 1, by the for1 1;n function u.x/ D log log.1=jxj/ 2 W B 0; 2 . However, in this case, a Trudinger 1;p inequality holds and every function in Nloc ./ is locally exponentially integrable, see the notes to this chapter. When s < p it is possible to let q D 1, as we show in the L1 -local Sobolev embedding for large p (Corollary 4.28) below. In fact, if X is complete, even more is true for p > s, viz. that Newtonian functions are locally Hölder continuous, see Corollary 5.49. The following result is another direct consequence of Theorem 4.21. Corollary 4.24. Assume that is doubling and X supports a p-Poincaré inequality with dilation constant . Then X supports a .q; p/-Poincaré inequality for some q > p and with dilation constant 2. Moreover, X supports a .p; p/-Poincaré inequality with dilation constant 2. Proof. As is doubling it satisfies (4.3) with s D log2 C , where C is the doubling constant, by Lemma 3.3. It is then trivial that (4.3) is fulfilled for every s log2 C . With s D maxflog2 C ; 2pg we obtain the desired .q; p/-Poincaré inequality from Theorem 4.21. A .p; p/-Poincaré inequality follows directly from the .q; p/-Poincaré inequality and Hölder’s inequality. To prove the .q; p/-Poincaré inequality, we shall need the following lemma which in various versions goes under the name Maz0 ya’s truncation method. Lemma 4.25. Let G be an open set, A and E A G be measurable with positive measures and q p be such that q > 1. Assume that for all t 0 and all u 2 N 1;p .G/, the following weak type estimate holds, « q=p q p gu d : (4.4) t .fx 2 A W ju.x/ uE j t g/ C0 .A/ G
Then for all u 2 N 1;p .G/, 1=q « 1=q q ju uA j d 32C0 1C A
.A/ q q 1 .E/
1=p
1=q « G
gup
d
:
Replacing u by u uE , we may assume that uE D 0. We estimate the integral ªProof. q u d. Let k0 be the largest integer such that A C « uC d; (4.5) 2k0 1 E
94
4 Poincaré inequalities
and for k > k0 , let
uk D minf2k ; .u 2k /C g
be the truncation of u at levels 2k and 2kC1 . Then « « .uk /E D uk d uC d < 2k0 2k1 E
E
and (4.4) applied to uk with t D 2k1 yields 2.k1/q .fx 2 A W u.x/ 2kC1 g/ 2.k1/q .fx 2 A W juk .x/ .uk /E j 2k1 g/ « q=p C0 .A/ gupk d : G
As guk D gu f2k
k0 , that Z fx2AWu.x/>2k0 C2 g
uqC d
1 X
2.kC2/q .fx 2 A W 2kC1 u.x/ 2kC2 g/
kDk0 C1
2 C0 .A/ 3q
« 1 X kDk0 C1
q=p
G
gupk
d
« q=p p 2 C0 .A/ gu d ; 3q
(4.6)
G
where the last inequality follows from the elementary inequality 1 X
aj˛ D
j D1
1 X j D1
aj˛1 aj
1 X 1 X j D1 iD1
˛1 ai
aj D
1 X
˛ aj
;
j D1
for aj 0, j D 1; 2; ::: , and ˛ 1. Using (4.5) we have « q Z uqC d 2.k0 C2/q .A/ 23q .A/ uC d : fx2AWu.x/2k0 C2 g
(4.7)
E
Now, for every > 0, (4.4) implies, by the Cavalieri principle (Lemma 1.10), that « Z 1 1 uC d C .fx 2 A W ju.x/ uE j t g/ dt .E/ E q=p Z 1 « C0 .A/ dt p C gu d .E/ tq G q=p « C0 .A/ p q D 1C : g d q 1 .E/ G u
95
4.4 .q; p/-Poincaré inequalities
Choosing
D
we obtain
«
C0 .A/ .E/
1=q «
1=p
G
gup
d
« 1=p C01=q q .A/ 1=q p uC d gu d ; q 1 .E/ E G
(4.8)
if ¤ 0. If D 0, then u D uE D 0 q.e., and thus (4.8) holds also in this case. Inserting (4.8) into (4.7) now yields 1 .A/
Z fx2AWu.x/2k0 C2 g
uqC d 23q C0
q q1
q
q=p
«
.A/ .E/
G
gup d
:
Adding (4.6) to the last estimate and using the assumption uE D 0, we get
«
q
A
.u uE /C d 2 C0
The integral proof.
ª
A .u
3q
q 1C q1
q
.A/ .E/
« G
q=p gup
d
:
uE /q d is estimated similarly and Lemma 4.17 finishes the
Proof of TheoremR 4.21. Let B D B.x0 ; r/ and u 2 N 1;p .2B/. We can assume that r diam X and 2B gup d > 0. Let further x 2 B be a Lebesgue point of u, B0 D 2B, r0 D 2r, rj D 2j r and Bj D B.x; rj /, j D 1; 2; ::: . The doubling property of and the p-Poincaré inequality then show that ju.x/ uB0 j D lim juBj uB0 j j !1
C3
1 « X j D0 Bj
1 « X j D0 Bj C1
ju uBj j d C
and
ju uBj j d
1 X
« rj
« juB uB0 j C r
Bj
j D0
1=p gup
d
(4.9)
1=p B0
gup d
:
(Observe that the power 3 in C3 above is needed when j D 0.) Condition (4.3) applied to the balls Bj and B0 then yields rj C r..Bj /=.B0 //1=s and hence Z 1=p 1 X Cr 1=s1=p p ju.x/ uB j .Bj / gu d : .B0 /1=s j D0 Bj
96
4 Poincaré inequalities
Next, we write the above sum as †0 C †00 , where the summations in †0 and †00 are over j < j0 and j j0 , respectively (j0 0 will be chosen later). It follows from Lemma 3.7 that there exists < 1 independent of j such that .Bj / C j j0 .Bj0 / for j < j0 and .Bj / C j j0 .Bj0 / for j j0 . Hence, as 1=s 1=p < 0, we get †0 D
jX 0 1
Z
1=p
.Bj /1=s1=p Bj
j D0
gup d
Z C.Bj0 /
1=s1=p B0
gup
d
1=p jX 0 1
.j j0 /.1=s1=p/ ;
j D0
where the last sum can be estimated from above by 1=p1=s =.1 1=p1=s /. Similarly, « 1=p 1 1 X X 00 1=s p 1=s 1=p † D .Bj / gu d C.Bj0 / M.x/ .j j0 /=s ; Bj
j Dj0
j Dj0
where g p .x/ D sup M.x/ D MB 0 u B0
« B0
gup d
and the supremum is taken over all balls B 0 B0 containing x. Note that M.x/ is finite for a.e. x 2 B, by Lemma 3.12, and the sum on the right-hand side in †00 equals 1=.1 1=s /. ª Next, as 0 < B0 gup d M.x/ and B0 6B1 , we can for a.e. x 2 B find j0 1 (depending on x) such that Z 1 C2 .Bj0 / g p d C3 .Bj0 /: M.x/ B0 u Indeed, j0 is the largest integer such that the right inequality holds, and the left inequality then follows from the doubling property. Inserting this into the above estimates of †0 and †00 yields « 1=s Cr 0 00 p ju.x/ uB j .† C † / C r g d M.x/1=p ; u .B0 /1=s B0 where p D sp=.s p/. If ju.x/ uB j t , then this implies that p =s « C tp p M.x/ p gu d : r B0 Lemma 3.12 shows that .fx 2 B0 W M.x/ g/
C
Z B0
gup d;
(4.10)
4.4 .q; p/-Poincaré inequalities
97
which together with (4.10) implies the following weak type estimate for all t 0 and u 2 N 1;p .2B/,
«
p =p
t p .fx 2 B W ju.x/ uB j t g/ C r p .B/ 2B
gup d
;
where C is independent of u and B. An application of Lemma 4.25 with q D p , A D E D B, G D 2B and C0 D C r p finishes the proof. Corollary 4.26. If X is a p-Poincaré space and satisfies (4.3) for some s p, then X supports a .q; p/-Poincaré inequality for all 1 q < 1. Proof. Let s 0 D p C ", " > 0. Then (4.3) holds with s replaced by s 0 and Theorem 4.21 shows that X supports a .q; p/-Poincaré inequality with qD
s0p .p C "/p D : s0 p "
Choosing " sufficiently small finishes the proof. Corollary 4.26 can be further improved for s < p, so that the case q D 1 is included. This is not possible for s D p, as the function u.x/ D log log.1=jxj/ 2 W 1;n B 0; 12 in Rn , n > 1, shows. Instead, an exponential Trudinger inequality holds, see the notes to this chapter. Proposition 4.27. Assume that X is a p-Poincaré space and that (4.3) holds for some s < p. If B X is a ball with radius r and u 2 N 1;p .2B/, then «
1=p
ess sup ju.x/ uB j C r x2B
2B
gup d
;
where is the dilation constant in the p-Poincaré inequality. Note that the left-hand side equals Cp - ess supx2B ju.x/ uB j, by Corollary 1.69. A direct consequence of Proposition 4.27 is the following local Sobolev embedding for the case s < p. Corollary 4.28 (L1 -local Sobolev embedding for large p). Let X be a p-Poincaré 1;p space such that (4.3) holds for some s < p. If u 2 Nloc ./, then u 2 L1 loc ./. We improve upon this result in the local Sobolev embedding for large p (Corollary 5.49), showing that Newtonian functions are locally Hölder continuous under the additional assumption that X is complete.
98
4 Poincaré inequalities
Proof of Proposition 4.27. Let x 2 B be a Lebesgue point of u, rj D 2j r and Bj D B.x; rj /, j D 0; 1; ::: . Note that B0 2B. The doubling property of and the p-Poincaré inequality show as in (4.9) that 1 X
ju.x/ uB0 j C
rj
j D0
1 .Bj /
1=p
Z Bj
gup
d
:
(4.11)
(Note that B0 is defined slightly differently here.) By assumption (4.3) we have that .Bj /=.2B/ C 2js and inserting this into (4.11) gives 1 X
ju.x/ uB0 j C r
2j.1s=p/
j D0
«
1 .2B/
Bj
1=p
Cr 2B
gup d
1=p
Z gup d
;
since 1 s=p > 0. Finally, the doubling property of and the p-Poincaré inequality imply that «
« juB0 u2B j C
1=p
ju u2B j d C r 2B
gup d
2B
:
A similar estimate holds for juB u2B j, which concludes the proof. The following estimate for the capacity of small sets is the first step in proving that for p > s, singletons have positive capacity, cf. Corollary 5.39. Note that in Corollary 5.39, the space X is assumed to be complete. Here we only obtain a uniform lower bound for all balls B.x0 ; / with > 0. Corollary 4.29. Assume that X is a p-Poincaré space and that (4.3) holds for some s < p. Then for every ball B D B.x0 ; r/ and for every set E B with positive capacity we have Cp .E/ C.B/=.r p C 1/. In particular, Cp .B.x0 ; // C.B/=.r p C 1/ for all > 0. Proof. Let u 2 N 1;p .X / be such that 0 u 1 in X and u D 1 on E. Then by Proposition 4.27 and the comment after it, «
1=p
1 j1 uB j C uB C r
C.r C 1/ .B/ p
Z X
2B
.gup C up / d
« C
gup d
1=p up d
B
1=p :
Taking infimum over all u admissible in the definition of Cp .E/ finishes the proof of the corollary.
4.5 Quasiconvexity and connectivity
99
We have seen in Theorem 4.21 that the p-Poincaré inequality together with the doubling condition implies the seemingly stronger .q; p/-Poincaré inequality. The next result shows that Poincaré inequalities are self-improving (or open-ended) in another sense as well. Another self-improving (or open-ended) result is the Gehring lemma, Theorem 3.22. Theorem 4.30 (Keith–Zhong [199]). Let p > 1 and assume that X is a complete doubling p-Poincaré space. Then there is q < p such that X is a q-Poincaré space. The proof of this result goes beyond this book, and we refer the reader to [199] for the proof. In fact the proof therein depends on Theorem 4.15 which we have not proved either. We will use this result in Chapter 8, when showing that superminimizers can be regularized by making changes on sets of capacity zero. (More specifically, we use it when applying Theorem 5.62 in the proof of Theorem 8.22.) This result is subsequently used quite extensively. The validity of a better q-Poincaré inequality also implies the equivalence between several different definitions of Sobolev type spaces on metric spaces, see Appendix B. The reader who so prefers may, instead of being dependent on Theorem 4.30, choose to require that X is a complete q-Poincaré doubling space for some q < p instead of our assumption that X is a complete p-Poincaré doubling space, made in the beginning of Chapter 7. In earlier literature, the better q-Poincaré inequality was a standard assumption.
4.5 Quasiconvexity and connectivity We already know, by Proposition 4.2, that any p-Poincaré space is connected. In this section we prove a stronger geometrical consequence of the p-Poincaré inequality (assuming also completeness and doubling), viz. quasiconvexity. This also implies an equivalence between various types of connectivity. Another consequence of quasiconvexity is its influence on the dilation constant in the Poincaré inequality. This will be studied in Section 4.6. Let us start this section with some definitions. Recall that our curves are always parameterized by arc length. Definition 4.31. A metric space X is L-quasiconvex, L 1, if for all x; y 2 X there is a (possibly constant) curve W Œ0; l ! X such that .0/ D x, .l / D y and l Ld.x; y/. A metric space X is quasiconvex if it is L-quasiconvex for some L. A metric space X is geodesic if it is 1-quasiconvex, if it is merely .1C"/-quasiconvex for all " > 0, then it is a length space. The following theorem is the main result of this section.
100
4 Poincaré inequalities
Theorem 4.32. Assume that X is a complete doubling p-Poincaré space. Then X is L-quasiconvex, with L D 192C3 CPI , where CPI is the constant in the p-Poincaré inequality. Note that L is independent of the dilation constant in the p-Poincaré inequality. See, however, Section 4.8, where relations between L and are discussed. Theorem 4.39 below shows that one can always obtain a Poincaré inequality with dilation constant D L. Before proving Theorem 4.32, we need the following definition and lemma. Definition 4.33. We say that .x0 ; ::: ; xm / is an "-chain from x0 to xm if d.xi1 ; xi / < " for i D 1; 2; ::: ; m: Lemma 4.34. Let X be a complete doubling p-Poincaré space. Let .x0 ; x1 ; ::: ; xm / be an "-chain from x0 to x D xm and assume that d.x0 ; x/ ". Then there exists a 3"-subchain .x00 ; x10 ; ::: ; xk0 / from x0 to x such that 0 ; xi0 / < 3" for i D 1; 2; ::: ; k: " d.xi1
Proof. Let x00 D x0 . If d.x00 ; x/ < 3", then .x00 ; x/ is the required chain. Otherwise, find the largest i such that d.x00 ; xi / < 2" and put x10 D xi . Clearly, d.x10 ; x/ d.x; x00 / d.x00 ; x10 / 3" 2" D ": We now repeat the argument: Either d.x10 ; x/ < 3", in which case .x00 ; x10 ; x/ is the required chain, or we find the largest j such that d.x10 ; xj / < 2" and put x20 D xj . Again d.x20 ; x/ ". Since j > i , we obtain the required chain in at most m steps. Remark 4.35. For a fixed x0 2 X and " > 0, let U consist of all x 2 X such that there exists an "-chain from x0 to x. Note that U is nonempty and open, since for every x 2 U , we have B.x; "/ U . On the other hand, if x … U , then B.x; "/ \ U is empty and thus X n U is also open. It follows that if X is connected, then X n U must be empty, i.e. there is an "-chain from x0 to x for every x 2 X . Proof of Theorem 4.32. For a fixed x0 2 X and arbitrary x 2 X , let x0 ;" .x/ D inf
m X
d.xi1 ; xi /;
iD1
where the infimum is taken over all "-chains from x0 to x. Note that if d.x; y/ < ", then j x0 ;" .x/ x0 ;" .y/j d.x; y/ and hence x0 ;" is locally Lipschitz and lip x0 ;" .x/ 1 for all x 2 X . It follows that g 1 is an upper gradient of x0 ;" on X , by Proposition 1.14. Hence by the p-Poincaré
4.5 Quasiconvexity and connectivity
101
inequality ªwith B0 D B.x0 ; 2d.x0 ; x//, Bj D B.x; 2j d.x0 ; x//, for j D 1; 2; ::: , and j D Bj x0 ;" d, j x0 ;" .x/ 0 j
1 X
j j C1 j j
j D0
1 « X
j D0 Bj C1
C3
j x0 ;" j j d
1 « X
j D0 Bj
4C3 CPI
j x0 ;" j j d
1 X
2
j
« d.x0 ; x/
j D0
1=p p
g d Bj
D C 0 d.x0 ; x/; where C 0 D 8C3 CPI . (Observe that the power 3 in C3 above is needed when j D 0 and that diam.B0 / 4d.x0 ; x/.) Similarly, j 0 j D j x0 ;" .x0 / 0 j C 0 d.x0 ; x/ and the triangle inequality implies that j x0 ;" .x/j 2C 0 d.x0 ; x/. Hence, for fixed x0 and x, x0 ;" .x/ % x0 .x/ 2C 0 d.x0 ; x/; as " ! 0: (4.12) Now, let x0 ¤ x 2 X be fixed. For each n D 1; 2; ::: , there exists 0 < "n 2n x0 .x/ such that x .x/ : (4.13) x0 ;"n .x/ 0 2 Note that "n 2n x0 .x/ 2C 0 2n d.x0 ; x/, i.e. for sufficiently large n (independent of x) we have "n =3 d.x0 ; x/. Pick an "n =3-chain .x0 ; x1 ; ::: ; xm / from x0 to x such that m X d.xi1 ; xi / < 2 x0 .x/ iD1 n and use Lemma 4.34 to thin it out into an "n -chain .x0 D x0n ; x1n ; ::: ; xm D x/ n satisfying for all i D 1; 2; ::: ; mn ;
"n n ; xin / < "n : d.xi1 3 Let kn be the smallest integer such that 2kn mn and define ´ if i D 0; 1; ::: ; mn 1; xn; kn n .2 i / D in xmn D x; if i D mn ; mn C 1; ::: ; 2kn :
102
4 Poincaré inequalities
Pmn n n Note that mn "n =3 iD1 d.xi1 ; xi / < 2 x0 .x/ and hence "n 6 x0 .x/=mn . kn This implies that for all i D 1; 2; ::: ; 2 ; n ; xin / < "n d.xi1
6 x0 .x/ 12 x0 .x/ ; mn 2kn
i.e. n is 12 x0 .x/-Lipschitz on the set Skn , where Sj WD f2j i W i D 0; 1; ::: ; 2j g, j D 1; 2; ::: . Since by (4.13), mn X x .x/ n m n "n > d.xi1 ; xin / 0 ; 2 iD1
we have also 2kn mn >
x0 .x/ 2n1 ; 2"n
i.e. kn n ! 1, as n ! 1. This means that for every k and every n k, we have kn k and since Sk SkC1 for all k, it follows that all n , n k, are defined on Sk . Thus, by the Ascoli theorem (see e.g. p. 169 in Royden [310], note that here we need a version of Ascoli’s theorem valid for metric space valued equicontinuous functions), we can find a set N1 of positive integers such that the sequence fn gn2N1 converges uniformly on S1 to a 12 x0 .x/-Lipschitz function . Continuing in this way, we obtain N1 N2 such that for each j D 1; 2; ::: , the sequence fn gn2Nj converges uniformly on Sj to . A diagonal argument provides us with a sequence n1 ; n2 ; ::: S converging uniformly to on each Sj . This defines on the dense subset S D 1 iD1 Si of Œ0; 1. Note also that by the uniform convergence, is 12 x0 .x/-Lipschitz on each Sj and thus on S. In particular, can be extended into a 12 x0 .x/-Lipschitz function on the whole Œ0; 1. After reparameterization, it thus provides us with a rectifiable curve from x0 to x with arc length at most 12 x0 .x/. Together with (4.12), this finishes the proof. Definition 4.36. A metric space X is pathconnected if for all x; y 2 X there is a continuous function W Œ0; 1 ! X with .0/ D x and .1/ D y. A metric space X is rectifiably connected if for all x; y 2 X there is a (possibly constant) curve W Œ0; l ! X with .0/ D x and .l / D y. The difference between pathconnected and rectifiably connected is that in the former case, the image of need not be rectifiable. For us the rectifiability of the connecting curve is important. Recall that every curve, in this book, is implicitly assumed to be rectifiable and parameterized by arc length. Lemma 4.37. Let X be an arbitrary metric space. If X is rectifiably connected, then it is pathconnected. If X is pathconnected, then it is connected.
4.6 Poincaré inequalities in quasiconvex spaces
103
Proof. The first part is trivial. We therefore turn to the second part. Assume that X is pathconnected, but not connected, and let U and V be disjoint nonempty open subsets of X with U [ V D X . Let u D U which is continuous on X . Find points x 2 U and y 2 V . Let further W Œ0; 1 ! X be a continuous function with .0/ D x and .1/ D y. Then u ı is continuous, but u ı .Œ0; 1/ D f0; 1g, a contradiction. In quasiconvex spaces the above three notions of connectivity coincide. Lemma 4.38. Assume that X is quasiconvex. Then is rectifiably connected if and only if it is connected. Note that itself need not be quasiconvex. Proof. The necessity follows directly from Lemma 4.37. As for the sufficiency, assume that is not rectifiably connected. Let x 2 and let U be the set of all points in which are rectifiably connected to x in , i.e. y 2 U if there is a (possibly constant) curve W Œ0; l ! with .0/ D x and .l / D y. (Note that the relation “rectifiably connected” between points is an equivalence relation.) Let us show that U is open. Fix y 2 U and find r > 0 so that B.y; Lr/ , where L is such that X is L-quasiconvex. Let z 2 B.y; r/. By the quasiconvexity of X , there is a (possibly constant) curve W Œ0; l ! X with .0/ D y, .l / D z and l Ld.y; z/ < Lr, and hence B.y; Lr/ . Thus z 2 U , and hence U is open. Similarly V WD n U is open. Moreover, V is nonempty since is not rectifiably connected. Hence U and V satisfy the conditions in the definition of connectedness, and is not connected.
4.6 Poincaré inequalities in quasiconvex spaces If X is quasiconvex, in particular if it is a complete doubling p-Poincaré space, then there is an upper bound for the dilation constant in Poincaré inequalities. Recall from Theorem 4.32 that the quasiconvexity constant L 192C3 CPI and that it does not depend on the dilation constant . In particular, it yields a lower bound on the constant CPI in the p-Poincaré inequality, no matter how large is. The following result goes in the opposite direction and provides us with an upper bound for the best possible dilation constant in the Poincaré inequality. In view of Example 4.50 it is of the right magnitude. See Section 4.8 for further discussion. Theorem 4.39. Assume that X is L-quasiconvex and supports a p-Poincaré inequality, and that (4.3) holds for some s > p. Then X supports a .p ; p/-Poincaré inequality with p D sp=.s p/ and the dilation constant L.
104
4 Poincaré inequalities
Proof. We can assume that L < 2, as otherwise the result follows directly from Theorem 4.21. Let B.x0 ; r/ be a ball, u 2 N 1;p .B.x0 ; Lr//, and let x 2 B.x R 0 ; r/ be a Lebesgue point of u. We can assume that r diam.X /=L and that B.x0 ;Lr/ gup d > 0. By the L-quasiconvexity there exists a curve parameterized by arc length such that .0/ D x0 , .l / D x and its length is l Ld.x; x0 / < Lr. Let 0 D Lr=2 and i D 2i 0 , i D 1; 2; ::: , where is the dilation constant in the p-Poincaré inequality. We shall construct a chain of balls along the curve which connect x0 to x and have substantial overlaps. Find the smallest nonnegative integer ix so that 2 ix L.r d.x; x0 //. For each i D 0; 1; ::: ; ix 1 consider all integers j 0 such that ti;j WD .1 2i /l C j i < .1 2.iC1/ /l : We have j < 2.iC1/ l = i < 2.iC1/ Lr= i D for all such j . Similarly, consider all j 0 such that tix ;j WD .1 2ix /l C j ix < l : This time we have j < 2ix l = ix < 2ix Lr= ix D 2. Let xi;j D .ti;j /. Then the balls Bi;j D B.xi;j ; i / cover in the direction from x0 to x. Moreover, if i < ix , then d.x0 ; xi;j / C i ti;j C i < .1 2iC1 /l C 2.iC1/ Lr < Lr; while d.x0 ; xix ;j / C ix tix ;j C ix < l C 21 L.r d.x; x0 // Ld.x; x0 / C 12 L.r d.x; x0 // D 12 L.r C d.x; x0 // < Lr; i.e. Bi;j B.x0 ; Lr/ for all i ’s and j ’s under consideration. Note that d.xi;j ; x/ l ti;j 2i l 2 i and hence by Lemma 3.6 we have 1 .Bi;j / .B.x; i // C.Bi;j /: C
(4.14)
We complete the chain by adding the balls Bi;0 D B.x; i / for i > ix . Note that again d.x; x0 / C i d.x; x0 / C 12 L.r d.x; x0 // 12 L.r C d.x; x0 // < Lr; so that Bi;0 B.x0 ; Lr/ also for these balls. Order the balls Bi;j lexicographically, i.e. Bi;j comes before Bi 0 ;j 0 if and only if i < i 0 , or i D i 0 and j < j 0 . For a ball B in the chain, let B be its immediate successor with respect to the lexicographic ordering. Note that the centre of B lies in Bx and hence we always have B 2B. Moreover, B \ B contains a ball B 0 with radius =2, where is the radius of B . (Let e.g. B 0 D B.x 0 ; =2/, where x 0 is
4.6 Poincaré inequalities in quasiconvex spaces
105
obtained by back tracking the distance =2 along from the centre of B .) We can now estimate juB uB j as follows, « « ju uB j d C ju uB j d juB uB j juB uB 0 j C juB 0 uB j B0 B0 « « C ju uB j d C C ju uB j d: B
B
The doubling property of and the p-Poincaré inequality then show that 1=p X X « p juB uB j C B gu d ; ju.x/uB0;0 j D lim juBi;0 uB0;0 j i!1
B
B
B
where B is the radius of B and the sum is over all balls in the chain connecting x0 to x. Condition (4.3) applied to the balls B and B.x0 ; Lr/, together with (4.14) and the fact that L < 2, then yields .B.x; B // 1=s B C r .B.x0 ; Lr// and hence ju.x/ uB0;0 j
1=p Z X Cr 1=s1=p p .B.x; // g d : B u .B.x0 ; Lr//1=s B B
Next, we write the above sum as †0 C †00 , where the summations in †0 and †00 are over B with B > i0 and B i0 , respectively (i0 will be chosen later). It follows from Lemma 3.7 that there exists < 1 independent of i such that .B.x; i // C ii0 .B.x; i0 //
for i < i0
.B.x; i // C ii0 .B.x; i0 //
for i i0 .
and Hence, as 1=s 1=p < 0, 0
Z
† C.B.x; i0 // and
1=s1=p B.x0 ;Lr/
1=p gup
d
†00 C.B.x; i0 //1=s M.x/1=p ;
where M.x/ D MB.x gup .x/ is the noncentred maximal function restricted to the 0 ;Lr/ ª ball B.x0 ; Lr/. Next, as 0 < B.x0 ;Lr/ gup d M.x/ and B.x0 ; Lr/ B.x; 2Lr/ D B.x; 4 0 /, we can find i0 0 such that Z 1 g p d C2 .B.x; i0 //: C .B.x; i0 // M.x/ B.x0 ;Lr/ u
106
4 Poincaré inequalities
Indeed, i0 is the largest integer for which the right inequality holds, and the left inequality then follows from the doubling property. Inserting this into the above estimates of †0 and †00 yields « 1=s Cr 0 00 p ju.x/ uB0;0 j .† C † / C r gu d M.x/1=p ; 1=s .B.x0 ; Lr// B.x0 ;Lr/ (4.15) where p D sp=.s p/. Lemma 3.12 shows that Z C .fx 2 B.x0 ; Lr/ W M.x/ g/ g p d: B.x0 ;Lr/ u In combination with (4.15) this shows that for all u 2 N 1;p .B.x0 ; Lr// and t 0,
t p .fx 2 B.x0 ; r/ W ju.x/ uB0;0 j t g/ « p =p p p C r .B.x0 ; r// gu d ; B.x0 ;Lr/
where C is independent of u, x0 and r. Finally, an application of Lemma 4.25 with q D p , A D B.x0 ; r/, E D B0;0 , G D B.x0 ; Lr/ and C0 D C r p finishes the proof. Note that E D B.x0 ; 0 / A, as L < 2. Corollary 4.40. Assume that is doubling and that X is L-quasiconvex and satisfies a .q; p/-Poincaré inequality with some dilation constant. Then X satisfies a .q; p/Poincaré inequality with dilation constant L. In particular, if X is geodesic, then X satisfies a strong .q; p/-Poincaré inequality. Proof. By Lemma 3.3, (4.3) holds with some s > p. If q p, then Corollary 4.24 implies that X supports a .q; N p/-Poincaré inequality with some qN > p, while if q > p, this is trivially true with qN D q. Hence, by Proposition 4.20, (4.3) holds with s D qp=. N qN p/ > p. Theorem 4.39 then shows that X supports a .p ; p/N Finally, Poincaré inequality with dilation constant L and p D sp=.s p/ D q. Hölder’s inequality implies that X also supports a .q; p/-Poincaré inequality with dilation constant L.
4.7 Inner metric Assume in this section that X is rectifiably connected. Definition 4.41. The inner metric din is defined by din .x; y/ D inf l ;
4.7 Inner metric
107
where the infimum is taken over all (arc length parameterized) curves (including constant curves) W Œ0; l ! X such that .0/ D x and .l / D y. It is immediate that .X; din / is also a metric space. However, if X were not rectifiably connected, then the inner metric would not be a metric as there would be points x; y 2 X such that din .x; y/ D 1. Note that we always have d.x; y/ din .x; y/. One advantage of the inner metric is that balls are connected. We let Bin .x; r/ D fy 2 X W din .x; y/ < rg and Bin .x; r/ D Bin .x; r/. Lemma 4.42. The inner metric ball Bin D Bin .x; r/ is rectifiably connected. Proof. Let y 2 Bin . Then din .x; y/ < r and so there is a curve W Œ0; l ! X with .0/ D x, .l / D y and l < r. Hence Bin and Bin is rectifiably connected. Note that this result is true without any assumptions on X . The same is true for the following lemma. Lemma 4.43. Arc lengths with respect to d and din are the same. Proof. Take a curve W Œ0; l ! X , parameterized by arc length with respect to the given metric d . Let 0 D t0 < t1 < < tm D l . As jŒtj 1 ;tj , j D 1; ::: ; m, is a curve which is arc length parameterized with respect to d we get that din ..tj 1 /; .tj // tj tj 1 : Hence,
m X j D1
din ..tj 1 /; .tj //
m X
.tj tj 1 / D tm t0 D l :
j D1
As this holds for all subdivisions of Œ0; l it follows that the length of with respect to din is at most l . The converse inequality is trivial, since d din , and thus the length of is the same with respect to d and with respect to din . x and let also Consider now an arbitrary (extended real-valued) function f W X ! R g W X ! Œ0; 1 be arbitrary. As arc length is the same with respect to d and din , g will be an upper gradient of f with respect to .X; d / if and only if it is an upper gradient with respect to .X; din /. As we equip both metric spaces with the same measure 1;p 1;p we see that N 1;p .X / D N 1;p .X; din / and Nloc .X / D Nloc .X; din / (with the same (semi)norms). It also follows that g is a p-weak upper gradient of f if and only if it is a p-weak upper gradient with respect to .X; din /. It is obvious that X is .1 C "/-quasiconvex with respect to din for every " > 0. If X is complete we can say more. Proposition 4.44. Assume that X is complete and rectifiably connected. Then X is 1-quasiconvex, i.e. geodesic, with respect to the inner metric din .
108
4 Poincaré inequalities
Proof. Let x; y 2 X , x ¤ y, and ı D din .x; y/. We can find curves j W Œ0; l0 j ! X , parameterized by arc length, such that j .0/ D x, j .l0 j / D y and l0 j < ı C 1=j . Let Qj W Œ0; ı ! X be given by Qj .t / D j .t l0 j =ı/, which makes the mappings Qj equicontinuous and with images contained in a bounded set. Thus, by the Ascoli theorem (see e.g. p. 169 in Royden [310], note that here we need a version of Ascoli’s theorem valid for metric space valued equicontinuous functions), a subsequence of fQj gj1D1 converges uniformly to a continuous function Q W Œ0; ı ! X with Q .0/ D x and .ı/ Q D y. The uniform convergence and the fact that each Qj is .1 C 1=j ı/-Lipschitz imply that Q is 1-Lipschitz and hence lQ ı D din .x; y/. It follows that Q is parameterized by arc length with respect to din . If X is L-quasiconvex, then it is immediate that d.x; y/ din .x; y/ Ld.x; y/:
(4.16)
Hence the topologies of .X; d / and .X; din / coincide. From (4.16) it directly follows that Bin .x; r/ B.x; r/ Bin .x; Lr/: (4.17) Proposition 4.45. Assume that X is L-quasiconvex. Then the measure is doubling with respect to the given metric d if and only if it is doubling with respect to the inner metric din . The doubling constants depend only on each other and on L (see the proof for explicit estimates). Proof. If is doubling with doubling constant C , then .Bin .x; 2r// .B.x; 2r// C .B.x; r// CN .B.x; r=L// CN .Bin .x; r//; where N 2 Z is so large that 2N 2L. Thus is also doubling with respect to the inner metric. The converse direction is proved similarly. Proposition 4.46. Assume that X is L-quasiconvex and that is doubling. Then the space X satisfies a .q; p/-Poincaré inequality with respect to the given metric d if and only if it satisfies a .q; p/-Poincaré inequality with respect to the inner metric din . The constants in the Poincaré inequalities depend only on each other, the doubling constant and on L (see the proof for explicit estimates). Proof. Assume that X satisfies a .q; p/-Poincaré inequality with respect to the given metric d with constants C 0 and . Let B D B.x; r/ and Bin D Bin .x; r/. Without
4.7 Inner metric
109
loss of generality, we may assume that r diamin X L diam X , where diamin is the diameter with respect to the inner metric. Let u be integrable and g be an upper gradient of u. Then, using Lemma 4.17 and (4.17), we have « 1=q « 1=q q q ju uBin j d 2 ju uB j d Bin
Bin
2CN=q
«
1=q ju uB j d q
B
4CN=q C 0 r
«
4C2N=q C 0 r
1=p p
g d B
«
1=p g p d
;
LBin
where C is the doubling constant and N is so large that 2N L. The converse direction is proved similarly. Remark 4.47. With Propositions 4.44–4.46 in mind one could replace d by din and therefore assume that X is geodesic if X is complete. Note that all curves would still have the same length, and therefore also the same arc length parameterizations. Moreover, g is a (p-weak) upper gradient of u simultaneously with respect to d and din . Indeed, in many results there would be no loss at all with such an approach. However, in other results the estimates for constants and exponents would be worse. In particular, s in (4.3) could become worse which has consequences in many results, such as Poincaré inequalities, Sobolev embeddings and integrability of superharmonic functions. Another disadvantage would be that the natural (given) balls would be replaced by new distorted and maybe not very natural balls. Indeed, rather than choosing the inner metric it could sometimes be more advantageous to choose a metric minimizing the doubling constant or the “dimension” s in (4.3). Note, however, that the inner metric proves to be useful in connection with boundary regularity, see Lemma 14.2. We also have the following equivalence concerning Poincaré inequalities with different dilation constants in quasiconvex spaces. Proposition 4.48. Assume that X is L-quasiconvex and that is doubling. Let D 1 if X is complete, and > 1 otherwise. Then the following are equivalent: (a) X satisfies a .q; p/-Poincaré inequality with respect to the given metric d ; (b) X satisfies a .q; p/-Poincaré inequality with dilation constant L with respect to the given metric d ; (c) X satisfies a .q; p/-Poincaré inequality with respect to the inner metric din ;
110
4 Poincaré inequalities
(d) X satisfies a .q; p/-Poincaré inequality with dilation constant with respect to the inner metric din . Proof. Note first that X is -quasiconvex with respect to din , by Proposition 4.44 if X is complete, and the comment before it, otherwise. (a) , (c) This follows from Proposition 4.46. (a) ) (b) and (c) ) (d) These implications follow from Corollary 4.40. (b) ) (a) and (d) ) (c) These implications are trivial. Eventually we will need the following lemma. Lemma 4.49. Assume that X is quasiconvex and proper, that is connected, and that E b . Then there is a rectifiably connected open set G such that E b G b . Proof. Let d D 12 distin .E; X n / > 0, where dist in is the distance taken with respect to the inner metric din . By compactness we can find x1 ; ::: ; xN 2 E so that Ex S G1 WD jND1 Bin .xj ; d /. By Lemma 4.38 we can find a curve j connecting xj and S 1 j , which is a compact set, and xj C1 in , j D 1; ::: ; N 1. Let K D jND1 1 ı D 2 dist in .K; X n / > 0. By compactness we can find y1 ; ::: ; yM 2 K so that S S K jMD1 Bin .yj ; ı/. Let now G WD G1 [ jMD1 Bin .yj ; ı/ which is rectifiably connected as both G1 [ K and Bin .yj ; ı/, j D 1; ::: ; M , are rectifiably connected, by Lemma 4.42, and Bin .yj ; ı/ \ K ¤ ¿, j D 1; ::: ; M .
4.8 The relation between L and We saw in Theorem 4.39 that if X is an L-quasiconvex doubling p-Poincaré space, then the dilation constant in the p-Poincaré inequality can always be assumed to satisfy L. As we shall see later, e.g. in Section 8.4, plays an important role in certain (weak) Harnack inequalities, and the role can alternatively be taken by L, see the notes to Chapters 8 and 9. It therefore seems natural to discuss the relation between and L. Observe that the (best) dilation constant in Poincaré inequalities is not so easily understood, whereas L has a definite geometric meaning. Example 4.50. Let 0 < ˛ < 12 and let X consist of two rays with opening ˛, X D f.t; 0/ W t 0g [ f.t cos ˛; t sin ˛/ W t 0g R2 ; equipped with the induced distance from R2 and the one-dimensional Lebesgue measure , which is doubling on X . We want to show that X supports a 1-Poincaré inequality. Let B D B..x1 ; x2 /; r/, .x1 ; x2 / 2 X , be arbitrary. We may assume without loss of generality that x2 D 0. We will use that R supports a strong 1-Poincaré inequality, i.e. with dilation constant
4.8 The relation between L and
111
D 1. For the space X , let D 1=sin ˛. Let further f be integrable and g be an upper gradient of f on X . If r x1 sin ˛ or r > x1 , then B is connected and (when equipped with the inner metric din ) it is isomorphic to an interval in R. Hence we get « « « jf fB j d C diamin .B/ g d C diam.B/ g d; B
B
B
by the strong 1-Poincaré inequality on R and the doubling property of . If x1 sin ˛ < r x1 , then B is not connected, showing that we cannot have a strong p-Poincaré inequality on X , see below. However, B is connected, and using that B, equipped with the inner metric din , defined in Section 4.7, is isomorphic to an interval on R we find that « « « jf fB j d 2 jf fB j d C jf fB j d B B B « « C diamin .B/ g d C diam.B/ g d; B
B
by Lemma 4.17, the strong 1-Poincaré inequality on R and the doubling property of . Here diamin denotes the diameter with respect to the inner metric. The constant D 1=sin ˛ is the smallest possible always making B connected, showing that we cannot have a p-Poincaré inequality with any dilation constant 0 < : If 1 0 < , then we can find B such that both B and 0 B are disconnected. Let then f be a Lipschitz function such that f j0 B D R j0 B , yielding «
« jf fB j d > 0 D B
1=p p
0 B
g d
:
Thus we cannot have a p-Poincaré inequality with dilation constant 0 . A straightforward calculation, or a symmetry argument, shows that LD
2 cos.˛=2/ 1 2 D < D 2: sin.˛=2/ sin ˛ sin ˛
This shows that L can be strictly larger than , but also that it is possible to have arbitrarily large , while < L 2. Example 4.51. In this example we consider the von Koch snowflake curve, which is a famous example of a curve (in the traditional sense) of infinite length containing no rectifiable curves, and thus not supporting a Poincaré inequality. For our discussion here, it is not the von Koch snowflake curve itself that is useful, but the sets generating it. Let K0 R2 , the 0th generation, be an equilateral triangle with side length 1. For each of the three sides, split it into three intervals of equal lengths and replace the
112
4 Poincaré inequalities
middle one I by the other two sides I 0 and I 00 of an equilateral triangle (with sides I , I 0 and I 00 ) outside K0 . We have thus produced the 1st generation K1 of the von Koch snowflake curve consisting of 12 pieces of length 13 each. Continuing in this way we obtain the nth generation Kn consisting of 3 4n pieces, each of length 3n . Let also En be the set of the end points of the pieces forming Kn . Now let X D Kn for some fixed integer n, equipped with the induced distance from R2 and the one-dimensional Lebesgue measure , which is doubling on X . As in the previous example we will use that R supports a strong 1-Poincaré inequality. Let f be integrable and g be an upper gradient of f on X . Let further B D B.x; r/ and find j such that 3j 1 < r 3j . Assume first that 1 j 1 n. Then we can find y 2 Kj 1 \ .Ej n Ej 1 / such that d.x; y/ 3j . Let I be the piece containing y in the .j 1/th generation Kj 1 , and let I 0 and I 00 be its two neighbours in the .j 1/th generation. Let further E be the union of all the pieces in Kn stemming from any of these three pieces. (Hence E is the union of 3 4nj C1 pieces.) Then it is relatively easy to see that B D B.x; r/ B.y; 2 3j / E B.y; 5 3j / B.y; 15r/ B.x; 18r/: Let thus D 18. As E is connected, and isomorphic to an interval on R, Lemma 4.17 and the strong 1-Poincaré inequality on R imply that « « « jf fB j d 2 jf fE j d C jf fE j d B B E « « (4.18) C diamin .E/ g d C diam.B/ g d; E
B
where diamin .E/ is the diameter of E taken with respect to the inner metric, see Section 4.7. In the cases when j 1 < 1 and when j 1 > n this is easier to obtain, and thus we have shown that X supports a 1-Poincaré inequality with D 18. Observe that is independent of n. It is also easy to see that L ! 1 as n ! 1, thus showing that can be much much smaller than L. An argument similar to the one showing that D 18 above, shows that there is a common bound, independent of n, for the doubling constant C . As L ! 1, it follows from Theorem 4.32 that the constant C in the 1-Poincaré inequality for Kn must tend to 1, as n ! 1. (In (4.18) above, the blow-up of C occurs in the last inequality, since the comparison between diamin and diam gets worse and worse as n ! 1.) Note that the von Koch snowflake curve is the Hausdorff limit of Kn , see Example 1.23. Moreover, the doubling property and p-Poincaré inequality survive under Gromov–Hausdorff limits, see Appendix A.7. Thus, if there were a common bound for C , as n ! 1, then this would imply that the von Koch snowflake curve satisfied a 1-Poincaré inequality, which it does not by Remark 4.12, as there are no nonconstant rectifiable curves K, see Example 1.23.
4.9 Measurability
113
4.9 Measurability Even though we neither need nor prove the following result we still want to mention it and some of its consequences. Theorem 4.52 (Järvenpää–Järvenpää–Rogovin–Rogovin–Shanmugalingam [190]). x has a Let X be a complete doubling p-Poincaré space. Assume that u W X ! R p p-weak upper gradient g 2 L .X /. Then u is measurable. In [190], it is assumed that u has an upper gradient in Lp .X /. Nevertheless, Lemma 1.46 allows us to formulate Theorem 4.52 in its present form. A direct consequence is that, under these assumptions on X , the measurability assumption in the definition of D p .X / is redundant. Another consequence is the following improvement upon Propositions 1.48 and 4.9. Proposition 4.53. Let X be a complete doubling p-Poincaré space and E X be arbitrary. Then Cp .E/ D 0 if and only if Modp . E / D 0. Proof. Assume that Modp . E / D 0. Let v D E . As Modp . E / D 0, we see that g 0 is a p-weak upper gradient of v. Thus, by Theorem 4.52, v is measurable, and hence so is E. Thus Cp .E/ D 0, by Proposition 4.9. The converse implication follows from Proposition 1.48.
4.10 Notes The doubling condition and a p-Poincaré inequality are essential in Moser’s iteration method and other techniques for regularity of solutions to partial differential equations. This observation goes back to Fabes–Jerison–Kenig [116] and Fabes–Kenig– Serapioni [117], where six conditions sufficient for the regularity theory were singled out for weights in Rn . Even before [116], boundary regularity for equations with power weights was treated by Widman [350]. In Heinonen–Kilpeläinen–Martio [171], weights suitable for Moser’s iteration were called p-admissible and the number of sufficient conditions was reduced to four, viz. the doubling condition, a .p; p/-Poincaré inequality, a .q; p/-Sobolev inequality with some q > p, and a uniqueness condition for the gradient. The uniqueness condition was shown redundant by Semmes, see Theorem 5.2 in Heinonen–Koskela [172]. In unweighted Rn , the doubling condition is trivial and the Sobolev and Poincaré inequalities are well known. See e.g. Gilbarg–Trudinger [145], Malý–Ziemer [258] or Ziemer [361] for proofs. For Ap -weights on Rn , Sobolev and Poincaré inequalities were proved in Fabes–Kenig–Serapioni [117] and in Heinonen–Kilpeläinen–Martio [171], where also Jacobians of quasiconformal mappings were shown to be p-admissible weights. A simple proof for Ap -weights, including p D 1, was given in J. Björn [62] and generalized to Orlicz–Poincaré inequalities in J. Björn [68].
114
4 Poincaré inequalities
The self-improving property of the p-Poincaré inequality in metric spaces, implying both a .p; p/-Poincaré inequality and a .q; p/-Sobolev inequality, was proved in Hajłasz–Koskela [153] and strengthened in Hajłasz–Koskela [154], Theorem 5.1. Thus, the number of sufficient conditions for the regularity theory was further reduced to only two: the doubling condition and a p-Poincaré inequality. Earlier, Saloff-Coste [313] showed that a .2; 2/-Poincaré inequality on manifolds implies a .q; 2/-Sobolev inequality for some q > 2. Sharp Orlicz space analogues of these self-improving results have been obtained by Cianchi [96], [97] in Euclidean spaces and by Heikkinen [164], [165] on metric spaces equipped with doubling measures. See also Franchi–Pérez–Wheeden [127] and MacManus–Pérez [255], [256], where generalized Poincaré type inequalities were considered. Our proof of Theorem 4.21 is an adaptation from J. Björn [62] and follows [153] and [154]. Maz0 ya’s truncation method for obtaining strong type estimates from weak type inequalities as in Lemma 4.25 goes back to Maz0 ya [278]. Proposition 4.27 is essentially from Hajłasz–Koskela [154]. An exponential Trudinger inequality with the exponent s=.s 1/ for functions satisfying a p-Poincaré inequality with p D s has been proved in connected metric spaces equipped with doubling measures in [154], Theorem 6.1. Note that under our assumptions, X is connected. For the classical Trudinger inequality on Euclidean spaces see Trudinger [338]. It has been generalized to weighted spaces in Buckley– O’Shea [80] and to generalized Poincaré inequalities in MacManus–Pérez [256] and Heikkinen [164], [165] (also in disconnected spaces). Proposition 4.2 and Corollary 4.4 were observed by Shanmugalingam [318]. The proof of Lemma 4.5 is from A. Björn [43], where it is given under a milder assumption on X . The nontrivial implication was earlier deduced, in Björn–Björn–Shanmugalingam [56] under stronger assumptions, however only the p-Poincaré inequality was really used. Lemma 4.6 belongs to folklore. Estimates for the diameter and Hausdorff content of spheres in Poincaré spaces have recently been obtained by Korte [222]. The necessity of (4.3) for the .q; p/-Poincaré inequality (Proposition 4.20) appeared already in Franchi–Gutiérrez–Wheeden [125] in the setting of -gradients on Euclidean spaces. The proof of quasiconvexity is from Cheeger [91] based on an argument due to Semmes, cf. [315]. The relation between the quasiconvexity constant and the dilation constant in Theorem 4.39, as well as the observation that there is a lower bound on the constant CPI in the p-Poincaré inequality, seems to appear here for the first time, though they were probably known to the experts before. The Examples 4.50 and 4.51 are from Björn– Björn–Marola [53]. The first proof in which a strong Poincaré type inequality with dilation constant 1 is derived from a weak one was given by Jerison [191] for vector fields satisfying Hörmander’s condition. In Hajłasz–Koskela [153] a surprisingly elementary proof of this fact was given in the setting of general metric spaces satisfying a chain condition. On (weighted) Rn , this condition is trivially satisfied. Our proof of Theorem 4.39
4.10 Notes
115
combines J. Björn–Shanmugalingam [72] with J. Björn [62] and has been inspired by Hajłasz–Koskela [154] and Heinonen–Koskela [174]. Heinonen–Koskela [175] had a somewhat weaker version of Theorem 4.15. Another characterization of p-Poincaré inequalities by means of the approximate Lipschitz constant can be found in Keith–Rajala [198]. Counterexamples showing that completeness is needed in Theorems 4.15 and 4.30, and cannot even be replaced by local compactness, can be found in Koskela [228], where removable sets for W 1;p were characterized using Poincaré inequalities. In fact, the counterexamples in [228] are Ahlfors n-regular subsets of Rn . Removable singularities for Poincaré inequalities were studied by Koskela–Shanmugalingam–Tuominen [231] on metric spaces.
Chapter 5
Properties of Newtonian functions
We are now ready to have a look at some consequences of the doubling property and the Poincaré inequality. In this chapter we discuss density of Lipschitz functions, quasicontinuity, Sobolev inequalities, Sobolev embeddings, and existence of Lebesgue points q.e. Consequences for the capacity are postponed to Chapter 6.
5.1 Density of Lipschitz functions In Euclidean spaces, it is well known and often used that C 1 -smooth functions are dense in Sobolev spaces. On metric spaces, the notion of C 1 -smooth (or even C 1 smooth) functions is not available, but it is possible to consider Lipschitz and locally Lipschitz functions instead. Fortunately, this is enough in many applications. We start by the following global theorem, it will be extended to open subsets of X in Theorem 5.47. Theorem 5.1. If X is a doubling p-Poincaré space, then Lipschitz functions are dense in N 1;p .X /. To prove this result we will use McShane extensions and the following lemma. Lemma 5.2. Let E X and let f W E ! R be L-Lipschitz. Then the upper and lower McShane extensions of f defined by fN.x/ WD inf .f .y/ C Ld.x; y// and f .x/ WD sup .f .y/ Ld.x; y//; y2E
y2E
respectively, are L-Lipschitz and satisfy f fN in X , and f D f D fN on E. In fact, fN and f are the largest and the smallest, respectively, L-Lipschitz extensions of f to X . This lemma is not very difficult to prove; we refer the reader to the proof of Theorem 3.1.2 in Ambrosio–Tilli [17] or Theorem 6.2 in Heinonen [169]. Proof of Theorem 5.1. Let u 2 N 1;p .X /. Assume first that u is bounded and let g 2 Lp .X / be an upper gradient of u. For > 0, we let E D fx 2 X W M g p .x/ > p g; where M g p is the noncentred maximal function of g p . Let 0 < 12 r r and x 2 X n E be arbitrary. The doubling property of and the p-Poincaré inequality
117
5.1 Density of Lipschitz functions
then imply that «
«
juB.x; / uB.x;r/ j
ju uB.x;r/ j d C B.x; /
«
1=p
Cr
p
g d
ju uB.x;r/ j d B.x;r/
C r.M g p .x//1=p C r:
B.x;r/
Hence, for arbitrary 0 < < r and a suitable integer k, we have juB.x;r/ uB.x; / j juB.x;r/ uB.x;r=2/ j C juB.x;r=2/ uB.x;r=4/ j C C juB.x;r=2k / uB.x; / j C .r C r=2 C r=4 C / C 0 r:
(5.1)
It follows that every sequence fuB.x;rj / gj1D1 with rj ! 0, as j ! 1, is a Cauchy sequence and the limit u.x/ N D lim uB.x;r/ r!0
exists. We shall show that the function uN is C 0 -Lipschitz on X nE . Let x; y 2 X nE
be arbitrary and rj D 21j d.x; y/, j D 0; 1; ::: . Let also B0 D B.x; r0 / and Bj D B.x; rj /, Bj D B.y; rj /, j D 1; 2; ::: . From (5.1) we get ju.x/ N uB0 j C 0 d.x; y/ 0 and similarly ju.y/u N B0 j C d.x; y/. (The fact that B0 is not centred at y does not matter here, since we are using the noncentred maximal function M g p .) It follows that uN is C 0 -Lipschitz on X n E and can be extended to a C 0 -Lipschitz function uN
on the whole of X , e.g. by the upper McShane extension
uN .x/ D
inf .u.y/ N C C 0 d.x; y//:
y2XnE
Let u WD maxfminfuN ; g; g be the function obtained by truncating uN at the levels ˙ . As u is bounded, we have for large that juj in X and hence u D uN D u at all Lebesgue points for u in X n E . It follows that for large , ku u kLp .X/ kukLp .E / C ku kLp .E / 2 .E /1=p ! 0;
as ! 1;
by Lemma 3.12. (Note that E here corresponds to E p in Lemma 3.12). Also, u u D 0 on X n .E [ E/, where E is the set of non-Lebesgue points for u. Corollary 1.39 and Lemma 2.19 then show that .g C C 0 /E [E is a p-weak upper gradient of u u . Since .E/ D 0, Lemma 3.12 yields kguu kLp .X/ kgkLp .E / C C 0 .E /1=p ! 0;
as ! 1;
118
5 Properties of Newtonian functions
and the theorem is proved for bounded functions. If u is unbounded, approximate u by its truncations uk WD maxfminfu; kg; kg at the levels ˙k. Clearly, uk ! u in Lp .X / and .fx W ju.x/j > kg/ ! 0, as k ! 1. Lemma 2.19 shows that gfjuj>kg is a p-weak upper gradient of u uk and hence kguuk kLp .X/ ! 0, as k ! 1. Remark 5.3. The proof shows that if u is nonnegative, then we can approximate it by nonnegative Lipschitz functions, as in this case u automatically becomes nonnegative. The same is true in Lemma 5.4, Corollary 5.15 and Theorem 5.47 below. The following consequence of Theorem 5.1 will be useful in the proofs of Theorems 6.7 (xi) and 6.19 (x). Lemma 5.4. Assume that X is a doubling p-Poincaré space. Let G X be open and F be a closed subset of G such that at least one of F and X n G is bounded. If G ¤ X , assume also that dist.F; X n G/ > 0. Let u 2 N 1;p .X / be bounded in X and L-Lipschitz in G. Then there exist bounded Lipschitz functions u such that u ! u in N 1;p .X /, as ! 1, and u D u on F . Observe that the condition dist.F; X n G/ > 0 is redundant if X is complete, as it is automatically fulfilled. Proof. As u isªL-Lipschitz in G, Proposition 1.14 implies that gu L < 1 a.e. in G, and hence B gup d Lp for all balls B G. Note that if a ball intersects both F and X n G, then its radius must be at least 12 dist.F; X n G/ > 0. Moreover, by Lemma 3.6 and the boundedness of F or X n G, we have .B/ C > 0 for all such balls B. It follows that for x 2 F , the noncentred maximal function ² ³ « Z p p p 1 p M gu .x/ D sup gu d max L ; g d ; C X u B3x B i.e. F fx 2 X W M gup .x/ p g D X n E for sufficiently large . The proof of Theorem 5.1 now provides us with bounded Lipschitz functions u such that u ! u in N 1;p .X /, as ! 1, and for large , u D u at all Lebesgue points of u in X n E , in particular everywhere on F . The following two examples show that the validity of a p-Poincaré inequality is not necessary for the density of Lipschitz functions in N 1;p .X /. Example 5.5. If the space X contains no nonconstant rectifiable curves (e.g. if X is the von Koch snowflake curve), then N 1;p .X / D Lp .X /, see Example 1.22. It is well known that Lipschitz functions are dense in Lp .X /. (The basic ideas for a proof are given in Proposition 7.9 of Folland [124].) In this case the p-Poincaré inequality is obviously not supported, since g D 0 will be an upper gradient of any measurable function.
5.1 Density of Lipschitz functions
119
The next example is perhaps more illuminating than the previous one, since it contains an abundance of nonconstant rectifiable curves. The problem there for the p-Poincaré inequality is that there are not enough curves between the two halves of the space, i.e. that the space is too narrow at one place. In general, narrow passages are bad for Poincaré inequalities, they either destroy them altogether or force the constant CPI to become large. This can be exploited when constructing counterexamples: creating cusps or “tunnels” which are more and more narrow will prevent Poincaré inequalities. Examples of this kind were used in Maz0 ya [283] to disprove Sobolev embeddings on bad domains. Example 5.7 below shows that it is not just the geometric narrowness and its relation to p that is relevant for the p-Poincaré inequality, but the narrowness has to be considered relative to the measure as well. It should also be mentioned that it is not very well understood exactly when a space supports a p-Poincaré inequality. Another way of preventing the p-Poincaré inequality is by violating quasiconvexity, cf. Theorem 4.32. Example 5.6 (Bow-tie). Let n 2 and write x 2 Rn as x D .x1 ; ::: ; xn /. Let XC D fx 2 Rn W xj 0; j D 1; ::: ; ng; X D fx 2 Rn W xj 0; j D 1; ::: ; ng; equipped with the Euclidean metric and the Lebesgue measure, which is doubling (and even Ahlfors n-regular) both on XC and X . Let 1 p n and X D XC [ X . We shall show that X does not support the p-Poincaré inequality but that Lipschitz functions are dense in N 1;p .X /. The functions ² ³ log jxj uj D min 1; j C are Lipschitz in X and uj .0/ D 1. Since uj .x/ ! 0, as j ! 1, if x ¤ 0, dominated convergence shows that kuj kLp .X/ ! 0, as j ! 1. Moreover, if p < n, then Z
Z X
gupj D
1
e j
1 jr
p
r n1 dr
1 jp
Z
1
r n1p dr ! 0;
as j ! 1:
log e j D j 1n ! 0; jn
as j ! 1:
0
Similarly, if p D n, then Z
Z X
gupj
D
1 e j
1 jr
n
r n1 dr D
Hence kuj kN 1;p .X/ ! 0, as j ! 1. Thus Cp .f0g/ D 0 and since f0g separates X , the p-Poincaré inequality is violated, by Lemma 4.6. (This can also be seen directly, viz. XC has 0 as a p-weak upper gradient, since Modp . f0g / D 0 by Proposition 1.48, which violates the p-Poincaré inequality.)
120
5 Properties of Newtonian functions
Note, however, that both XC and X support 1-Poincaré inequalities. Indeed, if u 2 N 1;p .XC /, then u and all of its upper gradients g can be extended to the whole of Rn by reflection as follows, u.x N 1 ; ::: ; xn / D u.jx1 j; ::: ; jxn j/
and
g.x N 1 ; ::: ; xn / D g.jx1 j; ::: ; jxn j/;
so that gN is an upper gradient of uN 2 N 1;p .Rn / and kuk N pN 1;p .Rn / 2n kukpN 1;p .X / . C The 1-Poincaré inequality for XC then follows from the 1-Poincaré inequality for Rn . Indeed, for every ball B D B.x0 ; r/ Rn with x0 2 XC we have « « « « ju uN B j dx C juN uN B j dx C r gN dx C r g dx B\XC
B
B
B\XC
and Lemma 4.17 makes it possible to replace uN B by uB\XC . To prove the density of Lipschitz functions in N 1;p .X /, let u 2 N 1;p .X / and note that both uXC and uX belong to N 1;p .X /, due to the fact that Cp .f0g/ D 0. Thus, it suffices to approximate uXC by Lipschitz functions in N 1;p .X /. Let " > 0. Since XC supports a p-Poincaré inequality, there exists a Lipschitz function v on XC such that ku vkN 1;p .XC / < ". Extend v by zero to X n XC . We shall show that v can be approximated by Lipschitz functions in N 1;p .X /. Let w D XC , where 2 Lipc .X / is such that D 1 on B.0; 1/. Then v v.0/w is Lipschitz on X and as v D .v v.0/w/ C v.0/w, it suffices to approximate w by Lipschitz functions in N 1;p .X /. It is easily verified that the functions vj .x/ D maxfw; uj g will do. Observe that in Example A.23 we show that for p > n, X is a p-Poincaré space. In particular, it follows from the arguments above that in this case Cp .f0g/ > 0 and XC … N 1;p .X /. Example 5.7 (Weighted bow-tie). Let X be as in Example 5.6, but equip it this time with the measure d D jxj˛ dx, ˛ > n. If p > ˛ C n or p D 1 ˛ C n, then X is a doubling p-Poincaré space, by Example A.24. On the other hand if 1 < p ˛ C n or p D 1 < ˛ C n, then a similar calculation as in Example 5.6 shows that Cp .f0g/ D 0, and the p-Poincaré inequality is thus violated. Nevertheless, the same argument as in Example 5.6 shows that Lipschitz functions are dense in N 1;p .X /. In view of the preceding examples it is worth pointing out that Lipschitz functions are not always dense in N 1;p .X /. Let us first present three concrete examples and then a more abstract one which contains the first three as special cases. We give a full proof in the last example, which also proves our claims in the first three examples. Example 5.8. Let X D fz 2 C D R2 W jzj D 1g n f1g (with the one-dimensional Lebesgue measure). Then f .z/ D arg z (the principal branch) belongs to N 1;p .X / n Lip.X / (for all p 1).
5.1 Density of Lipschitz functions
121
Example 5.9. Let X be the slit disc B.0; 1/ n .1; 0 C D R2 . Then f .z/ D .2jzj 1/C arg z belongs to N 1;p .X / n Lip.X /. Example 5.10. Let p > n 2, and X D .XC [ X [ fx 2 Rn W jxj 1g/ n f0g; where XC and X are given by Example 5.6. Let further u D minf1; 2 2jxjgC XC . Then u 2 N 1;p .X / n Lip.X /. Example 5.11. Assume that X supports a p-Poincaré inequality. Let F X be a closed set with zero measure which locally separates X at some point x0 2 F , i.e. there is r > 0 and two nonempty disjoint open sets U and V such that B.x0 ; r/ n F D U [ V and x0 2 @U \ @V . Let u.x/ D minf1; 2 2d.x; x0 /=rgC U as a function on G D X n F . Observe that u D U on B.x0 ; r=2/ \ G and that u D 0 outside B.x0 ; r/. Clearly, u 2 Lp .G/ and gu .2=r/U nB.x0 ;r=2/ 2 Lp .G/. Hence u 2 N 1;p .G/. We shall show that u … Lip.G/ (with respect to the N 1;p .G/ norm). Assume on the contrary that there are uj 2 Lip.G/ such that kuj ukN 1;p .G/ ! 0, as j ! 1. Since uj is Lipschitz on G (and .F / D 0) it has a unique continuous extension to X (which we also call uj ). It coincides with the McShane extensions given by Lemma 5.2. By Lemma 2.23, guj ;G D guj ;X jG , and as .F / D 0, we have kuj kN 1;p .G/ D kuj kN 1;p .X/ . Since fuj gj1D1 is a Cauchy sequence in N 1;p .G/, and as kuj uk kN 1;p .G/ D kuj uk kN 1;p .X/ ;
j; k D 1; 2; ::: ;
it follows that fuj gj1D1 is a Cauchy sequence in N 1;p .X / as well. Hence, by the completeness of N 1;p .X /, given by Theorem 1.71, there is a function v 2 N 1;p .X / such that uj ! v in N 1;p .X /. Since obviously uj ! v also in N 1;p .G/, it follows that u D v q.e. in G. In particular, gv D gu D 0 a.e. in B.x0 ; r=2/ \ G (using again Lemma 2.23), and as .F / D 0 we have gv D 0 a.e. in B.x0 ; r=2/. Hence, by the p-Poincaré inequality on X , we have Z
Z 0< B.x0 ;r=2/
jv vB.x0 ;r=2/ j d C r
B.x0 ;r=2/
1=p gvp d
D 0;
where is the dilation constant in the p-Poincaré inequality, a contradiction. We have thus shown that u cannot be approximated in N 1;p .G/ by Lipschitz functions on G. Observe, however, that u is locally Lipschitz in G. In the last four examples, locally Lipschitz functions are dense in N 1;p .X / (N 1;p .G/ in the last example) and moreover X (G in the last example) is noncomplete. This suggests the following problems.
122
5 Properties of Newtonian functions
Open problem 5.12. Is it always true that locally Lipschitz functions are dense in N 1;p .X /? Open problem 5.13. Is it always true that Lipschitz functions are dense in N 1;p .X / if X is proper? In fact, the following result shows that an affirmative answer to Open problem 5.12 would imply an affirmative answer to Open problem 5.13. See also the discussion on Open problems 5.34–5.36. Proposition 5.14. Let X be proper and assume that locally Lipschitz functions are dense in N 1;p .X /. Then Lipc .X / D N 1;p .X /. Proof. If X is bounded, then it is compact and every locally Lipschitz function on X is Lipschitz and the claim follows. If S X is unbounded, then we may write X as an increasing union of compact sets, 1;p .X / and " > 0 be arbitrary, and find a locally Lipschitz XD 1 kD1 Xk . Let u 2 N function v with an upper gradient g 2 Lp .X /, such that ku vkN 1;p .X/ < ". Then v 2 Lp .X / and Z .jvj C g/p d ! 0;
as k ! 1:
XnXk
Let k .x/ D .1dist.x; Xk //C . Then v k 2 Lipc .X / and .jvjCg/XnXk is a p-weak upper gradient of v v k . Hence Z kv v k kN 1;p .X/ 21=p
1=p .jvj C g/p d
! 0;
as k ! 1:
XnXk
It follows that for sufficiently large k, ku v k kN 1;p .X/ < 2" and as " was arbitrary, the result follows. Corollary 5.15. If X is a complete doubling p-Poincaré space, then Lipc .X / is dense in N 1;p .X /. Proof. This follows directly from Theorem 5.1 and Proposition 5.14. The following example shows that Proposition 5.14 is not true without the properness assumption. Example 5.16. Let X D .0; 1 R. In this case X is a noncomplete doubling 1-Poincaré space, and Lip.X / D N 1;p .X /, by Theorem 5.1. Let u 1 2 N 1;p .X /. We shall show that u … Lipc .X /. Let v 2 Lipc .X /. If supX v 12 , then ku vkN 1;p .X/ ku vkLp .X/ 12 :
5.2 Quasicontinuity of Newtonian functions
123
Otherwise there is x 2 X such that v.x/ 12 . As supp v b X , there is 0 < y < x such that v.y/ D 0. Hence 1 jv.y/ v.x/j 2
Z
Z
x
gv ds y
y
1=p
x
gvp
ds
ku vkN 1;p .X/ :
We thus see that u … Lipc .X /.
5.2 Quasicontinuity of Newtonian functions We have seen in Proposition 1.61 that, unlike the usual Sobolev functions which are defined a.e., the equivalence classes in Newtonian spaces are up to sets of capacity zero. In this section we study continuity properties of Newtonian functions in doubling p-Poincaré spaces. In particular, we prove a Luzin type theorem in the capacitary sense, i.e. we show that Newtonian functions are continuous on complements of sets with arbitrarily small capacity. In Section 11.6, we obtain further continuity results for Newtonian functions. x is weakly quasicontinuous if for every " > 0 Definition 5.17. A function u W X ! R there is a set E with Cp .E/ < " such that ujXnE is continuous. x is quasicontinuous if for every " > 0 there is an open set G A function u W X ! R with Cp .G/ < " such that ujXnG is continuous. Recall that a continuous function is assumed to be real-valued. We also point out that it is the restriction ujXnE which is continuous, not that u is continuous at points in X n E. Quasicontinuity is a local property, as the following lemma shows. Lemma 5.18. If u is (weakly) quasicontinuous in j for every j D 1; 2; ::: , then u is S1 (weakly) quasicontinuous in D j D1 j . Proof. Let " > 0. For each j D 1; 2; ::: , there is an open S (arbitrary) set Gj with Cp .Gj / < 2j " such that ujj nGj is continuous. Let G D j1D1 Gj . Then G is open (arbitrary) and Cp .G/ < ", by Theorem 1.27. Moreover, ujnG is continuous. Theorems 5.20 and 5.21 below form the first step in showing that Newtonian functions correspond to the “good” representatives of Sobolev functions. In doubling p-Poincaré spaces, this is a consequence of Theorem 5.1 and Corollary 1.72, but we formulate the results in more generality, assuming that continuous functions are dense in N 1;p .X /. Note that the doubling condition and the p-Poincaré inequality are not necessary for the density of continuous functions in N 1;p .X /, see Examples 5.5–5.11.
124
5 Properties of Newtonian functions
In the second half of the book (Chapters 7–14) we shall mainly consider Newtonian functions on open subsets of X . However, as may not support a p-Poincaré inequality, Theorem 5.1 cannot be applied directly to N 1;p ./. Fortunately, as quasicontinuity is a local property, by Lemma 5.18, this problem can easily be overcome. Since we now work under the assumption that continuous functions are dense in 1;p N .X / (rather than X being a doubling p-Poincaré space), it is possible to have X ¤ supp . This obstacle is however easily overcome using the following lemma. The reader may recall that this possibility was taken into account in Chapters 1 and 2. On the other hand, in Chapters 3 and 4 we either assumed that was doubling or that X supported some Poincaré inequality (or both), and in both cases a requirement is that X D supp . Lemma 5.19. Let X 0 D supp and 0 D \ X 0 , which is open as a subset of X 0 . x be arbitrary, E 0 WD E \ X 0 and u0 WD uj0 . Then Let further E X and u W ! R the following are true: (a) u 2 N 1;p ./ if and only if u0 2 N 1;p .0 /, and moreover kukN 1;p ./ D ku0 kN 1;p .0 / I
(5.2)
1;p p 1;p (b) u 2 Nloc ./, u 2 D p ./ and u 2 Dloc ./ if and only if u0 2 Nloc .0 /, p 0 p 0 0 0 u 2 D . / and u 2 Dloc . /, respectively;
(c) .E 0 / D .E/ and Cp0 .E 0 / D Cp .E 0 / D Cp .E/, where Cp0 denotes the capacity with respect to X 0 ; (d) u is (weakly) quasicontinuous in if and only if u0 is (weakly) quasicontinuous in 0 ; (e) continuous (Lipschitz) functions are dense in N 1;p .X / if and only if continuous (Lipschitz) functions are dense in N 1;p .X 0 /. Proof. Note that one implication in each equivalence is trivial. Let Z D X n X 0 . Then Z is open and .Z/ D Cp .Z/ D 0, by Proposition 1.53. (a) Let g 0 be an upper gradient of u0 (in 0 / and let ´ g 0 in 0 ; gD 1 in n 0 D \ Z: Consider a curve W Œ0; l ! . Either 0 , in which case g clearly is an upper gradient of u along , or hits Z. In the latter case must hit Z for a positive length, as Z is open, and thus Z g ds D 1 ju..0// u..l //j:
Hence g is an upper gradient of u.
5.2 Quasicontinuity of Newtonian functions
125
Since .Z/ D 0 we see that kukLp ./ D ku0 kLp .0 / and kgkLp ./ D kg 0 kLp .0 / from which (5.2) follows. (b) This follows directly from (a) and its proof. (c) The equality of the measures follows directly from the fact that .Z/ D 0. As for the capacity, let " > 0 and v 0 W X 0 ! R be such that v 0 1 on E 0 and kv 0 kpN 1;p .X 0 / Cp0 .E 0 / C ": ´
Define vD
v0 1
in X 0 ; in Z:
Then, by (a), Cp .E/ kvkpN 1;p .X/ D kv 0 kpN 1;p .X 0 / Cp0 .E 0 / C ": Letting " ! 0 shows that Cp .E/ Cp0 .E 0 /. Since trivially, Cp0 .E 0 / Cp .E 0 / Cp .E/, we are done. (d) Assume that u0 is (weakly) quasicontinuous in 0 and let " > 0. Then there is a relatively open (arbitrary) set G 0 0 such that Cp0 .G 0 / < " and u0 j0 nG 0 is continuous. Let G D G 0 [ .Z \ / which is an open (arbitrary) subset of , since Z \ is open. Moreover, ujnG D u0 j0 nG 0 and is thus continuous. By (c), Cp .G/ D Cp0 .G 0 / < ". Hence u is (weakly) quasicontinuous in . (e) Assume that continuous (Lipschitz) functions are dense in N 1;p .X 0 /. Let u 2 N 1;p .X /, u0 WD ujX 0 and " > 0. Then there is a continuous (Lipschitz) function v 0 W X 0 ! R such that kv 0 u0 kN 1;p .X 0 / < ". By Tietze’s extension theorem (see e.g. Theorem 4.16 in Folland [124]) or McShane’s extension lemma (Lemma 5.2), there is a continuous (Lipschitz) extension v of v 0 to X . By (a), kv ukN 1;p .X/ D kv 0 u0 kN 1;p .X 0 / < ": Hence continuous (Lipschitz) functions are dense in N 1;p .X /. Theorem 5.20. Assume that continuous functions are dense in N 1;p .X /. (In particu1;p ./, then u is weakly lar, this holds if X is a doubling p-Poincaré space.) If u 2 Nloc quasicontinuous. Note that Theorem 5.20 can also be obtained from Theorem 5.21, whose proof is, however, much more complicated. See Theorem 5.29 for a further improvement in complete doubling p-Poincaré spaces, which will be the standing assumption in the second half of the book (Chapters 7–14). Proof. In view of Lemma 5.19 we may assume that X D supp . For every x 2 , there exists rx > 0 such that u 2 N 1;p .B.x; 2rx //. As is Lindelöf, S by Proposition 1.6, there exist countably many xj 2 , j D 1; 2; ::: , such that D j1D1 Bj , where Bj D B.xj ; rxj /.
126
5 Properties of Newtonian functions
Choose j 2 Lip.X / such that j D 1 on Bj and supp j 2Bj , j D 1; 2; ::: . Then u j 2 N 1;p .X / and there exists a sequence of continuous functions converging to u j in N 1;p .X /. Corollary 1.72 provides us with a subsequence converging to u j uniformly outside sets of arbitrarily small capacity. Thus, u j is continuous on the complements of these sets, showing that u D u j is weakly quasicontinuous in each Bj . Lemma 5.18 completes the proof. Theorem 5.21. Assume that continuous functions are dense in N 1;p .X /. (In particu1;p lar, this holds if X is a doubling p-Poincaré space.) Then every u 2 Nloc ./ has a representative v D u q.e. which is quasicontinuous in . Proof. In view of Lemma 5.19 we may assume that X D supp . 1;p ./. By definition, for every x 2 there exists rx > 0 such that Let u 2 Nloc 1;p u 2 N .B.x; 2rx //. As is Lindelöf, S by Proposition 1.6, there exist countably many xj 2 , j D 1; 2; ::: , such that D j1D1 Bj , where Bj D B.xj ; rxj /. Choose j 2 Lipc .2Bj / such that j D 1 on Bj , j D 1; 2; ::: . Then u j 2 N 1;p .X / and there exists a sequence of continuous functions converging to u j in N 1;p .X /. Corollary 1.72 provides us, for each fixed j , with a subsequence f'j;i g1 iD1 and open sets Gj;k with Cp .Gj;k / < 2j k , such that 'j;i converge uniformly in S X n Gj;k , k D 1; 2; ::: , and pointwise q.e. in X . Let Gk D j1D1 Gj;k , so that Cp .Gk / < 2k , k D 1; 2; ::: . Let vj D lim supi!1 'j;i . Then vj jXnGk is continuous for allSk D 1; 2; ::: and vj D u j in X n Ej , where Cp .Ej / D 0. Let further E D j1D1 Ej , so that Cp .E/ D 0. Let now i; j; k D 1; 2; ::: be fixed but arbitrary, and Vk D X n .X n .Gk [ E//, which is an open set. Note that Vk n Gk E and hence Cp .Gk [ Vk / Cp .Gk / C Cp .Vk n Gk / D Cp .Gk / < 2k : As .E/ Cp .E/ D 0, we see that int E D ¿. Hence, for every x 2 Bi \ Bj n .Gk [ Vk / D Bi \ Bj \ .X n .Gk [ E// n Gk ; there exist yl 2 Bi \ Bj n .Gk [ E/ such that yl ! x, as l ! 1. In Bi \Bj n.Gk [E/ we have vi D u i D u D u j D vj . Since both vi jBi \Bj nGk and vj jBi \Bj nGk are continuous, it follows that vi .x/ D lim vi .yl / D lim vj .yl / D vj .x/; l!1
l!1
in Bi \ Bj n .Gk [ Vk /, for all i; j; k D 1; 2; ::: . i.e. vi D vj everywhere T1 Let F D kD1 .Gk [ Vk / and ´ vj .x/; x 2 Bj n F; v.x/ D 0; x 2 F:
5.2 Quasicontinuity of Newtonian functions
127
As Gk [ Vk is open, v is quasicontinuous in Bj for each j D 1; 2 ::: , and thus in , by Lemma 5.18. Moreover, as Cp .F / D 0 and v D vj D u in Bj n F , j D 1; 2; ::: , we have v D u q.e. in X . Let us next prove a useful rigidity result for the capacity and for quasicontinuous functions. Proposition 5.22. If G X is open and .E/ D 0, then Cp .G/ D Cp .G n E/: Proof. That Cp .G/ Cp .G n E/ is clear. Let " > 0 and u be such that GnE u 1 and kukpN 1;p .X/ < Cp .G n E/ C ". Let further g be an upper gradient of u such that p p kukL p .X/ C kgkLp .X/ < Cp .G n E/ C ". Let ´ vD
u 1
in X n G; in G:
Then u D v outside G \ E, so, in particular, kukLp .X/ D kvkLp .X/ . We shall show that g is a p-weak upper gradient of v from which it follows that Cp .G/ kvkpN 1;p .X/ < Cp .G n E/ C "; and the result follows after letting " ! 0. To show that g is a p-weak upper gradient we consider a curve W Œ0; l ! X , C . If .0/; .l / … G \ E, then … G\E Z jv..0// v..l //j D ju..0// u..l //j g ds:
On the other hand if .0/; .l / 2 G \ E, then Z jv..0// v..l //j D 0
g ds:
Consider next the case when .0/ 2 G \ E and .l / … G \ E. Since G is open there C is t > 0 so that .Œ0; t / G. As … G\E , there is 2 Œ0; t such that . / 2 G nE. Thus v..0// D 1 D u.. // and hence Z Z jv..0// v..l //j D ju.. // u..l //j g ds g ds: jŒ;l
Finally, the case when .l / 2 G \ E and .0/ … G \ E is handled by considering the reversed curve. C By Lemma 1.42, Modp . G\E / D 0. Thus g is a p-weak upper gradient of v.
128
5 Properties of Newtonian functions
Proposition 5.23. If u and v are quasicontinuous and u D v a.e., then u D v q.e. Proof. Let " > 0. As u and v are quasicontinuous, we can find an open set G with Cp .G/ < " such that ujXnG and vjXnG are continuous. Thus fx … G W u.x/ ¤ v.x/g is open in the relative topology on X n G, i.e. there is an open set U X such that U n G D fx … G W u.x/ ¤ v.x/g: Since U [ G is open and .U n G/ D 0, Proposition 5.22 with G and E replaced by U [ G and U n G shows that Cp .fx W u.x/ ¤ v.x/g/ Cp .U [ G/ D Cp .G/ < ": Letting " ! 0 completes the proof. Next, we construct functions with prescribed upper gradients and show that under certain assumptions they are lower semicontinuous. This will be a crucial ingredient when showing that in complete doubling p-Poincaré spaces, all Newtonian functions are quasicontinuous. Definition 5.24. We say that a curve W Œ0; l ! X connects two points x and y if .0/ D x and .l / D y. Similarly, connects x to a set A if .0/ D x and .l / 2 A. Lemma 5.25. Let W X ! Œ0; 1 be a Borel function and A X . Let ³ ² Z u.x/ D min 1; inf ds ;
where the infimum is taken over all curves (including constant curves) connecting x to the set A. If there are no such curves, we let the infimum be infinity. Then u D 0 on A and is an upper gradient of u. Moreover, if A is closed, then the function XnA is also an upper gradient of u. Proof. That u D 0 on A is clear (use the constant curves). Let x; y 2 X be arbitrary and let xy be a curve connecting x and y. We may assume that 0 u.y/ < u.x/ 1. If is a curve connecting y to A, then the curve xy C connects x to A and hence Z Z Z ds D ds C ds: u.x/ xy C
xy
Taking infimum over all curves connecting y to A shows that Z ds C u.y/; u.x/ xy
i.e. is an upper gradient of u.
5.2 Quasicontinuity of Newtonian functions
129
Now assume that A is closed and let W Œ0; l ! X be a curve connecting x and y. The cases A and X n A are trivial. If intersects both A and X n A, then by splitting into two parts if necessary, and possibly reversing the direction, we can assume that x 2 X n A and y 2 A. Let c D infft 2 Œ0; l W .t / 2 Ag. As A is closed, we have .Œ0; c// X n A with z D .c/ 2 A, and hence Z Z ju.x/ u.y/j D ju.x/ u.z/j ds XnA ds: jŒa;c
Lemma 5.26. Let F be a nonempty closed subset of a proper space X such that at least one of F and X n F is bounded. Let W X ! Œ0; 1 be lower semicontinuous and such that c > 0 in X n F . Let Z u.x/ D inf ds;
where the infimum is taken over all curves (including constant curves) connecting x to F . Then u is lower semicontinuous. Proof. Clearly, u D 0 on F . Let a > 0 be arbitrary and let Fa D fx 2 X W u.x/ ag: We shall show that Fa is closed. Assume that xj 2 Fa and that xj ! x 2 X , as j ! 1. If for sufficiently large j we have xj 2 F , then as F is closed we have x 2 F and hence x 2 Fa . Thus, without loss of generality, we assume that xj … F for j D 1; 2; ::: . Then there exist curves j W Œ0; lj ! X (parameterized by arc length) such that j .0/ D xj , j .lj / 2 F and Z 1 ds a C ; j D 1; 2; ::: : j j Let tj D infft 2 .0; lj W j .t / 2 F g. Since F is closed, j .tj / 2 F and we may assume that tj D lj . Reparameterize j by Qj .t / D j .t lj /, so that Qj W Œ0; 1 ! X , Qj .0/ D xj and Qj .1/ 2 F . Note that each Qj is lj -Lipschitz and Z aC1 lj ds : c j c This together with the assumptions on F also shows that all Qj are equicontinuous and have images contained in a bounded set. Thus, by the Ascoli theorem (see e.g. p. 169 in Royden [310], note that here we need a version of Ascoli’s theorem valid for metric space valued equicontinuous functions), a subsequence of fQj gj1D1 converges uniformly to a continuous function Q W Œ0; 1 ! X with Q .0/ D x and Q .1/ 2 F (Q is a curve in the traditional sense, but need not be parameterized by arc length).
130
5 Properties of Newtonian functions
As is lower semicontinuous, we have for all t 2 Œ0; 1, . ı Q /.t / lim inf . ı Qj /.t / j !1
and the Fatou lemma implies that Z Z a lim inf ds D lim inf j !1
Z
L lim inf j !1
j !1
j
lj
. ı j /.t / dt
0
1
Z
1
. ı Qj /.t / dt L 0
. ı Q /.t / dt; 0
where L D lim infj !1 lj . Note that as each Qj is lj -Lipschitz, the uniform convergence shows that Q is L-Lipschitz and hence the length function sQ .t / WD lj Q Œ0;t is L-Lipschitz and thus differentiable a.e. in Œ0; 1 with 0 s0Q .t / L. Reparameterize Q by arc length as Qs .s/ D Q .s1 .s//, where Q s1 Q .s/ D supft W sQ .t / D sg is the generalized right inverse of sQ . It follows that Z lQ Z 1 Z 1 Z 0 ds D . ı Qs /. / d D . ı Qs ı sQ /.t /sQ .t / dt L . ı Q /.t / dt a; Q
0
0
0
i.e. u.x/ a and x 2 Fa . Thus Fa is closed and X n Fa is open. Hence, by definition, u is lower semicontinuous. The following result shows that Cp is an outer capacity at the level of zero sets. This fact will be essential for proving that in complete doubling p-Poincaré spaces all Newtonian functions are quasicontinuous, see Theorem 5.29. We do not know if this is true without the assumption that X is proper. Proposition 5.27. Let X be proper and E X with Cp .E/ D 0. Then for every " > 0, there exists an open set U E with Cp .U / < ". Note that as Cp is not additive, it does not immediately follow that Cp is an outer capacity for all sets, cf. Theorem 5.31. Proof. Assume first that E is bounded. As Cp .E/ D 0, we have E 2 N 1;p .X / and there exists an upper gradient g 2 Lp .X / of E . The Vitali–Carathéodory theorem (Proposition 7.14 in Folland [124]) provides us with a lower semicontinuous function 2 Lp .X / such that g. Let " > 0 be arbitrary. By the definition of capacity, .E/ D 0 and as C 1 2 Lploc .X /, there exists a bounded open set V E such that Z .V / C . C 1/p d < 2p ": V
5.2 Quasicontinuity of Newtonian functions
131
³ ² Z u.x/ D min 1; inf . C 1/ ds ;
Let
where the infimum is taken over all curves (including constant curves) connecting x to the˚closed set X n V . By Lemma 5.26, u is lower semicontinuous and thus the set U D x 2 X W u > 12 is open. Note that for x 2 E and every curve connecting x to some y 2 X n V , Z Z . C 1/ ds g ds E .x/ E .y/ D 1;
i.e. u D 1 on E and E U . Lemma 5.25 shows that the function . C 1/V is an upper gradient of u and u D 0 in X n V . Thus, as u 1 is lower semicontinuous and hence measurable, we have u 2 N 1;p .X / and hence Z p p p p Cp .U / 2 kukN 1;p .X/ 2 .V / C . C 1/ d < "; V
which proves the claim for bounded E. If E is unbounded, write E as a countable union of bounded sets Ej , j D 1; 2; ::: , and using the above Ej such that Cp .Uj / < 2j ". The S1 argument, find open sets Uj P open set U D j D1 Uj contains E and Cp .U / j1D1 Cp .Uj / < ". A consequence of Proposition 5.27 is that quasicontinuity is preserved under perturbations on sets of capacity zero. Note that a similar result for weak quasicontinuity follows directly from the definition. Proposition 5.28. Assume that X is proper, that u is quasicontinuous in and that v D u q.e. in . Then v is also quasicontinuous in . Proof. Let " > 0. As u is quasicontinuous in , we can find an open set G with Cp .G/ < " such that ujnG is continuous. Let E D fx 2 W u.x/ ¤ v.x/g. By assumption Cp .E/ D 0, and thus, by Proposition 5.27, there is an open set U E with Cp .U / < ". Hence vjn.G[U / D ujn.G[U / is continuous, and G [ U is an open set with Cp .G [ U / < 2". As " > 0 was arbitrary, this shows that v is quasicontinuous in . Theorem 5.21 and Proposition 5.28 now imply that in complete doubling p-Poincaré spaces, all Newtonian functions are quasicontinuous. This has important consequences for the capacity (see Theorems 5.31 and 6.7) and for the Dirichlet problem (see Section 10.4). As before, we formulate the result in the more general case, assuming that continuous functions are dense in N 1;p .X /. Note that we prove quasicontinuity for functions on even though is neither complete nor supports a p-Poincaré inequality in general.
132
5 Properties of Newtonian functions
Theorem 5.29. Let X be proper and assume that continuous functions are dense in N 1;p .X /. (In particular, this holds if X is a complete doubling p-Poincaré space.) 1;p Then every u 2 Nloc ./ is quasicontinuous in . 1;p Proof. Let u 2 Nloc ./. By Theorem 5.21 there is a quasicontinuous representative v D u q.e. in . By Proposition 5.28, u is also quasicontinuous in .
Example 5.30. If the space X contains no nonconstant rectifiable curves (e.g. if X is the von Koch snowflake curve), then N 1;p .X / D Lp .X / and Cp .E/ D .E/, see Example 1.22. As Lipschitz functions are dense in Lp .X /, see Example 5.5, Theorem 5.29 shows that all functions in N 1;p .X / D Lp .X / are quasicontinuous, if X is proper. However, as Cp .E/ D .E/, the quasicontinuity in this case (assuming that X is locally compact) follows directly from Luzin’s theorem, see e.g. Folland [124], Theorem 7.10, or Rudin [311], Theorem 2.24. (Incidentally, Luzin’s theorem (on R) was first obtained by Vitali [347] in 1905, while Luzin [250] obtained it in 1912, see Bourbaki [74], p. 223.) Quasicontinuity of Newtonian functions implies that Cp is an outer capacity in the following theorem. In particular, this holds if X is proper and continuous functions are dense in N 1;p .X /. Theorem 5.31. Assume that all functions in N 1;p .X / are quasicontinuous. (In particular, this holds if X is a complete doubling p-Poincaré space.) Then Cp is an outer capacity, i.e. for all E X , Cp .E/ D inf Cp .G/: GE G open
Proof. Let 0 < " < 1 and u E with kukN 1;p .X/ Cp .E/1=p C ": By assumption, u is quasicontinuous. Hence there is an open set V with Cp .V /1=p < " such that ujXnV is continuous. Thus, there is an open set U such that U n V D fx W u.x/ > 1 "g n V E n V: We can also find v V with kvkN 1;p .X/ < ". Let u C v: 1" Then w 1 on .U n V / [ V D U [ V , an open set containing E. Hence wD
Cp .E/1=p inf Cp .G/1=p Cp .U [ V /1=p kwkN 1;p .X/ GE G open
1 1 kukN 1;p .X/ C kvkN 1;p .X/ .Cp .E/1=p C "/ C ": 1" 1" Letting " ! 0 completes the proof.
5.2 Quasicontinuity of Newtonian functions
133
The following is a consequence of the fact that Cp is an outer capacity. Proposition 5.32. Assume that Cp is an outer capacity. (In particular, this holds if X is a complete doubling p-Poincaré space.) Then a function is weakly quasicontinuous in if and only if it is quasicontinuous in . Proof. Assume that u is weakly quasicontinuous in . Let " > 0. Then there exists E such that Cp .E/ < " and ujnE is continuous. Since Cp is an outer capacity there is an open set G E with Cp .G/ < ". As ujnG is continuous, it follows that u is quasicontinuous in . The converse implication is trivial. We are now ready to give the following characterization of Newtonian functions in relation to arbitrary a.e.-representatives. Recall that Ny 1;p ./ D fu W u D v a.e. for some v 2 N 1;p ./g. Proposition 5.33. Assume that X is proper and that continuous functions are dense in N 1;p .X /. (In particular, this holds if X is a complete doubling p-Poincaré space.) If u 2 Ny 1;p ./, then the following are equivalent: (a) u 2 N 1;p ./; (b) u 2 ACCp ./; (c) u is quasicontinuous; (d) u is weakly quasicontinuous. 1;p ./, then the following are equivalent: Similarly, if u 2 Nyloc 1;p (a0 ) u 2 Nloc ./;
(b0 ) u 2 ACCp ./; (c0 ) u is quasicontinuous; (d0 ) u is weakly quasicontinuous. Proof. Assume first that u 2 Ny 1;p ./. (a) , (b) This was shown in Proposition 1.63 without any additional assumptions on X . (a) ) (c) This is Theorem 5.29. (c) ) (a) As u 2 Ny 1;p ./, there is v 2 N 1;p ./ so that u D v a.e. By Theorem 5.29, v is quasicontinuous. Hence, by Proposition 5.23, u D v q.e., and thus also u 2 N 1;p ./. (c) , (d) This follows from Proposition 5.32. 1;p The characterization for u 2 Nyloc ./ follows directly from the first part and Lemma 5.18. (Recall that ACCp ./ D ACCp;loc ./, by Proposition 2.27.)
134
5 Properties of Newtonian functions
This shows that the equivalence classes in Newtonian spaces consist exactly of the quasicontinuous representatives in the a.e.-equivalence classes for Ny 1;p . So e.g. if Rn and we consider an equivalence class in W 1;p ./, then the corresponding equivalence class in N 1;p ./ is obtained by weeding out all nonquasicontinuous functions and keeping all quasicontinuous functions, cf. Appendices A.1 and A.2. A natural question to ask is if Newtonian functions are always quasicontinuous. By Theorem 5.29 we know that this is true whenever continuous functions are dense in N 1;p .X /, in particular whenever X is a complete doubling p-Poincaré space. The other extreme is when there are no curves in X , such as on the von Koch snowflake curve, in which case we also know that continuous functions are dense in N 1;p .X / and Newtonian functions are quasicontinuous, see Example 5.30. In fact we do not know of any example when there is a nonquasicontinuous Newtonian function. Let us therefore state the following natural open problems. Open problem 5.34. Is it always true that continuous functions are dense in N 1;p .X /? Open problem 5.35. Is it always true that every function in N 1;p .X / is quasicontinuous? Open problem 5.36. Is it always true that Cp is an outer capacity? By Theorems 5.29 and 5.31, a positive answer to Open problem 5.34 implies a positive answer to Open problem 5.35, which in turn implies a positive answer to Open problem 5.36. An affirmative answer to Open problem 5.12 obviously also answers Open problem 5.34.
5.3 Continuity of Newtonian functions In certain situations, viz. under an additional assumption on the capacity of singletons, it is possible to deduce that all Newtonian functions are continuous, not merely quasicontinuous. This is our aim in this section. See also Section 5.5