Springer Monographs in Mathematics
Kung-Ching Chang
Methods in Nonlinear Analysis
ABC
Kung-Ching Chang School of Mathematical Sciences Peking University 100871 Beijing People’s Republic of China E-mail:
[email protected]
Library of Congress Control Number: 2005931137 Mathematics Subject Classification (2000): 47H00, 47J05, 47J07, 47J25, 47J30, 58-01, 58C15, 58E05, 49-01, 49J15, 49J35, 49J45, 49J53, 35-01 ISSN 1439-7382 ISBN-10 3-540-24133-7 Springer Berlin Heidelberg New York ISBN-13 978-3-540-24133-1 Springer Berlin Heidelberg New York 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, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or 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 are liable for prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springeronline.com c Springer-Verlag Berlin Heidelberg 2005 Printed in The Netherlands The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting: by the authors and TechBooks using a Springer LATEX macro package Cover design: design & production GmbH, Heidelberg Printed on acid-free paper
SPIN: 11369295
41/TechBooks
543210
Preface
Nonlinear analysis is a new area that was born and has matured from abundant research developed in studying nonlinear problems. In the past thirty years, nonlinear analysis has undergone rapid growth; it has become part of the mainstream research fields in contemporary mathematical analysis. Many nonlinear analysis problems have their roots in geometry, astronomy, fluid and elastic mechanics, physics, chemistry, biology, control theory, image processing and economics. The theories and methods in nonlinear analysis stem from many areas of mathematics: Ordinary differential equations, partial differential equations, the calculus of variations, dynamical systems, differential geometry, Lie groups, algebraic topology, linear and nonlinear functional analysis, measure theory, harmonic analysis, convex analysis, game theory, optimization theory, etc. Amidst solving these problems, many branches are intertwined, thereby advancing each other. The author has been offering a course on nonlinear analysis to graduate students at Peking University and other universities every two or three years over the past two decades. Facing an enormous amount of material, vast numbers of references, diversities of disciplines, and tremendously different backgrounds of students in the audience, the author is always concerned with how much an individual can truly learn, internalize and benefit from a mere semester course in this subject. The author’s approach is to emphasize and to demonstrate the most fundamental principles and methods through important and interesting examples from various problems in different branches of mathematics. However, there are technical difficulties: Not only do most interesting problems require background knowledge in other branches of mathematics, but also, in order to solve these problems, many details in argument and in computation should be included. In this case, we have to get around the real problem, and deal with a simpler one, such that the application of the method is understandable. The author does not always pursue each theory in its broadest generality; instead, he stresses the motivation, the success in applications and its limitations.
VI
Preface
The book is the result of many years of revision of the author’s lecture notes. Some of the more involved sections were originally used in seminars as introductory parts of some new subjects. However, due to their importance, the materials have been reorganized and supplemented, so that they may be more valuable to the readers. In addition, there are notes, remarks, and comments at the end of this book, where important references, recent progress and further reading are presented. The author is indebted to Prof. Wang Zhiqiang at Utah State University, Prof. Zhang Kewei at Sussex University and Prof. Zhou Shulin at Peking University for their careful reading and valuable comments on Chaps. 3, 4 and 5. Peking University September, 2003
Kung Ching Chang
Contents
1
Linearization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.1 Differential Calculus in Banach Spaces . . . . . . . . . . . . . . . . . . . . . 1.1.1 Frechet Derivatives and Gateaux Derivatives . . . . . . . . . . 1.1.2 Nemytscki Operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.1.3 High-Order Derivatives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2 Implicit Function Theorem and Continuity Method . . . . . . . . . . 1.2.1 Inverse Function Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.3 Continuity Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.3 Lyapunov–Schmidt Reduction and Bifurcation . . . . . . . . . . . . . . 1.3.1 Bifurcation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.3.2 Lyapunov–Schmidt Reduction . . . . . . . . . . . . . . . . . . . . . . . 1.3.3 A Perturbation Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.3.4 Gluing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.3.5 Transversality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.4 Hard Implicit Function Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . 1.4.1 The Small Divisor Problem . . . . . . . . . . . . . . . . . . . . . . . . . 1.4.2 Nash–Moser Iteration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1 1 2 7 9 12 12 17 23 30 30 33 43 47 49 54 55 62
2
Fixed-Point Theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 2.1 Order Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 2.2 Convex Function and Its Subdifferentials . . . . . . . . . . . . . . . . . . . 80 2.2.1 Convex Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80 2.2.2 Subdifferentials . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84 2.3 Convexity and Compactness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87 2.4 Nonexpansive Maps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104 2.5 Monotone Mappings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109 2.6 Maximal Monotone Mapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120
VIII
Contents
3
Degree Theory and Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . 127 3.1 The Notion of Topological Degree . . . . . . . . . . . . . . . . . . . . . . . . . 128 3.2 Fundamental Properties and Calculations of Brouwer Degrees . 137 3.3 Applications of Brouwer Degree . . . . . . . . . . . . . . . . . . . . . . . . . . . 148 3.3.1 Brouwer Fixed-Point Theorem . . . . . . . . . . . . . . . . . . . . . . 148 3.3.2 The Borsuk-Ulam Theorem and Its Consequences . . . . . 148 3.3.3 Degrees for S 1 Equivariant Mappings . . . . . . . . . . . . . . . . 151 3.3.4 Intersection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153 3.4 Leray–Schauder Degrees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 3.5 The Global Bifurcation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 164 3.6 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 175 3.6.1 Degree Theory on Closed Convex Sets . . . . . . . . . . . . . . . 175 3.6.2 Positive Solutions and the Scaling Method . . . . . . . . . . . . 180 3.6.3 Krein–Rutman Theory for Positive Linear Operators . . . 185 3.6.4 Multiple Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189 3.6.5 A Free Boundary Problem . . . . . . . . . . . . . . . . . . . . . . . . . . 192 3.6.6 Bridging . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193 3.7 Extensions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 195 3.7.1 Set-Valued Mappings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 195 3.7.2 Strict Set Contraction Mappings and Condensing Mappings . . . . . . . . . . . . . . . . . . . . . . . . . . 198 3.7.3 Fredholm Mappings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 200
4
Minimization Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 205 4.1 Variational Principles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 206 4.1.1 Constraint Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 206 4.1.2 Euler–Lagrange Equation . . . . . . . . . . . . . . . . . . . . . . . . . . . 209 4.1.3 Dual Variational Principle . . . . . . . . . . . . . . . . . . . . . . . . . . 212 4.2 Direct Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 216 4.2.1 Fundamental Principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 216 4.2.2 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217 4.2.3 The Prescribing Gaussian Curvature Problem and the Schwarz Symmetric Rearrangement . . . . . . . . . . 223 4.3 Quasi-Convexity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 231 4.3.1 Weak Continuity and Quasi-Convexity . . . . . . . . . . . . . . . 232 4.3.2 Morrey Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237 4.3.3 Nonlinear Elasticity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 242 4.4 Relaxation and Young Measure . . . . . . . . . . . . . . . . . . . . . . . . . . . . 244 4.4.1 Relaxations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 245 4.4.2 Young Measure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 251 4.5 Other Function Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260 4.5.1 BV Space . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260 4.5.2 Hardy Space and BMO Space . . . . . . . . . . . . . . . . . . . . . . . 266 4.5.3 Compensation Compactness . . . . . . . . . . . . . . . . . . . . . . . . 271 4.5.4 Applications to the Calculus of Variations . . . . . . . . . . . . 274
Contents
IX
4.6 Free Discontinuous Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279 4.6.1 Γ-convergence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279 4.6.2 A Phase Transition Problem . . . . . . . . . . . . . . . . . . . . . . . . 280 4.6.3 Segmentation and Mumford–Shah Problem . . . . . . . . . . . 284 4.7 Concentration Compactness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289 4.7.1 Concentration Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289 4.7.2 The Critical Sobolev Exponent and the Best Constants 295 4.8 Minimax Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 301 4.8.1 Ekeland Variational Principle . . . . . . . . . . . . . . . . . . . . . . . 301 4.8.2 Minimax Principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303 4.8.3 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 306 5
Topological and Variational Methods . . . . . . . . . . . . . . . . . . . . . . 315 5.1 Morse Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 317 5.1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 317 5.1.2 Deformation Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 319 5.1.3 Critical Groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 327 5.1.4 Global Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 334 5.1.5 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 343 5.2 Minimax Principles (Revisited) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 347 5.2.1 A Minimax Principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 347 5.2.2 Category and Ljusternik–Schnirelmann Multiplicity Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 349 5.2.3 Cap Product . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 354 5.2.4 Index Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 358 5.2.5 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 363 5.3 Periodic Orbits for Hamiltonian System and Weinstein Conjecture . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 371 5.3.1 Hamiltonian Operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 373 5.3.2 Periodic Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 374 5.3.3 Weinstein Conjecture . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 376 5.4 Prescribing Gaussian Curvature Problem on S 2 . . . . . . . . . . . . . 380 5.4.1 The Conformal Group and the Best Constant . . . . . . . . . 380 5.4.2 The Palais–Smale Sequence . . . . . . . . . . . . . . . . . . . . . . . . . 387 5.4.3 Morse Theory for the Prescribing Gaussian Curvature Equation on S2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 389 5.5 Conley Index Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 392 5.5.1 Isolated Invariant Set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 393 5.5.2 Index Pair and Conley Index . . . . . . . . . . . . . . . . . . . . . . . . 397 5.5.3 Morse Decomposition on Compact Invariant Sets and Its Extension . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 408
Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 419 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 425
1 Linearization
The first and the easiest step in studying a nonlinear problem is to linearize it. That is, to approximate the initial nonlinear problem by a linear one. Nonlinear differential equations and nonlinear integral equations can be seen as nonlinear equations on certain function spaces. In dealing with their linearizations, we turn to the differential calculus in infinite-dimensional spaces. The implicit function theorem for finite-dimensional space has been proved very useful in all differential theories: Ordinary differential equations, differential geometry, differential topology, Lie groups etc. In this chapter we shall see that its infinite-dimensional version will also be useful in partial differential equations and other fields; in particular, in the local existence, in the stability, in the bifurcation, in the perturbation problem, and in the gluing technique etc. This is the contents of Sects. 1.2 and 1.3. Based on Newton iterations and the smoothing operators, the Nash–Moser iteration, which is motivated by the isometric embeddings of Riemannian manifolds into Euclidean spaces and the KAM theory, is now a very important tool in analysis. Limited in space and time, we restrict ourselves to introducing only the spirit of the method in Sect. 1.4.
1.1 Differential Calculus in Banach Spaces There are two kinds of derivatives in the differential calculus of several variables, the gradients and the directional derivatives. We shall extend these two to infinite-dimensional spaces. Let X, Y and Z be Banach spaces, with norms · X , · Y , · Z , respectively. If there is no ambiguity, we omit the subscripts. Let U ⊂ X be an open set, and let f : U → Y be a map.
2
1 Linearization
1.1.1 Frechet Derivatives and Gateaux Derivatives Definition 1.1.1 (Fr´echet derivative) Let x0 ∈ U ; we say that f is Fr´echet differentiable (or F-differentiable) at x0 , if ∃A ⊂ L(X, Y ) such that f (x) − f (x0 ) − A(x − x0 ) Y = ◦( x − x0 X ) . Let f (x0 ) = A, and call it the Fr´echet (or F-) derivative of f at x0 . If f is F-differentiable at every point in U , and if x → f (x), as a mapping from U to L(X, Y ), is continuous at x0 , then we say that f is continuously differentiable at x0 . If f is continuously differentiable at each point in U , then we say that f is continuously differentiable on U , and denote it by f ∈ C 1 (U, Y ). Parallel to the differential calculus of several variables, by definition, we may prove the following: 1. If f is F-differentiable at x0 , then f (x0 ) is uniquely determined. 2. If f is F-differentiable at x0 , then f must be continuous at x0 . 3. (Chain rule) Assume that U ⊂ X, V ⊂ Y are open sets, and that f is F-differentiable at x0 , and g is F-differentiable at f (x0 ), where f
g
U −−−−→ V −−−−→ Z Then
(g ◦ f ) (x0 ) = g ◦ f (x0 ) · f (x0 ) .
Definition 1.1.2 (Gateaux derivative) Let x0 ∈ U ; we say that f is Gateaux differentiable (or G-differentiable) at x0 , if ∀h ∈ X, ∃ df (x0 , h) ⊂ Y , such that f (x0 + th) − f (x0 ) − tdf (x0 , h)Y = ◦(t) as t → 0 for all x0 + th ⊂ U . We call df (x0 , h) the Gateaux derivative (or G-derivative) of f at x0 . We have
d f (x0 + th) |t=0 = df (x0 , h) , dt if f is G-differentiable at x0 . By definition, we have the following properties: 1. If f is G-differentiable at x0 , then df (x0 , h) is uniquely determined. 2. df (x0 , th) = tdf (x0 , h) ∀t ∈ R1 . 3. If f is G-differentiable at x0 , then ∀h ∈ X, ∀y ∗ ∈ Y ∗ , the function ϕ(t) = y ∗ , f (x0 + th) is differentiable at t = 0, and ϕ (t) = y ∗ , df (x0 , h) . 4. Assume that f : U → Y is G-differentiable at each point in U , and that the segment {x0 + th | t ∈ [0, 1]} ⊂ U , then f (x0 + h) − f (x0 ) Y sup df (x0 + th, h) Y 0
1.1 Differential Calculus in Banach Spaces
3
Proof. Let ϕy∗ (t) = y ∗ , f (x0 + th) t ∈ [0, 1], ∀y ∗ ∈ Y ∗ | y ∗ , f (x0 + h) − f (x0 ) | = | ϕy∗ (1) − ϕy∗ (0) | = | ϕy∗ (t∗ ) | = | y ∗ , df (x0 + t∗ h, h) | for some t∗ ∈ (0, 1) depending on y ∗ . The conclusion follows from the Hahn–Banach theorem. 5. If f is F-differentiable at x0 , then f is G-differentiable at x0 , with df (x0 , h) = f (x0 )h ∀h ∈ X. Conversely it is not true, but we have: Theorem 1.1.3 Suppose that f : U → Y is G-differentiable, and that ∀x ∈ U , ∃A(x) ∈ L(X, Y ) satisfying df (x, h) = A(x)h
∀h ∈ X .
If the mapping x → A(x) is continuous at x0 , then f is F-differentiable at x0 , with f (x0 ) = A(x0 ). Proof. With no loss of generality, we assume that the segment {x0 + th | t ∈ [0, 1]} is in U . According to the Hahn–Banach theorem, ∃y ∗ ∈ Y ∗ , with y ∗ = 1, such that f (x0 + h) − f (x0 ) − A(x0 )h Y = y ∗ , f (x0 + h) − f (x0 ) − A(x0 )h . Let
ϕ(t) = y ∗ , f (x0 + th) .
From the mean value theorem, ∃ξ ∈ (0, 1) such that | ϕ(1) − ϕ(0) − y ∗ , A(x0 )h | = | ϕ (ξ) − y ∗ , A(x0 )h | = | y ∗ , df (x0 + ξh, h) − A(x0 )h) | = | y ∗ , [A(x0 + ξh) − A(x0 )]h | = ◦( h ) , i.e., f (x0 ) = A(x0 ).
The importance of Theorem 1.1.3 lies in the fact that it is not easy to write down the F-derivative for a given map directly, but the computation of G-derivative is reduced to the differential calculus of single variables. The same situation occurs in the differential calculus of several variables: Gradients are reduced to partial derivatives, and partial derivatives are reduced to derivatives of single variables.
4
1 Linearization
Example 1. Let A ∈ L(X, Y ), f (x) = Ax. Then f (x) = A ∀x. Example 2. Let X = Rn , Y = Rm , and let ϕ1 , ϕ2 . . . , ϕm ∈ C 1 (Rn , R1 ). Set ⎞ ⎛ ϕ1 (x) ⎟ ⎜ f (x) = ⎝ ... ⎠ , i.e., f : X → Y . ϕm (x) Then f (x0 ) =
∂ϕi (x0 ) ∂xj
. m×n
Example 3. Let Ω ⊂ Rn be an open bounded domain. Denote by C(Ω) the continuous function space on Ω. Let ϕ : Ω × R1 −→ R1 , be a C 1 function. Define a mapping f : C(Ω) → C(Ω) by u(x) → ϕ(x, u(x)) . Then f is F-differentiable, and ∀u0 ∈ C(Ω), (f (u0 ) · v)(x) = ϕu (x, u0 (x)) · v(x) ∀v ∈ C(Ω) . Proof. ∀h ∈ C(Ω) t−1 [f (u0 + th) − f (u0 )](x) = ϕu (x, u0 (x) + tθ(x)h(x))h(x) , where θ(x) ∈ (0, 1). ∀ε > 0, ∀M > 0, ∃δ = δ(M, ε) > 0 such that | ϕu (x, ξ) − ϕu (x, ξ ) |< ε, ∀x ∈ Ω , as |ξ|, |ξ | M and |ξ − ξ | δ. We choose M = u0 + h , then for |t| < δ < 1, |ϕu (x, u0 (x) + tθ(x)h(x)) − ϕu (x, u0 (x))| < ε . It follows that df (u0 , h)(x) = ϕu (x, u0 (x))h(x). Noticing that the multiplication operator h → A(u)h = ϕu (x, u(x)) · h(x) is linear and continuous, and the mapping u → A(u) from C(Ω) into L(C(Ω), C(Ω)) is continuous, from Theorem 1.1.3, f is F-differentiable, and (f (u0 ) · v)(x) = ϕu (x, u0 (x)) · v(x) ∀v ∈ C(Ω) .
1.1 Differential Calculus in Banach Spaces
5
We investigate nonlinear differential operators on more general spaces. Let Ω ⊂ Rn be a bounded open set, and let m be a nonnegative integer, older space C m,γ (Ω)) is defined to be the function γ ∈ (0, 1). C m (Ω) (and the H¨ m space consisting of C functions (with γ-H¨older continuous m-order partial derivatives). The norms are defined as follows: |∂ α u(x)| , u C m = max x∈Ω
|α|≤m
and u C m,γ = u C m +
|∂ α u(x) − ∂ α u(y)| , |x − y|γ |α|=m
max x,y∈Ω
where α = (α1 , α2 , . . . , αn ) is a multi-index, |α| = α1 + α2 + · · · + αn , ∂ α = ∂xα11 ∂xα22 · · · ∂xαnn . We always denote by m∗ the number of the index set {α = (α1 , α2 , . . . , αn ) | |α| m}, and Dm u the set {∂ α u | |α| m}. ∗ Suppose that r is a nonnegative integer, and that ϕ ∈ C ∞ (Ω×Rr ). Define a differentiable operator of order r: f (u)(x) = ϕ(x, Dr u(x)) . Suppose m r, then f : C m (Ω) → C m−r (Ω) (and also C m,γ (Ω) → (Ω)) is F-differentiable. Furthermore C ϕα (x, Dr u0 (x)) · ∂ α h(x), ∀h ∈ C m (Ω) , (f (u0 )h)(x) = m−r,γ
|α|≤r
where ϕα is the partial derivative of ϕ with respect to the variable index α. The proof is similar to Example 3. ∗
Example 4. Suppose ϕ ∈ C ∞ (Ω × Rr ). Define
f (u) = ϕ(x, Dr u(x))dx ∀u ∈ C r (Ω) . Ω
Then f : C r (Ω) → R1 is F-differentiable. Furthermore
f (u0 ), h = ϕα (x, Dr u0 (x))∂ α h(x)dx
∀h ∈ C r (Ω) .
Ω |α|≤r
Proof. Use the chain rule: ϕ(·,D r u(·))
C r (Ω) −−−−−−−→ C(Ω) −−−Ω−→ R1 , and combine the results of Examples 1 and 3.
6
1 Linearization
In particular, the following functional occurs frequently in the calculus of variations (r = 1, r∗ = n + 1). Assume that ϕ(x, u, p) is a function of the form: ϕ(x, u, p) =
n 1 2 |p| + ai (x)pi + a0 (x)u , 2 i=1
where p = (p1 , p2 , . . . , pn ), and ai (x), i = 0, 1, . . . , n, are in C(Ω). Set
n 1 2 |∇u(x)| + f (u) = ai (x)∂xi u + a0 (x)u(x) dx , Ω 2 i=1 we have
∇u(x) · ∇h(x) +
f (u), h = Ω
n
ai (x)∂xi h(x) + a0 (x)h(x) dx
i=1
∀h ∈ C 1 (Ω) . Example 5. Let X be a Hilbert space, with inner product (, ). Find the Fderivative of the norm f (x) = x , as x = θ. Let F (x) = x 2 . Since t−1 ( x + th 2 − x 2 ) = 2(x, h) + t h 2 , we have dF (x, h) = 2(x, h). It is continuous for all x, therefore F is Fdifferentiable, and F (x)h = 2(x, h) . 1
Since f = F 2 , by the chain rule F (x) = 2 x ·f (x) . As x = θ,
x ,h . f (x)h = x In the applications to PDE as well as to the calculus of variations, Sobolev spaces are frequently used. We should extend the above studies to nonlinear operators defined on Sobolev spaces. ∀p 1, ∀ nonnegative integer m, let
W m,p (Ω) = {u ∈ Lp (Ω) | ∂ α u ∈ Lp (Ω) | |α| m} , where ∂ α u stands for the α-order generalized derivative of u, i.e., the derivative in the distribution sense. Define the norm ⎞ p1 ⎛ ∂ α u pLp (Ω) ⎠ . u W m,p = ⎝ |α≤m
The Banach space is called the Sobolev space of index {m, p}. W m,2 (Ω) is denoted by H m (Ω), and the closure of C0∞ (Ω) under this norm is denoted by H0m (Ω).
1.1 Differential Calculus in Banach Spaces
7
1.1.2 Nemytscki Operator On Sobolev spaces, we extend the composition operator u → ϕ(x, u(x)) such that ϕ may not be continuous in x. The class of operators is sometimes called Nemytski operators. Definition 1.1.4 Let (Ω, B , µ) be a measure space. We say that ϕ : Ω × RN → R1 is a Caratheodory function, if 1. ∀a.e.x ∈ Ω, ξ → ϕ(x, ξ) is continuous. 2. ∀ξ ∈ RN , x → ϕ(x, ξ) is µ-measurable. The motivation in introducing the Caratheodory function is to make the composition function measurable if u(x) is only measurable. Indeed, there exists a sequence of simple functions {un (x)}∞ , such that un (x) → u(x) a.e., ϕ(x, un (x)) is measurable according to (2). And from (1), ϕ(x, un (x)) → ϕ(x, u(x)) a.e., therefore ϕ(x, u(x)) is measurable. p
Theorem 1.1.5 Assume p1 , p2 1, a > 0 and b ∈ Ldµ2 (Ω). Suppose that ϕ is a Caratheodory function satisfying p1
|ϕ(x, ξ)| b(x) + a|ξ| p2 . Then f : u(x) → ϕ(x, u(x)) is a bounded and continuous mapping from p p Ldµ1 (Ω, RN ) to Ldµ2 (Ω, RN ). Proof. The boundedness follows from the Minkowski inequality: p1 p
f (u) p2 b p2 + a u p 2 , 1
where · p is the Lpdµ (Ω, RN ) norm. We turn to proving the continuity. It is p1 sufficient to prove that ∀{un }∞ 1 if un → u in L , then there is a subsequence p2 {uni } such that f (uni ) → f (u) in L . Indeed one can find a subsequence {uni } of {un } which converges a.e. to u, along which uni − uni−1 p1 < 21i , i = 2, 3, . . .; therefore |uni (x)| Φ(x) := |un1 (x)| +
∞
|uni (x) − uni−1 (x)| .
i=2
Since Φ is measurable, and
|Φ(x)|p1 dµ
p1
1
Ω
un1 p1 +
∞ i=2
p
we conclude that Φ ∈ Ldµ1 (Ω). Noticing
uni − uni−1 p1 < +∞ ,
8
1 Linearization
f (uni ) = ϕ(x, uni (x)) → ϕ(x, u(x)) and
p1
a.e. ,
p
|f (uni )(x)| b(x) + a(Φ(x)) p2 ∈ Ldµ2 (Ω, RN ) , we have f (uni ) − f (u) p2 → 0, according to Lebesgue dominance theorem. This proves the continuity of f . Corollary 1.1.6 Let Ω ⊂ Rn be a smooth bounded domain, and let 1 ≤ ∗ p1 , p2 ≤ ∞. Suppose that ϕ : Ω × Rm → R is a Caratheodory function satisfying m αj |ξj | p2 , |ϕ(x, ξ0 , . . . , ξm )| b(x) + a j=0
where ξj is a #{α = (α1 , . . . , αn )| |α| = j}-vector, αj ( p1 − 1
m−j −1 , n )
a>
0, and b ∈ L (Ω). Then f (u)(x) = ϕ(x, D u(x)) defines a bounded and continuous map from W m,p1 (Ω) into Lp2 (Ω). p2
m
Corollary 1.1.7 Suppose that Ω ⊂ Rn and that ϕ : Ω×R1 → R1 and ϕξ (x, ξ) 2n are Caratheodory functions. If |ϕξ (x, ξ)| b(x) + a|ξ|r , where b ∈ L n+2 (Ω), n+2 (if n ≤ 2, then the restriction is not necessary), then the a > 0, and r = n−2 functional
ϕ(x, u(x))dx
f (u) = Ω
is F-differentiable on H 1 (Ω), with F-derivative
f (u), v = ϕξ (x, u(x)) · v(x)dx , Ω
where , is the inner product on H 1 (Ω). Proof. The Sobolev embedding theorem says that the injection i : H 1 (Ω) → 2n 2n L n−2 (Ω) is continuous, so is the dual map i∗ : L n+2 (Ω) → (H 1 (Ω))∗ . 2n 2n According to Theorem 1.1.5, ϕξ (·, ·) : L n−2 → L n+2 is continuous. Therefore the Gateaux derivative
ϕξ (x, u(x)) · v(x)dx ∀v ∈ H 1 (Ω) df (u, v) = Ω
is continuous from H 1 (Ω) to (H 1 (Ω))∗ . Applying Theorem 1.1.3, we conclude that f is F-differentiable on H 1 (Ω). The proof is complete. Corollary 1.1.8 In Corollary 1.1.6, the differential operator f (u(x)) = ϕ(x, Dm u(x)) from C l,γ (Ω) to C l−m,γ (Ω), l m, 0 γ < 1, is F-differentiable, with ϕα (x, Dm u(x))∂ α h(x) ∀h ∈ C l,γ (Ω) . (f (u0 )h)(x) = |α|≤m
1.1 Differential Calculus in Banach Spaces
9
1.1.3 High-Order Derivatives The second-order derivative of f at x0 is defined to be the derivative of f (x) at x0 . Since f : U → L(X, Y ), f (x0 ) should be in L(X, L(X, Y )). However, if we identify the space of bounded bilinear mappings with L(X, L(X, Y )), and verify that f (x0 ) as a bilinear mapping is symmetric, see Theorem 1.1.9 below, then we can define equivalently the second derivative f (x0 ) as follows: For f : U → Y , x0 ∈ U ⊂ X, if there exists a bilinear mapping f (x0 )(·, ·) of X × X → Y satisfying 1 f (x0 +h)−f (x0 )−f (x0 )h− f (x0 )(h, h) = ◦( h 2 ) ∀h ∈ X, as h → 0 , 2 then f (x0 ) is called the second-order derivative of f at x0 . By the same manner, one defines the mth-order derivatives at x0 successively: f (m) (x0 ) : X × · · · × X → Y is an m-linear mapping satisfying m (j) f (x0 )(h, . . . , h) f (x0 + h) − = ◦( h m ) , j! j=0 as h → 0. Then f is called m differentiable at x0 . Similar to the finite-dimensional vector functions, we have: Theorem 1.1.9 Assume that f : U → Y is m differentiable at x0 ∈ U . Then for any permutation π of (1, . . . , m), we have f (m) (x0 )(h1 , . . . , hm ) = f (m) (x0 )(hπ(1) , . . . , hπ(m) ) . Proof. We only prove this in the case where m = 2, i.e., f (x0 )(ξ, η) = f (x0 )(η, ξ) ∗
∀ξ, η ∈ X .
∗
Indeed ∀y ∈ Y , we consider the function ϕ(t, s) = y ∗ , f (x0 + tξ + sη) . It is twice differentiable at t = s = 0; so is ∂2 ∂2 ϕ(0, 0) = ϕ(0, 0) . ∂t∂s ∂s∂t Since f (x0 + tξ + sη) is continuous as |t|, |s| small, one has ∂ ϕ(t, ·)|s=0 = y ∗ , f (x0 + tξ)η ; ∂s and then, ∂2 ϕ(t, s)|t=s=0 = y ∗ , f (x0 )(ξ, η) . ∂t∂s Similarly ∂2 ϕ(t, s)|t=s=0 = y ∗ , f (x0 )(η, ξ) . ∂s∂t This proves the conclusion.
10
1 Linearization
Theorem 1.1.10 (Taylor formula) Suppose that f : U → Y is continuously m-differentiable. Assume the segment {x0 + th | t ∈ [0, 1]} ⊂ U . Then f (x0 + h) =
m 1 (j) f (x0 )(h, . . . , h) j! j=0
1 1 (1 − t)m f (m+1) (x0 + th)(h, . . . , h)dt . + m! 0
Proof. ∀y ∗ ∈ Y ∗ , we consider the function: ϕ(t) = y ∗ , f (x0 + th) . From the Hahn–Banach theorem and the Taylor formula for single-variable functions:
1 m 1 (j) 1 ϕ (0) + (1 − t)m ϕ(m+1) (t)dt , ϕ(1) = j! m! 0 j=0 we obtain the desired Taylor formula for mappings between B-spaces.
Example 1. X = Rn , Y = R1 . If f : X → Y is twice continuously differentiable, then 2 ∂ f (x) . f (x) = Hf (x) = ∂xi ∂xj i,j=1,...,n Example 2. X = C 1 (Ω, RN ), Y = R1 . Suppose that g ∈ C 2 (Ω × RN , R1 ). Define
1 |∇u|2 + g(x, u(x)) f (u) = 2 Ω Ω as u ∈ X. By definition, we have
f (u) · ϕ = [∇u(x)∇ϕ(x) + gu (x, u(x))ϕ(x)]dx , Ω
and f (u)(ϕ, ψ) =
[∇ψ(x)∇ϕ(x) + guu (x, u(x))ϕ(x)ψ(x)]dx .
Ω With some additional growth conditions on guu : 4
(x, u)| ≤ a(1 + |u| n−2 ), a > 0 ∀u ∈ RN , |guu
f is twice differentiable in H01 (Ω, RN ). As an operator from H01 (Ω, RN ) into itself, f (u) = id + (−)−1 gu (·, u(·)) .
1.1 Differential Calculus in Banach Spaces
11
is self-adjoint, or equivalently, the operator − + guu (x, u(x))· defined on L2 2 1 N is self-adjoint with domain H ∩ H0 (Ω, R ).
Example 3. Let X = H01 (Ω, R3 ), where Ω is a plane domain. Consider the volume functional
u · (ux ∧ uy ) . Q(u) = Ω
One has Q (u) · ϕ =
ϕ(ux ∧ uy ) + u · [(ϕx ∧ uy ) + (ux ∧ ϕy )] , Ω
and Q (u)(ϕ, ψ) =
ϕ[(ψx ∧ uy ) + (ux ∧ ψy )] + ψ[(ϕx ∧ uy ) + (ux ∧ ϕy )] Ω
+ u[(ϕx ∧ ψy ) + (ψx ∧ ϕy )] , ∀ϕ, ψ ∈ H01 (Ω, R3 ). If further we assume u ∈ C 2 (Ω, R3 ), then from integration by parts and the antisymmetry of the exterior product, we have
u(ϕx ∧ uy ) = − (ϕ ∧ uy ) · ux + (ϕ ∧ uxy ) · u Ω
Ω = (ux ∧ uy )ϕ − (ϕ ∧ uxy ) · u , Ω
and
Ω
u(ux ∧ ϕy ) = − uy (ux ∧ ϕ) + u(uxy ∧ ϕ) Ω Ω
ϕ(ux ∧ uy ) + (ϕ ∧ uxy )u . =
Ω
Therefore, Q (u) = 3
Ω
ϕ · (ux ∧ uy ) . Ω
By the same manner, we obtain
Q (u)(ϕ, ψ) = 3 u[(ϕx ∧ ψy ) + (ϕy ∧ ψx )] . Ω C
2
Geometrically, let u : Ω → R3 be a parametrized surface in R3 ; Q(U ) is the volume of the body enclosed by the surface. As exercises, one computes the first- and second-order differentials of the following functionals:
12
1 Linearization
1. X = W01,p (Ω, R1 ), Y = R1 , 2 < p < ∞,
f (u) = |∇u|p dx . Ω
2. X = C01 (Ω, Rn ), where Ω ⊂ Rn is a domain,
f (u) = det(∇u(x))dx . Ω
3. X = C01 (Ω, R1 ), where Ω ⊂ Rn is a domain,
f (u) = 1 + |∇u|2 dx . Ω
1.2 Implicit Function Theorem and Continuity Method 1.2.1 Inverse Function Theorem It is known that the implicit function theorem for functions of several variables plays important roles in many branches of mathematics (differential manifold, differential geometry, differential topology, etc.). Its extension to infinite-dimensional space is also extremely important in nonlinear analysis, as well as in the study of infinite-dimensional manifolds. Theorem 1.2.1 (Implicit function theorem) Let X, Y , Z be Banach spaces, U ⊂ X × Y be an open set. Suppose that f ∈ C(U, Z) has an F-derivative w.r.t. y, and that fy ∈ C(U, L(Y, Z)). For a point (x0 , y0 ) ∈ U , if we have f (x0 , y0 ) = θ , fy−1 (x0 , y0 ) ∈ L(Z, Y ) ; then ∃r, r1 > 0, ∃|u ∈ C(Br (x0 ), Br1 (y0 )), such that ⎧ ⎨ Br (x0 ) × Br1 (y0 ) ⊂ U , u(x0 ) = y0 , ⎩ f (x, u(x)) = θ ∀x ∈ Br (x0 ) . Furthermore, if f ∈ C 1 (U, Z), then u ∈ C 1 (Br (x0 ), Y ), and u (x) = −fy−1 (x0 , u(x0 )) ◦ fx (x, u(x))
∀x ∈ Br (x0 ) .
(1.1)
1.2 Implicit Function Theorem and Continuity Method
13
Proof. (1) After replacing f by g(x, y) = fy−1 (x0 , y0 ) ◦ f (x + x0 , y + y0 ) , one may assume x0 = y0 = θ, Z = Y and fy (θ, θ) = idY . (2) We shall find the solution y = u(x) ∈ Br1 (θ) of the equation f (x, y) = θ
∀x ∈ Br (θ) .
Setting R(x, y) = y − f (x, y) , it is reduced to finding the fixed point of R(x, ·) ∀x ∈ Br (θ). We shall apply the contraction mapping theorem to the mapping R(x, ·). Firstly, we have a contraction mapping: R(x, y1 ) − R(x, y2 ) = y1 − y2 − [f (x, y1 ) − f (x, y2 )]
1 fy (x, ty1 + (1 − t)y2 )dt · (y1 − y2 ) = y 1 − y2 −
0 1
idY − fy (x, ty1 + (1 − t)y2 ) dt· y1 − y2 . 0
Since fy : U → L(X, Y ) is continuous, ∃r, r1 > 0 such that R(x, y1 ) − R(x, y2 ) <
1 y1 − y2 2
(1.2)
∀(x, yi ) ∈ Br (θ) × Br1 (θ), i = 1, 2. Secondly, we are going to verify R(x, ·) : B r1 (θ) → B r1 (θ). Indeed, R(x, y) R(x, θ) + R(x, y) − R(x, θ) 1 f (x, θ) + y . 2 For sufficiently small r > 0, where f (x, θ) <
1 r1 , 2
∀x ∈ B r (θ) ,
(1.3)
it follows that R(x, y) < r1 , ∀(x, y) ∈ Br (θ) × Br1 (θ). Then, ∀x ∈ B r (θ), ∃|y ∈ B r1 (θ) satisfying f (x, y) = θ. Denote by u(x) the solution y. (3) We claim that u ∈ C(Br , Y ). Since u(x) − u(x ) = R(x, u(x)) − R(x , u(x )) 1 u(x) − u(x ) + R(x, u(x)) − R(x , u(x)) , 2 we obtain
14
1 Linearization
u(x) − u(x ) 2 R(x, u(x)) − R(x , u(x)) .
(1.4)
Noticing that R ∈ C(U, Y ), we have u(x ) → u(x) as x → x . (4) If f ∈ C 1 (U, Y ), we want to prove u ∈ C 1 . First, by (1.2) and (1.4) u(x) − u(x ) 2 f (x, u(x)) − f (x , u(x ))
1 fx (tx + (1 − t)x , u(x)) dt· x − x . 2 0
Therefore u(x + h) − u(x) = O( h )
for
h → 0 .
From f (x + h, u(x + h)) = f (x, u(x)) = θ , it follows that f (x + h, u(x + h)) − f (x, u(x + h)) + [f (x, u(x + h)) − f (x, u(x))] = θ ; also fx (x, u(x + h))h + ◦( h ) + fy (x, u(x))(u(x + h) − u(x)) + ◦( h ) = θ . Therefore u(x + h) − u(x) + fy−1 (x, u(x)) ◦ fx (x, u(x + h))h = ◦( h ) , i.e., u ∈ C 1 , and u (x) = −fy−1 (x, u(x)) ◦ fx (x, u(x)) . Remark 1.2.2 In the first part of Theorem 1.2.1, the space X may be assumed to be a topological space. In fact, neither linear operations nor the properties of the norm were used. Theorem 1.2.3 (Inverse function theorem) Let V ⊂ Y be an open set, and g ∈ C 1 (V, X). Assume y0 ∈ V and g (y0 ) ∈ L(X, Y ). Then there exists δ > 0 such that Bδ (y0 ) ⊂ V and g : Bδ (y0 ) → g(Bδ (y0 )) is a differmorphism. Furthermore (g −1 ) (x0 ) = g −1 (y0 ), with x0 = g(y0 ) .
(1.5)
1.2 Implicit Function Theorem and Continuity Method
15
Proof. Set f (x, y) = x − g(y),
f ∈ C 1 (X × V, X) .
We use the implicit function theorem (IFT) to f , there exist r > 0 and a unique u ∈ C 1 (Br (x0 ), Br (y0 )) satisfying x = g ◦ u(x) . Since g is continuous, ∃δ ∈ (0, r) such that g(Bδ (y0 )) ⊂ Br (x0 ), therefore g : Bδ (y0 ) → g(Bδ (y0 )) is a diffeomorphism. And (1.5) follows from (1.1). In the spirit of the IFT, we have a nonlinear version of the Banach open mapping theorem. Theorem 1.2.4 (Open mapping) Let X, Y be Banach spaces, and let δ > 0 and y0 ∈ Y . Suppose that g ∈ C 1 (Bδ (y0 ), X) and that g (y0 ) : Y → X is an open map, then g is an open map in a neighborhood of y0 . Proof. We want to prove that ∃δ1 ∈ (0, δ) and r > 0, such that Br (g(y0 )) ⊂ g(Bδ1 (y0 )) . With no loss of generality, we may assume y0 = θ and g(y0 ) = θ. Let A = g (θ). Since A is surjective, ∃C > 0 such that inf
z∈ker A
y − z Y C Ay X , ∀ y ∈ Y ,
(1.6)
provided by the Banach inverse theorem. One chooses δ1 ∈ (0, δ) and r > 0, satisfying 1 ∀y ∈ Bδ1 (θ) , g (y) − A 2(C + 1) and r<
δ1 . 2(C + 1)
Now, ∀x ∈ Br (θ), we are going to find y ∈ Bδ1 (θ), satisfying g(y) = x. Write R(y) = g(y) − Ay . The problem is equivalent to solving the following equation: Ay = x − R(y) .
(1.7)
We solve it by iteration. Initially, we take h0 = θ. Suppose that hn ∈ Bδ1 (θ) has been chosen; from (1.6), we can find hn+1 , satisfying Ahn+1 = x − R(hn ) , and
16
1 Linearization
hn+1 − hn (C + 1) A(hn+1 − hn ) . Thus hn+1 − hn (C + 1) R(hn ) − R(hn−1 )
1 g (thn + (1 − t)hn−1 )dt − A · hn − hn−1 = (C + 1) 0
1 ≤ hn − hn−1 2
∀n 1 .
Since h1 (1 + C) x
1 δ1 , 2
and hn+1 h1 +
n
hj+1 − hj
j=1
1 1 1 + · · · + n + n+1 2 2 2
δ1 < δ1 ,
it follows that hn+1 ∈ Bδ1 (θ). Then we can proceed inductively. The sequence hn has a limit y. Obviously y is the solution of (1.7).
Essentially, the implicit function theorem is a consequence of the contraction mapping theorem. The continuity assumption of fy in Theorem 1.2.2 seems too strong in some applications. We have a weakened version. Theorem 1.2.5 Let X, Y, Z be Banach spaces, and let Br (θ) ⊂ Y be a closed ball centered at θ with positive radius r. Suppose that T ∈ L(Y, Z) has a bounded inverse, and that η : X × Br → Z satisfies the following Lipschitz condition: η(x, y1 ) − η(x, y2 ) K y1 − y2
∀y1 , y2 ∈ Br (θ), ∀x ∈ X
where K < T −1 −1 . If η(θ, θ) = θ, and η(x, θ) ( T −1 −1 −K)r ; then ∀x ∈ X, there exists a unique u : X → Br (θ) satisfying T u(x) + η(x, u(x)) = θ
∀x ∈ X .
Furthermore, if η is continuous, then so is u. Proof. ∀x ∈ X we find the fixed point of the map −T −1 η(x, y). It is easily verified that T −1 · η(x, ·) : Br (θ) → Br (θ) is a contraction mapping.
1.2 Implicit Function Theorem and Continuity Method
17
1.2.2 Applications As we mentioned in the beginning of this section, the IFT plays an important role in solving nonlinear equations. However, the IFT is only a local statement. If a problem is local, then it is extremely powerful for local solvability. As to global solvability problems, we first solve them locally, and then extend the solutions by continuation. In this case, the IFT is applied in the first step. However, in this subsection we only present several examples to show how the method works for local problems, and in the next subsection for global problems. Example 1. (Structural stability for hyperbolic systems) A matrix L ∈ GL(n, R) is called hyperbolic if the set of eigenvalues of L, σ(L) ∩ iR1 = ∅. The associate differential system reads as: x˙ = Lx, x ∈ C 1 (R1 , Rn ) . The flow φt = eLt ∈ GL(n, R) is also linear. The flow line can be seen on the left of Fig. 1.1. Let ξ ∈ C 0,1 (Rn , Rn ) be a Lipschitzian (Lip.) map we investigate the hyperbolic system under the nonlinear perturbation: x˙ = Lx + ξ(x), x ∈ C 1 (R1 , Rn ) , and let ψt be the associate flow, the flow line of which is on the right of Fig. 1.1. What is the relationship between φt and ψt , if ξ is small? One says that the hyperbolic system is structurally stable, which means that the flow lines φt and ψt are topologically equivalent. More precisely, there is a homeomorphism h : Rn → Rn such that h ◦ ψt = φt ◦ h. We shall show that the hyperbolic system is structurally stable. Let A = eL , then the set of eigenvalues σ(A) of A satisfies σ(A) ∩ S 1 = ∅. We decompose ψ1 = A + f , where f ∈ C 0,1 (Rn , Rn ), it is known that the Lipschitzian constant of f is small if that of ξ is. To the matrix A ∈ GL(n, R), since σ(A) ∩ S 1 = ∅, provided by the Jordan n form, we have the decomposition R = Eu Es , where Eu , Es are invariant subspaces, on which the eigenvalues of Au := A|Eu lie outside the unit circle, and those of As := A|Es lie inside the unit circle. Due to these facts, one has As < 1, A−1 u <1. The following notations are used for any Banach spaces X, Y . C 0 (X, Y ) stands for the space of all bounded and continuous mappings h : X → Y with norm: h = sup h(x)Y . x∈X
0,1
C (X, Y ) stands for the space of all bounded Lipschitzian maps from X to Y with norm:
18
1 Linearization ψt
φt
ψt
Rn
Rn
h
h
φt
Rn
Rn
h ◦ ψt = φt ◦ h
Fig. 1.1.
h = sup h(x)Y + x∈X
sup x∈X,y∈X
h(x) − h(y)Y . x − yX
We shall prove: Theorem 1.2.6 (Hartman–Grobman) ∃ > 0, such that there exists a unique homeomorphism h : Rn → Rn satisfying φt ◦ h = h ◦ ψt ∀t ,
(1.8)
if f C 0,1 < . Proof. (1) First we prove the case t = 1, and would rather consider the problem more generally: assume g ∈ C 0,1 (Rn , Rn ) with gC 0,1 < . We are going to solve continuous mappings h, k : Rn → Rn satisfying h ◦ (A + f ) = (A + g) ◦ h and k ◦ (A + g) = (A + f ) ◦ k ,
(1.9)
respectively. −1 −1 Let 0 < < A−1 and (A + g)−1 exist. We , then both (A + f ) n decompose R = Eu Es and let Pu and Ps be the projections onto Eu and Es , respectively. Let r = h − id, then equation (1.9) for r is equivalent to (A + g) ◦ (id + r) = (id + r) ◦ (A + f ) ,
1.2 Implicit Function Theorem and Continuity Method
19
i.e., A ◦ r = f − g ◦ (id + r) + r ◦ (A + f ) , or ⎧ −1 −1 −1 ⎪ ⎨Pu r = Au ◦ Pu r ◦ (A + f ) + Au ◦ Pu f − Au ◦ Pu g ◦ (id + r) (1.10) Ps r = As ◦ Ps r ◦ (A + f )−1 − Ps f ◦ (A + f )−1 ⎪ ⎩ + Ps g ◦ (id + r) ◦ (A + f )−1 . We do the same for the equation of k. (2) From the decomposition C 0 (Rn , Rn ) = C 0 (Rn , Eu ) C 0 (Rn , E s ), we As ◦ reduce (1.10) to the form of Theorem 1.2.5. Set Sr = A−1 u ◦Pu r◦(A+f ) Ps r ◦ (A + f )−1 . Then S ∈ L(C 0 (Rn , Rn ), C 0 (Rn , Rn )), and S < 1. Thus T := id − S is invertible. By setting (−Ps f + Ps g ◦ (id + r)) ◦ (A + f )−1 , η(f, g; r) = A−1 u ◦ (Pu f − Pu g ◦ (id + r)) Then (1.10) is equivalent to T r = η(f, g; r) . Since η(f, g; r) is Lip. with respect to r, with Lip. constant < , and η(f, g; θ) < 2. For sufficiently small > 0, all conditions of Theorem 1.2.5 are met. There exists a unique continuous map r in a neighborhood of θ in C 0 (Rn , Rn ), which is continuously dependent on f and g. Similarly, let q = k − id, one proves the existence of a unique continuous map q = q(f, g) in the same neighborhood. (3) Setting h = id + r, k = id + q, we prove that h ◦ k = k ◦ h = id. In fact h ◦ k and k ◦ h satisfy the equations: h ◦ k = (A + g)−1 ◦ (h ◦ k) ◦ (A + g) , and
k ◦ h = (A + f )−1 ◦ (k ◦ h) ◦ (A + f ) ,
respectively. Both the equations have the unique solution id in a neighborhood of θ, and the conclusion is proved. (4) We now prove the conclusion for arbitrary t. We have φ1 ◦ (φt ◦ h ◦ ψ−t ) = (φt ◦ φ1 ) ◦ (h ◦ ψ−t ) = (φt ◦ h ◦ ψ−t ) ◦ ψ1 . Also as |t − 1| < δ for small δ > 0, φt ◦ h ◦ ψ−t − id ∈ C 0 (Rn , Rn ) is in a small neighborhood of θ, and the above equation has a unique solution h there; therefore φt ◦ h ◦ ψ−t = h . Then we can extend the procedure step by step to all t, i.e. we have φt ◦ h = h ◦ ψt ∀t ∈ R1 .
20
1 Linearization
Example 2. (Local existence of isothermal coordinates) Given a surface M 2 with a Riemannian metric g, i.e., in local coordinates x = (x1 , x2 ), g = Edx21 + 2F dx1 dx2 + Gdx22 , where E, F and G are functions of local coordinates x = (x1 , x2 ), and ∀(x1 , x2 ), Eξ 2 +2F ξη +Gη 2 is a positive definite quadratic form. Our problem is to find a local coordinate u(x) = (u1 (x1 , x2 ), u2 (x1 , x2 )) in a neighborhood of x0 = (x01 , x02 ) such that there exists a function λ = λ(x1 , x2 ) > 0 satisfying g = λ(x1 , x2 )(du21 + du22 ) . The local coordinate u = (u1 , u2 ) is called an isothermal coordinate. We shall find u = (u1 , u2 ) satisfying ⎧ ⎨ λ(x)|∂x1 u(x)|2 = E(x) , λ(x)∂x1 u(x) · ∂x2 u(x) = F (x) , ⎩ λ(x)|∂x2 u(x)|2 = G(x) .
(1.11)
We may assume (x01 , x02 ) = (0, 0) and F (0, 0) = 0 (by translation and rotation of the local coordinates). After eliminating λ, (1.11) is equivalent to: F |∂x1 u|2 = E∂x1 u · ∂x2 u (1.12) F |∂x2 u|2 = G∂x1 u · ∂x2 u . This is a first-order nonlinear differential system. In a neighborhood O of θ = (0, 0), define F (x) · |∂x1 u(x)|2 − E(x) · ∂x1 u(x) · ∂x2 u(x) ϕ(x, ∇u(x)) = , F (x) · |∂x2 u(x)|2 − G(x) · ∂x1 u(x) · ∂x2 u(x) , ∀x ∈ O, and let f be the map satisfying f (u)(x) = ϕ(x, ∇u(x)) . We want to solve the equation: f (u) = θ .
(1.13)
Let x = εy, where y ∈ D, the unit disk on the coordinate plane, and ε > 0 is a parameter, and let (1.14) εv(y) = u(x) − u(x) . where u = (p1 x1 + p2 x2 , q1 x1 + q2 x2 ), and (p1 , p2 , q1 , q2 ) is chosen such that the following conditions are satisfied: ∂(u1 , u2 ) = 0 , ∂(x1 , x2 )
1.2 Implicit Function Theorem and Continuity Method
21
and ϕ(0, ∇u) = θ . In fact, this is an algebraic system with four unknowns, and is trivially solvable. Equation (1.13) is equivalent to ϕ(εy, ∇y v(y) + ∇x u(εy)) = 0 . ¯ denote the space C 1,α (D) ¯ modulo a constant. Set F : R1 × Let C˙ 1,α (D) ˙ 1,α 0 α 2 ∩ C0 (D) C (D)) → C (D) , for some α ∈ (0, 1), where (C 1,α
F (ε, v) = ϕ(εy, ∇y v(y) + ∇x u(εy)) . Thus F (0, θ) = θ . It remains to find a pair (ε, v) for small ε > 0, satisfying F (ε, v) = θ . Then by the transform(1.14), the solution u in a small neighborhood of θ εD is obtained. Note that (p1 , q1 , p2 , q2 ) = (u1,x1 , u2,x1 , u1,x2 , u2,x2 ). Let us introduce the notation (E0 , F0 , G0 ) = (E, F, G)|(0,0) ; we have Fv (0, θ)h = −(A1 ∇h1 + A2 ∇h2 ) , where h = (h1 , h2 ) ∈ C 1,α ∩ C00 (D) C˙ 1,α (D), and (E0 p2 − 2F0 p1 ) E0 p1 A1 = , G0 p2 (G0 p1 − 2F0 p2 ) (E0 q2 − 2F0 q1 ) E0 q1 . A2 = G0 q2 (G0 q1 − 2F0 q2 ) This is a constant coefficient first-order linear differential operator with the 2 × 2 matrix symbol: L = (A1 ω, A2 ω) , where ω = (ξ, η). Since det L = −2F0 (E0 ξ 2 − 2F0 ξη + G0 η 2 )
∂(u, v) = 0 ∂(x, y)
∀(ξ, η) ∈ R2 \{θ}, L is elliptic. According to the elliptic theory, Fv (0, ·) has a bounded inverse. The IFT is applied to conclude the existence of ε0 > 0 such that the equation F (ε, v) = θ has a unique solution vε , ∀ε ∈ (−ε0 , ε0 ).
22
1 Linearization
Remark 1.2.7 The boundary condition for the first-order system can be deduced from the second-order elliptic theory. In fact, h = (h1 , h2 ) satisfies A1 ∇h1 + A2 ∇h2 = f ,
(1.15)
where f is given. Suppose that A2 is invertible (it is available); we have ∇h2 = C∇h1 + A−1 2 f , where
(1.16)
C = −A−1 2 A1 ,
Let E= Then E −1 =
0 1 −1 0
0 1
−1 0
. ,
and E 2 = −I. Since h2,xy = h2,yx ,
(1.17)
we obtain a second-order equation for h1 , in which the principal symbol of the second-order equation reads as 1 E 2 (A2 ω)T E −1 A1 ω det(A2 ) 1 (A2 ω)T E −1 A1 ω = det(A2 ) det(L) . = det(A2 )
−ω T EA−1 2 A1 ω = −
The later is positive (or negative) definite because the first-order system is elliptic. Thus the Dirichlet boundary condition for h1 is well posed, and then h2 follows from (1.16) modulo a constant. Remark 1.2.8 There are many applications of the IFT similar to the above examples, e.g. a necessary and sufficient condition for an almost complex structure being a complex structure (Newlander–Nirenberg theorem, see L. Nirenberg [NN]), prescribing Ricci curvature problem (see DeTurck [DT] etc.). For applications to boundary value problems in ordinary and partial differential equations see S.N. Chow, J. Hale [CH] and J. Mawhin [Maw 3]
1.2 Implicit Function Theorem and Continuity Method
23
1.2.3 Continuity Method We have shown the usefulness of the IFT in the existence of solutions for small perturbations of a given equation which has a known solution. As to large perturbations, the IFT is not enough, we have to add new ingredients. The continuity method is a general principle, which can be applied to prove the existence of solutions for a variety of nonlinear equations. Let X and Y be Banach spaces, and f : X → Y be C 1 . Find the solution of the equation: f (x) = θ . Let us introduce a parameter t ∈ [0, 1] and a map F : [0, 1] × X → Y such that both F and Fx are continuous; in addition, F (1, x) = f (x) . Assume that there exists x0 ∈ X satisfying F (0, x0 ) = θ; we want to extend the solution x0 of the equation F (0, x) = θ to a solution of F (1, x) = θ .
(1.18)
For this purpose, we define a set S = {t ∈ [0, 1] | such that F (t, x) = θ is solvable} . What we want to do is to prove: (1) S is an open set (relative to [0, 1]). For this purpose, it is sufficient to prove that ∀t0 ∈ S, ∃xt0 ∈ X, which solves F (t0 , xt0 ) = θ such that Fx−1 (t0 , xt0 ) ∈ L(Y, X), provided by the IFT. (2) S is a closed set. Usually it depends on the a priori estimates for the solution set {x ∈ X | ∃t ∈ S, such that F (t, x) = θ}. For most PDE problems it requires special knowledge and features of the equations and techniques in hard analysis. We present here two major ideas: (a) If there exist a Banach space X1 , which is compactly embedded in X, and a constant C > 0 such that xt X1 C
∀t ∈ S ,
where xt is a solution of F (t, x) = θ, then S is closed.
24
1 Linearization
In fact, we have {tn }∞ ⊂ S, which implies tn → t∗ , and xtn X1 C . Since the embedding X1 → X is compact, xtn subconverges to some point x∗ ∈ X in X. From the continuity, it follows that F (t∗ , x∗ ) = θ. This proves t∗ ∈ S, i.e., S is closed. (b) If ∀t ∈ S, there exists a unique local solution xt of the equation F (t, ·) = θ, and if there exists C > 0 such that x˙ t X C , where x˙ t is the derivative of xt , then S is a closed set. Proof. Let {tn }∞ 1 be a sequence included in an open interval contained in S, with tn ↑ t∗ . Then
tn xtn − xtm x˙ t dt C(tn − tm ) → 0 , tm
as n m → ∞. Let x∗ be the limit. If the IFT is applicable to (t∗ , x∗ ), then we have t∗ ∈ S, i.e., S is closed. Once (1) and (2) are proved, S is a nonempty (0 ∈ S) open and closed set. Therefore S = [0, 1], and then the equation F (1, ·) = θ is solvable. As an application of the continuity method, we have: Theorem 1.2.9 (Global implicit function theorem) Let X, Y be Banach spaces, and let f ∈ C 1 (X, Y ) with f (x)−1 ∈ L(Y, X) ∀x ∈ X. If ∃ constants A, B > 0 such that f (x)−1 A x +B
∀x ∈ X ,
then f is a diffeomorphism. Proof. (1) Surjective. We want to prove that ∀y ∈ Y, ∃x ∈ X satisfying f (x) = y . ∀x0 ∈ X, define F : [0, 1] × X → Y as follows: F (t, x) = f (x) − [(1 − t)f (x0 ) + ty] . Set S = {t ∈ [0, 1]| F (t, ·) = θ is solvable}. Obviously, 0 ∈ S, and since Fx−1 (t, x) = f (x)−1 ∈ L(Y, X), S is open, from the IFT.
1.2 Implicit Function Theorem and Continuity Method
25
It remains to prove the closeness of S. Indeed, in a component (a, b) of S, there is a branch of solutions xt satisfying F (t, xt ) = θ and then
∀t ∈ (a, b) ,
f (xt )x˙ t = y − f (x0 ) .
Thus, x˙ t f (xt )−1 y − f (x0 ) (A xt +B) y − f (x0 ) . Set c =
a+b 2 ,
(1.19)
so
t
xt xc +
y − f (x0 ) (A xs +B)ds
as t > c .
c
Applying Gronwall’s inequality, ∃ a constant C > 0 such that xt C .
(1.20)
Substituting (1.20) into (1.19), we have another constant C1 > 0 such that x˙ t C1 , ∀t ∈ (a, b) . This proves the closeness of S, therefore f is surjective. (2) Injective. We argue by contradiction. If ∃y ∈ Y and x0 , x1 ∈ X, satisfying f (xi ) = y, i = 0, 1. Let γ : [0, 1] → X be the segment connecting these two points: γ(s) = (1 − s)x0 + sx1 s ∈ [0, 1] . Thus f ◦γ is a loop passing through y. If we could find x : [0, 1] → X satisfying x(i) = xi i = 0, 1,
and
f ◦ x(s) = y ∀s ∈ [0, 1] , then this would contradict with the locally homeomorphism of f . Define I = [0, 1] and T : I × C0 (I, X) → C0 (I, Y ) as follows: (t, u(s)) → f (γ(s) + u(s)) − ty − (1 − t)f (γ(s)) , where C0 (I, X) = {u ∈ C(I, X)| u(0) = u(1) = θ} . We want to solve T (t, u) = θ . Obviously, T (0, θ) = θ; and if we have u ∈ C0 (I, X) satisfying T (1, u(·)) = θ, then x(s) = u(s) + γ(s) is what we need. Now,
26
1 Linearization
f
r
y
x1 x0
r Fig. 1.2.
1.
Tu (t, u) = f (γ(·) + u(·)) ∈ L(C0 (I, X), C0 (I, Y )) , which has a bounded inverse. Therefore S = {t ∈ [0, 1]| T (t, u) = θ is solvable} is open, from the IFT.
2. Let ut (s) be a solution at t ∈ S. Then f (γ(s) + ut (s)) · u˙ t (s) = y − f ◦ γ(s) , where u˙ t denotes the derivative with respect to t. Again we obtain u˙ t C0 (I,X) (A ut C0 (I,X) +B1 ) y − f ◦ γ C0 (I,Y ) , where B1 > 0 is another constant depending on B and x0 , x1 only. As in paragraph (1), ∃C > 0 such that u˙ t C0 (I,X) C
∀t ∈ S .
Again, by the continuity method, 1 ∈ S. This is the contradiction. The injectivity of f is proved. Next we shall give an example showing how a priori estimates give the closeness of S. Theorem 1.2.10 Suppose f ∈ C 1 (Ω × R1 × Rn , R1 ), where Ω ⊂ Rn is a bounded domain of smooth boundary. Assume ∃ constants C > 0, satisfying 1 1 → R+ such that (1) There exists an increasing function c : R+
|f (x, η, ξ)| ≤ c(|η|)(1 + |ξ|2 ), ∀ (x, η, ξ) ∈ Ω × R1 × Rn . (2) ∂f (x, η, ξ) 0 . ∂η
1.2 Implicit Function Theorem and Continuity Method
27
(3) Assume ∃M > 0 such that < 0, if η > M f (x, η, θ) = > 0, if η < −M . Assume φ ∈ C 2,γ , for some γ ∈ (0, 1). Then the equation −u = f (x, u(x), ∇u(x)) x ∈ Ω u|∂Ω = φ
(1.21)
possesses a unique solution in C 2,γ . Lemma 1.2.11 Under the assumption (3), if u ∈ C 2 (Ω) is a solution of (1.21), then u C(Ω) max max |φ(x)|, M . ∂Ω
Proof. Assume that |u(x)| attains its maximum at x0 ∈ Ω. We divide our discussion into two cases. (1) x0 ∈ ∂Ω; the proof is done. ◦
(2) x0 ∈ Ω, then ∇u(x0 ) = 0 and −u(x0 ) = f (x0 , u(x0 ), θ). If u(x0 ) > M , then LHS 0, but RHS < 0. It is impossible. Similarly, if u(x0 ) < −M , then LHS 0, but RHS > 0. Again, it is impossible. We have |u(x0 )| M . Lemma 1.2.12 Assume a ∈ C 0,γ (Ω) and φ ∈ C 2,γ (∂Ω). Then the equation −u + u = a(x)(1 + |∇u|2 ) (1.22) u|∂Ω = φ has a unique solution u ∈ C 2,γ (Ω), and u C 2,γ C( a C 0,γ , φ C 2,γ ) . Proof. We apply the continuity method to study equation (1.22). Define a map F : X × [0, 1] → Y as follows: (u, τ ) → (−u + u − a(τ + |∇u|2 ), u|∂Ω − τ φ) , where X = C 2,γ (Ω), Y = C 0,γ (Ω) × C 2,γ (∂Ω) and γ ∈ (0, γ). Noticing that Fu (u, τ )v = ((−v + v − a∇u · ∇v), v|∂Ω ) ,
28
1 Linearization
and from the Schauder estimates, ∀(u, τ ) ∈ X × [0, 1], Fu (u, τ ) has a bounded inverse. Define the set: S = {τ ∈ [0, 1]| ∃uτ solving F (uτ , τ ) = θ} . Equation (1.22) is solvable if 1 ∈ S. Since S is open, and 0 ∈ S, it remains to verify that the set S is closed. To this end, it is sufficient to prove that there is a constant C, depending on a and φ such that ∀uτ ∈ S, uτ C 2,γ C .
(1.23)
τ Since uτ satisfies F (uτ , τ ) = θ, u˙ τ = du dτ exists, from the IFT, and satisfies: −u˙ τ + u˙ τ = a + 2a∇uτ · ∇u˙ τ , (1.24) u˙ τ |∂Ω = φ .
Set g = a + 2a∇uτ · ∇u˙ τ ; we have u˙ τ W 2,p C(p)(1+ g Lp ) C(p, a C )(1+ ∇uτ L2p ∇u˙ τ L2p ) , provided by the Lp estimates. Since u˙ τ satisfies (1.24), from Lemma 1.2.11, u˙ τ C(Ω) is bounded by a constant depending on a C(Ω) and φ, and from the Gagliardo–Nirenberg inequality 1
1
∇u˙ τ L2p Cp ∇2 u˙ τ L2 p u˙ τ L2 p +C u˙ τ L∞ , we obtain: u˙ τ W 2,p C(1+ ∇uτ 2L2p ) . Again, by the Gagliardo–Nirenberg inequality, we have 1
1
∇uτ L2p Cp ∇2 uτ L2 p uτ L2 p +C uτ L∞ . Repeating the use of Lemma 1.2.11, uτ C is bounded by a constant depending on φ C , and we obtain u˙ τ W 2,p C( φ C 2,γ , a C , p)(1+ uτ W 2,p ) . From
d uτ W 2,p u˙ τ W 2,p , dτ and the Gronwall inequality, we obtain uτ W 2,p CeCτ , where C depends on p, φC 2,γ and aC .
1.2 Implicit Function Theorem and Continuity Method
As a consequence of the Sobolev embedding theorem, for p > uτ C 1,γ C( φ C 2,γ , a C , γ) .
n 1−γ ,
29
we have (1.25)
Substituting into the equation F (uτ , τ ) = θ, we apply the Schauder estimate: uτ C 2,γ C( φ C 2,γ , a C 0,γ , γ) . The continuity method is applicable; we have a solution u of (1.22). Indeed, the solution is unique. Let u1 , u2 be two solutions and set ω = u1 − u2 , then −ω + ω = a∇(u1 + u2 ) · ∇ω in Ω , ω|∂Ω = 0 . ◦
If max ω > 0, then ∃x0 ∈ Ω such that maxΩ ω = ω(x0 ). Thus, ∇ω(x0 ) = 0, −ω(x0 ) 0 and ω(x0 ) > 0. This is impossible. Similarly, one proves that min ω < 0 is impossible. Therefore ω ≡ 0. Now we come back to the proof of the theorem. Proof. Applying the continuity method, we study the equation: −u = tf (x, u(x), ∇u(x)) t ∈ [0, 1] u|∂Ω = tφ
(1.26)
and turn to considering the operator: F : I × C 2,σ (Ω) → C σ (Ω) × C 2,σ (∂Ω),
I = [0, 1] ,
(t, u) → (−u − tf (x, u(x), ∇u(x)), u|∂Ω − tφ) , where σ ∈ (0, γ). We want to solve F (1, u) = θ. However, ∀u ∈ C 2,σ (Ω), Fu (t, u)v = (−v − tfη (x, u(x), ∇u(x))v − tfξ (x, u(x), ∇u(x))∇v, v|∂Ω ) . By assumption (2) and the maximum principle for linear elliptic equations, ∀g ∈ C σ (Ω) × C 2,σ (∂Ω) Fu (t, u)v = g has a unique solution, i.e., Fu (t, u) : C 2,σ ∩ C0 (Ω) → C σ (Ω) × C 2,σ (∂Ω) has a bounded inverse. Thus the set S = {t ∈ I| F (t, u) = θ is solvable} is open, from the IFT. We prove that S is closed. Noting that if ut satisfies F (t, ut ) = θ ,
30
1 Linearization
then we set at (x) =
tf (x, ut (x), ∇ut (x)) + ut (x) . 1 + |∇ut (x)|2
By assumptions (1) and (3) and Lemma 1.2.11, at C ≤ C(ut C ) ≤ C(M, φC ) . Since ut satisfies (1.22), in which a is replaced by at , and φ by tφ. According to equation (1.25), ut C 1,γ ≤ C(φC 2,γ , M, γ) , and then at C 0,γ ≤ C(φC 2,γ , M, γ, f ) . Again by Lemma 1.2.12, we have uC 2,γ ≤ C(φC 2,γ , M, γ, f ) . This is the required estimate. Since the embedding C 2,γ (Ω) → C 2,σ (Ω) × C 2,σ (∂Ω) is compact, we conclude that S is closed, as we have seen previously. The existence of the solution for F (1, u) = θ follows from the continuity method. The uniqueness is a consequence of the maximum principle. Once we obtain a solution u in C 2,σ , it follows directly by Schauder esti mates that u ∈ C 2,γ Remark 1.2.13 We shall return to this example by dropping assumption (2) in Chap. 3.
1.3 Lyapunov–Schmidt Reduction and Bifurcation 1.3.1 Bifurcation We often meet an equation with a parameter λ: F (x, λ) = 0 . The following phenomenon has been observed: a branch of solutions x(λ) depending on λ, is either disappeared or split into several branches, as λ attains some critical values. This kind of phenomenon is called bifurcation. For example, a simple algebraic equation: x3 − λx = 0 λ ∈ R1 ,
1.3 Lyapunov–Schmidt Reduction and Bifurcation
31
x
λ
0
Fig. 1.3.
has a solution x = 0 ∀λ ∈ R1 . As λ 0, this is the unique solution; but as λ > 0, we have two more branches of solutions √ x=± λ. See Figure 1.3. Bifurcation phenomena occur extensively in nature. Early in 1744, Euler observed the bending of a rod pressed along the direction of its axis. Let θ be the angle between the real axis and the tangent of the central line of the rod, and let λ be the pressure. The length of the rod is normalized to be π. We obtain the following differential equation with the two free end point conditions: θ¨ + λ sin θ = 0 , ˙ ˙ θ(0) = θ(π) =0. Obviously, θ ≡ 0 is always a solution of the ODE. Actually the solution is unique, if λ is not large. As λ increasingly passes through a certain value λ0 , it is shown by experiment that there exists a bending solution θ = 0. The same phenomenon occurs in the bending of plates, shells etc. In addition, bifurcation occurs in the study of thermodynamics (B´ernard problem), rotation of fluids, solitary waves, superconductivity and lasers. Mathematically, we describe the bifurcation by the following: Definition 1.3.1 Let X, Y be Banach spaces, and let ∧ be a topological space. Suppose that F : X × ∧ → Y is a continuous map. ∀λ ∈ ∧, let Sλ = {x ∈ X| F (x, λ) = θ} be the solution set of the equation F (x, λ) = θ, where λ is a parameter (Fig. 1.4). Assume θ ∈ Sλ , ∀λ ∈ ∧. We call (θ, λ0 ) a bifurcation point, if for any neighborhood U of (θ, λ0 ), there exists (x, λ) ∈ U with x ∈ Sλ \{θ}.
32
1 Linearization
θ λ
λ Fig. 1.4.
The following problems are of primary concern: (1) What is the necessary and sufficient condition for a bifurcation point (θ, λ0 )? (2) What is the structure of Sλ near λ = λ0 ? (3) How do we compute the solutions near the bifurcation points? (4) How about the global structure of ∪λ∈∧ Sλ ? (5) Let F (x, λ) = θ be the steady equation of the evolution equation: x˙ = F (x, λ) , we study the stability of solutions in Sλ as λ approaches λ0 . In this section, we focus our discussions on problems (1) and (2). (4) will be studied in Chap. 3. For simplicity, we assume that U ⊂ X is an open neighborhood of the origin θ of the Banach space X, and that F : U × ∧ → Y is continuous, and satisfies F (θ, λ) = θ ∀λ ∈ ∧ . What is the necessary condition for a bifurcation point λ0 ∈ ∧? (1) Assume that Fx (x, λ) is continuous. If (θ, λ0 ) is a bifurcation point, then Fx (θ, λ0 ) does not have a bounded inverse. Proof. By the IFT directly.
(2) Assume F (x, λ) = Lx − λx + N (x, λ) , where L ∈ L(X, Y ), λ ∈ R1 , and that N : U × R1 → X is continuous with N (x, λ) = ◦( x ) as x → θ uniformly for λ in a neighborhood of λ0 . If (θ, λ0 ) is a bifurcation point, then λ0 ∈ σ(L), i.e., λ0 is a spectrum of L. Proof. If not, λ0 ∈ ρ(L), the resolvent set of L. Since ρ(L) is open, ∃ε > 0 and Cε > 0 such that (L − λI)−1 Cε as |λ − λ0 | < ε . It follows that
1.3 Lyapunov–Schmidt Reduction and Bifurcation
33
x (L − λI)−1 N (x, λ) = ◦( x ) if |λ − λε | < ε, and x → θ, as x ∈ Sλ . Thus ∃δ > 0, such that Bδ × (λ0 − ε, λ0 + ε) ∩ Sλ = {(θ, λ)| |λ − λ0 | < ε} , i.e., (θ, λ0 ) is not a bifurcation point.
(3) The above condition is not sufficient. For example, let X = R2 , let u x= , v and let
3 u u −v . F (x, λ) = −λ + u3 v v
Obviously, Fx (θ, λ) = (1 − λ)Id. λ = 1 is in the spectrum, but (θ, λ) is not a bifurcation point, because: F (x, λ) = θ ⇔ u4 + v 4 = 0, i.e., x = θ . In order to study the sufficient condition and the local behavior of the solution set near its bifurcation points, we introduce the following: 1.3.2 Lyapunov–Schmidt Reduction Let X, Y be Banach spaces, and let ∧ be a topological space. Assume that F : U × ∧ → Y is continuous, where U ⊂ X is a neighborhood of θ. We assume that Fx (θ, λ0 ) is a Fredholm operator, i.e., (1) Im Fx (θ, λ0 ) is closed in Y , (2) d = dim ker Fx (θ, λ0 ) < ∞, (3) d∗ = codim Im Fx (θ, λ0 ) < ∞. Set X1 = ker Fx (θ, λ0 ), Y1 = Im Fx (θ, λ0 ) . Since both dim X1 , and codim Y1 are finite, we have the direct sum decompositions: X = X1 ⊕ X2 , Y = Y1 ⊕ Y2 , and the projection operator P : Y → Y1 . ∀x ∈ X, there exists a unique decomposition: x = x1 + x2 , xi ∈ Xi , i = 1, 2 .
Thus F (x, λ) = θ ⇔
P F (x1 + x2 , λ) = θ , (I − P )F (x1 + x2 , λ) = θ .
34
1 Linearization
Now, P Fx (θ, λ0 ) : X2 → Y1 is a surjection as well as an injection. According to the Banach theorem, it has a bounded inverse. If we already have F (θ, λ0 ) = θ, then from the IFT, we have a unique solution u : V1 × V → V2 satisfying P F (x1 + u(x1 , λ), λ) = θ , where Vi is a neighborhood of θ in U ∩ Xi , i = 1, 2, and V is a neighborhood of λ0 . It remains to solve the equation: (I − P )F (x1 + u(x1 , λ), λ) = θ on V1 × V . This is a nonlinear system of d variables and d∗ equations. The above procedure is called the Lyapunov–Schmidt reduction. It reduces an infinite-dimensional problem to a finite-dimensional system. Many applied mathematicians have been doing the same reduction in their concrete problems in their own language. Before going further, let us study the simple properties of the solution x2 = u(x1 , λ). Lemma 1.3.2 Under the assumptions (1), (2), (3) of the Lyapunov–Schmidt reduction, if F ∈ C p (U × ∧, Y ), p 1, satisfies F (θ, λ) = θ, where ∧ is again a Banach space, then we have u(θ, λ) = θ,
u (θ, λ0 ) = θ . If p = 1, then u(x1 , λ) = ◦( x1 +|λ − λ0 |) ; and if p = 2, then u(x1 , λ) = O( x1 2 +|λ − λ0 |2 ) . Proof. According to the IFT, the solution in V1 × V → V2 is unique. Since F (θ, λ) = θ, we have u(θ, λ) = θ. Again, by the IFT, u (θ, λ0 )(x1 , λ) = −(P Fx (θ, λ0 ))−1 (P Fx (θ, λ0 )x1 + P Fλ (θ, λ0 )λ) ∀(x1 , λ) ∈ X1 × ∧. From F (θ, λ) = θ, it follows that Fλ (θ, λ) = 0. Therefore u (θ, λ0 ) = θ , provided x1 ∈ X = ker Fx (θ, λ0 ) . The last two conclusions follow from Taylor’s formula.
1.3 Lyapunov–Schmidt Reduction and Bifurcation
35
Next, we turn to the case d = d∗ = 1. Theorem 1.3.3 (Crandall–Rabinowitz) Suppose that U ⊂ X is an open neighborhood of θ, and that F ∈ C 2 (U × R1 , Y ) satisfies F (θ, λ) = θ. If Fx (θ, λ0 ) is a Fredholm operator with d = d∗ = 1, and if Fxλ (θ, λ0 )u0 ∈ / Im Fx (θ, λ0 )
(1.27)
for all u0 ∈ ker Fx (θ, λ0 )\{θ}, then (θ, λ0 ) is a bifurcation point, and there exists a unique C 1 curve (λ, ψ) : (−δ, δ) → R1 × Z satisfying F (su0 + ψ(s), λ(s)) = θ λ(0) = λ0 , ψ(0) = ψ (0) = θ , where δ > 0, and Z is the complement space of span {u0 } in X. Furthermore, there is a neighborhood of (θ, λ0 ), in which F −1 (θ) = {(θ, λ)| λ ∈ R1 } ∪ {(su0 + ψ(s), λ(s))| |s| < δ} . Proof. Decompose the spaces X and Y according to the Lyapunov–Schmidt reduction, and write down the reduction equation. By assumptions, ker Fx (θ, λ0 ) = span{u0 } , and ∃φ∗ ∈ Y ∗ \{θ}, such that ker φ∗ = ImFx (θ, λ0 ), from the Hahn–Banach theorem. The reduction equation reads as: g(s, λ) = φ∗ , F (su0 + u(su0 , λ), λ) = 0 .
(1.28)
We have the trivial solution s = 0, and we look for a nontrivial solution. Noticing gs (0, λ0 ) = φ∗ , Fx (θ, λ0 )(u0 + us (θ, λ0 )) , and u0 ∈ ker Fx (θ, λ0 ), by applying Lemma 1.3.2, we obtain gs (0, λ0 ) = 0. Therefore, it is impossible to get a solution s = s(λ) directly from the IFT. However, we may consider λ as a function of s, in this case, the only difficulty is that g(0, λ) = 0 for all λ. Let us introduce a new function: 1 g(s, λ) as s = 0 h(s, λ) = s as s = 0 . gs (0, λ) When s = 0, the solutions of h(s, λ) = 0 are the same as (1.28). Here we define gs (0, λ) to be the value of h at s = 0, in order to make h ∈ C 1 . We assume this conclusion at this moment, and postpone the verification to the end. Since h(0, λ0 ) = gs (0, λ0 ) = 0 , and
36
1 Linearization hλ (0, λ0 ) = gsλ (0, λ0 )
= φ∗ , Fxλ (θ, λ0 )(u0 + us (θ, λ0 )) + Fx (θ, λ0 )usλ (θ, λ0 )
= φ∗ , Fxλ (θ, λ0 )u0
= 0 . Again, the IFT is applied, and we obtain a C 1 -curve λ = λ(s), |s| < δ, satisfying h(s, λ(s)) = 0 , λ(0) = λ0 . Set ψ(s) = u(su0 , λ(s)) ; we have ψ(0) = u(0, λ0 ) = θ , ψ (0) = ∇u(θ, λ0 )(u0 , λ (0)) = θ , and
g(s, λ(s)) = φ∗ , F (su0 + u(su0 , λ(s)), λ(s)) = 0 ;
i.e., F (su0 + ψ(s), λ(s)) = θ . This is what we need. Now we turn to verifying h ∈ C 1 (Bη ) for some η > 0, where Bη = {(s, λ) ∈ 2 R | |s|2 + |λ − λ0 |2 < η 2 }. Indeed, only want to verify that h is C 1 at s = 0. By definition, 1 lim g(s, λ) = gs (0, λ) , s→0 s which implies the continuity of h. Moreover, 1 hs (0, λ) = lim [h(s, λ) − h(0, λ)] s→0 s 1 = lim 2 [g(s, λ) − g(0, λ) − gs (0, λ)s] s→0 s 1 = gss (0, λ) , 2 therefore hs (s, λ)
−
hs (0, λ)
1 1 2 = 2 gs (s, λ)s − g(s, λ) − gss (0, λ)s s 2 = ◦(1) as |s| → 0 .
Since
hλ (0, λ) = gsλ (0, λ) , 1 (0, λ) → 0 as s → 0 . hλ (s, λ) − hλ (0, λ) = gλ (s, λ) − gsλ s The proof is complete.
1.3 Lyapunov–Schmidt Reduction and Bifurcation
37
Z
( su0 +ψ(s), λ (s) ) λ0
u0
λ
Span{ u0} Fig. 1.5.
We present two simple applications. Example 1. (Euler elastic rod) We study the bending problem raised at the beginning of this section: ϕ¨ + λ sin ϕ = 0 in (0, π) , ϕ(0) ˙ = ϕ(π) ˙ =0. Let ˙ = u(π) ˙ = 0)} , X = {u ∈ C 2 [0, π]| u(0) Y = C[0, π] ; and let F : X × R1 → Y be the map: (u, λ) → u + λ sin u . It is a continuous map satisfying F (θ, λ) = θ. According to the necessary condition, if (θ, λ) is a bifurcation point, then λ is in the spectrum of the d 2 ) + λI, i.e., linearized operator ( dt λ = n2 , for some n = 1, 2, . . . d 2 ) + n2 I) = {s cos nt| s ∈ R1 }, and since the differential Since ker (( dt d 2 operator ( dt ) under the free end point condition is self-adjoint, we have
coker Fu (θ, n2 ) = {s cos nt| s ∈ R1 } . In addition thus
(θ, n2 ) = cos nu|u=θ = I , Fuλ (θ, n2 ) cos nt = cos nt ∈ / Im Fu (θ, n2 ) . Fuλ
38
1 Linearization
All the assumptions in the Crandall–Rabinowitz theorem are satisfied, and we obtain a family of C 1 curves (λn (s), ψn (s)) : (−δ, δ) → R1 × Zn , where Zn is the complement of span{cos nt}, satisfying λn (0) = n2 , d ds ψn (0)
= ψn (0) = θ ,
for n = 1, 2, 3, . . . If we set ϕn (s, t) = s cos nt + (ψn (s))(t)
t ∈ [0, π] ,
then
∂ ∂t
2 ϕn (s, t) + λn (s) sin ϕn (s, t) = 0 0 < t < π, |s| < δ , ∂ ∂ ϕn (s, 0) = ϕn (s, π) = 0 . ∂t ∂t
We obtain the bifurcation diagram of Fig. 1.6.
1
4
9
Fig. 1.6.
Example 2. We consider the following elliptic BVP. Let Ω ⊂ Rn be a bounded open domain with smooth boundary ∂Ω, and p ∈ (1, ∞): −u − λu = |u|p−1 u in Ω , u|∂Ω = 0 . Set X = C 2,γ ∩ C0 (Ω), and Y = C γ (Ω) for some γ ∈ (0, 1) , F : (u, λ) → −u − λu − |u|p−1 u , we have Fu (θ, λ) = − − λI . Thus, for (θ, λ) being a bifurcation point, −λ has to be in the spectrum of the Laplacian under the 0-Dirichlet data.
1.3 Lyapunov–Schmidt Reduction and Bifurcation
39
Let us first consider the first eigenvalue λ1 , which is simple, i.e., ker − − λI is one dimensional; let ϕ1 be the associate eigenfunction. By the same reasoning, coker Fu (θ, λ1 ) is also one dimensional, and Fuλ (θ, λ1 )ϕ1 = −ϕ1 ∈ / Im Fu (θ, λ1 ) . Again, we apply the Crandall–Rabinowitz theorem, and conclude that (θ, λ1 ) is a bifurcation point, and in its neighborhood, the solution set is the C 1 curve (−δ, δ) → (sϕ1 (x) + ψ(s)(x), λ1 (s)) plus the trivial solution set (θ, λ), where ψ(s) ∈ Z, and Z is the complement of span{ϕ1 } in C 2,γ ∩ C0 (Ω). We have not studied eigenvalues other than λ1 , because we do not know if they are simple, i.e., if the condition d = 1 is satisfied. In fact, if λ is a simple eigenvalue, then we have the similar result. For some special cases, in which d = 1, we can extend Theorem 1.3.3 as follows: Theorem 1.3.4 Let ∧, X and Y be Banach spaces. Suppose that F ∈ C 2 (X × ∧, Y ) has the form F (x, λ) = L(λ)x + P (x, λ) , where L(λ) ∈ L(X, Y ) ∀λ ∈ ∧, and P (θ, λ) = θ, Px (θ, λ) = θ, Pxλ (θ, λ0 ) = θ for some λ0 ∈ ∧ . If there exist u0 ∈ ker L(λ0 )\{θ} and a closed linear subspace Z ⊂ X such that (z, λ) → L(λ0 )z + λL (λ0 )u0 : Z × ∧ → Y is a linear homeomorphism, then there exist a neighborhood U of (θ, λ0 ) in (span{u0 } × Z) × ∧, δ > 0, and a C 1 map: (−δ, δ) → Z × ∧, defined by s → (ϕ(s), λ(s)) satisfying F −1 (θ) ∩ U \{(θ, λ)| λ ∈ ∧} = {(s(u0 + ϕ(s)), λ(s))| |s| < δ} , and (ϕ(0), λ(0)) = (θ, λ0 ) .
Proof. Similar to Theorem 1.3.3, we define 1 F (s(u0 + z), λ) Φ(s, z, λ) = s Fx (θ, λ)(u0 + z)
as s = 0 as s = 0 .
One wants to verify that Φ ∈ C 1 ((R1 × Z) × ∧, Y ). It is sufficient to verify the continuous differentiability at s = 0. Since Φ(s, z, λ) − Φ(0, z, λ) = s−1 [F (s(u0 + z), λ) − F (θ, λ) − Fx (θ, λ)(s(u0 + z))]
1 1 Fxx (rts(u0 + z), λ)tdtdr · (u0 + z)2 , =s 0
0
40
1 Linearization
we have Φs (0, z, λ) =
1 Fxx (θ, λ)(u0 + z)2 . 2
Furthermore as s → 0, Φs (s, z, λ) − Φs (0, z, λ) s2 −2 2 = −s F (s(u0 + z), λ) − sFx (θ, λ)(u0 + z) − Fxx (θ, λ)(u0 + z) 2 +s−1 [Fx (s(u0 + z), λ) − Fx (θ, λ)](u0 + z) = o(1) , and Φλ (s, z, λ) − Φλ (0, z, λ) = s−1 [Fλ (s(u0 + z), λ) − Fλ (θ, λ) − Fxλ (θ, λ)s(u0 , z)] = o(1) . Thus, Φ ∈ C 1 . Now, we have Φ(0, z, λ) = L(λ)(u0 + z) + Px (θ, λ)(u0 + z) , Φ(0, θ, λ0 ) = L(λ0 )u0 + Px (θ, λ0 )u0 = θ , and Φ(z,λ) (0, θ, λ0 )(z, λ) = L(λ0 )z + L (λ0 )u0 · λ + Pλx (θ, λ0 )u0 + Px (θ, λ0 )z , = L(λ0 )z + λL (λ0 )u0 , ∀(z, λ) ∈ Z × ∧. By the assumption, the last linear operator is a homeomorphism; then the IFT is applied. Therefore ∃ a neighborhood U of (θ, λ0 ), and a unique C 1 -curve: s → (ϕ(s), λ(s)) ∈ Z × ∧ ∀ |s| < ε, satisfying (ϕ(0), λ(0)) = (θ, λ0 ) , Φ(s, ϕ(s), λ(s)) = θ, i.e., F (s(u0 + ϕ(s)), λ(s)) = θ .
The proof is complete. The above theorem is applied to Hopf bifurcations in ODE.
Example 3. (Hopf bifurcation) We study the periodic solutions for a linear ordinary differential system: x˙ = Ax , where x ∈ C 1 ([0, 2π], Rn ) and A ∈ M (n, R), the n × n matrix. Let B 0 A= , 0 C
(1.29)
1.3 Lyapunov–Schmidt Reduction and Bifurcation
where B=
0 1 −1 0
41
, and C ∈ M (n − 2, R) .
We assume that (e2πC − I) is invertible. Obviously the linear system (1.29) admits a family of periodic solutions with two real parameters a and b: ⎞ ⎛ a cos t + b sin t ⎜ −a sin t + b cos t ⎟ ⎟ ⎜ ⎟ ⎜ 0 x(t) = ⎜ ⎟ , ∀a, b ∈ R1 . ⎟ ⎜ .. ⎠ ⎝ . 0 Now, we perturb A by introducing a parameter µ ∈ (−1, 1), and consider the nonlinear differential system x˙ = A(µ)x + P (x, µ) ,
where A(µ) =
B(µ) 0 0 C(µ)
, B(µ) =
µ −β(µ)
(1.30) β(µ) µ
,
and C(µ) ∈ M (n − 2, R), satisfying e2πC(µ) − I ∈ GL(n − 2, R). We assume that P : Rn × (−1, 1) → Rn satisfies P (θ, µ) = Px (θ, 0) = Px,µ (θ, 0) = θ . and that β : (−1, 1) → R1 , satisfies β(0) = 1, and β (0) = 0 . Obviously, ∀µ ∈ (−1, 1), x = θ is always a solution. We are interested in nontrivial solutions bifurcating from the branch of trivial solutions. Theorem 1.3.5 Suppose that A(µ) and P (x, µ) are C 2 functions satisfying the above assumptions. Then ∃ positive constants a0 , δ0 and a C 1 map (µ, ω, x) : (−a0 , a0 ) → R1 × R1 × C 1 (R1 , Rn ) , satisfying µ(0) = 0, ω(0) = 1 , where x(a) is a 2πω(a)-periodic function, which satisfies (1.30), and is of the form:
42
1 Linearization
⎛
⎞ a sin ω(a)−1 t ⎜ a cos ω(a)−1 t ⎟ ⎜ ⎟ ⎜ ⎟ 0 (x(a))(t) = ⎜ ⎟ + ◦(|a|) . ⎜ ⎟ .. ⎝ ⎠ . 0 Furthermore, every 2πω(a)-periodic solution y(t) of (1.30), satisfying |y(t)| < δ0 ∀t, coincides with x(a)(t) modulating a phase shift when |µ| < α0 and |ω − 1| < δ0 . Proof. Since ω depends on µ, we introduce a new scale τ , and let t = ωτ ; (1.30) is rewritten as dx = ωA(µ)x + ωP (x, µ) . dτ
(1.31)
We find the 2π-periodic solution of (1.31). Set ∧ = R2 , λ = (ω, µ) ∈ ∧ , 1 X = C2π (Rn ) = {u ∈ C 1 (R, Rn )| u is 2π periodic} , Y = C2π (Rn ) = {u ∈ C(R, Rn )| u is 2π periodic} ,
and set dx − ωA(µ)x , dτ P(x, λ) = ωP (x, µ) ,
L(λ)x =
λ0 = (1, 0) . Let
⎞ ⎞ ⎛ sin τ cos τ ⎜ cos τ ⎟ ⎜ − sin τ ⎟ ⎟ ⎟ ⎜ ⎜ ⎟ ⎜ 0 ⎟ ⎜ u0 = ⎜ ⎟ , and u1 = ⎜ 0 ⎟ ; ⎜ .. ⎟ ⎜ .. ⎟ ⎝ . ⎠ ⎝ . ⎠ 0 0 ⎛
then we have ker L(λ0 ) = span{u0 , u1 } . Define Z=
z ∈ X|
2π
z(t)uj (t)dt = 0, j = 0, 1 .
0
It remains to verify the following conditions: ∀y ∈ Y , the linear equation L(λ0 )z + λL (λ0 )u0 dz − A(0)z − ωA(0)u0 − µA (0)u0 = dτ =y has a unique solution (ω, µ, z) ∈ R2 × Z.
1.3 Lyapunov–Schmidt Reduction and Bifurcation
43
X
µ (1,0, θ) ω Fig. 1.7. Nontrivial solutions
According to the Fredholm alternative, this is equivalent to saying that ∀y ∈ Y, ∃|(ω, µ) ∈ R2 such that y + ωA(0)u0 + µA (0)u0 ∈ ker L∗ (λ0 )⊥ . However, ker L∗ (λ0 ) = ker L(λ0 ); this is again equivalent to 2π 2π 0 (A(0)u0 (t))u0 (t)dt 0 (A (0)u0 (t))u0 (t)dt = 0 . det 2π (A(0)u0 (t))u1 (t)dt 2π (A (0)u0 (t))u1 (t)dt 0 0 Computing the determinant directly, it equals −4π 2 β (0). Thus all assumptions in Theorem 1.3.4 are satisfied. We obtain our conclusion. This kind of bifurcation phenomenon is shown in Fig. 1.7. 1.3.3 A Perturbation Problem We present here an example of perturbation problems. This is a nonlinear Schr¨ odinger equation (NSE); we look for a nonspreading wave packet solution. Assume that the potential V ∈ C 2 (R1 ) is bounded, and the standing wave ψ = ψ(t, x) satisfies the following NSE: ih
h2 ∂ 2 ψ ∂ψ =− + V (x)ψ − ψ 3 . ∂t 2 ∂x2
where h > 0 is a small constant, ψ(t, x) = exp(−iλt/h)ϕ(x) with ϕ(x) → 0 as |x| → ∞, and λ < inf V . It is reduced to the following equation: −
h2 ϕ (x) + V (x)ϕ(x) = λϕ(x) + ϕ(x)3 . 2
If V has a nondegenerate critical point x0 , i.e., V (x0 ) = 0, V (x0 ) = 0, 0 we make a change of variables y = x−x h , and the equation is reduced to
44
1 Linearization
1 − ϕ (y) + (Vh (y) − λ)ϕ(y) = ϕ(y)3 , 2
(1.32)
where Vh (y) = V (x0 + hy) and ϕ(y) → 0, as |y| → ∞. This is a perturbation problem, because h > 0 is small. The special case where h = 0 reads as: 1 (1.33) − ϕ + Eϕ = ϕ3 , 2 where E = V (x0 ) − λ, and ϕ(y) → 0 as |y| → ∞. The equation has a special solution: z(y) = α sech (αy), α = (2E)1/2 . Let τθ ϕ = ϕ(y − θ). Since equation (1.33) is autonomous, it has a onedimensional solution manifold Z = {zθ = τθ z| θ ∈ R1 }. It is easily check: Tz Z = span{e}, where e = z , and then Tzθ Z = span{τθ e}. We write eθ = τθ e. Let us define X = H 2 (R1 ), Y = L2 (R1 ), and 1 F (h, u) = − u + (Vh − λ)u − u3 . 2 Since V is bounded, F : R1 × X → Y . Thus, F (0, zθ ) = 0, ∀ θ ∈ R1 . Since Lθ := Fu (0, zθ ) = −
1 d2 + (E − 3zθ2 )·, with D(Lθ ) = X , 2 dt2
Lθ is a self-adjoint operator on Y . We verify that Lθ is a Fredholm operator: (1) Im (Lθ ) is closed. (2) Ker (Lθ ) = Coker(Lθ ) = Tzθ Z. In fact, only (1) remains to be verified; it follows from: Lemma 1.3.6 Assume inf (V ) > λ. Then ∃γ > 0, such that Lθ vY ≥ γvX ∀v ∈ (Tzθ Z)⊥ . Proof. We prove it by contradiction. Suppose that ∃φn ∈ (Tzθ Z)⊥ such that φn X = 1, and Lθ φn Y → 0. Then φn φ in X. We claim that φ = 0. In fact, (1) by weakly convergence, φ ∈ (Tzθ Z)⊥ and (2) since X is dense in Y, ∀ψ ∈ X, Lθ φ, ψ = φ, Lθ ψ = lim φn , Lθ ψ = lim Lθ φn , ψ = 0 . Therefore, Lθ φ = 0. Combining (1) and (2), φ = 0. d2 By the assumption E > 0, let B = − 12 dt 2 + E; we have a constant c > 0 such that
1.3 Lyapunov–Schmidt Reduction and Bifurcation
45
BuY ≥ 2cuX . Noticing that |z(y)| ∼ exp(−α|y|) as |y| → ∞, and that φn 0 in X, in combination with the Sobolev embedding theorem, which implies that φn ∞ is bounded, and φn ⇒ 0 uniformly on any bounded interval, we obtain: Lθ φn Y = Bφn − 3zθ2 φn Y ≥ Bφn Y − 3zθ2 φn Y ≥ 2cφn X − c = c , as n is large. This is a contradiction.
X1 , Y = We have the following Lyapunov–Schmidt reduction: X = Tzθ Z Y1 , and let P : Y → Y1 be the orthogonal projection. The equation Tzθ Z F (h, u) = 0 is equivalent to the system: P F (h, zθ , zθ + ξ) = 0, F (h, zθ + ξ), eθ = 0 . From F (0, zθ ) = 0 and the IFT, for h > 0 small, ∃ a unique ξ = ξ(h, θ) solving the first equation, P F (h, zθ + ξ(h, θ)) = 0, and satisfying ξ(h, θ) ≤ CF (h, zθ ), for some constant C > 0. It remains to solve: wh (θ) := F (h, zθ + ξ(h, θ)), eθ = 0 . Once θ = θ(h) is obtained, uh = ξ(h, θ(h)) + zθ(h) solves F (h, u) = 0. We write F (h, uh ) = (F (h, uh ) − F (0, uh )) + F (0, uh ) , and by the Taylor formula, F (0, uh ) = F (0, zθ ) + Lθ ξ(h, θ) − N (h, θ) , where N (h, θ) = 3zθ ξ 2 (h, θ) + ξ 3 (h, θ), and θ = θ(h). Since F (0, zθ ) = Lθ eθ = 0, we have | F (0, uh ), eθ | = | N (h, θ), eθ | ≤ Cξ(h, θ(h))2Y , and
F (h, uh ) − F (0, uh ), eθ | =
(V (x0 + hy) − V (x0 ))(zθ (h) + ξ(h, θ(h))eθ dy = I1 + I2 .
The following estimates hold: I1 = (Vh − V0 )zθ , eθ
= −h zθ , Vh zθ − zθ , (Vh − V0 )eθ
1 = − h zθ , Vh zθ
2
1 = − h Vh (y)|z(y − θ)|2 dy 2
1 = − h V (x0 + h(y + θ))|z(y)|2 dy , 2 I2 = | (Vh − V0 )ξ(h, θ), eθ | ≤ (Vh − V0 )eθ ξ(h, θ) ,
46
1 Linearization
and F (h, zθ )2Y = F (h, zθ ) − F (0, zθ )Y
= |Vh (y + θ) − V0 |2 |z(y)|2 dy
2 2 2 ≤ |Vh (y + θ) − V0 | |z(y)| dy + 4Max|V |
R1 \Bρ 2 −µρ
Bρ
|z(y)|2 dy
≤ Max|y|≤ρ |V (h(y + θ)) − V0 |2 + 4Max|V | e ≤ C1 (h(ρ + |θ|))4 + e−µρ
for every ρ > 0, and for some constant C1 > 0. Let us denote the right-hand side by Mh,θ,ρ . Similarly, we have (Vh − V0 )eθ 2 ≤ Mh,θ,ρ . Since z(y) is even,
1 I1 + 1 V (x0 )z2 hθ = 1 [V (x0 )hθ − V (x0 + h(y + θ))]|z(y)|2 dy h 2 2
1 = [V (x0 )h(y + θ) − V (x0 + h(y + θ))|z(y)|2 dy 2
≤ C2 |h(y + θ)|2 |z(y)|2 dy ≤ C2 (h(|θ| + ρ)|2 + e−µρ ) . 1 2 2 V (x0 )z s,
By rescaling θ = hs , v(s) = h1 wh (θ), v0 (s) = h−ν v(hν s), with ν ∈ (1, 2), we obtain
and vh (s) =
|vh (s) − v0 (s)| ≤ C3 (h−ν ((hν |s| + hρ)2 + e−µρ ) + h−1−ν ((hν |s| + hρ)4 + e−µρ )) . Choosing ρ = h−τ with τ > 0, for |s| ≤ 1, we obtain |vh (s) − v0 (s)| ≤ C3 (h−ν ((hν + h1−τ )2 + h−1−ν ((hν + h1−τ )4 −τ
+ (h−ν + h−1−ν )e−µh
)→0,
uniformly as h → 0. Since v0 (s) changes sign at s = 0, we have a zero of vh in [−1, 1] as h > 0 small. This proves the existence of a zero s0 ∈ [0, 1] of vh and then of wh (θ). Thus we have proved the following theorem: Theorem 1.3.7 Assume that V ∈ C 3 (R1 ) is bounded and that x0 is a nondegenerate critical point of V . If λ < inf V , then ∃h0 > 0 such that ∀h ∈ (0, h0 ) ∃ 0 a nonzero solution φ(x) = z( x−xh0 −s0 ) + ξ(h, s0 (h))( x−x h ) of the equation (1.32), with s0 ∈ [−hν , hν ] ν ∈ (1, 2), and ξ(h, s0 (h)) → 0, as h → 0. 0 This solution φ, which is close to z( x−x h ), becomes more concentrated about x0 as h → 0. It is called a nonspreading wave packet with width α = (2(V (x0 ) − λ))−1/2 .
1.3 Lyapunov–Schmidt Reduction and Bifurcation
47
1.3.4 Gluing Gluing is an important technique in nonlinear analysis. It is a method of joining two heteroclinic trajectories to form a new trajectory such that the end point of the first is glued to the starting point of the second, and the new trajectory is closed to the union of the two. For instance, on a Riemannian manifold M , let f ∈ C 1 (M, R1 ). Given (x, y) ∈ K ×K, where K is the critical point set of f , i.e., K = {x ∈ M | f (x) = θ}, let M(x, y) be the space of all trajectories c ∈ H 1 (R1 , M ) satisfying c˙ = −∇f ◦ c,
c(−∞) = x, c(+∞) = y .
The importance of the gluing technique is in the study of the compactness of the totality of the trajectory spaces: {M(x, y) | (x, y) ∈ K × K}. It is proved that the trajectory manifolds M(x, y) are compact up to the ∞ topolexistence of sequences which converge to broken trajectories in the Cloc ogy. And the “gluing” means to map such broken trajectories equipped with an additional suitable parametrization into the appropriate trajectory space: M(x, z) × M(z, y) → M(x, y) . This technique is crucial in Floer homology theory (see Hofer and Zehnder [HZ 2], Floer [Fl 2,3], Taubes [Tau]). In order not to involve over specialized knowledge in that theory, it will suffice to introduce the technique by an example of a nonspreading wave packet, which we met in the previous subsection. We have known the existence of a nonspreading wave packet, if V has a single nondegenerate critical point. However, if V has several nondegenerate critical points x1 , x2 , . . . , xn , there are at least n nonspreading wave packets with widthes αj = (2(V (xj ) − λ))−1/2 , j = 1, 2, . . . , n. As h becomes small, these wave packets are separated. Are there multi-peak wave packets? More precisely, are there new solutions of equation (1.32), which are closed to some of these wave packets on their peak intervals simultaneously? For simplicity, we only consider the case n = 2; the result can be extended to any n. Assume that V has onlytwo nondegenerate critical points x± = ±R. Let λ < inf(V ). Define α± = 2(V (±R) − λ), z± (y) = α± sech (α± y), and ∀(θ+ , θ− ) ∈ R2 , z(θ+ , θ− ) = z+ (θ+ ) + z− (θ− ), where z± (θ± ) = τ±(R+θ± )/h z± . Again let 1 d2 u + (Vh − λ)u − u3 . F (h, u) = − 2 dy 2 We are looking for a solution of the form u = z(θ+ , θ− ) + φ ∈ X for the equation F (h, ·) = 0, in which φ is small as h > 0 is. Define a two-dimensional manifold: Zh = {(z+ (θ+ ), z− (θ− )) |(θ+ , θ− ) ∈ . R2 }, then Tz(θ+ ,θ− ) Zh = span{τ(R+θ+ )/h e+ , τ−(R+θ− )/h e− }, where e± = z± In contrast with the one-peak solution, now z(θ+ , θ− ) are not zeroes of F (0, u), therefore the zeroes of F (h, u) cannot be obtained directly by the IFT.
48
1 Linearization
Instead, we appeal to the contraction mapping theorem. However, Lyapunov– Schmidt reduction is again useful. Fixing (θ+ .θ− ) ∈ R2 , let u0 = z(θ+ , θ− ), we write down the orthogonal decomposition: X1 , Y = Tu0 Zh Y1 , X = Tu0 Zh where the spaces X and Y were introduced in the previous subsection, and let P : Y → Y1 be the orthogonal projection. Again, P F (h, u0 + ξ) = 0 F (h, u) = 0 ⇔ (I − P )F (h, u0 + ξ) = 0 . In fact, by Taylor’s formula, F (h, u0 + ξ) = F (h, u0 ) + Fu (h, u0 )ξ + N (h, u0 , ξ) , where N (h, u0 , ξ) = 3u0 ξ 2 + ξ 3 . First, fixing (θ+ , θ− ) ∈ R2 , we solve the first equation in X1 for h > 0 small. Let L(θ+ , θ− , h) = P Fu (h, u0 ). We have the following lemmas: Lemma 1.3.8 ∃γ > 0, ∃h0 > 0, ∃α0 ∈ (0, 1/2) such that L(θ+ , θ− , h)Y ≥ γuX ∀u ∈ X1 . as h ∈ (0, h0 ), and |α± | < α0 . Lemma 1.3.9 ∀ρ > 0, F (h, u0 )Y ≤ C1 (Σ± Max|y|≤ρh (V (y) − V (±R))2 | ± R ± θ± | + e−2µρ + e−µR/h ), where µ = Min{α+ , α− }. Lemma 1.3.10 N (h, u0 , ξ)Y ≤ C2 ξ2X , N (h, u0 , ξ1 ) − N (h, u0 , ξ2 )Y ≤ C2 Max(ξ1 X , ξ2 X )ξ1 − ξ2 X . Once these lemmas have been proved, according to the contraction mapping theorem, one finds a fixed point ξ of the operator −L−1 (θ+ , θ− , h)N (h, u0 , ξ) − F (h, u0 ) in a neighborhood of u0 on X1 . Namely, ∃h0 > 0, ∃α0 > 0, ∃C1 > 0 such that ∀h ∈ (0, h0 ), ∀|θ± | < α0 , ∃ a unique ξ = ξ(θ+ , θ− , h) ∈ X1 such that P F (h, u0 + ξ) = 0, and ξ ≤ C1 F (h, u0 )Y . Now the second equation is a two system in two variables (θ+ , θ− ) ∈ [−α0 , α0 ]2 : vh (θ+ , θ− ) := h−1 ( e+ , F (h, z(θ+ , θ− ) + ξ(θ+ , θ− , h) , e− , F (h, z(θ+ , θ− ) + ξ(θ+ , θ− , h) ) = (0, 0) .
1.3 Lyapunov–Schmidt Reduction and Bifurcation
49
Let us define a two-vector function: v0 (θ+ , θ− ) =
1 (|z+ |2 V (R)θ+ , |z− |2 V (−R)θ− ) . 2
Again we need a Lemma: Lemma 1.3.11 For ν ∈ (1, 2) and 0 < h < Min(h0 , α0 ), we have h−ν vh (hν θ+ , hν θ− ) → v0 (θ+ , θ− ) , uniformly on [−1, 1]2 as h → 0. The difference between these proofs of the Lemmas 1.3.8 to 1.3.11 and those in the previous subsection lie in the interaction terms (for details refer to [Oh]). From the Brouwer degree theory (cf. Sect. 3.1), deg(h−ν vh (hν θ+ , hν θ− ), [−1, 1]2 , (0, 0)) = deg(v0 (θ+ , θ− ), [−1, 1]2 , (0, 0)) = 0 . This proves the existence of a zero of the above system. Finally we arrive at: Theorem 1.3.12 Suppose that V ∈ C 3 is bounded, and λ < inf (V ). Then for each pair (x1 , x2 ) of nondegenerate critical points of V, ∃h0 > 0, such that for h ∈ (0, h0 ) equation (1.32) has a nonzero solution uh of the form τ(x1 +s+ )/h z+ + τ(x2 +s− )/h z− + ξ(h), where |s± | ≤ h−ν with ν ∈ (1, 2), and ξ → 0 as h → 0. 1.3.5 Transversality Transversality is an important notion in differential geometry. It is a condition, induced by the IFT, on a map between two manifolds, under which the preimage of a submanifold is again a submanifold. f : X → Y is said to be transversal to the submanifold W ⊂ Y if at every point x ∈ f −1 (W ), Im f (x) + Tf (x) (W ) = Tf (x) (Y ) , and is denoted by f W . Related notions are regular points and regular values defined as follows. Definition 1.3.13 Suppose that X and Y are C 1 Banach manifolds and f ∈ C 1 (X, Y ). A point x ∈ X is called a regular point of f , if f (x) : Tx (X) → Tf (x) (Y ) is surjective, and is singular (or critical) if it is not regular. The images of the singular points under f are called singular values (or critical values), and their complement, regular values. If y ∈ Y is not in the image of f , i.e., f −1 (y) = ∅, then y is a regular value. The following Sard theorem reveals the smallness of the set of critical values:
50
1 Linearization
z=α sech(h−1α(x−x0))
φ(x)
x0
x
S0
z+
z−
uh x1+S+
x2+S− Fig. 1.8.
Theorem 1.3.14 (Sard) Suppose that X and Y are differential manifolds with dimensions n and m respectively, and that U ⊂ X is open. If f ∈ C r (X, Y ), where r ≥ 1 and r > max{0, dimX −dimY }, then the set of critical values of f has measure zero in Y . The proof is purely measure theoretic, we shall not give it here. The special case dimX = dimY < ∞ will be given in Sect. 3.1, but for the general case refer to Milnor [Mi 2]. We shall extend the study to maps between infinite-dimensional manifolds. Recall a map f between two Banach spaces X and Y is called Fredholm in U ⊂ X, if f ∈ C 1 (U, Y ) and f (x) is a Fredholm operator ∀x ∈ U . The index of f is defined to be ind f (x) = dim ker f (x) − dim coker f (x) . It is known that if U is connected, then ind f (x) is a constant integer, and then is denoted by ind(f ). Lemma 1.3.15 If f ∈ C 1 (U, Y ) is a Fredholm map, then the set of critical points is closed.
1.3 Lyapunov–Schmidt Reduction and Bifurcation
51
Proof. Since x → dim kerf (x) is u.s.c., and ind(f ) is locally a constant, dim cokerf (x) is also u.s.c. Let S be the critical point set of f , then the set S = {x ∈ U |f (x) is not surjective} = {x ∈ U |dim coker f (x) ≥ 1}
is closed.
Theorem 1.3.16 (Sard–Smale) Suppose that X is a separable Banach space and Y is a Banach space. Let f ∈ C r (U, Y ) be a Fredholm map, where U ⊂ X is open. If r > max (0, ind(f )), then the set of critical values is of first category. Proof. Since the first category set is a countable union of closed nowhere dense sets, and U is separable, it is sufficient to prove that ∀x ∈ U , there is a neighborhood of x, V ⊂ U such that the set of critical values of f |V , S(f, V ) is closed and nowhere dense. By the definition of Fredholm operators, one has the decomposition X = kerf (x)⊕X1 . Let Q be the projection of Y onto Imf (x); from the IFT, there is a neighborhood U0 × V0 ⊂ kerf (x) × X1 , a neighborhood W ⊂ Imf (x) of f (x), and h ∈ C 1 (U0 × W, V0 ) such that Qf (u + h(u, w)) = w, ∀(u, w) ∈ U0 × W , and ∀u ∈ U0 , h(u, ·) : W → V0 is a diffeomorphism. Since U0 is finite dimensional, it can be chosen compact. We set V = U0 × V0 , 1. First we show that S(f, V ) is closed. Due to Lemma 1.3.15 it is sufficient to show that the map f |V is closed. In fact, let xn = un + vn ∈ U0 × V0 be such that yn = f (xn ) → y. From the compactness of U0 , un is subconvergent, and vn = h(un , Qyn ) is convergent, therefore f |V is closed. 2. Next we show that S(f, V ) is a nowhere dense set. Define H : U0 × W → V by H(u, v) = (u, h(u, w)). Then H is a diffeomorphism satisfying Qf ◦ H(u, w) = w. Setting f˜ = f ◦ H, we have S(f, V ) = S(f˜, U0 × W ), and Qf˜ |W = idW , therefore ∀w ∈ W , (x, w) ∈ S(f˜, U0 × W ) ⇐⇒ x ∈ S((I − Q)f˜(·, w), U0 ). From r > ind f (x) = dim kerf (x) − dim cokerf (x) and Sard theorem, S((I − Q)f˜(·, w), U0 ) is a null set. Since S(f, V ) is also closed, it is a nowhere dense set. We conclude that the critical set of f is of the first category. Corollary 1.3.17 Let X and Y be Banach spaces, and X be separable. If f ∈ C 1 (X, Y ) is Fredholm with negative index, then f (X) does not contain interior points. Proof. If not, say y0 ∈ f (X) is an interior point, i.e., ∃ a neighborhood V of y0 such that V ⊂ f (X). According to the Sard–Smale lemma, ∃y ∈ V such that f {y}, i.e., ∀x ∈ f −1 (y), f (x) : X → Y is surjective, or codim Im(f (x)) = 0, thus ind(f )(x) = dim kerf (x) ≥ 0. A contradiction. The following transversality theorem will be often used in the sequel.
52
1 Linearization
Theorem 1.3.18 Suppose that X, Z are Banach spaces, where X is separable, and that S is a C r Banach manifold. Assume that F ∈ C r (X × S, Z) satisfies (1) F {θ}, and (2) ∀s ∈ S, fs (u) = F (u, s) is a Fredholm map with index satisfying max{0, ind(fs )} < r. Then ∃ a residual set Σ ⊂ S (i.e., the countable intersection of open dense sets) such that ∀s ∈ Σ, fs {θ}. Proof. Define the injection: i : V −→ X ×S and the projections π : X ×S −→ S, p : X × S → X. Let V = F −1 (θ). In the sequel, both of them are restricted on V . We claim that π ◦ i is a Fredholm map with ind (π ◦ i) = ind (fs ). In fact, ker F (v) = Tv (V ) = Im ((p ◦ i) (v)) ⊕ Im ((π ◦ i) (v)) ∀v = (x, s) ∈ Tv (V ). Since F {θ}, we have a direct sum decomposition: X × Ts (S) = Y ⊕ Tv (V ) such that F (v) : Y → Z is an isomorphism. By the assumption that fs (x) is Fredholm, we have direct sum decompositions: X = Im((p ◦ i) (v)) ⊕ Y1 , Z = Z1 ⊕ Z2 , such that fs (x) : Y1 → Z1 . Thus, Y = Y1 ⊕ Y2 , where Ts (S) = Im(π ◦ i) (v) ⊕ Y2 . From F (v) = fs (x) ⊕ ∂s F (v), we have ∂s F (v) : Y2 → Z2 is an isomorphism. Thus, ker fs (x) = Im(p ◦ i) (v) = ker (π ◦ i) (v), coker fs (x) = Z2 Y2 coker(π ◦ i) (v). Therefore ind (fs ) = ind (π ◦ i). According to the Sard–Smale Theorem, the set of regular values of π◦i Σ is a residual set. We are going to prove that for a regular value s, fs {θ}. From F (x, s) = θ, and F {θ}, we have Im F (x, s) = Z, i.e., ∀a ∈ Z, ∃(α, β) ∈ ∂F X × Ts (S) such that a = ( ∂F ∂x α + ∂s β). We are going to prove Im fs (x) = Z, i.e., ∀ a ∈ Z, ∃y ∈ X such that a = fs (x)y. Thus, if β = 0, we take y = α. Otherwise, since π is a projection, (π ◦ i) (x, s) : X × Ts (S) −→ Ts (S) is a projection. That s is a regular value means that (π ◦ i) (x, s) : T(x,s) (V ) −→ Ts (S) is surjective, i.e., to the given β ∈ Ts (S), ∃w ∈ X such that (w, β) ∈ T(x,s) (V ). Since F −1 (θ) = V , we have F (x, s)(w, β) = θ. Setting y = α − w, we obtain ∂F ∂F α+ β fs (x)y − a = F (x, s)[(α, β) − (w, β)] − a = ∂x ∂s − a − F (x, s)(w, β) = θ . The same conclusion holds if X and Z are Banach manifolds. As an application we study the simplicity of eigenvalues of the Laplacian on bounded domains with Dirichlet data. It is well known that all eigenvalues of second-order ODEs on bounded intervals with Dirichlet data are simple, but it is not true for PDE, e.g., the Laplacian on a ball. However, we shall show that for most domains, this is true. What is the meaning of most domains? Given a bounded open domain Ω0 ⊂ Rn with smooth boundary, we consider the manifold S = Diff 3 (Ω0 ) := {g ∈ C 3 (Ω0 , Rn ) | det (g (x)) =
1.3 Lyapunov–Schmidt Reduction and Bifurcation
53
0 ∀x ∈ Ω0 }. Thus as g ∈ S, the domain Ω = g(Ω0 ) is C 3 . ∀Ω, let X(Ω) = H 2 (Ω) ∩ H01 (Ω) and Y (Ω) = L2 (Ω). ∀g ∈ S, define g ∗ : X(Ω0 ) → X(Ω) by (g ∗ u)(x) = u(g −1 (x)) ∀x ∈ Ω = g(Ω0 ) . One defines a map F ∈ C 1 ((X(Ω0 )\{θ}) × S, Y (Ω0 )) by F (u, λ, g) = g ∗−1 (∆ + λI)g ∗ u . We want to show that there exists a residual set Σ of S such that ∀g ∈ Σ, all eigenvalues of the problem: (∆ + λ)u = 0 on H01 (Ω) , are simple, where Ω = g(Ω0 ). Since there are, at most, countable eigenvalues, it is sufficient to show that for each eigenvalue λ after suitable perturbation of the domain, i.e., for after a suitable g ∈ S, it is simple. To this end, let us define fg (u, λ) = F (u, λ, g). We claim that it remains to show fg {θ}, or equivalently, fg (u, λ) : X(Ω) × R1 → Y (Ω) is surjective, i.e., {(∆ + λ)w + µu | (w, µ) ∈ X(Ω) × R1 } = Y (Ω)}, or equivalently, codim Im(∆ + λI) ≤ 1. Since we have assumed that λ is an eigenvalue, i.e., codim (Im(∆ + λI) ≥ 1. Therefore λ is simple. We know that fg (u, λ) is a Fredholm map, from Theorem 1.3.18, it is sufficient to verify that F {θ}. To this end, ∀(u0 , λ0 , g0 ) ∈ F −1 (θ), let L = F (u0 , λ0 , g0 ), and Ω = g0 (Ω0 ). With no loss of generality we may assume g0 = Id. It remains to verify that L is surjective. Since L(w, µ, h) = (∆+λ0 )w +µu0 +[h·∇, ∆+λ0 ]u0 = (∆+λ0 )(w −h·∇u0 )+µu0 , L is Fredholm, where [A, B] = AB − BA. Suppose it is not surjective, then codim Im(L) > 0, there exists a nontrivial element φ⊥Im(L). First by taking w = h = θ, we have
φu0 = 0 . Ω
Second, we take h = θ; it follows that
φ(∆ + λ0 I)w = 0 ∀ w ∈ X(Ω) . Ω
¯ α ∈ (0, 1) is a solution of the equation: Then φ ∈ C 2,α (Ω), (∆ + λ0 )φ = 0 , with boundary value zero. Then we have
54
1 Linearization
φ(∆ + λ0 )(h · ∇u0 )
0=
Ω
φ(∆ + λ0 )(h · ∇u0 ) − (h · ∇u0 )(∆ + λ0 I)φ
=
Ω
φ∂n (h · ∇u0 ) − ∂n φ(h · ∇u0 )
=
∂Ω
∂n φ(h · ∇u0 )
=− ∂Ω
¯ Rn ). Thus, for all h ∈ C 3 (Ω, ∂n φ∇u0 = 0 on ∂Ω . According to the uniqueness of the Cauchy problem (see [Hor 1]) for the equa¯ this contions (∆ + λ0 )φ = 0, and (∆ + λ0 )u0 = 0 for φ, u0 ∈ C 2,α ∩ C0 (Ω), tradicts with u0 = θ and φ = θ. We have proved a result due to K. Uhlenbeck [Uh]: Theorem 1.3.19 There exists a residual set Σ ⊂ Diff 3 (Ω0 ) such that ∀g ∈ Σ, all eigenvalues of the equation (∆ + λI)u = 0 on H01 (g(Ω0 )) are simple.
1.4 Hard Implicit Function Theorem The inverse function theorem is established for C 1 mappings between Banach spaces, f : X → Y , where X and Y are Banach spaces, under the assumption f (x0 )−1 ∈ L(Y, X). However, if f (x0 )−1 is not bounded, then the problem will be very complicated. The small divisor problem, arising in the study of the long-time behavior of oscillatory motions in the solar system, is a typical example. The celebrated KAM theory, which states that most (in the sense of measure) quasi-periodic solutions of an integrable smooth Hamiltonian system persist under small perturbations of that Hamiltonian, provided that the Hessian is nondegenerate, is a breakthrough in the progress in this direction. Not only is the result an important conclusion in celestial mechanics, but also the methods developed in this theory have great impact in other nonlinear problems. In fact, Nash–Moser iteration, which was introduced in the study of the isometric embedding problem for Riemann manifolds, see [Na 1,2], and [Mos 1,2], is extensively applied in problems arising in geometry (see for instance Hamilton [Ham]) and in physics (see for instance Hormander [Hor 2]). In recent years, KAM theory has been extended to Hamiltonian systems with infinitely many freedoms (see Poschel [Po], Wayne [Way], Kuksin [Kuk], Bourgain [Bou]etc.)
1.4 Hard Implicit Function Theorem
55
In avoiding too many complicated computations, we take an approach due to Hormander by appealing to the Leray–Schauder degree theory in the proof of the existence of a solution. Readers may read this subsection after Chap. 3. In fact there are other approaches without using topological arguments (see for instance J. Moser [Mos 1,2,3], Hormander [Hor 2] or J. T. Schwartz [Scw]). Actually, the boundedness assumption on f (x0 )−1 guarantees the convergence of the simple iteration method in solving the nonlinear equation: y = f (x) ⇔
(1.34)
x = x − f (x0 )−1 (y − f (x)) .
One produces the iteration process as follows: xn+1 = xn − f (x0 )−1 (y − f (xn )),
n = 1, 2, . . . .
(1.35)
However, if we consider the nonlinear wave equation: utt − F (uxx ) = f u|t=0 = ut |t=0 = 0 , where F is a function with F (0) = 1 and F (0) = 0, then the above simple iteration process fails, because the linearized equation reads as utt − uxx = g u|t=0 = ut |t=0 = 0 . when g ∈ H s , with compact support for some s > 0. We can at most estimate the boundedness of H s+1 norm of u, but not H s+2 , as that in the elliptic case. If we use the simple iteration, then we lose derivatives in each step; after a finite number of steps, the iteration cannot go on. This phenomenon is called “loss of derivatives”. It occurs in nonelliptic problems. In the analytic category, occurs phenomenon whereby the inverse maps reduce the convergence radii (e.g. the small divisor problem, see below); this is called “loss of convergence radii”. As before, this is also the case that the linearized operator has no bounded inverse. 1.4.1 The Small Divisor Problem For a given f , analytic in a neighborhood of θ, with f (0) = 0, and f (0) = σ, find u, analytic in a neighborhood of θ with u(0) = 0, and u (0) = 1, satisfying f (u(z)) = u(σz) . We write it in the IFT form:
(1.36)
56
1 Linearization
Let f (z) = σz + fˆ(z) , u(z) = z + u ˆ(z) . Equation (1.36) is equivalent to Φ(fˆ, u ˆ) = fˆ(z + u ˆ(z)) + σ u ˆ(z) − u ˆ(σz) = θ .
(1.37)
Obviously, Φ(θ, θ) = θ, and Φuˆ (fˆ, u ˆ)w ˆ = fˆ (z + u ˆ(z))w(z) ˆ + σ w(z) ˆ − w(σz) ˆ . Φuˆ (θ, θ) is injective, if σ = e2πiτ , where τ is irrational. In fact, we write vˆ =
∞
vj z j , w ˆ=
j=2
∞
wj z j .
j=2
The equation ˆ = vˆ Φuˆ (θ, θ)w has a unique solution w, ˆ in which wj =
vj j = 2, 3, · · · . σ − σj
Since the denominator tends to zero for a subsequence, one cannot expect a bounded inverse of Φuˆ (θ, θ). A real number τ is of type (b, ν), b > 0, ν > 2, if τ − p ≥ b ∀p, q ∈ Z\{0} . (1.38) q qν Claim. For almost all real numbers τ , there exists (b, ν) depending on τ , such that τ is of type (b, ν). Indeed, for given (b, ν), fixing q, the set of all real numbers τ ∈ [0, 1] such that (1.38) does not hold has a measure less than 2bq −ν+1 . Therefore, the set of all real numbers τ such that (1.38) does not hold has the measure 2b q −ν+1 < ∞. Since b can be arbitrarily small, the conclusion follows. Suppose σ = e2πiτ , where τ is a number of type (b, ν). Then p |σ − σ j | = e2πi(j−1)(τ − j−1 ) − 1 p ≥ sin 2π τ − (j − 1) j−1 p 2 ≥ · 2π(j − 1) τ − π j − 1 b ≥4 , (j − 1)ν−1
1.4 Hard Implicit Function Theorem
therefore
57
j ν−1 1 . |σ − σ j | 4b
In this case, even if vˆ has the convergent radius r, w ˆ can only have a smaller convergent radius. In other words, if we introduce a family of Banach spaces: A(r) = {w(z)| ˆ bounded and analytic in |z| < r, w(0) ˆ =w ˆ (0) = 0} with the norm ˆ , |w| ˆ r = Sup|z|
∞ vj z j σ − σj j=2
C
∞
j ν−1 (r − δ)j |vj | ,
j=2
but 1 |vj | = 2π
v(z) dz r−j |v|r , |z|=r z j+1
therefore −1
|Φuˆ (θ, θ)
vˆ|r−δ C|v|r
∞ j=2
j
ν−1
δ 1− r
j
Cδ −ν |v|r
(1.39) (1.40)
where C = C(ν, r) is a constant. The loss of radius prevent us from simple iterations. One intends to gain back some of the loss by accelerating the convergence. It is known that the Newton method provides more efficient convergence speed. The iteration scheme, in contrast with (1.35), reads as follows: xn+1 = xn − f (xn )−1 (y − f (xn ))
(1.41)
We are led to the computation of Φuˆ (fˆ, u ˆ)−1 , but the later is too complicated. We intend to find an approximate inverse as a replacement. Of course, the approximation should match the convergence speed. In doing so, let us perform some computations: ˆ(z))(1 + u ˆ (z)) + [σ u ˆ (z) − σ u ˆ (σz)] , (Φ(fˆ, u ˆ)) (z) = fˆ (z + u and
ˆ + σˆ ˆ)ˆ v = fˆ (z + u ˆ(z))v(z) v (z) − vˆ(σz) . Φuˆ (fˆ, u
58
1 Linearization
Thus ˆ)ˆ v= Φuˆ (fˆ, u
vˆ vˆ Φ(fˆ, u ˆ) + (1 + u ˆ ◦ σ)Φuˆ (θ, θ) . 1+u ˆ 1+u ˆ
One takes T (fˆ, u ˆ)w ˆ = (1 + u ˆ )Φuˆ (θ, θ)−1
w ˆ 1+u ˆ ◦ σ
,
(1.42)
as the approximate inverse with vˆ(z) = (1 + u ˆ(z))w(z). ˆ In fact, w ˆ ˆ)T (fˆ, u ˆ)w ˆ−w ˆ = Φ(fˆ, u ˆ) Φuˆ (θ, θ)−1 , Φuˆ (fˆ, u 1+u ˆ ◦ σ and from the analyticity, ˆ)|r . |Φ(fˆ, u ˆ) |r−δ Cδ −1 |Φ(fˆ, u We take γ ∈ (0, 1), and |ˆ u |r < γ, then 1 + u ˆ ◦ σ = 0, and |(Φuˆ (fˆ, u ˆ)T (fˆ, u ˆ) − Id)w| ˆ r−δ Cδ −(ν+1) |Φ(fˆ, u ˆ)|r |w| ˆr,
(1.43)
where C = C(γ, ν, r). Similarly, |T (fˆ, u ˆ)w| ˆ r−δ Cδ −ν |w| ˆr .
(1.44)
Let us introduce a new norm: ˆ (z)| . w ˆ r = Sup|z|
(1.45)
Obviously the following inequality holds: |w| ˆ r rw ˆ r. Moreover, we estimate the error: Φ(fˆ, u ˆ) − Φ(fˆ, vˆ) − Φuˆ (fˆ, vˆ)(ˆ u − vˆ) = fˆ(z + u ˆ(z)) − fˆ(z + vˆ(z)) − fˆ (z + vˆ(z))(ˆ u(z) − vˆ(z))
1 1 2 sfˆ (z + vˆ(z) + st(ˆ u(z) − vˆ(z)))dtds(ˆ u(z) − vˆ(z)) . = 0
0
By the Cauchy formula, if f ∈ A(r) with |f |r < γ,
2 f (ζ) 1 dζ 2 |f |r |f (z)| = 3 R π |ζ−z|=R (ζ − z) for 0 < R r − |z|, we obtain 2γ u − vˆ)|r−δ 2 ˆ u − vˆ2r . |Φ(fˆ, u ˆ) − Φ(fˆ, vˆ) − Φuˆ (fˆ, vˆ)(ˆ δ
(1.46)
1.4 Hard Implicit Function Theorem
59
The iteration scheme is now modified to u ˆn+1 = u ˆn − T (fˆ, u ˆn )Φ(fˆ, un ) .
(1.47)
ˆ∗ , one needs to show that In order to show that u ˆn converges to some point u |Φ(fˆ, u ˆn )|rn → 0, while the radius rn depends on n, very rapidly tends to a certain positive number r∗ . Theorem 1.4.1 Let Xλ , Yλ , Zλ , λ ∈ (0, 1] be three families of Banach spaces with nondecreasing norms, i.e., · µ · λ for µ λ. Let (x, y) ∈ X1 × Y1 , r > 0, and Ωλr = Brλ (x) × Brλ (y) ⊂ Xλ × Yλ , where Brλ (x) is the ball centered at x, with radius r in X λ , similarly for the notations Brλ (y) etc. Let Φ : Ωλr → Zλ ∀λ ∈ (0, 1] be C 1 w.r.t. y, and satisfy Φ(x, y) = θ. We assume: (1) |Φ(x, y) − Φ(x, y ) − Φy (x, y )(y − y )|λ−δ M δ −2α y − y 2λ , ∀y ∈ Brλ (y), (2) ∃T (x, y) ∈ L(Zλ , Yλ−δ ) such that | T (x, y)z|λ−δ M δ −τ |z|λ , (3) |(Φy (x, y)T (x, y) − I)z|λ−δ M δ −2(α+τ ) |z|λ |Φ(x, y)|λ , where M ≥ 1, α ≥ 0, τ > 1 are constants, and 0 < δ < λ. One concludes that ∃C = C(M, α, τ ) > 0 such that ∀(x, y) ∈ Ωrλ , ∀λ ∈ (0, 1] with |Φ(x, y)|λ Cλ
−2(α+τ )
, we have y∗ = u(x) ∈ Y λ satisfying 2
Φ(x, u(x)) = θ . Proof. One chooses sequences λn =
λ (1 + 2−n ), 2
n = 0, 1, 2, . . . ,
and µn+1 =
1 λ (λn + λn+1 ) = (1 + 3 · 2−n−2 ), 2 2
n = 0, 1, 2, . . . .
Then λ0 = λ, λn ↓ λ2 . For simplicity, we write Φ(yn ) = Φ(x, yn ), T (yn ) = T (x, yn ). The Newton iteration sequence reads as yn+1 = yn − T (yn )Φ(yn ) n = 0, 1, 2, . . . (1.48) y0 = y . We want to prove: (1) yn ∈ Brλn (y), ∞ nτ (2) let cn = |Φ(yn )|λn , n=1 2 cn < ∞, (n+3)τ −τ (3) yn+1 − yn µn+1 M cn (2 λ ).
60
1 Linearization
If they are proved, then ∞
∞
−τ 3τ
yn+1 − yn λ M λ 2
n=1
2
2nτ cn < ∞ .
n=1
Therefore ∃y∗ = u(x) such that yn → y∗ in Y λ , and 2
|Φ(x, y∗ )| λ lim |Φ(yn )|λn = lim cn = 0 , 2
n→∞
n→∞
i.e., Φ(x, y∗ ) = θ. First, we prove (3) . In fact, From (1.48) and assumption (2), yn+1 − yn µn+1 T (yn )Φ(yn )µn+1 M (2(n+3)τ λ
−τ
(n+3)τ
= M cn (2
)|Φ(yn )|λn
−τ
λ
).
Next, we turn to proving (2) . By (1.48), we have Φ(yn+1 ) = [Φ(yn+1 ) − Φ(yn ) − Φy (x, yn )(yn+1 − yn )] − [Φy (x, yn )T (yn ) − I]Φ(yn ) .
(1.49)
Combining (3) , with assumptions (1) and (3), for n large, cn+1 = |Φ(yn+1 )|λn+1 M 22α(n+3) λ + M c2n (2n+3 λ where a = λ Set
−1 2(α+τ )
)
−2α
yn+1 − yn 2µn+1
≤ aq n c2n ,
−2(α+τ ) 3
q (M + M 3 ) and q = 4α+τ . αn = aq n cn ;
we obtain αn+1 = aq n+1 cn+1 a2 q 2n+1 c2n = qαn2
∀n .
One chooses k ∈ (1, 2), 0 ∈ (0, 1) satisfying 1
q k−1 0 < 1 , and n+1 = qkn ∀n. Thus n+1 = q 1+k+k
2
+···+kn kn+1 0
1
1
= q − k−1 (q k−1 0 )k
n+1
<1.
For sufficiently small c0 = |Φ(x, y)|λ , such that α0 = ac0 0 , by mathematical induction, it is easy to show that αn n
∀n .
1.4 Hard Implicit Function Theorem
61
Thus cn+1 αn cn n cn .
(1.50)
It follows cn+1 cn and cn+1 c0 n . However, n converges to zero hypergeometrically. That (2) is proved. Finally, we verify (1) . From yn+1 − y0 µn+1
n
yj+1 − yj µj+1
j=0 n
a
j
cj q 2 ,
j=0
one sees that ∃ a constant M1 > 0, such that yn+1 − y0 µn+1 ac0 M1 . If c0 is so small that yn+1 − y0 µn+1 < r − y − yλ
∀n ,
then yn − yλn yn − yµn < r − y − yλn . Therefore yn − yλn < r .
The proof is complete.
As an application, now we return to the small divisor problem. We have the following theorem. Theorem 1.4.2 (Siegel) Suppose that τ is of type (b, ν), b > 0, ν > 2. Let σ = e2πiτ . If f (z) = σz + fˆ(z) is an analytic function on |z| < 1, with fˆ(0) = fˆ (0) = 0, then there exist γ, r0 ∈ (0, 1) and an analytic function u 3r0 such that on |z| < 4(1+γ) sup |fˆ(z)| γ |z|
and f ◦ u = u ◦ σ. Proof. We introduce Banach space families: ∀r > 0, A(r) = {w(z)|analytic and bounded in |z| < r, with w(0) = w (0) = 0} , with norm |w|r = sup |w(z)| , |z|
62
1 Linearization
and
! = {w(z) ∈ A(r) | w (z) is bounded in |z| < r} , A(r)
with norm
wr = sup |w (z)| . |z|
Set
! λ ) and Zλ = A(rλ ) Xλ = A(r0 ), Yλ = A(r
r0 where λ ∈ (0, 1], rλ = 1+λ 2 ρ, ρ = 1+γ , γ ∈ (0, 1] and 0 < γ < 1 is to be determined. Set Φ(fˆ, u ˆ) = fˆ(z + u ˆ(z)) + σ u ˆ(z) − u ˆ(σz) as in (1.37). Set λ = 1. ˆ u ! < γ, we have For f A(r ) < γ, ˆ 0
A(ρ)
|Φ(fˆ, u ˆ)|A(ρ) γ + 2|ˆ u|A(ρ) γ(1 + 2ρ) . If r0 > 0 is small, we may choose γ > 0 small. Since all assumptions (1)–(3) of Theorem 1.4.1 are satisfied (cf. (1.46), (1.44), and (1.43) respectively), the conclusion follows from Theorem 1.4.1. 1.4.2 Nash–Moser Iteration Let us turn to the “loss of derivative” problem. Besides the simple iteration method, there are other ways to solve equation (1.34). Given c > 0 and a curve x(t) satisfying f (x(t)) = (1 − e−ct )y , x(t) satisfies the ODE: x(t) ˙ = (f (x(t)))−1 (y − f (x(t))) . If, for some initial data x(0) = x0 , the solution globally exists, and has a limit x(t) → x∞ , then f (x∞ ) = y . Discretizing the equation, we return to Newton’s approximation scheme: xn+1 − xn = cf (xn )−1 (y − f (xn )) . This is (1.41) for c = 1. There is enough room to generalize the above method. Let f (x0 ) = y0 be a special solution. In order to overcome the problem of “loss of derivatives”, we introduce a family of smoothing operators St , t ∈ [1, ∞), which regularizes the function x, and satisfies St → Id, as t → ∞. Find a suitable function g(t), which will be described later so that the curve x(t) tends to a solution x∞ of the equation f (x) = y. We intend to solve the ODE: ⎧ ˙ = f (v(t))−1 g(t) ⎨ x(t) v(t) = St x(t) ⎩ x(0) = x0 .
1.4 Hard Implicit Function Theorem
63
Since d f (x(t)) = f (x(t))x(t) ˙ dt ˙ + g(t) , = (f (x(t)) − f (v(t)))x(t) we should have
f (x∞ ) − f (x0 ) =
∞
e(t)dt + 0
∞
g(t)dt , 0
where e(t) = (f (x(t)) − f (v(t)))x(t). ˙ Design the iteration scheme: ⎧ ⎨ δn := xn+1 − xn = n f (vn )−1 gn , vn = Sθn xn , ⎩ n = θn+1 − θn ,
(1.51)
where θ1 < θ2 < . . . < θn → ∞. Then f (xn+1 ) − f (xn ) = n (en + gn ) , where n en = f (xn + δn ) − f (xn ) − f (xn )δn + (f (xn ) − f (vn ))δn . It follows that f (xn+1 ) − f (x0 ) =
n
j (gj + ej ) .
j=0
Since we are only interested in the limiting result, sometimes we modify it to be: n j gj + Sθn En = Sθn (y − f (x0 )) , j=0
where En =
n−1 j=0
j ej , so that gn can be determined step by step.
gn = −1 n [(Sθn − Sθn−1 )(y − f (x0 ) − En−1 ) − n−1 Sθn en−1 ], n = 1, 2, . . . , (1.52) and g0 = −1 0 Sθ0 (y − f (x0 )) . We start with an abstract framework. {Ea }a≥0 is called a family of Banach spaces with smoothing operators, if Eb → Ea for b ≥ a is an injection, and ∃C = C(a, b) such that ua Cub . Let E∞ = ∩a≥0 Ea be endowed with the weakest topology, such that E∞ → Ea is continuous. Moreover, we assume that ∃ a family of linear operators Sθ : E0 → E∞ , depending on a parameter θ ≥ 1, such that
64
1 Linearization
(1) Sθ ub Cua b a, d Sθ ub Cθb−a−1 ua , (2) dθ where C is a constant depending on a and b. The following inequalities hold: (1) Sθ ub Cθb−a ua , ∀ a < b. (2) (I − Sθ )ub Cθb−a ua ∀ b < a. ∀λ ∈ (0, 1) ∀ a, b. (3) (Interpolation inequality) uλa+(1−λ)b Cuλa u1−λ b Both (1) and (2) follow from the second inequality of the definition. In fact, if a > b, then ∞ d S u u − Sθ ub = t dt θ b
∞ b−a−1 C t ua dt = Cθb−a ua if b < a . θ
and if a < b, then
θ d Sθ ub = St u + S1 ub 1 dt b
θ C tb−a−1 dtua + Cua Cθb−a ua 1
where C denotes various constants. (3) is a consequence of (1) and (2). In fact, may assume a < b. For c = λa + (1 − λ)b, uc Sθ uc + (I − Sθ )uc C(θc−a ua + θc−b ub ) 1
b b−a , we obtain the desired inequality. By choosing θ = ( C u u a )
Example. H¨ older Spaces with Smoothing Operators Let Ω be a bounded domain in Rn we write H α (Ω) as the H¨older space, defined as follows: H 0 (Ω) = C(Ω). If k ≥ 0 is an integer, k < a k + 1, C α (Ω) if a < k + 1 α H (Ω) = C α−0 (Ω) if a = k + 1 . The seminorm is defined to be |u|a =
|α|=k
|∂ α u|a−k ,
1.4 Hard Implicit Function Theorem
and for 0 < a 1 ,
65
|u(x) − u(y)| , |x − y|α x,y∈Ω
|u|a = sup and the norm is defined as:
ua = uC + |u|a . We now come to define the smoothing operators Sθ , θ ≥ 1. For the sake of simplicity, we assume Ω = Rn , the bounded domain case can be modified by standard argument. For a compact set K in Rn , one chooses X ∈ C0∞ (Rn ) to be 1 in a neighborhood of K, a function ψ ∈ C0∞ (Rn ) to be 1 in a neighborhood of 0, and let ϕ be the Fourier transform of ψ, ϕ = Fψ, i.e.,
exp (2πixξ)ψ(ξ)dξ . ϕ(x) = Rn
Let ϕθ (x) = θn ϕ(θx) θ ≥ 1 . If u has support in K, we define Sθ u = X (ϕθ ∗ u) ∈ C0∞ (Rn ) . Since ϕθ (x) = Fψ(ξ/θ), and ψ( θξ ) → 1 (in the distribution sense), we have ϕθ → δ, so Sθ u → u, as θ → +∞. The operators Sθ , which approximate the identity and map to smooth functions, are call smoothing operators. Theorem 1.4.3 The smoothing operators Sθ have the following properties, for θ > 1 and u ∈ H α : (1) Sθ ub Cua b a, d Sθ ub Cθb−a−1 ua . (2) dθ Proof. (1) following directly from the translation invariance and the convexity of the norms: ϕθ ∗ ua ϕL1 ua . We verify (2). Noticing d Sθ u = X · F −1 (θ−1 ψ1 dθ
ξ · (Fu)(ξ)) θ
where ψ1 (ξ) = −ξ · ∇ψ(ξ) , −1
is the inverse Fourier transform. Again ψ1 ∈ C0∞ , and vanishes in and F the neighborhood of the origin. According to (1), (2) holds for b = a. We shall only need to verify (2) for b = 0 and b = a + k, k ∈ N, because the remaining cases follow from the interpolation inequality.
66
1 Linearization
For b = a + k, d d Sθ u ∂ α S = u θ dθ dθ a+k a |α|=k α −1 k−1 ξ ξ = θ ψ1 · (Fu)(ξ) F θk θ a |α|=k
Cθk−1 ua because ξ α ψ1 (ξ) is again in L1 . For b = 0, we only need to prove for a = k ∈ N. Let us write ψ1 (ξ) =
ξα
ξ α ψα (ξ) where ψα (ξ) =
|α|=k
|α|=k
|ξ α |2
ψ1 (ξ) ,
then ψα ∈ C0∞ and vanishes in the neighborhood of the origin: d −1 −k−1 ξ α F Sθ u θ u)(ξ) ψ (∂ α dθ θ 0 0 |α|=k
[∂ α u(x − y) − ∂ α u(x)](ψα )θ (y)dy θ−k−1 |α|=k
=θ
−k−1
·
|y||(ψα )θ (y)|dyuk+1
= Cθ−k−2 uk+1 .
The proof is complete.
Now we are going to introduce a family of Banach spaces associated with Ea as follows: Let θj = 2j , j = 0, 1, 2, . . . , j = θj+1 − θj , j ≥ 1, 0 = 1: −1 R0 = −1 0 Sθ1 , Rj = j (Sθj+1 − Sθj ), j ≥ 1
According to (2), Rj ub
−1 j
b−a θj+1 d − θjb−a θj+1 St u C ua . θj dt (b − a)j b
We obtain: (4) Rj ub Cab θjb−a−1 ua , and (5)
∞ j=0
j Rj u = u.
1.4 Hard Implicit Function Theorem
67
The series is convergent in Eb if u ∈ Ea , a > b. This is called the Paley–Littlewood decomposition. Conversely, suppose we have a sequence {uj } ⊂ Ea , a ∈ [a1 , a2 ], satisfying uj ai Cθjai −a−1 ,
i = 1, 2 ∀j ;
then, by interpolation inequality, (6) uj b Cθjb−a−1 ∀b ∈ [a1 , a2 ], ∀j, and then the series
j
j uj converges in Eb if b < a.
Definition 1.4.4 For a ∈ [a1 , a2 ], we define Ea = {u = Cθjai −a−1 i = 1, 2, ∀j} with norm: ua =
inf u=
j
∞ j=0
j uj | uj ai
sup θj−ai +a+1 uj ai .
j uj i,j
Then Ea is a family of Banach spaces. The following properties hold: (7) ub Cua C1 ua if b < a. To prove the first inequality. ∀ > 0 ∀ u ∈ Ea ∃{uj } ⊂ Eai , i = 1, 2 such that u = j j uj , and uj ai Cθjai −a−1 (ua + ) . From (6), uj b Cθjb−a−1 . It follows that ub C(ua + ). The second inequality follows from (4) and (5). (8) The space Ea does not depend on a1 , a2 . It follows from the interpolation inequality directly. for b < a. Indeed, ∀u = Ea one chooses (9) (I − Sθ )ub Cθb−a ua a1 < a2 such that b < a1 < a < a2 . ∀ > 0, ∃{uj } ⊂ Eai , i = 1, 2, such that u = Σj uj and uj ai ≤ Cθjai −a−1 (ua + ). Then j uj − Sθ uj b , (I − Sθ )ub and (I − Sθ )uj b Cθb−ai uj ai Cθb−ai θjai −a−1 (ua + ), i = 1, 2 , therefore (I − Sθ )ub C(ua + ) ⎞ ⎛ j θb−a1 θja1 −a−1 + j θb−a2 θja2 −θ−1 ⎠ . × ⎝ θj >θ
Thus,
θj <θ
(I − Sθ )ub CM θb−a ua .
68
1 Linearization
Theorem 1.4.5 Suppose that {Ea } and {Fa } are two families of Banach spaces with smoothing operators, and that the embedding Fb → Fa is compact when b > a. Let α, β, r > 0,and Brα be a ball with radius r centered at the origin in Eα . Assume that f : Brα → Fβ is C 2 with f (θ) = θ, and satisfies (1) f (v)−1 exists for v ∈ Brα ∩ E∞ , and ∀g ∈ F∞ , the map (v, g) → f (v)−1 g: (E∞ ∩ Brα ) × F∞ → Ea2 is continuous for some a2 > α > a1 0, and satisfies f (v)−1 ga ≤ C(gβ+a−α + g0 vβ+α ) (2) f (u)(v, w)β+δ C
∀a ∈ [a1 , a2 ] ,
max(l−α,0)+max(m,a1 )+n<2α (1
+ ul )vm wn ,
for some δ > 0. Then ∀y ∈ Fβ with yβ small, ∃u ∈ Eα satisfying f (u) = y . Proof. One uses the iteration scheme (1.51), so one should determine g first. As we have seen from above, after decomposition, it satisfies a series of recursive equations. ∀g ∈ Fβ we have the decomposition: g=
j gj ,
j
with Define
gj b Cb θjb−β−1 gβ .
(1.53)
⎧ ⎨ uj+1 = uj + j f (vj )−1 gj , u0 = θ , vj = S θ j u j , ⎩ δj = j f (vj )−1 gj .
(1.54)
We are going to prove f (vj )−1 gj a C1 gβ θja−α−1 vj a C2 gβ θja−α uj − vj a C3 gβ θja−α
a ∈ [a1 , a2 ] ,
(1.55)
a ∈ (α, a2 ] ,
(1.56)
a a2 ,
(1.57)
inductively. Suppose (1.56) and (1.57) are true for j k and (1.55) holds for j < k, we prove (1.55) for j = k. By the assumption (1) and (1.53): f (vk )−1 gk a C(gk β+a−α + gk 0 vk β+a ) # " C θka−α−1 gβ + θk−β−1 gβ · θkβ+a−α gβ Cθka−α−1 gβ ,
1.4 Hard Implicit Function Theorem
69
if gβ is small. Now we prove (1.57) for j = k + 1, from (9), in the case a < α, uk+1 − vk+1 a = uk+1 − Sθk+1 uk+1 a a−α Cθk+1 uk+1 α .
Since uk+1 =
k
j f (vj )−1 gj ,
j=0
and by the definition of Fα norm, we have uk+1 α Cgβ , ∀α ∈ [a1 , a2 ] . Thus
a−α gβ . uk+1 − vk+1 a Cθk+1
In the case a = a2 , uk+1 − vk+1 a2 Cuk+1 a2 C
k
j f (vj )−1 gj a2
j=0 k
j θja2 −α−1
Cgβ
a2 −α Cθk+1 gβ
j=0
.
The other cases, α a a2 , are verified by the interpolation property. Finally, we prove (1.56) for j = k + 1: vk+1 a uk+1 a + vk+1 − uk+1 a a−α 2Cgβ θk+1 .
Thus the construction of the sequence uk is possible. And uk , vk are all in Brα if gβ is small. Now f (uj+1 ) − f (uj ) = (f (uj + δj ) − f (uj ) − f (uj )δj ) + (f (uj ) − f (vj ))δj + j gj = j (ej + ej + gj ) where and
ej = −1 j (f (uj+1 ) − f (uj ) − f (uj )(uj+1 − uj )) ,
(1.58)
70
1 Linearization
ej =
1
f (vj + t(uj − vj ))(−1 j δj , uj − vj )dt .
0
We obtain from the assumption (2), for n < α < l, (1 + tuj + (1 − t)vj l )f (vj )−1 gj n uj − vj n (1.59) ej β+δ C Cθj−1− gβ
2
(1.60)
where = 3α − l − 2n. Similarly by Taylor’s formula, ej β+δ θj−1− gβ
2
(1.61)
Let T (g) = j j (ej + ej ). Then T (g)β+δ Cgβ . According to (7), and the assumption on the compactness of embedding, Fb → Fa as b > a, we conclude that T : Fβ → Fβ is compact. According to the recursive formula (1.52), g is uniquely determined by y, therefore I + T is locally injective. Now one can apply the Leray–Schauder invariance of domain theorem (see Chap. 3, Corollary 3.4.12) to conclude that ∀y ∈ Fβ with small yβ , there exists g ∈ Fβ such that (I + T )(g) = y. Substituting this g into the iteration scheme (1.54), un is convergent to some u in Ea , provided by (1.55), and (7). Again, by (1.58), f (u) = (I + T )(g) = y. 2
2 Fixed-Point Theorems
It is well known that the contraction mapping theorem is one of the most important fixed-point theorems in analysis. It is based on the metric of the underlying space. It is simple and is strongly dependent on the chosen metric, but useful. In particular, the unique solution can be computed by iteration. In fact, the implicit function theorem and then the first three Sects. of Chap. 1 are based on it. The Brouwer fixed theorem (1911), which says that every continuous selfmapping on a closed ball B n has a fixed-point, is a fundamental fixed-point theorem in topology. It is based on the notion of retraction. Because of its importance, there are a lot of proofs, roughly speaking, divided into three classes according to methods: (1) Combinatorics (Sperner lemma) by which computing methods are developed. (2) Algebraic topology; the topological degree and other algebraic topological invariants are introduced. (3) Differential topology; the proofs are simple and beautiful (see Dunford and Schwartz [DS], Milnor [Mi 2] etc.). In the study of analysis, we need infinite-dimensional versions of this theorem. A new ingredient – the compactness – is added, while the ball is replaced by its topological equivalent – the convex set. The Schauder fixedpoint theorem and its extensions are all based on convexity and compactness. They are widely used in combining with a priori estimates for solutions in differential equations. In an ordered space, the Bourbaki–Kneser principle is another basic fixedpoint theorem with applications in analysis, in case compactness is unavailable. The chapter is organized as follows: The order method is studied in Sect. 2.1. Several fixed-point theorems based on the Bourbaki–Kneser principle are derived, by which, the sub- and super-solutions method in ordered Banach space are developed with applications in PDEs. The convexitycompactness method is developed in detail in Sect. 2.3. We start with the KKM map and the Ky Fan inequality. All other fixed-point theorems, including the Schauder fixed-point theorem and its generalizations, the Nash equilibrium, and the Von Neumann–Sion saddle point theorem, are derived
72
2 Fixed-Point Theorems
as consequences. Various applications are studied, in particular, the Ky Fan fixed-point theorem for set valued mappings is applied to free boundary problems. Section 2.4 is devoted to the existence and iteration method for fixed points of nonexpansive maps, which are on the borderline of the contraction mappings. The prototype of the monotone mapping is the subdifferential of a convex function. Due to the special feature of monotonicity, the compactness requirement can be reduced considerably. Since monotone mappings map a Banach space into its dual, one studies the surjectivity of monotone mappings. The main results in this aspect are due to Minty [Min] and Browder [Bd 3,4]. Applications to variational inequalities and quasi-linear elliptic problems are studied as well. We shall show how the monotonicity is applied instead of the compactness in the existence theory. These are the contents of Sects. 2.5 and 2.6. Convex sets and convex functions will be used form time to time; we collect their most important properties in Sect. 2.2.
2.1 Order Method A kind of nonlinear operator defined on ordered spaces is order preserving; this special feature makes the fixed-point problem easy to handle. A set E is said to be ordered if a partial order is defined by the following axioms: ∀x, y, z ∈ E (i) x x, (ii) x y, and y x imply x = y, (iii) x y, and y z imply x z. A chain (or totally ordered set) E is an ordered set, on which ∀x, y ∈ E either x y or y x. The following terminologies are introduced: The smallest (greatest) element x (x resp.): x x (x x), ∀x ∈ E; the minimum (maximum) element x∗ (x∗ resp.): if x x∗ (x∗ x), x ∈ E then x∗ = x (x∗ = x); the lower (upper) bound of a subset F ⊂ E: a ∈ E (a ∈ E) and a x (x a) ∀x ∈ F ; the infimum (supremum) of F inf F (sup F respectively) is the greatest (smallest) element of the subset, which consists of all lower (upper) bounds of F . ∀a ∈ E, we denote S+ (a) = {x ∈ E| a x} , and call it the right section of a. Similarly we define the left section S− (a). Set [a, b] = S+ (a) ∩ S− (b) for a b, we call it an order interval. Zorn’s lemma, which is equivalent to the Zermelo selection axiom, is our starting point: In a nonempty ordered set (E, ≤), if every chain has an upper bound in E, then the set has a maximum element.
2.1 Order Method
73
Let (E, ) and (F, ) be two ordered sets. A map f : E → F is called (strict) order preserving, if x (<)y implies f (x) (<)f (y). Similarly, we define the (strict) order reversing map. By definition, if f : E → F is order preserving, and a f (a) (f (a) a), then f (S± (a)) ⊂ S± (a). Thus a f (a) and f (b) b imply f ([a, b]) ⊂ [a, b]. Theorem 2.1.1 (Bourbaki–Kneser principle) Let (E, ) be an ordered set, in which every chain has an upper bound. If f : E → E satisfies x f (x) ∀x ∈ E, then f has a fixed point. Proof. By Zorn’s lemma, E has a maximum element a. Since a f (a), and a is maximal, a = f (a). To a self-map f on E, an element x ∈ E, satisfying x f (x) (f (x) x), is called a sub-(or super-) solution of f . The Bourbaki–Kneser fixed-point theorem is a general principle. Many important fixed point theorems can be derived from it. Theorem 2.1.2 (Caristi) Suppose that (E, ρ) is a complete metric space and that ϕ : E → R1 is a (l.s.c.) function bounded from below. Assume f : E → E is a mapping satisfying ρ(x, f (x)) ϕ(x) − ϕ(f (x)) ,
(2.1)
then f has a fixed point. Proof. (1) An order structure on E is introduced by ϕ: ∀x, y ∈ E x y iff ρ(x, y) ϕ(x) − ϕ(y) . It is easy to verify that (E, ) is an ordered set. (2) It is sufficient to verify that every chain X has an upper bound. By definition, ϕ is a monotone decreasing function on X: x y =⇒ ϕ(y) ϕ(x) ∀x, y ∈ X. Let c = inf X ϕ; we can find an increasing sequence x1 x2 · · · ≤ xn ≤ · · · in X such that ϕ(xn ) → c. We conclude that there is at most one a ∈ X such that xn a ∀n. Indeed, if ∃a1 , a2 ∈ X satisfy xn ai , i = 1, 2, then c = ϕ(a1 ) = ϕ(a2 ), because c ϕ(ai ) ϕ(xn ) ∀n . But X is a chain, either a1 a2 or a2 a1 , it follows that ρ(a1 , a2 ) |ϕ(a1 ) − ϕ(a2 )| = 0 , i.e., a1 = a2 . Noticing that {xn } is a Cauchy sequence: ρ(xn+m , xn ) ϕ(xn ) − ϕ(xn+m ) ∀n, ∀m ,
74
2 Fixed-Point Theorems
there exists a limit b ∈ E. We conclude that X has an upper bound. In fact, from the l.s.c. of ϕ, one has xn b ∀n. Now, ∀x ∈ X, if ∃n ∈ N, such that x xn , then x b, so b is an upper bound, otherwise, x itself is the unique upper bound in X. (3) The condition (2.1) on f means x f (x) ∀x ∈ E. Applying Theorem 2.1.1, f has a fixed point. It is worth noting that in the Caristi fixed-point theorem, there is no continuity assumption on the map f . It has many applications. The following version of the Ekeland variational principle is often used. Theorem 2.1.3 (Ekeland) Suppose that (E, ρ) is a complete metric space and that ϕ : E → R ∪ {+∞} is l.s.c. and bounded from below. ∀ε > 0 if x ∈ E satisfies ϕ(x) inf E ϕ + ε, then ∀λ > 0 ∃yλ ∈ E satisfying ϕ(yλ ) ϕ(x) ρ(x, yλ ) λ1
(2.2) (2.3)
ϕ(y) > ϕ(yλ ) − ελρ(y, yλ ) ∀y ∈ E\{yλ } .
(2.4)
Proof. Define a subset of E: E1 = {y ∈ E| ϕ(y) + λερ(x, y) ϕ(x)} , E1 is closed (ϕ is l.s.c.) and nonempty (x ∈ E1 ), so is complete. We claim that ∃yλ ∈ E1 such that ϕ(y) > ϕ(yλ ) − λερ(y, yλ )
∀y ∈ E1 \{yλ } .
Indeed, if not, ∃λ > 0, ∀yλ ∈ E1 , ∃y ∈ E1 \{yλ } such that ϕ(y) ϕ(yλ ) − λερ(y, yλ ) . Define f (yλ ) = y = yλ , then f : E1 → E1 satisfying λερ(yλ , f (yλ )) ϕ(yλ ) − ϕ(f (yλ )). According to the Caristi theorem, f has a fixed point; this is a contradiction. Since (2.2) and (2.3) are trivially true, it remains to verify (2.4) for y ∈ E\E1 . In fact, if ϕ(y) ϕ(yλ ) − λερ(y, yλ ) and y ∈ E\E1 , then ϕ(y) ϕ(x) − λερ(x, yλ ) − λερ(y, yλ ) ϕ(x) − λερ(x, y) . It follows that y ∈ E1 . This is a contradiction.
2.1 Order Method
75
Theorem 2.1.4 (Amann) Assume that every chain of (E, ) has a supremum, and that f : E → E is order-preserving mapping. If f has a subsolution a f (a) then f has a least fixed point in S+ (a). Proof. (1) We verify the existence of a fixed point. Define E+ = {x ∈ E| x f (x)} ∩ S+ (a). According to the Bourbaki–Kneser principle, we only want to show: (i) E+ = Ø, (ii) f (E+ ) ⊂ E+ , (iii) every chain of E+ has an upper bound in E+ . Indeed, a ∈ E+ ; (i) follows. Since f is order preserving, f (E+ ) ⊂ E+ . Let X be a chain of E+ . By assumption, it has a supremum b ∈ E. From x f (x) f (b) ∀x ∈ X, we have b f (b), and then b ∈ E+ , i.e., b is an upper bound of X in E+ . (2) Let FixS+ (a) (f ) be the fixed point set of f in S+ (a). Define G+ = {y ∈ E+ | y z ∀z ∈ FixS+ (a) (f )} . We claim that FixG+ (f ) = Ø, then ∀y0 ∈ FixG+ (f ), y0 is the least fixed point in S+ (a). To this end, from the Bourbaki–Kneser principle, it is sufficient to verify: (i) G+ = Ø, (ii) f (G+ ) ⊂ G+ , (iii) every chain of G+ has an upper bound in G+ . In fact, a ∈ G+ ; (i) follows. ∀y ∈ G+ , ∀z ∈ FixS+ (a) (f ), f (y) f (z) = z , which implies f (y) ∈ G+ , and then (ii) follows. Let X be a chain of G+ , by assumption, it has a supremum b ∈ E, so is b ∈ E+ as in (1) and b z ∀z ∈ FixS+ (a) (f ). i.e., b ∈ G+ . This is an upper bound of X in G+ . An ordered set is called chain complete if every chain has an infimum and a supremum. Corollary 2.1.5 Let E be a chain complete ordered set, and let f : E → E be order preserving. Suppose that ∃ a pair of sub- and super- solutions a a. Then f has at least a least and a greatest fixed point in [a, a]. An ordered set E is called a lattice, if for every pair x, y ∈ E, x ∨ y = sup{x, y} and x ∧ y = inf{x, y} are in E. A lattice is called complete if every nonempty subset possesses an infimum and a supremum. Corollary 2.1.6 (Birkhoff–Tarski) Let E be a complete lattice and let f be an order-preserving self-map on E, then there exist a smallest and a greatest fixed point of f . Proof. Let a = inf E and a = sup E, then a and a are sub- and super- solutions of f respectively, satisfying a a. We study chain complete ordered sets. Let X be a Banach space, and let P ⊂ X be a nonempty closed convex positive cone with P ∩ (−P) = {θ}. It reduces a partial order structure on X:
76
2 Fixed-Point Theorems
x y if and only if y − x ∈ P . The order defined above matches the linear structure and the topology on X, but not necessarily the magnitude of the norm. xi yi , i = 1, 2 =⇒ x1 + x2 y1 + y2 , x y, λ 0 =⇒ λx λy , and xn yn , xn → x, yn → y =⇒ x y . A Banach space X with a closed convex positive cone P, induces an ordered Banach space (OBS) (X, P). In particular ∀a ∈ X, S± (a) is closed. Lemma 2.1.7 Every compact subset E of an OBS is chain complete. Proof. For every chain X ⊂ E, we want to show that it has a supremum. In fact ∀x ∈ X, the family of sets: {S+ (x) | x ∈ X} is a family of closed n
subsets with finite intersection property, i.e., ∀x1 , x2 , . . . , xn ∈ X, ∩ S+ (xi ) = i=1
S+ (x∗ ), where x∗ = sup{x1 , . . . , xn } ∈ X, provided that X is a chain. Since X is compact, ∩ S+ (x) ∩ X = Ø. Let x be an element in the intersection. x∈X
Then (1) x x ∀x ∈ X, i.e., x is an upper bound of X, and (2) ∀ upper ¯ d. Thus x ¯ is a supremum. bound d of X, from x ≤ d and x ¯ ∈ X, it follows x Similarly, one proves that it has an infimum. A positive cone P is called normal if every ordered interval [a, b] in X is bounded in the norm. Lemma 2.1.8 P is normal if and only if ∃ a constant C > 0 such that 0 x y =⇒ x C y . Proof. “=⇒” If not, ∃θ xn yn such that xn n3 yn n = 1, 2, . . . . Let zn = n2x ynn , then zn n. But θ zn n2y ynn . Define ∞ y = n=1 n12 yynn ; we have θ zn y, i.e., zn ∈ [θ, y]. But zn is unbounded. A contradiction. “⇐=” ∀x ∈ [a, b], we have θ x − a b − a. Since x − a C b − a , it follows that x x − a + a a +C b − a . Corollary 2.1.9 Suppose that (X, P) is a normal OBS, and that D = [a, b] is an order interval. If f is an order-preserving compact self-mapping on D, then it has a smallest and a greatest fixed point.
2.1 Order Method
77
Proof. By normality, D is bounded in the norm. Let E = f (D). E is a compact subset of an OBS, provided by the compactness of f . Since f is a self-mapping on D, a ≤ f (a), f (b) ≤ b, so a < b is a pair of sub- and super-solutions of f . The conclusion follows from Corollary 2.1.5 and Lemma 2.1.7. Noticing that a bounded closed convex set of a reflexive Banach space is weakly compact, when we make use of the weak topology, Corollary 2.1.9 can be modified as follows: Corollary 2.1.10 Suppose that (X, P) is a reflexive normal OBS, and that D = [a, b] is an order interval. If f is an order-preserving self-mapping on D, then f has a smallest and a greatest fixed point. Example 1. Let M be a compact space, and let X = C(M ) with norm x = max |x(ξ)| . ξ∈M
Define P = {x ∈ X| x(ξ) 0}. Then P is normal and (X, P ) is an OBS. Example 2. Let (Ω, B, µ) be a measure space and let Lp (Ω, B, µ), 1 p ∞ be the Lp space over (Ω, B, µ). Define P = {x ∈ Lp (Ω, B, µ)| x(ξ) 0 a.e. ξ ∈ Ω}. Then (X, P ) is an OBS, and P is normal. Example 3. Let X = C 1 ([0, 1]) with norm x = max |x(t)| + max |x (t)| , t∈[0,1]
t∈[0,1]
and P = {x ∈ X| x(t) 0 ∀t ∈ [0, 1]}. Then (X, P ) is an OBS, but P is not normal. Corollaries 2.1.9 and 2.1.10 are the foundation of the sub- and supersolutions method in the theory of differential equations. Example 4. Consider the following semi-linear elliptic BVP: −u(x) = ϕ(x, u(x)) in Ω , u|∂Ω = 0
(2.5)
where Ω is a bounded domain with smooth boundary in Rn , and ϕ : Ω × R1 → R1 is continuous. Assume that ∀x ∈ Ω, the function t → ϕ(x, t) is nondecreasing. Define K = (−)−1 with 0-Dirichlet condition; it is known that K is a positive linear operator from the maximum principle. Let F be the mapping u(x) → ϕ(x, u(x)). Since ϕ is nondecreasing in u, the map F is order preserving. Setting X = C0 (Ω), we consider the following mappings: F
i
K
◦
j
C0 (Ω) → C0 (Ω) → Lp (Ω) → Wp2 ∩ Wp1 (Ω) → C0 (Ω) ,
78
2 Fixed-Point Theorems
where i and j are injections, and p > n2 . The later is compact, provided by the Sobolev embedding theorem. Define f = j ◦ K ◦ i ◦ F : C0 (Ω) → C0 (Ω); the problem (2.5) is equivalent to finding the fixed point of f . Since f is compact and order preserving, it has a fixed point if one can find a sub-solution u and ◦
super-solution u of (2.5) in Wp2 ∩ Wp1 (Ω). i.e., u u satisfying −u ϕ(x, u(x)) and − u ϕ(x, u(x)) a.e. in Ω . Namely, we have proved: Statement 2.1.11 Suppose that ϕ : Ω × R1 → R1 is continuous and ∀x ∈ Ω, t → ϕ(x, t) is nondecreasing. If there is a pair of sub- and super-solutions ◦
u u in Wp2 ∩ Wp1 (Ω),
n 2
< p < ∞, then equation (2.5) has the smallest and ◦
the greatest solutions in the order interval [u, u] ⊂ Wp2 ∩ Wp1 (Ω). Remark 2.1.12 The nondecreasing condition on ϕ can be weakened as follows: ∃ω 0, such that ∀x ∈ Ω, the function: ϕω (x, t) = ϕ(x, t) + ωt is nondecreasing in t. Indeed, instead of K and F , we introduce the linear positive operator Kω = (− + ωI)−1 and the order-preserving mapping Fω : u(x) → ϕω (x, u(x)). Then we find the fixed point of fω = j ◦ Kω ◦ i ◦ Fω . Moreover, the continuity condition on ϕ can be replaced by the Caratheodory condition. In this case, we consider the map f : Lp (Ω) → Lp (Ω), with f = i ◦ j ◦ ◦K ◦ F instead, where F is the Nemytski operator. Remark 2.1.13 The sub- and super-solutions method has an advantage in numerical analysis, because one can get the smallest and the greatest solutions in the order interval [u, u] by iteration. Setting ui+1 = f (ui ), ui+1 = f (ui ) u0 = u, u0 = u .
i = 0, 1, 2, . . . ,
Then one has u0 u1 · · · un un · · · u1 u0 . The sequences {un } and un converge to the least solution u∗ and the greatest solution u∗ respectively. If u∗ = u∗ , then this is the unique solution in [u, u]; and the two sequences provide lower and upper bounds estimates for u∗ = u∗ . Remark 2.1.14 In contrast to Corollaries 2.1.9 and 2.1.10, we consider an order-reversing compact mapping f on a normal OBS (X, P). Let a ∈ X be a
2.1 Order Method
79
sub- (or super-) solution of both f and f 2 . Setting xi+1 = f (xi ), i = 0, 1, 2, . . ., and x0 = a, we have either x0 x2 x4 · · ·
· · · x3 x1 if a f 2 (a) f (a) ,
or x1 x3 x5 · · ·
· · · x2 x0 if f (a) f 2 (a) a, respectively .
Thus x2n # x and x2n+1 $ x if a f (a) , (x2n+1 # x and x2n $ x if f (a) a respectively.) If the fixed-point set of f , Fix(f ) ∩ S+ (a) (or Fix(f ) ∩ S− (a)) is not empty, then it is contained in [x, x]. Example 5. Let (M, g) be a compact Riemannian manifold without boundary, and let 2 1 ∂i (g ij det(g)∂j ) ∆M = det(g) i,j=1 be the Laplace–Beltrami operator with respect to g. Assume the Gaussian curvature k(x) < 0 ∀x ∈ M . Given a function K(x) < 0 on M , we consider the following equation: M u(x) − k(x) + K(x)e2u(x) = 0 x ∈ M .
(2.6)
This equation arises from geometry. The solution u defines a conformal metric g! = e2u g. Under the new metric g!, K(x) is the Gaussian curvature of M. We construct a pair of sub- and super-solutions: Choose C > 0 sufficiently large such that −k(x) + K(x)e2C 0 −k(x) + K(x)e−2C
∀x ∈ M .
Then (−C, C) is a pair of sub- and super-solutions. Statement 2.1.15 Suppose that K, k ∈ C(M ) satisfy K(x) < 0, k(x) < 0 ∀x ∈ M , then equation (2.6) has a unique solution. Proof. Since ϕ(x, u) = −k(x) + K(x)e2u is decreasing in u, one cannot apply Statement 2.1.11 directly. Assume K = max(−K(x)) and set ω = 2Ke2C , x∈M
then the function t → ωt + K(x)e2t is nondecreasing. After Remark 2.1.13, Statement 2.1.11 is applied, and we conclude that there is a smallest and a greatest solution of (2.6) in the order interval [−C, C] of C(M ) for any sufficiently large constant C > 0. However, since K(x) < 0 and e2u is increasing in u, from the maximum principle, the solution is unique. References can be found in Kazdan [Ka], Kazdan and Warner [KW 1][KW 2] and Aubin [Au 1].
80
2 Fixed-Point Theorems
Example 6. Consider the following nonlinear heat equation: ⎧ ∂u k 1 ⎪ ⎨ ∂t − u = λu − au in Ω × R+ u=0 on ∂Ω × R1+ ⎪ ⎩ u(·, 0) = ϕ on Ω × {0}
(2.7)
where λ > 0, a > 1, k > 1 and ϕ ∈ Wp2 (Ω) is nonnegative, for some p > n2 . Notice that one can find a large constant M > 0 such that λM − aM k < 0 and max ϕ M . Since ∃ω > 0 such that (λ + ω)u − auk is increasing in the interval [0, M ], one can use the sub- and super-solution method to prove the existence of a positive solution of (2.7). In fact, ∀T > 0 define a mapping A : g → v = Ag, Lp (Ω × [0, T ]) → 2,1 Wp (Ω × [0, T ]) → C(Ω × [0, T ]) as follows: ⎧ ∂v ⎪ ⎨ ∂t − v + ωv = g v=0 ⎪ ⎩ v(·, 0) = ϕ
in Ω × [0, T ] on ∂Ω × [0, T ] on Ω × {0} .
From the maximum principle for heat equations, A is order preserving. Define F (u) = (λ + ω)u − auk ; again F is order-preserving in the order interval D = [θ, M ] of the OBS C(Ω × [0, T ]). Setting f = A ◦ F ◦ i, where i is the injection C(Ω × [0, T ]) → Lp (Ω × [0, T ]), f is a compact order-preserving map on D. Now θ f (θ), and f (M ) M . From the parabolic maximum principle, we have a fixed point u = f (u) in [θ, M ]. This is a solution of (2.7). The sub- and super-solutions method is extensively used in the study of nonlinear differential equations. The analytic basis is the maximum principle. As to systems, the method is also applicable if the associated maximum principle is extended to the linearized operator. However, the construction of a pair of sub- and super-solutions is technical, but crucial. It depends on the special feature of the nonlinear term.
2.2 Convex Function and Its Subdifferentials 2.2.1 Convex Functions Let X be a vector space, a function f : X → R ∪ {+∞} is convex, if ∀x, y ∈ X, ∀λ ∈ [0, 1], we have f (λx + (1 − λ)y) λf (x) + (1 − λ)f (y) . It is called concave, if −f is convex. f is called affine if f is both convex and concave. The domain, the epigraph and the level set of f are defined as follows:
2.2 Convex Function and Its Subdifferentials
81
dom(f ) = {x ∈ X| f (x) < +∞} , epi(f ) = {(x, λ) ∈ X × R1 | f (x) λ} , fa = {x ∈ X| f (x) a} ∀a ∈ R1 . f is said to be proper if f ≡ +∞. By definition, f is convex ⇐⇒ ∀x1 , . . . , xn ∈ X, ∀λ1 , . . . , λn 0, f
n i=1
λi = 1 ,
i=1
λi xi
n
n
λi f (xi ) ⇐⇒ epi(f ) is convex .
i=1
Also f is convex =⇒ ∀a ∈ R1 , fa is convex, but the converse is not true. A function f is called quasi convex (quasi concave) if fa is convex (concave resp.) ∀a ∈ R1 . For a subset C of X, the indicator function is defined to be 0 if x ∈ C χC (x) = +∞ if x ∈ C . Thus C is convex ⇐⇒ χC is a convex function. The following simple propositions hold: (1) If f and g are convex, then ∀α, β 0 αf + βg is convex. (2) If A is a linear mapping: X → Y and if f : Y → R ∪ {+∞} is convex, then f ◦ A : X → R ∪ {+∞} is convex. (3) If {fι | ι ∈ ∧} is a set of convex functions, then sup{fι | ι ∈ ∧} is convex. We study the continuity of convex functions on Banach spaces. Theorem 2.2.1 Suppose that f : X → R ∪ {+∞} is a convex function on a Banach space X. If f is bounded from above in a neighborhood of a point x, then f is continuous at x. Moreover, f is locally Lipschitzian in int(dom(f )). Proof. (1) We may assume x = θ and f (θ) = 0. From the assumption, ∃η > 0, ∃M > 0 such that (2.8) f (y) M ∀y ∈ Bη (θ) . On one hand, ∀z ∈ Bη (θ)\{θ}, we have ηz z ηz z M f z . f (z) = f η z η z η One the other hand, ∀z ∈ X
(2.9)
82
2 Fixed-Point Theorems
η z z+ 0 = f (θ) = f η+ z η+ z η M z f (z) + , η+ z η+ z
η z − z
It follows that
M z . η Combining (2.9) with (2.10), we obtain f (z) −
|f (z)|
M z η
(2.10)
∀z ∈ Bη (θ) .
(2) To prove the second assertion, we first show that ∀y ∈ int(dom(f )), f is bounded above in a neighborhood of y, i.e., ∃η1 > 0, ∃M1 > 0 such that f (z) M1
∀z ∈ Bη1 (y) .
(2.11)
To this end one chooses w = (1+t)y such that the segment yw ⊂ int(dom(f )). t η and M1 = max {M, f (w)}, we have f (w) M1 , and Setting η1 = 1+t 1 + t t (z − y) η , if z ∈ Bη1 (y). Since t z= 1+t
w 1+t (z − y) + t 1+t
it follows from the convexity that 1+t 1 t f (z − y) + f (w) M1 . f (z) 1+t t 1+t Thus (2.11) holds. (3) We turn to proving that f is locally Lipschitzian in int(dom(f )). In fact, after (2), we only want to show that |f (z) − f (z )|
M z − z η−δ
∀z, z ∈ Bδ (θ), 0 < δ < η .
Dividing the segment zz into n equal length subsegments yi yi+1 , i = 1, . . . , n with y1 = z, yn+1 = z , and n > z−z η−δ , we have yi+1 ∈ Bη−δ (yi ) ⊂ Bη (θ). Applying (1), it follows that |f (yi+1 ) − f (yi )|
M yi+1 − yi η−δ
Then |f (z) − f (z )|
i = 1, 2, . . . , n .
M z − z . η−δ
2.2 Convex Function and Its Subdifferentials
83
We also need to study lower semi-continuity of functions defined on a topological space X. Definition 2.2.2 A function f : X → R1 ∪ {+∞} is said to be lower semicontinuous (l.s.c.), if ∀λ ∈ R1 , the level set fλ = {x ∈ X| f (x) λ} is closed. It is called sequentially lower semi-continuous (s.l.s.c.), if for any sequence {xn }, with xn → x ∈ X, we have limf (xn ) f (x) . From the definition, it follows directly that (1) f is l.s.c. ⇐⇒ epi(f ) is closed in X × (R1 ∪ {+∞}). (2) If {fα |α ∈ ∧} is a family of l.s.c. functions. Then f (x) = sup {fα (x)|α ∈ ∧} is l.s.c. (3) If f, g are l.s.c. and λ, µ 0, then λf + µg is l.s.c. Theorem 2.2.3 Let X be a Banach space and let f : X → R1 ∪ {+∞} be quasi convex. Then (1) f is l.s.c. ⇐⇒ f is weakly lower semi-continuous (i.e., l.s.c. in weak topology). (2) If X ∗ is separable, f is weakly l.s.c. ⇐⇒ f is sequentially weakly l.s.c. (3) If X = Y ∗ , where Y is a separable B-space, then f is w∗ l.s.c. ⇐⇒ f is sequentially w∗ l.s.c. Proof. (1) “⇐=” is trivial; we prove “=⇒”. Since ∀λ ∈ R1 , fλ is convex and closed. By the Hahn–Banach theorem, it is also weakly closed, i.e., f is weakly l.s.c. (2) In this case, the weak topolopy restricted to a normed bounded set is metrizable. (3) In this case, the w∗ -topology restricted to a normed bounded set is metrizable. We collect the following theorems on weak compactness, w∗ -compactness, weak sequential compactness and w∗ -sequential compactness for further reference. Theorem 2.2.4 (Banach–Alaoglu) Let X be a Banach space, and let E ⊂ X ∗ . Then E is w∗ -compact if and only if E is normed bounded and w∗ -closed. In particular, if further, X is reflexive, then for any E ⊂ X, E is weakly compact if and only if E is normed bounded and weakly closed. See for instance Larsen [La], pp. 254–257. Theorem 2.2.5 Let E be a weakly closed set in a Banach space, then it is weakly compact if and only if it is weakly sequentially compact. See for instance Larsen [La], pp. 303–309.
84
2 Fixed-Point Theorems
2.2.2 Subdifferentials Convex functions on Banach spaces are not differentiable in general. However, the notion of subdifferentials is introduced as a replacement of derivatives of differentiable functions. Definition 2.2.6 (Subdifferential) Let f : X → R ∪ {+∞} be a convex function on a vector space X. ∀x0 ∈ dom(f ), x∗ ∈ X ∗ is called a subgradient of f at x0 if x∗ , x − x0 + f (x0 ) f (x) ∀x ∈ X . The set of all subgradients at x0 is called the subdifferential of f at x0 , and is denoted by ∂f (x0 ). Geometrically, x∗ ∈ ∂f (x0 ) if and only if the hyperplane y = x∗ , x − x0 + f (x0 ) lies below the epigraph of f , i.e., it is a support of epi(f ). y
x∗2
f (x)
f (x0) x∗1 x
x0
x
Fig. 2.1.
Obviously, ∂f (x0 ) may contain more than one point. The following propositions hold, if X is a Banach space. (1) ∂f (x0 ) is a w∗ -closed convex set. (2) If x0 ∈ int(dom(f )), then ∂f (x0 ) = Ø. Proof. We apply the Hahn–Banach separation theorem to the convex set epi(f ): ∃(x∗ , λ) ∈ X ∗ × R1 \{(θ, 0)} such that
2.2 Convex Function and Its Subdifferentials
x∗ , x0 + λf (x0 ) x∗ , x + λt
85
∀(x, t) ∈ epi(f ) .
Since (x0 , f (x0 ) + 1) ∈ epi(f ), it follows that λ 0. However, λ = 0. Otherwise, we would have x∗ , x − x0 0 ∀x ∈ dom(f ). From x0 ∈ int(dom(f )), we conclude that x∗ = θ. It contradicts with (x∗ , λ) = (θ, 0). 1 ∗ x , we obtain x∗0 ∈ ∂f (x0 ). Setting x∗0 = −λ (3) ∀λ 0 ∂(λf )(x0 ) = λ∂f (x0 ). (4) If f, g : X → R1 ∪ {+∞} are convex, then ∀x0 ∈ int(dom(f )∩ dom(g)) ∂(f + g)(x0 ) = ∂f (x0 ) + ∂g(x0 ) . Proof. “⊃” is trivial; we are going to prove “⊂”. We may assume x0 = θ, f (θ) = g(θ) = 0, and θ ∈ ∂(f + g)(θ). We want to show that ∃x∗0 ∈ ∂f (θ) such that −x∗0 ∈ ∂g(θ). Since the set C = {(x, t) ∈ dom(g) × R1 | t −g(x)} is convex, and C ∩ int(epi(f )) = (θ, 0), from the fact that f (x) + g(x) 0. According to the Hahn–Banach separation theorem, ∃(x∗ , λ) ∈ X ∗ × R1 such that x∗ , x + λf (x) 0 x∗ , x + λt
∀(x, t) ∈ C .
In the same manner as the proof of (2), we verify λ > 0. Setting x∗0 = we have x∗0 , x f (x), − x∗0 , x g(x) ∀x ∈ X . i.e., x∗0 ∈ ∂f (θ), and −x∗0 ∈ ∂g(θ).
−x∗ λ ,
(5) If f : X → R ∪ {+∞} is convex, and is G-differentiable at a point x0 ∈ int(dom(f )), then ∂f (x0 ) is a single point x∗0 satisfying x∗0 , h = df (x0 , h) ∀h ∈ X. 1
Proof. We may assume x0 = θ and f (θ) = 0. Define the functional on X: L(h) = df (θ, h) . It is homogeneous. From the convexity of f , we have L(h1 + h2 ) L(h1 ) + L(h2 ), ∀ h1 , h2 ∈ X . Then L is linear. Again by the convexity: −f (−h) L(h) f (h)
∀h ∈ X .
Combining with Theorem 2.2.1, L is continuous. Therefore ∃x∗0 ∈ X ∗ such that L(h) = x∗0 , h . It follows that x∗0 ∈ ∂f (θ). Now, suppose x∗ ∈ ∂f (θ), i.e., x∗ , h f (h) ∀h ∈ X, and then x∗ , h 1 ∗ t f (th) ∀h ∈ X, ∀t > 0. By taking limit t → +0, it follows that x , h ∗ ∗ ∗ x0 , h ∀h ∈ X. Then x = x0 .
86
2 Fixed-Point Theorems
(6) If f : X → R1 ∪ {+∞} is convex and attains its minimum at x0 , then θ ∈ ∂f (x0 ). Let us present a few examples in computing the subdifferentials of convex functions. Example 1. (Normalized duality map) Let X be a real Banach space, and let f (x) = 12 x 2 . Then ∂f (x) = F (x) := {x∗ ∈ X ∗ | x∗ = x , x∗ , x = x 2 }. It is called the normalized duality map. In the particular case where X is a real Hilbert space, it is known that f (x) = x, and indeed, F (x) = x. However, for Banach spaces, f may not be differentiable. We verify ∂f (x) = F (x) as follows: “⊂” ∀x∗ ∈ ∂f (x), we have x∗ , y − x
1 ( y 2 − x 2 ) , 2
and then ∀h ∈ X, x∗ , h
1 t ( x + th 2 − x 2 ) x h + h 2 , 2t 2
as t > 0. It follows that x∗ , h x h , and then x∗ x . On the other hand, setting y = λx, we have (λ−1) x∗ , x 12 (λ2 −1) x 2 . Dividing by (λ − 1) as λ ∈ (0, 1), and then letting λ = 1 we obtain x∗ , x ≥ x 2 ; it follows that x x∗ . Thus x = x∗ , and x∗ , x = x2 . “⊃” ∀x∗ ∈ F (x), one has x∗ , y − x = x∗ , y − x 2 x∗ y − x 2 1 ( y 2 − x 2 ) 2 = f (y) − f (x) ∀y ∈ X, i.e., x∗ ∈ ∂f (x). Example 2. Let C be a convex subset of X. The support function of C is defined to be SC (x∗ ) = sup x∗ , x . Geometrically, SC (x∗ ) = x∗ , x0 if and x∈C
only if {x ∈ X| x∗ , x = SC (x∗ )} is a support hyperplane of C at x0 . We consider the subdifferential of the indicator function of C: ⎧ ◦ ⎪ if x0 ∈ C ⎨{θ} ∂χC (x0 ) = {x∗ ∈ X ∗ | SC (x∗ ) = x∗ , x0 } if x0 ∈ ∂C ⎪ ⎩ Ø if x0 ∈ C .
2.3 Convexity and Compactness
87
Example 3. Let β : R1 → R1 be a monotone nondecreasing function. Then
t ϕ(t) = β(s)ds 0
is a continuous convex function, and ∂ϕ(t0 ) = [β(t0 − 0), β(t0 + 0)] ∀t0 ∈ R1 . If further, ∃p > 1, C1 , C2 > 0 such that |β(t)| C1 + C2 |t|p−1 , then the functional
ϕ(u(x))dx J(u) = Ω
is a convex functional on Lp (Ω), where Ω is a measurable set in Rn with bound measure. We conclude that ∂J(u0 ) = [β(u0 (x) − 0), β(u0 (x) + 0)]
:= {v ∈ Lp (Ω)| β(u0 (x) − 0) v(x) β(u0 (x) + 0) ∀ a.e. Ω} where
1 p
+
1 p
= 1. In fact,
v ∈ ∂J(u0 ) ⇐⇒
v(x)(u(x) − u0 (x))
Ω
[ϕ(u(x)) − ϕ(u0 (x))] ∀u ∈ Lp (Ω) Ω
⇐⇒ v(x)(u(x) − u0 (x)) ϕ(u(x)) − ϕ(u0 (x)) a.e. ⇐⇒ v(x) ∈ ∂ϕ(u0 (x)) a.e.
2.3 Convexity and Compactness The Schauder fixed-point theorem is one of the most important fixed-point theorems in nonlinear analysis. In this section we shall study a series of fixedpoint theorems on compact convex set, including the Schauder fixed-point theorem and its extensions. All these theorems are set up by considering the Ky Fan inequality and KKM mapping from the outset. Definition 2.3.1 Suppose that X is a vector space, E ⊂ X is a subset of X. A set-valued mapping G : E → 2X is called a KKM mapping, if ∀x1 , . . . , xn ∈ n E, conv{x1 , . . . , xn } ⊂ ∪ G(xi ). i=1
Knaster, Kuratowski, and Mazurkiweicz (1929) discovered the following (KKM) theorem: Let [p0 , . . . , pn ] be an n-simplex generated by n + 1 points p0 , p1 , . . . , pn in a vector topological space, and let M0 , . . . , Mn be (n + 1) k
closed sets, satisfying [pi0 , . . . , pik ] ⊂ ∪ Mij ∀ index subset {i0 , . . . , ik } ⊂ j=0
n
{0, 1, . . . , n}. Then ∩ Mi = Ø. i=0
The following version of the KKM theorem is due to Ky Fan.
88
2 Fixed-Point Theorems
G( x1 ) x1 G ( x3 )
x3
x2 G ( x2 ) Fig. 2.2.
Theorem 2.3.2 (FKKM) Suppose that X is a locally convex Hausdorff space (LCS), E ⊂ X, and that G : E → 2$X is a closed-valued KKM map. If ∃x0 ∈ E such that G(x0 ) is compact, then x∈E G(x) = Ø. Proof. Define F (x) = G(x) ∩ G(x0 ). Then {F (x)| x ∈ E} is a family of closed subsets of G(x0 ). If one can show the finite intersection property of {F (x)| x ∈ E}, then our conclusion is proved. To this end, we only want to verify the finite intersection property for n {G(x)| x ∈ E}. If not, ∃{x1 , . . . , xn } ⊂ E, such that ∩ G(xi ) = Ø. Let i=1
us introduce the Euclidean metric d on L = span{x1 , . . . , xn }. Since L is finite dimensional, the metric derives the same topology on L, from the following facts: Each finite-dimensional LCS is normable (a consequence of the Kolmogorov normable theorem), and all norms on a finite-dimensional space are equivalent. Then the function λ(x) =
n
d(x, L ∩ G(xi )) > 0
∀x ∈ L .
i=1
Define βi (x) =
1 d(x, L ∩ G(xi )) i = 1, . . . , n . λ(x)
∀x ∈ L, we have βi (x) > 0 ⇐⇒ x ∈ G(xi ) i = 1, · · · , n . Again, define C = conv{x1 , . . . , xn } and a map ϕ : C → C to be ϕ : x →
n
βi (x)xi .
i=1
According to the Brouwer fixed-point theorem, ∃x0 ∈ C such that x0 = ϕ(x0 ). Letting I(x0 ) = {i| βi (x0 ) > 0}, we have
2.3 Convexity and Compactness
89
ϕ(x0 ) ∈ conv{xi | i ∈ I(x0 )} . But x0 ∈ G(xi ) ∀i ∈ I(x0 ) implies x0 ∈
∪
i∈I(x0 )
G(xi ). This contradicts with
the KKM mapping.
Ky Fan’s inequality is the foundation of this section, by which all fixedpoint theorems are derived. Theorem 2.3.3 (Ky Fan’s inequality) Suppose that X is an LCS and that E ⊂ X is a nonempty convex set. Assume φ : E × E → R1 satisfying (1) ∀y ∈ E x → φ(x, y) is l.s.c., (2) ∀x ∈ E y → φ(x, y) is quasi-concave, (3) ∃y0 ∈ E such that {x ∈ E| φ(x, y0 ) sup φ(x, x)} is compact . x∈E
Then ∃x0 ∈ E such that sup φ(x0 , y) sup φ(x, x) .
y∈E
x∈E
Before going to the proof of Theorem 2.3.3, we first introduce a geometric version of the statement. Given a set E, let A ⊂ E × E be a subset. Define the sections: ∀x ∈ E, A1 (x) = {y ∈ E| (x, y) ∈ A} , and ∀y ∈ E, A2 (y) = {x ∈ E| (x, y) ∈ A} . Denote the diagonal {(x, x)| x ∈ E} by . A1 (x)
y
x
A2 (y) Fig. 2.3.
In this manner, we define two set-valued mappings: E → 2E , A1 : x → A1 (x) and A2 : y → A2 (y) .
90
2 Fixed-Point Theorems
Theorem 2.3.4 Suppose that X is an LCS and that E ⊂ X is a nonempty convex set. Assume that Γ ⊂ E × E is a subset satisfying (1 ) (2 ) (3 ) (4 )
∀y ∈ E, Γ2 (y) is open, ∀x ∈ E, Γ1 (x) is convex, ∩ Γ = Ø, ∃y0 ∈ E such that E\Γ2 (y0 ) is compact.
Then ∃x0 ∈ E such that Γ1 (x0 ) = Ø. We are going to show that Theorem 2.3.3 ⇐⇒ Theorem 2.3.4. Proof. “ =⇒” Define a function on E × E: 1 (x, y) ∈ Γ φ(x, y) = 0 (x, y) ∈ Γ ∀y ∈ E, we see ⎧ ⎪ ⎨E {x ∈ E| φ(x, y) > λ} = Γ2 (y) ⎪ ⎩ Ø
if λ < 0 if 0 λ < 1 if 1 λ ,
then x → φ(x, y) is l.s.c., from (1 ). Similarly, ∀x ∈ E ⎧ ⎪ if λ < 0 ⎨E {y ∈ E| φ(x, y) > λ} = Γ1 (x) if 0 λ < 1 ⎪ ⎩ Ø if 1 λ , then y → φ(x, y) is quasi-concave, from (2 ). Since ∩ Γ = Ø, φ(x, x) = 0 ∀x ∈ E. The set {x ∈ E| φ(x, y0 ) 0} = E\Γ2 (y0 ) is compact, from (4 ). Theorem 2.3.3 is applied to conclude that ∃x0 ∈ E such that φ(x0 , y) 0 ∀y ∈ E, i.e., Γ1 (x0 ) = Ø. “ ⇐=” Define Γ = {(x, y) ∈ E × E| φ(x, y) > µ} , where µ = supx∈E φ(x, x). Then (1) and (2) imply (1 ) and (2 ) respectively. By definition Γ ∩ = Ø. Also E\Γ2 (y0 ) = {x ∈ E| φ(x, y0 ) µ} is compact. We then apply Theorem 2.3.4, and conclude that ∃x0 ∈ E such that Γ1 (x0 ) = Ø, i.e., φ(x0 , y) µ ∀y ∈ E.
2.3 Convexity and Compactness
91
Now we turn to giving a proof of Theorem 2.3.4. Proof. Define a set-valued mapping G : y → E\Γ2 (y) . From (1 ), it is a closed set-valued mapping. (4 ) implies that G(y0 ) is compact. If we can show that G is a KKM map, then the FKKM theorem is applied to conclude that ∩ G(y) = Ø, i.e., y∈E
∃x0 ∈ ∩ G(y) ⇐⇒ (x0 , y) ∈ (E × E)\Γ ∀y ∈ E ⇐⇒ Γ1 (x0 ) = Ø . y∈E
Verification of the KKM map. If not, ∃{y1 , . . . , yn } ⊂ E and ∃λ1 ≥ 0, . . . , λn ≥ 0, with Σn1 λi ≤ 1, such that w=
n
n
n
i=1
i=1
λi yi ∈ ∪ G(yi ) ⇐⇒ w ∈ ∩ Γ2 (yi ) ,
i=1
⇐⇒ yi ∈ Γ1 (w) ∀i , by (2 )
=⇒ w ∈ Γ1 (w) , =⇒ ∩ Γ = Ø .
This contradicts with (3 ).
First we mention that this theorem is very useful in game theory. In particular, the Nash equilibrium theorem and Von Neumann–Sion saddle point theorem can be derived from it. In an n-person game, there are n players {1, 2, . . . , n}. The ith person has a strategy set Ei and a payoff function fi , i = 1, 2, . . . , n. The payoff functions depend on the strategies of all players, i.e., fi , i = 1, 2, . . . , n are functions of x = (x1 , . . . , xn ), where xj ∈ Ej , j = 1, . . . , n. Nash’s solution of the game is such a strategy (x∗1 , . . . , x∗n ) ∈ E1 × · · · × En : no player has any incentive to change his strategy as long as his enemies don’t change theirs. Mathematically, let X1 , . . . , Xn be n-LCS, let Ei ⊂ Xi be nonempty compact convex sets, ∀i = 1, . . . , n, and let f1 , . . . , fn be n continuous functions on E = E1 × · · · ×En . A point x∗ = (x∗1 , . . . , x∗n ) ∈ E is called a Nash equilibrium if fi (x∗ ) fi (x∗1 , . . . , yi , . . . , x∗n ) ∀i = 1, 2, . . . , n ∀y = (y1 , . . . , yn ) ∈ E . Corollary 2.3.5 (Nash) If the continuous functions xi → fi (x1 , . . . , xi , . . . , xn )
∀i = 1, . . . , n
are quasi-concave ∀(x1 , . . . , x ˆi , . . . , xn ) ∈ Ej ∀i. Then the Nash equilibrium j=i
exists.
92
2 Fixed-Point Theorems
In fact, let us define a function on E × E: φ(x, y) =
n
(fi (x1 , . . . , yi , . . . , xn ) − fi (x1 , . . . , xn ))
i=1
It is easy to verify that all the assumptions of the Ky Fan inequality are satisfied (in particular, y → φ(x, y) is quasi-concave), and φ(x, x) = 0 ∀x ∈ E. Then ∃x∗ ∈ E satisfying φ(x∗ , y) 0 ∀y ∈ E. This is the Nash equilibrium. Corollary 2.3.6 (Von Neumann–Sion) Suppose that X, Y are reflexive Banach spaces, E ⊂ X and F ⊂ Y are nonempty closed convex sets. Assume that f : E × F → R1 satisfies (1) ∀y ∈ F , x → f (x, y) is l.s.c. and quasi-convex. (2) ∀x ∈ E, y → f (x, y) is u.s.c. and quasi-concave. (3) ∃(x0 , y0 ) ∈ E ×F such that f (x0 , y) → −∞ as y → +∞ and f (x, y0 ) → +∞ as x → +∞. Then there exist (x∗ , y ∗ ) ∈ E × F such that f (x∗ , y) f (x∗ , y ∗ ) f (x, y ∗ )
∀(x, y) ∈ E × F .
(2.12)
Proof. Define φ(u, v) = f (x, w) − f (z, y) , where u = (x, y), v = (z, w) ∈ E × F . Then we have the following: From Theorem 2.2.3, ∀v ∈ E × F, u → φ(u, v) is w.l.s.c. It is easy to verify directly that∀u ∈ E × F, v → φ(u, v) is quasi-concave, φ(u, v0 ) = f (x, y0 ) − f (x0 , y) → +∞ as x + y → +∞, where v0 = (x0 , y0 ) . The set {u ∈ E × F | φ(u, v0 ) 0} is weakly compact. We apply Ky Fan’s inequality to the space E × F with weak topology. There exists u∗ = (x∗ , y ∗ ) such that f (x∗ , w) − f (z, y ∗ ) 0 ∀(z, w) ∈ E × F , which implies f (x∗ , y) f (x∗ , y ∗ ) f (x, y ∗ ) ∀(x, y) ∈ E × F . The solution (x∗ , y ∗ ) is called the saddle point of f . As a special case where dim Y = 0, we have:
2.3 Convexity and Compactness
93
Corollary 2.3.7 Suppose that X is a reflexive Banach space. If f : X → R1 ∪ {+∞} is an l.s.c. convex function, satisfying f (x) → +∞ as x → ∞, then there exists x0 ∈ X such that f (x0 ) = min {f (x)| x ∈ X}. In the case where E and F are compact, the Von Neumann–Sion theorem is also rewritten as follows: min max f (x, y) = max min f (x, y) . x∈E y∈F
y∈F x∈E
(2.13)
Indeed, (2.12) ⇐⇒ (2.13). Proof. “=⇒” We always have β := max min f (x, y) min max f (x, y) =: α . y∈F x∈E
x∈E y∈F
However, (2.12) implies α max f (x∗ , y) f (x∗ , y ∗ ) min f (x, y ∗ ) β . y∈F
x∈E
Therefore α = β, and then (2.13) holds. “⇐=” Since both E and F are compact and the functions x → f (x, y) is l.s.c., y → f (x, y) is u.s.c., the functions x → maxy∈F f (x, y) is l.c.s, and y → minx∈E f (x, y) is u.s.c., we have (x∗ , y ∗ ) ∈ E × F such that min f (x, y ∗ ) = max min f (x, y) x∈E
y∈F x∈E
= min max f (x, y) x∈E y∈F
= max f (x∗ , y) . y∈F
Since
min f (x, y ∗ ) ≤ f (x∗ , y ∗ ) ≤ max f (x∗ , y) , x∈E
these three are equal. It (2.12) follows.
y∈F
In this sense, the Von Neumann–Sion theorem is called the mini-max theorem, which is the fundamental theorem in two-person game theory, and has many applications in other fields of mathematics (linear programming, convex programming, potential theory, the dual variational theory in mechanics etc.) Next, we turn to fixed-point theorems. For a set-valued mapping Γ : E → 2F , where E, F are Hausdorff topological vector spaces, we say Γ is upper (or lower) semi-continuous (u.s.c. or l.s.c., respectively for short), if for any closed (open resp.) set W ⊂ F , the pre-image Γ−1 (W ) = {x ∈ E| Γ(x) ∩ W = Ø} is closed (open resp.). For single-valued mappings, both u.s.c. and l.s.c. are all reduced to continuity. An alternative description of the upper semi-continuity is that for any open set W ⊂ F , the set {x ∈ E| Γ(x) ⊂ W } is open. A point x0 ∈ E is called a fixed point of Γ if x0 ∈ Γ(x0 ).
94
2 Fixed-Point Theorems
Theorem 2.3.8 (Ky Fan–Glicksberg) Suppose that X is an LCS, and that E ⊂ X is a nonempty compact convex set. If Γ : E → 2E is u.s.c., and ∀x ∈ E, Γ(x) is a nonempty closed convex subset of E, then ∃x0 ∈ E such that x0 ∈ Γ(x0 ). Proof. We prove by contradiction. If ∀x ∈ E, x ∈ Γ(x), then from the Hahn– Banach theorem ∃x∗ ∈ X ∗ ∃t ∈ R1 such that x∗ , y < t < x∗ , x
∀y ∈ Γ(x) .
Since Γ is u.s.c. there exists a neighborhood U (x) of x such that x∗ , y < t < x∗ , z
∀y ∈ Γ(z) ∀z ∈ U (x) . n
Since E is compact, we have x1 , . . . , xn ∈ E such that E ⊂ ∪ U (xi ). Let {x∗1 , . . . , x∗n } ⊂ X ∗ be the associated elements; one has x∗i , y < x∗i , x
i=1
∀y ∈ Γ(x) ∀x ∈ U (xi ) .
We construct a partition of unity of E: {βi : E → R1 , i = 1, . . . , n| βi 0,
n
βi = 1 on E and βi (x) > 0 iff x ∈ U (xi )} .
i=1
Define a continuous map f : E → X ∗ by f (x) =
n
βi (x)x∗i ,
i=1
one has f (x), y =
n
βi (x) x∗i , y <
i=1
= f (x), x
n
βi (x) x∗i , x
i=1
∀x ∈ E, ∀y ∈ Γ(x) .
(2.14)
Define φ : E × E → R1 by φ(x, y) = f (x), x − y , All the assumptions of Theorem 2.3.3 are satisfied, and we conclude that ∃x0 ∈ E such that φ(x0 , y) 0 ∀y ∈ E ; it follows that f (x0 ), x0 = min f (x0 ), y . y∈E
This contradicts (2.14), because Γ(x) ⊂ E.
2.3 Convexity and Compactness
95
This is a very general fixed-point theorem concerning convexity and compactness. The very special case is the Schauder fixed-point theorems, which are stated as follows: Corollary 2.3.9 (Schauder–Tichonov) Suppose that X is an LCS and that E ⊂ X is a nonempty compact convex set. If f : E → E is continuous, then f has a fixed point. Corollary 2.3.10 (Schauder) Suppose that X is a Banach space and that E ⊂ X is a nonempty bounded closed convex set. If f : E → E is a compact map, then f has a fixed point. Proof. It is a direct consequence of Corollary 2.3.9. Let us define E1 = convf (E) . Then E1 is a nonempty compact convex subset of E, and f : E1 → E1 .
We would rather give a direct proof of the second Schauder fixed-point theorem as follows: Proof. Define φ(x, y) = −y − f (x) on E1 × E1 , where E1 = convf (E) is compact. Applying Ky Fan’s inequality, we have x0 ∈ E1 such that supy∈E1 φ(x0 , y) ≤ supx∈E1 φ(x, x). Thus, inf x∈E1 x − f (x) ≤ inf y∈E1 y − f (x0 ) = 0, i.e., ∃x ∈ E1 such that x = f (x). Remark 2.3.11 Theorem 2.3.8 was obtained by Ky Fan [FK 1] and Glicksberg independently in 1952. The earlier results for X = Rn and X being a linear normed space are due to Kakutani (1941) [Kak] and Bohnenblust, Karlin (1950) resp. Applications 1. Convex programming Let X be a reflexive Banach space. Given l.s.c. convex functions f, g1 , . . . , gn : X → R1 , assume that the set C = {x ∈ X|gi (x) ≤ 0, i = 1, 2, . . . , n} is nonempty; find x0 ∈ C such that f (x0 ) = min {f (x)|x ∈ C} .
(2.15)
Let us introduce Lagrange multipliers {yi }n1 , yi 0, i = 1, . . . , n, and the following function: L(x, y) = f (x) +
n i=1
which is called the Lagrangian.
yi gi (x) (x, y) ∈ X × Rn+ ,
96
2 Fixed-Point Theorems
Statement 2.3.12 If (x0 , y0 ) is a saddle point of L: L(x0 , y) L(x0 , y0 ) L(x, y0 )
∀(x, y) ∈ X × Rn+ .
(2.16)
Then x0 is a solution of (2.15) and satisfies yi◦ gi (x0 ) = 0, i = 1, 2, . . . , n , where (y1◦ , . . . , yn◦ ) = y0 . Conversely, if there exists x∗ ∈ X satisfying gi (x∗ ) < 0, i = 1, 2, . . . , n, and if x0 ∈ X solves (2.15), then ∃ξ ∈ Rn+ such that (x0 , ξ) is a saddle point of L. Proof. “=⇒” From the first inequality of (2.16), we have n
(yi◦ − yi )gi (x0 ) 0 .
i=1
Letting yi → +∞ and yj = yj◦ , j = i, it follows that gi (x0 ) 0, i = n 1, 2, . . . , n. Then letting yi = 0, i = 1, 2, . . . , n, it follows that i=1 yi◦ gi (x0 ) ◦ ◦ ◦ 0. But for yi 0, we have either gi (x0 ) = 0 or yi = 0, i.e., yi gi (x0 ) = 0, i = 1, 2, . . . , n. Returning to the second inequality of (2.16), we obtain f (x0 ) f (x) +
n
yi◦ gi (x) ∀x ∈ X .
i=1
Thus f (x0 ) f (x) , whenever gi (x) 0, i = 1, 2, . . . , n. “⇐=” We consider two convex sets: E = {(y 0 , . . . , y n ) ∈ Rn+1 | y 0 < f (x0 ), y i < 0, i = 1, 2, . . . , n} , and F = {(y 0 , . . . , y n ) ∈ Rn+1 | ∃x ∈ X such that f (x) y 0 , gi (x) y i , ∀i} . Claim: E ∩ F = Ø. If not, ∃(y 0 , . . . , y n ) ∈ E ∩ F , i.e., ∃x1 ∈ X satisfying f (x1 ) ≤ y 0 < f (x0 ), gi (x1 ) y i < 0, i = 1, . . . , n. Then x0 cannot be a solution of (2.15). This is a contradiction. Applying the Hahn–Banach theorem, ∃ω = (ω0 , . . . , ωn+1 ) ∈ Rn+1 \{θ} such that n n ωi y i ωi z i (2.17) i=0
i=0
∀y = (y , . . . , y ) ∈ E, ∀z = (z , . . . , z n ) ∈ F . By setting z = (f (x0 ), g1 (x0 ), . . . , gn (x0 )), 0
n
0
2.3 Convexity and Compactness
97
n+1 y = (f (x0 )−0 , g1 (x0 )−1 , . . . , gn (x0 )−n ), ∀(0 , 1 , . . . , n ) ∈ R+ , it follows that ωi 0, i = 0, 1, . . . , n. Again, ∀ε > 0, substituting y 0 = f (x0 ) − ε, z 0 = f (x), y i = −ε, z i = gi (x) i = 1, . . . , n into (2.17) ∀x ∈ X, and letting ε → 0, we have
ω0 f (x0 )
n
ωi gi (x) + ω0 f (x)
∀x ∈ X .
(2.18)
i=1 n
Claim ω0 > 0. Otherwise, ω0 = 0, thus i=1 ωi gi (x) 0. Since we have assumed gi (x∗ ) < 0, combining with the fact that ωi 0, i = 0, 1, . . . , n, it follows that ωi = 0, i = 1, . . . , n. This is impossible. Dividing (2.18) by ω0 , we obtain f (x0 )
n
ξj gj (x) + f (x)
∀x ∈ X ,
j=1
where ξj =
ωj ω0 .
Then n
ξj gj (x0 ) = 0 ,
j=1
it follows that ξj gj (x0 ) = 0 j = 1, . . . , n. Thus f (x0 ) +
n
yj gj (x0 ) f (x0 ) +
j=1
n
ξj gj (x0 ) f (x) +
j=1
n
ξj gj (x)
j=1
∀(x, y) ∈ X × Rn+ , i.e., (x0 , ξ) is a saddle point of L. Statement 2.3.13 In the convex programming problem, assume (1) f (x) → +∞ as x → ∞, (2) ∃x0 ∈ X such that gi (x0 ) < 0, i = 1, 2, . . . , n. The problem (2.16) has a solution. Proof. Consider the Lagrangian on X × Rn+ , L(x, y) = f (x) +
n
yi gi (x) .
i=1
Obviously, ∀y ∈ Rn+ , x → L(x, y) is l.s.c. and convex, ∀x ∈ X, y → L(x, y) is linear , and by (2) and (1),
98
2 Fixed-Point Theorems
L(x0 , y) → −∞ as y → ∞ , L(x, θ) = f (x) → +∞ as x → ∞ . Applying Corollary 2.3.6, there is a saddle point of L, which is the solution of the problem (2.15), according to Statement 2.3.12. 2. Periodic solutions of ODE We study the 2π-periodic solutions of the following ODE: x ¨ + g(x) = f (t)
(2.19)
where g ∈ C(R1 ) and f ∈ L2 ([0, 2π]). Assume that ∃n ∈ N and ε > 0 such that g(x) (n + 1)2 − ε for |x| large . (2.20) n2 + ε x Statement 2.3.14 The problem (2.19) has a 2π-periodic solution under the assumption (2.20). Proof. Let γ = n2 + n + 1/2. Then ∃R > 0 such that 1 |g(x) − γx| n + − |x| as |x| R . 2 Rewrite (2.19) as x ¨ + γx + g(x) − γx − f (t) = 0
(2.21)
and define the linear operator L : x → −(¨ x + γx) with domain D(L) = {x ∈ H 2 (0, 2π)| x(0) = x(2π), x(0) ˙ = x(2π)}. ˙ Then L has a bounded inverse: L−1 : L2 (0, 2π) → D(L). Since the injection D(L) → L2 (0, 2π) is compact, (2.21) is equivalent to x = L−1 · G(x) , where G : x → g(x) − γx − f is a bounded continuous mapping on L2 (0, 2π). Then F = L−1 ◦ G is a compact map on L2 (0, 2π). 1 , Gx (n + 12 − ε) x + C, where Moreover L−1 n+1/2 √ C = 2π max |g(x) − γx|+ f 2 . Setting R1 Cε , we have F : B R1 (θ) → |x|R
B R1 (θ). The Schauder fixed-point theorem is applied to ensure the existence of x0 ∈ BR1 (θ) satisfying F (x0 ) = x0 , thus x0 ∈ D(L) and satisfies (2.21). 3. Obstacle problem Find the equilibrium position u of a membrane with a fixed boundary, acted upon by an external force f , and obstructed by an fixed obstacle ψ.
2.3 Convexity and Compactness
99
The problem is posed as a minimizing problem on a closed convex set. Let Ω ⊂ Rn be a bounded domain, f ∈ L2 (Ω), ψ ∈ H 1 (Ω). Find u ∈ H01 (Ω) such that u is the minimizer of the problem: min {J(v)| v ∈ E}, where
1 |∇v|2 − f · v , J(v) = 2 Ω and
& % E = v ∈ H01 (Ω)| v(x) ψ(x) a.e. .
From J(u) J(u + t(v − u)) ∀v ∈ E and t ∈ (0, 1), and letting t → 0, we obtain the following variational inequality:
∇u · ∇(v − u) f (v − u) ∀v ∈ E . (2.22) Ω
Ω
The existence of a weak solution for (2.22) can be studied by variational method, see Chap. 4. However, we present here a fixed-point approach. First we reduce the problem to a system of inequalities. One has u ψ a.e. ,
(2.23)
Denote the positive cone of H01 (Ω) by C = {w ∈ H01 (Ω)| w(x) 0 a.e.}. Let v∈ H01 (Ω), and v ≤ u, then v ∈ E, and let w = u − v, then (2.22) implies that Ω ∇u∇w Ω f w ∀w ∈ C i.e., −u − f 0 a.e. ,
(2.24)
Substituting v = ψ and 2u − ψ, respectively into (2.22), we obtain
(−u − f ) · (ψ − u) ≥ 0 , Ω
and
(−u − f ) · (u − ψ) ≥ 0 , Ω
respectively, therefore Ω (−u − f )(u − ψ) = 0. If u ∈ Wp2 (Ω) then, (−u − f )(u − ψ) = 0 a.e.
(2.25)
Conversely, from (2.24), (2.25) and v ≤ ψ, we obtain Ω (−∆u−f )(v−u) ≥ 0, i.e., (2.22) Thus, for u ∈ Wp2 ∩ H01 (Ω), it is a solution of the variational inequality (2.22) if and only if it satisfies the system of inequalities (2.23), (2.24), (2.25). Second, the system of inequalities is equivalent to a PDE with discontinuous nonlinearity, i.e., for ψ ∈ Wp2 (Ω) the system of inequalities (2.23), (2.24), (2.25) is again equivalent to
100
2 Fixed-Point Theorems
min {f (x), −ψ(x)} −u = f (x)
if u(x) ψ(x) if u(x) < ψ(x) .
(2.26)
Verification: “=⇒” On the set {x ∈ Ω| u(x) < ψ(x)} the equality follows from (2.25). On the complement set {x ∈ Ω| u(x) = ψ(x)} we have −ψ(x) = −∆u(x) f (x) a.e., and then −∆u(x) = −∆ψ(x) = min {f (x), −ψ(x)}. “⇐=” (2.24) is trivial. If the set U = {x ∈ Ω| u(x) > ψ} = ∅, (2.26) implies that −(u − ψ) 0 on U . This contradicts the maximum principle; then (2.23) holds, and consequently (2.25). Now, (2.26) is a PDE with discontinuous nonlinearity: −u = φ(x, u) where
min {f (x), −ψ(x)} φ(x, u) = f (x)
(2.27) if u ψ(x) if u < ψ(x) .
We shall solve the equation by the Ky Fan fixed-point theorem. First, let us define a set-valued mapping p
F : C(Ω) → 2L in Lp (Ω) ,
(Ω)
: u → F u = [φ(x, u(x)), φ(x, u(x))], the order interval
where φ(x, t) = lim φ(x, t ), and φ(x, t) = lim φ(x, t ). t →t
t →t
We consider the following maps: F
p
C(Ω) −→ 2L
(Ω)
K
2
1
j
−→ 2Wp ∩H0 (Ω) −→ 2C(Ω) ,
where K = (−)−1 and j is the embedding map. It is not difficult to verify that Γ := j ◦K◦F is u.s.c., and ∀u ∈ C(Ω), Γ(u) is a nonempty closed convex set of C(Ω). Second, we consider the set E = K(B R (θ)) of C(Ω), where R = max { f p , ψ p }. It is a nonempty compact convex set in C(Ω), and Γ : E → 2E . Ky Fan’s fixed-point theorem is applied to ensure the existence of u0 ∈ E such that u0 ∈ Γ(u0 ), i.e., u0 ∈ Wp2 ∩ H01 (Ω) satisfying ⎧ ⎪ ⎨min {f (x), −ψ(x)} −u0 (x) ∈ [min {f (x), −ψ(x)}, f (x)] ⎪ ⎩ f (x)
if u0 (x) > ψ(x) if u0 (x) = ψ(x) if u0 (x) < ψ(x) .
Third, however, on the set U = {x ∈ Ω| u0 (x) = ψ(x)}, −u0 (x) = −ψ(x) a.e. This implies that −ψ(x) f (x) a.e., i.e.,
2.3 Convexity and Compactness
min {f (x), −ψ(x)} −u0 (x) = f (x)
101
if u0 (x) ψ(x) if u0 (x) < ψ(x) .
This is exactly the solution of the PDE with discontinuous nonlinearity (2.26). Statement 2.3.15 If ψ ∈ Wp2 (Ω), f ∈ Lp (Ω), p > ◦
n 2,
then there exists
u ∈ Wp2 ∩ Wp1 (Ω) satisfying (2.26). The obstacle problem is a free boundary problem for PDEs. The boundary where the membrane detaches from the obstacle is unknown, and is to be determined simultaneously with the position of the membrane. A kind of free boundary problem, having the feature that the boundary values and the normal derivatives of the unknown function coincide on both sides of the unknown free boundary, can be studied via the above approach, i.e., pose the free boundary problem as a PDE with discontinuous nonlinearity, in which the unknown boundary is automatically absorbed into the unknown function. Fixed-point theorems for set-valued mappings can be used to study the existence of the solutions. Examples of the obstacle problem are the seepage surface in dams, the free boundary of confined plasma, water cones in oil reservoirs etc. (see K.C. Chang [Ch 1,2]). 4. Stefan problem Consider a container Ω with boundaries Γ and Γ , filled with ice. Cooling on Γ and heating on Γ (see Fig. 2.4), we study the melting process.
Γ ’’ C(t) Γ’ Ω
Fig. 2.4.
At time t, the domain occupied by water is denoted by C(t), and let θ(x, t) 0 be the temperature at the space–time (x, t) as x ∈ C(t). Both θ and C are unknown, but g(x, t) = θ(x, t)|Γ ×[0,T ] is given ∀T > 0. Let S(t) = ∂C(t) be the unknown boundary. Let us suppose that S(t) is given by an equation σ(x) = t. The temperature distribution is governed by the following equations:
102
2 Fixed-Point Theorems
⎧ ∂ ⎪ ⎪ ∂t θ − θ = 0 ⎪ ⎪ ⎪ ⎪ ⎨θ(x, t)|Γ ×[0,T ] = g(x, t), θ(x, t)|S(t) = 0 ⎪ ⎪ ⎪ ∇θ · ∇σ|S(t) = −L, ⎪ ⎪ ⎪ ⎩θ(x, 0) = 0
∀t ∈ [0, T ], ∀x ∈ C(t), ∀t ∈ [0, T ],
(2.28)
∀x ∈ Ω,
where L > 0 is a constant. The boundary conditions on S(t) are derived from the continuity of the temperature and the conservation of the energy, respectively. We set θ(x, t) if x ∈ C(t) ! θ(x, t) = 0 if x ∈ C(t) , and
t
u(x, t) =
! s)ds . θ(x,
0
The latter is called the modified Baiocchi transformation of θ. Let
t ψ(x, t) = g(x, s)ds . 0
The problem (2.28) is reduced to a parabolic equation with discontinuous nonlinearity: ⎧ ∂u ⎪ ∂t − u = −LH(u) in QT := Ω × (0, T ) , ⎪ ⎪ ⎨u| Γ ×[0,T ] = ψ , (2.29) ⎪ u|Γ ×[0,T ] = 0 , ⎪ ⎪ ⎩ u(x, 0) = 0, on Ω . Again, the advantage of the formulation (2.29) is that the unknown domain C(t) is implicitly involved. The price we paid is the nonlinear term being a discontinuous nonlinear function: the Heaviside function H(u) = 1 as u > 0, and = 0 as u 0. The problem can be solved by the Ky Fan fixed-point theorem as before. Let us introduce the anisotropic Sobolev space Wp1,2 (QT ) = {u ∈ Lp (QT )| ∂t u, ∇x u, ∇2x u ∈ Lp (QT )} , with norm: u Wp1,2 = u p + ∂t u p + ∇2x u p . The boundary values of functions in Wp1,2 (QT ) span a fractional Sobolev 1 1 1− 2p ,2− p
space Wp
(Γ × (0, T )), where Γ = Γ ∪ Γ . In particular, C 1,2 (Γ × 1 1 1− 2p ,2− p
[0, T ]) = {u ∈ C(Γ×[0, T ])| ∂t u, ∇x u ∇2x u ∈ C(Γ×[0, T ])} ⊂ Wp (0, T )).
(Γ×
2.3 Convexity and Compactness 1−
1
103
,2− 1
p Statement 2.3.16 Assume ψ ∈ Wp 2p (Γ × (0, T )), p > n, and ψ 0; the equation (2.29) has a unique solution u ∈ Wp1,2 (QT ).
Proof. Define a set-valued mapping ⎧ ⎪ ⎨1 u → F (u) = [0, 1] ⎪ ⎩ 0
u(x, t) > 0 , u(x, t) = 0 , u(x, t) < 0 ,
p
then F : C(QT ) → 2L (QT ) is u.s.c. Let Kψ : Lp (QT ) → Wp1,2 (QT ) be the affine operator f → u, where u satisfies the linear parabolic equation: ⎧ ∂u − u = f in QT , ⎪ ⎪ ⎪ ∂t ⎨ u|Γ ×(0,T ) = ψ , ⎪ u|Γ ×(0,T ) = 0, ⎪ ⎪ ⎩ u(x, 0) = 0, on Ω . Then the set-valued mapping Γ := Kψ ◦ (L ◦ F ) : C(Ω) → 2C(Ω) is a u.s.c. closed convex set-valued mapping. Define a compact convex set: 1
E = {Kψ u| u ∈ Lp (QT ), u p Lm(Ω) p } . Obviously Γ : E → 2E . According to Ky Fan’s fixed-point theorem, one finds u ∈ Wp1,2 (QT ) satisfying:
− u ∈ −LF (u) u|Γ ×(0,T ) = ψ, u|Γ ×(0,T ) = 0, u|Ω×{0} = 0 . ∂u ∂t
On the set u−1 (0) = {(x, t) ∈ QT | u(x, t) = 0}, we have ∂u ∂t − u = 0. This means u automatically satisfies (2.29). Now, we prove the uniqueness of the solution u of equation (2.29). In fact, let u1 and u2 be two solutions of (2.29), and u = u1 − u2 , then ∂u ∂t − u = −L(H(u1 ) − H(u2 )) in QT , u|∂QT \(Ω×{T }) = 0 . By the maximum principle for parabolic equations, both sets {(x, t) ∈ QT | ± u(x, t) > 0} are null sets. Thus u1 = u2 a.e. Returning to the original problem (2.28), we define C(t) = {x ∈ Ω| u(x, t) > ! C(t) ∀t ∈ (0, T ). ! t) = ∂ u(x, t), and θ(·, t) = θ| 0}, θ(x, ∂t The verification of (2.28) is omitted.
104
2 Fixed-Point Theorems
2.4 Nonexpansive Maps Let X be a Banach space, and E be a closed subset of X. A map T : E → X is called a nonexpansive map, if T (x) − T (y) x − y
∀x, y ∈ E .
In contrast with the fact that a contraction mapping T : E → E, (i.e., ∃α ∈ (0, 1) such that T (x) − T (y) α x − y ) always has a fixed point, the nonexpansive map does not in general. This can be seen by the following example: Example 1. X = c0 , the space consisting of all sequences x = {ξi }∞ 1 converging to zero, with the norm x = max |ξi | . i1
Let T (x) = (1− x , ξ1 , ξ2 , . . .) , and E be the closed unit ball. Then T : E → E is non-expansive: T (x) − T (y) = max | x − y |, max |ξi − ηi | x − y . i1
However, T does not have a fixed point. In fact, if x = T (x), then ξ1 = ξ2 = . . . = 1− x . This is impossible. We are going to study the fixed points for a nonexpansive map on a closed convex subset of a Banach space X with a normal structure, which means that for every closed convex subset E of X containing at least two points, there exists a point x0 ∈ E such that sup x − x0 < diam (E) .
(2.30)
x∈E
It is easy to see that Hilbert spaces are Banach spaces with normal structure: Assume a, b ∈ E, then ∀x ∈ E, by parallelogram identity, 2 2 x − a + b + a − b = 1 ( x − a 2 + x − b 2 ) diam (E) . 2 2 2 Taking x0 = 12 (a + b), (2.30), is satisfied. Now, for any closed bounded convex subset E, one defines a number rE = inf sup x − y . x∈E y∈E
By definition, rE diam (E). If further, X is a Banach space with a normal structure, then rE < diam (E).
2.4 Nonexpansive Maps
105
Lemma 2.4.1 If X is a reflexive Banach space and if E is a bounded closed convex set, then ∃x0 ∈ E such that sup x0 − y = rE .
y∈E
Proof. The function f (x) = sup x − y is convex, l.s.c., and coercive. We y∈E
now apply Corollary 2.3.7; there exists x0 ∈ E such that f (x0 ) = minx∈E f (x). Setting G(y) = {x ∈ E| y − x rE } ∀y ∈ E, we define ct (E) = ∩ G(y) . y∈E
Provided by Lemma 2.4.1, x0 ∈ ct (E). Therefore ct (E) is a nonempty closed convex subset of E. It is called the center of E. By definition, we have sup
x − y ≤ rE .
(2.31)
x,y∈ct(E)
Theorem 2.4.2 Suppose that E is a bounded closed convex set of a reflexive Banach space with a normal structure, and that T : E → E is nonexpansive, then the fixed-point set of T Fix (T ) is closed and nonempty. Proof. (1) Let X be the set of all nonempty closed convex subsets of E. Define the partial order on X by inclusion: C1 C2 if C2 ⊂ C1
∀C1 , C2 ∈ X .
Then (X, ) is an ordered set, in which every chain X1 has a supremum: ∩ C. The intersection is not empty, because E is weakly compact and C is C∈X1
weakly closed. (2) Define f (C) = ct (conv(T (C))) , then f : X → X is order preserving and E ≤ f (E). Applying the Amann theorem, f has a fixed point C0 ∈ X, i.e., C0 ⊂ E is a nonempty closed convex T -invariant set satisfying: C0 = ct(conv(T (C0 ))) . (3) It remains to verify that C0 consists of a single point. If not, from the fact that rC < diam (C) for all bounded closed convex sets C containing more than one point, we obtain: diam(C0 ) = diam(ct(conv(T (C0 ))))
106
2 Fixed-Point Theorems
=
sup
x−y
x,y∈ct(conv(T (C0 )))
≤ rconv(T (C0 )) < diam (conv(T (C0 ))) = diam (T (C0 )) diam (C0 ) . This is a contradiction. Thus, C0 is a single-point set in E, say C0 = {x0 }. It follows that x0 = f ({x0 }) = ct(conv (T x0 )) = T x0 . Obviously Fix (T ) is closed.
Remark 2.4.3 A Banach space X is called uniformly convex, if ∀ε > 0 ∃δ > 0 such that ∀x, y ∈ X x , y 1, x − y ε implies that x+y 2 1 − δ. Obviously, a Hilbert space is a uniformly convex Banach space. Moreover, Lp (Ω, B, µ), 1 < p < +∞ are also, but C(Ω) is not. It is known [DS] that a uniformly convex Banach space is a reflexive Banach space with normal structure. One has the following: Theorem 2.4.4 (Browder–G¨ ohde) Suppose that X is a uniformly convex Banach space, and that E is a nonempty bounded closed convex set of X. If T : E → E is nonexpansive, then T has a fixed point. A natural question: can we find out a fixed point of a nonexpansive map T by iteration as we did for contraction mappings? Starting from any point x0 ∈ E, set xi = T i x0 , ∀i, from xi+1 − xi xi − xi−1 . . . x1 − x0 , we know that { xi+1 − xi }∞ i=0 is a nonincreasing sequence. It is obviously true that even if {xi } has a convergent subsequence xni → x∗ , we still cannot conclude that x∗ is a fixed point of T , e.g., T x = −x, and x0 = θ. To this end, Mann [Man] introduced an iteration method for the following perturbed mappings: ∀α ∈ (0, 1), set Tα x = αx + (1 − α)T x . One easily verifies that if E is convex and T : E → E is nonexpansive then: (1) (2) (3) (4)
Tα : E → E. Tα is nonexpansive. Tα shares the same fixed point set with T . Let X be a uniformly convex Banach space, and E be a bounded closed convex subset of X. Let p be the fixed point of T . If further, I − T is proper (a map f is called proper if the inverse image of any compact set C, f −1 (C) is compact), then ∀α ∈ (0, 1), Tαi x−p → 0 as i → ∞ ∀x ∈ E.
2.4 Nonexpansive Maps
107
The proofs of (1)–(3) are trivial. In order to give a proof of (4). Let zi = Tαi x . Since the sequence zi+1 − zi is nonincreasing, either (1) ∃ > 0 such that zi+1 − zi ≥ , or (2) zi+1 − zi → 0. But case (1) is impossible. In fact, from the definition of the uniform convexity ∃δ0 = δ(α, ) > 0, such that zi+1 − p = α(zi − p) + (1 − α)(T zi − T p) (1 − δ0 ) max { zi − p , T zi − T p } = β zi − p ... βi x − p , where β = 1 − δ0 . This proves that zi → p, a contradiction. In case (2), by the assumption that I − T is proper, there exists a convergent subsequence zni → p. It follows that p = T p, i.e., p ∈ Fix (T ) = Fix (Tα ). Thus zn − p ≤ zni − p → 0 as n ≥ ni → ∞. We have thus proved: Theorem 2.4.5 Assume that X is a uniformly convex Banach space, and that E is a nonempty bounded closed convex set of X. If T : E → E is nonexpansive and I − T is proper, ∀α ∈ (0, 1), let Tα = αI + (1 − α)T , then ∀x ∈ E, the sequence Tαi x converges to a fixed point of T. Applications (1) The iteration method is an effective computing method in the convex feasibility problem: Given a family of closed convex sets {Ei | i = 1, . . . , n} in a Hilbert space n
H, find a point x ∈ ∩ Ei , if the intersection is nonempty. i=1
In fact, given a closed convex set E in H, ∀x ∈ H, there is a projection onto E: PE x ∈ E, which is defined by the minimizer of the problem: c = min x − y . y∈E
The existence of PE x follows from the parallelogram identity: 2 yn + ym , x − yn − ym 2 = 2( x − yn 2 + x − ym 2 ) − 4 2 where {yn } is a minimizing sequence: x − yn → c. Again by the parallelogram identity, the minimizer is unique. We define the minimizer y ∗ to be the projection PE x. The projection can be characterized by the following variational inequality: (x − PE x, PE y − PE x) 0 ∀x, y ∈ H .
(2.32)
108
2 Fixed-Point Theorems
x
E PE x
Fig. 2.5.
In fact, ∀t ∈ (0, 1), tPE y + (1 − t)PE x ∈ E. One has x − tPE y − (1 − t)PE x 2 x − PE x 2 . i.e., −2t(x − PE x, PE y − PE x) + t2 PE y − PE x 2 0 . Letting t → 0, we obtain the desired result (2.32). Statement 2.4.6 PE is a nonexpansive map on H. Proof. By definition, ∀x, y ∈ H (x − PE x, PE y − PE x) 0 , (y − PE y, PE x − PE y) 0 . Summing the two inequalities: (x − y + (PE y − PE x), PE y − PE x) 0 , it follows that PE y − PE x 2 (y − x, PE y − PE x) x − y PE y − PE x . Therefore PE is nonexpansive.
One may use Mann iteration to compute a feasible solution. Various algorithms have been introduced to improve the convergent rate and the computation. (2) Periodic solution for nonlinear evolution equations: Let X be a real Hilbert space. Given ϕ ∈ X, and f : R1+ × X → X. We consider the following nonlinear evolution equation: Find x ∈ C 1 (R1+ , X) satisfying x(t) ˙ = f (t, x(t)) t ∈ R1+ , x(0) = ϕ .
(2.33) (2.34)
2.5 Monotone Mappings
109
Statement 2.4.7 Assume ω > 0 and that (1) (2) (3) (4)
f is ω-periodic in t, i.e., f (t, x) = f (t + ω, x), (f (t, x) − f (t, y), x − y) 0 ∀t ∈ R1+ , ∀x, y ∈ X, ∃R > 0 such that (f (t, x), x) < 0, ∀t ∈ [0, ω], ∀x ∈ ∂BR (θ), ∀ϕ ∈ B R (θ), the initial-value problem (2.33) (2.34) has a solution.
Then (2.33) has a unique ω-periodic solution, i.e., x(t + ω) = x(t). Proof. From (4), we consider the Poincar´e map on X: T : x(0) → x(ω) , and want to show that T has a unique fixed point. First we show that T : B R (θ) → B R (θ) is a well-defined nonexpansive map: 1. We show that the solution for the initial-value problem is unique, i.e., if x(t), y(t) are solutions with the same initial data ϕ, then x(t) = y(t). Indeed, from d x(t) − y(t) 2 = 2(x (t) − y (t), x(t) − y(t)) dt = 2(f (t, x(t)) − f (t, y(t)), x(t) − y(t)) 0, it follows that x(t) − y(t) x(0) − y(0) .
(2.35)
Thus x(t) = y(t), and then T is well defined. 2. Moreover, (2.35) implies that T is nonexpansive. 3. We turn to showing that T maps B R (θ) into itself. Because of assumption (3) d x 2 = 2(x (t), x(t)) = 2(f (t, x(t)), x(t)) < 0 , dt whenever x(t) ∈ ∂BR (θ). If the conclusion is not true, then ∃t > 0 such that x(t) ∈ / BR (θ) and then ∃t0 ∈ (0, t), such that x(t0 ) ∈ ∂BR (θ) and x(t) ∈ / BR (θ) as t0 < t < t0 + δ for some δ > 0. But this contradicts the differential inequality. Now, we apply Theorem 2.4.2; there is a fixed point of T in B R (θ). Again applying step 1, the ω-periodic solution is also unique.
2.5 Monotone Mappings Let us consider the subdifferential of a convex function f on a vector space X: ∀x, y ∈ dom (f ), ∀x∗ ∈ ∂f (x), ∀y ∗ ∈ ∂f (y ∗ ), we have
110
2 Fixed-Point Theorems
x∗ , y − x + f (x) f (y) , y ∗ , x − y + f (y) f (x) . By addition,
y ∗ − x∗ , y − x 0
(2.36)
This is what we call the monotonicity of ∂f . Definition 2.5.1 Suppose that X is a real Banach space and that E ⊂ X is ∗ a nonempty subset. A set-valued mapping A : E → 2X is called monotone if ∗ ∗ ∀x, y ∈ E, ∀x ∈ A(x), ∀y ∈ A(y), one has y ∗ − x∗ , y − x 0 . The set {x ∈ E| A(x) = Ø} is called the domain of A, denoted by D(A), and the set ΓA = {(x, x∗ ) ∈ E × X ∗ | x ∈ D(A), x∗ ∈ A(x)} is called the graph of A. A single-valued monotone mapping is called a monotone operator. Example 1. Suppose that X is a real Hilbert space, and that A is a linear positive operator, i.e., ∀x ∈ D(A), (Ax, x) 0. Then A is a monotone operator. Example 2. Suppose that X is a real Hilbert space, and that T is a nonexpansive map, then A = id − T is a monotone operator: (Ay − Ax, y − x) = y − x 2 −(T y − T x, y − x) 0 . Example 3. Let X be a real Banach space, and let f : X → R1 ∪ {+∞} be convex, then ∂f is a monotone mapping. Example 4. (p-Laplacian) Let Ω be a bounded domain of Rn . For 1 < p < ∞, the operator ⎛⎡ ⎞ ⎤ p−2 2 n n 2 ∂ ⎜ ∂u " # ∂u ⎟ ⎦ Au = −div |∇u|p−2 ∇u = − ⎝⎣ ⎠ ∂xi ∂xj ∂xi i=1 j=1 ◦
defines a map from Wp1 (Ω) to Wp−1 (Ω),
Au, v =
1 p
+
1 p
= 1, as follows:
⎡ ⎤ p−2 2 2 n ∂u ∂u ∂v ⎣ ⎦ dx ∂xj ∂xi ∂xj Ω j=1
n
i=1
◦
∀v ∈ Wp1 (Ω) .
In fact, by the H¨ older inequality:
|∇u|
p−1
Ω
|∇v|
|∇u|
p
Ω
1
p
Ω
|∇v|
p
p1 ,
2.5 Monotone Mappings
111
◦
Au ∈ (Wp1 (Ω))∗ = Wp−1 (Ω). We verify that A is monotone: According to the elementary inequalities: |b − a|p if p 2 , p−2 p−2 (|b| b − |a| a)(b − a) cp p−2 2 (1 + |b| + |a|) |b − a| if 1 < p < 2 , older inequality, we obtain where cp > 0 is a constant, and a, b ∈ Rn , and the H¨ Au − Av, u − v
|∇u − ∇v|p Ω cp 2 2 ( Ω (1 + |∇u| + |∇v|)p )1− p ( Ω |∇u − ∇v|p ) p
if p 2 , if 1 < p < 2 .
The requirement of the continuity for monotone operators is very weak. Definition 2.5.2 Let X be a real Banach space and let E ⊂ X be a nonempty subset. A map A : E → X ∗ is called hemi-continuous at x0 ∈ E, if ∀y ∈ X, ∗ ∀tn ↓ 0 with x0 + tn y ∈ E, imply that A(x0 + tn y) A(x0 ). It is called demi∗ continuous at x0 ∈ E, if ∀{xn } ⊂ E, xn → x0 implies that A(xn ) A(x0 ), ∗ where ∗ is the w -convergence. Obviously, “continuous” =⇒ “demi-continuous” =⇒ “hemi-continuous” . ◦
The monotone operator in Example 4 is hemi-continuous. In fact, ∀u, v, w ∈
Wp1 (Ω), we consider the function t → A((1 − t)x + ty), w , and verify the continuity. Now ⎡ ⎤ p−2 2 2 n ∂v ∂u ⎣ ⎦ +t (1 − t) A((1 − t)u + tv), w = ∂xj ∂xj Ω j=1
×
n i=1
∂v ∂u +t (1 − t) ∂xi ∂xi
∂w . ∂xi
Since the integrand on the RHS is dominated by an integrable function (|∇u|+ |∇v|)p−1 |∇w|, the Lebesgue dominance theorem is applied. An important property for monotone operators reads as: Lemma 2.5.3 Let E be a convex subset of a real Banach space X. If A : E → X ∗ is hemi-continuous and monotone, then for any sequence {xj } ⊂ E with xj x ∈ E and lim A(xj ), xj − x 0, we have lim A(xj ), xj − y A(x), x − y
∀y ∈ E .
112
2 Fixed-Point Theorems
Proof. First we claim that lim A(xj ), xj − x = 0 .
(2.37)
Indeed, since A is monotone, it follows that 0 = lim A(x), xj − x lim A(xj ), xj − x lim A(xj ), xj − x 0 . Again by the monotonicity and (2.37), ∀z ∈ E lim A(xj ), x − z = lim A(xj ), xj − z lim A(z), xj − z = A(z), x − z . (2.38) Now, ∀y ∈ E, ∀tn ↓ 0, substituting z = zn := (1 − tn )x + tn y into (2.38), we obtain (2.39) lim A(xj ), x − y A(zn ), x − y . By using the hemi-continuity, the RHS of (2.39) tends to A(x), x − y . Combining (2.37) (2.39) and the last fact, it follows that lim A(xj ), xj − y A(x), x − y .
(2.40)
Remark 2.5.4 The deduction argument from (2.37) to (2.40) is called Minty’s trick, in which a combination of the monotonicity and the hemicontinuity is applied. This lemma is substantial in the study of monotone operators. The following notion on pseudo-monotonicity is abstracted from it. Definition 2.5.5 Let X be a reflexive Banach space and let E ⊂ X be a nonempty closed convex subset. An operator A : E → X ∗ is called pseudo monotone, if (1) ∀ finite-dimensional linear subspace L ⊂ X, A|L∩E : L ∩ E → X ∗ is demi-continuous. (2) ∀ sequence {xj } ⊂ E with xj x ∈ E, the condition lim A(xj ), xj −x 0 implies that lim A(xj ), xj − y A(x), x − y , ∀y ∈ E. Thus, a hemi-continuous monotone operator is pseudo monotone. Moreover, a completely continuous mapping A : X → X ∗ (i.e., for any xj x in X, we have Axj → Ax in X ∗ ) is pseudo monotone. In contrast with the fixed-point problem for compact maps and nonexpansive mappings, we shall study the surjection of pseudo monotone operators, because the latter maps a subset of a Banach space into its dual space. The following generalized Ky Fan’s inequality is the basis of this section. Theorem 2.5.6 (Brezis, Nirenberg, Stampacchia) Assume that E is a nonempty convex set of an LCS X. Assume Φ : E × E → R1 satisfying
2.5 Monotone Mappings
113
(1) ∀ finite-dimensional linear subspace L of X, ∀y ∈ E ∩ L, x → Φ(x, y)|L∩E is l.s.c. (2) ∀x ∈ E, y → Φ(x, y) is quasi concave. (3) ∃ a compact set K ⊂ X, ∃y0 ∈ E such that {x ∈ E| Φ(x, y0 ) 0} ⊂ K. (4) sup Φ(x, x) = 0. x∈E
(5) ∀x, y ∈ E and for any net xα → x, ∀t ∈ [0, 1], Φ(xα , (1 − t)x + ty) 0 implies that Φ(x, y) 0. Then ∃x0 ∈ E such that sup Φ(x0 , y) 0. y∈E
Proof. Again we transform the problem into its geometric version by setting Γ = {(x, y) ∈ E × E| Φ(x, y) > 0}. Then (1)–(5) are transformed into: (1 ) ∀L, letting EL = E ∩ L and ΓL = Γ ∩ (L × L), ∀y ∈ EL ΓL 2 (y) is open in E. (2 ) ∀x ∈ E, Γ1 (x) is convex. (3 ) ∃y0 ∈ E such that E\Γ2 (y0 ) ⊂ K. (4 ) ∩ Γ = Ø, where is the diagonal of E × E. (5 ) Let xy be the segment connecting x and y, then Γ1 (xα ) ∩ xy = Ø implies y ∈ Γ1 (x) ∀y ∈ E for any net xα → x. Now we set X = {L| finite-dimensional linear subspace, with y0 ∈ L and EL = Ø}. ∀L ∈ X, applying Ky Fan’s inequality, ∃xL ∈ EL such that ΓL 1 (xL ) = Ø. From (3 ), xL ∈ K as L ∈ X. ∀L ∈ X, setting L L N = {x ∈ K| Γ1 (x) = Ø}, from the above discussion, it is nonempty. L We claim that the family {N | L ∈ X} has the finite intersection property: Indeed, ∀ L1 , . . . , Ln ∈ X, setting L = span {L1 , . . . , Ln } we have n
n
i=1
i=1
Li L Li L ∈ X. Then ΓL 1 (xL ) = ∪ Γ1 (xL ) and N = ∩ N . Since K is compact, L
Z := ∩ N = Ø. L∈X
We shall prove that ∀x ∈ Z, Γ1 (x) = Ø. To this end, ∀y ∈ E, we choose L L L ∈ X such that the segment xy ⊂ L. Since x ∈ N , ∃ a net xL α ∈ N , such L L that Γ1 (xα ) ∩ xy = Ø, and xα → x. From assumption (5 ), y ∈ Γ1 (x). Since y ∈ E is arbitrary, we obtain Γ1 (x) = Ø, Therefore there exists x0 ∈ Z such that sup Φ(x0 , y) 0. y∈E
In many of the applications, the LCS is taken to be a reflexive Banach space with its weak topology. Since then for weakly closed set it is weakly compact if and only if it is sequentially weakly compact (cf. Theorem 2.2.5), the net convergence in condition (5) of the above theorem can be replaced by the sequential convergence. The following theorem is the foundation of the theory of variational inequalities, which arise in free boundary problems for partial differential equations.
114
2 Fixed-Point Theorems
Theorem 2.5.7 (Hartman–Stampacchia) Suppose that X is a real reflexive Banach space, and that E ⊂ X is a nonempty closed convex set. Assume (1) A : E → X ∗ is pseudo monotone, (2) ϕ : E → R1 is convex and l.s.c., (3) ∃y0 ∈ E ∃R0 > 0 such that Ax, x − y0 + ϕ(x) − ϕ(y0 ) > 0
as x R0 and x ∈ E .
Then ∃x0 ∈ X such that Ax0 , x0 − y + ϕ(x0 ) − ϕ(y) 0,
∀y ∈ E .
Proof. (1) Assign the weak topology on X, and define Φ(x, y) = Ax, x − y + ϕ(x) − ϕ(y) . It is easy to see that conditions (1)–(4) of Theorem 2.5.6 are satisfied. Let us verify (5). ∀x, y ∈ E ∀t ∈ [0, 1], assume xj x and Φ(xj , (1 − t)x + ty) 0. Setting t = 0 and 1 separately, we have lim A(xj ), xj − x lim [ϕ(x) − ϕ(xj )] 0
(2.41)
and lim A(xj ), xj − y lim [ϕ(y) − ϕ(xj )] ϕ(y) − ϕ(x) .
(2.42)
From the pseudo monotonicity, it follows that lim A(xj ), xj − y A(x), x − y .
(2.43)
Combining (2.42) and (2.43), we obtain Φ(x, y) 0. (2) Now we apply Theorem 2.5.6 and conclude the existence of x0 ∈ E satisfying Φ(x0 , y) 0. This is the desired conclusion. Theorem 2.5.8 (F. Browder) Suppose that X is a real reflexive Banach space, and that A : X → X ∗ is pseudo monotone and coercive, i.e., x −1 A(x), x → +∞ as x → +∞. Then A is surjective. Proof. We shall prove that ∀z ∈ X ∗ , ∃x0 ∈ X satisfying A(x0 ) = z. Define T : x → A(x) − z. Then T is pseudo monotone and satisfies T x, x > 0 as x > R0 , for some R0 > 0, provided by the coerciveness of A. We apply the Hartman– Stampacchia theorem to conclude the existence of x0 ∈ X satisfying T x0 , x0 − y 0 ∀y ∈ X. Since y is arbitrary in the linear space X, it follows that Ax0 = z.
2.5 Monotone Mappings
115
As a consequence, we return to Example 4, the p− Laplacian −∆p : W01,p (Ω) → W −1,p (Ω), 1 < p < ∞, is a homeomorphism. The surjection follows from Browder’s theorem, and the injection as well as the continuity of the inverse mapping follow from the inequality in the verification of the monotonicity. Corollary 2.5.9 (Hartman–Stampacchia) Suppose that A is a hemicontinuous monotone operator defined on the unit ball B centered at θ of a Hilbert space H. If Ax = λx, ∀x ∈ ∂B, ∀λ < 0 then ∃x0 ∈ B such that Ax0 = θ. Proof. Since A is pseudo monotone, we apply Theorem 2.5.7 to conclude the existence of x0 ∈ B satisfying (Ax0 , x0 − y) 0 ∀y ∈ B . ◦
If x0 ∈ B, then we have Ax0 = θ. Otherwise x0 ∈ ∂BR ∀y ∈ BR , we decompose y = (1 − t)x0 + y ⊥ , and Ax0 = λx0 + y0⊥ , where t > 0, y ⊥ ⊥x0 , y0⊥ ⊥x0 , and λ ∈ R1 . Then (2.44) −λt x0 2 +(y0⊥ , y ⊥ ) 0 . Since y ⊥ is arbitrary, first letting t → +0, we obtain y0⊥ = θ, i.e., Ax0 = λx0 . By the assumption, λ 0. Again by (2.44) λt x0 2 0 ,
which implies that λ = 0. Therefore Ax0 = θ.
y
θ
x0 y⊥ (1 − t)x0
Fig. 2.6.
Corollary 2.5.10 (Minty) Suppose that H is a real Hilbert space, and that A is a continuous strongly monotone operator, i.e., ∃c > 0 such that (Ax − Ay, x − y) c x − y 2 Then A is a homeomorphism.
∀x, y ∈ H .
(2.45)
116
2 Fixed-Point Theorems
Proof. Obviously, A is pseudo monotone and coercive. As a consequence of the Browder theorem, A is surjective. The injectivity of A as well as the continuity of A−1 follows from the inequality (2.45). Applications 1. Elliptic variatiational inequality Let A be the p-Laplacian defined in Example 4 and let Ω ⊂ Rn be a ◦
bounded domain. We consider the closed convex subset of X = Wp1 (Ω) with 1 < p < ∞: ◦
E = {u ∈ Wp1 (Ω)| |∇u(x)| 1 a.e.} . Given f ∈ Wp1 (Ω), where p =
p p−1 ,
find u ∈ E such that
Au, v − u f, v − u ∀v ∈ E . The existence of a solution follows from the Hartman–Stampacchia theorem directly. This is a free boundary problem, in fact the solution u, if it is regular, satisfies the equation: ⎧ p−2 ⎪ in Ω1 , ⎨−div (|∇u| ∇u) = f |∇u| = 1 in Ω2 , ⎪ ⎩ u and ∇u coincide on the interface of Ω1 and Ω2 , where Ω1 = {x ∈ Ω| |∇u(x)| < 1} , and Ω2 = Ω\Ω1 . The same method can be applied to the obstacle problem and the Stefan problem studied in Sect. 2.3. But in these problems, the working spaces should be taken to be the following Hilbert spaces: H01 (Ω) and H 1 ([0, T ] × Ω) respectively. 2. Weak solutions for quasi-linear elliptic equations Let Ω be a bounded domain of Rn . We study the weak solution of the quasi-linear elliptic equation: n ∂ i=1 ∂xi Ai (x, u(x), ∇u(x)) + B(x, u(x), ∇u(x)) = f (x) in Ω , u|∂Ω = 0 ,
where we make use of the following structural condition on A = {Ai }n1 and B:
(1) B ∈ C(Ω × R1 × Rn , R1 ), A ∈ C(Ω × R1 × Rn , Rn ),
2.5 Monotone Mappings
(2) ∃p ∈ (1, ∞), ∃g ∈ Lp (Ω), p =
p p−1 ,
117
∃C > 0 such that
A(x, u, ξ) g(x) + C(|u| + |ξ|)p−1 , |B(x, u, ξ)| g(x) + C(|u| + |ξ|)p−1 , (3)
[A(x, u, ξ)− A(x, u, ξ )]·(ξ−ξ ) > 0, ∀(x, u) ∈ Ω×R1 , ∀ξ, ξ ∈ Rn , ξ = ξ , and (4) 1 A(x, u, ξ) · ξ → +∞ as |ξ| → ∞, (x, u, ξ) ∈ Ω × R1 × Rn . p−1 1 + |ξ| + |ξ|
Remark 2.5.11 Condition (3) (i.e., the monotone condition) implies the el
lipticity of the differential operator: u(x) → div A(x, u(x), ∇u(x)). ◦
Let X = Wp1 (Ω); we define a form on X × X:
a(u, v) = [A(x, u(x), ∇u(x)) · ∇v(x) + B(x, u(x), ∇u(x))v(x)]dx Ω
× ∀(u, v) ∈ X × X . From (1) and (2), |a(u, v)| C( u p−1 1,p + g p ) v 1,p . We define T : X → X ∗ by T u, v = a(u, v), where , is the duality between X ∗ and X. In order to verify that T is pseudo monotone, we define A : X × X → X ∗ as follow:
A(x, u, ∇w) · ∇v + B(x, u, ∇u)v ∀u, v, w ∈ X . A(u, w), v = Ω
Ω
We conclude: (a) A(u, u) − A(u, w), u − w 0, ∀u, w ∈ X. (b) ∀u ∈ X, w → A(u, w) is bounded and demi-continuous. (c) If uj u in X and if A(uj , uj ) − A(uj , u), uj − u → 0, then A(uj , w) A(u, w) in X ∗ ∀w ∈ X. (a) and (b) are obviously true; we prove (c). Proof. From uj u in X, we have uj → u(in Lq (Ω)) and uj → u a.e. after a subsequence, and then ∀w ∈ X, → − − → A (x, uj (x), ∇w(x)) → A (x, u(x), ∇w(x))
a.e.
118
2 Fixed-Point Theorems
Combining with the growth condition (2), → − → − A (·, uj , ∇w) → A (·, u, ∇w) in Lp (Ω, Rn ) . Thus
− → A (x, uj , ∇w)∇uj →
Ω
and
Ω
− → A (x, u, ∇w)∇u ,
(2.46)
Ω
− → A (x, uj , ∇w)∇v →
A(x, u, ∇w)∇v .
(2.47)
Ω
It remains to verify that gj := B(·, uj , ∇uj ) g := B(·, u, ∇u) (Lp (Ω)). The difficulty is that we only have ∇uj ∇u in Lp (Ω, Rn ), and that B is nonlinear with respect to ∇u. How can we pass the limit? If one can show that ∇uj → ∇u a.e., then gj → g a.e., and then we claim that gj g in Lp (Ω). In fact, let Ek = {x ∈ Ω||gj (x)−g(x)| ≤ 1, j ≥ k}; we have E1 ⊂ E2 ⊂ . . . , and mes(Ek ) → mes(Ω). Since ∀χ ∈ Lp (Ω) with support in Ek , we have (g − g)χ → 0, from the Lebesgue dominance theorem, and those χ span a Ω j dense set in Lp (Ω); in combination with the fact that gj p is bounded, the conclusion follows. We turn to verifying that ∇uj → ∇u a.e., and define the function: → − → − Fj (x) = [ A (x, uj (x), ∇uj (x)) − A (x, uj (x), ∇u(x))] · ∇(uj (x) − u(x)) . By (3), Fj (x) 0. As a consequence of our assumption, Ω Fj (x)dx → 0. From Fatou’s lemma, it follows that Fj (x) → 0 a.e. Therefore there exists a / Z. null set Z such that uj (x) → u(x), and Fj (x) → 0 ∀x ∈ Firstly, we claim that ∃ a measurable function M (x) < +∞, such that |∇uj (x)| M (x) ∀x ∈ Z .
(2.48)
From (2), → − Fj (x) ≥ A (x, uj (x), ∇uj (x))∇uj (x) − C1 (x)(1 + |∇uj (x)| + |∇uj (x)|p−1 ) where C1 (x) depends on u(x) and ∇u(x). If (2.48) were false, then there would be a positive measure set E, on which |∇uj (x)| → +∞. It follows that Fj (x) → +∞, from (4). But, this is a contradiction. Secondly, we claim that ∀x ∈ Z, ∇uj (x) → ∇u(x). In fact, let ξ(x) be a limit point of ∇uj (x). From Fj (x) → 0 it follows that: → − → − [ A (x, u(x), ξ(x)) − A (x, u(x), ∇u(x))] · (ξ(x) − ∇u(x))dx = 0 . Applying the monotone relation (3), we have ξ(x) = ∇u(x). Since all limit points of ∇uj (x) equal ∇u(x), we obtain ∇uj (x) → ∇u(x) a.e. Combining (2.47) with this fact, we obtain A(uj , w) A(u, w) in X ∗ ∀w ∈ X.
2.5 Monotone Mappings
119
(d) If uj u in X and A(uj , v) ψ in X ∗ , then A(uj , v), uj → ψ, u . → − − → In fact, we already have uj → u (Lp (Ω, R1 )) and A (·, uj , ∇v) → A (·, u, ∇v) (Lp (Ω, Rn )). Thus
→ − A (x, uj , ∇v)∇(uj − u) + B(x, uj , ∇uj )(uj − u) A(uj , v), uj = Ω
+ A(uj , v), u → ψ, u . After these preparations, we turn to verifying that the operator T , defined by the form a, is pseudo monotone. Since u → T (u) is obviously demicontinuous, it is sufficient to prove that uj u and lim T (uj ), uj − u 0 implies that lim T (uj ), uj − v T (u), u − v ∀v ∈ X. First we show that T (uj ), uj − u → 0, and define the sequence: bj = A(uj , uj ) − A(uj , u), uj − u . By (a), bj 0. Since A(uj , u) is bounded in X ∗ , there exists a subsequence, for which we don’t change the subscript, such that A(uj , u) ψ in X ∗ . By (d), A(uj , u), uj → ψ, u . Thus, A(uj , u), uj − u → 0. But by assumption, lim A(uj , uj ), uj − u = lim T (uj ), uj − u 0 , therefore bj → 0. It follows T (uj ), uj − u → 0. It remains to show: lim T (uj ), u − v ≥ T (u), u − v , from (a), T (uj ) − A(uj , w), uj − w 0, ∀w ∈ X . Letting w = (1 − θ)u + θv, θ ∈ (0, 1), ∀v ∈ X, we have θ T (uj ), u − v θ A(uj , w), u − v + A(uj , w), uj − u − T (uj ), uj − u . By taking limit, lim T (uj ), u − v A(u, w), u − v
or lim T (uj ), u − v A(u, (1 − θ)u + θv), u − v ∀θ ∈ (0, 1) letting θ → 0, by (b), the RHS = T (u), u − v , this is the desired inequality. Statement 2.5.12 Under the above structural conditions, we assume further: (5) ∃C1 > 0 ∃h ∈ L1 (Ω) such that − → A (x, u, ξ) · ξ > C1 |ξ|p − h(x)
∀(x, u, ξ) ∈ Ω × R1 × Rn . ◦
Then ∀f ∈ Lp (Ω), there exists a weak solution u ∈ Wp1 (Ω) of the quasilinear elliptic equation:
120
2 Fixed-Point Theorems
− → A (x, u(x), ∇u(x)) · ∇v(x) + B(x, u(x), ∇u(x))v(x) =
Ω
f (x)v(x) Ω ◦
× ∀v ∈ Wp1 (Ω) . Proof. It is reduced to find the fixed point of the pseudo monotone operator T . Since (5) implies the coerciveness: 1 1 T u, u = a(u, u) → +∞ . u 1,p u 1,p The existence of u follows from Browder’s theorem.
It is worth noting that in the above statement, no a priori estimate has been used. In the verification of the pseudo monotonicity, a crucial point is the ellipticity condition (or the monotone condition (3)). The statement can be extended to high-order quasi-elliptic equations. This is an approach where no compactness is concerned.
2.6 Maximal Monotone Mapping To a set-valued mapping A, ∀x ∈ D(A), one may take any nonempty subset D(A1 ) of D(A) and a nonempty subset A1 (x) of A(x), and define a new set-valued mapping A1 : x → A1 (x) ∀x ∈ D(A1 ). If A is monotone, so is A1 . In order to avoid the indetermination of domain and the image of setvalued monotone mappings in the study of their surjectivity, one introduces the notion of maximal monotone mappings. First, we define the graph ΓA := {(x, y) ∈ X × Y | x ∈ D(A), y ∈ A(x)} of a set-valued mapping A : X → 2Y . Definition 2.6.1 Assume that A1 and A2 are two monotone set-valued map∗ pings from X to 2X . If ΓA1 ⊂ ΓA2 , then we say that A2 is a monotone extension of A1 . A monotone mapping, which does not have any proper monotone extension, is called a maximal monotone mapping. ∗ In other words, A : X → 2X is maximal monotone iff for (x, x∗ ) ∈ X ×X ∗ , y ∗ − x∗ , y − x ≥ 0 ∀ (y, y ∗ ) ∈ ΓA ⇒ (x, x∗ ) ∈ ΓA . Example 1. Assume that φ : R1 → R1 is a nondecreasing function. The map A : u → [φ(u−0), φ(u+0)] is maximal monotone, but the map B : u → φ(u−0) is not, if φ(u − 0) = φ(u + 0). Example 2. A hemi-continuous monotone operator A is maximal monotone. In fact, for (x, x∗ ) ∈ X × X ∗ , if Ay − x∗ , y − x ≥ 0 ∀ y ∈ X ,
2.6 Maximal Monotone Mapping
121
then ∀z ∈ X, ∀t ∈ [0, 1], we have A((1 − t)x + tz) − x∗ , z − x ≥ 0 . Letting t → 0, it follows that Ax−x∗ , z −x ≥ 0. Since z ∈ X is arbitrary, we obtain Ax = x∗ . Moreover, we shall prove later that the subdifferential of a proper l.s.c. convex function is maximal monotone. Since maximal monotone mappings occur in convex analysis, free boundary boundary problems in mathematical physics, and nonlinear semigroups. we shall extend most of the results of monotone operators to their set-valued counterpart-maximal monotone mappings. The central problem is on the surjectivity. Now we are going to extend the notions of the demi-continuity and the hemi-continuity for single-valued mappings to set-valued mappings. Definition 2.6.2 Suppose that E is a nonempty subset of a real Banach ∗ space X. A mapping A : E → 2X is called weakly ∗ upper hemi-continuous ∗ (w u.h.c.,) if ∀x, y ∈ E ∀z ∈ X, the function t → A((1 − t)x + ty), z is a u.s.c. set-valued function at t = 0. It is called upper demi-continuous (u.d.c.) 1 if ∀z ∈ X, x → A(x), z is u.s.c. from E to 2R . Obviously, u.d.c. implies w∗ u.h.c., and for single-valued mappings, w∗ u.h.c. is hemi-continuous, and u.d.c. is demi-continuous. ∗ Note that for any set-valued mapping A : D(A) → 2X , the inverse mapping A−1 : X ∗ → 2X , x∗ → {x ∈ D(A)| x∗ ∈ A(x)} is well defined (in case x∗ ∈ rang (A), one defines A−1 (x∗ ) = Ø). In particular, if X is reflexive then A is (maximal) monotone ⇐⇒ A−1 is (maximal) monotone. Lemma 2.6.3 Assume that A : X → 2X ∃ε > 0 such that A is bounded on Bε (x0 ).
∗
is monotone. Then ∀x0 ∈ X,
Proof. We may assume x0 = θ. We prove it by contradiction. Assume that A is not bounded in any neighborhood of θ, i.e., ∃xn → θ ∃x∗n ∈ A(xn ) such that x∗n → ∞. We claim that ∀ε > 0 ∃z ∈ Bε (θ) and a subsequence {n } such that (2.49) x∗n , xn − z → −∞ . Then from the monotonicity, ∀z ∗ ∈ A(z), we have x∗n − z ∗ , xn − z 0 . (2.49) implies that z ∗ , z = +∞. Obviously, this is impossible. Let us return to proving the existence of z satisfying (2.49). If it is not true, then ∃ε > 0 ∀z ∈ B ε (θ) ∃Cz ∈ R1 such that x∗n , xn − z Cz
∀n .
122
2 Fixed-Point Theorems
Now, ∀k ∈ N, let Ek = {u ∈ B ε (θ)| x∗n , xn − u −k, ∀n} . ∞
Obviously, Ek are closed, and ∪ Ek = B ε (θ). From the Baire category ark=1
gument, ∃r > 0, ∃y0 ∈ B (θ) and ∃k0 ∈ N such that Br (y0 ) ⊂ Ek0 . Setting C = C−y0 , we have x∗n , xn + y0 C ∀n , and
x∗n , xn − u ≥ −k0 , ∀u ∈ B r (y0 ) .
By addition, x∗n , 2xn + y0 − u C − k0
∀u ∈ B r (y0 ) .
Setting v = 2xn + y0 − u, for sufficiently large n, such that xn < 4r , we obtain x∗n , v C − k0 ∀v ∈ B r2 (θ) . This means x∗n proved.
2|C−k0 | , r
which contradicts x∗n → ∞; (2.49) is ∗
Proposition 2.6.4 Assume that A : X → 2X is a maximal monotone mapping with D(A) = X on a reflexive real Banach space X. Then: (1) ∀x ∈ X A(x) is a nonempty closed convex set. (2) A is u.d.c. (3) If there is a sequence {xj }, and a sequence x∗j ∈ A(xj ) satisfying xj x and lim x∗j , xj − x 0, then ∃x∗ ∈ A(x) such that lim x∗j , xj − y x∗ , x − y
∀y ∈ X .
Proof. (1) If x∗i ∈ A(x) i = 1, 2, then ∀y ∈ X, ∀y ∗ ∈ A(y) we have y ∗ − x∗i , y − x 0,
i = 1, 2 .
Therefore y ∗ − (λx∗1 + (1 − λ)x∗2 ), y − x 0 ∀λ ∈ [0, 1] . By the maximality, λx∗1 + (1 − λ)x∗2 ∈ A(x). Then A(x) is convex. Similarly, A(x) is closed. (2) In order to show that A is u.d.c., i.e., ∀z ∈ X, x → A(x), z is a u.s.c. 1 set-valued mapping: X → 2R . We prove it by contradiction. If ∃z0 ∈ X ∃ε0 > ∗ 0 ∃xn → x0 and ∃xn ∈ A(xn ) such that x∗n , z0 ∈ A(x0 ), z0 +(−ε0 , ε0 ). From Lemma 2.6.3, {x∗n } is bounded, and then it possesses a weakly convergent subsequence: x∗n x∗0 in X ∗ . Since A is maximal, x∗0 ∈ A(x0 ). This is a contradiction. (3) The proof is the same as that for single-valued monotone operators; cf. Lemma 2.5.3.
2.6 Maximal Monotone Mapping
123
Conversely, we have: Proposition 2.6.5 Assume that X is a reflexive real Banach space and that ∗ A : X → 2X is a w∗ .u.h.c. monotone mapping. If ∀x ∈ X, A(x) is a nonempty closed convex set, then A is maximal monotone. Proof. We shall verify that for (x, x∗ ) ∈ X × X ∗ , if y ∗ − x∗ , y − x 0 ∀(y, y ∗ ) ∈ ΓA ,
(2.50)
then (x, x∗ ) ∈ ΓA . For otherwise, according to the Ascoli separation theorem, ∃z ∈ X such that x∗ , z > sup { w∗ , z | w∗ ∈ A(x)} . Since A is w∗ .u.h.c. ∃δ > 0 such that x∗ , z > yt∗ , z
∀yt∗ ∈ A(yt ) ∀t ∈ (0, δ) ,
where yt = x + tz. But from the monotonicity, we have t yt∗ − x∗ , z = yt∗ − x∗ , yt − x 0 . This is a contradiction.
The following theorem is a characterization of maximal monotone mappings on Hilbert spaces. Theorem 2.6.6 (Minty) Suppose that H is a Hilbert space, and that A : H → 2H is a set-valued mapping. The following statements are equivalent: (1) A is maximal monotone. (2) A is monotone and I + A is surjective. (3) ∀λ > 0 (I + λA)−1 is nonexpansive. Before going on to prove Theorem 2.6.6, we now introduce the following notion. Definition 2.6.7 Suppose that E is a nonempty subset of a real Hilbert space H. A set-valued mapping T : E → 2H is called expansive if ∀x, y ∈ E, ∀x∗ ∈ T (x), ∀y ∗ ∈ T (y), x∗ − y ∗ x − y . Obviously, T : H → 2H is surjective and expansive iff T −1 is nonexpansive. In this case, T −1 is single valued and injective. Lemma 2.6.8 A : E → 2H is monotone if and only if ∀λ > 0, Tλ = I + λA is expansive.
124
2 Fixed-Point Theorems
Proof. Since ∀x, y ∈ E, ∀x∗ ∈ A(x), ∀y ∗ ∈ A(y), we have y−x+λ(y ∗ −x∗ ) 2 = y−x 2 +2λ(y ∗ −x∗ , y−x)+λ2 y ∗ −x∗ 2 . (2.51) “=⇒” If A is monotone, then the RHS of (2.51) y − x 2 , i.e., Tλ is expansive. “⇐=” If Tλ is expansive, then the LHS of (2.51) y − x 2 . Letting λ → 0, A is monotone. Lemma 2.6.9 (Deburnner–Flor) Suppose that E is a nonempty closed convex subset of a real Hilbert space H. If A : E → 2H is monotone, then ∀y ∈ H, ∃x ∈ E such that (η + x, ξ − x) (y, ξ − x)
∀(ξ, η) ∈ ΓA .
Proof. ∀(ξ, η) ∈ ΓA , let us define C(ξ, η) = {x ∈ E| (η + x − y, ξ − x) 0} . $ Ø. Since C(ξ, η) Our conclusion is equivalent to {C(ξ, η)| (ξ, η) ∈ ΓA } = is a bounded closed convex set, it is weakly closed and E is weakly compact. It is sufficient to verify that {C(ξ, η)| (ξ, η) ∈ ΓA } has the finite intersection property. Indeed, ∀ξ1 , . . . , ξn ∈ E ∀ηi ∈ A(ξi ), i = 1, . . . , n, we consider the simplex λi = 1 , n = λ = (λ1 , . . . , λn )| λi 0 ∀i, and the function Φ(λ, µ) =
n
µi (x(λ) + ηi − y, x(λ) − ξi )
∀(λ, µ) ∈ n × n ,
i=1
where x(λ) =
n i=1
λi ξi . It is easy to see that ∀µ ∈ n , λ → Φ(λ, µ) is continuous, ∀λ ∈ n , µ → Φ(λ, µ) is linear ,
and Φ(λ, λ) = =
=
n
[λi (x(λ) − y, x(λ) − ξi ) + λi (ηi , x(λ) − ξi )]
i=1 n
λi λj (ηi , ξj − ξi )
i,j=1 n
1 λi λj (ηi − ηj , ξj − ξi ) ≤ 0 , 2 i,j=1
2.6 Maximal Monotone Mapping
125
because A is monotone. According to Ky Fan’s inequality, ∃λ0 ∈ n such that Φ(λ0 , µ) 0 ∀µ ∈ n , i.e., (x(λ0 ) + ηi − y, x(λ0 ) − ξi ) 0 ∀i . Therefore x(λ0 ) ∈
n $
C(ξi , ηi ). This proves the finite intersection property for
i=1
{C(ξ, η) | (ξ, η) ∈ ΓA }, and thus the lemma.
Proof of Minty’s theorem. Proof. (1)=⇒(2) We only want to show that ∀y ∈ H, ∃x ∈ H such that y − x ∈ A(x). In fact, according to the Deburnner–Flor lemma, ∃x ∈ H satisfying (η − (y − x), ξ − x) 0, ∀(ξ, η) ∈ ΓA . By maximality, y − x ∈ A(x). (1)⇐=(2) Assume that B is a monotone mapping with ΓA ⊂ ΓB ; we want to show that B = A. Since I + A is surjective, ∀(x, y) ∈ ΓB , ∃x ∈ D(A) such that x + y ∈ (I + A)(x ), so is x + y ∈ x + B(x ), i.e, y = y + x − x ∈ B(x ). Also from (x, y) ∈ ΓB , x + y ∈ x + B(x). Provided by the monotonicity of B, we have x − x 2 = (y − y, x − x ) 0 , i.e., x = x . Therefore B = A and then A is maximal. Since A is maximal monotone if and only if λA is ∀λ > 0, we may assume λ = 1 in proving the equivalence of (2) and (3). Also, by Lemma 2.6.8, (I + A) is expansive ⇐⇒ A is monotone. (2) ⇐⇒ (3) follows from the fact that (I + A) is expansive and surjective ⇐⇒ (I + A)−1 is nonexpansive. In the literature, for a maximal monotone mapping A, ∀λ > 0, setting Jλ = (I + λA)−1 we call the operator Aλ (x) = λ1 (I − Jλ )(x) the Yosida regularization of A. By definition, Aλ (x) ∈ A(Jλ x), but in general, Aλ (x) = A(Jλ x). Theorem 2.6.10 If f : H → R1 ∪ {+∞} is a proper, l.s.c., convex function, then ∂f is maximal monotone. Proof. The monotonicity has been known since the beginning of the last section. Due to Minty’s theorem, it remains to verify the surjection of I + ∂f , i.e., ∀y0 ∈ H, ∃x0 ∈ H such that y0 − x0 ∈ ∂f (x0 ). To this end, we define a function: ϕ(x) =
1 x 2 +f (x) − y0 , x . 2
It is proper, l.s.c., and convex, and ϕ(x) → +∞ as x → ∞. There exists R1 > 0 s.t. ϕ(x) > ϕ(θ) as x R1 . Applying the Hartman–Stampacchia theorem, ∃x0 ∈ D(ϕ) = D(f ) such that
126
2 Fixed-Point Theorems
ϕ(x0 ) ϕ(x)
∀x ∈ H .
Therefore, θ ∈ ∂ϕ(x0 ), i.e., y0 − x0 ∈ ∂f (x0 ).
In fact, the above conclusion can be extended to general real Banach ∗ spaces. In this extension, the normalized duality map J : X → 2X plays ∗ ∗ ∗ 2 ∗ 2 an important role, J(x) = {x ∈ X | < x , x >= x = x }, (cf. Example 1 in Sect. 2.2). It is easy to verify that J is an odd, positively homogeneous, bounded set-valued mapping, and it is known that J(x) = ∂ϕ(x), where ϕ(x) = 12 x2 , so it is monotone. The Browder theorem (Theorem 2.5.8) is also extended to maximal monotone mappings: Let X be a uniformly convex Banach space, if D(A) ⊂ X, and A : D(A) → X ∗ is maximal monotone and coercive: y,x x → +∞ ∀(x, y) ∈ ΓA , as x → ∞, then A is surjective. For a proper l.s.c. convex function on a real Banach space, f : X → R1 ∪ {+∞}, the conjugate function of f, f ∗ : X ∗ → R1 ∪ {+∞} will be defined in Sect. 4.1.3 to be f ∗ (x∗ ) = sup { x∗ , x − f (x)} . x∈X
It will be proved therein that f ∗ is again a proper l.s.c. convex function, satisfying f (x) + f ∗ (x∗ ) = x∗ , x ⇔ x∗ ∈ ∂f (x) ⇔ x ∈ ∂f ∗ (x∗ ) . Thus we have the following: Corollary 2.6.11 If f : X → R1 is proper, l.s.c., and convex, then ∂f ∗ = (∂f )−1 is maximal monotone. Proof. According to the above discussion, ∂f ∗ = (∂f )−1 . The maximality of ∂f ∗ follows from Theorem 2.6.10.
3 Degree Theory and Applications
The Leray–Schauder degree is an important topological tool introduced by Leray and Schauder in the study of nonlinear partial differential equations in the early 1930s. The nontriviality of the degree ensures the existence of a fixed point of the compact mapping in the domain. It enjoys the properties of homotopy invariance and additivity, which make the topological tool more convenient in application, and provides more information on fixed points. In Sects. 3.5 and 3.6 we shall see how better results could be obtained by using this tool than by using any of the other methods that we discussed previously. The Leray–Schauder degree is an extension of the Brouwer degree from finite–dimensional spaces to infinite–dimensional Banach spaces, while the Brouwer degree is a powerful tool in algebraic topology. We introduce the notion of the Brouwer degree in Sect. 3.1, and investigate its fundamental properties in Sect. 3.2. On the one hand, we introduce the definition of the Brouwer degree from the point of view of differential topology so that it closely ties with the counting of zeroes of mappings; on the other hand, we build up the relationship between this definition and that used in algebraic topology. The applications to the Brouwer fixed-point theorem and Borsuk–Ulam theorem, as well as the intersection number etc. are studied in Sect. 3.3. The notion of the Leray–Schauder degree is defined by approximation. All its fundamental properties are transferred from those of the Brouwer degree directly. These are the contents of Sect. 3.4. We emphasize the computation of the degree, because the more precisely we know the degree the sharper we can estimate the number of fixed points. This opens a door to the study of multiple solutions in nonlinear analysis. Rabinowitz’s global bifurcation theorem, based on the computation of the Leray–Schauder degree, is an important part of nonlinear functional analysis and probably the only global result in bifurcation theory. It provides global information on the branch of solutions emanating from a bifurcation point. The applications to nonlinear Sturm–Liouville problems as well as nonlinear elliptic problems are presented. They are studied in Sect. 3.5.
128
3 Degree Theory and Applications
In Sect. 3.6, we introduce various applications of the Leray–Schauder degree. Schaefer’s fixed-point theorem is more convenient in application to partial differential equations. Relying on the degree arguments, multiple solutions for semilinear elliptic equations are studied. In particular, some interesting multiple results are obtained in combination with the super- and sub-solutions method. When we are concerned with positive solutions of differential equations, one modifies the degree theory to that for compact mappings defined on closed convex sets. Moreover, we present some other applications: The Krein–Rutmann theory for positive linear operators, the existence of a positive solution for the superlinear elliptic problem, and bridging solutions of disjoint domains etc. in order to expose the extensive applicability of the degree theory. In Sect. 3.7, various extensions of the Leray–Schauder degree are discussed, including the degrees for set contraction mappings, condensing mappings, setvalued mappings, Fredholm mappings, etc.
3.1 The Notion of Topological Degree The topological degree was originally introduced by H. Poincar´e in the qualitative study of ODEs. Firstly, he defined the index of a singularity P0 as follows: Let P0 = (x0 , y0 ) be a singularity of the plane vector field (F(x,y), G(x,y)), i.e., F (x0 , y0 ) = G(x0 , y0 ) = 0. Let C be a closed curve surrounding P0 in the phase plane. We count the variation of the angles of the tangents of the flow: x˙ = F (x, y) y˙ = G(x, y) generated by (F, G) along C counterclockwise. This amount should be a multiple of 2π, and is denoted by ind(P0 ). One may measure this amount by observing the compass moving along the curve C in a magnetic field. Afterwards, he defined the winding number of a closed curve C, on which there are no singularities of the vector field. Different from the index, at this time, C is not necessarily just enclosing one single singularity. He noticed: (1) The winding number is invariant under deformation of curves C, if there is no singularity on these curves C. (2) The winding number for a given curve C is invariant under deformation of vector fields, if there is no singularity on C. A direct consequence follows: (3) Let D be the domain enclosed by C. If the winding number of C is nonzero, then there must be a singularity of the vector field in D. For a given vector field f = (F, G), a closed curve C (or equivalently, the enclosed domain D), we denote the winding number by deg (f, D), More generally, instead of the zeroes of f , sometimes we study the solutions of
3.1 The Notion of Topological Degree
129
f (x, y) = P0 for a given P0 ∈ R2 ; we denote the winding number of f −P0 by deg (f, D, P0 ). In order to extend the concept of winding numbers to higher-dimensional vector fields, we would rather make some stronger restrictions on f at first. It makes the geometric characterization of winding numbers easy to understand. Let us first assume that f is an analytic function: f (z) = F (z) + iG(z), where z = x + iy and w0 = p0 + iq 0 are complex numbers. Let Ω be a bounded open domain in C with boundary ∂Ω. Suppose f (z) = w0 ∀z ∈ ∂Ω, then we have
1 d arg(f (z) − w0 ) deg(f, Ω, w0 ) = 2π ∂Ω
1 = d log(f (z) − w0 ) 2πi ∂Ω
f (z) 1 = dz 2πi ∂Ω f (z) − w0 = σj , (3.1) zj ∈f −1 (w0 )∩Ω
where σj is the multiplicity of zj , i.e., f (z) = w0 + cj (z − zj )σj + ◦(|z − zj |σj ),
(3.2)
as |z − zj | → 0, and cj = 0. If f is not analytic but differentiable, let f = (F, G), z = (x, y) and w0 = (p0 , q0 ). Assume f (z) = w0 , ∀z ∈ ∂Ω and det f (z) = det
∂(F, G) (z) = 0 ∀z ∈ f −1 (w0 ) , ∂(x, y)
then the point set Ω ∩ f −1 (w0 ) is finite, from the IFT; and
1 d arg(f (z) − w0 ) deg(f, Ω, w0 ) = 2π ∂Ω
G − q0 1 = d arctan 2π ∂Ω F − p0
(F − p0 )dG − (G − q 0 )dF 1 = . 2π ∂Ω (F − p0 )2 + (G − q 0 )2 Applying Green’s formula, it equals
(F − p0 )dG − (G − q 0 )dF = (F − p0 )2 + (G − q 0 )2 ∂Bε (zj ) −1 zj ∈f
(w0 )∩Ω
sgn det f (zj ),
zj ∈f −1 (w0 )∩Ω
(3.3)
130
3 Degree Theory and Applications
−1 where ε > 0 is small enough that + Bε (zi )∩Bε (zj ) = Ø ∀zi = zj in f (w0 )∩Ω, provided det f (z) = 0 ∀z ∈ zi ∈f −1 (w0 )∩Ω Bε (zi ). The last formula provides a clue to defining the topological degree for higher-dimensional mappings. For each root of f (z) = w0 , we assign a signed number, which is the signature of the determinant at this point, and then the topological degree is the summation of all these signed numbers. Before going to the definition, we need a special case of the Sard theorem. Since we have not proved the Sard theorem in Chap. 1, now we shall present a proof for the special case, due to its simplicity. However, we refer the reader to Milnor [Mi 2] for a proof of the general theorem, which can also be obtained by combining our proof for the special case with an inductive argument.
Theorem 3.1.1 (Sard) Let Ω ⊂ Rn be an open set, and let f : Ω → Rn be a C 1 map. Write Z = {x ∈ Ω| det f (x) = 0} . Then f (Z) is a zero measure set. Proof. Consider a closed cube C ⊂ Ω, each side with length a. We divide C (1) (1) (1) into N n configuration cubes Ci , i = 1, . . . , N N , with int(Ci ) ∩ int(Cj ) = a ∅, i = j, each side with length N . Thus on one hand, √ na , f (x) − f (x0 ) KC x − x0 KC N ∀x, x0 ∈ Ci for some i, where KC = max { f (x) | x ∈ C}. On the other hand, ∀ε > 0 ∃ an integer N such that √ na . f (x) − f (x0 ) − f (x0 )(x − x0 ) < ε x − x0 ε N (1)
Let x0 ∈ Z, f (x0 ) is not invertible. Thus f (x0 )Rn cannot span the whole space Rn , but is included in a (n−1)-dimensional linear subspace H. It follows that √ ε na (1) ∀x ∈ Ci , dist(f (x), f (x0 ) + H) N (1)
(1)
in which Ci is the small cube including x0 . √We conclude that f (C ) is √ √i included in a cube, whose sides have length 2ε Nna , 2KCN na , . . . 2KCN na , respectively. Therefore (1) m∗ (f (Ci ∩ Z)) m∗ (f (C ∩ Z)) (1)
Ci
(1)
Ci
∩Z=Ø
m∗ (f (Ci )) (1)
∩Z=Ø n
n−1 2 n 2 KC n a ε, n
3.1 The Notion of Topological Degree
131
where m∗ is the Lebesgue outer measure. Since ε > 0 and the cube C are arbitrary, we obtain m∗ (f (Z)) = 0. Suppose that Y is an n-manifold, a subset W ⊂ Y is called a null set, if for each chart (ϕ, U ) of Y , the set ϕ(U ∩ W ) ⊂ Rn is a null set. Let us recall the definitions of regular/critical values/points of a map between two Banach manifolds. Sard’s theorem asserts that if X and Y are n-manifolds, then for any f ∈ C 1 (X, Y ), the set of critical values of f is a null set. Let X0 , Y be two oriented smooth n-dimensional manifolds, and X ⊂ X0 be an open subset satisfying the condition that X = X ∪ ∂X is compact. If f ∈ C(X, Y ) ∩ C 1 (X, Y ), and if y0 is a regular value of f then f −1 (y0 ) = {x ∈ X| f (x) = y0 } must be a finite set, from the IFT. Define f −1 (y0 ) = {x1 , . . . , xk } . Assuming that y0 ∈ / f (∂X) is a regular value, we define deg(f, X, y0 ) =
k
sgn det f (xj ) .
(3.4)
j=1
Again we let Z denote the set of critical points of f . We shall extend the definition to continuous mappings in three steps: I. The special case f ∈ C(X, Y ) ∩ C 2 (X, Y ), y0 ∈ f (Z) ∪ f (∂X). In order to remove the assumptions on the regularity and the condition f ∈ C 1 (X, Y ), we would rather express (3.4) in an integration form. Let Uj be a neighborhood of xj , such that f : Uj → f (Uj ) is a diffeomorphism, and that Ui ∩ Uj = Ø, ∀i = j, where i, j = 1, 2, . . . , k. Set k , V = f (Uj ) . j=1
This is a neighborhood of y0 . Let us choose a C ∞ n-form on Y : µ = ψ(y)dy1 ∧ . . . ∧ dyn , (in the following, we write simply dy = dy1 ∧ . . . ∧ dyn ) such that supp ψ ⊂ V ∩ (Y \f (∂X)) ,
132
3 Degree Theory and Applications
and
µ=1. Y
Since detf (x) has the same sign in each Uj , we have
µ◦f = X
k
j=1
=
k
j=1
=
k
µ◦f
Uj
ψ(f (x)) det f (x)dx
Uj
sgn det f (xj )
Uj
j=1
=
k
sgn det f (xj )
k
ψ(y)dy f (Uj )
j=1
=
ψ ◦ f (x)| det f (x)|dx
sgn det(f (xj ))
j=1
= deg(x, X, y0 ) .
(3.5)
In the integration form, µ is arbitrarily chosen. We shall prove that the integral X µ ◦ f does not depend on the special choice of µ. We call the chart (g, Ω) a good chart at y0 ∈ Y , if (1) g(y0 ) = θ, (2) g(Ω) = In = (−1, +1)n in Rn . A C ∞ − n-form µ on Y is called admissible if µ = ψ(y)dy satisfies (1) supp ψ ⊂ Ω ∩ (Y \f (∂X)) for a good chart (g, Ω) at y0 . (2) Y µ = 1. Lemma 3.1.2 Suppose that µ = ψ(y)dy is a C ∞ − n-form on Y satisfying (1) supp ψ ⊂ Ω, and (g, Ω) is a good chart at y0 , (2) Y µ = 0. Then there exists an (n − 1) form ω such that supp ω ⊂ Ω and dω = µ. Proof. In the coordinates, g
Ω −→ In ∩ ∩ Y Rn one may assume suppψ ⊂ In and ψ(y)dy = 0. What we want to prove is the existence of a function ν ∈ C 1 (Rn , Rn ) such that
3.1 The Notion of Topological Degree
133
supp ν ⊂ In and div ν = ψ . Indeed, let ν = (ν1 , ν2 , . . . , νn ), then ω = ν1 dy2 ∧ . . . ∧ dyn + . . . + (−1)n νn dy1 ∧ . . . ∧ dyn−1 satisfies dω = µ . We prove the conclusion by mathematical induction. For n = 1, one takes
y ψ(t)dt , ν(y) = −∞
then ν is as required. Assume the lemma is true for n = k. Let
∞ φ(ˆ y) = ψ(ˆ y , yk+1 )dyk+1 , −∞
where y = (ˆ y , yk+1 ), yˆ = (y1 , . . . , yk ). Then supp φ ⊂ Ik (−1, 1)k ,
and
φ(ˆ y )dˆ y=
ψ(y)dy = 0 .
By the hypothesis of induction, there exists ω ∈ C 1 (Rk , Rk ) satisfying supp ω ⊂ Ik , div ω = φ .
Choose τ ∈ C 1 (R1 ), supp τ ⊂ I1 , then
∞
−∞
τ (t)dt = 1 , −∞
[ψ(ˆ y , yk+1 ) − φ(ˆ y )τ (yk+1 )]dyk+1 = 0 .
Let y , yk+1 ) = νk+1 (ˆ then
∞
yk+1
−∞
[ψ(ˆ y , t) − φ(ˆ y )τ (t)]dt ,
∂ νk+1 (ˆ y , yk+1 ) = ψ(ˆ y , yk+1 ) − φ(ˆ y )τ (yk+1 ) . ∂yk+1
This means that ψ = div ν, where ν = (ω1 (ˆ y )τ (yk+1 ), . . . , ωk (ˆ y )τ (yk+1 ), νk+1 (ˆ y , yk+1 )) , and (ω1 , . . . , ωk ) = ω .
134
3 Degree Theory and Applications
In order to prove that the integral X µ ◦ f does not depend on µ, we assume that ν, µ are two admissible n forms with respect to a good chart (g, Ω) at y0 . According to Lemma 3.1.2, there exists an (n − 1) form ω such that dω = ν − µ, and then
ν◦f − µ◦f = dω ◦ f . X
If we can prove
X
X
(dω) ◦ f =
d(ω ◦ f ),
X
(3.6)
X
then by the Stokes theorem, we conclude:
ν◦f = µ◦f . X
X
We are going to prove (3.6). First, we need Lemma 3.1.3 If f ∈ C(X, Y ) ∩ C 2 (X, Y ), then for any (n − 1) form ω, we have d(ω ◦ f ) = dω ◦ f . Proof. In local coordinates, ω=
n
νj (y)dy1 ∧ . . . ∧ dˆ yj ∧ . . . ∧ dyn ,
j=1
where yj ∧ . . . ∧ dyn = dy1 ∧ . . . ∧ dyj−1 ∧ dyj+1 ∧ . . . ∧ dyn . dy1 ∧ . . . ∧ dˆ Thus ω◦f =
n n j=1
νk ◦
f (x)Jfkj (x)
dx1 ∧ . . . ∧ dˆ xj ∧ . . . ∧ dxn ,
k=1
where Jfki is the (k, i) cofactor of the Jacobian determinant det f (x) = Jf (x). Hence d(ω ◦ f ) n
n ∂νk ◦ f (x) ∂Jfki (x) ∂fl ki Jf (x) · + νk ◦ f (x) dx1 ∧ . . . ∧ dxn = ∂yl ∂xi ∂xi i,k=1 l=1 ⎤ ⎡ n n n ∂Jfki (x) ∂ν ◦ f (x) ∂f k l ⎦ =⎣ Jfki (x) + νk ◦ f (x) ∂yl ∂x ∂x i i i=1 i k,l=1
× dx1 ∧ . . . ∧ dxn
k=1
3.1 The Notion of Topological Degree
135
in which f = (f1 , . . . , fn ) . Let g = (−1)k−1 (f1 , . . . , fˆk , . . . , fn ) ,
then Jfki
i−1
= (−1)
det
ˆ ∂g ∂g ∂g ,..., ,..., ∂x1 ∂xi ∂xn
.
Hence n n 2 ˆ ∂ ki g ∂g ∂ ∂g ∂g Jf = (−1)i−1 det ,..., ,..., ,..., ∂x ∂x1 ∂xi ∂xl ∂xi ∂xn i i=1 i=1 l=i n 2 ˆ g ∂ ∂g ∂g ∂g = (−1)i−1+l−2 det , ,..., ,..., ∂xi ∂xl ∂x1 ∂xi ∂xn i=1 l>i - ˆ ∂2g ∂g ∂g ∂g i−1+l−1 (−1) det , ,..., ,..., =0. + ∂xl ∂xi ∂x1 ∂xi ∂xn i>l
From this, together with n ∂fl ki Jf (x) = δkl Jf (x) ∂x i i=1
follows d(ω ◦ f ) =
n ∂νk ◦ f (x) k=1
∂yk
Jf (x)dx1 ∧ . . . ∧ dxn = (dω) ◦ f .
Now we arrive at: / f (Z) ∩ f (∂X) and Theorem 3.1.4 Assume f ∈ C(X, Y ) ∩ C 2 (X, Y ). If y0 ∈ respect to a good chart (g, Ω) at y0 , with µ is an admissible C ∞ n form with supp(µ) ⊂ Ω ∩ (Y \f (∂X)), then X µ ◦ f is a constant independent of µ. II. Removal of the restriction y0 ∈ f (Z) Combining Theorem 3.1.4 and (3.5), we know that
deg(f, X, y0 ) = µ◦f , X
if f ∈ C(X, Y )∩C 2 (X, Y ) and y0 ∈ f (Z)∪f (∂X), where µ is an arbitrary admissible C ∞ n form with respect to a good chart at y0 . Note that the integral on the right-hand side of the above formula does not contain y0 explicitly.
136
3 Degree Theory and Applications
Further recall that the set of regular valuesis dense in f (X) according to the Sard theorem, thus if we take the integral X µ ◦ f to be the definition of deg(f, X, y0 ), the assumption y0 ∈ f (Z) is not necessary. In fact, this integral is defined for all y0 ∈ f (∂X), and is integer valued (the left-hand side of the formula (3.5)) if y0 belongs to the dense (regular value) set. Hence X µ ◦ f is integer valued. Therefore the restriction y0 ∈ f (Z) can be removed when we use X µ ◦ f as the definition of the deg (f, X, y0 ). III. Extension to continuous mappings We first prove: C
Lemma 3.1.5 Let φ : X × [0, 1] −→ Y satisfy φ(·, t) ∈ C 2 (X, Y ) ∀t ∈ [0, 1]. If y0 ∈ φ(∂X × [0, 1]), then deg(φ(·, t), X, y0 ) is a constant independent of t. Proof. Since φ(∂X × [0, 1]) is closed, there is a good neighborhood Ω at y0 such that Ω ∩ φ(∂X × [0, 1]) = Ø. If we choose ψ ∈ C ∞ (Y, R1 ) such that suppψ ⊂ Ω, Y ψdy = 1, then µ = ψ(y)dy is admissible, and
deg(φ(·, t), X, y0 ) = µ ◦ φ(·, t) . (3.7) X
The right-hand side is integer valued and is continuous in t, hence it must be a constant. Now we may extend the definition of degree to mappings in C(X, Y ) by approximation. By the use of the Whitney embedding theorem, we embed Y into RN as a regular submanifold for large N . Thus there exist a tubular neighborhood W of Y and a C ∞ retract r : W → Y . Since we assumed y0 ∈ f (∂X), one may choose 0 < ε < dRN (r−1 (y0 ), f (∂X)) such that the ε neighborhood of Y is in W , where dRN (·, ·) is the distance in RN . According to the Weierstrass approximation theorem and the partition of unity, there exists g ∈ C 2 (X, RN ) satisfying (3.8) f − g C(X,RN ) < ε . Thus for such g, deg (r ◦ g, X, y0 ) is well defined. Moreover, we shall prove that deg(r ◦ g1 , X, y0 ) = deg(r ◦ g2 , X, y0 ) for g1 , g2 ∈ C 2 (X, RN ) both satisfying (3.8). Indeed, define h : X × [0, 1] → RN by h(x, t) = (1 − t)g1 (x) + tg2 (x) , and φ : X × [0, 1] → Y by φ = r ◦ h. Then distRN (φ(x, t), y0 ) = 0 ⇔ distRN (h(x, t), r−1 (y0 )) = 0 .
3.2 Fundamental Properties and Calculations of Brouwer Degrees
137
But, distRN (h(∂X, t), r−1 (y0 )) distRN (f (∂X), r−1 (y0 )) − ε > 0 , this proves that y0 ∈ φ(∂X × [0, 1]). Applying Lemma 3.1.5, we obtain deg(r ◦ g1 , X, y0 ) = deg(r ◦ g2 , X, y0 ) . We are now in a position to define the Brouwer degree for continuous mappings. Definition 3.1.6 (Brouwer degree) Let X0 , Y be two oriented smooth n− manifolds, and let X ⊂ X0 be an open subset with compact closure X. For / f (∂X), to the triple (f, X, y0 ) we define f ∈ C(X, Y ), y0 ∈ deg(f, X, y0 ) = deg(r ◦ g, X, y0 ) , where r is a C ∞ retract of a tubular neighborhood W of Y to Y , and g is a map defined in (3.8). This is called the Brouwer degree of f . The Brouwer degree is integer valued. It is not difficult to verify that Brouwer degree does not depend on the special choice of W and r. By definition, if X = Ø, then deg (f, X, y0 ) = 0. In dealing with mappings between complex manifolds, we identify C n with R2n by the canonical isomorphism z → (x, y), where z = x + iy for z ∈ C n , x, y ∈ Rn . Similarly for the map f → (u, v), where f : Ω → C n , and f = u + iv. As an exercise, readers can verify that if f is analytic then det(f (z)) > 0.
3.2 Fundamental Properties and Calculations of Brouwer Degrees The Brouwer degree has the following fundamental properties. (1) (Homotopy invariance). If φ : X × [0, 1] → Y is continuous and y0 ∈ φ(∂X × [0, 1]), then deg(φ(·, t), X, y0 ) = constant . Proof. Using the above notations, we choose 0 < < dRN (r−1 (y0 ), φ(∂X × [0, 1])) , where dRN (·, ·) is the distance in RN . By the above approximation, there is φˆ ∈ C 2 (X × [0, 1], Y ) such that ˆ <ε. dC(X×[0,1],Y ) (φ, φ)
138
3 Degree Theory and Applications
From Definition 3.1.6 and Lemma 3.1.5 it follows that ˆ t), X, y0 ) = constant . deg(φ(·, t), X, y0 ) = deg(φ(·, More generally, if φ : X × [0, 1] → Y is continuous, and if t → ◦
Xt ⊂+ X ∀t ∈ [0, 1] are continuously deformed open domains, assume y0 ∈ t∈[0,1] φ(∂Xt , t), then deg(φ(·, t), Xt , y0 ) = constant . (2) If y1 , y2 ∈ Y \f (∂X) are in the same component, then deg(f, X, y1 ) = deg(f, X, y2 ) . In particular, if ∂X = Ø, and Y is connected, then deg(f, X, y0 ) is independent of y0 . (In this case, it is written as deg(f, X)). Proof. By definition, deg(f, X, y0 ) is continuous in y0 ∈ Y \f (∂X), and then is a constant, if f ∈ C(X, Y ) ∩ C 2 (X, Y ). By approximation, we obtain the conclusion. Let Ω be a connected component of Y \f (∂X). According to (2), ∀y0 ∈ Ω, deg(f, X, y0 ) is constant. One may write deg(f, X, Ω) instead, if there is no confusion. Corollary 3.2.1 If Y = Rn , f ∈ C(X, Y ) and y0 ∈ f (∂X), then the degree deg(f, X, y0 ) only depends on the restriction of f on ∂X, i.e., fˆ = f |∂X . Proof. Let g ∈ C(X, Y ) satisfy gˆ = g|∂X = fˆ. Define F (x, t) = (1 − t)f (x) + tg(x) t ∈ [0, 1] . Then y0 ∈ F (∂X × [0, 1]). By homotopy invariance, we have deg(f, X, y0 ) = deg(g, X, y0 ) . Therefore, sometimes we write deg(fˆ, ∂X, y0 ) in place of deg(f, X, y0 ). Returning to Lemma 3.1.5), we may rewrite (3.7) in a global version: Corollary 3.2.2 Suppose that f ∈ C(X, Y ) ∩ C 2 (X, Y ) and that Ω is a connected component of Y \f (∂X). If µ is a smooth n form with support in Ω and Y µ = 0, then µ◦f deg(f, X, Ω) = X . µ Y
3.2 Fundamental Properties and Calculations of Brouwer Degrees
139
Proof. Let {ψα | α ∈ ∧} be a partition of unity of Y , such that suppψα is in a “good” neighborhood Ωα . Set µα = ψα · µ, and choose yα ∈ supp µα . In the case where Ωα µα = 0, from (3.7) one has
µα ◦ f , µ Ωα α
deg(f, X, Ω) = deg(f, X, yα ) = X i.e.,
µα ◦ f .
µα =
deg(f, X, Ω) Ωα
(3.9)
X
In the case where Ωα µα = 0, by Lemma 3.1.2, there exists an n − 1 form ωα on Y such that supp ωα ⊂ supp µα and dωα = µα . Following Lemma 3.1.3, µα ◦ f = (dωα ) ◦ f = d(ωα ◦ f ) , we obtain X µα ◦ f = 0 provided by the Stokes theorem. Again (3.9) holds. By addition, we have
deg(f, X, Ω) µ= µ◦f . Y
X
This is the conclusion. (3) (Translation invariance). If Y = Rn , and y0 ∈ / f (∂Ω), then deg(f, X, y0 ) = deg(f − y0 , X, θ) . Proof. Let f ∈ C 1 (X, Rn ) and y0 ∈ f (Z), then sgn det f (xi ) deg(f, X, y0 ) = xi ∈f −1 (y0 )
=
sgn det f (xi )
xi ∈(f −y0 )−1 (θ)
= deg(f − y0 , X, θ) . The assertion can be obtained by approximations to y0 and f .
(4) (Additivity). Let X1 , X2 ⊂ X be open subsets in X such that X1 ∩X2 = Ø and y0 ∈ f (X\(X1 ∪ X2 )), then deg(f, X, y0 ) = deg(f, X1 , y0 ) + deg(f, X2 , y0 ) .
140
3 Degree Theory and Applications
Proof. By the Whitney embedding theorem mentioned above, let ε = dRN (r−1 (y0 ), f (X\(X1 ∪ X2 )))(> 0) . One may choose g0 ∈ C 2 (X, RN ) such that dC(X,RN ) (g, f ) < r ◦ g0 , and choose y1 ∈ g(Z) satisfying dRN (y0 , y1 ) < 2ε , then
ε 2
for g =
dist(y1 , g(X\(X1 ∪ X2 ))) > 0 . On the one hand, by (3.5) we have deg(g, X, y1 ) = sgn det g (xi ) xi ∈g −1 (y1 )
=
+
xi ∈g −1 (y1 )∩X1
sgn det g (xi )
xi ∈g −1 (y1 )∩X2
= deg(g, X1 , y1 ) + deg (g, X2 , y1 ) . On the other hand, by property (2), deg(f, X, y0 ) = deg(g, X, y1 ), deg(f, Xi , y0 ) = deg(g, Xi , y1 ), i = 1, 2 . This is due to the fact that θ = tf (x) + (1 − t)g(x) − ty0 − (1 − t)y1 , as x ∈ ∂X ∪ ∂X1 ∪ ∂X2 ⊂ X\(X1 ∪ X2 ), t ∈ [0, 1] . Corollary 3.2.3 (Excision) If K ⊂ X is compact and y0 ∈ f (K) ∪ f (∂X), then deg(f, X, y0 ) = deg(f, X\K, y0 ) . Proof. Let X1 = X\K, X2 = Ø, then X\(X1 ∪ X2 ) = ∂X ∪ K . Corollary 3.2.4 (Kronecker existence) If y0 ∈ f (∂X) and deg(f, X, y0 ) = 0, then f −1 (y0 ) = Ø. Proof. Assume the contrary: f −1 (y0 ) = Ø, i.e., y0 ∈ f (X). By Corollary 3.2.3, deg(f, X, y0 ) = deg(f, X\X, y0 ) = 0 .
3.2 Fundamental Properties and Calculations of Brouwer Degrees
141
Kronecker existence theorem is often used in the study of the solvability of the equation f (x) = y0 . (5) (Normality). If X ⊂ Y , and y0 ∈ ∂X, then ◦ deg(id, X, y0 ) = 1, y0 ∈ X 0, y0 ∈ /X. More generally, we have: (6) If L is a n × n nondegenerate real matrix, and if X is a bounded open subset and θ ∈ X ⊂ Rn , then deg(L, X, θ) = (−1)β , where β = λj <0 βj and βj are the algebraic multiplicities of the negative eigenvalues λj of L, i.e., βj = dim ∪∞ k=1 ker (λj I − L) , j = 1, 2, . . . . k
Proof. Let λ1 , . . . , λn be all the eigenvalues of L. By definition, deg (L, X, θ) = sgn det L = sgn
n .
λj .
j=1
Since complex roots appear in pairs and positive eigenvalues have no contribution to sgn det L, hence sgn
n . j=1
λj = sgn
. λj <0
λj =
.
(−1)βj = (−1)β .
λi <0
Remark 3.2.5 In the case where X = Y = Rn , the fundamental properties (1),(3),(4),(5) uniquely determine the Brouwer degree. All the other properties are their consequences. (7) Let fi ∈ C(Ωi , Rni ) be open and bounded, pi ∈ fi (∂Ωi ), i = 1, 2. Then deg(f1 × f2 , Ω1 × Ω2 , (p1 , p2 )) = deg(f1 , Ω1 , p1 ) deg(f2 , Ω2 , p2 ) . Proof. By approximation, we may assume that fi ∈ C 1 (Ωi , Rni ) and that pi is not a critical value of fi , i = 1, 2. Let µi be an admissible ni form with support in a good chart (gi , Ωi ) at pi , i = 1, 2, respectively. Then µ1 × µ2 is an admissible n1 + n2 form with support in a good chart (g1 × g2 , Ω1 × Ω2 ) at (p1 , p2 ). We have
(µ1 × µ2 ) ◦ (f1 × f2 ) = µ1 ◦ f1 µ2 ◦ f2 . Ω1 ×Ω2
Ω1
Ω2
142
3 Degree Theory and Applications
(8) (Leray product formula). Assume that Ω, M ⊂ Rn are open subsets with compact closures. Let f : Ω → Rn , g : M → Rn be continuous, with f (Ω) ⊂ M . Let = M \f (∂Ω) = ∪∞ j=1 j , where each j is a connected component of . Suppose p ∈ g ◦ f (∂Ω) ∪ g(∂M ). Then deg(g, j , p) deg(f, Ω, j ) . deg(g ◦ f, Ω, p) = j
Proof. Before going to the proof, we should explain: (a) The meaning of deg(f, Ω, j ) is understood according to (2). (b) There are at most finitely many terms on the right-hand side of the formula different from 0. In fact, g −1 (p) is compact and g −1 (p) ∩ (∂M ∪ f (∂Ω)) = Ø . −1 (p). Since i ∩ j = Ø, i = j, This means = ∪∞ j=1 j covers g provided by finite covering, there are at most finitely many that j cover g −1 (p). Now we begin the proof. 1. First suppose f ∈ C 1 (Ω), g ∈ C 1 (M ) and that p is a regular value of g ◦ f . We have Jg◦f (x) = Jg (f (x)) · Jf (x) .
If x ∈ (g ◦ f )−1 (p), then y = f (x) is a regular value of f , and p is a regular value of g : M ∩ f (Ω) → Rn , hence deg(g ◦ f, Ω, p) = sgn Jg◦f (xj )
=
xj ∈(g◦f )(p)
sgn Jg (f (xj )) · sgn Jf (xj )
xj ∈(g◦f )(p)
= yk
=
⎛ sgn Jy (yk ) ⎝
∈g −1 (p)∩f (Ω)
⎞
xj
∈f −1 (y
sgn Jf (xj )⎠ k)
sgn Jy (yk ) · deg(f, Ω, yk ) .
yk ∈g −1 (p)∩f (Ω)
Putting together all these terms, in which yk belongs to the same j , from deg(f, Ω, yk ) = deg(f, Ω, j ) , we have deg (g ◦ f, Ω, p) =
yk ∈g −1 (p)∩ j
sgn Jg (yk ) deg(f, Ω, j )
3.2 Fundamental Properties and Calculations of Brouwer Degrees
=
143
deg(g, j , p) deg(f, Ω, j ) .
j
2. Passing to continuous mappings f ∈ C(Ω), g ∈ C(M ), the trouble lies in the fact that both and {j } change as f varies. We have to be careful in making the C 1 (Ω)− approximations. ∀y ∈ f (∂Ω) let Ok = {y ∈ M | deg(f, Ω, y) = k} . Then Ok = ∪{j | deg(f, Ω, j ) = k}, k = 0, ±1, ±2, . . . . Let
ε = dist(g −1 (p), f (∂Ω)) .
We choose fˆ ∈ C 1 (Ω) such that ε fˆ − f C(Ω) < , 2 then p ∈ g(∂M ) ∪ g ◦ fˆ(∂Ω) .
(3.10)
Let ˆ k = {y ∈ M | deg(fˆ, Ω, y) = k} . O Again we choose gˆ ∈ C 1 (M ) such that gˆ − g C(M ) < dist(p, g(∂M ) ∪ g ◦ fˆ(∂Ω)) . ˆ k ⊂ fˆ(∂Ω) ∪ ∂M , it follows that Since ∂ O ˆ k )) . gˆ − g C(M ) < dist(p, g(∂ O ˆ k ) and Therefore p ∈ gˆ(∂ O ˆ k , p) . ˆ k , p) = deg(ˆ g, O deg(g, O
(3.11)
It is easy to verify that ˆk . g −1 (p) ∩ Ok = g −1 (p) ∩ O By excision, ˆ k , p) = deg(g, O ˆ k , p) deg(g, Ok , p) = deg(g, Ok ∩ O
(3.12)
Combining (3.11) and (3.12) it follows that ˆ k , p) . deg(g, Ok , p) = deg(ˆ g, O
(3.13)
144
3 Degree Theory and Applications
Finally, we obtain deg (g ◦ f, Ω, p) = deg (ˆ g ◦ fˆ, Ω, p) ˆ k , p) deg (fˆ, Ω, O ˆk ) deg (ˆ g, O = k
=
k deg (g, Ok , p)
k
=
deg (g, Ok , p) deg (f, Ω, Ok )
k
=
deg (g, j , p) deg (f, Ω, j ) .
j
Fixing the map f and the point y0 , the Brouwer degree is a function on the domain X. It provides the information on the behavior of the mapping f by all solutions included in X of the equation: f (x) = y0 .
(3.14)
However, if we want to localize the notion to studying the local behavior of f at an isolated solution of equation (3.14), we are led to: Definition 3.2.6 (Brouwer index) Let x0 be an isolated solution of (3.14), i.e., ∃ε > 0 such that there is no solution of (3.14) in Bε (x0 )\{x0 }. We call i(f, x0 , y0 ) = deg (f, Bε (x0 ), y0 ) the index of f at x0 with respect to y0 . The excision property guarantees that the definition is well defined, i.e., it does not depend on the special choice of ε > 0. We have the following properties: (9) Suppose that f ∈ C(X, Y ) ∩ C 1 (X, Y ), and that x0 is an isolated solution of (3.14). If det f (x0 ) = 0, then i(f, x0 , y0 ) = (−1)β , where β is the sum of the algebraic multiplicities of the negative eigenvalues of f (x0 ). Proof. Since f (x0 ) is invertible, there exists ε > 0 such that deg (f, Bε (x0 ), y0 ) = deg (f (x0 ), Bε (θ), θ) from the homotopy invariance and translation invariance. The conclusion then follows from (6).
3.2 Fundamental Properties and Calculations of Brouwer Degrees
145
(10) If f ∈ C(X, Y ) and y0 ∈ f (∂X) with f −1 (y0 ) = {x1 , . . . , xp }, then deg (f, X, y0 ) =
p
i(f, xj , y0 ) .
i=1
Proof. It follows from the excision property plus the additivity property. At the end of this section we establish the connection between the definition of the Brouwer degree given above with that in algebraic topology. Following Corollary 3.2.2, for f ∈ C 2 (X, Y ), we have µ◦f deg (f, X, y0 ) = X . µ Y Let f ∗ : Ωn (Y ) → Ωn (X), µ → µ ◦ f be the pullback of f , where Ωn (X) is the space of n− forms over X. This means that deg (f, X, y0 ) is the ratio of the integrations of f ∗ µ and µ, ∀µ ∈ Ωn (Y ). In algebraic topology, the Brouwer degree for maps f from the sphere into itself is defined to be the multiplier of the homomorphism f ∗ : H n (S n ) → H n (S n ), in which H n (S n ) stands for the cohomology group of the n− sphere, and the map f maps the generator [ω] into λ[ω] for some integer λ. According to de Rham theory, for a compact, oriented, connected n manifold without boundary X, the cohomology group H k (X) is defined to be ker dk /Im dk−1 , where dk : Ωk (X) → Ωk+1 (X) is the exterior differentiation, k = 0, 1, . . . , n. We shall prove that Ωn (S n ) and then H n (S n ) is one dimensional. Namely: Lemma 3.2.7 For a compact, oriented, connected n-manifold X without boundary, dim H n (X) = 1. Proof. We want to show that H n (X) is generated by one generator. Let us choose an atlas {(Ui , ψi )| i = 1, . . . , p} such that Ui ∩ Uj = Ø ⇒ Ui ∪ Uj is contained in a good chart . ∈ Ωn (X) with suppµ0 ⊂ U1 , and It is sufficient to prove that1 for ∀µ, µ0 n−1 µ = 1, there exist λ ∈ R and ω ∈ Ω (X) such that X 0 µ − λµ0 = dω . Since X is connected, for ∀i, ∃ a curve C starting from U1 ending at Ui . Let p {Ui0 , Ui1 , . . . , Uil } be a chain of neighborhoods in {Ui }1 , such that Ui0 = U1 , Uil = Ui and Uik ∩ Uik−1 = Ø k = 1, 2, . . . , l .
146
3 Degree Theory and Applications
We choose αk ∈ Ωn (X) satisfying
supp αk ⊂ Uik , αk = 1, k = 1, 2, . . . , l , X
and α0 = µ0 . Since supp(αk − αk−1 ) ⊂ Uik ∪ Uik−1 is contained in a good neighborhood, and
(αk − αk−1 ) = 0 , X
we have ωki ∈ Ωn−1 (X) satisfying αk − αk−1 = dωki , k = 1, 2, . . . , l , provided by Lemma 3.1.2. Hence αl = µ0 + d
l
ωki .
(3.15)
k=1
Since Uil = Ui , αl depends on the index i, we write it as βi , i = 1, . . . , p. p p Now, let {χi }1 be a partition of unity with respect to {Ui }1 , i.e., supp χi ⊂ Ui χi 0,
p
χi ≡ 1 .
i=1
Set µi = χi µ , then Denote ci =
supp µi ⊂ Ui .
X
µi . There exists ω !i ∈ Ωn−1 (X) such that µi − ci βi = d! ωi ,
from Lemma 3.1.2, i = 1, 2, . . . , p. Combining (3.15) and (3.16), we have µ=
p
χi µ =
i=1
=
p i=1 p i=1
µi ci βi + d
p i=1
ω !i
(3.16)
3.2 Fundamental Properties and Calculations of Brouwer Degrees
=
p
ci µ0 + d
i=1
p
ω !i + ci
i=1
l
147
ωki
k=1
= λµ0 + dω , p p l where λ = µ , and ω = ωi + ci k=1 ωki ). Thus i=1 ci = i=1 (! X i n we have proved that all elements in H (X) are multipliers of [µ0 ], i.e., dim H n (X) = 1. Combining Corollary 3.2.2 and Lemma 3.2.7, we obtain Theorem 3.2.8 Let X and Y be compact, oriented, connected n-manifolds without boundaries. Then for any f ∈ C 2 (X, Y ), the following diagram commutes: f∗ H n (Y ) −−−−→ H n (X) ⏐ ⏐ ⏐ ⏐ Y0 X0 R1
−−−−→ deg f
R1
Finally, we turn to studying the relationship between degrees on balls and those on spheres. Let f : B n → Rn be a continuous map satisfying θ ∈ f (∂B n ), so deg (f, B n , θ) is well defined. Let us define Φ(x) =
f (x) f (x)
∀x ∈ ∂B n .
Then Φ : S n−1 → S n−1 defines a Brouwer degree: deg (Φ, S n−1 ). What is the relationship between deg(f, B n , θ) and deg(Φ, S n−1 )? Define a homotopy θ if x = θ φ(x, t) = x 2 x f ( ) if x = θ . x f ( ) t x x
Since f |∂B n = φ(·, 0)|∂B n , from Corollary 3.2.1 and the homotopy invariance, deg(f, B n , θ) = deg(φ(·, 0), B n , θ) = deg(φ(·, 1), B n , θ) . In the case where f ∈ C 1 , and y0 ∈ S n−1 is a regular value of Φ, for ∀ε > 0 small, ε2 y0 is a regular value of φ(·, 1), and Φ−1 (y0 ) = {x1 , . . . , xk } if and only if φ(·, 1)−1 (ε2 y0 ) = {εx1 , . . . , εxk }. Since sgn JΦ (xj ) = sgn Jφ(·,1) (εxj ), j = 1, 2, . . . , k , we obtain deg(φ(·, 1), B n , θ) = deg(Φ, S n−1 ). The assumptions on f and on y0 can easily be dropped. Namely, we have proved: Corollary 3.2.9 deg(f, B n , θ) = deg(Φ, S n−1 ) = deg (Φ). Thus the notation deg (Φ, S n−1 ) is in coincidence with the notation deg (fˆ, ∂B n , θ) introduced after Corollary 3.2.1.
148
3 Degree Theory and Applications
3.3 Applications of Brouwer Degree 3.3.1 Brouwer Fixed-Point Theorem The Brouwer degree is a fundamental tool in algebraic topology. It is widely used in topological arguments. We are satisfied having a glimpse of these applications. Theorem 3.3.1 (Brouwer fixed-point theorem) A continuous map f n n from B into itself has a fixed point x0 ∈ B , i.e., f (x0 ) = x0 . Proof. Let g = id − f . With no loss of generality, we may assume θ ∈ g(∂B n ). Since ∀x ∈ ∂B n , ∀λ 1, f (x) ∈ λx, we have θ ∈ φ(∂B n ) × [0, 1], where φ(x, t) = (1 − t)g(x) + tx . Thus by the homotopy invariance and the normality, ◦
◦
deg (g, B n , θ) = deg (id, B n , θ) = 1 . Our conclusion follows from the Kronecker existence theorem.
The following topological fact follows from a simple degree argument: Theorem 3.3.2 There is no continuous map f : B n f |∂B n = id|∂B n , i.e., ∂B n is not a retraction of B .
n
→ ∂B n such that
n
Proof. If not, there is a continuous map f : B → ∂B n . f |∂B n = id|∂B n . On one hand, deg (f, B n , θ) = 0 due to the Kronecker existence theorem. On the other hand, by Corollary 3.2.1 and the normality deg (f, B n , θ) = deg (id, B n , θ) = 1 .
This is a contradiction. 3.3.2 The Borsuk-Ulam Theorem and Its Consequences
Let Ω ⊂ Rn be a bounded open set, which is symmetric with respect to the origin θ, i.e., −Ω = Ω. A map f : Ω → Rn is called odd, if f (−x) = −f (x) ∀x ∈ Ω . We are going to study the Brouwer degree of odd mappings. Theorem 3.3.3 (Borsuk) Suppose that Ω ⊂ Rn is a bounded open set containing θ and is symmetric with respect to θ. If f : Ω → Rn is an odd continuous map, then deg (f, Ω, θ) = odd , whenever θ ∈ f (∂Ω).
3.3 Applications of Brouwer Degree
149
Proof. One chooses ε > 0 such that Bε = Bε (θ) ⊂ Ω. According to Tietze’s theorem, there exists a continuous map fε : Ω → Rn satisfying x x ∈ Bε fε (x) = f (x) x ∈ ∂Ω . If we use 12 (fε (x) − fε (−x)) to replace fε (x), then one may assume that fε is odd. Since fε |∂Ω = f |∂Ω , according to Corollary 3.2.1, the additivity and the normality, deg (f, Ω, θ) = deg (fε , Ω, θ) = deg (fε , Bε , θ) + deg (fε , Ω\B ε , θ) = 1 + deg (fε , Ω\B ε , θ) . In the following, we want to prove that deg (fε , Ω\B ε , θ) is even. Noticing that for a C 1 odd map g with regular value θ, elements in g −1 (θ) ∩ (Ω\B ε ) occur in pairs. Our strategy is to approximate fε by a C 1 odd map g with regular value θ. Once it is constructed, we have deg(f , Ω\B , θ) = deg(g, Ω\B , θ) ≡ 0 (mod 2) . By the Weierstrass approximation theorem, we may assume that fε ∈ C ∞ . It remains to approximate it such that θ is a regular value. To this end we ¯ (θ))×Mn×n −→ Rn defined by F (x, A) = f (x)+ consider the map F : (Ω\B Ax. If we can show that F {θ}, then according to the transversality theorem (Theorem 1.3.14), gA {θ}, for almost every A ∈ Mn×n , where gA (x) = F (x, A). In fact, F (x, A)(y, B) = f (x)y + Ay + Bx, ∀(y, B) ∈ Rn × Mn×n . Since x = θ, ∀z ∈ Rn , we take B = <·,x> x 2 z, and y = θ, we have f (x, A)(y, B) = z, i.e., F (x, A) is surjective, or F {θ}. Since A can be chosen arbitrarily small, the proof is complete.
Theorem 3.3.4 (Borsuk–Ulam) Suppose that Ω ⊂ Rn is a symmetric bounded open set including θ, and that g : ∂Ω → Rm , m < n, is odd and continuous. Then there exists x0 ∈ ∂Ω such that g(x0 ) = 0. Proof. We prove by contradiction. Suppose θ ∈ g(∂Ω). We define a continuous extension g! : Ω → Rm by the Tietze theorem. With no loss of generality, one may assume g! is odd. Now we apply Theorem 3.3.3, deg (! g , Ω, θ) = 0. Choosing y0 ∈ Rn \Rm , with small norm, it follows that deg (! g , Ω, y0 ) = 0 Thus, g!−1 (y0 ) = Ø, but this is impossible.
150
3 Degree Theory and Applications
Corollary 3.3.5 Suppose that Ω ⊂ Rn is a symmetric bounded open set including θ, and that g : ∂Ω → Rm , with m < n, is continuous. Then there exists x0 ∈ ∂Ω such that g(x0 ) = g(−x0 ) Proof. Set g1 (x) = g(x) − g(−x), then apply Theorem 3.3.4 directly.
Remark 3.3.6 We consider a continuous vector field on S n , i.e., a continuous map g : S n → Rn . Corollary 3.3.5 means that there exists a pair of antipodal points ±x0 , which have the same vector g(x0 ) = g(−x0 ). Theorem 3.3.7 (Ljusternik–Schnirelmann–Borsuk) Suppose that Ω ⊂ Rn is a symmetric bounded open set including θ, and that {A1 , . . . , Ap } is a closed covering of ∂Ω, satisfying Ai ∩ (−Ai ) = Ø ∀i. Then p n + 1. Proof. We may assume that ∩pi=1 Ai = Ø. For otherwise, if ∃x0 ∈ ∩pi=1 Ai , then by covering ∂Ω = ∪pi=1 (−Ai ), there must be a j such that x0 ∈ Aj ∩ (−Aj ). But this is impossible. Now we set di (x) = dist (x, Ai ), i = 1, 2, . . . , p , and f : ∂Ω → Rp−1 ⊂ Rn−1 as follows: f (x) = (d1 (x), d2 (x), . . . , dp−1 (x)) . Supposing p n, we apply Corollary 3.3.5, ∃x0 ∈ ∂Ω satisfying f (x0 ) = f (−x0 ). Since {A1 , A2 , . . . , Ap } is a covering, there exists j p such that x0 ∈ Aj . There are two possibilities: 1. j p − 1. It follows that dj (−x0 ) = dj (x0 ) = 0, thus −x0 ∈ Aj or x0 ∈ Aj ∩ (−Aj ); this is a contradiction. +p−1 / j=1 Aj , thus j = p. In this case, dj (−x0 ) = dj (x0 ) > 0, ∀j = 2. x0 ∈ +p−1 / j=1 (−Aj ). Again, by covering, x0 ∈ Ap ∩ (−Ap ), 1, 2, . . . , p − 1, so x0 ∈ a contradiction. The following theorem is an extension of the open mapping theorem to continuous mappings in finite-dimensional spaces. Theorem 3.3.8 (Invariance of domains) If Ω ⊂ Rn is a nonempty open set, and if f : Ω → Rn is continuous and locally injective, then f is an open map. Proof. We want to show that ∀x0 ∈ Ω, ∀ε > 0 with Bε (x0 ) ⊂ Ω, ∃δ > 0 such that f (Bε (x0 )) ⊃ Bδ (f (x0 )). One may assume x0 = θ = f (θ), and that f : B (θ) → f (B (θ)) is 1–1. Since θ ∈ f (∂B (θ)), ∃δ > 0 such that B δ (θ) ⊂ Rn \f (∂B (θ)). Our problem is reduced to proving that ∀y0 ∈ Bδ (θ), ∃x ∈ B (θ) such that f (x) = y0 . Due to the Kronecker existence theorem, it is sufficient to prove that deg (f, B (θ), y0 ) = 0 .
3.3 Applications of Brouwer Degree
151
Since δ > 0 can be chosen arbitrarily small, according to property (2) of the Brouwer degree, deg (f, B (θ), y0 ) = deg (f, B (θ), θ) .
Let H(x, t) = f
x 1+t
−f
−tx 1+t
∀(x, t) ∈ B (θ) × [0, 1], .
It is continuous on B (θ) × [0, 1], and satisfies H(x, 0) = f (x), H(x, 1) = f ( 12 x) − f (− 12 x). We claim that θ ∈ H(∂Bε × [0, 1]). For otherwise, there are (x0 , t) ∈ ∂B (θ) × [0, 1] satisfying x0 −tx0 f =f . 1+t 1+t Since f is 1 − 1 on B (θ), we would have x0 −tx0 = , 1+t 1+t i.e., x0 = θ. But, this is impossible. Therefore by the homotopy invariance and Borsuk–Ulam theorem deg (f, Bε (θ), θ) = deg (H(·, 1), Bε , θ) = 0 . and then deg (f, Bε (θ), y0 ) = 0. This proves our conclusion.
Comparing with the global implicit function theorem, the following theorem is an extension to continuous mappings in finite-dimensional spaces: Corollary 3.3.9 If f : Rn → Rn is continuous and locally injective, and if f (x) → +∞ as x → +∞, then f is surjective. Proof. From Theorem 3.3.8, f (Rn ) is open. We shall prove that f (Rn ) is also closed. Suppose yn ∈ f (Rn ) with yn → y0 . We shall prove that ∃x0 ∈ Rn satisfying f (x0 ) = y0 . Indeed we have xn ∈ Rn satisfying f (xn ) = yn ∀n. According to the assumption, {xn } is bounded, and then there exists a convergent subsequence xn → x0 . Thus y0 = f (x0 ). f (Rn ) is both open and closed. Therefore f (Rn ) = Rn . 3.3.3 Degrees for S 1 Equivariant Mappings We now turn to a computation of the degree of an S 1 group action equivariant map. Let us consider an S 1 representation on C n : Tφ = ei diag {λ1 φ,...,λn φ} , where φ ∈ [0, 2π], and λ1 , . . . , λn ∈ Z.
152
3 Degree Theory and Applications
Theorem 3.3.10 Suppose that Ω ⊂ C n is a T (S 1 ) invariant open domain containing θ, and that f ∈ C(∂Ω, C n \{θ}) satisfies f (Tφ z) = eikφ f (z), ∀z ∈ ∂Ω, ∀φ ∈ [0, 2π] . Then deg (f, Ω, θ) =
kn . λ1 . . . λn
Proof. 1. We may assume that λ1 = · · · = λn = 1. In fact, if it is proved for the special case, then for general λ1 , . . . , λn ∈ Z+ , we define the transform ˜ = g −1 (Ω), then the map f ◦ g : Ω ˜ → C n satisfies g(z) = (z1λ1 , . . . , znλn ), let Ω Tφ ◦ g(z) = g ◦ T˜φ z, where T˜φ = eiφ In . Therefore f ◦ g(T˜φ z) = f (Tφ ◦ g(z)) = eikφ f ◦ g(z) . Provided by the product formula, we have ˜ θ) = deg (f, Ω, θ) · deg (g, Ω, ˜ θ) . deg (f ◦ g, Ω, We assume the conclusion holds for λ1 = · · · = λn = 1, therefore ˜ θ) = k n . deg (f ◦ g, Ω, But, ˜ θ) = λ1 · · · λn , deg (g, Ω, we obtain our conclusion. If λ1 , . . . , λn are not all positive, then we introduce a transform g : (z1 , . . . , zj , . . . , zn ) → (z1 , . . . , z¯j , . . . , zn ) for all negative λj s. Again by the product formula, we have deg (f ◦ g, g −1 (Ω), θ) = (−1)sgn λ1 ···λn deg (f, Ω, θ) . Thus it is sufficient to prove the theorem for λ1 = · · · = λn = 1. 2. We may assume that f is smooth. This can be done by a mollifier; the argument is standard, so we omit it. The only thing that has to be verified is the equivariance of the mollified map. 1 : η(t) = 1, as t ≤ , and 0, as t > 2, 3. Taking a smooth function on R+ 1 where < 2 dist (∂Ω, θ), and define fˆ = η(|z|)(z1k , . . . , znk ) + (1 − η(|z|))f (z) . Then fˆ has the same degree as f on Ω. In summary, we may assume that f is smooth and S 1 -equivariant, with λ1 = . . . = λn = 1, and has the form (z1k , . . . , znk ) in B (θ). ¯ε (θ). Define a map F : 4. Now, we consider the degree of f on Ω\B ¯ε (θ)) × Mn×n → C n by (Ω\B
3.3 Applications of Brouwer Degree
153
F (z, A) = f (z) + Az k , where z k = (z1k , . . . , znk ). We show that F {θ}. In fact, n n k ¯ B) = Fz · w + Fz¯ · w ¯+ zi Bij . F (z, A)(w, w, 1
1
¯ (θ), ∀ξ ∈ C n , the system Since z ∈ /B n
Bij zjk = ξi
1
has a solution Bij . By taking w = w ¯ = 0 the map F (z, A) is surjective. Applying the transversality theorem, fA := F (·, A) {θ} for almost all A ∈ Mn×n . Since A can be chosen small, the critical set S(fA , Ω\B (θ)) of fA on Ω\B (θ) consists of isolated points, but ∀z ∗ ∈ S(fA , Ω\B (θ)), Tφ z ∗ ∈ S(fA , Ω\B (θ)). This is impossible if it is nonempty. This proves that ¯ε (θ), θ) = 0. Therefore deg(fA , Ω\B deg (fA , Ω, θ) = deg (fA , B (θ), θ) . But on Bε (θ), fA (z) = z k + Az k , for sufficiently small A, we obtain: deg (fA , B (θ), θ) = deg (f, B (θ), θ) = k n . Combining all together, we have proved the conclusion. 3.3.4 Intersection The Brouwer degree is useful in the intersection theory. We briefly introduce it here. Let Ω1 , Ω2 ⊂ Rn be two compact manifolds with ∂Ω1 = ∅ and ∂Ω2 = ∅, where dim Ω1 = k + 1, dim Ω2 = n − k − 1. Let φ1 : ∂Ω1 → Rn , φ2 : Ω2 → Rn be two continuous mappings with φ1 (∂Ω1 ) ∩ φ2 (Ω2 ) = ∅. We say φ1 and φ2 link, if for any continuous extension of φ1 , φ!1 : Ω1 → Rn , we have φ!1 (Ω1 ) ∩ φ2 (Ω2 ) = ∅ . In other words, 11 (x) = φ2 (y) . ∃(x, y) ∈ Ω1 × Ω2 , such that φ Define a mapping F : Ω1 × Ω2 → Rn by F (x, y) = φ!1 (x) − φ2 (y); it is / F (∂Ω1 × Ω2 ) = equivalent to saying that F has a zero in Ω1 × Ω2 . Since θ ∈ F (∂(Ω1 ×Ω2 )), deg (F, Ω1 × Ω2 , θ) is well defined and depends on (φ1 , φ2 ) only,
154
3 Degree Theory and Applications
on account of Corollary 3.2.1. It is sufficient to verify deg (F, Ω1 × Ω2 , θ) = 0. Thus the Brouwer degree is a tool in the study of linking. Example 1. Let r1 > 1, r2 > 0. Let Ω1 , Ω2 ⊂ Rn be defined as follows: Ω1 = Brk2 (θ) × [0, r1 ] & % := (x1 , x2 , . . . , xk+1 , 0, . . . , 0) x21 + . . . x2k = r22 , 0 ≤ xk+1 ≤ r1 , % & Ω2 = S n−k−1 := (0, 0, . . . , xk+1 , . . . , xn ) x2k+1 + . . . + x2n = 1 , and let φ1 = id|∂Ω1 , φ2 = idΩ2 . Then φ1 and φ2 link. 2 In fact, let F (x1 , x2 , . . . , xn ) = (x1 , . . . , xk , xk+1 − (1 − x2k+2 − . . . − x2n ), xk+2 , . . . , xn ), it has a unique zero in Ω1 × Ω2 : x1 = · · · = xk = xk+2 = · · · = xn = 0, xk+1 = 1. Therefore, deg(F, Ω1 × Ω2 , θ) = 1 . x3
Ω2 r1 θ
x1
Ω1 r2 x2 Fig. 3.1.
The Borsuk–Ulam theorem is applied to the study of the intersection of symmetric sets. Assume that X is a Banach space. To a closed symmetric set A ⊂ X\{θ}, we define the genus γ(A) of A to be inf{k ∈ N | ∃ an odd φ ∈ C(A, Rk \{θ})}. Example 2. Assume that Ω ⊂ Rn is a symmetric bounded open set containing θ, and that there is an odd homeomorphism h : A → ∂Ω. Then γ(A) = n. In fact, by definition, γ(A) ≤ n. Suppose γ(A) < n, then there exist k < n and an odd φ such that φ ∈ C(A, Rk \{θ}). Let g = φ ◦ h−1 , then g : ∂Ω → Rk \{θ} is continuous and odd. According to the Borsuk–Ulam theorem, there exists x0 ∈ A such that g(x0 ) = θ. This is a contradiction.
3.4 Leray–Schauder Degrees
155
3.4 Leray–Schauder Degrees In analysis we study continuous mappings in infinite-dimensional spaces, so we should be concerned with extending the Brouwer degree from finitedimensional spaces to infinite-dimensional Banach spaces. However, the generalization cannot suit arbitrary continuous mappings. This can be seen from the fact that if this sort of degree theory, which possesses the fundamental properties homotopy invariance, additivity and normality established in Sect. 3.2, had been built up, then the Brouwer fixed-point theorem would be extended directly to Banach spaces as follows. Let B be the unit open ball at the origin in an infinite-dimensional real Banach space X, φ ∈ C(B, B). Let ft = id − tφ, t ∈ [0, 1] and θ ∈ ft (∂B). If deg (ft , B, θ) had been extended such that all the above properties of the Brouwer degree hold, then there would be a zero of f1 = id − φ, i.e., a fixed point x ∈ B of φ: φ(x) = x . The “proof” is the same as in the previous section; we repeat it as follows: From the hypothesis θ ∈ ft (∂B), according to the homotopy invariance and the normality, deg (f1 , B, θ) = deg (id, B, θ) = 1 . Hence by the Kronecker existence, f1−1 (θ) ∩ B = Ø, i.e., ∃x ∈ B such that φ(x) = x. However, for an infinite-dimensional Banach space X, the above conclusion cannot be true for any continuous mapping φ. Example. Let X=l = 2
x = (x1 , x2 , . . . , xn , . . .)| x = 2
∞
x2n
<∞
.
n=1
and let φ be the mapping x → ( 1− x 2 , x1 , x2 , . . .) . Then φ : B → B is continuous. But φ has no fixed point in B. In fact, φ(B) ⊂ ∂B, if φ(x) = x for some x ∈ B, then x = 1, but it is easily seen that x1 = 0, x2 = x1 = 0, . . ., therefore x = θ, a contradiction. We are forced to restrict ourselves to a subfamily of continuous mappings. Let us recall: Definition 3.4.1 Let Ω ⊂ X be a subset of a real Banach space. A continuous mapping K : Ω → X is said to be compact if it maps a bounded closed set into a compact set. As before, in the following we suppose that Ω is a bounded open set in the real Banach space X.
156
3 Degree Theory and Applications
Theorem 3.4.2 If K : Ω → X is a compact map, and Ω ⊂ X is a bounded open set, then ∀ε > 0, there is a continuous operator Kε taking values in a finite-dimensional linear subspace Emε such that K(x) − Kε (x) ε
∀x ∈ Ω .
Proof. Let Bε (yj ) j = 1, . . . , mε , be finitely many ε− balls covering K(Ω). Let ψj (x) = (ε− x − yj )+ λ, λ 0 , λ+ = 0, λ < 0 .
where
Let ϕi (x) =
ψi (x) , mε j=1 ψj (x)
and Kε (x) =
mε
i = 1, 2, . . . , mε ,
ϕi (K(x))yi ,
i=1
then Kε (x) ∈ span {y1 , . . . , ymε } and K(x) − Kε (x)
m
ϕi (K(x)) K(x) − yi
i=1 mε
ε
ϕi (K(x)) = ε .
i=1
The idea in extending the degree to mapping f = id − K on bounded open set Ω ⊂ X, where K is a compact map, is by approximation: ∀ε > 0 arbitrarily small, we already have the Brouwer degree for fε = id − Kε , then we want to define the degree for f by Brouwer degrees for these fε . In doing so, we should verify: (1) If y0 ∈ X satisfies y0 ∈ f (∂Ω), then for small ε > 0, y0 ∈ fε (∂Ω). (2) For any two such fε1 and fε2 , the Brouwer degrees for fε1 , fε2 are equal. In proving (1), we need: Lemma 3.4.3 Let K : Ω → X be compact, f = id − K and S ⊂ Ω be closed. Then f (S) is closed. Proof. Let {xn } ⊂ S with f (xn ) → z ∗ . We want to show that z ∗ ∈ f (S). Indeed, there are a subsequence {ni } and y ∗ ∈ X such that Kxni → y ∗ , and then xni → z ∗ − y ∗ , which we write as x∗ . Then x∗ ∈ S. By the continuity of K, Kx∗ = y ∗ , and hence f (x∗ ) = z ∗ , i.e., z ∗ ∈ f (S).
3.4 Leray–Schauder Degrees
157
Thus, y0 ∈ f (∂Ω) implies dist (y0 , f (∂Ω)) > 0. Choosing 0 < ε < dist (y0 , f (∂Ω)), we have dist (y0 , fε (∂Ω)) > 0 . Now we turn to (2). Consider the mapping fε : Ω ∩ Rmε → Rmε where mε = dim span{ Kε (Ω)}. The Brouwer degree deg (f