You are on page 1of 540
 
Grundlehren dermathematischen Wissenschaften
 343
 A Series of Comprehensive Studies in MathematicsSeries editors
M. Berger P. de la Harpe F. HirzebruchN.J. Hitchin L. rmander A. KupiainenG. Lebeau F.-H. Lin B.C. NgôM. Ratner D. Serre Ya.G. SinaiN.J.A. Sloane A.M. Vershik M. Waldschmidt
 Editor-in-Chief 
A. Chenciner J. Coates S.R.S. Varadhan
 
 
Hajer Bahouri
 
Jean-Yves Chemin
 
Raphaël Danchin
Fourier Analysisand Nonlinear PartialDifferential Equations
 
Hajer BahouriDépartment de MathématiquesFaculté des Sciences de TunisCampus UniversitaireUniversité de TunisEl Manar2092 TunisTunisiahajer.bahouri@fst.rnu.tnJean-Yves CheminLaboratoire Jacques-Louis LionsUniversité Pierre et Marie CurieBoîte courrier 18775252 Paris Cedex 05Francechemin@ann.jussieu.frRaphaël DanchinCentre de MathématiquesFaculté de Sciences et TechnologieUniversité Paris XII-Val de Marne61, avenue du Général de Gaulle94 010 Créteil CedexFrancedanchin@univ-paris12.frISSN 0072-7830ISBN 978-3-642-16829-1 e-ISBN 978-3-642-16830-7DOI 10.1007/978-3-642-16830-7Springer Heidelberg Dordrecht London New York 
Mathematics Subject Classification: 35Q35, 76N10, 76D05, 35Q31, 35Q30c
Springer-Verlag Berlin Heidelberg 2011This work is subject to copyright. All rights are reserved, whether the whole or part of the material isconcerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting,reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publicationor parts thereof is permitted only under the provisions of the German Copyright Law of September 9,1965, in its current version, and permission for use must always be obtained from Springer. Violations areliable to prosecution under the German Copyright Law.Theuseofgeneraldescriptive names,registered names,trademarks, etc.inthis publication doesnot imply,even in the absence of a specific statement, that such names are exempt from the relevant protective lawsand regulations and therefore free for general use.
Cover design
: VTEX, VilniusPrinted on acid-free paperSpringer is part of Springer Science+Business Media (www.springer.com)
 
A la emoire de Noomann Basso
 
Preface
Since the 1980s, Fourier analysis methods have become of ever greater interestin the study of linear and nonlinear partial differential equations. In partic-ular, techniques based on
 Littlewood–Paley decomposition 
 have proven to bevery efficient in the study of evolution equations. Littlewood–Paley decom-position originates with Littlewood and Paley’s works in the early 1930s andprovides an elementary device for splitting a (possibly rough) function into asequence of spectrally well localized smooth functions. In particular, differen-tiation acts almost as a multiplication on each term of the sequence. However,its systematic use for nonlinear partial differential equations is rather recent.In this context, the main breakthrough was achieved after J.-M. Bony intro-duced the
 paradifferential calculus 
 in his pioneering 1981 paper (see [39]) andits avatar, the
 paraproduct 
.Surprisingly, despite the growing number of authors who now use suchtechniques, to the best of our knowledge, there is no textbook presentingFourier analysis tools in such a way that they may be directly used for solvingnonlinear partial differential equations.The aim of this book is threefold. First, we want to give a detailed presen-tation of harmonic analysis tools that are of constant use for solving nonlinearpartial differential equations. Second, we want to convince the reader that therough frequency splitting supplied by Littlewood–Paley decomposition (whichturns out to be much simpler than, e.g., Calderon–Zygmund decompositionor wavelet theory) may still provide elementary and elegant proofs of someclassical inequalities (such as Sobolev embedding and Gagliardo–Nirenberg orHardy inequalities). Third, we give a few examples of how to use these basicFourier analysis tools to solve linear or nonlinear evolution partial differentialequations. We have chosen to present the most popular evolution equations,namely, transport and heat equations, (linear or quasilinear) symmetric hy-perbolic systems, (linear, semilinear, or quasilinear) wave equations, and the(linear or semilinear) Schr¨odinger equation. We place a special emphasis onmodels coming from fluid mechanics (in particular, on the incompressibleNavier–Stokes and Euler equations) for which, historically, the Littlewood-
vii
 
viii Preface
Paley decomposition was first used. It goes without saying that our methodsare also relevant for solving a variety of other equations. In fact, there has beena plethora of recent papers dedicated to more complicated nonlinear partialdifferential equations in which Littlewood–Paley decomposition proves to bea crucial tool.This book is almost self-contained, inasmuch as having an undergraduatelevel understanding of analysis is the only prerequisite. There are rare excep-tions where we have had to admit nontrivial mathematical results, in whichcase references are given. Apart from these, we have postponed references,historical background, and discussion of possible future developments to theend of each chapter. The book does not contain any definitively new results.However, we have tried to provide an exhaustivity that cannot be found in anysingle paper. Also, we have provided new proofs for some well-known results.We have also decided not to discuss the theory of wavelets, even though thiswould be the natural extension of Littlewood–Paley decomposition. Indeed, itturns out that, to the best of our knowledge, there are almost no theoreticalresults for nonlinear partial differential equations in which wavelets cannot bereplaced by a simple Littlewood–Paley decomposition.When writing this book, we tried as much as possible to make a distinctionbetween what may be proven by means of classical analysis tools and whatreally does require Littlewood–Paley decomposition (and the paraproduct).In fact, with only a few exceptions, all the material concerning Littlewood–Paley decomposition is contained in Chapter 2 so that the reader who is notaccustomed to (or who is afraid of) those techniques may still read a great dealof the book. In fact, the whole of Chapter 1, the first section of Chapter 3, thefirst half of Chapter 4, Chapter 5 (except for the last section), the first sectionof Chapter 6, and the first two sections of Chapter 8 may be read completelyindependently of Chapter 2. In most of the other parts of the book, Chapter 2may be used freely as a “black box” that does not need to be opened.Roughly speaking, the book may be divided into two principal parts: Toolsare developed in the first two chapters, then applied to a variety of linear andnonlinear partial differential equations (Chapters 3–10). A detailed plan of the book is as follows.Chapter 1 is devoted to a self-contained elementary presentation of clas-sical Fourier analysis results. Even though none of the results are new, someof the proofs that we present are not the standard ones and are likely to beuseful in other contexts. We also pay attention to the construction of explicitexamples which illustrate the optimality of some refined estimates.In Chapter 2 we give a detailed presentation on Littlewood–Paley de-composition and define homogeneous and nonhomogeneous Besov spaces. Weshould emphasize that we have replaced the usual definition of homogeneousspaces (which are quotient distribution spaces modulo polynomials) by some-thing better adapted to the study of partial differential equations (indeed,dealing with distributions modulo polynomials is not appropriate in this con-
 
Preface ix
text). We also establish technical results (commutator estimates and func-tional inequalities, in particular) which will be used in the following chapters.In Chapter 3 we give a very complete theory of strong solutions for trans-port and transport-diffusion equations. In particular, we provide a priori es-timates which are the key to solving nonlinear systems coming from fluidmechanics. Chapter 4 is devoted to solving linear and quasilinear symmetricsystems with data in Sobolev spaces. Blow-up criteria and results concerningthe continuity of the flow map are also given. The case of data with criticalregularity (in a Besov space) is also investigated.In Chapter 5 we take advantage of the tools introduced in the previouschapters to establish most of the classical results concerning the well-posednessof the incompressible Navier–Stokes system for data with critical regularity.In order to emphasize the robustness of the tools that have been introducedhitherto in this book, we present in Chapter 6 a nonlinear system of partialdifferential equations with degenerate parabolicity. In fact, we show that someof the classical results for the Navier–Stokes system may be extended to thecase where there is no vertical diffusion. Most of the results of this chapterare based on the use of an
 anisotropic 
 Littlewood–Paley decomposition.Chapter 7 is the natural continuation of the previous chapter: The diffu-sion term is removed, leading to the study of the Euler system for inviscidincompressible fluids. Here, we state local (in dimension
 d
 
 3) and global(in dimension two) well-posedness results for data in general Besov spaces.In particular, we study the case where the data belong to Besov spaces forwhich the embedding in the set of Lipschitz functions is critical. In the two-dimensional case, we also give results concerning the inviscid limit. We stressthe case of data with (generalized) vortex patch structure.Chapter 8 is devoted to
 Strichartz estimates 
 for dispersive equations with afocus on Schr¨odinger and wave equations. After proving a dispersive inequality(i.e., decay in time of the
 L
norm in space) for these equations, we present,in a self-contained way, the celebrated
 T
argument based on a dualitymethod and on bilinear estimates. Some examples of applications to semilinearSchr¨odinger and wave equations are given at the end of the chapter.Chapter 9 is devoted to the study of a class of quasilinear wave equationswhich can be seen as a toy model for the Einstein equations. First, by takingadvantage of energy methods in the spirit of those of Chapter 4, we establishlocal well-posedness for “smooth” initial data (i.e., for data in Sobolev spacesembedded in the set of Lipschitz functions). Next, we weaken our regularityassumptions by taking advantage of the dispersive nature of the wave equa-tion. The key to that improvement is a quasilinear Strichartz estimate and arefinement of the paradifferential calculus. To prove the quasilinear Strichartzestimate, we use a microlocal decomposition of the time interval (i.e., a de-composition in some interval, the length of which depends on the size of thefrequency) and geometrical optics.In Chapter 10 we present a more complicated system of partial differentialequations coming from fluid mechanics, the so-called
 barotropic compressible 
 
x Preface
Navier–Stokes equations 
. Those equations are of mixed hyperbolic-parabolictype. We show how we may take advantage of the results of Chapter 3 and thetechniques introduced in Chapter 2 so as to obtain local (or global) uniquesolutions with critical regularity. The last part of this chapter is dedicatedto the study of the
 low Mach number limit 
 for this system. It is shown thatunder appropriate assumptions on the data, the limit solution satisfies theincompressible Navier–Stokes system studied in Chapter 5.In writing this book, we had help from many colleagues. We are particu-larly indebted to F. Charve, B. Ducomet, C. Fermanian-Kammerer, F. Sueur,B. Texier, and to the anonymous referees for pointing out numerous mistakesand giving suggestions and advice. In addition to J.-M. Bony, our work was in-spired by many collaborators and great mathematicians, among them B. Des- jardins, I. Gallagher, P. erard, E. Grenier, T. Hmidi, D. Iftimie, H. Koch,S. Klainerman, Y. Meyer, M. Paicu, D. Tataru, F. Vigneron, C.J. Xu, andP. Zhang. We would like to express our gratitude to all of them.Paris
 Hajer Bahouri Jean-Yves Chemin Raphel Danchi

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 
Contents
1 Basic Analysis
 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.1 Basic Real Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.1.1 H¨older and Convolution Inequalities . . . . . . . . . . . . . . . . . 11.1.2 The Atomic Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . 71.1.3 Proof of Refined Young Inequality . . . . . . . . . . . . . . . . . . . 81.1.4 A Bilinear Interpolation Theorem . . . . . . . . . . . . . . . . . . . 101.1.5 A Linear Interpolation Result . . . . . . . . . . . . . . . . . . . . . . . 111.1.6 The Hardy–Littlewood Maximal Function . . . . . . . . . . . . 131.2 The Fourier Transform . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 161.2.1 Fourier Transforms of Functions and the Schwartz Space 161.2.2 Tempered Distributions and the Fourier Transform . . . . 181.2.3 A Few Calculations of Fourier Transforms . . . . . . . . . . . . 231.3 Homogeneous Sobolev Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 251.3.1 Definition and Basic Properties . . . . . . . . . . . . . . . . . . . . . 251.3.2 Sobolev Embedding in Lebesgue Spaces . . . . . . . . . . . . . . 291.3.3 The Limit Case ˙
d
2
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 361.3.4 The Embedding Theorem in H¨older Spaces . . . . . . . . . . . 371.4 Nonhomogeneous Sobolev Spaces on
 R
d
. . . . . . . . . . . . . . . . . . . . 381.4.1 Definition and Basic Properties . . . . . . . . . . . . . . . . . . . . . 381.4.2 Embedding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 441.4.3 A Density Theorem. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 471.4.4 Hardy Inequality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 481.5 References and Remarks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
2 Littlewood–Paley Theory
 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 512.1 Functions with Compactly Supported Fourier Transforms. . . . . 512.1.1 Bernstein-Type Lemmas . . . . . . . . . . . . . . . . . . . . . . . . . . . 522.1.2 The Smoothing Effect of Heat Flow. . . . . . . . . . . . . . . . . . 532.1.3 The Action of a Diffeomorphism. . . . . . . . . . . . . . . . . . . . . 562.1.4 The Effects of Some Nonlinear Functions . . . . . . . . . . . . . 58
xi

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 
xii Contents
2.2 Dyadic Partition of Unity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 592.3 Homogeneous Besov Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 632.4 Characterizations of Homogeneous Besov Spaces. . . . . . . . . . . . . 722.5 Besov Spaces, Lebesgue Spaces, and Refined Inequalities . . . . . 782.6 Homogeneous Paradifferential Calculus . . . . . . . . . . . . . . . . . . . . . 852.6.1 Homogeneous Bony Decomposition . . . . . . . . . . . . . . . . . . 852.6.2 Action of Smooth Functions . . . . . . . . . . . . . . . . . . . . . . . . 932.6.3 Time-Space Besov Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . 982.7 Nonhomogeneous Besov Spaces. . . . . . . . . . . . . . . . . . . . . . . . . . . . 982.8 Nonhomogeneous Paradifferential Calculus. . . . . . . . . . . . . . . . . . 1022.8.1 The Bony Decomposition. . . . . . . . . . . . . . . . . . . . . . . . . . . 1022.8.2 The Paralinearization Theorem . . . . . . . . . . . . . . . . . . . . . 1042.9 Besov Spaces and Compact Embeddings. . . . . . . . . . . . . . . . . . . . 1082.10 Commutator Estimates. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1102.11 Around the Space
 B
1
,
 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1162.12 References and Remarks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120
3 Transport and Transport-Diffusion Equations
 . . . . . . . . . . . . . . 1233.1 Ordinary Differential Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . 1243.1.1 The Cauchy–Lipschitz Theorem Revisited . . . . . . . . . . . . 1243.1.2 Estimates for the Flow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1293.1.3 A Blow-up Criterion for Ordinary Differential Equations1313.2 Transport Equations: The Lipschitz Case . . . . . . . . . . . . . . . . . . . 1323.2.1 A Priori Estimates in General Besov Spaces . . . . . . . . . . 1323.2.2 Refined Estimates in Besov Spaces with Index 0 . . . . . . . 1353.2.3 Solving the Transport Equation in Besov Spaces. . . . . . . 1363.2.4 Application to a Shallow Water Equation. . . . . . . . . . . . . 1403.3 Losing Estimates for Transport Equations . . . . . . . . . . . . . . . . . . 1473.3.1 Linear Loss of Regularity in Besov Spaces . . . . . . . . . . . . 1473.3.2 The Exponential Loss . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1513.3.3 Limited Loss of Regularity. . . . . . . . . . . . . . . . . . . . . . . . . . 1533.3.4 A Few Applications. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1553.4 Transport-Diffusion Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1563.4.1 A Priori Estimates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1573.4.2 Exponential Decay . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1633.5 References and Remarks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 166
4 Quasilinear Symmetric Systems
. . . . . . . . . . . . . . . . . . . . . . . . . . . . 1694.1 Definition and Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1694.2 Linear Symmetric Systems. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1724.2.1 The Well-posedness of Linear Symmetric Systems . . . . . 1724.2.2 Finite Propagation Speed. . . . . . . . . . . . . . . . . . . . . . . . . . . 1804.2.3 Further Well-posedness Results for Linear SymmetricSystems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1834.3 The Resolution of Quasilinear Symmetric Systems . . . . . . . . . . . 187

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 
Contents xiii
4.3.1 Paralinearization and Energy Estimates . . . . . . . . . . . . . . 1894.3.2 Convergence of the Scheme . . . . . . . . . . . . . . . . . . . . . . . . . 1904.3.3 Completion of the Proof of Existence . . . . . . . . . . . . . . . . 1914.3.4 Uniqueness and Continuation Criterion. . . . . . . . . . . . . . . 1924.4 Data with Critical Regularity and Blow-up Criteria . . . . . . . . . . 1934.4.1 Critical Besov Regularity . . . . . . . . . . . . . . . . . . . . . . . . . . . 1934.4.2 A Refined Blow-up Condition . . . . . . . . . . . . . . . . . . . . . . . 1964.5 Continuity of the Flow Map . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1984.6 References and Remarks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201
5 The Incompressible Navier–Stokes System
 . . . . . . . . . . . . . . . . . 2035.1 Basic Facts Concerning the Navier–Stokes System . . . . . . . . . . . 2045.2 Well-posedness in Sobolev Spaces. . . . . . . . . . . . . . . . . . . . . . . . . . 2095.2.1 A General Result. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2095.2.2 The Behavior of the ˙
d
2
1
Norm Near 0 . . . . . . . . . . . . . 2145.3 Results Related to the Structure of the System . . . . . . . . . . . . . . 2155.3.1 The Particular Case of Dimension Two. . . . . . . . . . . . . . . 2155.3.2 The Case of Dimension Three . . . . . . . . . . . . . . . . . . . . . . . 2175.4 An Elementary
 L
 p
Approach. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2205.5 The Endpoint Space for Picard’s Scheme . . . . . . . . . . . . . . . . . . . 2275.6 The Use of the
 L
1
-smoothing Effect of the Heat Flow . . . . . . . . 2335.6.1 The Cannone–Meyer–Planchon Theorem Revisited . . . . 2345.6.2 The Flow of the Solutions of the Navier–Stokes System 2365.7 References and Remarks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 242
6 Anisotropic Viscosity
 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2456.1 The Case of 
 L
2
Data with One Vertical Derivative in
 L
2
. . . . . 2466.2 A Global Existence Result in Anisotropic Besov Spaces. . . . . . . 2546.2.1 Anisotropic Localization in Fourier Space. . . . . . . . . . . . . 2546.2.2 The Functional Framework . . . . . . . . . . . . . . . . . . . . . . . . . 2566.2.3 Statement of the Main Result . . . . . . . . . . . . . . . . . . . . . . . 2586.2.4 Some Technical Lemmas . . . . . . . . . . . . . . . . . . . . . . . . . . . 2616.3 The Proof of Existence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2666.4 The Proof of Uniqueness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2766.5 References and Remarks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
7 Euler System for Perfect Incompressible Fluids
 . . . . . . . . . . . . 2917.1 Local Well-posedness Results for Inviscid Fluids . . . . . . . . . . . . . 2927.1.1 The Biot–Savart Law . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2937.1.2 Estimates for the Pressure . . . . . . . . . . . . . . . . . . . . . . . . . . 2967.1.3 Another Formulation of the Euler System . . . . . . . . . . . . 3017.1.4 Local Existence of Smooth Solutions . . . . . . . . . . . . . . . . . 3027.1.5 Uniqueness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3047.1.6 Continuation Criteria . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3077.2 Global Existence Results in Dimension Two . . . . . . . . . . . . . . . . 310

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 
xiv Contents
7.2.1 Smooth Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3117.2.2 The Borderline Case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3117.2.3 The Yudovich Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3127.3 The Inviscid Limit. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3137.3.1 Regularity Results for the Navier–Stokes System . . . . . . 3147.3.2 The Smooth Case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3147.3.3 The Rough Case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3167.4 Viscous Vortex Patches . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3187.4.1 Results Related to Striated Regularity . . . . . . . . . . . . . . . 3197.4.2 A Stationary Estimate for the Velocity Field . . . . . . . . . . 3207.4.3 Uniform Estimates for Striated Regularity . . . . . . . . . . . . 3247.4.4 A Global Convergence Result for Striated Regularity. . . 3267.4.5 Application to Smooth Vortex Patches . . . . . . . . . . . . . . . 3307.5 References and Remarks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331
8 Strichartz Estimates and Applications to SemilinearDispersive Equations
 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3358.1 Examples of Dispersive Estimates . . . . . . . . . . . . . . . . . . . . . . . . . 3368.1.1 The Dispersive Estimate for the Free TransportEquation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3368.1.2 The Dispersive Estimates for the Schodinger Equation 3378.1.3 Integral of Oscillating Functions. . . . . . . . . . . . . . . . . . . . . 3398.1.4 Dispersive Estimates for the Wave Equation . . . . . . . . . . 3448.1.5 The
 L
2
Boundedness of Some Fourier Integral Operators3468.2 Bilinear Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3498.2.1 The Duality Method and the
 T
Argument. . . . . . . . . . 3508.2.2 Strichartz Estimates: The Case
 q >
 2 . . . . . . . . . . . . . . . . 3518.2.3 Strichartz Estimates: The Endpoint Case
 
 = 2 . . . . . . . 3528.2.4 Application to the Cubic Semilinear Schr¨odingerEquation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3558.3 Strichartz Estimates for the Wave Equation. . . . . . . . . . . . . . . . . 3598.3.1 The Basic Strichartz Estimate . . . . . . . . . . . . . . . . . . . . . . 3598.3.2 The Refined Strichartz Estimate . . . . . . . . . . . . . . . . . . . . 3628.4 The Quintic Wave Equation in
 R
3
. . . . . . . . . . . . . . . . . . . . . . . . . 3688.5 The Cubic Wave Equation in
 R
3
. . . . . . . . . . . . . . . . . . . . . . . . . . 3708.5.1 Solutions in ˙
1
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3708.5.2 Local and Global Well-posedness for Rough Data. . . . . . 3728.5.3 The Nonlinear Interpolation Method . . . . . . . . . . . . . . . . . 3748.6 Application to a Class of Semilinear Wave Equations. . . . . . . . . 3818.7 References and Remarks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 386
9 Smoothing Effect in Quasilinear Wave Equations
 . . . . . . . . . . 3899.1 A Well-posedness Result Based on an Energy Method . . . . . . . . 3919.2 The Main Statement and the Strategy of its Proof . . . . . . . . . . . 4019.3 Refined Paralinearization of the Wave Equation . . . . . . . . . . . . . 403

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 
Contents xv
9.4 Reduction to a Microlocal Strichartz Estimate . . . . . . . . . . . . . . 4069.5 Microlocal Strichartz Estimates . . . . . . . . . . . . . . . . . . . . . . . . . . . 4139.5.1 A Rather General Statement. . . . . . . . . . . . . . . . . . . . . . . . 4139.5.2 Geometrical Optics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4149.5.3 The Solution of the Eikonal Equation . . . . . . . . . . . . . . . . 4159.5.4 The Transport Equation . . . . . . . . . . . . . . . . . . . . . . . . . . . 4199.5.5 The Approximation Theorem . . . . . . . . . . . . . . . . . . . . . . . 4219.5.6 The Proof of Theorem 9.16 . . . . . . . . . . . . . . . . . . . . . . . . . 4239.6 References and Remarks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 427
10 The Compressible Navier–Stokes System
 . . . . . . . . . . . . . . . . . . 42910.1 About the Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42910.1.1 General Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43010.1.2 The Barotropic Navier–Stokes Equations . . . . . . . . . . . . . 43210.2 Local Theory for Data with Critical Regularity. . . . . . . . . . . . . . 43310.2.1 Scaling Invariance and Statement of the Main Result . . 43310.2.2 A Priori Estimates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43510.2.3 Existence of a Local Solution . . . . . . . . . . . . . . . . . . . . . . . 44010.2.4 Uniqueness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44510.2.5 A Continuation Criterion . . . . . . . . . . . . . . . . . . . . . . . . . . . 45010.3 Local Theory for Data Bounded Away from the Vacuum . . . . . 45110.3.1 A Priori Estimates for the Linearized MomentumEquation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45110.3.2 Existence of a Local Solution . . . . . . . . . . . . . . . . . . . . . . . 45710.3.3 Uniqueness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46010.3.4 A Continuation Criterion . . . . . . . . . . . . . . . . . . . . . . . . . . . 46210.4 Global Existence for Small Data. . . . . . . . . . . . . . . . . . . . . . . . . . . 46210.4.1 Statement of the Results . . . . . . . . . . . . . . . . . . . . . . . . . . . 46310.4.2 A Spectral Analysis of the Linearized Equation . . . . . . . 46410.4.3 A Priori Estimates for the Linearized Equation. . . . . . . . 46610.4.4 Proof of Global Existence . . . . . . . . . . . . . . . . . . . . . . . . . . 47310.5 The Incompressible Limit. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47510.5.1 Main Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47510.5.2 The Case of Small Data with Critical Regularity . . . . . . 47710.5.3 The Case of Large Data with More Regularity . . . . . . . . 48310.6 References and Remarks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 492
References
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 497
List of Notations
 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 523
Index
 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 527

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 
1Basic Analysis
This chapter is devoted to the presentation of a few basic tools which willbe used throughout this book. In the first section we state the H¨older andMinkowski inequalities. Next, we prove convolution inequalities in the generalcontext of locally compact groups equipped with left-invariant Haar measures.The adoption of this rather general framework is motivated by the fact thatthese inequalities may be used not only in the
 R
d
and
 Z
d
cases, but alsoin other groups such as the Heisenberg group
 H
d
. Both Lebesgue and weakLebesgue spaces are used. In the latter case, we introduce an atomic decompo-sition which will help us to establish a bilinear interpolation-type inequality.Finally, we give a few properties of the Hardy–Littlewood maximal operator.The second section is devoted to a short presentation on the Fourier trans-form in
 R
d
. The third section is dedicated to homogeneous Sobolev spacesin
 R
d
. There, we state basic topological properties, consider embedding inLebesgue, bounded mean oscillation, and H¨older spaces, and prove refinedSobolev inequalities. The classical Sobolev inequalities are of course invariantby translation and dilation. The refined versions of the Sobolev inequalitieswhich we prove are, in addition, invariant by translation in the Fourier space.We also present some classes of examples to show that these inequalities are insome sense optimal. In the last section of this chapter, we focus on nonhomo-geneous Sobolev spaces, with a special emphasis on trace theorems, compactembedding, and Moser–Trudinger and Hardy inequalities.
1.1 Basic Real Analysis
1.1.1 older and Convolution Inequalities
We begin by recalling the classical H¨older inequality.
Proposition 1.1.
 Let 
 (
X,µ
)
 be a measure space and 
 (
 p,q,r
)
 in 
 [1
,
]
3
be such that 
H. Bahouri et al.,
 Fourier Analysis and Nonlinear Partial Differential Equations 
, Grundlehren der mathematischen Wissenschaften 343,DOI
, c
 Springer-Verlag Berlin Heidelberg 20111

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 
2 1 Basic Analysis
1
 p
 + 1
 = 1
r
 ·
If 
 (
f,g
)
 belongs to
 L
 p
(
X,µ
)
×
L
q
(
X,µ
)
, then 
 fg
 belongs to
 L
r
(
X,µ
)
 and 
fg
L
 ≤ 
L
g
L
.
Proof.
 The cases where
 p
 = 1 or
 p
 =
 ∞
 being trivial, we assume from nowon that
 p
 is a real number greater than 1. The concavity of the logarithmfunction entails that for any positive real numbers
 a
 and
 b
 and any
 θ
 in [0
,
1],
θ
log
a
+ (1
θ
)log
b
 
 log(
θa
+ (1
θ
)
b
)
,
which obviously implies that
a
θ
b
1
θ
 θa
+ (1
θ
)
b.
Hence, assuming that
 
L
 =
 
g
L
 = 1
,
 we can write
X
|
fg
|
r
 =
X
(
|
|
 p
)
(
|
g
|
q
)
 r p
X
|
|
 p
+
 r
X
|
g
|
q
 r p
 +
 r
 = 1
.
The proposition is thus proved.
 
The following lemma states that H¨older’s inequality is in some sense optimal.
Lemma 1.2.
 Let 
 (
X,µ
)
 be a measure space and 
 p
 ∈
 [1
,
]
. Let 
 
 be a mea-surable function. If 
sup
g
1
X
|
(
x
)
g
(
x
)
|
(
x
)
 <
 
,
then 
 
 belongs to
 L
 p
and 
1
L
 = sup
g
1
X
(
x
)
g
(
x
)
(
x
)
.
Proof.
 Note that if 
 
 is in
 L
 p
, then H¨older’s inequality ensures thatsup
g
1
X
(
x
)
g
(
x
)
(
x
)
 
L
so that only the reverse inequality has to be proven.
Here, and throughout the book,
denotes the
 conjugate exponent 
 of 
, definedby1
 + 1
 = 1
 with the rule that 1
 = 0

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 
1.1 Basic Real Analysis 3
We start with the case
 p
 =
 
. Let
 λ
 be a positive real number suchthat
 µ
(
|
|
 λ
)
 >
 0. Writing
 
λ
def 
= (
|
|
 λ
), we consider a nonnegativefunction
 g
0
 in
 L
1
, supported in
 
λ
 with integral 1. If we define
g
(
x
) =
 
(
x
)
|
(
x
)
|
g
0
,
then
 g
 is in
 L
1
so that
 fg
 is integrable by assumption, and we have
X
fgdµ
(
x
) =
X
|
|
g
0
(
x
)
 
 λ
X
g
0
(
x
) =
 λ.
The lemma is proved in this case. We now assume that
 p
 
 ]1
,
[ and considera nondecreasing sequence (
n
)
n
 of subsets of finite measure of 
 X,
 the unionof which is
 X.
 Let
2
n
(
x
) =
 1
(
n
)
 and
 g
n
(
x
) =
 
n
(
x
)
|
n
(
x
)
|
 p
1
|
n
(
x
)
|
n
L
·
It is obvious that
 
n
 belongs to
 L
1
L
and thus to
 L
 p
for any
 p
. Moreover,we have
g
n
 p
L
 = 1
n
 pL
X
|
n
(
x
)
|
(
 p
1)
(
x
) = 1
.
The definitions of the functions
 
n
 and
 g
n
 ensure that
X
(
x
)
1
(
n
)
g
n
(
x
)
(
x
) =
X
n
(
x
)
g
n
(
x
)
(
x
)=
X
|
n
(
x
)
|
 p
(
x
)
n
L
=
 
n
L
.
Thus, we have
n
L
 ≤
 sup
g
1
X
(
x
)
g
(
x
)
(
x
)
.
The monotone convergence theorem immediately implies that
L
 ≤
 sup
g
1
X
(
x
)
g
(
x
)
(
x
)
.
Finally, in order to treat the case where
 p
 = 1
,
 we may consider the se-quence (
g
n
)
n
 defined by
g
n
(
x
) =
 1
(
=0)
(
x
)
 
n
(
x
)
|
n
(
x
)
| ·
Throughout this book, the notation 1
 where
 stands for any subset of 
,denotes the
 characteristic function 
 of 
.

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 
4 1 Basic Analysis
We obviously have
 
g
n
L
 = 1 and
X
(
x
)
g
n
(
x
)
(
x
) =
X
|
n
(
x
)
|
(
x
)
.
Using the monotone convergence theorem, we get that
X
|
(
x
)
|
(
x
)
 <
 
 and
X
|
(
x
)
|
(
x
) = lim
n
X
|
n
(
x
)
|
(
x
)
,
which completes the proof of the proposition.
 
We now state
 Minkowski’s inequality 
.
Proposition 1.3.
 Let 
 (
1
,µ
1
)
 and 
 (
2
,µ
2
)
 be two measure spaces and 
 
 nonnegative measurable function over 
 
1
 ×
2
.
 For all 
 1
 ≤
 p
 ≤
 
 ≤ ∞
, we have 
(
·
,x
2
)
L
(
X
)
L
(
X
)
(
x
1
,
·
)
L
(
X
)
L
(
X
)
.
Proof.
 The result is obvious if 
 
 =
 
. If 
 
 is finite, then, using Fubini’stheorem and
 r
 def 
= (
q/p
)
, we have
(
·
,x
2
)
L
(
X
)
L
(
X
)
=
X
X
 p
(
x
1
,x
2
)
1
(
x
1
)
2
(
x
2
)
=
 sup
g
=1
g
0
X
X
 p
(
x
1
,x
2
)
g
(
x
2
)
1
(
x
1
)
2
(
x
2
)
X
 sup
g
=1
g
0
X
 p
(
x
1
,x
2
)
g
(
x
2
)
2
(
x
2
)
1
(
x
1
)
.
Using H¨older’s inequality we may then infer that
(
·
,x
2
)
L
(
X
)
L
(
X
)
X
X
q
(
x
1
,x
2
)
2
(
x
2
)
1
(
x
1
)
,
and the desired inequality follows.
 
The
 convolution 
 between two functions will be used in various contexts inthis book. The reader is reminded that convolution makes sense for real- orcomplex-valued measurable functions defined on some locally compact topo-logical group
 G
 equipped with a left-invariant Haar measure
3
µ.
 The (formal)definition of convolution between two such functions
 
 and
 g
 is as follows:
This means that
 is a Borel measure on
 such that for any Borel set
 andelement
 of 
 we have
(
·
) =
(
)

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 
1.1 Basic Real Analysis 5
f g
(
x
) =
G
(
y
)
g
(
y
1
·
x
)
(
y
)
.
We can now state
 Young’s inequality 
 for the convolution of two functions.
Lemma 1.4.
 Let 
 G
 be a locally compact topological group endowed with left-invariant Haar measure 
 µ
. If 
 µ
 satisfies 
µ
(
A
1
) =
 µ
(
A
)
 for any Borel set 
A,
 (1.1)
then for all 
 (
 p,q,r
)
 in 
 [1
,
]
3
such that 
1
 p
 + 1
 = 1 + 1
r
 (1.2)
and any 
 (
f,g
)
 in 
 L
 p
(
G,µ
)
×
L
q
(
G,µ
)
, we have 
f g
 ∈
 L
r
(
G,µ
)
 and 
 
f g
L
(
G,µ
)
 ≤
L
(
G,µ
)
g
L
(
G,µ
)
.
Proof.
 We first note that, owing to the left invariance and (1.1), for all
 x
 
 G
and any measurable function
 h
 on
 G,
 we have
G
h
(
y
)
(
y
) =
G
h
(
y
1
·
x
)
(
y
)
.
Therefore, the case
 r
 =
 
 reduces to the H¨older inequality which was provenabove.We now consider the case
 r <
 
.
 Obviously, one can assume without lossof generality that
 
 and
 g
 are nonnegative and nonzero. We write(
f g
)(
x
) =
G
(
y
)
g
(
y
1
·
x
)
(
y
)
g
(
y
1
·
x
)
(
y
)
.
Observing that (1.2) can be written
 rr
 + 1
1
 p
 + 1
 = 1, H¨older’s inequalityimplies that(
f g
)(
x
)
 
G
 p
(
y
)
g
(
y
1
·
x
)
(
y
)
G
(
y
)
g
q
(
y
1
·
x
)
(
y
)
.
Applying H¨older’s inequality with
 α
 =
 rq/p
 (resp.,
 β 
 =
 rp/q 
) and the mea-sure
 f 
 p
(
y
)
(
y
) [resp.,
 g
q
(
y
1
·
x
)
(
y
)], and using the invariance of the mea-sure
 µ
 by the transform
 y
  
 y
1
·
x,
 we get(
f g
)(
x
)
 
G
 p
(
y
)
g
q
(
y
1
·
x
)
(
y
)
(
+
)
1
L
(
G,µ
)
 
g
1
L
(
G,µ
)
 .
Hence, raising the above inequality to the power
 r
 yields

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 
6 1 Basic Analysis
 
L
 g
g
L
(
x
)
r
 |
|
 p
 pL
 |
g
|
q
g
qL
(
x
)
.
Since the left invariance of the measure
 µ
 combined with Fubini’s theoremobviously implies that the convolution maps
 L
1
(
G,µ
)
×
L
1
(
G,µ
) into
 L
1
(
G,µ
)with norm 1
,
 this yields the desired result in the case
 r <
 
.
 
We now state a refined version of Young’s inequality.
Theorem 1.5.
 Let 
 (
G,µ
)
 satisfy the same assumptions as in Lemma  1.4.Let 
 (
 p,q,r
)
 be in 
 ]1
,
[
3
and satisfy 1.2 ). A constant 
 
 exists such that, for any 
 
 ∈
 L
 p
(
G,µ
)
 and any measurable function 
 g
 on 
 G
 where 
g
qL
(
G,µ
)
def 
= sup
λ>
0
λ
q
µ
(
|
g
|
 > λ
)
 <
 
,
the function 
 f g
 belongs to
 L
r
(
G,µ
)
,
 and 
f g
L
(
G,µ
)
 ≤
 C 
L
(
G,µ
)
g
L
(
G,µ
)
.
Remark 1.6.
 One can define the
 weak 
 L
q
space 
 as the space of measurablefunctions
 g
 on
 G
 such that
 
g
L
(
G,µ
)
 is finite. We note that since
λ
q
µ
(
|
g
|
 > λ
)
 
(
g
)
|
g
(
x
)
|
q
(
x
)
 
g
qL
(
G,µ
)
,
 (1.3)the above theorem leads back to the standard Young inequality (up to amultiplicative constant).We also that the weak
 L
q
space belongs to the family of 
 Lorentz spaces 
L
q,r
(
G,µ
)
,
 which may be defined by means of 
 real interpolation 
:
L
q,r
(
G,µ
) = [
L
(
G,µ
)
,L
1
(
G,µ
)]
1
/q,r
 for all 1
 < q <
 
 and 1
 
 r
 ≤
.
It turns out that the weak
 L
q
space coincides with
 L
q,
(
G,µ
). From generalreal interpolation theory, we can therefore deduce a plethora of H¨older andconvolution inequalities for Lorentz spaces (including, of course, the one whichwas proven above).We also stress that the above theorem implies the well-known
 Hardy–Little-wood–Sobolev inequality 
 on
 R
d
, given as follows.
Theorem 1.7.
 Let 
 α
 in 
 ]0
,d
[
 and 
 (
 p,r
)
 in 
 ]1
,
[
2
satisfy 
1
 p
 +
 αd
 = 1 + 1
r
·
 (1.4)
A constant 
 
 then exists such that 
|·|
α
L
(
)
 ≤
 C 
L
(
)
.
Our proof of Theorem 1.5 relies on the atomic decomposition that we intro-duce in the next subsection.

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 
1.1 Basic Real Analysis 7
1.1.2 The Atomic Decomposition
The
 atomic decomposition 
 of an
 L
 p
function is described by the followingproposition, which is valid for any measure space.
Proposition 1.8.
 Let 
 (
X,µ
)
 be a measure space and 
 p
 be in 
 [1
,
[
. Let 
 
 be a nonnegative function in 
 L
 p
. A sequence of positive real numbers 
 (
c
k
)
k
 and a sequence of nonnegative functions 
 (
k
)
k
 (the 
 atoms
) then exist such that 
 =
k
c
k
k
,
where the supports of the functions 
 
k
 are pairwise disjoint and 
µ
(Supp
 
k
)
 
 2
k
+1
,
 (1.5)
k
L
 ≤
 2
,
 (1.6)12
 pL
 ≤
k
c
 pk
 ≤
 2
 pL
.
 (1.7)
Remark 1.9.
 As implied by the definition given below, the sequence (
c
k
k
)
k
is independent of 
 p
 and depends only on
 
.
Proof of Proposition  1.8 .
 Define
λ
k
def 
= inf 
λ
(
f > λ
)
 <
 2
k
, c
k
def 
= 2
λ
k
,
 and
 
k
def 
=
 c
1
k
 1
(
λ
<f 
λ
)
f.
It is obvious that
 
k
L
 
 2
. Moreover, (
λ
k
)
k
 is a decreasing se-quence which, owing to the fact that
 
 is a nonnegative function in
 L
 p
, con-verges to 0 when
 k
 tends to infinity.By the definition of 
 λ
k
, we have
 µ
(
f > λ
k
)
 ≤
 2
k
and thus
 µ
(Supp
 
k
)
 ≤
2
k
+1
. This gives
k
c
 pk
 =
k
2
k
λ
 pk
=
 p
k
0
2
k
1
]0
[
(
λ
)
λ
 p
1
dλ.
Using Fubini’s theorem, we get
k
c
 pk
 =
 p
0
λ
 p
1
k/λ
2
k
dλ.
By the definition of the sequence (
λ
k
)
k
,
 λ < λ
k
 implies that
 µ
(
f > λ
)
 
 2
k
.We thus infer that

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

You're reading a previewUnlock full access (pages 25-122) by uploading documents or with a 30 day free trial

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

You're reading a previewUnlock full access (pages 158-213) by uploading documents or with a 30 day free trial

 
 
 
 
 
 
 
 
 
 
 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

You're reading a previewUnlock full access (pages 231-253) by uploading documents or with a 30 day free trial

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

You're reading a previewUnlock full access (pages 261-278) by uploading documents or with a 30 day free trial

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

You're reading a previewUnlock full access (pages 286-298) by uploading documents or with a 30 day free trial

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

You're reading a previewUnlock full access (pages 307-331) by uploading documents or with a 30 day free trial

 
 
 
 
 
 
 
 
 
 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

You're reading a previewUnlock full access (pages 348-368) by uploading documents or with a 30 day free trial

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

You're reading a previewUnlock full access (pages 375-390) by uploading documents or with a 30 day free trial

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

You're reading a previewUnlock full access (pages 401-415) by uploading documents or with a 30 day free trial

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

 

Upload your documents to download.

Or

Become a Scribd member for full access. Your first 30 days are free.

You're reading a previewUnlock full access (pages 422-425) by uploading documents or with a 30 day free trial

You're reading a previewUnlock full access (pages 441-448) by uploading documents or with a 30 day free trial

You're reading a previewUnlock full access (pages 454-489) by uploading documents or with a 30 day free trial

You're reading a previewUnlock full access (pages 495-497) by uploading documents or with a 30 day free trial

You're reading a previewUnlock full access (page 503) by uploading documents or with a 30 Day Free Trial

You're reading a previewUnlock full access (page 509) by uploading documents or with a 30 Day Free Trial

You're reading a previewUnlock full access (pages 523-526) by uploading documents or with a 30 day free trial

You're reading a previewUnlock full access (pages 530-538) by uploading documents or with a 30 day free trial

Reward Your Curiosity

Everything you want to read.
Anytime. Anywhere. Any device.
No Commitment. Cancel anytime.
576648e32a3d8b82ca71961b7a986505