HANDBOOK OF APPLIED ANALYSIS
For other titles published in this series, go to www.springer.com/series/5613
Advances in Mechanics and Mathematics VOLUME 19 Series Editors David Y. Gao (Virginia Polytechnic Institute and State University) Ray W. Ogden (University of Glasgow)
Advisory Board Ivar Ekeland (University of British Columbia, Vancouver) Tim Healey (Cornell University, USA) Kumbakonam Rajagopal (Texas A&M University, USA) Tudor Ratiu (École Polytechnique Fédérale, Lausanne) David J. Steigmann (University of California, Berkeley)
Aims and Scope Mechanics and mathematics have been complementary partners since Newton’s time, and the history of science shows much evidence of the beneficial influence of these disciplines on each other. The discipline of mechanics, for this series, includes relevant physical and biological phenomena such as: electromagnetic, thermal, quantum effects, biomechanics, nanomechanics, multiscale modeling, dynamical systems, optimization and control, and computational methods. Driven by increasingly elaborate modern technological applications, the symbiotic relationship between mathematics and mechanics is continually growing. The increasingly large number of specialist journals has generated a complementarity gap between the partners, and this gap continues to widen. Advances in Mechanics and Mathematics is a series dedicated to the publication of the latest developments in the interaction between mechanics and mathematics and intends to bridge the gap by providing interdisciplinary publications in the form of monographs, graduate texts, edited volumes, and a special annual book consisting of invited survey articles.
HANDBOOK OF APPLIED ANALYSIS
By NIKOLAOS S. PAPAGEORGIOU National Technical University, Athens, Greece SOPHIA TH. KYRITSI-YIALLOUROU Hellenic Naval Academy, Piraeu s, Greece
123
N.S. Papageorgiou National Technical University Department of Mathematics 157 80 Athens Zografou Campus Greece
[email protected]
S. Th. Kyritsi-Yiallourou Hellenic Naval Academy Military Institute of University Education Leoforos Chatzikyriakou 185 39 Piraeus Greece
[email protected]
Series Editors: David Y. Gao Department of Mathematics Virginia Polytechnic Institute and State University Blacksburg, VA 24061
[email protected]
Ray W. Ogden Department of Mathematics University of Glasgow Glasgow, Scotland, UK
[email protected]
ISBN 978-0-387-78906-4 e-ISBN 978-0-387-78907-1 DOI 10.1007/b120946 Springer Dordrecht Heidelberg London New York Library of Congress Control Number: 2009927202 Mathematics Subject Classification (2000): 34xx, 35xx, 46xx, 47xx, 49xx, 90xx, 91xx © Springer Science+Business Media, LLC 2009 All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer Science+Business Media, LLC, 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
To the memory of my father S. Th. K.
The mathematical sciences particularly exhibit order, symmetry and limitation; and these are the greatest forms of the beautiful. Aristotle Metaphysica, 3M, 1078b
Series Preface
As any human activity needs goals, mathematical research needs problems. —David Hilbert Mechanics is the paradise of mathematical sciences. —Leonardo da Vinci
Mechanics and mathematics have been complementary partners since Newton’s time, and the history of science shows much evidence of the beneficial influence of these disciplines on each other. Driven by increasingly elaborate modern technological applications, the symbiotic relationship between mathematics and mechanics is continually growing. However, the increasingly large number of specialist journals has generated a duality gap between the partners, and this gap is growing wider. Advances in Mechanics and Mathematics (AMMA) is intended to bridge the gap by providing multidisciplinary publications that fall into the two following complementary categories: 1. An annual book dedicated to the latest developments in mechanics and mathematics; 2. Monographs, advanced textbooks, handbooks, edited volumes, and selected conference proceedings. The AMMA annual book publishes invited and contributed comprehensive research and survey articles within the broad area of modern mechanics and applied mathematics. The discipline of mechanics, for this series, includes relevant physical and biological phenomena such as: electromagnetic, thermal,
x
Series Preface
and quantum effects, biomechanics, nanomechanics, multiscale modeling, dynamical systems, optimization and control, and computation methods. Especially encouraged are articles on mathematical and computational models and methods based on mechanics and their interactions with other fields. All contributions will be reviewed so as to guarantee the highest possible scientific standards. Each chapter will reflect the most recent achievements in the area. The coverage should be conceptual, concentrating on the methodological thinking that will allow the nonspecialist reader to understand it. Discussion of possible future research directions in the area is welcome. Thus, the annual volumes will provide a continuous documentation of the most recent developments in these active and important interdisciplinary fields. Chapters published in this series could form bases from which possible AMMA monographs or advanced textbooks could be developed. Volumes published in the second category contain review/research contributions covering various aspects of the topic. Together these will provide an overview of the state-of-the-art in the respective field, extending from an introduction to the subject right up to the frontiers of contemporary research. Certain multidisciplinary topics, such as duality, complementarity, and symmetry in mechanics, mathematics, and physics are of particular interest. The Advances in Mechanics and Mathematics series is directed to all scientists and mathematicians, including advanced students (at the doctoral and postdoctoral levels) at universities and in industry who are interested in mechanics and applied mathematics.
David Y. Gao Ray W. Ogden
Preface
The aim of this book is to present the basic modern aspects of nonlinear analysis and then to illustrate their use in different applied problems. Nonlinear analysis was born from the need to deal with nonlinear equations which arise in various problems of science, engineering, and economics and which are often notoriously difficult to solve. On a theoretical level, nonlinear analysis is a remarkable mixture of various areas of mathematics such as topology, measure theory, functional analysis, nonsmooth analysis, and multivalued analysis. On an applied level, nonlinear analysis provides the necessary tools to formulate and study realistic and accurate models describing various phenomena in different areas of physical sciences, engineering and economics. For this reason, the theoretically inclined nonmathematician (physicist, engineer, or economist), needs to have a working knowledge of at least some of the basic aspects of nonlinear analysis. This knowlegde can help him build good models for the phenomena he studies, study them in detail and extract from them important information which is crucial to the design process. As a consequence, nonlinear analysis has acquired an interdisciplinary character and is a prerequisite for many nonmathematicians, who wish to investigate their problems in detail with the greatest possible generality. This leads to a continuously increasing need for books that survey this large area of mathematical analysis and present its applications. There should be no misunderstanding. The subject is vast, it touches many different areas of mathematics and its applications cover several other fields in science and engineering. In this volume, we make an effort to present the basic theoretical aspects and the main applications of nonlinear analysis. Of course the treatment is not exhaustive; such a project would require several volumes. Nevertheless, we believe that we touch the main parts of the theory and of the applications. Mathematicians and nonmathematicians alike can find in this volume material that covers their interests and can be useful in their research and/or teaching. Chapter 1 begins with the calculus of smooth and nonsmooth functions. We present the Gˆ ateaux and Fr´echet derivatives and develop their calculus in
xii
Preface
full detail. In the direction of nonsmooth functions, first we deal with convex functions for which we develop a duality theory and a theory of subdifferentiation. Subsequently, we generalize to locally Lipschitz functions (Clarke’s theory). We also introduce and study related geometrical concepts (such as tangent and normal cones) for various kinds of sets. Finally we investigate a kind of variational convergence of functions, known as Γ-convergence, which is suitable in the stability (sensitivity) analysis of variational problems. In Chapter 2, we use the tools of the previous chapter in order to study extremal and optimal control problems. We begin with a detailed study of the notion of lower semicontinuity of functions. Next we examine constrained minimization problems and develop the method of Lagrange multipliers. This leads to mimimax theorems, saddle points and the theory of KKM-multimaps. Section 2.4 deals with some modern aspects of the direct method, which involve the so-called variational principles, central among them being the socalled “Ekeland variational principle”. The last two sections deal with the calculus of variations and optimal control. In optimal control, we focus on existence theorems, relaxation and the necessary conditions for optimality (Pontryagin’s maximum principle). Chapter 3 deals with some important families of nonlinear maps and examines their uses in fixed point theory. We start with compact and Fredholm operators which are the natural generalizations of finite rank maps. Subsequently we pass to operators of monotone type and to accretive operators. Monotone operators exhibit remarkable surjectivity properties which play a central role in the existence theory of nonlinear boundary value problems. Accretive operators are closely related to the generation theory of linear and nonlinear semigroups. We investigate this connection. Then we introduce the Brouwer degree (finite-dimensional) and the Leray–Schauder and Browder–Skrypnik degrees (the latter for operators of monotone type) which are infinite-dimensional. Having these degree maps, we can move to the fixed point theory. We deal with metric fixed points, topological fixed points and investigate the interplay between order and fixed point theory. Chapter 4 presents the main aspects of critical point theory which is the basic tool in the so-called “variational method” in the study of nonlinear boundary value problems. We start with minimax theorems describing the critical values of a C 1 -functional. Then we present the Ljusternik–Schnirelmann theory for multiple critical points of nonlinear homogeneous maps. This way we have all the necessary tools to develop the spectral properties of the Laplacian and of the p-Laplacian (under Dirichlet, Neumann and periodic boundary conditions). Then using the Lagrange multipliers method we deal with abstract eigenvalue problems. Finally we present some basic notions and results from bifurcation theory. Chapter 5 uses the tools developed in Chapters 3 and 4 in order to study nonlinear boundary value problems (involving ordinary differential equations and elliptic partial differential equations). First we illustrate the variational method based on the minimax principles of critical point theory and then
Preface
xiii
we present the method of upper and lower solutions and the degree-theoretic method. Subsequently we consider nonlinear eigenvalue problems, for which we produce constant sign and nodal (sign changing) solutions. Then we prove maximum and comparison principles involving the Laplacian and p-Laplacian differential operators. Finally we deal with periodic Hamiltonian systems. We consider the problem of prescribed minimal period and the problem of a prescribed energy level. For both we prove existence theorems. In Chapter 6, we deal with the properties of maps which have as values sets (multifunctions or set-valued maps). We introduce and study their continuity (Section 6.1) and measurability (Section 6.2) properties. Then for such multifunctions (continuous or measurable), we investigate whether they admit continuous or measurable selectors (Michael’s theorem and Kuratowski– Ryll Nardzewski, and the Yankov–von Neuman–Aumann selection theorems). This leads to the study of the sets of integrable selectors of a multifunction, which in turn permits a detailed set-valued integration. The notion of decomposability (an effective substitute of convexity) plays a central role in this direction. Then we prove fixed point theorems for multifunctions and also study Carath´eodory multifunctions. Finally we introduce and study various notions of convergence of sets that arise naturally in applications. In Chapter 7, we consider applications to problems of mathematical economics. We consider both static and dynamic models. We start with the static model of an exchange economy. Assuming that perfect competition prevails, which is modelled by a continuum (nonatomic measure space) of agents. We prove a “core Walras equivalence theorem” and we also establish the existence of Walras allocations. We then turn our attention to growth models (dynamic models). First we deal with an infinite horizon, discrete-time, multisector growth model and we establish the existence of optimal programs for both discounted and undiscounted models. For the latter, we use the notion of “weak maximality”. Then we determine the asymptotic properties of optimal programs via weak and strong turnpike theorems. We then examine uncertain growth models and optimal programs for both nonstationary discounted and stationary undiscounted models. We also characterize them using a price system. Continuous-time discounted models are then considered, and finally we characterize choice behavior consistent with the “Expected Utility Hypothesis”. Chapter 8 deals with deterministic and stochastic games, which provide a substantial amount of generalization of some of the notions considered in the previous chapter. We start with noncooperative n-players games, for which we introduce the notion of “Nash equilibrium”. We show the existence of such equilibria. Then we consider cooperative n-players games, for which we define the notion of “core” and show its nonemptiness. We continue with random games with a continuum of players and an infinite-dimensional strategy space. For such games, we prove the existence of “Cournot–Nash equilibria”. We also study corresponding Bayesian games. Subsequently, using the formalism of dynamic programming, we consider stochastic, 2-player, zero-sum
xiv
Preface
games. Finally, using approximate subdifferentials for convex function, we produce approximate Nash equilibria for noncooperative games with noncompact strategy sets. Chapter 9 studies how information can be incorporated as a variable in various decision models (in particular in ones with asymmetric information structure). First we present the mathematical framework, which will allow the analytical treatment of the notion of information. For this purpose, we define two comparable metric topologies, which we study in detail. Then we examine the ex-post view and the ex-ante view, in the modelling of systems with uncertainty. In both cases we establish the continuity of the model in the information variable. Subsequently, we introduce a third mode of convergence of information and study prediction sequences. We also study games with incomplete information and games with a general state space and an unbounded cost function. The final chapter (Chapter 10) deals with evolution equations and the mathematical tools associated with them. These tools are developed in the first section and central among them is the notion of “evolution triple”. We consider semilinear evolutions, which we study using the semigroup method. We then move on to nonlinear evolutions. We consider evolutions driven by subdifferential operators (this class of problems incorporates variational inequalities) and problems with operators of monotone type, defined within the framework of an evolution triple. The first class is treated using nonlinear semigroup theory, while the second requires Galerkin approximations. We conclude with an analogous study of second-order evolutions. The treatment of all subjects is rigorous and every chapter ends with an extensive survey of the literature. We hope that both mathematicians and nonmathematicians alike, will find some interesting and useful for their needs in this volume. Acknowledgments: We would like to thank Professor D. Y. Gao for recommending this book for publication in the Advances in Mechanics and Mathematics (AMMA) series. Many thanks are also due to Elizabeth Loew and Jessica Belanger for their patience and professional assistance.
Athens, September 2008
Nikolaos S. Papageorgiou Sophia Th. Kyritsi–Yiallourou
Contents
Series Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi 1
Smooth and Nonsmooth Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . 1.1 Gˆ ateaux and Fr´echet Derivatives . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2 Convex Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.3 Locally Lipschitz Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.4 Variational Geometry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.5 Γ-Convergence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.6 Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2
Extremal Problems and Optimal Control . . . . . . . . . . . . . . . . . . 63 2.1 Lower Semicontinuity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64 2.2 Constrained Minimization Problems . . . . . . . . . . . . . . . . . . . . . . . 72 2.3 Saddle Points and Duality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 2.4 Variational Principles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 2.5 Calculus of Variations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98 2.6 Optimal Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111 2.7 Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 144
3
Nonlinear Operators and Fixed Points . . . . . . . . . . . . . . . . . . . . . 147 3.1 Compact and Fredholm Operators . . . . . . . . . . . . . . . . . . . . . . . . . 148 3.2 Monotone and Accretive Operators . . . . . . . . . . . . . . . . . . . . . . . . 162 3.3 Degree Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196 3.4 Metric Fixed Points . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 224 3.5 Topological Fixed Points . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237 3.6 Order and Fixed Points . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 245 3.7 Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 263
1 2 12 27 35 45 60
xvi
Contents
4
Critical Point Theory and Variational Methods . . . . . . . . . . . . 267 4.1 Critical Point Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 268 4.2 Ljusternik–Schnirelmann Theory . . . . . . . . . . . . . . . . . . . . . . . . . . 289 4.3 Spectrum of the Laplacian and of the p-Laplacian . . . . . . . . . . . 297 4.4 Abstract Eigenvalue Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 334 4.5 Bifurcation Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 340 4.6 Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 349
5
Boundary Value Problems–Hamiltonian Systems . . . . . . . . . . 351 5.1 Variational Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 352 5.2 Method of Upper–Lower Solutions . . . . . . . . . . . . . . . . . . . . . . . . . 380 5.3 Degree-Theoretic Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 404 5.4 Nonlinear Eigenvalue Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . 421 5.5 Maximum and Comparison Principles . . . . . . . . . . . . . . . . . . . . . . 432 5.6 Periodic Solutions for Hamiltonian Systems . . . . . . . . . . . . . . . . . 440 5.7 Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 450
6
Multivalued Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 455 6.1 Continuity of Multifunctions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 456 6.2 Measurability of Multifunctions . . . . . . . . . . . . . . . . . . . . . . . . . . . 470 6.3 Continuous and Measurable Selectors . . . . . . . . . . . . . . . . . . . . . . 475 6.4 Decomposable Sets and Set-Valued Integration . . . . . . . . . . . . . . 487 6.5 Fixed Points and Carath´eodory Multifunctions . . . . . . . . . . . . . . 504 6.6 Convergence of Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 514 6.7 Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 524
7
Economic Equilibrium and Optimal Economic Planning . . . 529 7.1 Perfectly Competitive Economies: Core and Walras Equilibria 530 7.2 Infinite Horizon Multisector Growth Models . . . . . . . . . . . . . . . . 542 7.3 Turnpike Theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 558 7.4 Stochastic Growth Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 567 7.5 Continuous-Time Growth Models . . . . . . . . . . . . . . . . . . . . . . . . . . 589 7.6 Expected Utility Hypothesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 599 7.7 Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 606
8
Game Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 609 8.1 Noncooperative Games–Nash Equilibrium . . . . . . . . . . . . . . . . . . 610 8.2 Cooperative Games . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 617 8.3 Cournot–Nash Equilibria for Random Games . . . . . . . . . . . . . . . 624 8.4 Bayesian Games . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 628 8.5 Stochastic Games . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 632 8.6 Approximate Equilibria . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 644 8.7 Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 649
Contents
9
xvii
Uncertainty, Information, Decision Making . . . . . . . . . . . . . . . . 651 9.1 Mathematical Space of Information . . . . . . . . . . . . . . . . . . . . . . . . 652 9.2 The ex-Post View . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 662 9.3 The ex-ante View . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 668 9.4 Convergence of σ-Fields and Prediction Sequences . . . . . . . . . . . 673 9.5 Games with Incomplete Information . . . . . . . . . . . . . . . . . . . . . . . 680 9.6 Markov Decision Chains with Unbounded Costs . . . . . . . . . . . . . 684 9.7 Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 689
10 Evolution Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 691 10.1 Lebesgue–Bochner Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 692 10.2 Semilinear Evolution Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . 701 10.3 Nonlinear Evolution Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . 718 10.4 Second-Order Nonlinear Evolution Equations . . . . . . . . . . . . . . . 740 10.5 Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 750 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 753 List of Symbols . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 781 Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 783
1 Smooth and Nonsmooth Calculus
Summary. *In this chapter we provide an overview of the main aspects of the smooth and nonsmooth calculus. We start with the smooth calculus and we introduce the notions of Gˆ ateaux and Fr´echet derivatives. We develop all the important calculus rules and we present the implicit and inverse function theorems together with their most important consequences. Then we pass to nonsmooth functions, starting with convex functions. For such functions, we develop the duality theory using the notion of conjugate functions and then we present the subdifferential theory. Subsequently, we extend the subdifferential theory to locally Lipschitz functions (Clarke’s theory). Using these theories, we also examine the local geometry of convex and nonconvex sets. Finally we present and study in detail a notion of convergence of functions distinct from the pointwise convergence, known as the Γ-convergence, which is designed to deal with the stability analysis of variational problems.
Introduction In this chapter we present an overview of the basic aspects of the smooth and nonsmooth calculus. This chapter provides all the basic tools to approach the theoretical and applied subjects in the chapters that follow. In Section 1.1 we present the basic items from the classical smooth calculus of functions defined in a Banach space. So we introduce the notions of Gˆ ateaux and Fr´echet derivatives and then study their properties. We develop mean value theorems and chain rules, we consider partial derivatives for functions defined on product spaces and we conclude with two basic theorems that are important in analysis and differential geometry, namely the implicit function theorem and the inverse function theorem. In Section 1.2 we deal with convex functions defined in a Banach space. Convex functions provide the link that connects the smooth calculus with the nonsmooth one. Continuous convex functions have remarkable differentiability properties on certain Banach spaces and in RN possess a derivative under conditions that are weaker than the usual ones. For lower semicontinuous convex functions that are not differentiable, we can introduce a multivalued substitute of the derivative, known as the (convex) subdifferential of the function. In Section 1.2 we study the basic N.S. Papageorgiou, S.Th. Kyritsi-Yiallourou, Handbook of Applied Analysis, Advances in Mechanics and Mathematics 19, DOI 10.1007/b120946_1, © Springer Science+Business Media, LLC 2009
2
1 Smooth and Nonsmooth Calculus
properties of the subdifferential and simultaneously we develop the duality theory for convex functions which is closely related to the subdifferential theory. In Section 1.3 we extend the notion of subdifferential to nonconvex functions. This is achieved with the use of locally Lipschitz functions. For such functions we define a subdifferential operator, known as the generalized subdifferential, and develop the basic rules of the corresponding calculus. Section 1.4 deals with the local geometry of nonsmooth convex and nonconvex sets. First we deal with convex sets that are not smooth and introduce for them substitutes of the well-known tangent and normal planes of differential geometry. These are the tangent and normal cones. Then with the help of the generalized subdifferential of the distance function (which is Lipschitz continuous) we extend the notions of tangency and normalcy to nonsmooth nonconvex sets. Finally in Section 1.5, we introduce a convergence of functions, distinct from the pointwise convergence, which is designed in such a way that makes it the right tool in the stability (sensitivity) analysis of variational problems. This convergence is known as the Γ-convergence and in Section 1.5 we present the basic results concerning it. We also introduce the so-called Mosco convergence of functions, which is more suitable when dealing with problems defined in a reflexive Banach space.
1.1 Gˆ ateaux and Fr´ echet Derivatives Let X, Y be Banach spaces and f : X −→ Y . In what follows by L(X, Y ) we denote the Banach space of bounded linear operators from X into Y . First we introduce a weak form of differentiability. DEFINITION 1.1.1 We say that f is Gˆ ateaux differentiable at x ∈ X, if there exists L ∈ L(X, Y ) such that lim
λ→0
f (x + λh) − f (x) = Lh λ
for all h ∈ X.
The operator L ∈ L(X, Y ) is called the Gˆ ateaux derivative of f at x ∈ X and is denoted by f (x). We say that f is Gˆ ateaux differentiable if it is Gˆ ateaux differentiable at every x ∈ X. REMARK 1.1.2 The Gˆ ateaux derivative is a directional derivative and so it is essentially a one-dimensional concept. Indeed, if for fixed x, h ∈ X we introduce ϕ(λ) = f (x + λh), λ ∈ R, then (d dλ)ϕ(λ)λ=0 = f (x)h. Evidently if the Gˆ ateaux derivative exists at x, then it is unique. EXAMPLE 1.1.3 (a) If A ∈ L(X, Y ), then A (x) = A for all x ∈ X. m,n n m ∈ Rm×n (the (b) If f = (fk )m k=1 : R −→ R , then f (x) = (∂fi ∂xj )(x) i=1,j=1
Jacobian matrix). We can prove a mean value theorem for Gˆ ateaux differentiable functionals ϕ : X −→ R
1.1 Gˆ ateaux and Fr´echet Derivatives
3
PROPOSITION 1.1.4 If f : X −→ R is Gˆ ateaux differentiable and x, h ∈ X, then there exists 0 < t < 1 such that f (x + h) − f (x) = f (x + th)h. PROOF: Let ϕ(λ) = f (x + λh), λ ∈ R. Then (d dλ)ϕ(λ) = f (x + λh)h. So invoking the mean for real functions, we can find 0 < t < 1 such that value theorem ϕ(1) − ϕ(0) = (d dλ)ϕ(λ)λ=t , hence f (x + h) − f (x) = f (x + th)h. If Y is not equal to R, then the mean value theorem is not valid. EXAMPLE 1.1.5 Consider the function f : R −→ R2 defined by f (t) = (cos t, sin t). In this case the mean value theorem takes an inequality form. Namely we have the following. PROPOSITION 1.1.6 If f : X −→ Y is Gˆ ateaux differentiable, x, h ∈ X and y ∗ ∈ Y ∗ , then there exists 0 < t < 1 such that y ∗ , f (x + h) − f (x)Y = y ∗ , f (x + th)h Y and
f (x + h) − f (x)Y ≤ f (x + th)L hX .
PROOF: Consider the function ϕ : X −→ R defined by ϕ(x) = y ∗ , f (x)Y . Then ϕ (x) = y ∗ , f (x)hY . By virtue of Proposition 1.1.4, we can find 0 < t < 1 such that ϕ(x + h) − ϕ(x) = y ∗ , f (x + th)h Y . Because y ∗ ∈ Y ∗ was arbitrary, we can choose y ∗ ∈ Y ∗ with y ∗ Y ∗ = 1 such that | y ∗ , f (x + h) − f (x)Y | = f (x + h) − f (x)Y . So from the first part of the proof, we have f (x + h) − f (x)Y = | y ∗ , f (x + th)h Y | ≤ f (x + th)L hX
(recall that y ∗ Y ∗ = 1).
Now we introduce the second stronger form of differentiability. DEFINITION 1.1.7 We say that f : X −→ Y is Fr´echet differentiable at x ∈ X, if there exists L ∈ L(X, Y ) such that f (x + h) − f (x) = Lh + r(x, h)
where (r(x, h)Y ) hX −→ 0 as hX −→ 0. The operator L ∈ L(X, Y ) is called the Fr´echet derivative of f at x and it is denoted by f (x). It is clear from the context which derivative we mean when we write f (x). We say that f is Fr´echet differentiable if it is Fr´echet differentiable at every x ∈ X.
4
1 Smooth and Nonsmooth Calculus
REMARK 1.1.8 The Fr´echet derivative when it exists, is unique. It is clear from the above definition that Fr´echet differentiability implies Gˆ ateaux differentiability. The converse is not in general true. EXAMPLE 1.1.9 Consider the function f : R2 −→ R defined by f (x1 , x2 ) =
x6 1 2 2 x8 1 +(x2 −x1 )
0
if (x1 , x2 ) = (0, 0)
for all x =
if (x1 , x2 ) = (0, 0)
x1 x2
∈ R2 .
Then it is easy to see that f is Gˆ ateaux differentiable at the origin with zero Gˆ ateaux derivative. On the other hand moving along the curve (u, u2 ), we see that |f (u, u2 )| 1
= 2 u uu2 R2 and so f is not Fr´echet differentiable at x = 0. The next proposition gives a situation where the two notions coincide. PROPOSITION 1.1.10 If f : X −→ Y is Gˆ ateaux differentiable on some open set U ⊆ X, x ∈ U and the map u −→ f (u) is continuous at x ∈ X from X into L(X, Y ) furnished with the operator norm topology, then f is also Fr´ echet differentiable at x ∈ X and the two derivatives coincide. PROOF: Let r(x, h) = f (x + h) − f (x) − f (x)h and y ∗ ∈ Y ∗ . Using Proposition 1.1.6 we can find 0 < t < 1 such that y ∗ , r(x, h)Y = y ∗ , f (x + th)h − f (x)h . As before, we choose y ∗ ∈ Y ∗ with y ∗ = 1 such that r(x, h)Y = | y ∗ , r(x, h)Y |, ⇒ r(x, h)Y ≤ f (x + th) − f (x)L hX , r(x, h)Y ⇒ ≤ f (x + th) − f (x)L −→ 0 hX
as
hX −→ 0.
This proves the Fr´echet differentiability of f at x and that the two derivatives coincide. Existence of the Fr´echet derivative at x ∈ X implies continuity of f at x ∈ X. PROPOSITION 1.1.11 If f is Fr´echet differentiable at x ∈ X, then f is continuous at x ∈ X. PROOF: From Definition 1.1.7, we see that there is δ > 0 such that f (x + h) − f (x) − f (x)hY ≤ hX ,
if
hX ≤ δ.
Therefore we have f (x + h) − f (x)Y ≤ (1 + f (x)L )hX , from which we conclude the continuity of f at x ∈ X.
if
hX ≤ δ,
1.1 Gˆ ateaux and Fr´echet Derivatives
5
REMARK 1.1.12 The result is not true if Fr´echet differentiability is replaced by Gˆ ateaux differentiability. The function in Example 1.1.9 is Gˆ ateaux differentiable at the origin but it is not continuous there. EXAMPLE 1.1.13 Let X = C([0, b]) (equipped with the supremum norm) and b
g ∈ C 1 (R). Consider the map f (u) = 0 g u(t) dt for all u ∈ C([0, b]). Then f : X −→ R is Fr´echet differentiable and
b
g u(t) h(t)dt f (u)h = for all h ∈ C([0, b]). 0
We have the following chain rule for derivatives. PROPOSITION 1.1.14 If X, Y, Z are Banach spaces, f :X−→Y is Gˆ ateaux differentiable at x and g : Y −→ Z is Fr´echet differentiable at f (x), then ξ = g◦f : X −→ Z is Gˆ ateaux differentiable at x and
ξ (x) = g f (x) f (x). Moreover, if f is Fr´echet differentiable at x ∈ X, then ξ is Fr´echet differentiable at x ∈ X. PROOF: If λ = 0 , then we have
1 ξ(x + λh) − ξ(x) − λg f (x) f (x)hZ |λ|
1 ≤ g f (x + λh) − g f (x) − g f (x) f (x + λh) − f (x) Z + |λ|
1 + g f (x) f (x + λh) − f (x) − λf (x)h Z . |λ|
(1.1)
Due to the Gˆ ateaux differentiability of f at x, we have
and
1 g f (x) f (x + λh) − f (x) − λf (x)h Z −→ 0 |λ| as λ −→ 0. f (x + λh) − f (x)Y −→ 0
(1.2)
Then for any λ ∈ R such that f (x + λh) = f (x), due to the Fr´echet differentiability of g at f (x), we have
1 g f (x + λh) − g f (x) − g f (x) f (x + λh) − f (x) Z |λ|
g f (x + λh) − g f (x) − g f (x) f (x + λh) − f (x) Z = f (x + λh) − f (x)Y f (x + λh) − f (x)Y × −→ 0 as λ −→ 0. |λ|
(1.3)
Returning to (1.1), passing to the limit as λ −→ 0, and using (1.2) and (1.3), we conclude that g ◦ f is Gˆ ateaux differentiable at x ∈ X. In a similar fashion we can show that g ◦ f is Fr´echet differentiable at x ∈ X, if g is Fr´echet differentiable at f (x).
6
1 Smooth and Nonsmooth Calculus
DEFINITION 1.1.15 We say that f:X−→Y is continuously Fr´echet differentiable at x ∈ X, if f is Fr´echet differentiable at x ∈ X and u −→ f (u) is continuous at x ∈ X from X into L(X, Y ) furnished with the operator norm topology. If this is true at every x ∈ X, we simply say that f is continuously Fr´echet differentiable and write f ∈ C 1 (X, Y ) (or simply f ∈ C 1 (X) if Y = R). Now suppose Y = Y1 × Y2 with Y1 , Y2 Banach spaces. It is well-known that Y can be given many different equivalent norms which make it a Banach space (e.g., (y1 , y2 )1 = y1 Y1 + y2 Y2 or (y1 , y2 )∞ = max{y1 Y1 , y2 Y2 }). The space L(X, Y1 × Y2 ) is isometrically isomorphic to the product space L(X, Y1 ) × L(X, Y2 ). Let p1 : Y −→ Y1 and p2 : Y −→ Y2 be the corresponding canonical projection operators. We know that p1 ∈ L(X, Y1 ) and p2 ∈ L(X, Y2 ). If f : X −→ Y = Y1 × Y2 , then f1 = p1 ◦ f and f2 = p2 ◦ f are the components of f ; that is, f = (f1 , f2 ). If i1 : Y1 −→ Y and i2 : Y2 −→ Y are the canonical injections, then f = i1 ◦ f1 + i2 ◦ f2 . Recall that i1 ∈ L(Y1 , Y ) and i2 ∈ L(Y2 , Y ). PROPOSITION 1.1.16 A function f : X −→ Y = Y1 ×Y2 is Fr´echet differentiable at x ∈ X if and only if f1 and f2 are Fr´echet differentiable at x ∈ X. We also have
f (x) = f1 (x), f2 (x) with f1 (x) = p1 ◦ f (x), f2 (x) = p2 ◦ f (x). PROOF: Suppose f is Fr´echet differentiable at x. Then from Proposition 1.1.14, we have that f1 and f2 are both Fr´e chet differentiable at x ∈ X, f1 (x) = p1 ◦ f (x), f2 (x) = p2 ◦ f (x), and f (x) = f1 (x), f2 (x) . Conversely, suppose that f1 and f2 are Fr´echet differentiable at x ∈ X. Endow Y =Y1 ×Y2 , for example, with the norm (y1 , y2 )Y = max{y1 Y1 , y2 Y2 } and for all h ∈ X set
ξ(h) = f1 (x)h, f2 (x)h . Then for every u ∈ X, we have f (u) − f (x) − ξ(u − x)Y = max fk (u) − fk (x)(u − x)Yk k∈{1,2}
= o(u − xX ), o(u − xX ) where −→ 0 u − xX
as u −→ x in X.
This shows that f is Fr´echet differentiable at x ∈ X and f (x) = f1 (x), f2 (x) . Next suppose that X = X1 ×X2 with X1 , X2 Banach spaces and f:X−→Y , where Y is another Banach space. Let x = (x1 , x2 ) ∈ X. The function u1 −→ f (u1 , x2 ) is called the first partial function associated with f at x and u2 −→ f (x1 , u2 ) is called the second partial function associated with f at x. We can consider the Fr´echet derivatives of these partial functions. These are called partial derivatives of f and are denoted by fu 1 (x) and fu 2 (x). Then in a straightforward manner, we can show the following result.
1.1 Gˆ ateaux and Fr´echet Derivatives
7
PROPOSITION 1.1.17 If f : X = X1 × X2 −→ Y is Fr´echet differentiable at x = (x1 , x2 ) ∈ X, then the two partial functions associated with f at x are Fr´echet differentiable at x1 ∈ X1 and at x2 ∈ X2 , respectively, and we have f (x)h = fx 1 (x)h1 + fx 2 (x)h2
for all h = (h1 , h2 ) ∈ X1 × X2 .
REMARK 1.1.18 Clearly the result can be extended to an arbitrary finite product X = X1 × · · · × Xn , n ≥ 2. The converse of Proposition 1.1.17 is not in general true. Namely the existence of the partial derivatives of f : X = X1 × X2 −→ Y at x = (x1 , x2 ) ∈ X does not imply the differentiability of f at x ∈ X. The next example illustrates this. EXAMPLE 1.1.19 Let f : R2 −→ R be defined by x x 1 2 if (x1 , x2 ) = (0, 0) 2 2 f (x1 , x2 ) = x1 +x2 0 if (x1 , x2 ) = (0, 0)
for all
x1 x2
∈ R2 .
Then (∂f ∂x1 )(0, 0) = (∂f ∂x2 )(0, 0) = 0, but f is not continuous at (0, 0), hence a fortiori it is not Fr´echet differentiable there (see Proposition 1.1.11). PROPOSITION 1.1.20 If {Xk }n k=1 , Y are Banach spaces and f : X = X1 × · · · × Xn −→ Y , then f ∈ C 1 (X, Y ) if and only if the n-partial derivatives fx k (x) exist at every x ∈ X and x −→ fx k (x) is continuous from X into L(Xk , Y ) with the operator norm topology, for all 1 ≤ k ≤ n. PROOF: We do the proof for n = 2. The general case follows easily by induction. First we assume that f ∈ C 1 (X, Y ). From Proposition 1.1.17 we know that fx1 (x), fx 2 (x) exist for all x ∈ X and we have fx 1 (x)h1 = f (x)(h1 , 0), fx 2 (x)h2 = f (x)(0, h2 ) for all x ∈ X, h1 ∈ X1 , h2 ∈ X2 . From this follows at once that x −→ fx k (x) is continuous from X into L(Xk , Y ) with the operator norm topology for k = 1, 2. Now suppose that the partial derivatives fx k exist on X and are continuous. For h = (h1 , h2 ) ∈ X = X1 × X2 , let ξ(x)h = fx 1 h1 + fx 2 h2 . Then for all u = (u1 , u2 ) ∈ X, we have f (u) − f (x) − ξ(x)(u − x)Y ≤ f (u1 , u2 ) − f (x1 , u2 ) − fx 1 (x1 , x2 )(u1 − x1 )Y
+ f (x1 , u2 ) − f (x1 , x2 ) − fx 2 (x1 , x2 )(u2 − x2 )Y .
(1.4)
Then given ε > 0, we can find δ > 0 such that u2 − x2 X ≤ δ implies f (x1 , u2 ) − f (x1 , x2 ) − fx 2 (x1 , x2 )(u2 − x2 )Y ≤ Also from Proposition 1.1.6, we have
ε u2 − x2 X2 . 2
(1.5)
8
1 Smooth and Nonsmooth Calculus f (u1 , u2 ) − f (x1 , u2 ) − fx 1 (x1 , x2 )(u1 − x1 )Y
≤
sup z1 ∈[x1 ,u1 ]
fx 1 (z1 , u2 ) − fx 1 (x1 , x2 )L u1 − x1 X1
[x1 , u1 ] = tx1 + (1 − t)u1 : 0 ≤ t ≤ 1 .
(1.6)
By hypothesis, we can find δ1 ≤ δ such that max{z1 − x1 X1 , u2 − x2 X2 } ≤ δ, implies ε fx 1 (z1 , u2 ) − fx 1 (x1 , x2 )L ≤ . (1.7) 2 Using (1.5) through (1.7) in (1.4), we see that if u − xX = max{u1 − x1 X1 , u2 − x2 X2 } ≤ δ1 , then ε ε u2 − x2 X2 + u1 − x1 X1 2 2 ≤ ε max{u2 − x2 X1 , u1 − x1 X1 }
f (u) − f (x) − ξ(x)(u − x)Y ≤
= εu − x. This proves the Fr´echet differentiability of f at x and f (x)h = ξ(x)h = fx 1 (x)h1 + fx 2 (x)h2 for all h = (h1 , h2 ) ∈ X1 × X2 . n COROLLARY 1.1.21 If Y is a Banach space and f : R −→ Y , then f ∈ 1 n C (R , Y ) if and only if the n-partial derivatives (∂f ∂xk )(x) are continuous from Rn into Y for all k = 1, . . . , n.
In this last part of this section we prove the implicit function theorem and the inverse function theorem, which are important in analysis and differential geometry. The proof of the implicit function theorem, depends on the Banach fixed theorem. Here we simply state the result and postpone its proof until Section 3.4, where the result is formulated and proved in a more general setting. PROPOSITION 1.1.22 If X is a Banach space, C ⊆ X is a nonempty closed subset, and f : C −→ C satisfies f (x) − f (z)X ≤ kx − zX
for all x, z ∈ C with k < 1,
(1.8)
then there exists a unique x ∈ C such that x = f (x) (fixed point of f ). Moreover, if Y is another Banach space, U ⊆ Y nonempty open and we have a family of functions f (u) : C −→ C, u ∈ U , satisfying (1.8) with k < 1 independent of u ∈ U , then the unique fixed point x(u) ∈ C (i.e., x(u) = f (u) x(u) for all u ∈ U ) depends continuously on u ∈ U . Using this proposition we can prove the so-called implicit function theorem. This theorem is about equations of the form f (x, y) = 0. It tells us under what conditions this equation defines a function y = g(x) (we say that y = g(x) is defined implicitly) and we would like to compute dy dx. Given such a function f , in general we can not solve for y explicitly and so it is important to know that such a function g indeed exists without having to solve for it.
1.1 Gˆ ateaux and Fr´echet Derivatives
9
THEOREM 1.1.23 (Implicit Function Theorem) If X, Y, Z are Banach spaces, U ⊆ X × Y is a nonempty open set, (x0 , y0 ) ∈ U, f ∈ C 1 (U, Z), fy (x0 , y0 ) ∈ L(Y, Z) is an isomorphism, and f (x0 , y0 ) = 0, then there exist open neighborhoods V of x0 and W of y0 with V × W ⊆ U and a function g ∈ C 1 (V, W ) such that
f x, g(x) = 0 for all x ∈ V (1.9) −1
and g (x) = −fy x, g(x) ◦ fx x, g(x) for all x ∈ V. (1.10) Moreover, for every x ∈ V, g(x) is the unique solution in W of (1.9). PROOF: For notational convenience, we set S0 = fy (x0 , y0 ). Evidently the equation f (x, y) = 0 is equivalent to y = y − S0−1 f (x, y) = F (x, y).
(1.11)
The significance of this straightforward reformulation is that on F we can apply Proposition 1.1.22. Because S0−1 ◦ S0 = IdY , we have
see (1.11) . F (x, y1 ) − F (x, y2 ) = S0−1 S0 (y1 − y2 )− f (x, y1 ) − f (x, y2 ) Because of the hypotheses on f , we can find δ1 > 0 and r > 0 such that if x−x0 X ≤ δ1 and y1 − y0 Y ≤ r, y2 − y0 Y ≤ r (i.e., y1 − y2 Y ≤ 2r), then F (x, y1 ) − F (x, y2 )Z ≤
1 y1 − y2 Y . 2
(1.12)
Also we can find 0 < δ < δ1 such that, if x − x0 X ≤ δ, then F (x, y0 ) − F (x0 , y0 )Z ≤
r . 2
(1.13)
Therefore, if x − x0 X ≤ δ and y − y0 Y ≤ r, then F (x, y) − y0 Z = F (x, y) − F (x0 , y0 )Z ≤ F (x, y) − F (x, y0 )Z + F (x, y0 ) − F (x0 , y0 )Z 1 r
≤ y − y0 Y + see (1.12) and (1.13) 2 2 ≤ r. ¯r (y0 ) = {y ∈ Y : y − y0 Y ≤ r} onto itself Hence F (x, y) maps the closed ball B and similarly the open ball Br (y0 ) = {y ∈ Y : y − y0 Y < r} onto itself. Applying Proposition 1.1.22 to the parametric family of functions y −→ F (x, y) x∈B¯ (x ) 0 δ ¯δ (x0 ) we can find a unique y = y(x) ∈ B ¯r (y0 ) such (see (1.12)), for every x ∈ B that F (x, y) = y; hence f (x, y) = 0 (which proves (1.9) and x −→ g(x) = y(x) is continuous. Let V = Bδ (x0 ) and W = Br (y0 ). Choosing enough, we can guarantee that V × W ⊆ U . We claim
δ, r > 0 small that g ∈ C 1 Bδ (x0 ), Y . To show this let (x1 , y1 ) ∈ V × W, y1 = g(x1 ) (recall that G(x, ·) maps W onto itself). By virtue of the differentiability of f at (x1 , y1 ), we have f (x, y) = K(x − x1 ) + L(y − y1 ) + u(x, y)
for all (x, y) ∈ U,
(1.14)
10
1 Smooth and Nonsmooth Calculus
where K = fx (x1 , y1 ) and L = fy (x1 , y1 ) and lim
(x,y)→(x1 ,y1 )
u(x, y)Z = 0. (x − x1 , y − y1 )X×Y
(1.15)
Inasmuch as f x, g(x) = 0 for all x ∈ V , from (1.14) we obtain
g(x) = y1 − L−1 K(x − x1 ) − L−1 u x, g(x)
for all x ∈ V.
(1.16)
Because of (1.15), we can find η > 0 such that if x−x1 X ≤ η and y−y1 X ≤ η, then 1 (x − x1 X + y − y1 Y ) 2L−1 L
1 (x − x1 X + g(x) − g(x1 )Y ), ⇒ u x, g(x) Z ≤ 2L−1 L u(x, y)Z ≤
(1.17)
for all x ∈ V . From (1.16) and (1.17) it follows that 1 g(x) − g(x1 )Y 2 with ϑ = 2L−1 KL + 1.
g(x) − g(x1 )Y ≤ L−1 KL x − x1 X + ⇒ g(x) − g(x1 )Y ≤ ϑx − x1 X
(1.18)
Let ξ(x) = L−1 u x, g(x) , x ∈ V . From (1.16), we have g(x) − g(x1 ) = L−1 K(x − x1 ) + ξ(x).
(1.19)
Note that ξ(x)Y ≤L−1 KL u x, g(x) Z , x∈V and lim
x→x1
u x, g(x) Z =0 x − x1 X
Hence we infer that lim
x→x1
(see (1.15) and (1.16)).
ξ(x)Y = 0. x − x1 X
(1.20)
Combining (1.19) and (1.20), we conclude that g is Fr´echet differentiable at x1 ∈ V and (1.21) g (x1 ) = −L−1 K which proves (1.10). Moreover, it is clear from (1.21) that g ∈ C 1 (V, W ).
REMARK 1.1.24 A special case of interest is when X = Rn and Y = Z = Rm . Then the function f has m-components fk : (x1 , . . . , xn , y1 , . . . , ym ) −→ fk (x1 , . . . , xn , y1 , . . . , ym ), 1 ≤ k ≤ m, which are C 1 R-valued functions of (n + m)variables x1 , . . . , xn , y1 , . . . , ym . Then m ∂fk (x0 , y0 ) ∈ Rm×m . fy (x0 , y0 ) = ∂yl k,l=1
1.1 Gˆ ateaux and Fr´echet Derivatives
11
Let ak = fk (x0 , y0 ), k ∈ {1, . . . , m}. Then according to Theorem 1.1.23, if detfy (x0 , y0 ) = 0, then the system of equations fk (x1 , . . . , xn , y1 , . . . , ym ) = ak , k ∈ {1, . . . , m} for every value of the parameter x = (xi )n i=1 ∈ V has a unique solution y = g(x) 1 with (x, y) ∈ U and g = (gk )m k=1 ∈ C (V, W ). So we have
fk x1 , . . . , xn , g1 (x1 , . . . , xn ), . . . , gm (x1 , . . . , xn ) = ak , k ∈ {1, . . . , m}. As a consequence of Theorem 1.1.23 we obtain the inverse function theorem. This theorem (as its name suggests), is about invertibility If
of functions. n f : Rn −→ Rn has a nonzero Jacobian determinant at x (i.e., det ∂fi ∂xj i,j=1 = 0), then f (x) ∈ L(Rn , Rn ) is an isomorphism . From the fact that the best linear approximation is invertible, we would like to conclude the invertibility of f . In general this is not possible. Consider the simple case of n = 1; that is, f : R −→ R. If f ∈ C 1 (R) and f (x) = 0, then we can only guarantee the invertibility of f near x, because f still has nonzero slope in a neighborhood of x. Therefore our main concern is local invertibility. THEOREM 1.1.25 (Inverse Function Theorem) If X, Y are Banach spaces, U ⊆ Y is a nonempty open set, f ∈ C 1 (U, X), y0 ∈ U , and f (y0 ) ∈ L(Y, X) is an isomorphism, then there exists a neighborhood U of y0 , U ⊆ U and V a neighborhood of x0 = f (y0 ) such that f : U −→ V is a C 1 -diffeomorphism (i.e., both f and f −1 are C 1 maps) and (f −1 ) (x0 ) = f (y0 )−1 . PROOF: Let F (x, y) = f (y) − x. Then Fy (x0 , y0 ) = f (y0 ) ∈ L(X, Y ) which by hypothesis is an isomorphism. So we can apply Theorem 1.1.23 and obtain 1 a neighborhood V of x
0 and g ∈ C (V , Y ) such that g(V ) ⊆ U 0 with U0 a neighborhood of y0 , F x, g(x) = 0 for all x ∈ V (i.e., f x, g(x) = x for all x ∈ V ) and f restricted on g(V ). Because g(x0 ) = y0 . In what follows we consider f x, g(x) = x, we see that g is injective on V , hence a bijection from V onto g(V ). Moreover, the set g(V ) = f −1 (V ) is open in Y because f ∈ C 1 (U, X). Set U = g(V ). We have that f : U −→ V is a bijection. Also from Theorem 1.1.23 we have
−1
g (x0 ) = − Fy x0 , g(x0 ) Fx x0 , g(x0 ) hence f (y0 ) ◦ g (x0 ) = IdX . Therefore we conclude that g (x0 ) = (f −1 ) (x0 ) = f (y0 )−1 .
COROLLARY 1.1.26 If X, Y are Banach spaces, U ⊆ Y a nonempty open set, f ∈ C 1 (U, X), f is injective, and for every y ∈ U f (y) ∈ L(Y, X) is an isomorphism, then f (U ) is open in X and f is a C 1 -diffeomorphism (i.e., both f and f −1 are C 1 maps) from U onto f (U ). REMARK 1.1.27 Suppose X = Rn , Y = Rm , U ⊆ Rm nonempty open and f ∈ C 1 (U, Rn ) with f (y0 ) = x0 . Suppose that m ≤ n and rankf (y0 ) = m (note that f (y0 ) ∈ Rn×m ). Then we can find U ⊆ U a neighborhood of y0 , V a neighborhood of x0 , and a differentiable function g : V −→ U such that g ◦f = i with i : Rm −→ Rn
12
1 Smooth and Nonsmooth Calculus
being the canonical injection map (i.e., i(u1 , . . . , um ) = (u1 , . . . , um , 0, . . . , 0)). If m ≥ n and rankf (y0 ) = n, then we can find a U ⊆ U neighborhood of y0 and a differentiable function g : U −→ U such that g(y0 ) = y0 and f ◦ g = pRn , where pRn : Rm −→ Rn is the canonical projection (i.e., pRn (u1 , . . . , um ) = (u1 , . . . , un )). We conclude this section with a well-known result about the Nemytski operator (see, e.g., for example Gasi´ nski–Papageorgiou [259]). PROPOSITION 1.1.28 (a) If (Ω, Σ, µ) is a complete σ-finite measure space, X, Y are separable Banach spaces, and f : Ω×X −→ Y is a Carath´ eodory function (i.e., Σ-measurable in ω ∈ Ω and continuous in x ∈ X) such that p/r
f (ω, x)Y ≤ α(ω) + cxX p, r ∈ [1, ∞), α ∈ Lr (Ω), c > 0
then x −→ Nf (x)(·) = f ·, x(·) is continuous and bounded from Lp (Ω, X) into r L (Ω, Y ). (b) If f : Ω×R −→ R is a Carath´ eodory function
x
f (ω, s)ds and ψ(u) = F ω, u(ω) dµ F (ω, x) = 0
for all u ∈ L (Ω), then ψ ∈ C p
1
p
Ω
L (Ω) and ψ (u) = Nf (u).
1.2 Convex Functions Throughout this section X is a locally convex vector space. Additional hypotheses are introduced as needed. Also we consider functions that also take the value +∞. For this reason we introduce the set R = R ∪ {+∞}. DEFINITION 1.2.1 Let ϕ : X −→ R. The effective domain of ϕ is the set dom ϕ = {x ∈ X : ϕ(x) < +∞}. We say that ϕ is proper if dom ϕ = ∅. The epigraph of ϕ is the set epi ϕ = {(x, λ) ∈ X × R : ϕ(x) ≤ λ}. The function ϕ is said to be lower semicontinuous (or closed ) if for every λ ∈ R, Lλ = {x ∈ X : ϕ(x) ≤ λ} is closed. We say that ϕ is convex if for all x1 , x2 ∈ dom ϕ and all λ ∈ [0, 1], we have
φ λx1 + (1 − λ)x2 ≤ λϕ(x1 ) + (1 − λ)ϕ(x2 ). If this inequality is strict when x1 = x2 and λ ∈ (0, 1), then we say that ϕ is strictly convex. The cone of proper, convex, and lower semicontinuous functions is denoted by Γ0 (X). If C ⊆ X, then the indicator function of C is defined by 0 if x ∈ C iC (x) = . +∞ otherwise
1.2 Convex Functions
13
REMARK 1.2.2 It is easy to check that ϕ is lower semicontinuous if and only if epi ϕ is closed if and only if f (x) = lim inf f (z) = sup inf f (z), where z→x
U ∈N (x)
z∈U
N (x) is the filter of neighborhoods of x. Also ϕ is convex if and only if epi ϕ is convex in X × R. Moreover, if ϕ : X −→ R is convex, then for every λ ∈ R, the set Lλ = {x ∈ X : ϕ(x) ≤ λ} is convex. The converse is not true. Think, for example, of ϕ(x) = |x|, x ∈ R. If C ⊆ X is nonempty, closed (and convex), then iC is proper, lower semicontinuous (and convex, i.e., iC ∈ Γ0 (X)). What about continuity of convex functions? The next theorem summarizes the situation in this respect. THEOREM 1.2.3 If ϕ : X −→ R is a proper, convex function, then the following statements are equivalent. (a) ϕ is bounded above in a neighborhood of x0 ∈ X. (b) ϕ is continuous at x0 ∈ X. (c) int epi ϕ = ∅. (d) int dom ϕ = ∅ and ϕint dom ϕ is continuous. Moreover, if one of the above statements holds, then int epi ϕ = {(x, λ) ∈ X × R : x ∈ int dom ϕ, ϕ(x) < λ}.
PROOF: (a)⇒(b): Suppose that U is the neighborhood of x0 such that ϕU ≤ c for some c > 0. By translating things if necessary, without any loss
of generality we may assume that x0 = 0 and ϕ(0) = 0. Let 0 < ε ≤ c and set Vε = (ε c)U ∩ −(ε c)U . Then Vε is a symmetric neighborhood of the origin. We show that |ϕ(x)| ≤ ε
for all x ∈ Vε ,
(1.22) which of course implies the continuity of ϕ at x0 = 0. So let x ∈ U . Then (c ε)x ∈ U and by virtue of the convexity of ϕ and because ϕ(0) = 0, we have ε c ε ε ϕ(x) ≤ ϕ x + 1 − ϕ(0) ≤ c = ε. (1.23) c ε c c Similarly −(c ε)x ∈ U and we have 1 1+ 1 ≤ 1+
0 = ϕ(0) ≤
⇒
ε c
ϕ(x) +
ε c
1+ ε ε ϕ(x) + 1 + c
−ε ≤ ϕ(x).
ε c
c ϕ − x ε
ε c
(1.24)
From (1.23) and (1.24), it follows that (1.22) holds and so ϕ is continuous at x0 = 0. (b)⇒(a): The continuity of ϕ at x0 implies that ϕ is bounded above in a neighborhood of x0 ∈ X.
14
1 Smooth and Nonsmooth Calculus
(a)⇒(c): As before, let U be a neighborhood of x0 such that ϕU ≤ c. Then U ⊆ int dom ϕ and {(x, λ) ∈ X × R : x ∈ U, c < λ} ⊆ epi ϕ which implies that int epi ϕ = ∅. (c)⇒(a): Let (x, λ) ∈ int epi ϕ. Then we can find U a neighborhood of x and ε > 0 such that U × [λ − ε, λ + ε] ⊆ epi ϕ. Then U × {λ} ⊆ epi ϕ and so we have ϕ(x) ≤ λ for all x ∈ U , which is statement (a). (a)⇒(d): Again without any loss of generality, we may assume that x0 = 0. Let U be a neighborhood of x0 such that ϕU is bounded above. Then U ⊆ dom ϕ and so int dom ϕ = ∅. Clearly the set dom ϕ is convex. So if x ∈ int dom ϕ, we can find λ > 1 such that v = λx ∈ dom ϕ. Set 1 V =x+ 1− U, λ
which is a neighborhood of x. If z ∈ V , we have z = x + 1 − λ1 u with u ∈ U and so exploiting the convexity of ϕ, we have 1 1 1 1 ϕ(z) = ϕ v+ 1− u ≤ ϕ(v) + 1 − ϕ(u) λ λ λ λ 1 1 c = c0 . ≤ ϕ(v) + 1 − λ λ Therefore ϕV is bounded above and so it is continuous at x ∈ int dom ϕ (recall that we have already proved (a)⇔(b)). (d)⇒(a): Obvious. Now let E = {(x, λ) ∈ X × R : x ∈ int dom ϕ, ϕ(x) < λ}. Evidently int epi ϕ ⊆ E. Let v ∈ int dom ϕ such that ϕ(v) < λ. Choose ϕ(v) < µ < λ. Because ϕint dom ϕ is continuous we can find U a neighborhood of v such that U ⊆ int dom ϕ and ϕ(v) < µ for all x ∈ U . Therefore (v, λ) ∈ U × (µ, +∞) ⊆ int epi ϕ and so E ⊆ int epi ϕ. REMARK 1.2.4 Note that int dom ϕ = {x ∈ X : there exists λ ∈ R such that (x, λ) ∈ int epi ϕ}. In finite-dimensional spaces the situation simplifies. PROPOSITION 1.2.5 If X is finite-dimensional and ϕ : X −→ R is convex, then ϕ is continuous on int dom ϕ. PROOF: If x ∈ int dom ϕ, then we can find δ > 0 and {ek }N k=0 ⊆ X (N = dim X) such that Bδ (x) ⊆ conv{ek }N k=0 ⊆ dom ϕ. So, if v ∈ Bδ (x), then we can find {tk }N k=0 ⊆ [0, 1] such that
1.2 Convex Functions x=
N
tk ek
with
k=0
N
15
tk = 1.
k=0
Because of the convexity of ϕ, we have ϕ(x) ≤
N
tk ϕ(ek ) ≤ max ϕ(ek ) = c. 0≤k≤N
k=0
Invoking Theorem 1.2.3, we conclude that ϕint dom ϕ is continuous.
In infinite dimensions, we need an additional condition on ϕ in order to have continuity on int dom ϕ. PROPOSITION 1.2.6 If X is a Banach space and ϕ : X −→ R is convex and lower semicontinuous, then ϕint dom ϕ is continuous.
PROOF: Note that dom ϕ =
{ϕ ≤ n}. Due to the lower semicontinuity of ϕ,
n≥1
the sets {ϕ ≤ n} are closed. So, if x ∈ int dom ϕ, then by the Baire category theorem we can find n ≥ 1 such that int{ϕ < n} = ∅ and ϕ(x) < n. Let u ∈ int{ϕ < n} and introduce the function
ξ(λ) = ϕ x + λ(u − x) , λ > 0. ¯δu−x (x) ⊆ dom ϕ. It Because x ∈ int dom ϕ, we can find δ > 0 such that B X follows that [−δ, δ] ⊆ dom ξ and so 0 ∈ int dom ξ. Hence by Proposition 1.2.5 ξ is continuous at zero. Because ξ(0) < n, we can find ε > 0 such that ξ(λ) < n for all λ ∈ [−ε, 0]. We set y = x − ε(u − x). Then we have y ∈ {ϕ < n} and u ∈ int{ϕ < n}. Inasmuch as x ∈ [u, y) = (1 − t)u + ty : 0 ≤ t < 1 , it follows that x ∈ int dom {ϕ < n} and so by Theorem 1.2.3 ϕ is continuous at x. In fact we can identify the kind of continuity of ϕ on int dom ϕ. THEOREM 1.2.7 If X is a Banach space and ϕ : X −→ R is a convex function that is continuous at x0 ∈ dom ϕ, then there exists r > 0 such that ϕ is Lipchitz ¯r (x0 ). continuous on B PROOF: The continuity of ϕ at x0 implies that there exist r, δ, c > 0 such that |ϕ(y)| ≤ c
¯r+δ (x0 ). for all y ∈ B
¯r (x0 ) with x = y. We set Let x, y ∈ B u=y+δ
y−x y − x
and
λ=
y − x ∈ (0, 1). y − x + δ
¯r+δ (x0 ) and y = λu + (1 − λ)x. So, because ϕ is convex Then u ∈ B
16
1 Smooth and Nonsmooth Calculus ϕ(y) ≤ λϕ(u) + (1 − λ)ϕ(x)
⇒ ϕ(y) − ϕ(x) ≤ λ ϕ((u) − ϕ(x) ≤
y − x 2c 2c ≤ y − x. y − x + δ δ
Interchanging the roles of x, y in the above argument, we conclude that |ϕ(y) − ϕ(x)| ≤
2c y − x δ
¯r (x0 ). for all x, y ∈ B
COROLLARY 1.2.8 If X is a Banach space and ϕ : X −→ R is a continuous convex function, then ϕ is locally Lipschitz. Thus far we have concentrated our attention on the continuity properties of convex functions. Now we turn our attention to the differentiability properties that lead to the subdifferential. DEFINITION 1.2.9 Let X be a normed space, ϕ : X −→ R a convex function, and x0 ∈ dom ϕ. The directional derivative of ϕ at x0 in the direction h ∈ X, denoted by ϕ (x0 ; h), is defined by ϕ (x0 ; h) = lim λ↓0
ϕ(x0 + λh) − ϕ(x0 ) . λ
REMARK 1.2.10 Due to the convexity of ϕ, the quotient map λ −→ ϕ(x0 +λh)−ϕ(x0 ) is increasing on (0, +∞) and so ϕ (x0 ; h) is well defined. In fact λ 0) ϕ (x0 ; h) = inf ϕ(x0 +λh)−ϕ(x . It is easy to see that ϕ (x0 ; ·) is convex and posλ λ>0
ateaux itively homogeneous. Of course, if ϕ (x0 ; ·) ∈ X ∗ , then ϕ (x0 ; ·) is the Gˆ derivative of ϕ at x0 . The basic result on the Gˆ ateaux differentiability of convex functions is the following theorem. THEOREM 1.2.11 If X is a separable Banach space, U ⊆ X is a nonempty open convex set, and ϕ : U −→ R is a continuous convex function, then ϕ is Gˆ ateaux differentiable on a dense Gδ -subset of U . PROOF: For every h ∈ X and n ≥ 1, we introduce the set V (h, n) = x ∈ U : there exists δ = δ(x, n) > 0 such that ϕ(x + λh) − ϕ(x − λh) − 2ϕ(x) 1 sup < . λ n 0<λ<δ Because ϕ is continuous on U , given n ≥ 1 for every m ≥ 1 the set ϕ(x + Wm (h) = x ∈ U :
1 h) m
+ ϕ(x − 1 m
1 h) m
− 2ϕ(x)
<
1 n
1.2 Convex Functions is open in U . Note that V (h, n) =
17
Wm (h). So V (h, n) is open.
m≥1
Next we show that V (h, n) is dense in U . If this is not the case, then we can find x0 ∈ U and δ > 0 such that V (h, n) ∩ Bδ (x0 ) = ∅. This means that the convex function λ −→ ξ(λ) = ϕ(x0 + λh) is not differentiable on (−δ, δ), which contradicts the classical result on the differentiability of real convex functions. So V (h, n) is dense in U . Because ϕ is continuous convex, from Corollary 1.2.8 we infer that ϕ (x; ·) is continuous for every x ∈ U . So if {hk }k≥1 is dense in ∂B1 = {u ∈ X : uX = 1}, then ϕ is Gˆ ateaux differentiable on the set V (hk , n) which is dense in U (by n,k≥1
Baire’s theorem) and Gδ .
There is a corresponding result for Fr´echet differentiability due to Asplund [31]. THEOREM 1.2.12 If X is a Banach space with a separable dual, U is a nonempty open convex set, and ϕ : U −→ R a continuous convex function, then ϕ is Fr´echet differentiable on a dense Gδ -set in U . In Example 1.1.9 we saw that existence of partial derivatives does not in general imply Fr´echet differentiability of a function. In the case of convex functions, the situation changes. PROPOSITION 1.2.13 If U ⊆ RN is a nonempty open set, ϕ : U −→ R is convex, and all the partial derivatives of ϕ at x ∈ U exist, then ϕ is Fr´echet differentiable at x ∈ U . N
PROOF: Let A(x) ∈ RN be defined by A(x), h RN = (∂ϕ ∂xk )(x)hk for all k=1
N h = hk k=1 ∈ RN . Let r > 0 be such that Br (x) ⊆ U . For each h ∈ Br (0), we set
ϑ(h) = ϕ(x + h) − ϕ(x) − A(x), h RN . Clearly ϑ is convex on Br (0). For each k ∈ {1, . . . , N } we define ηk : Br (0) −→ R by
ηk (h) =
if hk = 0
ϑ(hk ek ) hk
0
if hk = 0
N for all h = hk k=1 ∈ Br (0),
{ek }N k=1
where is the usual orthonormal basis of RN . Note that ηk (h) −→ 0 as
N hRN −→ 0. For each h = hk k=1 with hRN < r N , because ϑ is convex, we have ϑ(h) = ϑ
N N 1 1 ϑ N hk ek N hk ek ≤ N N k=1
=
N
hk ηk (N h) ≤ hRN
k=1
Because −ϑ(−h) ≤ ϑ(h), we have
k=1
N ηk (N h). k=1
18
1 Smooth and Nonsmooth Calculus −hRN
N N ηk (−N h) ≤ ϑh ≤ hRN ηk (N h) k=1
ϑ(h) −→ 0 ⇒ hRN
k=1
as
hRN −→ 0.
This proves that ϕ is Fr´echet differentiable at x ∈ U and ϕ (x) = A(x).
COROLLARY 1.2.14 If X is a finite-dimensional Banach space, U ⊆ X is nonempty open, and ϕ : U −→ R is convex, then ϕ is Gˆ ateaux differentiable at x ∈ U if and only if it is Fr´ echet differentiable at x ∈ U . Before passing to the discussion of the subdifferential of convex functions, let us briefly mention a few things about the duality theory of such functions. Duality is a basic theme in the theory of convex analysis. We work within a dual pair (X, X ∗ ), where X is a Hausdorff locally convex space and X ∗ its dual. We supply X with the w(X, X ∗ )-topology (weak topology) and X ∗ with the w(X ∗ , X)-topology. The pairing of X and X ∗ is denoted by ·, ·X . In what follows R∗ = R ∪ {±∞}. DEFINITION 1.2.15 Given a function ϕ : X −→ R∗ , the conjugate (or Legendre– Fenchel transform) of ϕ is the function ϕ∗ : X ∗ −→ R∗ defined by ϕ∗ (x∗ ) = sup x∗ , xX − ϕ(x) : x ∈ X . Similarly the second conjugate of ϕ, is the function (ϕ∗ )∗ = ϕ∗∗ : X −→ R∗ defined by ϕ∗∗ (x) = sup x∗ , xX − ϕ∗ (x∗ ) : x∗ ∈ X ∗ . REMARK 1.2.16 If ϕ takes the value −∞, then ϕ∗ ≡ +∞. Also if ϕ = +∞, then ϕ∗ has values in R = R ∪ {+∞}. Directly from Definition 1.2.15, we have the following. PROPOSITION 1.2.17 If ϕ : X −→ R is proper, then ϕ∗ ∈ Γ0 (X ∗ ). PROPOSITION 1.2.18 If ϕ : X −→ R∗ , then ϕ(x) + ϕ∗ (x∗ ) ≥ x∗ , xX for all x∗ ∈ X ∗ , x ∈ X (Young–Fenchel inequality). REMARK 1.2.19 From the Young–Fenchel inequality we deduce that we always have ϕ∗∗ ≤ ϕ. In the sequel we provide necessary and sufficient conditions for equality to hold. PROPOSITION 1.2.20 If ϕ : X −→ R is proper, then ϕ admits a continuous affine minorant; that is there exists (x∗0 , ϑ0 ) ∈ X ∗ × R such that x∗0 , x − ϑ0 ≤ ϕ(x)
for all x ∈ X.
1.2 Convex Functions
19
PROOF: Let x0 ∈ X and β ∈ R such that β < ϕ(x0 ). Then (x0 , β) ∈ / epi ϕ. Because epi ϕ ⊆ X × R is closed convex, by the strong separation theorem, we can find (x∗0 , ξ0 ) ∈ X ∗ × R and ϑ0 ∈ R such that x∗0 , xX + ξ0 λ ≤ ϑ0 < x∗0 , x0 X + ξ0 β
for all (x, λ) ∈ epi ϕ,
⇒ x∗0 , xX + ξ0 ϕ(x) ≤ ϑ0 < x∗0 , x0 X + ξ0 β.
(1.25)
From (1.25) we see that ξ0 < 0. Without any loss of generality we may assume that ξ0 = −1. Then from (1.25) we have x∗0 , xX − ϕ(x) ≤ ϑ0
for all x ∈ X,
x∗0 , xX
for all x ∈ X.
− ϑ0 ≤ ϕ(x)
So ϕ is minorized by a continuous affine function.
We use this proposition to produce necessary and sufficient conditions in order for the equality ϕ∗∗ = ϕ to hold. Recall that we always have ϕ∗∗ ≤ ϕ (see Remark 1.2.19). THEOREM 1.2.21 If ϕ : X −→ R is proper, then ϕ∗∗=ϕ if and only if ϕ ∈ Γ0 (X). PROOF: ⇒: Follows from Proposition 1.2.17. ⇐: From Remark 1.2.19 we know that ϕ∗∗ ≤ ϕ. We show that the opposite inequality is also true. So let x ∈ X and µ ∈ R such that µ < ϕ(x). Then (x, µ) ∈ / epi ϕ and because epi ϕ is closed convex, we can apply the strong separation theorem and obtain (x∗ , ξ) ∈ X ∗ × R, (x∗ , ξ) = (0, 0) and ε > 0 such that x∗ , yX + ξλ ≤ x∗ , xX + ξµ − ε
for all (y, λ) ∈ epi ϕ.
(1.26)
Note that λ can increase to +∞. So from (1.26) we infer that ξ ≤ 0. Suppose ξ < 0. Then x∗ , yX + ξϕ(y) < x∗ , xX + ξµ
for all y ∈ X,
⇒ (−ξϕ)∗ (x∗ ) ≤ x∗ , xX + ξµ.
We can easily check that (−ξϕ)∗ (x∗ ) = −ξϕ∗ (x∗ − ξ). So we have x∗ −ξϕ∗ − ≤ x∗ , xX + ξµ ξ x∗ x∗ ⇒ µ≤ − − ϕ∗ − ,x ≤ ϕ∗∗ (x). ξ ξ X Because µ < ϕ(x) was arbitrary, it follows that ϕ(x) ≤ ϕ∗∗ (x). Now suppose that ξ = 0. From (1.26) we have x∗ , yX ≤ x∗ , xX − ε ⇒ x∈ / dom ϕ
and so
for all y ∈ dom ϕ,
ϕ(x) = +∞.
Therefore we need to show that ϕ∗∗ (x) = +∞. Let η ∈ R be such that x∗ , yX < η < x∗ , xX
for all y ∈ dom ϕ.
(1.27)
20
1 Smooth and Nonsmooth Calculus
From Proposition 1.2.20 we know that ϕ is bounded below by a continuous affine function. So we can find y ∗ ∈ X ∗ and ϑ0 ∈ R such that y ∗ , yX − ϑ0 ≤ ϕ(y)
for all y ∈ X.
Then for all γ > 0 we have
y ∗ , yX − ϑ0 + γ x∗ , yX − η ≤ ϕ(y) ∗
∗
⇒ y + γx , yX − ϕ(y) ≤ ϑ0 + γη
for all y ∈ X
(see (1.27)),
for all y ∈ X,
⇒ ϕ∗ (y ∗ + γx∗ ) ≤ ϑ0 + γη.
(1.28)
Therefore
y ∗ , xX − ϑ0 + γ x∗ , xX − η ≤ y ∗ + γx∗ , xX − ϕ∗ (y ∗ + γx∗ ) (see (1.28)) ≤ ϕ∗∗ (x). Recall that γ > 0 was arbitrary. So we let γ ↑ +∞ and because x∗ , x − η > 0, we conclude that ϕ∗∗ (x) = +∞. Therefore ϕ∗∗ = ϕ. REMARK 1.2.22 It follows from Theorem 1.2.21 that ϕ ∈ Γ0 (X) if and only if ϕ is the upper envelope of all continuous affine functions majorized by ϕ. Also it follows that ϕ∗∗ is the lower semicontinuous, convex regularization ϕ (i.e., the biggest lower semicontinuous, convex function majorized by ϕ). Next we introduce an operation that is basic in convex analysis. DEFINITION 1.2.23 Let ϕ, ψ : X −→ R. The infimal convolution of ϕ and ψ denoted by ϕ ⊕ ψ, is defined by (ϕ ⊕ ψ)(x) = inf ϕ(y) + ψ(x − y) : y ∈ X = inf ϕ(u1 ) + ψ(u2 ) : u1 + u2 = x . As it turns out this operation is dual to addition (see Theorem 1.2.25 below). PROPOSITION 1.2.24 If ϕ, ψ : X −→ R are convex functions and there exists x0 ∈ dom ψ such that ϕ is continuous at x0 , then inf ϕ(x) + ψ(x) : x ∈ X = max − ϕ∗ (x∗ ) − ψ ∗ (−x∗ ) : x∗ ∈ X ∗ . PROOF: Using Definition 1.2.15 we can check that for all x ∈ X and all x∗ ∈ X ∗ , we have −ϕ∗ (x∗ ) − ψ ∗ (−x∗ ) ≤ ϕ(x) + ψ(x) ⇒ m∗ = sup − ϕ∗ (x∗ ) − ψ ∗ (−x∗ ) : x∗ ∈ X ∗ ≤ inf ϕ(x) + ψ(x) : x ∈ X = m. Because x0 ∈ dom ϕ ∩ dom ψ, we have −∞ ≤ m < +∞. If m = −∞, then we are done. So suppose that m ∈ R. LetE = int epi ϕ = ∅ (see Theorem 1.2.3) and G = (x, λ) ∈ X × R : λ ≤ m − ψ(x) = ∅. Both sets are convex and if (x, λ) ∈ E, then λ > ϕ(x) ≥ m−ψ(x) , hence E ∩G = ∅. Applying the weak separation theorem, we can find (x∗0 , λ0 ) ∈ X ∗ × R, (x∗0 , λ0 ) = (0, 0) and ξ ∈ R such that
1.2 Convex Functions x∗0 , xX +λ0 λ ≤ ξ ≤ x∗0 , uX +λ0 t
21
for all (x, λ) ∈ E and all (u, t) ∈ G. (1.29)
Because λ can grow to +∞, from (1.29) we see that λ0 ≤ 0. If λ0 = 0, then x∗0 , xX ≤ ξ ≤ x∗0 , x0 X for all x ∈ dom ϕ. But we can find δ > 0 such that Bδ (x0 ) ⊆ dom ϕ. So it follows that x∗0 = 0, a contradiction to the fact that (x∗0 , λ0 ) = (0, 0). Therefore λ0 < 0 and we can assume that λ0 = −1. We have − x∗0 , uX + t ≤ −ξ
for all (u, t) ∈ G
⇒ − x∗0 , uX + m − ψ(u) ≤ −ξ
(see (1.29)),
for all u ∈ X.
(1.30)
Also we have x∗0 , xX − λ ≤ ξ ∗
¯ = epi ϕ. for all (x, λ) ∈ E
(−x∗0 )
(1.31) ∗
∗
≤ −ξ − m and from (1.31) we have ϕ (x ) ≤ ξ. From (1.30) we obtain ψ Therefore m ≤ −ϕ∗ (x∗0 ) − ψ ∗ (−x∗0 ) ≤ m∗ ≤ m. Using this proposition we can establish the duality between addition and infimal convolution. THEOREM 1.2.25 If ϕ, ψ : X −→ R are convex functions and there exists x0 ∈ dom ψ such that ϕ is continuous at x0 , then (ϕ + ψ)∗ = ϕ∗ ⊕ ψ ∗ . PROOF: For every x∗ ∈ X ∗ we have −(ϕ + ψ)∗ (x∗ ) = inf g(x) + h(x) : x ∈ X ∗ with g(x) = ϕ(x) − x , xX and h(x) = ψ(x). Evidently g, h are convex functions and g is continuous at x0 ∈ dom g = dom ψ. So we can apply Proposition 1.2.24 and obtain −(ϕ + ψ)∗ (x∗ ) = − min h∗ (u∗ ) + g ∗ (−u∗ ) : u∗ ∈ X ∗ = − min ψ ∗ (u∗ ) + ϕ∗ (x∗ − u∗ ) : u∗ ∈ X ∗ . REMARK 1.2.26 It is straightforward to check that for any proper convex functions ϕ, ψ : X −→ R, we have (ϕ ⊕ ψ)∗ = ϕ∗ + ψ ∗ . EXAMPLE 1.2.27 (a) If C ⊆ X is nonempty, and iC is the indicator function, then i∗C (x∗ ) = σ(x∗ ; C) = sup x∗ , cX : c ∈ C (the support function of the set C). Moreover, if C ⊆ X is nonempty, closed, and convex, then x ∈ C if and only if x∗ , xX ≤ σ(x∗ ; C) for all x∗ ∈ X ∗ . (b) If X is a normed space, C ⊆ X is nonempty, and ϕ(x) = d(x, C) = inf x−cX : ∗ ∗ ∗ c ∈ C , then ϕ = iC ⊕ · X and so ϕ = iC + ( · X ) = σ(·; C) + iB¯1∗ (see Remark 1.2.26). (c) If X is a normed space and h : R −→ R is an even convex function, we define ϕ(x) = h(x) for all x ∈ X. Then ϕ∗ (x∗ ) = h∗ (x∗ X ∗ ).
22
1 Smooth and Nonsmooth Calculus
Now we pass to the study of the subdifferential of a convex function. The subdifferential characterizes the local behavior of the convex function in a way analogous to that in which derivatives determine the local behavior of smooth functions. The mathematical setting remains unchanged. So X is a locally convex space, X ∗ its topological dual, and ·, ·X denotes the duality brackets for the pair (X, X ∗ ). We furnish X with the w(X, X ∗ )-topology and X ∗ with the w(X ∗ , X)-topology. DEFINITION 1.2.28 Let ϕ : X −→ R be a proper function and x0 ∈ dom ϕ. The subdifferential of ϕ at x0 is the set ∂ϕ(x0 ) ⊆ X ∗ (possibly empty) defined by ∂ϕ(x0 ) = x∗ ∈ X ∗ : x∗ , hX ≤ ϕ(x0 + h) − ϕ(x0 ) for all h ∈ X . REMARK 1.2.29 It is clear from the above definition that ∂ϕ(x0 ) is w(X ∗ , X)closed and convex. Moreover, x0 ∈ arg min ϕ (i.e., ϕ(x0 ) = inf ϕ) if and only if 0 ∈ ∂ϕ(x0 ) (generalized Fermat’s rule).
X
The following propositions are straightforward consequences of Definition 1.2.28. PROPOSITION 1.2.30 If ϕ, ψ : X −→ R are proper functions, x0 ∈ dom ϕ ∩ dom ψ and λ > 0, then (a) ∂ϕ(x0 ) + ∂ψ(x0 ) ⊆ ∂(ϕ + ψ)(x0 ). (b) ∂(λϕ)(x0 ) = λ∂ϕ(x0 ). PROPOSITION 1.2.31 If ϕ : X −→ R is a proper function, then x∗ ∈ ∂ϕ(x) if and only if ϕ(x) + ϕ∗ (x∗ ) = x∗ , xX . REMARK 1.2.32 So for the elements of the subdifferential ∂ϕ(x) (also known as subgradients of ϕ at x ∈ X), the Young–Fenchel inequality (see Proposition 1.2.18) becomes an equality. Using this proposition, we obtain the following. PROPOSITION 1.2.33 (a) If ϕ : X −→ R is a proper function and x∗ ∈ ∂ϕ(x), then x ∈ ∂ϕ∗ (x∗ ). (b) If ϕ ∈ Γ0 (X), then x∗ ∈ ∂ϕ(x) if and only if x ∈ ∂ϕ∗ (x∗ ). In general the set ∂ϕ(x) may be empty (consider, e.g., the case x ∈ / dom ϕ). The next theorem gives a situation where we have subdifferentiability of ϕ at x ∈ X (i.e., ∂ϕ(x) = ∅). THEOREM 1.2.34 If X is a Banach space and ϕ : X −→ R is a convex function that is continuous at x ∈ X, then ∂ϕ(x) = ∅ and it is a w∗ -compact and convex set in X ∗ .
PROOF: From Theorem 1.2.3 we have that int epi ϕ = ∅. Because x, ϕ(x) is a boundary point of epi ϕ, we can apply the weak separation theorem and obtain (x∗ , ξ) ∈ X ∗ × R, (x∗ , ξ) = (0, 0) such that
ξ ϕ(x) − λ ≤ x∗ , y − xX for all (y, λ) ∈ epi ϕ. (1.32)
1.2 Convex Functions
23
Because λ can increase to +∞, from(1.32) we infer that ξ ≥ 0. If ξ = 0, then x∗ , xX ≤ x∗ , yX
for all y ∈ dom ϕ.
¯δ (0), But x ∈ int dom ϕ and so for some δ > 0 we have x∗ , uX ≥ 0 for all u ∈ B which implies that x∗ = 0, a contradiction to the fact that (x∗ , ξ) = (0, 0). So ξ > 0 and we can take ξ = 1. Then from (1.32) with λ = ϕ(y), we have ϕ(x) − ϕ(y) ≤ x∗ , y − xX
for all y ∈ dom ϕ,
∗
⇒ −x ∈ ∂ϕ(x) = ∅. From Theorem 1.2.7 we know that there exists r > 0 such that ϕB¯ (x) is Lipschitz r continuous, with Lipschitz constant, say, kr > 0. Then for x∗ ∈ ∂ϕ(x), we have x∗ , hX ≤ ϕ(x + h) − ϕ(x) ≤ kr hX
¯r (0), for all h ∈ B
∗
⇒ x X ∗ ≤ kr . This proves that ∂ϕ(x∗ ) is bounded hence w∗ -compact (by Alaoglou’s theorem) and of course convex. From Example 1.2.27(a) we know that closed convex sets are completely described by their support function. In the next theorem for a certain ϕ we identify the support function of ∂ϕ(x). THEOREM 1.2.35 If X is a Banach space
and ϕ : X −→ R is a convex function that is continuous at x ∈ X, then σ h; ∂ϕ(x) = ϕ (x; h) for all h ∈ X (see Definition 1.2.9). PROOF: Let ψ(h) = ϕ (x; h), h ∈ X. Because ϕ is continuous at x ∈ X, then ψ is continuous convex and ∂ϕ(x) = ∅ (see Theorem 1.2.34). So for all x∗ ∈ ∂ϕ(x) and all h ∈ X, we have x∗ , hX ≤ ψ(h) ≤ ϕ(x + h) − ϕ(x). If ψ(h) = (1/λ) ϕ(x + h) − ϕ(x) , λ > 0, then we can easily calculate that ψλ∗ (x∗ ) =
1 ∗ ∗ ϕ (x ) + ϕ(x) − x∗ , xX , λ
λ > 0.
Because ψ = inf ψλ , then ψ ∗ = sup ψλ∗ and so λ>0
λ>0
1 ψ (x ) = sup ϕ∗ (x∗ ) + ϕ(x) − x∗ , xX = λ λ>0 ∗
∗
0 +∞
if x∗ ∈ ∂ϕ(x) otherwise.
(see Propositions 1.2.31 and 1.2.18). Therefore ψ ∗ = i∂ϕ(x) , hence ψ ∗∗ = ψ = σ∂ϕ(x) (see Theorem 1.2.21 and Example 1.2.27(a)). REMARK 1.2.36 Both Theorems 1.2.34 and 1.2.35 are still valid in the more general context of dual pairs of locally convex spaces. However, to avoid technical difficulties we have presented them in the more familiar framework of Banach spaces and their duals.
24
1 Smooth and Nonsmooth Calculus
It is natural to ask what is the exact relation between the subdifferential and Gˆ ateaux derivative when the latter exists. THEOREM 1.2.37 Let X be a Banach space and ϕ: X −→ R a proper convex function. (a) If ϕ is Gˆ ateaux differentiable at x ∈ X, then ∂ϕ(x) = {ϕ (x)}. (b) If ϕ is continuous at x ∈ X and ∂ϕ(x) is a singleton, then ϕ is Gˆ ateaux differentiable at x ∈ X and ∂ϕ(x) = {ϕ (x)}. PROOF: (a) Because ϕ is convex, we have 1 ϕ(x + λh) − ϕ(x) ≤ ϕ(x + h) − ϕ(x) ϕ (x), h X ≤ λ for all 0 < λ < 1 and all h ∈ X,
⇒ ϕ (x) ∈ ∂ϕ(x)
(see Definition 1.2.28).
Now let x∗ ∈ ∂ϕ(x). Then 1 ϕ(x + h) − ϕ(x) for all λ > 0 and all h ∈ X, λ ≤ ϕ (x), h X for all h ∈ X,
x∗ , hX ≤ ⇒ x∗ , hX
⇒ x∗ = ϕ (x); that is, ∂ϕ(x) = {ϕ (x)}. (b) Due to convexity of ϕ, ϕ(x) + λϕ (x; h) ≤ ϕ(x + h) for all λ ∈ R and all h ∈ X.
Then the line L = x + λh, ϕ(x) + λϕ (x; h) : λ ∈ R does not intersect the set int epi ϕ = ∅. So we can apply the weak separation theorem and produce a closed hyperplane H such that L ⊆ H and H ∩int epi ϕ = ∅. We know that H = Gr l where l is a continuous affine function on X and l(x) = ϕ(x). By hypothesis ∂ϕ(x) = {x∗ }. So l(h) = x∗ , hX + ξ, ξ ∈ R. Because L ⊆ H, we have ϕ (x; h) = x∗ , hX
for all h ∈ X
⇒ ϕ (x) = x∗ ; that is, ∂ϕ(x) = {ϕ (x)}. The subdifferential of convex functions has a rich calculus which in many respects parallels that of smooth functions. Next we present two basic rules of this calculus. THEOREM 1.2.38 If ϕ, ψ : X −→ R are proper convex functions and there exists x ˆ ∈ dom ϕ ∩ dom ψ where one of the two functions, say ϕ, is continuous, then ∂(ϕ + ψ)(x) = ∂ϕ(x) + ∂ψ(x) for all x ∈ X. PROOF: From Proposition 1.2.30(a) we know that we always have ∂ϕ + ∂ψ ⊆ ∂(ϕ + ψ), So it suffices to show that the opposite inclusion holds. To this end let u∗ ∈ ∂(ϕ + ψ)(x). Then x ∈ dom ϕ ∩ dom ψ and ψ(x) − ψ(y) ≤ ϕ(y) − ϕ(x) − u∗ , y − xX = h(y)
for all y ∈ X.
(1.33)
1.2 Convex Functions
25
We consider the following two sets C1 = epi h
and
C2 = {(y, µ) ∈ X × R : µ ≤ ψ(x) − ψ(y)}.
Note that both sets are convex and from Theorem 1.2.3 we have that int C1 = ∅. Moreover, int C1 ∩ C2 = ∅. To see this note that if y ∈ int C1 ∩ C2 , then h(y) < µ ≤ ψ(x) − ψ(y)
(see Theorem 1.2.3),
which contradicts (1.33). So we can apply the weak separation theorem and obtain (0, 0) such that (x∗ , ξ) ∈ X ∗ × R, (x∗ , ξ) = x∗ , uX + ξλ ≤ x∗ , yX + ξµ
for all (u, λ) ∈ C1 and all (y, µ) ∈ C2 .
(1.34)
The inequality in (1.34) is strict if (u, λ) ∈ int C1 . Note that (x, 0) ∈ C2 and λ can increase to +∞. So we must have ξ ≤ 0. If ξ = 0, then x∗ , u ≤ x∗ , x
for all u ∈ dom h.
(1.35)
But h is continuous at x and so dom h is a neighborhood of x. Therefore from (1.35) it follows that x∗ = 0; hence (x∗ , ξ) = (0, 0), a contradiction. So ξ < 0 and we may take ξ = −1. Then from (1.34), we have
x∗ , uX − h(u) ≤ x∗ , xX ≤ x∗ , yX − ψ(x) − ψ(y) , for all u ∈ domh and all y ∈ dom ψ. From the second inequality, we obtain −x∗ ∈ ∂ψ(x). From the first inequality and because h(x) = 0, we have x∗ ∈ ∂h(x), hence x∗ + u∗ ∈ ∂ϕ(x). So finally u∗ = u∗ + x∗ + (−x∗ ) ∈ ∂ϕ(x) + ∂ψ(x) ⇒ ∂(ϕ + ψ)(x) ⊆ ∂ϕ(x) + ∂ψ(x). REMARK 1.2.39 By induction it follows that Theorem 1.2.38 is true for any family {ϕk }n k=1 of proper convex functions ϕk : X −→ R = R ∪ {+∞}, such that all n but one of the ϕk s are continuous at a point x ∈ dom ϕk . k=1
THEOREM 1.2.40 If Y is another locally convex space, A ∈ L(X, Y ), and ϕ : Y −→ R is a proper convex function, then A∗ ∂ϕ(Ax) ⊆ ∂(ϕ ◦ A)(x) for all x ∈ X. Moreover, equality holds if there is a point in the range of A, where ϕ is continuous. PROOF: The inclusion follows at once from Definition 1.2.28. We show that equality holds when ϕ is continuous on the range of A. To this end let x∗ ∈ ∂(ϕ ◦ A)(x). Then x∗ , u − xX + (ϕ ◦ A)(x) ≤ (ϕ ◦ A)(u) for all u ∈ X. (1.36) Consider the affine space L ⊆ Y × R defined by
L = Au, x∗ , u − xX + (ϕ ◦ A)(x) ∈ Y × R : u ∈ X .
26
1 Smooth and Nonsmooth Calculus
Note that L ∩ int epi ϕ = ∅ and have only boundary points in common. The weak separation theorem implies that there exists a closed hyperplane H such that L⊆H
and
H ∩ int epi ϕ = ∅.
We know that H = Gr l where l : Y −→ R is the continuous affine function defined by l(y) = y ∗ , yY + ϑ, y ∗ ∈ Y ∗ , ϑ ∈ R. From the inclusion L ⊆ H, we have y ∗ , AuY + ϑ = x∗ , u − xX + (ϕ ◦ A)(x)
for all u ∈ X.
Let u = 0. Then ϑ = (ϕ ◦ A)(x) − x∗ , xX , ⇒ y ∗ , AuY = x∗ , uX ∗
for all u ∈ X,
∗ ∗
⇒ x =A y . Moreover, inasmuch as H ∩ int epi ϕ = ∅, we have y ∗ , yY + (ϕ ◦ A)(x) − A∗ y ∗ , xX ≤ ϕ(y) ∗
∗
for all y ∈ Y,
∗
⇒ y ∈ ∂ϕ(Ax); that is, x ∈ A ∂ϕ(Ax). Therefore we have proved that ∂(ϕ ◦ A)(x) ⊆ A∗ ∂ϕ(Ax) and so equality must hold. EXAMPLE 1.2.41 (a) If ϕ : R −→ R is a proper convex function and x ∈ int dom ϕ, then ∂ϕ(x) = ϕ− (x), ϕ+ (x) . Here ϕ(u) − ϕ(x) u−x ϕ(u) − ϕ(x) ϕ+ (x) = lim . u↓x u−x
ϕ− (x) = lim u↑x
and
(b) If X is a Banach spaceand ϕ(x) = 12 x2 , then ∂ϕ(x) = F(x) = x∗ ∈ X ∗ : x∗ , xX = x2X = x∗ 2X ∗ . This is the duality map, which is important in the study of evolution equations and is examined in more detail in Section 3.2. At this point simply note that if X = H a Hilbert space is identified with its dual, F = IdH . (c) If X is a Banach space and ϕ(x) = x, then ¯1∗ B if x = 0 . ∂ϕ(x) = F (x) if x = 0 x ¯1∗ = {x∗ ∈ X ∗ : x∗ X ∗ ≤ 1}. Here B (d) If X is a locally convex space, ∗ C ∗⊆ X∗ is nonempty, closed, convex, and ∗ ϕ(x)∗= N (x) = x ∈ X : x , c − x ≤ 0 for all c ∈ C = x ∈X : iC (x), then ∂ϕ(x) = C X x∗ , xX =σ(x∗ , C) . This set is a closed convex cone, known as the normal cone to C at x. In Section 1.4 we study tangent and normal cones in more detail.
1.3 Locally Lipschitz Functions
27
1.3 Locally Lipschitz Functions In this section we extend the subdifferential theory beyond the domain of convex functions. The starting point is Corollary 1.2.8. According to that result every continuous convex function is locally Lipschitz. So it is reasonable to focus our attention on locally Lipchitz functions. Throughout this section X is a Banach space with topological dual X ∗ . By ·, ·X we denote the duality brackets for the pair (X, X ∗ ). Additional hypotheses are introduced as needed.
DEFINITION 1.3.1 A function ϕ : X −→ R is said to be locally Lipschitz if for every x ∈ X we can find a neighborhood U ⊆ X of x and a constant kU > 0 (depending on U ) such that |ϕ(y) − ϕ(u)| ≤ kU y − uX
for all y, u ∈ U.
REMARK 1.3.2 If ϕ : X −→ R is Lipschitz continuous on bounded sets, then ϕ is locally Lipschitz and if dim X < +∞, then these two properties are equivalent. Although the directional derivative need not exist, nevertheless the local Lipschitz property permits the introduction of the following substitute of it.
DEFINITION 1.3.3 Let ϕ : X −→ R be a locally Lipschitz function. The generalized directional derivative of ϕ at x ∈ X in the direction h ∈ X, is defined by ϕ0 (x; h) = lim sup x →x
λ↓0
ϕ(x + λh) − ϕ(x ) ϕ(x + λh) − ϕ(x ) sup = inf . ε,δ>0 x −x≤ε λ λ 0<λ≤δ
This quantity has some useful properties that are summarized in the proposition that follows.
PROPOSITION 1.3.4 If ϕ : X −→ R is locally Lipschitz, then (a) For every x ∈ X, the function h −→ ϕ0 (x; h) is sublinear and Lipschitz continuous. (b) The function (x, h) −→ ϕ0 (x; h) is upper semicontinuous. (c) ϕ0 (x; −h) = (−ϕ)0 (x; h). PROOF: (a) It is clear from Definition 1.3.3 that ϕ0 (x; ·) is positively homogeneous. Also if h1 , h2 ∈ X, we have
28
1 Smooth and Nonsmooth Calculus ϕ0 (x; h1 + h2 )
ϕ x + λ(h1 + h2 ) − ϕ(x ) = lim sup λ x →x λ↓0
= lim sup x →x
ϕ x + λ(h1 + h2 ) − ϕ(x + λh2 ) + ϕ(x + λh2 ) − ϕ(x ) λ
λ↓0
ϕ x + λ(h1 + h2 ) − ϕ(x + λh2 ) ϕ(x + λh2 ) − ϕ(x ) + lim sup ≤ lim sup λ λ x →x x →x λ↓0
0
λ↓0
0
= ϕ (x; h1 ) + ϕ (x; h2 ). This proves the subadditivity of ϕ0 (x; ·), hence its sublinearity. If x is near x and λ > 0 is near 0, then due to the local Lipschitzness of ϕ, we have ϕ(x + λh) − ϕ(x ) for all h ∈ X, ≤ khX λ 0 for all h ∈ X, ⇒ ϕ (x; h) ≤ khX ⇒ |ϕ0 (x; h)| ≤ khX
(1.37)
for all h ∈ X (by virtue of the sublinearity of ϕ (x; ·)). From this and the sublinearity of ϕ0 (x; ·) follows easily the Lipschitz continuity of h −→ ϕ0 (x; h). 0
(b) Suppose (xn , hn ) −→ (x, h) in X × X as n → ∞. For every n ≥ 1, we can find un ∈ X and λn > 0 such that un X + λn ≤ 1/n and ϕ(xn + un + λn hn ) − ϕ(xn + un ) 1 + λn n ϕ(xn + un + λn hn ) − ϕ(xn + un + λn h) = λn ϕ(xn + un + λn h) − ϕ(xn + un ) 1 + + , λn n ⇒ lim sup ϕ0 (xn ; hn ) ≤ ϕ0 (x; h).
ϕ0 (xn ; hn ) ≤
n→∞
This proves the upper semicontinuity of (x, h) −→ ϕ0 (x; h). (c) From Definition 1.3.3, we have ϕ0 (x; −h) = lim sup x →x
ϕ(x − λh) − ϕ(x ) λ
λ↓0
= lim sup y→x
λ↓0
(−ϕ)(y + λh) − (−ϕ)(y) λ
(setting y = x − λh)
= (−ϕ)0 (x; h). The sublinearity and continuity of ϕ0 (x; ·) lead naturally to the following definition.
1.3 Locally Lipschitz Functions
29
DEFINITION 1.3.5 If ϕ : X −→ R is a locally Lipschitz function, the generalized subdifferential of ϕ at x ∈ X is defined by ∂ϕ(x) = {x∗ ∈ X ∗ : x∗ , hX ≤ ϕ0 (x; h) for all h ∈ X}. REMARK 1.3.6 By virtue of Proposition 1.2.20, for every x ∈ X the set ∂ϕ(x) is nonempty and clearly it is convex and w∗ -closed. Moreover, from (1.37) we see that ∂ϕ(x) is also bounded; hence it is w∗ -compact (Alaoglou’s theorem). Also 0 ϕ (x; ·) = σ ·; ∂ϕ(x) . PROPOSITION 1.3.7 If ϕ : X −→ R is locally Lipschitz, xn −→ x in X, x∗n −→ x∗ in X ∗ , and x∗n ∈ ∂ϕ(xn ) for all n ≥ 1, then x∗ ∈ ∂ϕ(x). w
PROOF: For every n ≥ 1 and every h ∈ X, we have x∗n , hX ≤ ϕ0 (xn ; h). Passing to the limit as n → ∞ and using Proposition 1.3.4(b), we obtain x∗ , hX ≤ ϕ0 (x; h) for all h ∈ X; hence x∗ ∈ ∂ϕ(x). PROPOSITION 1.3.8 Let ϕ : X −→ R be locally Lipschitz. (a) If ϕ is Gˆ ateaux differentiable at x ∈ X, then ϕ (x) ∈ ∂ϕ(x). (b) If ϕ ∈ C 1 (X), then ∂ϕ(x) = {ϕ (x)}. PROOF: (a) From Definition 1.3.3 we see that ϕ (x), h X ≤ ϕ0 (x; h)
⇒ ϕ (x) ∈ ∂ϕ(x)
for all h ∈ X,
(see Definition 1.3.5).
(b) Because ϕ ∈ C 1 (X), we have ϕ0 (x; h) = ϕ (x), hX for all h ∈ X; hence ∂ϕ(x) = {ϕ (x)}. REMARK 1.3.9 It can happen that ϕ is Gˆ ateaux differentiable at x ∈ X but ∂ϕ(x) contains elements other than ϕ (x). Consider the function ϕ : R −→ R defined by if x = 0 x2 sin x1 . ϕ(x) = 0 if x = 0 Then ϕ is differentiable on [0, 1], Lipschitz continuous on [0, 1], and ϕ (0) = 0. However, ϕ0 (0; h) = |h| and so ∂ϕ(0) = [−1, 1]. Also Proposition 1.3.8(b) is actually true under the weaker hypothesis that ϕ is strictly differentiable. Recall that ϕ is strictly differentiable, if for every x ∈ X, there exists ϕs (x) ∈ X ∗ such that for all h ∈ X we have ϕ(x + λh) − ϕ(x ) ϕs (x), h X = lim . λ x →x λ↓0
1
A C -function is strictly differentiable and a strictly differentiable function is locally Lipschitz. PROPOSITION 1.3.10 If ϕ is continuous, and convex (hence locally Lipschitz, see Corollary 1.2.8), then ∂ϕ(x) coincides with the subdifferential in the sense of convex analysis (see Definition 1.2.28).
30
1 Smooth and Nonsmooth Calculus
PROOF: For fixed h ∈ X, the function (t, u) −→ ϕ(u+th)−ϕ(u) is continuous from t (0, +∞) × X into R. So given ε > 0, we can find δ > 0 such that ϕ(u + th) − ϕ(u) ϕ(x + λh) − ϕ(x) ≤ +ε t λ for all (t, u) ∈ (0, +∞) × X such that |t − λ| ≤ δ and u − xX ≤ δ. Then
ϕ u + (λ + δ)h − ϕ(u) ϕ(x + λh) − ϕ(x) sup ≤ + ε. λ λ u−xX ≤δ Passing to the limit as λ, δ ↓ 0, we obtain ϕ0 (x; h) ≤ ϕ (x; h) + ε. Because ε > 0 was arbitrary let ε ↓ 0, to conclude that ϕ0 (x; h) ≤ ϕ (x; h). The opposite inequality is always true when ϕ (x; ·) exists, thus we conclude that ϕ0 (x; ·) = ϕ (x; ·). Then the proposition follows from Theorem 1.2.35. At this point let us recall the following fundamental result concerning vectorvalued locally Lipschitz functions known as Rademacher’s theorem. For a proof of it we refer to Evans–Gariepy [228]. THEOREM 1.3.11 If ϕ : Rn −→ Rm is locally Lipschitz, then ϕ is Fr´echet differentiable λn -a.e. (λn is the Lebesgue measure on Rn ). Using this theorem, when X is finite-dimensional, we can have a definition of the generalized subdifferential, which is more intuitive and geometric than the one in terms of the generalized directional derivative (see Definition 1.3.5). THEOREM 1.3.12 If ϕ : Rn −→ R is locally Lipschitz and E ⊆ Rn any Lebesgue n null set, then for every x ∈ R , ∂ϕ(x) = conv lim ∇ϕ(xn ) : xn −→ x, xn ∈ / n→∞ c E ∪Dϕ (here by Dϕ we denote the set of points of differentiability of ϕ; by Theorem c 1.3.11, λn (Dϕ ) = 0). PROOF: By (1.37), ∂ϕ(·) is bounded (i.e., maps bounded sets to bounded sets). Because ∇ϕ(xn ) ∈ ∂ϕ(xn ), n ≥ 1 (see Proposition 1.3.8(a)), we have {∇ϕ(xn )}n≥1 ∈ Rn is bounded and so we may assume that ∇ϕ(xn ) −→ u∗ in Rn . Moreover, Proposition 1.3.7 implies that u∗ ∈ ∂ϕ(x). Hence c / E ∪ Dϕ ⊆ ∂ϕ(x). S(x) = conv{lim ∇ϕ(xn ) : xn −→ x, xn ∈
Next for h = 0, let ϑh= lim ∇ϕ(x ), h x →x
Rn
(1.38)
. Given ε > 0, we can find δ = δ(ε) > 0
c x ∈E∪D / ϕ
such that
∇ϕ(x ), h
Rn
≤ ϑh + ε
c for all x − xRn ≤ δ, x ∈ / E ∪ Dϕ .
If 0 < λ < δ (2hRn ), then for almost all x ∈ Rn with x − xRn ≤ δ/2 we have
1.3 Locally Lipschitz Functions ϕ(x + λh) − ϕ(x ) =
λ
∇ϕ(x + th), h
0
⇒ ϕ0 (x; h) ≤ ϑh + ε,
⇒ ϕ0 (x; h) ≤ σ h, S(x) .
Rn
31
dt ≤ λ(ϑh + ε),
(1.39)
From (1.38) and (1.39), we conclude that S(x) = ∂ϕ(x) (see Example 1.2.27(a)). COROLLARY 1.3.13 If ϕ : Rn −→ R is locally Lipschitz, then ϕ0 (x; h) =
lim sup ∇ϕ(x ), h Rn . x →x
c x ∈E∪D / ϕ
The importance of the generalized subdifferential comes from the rich calculus that it has. We present a few basic results in this direction. We start with a definition. DEFINITION 1.3.14 A locally Lipschitz function ϕ : R −→ R is said to be regular at x if (i) The directional derivative ϕ (x; h) in the sense of Definition 1.2.9 exists for all h ∈ X. (ii) ϕ0 (x; h) = ϕ (x; h) for all h ∈ X. REMARK 1.3.15 Continuous convex functions and strictly differentiable functions (in particular C 1 -functions) are regular at x ∈ X. The first calculus rule is a direct consequence of Definition 1.3.5 (see also Definition 1.3.3). PROPOSITION 1.3.16 If ϕk : X −→ R k ∈ {1, . . . , m} are locally Lipchitz func m m λk ϕk (x) ⊆ λk ϕk (x) for all x ∈ X; equality
tions and {λk }m k=1 ⊆ R, then ∂
k=1
k=1
holds if each ϕk is regular at x ∈ X or if all but one of the ϕk s is strictly differentiable at x ∈ X and if λk ≥ 0. With the scalar multiples we can more precise. PROPOSITION 1.3.17 If ϕ : X −→ R is locally Lipchitz and λ ∈ R, then ∂(λϕ)(x) = λ∂ϕ(x) for all x ∈ X. PROOF: If λ ≥ 0, then (λϕ)0 = λϕ0 and so ∂(λϕ) = λ∂ϕ. Therefore we may assume that λ < 0 and in fact we can take λ = −1. Then x∗ ∈ ∂(−ϕ)(x) if and only if x∗ , hX ≤ (−ϕ)0 (x; h) (see Definition 1.3.5). But from Proposition 1.3.4(c), we have (−ϕ)0 (x; h) = ϕ0 (x; −h). Hence x∗ , hX ≤ ϕ0 (x; −h) for all h ∈ X and this is equivalent to saying that −x∗ ∈ ∂ϕ(x); that is, ∂(−ϕ)(x) = −∂ϕ(x). We have the following chain rule.
32
1 Smooth and Nonsmooth Calculus
PROPOSITION 1.3.18 If Y is another Banach space, f ∈ C 1 (X, Y ), and ϕ : X −→ R is locally Lipchitz, then ϕ ◦ f : X −→ R is locally Lipchitz and
∂(ϕ ◦ f )(x) ⊆ ∂ϕ f (x) ◦ f (x)
(1.40)
in the sense that for every x∗ ∈ ∂(ϕ ◦ f )(x), we have x∗ = f (x)∗ u∗
for some u∗ ∈ ∂ϕ f (x) .
(1.41)
Moreover, if ϕ or (−ϕ) is regular at f (x), then ϕ ◦ f (or −ϕ ◦ f ) is regular at x and equality holds in (1.40). Also if f maps every neighborhood of x onto a set that is dense in a neighborhood f (x) (e.g., if f (x) ∈ L(X, Y ) is surjective), then equality holds in (1.40). PROOF: Because ϕ is locally Lipschitz, we can find V a neighborhood of f (x) such that ϕV is Lipschitz continuous (see Definition 1.3.1). Then U = f −1 (V ) is a neighborhood of x ∈ X and because f (U ) ⊆ V , we see that ϕ ◦ f U is Lipschitz continuous. Therefore ϕ ◦ f : X −→ R is locally Lipschitz. By virtue of Proposition 1.3.4(b), given ε > 0 we can find 0 < δ ≤ ε such that
ϕ0 f (x); h ≤ ϕ0 f (x); h + ε
for all h − hY < δ.
Also from the definition of the generalized directional derivative (see Definition 1.3.3), we can find 0 < ξ, β such that
ϕ(y + λh ) − ϕ(y) ≤ ϕ0 f (x); h + ε ≤ ϕ0 f (x); h + 2ε λ
(1.42)
for all y − f (x)Y ≤ ξ, λ ≤ β, h − hY < δ. We set h = f (x)v, v ∈ X. Because f ∈ C 1 (X, Y ) we can find 0 < η ≤ β such that f (u + λv) − f (u) − f (x)v Y < δ λ for all u − xX ≤ η, λ ≤ η. In (1.42), we set y = f (u) and h =
and
f (u+λv)−ϕ(u) . λ
f (u) − f (x)Y ≤ ξ
We have
(ϕ ◦ f )(u + λv) − (ϕ ◦ f )(u) ≤ ϕ0 f (x); f (x)v + 2ε, λ for all u − xX ≤ η, λ ≤ η,
⇒ (ϕ ◦ f )0 (x; v) ≤ ϕ0 f (x); f (x)v = max y ∗ , f (x)v Y : y ∗ ∈ ∂ϕ f (x) . (1.43) Therefore (1.40) holds. Next suppose that ϕ is regular at f (x). The
case where −ϕ is regular at f (x) can be derived from the former because ∂(−ϕ) f (x) = −∂ϕ f (x) (see Proposition 1.3.17). Because of the regularity of ϕ at f (x), we have
1.3 Locally Lipschitz Functions
33
ϕ0 f (x); f (x)v = ϕ f (x); f (x)v
ϕ f (x) + λf (x)v − ϕ f (x) = lim λ↓0 λ
ϕ f (x) + λf (x)v − ϕ f (x + λv) ϕ f (x + λv) − ϕ f (x) = lim + λ↓0 λ λ = (ϕ ◦ f ) (x; v)
(because ϕ is locally Lipschitz and f ∈ C 1 (X, Y ))
≤ (ϕ ◦ f ) (x; v). 0
(1.44)
Comparing (1.43) and (1.44) we conclude that
ϕ0 f (x); f (x)v = (ϕ ◦ f )0 (x; v)
⇒ ∂(ϕ ◦ f )(x) = ∂ϕ f (x) ◦ f (x).
for all v ∈ X, (1.45)
If f maps any neighborhood of x onto a dense subset of a neighborhood of f (x), then we can write
ϕ y + λf (x)v − ϕ(y) ϕ0 f (x); f (x)v = lim sup λ y→f (x) λ↓0
ϕ f (u) + λf (x)v − ϕ f (u) = lim sup λ u→x λ↓0
ϕ f (x + λv) − ϕ f (u) = lim sup λ u→x λ↓0
(because f ∈ C 1 (X, Y )) = (ϕ ◦ f )0 (x; v)
for all v ∈ X.
Therefore (1.45) must hold.
REMARK 1.3.19 Using the adjoint of the linear operator f (x) ∈ L(X, Y ) we can write (1.40) as
∂(ϕ ◦ f )(x) ⊆ f (x)∗ ∂ϕ f (x) (see (1.41)). COROLLARY 1.3.20 If X is continuously and densely embedded in another Ba nach space Y , ϕ : Y −→ R is locally Lipschitz, and ϕ = ϕX , then ∂ ϕ(x) = ∂ϕ(x) for all x ∈ X, which means that every element of ∂ ϕ(x) admits a unique extension to an element of ∂ϕ(x). PROOF: Let i ∈ L(X, Y ) be the canonical embedding. Then we apply Proposition 1.3.18 with f = i to obtain the desired equality. Another result in the same direction as Proposition 1.3.18, is the following. PROPOSITION 1.3.21 If T = [0, b], f ∈ C 1 (T, X), and ϕ : X −→ R is locally Lipschitz, then g = ϕ ◦ f : T −→ R is differentiable a.e. on T and
g (t) ≤ max x∗ , f (t) X : x∗ ∈ ∂ϕ f (t) .
34
1 Smooth and Nonsmooth Calculus
PROOF: The function g : T −→ R is locally Lipchitz, hence it is differentiable almost everywhere (see Theorem 1.3.11). Let t0 ∈ T be a point of differentiability of g. We have
ϕ f (t0 + λ) − ϕ f (t0 ) g (t0 ) = lim λ→0 λ
ϕ f (t0 ) + λf (t0 ) + o(λ) − ϕ f (t0 ) = lim λ→0 λ
o(λ) −→ 0 as λ → 0 here λ ϕ f (t0 ) + λf (t0 ) − ϕ f (t0 ) = lim λ→0 λ
ϕ f (t0 ) + λf (t0 ) + o(λ) − ϕ f (t0 ) + λf (t0 ) +
λ ϕ f (t0 ) + λf (t0 ) − ϕ f (t0 ) = lim λ→0 λ
≤ ϕ0 f (t0 ); f (t0 ) = max x∗ , f (t0 ) X : x∗ ∈ ∂ϕ f (t0 ) . The next proposition produces an extension to the present nonsmooth setting of the classical Fermat’s rule for local extrema. PROPOSITION 1.3.22 If ϕ : X −→ R is locally Lipschitz which attains a local extremum (local minimum or local maximum) at x ∈ X, then 0 ∈ ∂ϕ(x). PROOF: Because ∂(−ϕ) = −∂ϕ it suffices to prove the proposition when x is a local minimizer. Then directly from Definition 1.3.3 we see that 0 ≤ ϕ0 (x; h) for all h ∈ X, hence 0 ∈ ∂ϕ(x) (see Definition 1.3.5). Using this proposition, we can prove a mean value theorem for the generalized subdifferential. THEOREM 1.3.23 If ϕ : X
−→ R is locally Lipschitz and x, u ∈ X, then we can find 0 < λ0 < 1 and v ∗ ∈ ∂ϕ (1 − λ0 )x + λ0 u such that ϕ(u) − ϕ(x) = v ∗ , u − xX . PROOF: Let ξ : R −→ R be defined
ξ(λ) = ϕ((1 − λ)x + λu + λ ϕ(x) − ϕ(u) ,
λ ∈ R.
Evidently ξ is locally Lipschitz on R, hence Lipschitz continuous on [0, 1]. Note that ξ(0) = ξ(1) = ϕ(x). So we can find λ0 ∈ (0, 1) such that ξ attains a local maximum or minimum at λ0 . By virtue of Proposition 1.3.22 we have 0 ∈ ∂ξ(λ0 ). Moreover, an easy calculation gives
∂ξ(λ0 ) ⊆ ∂ϕ x + λ0 (u − x) , u − x X + [ϕ(x) − ϕ(u)]. Therefore finally we have
1.4 Variational Geometry
35
ϕ(u) − ϕ(x) ∈ ∂ϕ x + λ0 (u − x) , u − x X . We conclude this section with a Lagrange multipliers rule. For a proof of it we refer to Clarke [149]. PROPOSITION 1.3.24 If ϕ, ψ : X −→ R are locally Lipschitz functions and x ∈ X solves the problem inf[ϕ(x) : ψ(x) ≤ 0], then there exist λ, µ ≥ 0 such that 0 ∈ λ∂ϕ(x) + µ∂ψ(x)
and
µψ(x) = 0.
Moreover, if ψ is also convex and there exists x0 ∈ X such that ψ(x0 ) < 0, then we have λ > 0 (and so we can take λ = 1, normal multipliers).
1.4 Variational Geometry Differential geometry is built upon smooth manifolds where the sets of tangents are convenient vector spaces. But in many applications we encounter nonsmooth sets. The first step away from the smooth setting of differential geometry was to consider convex sets. Then the tangent and normal spaces of differential geometry are replaced by the tangent and normal cones which actually share many of the properties of their smooth counterparts. The second step is to get rid of the convexity requirement on the set using the generalized subdifferential of locally Lipschitz functions. We show that some interesting results can be obtained this way. Throughout this section, X is a Banach space and X ∗ its topological dual. By ·, ·X we denote the duality brackets for the pair (X, X ∗ ). ¯ The DEFINITION 1.4.1 Let C ⊆ X be a nonempty convex set and x ∈ C. tangent cone to C at x is the set TC (x) =
! 1 (C − x). λ
λ>0
REMARK 1.4.2 Evidently TC (x) = TC¯ (x) and so without any loss of generality we can always assume that C is closed. Also from Definition 1.4.1 it follows that h ∈ TC (x) if and only if there exist sequences λn −→ 0+ in R and hn −→ h in X ¯ for all n ≥ 1. Note that C ⊆ x + TC (x). such that x + λn hn ∈ C PROPOSITION 1.4.3 If C ⊆ X is a nonempty closed convex set and x ∈ C, then TC (x) is a closed convex cone. 1 (C − x). First we show that for all h ∈ SC (x), we can PROOF: Let SC (x)= λ λ>0
find λ0 > 0 such that for all 0 ≤ λ ≤ λ0 we have x + λh ∈ C. Indeed note that from the definition of SC (x) we can find λ0 > 0 such that x + λ0 h ∈ C. Then for
36
1 Smooth and Nonsmooth Calculus
0 ≤ λ ≤ λ0 we have x + λh = 1 − (λ/λ0 ) x + (λ/λ0 )(x + λh) and the right-hand side is a convex combination of elements in C. Due to the convexity of C, we have that x+λh ∈ C. Using this fact we can show that SC (x) is a convex cone. To this end let h1 , h2 ∈ SC (x). Then we can find λ1 , λ2 > 0 such that x + λk hk ∈ C, k = 1, 2. Set λ0 = min{λ1 , λ2 }. From the first part of the proof we have x + λ0hk ∈ C, k = 1, 2. Exploiting the convexity of C, we obtain x + λ0 th1 + (1 − t)h2 ∈ C, t ∈ [0, 1]. This proves that SC (x) is a convex cone. It follows that SC (x)=TC (x) is a closed convex cone. REMARK 1.4.4 We have T{x} (x) = {0} and if x ∈ int C, then TC (x) = X. In differential geometry, the normal space to a smooth manifold embedded in RN at a point x, is the orthogonal complement in RN of the tangent space. In a similar way, replacing the orthogonal subspace by the negative polar cone, we can define the normal cone to C at x. DEFINITION 1.4.5 Let C ⊆ X be a nonempty, closed convex set. The normal cone to C at x ∈ C is defined by NC (x) = x∗ ∈ X ∗ : x∗ , xX = σ(x∗ ; C) ∗ = x ∈ X ∗ : x∗ , c − x ≤ 0 for all c ∈ C . REMARK 1.4.6 Evidently NC (x) = TC (x)− (= the negative polar cone of TC (x)) and so it is closed and convex. Then N{x} (x) = X ∗ and if x ∈ int C, we have NC (x) = {0} (see Remark 1.4.4). Moreover, if iC is the indicator function of the set C; that is, 0 if x ∈ C , iC (x) = +∞ if x ∈ /C then iC ∈ Γ0 (X) and ∂iC (x) = NC (x) (the subdifferential is taken in the sense of convex analysis; see Definition 1.2.28). The following calculus rules for the tangent and normal cones follow easily from Definitions 1.4.1 and 1.4.5. PROPOSITION 1.4.7 (a) If C1 ⊆ C2 ⊆ X are nonempty closed convex sets and x ∈ C1 , then TC1 (x) ⊆ TC2 (x) and NC2 (x) ⊆ NC1 (x). (b) If {Xk }n k=1 are Banach spaces Ck ⊆ Xk , k ∈ {1, . . . , n} are nonempty, closed, n n " " and convex sets, X = Xk , C = Ck ⊆ X and x = (xk )n k=1 ∈ C, then TC (x) =
n " k=1
k=1
TCk (xk ) and NC (x) =
n " k=1
k=1
NCk (xk ).
(c) If X, Y are Banach spaces, C ⊆ X is a nonempty, closed, and convex set, and A ∈ L(X, Y ), then TA(C) (Ax) = ATC (x) and NA(C) (Ax) = (A∗ )−1 NC (x). (d) If C1 , C2 ⊆ X are two nonempty, closed convex sets and x1 ∈ C1 , x2 ∈ C2 , then TC1 +C2 (x1 + x2 ) = TC1 (x1 ) + TC2 (x2 ) and NC1 +C2 (x1 + x2 ) = NC1 (x1 ) ∩ NC2 (x2 ).
1.4 Variational Geometry
37
For the next calculus rule, we need some auxiliary material which is actually of independent interest. We start with a minimax theorem, known as Nikaido’s theorem, which we state here without a proof. We return to this subject in Section 2.2. THEOREM 1.4.8 If V, Z are locally convex spaces, C ⊆ Z is nonempty, convex, and w(Z, Z ∗ )-compact, and η : V × Z −→ R is a function such that (i) For all z ∈ Z, v −→ η(v, z) is convex and lower semicontinuous; (ii) For all v ∈ V, z −→ η(v, z) is concave and upper semicontinuous; then inf max η(v, z) = max inf η(v, z). v∈V z∈C
z∈C v∈V
Using this theorem, we can prove the following optimization result. THEOREM 1.4.9 If X, Y spaces, A ∈ L(X, Y ) ϕ ∈
are reflexive Banach Γ0 (X), ψ ∈ Γ0 (Y ), 0 ∈ int A(dom ϕ) − dom ψ , and x0 ∈ X satisfies
ϕ(x0 ) + ψ A(x0 ) = min ϕ(x) + ψ A(x) : x ∈ X ,
then 0 ∈ A∗ ∂ψ A(x0 ) + ∂ϕ(x0 ). ¯1X = {x ∈ X : xX ≤ 1} and ψ ∗ : Y ∗ −→ R be the conjugate of ψ PROOF: Let B (see Definition 1.2.15). Let m = sup ∗inf ∗ sup ψ ∗ (y ∗ ) − y ∗ , A(x)Y − ϕ(x) . n≥1 y ∈Y
¯X x∈nB 1
Let η(y ∗ , x) = ψ ∗ (y ∗ ) − y ∗ , A(x)Y − ϕ(x). Evidently η satisfies hypotheses (i) and (ii) of Theorem 1.4.8 with V = Y ∗ and Z =Xw = the Banach space X furnished ¯1X is w-compact in X (due to the reflexivity of with the weak topology. Because B X), by virtue of Theorem 1.4.8, we have m = sup sup ∗inf ∗ ψ ∗ (y ∗ ) − y ∗ , A(x)Y − ϕ(x) ¯ X y ∈Y n≥1 x∈nB 1 ∗ ∗
= sup ∗inf ∗ ψ (y ) − y ∗ , A(x)Y − ϕ(x) . x∈X y ∈Y
From Propositions 1.2.18 and 1.2.31, we have that
inf ∗ ψ ∗ (y ∗ ) − y ∗ , A(x)Y = −ψ A(x) . ∗ y ∈Y
(1.46)
(1.47)
Using this (1.47) in (1.46), we obtain
m = sup −ψ A(x) −ϕ(x) =− inf ϕ(x)+ψ A(x) = −ϕ(x0 )−ψ A(x0 ) . (1.48) x∈X
x∈X
Let {yn∗ }n≥1 ⊆ Y ∗ be such that lim sup ψ ∗ (yn∗ ) − yn∗ , A(x)Y − ϕ(x) ≤ m n→∞
for all x ∈ X.
(1.49)
38
1 Smooth and Nonsmooth Calculus
By virtue of the hypothesis that 0 ∈ int A(dom ϕ) − dom ψ , we can find r > 0 such that ¯1Y ⊆ dom ψ − A(dom ϕ). rB ¯1Y can be written as u = yu − A(xu ) with yu ∈ dom ψ and Every u ∈ rB xu ∈ dom ϕ. Then yn∗ , uY = yn∗ , yu Y − A∗ (yn∗ , xu X ≤ ψ ∗ (yn∗ ) + ψ(yu ) − A∗ (yn∗ , xu X , ⇒
lim sup yn∗ , yu Y n→∞
(see Proposition 1.2.18), ¯1Y (see(1.49)). ≤ m + ϕ(xu ) + ψ(yu ) < +∞ for all u ∈ rB
Therefore {yn∗ }n≥1 ⊆ Y ∗ is weakly bounded, thus bounded. Because Y is reflexive, it is relatively w-compact and so by the Eberlein–Smulian theorem and by w passing to a subsequence if necessary, we may assume that yn∗ −→ y ∗ in Y ∗ as ∗ ∗ ∗ ∗ n → ∞. Because y −→ ψ (y ) − y , A(x)Y is weakly lower semicontinuous, from (1.49) we have
ψ ∗ (y ∗ ) − y ∗ , A(x)Y − ϕ(x) ≤ m = −ϕ(x0 ) − ψ A(x0 ) ,
(1.50)
for all x ∈ X (see (1.48)). Taking x = x0 , we obtain
ψ ∗ (y ∗ ) + ψ A(x0 ) ≤ y ∗ , A(x0 )Y ,
⇒ y ∗ ∈ ∂ψ A(x0 ) (see Propositions 1.2.18 and 1.2.31).
(1.51)
Returning to (1.50) and using (1.51) and Proposition 1.2.31, we obtain ϕ(x0 ) − ϕ(x) ≤ −A∗ (y ∗ ), x0 − xX ∗
for all x ∈ X,
∗
⇒ −A (y ) ∈ ∂ϕ(x0 ).
So finally 0 = A∗ (y ∗ ) − A∗ (y ∗ ) ∈ A∗ ∂ψ A(x0 ) (see (1.51)).
THEOREM 1.4.10 If X, Y are reflexive Banach spaces, A ∈ L(X, Y ) is invertible,
C ⊆ X, D ⊆ Y are nonempty, closed, and convex sets such that 0 ∈ int A(C) − D and E = {x ∈ C : A(x) ∈ D}, then for all x ∈ E, we have
TE (x) = TC (x) ∩ A−1 TD A(x) and NE (x) = NC (x) + A∗ ND A(x) .
PROOF: Let x∗ ∈ NC (x) and y ∗ ∈ ND A(x) . Set u∗ = x∗ + A∗ y ∗ . If u ∈ E, then u∗ , uX = x∗ , uX + y ∗ , A(u)Y ≤ x∗ , xX + y ∗ , A(x)Y , (see Definition 1.4.5), ⇒ u∗ , uX ≤ u∗ , xX ; that is, u∗ ∈ NE (x). Conversely, if u∗∈NE (x), then x∗ , uX = sup[u∗ , uX : u ∈ C and A(u) ∈ D]. We apply Theorem 1.4.9 with ϕ = iC − u∗ ∈ Γ0 (X) and ψ = iD ∈ Γ0 (Y ). Note that domϕ = C and dom ψ = D. Then because ∂ϕ(x) = NC (x) and ∂ψ A(x) = ND A(x) − u∗ , we have
0 ∈ A∗ ND A(x) + NC (x).
1.4 Variational Geometry
39
Finally from Definition 1.4.5 we know that the tangent cone is a negative polar cone of the normal cone. So
− TE (x) = NC (x) + A∗ ND A(x)
− = TC (x) ∩ A∗ ND A(x)
= TC (x) ∩ A−1 TD A(x) . This theorem permits the description of the tangent and normal cones for intersections. PROPOSITION 1.4.11 If X is a reflexive Banach space and C, D ⊆ X are nonempty, closed, convex sets such that 0 ∈ int(C − D), then for all x ∈ C ∩ D we have TC∩D (x) = TC (x) ∩ TD (x)
and
NC∩D (x) = NC (x) + ND (x).
PROOF: Apply Theorem 1.4.10 with Y = X and A = IdX .
REMARK 1.4.12 The above result fails if we do not have the constraint qualification condition that 0 ∈ int(C − D). Take, for example, two balls C, D ⊆ R2 that are tangent at x ∈ R2 . Then TC∩D (x) = T{x} (x) = {0} but TC (x) ∩ TD (x) = R. Recall that, if X = H = a Hilbert space and C ⊆ H is nonempty closed and convex, then every x ∈ H has a unique best approximation in C; that is, there is a unique c0 ∈ C such that x − c0 H = min{x − cH : x ∈ H}. This map, which to each x ∈ H assigns its unique best approximation pC (x) ∈ C, is called the metric projection map for C. Then directly from the definitions we have the following. PROPOSITION 1.4.13 If X = H =a Hilbert space, C ⊆ H is nonempty, closed, and convex and x ∈ C, then p−1 C (x) = x + NC (x) and h ∈ TC (x) if and only if h, u − xH ≤ 0 for all u ∈ p−1 C (x). PROPOSITION 1.4.14 If C ⊆ X1 is a nonempty, closed, and convex set such that int C = ∅, then int TC (x) = (int C − x). λ λ>0
1 (int C − x) is open as the union of open sets and so PROOF: Note that λ λ>0 1 1 (int C − x) ⊆ int TC (x). If SC (x)= (C − x), then int TC (x) = int SC (x). λ λ
λ>0
λ>0
So to prove the proposition it suffices to show that if h ∈ int SC (x), then for some λ > 0 h ∈ λ1 (int C − x). Let δ > 0 be such that h + δB1 ⊆ SC (x) (B1 = {x ∈ X : xX < 1}. If x + h ∈ C, then we are done. Otherwise, let u0 ∈ int C and set h0 = u0 − x.
40
1 Smooth and Nonsmooth Calculus
Then h − δ(h0 /h0 X ) ∈ SC (x) and so we can find λ > 0 such that x + λ h − δ(h0 /h0 X ) ∈ C. Let µ = λδ (λδ + h0 X ). We have x + (1 − µ)λh = µu0 + (1 − µ) x + λ h − δ
h0 . h0 X
Note that u0 ∈ int C and x + λ h − δ(h0 /h0 X ) ∈ C. Because µ ∈ (0, 1), it follows that x + (1 − µ)λh ∈ int C; that is, h ∈
1 (int C − x). (1 − µ)λ
Let us give some simple examples of tangent cones. ¯1 = {x ∈ X; xX ≤ 1} and x ∈ ∂ B ¯1 . Then if EXAMPLE 1.4.15 (a) Let C = B ∗ X∗ F : X −→ 2 isthe duality map for the space; that is, F(u)= x ∈ X ∗ : x∗ , u= x∗ 2X ∗ = u2X for all u ∈ X (see Example 1.2.41(b)), then ! − TC (x)= F (x) ={u∈X :F (x), uX ≤ 0} and NC (x)= λF(x). λ≥0
(b) If C ⊆X is a nonempty, closed, and convex cone and x∈C, then NC (x)=C − ∩ {x}⊥ , where C − = x∗ ∈X ∗ :x∗ , cX ≤ 0 for all c ∈ C and {x}⊥ = x∗ ∈X ∗ :x∗ , xX = 0 . Also we have TC (x)=C + Rx. If C ⊆X is a closed subspace and x ∈ C, then TC (x)=C and NC (x)=C ⊥ = x∗ ∈ X ∗ : x∗ , cX = 0 for all c ∈ C . (c) If Y is another Banach space, A∈L(X, Y ), and C =A−1 ({y}), then if A(x) = y, TA−1 ({y}) (x) = ker A. n n xk = 1 (the standard (d) If C ⊆ Rn is defined by C = x = (xk )n k=1 ∈ R+ :
simplex in Rn ) and I(x)={k = 1, . . . , n : xk = 0}, then h = (hk )n (x) k=1 ∈ TRn + and and
h= ∈ TC (x) n hk = 0. (hk )n k=1
k=1
if and only if hk ≥ 0 if and only if hk ≥ 0
for all k ∈ I(x) for all k ∈ I(x)
k=1
REMARK 1.4.16 A set C ⊆ X is said to be star-shaped around x ∈ C, if for all u ∈ C and all λ ∈ [0, 1], we have x + λ(u − x) ∈ C. For star-shaped around x sets 1 C we still have TC (x) = SC (x) = (C − x) and C ⊆ x + TC (x). λ λ>0
1.4 Variational Geometry
41
Now let us see what can be said about nonconvex sets C ⊆ X. Let dC (·) = inf[ · −c; c ∈ C] (the distance function from C ⊆ X). For every C ⊆ X nonempty dC (·) is Lipschitz continuous with Lipschitz constant equal to 1. Note also that dC (·) = ( · ⊕ iC )(·). Therefore, if C ⊆ X is convex, then dC (·) is convex too. ¯ Then the Clarke DEFINITION 1.4.17 Let C ⊆ X be nonempty and x ∈ C. tangent cone to C at x is defined by TC (x)= h∈X : d0C (x; h) ≤ 0 . The Clarke normal cone to C at x is defined by − NC (x)= TC (x) = x∗ ∈ X ∗ : x∗ , hX ≤ 0 for all h ∈ TC (x) . REMARK 1.4.18 Note that both cones are closed and convex in X and X ∗ , respectively. Moreover, because TC (x) = TC¯ (x), then we can always take without − (bipolar any loss of generality C ⊆ X to be closed. Note that TC (x) = NC (x) theorem). Also if int C = ∅ and x∈int C, then TC (x)=X and NC (x)={0}. Finally in the definition of TC (x) we actually have d0C (x; h)=0. ¯ then NC (x) = PROPOSITION 1.4.19 If C ⊆ X is nonempty and x ∈ C, w∗ λ∂dC (x) . λ≥0
PROOF: Note that h ∈ TC (x) if and only x∗ , hX ≤ 0 for all x∗ ∈ ∂dC (x). So the negative polar cone of TC (x) is the weak∗ -closed convex cone generated by the set w∗ λ∂dC (x) . ∂dC (x). Hence NC (x)= λ≥0
We can have an intrinsic characterization of TC (x) independent of the norm used on X (hence of the distance function too). ¯ then h ∈ TC (x) if and PROPOSITION 1.4.20 If C ⊆X is nonempty and x ∈ C, only if for every sequence {xn }n≥1 ⊆ C such that xn −→ x in X and every sequence λn ↓ 0 in R, we can find a sequence {hn }n≥1 ⊆ X such that hn −→ h in X and xn + λn hn ∈ C for all n ≥ 1. PROOF: ⇒: Let h∈TC (x) and consider sequences {xn }n≥1 ⊆ C and {λn }n≥1 ⊆ R+ such that xn −→ x in X and λn ↓ 0 as n → ∞. Then by virtue of Definition 1.4.17 (see also Remark 1.4.18), we have lim
n→∞
dC (xn + λn h) − dC (xn ) dC (xn + λn h) = lim = 0. n→∞ λn λn
(1.52)
Let cn ∈ C such that xn + λn h − cn X ≤ dC (xn + λn h) +
λn n
(1.53)
and set hn =(1/λn )(cn − xn ). Then from (1.52) and (1.53) it follows that hn −→ h in X as n → ∞. Moreover, xn + λn hn ∈ C for all n ≥ 1.
42
1 Smooth and Nonsmooth Calculus
⇐: Choose {un }n≥1 ⊆ X with un −→ x in X and {tn }n≥1 ⊆ R+ with tn ↓ 0 such that dC (un + tn h) − dC (un ) lim = d0C (x; h). n→∞ tn Let cn ∈ C such that cn − un X ≤ dC (un ) + (tn /n), n ≥ 1. Then cn −→ x in X. By hypothesis we can find {hn }n≥1 ⊆ X such that hn −→ h in X and cn + tn hn ∈ C, n ≥ 1. Because dC (·) is Lipschitz continuous, dC (un + tn h) ≤ dC (cn + tn h) + un − cn X + tn h − hn X
1 ≤ dC (un ) + tn + h − hn X n dC (un + tn h) − dC (un ) 1 ⇒ ≤ + h − hn X tn n 0 ⇒ dC (x; h) ≤ 0. Using this proposition, we can compare the two cones TC (x), TC (x) when the set is convex. PROPOSITION 1.4.21 If C ⊆ X is nonempty, closed, and convex and x ∈ C, then TC (x) = TC (x) and NC (x) = NC (x). PROOF: It is clear from Remark 1.4.2 and Proposition 1.4.20 that TC (x) ⊆ TC (x). So suppose that h ∈ TC (x). Then dC (x; h) = d0C (x; h) = 0 (see Remark 1.4.18). Hence h ∈ TC (x) and we conclude that TC (x) = TC (x). Taking negative polar cones, we have NC (x) = NC (x). COROLLARY 1.4.22 If C ⊆ X is nonempty, closed, and convex and x ∈ C, then h ∈ TC (x) if and only if dC (x; h) = d0C (x; h) = 0. The next variational principle underlines the significance of the distance function in variational problems. Roughly speaking, the result says that in many cases we can replace a constrained minimization problem by an unconstrained one with a suitably perturbed objective functional. PROPOSITION 1.4.23 If ϕ : X −→ R is a function that is Lipschitz continuous on B ⊆ X with Lipschitz constant k > 0, C ⊆ B is nonempty, and ϕ(x) = inf[ϕ(u) : u ∈ C], then for all k ≥ k the function u −→ ψk (u) = ϕ(u) + k dC (u) attains its minimum over B at x. Moreover, if k > k and C is closed, then any other point minimizing ψk over B must also lie in C. PROOF: Let us prove the first assertion of the proposition. We argue indirectly. Suppose that the result is not true. We can find v ∈ B and ε > 0 such that ϕ(v) + k dC (v) < ϕ(x) − k ε. Choose c ∈ C such that v − cX ≤ dC (v) + ε. Then we have ϕ(c) ≤ ϕ(v) + k c − vX ≤ ϕ(v) + k dC (v) + k ε < ϕ(x), a contradiction to the fact that inf ϕ = ϕ(x). C
Next suppose k > k and assume that C ⊆ B is closed. Let v ∈ B be an other minimizer of ψk on B. Using the first part of the proof (for (k + k )/2 > k), we have
1.4 Variational Geometry
43
k + k dC (v) 2 (because k > k) and so v ∈ C (because C is closed).
ϕ(v) + k dC (v) = ϕ(x) ≤ ϕ(v) + ⇒ dC (v) = 0
COROLLARY 1.4.24 If ϕ : X −→ R is Lipschitz continuous near x ∈ X, C ⊆ X is nonempty, and ϕ(x) = inf ϕ, then 0 ∈ ∂ϕ(x) + NC (x). C
PROOF: Let B be a neighborhood of x ∈ X such that ϕB is Lipschitz continuous with constant k > 0. We may assume that C ⊆ B (because the sets C and C ∩ B have the same normal cone at x). Then by Proposition 1.4.23 we know that x ∈ C minimizes the function u −→ ϕ(u) + kdC (u) locally. Hence 0 ∈ ∂(ϕ + kdC )(x)
(see Proposition 1.3.22),
⇒ 0 ∈ ∂ϕ(x) + k∂dC (x) ⊆ ∂ϕ(x) + NC (x)
(see Propositions 1.3.16 and 1.4.19).
We conclude this section with the introduction of two more geometric notions. They are useful in the analysis of noncoercive variational problems. Let C ⊆ X be a nonempty, closed, convex set. For x ∈ C, let # C −x C∞ (x) = h ∈ X : x + λh ∈ C for all λ > 0 = . λ λ>0
Clearly this set is a closed convex cone, which can be trivial (i.e., C∞ (x) = {0}). Think of a bounded set in RN . PROPOSITION 1.4.25 The closed convex cone C∞ (x) does not depend on the base point x ∈ C. PROOF: Let x, u ∈ C. We need to show that C∞ (x) ⊆ C∞ (u). To this end let
h ∈ C∞ (x) and λ > 0. For 0 < ε < 1 let vε = x + λh + (1 − ε)(u − x) = ε x + (λ/ε)h + (1 − ε)u. Because h ∈ C∞ (x) and C is convex, we have vε ∈ C. Note that u + λh = lim vε ∈ C. ε↓0
This proposition suggests that the notation C∞ is more appropriate. DEFINITION 1.4.26 The recession cone (or asymptotic cone) of the closed con = h ∈ X : x + λh ∈ C for all λ > 0 = vex set C ⊆ X, is the closed convex cone C ∞
(C − x)/λ , for any x ∈ C. λ>0
REMARK 1.4.27 This cone describes the set of directions along which one can go straight to infinity without leaving C. So, if C is bounded, then C∞ = {0}. Also we can view C∞ as the maximal (with respect to inclusion) set K ⊆ X such that K + C ⊆ C. If C is a closed convex cone, then K = C. PROPOSITION 1.4.28 A closed convex set C ⊆ RN is compact if and only if C∞ = {0}.
44
1 Smooth and Nonsmooth Calculus
PROOF: ⇒: Because C is compact, it is bounded and so it cannot have direction receding to infinity. ⇐: Suppose that we can find {xn }n≥1 ⊆ C \ {0} such that xn RN −→ +∞. Set hn = xn xn RN , n ≥ 1. We may assume that hn −→ h in RN and hRN = 1, hence h = 0. Given x ∈ C and λ > 0, we can find n ≥ 1 large such that xn ≥ λ. Then
λ λ x + λh = lim 1 − xn ∈ C x+ n→∞ xn RN xn RN ⇒ h ∈ C∞ , a contradiction because h = 0. Given ϕ ∈ Γ0 (X), we know that epi ϕ is a closed convex set in X × R. We can consider the set (epi ϕ)∞ . This is the epigragh of a function ϕ∞ and so we are led to the following definition. DEFINITION 1.4.29 If ϕ ∈ Γ0 (X), then the recession function (or asymptotic function) corresponding to ϕ is the function ϕ∞ ∈ Γ0 (X) such that epi ϕ∞ = (epi ϕ)∞ . Then we have ϕ∞ (h)=sup λ>0
ϕ(x + λh) − ϕ(x) ϕ(x + λh) − ϕ(x) = lim , λ−→+∞ λ λ
where x is arbitrary in dom ϕ. Using a topological approach, we can extend the notions of recession cone and recession function to nonconvex sets and functionals. In what follows by τ we denote either the strong or the weak topology on X. DEFINITION 1.4.30 (a) If C ⊆ X is nonempty, then the τ -recession cone of C is the τ -closed cone (nonconvex in general) defined by τ -C∞ = h ∈ X :there exist {λn }n≥1 ⊆ R+ , {hn }n≥1 ⊆ X with τ λn −→ +∞, hn −→ h and λn hn ∈ C for all n ≥ 1 . (b) If ϕ : X −→ R is a proper function, then the τ -recession function of ϕ, is the function ϕ(λn xn ) τ τ -ϕ∞ (h) = inf lim inf : λn −→ +∞, hn −→ h n→∞ λn
PROPOSITION 1.4.31 If C ⊆ X is nonempty, then (a) If C is bounded, we have τ -C∞ = {0}. (b) τ -C∞ =
µ>0 λ>µ
1 (C λ
− x)
τ
where x is any point of X.
(c) τ -C∞ = τ -(C \ B)∞ = τ -(C ∪ B)∞ for any nonempty bounded set B ⊆ X.
1.5 Γ-Convergence
45
PROPOSITION 1.4.32 If ϕ, ψ : X −→ R are proper functions, then (a) τ -ϕ∞ is τ -lower semicontinuous and positively homogeneous of degree one. (b) (τ -ϕ∞ ) + (τ -ψ∞ ) ≤ τ -(ϕ + ψ)∞ . (c) If ϕ is bounded below, then τ -ϕ∞ ≥ 0. (d) If ϕ is weakly coercive (i.e., ϕ(x) −→ +∞ as x −→ ∞), then ϕ∞ is weakly coercive too and τ -ϕ∞ (h) > 0 for all h ∈ X \ {0}.
1.5 Γ-Convergence In optimization and in the calculus of variations, we are given an objective functional ϕ : X −→ R and a constraint set C ⊆ X and we want to find the minimum value m(ϕ, C) = inf ϕ(x) : x ∈ C (1.54) and to determine the set of minimizers (solutions of (1.54)) M (ϕ, C) = x ∈ X : ϕ(x) = m(ϕ, C) . The purpose of this section is to develop the tools that allow us to determine the dependence of the value m(ϕ, C) and of the solution set M (ϕ, C) on the data of the problem (ϕ, C). The mathematical setting in this section is the following. We are given (X, τ ) a Hausdorff topological space with topology τ and ϕn : X −→ R, n ≥ 1, a sequence of proper functions. Additional hypotheses are introduced as needed. In what follows, given x ∈ X, by N (x) we denote the filter of neighborhoods of x. DEFINITION 1.5.1 With the sequence {ϕn }n≥1 , we associate two limit functions The Γτ -lower limit of the sequence {ϕn }n≥1 defined by
Γτ - lim inf ϕn (x) = sup lim inf inf ϕn (u) n→∞
U ∈N (x)
n→∞ u∈U
and the Γτ -upper limit of the sequence {ϕn }n≥1 defined by
Γτ - lim sup ϕn (x) = sup lim sup inf ϕn (u). U ∈N (x)
n→∞
n→∞
u∈U
If Γτ - lim inf ϕn = Γτ - lim sup ϕn = ϕ, then we say that the sequence {ϕn }n≥1 n→∞
n→∞
Γτ -converges to ϕ and write Γτ - lim ϕn = ϕ. n→∞
REMARK 1.5.2 Evidently we always have that Γτ - lim inf ϕn ≤ Γτ - lim sup ϕn n→∞
n→∞
and both limit functions are τ -lower semicontinuous. In the above definition we can replace N (x) by a local base B(x). Also when the topology τ used is clearly understood and no confusion is possible, then we drop the subscript τ and simply
46
1 Smooth and Nonsmooth Calculus
write Γ- lim inf ϕn , Γ- lim sup ϕn and Γ- lim ϕn . If ϕn (x) = cn ∈ R for all x ∈ X, n→∞
n→∞
n→∞
then Γτ - lim inf ϕn = lim inf cn and Γτ - lim sup ϕn = lim sup cn . Also if ϕn = ϕ for n→∞
n→∞
n→∞
n→∞
n ≥ 1, then Γτ - lim inf ϕn = Γτ - lim sup ϕn = ϕτ , where ϕτ is τ -lower semicontinuous n→∞
n→∞
regularization of ϕ; that is, ϕτ = sup
τ
inf ϕ(u) or equivalently epi ϕτ =epi ϕ .
U ∈N (x) u∈U
In general Γτ -convergence and pointwise convergence are distinct modes of convergence. 2 2
EXAMPLE 1.5.3 (a) Let X = R and consider the sequence ϕn (x) = nxe−n n ≥ 1. Then if x = 0 − √12e Γ- lim ϕn (x) = n→∞ 0 if x = 0
x
,
and lim ϕn (x) = 0 for all x ∈ R. So both the Γ and the pointwise limits exist but differ. (b) Let X =R and consider the sequence ϕn (x)=sin(nx), n ≥ 1. Then Γ- lim ϕn = n→∞
ϕ with ϕ(x) = −1 for all x ∈ R, but the pointwise limit of the sequence {ϕn }n≥1 does not exist. (c) Let X =R and consider the sequence 2 2 nxe−n x ϕn (x) = 2 2 2nxe−n x
if n = even if n = odd
,
n ≥ 1.
Then ϕn (x) −→ 0 for all x ∈ R but the Γ-limit does not exist. In fact we have √
− √2e if x = 0 and Γ- lim inf ϕn (x) = n→∞ 0 if x = 0
if x = 0 − √12e . Γ- lim sup ϕn (x) = n→∞ 0 if x = 0 Next we produce a characterization of the Γ-convergence in terms of the convergence of the epigraphs of the functions.For this purpose we need to introduce a mode of set convergence. The subject of set convergence is examined more systematically in Section 6.6. DEFINITION 1.5.4 Let {Cn }n≥1 be a sequence of subsets of X. The Kτ -lower limit of the sequence {Cn }n≥1 denoted by Kτ - lim inf Cn (or simply K- lim inf Cn n→∞
n→∞
when there is no ambiguity about the topology on X), is defined by ! # ττ Ck . Kτ - lim inf Cn = n→∞
n≥1 k≥n
So x ∈ Kτ - lim inf Cn if and only if for every U ∈N (x), we can find n0 = n0 (U ) ≥ n→∞
1 such that U ∩ Cn = ∅ for all n ≥ n0 .
1.5 Γ-Convergence
47
The Kτ -upper limit of the sequence {Cn }n≥1 denoted by Kτ - lim sup Cn (or n→∞
K- lim sup Cn ) is defined by n→∞
Kτ - lim sup Cn = n→∞
# !
τ
Ck .
n≥1 k≥n
So x ∈ Kτ - lim sup Cn if and only if for all U ∈ N (x) and for every n ≥ 1, we can n→∞
find k ≥ n such that U ∩ Ck = ∅. If Kτ - lim inf Cn = Kτ - lim sup Cn = C, then we say that the sequence {Cn }n≥1 n→∞
n→∞
converges to C in the sense of Kuratowski and we write Kτ - lim Cn = C (or n→∞
K- lim Cn =C). n→∞
REMARK 1.5.5 Clearly we always have that Kτ - lim inf Cn ⊆Kτ - lim sup Cn = C n→∞
n→∞
and both sets are closed, possibly empty. EXAMPLE 1.5.6 (a) Let X =R and [0, n1 ] Cn = [1, 1 +
if n = even , if n = odd
1 ] n
then K- lim inf Cn = ∅ and K- lim sup Cn = {0, 1}. n→∞
n→∞
K
(b) Let X =R and Cn =[0, 1/n] ∪ [n, +∞). Then Cn −→ {0}. Recall that for C ⊆ X we have the indicator function 0 if x ∈ C . iC (x) = +∞ if x ∈ /C PROPOSITION 1.5.7 If {Cn }n≥1 is a sequence of nonempty subsets of X and we set C = Kτ - lim inf Cn , C = Kτ - lim sup Cn , n→∞
n→∞
then iC = Γτ - lim sup iCn and iC = Γτ - lim inf iCn . n→∞
n→∞
PROOF: We show the first equality. The proof is similar for the second one. Let ϕ=Γτ - lim sup iCn . Clearly ϕ takes only the values 0 and +∞ (see Definition n→∞
1.5.1). So it suffices to show that ϕ(x) = 0 if and only if x ∈ C . According to Definition 1.5.4, x ∈ C if and only if for every U ∈ N (x) we can find n0 ≥ 1 such that Cn ∩ U = ∅ for all n ≥ n0 . This is equivalent to inf iCn (u) = 0 for all n ≥ n0 . u∈U
Therefore x ∈ C if and only if lim sup inf iCn (u) = 0 for all U ∈ N (x). So we n→∞
u∈U
conclude that x ∈ C if and only if ϕ(x)=0; that is, ϕ = iC .
The next theorem relates Γ-convergence and the Kuratowski convergence of the epigraphs.
48
1 Smooth and Nonsmooth Calculus
THEOREM 1.5.8 If ϕn : X −→ R, n ≥ 1, is a sequence of proper functions and ϕ = Γτ - lim inf ϕn , ϕ = Γτ - lim sup ϕn , n→∞
n→∞
then epi ϕ = Kτ - lim sup epi ϕn and epi ϕ = Kτ - lim inf epi ϕn . n→∞
n→∞
PROOF: Again we prove the first equality. The proof of the second is similar. We know that (x, λ) ∈ epi ϕ if and only if ϕ (x) ≤ λ. According to Definition 1.5.1, ϕ (x) ≤ λ if and only if for every ε > 0 and every U ∈ N (x) we have lim inf inf ϕn (u) < λ + ε. n→∞ u∈U
This last inequality is equivalent to saying that for every ε > 0, every U ∈ N (x) and every k ≥ 1, we can find n ≥ k such that inf ϕn (u) < λ + ε. This in turn is u∈U
equivalent to U × (λ − ε, λ + ε) ∩ epi ϕn = ∅. Because the sets U × (λ − ε, λ + ε) with ε > 0 and U ∈ N (x), form a local basis for (x, λ) in X × R with the product topology; we conclude that (x, λ) ∈ epi ϕ if and only if (x, λ) ∈ Kτ - lim sup epi ϕn (see Definition 1.5.4) n→∞
REMARK 1.5.9 This is the reason why many authors call the Γ-convergence, epigraphical convergence, and denote it by eτ - lim ϕn , eτ -lim inf ϕn and eτ - lim sup ϕn . n→∞
n→∞
n→∞
We have already seen that Γ-convergence and pointwise convergence are in general distinct notions. We determine what the precise relation is between them. First of all, directly from Definition 1.5.1 we have the following. PROPOSITION 1.5.10 If ϕn : X −→ R, n ≥ 1, is a sequence of proper functions, then Γτ - lim inf ϕn ≤ lim inf ϕn and Γτ - lim sup ϕn ≤ lim sup ϕn . In particular if n→∞
n→∞
n→∞
n→∞
$ exist, then ϕ ≤ ϕ. $ Γτ - lim ϕn = ϕ and lim ϕn = ϕ n→∞
PROPOSITION 1.5.11 If ϕn : X −→ R, n ≥ 1, is a sequence of proper functions that converge uniformly to ϕ, then Γτ - lim ϕn = ϕτ , where ϕτ is the τ -lower n→∞
semicontinuous regularization of ϕ. PROOF: For every U ⊆ X nonempty, and open, we have lim inf ϕn (u) = inf ϕ(u).
n→∞ u∈U
u∈U
Therefore for every x ∈ X, sup
lim inf ϕn (u) =
U ∈N (x) n→∞ u∈U
sup
inf ϕ(u) = ϕτ (x)
U ∈N (x) u∈U
⇒ Γτ - lim ϕn = ϕτ . n→∞
1.5 Γ-Convergence
49
REMARK 1.5.12 The uniform limit of τ -lower semicontinuous functions, is τ lower semicontinuous too, therefore if each ϕn is τ -lower semicontinuous, then ϕ is τ -lower semicontinuous and so Γτ - lim ϕn = ϕ. n→∞
The next two propositions explain the importance of monotone methods in optimization. PROPOSITION 1.5.13 If ϕn : X −→ R, n ≥ 1, is an increasing sequence of proper functions, then Γτ - lim ϕn = lim ϕτn = sup ϕτn . n→∞
n→∞
n≥1
PROOF: If U ⊆ X is nonempty open, then lim inf ϕn (u) = sup inf ϕn (u).
n→∞ u∈U
n≥1 u∈U
So for every x ∈ X sup
lim inf ϕn (u) =
U ∈N (x) n→∞ u∈U
sup sup inf ϕn (u)
U ∈N (x) n≥1 u∈U
= sup sup
inf ϕn (u) = sup ϕτn (x).
n≥1 U ∈N (x) u∈U
n≥1
REMARK 1.5.14 If {ϕn }n≥1 is an increasing sequence of τ -lower semicontinuous functions, then ϕn ↑ ϕ = sup ϕn is τ -lower semicontinuous too and thus n≥1
Γτ - lim ϕn = lim ϕn = ϕ. So we see that in this context Γτ and pointwise conn→∞
n→∞
vergence coincide. Without the τ -lower semicontinuity of the ϕn s this is no longer true. PROPOSITION 1.5.15 If ϕn : X −→ R, n ≥ 1, is a decreasing sequence of proper functions and ϕn (x) −→ ϕ(x) for all x ∈ X, then Γτ - lim ϕn = ϕτ . n→∞
PROOF: If U ⊆ X is nonempty open, we have lim inf ϕn (u) = inf inf ϕn (u) = inf ϕ(u)
n→∞ u∈U
u∈U n≥1 τ
⇒ Γτ - lim ϕn (x) = ϕ (x) n→∞
u∈U
(see Definition 1.5.1).
To have a general result on the equivalence of the Γτ -convergence and of the pointwise convergence, we need the following notion. DEFINITION 1.5.16 Let ϕn : X −→ R, n ≥ 1, be a sequence of proper functions. We say that {ϕn }n≥1 is equi-τ -lower semicontinuous at x ∈ X, if given any ε > 0, we can find U ∈ N (x) such that ϕn (u) ≥ ϕn (x) − ε
for all u ∈ U and all n ≥ 1.
We say that {ϕn }n≥1 is equi-τ -lower semicontinuous if it is equi-τ -lower semicontinuous at every x ∈ X.
50
1 Smooth and Nonsmooth Calculus
PROPOSITION 1.5.17 If ϕn : X −→ R, n ≥ 1, is a sequence of proper functions that is equi-τ -lower semicontinuous at x ∈ X, then (Γτ - lim inf ϕn )(x)=lim inf ϕn (x) n→∞
n→∞
and (Γτ - lim sup ϕn )(x)=lim inf ϕn (x). So if {ϕn }n≥1 is equi-τ -lower semicontinun→∞
n→∞
ous, then Γτ - lim ϕn = ϕ if and only if ϕn −→ ϕ pointwise. n→∞
PROOF: As before we prove the first equality. The proof of the other is similar. By virtue of Proposition 1.5.10 it suffices to show that lim inf ϕn (x) ≤ (Γτ - lim inf ϕn )(x). n→∞
(1.55)
n→∞
Exploiting the equi-τ -lower semicontinuity of {ϕn }n≥1 at x ∈ X, given ε > 0, we can find U ∈ N (x) such that ϕn (x) − ε ≤ inf ϕn (u) for all n ≥ 1. Hence u∈U
lim inf ϕn (x) − ε ≤ n→∞
sup lim inf inf ϕn (u).
U ∈N (x) n→∞ u∈U
Let ε ↓ 0 to obtain (1.55).
If X is a Banach space and the ϕn s are convex functions, then we can use Theorem 1.2.7 to produce the following useful consequence of Proposition 1.5.17. PROPOSITION 1.5.18 If X is a Banach space and ϕn : X −→ R, n ≥ 1, is a sequence of proper convex functions that is equibounded above in U ∈ N (x) (i.e., there exists M > 0 such that sup sup ϕn (u) ≤ M < +∞), then (Γτ - lim inf ϕn )(x) = n→∞
n≥1 u∈U
lim inf ϕn (x) and (Γτ - lim sup ϕn )(x) = lim inf ϕn (x). So, if {ϕn }n≥1 is equibounded n→∞
n→∞
n→∞
above in some neighborhood of every point x ∈ X , then Γτ - lim ϕn = ϕ if and only n→∞
if ϕn −→ ϕ pointwise.
REMARK 1.5.19 If X is finite-dimensional and the sequence ϕn , ϕ n≥1 consists of convex functions with values in R (hence continuous; see Proposition 1.2.5), then Γτ - lim ϕn = ϕ if and only if ϕn −→ ϕ pointwise. This result fails if ϕ does not n→∞
take values in R. Let X = R and consider the sequence ϕn (x) = ln x − 1. Then Γ
τ ϕn −→ ϕ = I{0} and ϕn −→ ϕ $ pointwise where
ϕ $=
1 +∞
if x = 0 . if x = 0
Next by endowing with more structure the space X, we produce some convenient sequential characterizations of Γτ - lim inf ϕn and of Γτ - lim sup ϕn . n→∞
n→∞
PROPOSITION 1.5.20 If X is first countable and ϕ = Γτ - lim inf ϕn , ϕ = n→∞
Γτ - lim sup ϕn , then n→∞
1.5 Γ-Convergence
51
(a) For every x ∈ X and every sequence xn −→ x, we have ϕ (x) ≤ lim inf ϕn (xn );
(1.56)
n→∞
and for every x ∈ X we can find a sequence xn −→ x in X such that ϕ (x) = lim inf ϕn (xn ).
(1.57)
n→∞
(b) For every x ∈ X and every sequence xn −→ x, we have ϕ (x) ≤ lim sup ϕn (xn )
(1.58)
n→∞
and for every x ∈ X we can find a sequence xn −→ x in X such that ϕ (x) = lim sup ϕn (xn ).
(1.59)
n→∞
PROOF: (a) Let U ∈ N (x). Then we can find n0 = n0 (U ) ≥ 1 such that xn ∈ U for all n ≥ n0 . We have inf ϕn (u) ≤ ϕn (xn )
for all n ≥ n0 ,
u∈U
⇒ lim inf inf ϕn (u) ≤ lim inf ϕn (xn ), n→∞ u∈U
n→∞
⇒ ϕ (x) ≤ lim inf ϕn (xn ). n→∞
This proves (1.56). Next we prove (1.57). Let x ∈ X such that ϕ (x) < +∞ and let Uk k≥1 be a local basis at x ∈ X such that Uk+1 ⊆ Uk for all k ≥ 1. Consider a sequence λk ↓ ϕ (x) in R such that λk > ϕ (x) for all k ≥ 1. We have
for all k ≥ 1.
lim inf inf ϕn (u) < λk n→∞ u∈Uk
So for all k ≥ 1, we can find a strictly increasing sequence of integers n(k) ≥ 1 such that inf ϕn(k) (u) < λk for all k ≥ 1. u∈Uk
For every k ≥ 1 we can find uk ∈ Uk such that ϕn(k) (uk ) < λk . Then we introduce the sequence if n = n(k) uk xn = x if n = n(k)
for all k ≥ 1.
Evidently xn −→ x and ϕ (x) = lim λk ≥ lim inf ϕn(k) (uk ) ≥ lim inf ϕn (xn ); that k→∞
k→∞
n→∞
is, (1.57) holds. From the first part of the proof we know that the opposite inequality holds. So ϕ (x) = lim inf ϕn (xn ); that is, (1.57) holds. n→∞
(b) Inequality (1.58) follows as (1.56). So we prove (1.59). Again let x ∈ X such that ϕ (x) < +∞ and consider µk k≥1 ⊆ R such that µk ↓ ϕ (x) and µk > ϕ (x)
52
1 Smooth and Nonsmooth Calculus
for k ≥ 1. As before for every k ≥ 1 we can find a strictly increasing sequence of integers n(k) ≥ 1 such that inf ϕn (u) < µk
u∈Uk
for all n ≥ n(k).
So for every n ≥ n(k) we can find un,k ∈ Uk such that ϕn (un,k ) < µk . We introduce the sequence xn =
x xn
if n < n(1) . if n(k) ≤ n < n(k + 1)
Then xn −→ x and so ϕ (x) = lim µk ≥ lim sup ϕn (xn ). k→∞
n→∞
Combining this with (1.58), we conclude that ϕ (x) = lim sup µk ϕn (xn ); that is, (1.59) holds. n→∞
COROLLARY 1.5.21 If X is first countable and ϕ = Γτ - lim ϕn , then for every x ∈ X and every sequence xn −→ x in X we have
n→∞
ϕ(x) ≤ lim inf ϕn (xn ). n→∞
(1.60)
and for every x ∈ X we can find a sequence xn −→ x in X such that ϕ(x) = lim ϕn (xn ). n→∞
(1.61)
PROOF: Use (1.56) to obtain (1.60) and combine (1.57) and (1.59) to get (1.61). REMARK 1.5.22 From Proposition 1.5.20 and Corollary 1.5.21 it follows that when X is first countable, then
Γτ - lim inf ϕn (x) = min lim inf ϕn (xn ) : xn −→ x in X n→∞ n→∞
Γτ - lim sup ϕn (x) = min lim sup ϕn (xn ) : xn −→ x in X n→∞ n→∞
and Γτ - lim ϕn (x) = min lim ϕn (xn ) : xn −→ x in X . n→∞
n→∞
Also note that in Corollary 1.5.21, (1.60) is a stronger assumption than the pointwise convergence because it is required to hold for every xn −→ x and not only for xn = x. On the other hand, (1.61) is a weaker requirement than the pointwise convergence, where we must have xn = x for all n ≥ 1. This explains why the two convergence notions are in general distinct.
1.5 Γ-Convergence
53
In the case of a sequence {Cn }n≥1 ⊆ 2X , then we can have the following convenient sequential characterizations of the Kuratowki limits (see Definitions 1.5.4 and Proposition 1.5.7). PROPOSITION 1.5.23 If X is first countable and {Cn }n≥1 ⊆ 2X , then lim inf Cn = x ∈ X : x = lim xn , xn ∈ Cn for all n ≥ 1 and n→∞
lim sup Cn = x ∈ X : x = lim xnk , xnk ∈ Cnk , n1 < n2 < · · · < nk < · · · . n→∞
REMARK 1.5.24 So lim inf Cn consists of all limit points of sequences with eln→∞
ements in Cn , n ≥ 1 and lim sup Cn consists of all subsequential limit points of n→∞
sequences with elements in Cn , n ≥ 1. When X is a metric space, we can write that lim inf Cn = x ∈ X : lim d(x, Cn ) = 0 and lim sup Cn = x ∈ X : lim inf d(x, Cn ) = n→∞ n→∞ n→∞ n→∞ 0 . Using Proposition 1.5.23, we can have the following double sequence lemma which is a useful analytical tool on many occasions. PROPOSITION 1.5.25 If X is first countable,
xmn
⊆ X and m(n) n≥1 and
m,n≥1
lim lim xmn = x, then we can find sequences of integers m→∞ n→∞ n(m) m≥1 increasing (not necessarily strictly) to +∞ such that
xmn(m) −→ x as m → ∞ and xm(n)n −→ x as n → ∞. PROOF: Let An = xmn m≥1 and xm = lim xmn . By virtue of Proposition 1.5.23 n→∞
we have xm ∈ lim inf An for all m ≥ 1. Because xm → x as m → ∞ and lim inf An n→∞
n→∞
is closed (see Remark 1.5.5), we have x ∈ lim inf An . Therefore x = lim un with n→∞
n→∞
un ∈ An , hence un = xm(n)n and so x = lim xm(n)n . n→∞ Next let Bm = xmn n≥1 . Then xm ∈ B m for all m ≥ 1 and so x = lim xm ∈ lim inf B m = lim inf Bm . Therefore we can find vm ∈ Bm , m ≥ 1, such that x = m→∞
m→∞
lim vm . Then vm = xmn(m) and so x = lim xmn(m) .
m→∞
m→∞
Now let us check the variational properties of Γ-convergence. We start with a topological version of the notion of coercivity. DEFINITION 1.5.26 Let (X, τ ) be a Hausdorff topological space with τ being its topology (a) A function ϕ : X −→ R is said to be coercive (resp., sequentially coercive) if τ for every λ ∈ R, the set {x ∈ X : ϕ(x) ≤ λ} is τ -countably compact (resp., τ sequentially compact). (b) A sequence of functions ϕn : X −→ R, n ≥ 1, is said to be equicoercive if for every λ ∈ R, there exists a τ -closed, τ -countably compact set Kλ ⊆ X, such that {ϕn ≤ λ} = x ∈ X : ϕn (x) ≤ λ ⊆ Kλ for all n ≥ 1.
54
1 Smooth and Nonsmooth Calculus
REMARK 1.5.27 Evidently every sequentially coercive function ϕ is coercive. If X is a reflexive Banach space and ϕ : X −→ R is coercive for X with the weak topology, then ϕ(x) −→ +∞ as x −→
+∞. Some authors call this property weak coercivity and call ϕ coercive when ϕ(x) /x −→ +∞ as x −→ +∞ (i.e., ϕ exhibits superlinear growth at infinity). PROPOSITION 1.5.28 If ϕn : X −→ R is a sequence such that −∞ < inf ϕn (x) n≥1
for all x ∈ X, then the sequence {ϕn }n≥1 is equicoercive if and only if there exists a τ -lower semicontinuous coercive function g : X −→ R such that g ≤ ϕn for all n ≥ 1. PROOF: ⇒: Let g0 (x) = inf ϕn (x) and set g = g 0τ (the τ -lower semicontinuous n≥1
regularization of g0 ). Because {ϕn }n≥1 is equicoercive, we can find a family {Kλ }λ∈R of τ -closed, τ -countably compact sets such that {ϕn ≤ λ} ⊆ Kλ for all λ ∈ R, n ≥ 1. Given x ∈ {g ≤ λ} and ε > 0, we can find n = n(ε) ≥ 1 such that ϕn (x) ≤ λ + ε and so x ∈ Kλ+ε . Therefore {g ≤ λ} ⊆ Kλ+ε and the latter set is τ -closed and e>0
τ -countably compact, which proves that g is τ -lower semicontinuous, coercive. ⇐: For every λ ∈ R and every n ≥ 1, {ϕn ≤ λ} ⊆ {g ≤ λ} = Kλ and Kλ of τ -closed (because g is τ -lower semicontinuous) and Kλ is τ -countably compact (because g is coercive). Therefore it follows that the sequence {ϕn }n≥1 is equicoercive. Equicoercive families exhibit interesting variational stability properties. THEOREM 1.5.29 If ϕn : X −→ R n ≥ 1 is an equicoercive sequence, inf ϕn (x) > n≥1
−∞ for all x ∈ X and as before ϕ = Γτ - lim inf ϕn , ϕ = Γτ - lim sup ϕn , then ϕ n→∞
n→∞
and ϕ are both coercive and min ϕ (x) = lim inf inf ϕn (xn ).
x∈X
n→∞ x∈X
(1.62)
Moreover, if ϕ = Γτ - lim ϕn , then ϕ is coercive and n→∞
min ϕ(x) = lim inf ϕn (xn ).
x∈X
n→∞ x∈X
(1.63)
PROOF: By virtue of Proposition 1.5.28, we can find g : X −→ R a τ -lower semicontinuous and coercive function such that g ≤ ϕn for all n ≥ 1. Then clearly g ≤ ϕ ≤ ϕ and so both functions ϕ and ϕ are coercive and τ -lower semicontinuous (see Remark 1.5.2). Next we prove (1.62). First we show that because of coercivity, ϕ attains its infimum on X. Indeed, if {xn }n≥1 ⊆ X is a minimizing sequence and lim ϕ (xn ) = inf ϕ = m < +∞, then we can find n0 ≥ 1 such that xn ∈ Km+1 for all n ≥ n0 with X
Km+1 τ -closed and τ -countably compact. So {xn }n≥1 has a cluster point x ∈ X and because ϕ is τ −lower semicontinuous, we have m ≤ ϕ (x) ≤ lim inf ϕ (xn ) = m, n→∞
⇒ m = ϕ (x); that is, inf ϕ = min ϕ . X
Directly from Definition 1.5.1, we have
X
1.5 Γ-Convergence lim inf inf ϕn (x) ≤ min ϕ (x). n→∞ x∈X
55 (1.64)
x∈X
Suppose that lim inf inf ϕn (x) < +∞ (or otherwise we are done, see (1.64)). We n→∞ x∈X
can find a subsequence {nk }k≥1 and λ ∈ R such that lim inf ϕnk (x) = lim inf inf ϕn (x) < λ.
k−→∞ x∈X
n→∞ x∈X
(1.65)
Evidently we may assume that for all k ≥ 1.
inf ϕnk (x) < λ
x∈X
(1.66)
Because of the equicoercivity of the sequence {ϕn }n≥1 , we can find a τ -closed and τ -countably compact set Kλ such that {ϕnk ≤ λ} ⊆ Kλ for all k ≥ 1. Note that because of (1.66) all the sets {ϕnk ≤ λ} ⊆ K, k ≥ 1, are nonempty. Hence inf ϕnk (x) = inf ϕnk (x).
x∈X
(1.67)
x∈K
Let xnk ∈K such that ϕnk (xnk ) = inf ϕnk (x) (it exists because K is τ -closed, τ x∈K
countably compact, and ϕnk is τ -lower semicontinuous by virtue of the equicoercivity of the sequence {ϕn }n≥1 ). The sequence {xnk }k≥1 ⊆ K has a cluster point x ∈ K. For every U ∈ N (x), there exists k0 ≥ 1 such that for all k ≥ k0 we have xnk ∈ U . Hence inf ϕnk (u) ≤ ϕnk (xnk )
for all k ≥ k0 ,
u∈U
⇒ lim inf inf ϕnk (u) ≤ lim ϕnk (xnk ) k→∞ u∈U
k→∞
= lim inf inf ϕn (x) n→∞ x∈X
(1.68)
(see (1.67) and (1.65)). Because U ∈ N (x) was arbitrary from (1.68) it follows that ϕ (x) ≤ lim inf inf ϕn (x) n→∞ x∈X
(with ϕ = Γτ - lim inf ϕnk ), k→∞
⇒ min ϕ (x) ≤ lim inf inf ϕn (x), x∈X
n→∞ x∈X
⇒ min ϕ (x) ≤ lim inf inf ϕn (x) x∈X
n→∞ x∈X
(because ϕ ≤ ϕ ).
(1.69)
From (1.64) and (1.69) we obtain (1.62). Finally if ϕn Γτ -converges to ϕ, then directly from Definition 1.5.1 we have lim sup inf ϕn (x) ≤ inf ϕ(x). n→∞
x∈X
From (1.62) and (1.70) we obtain (1.63).
x∈X
(1.70)
To continue with the variational features of Γ-convergence, we introduce some relevant notation.
56
1 Smooth and Nonsmooth Calculus
DEFINITION 1.5.30 Let ϕ : X −→ R be a proper function. The set of all mininizers of ϕ in X, denoted by M(ϕ) is defined by M(ϕ) = x ∈ X : ϕ(x) = inf ϕ . X
If ϕ does not attain its infimum, we look for ε > 0 minimizers. So let ε > 0 be given. An ε-minimizer of ϕ in X is a point x ∈ X such that 1 ϕ(x) ≤ max inf ϕ + ε, − . X ε We denote the set of all ε-minimizers of ϕ in X, by Mε (ϕ). REMARK 1.5.31 If inf ϕ > −∞ and ε > 0 is small, then x ∈ Mε (ϕ) if and only if X
ϕ(x) ≤ inf ϕ + ε. So in the above definition of ε-minimizer the term −(1/ε) appears X in order to take care of the case where inf X ϕ = −∞. Note that M(ϕ) = Mε (ϕ). ε>0
However, the set Mε (ϕ) is nonempty for all ε > 0, but M(ϕ) may be empty. PROPOSITION 1.5.32 Suppose ϕ = Γτ - lim ϕn . Then we have n→∞ (a) Kτ - lim sup M(ϕn ) ⊆ Kτ - lim sup Mε (ϕn ) ⊆ M(ϕ). (b) If
ε>0
(c) If
ε>0
n→∞
n→∞
ε>0
Kτ - lim sup Mε (ϕn ) = ∅, then M(ϕ) = ∅ and min ϕ=lim sup inf ϕn . X
n→∞
n→∞
X
Kτ - lim inf Mε (ϕn ) = ∅, then M(ϕ) = ∅ and min ϕ= lim inf ϕn . n→∞
X
n→∞ X
PROOF: (a) For every ε> 0 and every n ≥ 1, M(ϕn ) ⊆ Mε (ϕn ), thus first inclusion is obvious. Now let x ∈ Kτ - lim sup Mε (ϕn ). Then according to Definition 1.5.4, n→∞
ε>0
for every ε > 0, U ∈ N (x), and k ≥ 1, we can find n ≥ k such that U ∩ Mε (ϕn ) = ∅. So we obtain 1 lim inf inf ϕn (u) ≤ max lim sup inf ϕn + ε, − n→∞ u∈U ε n→∞ X ⇒ ϕ(x) ≤ lim sup inf ϕn (because ε > 0 was arbitrary). n→∞
X
But directly from Definition 1.5.1, we see that lim sup inf ϕn ≤ inf ϕ. So n→∞
X
X
min ϕ = lim sup inf ϕn . X
n→∞
X
(1.71)
(b) Follows at once from (a) (see (1.71)). (c) From the proof of (a) and Definition 1.5.1, we have ϕ(x) ≤ lim inf inf ϕn ≤ inf ϕ n→∞
X
⇒ inf ϕ = lim inf inf ϕn , X
n→∞
X
X
which together with (b), proves (c).
If ϕ = Γτ - lim ϕn is not identically +∞, then we can improve the conclusions n→∞
of Proposition 1.5.32.
1.5 Γ-Convergence
57
THEOREM 1.5.33 Suppose that ϕ = Γτ - lim ϕn , ϕ is not identically +∞ and n→∞
consider the following statements. Kτ - lim sup Mε (ϕn ) = ∅. (i) n→∞
e>0
(ii) M(ϕ) = ∅ and min ϕ = lim sup inf ϕn . X n→∞ X Kτ - lim sup Mε (ϕn ). (iii) M(ϕ) = n→∞ e>0 (iv) Kτ - lim inf Mε (ϕn ) = ∅. n→∞
e>0
(v) M(ϕ) = ∅ and min ϕ = lim inf ϕn . n→∞ X X Kτ - lim inf Mε (ϕn ) = Kτ - lim sup Mε (ϕn ). (vi) M(ϕ) = n→∞
e>0
e>0
n→∞
then (a) (i)⇔ (ii)⇒(iii). (b) (iv)⇔ (v)⇒(vi). PROOF: (a) Note that (i) ⇒ (ii) follows from Proposition 1.5.32(b). Let us prove that (ii) ⇒ (i). For this purpose let x ∈ M(ϕ). Then by hypothesis ϕ(x) = min ϕ = X
lim sup inf ϕn < +∞. So given any ε > 0, we have n→∞
X
ϕ(x) −
ε ≤ inf ϕn X 2
for infinitely many ns.
(1.72)
From Definition 1.5.1, we see that for all U ∈ N (x), ε 1 lim sup inf ϕn < max ϕ(x) + , − , 2 ε n→∞ U ε 1 ⇒ inf ϕn < max ϕ(x) + , − for all n ≥ 1 large, U 2 ε 1 for infinitely many ns (see (1.72)). ⇒ inf ϕn < max ϕ(x) + ε, − U ε (1.73) ∅ for infinitely many ns and Therefore U ∩ Mε (ϕn ) = every ε > 0 and so x ∈ Kτ - lim sup Mε (ϕn ). So we conclude that M(ϕ) = Kτ - lim sup Mε (ϕn ) = ∅ e>0
n→∞
e>0
n→∞
and from this argument we also infer that (i) and (ii) both imply (iii). (b) In this case (1.72) holds for n ≥ 1 large and then arguing as above we obtain that (1.73) is valid for alln ≥ 1 large. Hence U ∩ Mε (ϕn ) = ∅ for all n ≥ 1 large and every ε > 0 and so x ∈ Kτ - lim inf Mε (ϕn ). This combined with (a) above and e>0
n→∞
Proposition 1.5.32, gives (iv) ⇔ (v) ⇒(vi).
COROLLARY 1.5.34 If ϕ = Γτ - lim ϕn , xn ∈ Mε (ϕn ) with εn ↓ 0 and x is a n→∞
cluster point of {xn }n≥1 , then x ∈ M(ϕ) and ϕ(x) = lim sup ϕn (xn ). Moreover, if n→∞
xn −→ x in X, then x ∈ M(ϕ) and ϕ(x) = lim ϕn (xn ). n→∞
58
1 Smooth and Nonsmooth Calculus
PROOF: Note that x ∈ Kτ - lim sup Mεn (ϕn ) and n→∞
Kτ - lim sup Mε (ϕn ) = ∅. n→∞
ε>0
Then from Theorem 1.5.33(a) we obtain the first part of the corollary. If xn −→ x in X, then x ∈ Kτ - lim inf Mεn (ϕn ) and so Kτ - lim inf Mε (ϕn ) = ∅. Then the n→∞
n→∞
ε>0
second part of the corollary follows from Theorem 1.5.33(b). We have another result on the variational stability of equicoercive sequences.
THEOREM 1.5.35 If ϕ = Γτ - lim ϕn , ϕ is not identically +∞, {ϕn }n≥1 is n→∞
equicoercive, and inf ϕn (x) > −∞ for all x ∈ X, then for every V neighborhood of n≥1
M(ϕ), we can find ε0 > 0 and n0 ≥ 1 such that M(ϕn ) ⊆ Mε0 (ϕn ) ⊆ V
for all n ≥ n0 .
Moreover, for every x ∈ M(ϕ), every U ∈ N (x), and every ε > 0, we can find n1 ≥ 1 such that Mε (ϕn ) ∩ U = ∅ for all n ≥ n1 . PROOF: Let λ ∈ R such that inf ϕ < λ. From Theorem 1.5.29, we know that ϕ is X
coercive and so we can find K ⊆ X τ -closed, and τ -countably compact such that {ϕn ≤ λ} ⊆ K
for all n ≥ 1 and {ϕ ≤ λ} ⊆ K.
(1.74)
Let µ= minc ϕ. Note that K ∩ V c is τ -closed and τ −countably compact. This K∩V
together with the τ -lower semicontinuity and coercivity of ϕ, imply that we can find x ∈ K ∩ V c such that µ = ϕ(x). Because x ∈ / M(ϕ), we have inf ϕ < ϕ(x) = µ. Also X
as in the proof of Theorem 1.5.29 we obtain µ = minc ϕ ≤ lim inf inf c ϕn . K∩V
n→∞ K∩V
From (1.74) we also have that λ ≤ inf c ϕn . Therefore X∩V
min{λ, µ} ≤ lim inf inf c ϕn . n→∞ X∩V
On the other hand using Theorem 1.5.29, we have lim inf ϕn = min ϕ < min{λ, µ} ≤ lim inf inf c ϕn .
n→∞ X
X
So we can find ε0 > 0 and n0 ≥ 1 such that 1 max inf ϕ + ε0 , − < inf c ϕn X X∩V ε0 for all n ≥ n0 . ⇒ Mε0 (ϕn ) ⊆ V
n→∞ X∩V
for all n ≥ n0 ,
Finally because {ϕn }n≥1 is equicoercive, from Theorem 1.5.29 we see that statement (v) in Theorem 1.5.33 is satisfied. So by virtue of that theorem statement (vi) holds, which by virtue of Definition 1.5.4 implies the conclusion of the theorem. Sometimes it is suitable to consider different topologies when defining the two limit functions for a sequence {ϕn }n≥1 .
1.5 Γ-Convergence
59
DEFINITION 1.5.36 (a) Let X be a Banach space and ϕn : X −→ R, n ≥ 1, a sequence of proper functions. We say that ϕn s Mosco converge to a function M ϕ : X −→ R, denoted by ϕn −→ ϕ, if the following two conditions hold. w
(i) For every x ∈ X and every xn −→ x, we have ϕ(x) ≤ lim inf ϕn (xn ). n→∞
(ii) For every x∈X, we can find a sequence xn −→ x such that ϕ(x) = lim ϕn (xn ). n→∞
There is a corresponding convergence of sets. (b) Let {Cn }n≥1 ⊆2X \ {∅}. We set s-lim inf Cn ={x ∈ X :x=lim xn , xn ∈ Cn for all n→∞
n ≥ 1} and w-lim sup Cn ={x ∈ X :x=w- lim xnk , xnk ∈ Cnk , n1 < n2 < . . . < nk < k→∞
n→∞
M
. . .}. We say that the Cn s Mosco converge to a set C, denoted by Cn −→ C, if C = s- lim inf Cn = w- lim sup Cn . n→∞
n→∞
REMARK 1.5.37 Clearly we always have s- lim inf Cn ⊆ w-lim sup Cn . n→∞
n→∞
The following theorem justifies Definition 1.5.36. Its proof can be found in Attouch [34, p. 295], or Hu–Papageorgiou [313, p. 754]. THEOREM 1.5.38 If X is a reflexive Banach space and {ϕn , ϕ}n≥1⊆Γ0 (X), then ϕn −→ ϕ in X if and only if ϕ∗n −→ ϕ∗ in X ∗ . M
M
REMARK 1.5.39 So convex conjugation (see Definition 1.2.15) is bicontinuous for the Mosco convergence from Γ0 (X) onto Γ0 (X ∗ ), when X is reflexive. An immediate consequence of this theorem is the following proposition. PROPOSITION 1.5.40 If X is a reflexive Banach space, {ϕn , ϕ}n≥1 ⊆Γ0 (X) and ϕn −→ ϕ, then for every x∗ ∈ X ∗ we can find a sequence x∗n −→ x∗ in X ∗ such that M
inf (ϕn − x∗n ) −→ inf (ϕ − x∗ ). X
X
We conclude the section with some additional variational properties of the Mosco convergence. The proof of this proposition can be found in Denkowski–Mig´ orski– Papageorgiou [195, p. 468]. PROPOSITION 1.5.41 If X is a reflexive Banach space and {ϕn , ϕ}n≥1 ⊆ Γ0 (X), then M
M
(a) If ϕn −→ ϕ and inf ϕ < λ, then {ϕn ≤ λ} −→ {ϕ ≤ λ}. X
M
M
(b) If for every λ ∈ R {ϕn ≤ λ} −→ {ϕ ≤ λ}, then ϕn −→ ϕ.
60
1 Smooth and Nonsmooth Calculus
1.6 Remarks 1.1: Various aspects of the differential calculus in Banach spaces can be found in the books of Cartan [131], Denkowski–Mig´ orski–Papageorgiou [194], Dieudonn´e [200], Vainberg [590], Zeidler [620], and the survey papers of Averbukh–Smolyanov [48] and Nashed [453]. 1.2: There are several books treating the theory of convex functions. We mention the books of Rockafellar [522], Hiriart-Urruty–Lemarechal [308, 309], Webster [602], Rockafellar–Wets [530] (convex functions defined on RN ), and of Laurent [370], Roberts–Varberg [516], Holmes [310], Barbu–Precupanu [59], Ekeland– Temam [222], Ioffe–Tichomirov [327], Giles [264], Aubin–Ekeland [39], Phelps [495], and Denkowski–Mig´ orski–Papageorgiou [194] (convex functions defined on Banach spaces and on locally convex spaces). In the books of Holmes [310], Giles [264], and Phelps [495], the emphasis is on the relations between the theory of convex functions and the theory of Banach spaces. Theorem 1.2.11 dates back to Mazur [417]. The duality theory of convex functions was initiated by Fenchel [241] for functions defined on RN and was extended to dual pairs of locally convex spaces by Brondsted [112], Moreau [442], and Rockafellar [528]. This duality theory can give the following useful result originally due to H¨ ormander [311]. PROPOSITION 1.6.1 If X is a locally convex space, then there is a bijective correspondence between nonempty, closed, convex sets and sublinear w(X ∗ , X)-lower semicontinuous functions on X ∗ with values in R. This correspondence maps the set C to σ(·; C) its support function. The systematic study of the subdifferential starts with the works of Moreau [441, 442] and Rockafellar [517, 522, 523]. The subdifferential theory of convex integral functionals can be found in Rockafellar [519, 525]. The work of Rockafellar was extended by Levin [376, 377, 378], and Castaing–Valadier [134]. Interesting connections between the subdifferentiability of convex functions and Banach space theory can be found in Giles [264] and Phelps [495]. 1.3: The subdifferential theory of locally Lipschitz functions started with the thesis of Clarke [148], who using Rademacher’s theorem gave the description of the subdifferential included in Theorem 1.3.12 for functions in RN . Soon thereafter Clarke [149, 152] extended the results to locally Lipschitz functions defined on a Banach space. Proposition 1.3.24 is due to Lebourg [371]. A comprehensive presentation of the theory together with applications in mathematical programming, optimal control, and calculus of variations can be found in Clarke [153, 154]. We mention that Rademacher’s theorem (see Theorem 1.3.11) can be extended to functions between Banach spaces as follows. DEFINITION 1.6.2 Let (G, +) be an Abelian Polish group and d an invariant metric on G compatible with the topology (therefore automatically complete). A universally measurable set C ⊆ G is Haar-null , if there exists a probability measure µ on G (not unique), such that χC ∗ µ = 0. Here χC is the characteristic function of the set C and (χC ∗ µ)(x) = G χC (x + y)dµ(y).
1.6 Remarks
61
REMARK 1.6.3 So every translation of C is µ-null. The measure µ is usually called the test measure. Then the infinite-dimensional extension of Theorem 1.3.11 reads as follows (see Christensen [145]). THEOREM 1.6.4 If X is a separable Banach space, Y is a Banach space with the RNP (Radon–Nikodym property; see Denkowski–Mig´ orski–Papageorgiou [194, p. 372]) and ϕ : X −→ Y is locally Lipschitz, then there exists a universally measurable set D ⊆ X such that X \ D is Haar-null and ϕD is Gˆ ateaux differentiable. 1.4: Tangent cones and normal cones have been introduced over the years in a variety of contexts and it is almost impossible today to give a full account of the various cones existing in the literature. We have concentrated on the two most profilic cones, the tangent cones TC (x) and TC (x) and their respective normal cones. The tangent cone TC (x) (see Definition 1.4.1) was introduced by Bouligand [93] for general sets. It is usually called the contingent cone and it exhibits good properties in the context of convex sets. The other tangent cone TC (x) (see Definition 1.4.17) was introduced by Clarke [148, 153] and is always convex without the set being convex. So duality techniques are readily available for this cone. The price we pay for this convenience is that often this cone reduces to the trivial one {0}. A detailed study of these cones and of related concepts can be found in Rockafellar–Wets [530] (finite-dimensional theory) and Aubin–Frankowska [40], and Hu–Papageorgiou [313] (infinite-dimensional theory). 1.5: Γ-convergence was introduced and studied by De Giorgi–Franzoni [190, 191]. The related Kτ -convergence of sets (see Definition 1.5.4), known as the Kuratowski convergence, was actually first used by Painlev´e in 1902 in his lectures on analysis in the Universit´e de Paris. However, because it was more systematically examined and popularized by Kuratowski [366, 368], it carries his name. The Γ-convergence is designed in such a way so as to be suitable in the study of the stability analysis of variational problems. For this reason it is said to be a variational convergence and can be found in Attouch [34], Dal Maso [171], Denkowski–Mig´ orski–Papageorgiou [195], Dontchev–Zolezzi [202], Hu–Papageorgiou [313], and Rockafellar–Wets (only in RN ) [530]. The Mosco convergence of sets and functions (see Definition 1.5.36) was introduced and studied by Mosco [445, 446], who proved the main result, which is Theorem 1.5.38 and which justifies the introduction of this alternative variational convergence. For more on the Mosco convergence we refer to Attouch [34], Dontchev–Zolezzi [202], and Hu–Papageorgiou [313]. We should also mention the multiple Γ-convergence which is defined on the product of two Hausdorff topological spaces and is convenient in the variational analysis of optimal control problems. We refer the reader to Buttazzo [126] for details.
2 Extremal Problems and Optimal Control
Summary. *This chapter is devoted to the study of various kinds of variational problems and of the mathematical tools needed to deal with them. We start with the so-called “direct method”, that leads to a systematic study of lower semicontinuous functionals. Then we consider optimization problems with constraints using the Lagrange multipliers methods. This method is closely connected to nonlinear eigenvalue problems. We also develop a general duality theory for convex optimization problems and study saddle points, KKM-multimaps, coincidence theorems, variational inequalities and the Fenchel duality theory. Subsequently, we present the Ekeland variational principle and some of its most remarkable consequences. We also show that it is equivalent to a whole family of other important results of nonlinear analysis. With these mathematical tools, we then pass to the study of calculus of variations problems (Euler equation and canonical Hamiltonian equations) and of optimal control problems (existence theory, relaxation and Pontryagin’s maximum principle).
Introduction This chapter is devoted to the study of variational problems and of the mathematical tools that are necessary to do this. So, in Section 2.1 we conduct a detailed investigation of the topological notion of lower semicontinuity. Since the work of Tonelli, the concept of lower semicontinuity has played a central role in the study of variational problems. Our study outlines the so-called direct method of the calculus of variations and also introduces the notion of relaxed functional which we encounter also in Section 2.6. In Section 2.2 we deal with infinite-dimensional optimization problems with constraints and we analyze them by developing the so-called method of Lagrange multipliers. This method is closely connected to nonlinear eigenvalue problems. Section 2.3 studies saddle points and develops a general duality theory for convex optimization problems. Saddle points appear in game theory and in general in control problems where the controllers exhibit conflicting interests. In connection with saddle points we also introduce and study KKM-maps which are useful in producing coincidence theorems for families of multifunctions and also lead to existence N.S. Papageorgiou, S.Th. Kyritsi-Yiallourou, Handbook of Applied Analysis, Advances in Mechanics and Mathematics 19, DOI 10.1007/b120946_2, © Springer Science+Business Media, LLC 2009
64
2 Extremal Problems and Optimal Control
theorems for variational inequalities. Duality is at the core of convex analysis. In introductory functional analysis we encounter the first instances of duality with the separation theorems for convex sets, which was extended in Definition 1.2.15 with the introduction of the conjugate of a convex function. Here using a “perturbation” approach to a convex minimization problem, we associate a concave maximization one and investigate the precise relation between the two. As a special case, we present the so-called Fenchel duality theory. In Section 2.4 first we present the Ekeland variational principle and discuss some remarkable consequences of it. Then we introduce some other fundamental results of nonlinear analysis, namely the Caristi fixed point theorem, the Takahashi variational principle, and the drop theorem, and we show that they are all equivalent to the Ekeland variational principle. Finally we prove a principle concerning ordered spaces, which we show generates all the aforementioned results. In Section 2.5 we present some basic aspects of the calculus of variations. We consider problems with integral cost functional and fixed endpoints. We develop the Euler equation for an optimal state as well as the canonical Hamiltonian equations. In Section 2.6 we deal with optimal control problems. We limit ourselves to systems monitored by ordinary differential equations (lumped parameter systems). First we develop the existence theory for such optimal control problems. This theory reveals the importance of convex structure in the problem. When this convexity is missing, we need to augment the system in order to assure existence of optimal pairs. This is the process of relaxation. We present four relaxation methods that we show are equivalent under reasonable conditions on the data. Finally we develop necessary conditions for optimality in the form of a maximum principle. Our approach is based on the Ekeland variational principle.
2.1 Lower Semicontinuity In Section 1.2 we examined in some detail proper, lower semicontinuous, convex functions defined on a locally convex space. In this section we drop the convexity condition and concentrate on lower semicontinuous functions. The reason for this is that such functions are involved in the so-called direct method of the calculus of variations. Already in Section 1.5 we had some first results involving the notion of lower semicontinuity. Here we conduct a systematic study of this concept. Our setting is purely topological. So let (X, τ ) be a Hausdorff topological space, with τ denoting its topology. Additional conditions on X are introduced as needed. For x ∈ X, by N (x) we denote the filter of neighborhoods of x. Also recall that R∗ = R ∪ {±∞}. We start by recalling the definition of τ -lower semicontinuity (both local and global) of a function ϕ : X −→ R∗ . DEFINITION 2.1.1 A function ϕ : X −→ R∗ is said to be τ -lower semicontinuous at x, if ϕ(x) = lim inf ϕ(u)= sup inf ϕ(u). u→x
U ∈N (x) u∈U
If ϕ is τ -lower semicontinuous at every x ∈ X, then we say that ϕ is τ -lower semicontinuous. If −ϕ is τ -lower semicontinuous (at x), then we say that ϕ is τ -upper semicontinuous (at x).
2.1 Lower Semicontinuity
65
REMARK 2.1.2 If the topology τ is clearly understood, then we drop τ from the definition and say that ϕ is lower semicontinuous (at x ∈ X). Also if x ∈ X is a point where ϕ(x) > −∞, then ϕ is τ -lower semicontinuous at x if and only if for every λ ∈ R with λ < ϕ(x), we can find U ∈ N (x) such that λ < ϕ(u) for all u ∈ U . PROPOSITION 2.1.3 For a function ϕ : X −→ R∗ the following statements are equivalent. (a) ϕ is τ -lower semicontinuous. (b) For every λ ∈ R, the set Lλ = {x ∈ X : ϕ(x) ≤ λ} is τ -closed. (c) epi ϕ = {(x, λ) ∈ X × R : ϕ ≤ λ} is closed in X × R. PROOF: (a)⇒(b) We show that Lcλ is open. Let x ∈ Lλ . Then λ < ϕ(x) and by virtue of Remark 2.1.2 we can find U ∈ N (x) such that λ < ϕ(u) for all u ∈ U , which shows that Lcλ is open; hence Lλ is closed. (b)⇒(a) If ϕ(x) = −∞, then it is clear from Definition 2.1.1 that ϕ is τ -lower semicontinuous at x ∈ X. So suppose that −∞ < ϕ(x) and let λ < ϕ(x). Note that x ∈ Lcλ and because by hypothesis Lλ is closed, we can find U ∈ N (x) such that U ⊆ Lcλ , hence λ < ϕ(u) for all u ∈ U , which proves the τ -lower semicontinuity of ϕ at x ∈ X. So we have established the equivalence of statements (a) and (b). Next let h : X × R −→ R∗ be defined by h(x, λ) = ϕ(x) − λ. Clearly ϕ is τ -lower semicontinuous on X if and only if h is lower semicontinuous on the product space X × R. Because epi ϕ = {(x, λ) ∈ X × R : h(x, λ) ≤ 0}, the equivalence of (a) and (b) established above implies the equivalence of (b) and (c). COROLLARY 2.1.4 If ϕi : X −→ R∗ , i ∈ I, is a family of τ -lower semicontinuous functions, then (a) sup ϕi is τ -lower semicontinuous. i∈I
(b) If I is finite, then inf ϕi is τ -lower semicontinuous. i∈I
COROLLARY 2.1.5 A set C ⊆ X is τ -closed if and only if iC is τ -lower semicontinuous. From Definition 2.1.1 we see that ϕ : X −→ R∗ is τ -lower semicontinuous at x ∈ X; then for every xn −→ x in X, we have ϕ(x) ≤ lim inf ϕ(xn ). The converse is n→∞
not in general true. EXAMPLE 2.1.6 Let X be an infinite-dimensional Banach space furnished with the weak topology denoted by w. Also let C ⊆ X be a nonempty set which is sequentially w-closed but not w-closed. Then the indicator function iC satisfies w iC (x) ≤ lim inf iC (xn ) for every sequence xn −→ x in X, but it is not w-lower n→∞
semicontinuous. For example in X = l1 , due to the Schur property the set C = ∂B1 = {x ∈ l1 : xl1 = 1} is sequentially w-closed but it is not w-closed (in fact, w C = B 1 = {x ∈ l1 : xl1 ≤ 1}).
66
2 Extremal Problems and Optimal Control
DEFINITION 2.1.7 We say that ϕ : X −→ R∗ is sequentially τ -lower semicontinuous at x ∈ X, if ϕ(x) ≤ lim inf ϕ(xn ) for every sequence xn −→ x in X. We say that n→∞
ϕ is sequentially τ -lower semicontinuous, if it is sequentially τ -lower semicontinuous at every x ∈ X. REMARK 2.1.8 Let τseq denote the topology of X whose sets are sequentially τ -closed; then ϕ : X −→ R∗ is sequentially τ -lower semicontinuous if and only if it is τseq -lower semicontinuous. In general the τseq topology is stronger than the τ -topology and so the notion of sequential τ -lower semicontinuous is more general than the τ -lower semicontinuity. Clearly τ = τseq if and only if X is first countable. So we can state the following proposition. PROPOSITION 2.1.9 If (X, τ ) is first countable, ϕ : X −→ R∗ and x ∈ X, then ϕ is τ -lower semicontinuous at x ∈ X if and only if ϕ is sequentially τ -lower semicontinuous at x ∈ X. The next theorem summarizes the direct method of the calculus of variations and underlines the importance of the notion of lower semicontinuity in variational analysis. The result is known as the Weierstrass theorem. THEOREM 2.1.10 If ϕ : X −→ R∗ is τ -coercive and τ -lower semicontinuous (resp., sequentially τ -coercive and sequentially τ -lower semicontinuous), then (a) There exists x ∈ X such that ϕ(x) = inf ϕ. X
(b) If {xn }n≥1 is a minimizing sequence and x is a cluster point of {xn }n≥1 (resp., x is a subsequential limit of {xn }n≥1 ), then ϕ(x) = inf ϕ. X
(c) If ϕ is not identically +∞, then every minimizing sequence has a cluster point (resp., a convergent subsequence). PROOF: If ϕ=+∞, then all x ∈ X minimize ϕ and so (a) and (b) hold. So assume that ϕ is not identically +∞. Let {xn }n≥1 be a minimizing sequence for ϕ. We have ϕ(xn ) ↓ inf ϕ < +∞. Let λ ∈ R be such that inf ϕ < λ. Then we X
X
can find n0 ≥ 1 such that ϕ(xn )≤λ for all n ≥ n0 . Due to the τ -coercivity (resp., sequential τ -coercivity) of ϕ, we have that {xn }n≥1 has a cluster point x ∈ X (resp., a subsequential limit point x ∈ X); see Definition 1.5.26. Then due to the τ -lower semicontinuity (resp. sequential τ -lower semicontinuity) of ϕ, we have inf ϕ ≤ ϕ(x) ≤ lim ϕ(xn ) = inf ϕ, n→∞
X
X
⇒ ϕ(x) = inf ϕ. X
COROLLARY 2.1.11 If X is a reflexive Banach space, ϕ ∈ Γ0 (X), and ϕ(x) −→ +∞ as x −→ ∞, then we can find x ∈ X such that −∞ < ϕ(x) = inf ϕ. X
PROOF: Note that due to the convexity of ϕ, the function is lower semicontinuous if and only if it is w-lower semicontinuous. Moreover, due to the reflexivity of X bounded sets are relatively w-compact (in fact relatively sequentially w-compact by the Eberlein–Smulian theorem).
2.1 Lower Semicontinuity
67
REMARK 2.1.12 If ϕ : X −→ R∗ is lower semicontinuous convex and there exists x0 ∈ X such that ϕ(x0 ) = −∞, then ϕ is nowhere finite on X. For this reason, when convexity is present, we consider functions with values in R = R ∪ {+∞}. DEFINITION 2.1.13 Let ϕ : X −→ R∗ . The τ -lower semicontinuous regularization (or the τ -lower semicontinuous envelope) of ϕ, is the function ϕ τ : X −→ R∗ defined by ϕ τ (x) = lim inf ϕ(u) = sup inf ϕ(u). u→x
U ∈N (x) u∈U
REMARK 2.1.14 It is clear from this definition that ϕ τ is τ -lower semicontinuous. In the next proposition we show that ϕ τ is the biggest τ -lower semicontinuous function majorized by ϕ. PROPOSITION 2.1.15 If ϕ : X −→ R∗ and S(ϕ) = h : X −→ R∗ : τ τ h is τ -lower semicontinuous, h ≤ ϕ , then epi ϕ = epi ϕ and ϕ (x) = sup h(x) : h ∈ S(ϕ) for all x ∈ X. PROOF: Evidently epi ϕ ⊆ epi ϕ τ . Let (x, λ) ∈ epi ϕ τ . Then ϕ τ (x) ≤ λ. So for every U ∈ N (x) and for every ε > 0 we have inf ϕ(u) ≤ ϕ τ (x) ≤ λ < λ+ε. So we can u∈U
find u ∈ U and µ ∈ (λ, λ+ε) such that ϕ(u) < µ. Hence U ×(λ−ε, λ+ε) ∩epi ϕ = ∅, from which it follows that (x, λ) ∈ epi ϕ. Therefore epi ϕ τ = epi ϕ. Now note that ϕ τ ∈ S(ϕ). Also if h ∈ S(ϕ), then epi ϕ ⊆ epi h and so epi ϕ τ = epi ϕ ⊆ epi h = epi h (see Proposition 2.1.3). Therefore h ≤ ϕ τ and so we conclude that ϕ τ (x) = sup h(x) : h ∈ S(ϕ) for all x ∈ X. τ COROLLARY 2.1.16 If ϕ : X −→ R∗ and λ ∈ R, then ϕ τ ≤ λ = ϕ≤µ . µ>λ
COROLLARY 2.1.17 If C ⊆ X, then iC
τ
= iC τ .
COROLLARY 2.1.18 If ϕ, ψ : X −→ R∗ , then τ
τ
(a) (ϕ + ψ) ≥ ϕ τ + ψ . τ (b) If ψ is continuous and finite everywhere, then (ϕ + ψ) = ϕ τ + ψ. The following proposition characterizes ϕ τ in terms of sequences and follows from Proposition 1.5.20 (see also Remark 1.5.2). PROPOSITION 2.1.19 If (X, τ ) is first countable, ϕ : X −→ R∗ and x ∈ X, then ϕ τ. (a) For every sequence xn −→ x in X we have ϕ τ (x) ≤ lim inf ϕ(xn ). n→∞
68
2 Extremal Problems and Optimal Control
(b) There exists a sequence xn −→ x in X such that ϕ τ (x) = lim ϕ(xn ). n→∞
The next theorem summarizes the relaxation method in the study of variational problems. THEOREM 2.1.20 If ϕ : X −→ R∗ is τ -coercive, then (a) ϕ τ is τ -coercive and τ -lower semicontinuous. (b) There exists x ∈ X such that ϕ τ (x) = inf ϕ τ . X
(c) min ϕ τ = inf ϕ. X
X
(d) Every cluster point of a minimizing sequence for ϕ is a minimizer of ϕ τ . (e) If (X, τ ) is first countable, then the minimizers of ϕ τ are the limits of minimizing sequences for ϕ. PROOF: (a) We already know that ϕ τ is τ -lower semicontinuous. The τ -coercivity of ϕ τ follows from Theorem 1.5.29 and Remark 1.5.2 (see also Proposition 2.1.19). (b) Follows from part (a) and Theorem 2.1.10. (c) Let h(x) = inf ϕ for all x ∈ X. Then h ∈ S(ϕ) and so h ≤ ϕ τ (see Proposition X
2.1.15). It follows that inf ϕ ≤ min ϕ τ . X
X
Because the opposite inequality is always true (recall that ϕ τ ≤ϕ), we conclude that min ϕ τ =inf ϕ. X
X
(d) Let {xn }n≥1 be a minimizing sequence for ϕ and x a cluster point of {xn }n≥1 . Then ϕ τ (x) ≤ lim sup ϕ τ (xn ) ≤ lim ϕ(xn ) = inf ϕ = min ϕ τ n→∞
n→∞
X
X
(see part (c)), ⇒ ϕ τ (x) = min ϕ τ . X
(e) Let x ∈ X be such that ϕ τ (x) = min ϕ τ . Then from Proposition 2.1.19 and (c), we can find xn −→ x such that
X
inf ϕ = ϕ τ (x) = lim ϕ(xn ). X
n→∞
REMARK 2.1.21 This theorem shows that the relaxed functional captures the asymptotic behavior of the minimizing sequences for ϕ. For convex functions in a Banach space, the relaxation process is simpler because by Mazur’s lemma for convex sets, the closures in the norm and weak topologies coincide. So we have the following.
2.1 Lower Semicontinuity
69
PROPOSITION 2.1.22 If X is a Banach space and ϕ : X −→ R is convex, then ϕ s = ϕ w (here by s we denote the strong topology on X and by w the weak topology on X). Next we prove a lower semicontinuity result for integral functionals defined on products of Lebesgue spaces. The mathematical setting is the following. Let (Ω, Σ, µ) be a complete, finite nonatomic measure space and ϕ : Ω × RN × Rm −→ R a function that satisfies the following hypotheses. H0 :
(i) ϕ is Σ × B(RN ) × B(Rm )-measurable with B(RN ) (resp., B(Rm )) being the Borel σ-field of RN (resp., of Rm ). (ii) For µ-almost all ω ∈ Ω, (x, u) −→ ϕ(ω, x, u) is lower semicontinuous. (iii) For µ-almost all ω ∈ Ω and all x ∈ RN , u −→ ϕ(ω, x, u) is convex.
Let 1 ≤ p, r ≤ +∞ and consider the integral function Iϕ (x, u) : Lp (Ω, RN ) × L (Ω, Rm ) −→ R∗ defined by
Iϕ (x, u) = ϕ ω, x(ω), u(ω) dµ for all (x, u) ∈ Lp (Ω, RN ) × Lr (Ω, Rm ). r
Ω
We want to establish a sequential lower semicontinuity result when we consider the strong topology on Lp (Ω, RN ) and the weak topology on Lr (Ω, Rm ) (the weak∗ topology on L∞ (Ω, Rm ) when r = +∞). To do this we need the following approximation result, whose proof can be found in Buttazzo [126, p. 42]. PROPOSITION 2.1.23 If ϕ: Ω × RN × Rm −→ R satisfies H0 above and one of the following conditions. (iv) For µ-almost all ω ∈ Ω, we can function u0 : RN −→ Rm
find a continuous such that the function x −→ ϕ ω, x, u0 (x) is finite and continuous; or (v) There exists a function ϑ : R −→ R such that lim
s→+∞
ϑ(s) = +∞ s
and ϑ(uRm ) ≤ ϕ(ω, x, u) for µ-a.a. ω ∈ Ω, all x ∈ RN and all u ∈ Rm , then we can find two sequences of Carath´eodory functions an : Ω × RN −→ Rm and cn : Ω × RN −→ R such that
ϕ(ω, x, u) = sup an (ω, x), u Rm ) + cn (ω, x) n≥1
for µ-almost all ω ∈ Ω and all x ∈ RN, all u ∈ Rm . REMARK 2.1.24 Recall that h: Ω × Rk −→ Rs (1 ≤ s, k) is a Carath´eodory function, if for all x ∈ Rk , ω −→ h(ω, x) is Σ-measurable and for µ-almost all ω ∈ Ω, x −→ h(ω, x) is continuous. Such a function is automatically Σ × B(Rk )measurable. If in the above proposition ϕ ≥ 0, then it is easy to see the following approximation for ϕ holds +
ϕ(ω, x, u) = sup an (ω, x), u Rm + cn (ω, x) n≥1
with an : Ω × RN −→ Rm and cn : Ω × RN −→ R bounded Carath´eodory functions.
70
2 Extremal Problems and Optimal Control
We can prove the following sequential lower semicontinuity result for the integral functional Iϕ (x, u), (x, u) ∈ Lp (Ω, RN ) × Lr (Ω, Rm ). THEOREM 2.1.25 If ϕ : Ω×RN ×Rm −→ R satisfies H0 and the following holds, “for every sequence {xn }n≥1 converging in Lp (Ω, RN ) and every sequence {un }n≥1 weakly converging in Lr (Ω, Rm ) (weakly∗ if r = +∞) such that
ϕ+ ω, xn (ω), un (ω) dµ ≤ c + ϕ− ω, xn (ω), un (ω) dµ, Ω
Ω
for some c > 0 and all n ≥ 1, the sequence
ϕ− ·, xn (·), un (·)
n≥1
⊆ L1 (Ω)
is relatively weakly compact,” then the integral function Iϕ is well-defined on Lp (Ω, RN ) × Lr (Ω, Rm ) with values in R and it is sequentially lower semicontinuous when we consider Lp (Ω, RN ) with the norm topology and Lr (Ω, Rm ) with the weak topology (weak∗ if r = +∞). PROOF: Let x ∈ Lp (Ω, RN ), u ∈ Lr (Ω, Rm ) and suppose that for some c > 0 we have
ϕ+ ω, x(ω), u(ω) dµ ≤ c + ϕ− ω, x(ω), u(ω) dµ. (2.1) Ω Ω
Then by hypothesis ϕ− ·, x(·), u(·) ⊆ L1 (Ω) and so using (2.1) we conclude that
1 ϕ ·, x(·), u(·) ⊆ L (Ω). If (2.1) is not satisfied, then
ϕ− ω, x(ω), u(ω) dµ < +∞ ϕ+ ω, x(ω), u(ω) dµ = +∞, and Ω
Ω
⇒ ϕ ω, x(ω), u(ω) dµ = +∞. Ω
So indeed Iϕ is well-defined with values in R = R ∪ {+∞}. We prove the desired sequential lower semicontinuity of Iϕ , in steps. Step 1: We assume that there exists a function ϑ : R −→ R such that lim
s→+∞
ϑ(s) = +∞ s
and
ϑ(uRm ) ≤ ϕ(ω, x, u)
(2.2)
for µ-a.a. ω ∈ Ω, all x ∈ RN , and all u ∈ Rm . Because of (2.2) we can apply Proposition 2.1.23 (see also Remark 2.1.24) and obtain that +
ϕ(ω, x, u) = sup an (ω, x), u RN + cn (ω, x) (2.3) n≥1
with an : Ω × R −→ R and cn : Ω × RN −→ R, n ≥ 1, bounded Carath´eodory functions. Recall that
+
an (ω, x), u Rm + cn (ω, x) dµ Ω
= sup (2.4) an (ω, x), u Rm + cn (ω, x) dµ : C ∈ Σ . N
m
C
So in view of (2.3) and (2.4) it suffices to show that for all n ≥ 1 and all C ∈ Σ
2.1 Lower Semicontinuity
(x, u) −→
an (ω, x(ω)), u(ω)
C
RN
71
+ cn ω, x(ω) dµ
is sequentially lower semicontinuous on Lp (Ω, RN ) × Lr (Ω, Rm ) the first space in the product furnished with the norm topology and the second with the weak topology (weak∗ topology if r = +∞). But this is immediate because an and cn are bounded Carath´eodory functions. Step 2: Now we assume that ϕ is bounded below. Without any loss of generality, we may assume that ϕ ≥ 0. Suppose that xn −→ x w w in Lp (Ω, RN ) and un −→ u in Lr (Ω, Rm ) (weakly∗ if r = +∞). Because un −→ u w in Lr (Ω, Rm ) (weakly∗ if r = +∞) and µ is finite, we have that un −→ u in L1 (Ω, Rm ) and so by the Dunford–Pettis theorem the sequence {un }n≥1 ⊆ L1 (Ω, Rm ) is uniformly integrable. So according to the De La Vall´ee–Poussin theorem we can find ϑ : R −→ R+ such that
ϑ(s) lim ϑ(un (ω)Rm )dµ ≤ 1 for all n ≥ 1. = +∞ and s→+∞ s Ω Let ε > 0 and set ϕε (ω, x, u) = ϕ(ω, x, u) + εϑ(uRm ). Because of Step 1, we have
ϕ ω, x(ω), u(ω) dµ ≤ ϕε ω, x(ω), u(ω) dµ Ω Ω
≤ lim inf ϕε ω, xn (ω), un (ω) dµ n→∞
Ω
≤ lim inf ϕ ω, xn (ω), un (ω) dµ + ε. n→∞
Ω
Because ε > 0 was arbitrary, we let ε ↓ 0 to conclude that
ϕ ω, x(ω), u(ω) dµ ≤ lim inf ϕ ω, xn (ω), un (ω) dµ. n→∞
Ω
Ω
Step 3: General case. w Again suppose that xn −→ x in Lp (Ω, RN ) and un −→ u in Lr (Ω, Rm ) (weakly∗ if r = +∞). For every k ≥ 1 we define
ϕk (ω, x, u) = max{ϕ(ω, x, u), −k}, gn (ω) = ϕ− ω, xn (ω), un (ω) and Cn,k = {ω ∈ Ω : gn (ω) > k}. Without any loss of generality we may assume that Iϕ (xn , un ) tends to a finite limit as n → ∞. So by virtue of the hypothesis of the theorem {gn }n≥1 ⊆ L1 (Ω) is relatively weakly compact. Then for every k ≥ 1, because of Step 2, we have Iϕ (x, u) ≤ Iϕk (x, u) ≤ lim inf Iϕk (xn , un ) n→∞
= lim inf Iϕ (xn , un ) + n→∞
gn (ω) − k dµ
Cn,k
≤ lim inf Iϕ (xn , un ) + lim sup n→∞
n→∞
gn (ω) − k dµ.
Cn,k
72
2 Extremal Problems and Optimal Control
The Dunford–Pettis theorem implies that {gn }{xn }n≥1 ≥1 ⊆ L1 (Ω) is uniformly integrable. So if we pass to the limit as k −→ ∞, we conclude that Iϕ (x, u) ≤ lim inf Iϕ (xn , un ). n→∞
COROLLARY 2.1.26 If Ω ⊆ Rk is a bounded domain with Lipschitz boundary and ϕ : Ω×RN ×RN k −→ R+ satisfies (i) ϕ is Borel measurable. (ii) For almost all z ∈ Ω, (x, u) −→ ϕ(z, x, u) is lower semicontinuous. (iii) For almost all z ∈ Ω and all x ∈ RN , u −→ ϕ(z, x, u) is convex,
then the integral functional x −→ Jϕ (x) = Ω ϕ z, x(z), Dx(z) dz is sequentially 1,1 (Ω, RN ). w-lower semicontinuous on Wloc REMARK 2.1.27 This result is optimal when N = 1 (the so-called scalar case), in the sense that the convexity of ϕ(z, x, ·) is a necessary condition for the sequential weak lower semicontinuity of Jϕ (·) on W 1,p (Ω), 1 ≤ p ≤ ∞. In the case N > 1 (the so-called vector case), convex integrands produce only a small subclass of the sequentially weak lower semicontinuous functionals on W 1,p (Ω, RN ) (see Section 2.5). We can have a version of Theorem 2.1.25 for integrands defined on infinitedimensional Banach spaces. The result is due to Balder [53] and a different proof based on Young measures can be found in Hu–Papageorgiou [316, p. 31]. THEOREM 2.1.28 If X is a separable Banach space, Y is a separable reflexive Banach space, and ϕ : Ω×X ×Y −→ R satisfies
(i) ϕ is Σ × B(X) × B(Y ) measurable with B(X) (resp., B(Y )) the Borel σ-field of X (resp., Y ) ; (ii) For µ-almost all ω ∈ Ω, (x, y) −→ ϕ(ω, x, y) is lower semicontinuous; (iii) For µ-almost all ω ∈ Ω and all x ∈ X, y −→ ϕ(ω, x, y) is convex; (iv) There exist M > 0 and ϑ ∈ L1 (Ω) such that for µ−almost all ω ∈ Ω and all (x, y) ∈ X × Y we have
ϕ(ω, x, y) ≥ ϑ(ω) − M xX + yY ,
then (x, u) −→ Iϕ (x, u) = Ω ϕ ω, x(ω), u(ω) dµ is sequentially lower semicontinuous on L1 (Ω, X) × L1 (Ω, Y )w , where by L1 (Ω, Y )w we denote the Lebesgue–Bochner space L1 (Ω, Y ) furnished with the weak topology.
2.2 Constrained Minimization Problems In many applied situations we are not just looking for the minimum of an objective functional on an open set U , but we want to determine the minimum of ϕ subject to certain restrictions on the points x ∈ U . In this section we examine such minimization problems with side conditions and develop the method of Lagrange multipliers.
2.2 Constrained Minimization Problems
73
DEFINITION 2.2.1 Let X, Y be Banach spaces, U ⊆ X and V ⊆ Y nonempty open sets and ϕ : U −→ V a Fr´echet differentiable map. (a) We say that x0 ∈ U is a critical point of ϕ if and only if ϕ (x0 ) ∈ L(X, Y ) is not surjective. (b) We say that x0 ∈ U is a regular point of ϕ if and only if ϕ (x0 ) ∈ L(X, Y ) is surjective. REMARK 2.2.2 If Y = R, then x0 ∈ U is a critical (resp., regular) point of the function ϕ : U −→ R only if ϕ (x0 ) = 0 (resp., ϕ (x0 ) = 0). If X = R, then x0 ∈ (a, b) is a critical point of ϕ if and only if ϕ (x0 ) = 0. EXAMPLE 2.2.3 Let X = H = a Hilbert space, A ∈ L(H, H) is a self-adjoint isomorphism (i.e., A−1 ∈ L(H, H)) and ψ : H −→ R is Fr´echet differentiable. Let ϕ : H −→ R be defined by ϕ(x) =
1 Ax, xH − ψ(x), 2
where by ·, ·H we denote the inner product of H. Evidently ϕ is Fr´echet differentiable and ϕ (x) = Ax − ψ (x). Therefore x0 ∈ H is a critical point of ϕ if and only if x0 = A−1 ψ (x0 ). If ψ(x) = λ 2x2H , λ ∈ R, then ψ (x 0 ) = λx0 and so x0 ∈ H is a critical point of the function ϕ(x) = 1 2 Ax, xH − λ 2x2H if and only if Ax0 = λx0 ; that is, x0 is an eigenvector of the operator A with eigenvalue λ. Next we extend Definition 1.4.1 to nonconvex sets C. DEFINITION 2.2.4 Let X be a Banach space and C ⊆ X nonempty. (a) A vector h ∈ X is said to be tangent to the set C at x0 ∈ C, if there exist ε > 0 and a map r : [0, ε] −→ X such that x0 + λh + r(λ) ∈ C
for all λ ∈ [0, ε]
and
r(λ)X −→ 0 as λ −→ 0+ . λ
(b) The set of all vectors h ∈ X that are tangent to the set C at x0 ∈ C form a closed cone (which is nonempty because it contains the origin) denoted by TC (x0 ). If this cone is a subspace, then it is called the tangent space to the set C at the point x0 ∈ C. We also need the following notion from Banach space theory. DEFINITION 2.2.5 Let X be a Banach space and Y a closed subspace of it. We say that a subspace V is a topological complement of Y if (a) V is closed and (b) Y ∩ V = {0} and Y + V = X. In this case we write X = Y ⊕ V .
74
2 Extremal Problems and Optimal Control
REMARK 2.2.6 A closed subspace Y of X admits a topological complement if and only if there exists a projection operator onto Y ; that is, there exists pY ∈ L(X) such that pY Y = idY . It is easy to see that if Y is finite-dimensional, then it admits
a topological complement. Similarly, if Y has finite codimension (i.e., dim X/Y < +∞), then Y has a topological complement. In a Hilbert space every closed subspace admits a topological complement (consider the orthogonal complement of Y ). In a Banach space that is not isomorphic to a Hilbert space, we can always find a closed subspace which has no topological complement. Now let X, Y be two Banach spaces and ψ : X −→ Y a map. We consider the following constraint set C = {x ∈ X : ψ(x) = 0}. The next theorem produces a very convenient characterization of the tangent space TC (x0 ), x0 ∈ C. The result is known as Ljusternik’s theorem. THEOREM 2.2.7 If X, Y are Banach spaces, U ⊆ X is a nonempty open set, ψ : U −→ Y is continuously Fr´echet differentiable,
C = {x ∈ U : ψ(x) = 0}, and N ψ (x ) = ker ψ (x0 ) has a topological x0 ∈ C is a regular point of ϕ at which 0 complement, then TC (x0 ) = N ψ (x0 ) .
PROOF: Let V = N ψ (x0 ) . This is a closed subspace of X that by hypothesis has a topological complement W ⊆ X. So we can find pV , pW ∈ L(X) such that V = pV (X) = N (pW ), W = pW (X) = N (pV ), p2V = pV , p2W = pW (i.e., they are linear projection operators) and
pV + pW = idX
(i.e., X = V ⊕ W ). Because U ⊆ X is an open set, we can find r > 0 such that x0 + Br (0) + Br (0) ⊆ U
(recall that Br (0) = x ∈ X : xX < r ). Let f : V ∩ Br (0) × W ∩ Br (0) −→ Y be defined by
f (v, w) = ψ(x0 + v + w)
for all v ∈ V ∩ Br (0) and all w ∈ W ∩ Br (0).
The function f has the following properties. f (0, 0) = ψ(x0 ) = 0 and and
with f ∈ C (V × W, Y ) f2 (0, 0) = ψ (x0 ) W ∈ L(W, Y ). 1
f1 (0, 0)
= ψ (x0 )V = 0
(2.5)
(2.6)
Because f2 (0, 0) ∈ L(W, Y ) is bijective, from Banach’s theorem we know that f2 (0, 0)−1 ∈ L(Y, W ). These properties of f permit the use of the implicit function theorem (see Theorem 1.1.23), which gives a 0 < δ < r and a uniquely determined continuously Fr´echet differentiable g : V ∩ Bδ (0) −→ W such that
2.2 Constrained Minimization Problems
f v, g(v) = 0 and
g(0) = 0, g (0) =
for all v ∈ V ∩ Bδ (0) f2 (0, 0)−1 f1 (0, 0).
75 (2.7) (2.8)
From (2.6) and (2.8), we have that g (0) = 0 and so lim
v→0
g(v)Y = 0. vX
(2.9)
If we define ξ : x0 + V ∩ Bδ (0) −→ X by ξ(x0 + v) = x0 + v + g(v), then clearly ξ is continuous. Moreover, from (2.7) we have
0 = f v, g(v) = ψ x0 + v + g(v) , hence ξ has values in C. Note that v, g(v) are in complementary subspaces of X. Hence ξ isinjective and so we can consider its inverse on D = x0 + v + g(v) : v ∈ V ∩ Bδ (0) ⊆ C. So
ξ −1 x0 + v + g(v) = x0 + v = x0 + pV v + g(v) , ⇒ ξ −1 is continuous too. Therefore ξ is a homeomorphism of U = x0 + V ∩ Bδ (0) onto D ⊆ C. This together with (2.9) imply that TC (x0 ) = N ψ (x0 ) .
REMARK 2.2.8 If every x0 ∈ C is a regular point and N ψ (x0 ) admits a topological complement, then C = {x ∈ X : ψ(x) = 0} is a C 1 -manifold. If in addition ψ ∈ C r (U, Y ), then C is a C r -manifold. Note that the rather technical hypothesis that N ψ (x0 ) admits a topological complement is automatically satisfied in the following three cases. (a) Y is finite-dimensional. (b) X = H = a Hilbert space. (c) For all x ∈ U ϕ (x) ∈ L(X, Y ) is a Fredholm operator. Cases (a) and (b) follow from Remark 2.2.6, and Case (c) is considered in Section 3.1. COROLLARY 2.2.9 If X, Y, Z are Banach spaces, U ⊆ X is nonempty open, ψ ∈ C 1 (U, Y ), C = {x ∈ U : ψ(x) = 0}, x0 ∈ C is a regular point of ϕ at which N ψ (x0 ) admits a topological complement, and ϕ : U −→ Z is Fr´echet differentiable at x0 , then there exists a neighborhood U0 of the origin in TC (x0 ), a neighborhood D0 of x0 in C, and a continuously Fr´ echet differentiable homeomorphism
g of U0 onto D0 such that ϕ g(u) = ϕ(x0 ) + ϕ (x0 )u + o(uX ) with o(uX ) uX −→ 0 as xX −→ 0. Using Theorem 2.2.7, we can produce necessary conditions for the existence of solutions for a constrained minimization problem. This theorem is the first result establishing the well-known method of Lagrange multipliers.
76
2 Extremal Problems and Optimal Control
THEOREM 2.2.10 If X, Y are Banach spaces, U ⊆ X is a nonempty open set, ψ ∈ C 1 (U, Y ), ϕ : U −→ R is Fr´echet C = {x ∈ U : ψ(x) = 0}, x0 ∈ C
differentiable, is a regular point of ψ at which N ψ (x0 ) admits a topological complement, and x0 is a local minimizer of ϕ on the constraint set C, then there exists y0∗ ∈ Y ∗ such that ϕ (x0 ) = y0∗ ◦ ψ (x0 ).
PROOF: Let V = N ψ (x0 ) and let W be its topological complement (it exists by hypothesis). Because x0 ∈ C is a regular point of ψ, K = ψ (x0 ) ∈ L(W, Y ) W
is an isomorphism (i.e., K −1 ∈ L(Y, W ) by Banach’s theorem). According to Theorem 2.2.7 we can find D0 a neighborhood of x0 in C such that for every x0 ∈ D0 , we have
x = x0 + u + g(u) for all u ∈ V ∩ Bδ (0), V = N ψ (x0 )
with g(u)X uX −→ 0 as u −→ 0 in X. Because x0 is a local minimizer of ϕ on C, we can find 0 < δ1 ≤ δ such that
ϕ(x0 ) ≤ ϕ x0 + u + g(u) for all u ∈ V ∩ Bδ (0), for all u ∈ V ∩ Bδ1 (0), ⇒ 0 ≤ ϕ (x0 ), u + g(u) X + ox0 (u + g(u)X ) ⇒ ϕ (x0 ), u X = 0 for all u ∈ V ∩ Bδ1 (0) (recall g is a homeomorphism),
(2.10) ⇒ V ⊆ N ϕ (x0 ) = ker ϕ (x0 ). Let pW ∈ L(X) be the canonical projection on W , the topological complement of V . Because of (2.10) we can define ϕ (x0 ) ∈ W ∗ by for all x ∈ X. ϕ (x0 ), pW x W = ϕ (x0 ), x X Then y0∗ = ϕ (x0 ) ◦ K −1 ∈ Y ∗ . If pV ∈ L(X) is the canonical projection of X onto V , then for every x ∈ X we have x = pV x + pW x and so ∗ y0 ◦ ψ (x0 ), x X = y0∗ ◦ ψ (x0 ), pW x X = y0∗ ◦ K, pW xX = ϕ (x0 ), pW x X = ϕ (x0 ), x X
⇒ y0∗ ◦ ψ (x0 ) = ϕ (x0 )
in X ∗ .
REMARK 2.2.11 According to Theorem 2.2.10, x0 ∈ C is a critical point of the function L(x) = ϕ(x) − (y0∗ ◦ ψ)(x), known as the Lagrangian function of the constrained minimization problem inf ϕ. Also the element y ∗ ∈ Y ∗ is a Lagrange C
multiplier . COROLLARY 2.2.12 If U ⊆ RN is a nonempty open set, ϕ : U −→ R is Fr´echet differentiable, ψ ∈ C 1 (U, Rm ), C = {x ∈ U : ψ(x) = 0}, x0 ∈ C is a regular point
2.2 Constrained Minimization Problems
77
m of ψ, and it is also a local minimizer of ϕ on C, then we can find λ = (λk )m k=1 ∈ R such that m ∂ϕ ∂ψ (x0 ) = λk (x0 ) for all i = 1, . . . , N. ∂xi ∂xi k=1
EXAMPLE 2.2.13 Let X = H a Hilbert space and A ∈ L(H) a self-adjoint operator. Let ϕ : H −→ R be defined by ϕ(x) = Ax, xH . Also let ψ : H −→ R+ be defined by ψ(x) = x2H − 1. Suppose that x0 ∈ H, x0 H = 1 is a minimizer of ϕ on ∂B(0) = {x ∈ H : ψ(x) = 0}. According to Theorem 2.2.10 (with Y = R), we can find λ ∈ R such that ϕ (x0 ) = λψ (x0 ), hence 2A(x0 ) = 2λx0 and so A(x0 ) = λx0 . In other words x0 ∈ H is an eigenvector of A for the eigenvalue λ. This example shows how we can establish the existence of eigenvalues for bounded self-adjoint linear operators on a Hilbert space. Now we want to improve Theorem 2.2.10 by weakening the hypotheses on the constraint function ψ. To do this we need the following generalization of Ljusternik’s theorem (see Theorem 2.2.7) due to Ioffe–Tichomirov [327, p. 34], where the interested reader can find its proof. THEOREM 2.2.14 If X, Y are Banach spaces, U ⊆ X is a nonempty open set, ψ : U −→ R is Fr´echet differentiable, C = {x ∈ U : ψ(x)
= 0} and x0 ∈ C is a regular point of ψ (i.e., ψ (x0 )(X) = Y ), then TC (x0 ) = N ψ (x0 ) . REMARK 2.2.15 Note
that compared to Theorem 2.2.7, we have dropped the splitting property for N ψ (x0 ) . We also need the following general result from operator theory, which underlines the idea of the Lagrange multiplier method. PROPOSITION 2.2.16 If X, Y are Banach spaces, A ∈ L(X, Y ), x∗0 ∈ X ∗ , R(A) is closed and N (A) ⊆ N (x∗0 ), then there exists y0∗ ∈ Y ∗ such that x∗0 + y0∗ ◦ A = 0. Moreover, if A(X) = Y , then y0∗ is unique. PROOF: We know that R(A∗ ) = N (A)⊥ = x∗ ∈ X ∗ : x∗ , xX = 0 for all x ∈ N (A) . By hypothesis x∗0 ∈ N (A)⊥ . So it follows that x∗0 = −A∗ y0∗ for some y0∗ ∈ Y ∗ . Therefore (2.11) x∗0 + y0∗ ◦ A = 0. If R(A) = Y , then N (A∗ ) = R(A)⊥ = y ∗ ∈ Y ∗ : y ∗ , yY = 0 for all y ∈ R(A) = {0}. So A∗ is injective and by (2.11) this means that y0∗ is uniquely determined by x∗0 . COROLLARY 2.2.17 If X, Y are Banach spaces, A ∈ L(X, Y ), x∗0 ∈ X ∗ , R(A) is closed, and R(A) = Y , then there exists y0∗ ∈ Y ∗ , y0∗ = 0 such that y0∗ ◦ A = 0. PROOF: Let y ∈ Y such that y ∈ / R(A). Then we can find y0∗ ∈ Y ∗ with y0∗ Y ∗ = 1 such that y0∗ , yY = 0
and
y0∗ , uY = 0
for all u ∈ R(A).
78
2 Extremal Problems and Optimal Control Therefore it follows that y0∗ = 0 and y0∗ ◦ A = 0.
We are led to the following generalization of Theorem 2.2.10. THEOREM 2.2.18 If X, Y are Banach spaces, U ⊆ X is a nonempty open set, 1 ϕ : U −→ R Fr´
is echet differentiable, ψ ∈ C (U, Y ), C = {x ∈ U : ψ(x) = 0}, x0 ∈ C, R ψ (x0 ) is closed, and x0 ∈ C is a local minimizer of ϕ on C, then there exist λ0 ∈ R and y0∗ ∈ Y ∗ not both equal to zero such that λ0 ϕ (x0 ) = y0∗ ◦ ψ (x0 ).
(2.12)
PROOF: In the degenerate case R ψ (x0 ) = Y , (2.12) is true with λ0 = 0 by virtue of Corollary 2.2.17.
If R ψ (x0 ) =Y , then provided that N ψ (x0 ) admits a topological complement, the validity of (2.12) with λ0 =1 is a consequence
of Theorem 2.2.10. Finally, if we do not have the splitting of N ψ (x0 ) , then the result follows if we argue as in the proof of Theorem 2.2.10 using this time Theorem 2.2.14. Theorems 2.2.10 and 2.2.18 indicate that there is a close relation between Lagrange multipliers and constrained critical points of a function ϕ. DEFINITION 2.2.19 Let X be a Banach space, U ⊆ X nonempty open, ϕ : U −→ R a Fr´echet differentiable map, C ⊆ X a nonempty closed set and x0 ∈ C. We say that x0 is a critical point of ϕ subject to the constraint C, if for all curves u : (−ε, ε) −→ X such that u(t) ∈ C for all t ∈ (−ε, ε), u(0) = x0 , u (0) exists, we have d
= 0. ϕ u(t) dt t=0 REMARK 2.2.20 If x0 ∈ int C (the interior taken in X), then x0 is a usual critical point of ϕ (also known as the free critical point of ϕ). A critical point that is not a local extremum of ϕ (i.e., it is not a local minimizer or a local maximizer of ϕ), is called a saddle point. So x0 ∈ C is a saddle point of ϕ subject to the constraint C, if for every U ∈ N (x0 ) = filter of neighborhoods of x0 , we can find y, v ∈ C ∩ U such that ϕ(y) < ϕ(x0 ) < ϕ(v). The next theorem establishes the connection between constrained critical points and Lagrange multipliers. THEOREM 2.2.21 If X, Y are Banach spaces, U ⊆ X is nonempty open, ϕ : U −→ R is Fr´echet differentiable, ψ ∈ C 1 (U, Y ), C = {x ∈ X : ψ(x) = 0}, and x0 ∈ C is a regular point of ϕ at which N ϕ (x0 ) admits a topological complement, then x0 is a critical point of ϕ subject to the constraint C if and only if we can find y0∗ ∈ Y ∗ such that ϕ (x0 ) = y0∗ ◦ ψ (x0 ). PROOF:
⇒: From Definition 2.2.19 it follows that ϕ
(x0 ),hX = 0 for all h ∈ N ψ (x0 ) . But from Theorem 2.2.10 we have that N ψ (x0 ) = TC (x0 ). Invoking Proposition 2.2.16, we can find y0∗ ∈ Y ∗ such that ϕ (x0 ) = y0∗ ◦ ψ (x0 ).
2.3 Saddle Points and Duality
79
⇐: Let u : (−ε, ε) −→ X be a curve as in Definition 2.2.19. Then ψ u(t) = 0 for all t ∈ (−ε, ε) and ψ (x0 )u (0) = 0. It follows that ϕ (x0 ), u (0)X = 0, hence
= 0 (by the chain rule). So x0 ∈ C is a critical point of ϕ subject (d dt) ϕ u(t) t=0
to the constraint C.
We conclude this section with the so-called Dubovickii–Milyutin theorem, which is crucial for the development of the Dubovickii–Milyutin formalism for the analysis of constrained optimization problems. For the proof we refer to Girsanov [266, p. 37]. n+1 THEOREM 2.2.22 If X is a Banach space, Km m=1 are nonempty convex n+1 n cones in X, and Km m=1 are open, then Km = ∅ if and only if we can find m=1 ∗ x∗m ∈ Km = x∗ ∈X ∗ : x∗ , xX ≥ 0 for all x ∈ Km , m = 1, . . . , n + 1, not all zero, n+1 ∗ xm=0. such that m=1
2.3 Saddle Points and Duality Recall (see Remark 2.2.20), that a saddle point is a critical point of a function that is neither a local minimum nor local maximum. In this section we define a saddle point of a function on a product space C × D. This new concept that we introduce is independent of the notion introduced in the previous section and it is global in nature. DEFINITION 2.3.1 Let C, D be two nonempty sets and ϕ : C × D −→ R a function. We say that (x0 , y0 ) is a saddle point of ϕ, if we have ϕ(x0 , y) ≤ ϕ(x0 , y0 ) ≤ ϕ(x, y0 )
for all (x, y) ∈ C × D.
REMARK 2.3.2 The terminology of Definition 2.3.1 is justified by picturing the function ϕ(x, y) = x2 − y 2 in R3 (a hyperbolic paraboloid). For this function (0, 0) is a saddle point. Note that we always have sup inf ϕ(x, y) ≤ inf sup ϕ(x, y).
y∈D x∈C
x∈C y∈D
(2.13)
If equality holds in (2.13), then the common value is called the saddle value of ϕ on C ×D. DEFINITION 2.3.3 Let C, D be two nonempty sets and ϕ : C ×D −→ R a function. We say that ϕ satisfies a minimax equality on C × D, if the following three conditions hold. (a) ϕ has a saddle value (i.e., equality holds in (2.13)).
80
2 Extremal Problems and Optimal Control
(b) There is x0 ∈ C such that sup ϕ(x0 , y) = inf sup ϕ(x, y). x∈C y∈D
y∈D
(c) There is y0 ∈ D such that inf ϕ(x, y0 ) = sup inf ϕ(x, y). x∈C
y∈D x∈C
REMARK 2.3.4 In this case the inf and sup operations can be replaced by min and max, respectively, and we can write that max min ϕ(x, y) = min max ϕ(x, y). y∈D x∈C
x∈C y∈D
This is the reason for the terminology minimax equality. The following proposition is an immediate consequence of Definitions 2.3.1 and 2.3.3. PROPOSITION 2.3.5 If C, D are nonempty sets and ϕ : C×D −→ R, then ϕ has a saddle point in C × D if and only if ϕ satisfies a minimax equality on C ×D. DEFINITION 2.3.6 Let X be a vector space and B ⊆ X a nonempty set. A multifunction (set-valued function) F : B −→ 2X \ {∅} is said to be a Knaster– Kuratowski–Mazurkiewicz map (a KKM-map for short), if for every finite set m xk k=1 m ! m conv xk k=1 ⊆ F (xk ). k=1
The basic property of KKM-maps is the following. THEOREM 2.3.7 If X is a Hausdorff topological vector space, B ⊆ X is a X nonempty set, and F : B −→ 2 \{∅} is a KKM-map with closed values, then the family F (x) x∈B of sets has the finite intersection property; that is, the intersection of each finite subfamily is nonempty. PROOF: We argue indirectly. So suppose that
m k=1
m F (xk )=∅. Let C=conv xk k=1
and consider the function ϑ : C−→R+ defined by ϑ(u)=
m
d u, F (xk ) . Evidently k=1
ϑ(u) > 0 for all u ∈ C and so we can define the continuous map h : C −→ C by h(u) =
m 1
d u, F (xk ) xk . ϑ(u)
(2.14)
k=1
By Brouwer’s theorem (see Theorem 3.5.3), we can find u0 ∈ C such that h(u0 ) = u0 .
/ F (xk ). On the Let K = k ∈ {1, . . . , m} : d u0 , F (xk ) = 0 . Then u0 ∈
k∈K
other hand
u0 = h(u0 ) ∈ conv xk
k∈K
⊆
!
F (xk ),
k∈K
(see (2.14) and recall that F is a KKM-map). So we have a contradiction, which finishes the proof.
2.3 Saddle Points and Duality
81
REMARK 2.3.8 The hypotheses of this theorem can be weakened in the following way. We can drop the requirement that F has closed values and only assume that each F (x) is finitely closed. Namely, if V is a finite-dimensional flat in X, then V ∩ F (x) is closed in the Euclidean topology of V . Evidently in this case we need only assume that X is a vector space. The finitely closed sets define a topology on X, known as the finite topology. It is stronger than any Hausdorff linear topology on X. COROLLARY 2.3.9 If X is a Hausdorff topological vector space, B ⊆ X is a nonempty set, andF : B −→ 2X \{∅} is a KKM-map with closed values one of which is compact, then F (x) = ∅. x∈B
Using this corollary we can prove the following useful coincidence theorem for set-valued maps. PROPOSITION 2.3.10 If X, Y are Hausdorff topological vector spaces, C ⊆ X and D ⊆ Y are nonempty compact and convex sets, and F, G : C −→ 2D are two multifunctions such that (i) F (x) is open in D and G(x) is nonempty convex for every x ∈ C. (ii) G−1 (y) = x ∈ C : y ∈ G(x) is open in C and F −1 (y) = x ∈ C : y ∈ F (x) is convex for every y ∈ D, then we can find x0 ∈ C such that F (x0 ) ∩ G(x0 ) = ∅. PROOF: Let E = C ×D and let H : C ×D −→ 2X×Y be defined by
c H(x, y) = E ∩ G−1 (y) × F (x) . Because of hypotheses (i) and (ii), for every (x, y) ∈ E the set H(x, y) is closed in E, hence compact. Also given any (x0 , y0 ) ∈ E, choose (x, y) ∈ F −1 (y0 ) × G(x0 ) (by hypotheses (i) and (ii), F −1 (y0 ) × G(x0 ) = ∅). Hence (x0 , y0 ) ∈ G−1 (y) × F (x) and so we infer that ! −1 E= (2.15) G (y) × F (x) . (x,y)∈E
From (2.15) and the definition of the multifunction H, it follows that # H(x, y) = ∅.
(2.16)
(x,y)∈E
Because of (2.16) H cannot be a KKM-map. So according to Definition 2.3.6, we m ⊆ E such that can find elements (xk , yk ) k=1
m conv (xk , yk )
k=1
⇒ v=
m k=1
∈ /
λk (xk , yk ) ∈ /
m !
H(xk , yk )
k=1 m !
H(xk , yk )
k=1
with λk ≥ 0,
m k=1
λk = 1.
82
E\
2 Extremal Problems and Optimal Control Note that due to the convexity of E = C × D we have v ∈ E and so v ∈ m m H(xk , yk ) = G−1 (yk ) ∩ F (xk ). Hence k=1 m
k=1
λk xk ∈ G−1 (yk )
m
and
k=1
λk yk ∈ F (xk )
m
⇒ yk ∈ G
λk xk
and
xk ∈ F −1
m
k=1 m
⇒
k=1 m
⇒
for all k = 1, . . . , m,
k=1
for all k = 1, . . . , m,
k=1 m
λk yk ∈ G
λk xk
m
and
k=1 m
λk yk ∈ G
k=1
λk yk
k=1 m
λk xk
and
k=1
So, if we set x0 =
m
λk xk ∈ F −1
k=1
m
λk yk ,
k=1
λk yk ∈ F
k=1
λk xk and y0 =
m
m
λk xk .
k=1
λk yk , we see that y0 ∈ F (x0 ) ∩ G(x0 ) = ∅.
k=1
Using this proposition we can prove a basic minimax theorem. First we have a definition. DEFINITION 2.3.11 Let V be a vector space, B ⊆ V a nonempty convex set, and ψ : B −→ R. We say that ψ is quasiconvex (resp., quasiconcave), if for all λ ∈ R the set {x ∈ B : ψ(x) ≤ λ} (resp., the set {x ∈ B : ψ(x) ≥ λ}) is convex in B. REMARK 2.3.12 Evidently a convex (resp., concave) function is quasiconvex (resp., quasiconcave). The converse is not in general true. Consider, for example, the function x −→ ln(|x| + 1) which is quasiconvex, but not convex. THEOREM 2.3.13 If X, Y are Hausdorff topological vector spaces, C ⊆ X and D ⊆ Y are nonempty, compact, and convex sets, and ϕ : C ×D −→ R satisfies (i) For every y ∈ D, x −→ ϕ(x, y) is lower semicontinuous and quasiconvex. (ii) For every x ∈ C, y −→ ϕ(x, y) is upper semicontinuous and quasiconcave, then ϕ has a saddle point on C × D. PROOF: By virtue of Proposition 2.3.5 it suffices to show that ϕ satisfies a minimax equality on C × D, namely that min max ϕ(x, y) = max min ϕ(x, y). x∈C y∈D
y∈D x∈C
(2.17)
Because of the upper semicontinuity of ϕ(x, ·) and the compactness of D, max ϕ(x, y) exists for every x ∈ C (see Theorem 2.1.10). Also if h1 (x) = y∈D
max ϕ(x, y), then we claim that x −→ h1 (x) is lower semicontinuous. Indeed let y∈D
xα −→ x in C and suppose h1 (xα ) ≤ λ for all α ∈ J. We have ϕ(xα , y) ≤ λ for all α ∈ J and all y ∈ D. Because ϕ(·, y) is lower semicontinuous, we have
2.3 Saddle Points and Duality
83
ϕ(x, y) ≤ lim inf ϕ(xα , y) ≤ λ for all y ∈ D, hence h1 (x) ≤ λ and this by α∈J
virtue of Proposition 2.1.3(b) implies that h1 (·) is lower semicontinuous. Therefore min h1 (x) = min max ϕ(x, y) exists. Similarly we show that max min ϕ(x, y) x∈C
x∈C y∈D
y∈D x∈C
exists. We know that max min ϕ(x, y) ≤ min max ϕ(x, y) y∈D x∈C
x∈C y∈D
(see (2.13)).
(2.18)
We show that in (2.18) we cannot have strict inequality. We proceed by contradiction. Suppose we can find λ ∈ R such that max min ϕ(x, y) < λ < min max ϕ(x, y). y∈D x∈C
x∈C y∈D
(2.19)
We introduce the multifunctions F, G : C −→ 2D defined by F (x) = y ∈ D : ϕ(x, y) < λ and G(x) = y ∈ D : ϕ(x, y) > λ . Note that because of hypothesis (ii) for each x ∈ C, F (x) is open in D and G(x) is convex and nonempty (see (2.19)). Also G−1 (y) = x ∈ C : ϕ(x, y) > λ is open in C due to hypothesis (i), whereas F −1 (y) = x ∈ C : ϕ(x, y) < λ is convex again due to hypothesis (i). So we can apply Proposition 2.3.10 and produce a point (x0 , y0 ) ∈ C × D such that y0 ∈ F (x0 ) ∩ G(x0 ). But then λ < ϕ(x0 , y0 ) < λ, a contradiction. This proves that (2.17) holds and so ϕ admits a saddle point.
Another saddle point theorem useful in applications is the following. THEOREM 2.3.14 If X, Y are reflexive Banach spaces, C ⊆ X and D ⊆ Y are nonempty, closed, and convex sets, and ϕ : C ×D −→ R is a function such that (i) For every y ∈ D, x −→ ϕ(x, y) is convex and lower semicontinuous. (ii) For every x ∈ C, y −→ ϕ(x, y) is concave and upper semicontinuous. (iii) C is bounded or there exists y0 ∈ D such that ϕ(x, y0 ) −→ +∞ as xX −→ +∞. (iv) D is bounded or there exists x0 ∈ C such that ϕ(x0 , y) −→ −∞ as yY −→ +∞, then ϕ has a saddle point on C ×D. PROOF: Due to the reflexivity of X and Y , if C ⊆ X and D ⊆ Y are bounded, they are w-compact. Also due to convexity the functions x −→ ϕ(x, y) and y −→ −ϕ(x, y) are weakly lower semicontinuous. So in this case the result follows from Theorem 2.3.13. So suppose that at least one of the sets C ⊆ X and D ⊆ Y is unbounded. For every n ≥ 1 set Cn = x ∈ C : xX ≤ n and Dn = y ∈ D : yY ≤ n . For n ≥ 1 large Cn = ∅ and Dn = ∅. Then from the bounded case we know that we can find (xn , yn ) ∈ Cn × Dn such that
84
2 Extremal Problems and Optimal Control ϕ(xn , y) ≤ ϕ(xn , yn ) ≤ ϕ(x, yn )
for all (x, y) ∈ Cn × Dn , n ≥ 1.
(2.20)
Let x = x0 and y = y0 (see hypotheses (iii) and (iv)). Using those hypotheses, from (2.20) we infer that {xn }n≥1 ⊆ X, {yn }n≥1 ⊆ Y , and {ϕ(xn , yn )}n≥1 ⊆ R are all bounded. So passing to a subsequence if necessary, we may assume that w
w
xn −→ x0 in X,
yn −→ y0 in Y
and
ϕ(xn , yn ) −→ ξ ∈ R.
Evidently (x0 , y0 ) ∈ C × D. Also because of hypotheses (i) and (ii) we have ϕ(x0 , y) ≤ lim inf ϕ(xn , y) ≤ ξ ≤ lim sup ϕ(x, yn ) ≤ ϕ(x, y0 ) n→∞
n→∞
for all (x, y) ∈ C × D, ⇒ ϕ(x0 , y) ≤ ϕ(x0 , y0 ) ≤ ϕ(x, y0 ), that is, (x0 , y0 ) ∈ C × D is a saddle point of ϕ. REMARK 2.3.15 Functions ϕ(x, y) such as those in Theorems 2.3.13 and 2.3.14 that are convex in x ∈ C and concave in y ∈ D, are usually called saddle functions (or convex–concave functions). Next we derive a duality theory for convex optimization. Saddle functions are helpful in this respect. The mathematical setting is the following. We are given two Banach spaces X, Y and a convex function ϕ : X ×Y −→ R = R ∪ {+∞}. We know that (X × Y )∗ = X ∗ × Y ∗ and for the duality brackets we have (x∗ , y ∗ ), (x, y)X×Y = x∗ , xX + y ∗ , yY , for all x ∈ X, x∗ ∈ X ∗ , y ∈ Y , y ∗ ∈ Y ∗ . We can think of y ∈ Y as a perturbation and ϕ(x, y) as a perturbed functional with ϕ(x, 0) as the original unperturbed functional. Then the primal problem is: (P) : inf ϕ(x, 0).
(2.21)
x∈X
We also consider the value function m : Y −→ R∗ of the perturbed problem m(y) = inf ϕ(x, y).
(2.22)
x∈X
Clearly m(·) is convex. We have m∗ (y ∗ ) = sup y ∗ , yY − inf ϕ(x, y) y∈Y
x∈X
(see (2.22))
= sup 0, xX + y ∗ , yY − ϕ(x, y) = ϕ∗ (0, y ∗ ).
(2.23)
(x,y)∈X×Y
Then the dual problem associated to (P) (see (2.21)), is defined by
(D) : sup − ϕ∗ (0, y ∗ ) . y ∗ ∈Y ∗
PROPOSITION 2.3.16 We always have sup (D) ≤ inf (P) (weak duality).
(2.24)
2.3 Saddle Points and Duality
85
PROOF: For all x ∈ X and all y ∗ ∈ Y ∗ , by the Young–Fenchel inequality (see Proposition 1.2.18), we have ϕ(x, 0) + ϕ∗ (0, y ∗ ) ≥ 0, xX + y ∗ , 0Y = 0 ⇒ inf (P) ≥ sup (D). In the next proposition we provide conditions for strong duality to hold (i.e., to have equality of primal and dual problems). PROPOSITION 2.3.17 If ∂m(0) = ∅ and y ∗ ∈ ∂m(0), then y ∗ is a solution of (D) and inf (P) = max (D). PROOF: Because ∂m(0) = ∅, we have m(0) = inf (P) ∈ R and for all y ∗ ∈ Y ∗ , m∗ (y ∗ ) ≥ −m(0) > −∞. From Proposition 1.2.31, we have inf (P) + m∗ (y ∗ ) = m(0) + m∗ (y ∗ ) = y ∗ , 0Y = 0, ⇒ sup (D) = inf (P)
(see (2.23), (2.24), and Proposition 2.3.16).
In order to analyze further the strong duality situation, we need the following lemma. LEMMA 2.3.18 If V is a Banach space, f : V −→ R∗ is a convex function, and there exist (v0 , λ0 ) ∈ V × R such that f (v0 ) ∈ R and (v0 , λ0 ) ∈ int epi f , then f (v) > −∞ for all v ∈ V . PROOF: Let µ0 < f (v0 ). Then (v0 , µ0 ) ∈ / epi f and so by the separation theorem for convex sets we can find (v ∗ , t) ∈ V ∗ × R, (v ∗ , t) = (0, 0) such that v ∗ , v0 V + tµ0 ≤ v ∗ , vV + tλ
for all (v, λ) ∈ epi f.
(2.25)
Because λ can increase up to +∞, from (2.25) it follows that t ≥ 0. If t = 0, then v ∗ , v0 V ≤ v ∗ , vV
for all v ∈ dom f.
(2.26)
But int dom f = ∅ (see Theorem 1.2.3(d)). So from (2.26) we infer that v ∗ = 0, a contradiction to the fact that (v ∗ , t) = (0, 0). Hence t > 0 and we may assume that t = 1. We have v ∗ , v0 − vV + µ0 ≤ λ ⇒ v ∗ , v0 − vV + µ0 ≤ f (v)
for all (v, λ) ∈ epi f, for all v ∈ V (i.e., f (v) > −∞
for all v ∈ V ).
Using this auxiliary result we can have a theorem on the duality of problems (P) and (D). THEOREM 2.3.19 If there exists x0 ∈ X such that ϕ(x0 , ·) is finite and continuous at y = 0 and inf (P) ∈ R, then (a) m is continuous at y = 0.
86
2 Extremal Problems and Optimal Control
(b) y ∗ ∈ ∂m(0) if and only if y ∗ ∈ Y ∗ is a solution of the dual problem (D). (c) inf (P) = max (D) ∈ R (strong duality). PROOF: We can find r > 0 and M > 0 such that ϕ(x0 , y) ≤ M ⇒ m(y) ≤ M
for all y ∈ B r (0), for all y ∈ B r (0).
Then from Theorem 1.2.3 we have that m is continuous at y = 0 and (0, λ) ∈ int epi m for all λ > M . Because m(0) = inf (P) ∈ R, from Lemma 2.3.18 we infer that −∞ < m(y) for all y ∈ Y , hence m is a proper convex function continuous at y = 0. By virtue of Theorem 1.2.34 we have that ∂m(0) = ∅. Invoking Proposition 2.3.17, we know that every y ∗ ∈ ∂m(0) is a solution of (D) and inf (P) = max (P). Finally, if y ∗ ∈ Y ∗ is a solution of (D), we have m∗ (y ∗ ) ≤ m∗ (u∗ )
for all u∗ ∈ Y ∗ .
(2.27)
Because m is continuous at y = 0, using Proposition 1.2.24 (with ϕ = m and ψ = i{0} ) we obtain m(0) = sup u∗ , 0Y − m∗ (u∗ ) ≤ −m∗ (y ∗ ) (see (2.27)), u∗ ∈Y ∗
⇒ m(0) + m∗ (y ∗ ) ≤ 0
(i.e., y ∗ ∈ ∂m(0); see Proposition 1.2.31).
REMARK 2.3.20 In the above theorem, the hypothesis that inf (P) ∈ R is important and cannot be dropped. To see this consider the case where X = Y = R; let C(y) = {x ∈ R : x ≤ y} and ϕ(x, y) = x + iC(y) (x). Then for every x < 0, ϕ(x, ·) is continuous at 0, but m ≡ −∞ and so m∗ ≡ +∞. DEFINITION 2.3.21 The Lagrangian function corresponding to the dual pair of problems {(P),(D)}, is the function L : X ×Y ∗ −→ R∗ defined by L(x, y ∗ ) = inf ϕ(x, y) − y ∗ , yY : y ∈ Y for all (x, y ∗ ) ∈ X × Y ∗ . REMARK 2.3.22 Evidently inf L(x, y) = −ϕ∗ (0, y ∗ ) and L is a saddle function. x∈X
EXAMPLE 2.3.23 Consider the mathematical programming situation. Namely let (P) : inf [f (x) : fk (x) ≤ 0 for all k = 1, . . . , m], x∈X
with f, fk : X −→ R, k = 1, . . . , m, convex functions. Then ϕ : X × Rm −→ R is defined by ϕ(x, y) = f (x) + iC(y) (x)
m for all x ∈ X, y = (yk )m k=1 ∈ R ,
with C(y) = {x ∈ X : fk (x) ≤ yk for all k = 1, . . . , m}. Therefore ∗ f (x) − m if y ∗ ∈ −Rm + ∗ k=1 fk (x)yk L(x, y ) = , −∞ if y ∗ ∈ / −Rm + m for all x ∈ X, y ∗ = (yk∗ )m k=1 ∈ R .
2.3 Saddle Points and Duality
87
PROPOSITION 2.3.24 If ϕ ∈ Γ0 (X × Y ), then ϕ(x, 0) = sup L(x, y ∗ ). y ∗ ∈Y ∗
PROOF: Because of Theorem 1.2.21, we have
∗ ϕ(x, 0) = sup y ∗ , 0Y − ϕ(x, ·) (y ∗ ) : y ∗ ∈ Y ∗ = sup L(x, y ∗ ). y ∗ ∈Y ∗
We can characterize the situation of strong duality via the saddle points of the Lagrangian. THEOREM 2.3.25 If ϕ ∈ Γ0 (X×Y ) and L is the corresponding Lagrangian function, then the following statements are equivalent. (a) (x0 , y0∗ ) ∈ X × Y ∗ is a saddle point of L. (b) x0 is a solution of (P), y0∗ is a solution of (D) and min(P)= max(D). (c) ϕ(x0 , 0) = −ϕ∗ (0, y0∗ ). PROOF: (a)⇒(b),(c): We have L(x0 , y0∗ ) = inf L(x, y0∗ ) = −ϕ∗ (0, y0∗ )
(see Remark 2.3.22)
L(x0 , y0∗ )
(see Proposition 2.3.24).
x∈X
and
∗
= sup L(x0 , y ) = ϕ(x0 , 0) y ∗ ∈Y ∗
(2.28)
(2.29) So from (2.28) and (2.29), we have inf (P) ≤ ϕ(x0 , 0) = −ϕ∗ (0, y0∗ ) ≤ inf (D).
(2.30)
Combining (2.30) with Proposition 2.3.16, we conclude that min (P) = max (D) = ϕ(x0 , 0) = −ϕ∗ (0, y0∗ ).
(b)⇒(a), (c): We have ϕ(x0 , 0) = min (P),
−ϕ∗ (0, y0∗ ) = max (D)
and
ϕ(x0 , 0) = −ϕ∗ (0, y0∗ ). (2.31)
Note that ϕ(x0 , 0) = sup L(x0 , y ∗ ) ≥ L(x0 , y ∗ ) y ∗ ∈Y ∗
(see Proposition 2.3.24) (2.32)
and
−ϕ
∗
(0, y0∗ )
= inf
x∈X
L(x, y0∗ )
≤
L(x, y0∗ )
(see Remark 2.3.22). (2.33)
From (2.31) through (2.33) it follows that (x0 , y0∗ ) ∈ X × Y ∗ is a saddle point of the Lagrangian. (c)⇒(a), (b): We have
88
2 Extremal Problems and Optimal Control inf (P) ≤ ϕ(x0 , 0) = −ϕ∗ (0, y0∗ ) ≤ sup (D), ⇒ inf (P) = sup (D) = ϕ(x0 , 0) = −ϕ∗ (0, y0∗ )
(see Proposition 2.3.16).
Next we consider an important special case of the above general duality theory. So let f ∈ Γ0 (X), g ∈ Γ0 (Y ), and A ∈ L(X, Y ). The primal problem is:
(2.34) (P) : inf[f (x) + g A(x) : x ∈ X]. The convex perturbation functional ϕ : X ×Y −→ R = R ∪ {+∞} is given by
ϕ(x, y) = f (x) + g A(x) + y for all (x, y) ∈ X × Y. Then the dual problem is:
(2.35) (D) : sup − f ∗ A∗ (y ∗ ) − g ∗ (−y ∗ ) : y ∗ ∈ Y ∗ . Also the Lagrangian function for the pair of problems (P) , (D) (see (2.34) and (2.35)) is given by if f (x) < +∞ f (x) + y ∗ , A(x)Y − g ∗ (y ∗ ) ∗ L(x, y ) = (2.36) +∞ if f (x) = +∞ Using Theorem 2.3.25, we obtain the following. PROPOSITION 2.3.26 A pair (x0 , y0∗ ) ∈ X × Y ∗ is a saddle point of the Lagrangian L defined by (2.36) if and only if
and − A∗ (y0∗ ) ∈ ∂f (x0 ). y0∗ ∈ ∂g A(x0 ) Let us close this section with a simple application of duality theory on a calculus of variations problem. EXAMPLE 2.3.27 Let X = W01,2 (0, 1), Y = L2 (0, 1), A ∈ L(X, Y ) defined by A(x) = x , and f ∈ Γ0 (X), g ∈ Γ0 (Y ) defined by
1 f (x) = x∗0 , xX = − h(t)x(t)dt = −(h, x)L2 (0,1) for some h ∈ L2 (0, 1) 0
1 g(y) = y2L2 (0,1) . 2
and
Then identifying L2 (0, 1) with its dual (hence X⊆Y ⊆X ∗=W −1,2 (0, 1)), we have f ∗ (x∗ ) = i{x∗0 } (x∗ )
for all x∗ ∈ X ∗
and
Note that −A∗ (y ∗ ) = x∗0 if and only if
1
1 − y ∗ (t)x (t)dt = − h(t)x(t)dt 0
⇒ y ∗ ∈ W 1,2 (0, 1)
0
and
(y ∗ ) = −h.
g ∗ (y ∗ ) =
1 ∗ 2 y L2 (0,1) . 2
for all x ∈ W01,2 (0, 1),
2.4 Variational Principles
89
Then the primal problem is 1 (P) : inf x 2L2 (0,1) − (h, x)L2 (0,1) : x ∈ W01,2 (0, 1) 2 and the dual problem is 1 (D) : sup − y ∗ 2L2 (0,1) : y ∗ ∈ W 1,2 (0, 1), (y ∗ ) = −h . 2 Then problems (P) and (D) have solutions x0 ∈ W01,2 (0, 1) ∩ W 2,2 (0, 1) and ∈ W 1,2 (0, 1) (see Corollary 2.1.11) and they are unique due to the strict convexity of the functionals. Moreover, we have y0∗
−x0 (t) = h(t) a.e. on (0, 1),
x0 (0) = x0 (1) = 0
and
y0∗ = x0 .
2.4 Variational Principles In Theorem 2.1.10 and Corollary 2.1.11 we saw that if the objective functional ϕ : X −→ R is lower semicontinuous in a topology and the domain exhibits some kind of (local) compactness in the same topology, then a minimizing point exists. This is the cornerstone of the so-called direct method of the calculus of variations. However, in many situations the above convenient setting is not present. Think, for example, of infinite-dimensional Banach space functionals that are strongly lower semicontinuous, but not weakly. An effective tool to approach such problems is provided by the so-called Ekeland variational principle. Since its appearance in 1974, this result found many significant applications in different parts of analysis. Also it turned out to be equivalent to some other important results of nonlinear analysis and also served to provide new and elegant proofs to known results. In addition it initiated the production of some other related variational principles. In this section we survey this area exhibiting all those features that are significant for problems in nonlinear analysis. Of course our presentation is centered on the Ekeland variational principle. We start by giving the general form of the Ekeland variational principle. THEOREM 2.4.1 If (X, d) is a complete metric space, ϕ : X −→ R is a proper lower semicontinuous function that is bounded below, and ε > 0, x ¯ ∈ X satisfy ϕ(¯ x) ≤ inf ϕ + ε, X
then for any λ > 0, we can find xλ ∈ X such that x), ϕ(xλ ) ≤ ϕ(¯
d(xλ , x ¯) ≤ λ
and
ϕ(xλ ) ≤ ϕ(x) +
ε d(x, xλ ) λ
for all x ∈ X.
PROOF: In what follows dλ = (1/λ)d. We introduce the following relation on X × X. x≤u if and only if ϕ(x) ≤ ϕ(u) − εdλ (x, u). (2.37) It is easy to see that ≤ is reflexive, antisymmetric, and transitive, hence a partial order on X. We define a sequence of nonempty sets Cn ⊆ X, n ≥ 1 as follows. Let x1 = x ¯ and set
90
2 Extremal Problems and Optimal Control C1 = {x ∈ X : x ≤ x1 }. Choose x2 ∈ C1 such that ϕ(x2 ) ≤ inf ϕ + (ε 22 ) and define C2 = {x ∈ X : x ≤ C1
x2 }. We continue this way and inductively define Cn = {x ∈ X : x ≤ xn }
and xn+1 ∈ Cn ε ϕ(xn+1 ) ≤ inf ϕ + n+1 , n ≥ 1. Cn 2
such that (2.38)
Evidently {Cn }n≥1 is a decreasing sequence and each set Cn is closed. Indeed, suppose {um }m≥1 ⊆ Cn such that um −→ u. We have ϕ(um ) ≤ ϕ(xn ) − εdλ (um , xn ), ⇒ ϕ(u) ≤ lim inf ϕ(um ) ≤ ϕ(xn ) − εdλ (u, xn ) m−→∞
(i.e., u ∈ Cn ).
We claim that diam Cn −→ 0 as n → ∞. To this end let u ∈ Cn . We have u ≤ xn and so (2.39) ϕ(u) ≤ ϕ(xn ) − εdλ (u, xn ) (see (2.37)). Also note that u ∈ Cn−1 , because {Cn }n≥1 is a decreasing sequence. Therefore ϕ(xn ) ≤ ϕ(u) +
ε 2n
(see (2.38)).
(2.40)
1 . 2n
(2.41)
Combining (2.39) and (2.40), we obtain dλ (u, xn ) ≤
Because u ∈ Cn was arbitrary, from (2.41) and the triangle inequality it follows that 1 , 2n−1 ⇒ diam Cn −→ 0 as n → ∞. diam Cn ≤
Then by Cantor’s theorem, we have that
n≥1
Cn = {xλ }. Because xλ ∈ C1 , we have
¯ and so ϕ(xλ ) ≤ ϕ(¯ x) (see (2.37)). Also from the triangle inequality and xλ ≤ x (2.41), we have x, xn ) ≤ dλ (¯
n−1
dλ (xk , xk+1 ) ≤
k=1
k=1
⇒ dλ (¯ x, xλ ) = lim dλ (¯ x, xn ) ≤ 1 n→∞
n−1
1 2k
(i.e., dλ (¯ x, xλ ) ≤ λ).
Finally let x = xλ . Evidently we cannot have x ≤ xλ or otherwise x ∈
Cn , a
n≥1
contradiction. Then by virtue of (2.37) ϕ(xλ ) < ϕ(x) +
ε d(x, xλ ). λ
2.4 Variational Principles
91
REMARK 2.4.2 In the conclusions of Theorem 2.4.1, the relations d(¯ x, xλ ) ≤ λ and ϕ(xλ ) ≤ ϕ(x) + (ε/λ)d(x, xλ ) for all x ∈ X, are in a sense complementary. Indeed, the choice of λ > 0 allows us to strike a balance between them. So if λ > 0 is large the inequality d(x, xλ ) ≤ λ gives little information on the whereabouts of xλ , and the inequality ϕ(xλ ) ≤ ϕ(x) + (ε/λ)d(x, xλ ), x ∈ X becomes sharper and says that xλ is close to being a global minimizer of ϕ. The situation is reversed if λ > 0 is small. Two important cases are when λ = 1 (which means we do not care √ about the whereabouts of xλ ) and when λ = ε (which means that we need to have information from both inequalities). We state both cases as corollaries of Theorem 2.4.1. COROLLARY 2.4.3 If (X, d) is a complete metric space and ϕ : X −→ R is a proper lower semicontinuous function that is bounded below, then for any ε > 0, we can find xε ∈ X such that ϕ(xε ) ≤ inf ϕ + ε X
ϕ(xε ) ≤ ϕ(x) + εd(x, xε )
and
for all x ∈ X.
COROLLARY 2.4.4 If (X, d) is a complete metric space, ϕ : X −→ R is a proper lower semicontinuous function that is bounded below, and ε > 0, xε ∈ X satisfy ϕ(xε ) ≤ inf ϕ + ε, X
then we can find uε ∈ X such that √ ϕ(uε ) ≤ ϕ(xε ), d(xε , uε ) ≤ ε and
ϕ(uε ) ≤ ϕ(x) +
√ εd(x, uε )
for all x ∈ X.
Theorem 2.4.1 has some important consequences if we assume more structure on the space X and the function ϕ. THEOREM 2.4.5 If X is a Banach space, ϕ : X −→ R is a function that is bounded below and Gˆ ateaux differentiable, and ε > 0, xε ∈ X satisfy ϕ(xε ) ≤ inf ϕ + ε, X
then there exists uε ∈ X such that ϕ(uε ) ≤ ϕ(xε ),
uε − xε X ≤
√
ε
and
ϕ (uε )X ∗ ≤
PROOF: Apply Corollary 2.4.4 to obtain uε ∈ X such that √ and ϕ(uε ) ≤ ϕ(xε ), uε − xε X ≤ ε √ for all x ∈ X. − εx − uε X ≤ ϕ(x) − ϕ(uε )
√
ε.
(2.42)
From the third inequality in (2.42), taking x = uε + λh with λ > 0 and h ∈ X with hX ≤ 1, we have √ ϕ(uε + λh) − ϕ(uε ) − ε≤ , λ √ for all h ∈ B 1 (0), ⇒ − ε ≤ ϕ (uε ), h X √ ⇒ ϕ (uε )X ∗ ≤ ε.
92
2 Extremal Problems and Optimal Control
COROLLARY 2.4.6 If X is a Banach space and ϕ : X −→ R is a function that is bounded below and Gˆ ateaux differentiable, then for every minimizing sequence {xn }n≥1 of ϕ, we can find a minimizing sequence {un }n≥1 of ϕ such that ϕ(un ) ≤ ϕ(xn ),
un − xn X −→ 0
and
ϕ (un )X ∗ −→ 0
as n → ∞.
The following proposition is useful in critical point theory (see Section 4.1). PROPOSITION 2.4.7 If X is a Banach space and ϕ : X −→ R is a lower semicontinuous function that is bounded below, Gˆ ateaux differentiable, and satisfies the following compactness-type condition every sequence {xn }n≥1 ⊆ X that satisfies |ϕ(xn )| ≤ M for some M > 0, all n ≥ 1 and ϕ (xn )X ∗ −→ 0, it admits a strongly convergent subsequence, then we can find x0 ∈ X such that ϕ(x0 ) = inf ϕ and ϕ (x0 ) = 0. X
PROOF: Because of Theorem 2.4.5 for every n ≥ 1, we can find xn ∈ X such that ϕ(xn ) ≤ inf ϕ + X
1 n
and
ϕ (xn )X ∗ ≤
1 . n
Then by virtue of the compactness-type condition that ϕ satisfies, by passing to a subsequence if necessary, we may assume that xn −→ x0 in X. Clearly ϕ(x0 ) = inf ϕ and from this it follows that ϕ (x0 ) = 0.
X
REMARK 2.4.8 In critical point theory (see Section 4.1), we encounter the compactness-type condition of Proposition 2.4.7 in the context of functions that are C 1 on X with values in R. In such a setting it is called the Palais–Smale condition (PS-condition for short) and it is a basic tool in the derivation of minimax characterizations of the critical values of functions ϕ ∈ C 1 (X). PROPOSITION 2.4.9 If X is a Banach space and ϕ : X −→ R is a lower semicontinuous function that is bounded below, Gˆ ateaux differentiable, and ϕ(x) ≥ c1 x − c2 ∗
for some c1 , c2 > 0 and all x ∈ X,
(2.43)
∗
then ϕ (X) is dense in c1 B 1 where B 1 = {x∗ ∈ X ∗ : x∗ X ∗ ≤ 1}. ∗
PROOF: Let x∗ ∈ c1 B 1 and consider the function ψ(x) = ϕ(x) − x∗ , xX for all x ∈ X. Clearly ψ is lower semicontinuous, bounded below (because of (2.43)) and Gˆ ateaux differentiable. So by virtue of Theorem 2.4.5 we can find xε ∈ X such that ψ (xε )X ∗ ≤ ε, hence ϕ (xε ) − x∗ X ∗ < ε, which proves the density of ϕ (X) in ∗ c1 B 1 . COROLLARY 2.4.10 If X is a Banach space and ϕ : X −→ R is a lower semicontinuous function that is Gˆ ateaux differentiable and satisfies
ϕ(x) ≥ r(x) for all x ∈ X, with r : R+ −→ R a continuous function such that r(λ) λ −→ +∞ as λ −→ +∞, then ϕ (X) is dense in X ∗ .
2.4 Variational Principles
93
PROOF: Let c1 > 0 be given. Then we can find λ0 > 0 such that for all λ ≥ λ0 we have r(λ) ≥ c1 λ. Hence ϕ(x) ≥ c1 x for all x ∈ X with xX > λ0 . On the other hand if xX < λ0 , then ϕ(x) ≥ m = inf[r(λ) : 0 ≤ λ ≤ λ0 ]. Let c2 = |m|. Then we have ϕ(x) ≥ c1 x − c2 ∗
and we can apply Proposition 2.4.9 and obtain that ϕ (X) is dense in c1 B 1 . Because c1 > 0 was arbitrary we conclude that ϕ (X) is dense in X ∗ . Next we show that the Ekeland variational principle is actually equivalent to some other well-known results of nonlinear analysis. We start with Caristi’s fixed point theorem. THEOREM 2.4.11 If (X, d) is a complete metric space, ϕ : X −→ R is a proper, lower semicontinuous function that is bounded below, and F : X −→ 2X \{∅} is a multifunction such that ϕ(y) ≤ ϕ(x) − d(x, y)
for all x ∈ X and all y ∈ F (x),
(2.44)
then there exists x0 ∈ X such that x0 ∈ F (x0 ). PROOF: Apply Corollary 2.4.3 with ε = 1, to obtain x0 ∈ X such that ϕ(x0 ) < ϕ(x) + d(x, x0 )
for all x = x0 .
(2.45)
We claim that x0 ∈ F (x0 ). If this is not the case, then for every y ∈ F (x0 ) we have y = x0 . Then from (2.44) and (2.45) we have ϕ(y) ≤ ϕ(x0 ) − d(x0 , y) < ϕ(y), a contradiction. So we have seen that the Ekeland variational principle in the form of Corollary 2.4.3 implies Theorem 2.4.11 (Caristi’s fixed point theorem). Next we show that the opposite is also true. THEOREM 2.4.12 Caristi’s fixed point theorem (Theorem 2.4.11), implies the Ekeland variational principle in the form of Corollary 2.4.3. PROOF: We argue indirectly. Suppose that we cannot ϕ(xε ) < ϕ(x) + εd(x, xε ) for all x = xε . Let F (x) = y εd(y, x), y = x . Then F (x) = ∅ for all x ∈ X. Invoking find x0 ∈ X such that x0 ∈ F (x0 ), which is impossible. So principle holds.
find xε ∈ X satisfying ∈ X : ϕ(x) ≥ ϕ(y) + Theorem 2.4.11 we can the Ekeland variational
REMARK 2.4.13 Banach’s fixed point theorem (see Section 3.4), in its existence part, can be deducedfrom Theorem 2.4.11. Indeed, if F : X −→ X is a contraction, that is, d F (x), F (y) ≤ kd(x, y) for some k ∈ [0, 1), then it satisfies (2.44) with
ϕ(x) = 1 1 − k d x, F (x) . However, Banach’s fixed point theorem includes more information than the mere existence of a fixed point (a computational scheme to find the fixed point, rate of convergence, error estimates, etc.).
94
2 Extremal Problems and Optimal Control
Another result equivalent to the Ekeland variational principle and to the Caristi fixed point theorem, is the so-called Takahashi variational principle. THEOREM 2.4.14 If (X, d) is a complete metric space, ϕ : X −→ R = R ∪ {+∞} is a proper lower semicontinuous function that is bounded below, and for each u ∈ X with ϕ(u) > inf ϕ we can find v ∈ X such that v = u and ϕ(v) + d(u, v) ≤ ϕ(u), then X
there exists x0 ∈ X such that ϕ(x0 ) = inf ϕ. X
PROOF: We proceed by contradiction. So suppose that inf ϕ is not attained. We X
introduce the multifunction F : X −→ 2X defined by F (x) = {y ∈ X : ϕ(y) + d(x, y) ≤ ϕ(x), y = x}. By hypothesis F (x) = ∅ for all x ∈ X. Invoking Theorem 2.4.11, we can find x0 ∈ F (x0 ), a contradiction. So inf ϕ is attained. X
Thus we have seen that Caristi’s fixed point theorem (Theorem 2.4.11) implies Takahashi’s variational principle (Theorem 2.4.14). Next we show that the converse is also true. THEOREM 2.4.15 Takahashi’s variational principle (Theorem 2.4.14) implies Caristi’s fixed point theorem (Theorem 2.4.11). PROOF: We proceed by contradiction. So suppose that in Caristi’s fixed point theorem (Theorem 2.4.11), the multifunction F has no fixed point, (i.e., x ∈ / F (x) for all x ∈ X). Thus from the property of the multifunction F , we see that for every x ∈ X we can find y = x such that ϕ(y) + d(x, y) ≤ ϕ(x). This is the hypothesis in Theorem 2.4.14. By virtue of that result we can find x0 ∈ X such that ϕ(x0 ) = inf ϕ. X
Let y0 ∈ F (x0 ) be such that y0 = x0 and ϕ(y0 ) + d(x0 , y0 ) ≤ ϕ(x0 ). Then we have 0 < d(x0 , y0 ) ≤ ϕ(x0 ) − ϕ(y0 ) ≤ ϕ(y0 ) − ϕ(y0 ) = 0, a contradiction. So F has a fixed point and Caristi’s fixed point theorem (Theorem 2.4.11) holds. Another result of nonlinear analysis related to the Ekeland variational principle (in fact equivalent to it), is the so-called drop theorem. THEOREM 2.4.16 If X is a Banach space, C ⊆ X is a nonempty closed set, y ∈ X \ C, R = d(y, C), and 0 < r < R < , then there exists x0 ∈ C such that y − x0 ≤ and D(x0 ; y, r) ∩ C = {x0 }, where D(x0 ; y, r) = conv B r (y) ∪ {x0 } .
2.4 Variational Principles
95
PROOF: By translating things if necessary, without any loss of generality, we may assume that y = 0. Let S = B r (0) ∩ C. Then S is a closed set in X, hence a complete metric space. Consider the function ϕ : S −→ R defined by ϕ(x) =
+r xX . R−r
By virtue of Corollary 2.4.3 with ε = 1, we can find x0 ∈ S such that ϕ(x0 ) < ϕ(x) + x − x0 X
for all x ∈ S, x = x0 .
(2.46)
Because we have assumed that y = 0, we have y − x0 X = x0 X ≤ . Next we show that D(x0 ; 0, r) ∩ C = {x0 }. Suppose that this is not the case and we can find x = x0 such that x ∈ D(x0 ; 0, r) ∩ C. Then x∈C
and
x = (1 − λ)x0 + λu
with u ∈ B r (0) and 0 ≤ λ ≤ 1. (2.47)
Evidently 0 < λ < 1 (recall that < R). From (2.47) we have xX ≤ (1 − λ)x0 X + λuX ,
⇒ λ(R − r) ≤ λ x0 X − xX ≤ x0 X − xX .
(2.48)
From (2.46) and (2.47) it follows that +r +r +r x0 X < xX + x − x0 X = xX + λx0 − uX . R−r R−r R−r (2.49) Also from (2.48) we have λ≤
x0 X − xX . R−r
(2.50)
Using (2.50) in (2.49), we obtain ( + r)x0 X < ( + r)xX + x0 − uX (x0 X − xX ) ≤ ( + r)xX + ( + r)(x0 X − xX ) (because x0 X ≤ , u ∈ B r (0)), ⇒ x0 X < xX + x0 X − xX = x0 X ,
a contradiction.
Therefore we conclude that D(x0 ; 0, r) ∩ C = {x0 } and the proof of the theorem is finished. REMARK 2.4.17 The set D(x0 ; y, r) is called a drop, in view of its evocative geometry. In the above proof, we saw that the Ekeland variational principle (in the form of Corollary 2.4.3) implies the drop theorem (Theorem 2.4.16). In fact the converse is also true. For a proof of this we refer to Penot [494]. Thus we have the following. THEOREM 2.4.18 The drop theorem (Theorem 2.4.16) implies the Ekeland variational principle (Corollary 2.4.3). Summarizing we have the following.
96
2 Extremal Problems and Optimal Control
THEOREM 2.4.19 Corollary 2.4.3, Theorem 2.4.11, Theorem 2.4.14 and Theorem 2.4.16 are all equivalent. Now we present a general principle on partially ordered sets, which implies all the above equivalent theorems. Recall that on a set X, ≤ is a partial order if x ≤ x (reflexive) x ≤ y and y ≤ x imply x = y (antisymmetric) and x ≤ y, y ≤ z imply x ≤ z (transitive). THEOREM 2.4.20 If (X, ≤) is a partially ordered set, every increasing sequence {xn }n≥1 ⊆ X has an upper bound in X (i.e. if xn ≤ xn+1 for all n ≥ 1, there exists y ∈ X such that xn ≤ y for all n ≥ 1) and ϕ : X −→ R is an increasing function that is bounded above, then there exists x0 ∈ X such that x0 ≤ y implies ϕ(x0 ) = ϕ(y). PROOF: Let x1 ∈ X be any element. Inductively we produce an increasing sequence {xn }n≥1 ⊆ X. Suppose we have generated the element xn . We define Cn = {x ∈ X : xn ≤ x}
and
Mn = sup ϕ. Cn
If for xn , we have that xn ≤ y implies that ϕ(xn ) = ϕ(y), then clearly we are done. Otherwise ϕ(xn ) < Mn and so we can find xn+1 ∈ Cn such that Mn ≤ ϕ(xn+1 ) +
1
Mn − ϕ(xn ) . 2
(2.51)
So by induction, we have produced an increasing sequence {xn }n≥1 ⊆ X. By hypothesis we can find x0 ∈ X such that xn ≤ x0
for all n ≥ 1.
(2.52)
We claim that x0 ∈ X is the desired solution. Suppose that this is not the case. Then we can find y ∈ X such that x0 ≤ y and ϕ(x0 ) < ϕ(y). The sequence ϕ(xn ) n≥1 ⊆ R is increasing and bounded above by ϕ(y). Therefore it converges. We have lim ϕ(xn ) ≤ ϕ(x0 ) (see (2.52)). (2.53) n→∞
Because of (2.52), y ∈ Cn for all n ≥ 1. So from (2.51) it follows that ϕ(y) ≤ Mn ≤ 2ϕ(xn+1 ) − ϕ(xn ) ⇒ ϕ(y) ≤ ϕ(x0 )
for all n ≥ 1
(see (2.53)),
a contradiction to the choice of y. This proves the theorem.
REMARK 2.4.21 Theorem 2.4.20 can have a physical interpretation. We can think of ϕ as a function measuring the entropy of a system. The theorem guarantees the existence of a state of maximal entropy. To these states correspond stable equilibrium states of the system. COROLLARY 2.4.22 If X is a Hausdorff topological space equipped with a partial order ≤ and ψ : X −→ R a function that is bounded below such that (i) For every x ∈ X the set {y ∈ X : x ≤ y} is closed; (ii) x ≤ y and x = y imply ψ(y) < ψ(x) (strictly decreasing ψ);
2.4 Variational Principles
97
(iii) Any increasing sequence in X is relatively compact, then for each x ∈ X we can find x0 ∈ X such that x ≤ x0 and x0 is maximal. PROOF: Let {xn }n≥1 ⊆ X be an increasing sequence in X. By virtue of hypothesis (iii) {xn }n≥1 ⊆ X is relatively compact and so we can find a subsequence xnk k≥1 such that xnk −→ y in X. We claim that xn ≤ y for all n ≥ 1. Indeed given n ≥ 1, we have n ≤ nk for k ≥ kn and so xn ≤ xnk for k ≥ kn . From this and hypothesis (i) it follows that y ∈ Cn for all n ≥ 1; that is, xn ≤ y for all n ≥ 1. Taking ϕ = −ψ, because of hypothesis (ii) we can apply Theorem 2.4.20 starting from x1 = x and obtain x0 ∈ X such that x ≤ x0 and x0 is maximal. COROLLARY 2.4.23 Theorem 2.4.20 implies the Ekeland variational principle in the form of Corollary 2.4.3. PROOF: Without any loss of generality we take ε = 1 and define a partial order ≤ by x≤u if and only if ϕ(u) − ϕ(x) ≤ −d(x, u). (2.54) For any increasing sequence {xn }n≥1 ⊆ X, ϕ(xn ) n≥1 is decreasing and bounded below, so it converges. Therefore once more from (2.54), we infer that {xn }n≥1 ⊆ X is Cauchy, hence due to the completeness of X it converges to an element in X. Therefore we can apply Corollary 2.4.22 and finish the proof. REMARK 2.4.24 Thus Theorem 2.4.20 also implies Caristi’s fixed point theorem, Takahashi’s variational principle, and the drop theorem.
We conclude this section with a generalization of Theorem 2.4.1, which is used in Section 4.1. For a proof of it we refer to Zhong [626]. THEOREM 2.4.25 If h : R+ −→ R+ is a continuous nondecreasing function such +∞ 1 that dr = +∞, (X, d) is a complete metric space, x0 ∈ X is fixed, ϕ : X −→ 1+h(r) 0
R = R ∪ {+∞} is a proper, lower semicontinuous, bounded below function, ε > 0, ϕ(y) ≤ inf ϕ + ε and λ > 0, then there exists xλ ∈ X such that X
and
ϕ(xλ ) ≤ ϕ(y), d(xλ , x0 ) ≤ r0 + r¯ ε
d(xλ , x) ϕ(xλ ) ≤ ϕ(x) +
λ 1 + h d(x0 , xλ )
where r0 = d(x0 , y) and r¯ > 0 such that
r0 +¯ r 0
1 1+h(r)
for all x ∈ X,
dr ≥ λ.
REMARK 2.4.26 If h ≡ 0 and x0 = y, then Theorem 2.4.25 reduces to Theorem 2.4.1.
98
2 Extremal Problems and Optimal Control
2.5 Calculus of Variations The calculus of variations deals with the minimization or maximization of functions defined on function spaces. It is as old as calculus itself and has important applications in mechanics and physics. In this section we present some basic aspects of the theory concerning scalar problems. This means that the unknown functions are curves defined on closed intervals in R with values in a Banach space. For this reason we make the following definition. DEFINITION 2.5.1 Let T = [0, b] and X a Banach space. By C 1 (T, X) we denote the vector space of all functions u ∈ C(T, X) which are differentiable on (0, b) and the derivative u : (0, b) −→ X is bounded and uniformly continuous. REMARK 2.5.2 This means that u admits a unique continuous extension on T = [0, b] and u (0) = lim u (t), u (b) = lim u (t). t−→b−
t−→0+
In fact u (0) is the right derivative of u at t = 0 and u (b) is the left derivative of u at t = b. We furnish C 1 (T, X) with the norm uC 1 (T,X) = max u(t)X + max u (t)X . t∈T
t∈T
(2.55)
It is easy to see that (2.55) indeed defines a norm on C 1 (T, X). Also we have the following. PROPOSITION 2.5.3 The space C 1 (T, X) equipped with the norm · C 1 (T,X) becomes a Banach space. Now we introduce the setting of the calculus of variations problem that we study. So let T = [0, b], X be a Banach space, U be a nonempty open set in R × X × X, and L : U −→ R a continuous function, usually called the Lagrangian. A map u ∈ C 1 (T, X) is said to be admissible, if for t ∈ T , we have t, u(t), u (t) ∈ U . We introduce the integral functional IL : D ⊆ C 1 (T, X) −→ R defined by
b
IL (u) = L t, u(t), u (t) dt 0
for every admissible map u ∈ C (T, X). 1
PROPOSITION 2.5.4 The set D ⊆ C 1 (T, X) of all admissible maps is an open subset of C 1 (T, X). PROOF: We show that Dc⊆C 1 (T, X) is closed. To this end let {xn }n≥1 ⊆ Dc and 1 suppose that / D, we can find tn ∈ T
xn −→ x in C (T, X).c Because for all n≥1 xn ∈ such that tn , xn (tn ), xn (tn ) ∈ U . By passing to a subsequence if necessary, we may assume that tn −→ t ∈ T . Because xn −→ x and xn −→ x in C 1 (T, X), we have that xn (t n ) −→ x(t) and X as n → ∞. So in the limit as n → ∞, xnc(tn ) −→ x (t) in we have t, x(t), x (t) ∈ U , hence x ∈ / Dc , which finishes the proof.
2.5 Calculus of Variations
99
PROPOSITION 2.5.5 If Y, Z are Banach spaces, W ⊆ Y is a nonempty open set, b ϑ : T ×W −→ Z is a continuous map, and we set ξ(y) = 0 ϑ(t, y)dt for all y ∈ W , then (a) ξ : W −→ Z is a continuous map. (b) If in addition for all t ∈ T, y −→ ϑ(t, y) is Fr´echet differentiable and (t, y) −→ ϑ (t, y) is continuous from T × W into L(Y, Z), then ξ ∈ C 1 (W, Z) and ξ (y) = yb ϑ (t, y)dt. 0 y PROOF: (a) Let {yn }n≥1 ⊆ W and suppose that yn −→ y ∈ W . Then {yn , y}n≥1 = C is compact in Y and C ⊆ W . So h(T × C) is compact in Z. Therefore we can find M > 0 such that h(t, yn )Z ≤ M
for all t ∈ T and all n ≥ 1.
Because h(t, yn ) −→ h(t, y) in Z for all t ∈ T , from the dominated convergence theorem we have that
b
b ξ(yn ) = h(t, yn )dt −→ h(t, y)dt = ξ(y) in Z as n → ∞, 0
0
⇒ ξ : W −→ Z is continuous.
(b) We show that ξ is continuously Gˆ ateaux differentiable. Then it follows that ξ ∈ C 1 (W, Z) (see Proposition 1.1.10). So let h ∈ Y and λ = 0. We have ξ(y + λh) − ξ(y) = λ
0
b
ϑ(t, y + λh) − ϑ(t, y) dt. λ
(2.56)
From Proposition 1.1.6 (the mean value theorem), we know that ϑ(t, y + λh) − ϑ(t, y) ≤ sup ϑy (t, y + µλh)L(Y,Z) λhY .
(2.57)
µ∈[0,1]
Because by hypothesis (t, y) −→ ϑy (t, y) is continuous from T × W into L(Y, Z), we can find M > 0 such that ϑy (t, y + µλh)L(Y,Z) ≤ M > 0
for all t ∈ T,
all µ ∈ [0, 1] and all λ ∈ [−1, 1].
(2.58)
Therefore ϑ(t, y + λh) − ϑ(t, y) for all t ∈ T ≤ M hY λ Z and all λ ∈ [−1, 1] (see (2.57) and (2.58)).
(2.59)
Recall that ϑ(t, y + λh) − ϑ(t, y) −→ ϑy (t, y)h λ
for all t ∈ T as λ −→ 0.
(2.60)
Because of (2.59), (2.60), and the dominated convergence theorem, if we pass to the limit as λ −→ 0, we obtain
100
2 Extremal Problems and Optimal Control ξ (y)h =
b
ϑy (t, y)h dt
for all h ∈ Y.
0
Therefore by virtue of part (a), ξ ∈ C 1 (W, Z) and ξ (y) =
b
ϑy (t, y) dt
for all y ∈ Y.
0
We use this proposition to establish the continuous Fr´echet differentiability of the integral functional IL and determine its derivative in terms of the partial derivatives of the Lagrangian L. THEOREM 2.5.6 If the Lagrangian L : U −→ R is continuously Fr´echet differentiable, then IL : D ⊆ C 1 (T, X) −→ R is continuously Fr´echet differentiable too and
b
L2 t, u(t), u (t) , v(t) X dt IL (u), v C 1 (T,X) = 0
+
b
L3 t, u(t), u (t) , v (t) X dt
0
for all v ∈ C 1 (T, X). Here by ·, ·C 1 (T,X) we denote the duality brackets for the
pair C 1 (T, X), C 1 (T, X)∗ , by ·, ·X the duality brackets for the pair (X, X ∗ ), and Lk k = 2, 3 the partial derivative of L(t, x, y) with respect to the second and third variables, respectively. PROOF: From Proposition 2.5.4 we know that the set D ⊆ C 1 (T, X) of admissible maps is open. We consider the map ϑ : T × D −→ R defined by
ϑ(t, u) = L t, u(t), u (t) for all (t, u) ∈ T × D. Let ϑ1 : T × D −→ U and ϑ2 : U −→ R be defined by
ϑ1 (t, u) = t, u(t), u (t) and ϑ2 (t, x, y) = L(t, x, y) for all (t, u) ∈ T × D and all (t, x, y) ∈ U . Clearly ϑ1 , ϑ2 are continuous and ϑ = ϑ2 ◦ ϑ1 . So ϑ is continuous too. Moreover, because for t ∈ T fixed the maps u −→ u(t) and u −→ u (t) are continuous linear, we see that for every t ∈ T, ϑ(t, ·) is continuously Fr´echet differentiable. Then by virtue of Propositions 1.1.14 and 1.1.17, we have
ϑ2 (t, u), v C 1 (T,X)= L2 t, u(t), u (t) , v(t) X+ L3 t, u(t), u (t) , v (t) X for all v ∈ C 1 (T, X). It follows that (t, u) −→ ϑ2 (t, u) is continuous from T × D into C 1 (T, X)∗ and so we can apply Proposition 2.5.5 and conclude that
IL (u), v
= C 1 (T,X)
L2 t, u(t), u (t) , v(t) X dt
b
0
+ 0
L3 t, u(t), u (t) , v (t) X dt
b
2.5 Calculus of Variations for all v ∈ C 1 (T, X).
101
We consider the problem with fixed endpoints. Namely we require that all admissible maps satisfy u(0)=x0 and u(b) = xb , where x0 , xb ∈ X are given. So let Cx10 ,xb (T, X) = u ∈ C 1 (T, X) : u(0) = x0 , u(b) = xb . This is a closed affine subspace of C 1 (T, X) produced by translation of the closed 1 subspace C01 (T, X) = C0,0 (T, X). Now let us formally introduce the concept of the local (relative) extremal point of a functional. DEFINITION 2.5.7 Let Y be a Banach space, C ⊆ Y a nonempty set, and ϕ : C −→ R. We say that y0 ∈ C is a local (relative) extremum of ϕ, if we can find V a neighborhood of y0 in Y such that one of the following two holds. (a) ϕ(y0 ) ≤ ϕ(y) for all y ∈ V ∩ C (local minimum). (b) ϕ(y0 ) ≥ ϕ(y) for all y ∈ V ∩ C (local maximum). If the inequalities in (a) and (b) are strict for y = y0 , then we speak of a strict local extremum (strict local minimum and strict local maximum). If the inequalities in (a) and (b) are true for all y ∈ C, then we speak of a (global) extremum on C (global) minimum on C and (global) maximum on C . In the next proposition we produce a necessary condition for IL to admit a local extremum on Cx10 ,xb (T, X). In what follows we assume that D ∩ Cx10 ,xb (T, X) is nonempty. PROPOSITION 2.5.8 If L : U −→ R is a continuously Fr´echet differentiable Lagrangian and IL admits a local relative extremum on Cx10 ,xb (T, X) at the map u ∈ Cx10 ,xb (T, X), then for every v ∈ D ∩ C01 (T, X) we have
IL (u), v
C 1 (T,X)
b
= 0
L2 t, u(t), u (t) , v(t) X dt
b
+ 0
L3 t, u(t), u (t) , v (t) X dt.
(2.61)
PROOF: From Proposition 2.5.4 we know that D is an open subset of C 1 (T, X). Hence D ∩ Cx10 ,xb (T, X) is an open subset of the closed affine subspace Cx10 ,xb (T, X). By Theorem 2.5.6 IL : D −→ R is continuously Fr´echet differentiable, thus we have that its restriction on Cx10 ,xb (T, X) is also continuously Fr´echet differentiable. Because IL attains its local relative minimum or local relative maximum at a map u ∈ Cx10 ,xb (T, X), we have
IL
1 Cx (T,X) 0 ,xb
But
IL
1 Cx (T,X) 0 ,xb
and so (2.61) follows.
(u) = 0.
(u) = IL (u)
C01 (T,X)
102
2 Extremal Problems and Optimal Control
Equation (2.61) is not yet in a convenient form. To achieve this we need some auxiliary results that are basic in the theory of calculus of variations. The first auxiliary result is usually known in the literature as the Lagrange lemma. LEMMA 2.5.9 If ξ ∈ C(T, X ∗ ), then ξ ≡ 0 if and only if for all u ∈ C01 (T, X).
b 0
ξ(t), u(t)X dt = 0
PROOF: ⇒: Obvious. ⇐: Suppose that ξ is not identically zero. Then we can find t0 ∈ (0, b) such that ξ(t0 ) = 0. Hence we can find x ∈ X such that ξ(t0 ), xX = 0 and without any loss of generality we may assume that ξ(t0 ), xX > 0. The function t −→ ξ(t), xX is continuous on T and so we can find δ > 0 that [t0 −δ, t0 +δ] ⊆ (0, b) and ξ(t), xX > 0 for all t ∈ [t0 − δ, t0 + δ]. Consider a function ϑ ∈ C 1 (T ) such that ϑ≥0
and
ϑ(t) = 0
A possible such function (known as a cut-off ⎧ ⎪ ⎨ 0
1 ϑ(t) = exp − δ2 −(t−t 2 ) 0 ⎪ ⎩ 0
for all t ∈ / [t0 − δ, t0 + δ]. function) is if 0 ≤ t ≤ t0 − δ if t0 − δ ≤ t ≤ t0 + δ. if t0 + δ ≤ t ≤ b
Then let u0 (t) = ϑ(t)x. Evidently u0 ∈ C01 (T, X) and the function t −→ ξ(t0 ), u0 (t)X is continuous on T , nonnegative, and ξ(t0 ), u0 (t)X > 0. Therefore it follows that
b
ξ(t), u0 (t)X dt > 0, 0
a contradiction to the hypothesis of the lemma. The second auxiliary result is known as Du Bois–Reymond’s lemma.
LEMMA 2.5.10 If ξ ∈ C(T, X ∗ ), then ξ is constant if and only if for all u ∈ b b C(T, X) with mean value zero (i.e., 0 u(t)dt = 0) we have 0 ξ(t), u(t)X dt = 0. PROOF: ⇒ : Suppose that ξ(t) = x∗ ∈ X ∗ for all t ∈ T . Also assume that u ∈ C(T, X) has mean value zero. Then from the properties of the Bochner integral, we have
b
b
b ξ(t), u(t)X dt = x∗ , u(t)X dt = x∗ , u(t)dt = 0. 0
0
0
X
⇐ : Suppose that ξ is not constant. Because ξ ∈ C(T, X) we can find 0 < t1 < t2 < b such that ξ(t1 ) = ξ(t2 ). So there exists x ∈ X such that ξ(t1 ), xX = ξ(t2 ), xX . Without any loss of generality we may assume that ξ(t1 ), xX < ξ(t2 ), xX . By virtue of the continuity of the function t −→ ξ(t), xX on T , we can find δ > 0 such that 0 < t1 − δ < t1 + δ < t2 − δ < t2 + δ < b and
2.5 Calculus of Variations
103
max ξ(t), xX : t ∈ [t1 − δ, t1 + δ] < min ξ(t), xX : t ∈ [t2 − δ, t2 + δ] . From this inequality it follows that ξ(t2 + s) − ξ(t1 + s), xX > 0
for all s ∈ [−δ, δ].
We consider a continuous cut-off function ϑ for the interval [−δ, δ]; that is, ϑ ≥ 0, ϑ(s) > 0 for s ∈ (−δ, δ) and ϑ(s) = 0 for s ∈ / (−δ, δ). A possible such function is given by δ−|s| if |s| ≤ δ. δ ϑ(s) = 0 if |s| > δ b
Let η(t) = 0 ϑ(s − t2 ) − ϑ(s − t1 ) ds for all t ∈ T and set u(t) = η(t)x. Evidently u ∈ C 1 (T, X) and u(0)=u(b)=0. Then
b
b
ξ(t), u (t) X dt = ϑ(s − t2 ) − ϑ(s − t1 ) ξ(t), xX dt 0
0
δ
ϑ(s) ξ(t2 + s) − ξ(t1 + s), xX ds,
= δ
a contradiction to the hypothesis.
The previous two lemmata lead to the third auxiliary result which provides the tools to simplify the extremality equation (2.61). b LEMMA 2.5.11 If ξ1 , ξ2 ∈ C(T, X ∗ ), then 0 ξ1 (t), u(t)X +ξ2 (t), u (t)X dt = 1 0 for all u ∈ C0 (T, X) if and only if ξ2 is differentiable on T and ξ2 (t) = ξ1 (t) for all t ∈ T . t PROOF: Let β(t) = 0 ξ1 (s)ds for all t ∈ T . Then β ∈ C 1 (T, X ∗ ) and β (t) = ξ1 (t) for all t ∈ T . Let u ∈ C01 (T, X). We have d ξ1 (t), u(t)X = for all t ∈ T, β(t), u(t)X − β(t), u (t) X dt
b
b ⇒ ξ1 (t), u(t)X dt = β(b), u(b)X − β(0), u(0)X − β(t), u (t) X dt 0
=−
⇒ 0
0
b
β(t), u (t)
0 b
ξ1 (t), u(t)X + ξ2 (t), u (t) X dt =
Then by virtue of Lemma 2.5.10, we have
b ξ2 (t) − β(t), u (t) X dt = 0
dt
X
0
b
(because u(0) = u(b) = 0) ξ2 (t) − β(t), u (t) X dt.
for all u ∈ C01 (T, X)
0
if and only if ξ2 (t) − β(t) = x∗0 ∈ X ∗ Therefore ξ2 ∈ C (T, X) and 1
ξ2 (t)
for all t ∈ T. = ξ1 (t) for all t ∈ T .
Using this lemma we can simplify equation (2.61).
104
2 Extremal Problems and Optimal Control
THEOREM 2.5.12 If L : U −→ R is a continuously differentiable Lagrangian and IL admits a local relative extremum on Cx10 ,xb (T, X) at u ∈ Cx10 ,xb (T, X), then
d
L3 t, u(t), u (t) = L2 t, u(t), u (t) dt
for all t ∈ T.
(2.62)
REMARK 2.5.13 Equation (2.62) is known as Euler’s equation (in Lagrange form). The functions u ∈ Cx10 ,xb (T, X) along which (2.62) is valid are called extremals. Next we present some special cases where the Euler equation has easily determined integrals. COROLLARY 2.5.14 If the Lagrangian function L(t, x, y) is actually independent of the third variable y ∈ X, then a necessary condition for the extremality of the map u ∈ Cx10 ,xb (T, X) is given by
L2 t, u(t) = 0 for all t ∈ T. COROLLARY 2.5.15 If the Lagrangian function L(t, x, y) is actually independent of the second variable x ∈ X, then the Euler equation (2.62) admits the following solution
for all t ∈ T. p(t) = L3 t, u (t) = p∗0 ∈ X ∗ REMARK 2.5.16 In mechanics p(t) is the momentum function and Corollary 2.5.15 says that along an extremal the momentum is constant. COROLLARY 2.5.17 If the Lagrangian function L(t, x, y) actually does not depend on the time variable t ∈ T and the extremal u ∈ C 2 (T, X) ∩ Cx10 ,xb (T, X), then the Euler equation (2.62) admits an energy integral
H(t) = p(t), u (t) X − L u(t), u (t)
for all t ∈ T. = L2 u(t), u (t) , u (t) X − L u(t), u (t) = H0 ∈ R PROOF: From the chain rule we have
d
d H(t) = L2 u(t), u (t) , u (t) + L2 u(t), u (t) , u (t) X dt dt
− L1 u(t), u (t) , u (t) X − L2 u(t), u (t) , u (t) X = 0 (see (2.62)). Hence H(t) = H0 ∈ R for all t ∈ T .
REMARK 2.5.18 The above corollary says that along an extremal the energy is constant (conservation of energy). To be able to analyze further the Euler equation (2.62), we need to introduce second-order derivatives.
2.5 Calculus of Variations
105
DEFINITION 2.5.19 Let X, Y be Banach spaces, U ⊆ X nonempty open, x0 ∈ U , and ϕ : U −→ Y a Fr´echet differentiable map. If the Fr´echet derivative x −→ ϕ (x) from U into L(X, Y ) with the operator norm topology is differentiable at x0 , then ϕ is said to be twice differentiable at x0 and this second-order derivative is denoted by ϕ (x0 ).
REMARK 2.5.20 According to this definition ϕ (x0 ) ∈ L X, L(X, Y ) . DEFINITION 2.5.21 Let X1 , X2 and Y be Banach spaces. A map L : X = X1 ×X2 −→ Y is said to be bilinear if x1 −→ L(x1 , x2 ) from X1 into Y and x2 −→ L(x1 , x2 ) from X2 into Y are both linear. We say that L is continuous, if there exists M ≥ 0 such that L(x)Y ≤ M x1 X x2 X
for all x = (x1 , x2 ) ∈ X = X1 × X2 .
(2.63)
The infimum of all M ≥ 0 for which (2.63) is true is the norm of L. Equipped with this norm the space of continuous bilinear maps L : X1 × X2 −→ Y is a Banach space denoted by L2 (X1 × X2 ; Y ). REMARK 2.5.22 Note that on X = X1 × X2 , we consider the norm xX = max{x 1 X1 , x2 X2 } for all x = (x1 , x2 ) ∈ X = X1 × X2 ; then LL2 = sup L(x)Y : x ∈ X, xX ≤ 1 . PROPOSITION 2.5.23
If X1 , X2 , and Y are Banach spaces, then L2 (X1 × X2 ; Y ), L X1 , L(X2 , Y ) , and L X2 , L(X1 , Y ) are isometrically isomorphic Banach spaces. PROOF: Let L ∈ L2 (X1 × X2 ; Y ) and x1 ∈ X1 . We consider the map x2 −→ K(x1 )(x2 ) = L(x1 , x2 ) from X2 into Y . We have K(x1 )(x2 )Y ≤ LL2 x1 X1 x2 X2 , ⇒ K(x1 ) ∈ L(X2 , Y )
and
K(x1 )L ≤ LL2 x1 X .
(2.64)
Also the map x1 −→ K(x1 ) is linear and (2.64) implies that it is also continuous and satisfies ≤ LL . K
(2.65) 2 L X1 ,L(X2 ,Y )
On the other hand, if K ∈ L X1 , L(X2 , Y ) , for all x1 ∈ X1 we set L(x1 , x2 ) = K(x1 )x2 . Evidently L : X1 ×X2 −→ Y is a bilinear map and L(x1 , x2 )Y ≤ K(x1 )L x2 X2 ≤ K
L X1 ,L(X2 ,Y )
⇒ L ∈ L2 (X1 × X2 ; Y )
and
LL2 ≤ K
x1 X x2 X , 1 2
L X1 ,L(X2 ,Y )
.
(2.66)
From(2.65) and(2.66) we conclude that L 2 (X1×X2 ; Y ) and L X1 , L(X2 , Y ) are isometrically isomorphic and similarly for L X2 , L(X1 , Y ) . By virtue of Proposition 2.5.23, if ϕ : U −→ Y is a twice differentiable map and x0 ∈ U , then ϕ (x0 ) ∈ L2 (X × X; Y ). In fact we can say more.
106
2 Extremal Problems and Optimal Control
PROPOSITION 2.5.24 If X, Y are Banach spaces, U ⊆ X is nonempty open, x0 ∈ X, and ϕ : U −→ X is a map which is twice differentiable at x0 (see Definition 2.5.19), then ϕ (x0 ) ∈ L2 (X × X; Y ) is symmetric; that is, for all x, u ∈ X we have ϕ (x0 )(x, u) = ϕ (x0 )(u, x). PROOF: Let r > 0 be such that Br (x0 ) ⊆ U and consider the map ψ : [0, 1] −→ Y defined by ψ(t) = ϕ(x0 + tx + u) − ϕ(x0 + tx)
for xX , uY ≤ r.
From the mean value theorem (see Proposition 1.1.6), we have ψ(1) − ψ(0) − ψ (0)X ≤ sup ψ (t) − ψ (0)X .
(2.67)
t∈[0,1]
Also from the chain rule (see Proposition 1.1.14), we have
ψ (t) = ϕ (x0 + tx + u) − ϕ (x0 + tx) x
= ϕ (x0 + tx + u) − ϕ(x0 ) − ϕ (x0 )tx x
− ϕ (x0 + tx) − ϕ(x0 ) − ϕ (x0 )tx x. Given ε > 0, we can find δ > 0 such that if xX , uX ≤ δ and 0 ≤ t ≤ 1, then ϕ (x0 + tx + u) − ϕ (x0 ) − ϕ (x0 )(tx + u)L ≤ ε(xX + uX ) and
ϕ (x0 + tx) − ϕ (x0 ) − ϕ (x0 )(tx)L ≤ εxX .
These imply
and
ψ (t) − ϕ (x0 )u xY ≤ 2ε(xX + uX )
ψ(1) − ψ(0) − ϕ (x0 )u xY ≤ ψ(1) − ψ(0) − ϕ (0)Y
+ ϕ (0) − ϕ (x0 )u xY ≤ 6ε(xX + uX )xX
(2.68)
(2.69)
(see (2.67) and (2.68)). But ψ(1) − ψ(0) = ϕ(x0 + tx + u) − ϕ(x0 + x) − ϕ(x0 + u) + ϕ(x0 ) is symmetric in x, u ∈ X and so in (2.68) we may interchange x and u and obtain
ϕ (x0 )u x − ϕ (x0 )x uY ≤ 6ε(xX + uX )2 for all xX , uX ≤ δ. (2.70) If we replace x, u by λx, λu with λ > 0, then both sides of (2.70) are multiplied with λ2 . So (2.70) holds also for xX = uX = 1. Hence ϕ (x0 )(u, x) − ϕ (x0 )(x, u)Y ≤ 24ε
for all xX = uX = 1.
(2.71)
Because ε > 0 was arbitrary, from (2.71) we conclude that ϕ (x0 )(x, u) = ϕ (x0 )(u, x)
for all x, u ∈ X.
Now that we have the second-order derivative at our disposal, we can further analyze Euler’s equation (2.62). Assume that the extremal u belongs in C 2 (T, X).
2.5 Calculus of Variations
107
In order to keep track with respect to which variable we differentiate at each step, we consider the variables (t, x, y) of the Lagrangian and by Lt (resp., Lx , Ly ) we denote the partial derivative of L with respect to t (resp., with respect to x, y). Then we have d
d
L3 t, u(t), u (t) = Ly t, u(t), u (t) dt dt
= Lyt t, u(t), u (t) + Lyx t, u(t), u (t) u (t)
+Lyy t, u(t), u (t) u (t) in X ∗ . Therefore the Euler equation can be written as follows.
Lyy t, u(t), u (t) u (t) + Lyx t, u(t), u (t) u (t)
in X ∗ . + Lyt t, u(t), u (t) − Lx t, u(t), u (t) = 0
(2.72)
This is a second-order differential equation with the function u unknown. Of course (2.72) is not in canonical form, because it is not solved for∗u . In the sequel
by imposing a suitable condition on Lyy t, u(t), u (t) ∈ L(X, X ), we are able to put (2.72) in canonical form. As this point we focus on a difficulty that we encounter. Equation (2.72) was derived under the assumption that u ∈ C 2 (T, X). On the other hand the Euler equation (2.62) in Theorem 2.5.12 was obtained under the assumption that the extremal u belongs in C 1 (T, RN ). In what follows we show how we can overcome this difficulty. PROPOSITION 2.5.25 If L : U −→ R is a twice differentiable Lagrangian function (i.e., L ∈ C 2 (U )), (t0 , x0 , y0 ) ∈ U with 0 < t0 < b, and Lyy (t0 , x0 , y0 ) is an isomorphism from X into X ∗ , then (a) There exists a solution u of the Euler equation (2.62) defined on an open interval I0 containing t0 such that u(t0 ) = x0 , u (t0 ) = y0 and u is C 2 . (b) Every other solution u of the Euler equation (2.62) defined on an open interval I containing t0 and satisfying u(t0 ) = x0 , u (t0 ) = y0 coincides with u on an open interval containing t0 and u is C 2 on that interval. PROOF: Consider the map ψ : U −→ R × X × X defined by
ψ(t, x, y) = t, x, Ly (t, x, y) .
(2.73)
Because by hypothesis Lyy (t0 , x0 , y0 ) is an isomorphism from X onto X ∗ , we can apply the inverse theorem on the function Ly (see Theorem 1.1.25). So according to that theorem, we can find a neighborhood V of (t0 , x0 , y0 ) ∈ R × X × X and a neighborhood W of t0 , x0 , p0 = Ly (t0 , x0 , y0 ) ∈ R × X × X ∗ , such that the function ψ defined by (2.73) is a C 1 -diffeomorphism from V onto W . The inverse function ψ −1 (also a C 1 -function) is of the form (t, x, p) −→ t, x, y = g(t, x, p) . We consider the following system on X × X ∗
* ) x (t) = g t, x(t), p(t)
. (2.74) p (t) = Lx t, x(t), g t, x(t), p(t) Note that (2.74) is in canonical form (it is solved with respect to the higher-order derivatives x , p of the unknown functions x, p). The vector field of (2.74),
108
2 Extremal Problems and Optimal Control
(t, x, p) −→ g(t, x, p), Lx t, x, g(t, x, p) ,
is a C 1 -function from W into X × X ∗ and the triple (t0 , x0 , p0 ) corresponds to the Cauchy data of (2.74). So by the basic existence and uniqueness theorem for initial value problems in Banach spaces, we can find a unique maximal solution t −→ x(t), p(t) of (2.74) such that x(t0 ) = x0 and p(t0 ) = p0 . Let I be the open interval containing t0 on which the solution is defined. We know that on this interval the solution is C 2 . Let u(t) = x(t). Then u ∈ C 2 (I, X) satisfies the Euler equation (2.62) and the initial conditions u(t0 ) = x0 , u (t0 ) = y0 . Next let u : I −→ X be another solution defined on an interval I containing t0 satisfying u(t0 ) = x0 , u (t 0 ) = y0 . For t close to t0 , t, u(t), u (t) ∈ V . So we can consider ψ(t), u(t), u (t) (see (2.73)). Then the function t −→ u(t), u (t) solves (2.74) and satisfies the Cauchy data (t0 , x0 , y0 ). By virtue of the uniqueness of the solution, we conclude that for all t ∈ I ∩ I we have u(t) = u(t). REMARK 2.5.26 This proposition shows that in order to hope to be able to transform (2.72) to a canonical first-order system we need to assume that the Lagrangian function L is C 2 . Before proceeding to the Hamiltonian formulation of the necessary conditions for extremality, let us illustrate the use of Euler’s equation through some characteristic examples. EXAMPLE 2.5.27 (a) Let L(y) = 1 + y 2 and consider the problem inf IL (u): 1 u ∈ C ([0, 1]), u(0) = x0 , u(1) = x1 . Then the Euler equation is (d dt)(∂ ∂y) 1 + u (t)2 = 0, u(0) = x0 , u(1) = x1 , which gives u(t) = (x1 − x0 )t + x0 for all t ∈ T . This is a global minimum of IL (·) over Cx10 ,x1 ([0, 1]) and simply says that the curve with the minimum length joining x0 and x1 is the straight line connecting the two points. 1 (b) Let L(y)=y 3 and consider the problem inf[IL (u) : u ∈ C ([0, 1]), u(0) = 0, u(1) = 1]. Then the Euler equation is u (t)2 = 0, u(0) = 0, u(1) = 1. The unique solution of this boundary value problem is u(t) = t for t ∈ [0, 1]. This produces a 1 local minimum for IL on C0,1 ([0, 1]). Let v ∈ C01 ([0, 1]). Then u + v is admissible and we have
1
3 IL (u + v) = dt t + v(t) 0
1
v (t)dt +
= IL (u) + 3 0 1
1
3v (t)2 + v (t)3 dt
0
3v (t)2 + v (t)3 dt
= IL (u) +
(because v(0) = v(1) = 0).
0
Evidently if 3v (t)2 + v (t)3 ≥ 0 for all t ∈ [0, 1], then IL (u + v) ≥ IL (u). In particular if vC 1 ([0,1]) ≤ 3, then 3v (t)2 + v (t)3 ≥ 0 for all t ∈ [0, 1] and so IL (u + v) ≥ IL (u) which proves that the extremal u produces a local minimum of 1 IL on C0,1 ([0, 1]). (c) If L is not C 1 , then the extremal function need not be C 1 . Indeed let L(t, y) = t2/3 y 2 and consider the problem inf[IL (u) : u ∈ C 1 ([0, 1]), u(0) = 0, u(1) = 1]. In
2.5 Calculus of Variations this case the Euler equation has the form
2/3 2t u (t) = 0, u(0) = 0,
109
u(1) = 1.
Solving this boundary value problem, we obtain u(t) = t2/3 which does not 1 belong in C 1 ([0, 1]), but it is a global minimum of IL over C0,1 ([0, 1]). This example is due to Hilbert and shows that a variational problem does not always have a solution in the given class of curves under consideration. (d) In this example the Euler equation has no solutions and moreover, there is no solution even in the larger space of absolutely continuous functions. So let L(t, y) = (ty)2 and consider the problem inf[IL (u) : u ∈ C 1 ([0, 1]), u(0) = 0, u(1) = 1]. In this case the Euler equation has the form
2 2t u (t) = 0, u(0) = 0, u(1) = 1. The general solution of the differential equation is u(t) = (c/t) + d. First we observe that u does not belong in C 1 ([0, 1]) and none of these functions satisfies the boundary conditions u(0) = 0, u(1) = 1. In fact the variational problem has no solution in the space of absolutely continuous functions with the given boundary values. Indeed, if v(t) is such a function, then IL (v) > 0 and the value of the problem is zero. To see this consider nt if t ∈ [0, n1 ] . vn (t) = 1 if t ∈ [ n1 , 1] Then we have IL (xn ) −→ 0. This example is due to Weierstrass and was produced as an argument against Riemann’s justification of the Dirichlet principle. Now we introduce the Legendre transform, which is the “forefather” of the Legendre–Fenchel transform, which was introduced in Definition 1.2.15 and which is the basic tool in the duality theory of convex functions. DEFINITION 2.5.28 Let X be a Banach space, U ⊆ R × X × X a nonempty open set, and L : U −→ R a C 2 Lagrangian function. (a) The Legendre transform of L is the function L : U −→ R × X × X ∗ defined by
L(t, x, y) = t, x, p = Ly (t, x, y) . (b) We say that the Lagrangian is regular if the corresponding Legendre transform L is a local diffeomorphism. We say that the Lagrangian is hyperregular if the corresponding Legendre transform L is a diffeomorphism of U on an open set L(U ) ⊆ R × X × X ∗ . REMARK 2.5.29 From the inverse theorem (see Theorem 1.1.25), the Lagrangian L is regular if and only if the Fr´echet derivative of L at all (t, x, y) ∈ U is an isomorphism from T × X × X onto T × X × X ∗ . In what follows let D denote the Fr´echet derivative with respect to all three variables (t, x, y) ∈ U of the function involved. We have
DL(t, x, y)(λ, v, w) = λ, v, DLy (t, x, y)(λ, v, w) .
110
2 Extremal Problems and Optimal Control
Note that DLy (t, x, y)(λ, v, w) = λLyt (t, x, y) + Lyx (t, x, y)v + Lyy (t, x, y)w
in X ∗ .
Then DL(t, x, y) ∈ L(R × X × X, R × X × X ∗ ) is an isomorphism if and only if
Lyy (t, x, y) ∈ L(X, X ∗ ) is an isomorphism. In Proposition 2.5.25 we have assumed that Lyy (t0 , x0 , y0 ) ∈ L(X, X ∗ ) is an isomorphism. Recall that in L(X, X ∗ ) with the operator norm topology, the set of isomorphisms is open. So for all (t, x, y) near (t0 , x0 , y0 ) in R × X × X, we have that Lyy (t, x, y) ∈ L(X, X ∗ ) is an isomorphism. Therefore we see that the hypothesis in Proposition 2.5.25 implies that the Lagrangian L is regular in a neighborhood of the point (t0 , x0 , y0 ). that is hyperreguTHEOREM 2.5.30 If L : U −→ R is a C 2 Lagrangian function
lar, L is the Legendre transform of L with L−1 its inverse L−1 (t, x, y) = t, x, y = ∗ g(t, x, p) , and H : L(U ) −→ R × X × X is defined by H(t, x, p) = p, g(t, x, p)X − (L ◦ L−1 )(t, x, p), then the Euler equation
d
Ly t, u(t), u (t) = Lx t, u(t), u (t) dt
for all t ∈ T = [0, b]
is equivalent to the following first-order canonical system
) * x (t) = Hp t, x(t), p(t) . p (t) = −Hx t, x(t), p(t) for all t ∈ T = [0, b]
(2.75)
(2.76)
The function H is the Hamiltonian associated with the Lagrangian L and system (2.76) is called a Hamiltonian system. The equivalence of (2.75) and (2.76) is in the u(t) is a solution of the Euler equation (2.75), then t −→
following sense: if t −→ u(t), L y t, u(t), u (t) is a solution of the Hamiltonian system (2.76). Conversely, if t −→ x(t), p(t) is a solution of the Hamiltonian system (2.76), then t −→ u(t) = x(t) is a solution of the Euler equation (2.75). PROOF: In the proof of Proposition 2.5.25 we proved the local equivalence of (2.75) with the canonical system (2.74). In fact due to the hyperregularity of the Legendre transform L, this equivalence is actually global. So it suffices to show the equivalence of (2.74) and (2.76). By definition we have
H(t, x, p) = p, g(t, x, p)X − L t, x, g(t, x, p) . We have Hp (t, x, p) ∈ X ∗∗ . So for all x∗ ∈ X ∗ Hp (t, x, p), x∗ X ∗ = x∗ , g(t, x, p)X + p, gp (t, x, p)x∗ X
− Ly t, x, g(t, x, p) , gp (t, x, p)x∗ X .
(2.77)
But p = Ly t, x, g(t, x, p) . Hence from (2.77) we infer that for all x∗ ∈ X ∗ Hp (t, x, p), x∗ X ∗ = x∗ , g(t, x, p)X ⇒ Hp (t, x, p) = g(t, x, p) ∈ X.
(2.78)
2.6 Optimal Control
111
Then we see that the first equations in (2.74) and (2.76) are the same. Also if v ∈ X, then
Hx (t, x, p), v X = p, hx (t, x, p)v X − Lx t, x, g(t, x, p) , v X
− Ly t, x, g(t, x, p) , hx (t, x, p)v X . (2.79)
Again because p = Lx t, x, g(t, x, p) , from (2.79) we obtain
for all v ∈ X, Hx (t, x, p), v X = − Lx t, x, g(t, x, p) , v X
⇒ Hx (t, x, p) = Lx t, x, g(t, x, p) . EXAMPLE 2.5.31 The Poincar´ e half-plane: Let P = {(x, y) ∈ R2 : y > 0} and 2 L : P × R −→ R+ is defined by L(x, y, u, v) =
1 u2 + v 2 . 2 y2
The integral functional IL is defined by
1 b x (t)2 + y (t)2 IL (u) = dt, 2 0 y(t)2
where u : T = [0, b] −→ P and u(t) = x(t), y(t) for all t ∈ T . Then L(x, y, u, v) = (x, y, p, q)
with p = u y 2 , q = v y 2 . This is a diffeomorphism (i.e., L is hyperregular). Also H(x, y, p, q) =
1 2 2 y (p + q 2 ). 2
Then the Hamiltonian system (2.76) takes the following form: ) ) x (t) = y(t)2 p(t) p (t) = 0
. y (t) = y(t)2 q(t) q (t) = −y(t) p(t)2 + q(t)2 This system is a model for the hyperbolic geometry. For this reason its study is important in the understanding of non-Euclidean geometries.
2.6 Optimal Control In this section we study some basic aspects of optimal control theory. Specifically we focus our attention on the existence theory, the relaxation methods, and the derivation of the maximum principle (a necessary condition for optimality of an admissible state-control pair). To avoid technical complications that require the development of a substantial mathematical background, we limit ourselves to finite dimensional systems (i.e., systems driven by ordinary differential equations, also known as lumped parameter systems).
112
2 Extremal Problems and Optimal Control
So the mathematical setting is the following. The state space is RN and the control space is a Polish space Y . Recall that a Polish space is a Hausdorff topological space which is separable and can be metrized by means of a complete metric. The time horizon is T = [0, b]. Let Γ(T, Y ) = {u : T −→ Y : u is measurable}. Any element of Γ(T, Y ) is called a control. Also f : T × RN × Y −→ RN is a vector field and the controlled dynamical system we are considering is the following
x (t) = f t, x(t), u(t) a.e. on T, x(0) = x0 ∈ RN . (2.80) Any solution x(·) of (2.80) is referred to as a state trajectory of the control system corresponding to the initial state x0 ∈ RN and the control u(·). Note that we do not assume the uniqueness and/or the existence of solutions for (2.80). So for any control u(·) and any initial state x0 , we may have more than one or no response for the system. Moreover, in general we have some constraints on the control described by a multifunction (set-valued function) U : T −→ 2Y \ {∅}. For these reasons, the following definition is necessary.
DEFINITION 2.6.1 A pair x(·), u(·) ∈ W 1,1 (0, b), RN ×Γ(T, Y ) is said to be admissible (or feasible) state-control pair, if (2.80) is satisfied and u(t) ∈ U (t) a.e. on T . In what follows by αad we denote the set of all admissible state-control pairs. We are also given an integral cost functional
b
J(x, u) = L t, x(t), u(t) dt for all (x, u) ∈ αad . 0
Then our optimal control problem can be stated as follows: (P) Find (x, u) ∈ αad such that J(x, u) = inf J(x, u) : (x, u) ∈ αad = m.
(2.81)
then DEFINITION 2.6.2 If we can find (x, u) ∈ αad such that (2.81) is satisfied,
we say that (x, u) is an optimal admissible pair . The function x ∈ W 1,1 (0, b), RN is said to be an optimal trajectory and the function u ∈ Γ(T, Y ) is said to be an optimal control . The hypotheses on the data of the optimal control problem (P), are the following. H(f ): f : T × RN × Y −→ RN is a function, such that (i) For all (x, u) ∈ RN × Y, t −→ f (t, x, u) is measurable. (ii) For almost all t ∈ T, (x, u) −→ f (t, x, u) is continuous. (iii) For almost all t ∈ T , all x ∈ RN and all u ∈ U (t), we have f (t, x, u) ≤ α(t) + c(t)x
with α, c ∈ L1 (T )+ .
H(U): U : T −→ 2Y \ {∅} is a multifunction with compact values such that GrU = {(t, u) ∈ T × Y : u ∈ U (t)} ∈ B(T ) × B(Y ), with B(T ) (resp., B(Y )) being the Borel σ-field of T (resp., of Y ). REMARK 2.6.3 From measure theory we know that B(T )×B(Y ) = B(T ×Y )(= the Borel σ-field of T × Y ).
2.6 Optimal Control
113
H(L): L : T ×RN ×Y −→ R = R ∪ {+∞} is an integrand such that (i) (t, x, u) −→ L(t, x, u) is measurable. (ii) For almost all t ∈ T, (x, u) −→ L(t, x, u) is lower semicontinuous proper. (iii) For almost all t ∈ T , all x ∈ RN , and all u ∈ U (t) α0 (t) − c0 x ≤ L(t, x, u)
with α0 ∈ L1 (T ), c0 > 0.
In the existence theory the following convexity-type hypothesis plays a central role. Hc : For all (t, x) ∈ T × RN the set Q(t, x) = {(v, λ) ∈ RN ×R : v = f (t, x, u), u ∈ U (t), L(t, x, u) ≤ λ} is convex. REMARK 2.6.4 Hypotheses H(f), H(u), and H(L) imply that for all (t, x) ∈ T × RN , Q(t, x) is also closed. Hypothesis Hc means that the optimal control problem has enough “convex structure”. Note that if the control variable enters linearly in the dynamics of the system (i.e., f (t, x, u) = f1 (t, x) + f2 (t, x)u), Y = Rm , the control constraint multifunction has also convex values and the cost integrand L(t, x, u) is in addition convex in u ∈ Rm , then the hypothesis Hc is N satisfied. Note
that this hypothesis implies that for almost all t ∈ T and all x ∈ R , F (t, x) = f t, x, U (t) is convex. In Chapter 6, we produce equivalent conditions for Hc to hold.
1 In what follows let αad ⊆ W 1,1 (0, b), RN be the set of admissible states (traN jectories). We start by establishing the nonemptiness and
compactness in C(T, R ) 1 1,1 N of αad . Recall that the Sobolev space W (0, b), R is embedded continuously 1 (but not compactly) in C(T, RN ). To determine the properties of αad , we study the following differential inclusion.
) * x (t) ∈ F t, x(t) a.e. on T = [0, b], . (2.82) x(0) = x0 We impose the following conditions on the multifunction F (t, x): N
H(F): F : T × RN −→ 2R \ {∅} is a multifunction with compact and convex values such that (i) For all x ∈ RN , GrF (·, x)={(t, v)∈T ×RN : v∈F (t, x)}∈B(T ) × B(RN ). (ii) For almost all t ∈ T, GrF (t, ·) = {(x, v) ∈ RN ×RN : v ∈ F (t, x)} is closed. (iii) For almost all t ∈ T , all x ∈ RN , and all v ∈ F (t, x), we have v ≤ α(t) + c(t)x
with α, c ∈ L1 (T )+ .
REMARK 2.6.5 If F (t, x) = f t, x, U (t) , then by virtue of hypotheses H(f), H(U), H(L), and Hc , the multifunction F satisfies hypotheses H(F). DEFINITION
2.6.6 By a solution of (2.82), we mean a function x ∈ W 1,1 (0, b), RN such that x(0) = x0 and x (t) ∈ F t, x(t) for almost all t ∈ T . We
denote the set of solutions of (2.82) by SF (x0 ). Then SF (x0 ) ⊆ W 1,1 (0, b), RN ⊆ C(T, RN ).
114
2 Extremal Problems and Optimal Control
To be able to solve (2.82) and eventually study the optimal control problem, we need some results from multivalued analysis, which we state here for easy reference and postpone their proof until Chapter 6, where we conduct a more systematic and detailed study of multifunctions. The first result is known as the Kakutani–Ky Fan fixed point theorem. THEOREM 2.6.7 If X is a locally convex space, C ⊆ X is nonempty, compact and convex, and G : C −→ 2C is a multifunction with nonempty, closed and convex values that has a closed graph (i.e., Gr G = {(x, y) ∈ C × C : y ∈ G(x)} is closed in X × X), then there exists x ∈ X such that x ∈ G(x). The second result is known as the Yankov–von Neumann–Aumann selection theorem. It is stated in a less general form, which however suffices for our needs here. The general form of the result can be found in Theorem 6.3.20. THEOREM 2.6.8 If (Ω, Σ, µ) is a σ-finite measure space, X is a Polish space, and G : Ω −→ 2X is a multifunction such that Gr G = {(ω, x) ∈ Ω × X : y ∈ G(ω)} ∈ Σ × B(X), then there exists a Σ-measurable function g : Ω −→ X such that g(ω) ∈ G(ω) µ-a.e. on Ω. It is well known that given a Borel set in R2 , its projection on a coordinate axis need not be Borel. The next theorem provides conditions which guarantee that the projection is indeed Borel. THEOREM 2.6.9 If S, X are Polish spaces, G ∈ B(S × X) = B(S) × B(X), and for every s ∈ S the section G(s) = {x ∈ X : (s, x) ∈ G} is σ-compact, then projS G ∈ B(S). Now we are ready to determine the properties of the solution set S(x0 ) of problem (2.82). THEOREM 2.6.10 If hypotheses H(F ) hold, then SF (x0 ) = ∅ and SF (x0 ) is compact in C(T, RN ). PROOF: We start by establishing an a priori bound for the elements of SF (x0 ). 1 N So suppose that x ∈ SF (x0 ). Then for some v ∈ L (T, R ) that satisfies v(t) ∈ F t, x(t) a.e. on T , we have
t
x(t) ≤ x0 +
v(s)ds
0
⇒ x(t) ≤ x0 +
t
for all t ∈ T,
α(s) + c(s)x(s)
for all t ∈ T.
0
Invoking Gronwall’s inequality, we can find M1 > 0 such that x(t) ≤ M1
for all t ∈ T and all x ∈ S(x0 ).
Let pM1 : RN −→ RN be the M1 -radial contraction; that is,
2.6 Optimal Control pM1 (x) =
M1 x x
115
if x > M1
. if x ≤ M1
Clearly pM1 (·) is Lipchitz continuous. Let F1 (t, x) = F t, pM1 (x) . Then F1 still satisfies H(F )(i) and (ii) (with F replaced by F1 ) and in addition for almost all t ∈ T , all x ∈ RN , and all v ∈ F1 (t, x), we have x
v ≤ η(t) a.e. on T, with η(·) = α(·) + c(·)M ∈ L1 (T )+ . Set C = g ∈ L1 (T, RN ) : g(t) ≤ η(t) a.e. on T . By virtue of the Dunford– Pettis theorem, C furnished with the relative weak topology is a compact convex set. Let ξ : C −→ C(T, RN ) be defined by
t g(s)ds. ξ(g)(t) = x0 + 0
Via the Arzela–Ascoli theorem, we check that ξ is sequentially continuous from C with the relative weak topology into C(T, RN ) with the norm topology. Then let G1 : C −→ 2C be defined by
a.e. on T }. G1 (g) = {h ∈ L1 (T, RN ) : h(t) ∈ F1 t, ξ(g)(t) Let ξ(g) ∈ C(T, RN ) and let {sn }n≥1 be step functions from T into RN such that sn (t) −→ x(t) a.e. on T as n → ∞. Then because for all y ∈ RN , t −→ F1 (t, y) has a N measurable graph, applying Theorem 2.6.8 for every n ≥ 1 we can find hn : T −→ R a measurable map such that hn (t) ∈ F1 t, sn (t) a.e on T . Evidently hn (t) ≤ η(t) a.e on T and so by the Dunford–Pettis theorem and by passing to a suitable w subsequence if necessary, we may assume that hn −→ h in L1 (T, RN ). Then using Mazur’s lemma and
the fact that for almost all t ∈ T, y −→ F1 (t, y) has closed graph, we have h(t) ∈ F1 t, x(t) a.e. on T (i.e., h ∈ G1 (g)). So G1 has nonempty values, which clearly are closed and convex in C. Moreover, the above argument reveals that Gr G ⊆ C × C is sequentially closed in C × C, when C is equipped with the relative weak topology. Recall that the relative weak topology on C is metrizable. So we can apply Theorem 2.6.7 and obtain g ∈ C such that g ∈ G1 (g). Then if x = ξ(g), we have
x (t) ∈ F1 t, x(t) a.e. on T, x(0) = x0 ,
t v(s)ds for all t ∈ T, with v ∈ L1 (T, RN ), ⇒ x(t) ≤ x0 + 0
v(s) ∈ F1 s, x(s) a.e. on T. (2.83) But from the definition of F1 , we see that v(s) ≤ α(s) + c(s)x a.e. on T and so from (2.83) and Gronwall’s inequality as before it follows that for all t ∈ T, x(t) ≤ M1
for all t ∈ T ⇒ F1 t, x(t) = F t, x(t)
(i.e., x ∈ SF (x0 )).
Therefore we have proved the nonemptiness of SF (x0 ). Clearly S(x0 ) ⊆ C(T, RN ) is closed, whereas from the Arzela–Ascoli theorem we have that S(x0 ) is relatively compact in C(T, RN ). Then SF (x0 ) is compact in C(T, RN ).
116
2 Extremal Problems and Optimal Control
Now if F (t, x) = f t, x, U (t) and x ∈ S(x0 ), then we set
V (t) = {u ∈ U (t) : x (t) = f t, x(t), u },
⇒ Gr V = {(t, u) : x (t) = f t, x(t), u } ∩ Gr U.
Because of hypotheses H(f )(i),(ii), (t, u)−→x (t)−f t, x(t), u is a Carath´eodory
function (i.e., for all u ∈ Y, t−→x (t)−f t, x(t), u is measurable, whereas for almost all t ∈ T, u−→x (t)−f t, x(t), u is continuous). Hence (t, u) −→ x (t) − f t, x(t), u is measurable and combining this with hypothesis H(U ) we see that Gr V ∈ L(T ) × B(Y ) with L(T ) being the Lebesgue σ-field of T and B(Y ) the Borel σ-field of Y . So we can apply Theorem 2.6.8 and obtain u : T −→ Y a measurable map such that u(t) ∈ V (t) a.e. on T . Then (x, u) ∈ αad and so Theorem 2.6.10 implies that 1 αad = SF (x0 ) ⊆ C(T, RN ) is compact. Next we solve the optimal control problem (P). The approach is the following. We use hypothesis Hc to transform (P) into a control-free variational problem with convex structure (calculus of variations problem) with the same values as (P). We solve the calculus of variations problem using the direct method . This method is known as the reduction method . THEOREM 2.6.11 If hypotheses H(f ), H(U ), H(L), and Hc hold and m < +∞, 1 then problem (P) admits an optimal state-control pair (x, u) ∈ αad . PROOF: We start implementing the reduction method described above. To this end let A(t, x, v) = {u ∈ U (t) : v = f (t, x, u)}. This is the set of all admissible controls which at time t ∈ T and when the system is at state x ∈ RN , produce the “velocity” v ∈ RN . Evidently, by modifying f, U , and L on a Lebesgue-null set, we have Gr A = (t, x, v, u) ∈ T ×RN ×RN ×Y : (t, u) ∈ Gr U, v − f (t, x, u) = 0 ∈ B(T ) × B(RN ) × B(RN ) × B(Y ). Let p : T ×RN ×RN −→ R = R ∪ {+∞} be defined by p(t, x, v) = inf[L(t, x, u) : u ∈ A(t, x, v)]
(2.84)
which represents the minimum cost to generate “velocity” v, at time t ∈ T , when the state of the system is x ∈ RN and we use admissible controls. As always inf ∅ = +∞. Claim 1: (t, x, v) −→ p(t, x, v) is Borel-measurable. For every λ ∈ R we have {(t, x, v) ∈ T × RN × RN : p(t, x, v) ≤ λ} = projT ×RN ×RN (t, x, v, u) ∈ T × RN × RN × Y : L(t, x, u) ≤ λ, u ∈ A(t, x, v) ∈ B(T ) × B(RN ) × B(RN ) (see Theorem 2.6.9). Claim 2: For every t ∈ T , the function (x, v) −→ p(t, x, v) is lower semicontinuous.
2.6 Optimal Control
117
We need to show that for every λ ∈ R, the set S(λ) = {(x, v) ∈ RN × RN : p(t, x, v) ≤ λ} is closed. So let {(xn , vn )}n≥1 ⊆ S(λ) and assume that xn −→ x, vn −→ v in RN as n → ∞. From (2.84) we know that we can find un ∈ A(t, xn , vn ) such that p(t, xn , vn ) = L(t, xn , un ). We have un ∈ U (t) and vn = f (t, xn , un ). By passing to a suitable subsequence if necessary, we may assume that un −→ u ∈ U (t). Then v = f (t, x, u) (see hypothesis H(f )(ii)) and so u ∈ A(t, x, v). Therefore p(t, x, v) ≤ L(t, x, u) ≤ lim inf L(t, xn , un ) = lim inf p(t, xn , vn ) ≤ λ n→∞
n→∞
(see hypothesis H(L)(ii)), ⇒ (x, v) ∈ S(λ),
(i.e., p(t, ·, ·) is lower semicontinuous).
Claim 3: For all (t, x) ∈ T × RN , v −→ p(t, x, v) is convex. Note that epi(t, x, ·) = {(v, λ) ∈ RN × R : p(t, x, v) ≤ λ} # = {(v, λ) ∈ RN × R : L(t, x, u) ≤ λ + ε, ε>0
u ∈ U (t), v = f (t, x, u)}. So by virtue of hypothesis Hc , epi(t, x, ·) is convex; that is, v −→ p(t, x, v) is convex as claimed. Now let {(xn , un )}n≥1 ⊆ αad be a minimizing sequence for problem (P); that is, J(xn , un ) ↓ m as n → ∞. Because of Theorem 2.6.10, we may assume that xn −→ x in C(T, RN ). Also from hypothesis H(f )(iii) we see that {xn (·)}n≥1 ⊆ L1 (T, RN ) is uniformly integrable and so by the Dunford–Pettis theorem, we may assume that w xn −→ v in L1 (T, RN ). Evidently v = x . Using Claims 1, 2, and 3 and Theorem 2.1.28, we obtain
b
b
p t, x(t), x (t) dt ≤ lim inf p t, xn (t), xn (t) dt n→∞
0
0
≤ lim J(xn , un ) = m < +∞. n→∞
So due to hypothesis H(L)(iii) and by redefining t −→ p t, x(t), x (t) on a
Lebesgue-null set, we can say that for all t ∈ T, p t, x(t), x (t) is finite. A straightforward application of Theorem 2.6.8 produces a measurable function u : T −→ Y such that u(t) ∈ A t, x(t), x (t) for almost all t ∈ T and
p t, x(t), x (t) = L t, x(t), u (t) a.e. on T, ⇒ J(x, u) ≤ m
and (x, u) ∈ αad ,
⇒ J(x, u) = m
(i.e., (x, u) is an optimal state–control pair).
Reviewing the proof of the above theorem, we see that hypothesis Hc was crucial in the argument because it provided the needed convex structure for the direct method of the calculus of variations to work. If Hc fails, we need not have a solution. Then, in order to capture the asymptotic behavior of the minimizing sequences, we
118
2 Extremal Problems and Optimal Control
embed the original problem in a “larger” system exhibiting the necessary convex structure that guarantees existence of optimal pairs. This method of augmenting the system is known as relaxation. There is no unique approach to relaxation. Nevertheless, we can agree that a reasonable relaxation method should meet the following three criteria. (i) Every original state is also a relaxed state. (ii) The set of original states is dense in the set of relaxed states. (iii) The relaxed problem admits a solution and the values of the two problems (relaxed and original) are equal. The first two requirements concern the dynamics of the system, and the third also involves the cost functional. The requirement that the values of the two problems are equal is known as relaxability. If relaxability fails, it can be said that the original system has been enlarged too much. A relaxation method that meets the three criteria is said to be admissible. Next we present some different ways to relax (convexify) the original problem (P). The first relaxation method has its roots in the following observation. We recall that a sequence {un }n≥1 ⊆ L1 (T, Rm ) that converges weakly but not strongly to a limit u oscillates violently around its limit. However, in the limit u a great deal of information about the faster and faster oscillations is forgotten and only an average value is registered in the limit. Clearly this is not satisfactory if the control enters in a nonlinear fashion in the dynamics. The idea then is to assign as a limit not a usual Rm -valued function, but a probability-valued function, known as a transition measure (or parametrized measure or Young measure). DEFINITION 2.6.12 Let (Ω, Σ, µ) be a finite measure space and Y a Polish 1 space. Let M+ (Y ) be the space of all probability measures on Y . A relaxed control 1 (or transition probability or Young measure) is a function λ : Ω −→ M+ (Y ), such that for all C ∈ B(Y ) = the Borel σ-field of Y, ω −→ λ(ω)(C) is Σ-measurable. We denote the set of all relaxed controls from Ω into Y by R(Ω, Y ). 1 REMARK 2.6.13 The “narrow topology” on M+ (Y ) is the weakest topology on 1 1 M+ (Y ) that makes continuous all the maps ψu : M+ (Y ) −→ R with u ∈ Cb (Y ) = {u : Y −→ R : u is continuous and bounded} defined by ψu (λ) = Y u(y)λ(dy). If 1 1 we topologize M+ (Y ) this way, then λ ∈ R(Ω, Y ) if and only if λ : Ω −→ M+ (Y ) is 1 Σ-measurable. So the narrow topology is the topology w M+ (Y ), Cb (Y ) ). We can define an analogue of it on the space R(Ω, Y ) of relaxed controls.
DEFINITION 2.6.14 Let Car(Ω × Y ) be the space of L1 -Carath´eodory integrands. Namely all functions ϕ : Ω × Y −→ R such that (i) For all y ∈ Y, ω −→ ϕ(ω, y) is Σ-measurable. (ii) For µ-almost all ω ∈ Ω, y −→ ϕ(ω, y) is continuous. (iii) There exists h ∈ L1 (Ω)+ such that for µ-almost all ω ∈ Ω and all y ∈ R, |ϕ(ω, y)| ≤ h(ω). The narrow topology on R(Ω, Y ) is the weakest topology on R(Ω, Y ) with respect to which the functionals
2.6 Optimal Control
119
λ −→ Iϕ (λ) =
ϕ(ω, y)λ(ω)(dy)dµ,
ϕ ∈ Car(Ω × Y )
Ω Y
are continuous.
So the narrow topology on R(Ω, Y ) is the topology w R(Ω, Y ), Car(Ω × Y ) . REMARK 2.6.15 We say that an integrand ϕ : Ω×Y −→R = R ∪ {+∞} is normal if (i) ϕ is Σ × B(Y )-measurable. (ii) For µ-almost all ω ∈ Ω, y −→ ϕ(ω, y) is proper and lower semicontinuous. A positive normal integrand can be approximated pointwise from below by integrands in Car(Ω × Y ). So equivalently the narrow topology on R(Ω, Y ) can be defined as the weakest topology that makes all functionals λ −→ Iϕ (λ) = ϕ(ω, y)λ(ω)(dy)dµ lower semicontinuous as ϕ ranges over all positive norΩ Y
∗ mal integrands. If Y is compact, then R(Ω, Y ) ⊆ L∞ Ω, M (Y )w∗ = L1 Ω, C(Y ) (here M (Y ) is the space of all Radon measures on Y ; recall that C(Y )∗ = M (Y )) and the narrow topology on R(Ω, Y ) coincides with the relative w∗ -topology in 1 L∞ Ω, M (Y )w∗ . If Σ is countably generated, then L Ω, C(Y ) is separable and so
on bounded subsets of L∞ Ω, M (Y )w∗ (such as R(Ω, Y )), the relative w∗ −topology is metrizable. In the sequel this is the context in which we use the narrow topology on R(Ω, Y ). In what follows for simplicity we set Y = Rm . m
H(U)1 : U : T −→ 2R \ {∅} is a multifunction with compact values such that Gr U ∈ B(T ) × B(Rm ) and there exists r > 0 such that for almost all t ∈ T and all u ∈ U (t), u ≤ r. We set B r = {u ∈ Rm : u ≤ r} and we introduce the constraint set for the relaxed controls, namely
1 Σ(t) = µ ∈ M+ (B r ) : µ U (t) = 1 .
Then given a state function x ∈ W 1,1 (0, b), RN ⊆ C(T, RN ), the set of admissible relaxed controls is given by SΣ = {λ ∈ R(T, B r ) : λ(t) ∈ Σ(t) a.e. on T }. Now we have all the necessary tools to introduce and study the first relaxation of problem (P) which is based on Young measures (see Definition 2.6.12):
b ⎧ ⎫ Jr1 (x, λ) = 0 B r L t, x(t), u λ(t)(du)dt −→ inf = m1r ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎬
. (2.85) s.t. x (t) = B r f t, x(t), u λ(t)(du)dt a.e. on T ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩ ⎭ x(0) = x0 , λ ∈ SΣ Note that in (2.85) in both the dynamics and the cost functional, the relaxed control enters linearly. This provides problem (2.85) with the necessary convex structure to obtain an optimal pair. For problem (2.85) every original control u(·) can be viewed as a relaxed control by considering the Dirac transition probability δu(·) . So the first requirement for admissibility is satisfied.
120
2 Extremal Problems and Optimal Control
PROPOSITION 2.6.16 If hypotheses H(f ), H(U )1 , and H(L) hold and m < +∞,
then problem (2.85) has an optimal pair (x, λ) ∈ W 1,1 (0, b), RN × SΣ ; that is, Jr1 (x, λ) = m1r . PROOF: Evidently −∞ < m1r ≤ m < ∞. Also let{(x n , λn )}n≥1 be a minimizing sequence for problem (2.85). Note that if F (t, x) = B r f (t, x, u)λ(t)(du) : λ∈SΣ , then F satisfies hypotheses H(F ). On the other hand by virtue of Remark 2.6.15,
SΣ ⊆ L∞ T, M (B r )w∗ is w∗ -compact. So we may assume that xn −→ x in C(T, RN ) w∗
λn −→ λ ∈ SΣ
in L
(see Theorem 2.6.10) and T, M (B r )w∗ .
∞
Also from the dynamics of (2.85) and hypothesis H(f )(iii), we see that xn −→ x w
in L1 (T, RN ).
We have
f t, xn (t), · − f t, x(t), · C(T,Rm ) = max f t, xn (t), u − f t, x(t), u u∈B r
=f t, xn (t), un − f t, x(t), un , with un ∈ B r . We may assume that un −→ u in Rm . Then by virtue of hypothesis H(f )(ii)
f t, xn (t), un − f t, x(t), un −→ 0 as n → ∞,
⇒ fn (t) = f t, xn (t), · −→ f t, x(t), · = f (t) in C(B r , Rm ) as n → ∞,
⇒ fn −→ f in L1 T, C(B r , Rm ) as n → ∞.
w∗ Because λn −→ λ in L∞ T, M (B r )w∗ , for every C ∈ B(T ) we have
f t, xn (t), u λn (t)(du)dt −→ f t, x(t), u λ(t)(du) and
C
x (t)dt C n
Br
−→
C
Br
x (t)dt. So in the limit we have
x (t)dt = f t, x(t), u λ(t)(du)dt for all C ∈ B, C C Br
⇒ x (t) = f t, x(t), u λ(t)(du) for almost all t ∈ T, x(0) = x0 .
C
Br
Therefore the pair (x, λ) is admissible for the relaxed problem (2.85).
Let Ln (t, u) = L t, xn (t), u . Because of hypotheses H(L), this is a normal integrand (see Remark 2.6.15) and so we can find Lkn (t, u), k ≥ 1, Carath´eodory integrands such that Lkn (t, u) ↑ Ln (t, u) and
for almost all t ∈ T, all u ∈ B r as k −→ ∞
α0 (t) − c0 xn (t) ≤ Lkn (t, u)
for almost all t ∈ T, all u ∈ B r .
w∗ Then because xn −→ x in C(T, RN ) and λn −→ λ in L∞ T, M (B r )w∗ , we have
2.6 Optimal Control
b
b
Lkn t, xn (t), u λn (t)(du)dt −→
Br
0
121
Lk t, x(t), u λ(t)(du)dt,
Br
0
for all k ≥ 1, as n → ∞. Also from the monotone convergence theorem, we have
b
b
Lk t, x(t), u λ(t)(du)dt ↑ L t, x(t), u λ(t)(du)dt 0
Br
Br
0
as k −→ ∞.
Therefore according to Proposition 1.5.25 we can find a sequence {k(n)}n≥1 such that k(n) −→ +∞ as n → ∞ and
b 0
Lk(n) t, xn (t), u λn (t)(du)dt −→
b
Br
0
L t, x(t), u λ(t)(du)dt.
Br
b b
Because 0 B r Lk(n) t, xn (t), u λn (t)(du)dt ≤ 0 L t, xn (t), u λn (t)(du)dt for all n ≥ 1, we have
b
b
L t, x(t), u λ(t)(du)dt ≤ lim inf L t, xn (t), u λn (t)(du)dt ⇒
Br 0 1 Jr (x, λ)
n→∞
≤ lim inf n→∞
Jr1 (xn , λn )
=
0
Br
m1r .
Because (x, λ) is admissible for the relaxed problem (2.85), we conclude that Jr1 (x, λ) = m1r . To establish the admissibility of the relaxed problem (2.85), we need to have that the original states are dense in the relaxed ones for the C(T, RN )-norm. This gives equality of the values of the original and relaxed problems. To do this we need one more result from multivalued analysis which we state here for convenience and postpone its proof until Section 6.4. PROPOSITION 2.6.17 If Ω, Σ, µ is a σ-finite nonatomic measure space, X is a separable Banach space, F : Ω −→ 2X \{∅} a multifunction such that Gr F ={(ω, x) ∈ Ω × X : x ∈ F (ω)} ∈ Σ × B(X), and for some 1 ≤ p ≤ ∞, SFp = {u ∈ Lp (Ω, X) : u(ω) ∈ F (ω) µ-a.e.} = ∅, then denoting by w (resp., w∗ ) the weak (resp., weak∗ ) topology on Lp (Ω, X), 1 ≤ p < ∞ (resp., on L∞ (Ω, X)) we have SFp
w
p = SconvF 1 ≤ p<∞
(resp., SFp
w∗
p = SconvF for p = +∞).
Here by convF , we denote the multifunction ω −→ conv F (ω) and p = u ∈ Lp (Ω, X) : u(ω) ∈ conv F (ω) µ-a.e. on Ω . SconvF With the help of this abstract result for multifunctions, we are able to show the density for the C(T, RN )-norm topology of the original states in the relaxed ones (second requirement for the admissibility of a relaxation method). For this we need to strengthen our hypotheses on f as follows.
122
2 Extremal Problems and Optimal Control
H(f )1 : f : T ×RN ×Rm −→ RN is a function, such that (i) For all (x, u) ∈ RN × Rm , t −→ f (t, x, u) is measurable. (ii) For almost all t ∈ T , all x, y ∈ RN , and all u ∈ U (t), we have f (t, x, u) − f (t, y, u) ≤ k(t)x − y
with k ∈ L1 (T )+
and for almost all t ∈ T and all x ∈ RN , u −→ f (t, x, u) is continuous. (iii) For almost all t ∈ T , all x ∈ RN and all u ∈ U (t) f (t, x, u) ≤ α(t) + c(t)x
with α, c ∈ L1 (T )+ .
1 we denote the set of admissible states for the original In what follows by αad 1 system (see problem (P)) and by αad,r we denote the set of admissible states for 1 the relaxed system (2.85).
1 PROPOSITION 2.6.18 If hypotheses H(f )1 , H(U )1 and H(L) hold, then αad = 1 N αad,r1 the closure taken in the C(T, R )-norm.
PROOF: For every (t, x) ∈ T × RN , let
F (t, x) = f t, x, U (t) and G(t, x) = f (t, x, u)µ(du) : µ ∈ Σ(t) . Br
We claim that conv F (t, x) = G(t, x). Note that f t, x, U (t) is compact and then so is conv F (t, x). Also it is clear that F (t, x) ⊆ G(t, x) and the latter is a 1 convex set. Moreover, M+ (B r ) furnished with the narrow topology (see Remark 2.6.13), which due to the compactness of B r coincides with the relative w∗ -topology on M (B r ) = space of Radon measures on B r (recall that C(B r )∗ = M (B r )), is compact metrizable. Let {vn }n≥1 ⊆ G(t, x) and suppose vn −→ v in RN . We have
f (t, x, u)µn (du) with µn ∈ Σ(t). vn = Br
We may assume that µn −→ µ narrowly (equivalently in the relative w∗ -topology) 1 in M+ (B r ). So from the portmanteau theorem we have
lim sup µn U (t) ≤ µ U (t) , n→∞
⇒ 1 ≤ µ U (t) .
1 (B r ), we have µ U (t) = 1 and so µ ∈ Σ(t). Also Because µ ∈ M+
f (t, x, u)µn (du) −→
vn = Br
f (t, x, u)µ(du) = v ∈ G(t, x). Br
Therefore G(t, x) is closed and so conv F (t, x) ⊆ G(t, x).
(2.86)
2.6 Optimal Control
123
On the other hand if v ∈ G(t, x), we have v = B r f (t, x, u)µ(du), µ ∈ Σ(t). We n n rk δuk with uk ∈ U (t) and {rk }n≥1 ⊆ [0, 1], rk = 1 such that can find sn = w∗
k=1
k=1
1 (B r ). Then sn −→ µ in M+
vn =
f (t, x, u)sn (du) = Br
and vn −→ v =
Br
n
rk f (t, x, uk ) ∈ conv F (t, x)
k=1
f (t, x, u)µ(du). So it follows conv F (t, x) = G(t, x)
(see (2.86)).
(2.87)
Let SconvF (x0 ) be the solution set of (2.82) when the multivalued right hand side is conv F and by SG (x0 ) the solution set of (2.82) when the multivalued right hand is G. Then from (2.87) it follows that SconvF (x0 ) = SG (x0 ).
(2.88)
Because of hypothesis H(f )(ii) for almost all t ∈ T , x −→ convF (t, x) is Lipchitz continuous for the Hausdorff metric. So invoking the relaxation theorem for differential inclusions (see Denkowski–Mig´ orski–Papageorgiou [195, p. 262], we know that SconvF (x0 ) = SF (x0 ) the closure taken in C(T, RN ). (2.89) 1 1 = SF (x0 ) and αad,r = SG (x0 ), from (2.88) and (2.89) we conclude Because αad 1 that 1 1 αad,r = αad the closure taken in C(T, RN ). 1
REMARK 2.6.19 It is well-known that the relaxation theorem for differential inclusions fails if the multivalued nonlinearity F (t, x) is only continuous in the Hausdorff metric in the x ∈ RN -variable. For this reason we had to strengthen the hypothesis on the vector field x −→ f (t, x, u) (see hypothesis H(f )1 (iii)). The final step in the analysis of the relaxed problem (2.85) is to show that m1r = m (relaxability). This implies that the relaxation method of problem (2.85) is in fact admissible. To achieve this, we strengthen our hypotheses on the cost integrand L as follows. H(L)1 : L : T ×RN ×Rm −→ R is an integrand such that (i) For all (x, u) ∈ RN × Rm , t −→ L(t, x, u) is measurable. (ii) For almost all t ∈ T, (x, u) −→ L(t, x, u) is continuous. (iii) For almost all t ∈ T , all x ∈ RN with x ≤ n, n ≥ 1, and all u ∈ U (t), |L(t, x, u)| ≤ ηn (t)
with ηn ∈ L1 (T )+ .
THEOREM 2.6.20 If hypotheses H(f )1 , H(U )1 , and H(L)1 hold, then m1r = m.
124
2 Extremal Problems and Optimal Control
PROOF: From Proposition 2.6.16 we know that we can find (x, λ) an admissible state-control pair for the relaxed problem (2.85) such that Jr1 (x, λ) = m1r . Also by virtue of Propositions 2.6.17 and 2.6.18 we can find (xn , un ) ∈ αad such that
w∗ xn −→ x in C(T, RN ) and δun −→ λ in L∞ T, M (B r )w∗ as n → ∞.
Set Ln (t)(u) = L t, xn (t), u and L(t)(u) = L t, x(t), u . Evidently Ln −→ L
in L1 T, C(B r ) . So if by ·, · we denote the duality brackets for the pair
L1 T, C(B r ) , L∞ T, M (B r )w∗ , we have
b
. / . /
L t, xn (t), un (t) dt = Ln , δun −→ L, λ
0
b
= 0
⇒m≤
L t, x(t), u λ(t)(du)dt = m1r ,
Br m1r .
Because the opposite inequality is clearly true, we conclude that m = m1r .
So we have established the admissibility of the relaxation method based on Young measures. The next relaxation method is suggested by the reduction method used in the proof of Theorem 2.6.11. We introduce the following relaxed problem: ⎧ ⎫
b Jr2 (x, x ) = 0 p∗∗ t, x(t), x (t) dt −→ inf = m2r ⎬ ⎨ . (2.90)
⎩ ⎭ s.t. x (t) ∈ convF t, x(t) a.e. on T, x(0) = x0 Here p∗∗ stands for the second conjugate (in the sense of Definition 1.2.15) of the
function v −→ p(t, x, v). Also as before F (t, x) = f t, x, U (t) . Note that problem (2.90) is control-free (a calculus of variations problem with multivalued dynamic 1 constraints). In what follows by αad,r we denote the set of admissible states for 2 this new problem (2.90). PROPOSITION 2.6.21 If hypotheses H(f )1 , H(U )1 , and H(L) hold, then 1 1 1 αad,r = αad,r , m1r = m2r , and there exists x ∈ αad,r such that 1 2 2 Jr2 (x, x ) = m2r . PROOF: From the proof of Proposition 2.6.18, we know that f (t, x, u)µ(du) : µ ∈ Σ(t) . conv F (t, x) = Br 1 1 From (2.91) it follows that αad,r = αad,r . 1 2 By definition we have
(2.91)
2.6 Optimal Control 125 p∗∗ (t, x, v) = inf η ∈ R : (v, η) ∈ conv epi p(t, x, ·) . (2.92)
As always inf ∅ = +∞. Set H(t, x) = epi p(t, x, ·) =
f (t, x, u), η : u ∈ U (t), L(t, x, u) ≤ η .
As in the proof of Proposition 2.6.18, we can show that conv H(t, x) = conv epi p(t, x, ·)
f (t, x, u)µ(du), η : µ ∈ Σ(t), = Br
L(t, x, u)µ(du) ≤ η .
Br
Hence we have p∗∗ (t, x, v) = inf
L(t, x, u)µ(du) : µ ∈ Σ(t), v =
Br
f (t, x, u)µ(du) . (2.93)
Br
1 (B r ) Because µ −→ B r L(t, x, u)µ(du) is narrowly lower semicontinuous and M+ is narrowly compact, from Theorem 2.1.10, we see that the infimum in (2.93) is attained and an application of Theorem 2.6.8 implies that the minimizing measure depends measurable on t ∈ T . Combining this fact with Proposition 2.6.16, we infer that m1r = m2r and for x the optimal state for problem (2.85), we also have
Jr2 (x, x ) = m2r . Combining Propositions 2.6.18 and 2.6.21, we see the following. 1 = PROPOSITION 2.6.22 If hypotheses H(f ), H(U )1 , and H(L) hold, then αad 1 N αad,r2 , the closure taken in the C(T, R ) norm.
Now we can establish the admissibility of the second relaxed problem (2.90). THEOREM 2.6.23 If hypotheses H(f ), H(U )1 , and H(L)1 hold, then m2r = m. PROOF: From Theorem 2.6.20 we know that m1r = m. On the other hand Proposition 2.6.21 says that m1r = m2r . So finally m2r = m. So the second relaxation method, which was motivated from the reduction method, is also admissible. The third relaxed problem has its roots in the well-known theorem of Carath´eodory for the representation of convex sets in RN . Let us recall that theorem. THEOREM 2.6.24 If C ⊆ RN is nonempty, then every point of the set conv C is a convex combination of no more than n + 1 distinct points of the set C. Motivated by this result, we introduce the following relaxed problem. In what +1 N +1 follows u = (uk )N k=1 and r = (rk )k=1 .
126
2 Extremal Problems and Optimal Control ⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩
Jr3 (x, u, r) =
s.t.
x (t) =
N +1
+1 b N 0
rk (t)L t, x(t), uk dt −→ inf = m3r
k=1
rk (t)f t, x(t), uk (t) a.e. on T, x(0) = x0
k=1
uk ∈ L1 (T, Rm ), u(t) ∈ U (t) a.e. on T rk : T −→ [0, 1] measurable
N +1 k=1
rk (t) = 1
for all t ∈ T
⎫ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎬ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎭
.
(2.94)
1 By αad,r we denote the admissible states for problem (2.94). From the proof of 3 Proposition 2.6.21 it is clear that we have the following. 1 PROPOSITION 2.6.25 If hypotheses H(f ), H(U )1 , and H(L) hold, then αad,r = 1 1 1 1 2 3 1 1 αad,r2 = αad,r3 , mr = mr = mr , αad = αad,r3 the closure taken in the C(T, RN )norm, and there exists an optimal triple (x, u∗ , r∗ ) = m3r from problem (2.94); that is, Jr3 (x, u∗ , r∗ ) = m3r .
Also we have the admissibility of the new relaxed problem (2.94). THEOREM 2.6.26 If hypotheses H(f ), H(U )1 , and H(L)1 hold, then m3r = m. Next we derive a fourth relaxation method based on semicontinuity techniques, which are different from the ones employed so far. The new approach uses the socalled multiple Γ-operators which are related to the Γ-convergence that we studied in Section 1.5. DEFINITION 2.6.27 Let X1 , X2 be two Hausdorff topological spaces, and let ϕ : X1 ×X2 −→ R = R ∪ {+∞} be a proper function and (x1 , x2 ) ∈ X1 × X2 . In what follows by Z(+) we denote the sup operator and by Z(−) the inf operator. Also for k = 1, 2, let Sk be the set of sequences in Xk that converge to xk and let βk be one of the signs + and −. We define Γseq (X1β1 , X2β2 )ϕ(x1 , x2 ) = Z(β1 ) Z(β2 ) Z(−β1 ) Z(β1 ) ϕ(x1n , x2n ). 2 (x1 n )∈S1 (xn )∈S2
m≥1
n≥m
REMARK 2.6.28 Here for simplicity we have restricted ourselves to the sequential definition of multiple Γ-operators. Evidently we can have a more general topological version of the above notion, as we did for the Γ-convergence in Section 1.5. EXAMPLE 2.6.29 By virtue of Definition 2.6.27, we have Γseq (X1− , X2− )ϕ(x1 , x2 ) = and
Γseq (X1− , X2+ )ϕ(x1 , x2 )
=
inf
inf lim inf ϕ(x1n , x2n )
inf
sup lim inf ϕ(x1n , x2n )
2 x1 n →x1 xn →x2
xn →x1 x2 →x 2 n
n→∞ n→∞
If the Γseq -limit is independent of the sign + or − associated with one of the spaces, then this sign is omitted. So if
2.6 Optimal Control
127
Γseq (X1− , X2+ )ϕ(x1 , x2 ) = Γseq (X1+ , X2+ )ϕ(x1 , x2 ) then we simply write Γseq (X1 , X2+ )ϕ(x1 , x2 ). Note that Γseq (X1β1 , X2β2 )ϕ(x1 , x2 ) = −Γseq (X1−β1 , X2−β2 )(−ϕ)(x1 , x2 ) and if both X1 , X2 are metrizable, then
Γseq (X1− , X2− )ϕ(x1 , x2 ) = Γseq (X1 × X2 )− ϕ(x1 , x2 ). Although in general multiple Γ−operators are not distributive with respect to addition, nevertheless we have some useful inequalities. PROPOSITION 2.6.30 If ϕ, ψ : X1 ×X2 −→ R = R ∪ {+∞} are proper functions, then Γseq (X1− , X2− )ϕ+Γseq (X1− , X2− )ψ ≤ Γseq (X1− , X2− )(ϕ + ψ)
≤ Γseq (X1− , X2+ )ϕ + Γseq (X1+ , X2− )ψ.
PROOF: It is a consequence of inf λi + inf µi ≤ inf (λi + µi ) ≤ inf λi + sup µi
i∈I
i∈I
i∈I
i∈I
i∈I
for all {λi }i∈I , {µi }i∈I ⊆ R.
COROLLARY 2.6.31 If for (x1 , x2 ) ∈ X1 × X2 , Γseq (X1− , X2 )ϕ(x1 , x2 ), and Γseq (X1 , X2− )ψ(x1 , x2 ) exist, then Γseq (X1 , X2− )(ϕ + ψ)(x1 , x2 ) = Γseq (X1− , X2 )ϕ(x1 , x2 ) + Γseq (X1 , X2− )ψ(x1 , x2 ). In abstract terms the idea of this new relaxation method is the following. Suppose X is the state space, Y the control space (both Hausdorff topological spaces), ϕ : X × Y −→ R is the cost functional, and C is the set of all admissible statecontrol pairs (in C we have incorporated all constraints of the problem dynamic and nondynamic). Then the optimal control problem is inf (ϕ + iC )(x, u) : (x, u) ∈ X × Y , (2.95) where iC is the indicator function of the set C; that is, 0 if (x, u) ∈ C . iC (x, u) = +∞ otherwise Then the relaxed problem corresponding to (2.95) is inf Γseq (X − , U − )(ϕ + iC )(x, u) : (x, u) ∈ X × Y ; in other words in the relaxed problem we minimize the Γseq -relaxation of the extended cost functional ϕ + iC . So our goal is to determine Γseq (X − , U − )(ϕ + iC ). We do this by employing the auxiliary variable method , which is outlined in the next proposition.
128
2 Extremal Problems and Optimal Control
PROPOSITION 2.6.32 If Z is a third Hausdorff topological space, ξ : X×Y −→ Z is a map that satisfies (C0 ) Every sequence {(xn , un )}n≥1 that is convergent in X × Y and {(ϕ + iC )(xn , un )}n≥1 is bounded, the sequence {ξ(xn , yn )}n≥1 has a convergent subsequence in Z,
(ϕ + iC )(x, u) if v = ξ(x, u) , (2.96) +∞ otherwise
then Γseq (X − , Y − )(ϕ + iC )(x, u) = inf Γseq X − , (Y × Z)− ψ(x, u, v) : v ∈ Z . and
ψ(x, u, v) =
PROOF: Let (x, u, v) ∈ X ×Y ×Z and suppose that xn → x in X, un −→ u in Y , and vn −→ v in Z. We have (see (2.96)), (ϕ + iC )(xn , un ) ≤ ψ(xn , un , vn ), n ≥ 1
− − − ⇒ Γseq (X , Y )(ϕ + iC )(x, u) ≤ Γseq X , (Y × Z)− ψ(x, u, v) for all v ∈ Z, ⇒ Γseq (X,− , Y − )(ϕ + iC )(x, u)
≤ inf Γseq X − , (X × Y )− ψ(x, u, v) : v ∈ Z .
(2.97)
On the other hand let (x, u) ∈ X × Y and consider xn −→ x in X and un −→ u in Y . Without any loss of generality we assume that lim (ϕ + iC )(xn , un ) exists and it n→∞
is finite. Then by virtue of condition (C0 ), vn = ξ(xn , un ) −→ v ∈ Z. Hence using Definition 2.6.27 we have
Γseq X − , (Y ×Z)− ψ(x, u, v) ≤ lim inf ψ(xn , un , vn ) = lim ϕ(xn , un ) n→∞ n→∞
⇒ inf Γseq X −, (Y ×Z)− ψ(x, u, v) : v ∈ Z ≤ Γseq (X −, Y − )(ϕ + iC )(x, u). (2.98)
From (2.97) and (2.98), we conclude that equality holds.
The next proposition is helpful in the evaluation of Γseq X −, (Y × Z)− ψ. PROPOSITION 2.6.33 If the cost functional ϕ satisfies ϕ(x, u) ≤ ϕ(x , u) + w(x, x )h(x , u)
for all x, x ∈ X, u ∈ Y
(2.99)
with w : X ×X −→ R+ and h : X ×Y −→ R+ satisfying xn −→ x
in X implies that w(x, xn ), w(xn , x) −→ 0
(2.100)
and {(xn , un )}n≥1 is convergent in X × Y and {ϕ(xn , un )}n≥1 is bounded imply {h(xn , un )}n≥1 is bounded, −
then for all (x, u) ∈ X ×Y , Γseq (X, Y ) ϕ(x, u) exists and Γseq (X, Y − ) ϕ(x, u) = Γseq (δX , Y − ) ϕ(x, u) with δX being the discrete topology on X.
(2.101)
2.6 Optimal Control
129
PROOF: Let (xn , un ) −→ (x, u) in X × Y . Without any loss of generality we assume that {ϕ(xn , un )}n≥1 converges to a finite limit. From (2.99) we have ϕ(x, un ) ≤ ϕ(xn , un ) + w(x, xn )h(xn , un ), n ≥ 1. Then by virtue of (2.100) and (2.101) we have lim inf ϕ(x, un ) ≤ lim inf ϕ(xn , un ), n→∞
n→∞
⇒ Γseq (X, Y − ) ϕ(x, u) ≤ Γseq (X, Y − ) ϕ(x, u).
(2.102)
On the other hand let (xn , un ) −→ (x, u) in X × Y , and without any loss of generality assume that {ϕ(x, un )}n≥1 converges to a finite limit. Then because of (2.99), we have ϕ(xn , un ) ≤ ϕ(x, un ) + w(xn , x)h(x, un ),
n ≥ 1.
Then by virtue of (2.100) and (2.101), we have lim inf ϕ(xn , un ) ≤ lim ϕ(x, un ), n→∞
⇒ Γseq (δX , Y − ) ϕ(x, u) ≤ Γseq (δX , Y − ) ϕ(x, u). From (2.102) and (2.103) we conclude that equality must hold.
(2.103)
Now we introduce the specific optimal problem that we study. The state
space X is W 1,1 (0, b), RN endowed with the C(T, RN )-norm topology (recall that
W 1,1 (0, b), RN is embedded continuously in C(T, RN )) and the control space Y is L1 (T, Rm ) endowed with the weak topology. The optimal control problem is the following. ⎫ ⎧ b
J(x, u) = 0 L t, x(t), u(t) dt −→ inf = m, ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎬ ⎨
(2.104) s.t. x (t) = A t, x(t) + C t, x(t) g t, u(t) a.e. on T . ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎭ ⎩ x(0) = x0 , u ∈ L1 (T, Rm ), u(t) ∈ U (t) a.e. on T Here A : T ×RN −→ RN , C : T ×RN −→ RN ×k , and g : T × Rm −→ Rk are measurable m functions, U : T −→ 2R \ {∅} is the control constraint multifunction, and L : T × RN × Rm −→ R = R ∪ {+∞} is the cost integrand. We introduce the following hypotheses on the above data of problem (2.104). H(A): A : T × RN −→ RN is a function such that (i) For all x ∈ RN , t −→ A(t, x) is measurable. (ii) For every r > 0, there exists βr ∈ L1 (T )+ such that for almost all t ∈ T and all x, y ≤ r, we have A(t, x) − A(t, y) ≤ βr (t)x − y. (iii) For almost all t ∈ T and all x ∈ RN , we have A(t, x) ≤ α(t) + c(t)x
with α, c ∈ L1 (T )+ .
130
2 Extremal Problems and Optimal Control
H(C): C : T ×RN −→ RN ×k is a function such that (i) For all x ∈ RN , t −→ C(t, x) is measurable. (ii) For every r > 0, there exists γr ∈ L∞ (T )+ such that for almost all t ∈ T and all x, y ≤ r, we have C(t, x) − C(t, y) ≤ γr (t)x − y. (iii) For almost all t ∈ T and all x ∈ RN , we have C(t, x) ≤ α1 (t) + c1 (t)x
with α1 , c1 ∈ L∞ (T )+ .
H(g): g : T ×Rm −→ Rk is a Borel function. m
H(U)2 : U : T −→ 2R \ {∅} is a multifunction with compact values, such that Gr m 1 m U = {(t, u) ∈ T ×Rm : u ∈ U (t)} ∈ B(T
)×B(R ) and there exists u ∈ L (T, R ) such that u(t) ∈ U (t) a.e. on T and g ·, u(·) is integrable on T . H(L)2 : L : T ×RN ×Rm −→ R+ = R+ ∪ {+∞} is an integrand such that (i) (t, x, y) −→ L(t, x, y) is measurable. (ii) For every r > 0, almost all t ∈ T , all x, y ≤ r and all u ∈ U (t), we have L(t, x, u) ≤ L(t, y, u) + ϑr (t, x − y) + σr (x − y)L(t, y, u), where ϑr : T ×R+ −→ R+ and σr : R+ −→ R+ are such that ϑr (·, λ) is integrable and ϑr (t, ·), σr (·) are continuous increasing with ϑr (t, 0) = σr (0) = 0. (iii) For almost all t ∈ T and all u ∈ U (t) ν(g(t, x) + u) − ζ(t) ≤ L(t, 0, u) with ν : R+ −→ R+ increasing convex function satisfying lim
r→+∞
ν(τ ) τ =
+∞ and ζ ∈ L1 (T )+ .
(iv) There exist u0 ∈ L1 (T, Rm ) such that t −→ L t, 0, u0 (t) is integrable on T. We implement of the auxiliary variable, outlined earlier. Let S =
the method {(x, u) ∈ W 1,1 (0, b), RN × L1 (T, Rm ) : (x, u) is an admissible pair for problem (2.104)} and set ϕ = J + iS . The next lemma shows that the method of auxiliary variable indeed can be used within the context of problem (2.104). LEMMA 2.6.34 If Z = L1 (T, Rk ) furnished with the weak topology and ξ : X × Y −→ Z is defined by
g t, u(t) if g ·, u(·) is integrable, ξ(x, u)(t) = , 0 otherwise then ϕ satisfies the compactness condition (C0 ) of Proposition 2.6.32.
2.6 Optimal Control
131
PROOF: Suppose (xn , un ) −→ (x, u) in X × Y and assume that |ϕ(xn , un )| ≤ M for some M > 0, all n ≥ 1. Let vn (t) = g t, un (t) . If εn = xn − xC(T,RN )
and r = sup xn C(T,RN ) (recall that on the state space X = W 1,1 (0, b), RN we n≥1
consider the C(T, RN )-norm topology), using hypothesis H(L), we have
b
b
L t, 0, un (t) dt ψ(vn (t)) − ζ(t) dt ≤ 0
0
b
≤ L t, xn (t), un (t) dt + ϑr (t, εn ) dt 0
+
b
σr (εn ) L t, xn (t), un (t) dt
0
≤ M1 1 + σr (εn ) +
b
ϑr (t, εn )dt
(2.105)
0
for some M1 > 0, all n ≥ 1. Then from (2.105), hypothesis H(L)2 (iii), and the De La Vall´ee–Poussin theorem, we conclude that {vn }n≥1 ⊆ L1 (T, Rk ) has a weakly convergent subsequence. This lemma permits the use of Proposition 2.6.32, which says the relaxation of the extended cost functional ϕ = J + iS is reduced to the relaxation in X × (Y × Z) of ψ(x, u, v) = J(x, u, v) + iS (x, u, v), b
where J(x, u, v) = 0 L t, x(t), u(t), v(t) dt with L(t, x, u, v) = L(t, x, u)+i{v=g(t,u)}
and S = (x, u, v) ∈ X × Y × Z : x (t) = A t, x(t) + C t, x(t) v(t) a.e. on T, x(0) = x0 .
We compute separately Γseq X, (Y × Z)− J(x, u, v) and Γseq(X − , Y × Z)iC (x, u, v) and then use Corollary 2.6.31 to have Γseq X − , (Y × Z)− ψ(x, u, v), which is what we want. PROPOSITION 2.6.35 For all (x, u, v) ∈ X ×Y ×Z we have
b
L∗∗ t, x(t), u(t), v(t) dt, Γseq X, (Y × Z)− J(x, u, v) = 0
where L∗∗ (t, x, u, v) denotes the second conjugate of L(t, x, ·, ·). PROOF: From hypothesis H(L)2 (ii) we have
b ϑr (t, x − yC(T,RN ) )dt J(x, u, v) ≤ J(y, u, v) + 0
+ σr (x − yC(T,RN ) )J(y, u, v) for all x, y ∈ X, with xC(T,RN ) , yC(T,RN ) ≤ r, r > 0 and all u ∈ Y, v ∈ Z. Set
w(x, y) = 0
and
b
ϑr (t, x − yC(T,RN ) )dt + σr (x − yC(T,RN ) )
h(x, u, v) = 1 + J(x, u, v).
132
2 Extremal Problems and Optimal Control
We can apply Proposition 2.6.33 and have
Γseq X, (Y × Z)− J(x, u, v) = Γseq δX , (Y × Z)− J(x, u, v).
b But Γseq δX , (Y × Z)− J(x, u, v) = 0 L∗∗ t, x(t), u(t), v(t) dt (see Buttazzo [126, p. 74], and Denkowski–Mig´ orski–Papageorgiou [195, p. 588]). PROPOSITION 2.6.36 For all (x, u, v) ∈ X × Y × Z we have Γseq (X − , Y × Z)χS (x, u, v) = χS (x, u, v). PROOF: We need to show that if (xn , un , vn ) −→ (x, u, v) in X × Y × Z and (xn , un , vn ) ∈ S for all n ≥ 1, then (x, u, v) ∈ S
(2.106)
and if (x, u, v) ∈ S and (un , vn ) −→ (u, v) in Y × Z, then there exists xn −→ x in X with (xn , un , vn ) ∈ S, n ≥ 1. (2.107) First we prove (2.106). We have
* ) xn (t) = A t, xn (t) + C t, xn (t) vn (t) a.e. on T . xn (0) = x0 w
By virtue of hypotheses H(A) and H(C) and because vn −→ v in L1 (T, Rk ) (recall that Z = L1 (T, Rk ) is furnished with the weak topology), we have
w A ·, xn (·) + C ·, xn (·) vn (·) −→ A ·, x(·) + C ·, x(·) v(·) in L1 (T, RN ).
Because xn −→ x in C(T, RN ) (recall that X = W 1,1 (0, b), RN is furnished with the C(T, RN )-norm topology), in the limit as n → ∞, we have
* ) x (t) = A t, x(t) + C t, x(t) v(t) a.e. on T . (2.108) x(0) = x0 So we have proved (2.106). Next let (x, u, v) ∈ X × Y × Z be such that it satisfies (2.108) and suppose
(un , vn ) −→ (u, v) in Y × Z. For every n ≥ 1, let xn ∈ W 1,1 (0, b), RN be the unique solution of the Cauchy problem
) * xn (t) = A t, xn (t) + C t, xn (t) vn (t) a.e. on T . (2.109) xn (0) = x0 Because sup vn L1 (T,Rk ) ≤ M2 < +∞, then from (2.109), after integration over [0, t] n≥1
and using hypothesis H(A)(iii), H(C)(iii), and Gronwall’s inequality, we obtain r > 0 such that sup vn L1 (T,Rk ) ≤ r. From the Arzela–Ascoli theorem it follows that n≥1
{xn }n≥1 ⊆ C(T, RN ) is relatively compact and so we may assume that xn −→ x in C(T, RN ). In the limit we have
)
2.6 Optimal Control
* x (t) = A t, x(t) + C t, x(t) v(t) a.e. on T . x(0) = x0
133
Given the uniqueness of the solution of (2.108), it follows that x = x and so we have proved (2.107) and also the proposition. Combining Propositions 2.6.35 and 2.6.36 with Corollary 2.6.31, we have b
L∗∗ t, x(t), u(t), v(t) dt : v ∈ Z, Γseq (X − , Y − )ϕ(x, u) = inf 0
x (t) = A t, x(t) + C t, x(t) v(t) a.e. on T, x(0) = x0 . The final step in the derivation of the relaxed problem, is to eliminate the variable v ∈ Z from the right-hand side expression. To this end let G(t, u) = v ∈ Rk : (u, v) ∈ conv{(u , v ) ∈ Rm × Rk : v = g(t, u )} L(t, x, u, w) = inf L∗∗ (t, x, u, v) : w = A(t, x) + C(t, x)v
S = (x, u) ∈ X × Y : x (t) ∈ A t, x(t) + C t, x(t) G t, u(t) a.e. on T, x(0) = x0 . THEOREM 2.6.37 If hypotheses H(A), H(C), H(g), H(U )2 , and H(L)2 hold, then b
Γseq (X − , Y − ) ϕ(x, u) = 0 L t, x(t), u(t), x (t) dt + iS (x, u). PROOF: Note that v ∈ G(t, u), when L∗∗ (t, x, u, v) < +∞. Therefore
L∗∗ t, x(t), u(t), x (t) dt : v ∈ Z, x (t) 0
= A t, x(t) + C t, x(t) v(t) a.e. on T + iS (x, u).
Note that if x (t) = A t, x(t) + C t, x(t) v(t) a.e. on T , we have
L t, x(t), u(t), x (t) ≤ L∗∗ t, x(t), u(t), v(t) a.e. on T,
b
L t, x(t), u(t), x (t) dt + iS (x, u) ≤ Γseq (X − , Y − ) ϕ(x, u). ⇒ Γseq (X − , Y − ) ϕ(x, u) = inf
b
0
(2.110) b
On the other hand if (x, u) ∈ S and 0 L t, x(t), u(t), x (t) dt < +∞, then
L t, x(t), u(t), x (t) < +∞ a.e. on T and so we must have
L t, x(t), u(t), x (t) = L∗∗ t, x(t), u(t), v(t) a.e. on T,
with v ∈ L1 (T, Rk ) such that x (t) = A t, x(t) + C t, x(t) v(t) a.e. on T (see Theorem 2.6.8 and hypothesis H(L)2 ). It follows that
b
Γseq (X − , Y − ) ϕ(x, u) ≤ L∗∗ t, x(t), u(t), v(t) dt + iS (x, u) 0
=
b
L t, x(t), u(t), x (t) dt + iS (x, u).
0
(2.111)
134
2 Extremal Problems and Optimal Control Comparing (2.110) and (2.111), we obtain the desired equality. So the new relaxed problem corresponding to (2.104) is:
b
inf L t, x(t), u(t), x (t) dt + iS (x, u) : (x, u) ∈ X × Y = m4r .
(2.112)
0
Then by virtue of Theorem 2.1.20, we have the following. THEOREM 2.6.38 If hypotheses H(A), H(L), H(g), H(U )2 , and H(L)2 hold, then problem (2.112) has a solution (x, u) ∈ X × Y and m = m4r . To relate problem (2.112) with the relaxed problems introduced earlier we need to strengthen the hypotheses on g and U . H(g)1 : g : T × Rm −→ Rk is a Carath´eodory function (i.e., measurable in t ∈ T and continuous in x ∈ Rm ) and for almost all t ∈ T and all u ≤ r, we have g(t, u) ≤ p(t) with p ∈ L1 (T )+ (here r > 0 as in H(U )1 ). For the control constraint set U we assume hypothesis H(U )1 . Then from (2.85) with f (t, x, u) = A(t, x) + C(t, x)g(t, u), we have the following alternative relaxation of (2.104).
b ⎧ ⎫ Jr1 (x, λ) = 0 B r L t, x(t), u(t) λ(t)(du)dt −→ inf = m1r ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎬
s.t. x (t) = A t, x(t) + C t, x(t) B r g(t, u)λ(t)(du) a.e. on T . (2.113) ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩ ⎭ x(0) = x0 , λ ∈ SΣ DEFINITION 2.6.39 Given an admissible original control u(·), the barycenter of u(·) is defined by
Bar(u) = λ ∈ SΣ : u(t) = uλ(t)(du) a.e. on T . Br
In what follows, for convenience we set ϕ(x, u) = Γseq (X − , Y − ) ϕ(x, u).
(2.114)
PROPOSITION 2.6.40 If hypotheses H(A), H(C), H(g), H(U )1 , and H(L)2 hold, then ϕ(x, u) = min Jr1 (x, λ) : (x, λ) is admissible for (2.113) and λ ∈ Bar(u) . PROOF: Let (x, λ) be an admissible state-control pair for problem (2.113) with λ ∈ Bar(u). Then by virtue of Proposition 2.6.17 we can find original
controls {un }n≥1 such that δun −→ λ narrowly in R(T, B r ). Let xn ∈ W 1,1 (0, b), RN be the unique state produced by control un . From Theorem 2.6.10 we know that {xn }n≥1 ⊆ C(T, RN ) is relatively compact and so we may assume that xn −→ x w in C(T, RN ). Also because of hypothesis H(U )1 , we may assume that un −→ u in 1 m L (T, R ). For all D ∈ B(T ) we have
un (t)dt −→ u(t)dt. (2.115) D
D
2.6 Optimal Control Moreover, because δun −→ λ narrowly and λ ∈ Bar u, we have
un (t)dt = uδun (t) (du)dt −→ uλ(t)(du)dt = u(t)dt. D
D Br
D Br
135
(2.116)
D
From (2.115), (2.116), and because D ∈ B(T ) was arbitrary, we infer that u = u w and so un −→ u in L1 (T, Rm ). Because (xn , un ) is admissible for the original optimal control problem, we have ϕ(xn , un ) = J(xn , un ), ⇒ lim inf ϕ(xn , un ) = lim inf J(xn , un ) = lim inf Jr1 (xn , δun ) = Jr1 (x, λ) n→∞
n→∞
n→∞
(see H(L)2 ),
⇒ ϕ(x, u) ≤ inf Jr1 (x, λ) : (x, λ) is admissible for (2.113), λ ∈ Bar u . (2.117)
On the other hand, if ϕ(x, u) < +∞, from the definition of ϕ (see (2.114)), given w ε > 0, we can find xn −→ x in C(T, RN ) and un −→ u in L1 (T, Rm ) such that lim inf J(xn , un ) ≤ ϕ(x, u) + ε.
(2.118)
n→∞
w∗ By Alaoglu’s theorem we may also assume that δun−→λ in L∞ T, M (B r )w∗ (hence narrowly in R(T, B r )). Then for all D ∈ B(T ) we have
un (t)dt = uδun (t) (du)dt −→ uλ(t)(du)dt D
D
Br
Br
(2.119)
un (t)dt −→
and
D
D
u(t)dt.
(2.120)
D
From (2.119), (2.120), and because D ∈ B(T ) was arbitrary it follows that u(t) = B r uλ(t)(du) a.e. on T (i.e., λ ∈ Bar u). Also because of hypotheses H(L)2 we have J(xn , un ) −→ Jr1 (x, λ). Therefore Jr1 (x, λ) ≤ ϕ(x, u) + ε Let ε ↓ 0, to conclude that
(see (2.118)).
Jr1 (x, λ) ≤ ϕ(x, u).
Comparing (2.117) and (2.121), we obtain the desired equation.
(2.121)
This proposition leads at once to the equivalence of relaxed problems (2.112) and (2.113). THEOREM 2.6.41 If hypotheses H(A), H(C), H(g), H(U )1 , and H(L)2 hold, then m = m1r = m4r and problems (2.112) and (2.113) are equivalent; that is, if (x, u) solves (2.112), then we can find λ ∈ Bar(u) such that (x, λ) solves (2.113) and conversely if (x, λ) solves (2.113) we can find an admissible original control u such that (x, u) solves (2.112). Both problems have optimal pairs.
136
2 Extremal Problems and Optimal Control
REMARK 2.6.42 Evidently (2.112) is also equivalent to the other two relaxed problems defined in (2.90) and (2.94) with f (t, x, u) = A(t, x) + C(t, x)g(t, u). In the last part of this section we derive the Pontryagin maximum principle for the following optimal control problem. ⎧ ⎫ b
J(x, u) = 0 L t, x(t), u(t) dt −→ inf = m ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎬
(2.122) a.e. on T = [0, b] . s.t. x (t) = f t, x(t), u(t) ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪
⎩ ⎭ x(0), x(b) ∈ C, u ∈ Uad Here C ⊆ RN ×RN is nonempty and Uad = {u : T −→ Y measurable}, where Y is a separable metric space (the control space). Note the general endpoint constraints that include the periodic problem as a special case. Our derivation of the Pontryagin maximum principle is based on the Ekeland variational principle (see Theorem 2.4.1). The precise mathematical setting for problem (2.122) is the following. The state space is X = RN and the control space Y is a separable metric space. We impose the following conditions on the data of (2.122). H(f )2 : f : T ×RN ×Y is a function such that (i) For all (x, u) ∈ RN × Y, t −→ f (t, x, u) is measurable. (ii) For all t ∈ T and all u ∈ Y, x −→ f (t, x, u) is differentiable and (x, u) −→ fx (t, x, u) is continuous;. (iii) There exists M > 0 such that f (t, 0, u), fx (t, x, u) ≤ M for all (t, x, u) ∈ T × RN × Y . H(C) : C ⊆ RN ×RN is nonempty, closed, and convex. H(L)3 : L : T ×RN × Y −→ R is a function such that (i) For all (x, u) ∈ RN ×Y, t −→ L(t, x, u) is measurable. (ii) For all t ∈ T and all u ∈ Y, x −→ L(t, x, u) is differentiable and (x, u) −→ Lx (t, x, u) is continuous. (iii) There exists M1 > 0 such that L(t, 0, u), Lx (t, x, u) ≤ M1 for all (t, x, u) ∈ T × RN × Y . The control space Y is only a separable metric space and does not have a linear structure, therefore we cannot talk about convexity. For this reason the variations of the control function u(·) are of special type and are called spike perturbations of u. For this reason we need to use measure-theoretic arguments when dealing with such perturbations. In particular we need to know how we can approximate the constant function 1 by an oscillatory function of the form (1/λ) χC , λ ∈ (0, 1) (here χC denotes the characteristic function of C). LEMMA 2.6.43 If (Ω, Σ, µ) is a finite nonatomic measure space, X is a separable Banach space, and for any λ ∈ (0, 1), Sλ = C ∈ Σ : µ(C) = λµ(Ω) , then for any g ∈ L1 (Ω, X) we have
1 inf (2.123) χC (ω) − 1 g(ω)dµ = 0. C∈Sλ λ Ω
2.6 Optimal Control n
PROOF: Given ε > 0, we can find a simple function sε (ω) =
k=1
Ak ∈ Σ, xk ∈ X such that
χAk (ω)xk with
g − sε L1 (Ω,X) < ε. Due to the nonatomicity of µ, for each k ∈ {1, . . . , n} we can find that µ(Aλk ) = λµ(Ak ). Let Aλ =
n
137
(2.124) Aλk
⊆ Ak such
Aλk ∈ Sλ . Then
k=1
n 1 1 χAλ (ω) − 1 sε (ω)dµ = µ(Aλk ) − µ(Ak ) xk = 0, λ Ω λ k=1
1 1 ⇒ χAλ (ω) − 1 g(ω)dµX ≤ χAλ (ω) − 1 sε (ω)dµX + λ λ Ω Ω 1 + 1+ sε − gL1 (Ω,X) λ 1 ≤ 1+ ε (see (2.124)). λ Because ε > 0, was arbitrary, we conclude that (2.123) holds.
In dealing with the endpoint constraints, we use the distance function from the set C. Recall that if Z is a Banach space and D is a nonempty, closed, and convex subset of Z, the distance function from D defined by dD (z) = inf{z − uZ : u ∈ D} is both convex and Lipschitz continuous with Lipschitz constant 1. So the convex subdifferential (see Definition 1.2.28) and the generalized subdifferential (see Definition 1.3.5) coincide and we have ∂dD (z) = {z ∗ ∈ Z ∗ : z ∗ , z − z Z ≤ dD (z ) − dD (z) for all z ∈ Z} = {z ∗ ∈ Z ∗ : z ∗ , hZ ≤ dD0 (z; h)
for all h ∈ Z}. (2.125)
LEMMA 2.6.44 If Z is a Banach space and D ⊆ Z is nonempty, closed, and convex, then for any z ∈ / D and any z ∗ ∈ ∂dD (z) we have z ∗ Z ∗ = 1. PROOF: Because dD (·) is globally Lipschitz with constant 1, we have z ∗ Z ∗ ≤ 1. Because z ∈ / D, given any 0 < δ < 1, we can find uδ ∈ D such that 0 < (1 − δ)z − uδ Z ≤ dD (z). So by virtue of (2.125) we have z ∗ , uδ − zZ ≤ −dD (z) ⇒ (1 − δ)z − uδ Z ≤ dD (z) ≤ − z ∗ , uδ − zZ ≤ z ∗ Z ∗ uδ − zZ ⇒ (1 − δ) ≤ z ∗ Z ∗ . Because δ ∈ (0, 1) was arbitrary, we let δ ↓ 0, to conclude that z ∗ Z ∗ = 1.
138
2 Extremal Problems and Optimal Control
COROLLARY 2.6.45 If Z is a Banach space with a strictly convex dual Z ∗ and D ⊆ Z is a nonempty, closed, and convex set, then for any z ∈ / D and the set ∂dD (z) is a singleton. As we already mentioned, the derivation of the Pontryagin maximum principle is based on the Ekeland variational principle. We need to endow the set of admissible controls Uad with a metric structure. So for u, w ∈ Uad we define d(u, w) = {t ∈ T : u(t) = w(t)}1 . Recall that by | · |1 we denote the one-dimensional Lebesgue measure. It is easy to check that d is a metric and so (Uad , d) is a metric space. LEMMA 2.6.46 (Uad , d) is a complete metric space. PROOF: Let {un }n≥1 ⊆ Uad be a d-Cauchy sequence. By passing to a suitable subsequence, we may assume that d(un+1 , un ) ≤
1 , 2n
n ≥ 1.
Set Dnm = {t ∈ T : un (t) = um (t)}, n, m ≥ 1, and Ck = Clearly Ck k≥1 is decreasing and we have |Ck |1 ≤
1 1 = k−1 , 2n 2
Dn(n+1) , k ≥ 1.
n≥k
k ≥ 1.
n≥k
c Ck 1 = b. We set u(t) = uk (t) if t ∈ Ckc , k ≥ 1. From the definition It follows that k≥1
of Ck it is clear that u is well-defined and u ∈ Uad . Moreover, d(uk , u) ≤ |Ck |1 −→ 0
as k −→ ∞.
REMARK 2.6.47 A careful reading of the above proof reveals that the lemma remains valid if Y is only a measurable space without any metric structure. In addition T can be replaced by any nonatomic measure space. Now we are ready to state and prove the Pontryagin maximum principle for problem (2.122). THEOREM 2.6.48 If hypotheses H(f )2 , H(C) and H(L)3 hold and (x, u) is an optimal pair for problem (2.122), then there exists (ψ0 , ψ) ∈ R × W 1,1 (0, b), RN , (ψ0 , ψ) = (0, 0) such that (a) ψ0 ≤ 0.
∗
(b) ψ (t) = fx t, x(t), u(t) ψ(t) + ψ0 Lx t, x(t), u(t) a.e. on T .
2.6 Optimal Control (c)
139
ψ(0), x0 − x(0) RN ≤ ψ(b), x1 − x(b) RN for all (x0 , x1 ) ∈ C.
(d) If H(t, x, u, v0 , v)= v, f (t, x, u) RN +v0 L(t, x, u) for all (t, x, u, v0 , v) ∈ T × RN ×
Y ×R×RN , then H t, x(t), u(t), ψ0 , ψ(t) = max H t, x(t), u, ψ0 , ψ(t) for almost all t ∈ T .
u∈Y
PROOF: First let us briefly outline the strategy of the proof. It is divided into a series of steps. (i) We introduce a penalty function that is used to define an approximation of problem (2.122) (called the approximate problem) which has no end point constraint. (ii) We use the Ekeland variational principle to produce an optimal pair for the approximate problem. This pair is actually close to the original optimal pair. (iii) We derive necessary conditions for the approximate optimal pair. (iv) We pass to the limit to obtain necessary conditions for the original optimal pair. On RN × Uad we introduce the metric
d0 (x, u), (z, w) = x − zRN + d(u, w). Clearly (RN × Uad , d0 ) is a complete metric space (see Lemma 2.6.46). In what follows by x(x0 , u)(·) ∈ W 1,1 (0, b), RN we denote the unique state generated by u ∈ Uad and the initial condition x0 ∈ RN . Then we can write the cost functional J(x0 , u). If x(0) = x0 , then by translating the cost functional if necessary (i.e., considering the cost functional J(x0 , u)−J(x0 , u)), we may assume without any loss of generality that J(x0 , u) = 0. We start executing the four steps of the method of proof outlined above. Step i: We introduce the penalty function. For ε > 0 and (x0 , u) ∈ RN × Uad , we set
+ 1/2 . Jε (x0 , u) = d2C x0 , x(x0 , u)(b) + [ J(x0 , u) + ε ]2
(2.126)
Because of hypotheses H(f )2 and H(L)3 and Gronwall’s inequality for all (x0 , u), (x0 , u0 ) ∈ RN × Uad we have
and
x(x0 , u)(·) − x(x0 , u0 )(·)RN ≤ c(1 + max{x0 , x0 }) ×
(2.127) d0 (x0 , u), (x0 , u0 )
|J(x0 , u) − J(x0 , u0 )| ≤ c 1 + max{x0 , x0 }d0 (x0 , u), (x0 , u0 ) , for some c > 0.
(2.128)
From (2.126) through (2.128) it follows that Jε (·, ·) is continuous on (RN × Uad , d0 ). Step ii: Solution (via the Ekeland variational principle) of the problem with the same dynamics and cost functional a new expression involving Jε . From (2.126) we see that Jε ≥ 0 and Jε (x0 , u) = ε ≤ inf Jε (x0 , u) + ε (recall RN ×Uad
that x(0) = x0 and that we have assumed that J(x0 , u) = 0). So we can apply Corollary 2.4.3 and obtain (xε0 , uε ) ∈ RN × Uad such that
140
2 Extremal Problems and Optimal Control √
d0 (xε0 , uε ), (x0 , u) ≤ ε
√ Jε (xε0 , uε ) ≤ Jε (x0 , u) + ε d0 (x0 , u), (xε0 , uε )
and
for all (x0 , u) ∈ RN × Uad .
(2.129)
(2.130)
So if xε = x(xε0 , uε ), then (xε , uε ) is a solution of the approximate optimal control problem with the same dynamics and cost functional as the right-hand side of (2.130). Note that because of (2.129) the optimal pair of the approximate problem is located close to the optimal pair of the original problem. Step iii: We derive necessary conditions for the optimal pair (xε , uε ) of the approximate problem. Fix (e0 , w) ∈ B 1 × Uad (B 1 = {e0 ∈ RN : e0 RN ≤ 1}) and λ ∈ (0, 1] and set
L s, xε (s), w(s) − L s, xε (s), uε (s)
. g(s) = f s, xε (s), w(s) − f s, xε (s), uε (s) From Lemma 2.6.43 we know that given any δ > 0. we can find Cλ ⊆ T with |Cλ |1 = λb such that
b
g(s)ds − 0
1 λ
b 0
χCλ (s)g(s)dsRN ≤ δ.
(2.131)
We introduce the following spike perturbation of the optimal control uε (·), uε (t) if t ∈ T \ Cλ uελ (t) = . (2.132) w(t) if t ∈ Cλ Clearly uελ ∈ Uad and d(uελ ,uε ) ≤ |Cλ |1 = λb. Set xελ = x(xε0 + λe0 , uελ ). We define (z ε , z0ε ) ∈ W 1,1 (0, b), RN × R as follows
(z ε ) (t) = fx t, xε (t), uε (t) z ε (t) + f t, xε (t), w(t) − f t, xε (t), uε (t) a.e. on T, z ε (0) = e0 and b
Lx t, xε (t), uε (t) z ε (t)dt z0ε =
0
+
b
L t, xε (t), w(t) − L t, xε (t), uε (t) dt.
0
Exploiting hypotheses H(f )2 and H(L)3 , via Gronwall’s inequality, we can easily check that
and
xελ − xε − λz ε C(T,RN ) = o(λ)
(2.133)
J(xε0 + λe0 , uελ ) − J(xε0 , uε ) − λz0ε ) = o(λ),
(2.134)
where o(λ) λ −→ 0 as λ ↓ 0. Recalling that Jε is continuous on (RN × Uad , d0 ), from (2.133) and (2.133) and the definition of Jε , we see that Jε (xε0 + λe0 , uελ ) = Jε (xε0 , uε ) + ε(λ)
with ε(λ) ↓ 0.
(2.135)
2.6 Optimal Control
141
From (2.130) we have √ 1
ε(e0 RN + b) ≤ Jε (xε0 + λe0 , uελ ) − Jε (xε0 , uε ) λ 1
1 ε ε 2 ε ε 2 (x + λe , u ) − J (x , u ) = J ε 0 ε 0 λ 0 ε ε ε Jε (x0 + λe0 , uλ ) + Jε (x0 , uε ) λ −
=
1 2Jε (xε0 , uε )
d2C (xε0 + λe0 , xελ (b) − d2C (xε0 , xε (b)
1
+ ε(λ) λ
+ 2
+ 2 1 ε + − J(xε0 , uε ) + ε J x0 + λe0 , uε ) + ε (see (2.133)). λ (2.136) We know that d2C ∈ C 1 (RN × RN ) and 2 dC (x0 , x1 ) ∂dC (x0 , x1 ) 2 ∇dC (x0 , x1 ) = 0
/C if (x0 , x1 ) ∈ . if (x0 , x1 ) ∈ C
Recall that by virtue of Corollary 2.6.45 ∂dC (x0 , x1 ) = (α0 , α1 ) ∈ RN × RN and α0 2RN + α1 2RN = 1 (see Lemma 2.6.44), when (x0 , x1 ) ∈ / C. On the other hand because dC is Lipschitz continuous with Lipschitz constant 1, we always have ∂dC (x0 , x1 ) ⊆ B 1 = {(x, z) ∈ RN × RN : x2RN + z2RN ≤ 1}. So we can write with no ambiguity that ∇d2C (x0 , x1 ) = 2 dC (x0 , x1 )(α0 , α1 ) α0 2RN
+
α1 2RN
with (α0 , α1 ) ∈ ∂dC (x0 , x1 ),
= 1.
Because of (2.133), we have
d2C xε0 + λe0 , xελ (b) − d2C xε0 , xε (b) lim λ↓0 λ
ε ε ε = 2 dC x0 , x (b) (α0 , e0 )RN + α1ε , z ε (b) RN where
(α0ε , α1ε ) ∈ ∂dC xε0 , xε (b) and α0ε 2RN + α1ε 2RN = 1.
Also because of (2.133) we have + 2
+ 2 1 ε − J(xε0 , uε ) + ε J x0 + λe0 , uε ) + ε lim λ↓0 λ +
= 2 J(xε0 , uε ) + ε z0ε .
(2.137)
(2.138)
Returning to (2.136), passing to the limit as λ ↓ 0 and using (2.137) and (2.138) we obtain
√ (2.139) − ε(e0 RN + b) ≤ (ϕε , e0 )RN + ψε , zε (b) RN + ψ0ε z0ε
dC xε ,xε (b) dC xε ,xε (b) where ϕε = Jε (x0ε ,uε ) α0ε , ψε = Jε (x0ε ,uε ) α1ε , and 0
ψ0ε =
0
+ J(xε0 , uε ) + ε . Jε (xε0 , uε )
(2.140)
142
2 Extremal Problems and Optimal Control Because of (2.137) we have ϕε 2RN + ψε 2RN + (ψ0ε )2 = 1,
(2.141) xε0 , xε (b) is
and from the definition of the convex subdifferential and because ∂dC a cone we have
(ϕε , x0 − xε0 )RN + ψε , x1 − xε (b) RN ≤ 0 for all (x0 , x1 ) ∈ C.
(2.142)
Conditions (2.138)−→(2.142) are necessary conditions for optimality of (xε , uε ). Step iv: Passage to the
limit as ε ↓ 0. Let (z, z 0 ) ∈ W 1,1 (0, b), RN × R be defined by
z (t) = fx t, x(t), u(t) z(t) + f t, x(t), w(t) − f t, x(t), u(t)
z0 =
a.e. on T, z(0) = e0
b
Lx t, x(t), u(t) z(t)dt + L t, x(t), w(t) −L t, x(t), u(t) dt.
b
0
0
Then because of (2.129) and as before via Gronwall’s inequality, we have lim xε0 − x0 RN + z ε − zC(T,RN ) + |z0ε − z0 | = 0. ε↓0
So from (2.141) and (2.142), we have
(ϕε , x0 − x0 )RN + ψε , x1 − x(b) RN ≤ xε0 − x0 2RN + xε (b) − x(b)2RN = βε −→ 0 as ε ↓ 0.
Combining this inequality with (2.139), we obtain
ϕε , e0 − (x0 − x0 ) RN + ψε , z(b) − (x1 − x(b) + ψ0ε z0 RN √ ≥ − ε(e0 RN + b) − βε − z ε (b) − z(b)RN − |z0ε − z0 | ≥ −γε for all (x0 , x1 ) ∈ C,
(2.143)
where γε > 0 independent of u ∈ Uad , e0 ∈ B 1 , and γε ↓ 0 as ε ↓ 0. Because of (2.141) we may assume that (ϕε , ψε , ψ0ε ) −→ (ϕ, ψ, ψ0 ) in RN × RN × R as ε ↓ 0. Clearly (ϕ, ψ, ψ0 ) = (0, 0, 0) (see (2.141)). Let ε ↓ 0 in (2.143). We obtain
ϕ, e0 − (x0 − x0 ) RN + ψ, z(b) − x1 − x(b) + ψ0 z0 ≥ 0 RN
(2.144)
for all (x0 , x1 ) ∈ C, all w ∈ Uad , and all e0 ∈ B 1 . Let ψ ∈ W 1,1 (0, b), RN be the unique solution of the equation in statement (b) of the theorem ψ(b) = −ψ and ψ0 = −ψ0 ≤ 0 (see (2.140)). We rewrite (2.144) as follows,
(ϕ, x0 − x0 − e0 )RN − ψ(b), x1 − x(b) − z(b) RN + ψ0 z0 ≤ 0 (2.145) for all (x0 , x1 ) ∈ C, all w ∈ Uad , and all e0 ∈ B 1 .
2.6 Optimal Control
143
A straightforward computation gives
ψ(b), z(b) RN − ψ(0), e0 RN + ψ0 z0
b
= H t, x(t), w(t), ψ0 , ψ(t) − H t, x(t), u(t), ψ0 , ψ(t) dt, 0
(2.146) for all e0 ∈ B 1 and all w ∈ Uad . In (2.145) we set e0 = 0, x0 = xb = x(0) and use the resulting inequality in (2.146) to obtain
b
(2.147) H t, x(t), w(t), ψ0 , ψ(t) − H t, x(t), u(t), ψ0 , ψ(t) dt ≤ 0 0
for all w ∈ Uad . Recall that Y is separable. So we can find a countable dense set {um }m≥1 ⊆ Y . Then if
hm (t) = H t, x(t), um , ψ0 , ψ(t) − H t, x(t), u(t), ψ0 , ψ(t) , m ≥ 1, we have hm ∈ L1 (T ) and we can find Em ⊆ T with |Em |1 = b such that
t+δ 1 hm (s)ds = hm (t) for all t ∈ Em . lim δ↓0 2δ t−δ If t ∈ Em , we define
wδ (s) =
u(s) um
if |s − t| > δ . if |s − t| ≤ δ
From (2.147) we have
t+δ
hm (s)ds ≤ 0
for all δ > 0.
t−δ
Divide with 2δ and let δ ↓ 0, to obtain hm (t) ≤ 0. Thus,
H t, x(t), um , ψ0 , ψ(t) − H t, x(t), u(t), ψ0 , ψ(t) ≤ 0 for all t ∈ E = m≥1 Em , |E|1 = b. Exploiting the continuity of the Hamiltonian H, we have
H t, x(t), u(t), ψ0 , ψ(t) = max H t, x(t), u, ψ0 , ψ(t) a.e. on T. u∈Y
Also, if in (2.145) we let w = u, x0 = x0 , x1 = x(b) and we use (2.146) and (2.147), we obtain
(ϕ, e0 )RN ≥ ψ(b), z(b) RN + ψ0 z0 ≥ ψ(0), e0 RN for all e0 ∈ B 1 , ⇒ ϕ = ψ(0).
Therefore, if in (2.145) e0 = 0 and w = u, we obtain
ψ(0), x0 − x(0) RN ≤ ψ(b), x1 − x(b) RN
for all (x0 , x1 ) ∈ C.
Finally note that (ψ0 , ψ) = (0, 0), or otherwise we contradict the fact that (ϕ, ψ, ψ0 ) = (0, 0, 0).
144
2 Extremal Problems and Optimal Control
REMARK 2.6.49 The function ψ(·) is known as the costate or adjoint state. The system in (b) is known as the adjoint system. The inequality in (c) is known as the transversality condition and finally statement (d) is the maximum condition. In analogy with mechanics H is the Hamiltonian.
2.7 Remarks 2.1: The notion of lower semicontinuity for real functions was introduced by Borel [89], but systematic use of it in variational problems is due to Tonelli [585]. Lower semicontinuity is studied in the books of Barbu–Precupanu [59], Cesari [140], Dal Maso [171], Denkowski–Mig´ orski–Papageorgiou [194], Ekeland–Temam [222], and Ioffe–Tichomirov [327]. Theorem 2.1.25 was first proved by De Giorgi [189] for the case ϕ is a nonnegative Carath´eodory integrand. The version presented here is due to Ioffe [326]. Earlier results on the lower semicontinuity proper
ties of integral functionals J(x, u)= Ω ϕ ω, x(ω), u(ω) dµ on the Lebesgue spaces Lp (Ω, RN )×Lr (Ω, Rm ), were provided by Berkovitz [71], Cesari [138, 139], and Olech [467]. Corresponding results for the weak lower semicontinuity of integral function
als J(x) = Ω ϕ z, x(z), Dx(z) dz (Ω ⊆RN a bounded domain) on the Sobolev spaces W 1,p (Ω) were proved by Buttazzo [126], Dacorogna [170], Ekeland–Temam [222], Giaquinta [263], and Morrey [443]. Lower semicontinuity theorems in the weak topologies of Sobolev spaces when the function x(·) is vector-valued can be found in Acerbi–Fusco [1], Ball–Zhang [56], Dacorogna [170], and Morrey [443]. 2.2: The method of Lagrange multipliers is discussed in Alexeev–Tichomirov–Fomin [7], Tichomirov [582] and Zeidler [620]. Theorem 2.2.7 is due to Ljusternik [392]. It can also be found in the book of Ljusternik–Sobolev [395]. Nonsmooth extensions of the Lagrange multipliers method can be found in Aubin [37], Clarke [149, 153], Rockafellar [522], and Rockafellar–Wets [530]. The Dubovitskii–Milyutin formalism for infinite dimensional optimization problems, was first formulated by Dubovitskii– Milyutin [208]. A comprehensive and readable presentation of the theory is contained in the monograph of Girsanov [266]. 2.3: The first minimax theorem was formulated for bilinear functionals on finitedimensional simplices by von Neumann [454]. It was a basic tool in the study of his model for the growth of an economy. Since then there have been several generalizations of the result of von Neumann. We mention the works of Fan [232], Sion [557], Browder [119, 121], Brezis–Nirenberg–Stampacchia [101], Terkelsen [580], and Simons [556]. Theorem 2.3.7 was first proved by Knaster–Kuratowski–Mazurkiewicz [358] in the special case in which B is the set of vertices of a simplex in RN . The form presented here is due to Dugundji–Granas [211, 212]. An earlier version was proved by Fan [233] who also gave numerous applications of it (see, e.g., Fan [234, 235]; in fact Fan [235] obtained the coincidence result proved in Proposition 2.3.10). Theorem 2.3.13 is due to Sion [557]. The duality theory for convex optimization, which uses the idea of perturbed problems and conjugate convex functionals, was developed for the finite-dimensional case by Rockafellar [522]. The infinite-dimensional case presented here is due to Ekeland–Temam [222]. The special case considered in (2.34) (problem (P) ) is due to Fenchel [241] when A = I and to Rockafellar [518], the general situation with A ∈ L(X, Y ).
2.7 Remarks
145
2.4: Theorem 2.4.1 was proved by Ekeland [221]. A detailed discussion of the various applications that this theorem has can be found in Ekeland [223, 226]. Theorem 2.4.11 is due to Caristi [129] who proved it using transfinite induction. Takahashi [571] proved Theorem 2.4.14. Theorem 2.4.16 is due to Danes [175], who proved it using a result of Krasnoselskii–Zabreiko. Theorem 2.4.20 is due to Brezis–Browder [103]. A generalization of the Ekeland variational principle, in which the Lipschitz continuous perturbations are replaced by quadratic ones, was proved by Borwein– Preiss [92]. Additional results in this direction can be found in Deville–Godefroy– Zizler [197]. 2.5: The calculus of variations is of course a much broader subject. Detailed presentation of the subject can be found in the books Bliss [80], Bolza [83], Cesari [140], Gelfand–Fomin [260], Hestenes [292], Ioffe–Tichomirov [327], Morrey [443], Morse [444], Troutman [586], and Young [617]. The more recent developments on vectorial problems (with significant applications in elasticity theory) can be found in Dacorogna [170]. 2.6: Hypothesis Hc in the existence theory is related to the property (Q) of Cesari [138]. For a detailed discussion of the existence theory for finite dimensional optimal control problems and of the relevant property (Q), we refer to Cesari [140]. Similar results can also be found in Berkovitz [70], Fleming–Richel [249] (finite-dimensional problems) and Ahmed [4], Ahmed–Teo [3], Hu–Papageorgiou [316], Lions [388] and Tiba [581] (infinite-dimensional problems). Scrutinizing the proof of Theorem 2.6.11, we see that what makes it work is hypothesis Hc . So in order to be able to guarantee existence of an optimal pair in an optimal control problem, we need a convexity-type hypothesis. If such a condition is not present the problem need not have a solution. This difficulty was surmounted independently in the late fifties and early sixties by Filippov [247], Warga [601] and Gamkrelidze [255]. They realized that we need to suitably augment the system with the introduction of new admissible controls in order to be able to capture the asymptotic behavior of the minimizing sequences of the original problem. Gamkrelidze and Warga worked with parametrized measures (see problem (2.42)), whereas Filippov used a control-free problem (see problem (2.47)). Here we also present a third relaxation method based on Carath´eodory’s theorem for convex sets. The fourth relaxation method based on the Γ-regularization of the extended cost functional, is due to Buttazzo–Dal Maso [125] (see also Buttazzo [126]), who for that purpose developed the formalism of multiple Γ-limits. Further results on the relaxation of the calculus of variations and optimal control problems can be found in Buttazzo [126]), Dal Maso [171], Fattorini [239], and Roubicek [532]. Necessary conditions for optimality were first obtained by Pontryagin and his coworkers (see Pontryagin [499] and Pontryagin–Boltyanski–Gamkrelidze–Mischenko [500]. It has become a common terminology to call these necessary conditions the Pontryagin maximum principle. Proofs of the maximum principle for different types of optimal control problems can be found in Berkovitz [70], Cesari [140], Fleming– Richel [249], Hermes–La Salle [289], Ioffe–Tichomirov [327], Seierstadt–Sydsaeter [547] (finite-dimensional systems), and Ahmed [4], Ahmed–Teo [3], Fattorini [239], Li–Yong [381], Lions [388], and Tiba [581] (infinite-dimensional systems).
3 Nonlinear Operators and Fixed Points
Summary. *In this chapter, first we study certain broad classes of nonlinear operators that arise naturally in applications and then we develop some related degree theories and fixed point theorems. We start with compact operators, we conduct a detailed study of both linear and nonlinear operators. Then we pass to a broader class of nonlinear operators of monotone-type. We deal with operators from a reflexive Banach space X to its dual X ∗ (monotone operators and their generalizations) and with operators from X into itself (accretive operators). The latter, are related to the generation theory of linear and nonlinear semigroups. We deal with both. Then, we present the degree theories of Brouwer, (finite-dimensional) and Leray–Schauder and Browder–Skrypnik (infinite-dimensional) and several interesting topological applications of them. Finally we present the main aspects of fixed point theory. We consider metric fixed point theory, topologucal fixed point theory and the interplay between fixed point theory and partial order. In this direction we introduce and use the so-called “fixed point index”.
Introduction In this chapter, first we study certain classes on nonlinear operators that arise naturally in applications. Then we develop certain finite- and infinite-dimensional degree theories that are valuable tools in the study of boundary value problems. Degree theory leads in a natural way to fixed point theory, which is the topic of investigation in the last three sections of the chapter. In Section 3.1 we study compact operators. Compact operators were the first attempt to deal with infinite-dimensional operator equations. By its nature, compactness is a suitable concept to achieve finite approximations of infinite objects. We present the basics of both the linear and nonlinear theories. In the linear case we focus on compact self-adjoint operators on a Hilbert space, which have remarkable spectral properties. Compact operators have obvious limitations. A broader class producing a more general framework for the analysis of infinite-dimensional problems, is provided by the so-called monotone operators from a Banach space X into its topological dual X ∗ . They are the natural generalization of increasing real functions on R and their N.S. Papageorgiou, S.Th. Kyritsi-Yiallourou, Handbook of Applied Analysis, Advances in Mechanics and Mathematics 19, DOI 10.1007/b120946_3, © Springer Science+Business Media, LLC 2009
148
3 Nonlinear Operators and Fixed Points
definition does not require any order structure on the Banach space. Prominent among monotone operators are the so-called maximal monotone operators, which exhibit remarkable surjectivity properties. A detailed study of such operators appears in the first half of Section 3.2. In the second half we deal with accretive operators that are the corresponding of monotone operators, when we deal with maps from X into itself (and not into X ∗ ). The importance of accretive operators comes from the fact that they are the generators of linear and nonlinear semigroups which play a central role in the study of evolution equations. In Section 3.2 we present the basic aspects of both the linear and nonlinear semigroup theories. In Section 3.3 we present the basic finite- and infinite-dimensional degree theories. We start with Brouwer’s degree theory which concerns all continuous functions ϕ : U −→ RN with U ⊆ RN nonempty, bounded, and open. Then we present the Leray–Schauder degree theory which extends Brouwer’s theory to an infinitedimensional setting and specifically to maps of the form I −ϕ with ϕ : U −→ X compact (compact perturbations of the identity). Using measures of noncompactness we extend the theory further to maps of the form I − ϕ with ϕ being γ-condensing (Nussbaum–Sadovskii degree theory). Finally using Galerkin and Yosida approximations we produce degree maps for nonlinear operators of monotone type. We also have several interesting topological applications of these degree theories. Degree theory leads smoothly to fixed points. So in Section 3.4 we present the metric fixed point theory. Starting with the celebrated Banach contraction principle, we prove several fixed point theorems in which the metric structure of the spaces and/or of the maps involved, play a crucial role. In Section 3.5 we pass to topological fixed point theory. Now the topological properties of the spaces and/or of the maps involved are the important ones. The best-known result in this direction is Brouwer’s fixed point theorem and its infinitedimensional counterpart, the Schauder fixed point theorem. Other fixed point results of topological flavor are also presented. Finally in Section 3.6 we deal with OBS (ordered Banach spaces) which have a partial order induced by an order cone and maps that exhibit certain positivity properties with respect to this partial order. Using structural properties of the order cones and degree-theoretic methods based on the so-called fixed point index, we prove theorems on the existence and multiplicity of fixed points.
3.1 Compact and Fredholm Operators The first efforts to deal with nonlinear functional equations in infinite-dimensional spaces involved some kind of compactness. Moreover, compact operators provide the natural framework that allows a smooth transition from the finite-dimensional theory to the infinite-dimensional one. DEFINITION 3.1.1 Let X, Y be Banach spaces, C ⊆ X a nonempty set, and f : C −→ Y . (a) We say that f is compact if it is continuous and maps bounded sets of C to relatively compact sets of Y . By K(C, Y ) we denote the set of all compact maps from C into Y .
3.1 Compact and Fredholm Operators
149
(b) We say that f is completely continuous if it is sequentially continuous from C with the relative weak topology into Y with the norm topology; that is, if w {xn }n≥1 ⊆ C and xn −→ x ∈ C, then f (xn ) −→ f (x) in Y . REMARK 3.1.2 In general the two classes of mappings introduced above are not comparable. However, we have the following result. PROPOSITION 3.1.3 If X is a reflexive Banach space, Y is a Banach space, C ⊆ X nonempty, closed, and convex and f : C −→ Y is completely continuous, then f is also compact. PROOF: Evidently f is continuous. Let B be a bounded subset of X. We need to show that f (B ∩ C) is relatively compact in Y . So let {yn }n≥1 ⊆ f (B ∩ C). Then yn = f (xn ) with xn ∈ B ∩ C. Because X is reflexive and {xn }n≥1 is bounded, it is relatively weakly sequentially compact (Eberlein–Smulian theorem) and so by passw ing to a suitable subsequence if necessary, we may assume that xn −→ x. Because f is completely continuous, we have that yn = f (xn ) −→ f (x) = y in Y and this proves the compactness of f . PROPOSITION 3.1.4 If X is a reflexive Banach space, Y is a Banach space, and A ∈ L(X, Y ), then A is completely continuous if and only if A is compact. PROOF: ⇒: Follows from Proposition 3.1.3. w w ⇐: Let xn −→ x in X. Then A(xn ) −→ A(x) in Y . Also {xn }n≥1 ⊆ X is bounded and so {A(xn )}n≥1 is relatively compact in Y . Therefore A(xn ) −→ A(x) in Y . REMARK 3.1.5 It is clear from the second part of the above proof that for linear operators compactness always implies complete continuity, without any additional structure on the Banach spaces X, Y . The set of all compact maps f : X −→ Y is a linear space and we have the following. PROPOSITION 3.1.6 If X, Y are Banach spaces, fn : X −→ Y , n ≥ 1, is a sequence of compact mappings, and f : X −→ Y is a mapping such that fn (x) −→ f (x) in Y uniformly on bounded subsets of X, then f is compact too. PROOF: Clearly f is continuous. We need to show that for every bounded set B ⊆ X, f (B) is relatively compact. Given ε > 0, we can find n ≥ 1 such that fn (x) − f (x)Y ≤ ε/2 for all x ∈ B. Also, because fn (B) is relatively compact, we M
Bε/3 fn (xm ) ⊇ fn (B). Then if x ∈ B, there can find {xm }M m=1 ⊆ B such that is m ∈ {1, . . . , M } such that
m=1
f (x) − f (xm )Y ≤ f (x) − fn (x)Y + fn (x) − fn (xm )Y + + fn (xm ) − f (xm )Y ε ε ε < + + = ε, 3 3 3 ⇒ f (B) is totally bounded, hence relatively compact in Y.
150
3 Nonlinear Operators and Fixed Points
REMARK 3.1.7 Note that the linear space K(X, Y ) (see Definition 3.1.1(a)) is closed under composition with continuous bounded mappings. DEFINITION 3.1.8 Let X, Y be Banach spaces, C ⊆ X a nonempty set, and f : C −→ Y . We say that f is a finite rank mapping, if it is continuous, bounded (i.e., maps bounded sets to bounded ones), and f (C) lies in a finite dimensional subspace of Y . We denote the linear space of finite rank mappings f : C −→ Y , by Kf (C, Y ). REMARK 3.1.9 By virtue of the Heine–Borel theorem we have Kf (C, Y ) ⊆ K(C, Y ). In fact, we show that in a sense K(C, Y ) is the closure of Kf (C, Y ). THEOREM 3.1.10 If X, Y are Banach spaces and C ⊆ X is nonempty bounded, then f ∈ K(C, Y ) if and only if f is the uniform limit of elements in Kf (C, Y ). PROOF: ⇒: The set f (C) is relatively compact in Y . So for every n ≥ 1, we can n find a finite set {yk }N k=1 ⊆ f (C) such that 1 for all x ∈ C. (3.1) n Let ξk (x) = max (1/n) − f (x) − yk Y , 0 . Then ξk ∈ C(C) and the ξk s do not all vanish simultaneously at x ∈ C (see (3.1)). Moreover, if we set min f (x) − yk Y <
1≤k≤Nn
N n
fn (x) =
ξk (x)yk
k=1 N n
,
x ∈ C,
ξk (x)
k=1
then we have N
n ξk (x) yk − f (x) 1 k=1 f (x) − fn (x)Y = < N n n ξk (x)
for all x ∈ C (see (3.1)).
k=1
Then the boundedness of f (C) implies the boundedness of fn (C) and so fn ∈ Kf (C, Y ). ⇐: It follows from Proposition 3.1.6 and Remark 3.1.9.
We recall the following generalization of Tietze’s extension theorem due to Dugundji [209, p. 188]. THEOREM 3.1.11 If X is a metric space, A ⊆ X is a closed subset, Y is a locally convex space, and f : A −→ Y is a continuous map, then there exists a continuous map f : X −→ Y such that f = f and A
f (X) ⊆ conv f (A).
3.1 Compact and Fredholm Operators
151
REMARK 3.1.12 Evidently in the above theorem we can replace Y by any convex subset D of Y . Using Theorem 3.1.11 and the fact that the closed convex hull of a norm compact set in a Banach space is again norm compact (Mazur’s theorem), we can have the following theorem. THEOREM 3.1.13 If X is a Banach space, C ⊆ X is nonempty, closed, and bounded, Y is a Banach space, and f ∈ K(C, Y ), then there exists f ∈ K(X, Y ) such that f = f and f (X) ⊆ conv f (C). C
DEFINITION 3.1.14 Let X, Y be metric spaces, C ⊆ Y nonempty closed and f : C −→ Y a continuous map. We say that f is proper , if for any compact set D in Y , the set f −1 (D) is compact in C. REMARK 3.1.15 The importance of this class of continuous maps stems from the fact that the property of properness restricts the size of the solution set S(y) = {x ∈ C : f (x) = y} for any given y ∈ Y . Evidently, if X and Y are Banach spaces, then all proper operators A ∈ L(X, Y ) are injective and have closed range. PROPOSITION 3.1.16 If X and Y are metric spaces and f ∈ C(X, Y ), then the following are equivalent. (a) f is proper. (b) f is a closed map (i.e., maps closed sets to closed sets) and for every y ∈ Y , the set f −1 (y) = S(y) is compact in X. PROOF: (a)⇒(b): The singleton {y} is compact in Y , thus from the properness of f it follows that f −1 (y) is compact in X. Now let C ⊆ X be nonempty and closed. We show that f (C) is closed in Y . To this end let {yn }n≥1 ⊆ f (C) and suppose that yn −→ y in Y as n → ∞. We have yn = f (xn ), xn ∈ C for all n ≥ 1. Note that D = {yn , y}n≥1 ⊆ Y is compact and because f is proper, f −1 (D) is compact in X. Because {xn }n≥1 ⊆ f −1 (D), by passing to a suitable subsequence if necessary, we may assume that xn −→ x in X. Evidently x ∈ C and f (xn ) −→ f (x). Hence y = f (x) ∈ f (C) and so f is closed. (b)⇒(a): Let D ⊆ Y be nonempty compact. We have to show that f −1 (D) is compact. For this purpose, let {xn }n≥1 ⊆ f −1 (D). Then f (xn ) = yn ∈ D and so we may assume that yn −→ y ∈ D in Y as n → ∞. Let Cn = {xk }k≥n . Because f is closed, y ∈ f (Cn ) for all n ≥ 1. Therefore, if x ∈ f −1 (y), then f (C n ) = f (Cn ) and −1 f (x) ∈ f (C n ) and so f (y) ∩ C n = ∅. This means that {xn }n≥1 has a cluster n≥1
point x ∈ f −1 (y). So we conclude that f −1 (D) is compact.
PROPOSITION 3.1.17 If X and Y are finite-dimensional Banach spaces and f ∈ C(X, Y ), then the following are equivalent. (a) f is proper. (b) f (x)Y −→ +∞ as xX −→ +∞ (i.e., f is weakly coercive).
152
3 Nonlinear Operators and Fixed Points
PROOF: (a)⇒(b): Because both X and Y are finite-dimensional, the properness of f implies that the inverse image of a bounded set in Y is a bounded set in X. But this is simply a restatement of the property of weak coercivity. (b)⇒(a): If D ⊆ Y is nonempty compact, then by virtue of the weak coercivity of f , f −1 (D) is bounded in X. It is also closed in X (because f ∈ C(X, Y )). So by the Heine–Borel theorem, we conclude that f −1 (D) is compact, (i.e., f is proper). There is a partial generalization to an infinite-dimensional setting of the above proposition. PROPOSITION 3.1.18 If X, Y are Banach spaces, f ∈ C(X, Y ), f is weakly coercive (i.e., f (x)Y −→ +∞ as xX −→ +∞), and one of the following holds, (i) f = g + h with g ∈ C(X, Y ) proper and h ∈ K(X, Y ), or w (ii) X is reflexive and xn −→ x in X, f (xn ) −→ y in Y imply xn −→ x in X, then f is proper. PROOF: First assume that (i) holds. Let D ⊆ Y be nonempty compact and let {xn }n≥1 ⊆ f −1 (D). Then yn = f (xn ) ∈ D for all n ≥ 1 and so we may assume that yn −→ y in Y . The weak coercivity of f implies that {xn }n≥1 ⊆ X is bounded. Because h ∈ K(X, Y ), we may assume that h(xn ) −→ y in Y . Then g(xn ) = yn − h(xn ) −→ y − y in Y as n → ∞. Because g is proper, we must have, at least for a subsequence, that xn −→ x in X. Then f (xn ) −→ f (x) = y ∈ D and so we conclude that f is proper. Now suppose that (ii) holds. Because X is reflexive and f (xn ) −→ y in Y as n → ∞, from the weak coercivity w of f we have that {xn }n≥1 ⊆ X is bounded and so we may assume that xn −→ x in X (Eberlein–Smulian theorem). Because of (ii), xn −→ x in X and so f (xn ) −→ f (x) = y ∈ D, which proves that f is proper. PROPOSITION 3.1.19 If X is a Banach space, C ⊆ X is nonempty, closed, and bounded, and f ∈ K(X, Y ), then g = I − f ∈ C(X, Y ) is proper. PROOF: Let D ⊆ X be nonempty and compact and let {xn }n≥1 ⊆ g −1 (D). Then yn = g(xn ) ∈ D for all n ≥ 1 and so we may assume that yn −→ y ∈ D in X. Also because f ∈ K(X, Y ), we have that {f (xn )}n≥1 is relatively compact in X and so we may assume that f (xn ) −→ u in X as n → ∞. Then xn −→ y + u in X as n → ∞ and y = g(y + u), which proves the properness of g. PROPOSITION 3.1.20 If X, Y are Banach spaces, U ⊆ X is nonempty open, and f ∈ K(U, Y ) is Fr´echet differentiable at x0 ∈ U , then f (x0 ) ∈ L(X, Y ) is a compact linear operator. X
PROOF: Suppose that f (x0 ) ∈ L(X, Y ) is not compact. Then f (x0 )(B 1 ) is not X relatively compact in Y (recall that B 1 = {u ∈ X : uX ≤ 1}). So we can find X {un }n≥1 ⊆ B 1 and ε > 0 such that f (x0 )(un ) − f (x0 )(um )Y ≥ 3ε
for all n, m ≥ 1, n = m.
3.1 Compact and Fredholm Operators
153
But from the Fr´echet differentiability of f at x0 , we have f (x0 + h) − f (x0 ) = f (x0 )h + r(x0 , h)
for all h ∈ X
and r(x0 , h)Y ≤ εhX if hX ≤ δ for some δ > 0, (see Definition 1.1.7). Therefore f (x0 + δun ) − f (x0 + δum )Y ≥ δf (x0 )un − f (x0 )um Y − r(x0 , δun )Y − r(x0 , δun )Y ≥ 3δε − δε − δε = δε, which contradicts the fact that f ∈ K(U, Y ).
One of the fundamental notions in linear operator theory is that of the spectrum. It generalizes the concept of the eigenvalue of a linear mapping in a finite-dimensional space. Compact linear operators have remarkable spectral properties, culminating in the spectral resolution theorem for compact self-adjoint operators. In what follows for X, Y Banach spaces, we set Lc (X, Y ) = L(X, Y ) ∩ K(X, Y )
and
Lf (X, Y ) = L(X, Y ) ∩ Kf (X, Y ).
DEFINITION 3.1.21 Let X be a complex Banach space and A ∈ L(X). The spectrum σ(A) of A is defined by σ(A) = {λ ∈ C : λI − A is not invertible} and the resolvent set (A) is defined by (A) = C \ σ(A). If λ ∈ (A), then the operator R(λ) = (λI − A)−1 ∈ L(X) is called the resolvent of A. REMARK 3.1.22 In the case of a real Banach space, the definition is analogous considering only real λ. However, in the real case some important results are not true. For example, if X is a real Banach space it is not true that for every A ∈ L(X), σ(A) = ∅, although this is true for X a complex Banach space. Nevertheless because we focus on self-adjoint operators in Hilbert spaces, we show that σ(A) ⊆ R and so we can assume that we have a real Hilbert space, as are all the vector spaces in this volume. DEFINITION 3.1.23 Let X be a complex Banach space and A ∈ L(X). A number λ ∈ C is called an eigenvalue of A if there exists x ∈ X \ {0} such that A(x) = λx. Then such an x = 0 is called an eigenvector corresponding to the eigenvalue λ. The space ker(λI − A) is called the eigenspace corresponding to the eigenvalue λ. The set of all eigenvalues of A is called the point spectrum of A and it is denoted by σp (A). REMARK 3.1.24 Again, there is an analogous definition for real Banach spaces. Evidently σp (A) ⊆ σ(A). If dim X < +∞, then from linear algebra we know that the operator λI −A is invertible if and only if it is injective. So in this case σ(A) = σp (A). On the other hand in an infinite-dimensional space it may happen that the point spectrum is empty. Indeed let X = H = L2 [0, 1] and let A ∈ L(H) be defined by A(x)(t) = tx(t) for all t ∈ [0, 1]. If λ ∈ C and λx(t) − tx(t) = 0 for some x ∈ L2 [0, 1] and almost all t ∈ [0, 1], then (λ − t)x(t) = 0 a.e. on T and so x(t) = 0 a.e. on T . However, it can be shown that [0, 1] ⊆ σ(A). We leave the details to the reader.
154
3 Nonlinear Operators and Fixed Points
PROPOSITION 3.1.25 If H is a complex Hilbert space and A ∈ L(H) is selfadjoint, then σp (A) ⊆ R and eigenvectors corresponding to different eigenvalues are orthogonal. PROOF: A is self-adjoint therefore for every x ∈ H we have (Ax, x)H = (x, Ax)H = (Ax, x)H , ⇒ (Ax, x)H ∈ R
for all x ∈ H.
If λ ∈ σp (A) and x ∈ H is an eigenvector corresponding to λ, then (Ax, x)H = (λx, x)H = λx2 (Ax, x)H ⇒ λ= ∈ R (i.e., σp (A) ⊆ R). x2 If λ, µ ∈ σp (A), λ = µ and x1 , x2 are eigenvectors corresponding to λ, µ respectively, then Ax1 = λx1 and Ax2 = µx2 , ⇒ (Ax1 , x2 )H = λ(x1 , x2 )H and (Ax1 , x2 )H = (x1 , Ax2 )H = µ(x1 , x2 )H , ⇒ (λ − µ)(x1 , x2 )H = 0 (i.e., x1 ⊥x2 , because λ = µ). REMARK 3.1.26 Similarly we can show that eigenvectors corresponding to different eigenvalues of an operator A on a Banach space X are linearly independent. PROPOSITION 3.1.27 If H is a complex Hilbert space, A ∈ L(H) is self-adjoint and λ ∈ C, then λ ∈ σ(A) if and only if inf[ (λI − A)xH : xH = 1] = 0. PROOF: If λ ∈ (A), then (λI − A)−1 ∈ L(H) and for every x ∈ ∂B1 = {x ∈ H : xH = 1}, we have 1 = xH = (λI − A)−1 (λI − A)xH ≤ (λI − A)−1 L(H) (λI − A)xH , ⇒ inf[(λI − A)xH : xH = 1] ≥ (λI − A)L(H) > 0 for λ ∈ (A). (3.2)
We show that if inf (λI − A)xH : xH = 1 > 0, then λI − A is invertible. Clearly due to homogeneity, if inf[(λI − A)xH : xH = 1] = c0 > 0, then (λI − A)xH ≥ c0 xH
for all x ∈ H.
(3.3)
Hence (λI − A)x = 0 if and only if x = 0, (i.e., λI − A is injective). Next we show that λI − A is also surjective, which by Banach’s theorem implies that (λI − A)−1 ∈ L(H). First we show that (λI − A)(H) is dense in H. If this is not the case we can find h ∈ H, h = 0 such that (λI − A)x, hH = 0
for all x ∈ H,
⇒ x, (λI − A)hH = 0
for all x ∈ H (because A is self-adjoint),
⇒ (λI − A)h = 0,
a contradiction.
3.1 Compact and Fredholm Operators
155
Therefore (λI − A)(H) is dense in H. Also we show that (λI −A)(H) is closed in H. To this end let yn=(λI −A)xn −→ y in H. From (3.3) it follows that {xn }n≥1 ⊆ H is bounded and so we may assume w that xn −→ x in H. Then w
(λI − A)xn −→ (λI − A)x
in H,
⇒ y = (λI − A)x (i.e., (λI − A)(H) is closed). It follows that λI − A is surjective, hence (λI − A)−1 ∈ L(H). So combining this with (3.2) we see that the proposition has been proved. PROPOSITION 3.1.28 If H is a complex Hilbert space and A ∈ L(H), then σ(A) ⊆ R. PROOF: Let λ = a + iβ with β = 0. We show that (λI − A)xH ≤ |λ|xH for all x ∈ H. To this end, because A is self-adjoint, we have λx − Ax, xH − x, λx − AxH = λx2H − Ax, xH − λx2H + Ax, xH ⇒
2|β|x2H
= (λ − λ)x2H = 2iβx2H , = λx − Ax, xH − x, λx − AxH ≤ | λx − Ax, xH | + | x, λx − AxH | ≤ 2(λI − A)xH x,
⇒ |β|xH ≤ (λI − A)xH
for all x ∈ H.
(3.4)
Invoking Proposition 3.1.27, from (3.4) we conclude that λ ∈ (A). Therefore σ(A) ⊆ R. REMARK 3.1.29 This proposition suggests that when dealing with the spectrum of self-adjoint operators, we can assume without any loss of generality that the Hilbert space H is real. In what follows we do this. PROPOSITION 3.1.30 If H is a Hilbert space, A ∈ L(H) is self-adjoint and m= inf Ax, xH , M = sup Ax, xH , then σ(A) ⊆ [m, M ] and m, M ⊆ σ(A). xH =1
xH =1
PROOF: From Proposition 3.1.28 we know that σ(A) ⊆ R. Let η > 0. We show that M + η ∈ (A). From Proposition 3.1.27, we know that it suffices to show that
(3.5) inf (M + η)I − A xH : xH = 1 > 0. For every x ∈ ∂B1 , we have (M + η)x − Ax, xH = (M + η)x2H − Ax, xH ≥ M + η − M = η > 0. Hence (3.5) is true and then Proposition 3.1.27 implies that M + η ∈ (A). Similarly m − η ∈ (A). Therefore σ(A) ⊆ [m, M ]. Next note that σ(A − ξI) = σ(A) − ξ. So by considering, if necessary, A + ξI instead of A, we may assume without any loss of generality that 0 ≤ m ≤ M . Also using the parallelogram law, we can easily check that
156
3 Nonlinear Operators and Fixed Points AL(H) = sup Ax, xH : xH = 1 .
It follows that M = AL(H) . We show that inf (M I − A)xH : xH = 1 = 0.
(3.6)
To this end let {xn }n≥1 ⊆ ∂B1 such that Axn , xn ↑ M = AL(H)
as n → ∞.
Note that because m ≥ 0, we have Ax, xH ≥ 0 for all x ∈ H. Hence 0 ≤ (M I − A)xn 2H = M xn − Axn 2H = M xn − Axn , M xn − Axn H = M 2 xn 2H − 2M Axn , xn H + Axn 2H ≤ 2M 2 − 2M Axn , xn H −→ 0 ⇒ (M I − A)xn H −→ 0
as n → ∞,
as n → ∞.
Therefore (3.6) holds and from Proposition 3.1.27 it follows that M ∈ σ(A). Similarly we show that m ∈ σ(A). PROPOSITION 3.1.31 If H is a Hilbert space and A ∈ L(H) is self-adjoint compact, then every λ ∈ σ(A)\{0} is an eigenvalue; that is, λ ∈ σp (A). PROOF: By virtue of Proposition 3.1.27, we can find {xn }n≥1 ⊆ ∂B1 such that λxn − Axn H −→ 0
as n → ∞.
(3.7)
Due to the compactness of A and by passing to a subsequence if necessary, we may assume that Axn −→ y in H. Because of (3.7) and because λ = 0, we have that xn −→ x in H. Then y = Ax and in the limit as n → ∞ we have λx = Ax with x = 1 (i.e., λ ∈ σp (A)). COROLLARY 3.1.32 If H is a Hilbert space and A ∈ L(H) is self-adjoint compact, then σp (A) = ∅. PROOF: If A = 0, then λ = 0 is an eigenvalue of A. So suppose that A = 0. Then at least one of m and M defined in Proposition 3.1.30 is nonzero and belongs in σ(A). By virtue of Proposition 3.1.31 it also belongs in σp (A). PROPOSITION 3.1.33 If X is a Banach space, A ∈ Lc (X) and λ ∈ σp (A)\{0}, then dim ker(λI − A) < +∞; that is, the eigenspace corresponding to λ is finitedimensional. PROOF: Let Eλ = ker(λI − A) and let C ⊆ Eλ be a nonempty bounded set. We have Ax = λx for all x ∈ C. (3.8) Because A is compact, A(C) is relatively compact. Therefore by (3.8) we have that λC = A(C) is relatively compact. Because C was an arbitrary bounded set in Eλ , we conclude that dim Eλ < +∞.
3.1 Compact and Fredholm Operators
157
PROPOSITION 3.1.34 If H is a Hilbert space and A ∈ Lc (H) is self-adjoint, then σp (A) is a countable set with 0 as the only possible limit point. PROOF: We show that for every ε > 0, σp (A) ∩ {|λ| > ε} is finite. We argue by contradiction. So suppose that there exists ε > 0 and a sequence of distinct eigenvalues {λn }n≥1 of A such that |λn | > ε for all n ≥ 1. Let {xn }n≥1 ⊆ ∂B1 such that Axn = λn xn for all n ≥ 1. If n = m, then from Proposition 3.1.25 we have that (xn , xm )H = 0. Therefore Axn − Axm 2H = λn xn − λm xm 2H = λ2n + λ2m ≥ 2ε2 , ⇒ A(B 1 ) is not relatively compact in H.
But this contradicts the hypothesis that A ∈ Lc (H).
PROPOSITION 3.1.35 If H is a Hilbert space and A ∈ Lc (H) is self-adjoint, then there is an orthonormal basis of H formed by eigenvectors of A. PROOF: For every λ ∈ σp (A), let Eλ = ker(λI − A) andconsider Bλ an orthonormal basis of Eλ . Then by virtue of Proposition 3.1.25 Bλ is orthonormal set of λ∈σp (A) H. Suppose V = span Eλ = H. We consider the space V ⊥ (the orthogonal comλ∈σp (A)
plement of V in H). Clearly A(V ) ⊆ V and so A(V ⊥ ) ⊆ V ⊥ (i.e., the subspace V ⊥ is A-invariant). By Corollary 3.1.32 A has an eigenvalue and so an eigenvector V⊥ ⊥ ⊥ u ∈ V \ {0}. Then u ∈ V ∩ V, u = 0, a contradiction. So V = H and Bλ is λ∈σp (A)
an orthonormal basis of H.
REMARK 3.1.36 This proposition essentially says that every self-adjoint, compact operator on a Hilbert space is diagonalizable. Now we are ready for the spectral resolution theorem for self-adjoint, compact operators on a separable Hilbert space. THEOREM 3.1.37 If H is an infinite-dimensional separable Hilbert space and A ∈ Lc (H) is self-adjoint, then there is an orthonormal basis {en }n≥1 of H consisting of eigenvectors of A such that for λn being the eigenvalue corresponding to en , we have A(x) = λn x, en H for all x ∈ H. n≥1
PROOF: Due to Proposition 3.1.35 and the separability of H, we can find a countable orthonormal basis {en }n≥1 of H consisting of eigenvectors of A. We have
m
λn x, en H en 2H =
n=k
⇒
n≥1
−→ 0
m
|λn x, en H |2 ≤ A2L(H)
n=k
as k, m −→ ∞,
λn x, en H en is convergent in H.
m n=k
| x, en H |2
158
3 Nonlinear Operators and Fixed Points Moreover, if x ≤ 1, then for every m ≥ 1 we have
m
λn x, en H en 2H =
n=1
m
λ2n | x, en H |2
n=1
≤ A2L(H)
m
| x, en H |2
n=1
≤
A2L(H)
| x, en H |2
n≥1
⇒
= A2L(H) x2H , λn x, en H en = F (x);
x ∈ H belongs in L(H).
n≥1
Because A(en ) = λn en , we infer that A(en ) = F (en ) for all n ≥ 1, hence A = F . PROPOSITION 3.1.38 If H is a Hilbert space and A ∈ Lc (H) is self-adjoint, then σ(A) = σp (A). PROOF: If dim H <+∞, then σ(A) = σp (A) = finite set (see Remark 3.1.24). If dim H = +∞ and λ ∈ σ(A) \ {0}, then λ ∈ σp (A) (see Proposition 3.1.31). Due to the compactness of A, 0 ∈ σ(A). If 0 is not an eigenvalue, then by virtue of the proof of Proposition 3.1.34, we can find {λn }n≥1 ⊆ σp (A) \ {0} such that λn −→ 0. Therefore σ(A) = σp (A). Now we return to the general Banach space setting and prove some results that lead to the introduction of Fredholm operators. PROPOSITION 3.1.39 If X is a Banach space, A ∈ Lc (X), and λ = 0, then R(λI − A) is closed. PROOF: We may assume that λ = 1. Let un = xn − A(xn ) and
suppose that un −→ u in X. We need to show that u ∈ R(λI − A). Let dn = d xn , ker(I − A) . Because ker(I − A) is finite-dimensional (see Proposition 3.1.33), we can find yn ∈ ker(I − A) such that dn = xn − yn X . We have un = xn − yn − A(xn − yn ),
n ≥ 1.
(3.9)
We show that {xn − yn }n≥1 ⊆X is bounded. Suppose that this is not true. We may assume that xn − yn X −→+∞ as n → ∞. Set vn =
xn − yn , xn − yn X
n ≥ 1.
From (3.9) we have vn − A(vn ) =
un −→ 0 xn − yn X
as n → ∞.
(3.10)
Due to the compactness of A, we may assume that A(vn ) −→ w in X. Then from (3.10) it follows that vn −→ w in X and w −A(w) = 0; that is, w ∈ ker(I −A). Note that
3.1 Compact and Fredholm Operators
d xn , ker(I − A) d vn , ker(I − A) = =1 for all n ≥ 1 xn − yn X
⇒ d w, ker(I − A) = 1, a contradiction.
159
So indeed {xn − yn }n≥1 ⊆ X is bounded and due to the compactness of A, we may assume that A(xn − yn ) −→ h in X. Therefore from (3.9), we have xn − yn −→ u + h
in X
as n → ∞.
Set f = u + h. Then u = f − A(f ) and so u ∈ R(I − A), which proves the closedness of R(I − A). REMARK 3.1.40 From Proposition 3.1.39 it follows that R(I − A) = ker(I − A∗ )⊥ and R(I − A∗ ) = ker(I − A)⊥ . The next result is known as Schauder’s theorem and its proof is an easy application of the Arzela–Ascoli theorem. We leave the details to the reader. THEOREM 3.1.41 If X, Y are Banach spaces, then A ∈ Lc (X, Y ) if and only if A∗ ∈ Lc (Y ∗ , X ∗ ). The theorem that follows is known as the Fredholm alternative theorem and is useful in the study of boundary value problems. THEOREM 3.1.42 If X is a Banach space, A ∈ Lc (X), and λ = 0, then ker(λI − A) = {0} if and only if R(λI − A) = X. PROOF: Again without any loss of generality, we can assume that λ = 1. ⇒: We argue by contradiction. Suppose X1 = R(I − A) = X. From Proposition 3.1.39 we know that X1 is a Banach space and A(X1 ) ⊆ X1 (i.e., X1 is A-invariant). Then A ∈ Lc (X1 ) and X2 = (I − A)(X1 ) is a Banach subspace of X1 . Note X1
that because I − A is injective, X2 = X1 . We continue this way and produce {Xn = (I − A)n (X)}n≥1 a strictly decreasing sequence of Banach subspaces of X. Using the lemma of Riesz, we can have xn ∈ Xn , xn X = 1 and d(xn , xn+1 ) ≥ 12 , n ≥ 1. We have Axn − Axm = −(xn − Axn ) + (xm − Axm ) + (xn − xm ). If n > m, then Xn+1 ⊆ Xn ⊆ Xm+1 ⊆ Xm (with strict inclusions) and so −(xn − Axn ) + (xm − Axm ) + xn ∈ Xm+1 , 1 ⇒ Axn − Axm X ≥ , 2 which contradicts the fact that A ∈ Lc (X). Therefore R(I − A) = X. ⇐: Because R(I − A) = X, we have {0} = R(I − A)⊥ = ker(I − A∗ ). From Theorem 3.1.41, we know that A∗ ∈ Lc (X ∗ ). So from the first part of the proof, we know that R(I − A∗ ) = X ∗ . Then {0} = R(I − A∗ )⊥ = ker(I − A).
160
3 Nonlinear Operators and Fixed Points
REMARK 3.1.43 This theorem says that if A ∈ Lc (X), then either for every x ∈ H the equation (λI − A)x = h has a unique solution or otherwise the homogeneous equation (λI − A)x = 0 has a nontrivial solution. If X is finite-dimensional, then every linear operator (which is automatically continuous) is injective if and only if it is surjective. In an infinite-dimensional space X, an operator A ∈ L(X) can be injective without being surjective and vice versa. DEFINITION 3.1.44 Let X, Y be Banach spaces and A ∈ L(X, Y ) (a) We say that A is a Fredholm operator , if ker A is finite-dimensional and R(A) is closed and finite-codimensional. Then
indA = dim(kerA) − codim R(A) is called the index of A. We denote the set of Fredholm operators by Φ(X, Y ). (b) We say that A is a semi-Fredholm operator , if ker A is finite-dimensional and R(A) is closed. We denote the set of semi-Fredholm operators by Φ+ (X, Y ). EXAMPLE 3.1.45 (a) If X = Rn and Y = Rm , then every linear operator A : Rn −→ Rm is Fredholm with index ind A = n − m. (b) Let X = H = l2 and A ∈ L(H) is defined by Ax = (x2 , x3 , . . .),
x = (xn )n≥1 ∈ l2 .
Then ker A is one-dimensional (ker A = {x = (x1 , 0, 0, . . .)}) and R(A) = l2 . If we consider A ∈ L(H) defined by A x = (0, x1 , x2 , . . .),
x = (xn )n≥1 ∈ l2 ,
then ker A = {0} and codim R(A ) = 1. So both A, A are Fredholm operators. THEOREM 3.1.46 If X is a Banach space and A ∈ Lc (X), then λI − A ∈ Φ(X) for all λ = 0. PROOF: As before without any we can assume that λ = 1. loss of generality, Note that I ker(I−A) = Aker(I−A) . So I ker(I−A) is compact which of course implies that dim ker(I − A) < +∞. Next we show that R(A) is closed. Let V be the topological complement of ker(I − A), (i.e., V ⊆ X is a closed subspace such that X = ker(I − A) ⊕ V ). Let G=I − A and consider GV and AV . We see that GV ={0}. Then G(V ) = G(X) and so it suffices to show that GV is closed. But this follows if we show that −1
(GV ) ⊆L G(V ), V . By linearity we have to show that (GV )−1 is continuous at −1 the origin. If (GV ) is not continuous at x = 0, then we can find {xn }n≥1 ⊆ V such that G(xn ) −→ 0 but {xn }n≥1 does not converge to 0. We may assume that x ≥ δ > 0 for all n ≥ 1. Then (1 xn X ) ≤ 1/δ for all n ≥ 1 and so n X
G xn xn X ) X ≤ 1/δG(xn )X −→ 0 as n → ∞. Also because A ∈ Lc (X), we
see that at least for a subsequence A (xn xn X ) −→ u in X. Then because x x xn n n −A G = , xn X xn X xn X
3.1 Compact and Fredholm Operators we infer that
xn −→ u ∈ V xn X
161
in X, u = 0.
But G(u) = 0, which contradicts the fact that ker G ∩ V = {0}. Therefore G(V ) = G(X) is closed. Finally we show that G(X) has finite codimension. Suppose that this is not true. Then we can find a sequence {Xn }n≥0 of closed subspaces of X such that G(X) = X0 ⊆ X1 ⊆ . . . ⊆ Xn ⊆ . . . , where Xn is closed and of codimension one in Xn+1 , just by adding one-dimensional subspaces to G(X) = X0 . Using the Riesz lemma, for each Xn , we can find xn ∈ Xn with xn X = 1 and d(xn , xn−1 ) ≥ 1 − ε, ε > 0. Then for all m < n we have Axn − Axm X = xn − G(xn ) − xm + G(xm )X ≥ 1 − ε because −Axn − xm + Gxm ∈ Hn−1 . But this contradicts the fact that A ∈ Lc (X). THEOREM 3.1.47 If X, Y are Banach spaces, then Φ(X, Y ) is open in L(X, Y ) and S −→ ind S is continuous. PROOF: Let S ∈ Φ(X, Y ). Then X = ker S ⊕ V . Evidently S is an isomorphism of V on S(V ). Hence Y = S(V ) ⊕ W for some finite-dimensional subspace W . Consider the map ξ : V ⊕ W −→ S(V ) ⊕ W defined by ξ(x, y) = Sx + y.
This is an isomorphism. But recall that Isom V ⊕ W, S(V ) ⊕ W is open in L V ⊕ W, S(V ) ⊕ W . So if K is close to S, then the map η : V ⊕ W −→ K(V ) ⊕ W = Y defined by η(x, y) = Kx + y
is still in Isom V ⊕ W, S(V ) ⊕ W . Hence ker K is finite-dimensional and R(K) has finite codimension and so it is closed; that is, K ∈ Φ(X, Y ). Note that we can find E a finite-dimensional space such that X = V ⊕ ker K ⊕ E,
⇒ K ∈ Isom V ⊕ E, K(V ) ⊕ K(E)
and
dim E = dim K(E),
⇒ ind K = dim ker K − dim W + dim K(E) = dim ker S − dim W = ind S, ⇒ S −→ ind S is constant on connected components, hence continuous. REMARK 3.1.48 The above theorem remains true if instead of Φ(X, Y ) we consider Φ+ (X, Y ). Also from this theorem, we see that if X = Y and A ∈ Lc (X), then for all λ = 0 and ind(λI − A) = 0 (from Theorem 3.1.46 we know λI − A ∈ Φ(X)).
162
3 Nonlinear Operators and Fixed Points
The following proposition summarizes some of the useful properties of Fredholm operators and can be proved using the basic theorems of introductory linear functional analysis. PROPOSITION 3.1.49 If X, Y are Banach spaces and S ∈ Φ+ (X, Y ), then (a) if ind S = 0 and ker S = {0}, we have S −1 ∈ L(Y, X). (b) R(S) = (ker S ∗ )⊥ . (c) S ∗ ∈ Φ+ (Y ∗ , X ∗ ), ind S ∗ = −ind S and R(S ∗ ) = (ker S)⊥ . We conclude with a basic stability result for Fredholm operators. Its proof can be found in Kato [343, pp. 232–238]. THEOREM 3.1.50 If X, Y are Banach spaces, S ∈ Φ(X, Y ), and either A ∈ Lc (X, Y ) or A ∈ L(X, Y ) with AL ≤ ε for some ε = ε(S) > 0, then S + A ∈ Φ(X, Y ) and ind(S + A) = ind S. REMARK 3.1.51 The result is still valid if Φ(X, Y ) is replaced by Φ+ (X, Y ).
3.2 Monotone and Accretive Operators In this section we study the most important class of nonlinear maps from a Banach space X into its dual. These are the monotone maps. They constitute a manageable class of operators because of the very simple definition of monotonicity. They appear naturally in the calculus of variations and in the theory of nonlinear boundary value problems and provide an analytic framework broader than that of compact operators. When we deal with nonlinear maps from a Banach space into itself, then the corresponding notion is that of an accretive operator. When X = H = a pivot Hilbert space, the two notions coincide. Accretive operators are closely connected with the generation theory of semigroups (linear and nonlinear). In the second half of this section we deal with accretive operators and the semigroups they generate. Let X be a Banach space. By X ∗ we denote its topological dual and by ·, ·X the ∗ duality brackets for the pair (X, X ∗ ). Given a multivalued mapping A : X −→ 2X , let us fix some notation associated with it. (a) The domain of A is the set D(A) = {x ∈ X : A(x) = ∅}. (b) The graph of A is the set Gr A = {(x, x∗ ) ∈ X × X ∗ : x∗ ∈ A(x)}. (c) The inverse of A A−1 : X ∗ −→ 2X is defined by (A−1 )(x∗ ) = {x ∈ X : x∗ ∈ A(x)} (hence Gr A−1 = {(x∗ , x) ∈ X ∗ × X : (x∗ , x) ∈ Gr A}). REMARK 3.2.1 The generality of our setting allows us to identify every subset ∗ G ⊆ X × X ∗ with a mapping A : X −→ 2X defined by A(x) = {x∗ ∈ X ∗ : (x, x∗ ) ∈ G}. For this reason some authors identify a multivalued mapping with its graph. Note that in the present multivalued context the inverse mapping A−1 is always defined. ∗
DEFINITION 3.2.2 Given a mapping A : X −→ 2X , we say that:
3.2 Monotone and Accretive Operators
163
(a) A is monotone if for any x, y ∈ D(A) and x∗ ∈ A(x), y ∗ ∈ A(y) we have x∗ − y ∗ , x − y ≥ 0.
(3.11)
(b) A is strictly monotone if it is monotone and equality in (3.11) implies that x = y. (c) A is maximal monotone if it is monotone and for (y, y ∗ ) ∈ X×X ∗ the inequalities y ∗ − x∗ , y − xX ≥ 0 for all (x, x∗ ) ∈ Gr A, imply (y, y ∗ ) ∈ Gr A. (d) A is locally bounded at x ∈ D(A) if we can find a neighborhood U of x such that A(U ) is bounded. We say that A is locally bounded if it is locally bounded at every x ∈ D(A). (e) A is bounded if it maps bounded sets in X to bounded sets in X ∗ . ∗
REMARK 3.2.3 According to Definition 3.2.2(c), a mapping A: X −→ 2X is maximal monotone if and only if its graph Gr A is maximal with respect to inclusion among the graphs of all monotone mappings. This definition makes it necessary to consider set-valued mappings. Indeed a discontinuous nondecreasing function f : R −→ R is not maximal monotone. To become maximal monotone, we need to fill in the jump discontinuities, namely introduce f : R −→ 2R defined by f (x) = [f (x− ), f (x+ )] for all x ∈ R. By Zorn’s lemma, every monotone map has a maximal monotone extension. Recall that C ⊆ X is said to be absorbing if 0 ∈ C and X = λC (equivalently λ>0
for every x ∈ X, we can find λ > 0 such that λx ∈ C). A point x ∈ D ⊆ X is said to be the absorbing point of D if D − x is absorbing. Evidently if int D = ∅, then every x ∈ int D is an absorbing point of D. But there can be absorbing points of D not belonging in int D. In fact it can happen that int D = ∅. Consider D = ∂B1 ∪ {0}. Then the origin is an absorbing point of D, but int D = ∅. ∗
THEOREM 3.2.4 If A : X −→ 2X is a monotone map and x0 is an absorbing point of D(A), then A is locally bounded at x0 . PROOF: By picking any x∗0 ∈ A(x0 ) and replacing A by the monotone map A1 (y) = A(y +x0 )−x∗0 we see that without any loss of generality, we may assume that x0 = 0 and (0, 0) ∈ Gr A. Let ϕ(x) = sup y ∗ , x − yX : y ∈ D(A), yX ≤ 1, y ∗ ∈ A(y) for all x ∈ X
and
Lϕ 1 = {x ∈ X : ϕ(x) ≤ 1}.
Note that ϕ is the supremum of affine continuous functions. So ϕ is lower semicontinuous and convex, which means that Lϕ 1 is closed and convex. Note that because (0, 0) ∈ Gr A, we have ϕ ≥ 0. Also, if y ∈ D(A), y ∗ ∈ A(y), then due to the monotonicity of A and because (0, 0) ∈ Gr A, we have 0 ≤ y ∗ , y , ⇒ ϕ(0) = 0
(i.e., 0 ∈ Lϕ 1 ).
(3.12)
We show that Lϕ 1 is also absorbing. Recall that by hypothesis D(A) is absorbing. So if x ∈ X, we can find λ > 0 such that λx ∈ D(A) (i.e., A(λx) = ∅). Let u∗ ∈ A(λx). If (y, y ∗ ) ∈ Gr A, then by virtue of the monotonicity of A, we have
164
3 Nonlinear Operators and Fixed Points y ∗ , λx − yX ≤ u∗ , λx − yX ⇒ ϕ(λx) ≤ sup u∗ , λx − yX : y ∈ D(A), yX ≤ 1 ≤ u∗ , λxX + u∗ X ∗ < +∞. Choose t ∈ (0, 1) such that tϕ(λx) < 1. Because of convexity of ϕ, we have ϕ(tλx) ≤ tϕ(λx) + (1 − t)ϕ(0) = tϕ(λx) < 1 ⇒ tλx ∈ Lϕ 1
(see (3.12))
(i.e., Lϕ 1 is absorbing).
ϕ Then C =Lϕ 1 ∩ (−L1 ) is nonempty (because 0 ∈ C), closed, convex, symmetric, and absorbing, therefore 0 ∈ int Lϕ 1 . Hence we can find δ > 0 such that
ϕ(x) ≤ 1
for all xX ≤ 2δ,
⇒ y ∗ , xX ≤ y ∗ , yX + 1
for all y ∈ D(A), yX ≤ 1,
∗
all y ∈ A(y) and all xX ≤ 2δ, ⇒ 2δy ∗ X ∗ ≤ y ∗ X ∗ yX + 1 ≤ δy ∗ X ∗ + 1 for all y ∈ D(A) ∩ Bδ and all y ∗ ∈ A(y),
1 for all y ∗ ∈ A D(A) ∩ Bδ . ⇒ y ∗ X ∗ ≤ δ ∗
PROPOSITION 3.2.5 If A : X −→ 2X is a maximal monotone map and x ∈ D(A), then A(x) is nonempty, w∗ -closed, and convex. PROOF: If x∗1 , x∗2 ∈ A(x) and λ ∈ [0, 1], then for any (y, y ∗ ) ∈ GrA, we have (1 − λ)x∗1 + λx∗2 − y ∗ , x − yX = (1 − λ) x∗1 − y ∗ , x − yX + λ x∗2 − y ∗ , x − yX ≥ 0. From the maximality of A (see Definition 3.2.2(c)), it follows that (1 − λ)x∗1 + λx∗2 ∈ A(x)
(i.e., A(x) is convex). w∗
Also if {x∗α }α∈J ⊆ A(x) is a net such that x∗α −→ x∗ in X ∗ , then for all (y, y ∗ ) ∈ Gr A we have x∗α − y ∗ , x − yX ≥ 0, ⇒ x∗ − y ∗ , x − yX ≥ 0, which by the maximality of A implies that (x, x∗ ) ∈ Gr A; that is, A(x) is w∗ -closed. Combining Theorem 3.2.4 and Proposition 3.2.5, we obtain the following. ∗
PROPOSITION 3.2.6 If A : X −→ 2X is a maximal monotone map and x ∈ int D(A), then A(x) is nonempty, w∗ -compact, and convex. ∗
PROPOSITION 3.2.7 If A : X −→ 2X is a maximal monotone map, then Gr ∗ ∗ ∗ A is closed in X × Xw ∗ and in Xw × X . Here by Xw ∗ (resp., Xw ) we denote the ∗ ∗ space X (resp., X) furnished with the w -topology (resp., the w-topology).
3.2 Monotone and Accretive Operators
165 w∗
PROOF: Let {(xα , x∗α )}α∈J be a net in Gr A such that xα −→ x in X and x∗α −→ x∗ in X ∗ . Then for any (y, y ∗ ) ∈ Gr A, we have x∗α − y ∗ , xα − yX ≥ 0, ⇒ x∗ − y ∗ , x − yX ≥ 0. As before from the maximality of A we infer that (x, x∗ ) ∈ Gr A, which proves ∗ ∗ that Gr A is closed in X × Xw ∗ and similarly for the closedness in Xw × X . ∗
PROPOSITION 3.2.8 If A : X −→ 2X is a monotone map with convex and w∗ closed values, D(A) = X and for all x, u ∈ X the set-valued map λ −→ A(x + λu) ∗ from [0, 1] into X ∗ has a closed graph in [0, 1] × Xw ∗ , then A is maximal monotone. PROOF: Suppose that for (x, x∗ ) ∈ X × X ∗ , we have x∗ − y ∗ , x − yX ≥ 0
for all (y, y ∗ ) ∈ Gr A.
We need to show that (x, x∗ ) ∈ Gr A (see Definition 3.2.2(c)). We argue indirectly. So suppose that x∗ ∈ / A(x). By hypothesis A(x) is w∗ -closed and convex. So by the strong separation theorem, we can find u ∈ X \ {0} and ε > 0 such that sup v ∗ , uX : v ∗ ∈ A(x) ≤ x∗ , uX − ε. (3.13) In (3.13) we set y = yλ = x + λu, λ > 0 and y ∗ = yλ∗ ∈ A(yλ ). Then yλ∗ − x∗ , uX ≥ 0. Because of Theorem 3.2.4 {yλ∗ }λ∈[0,1] ⊆ X ∗ is bounded and so we may assume w∗
that yλ∗ −→ v ∗ in X ∗ . Then by hypothesis (x, v ∗ ) ∈ Gr A. If we pass to the limit as λ ↓ 0 we obtain 0 ≤ v ∗ − x∗ , uX
which contradicts (3.13).
DEFINITION 3.2.9 Let A : X −→ X ∗ be a single-valued map with D(A) = X. Then we say: w∗
(a) A is demicontinuous if xn −→ x in X, implies that A(xn ) −→ A(x) in X ∗ . (b) A is hemicontinuous if for all x, y ∈ X, the map λ −→ A(x + λy) is continuous ∗ from [0, 1] into Xw ∗. REMARK 3.2.10 Evidently any demicontinuous map is hemicontinuous. Conversely, it is easy to check that if A : X −→ X ∗ is monotone and hemicontinuous, it is demicontinuous. COROLLARY 3.2.11 If A : X −→ X ∗ is monotone, and hemicontinuous, then A is maximal monotone. An important monotone map that is a basic tool in the study of maximal monotone maps and of nonlinear evolution equations, is the so-called duality map.
166
3 Nonlinear Operators and Fixed Points
DEFINITION 3.2.12 Let X be a Banach space and X ∗ its dual. ∗
(a) The duality map (or normalized duality map) is the map F : X −→ 2X defined by F(x) = {x∗ ∈ X ∗ : x∗ , xX = x2X = x∗ 2X ∗ }. (b) Let ξ : R+ −→ R+ be a continuous, strictly increasing function such that ξ(0) = 0 and lim ξ(r) = +∞ (such a function is called the gauge function). The n→∞
∗
duality map with gauge ξ is the map Fξ : X −→ 2X defined by Fξ (x) = x∗ ∈ X ∗ : x∗ , xX = x∗ X ∗ xX , x∗ X = ξ(xX ) . REMARK 3.2.13 By the Hahn–Banach theorem, it follows that D(F) = D(Fξ ) = X. Moreover, both F and Fξ have closed and convex values. Note that if ξ(r) = r, r that F = Fξ . If ξ is a gauge function and η(r) = 0 ξ(s)ds, then η is a convex function and Fξ (x) = ∂η(xX ). In particular, if η(x) = 12 x2X , then F(x) = ∂η(x) for all x ∈ X. Here by ∂η we denote the subdifferential of the convex function η(·) (see Definition 1.2.28). In the sequel, for simplicity in the presentation, we limit ourselves to the normalized duality map F. ∗
DEFINITION 3.2.14 Let A : X −→ 2X be a map. (a) We say that A is coercive, if either D(A) is bounded or D(A) is unbounded and inf[x∗ , xX : x∗ ∈ A(x)] −→ +∞ xX
as xX −→ +∞, x ∈ D(A).
(b) We say that A is weakly coercive if either D(A) is bounded or D(A) is unbounded and inf x∗ X ∗ : x∗ ∈ A(x) −→ +∞ as xX −→ +∞, x ∈ D(A). REMARK 3.2.15 Evidently coercivity implies weak coercivity. PROPOSITION 3.2.16 If X is a reflexive Banach space and X ∗ is strictly ∗ convex, then F : X −→ 2X is single-valued, demicontinuous, maximal monotone, bounded, coercive, and odd. PROOF: Suppose x∗k ∈ F (x), k = 1, 2. Then 2x∗k X ∗ xX ≤ x∗1 2X ∗ + x∗2 2X ∗ = x∗1 + x∗2 , xX ≤ x∗1 + x∗2 X ∗ xX , ⇒ x∗1 X ∗ ≤
1 ∗ x1 + x∗2 X ∗ . 2
(3.14)
Because x∗1 X ∗ = x∗2 X ∗ and X ∗ is strictly convex, then from (3.14) it follows that x∗1 = x∗2 . Next we show that F is demicontinuous. To this end let xn −→ x in X. Then F(xn )X ∗ = xn X −→ xX as n → ∞. Because X ∗ is reflexive, we may assume (at least for a subsequence), that F(xn ) −→ x∗ w
in X ∗
as n → ∞.
3.2 Monotone and Accretive Operators
167
So for all u ∈ X, we have x∗ , uX = lim F (xn ), uX ≤ lim xn X uX = xX uX . n→∞
n→∞
Also we have x∗ , xX = lim F (xn ), xn X = lim xn 2X = x2X , ⇒ x∗ = F (x).
n→∞
n→∞
Therefore by Urysohn’s criterion for convergent sequences, we conclude that for w the original sequence we have F(xn ) −→ F(x) in X ∗ as n → ∞. Note that for every x, u ∈ X, we have F (x) − F (u), x − uX = x2X − 2xX uX + u2X ≥ 0, ⇒ F is monotone, hence maximal monotone (see Corollary 3.2.11). Finally it is clear from its definition that F is bounded, coercive, and odd.
PROPOSITION 3.2.17 If X is a reflexive Banach space, X ∗ is strictly convex, and ψ0 (x) = xX , then ψ0 is Gˆ ateaux differentiable at all x ∈ X \{0} and ψ0 (x) =
F (x) x
for all x ∈ X \{0}.
PROOF: For all x, y ∈ X we have F (y), y − xX ≥ y2X − yX xX 1 ≥ y2X − (y2X + x2X ) 2 1 1 = y2X − x2X 2 2 ≥ yX xX − x2X ≥ F (x), y − xX . Let y = x + λh, h ∈ X, and λ ∈ R. We obtain λ F (x), hX ≤
1 1 x + λh2X − x2X ≤ λ F(x + λh), hX . 2 2
(3.15)
From Proposition 3.2.16 we know that F (x + λh), hX −→ F (x), hX as λ → 0. So from (3.15) it follows that F(x) = η (x) ateaux derivative of η(x) = 12 x2X . Because ψ0 (x) = η(x)1/2 , where η (x) is the Gˆ from Proposition 3.2.16 ateaux differentiable at all x ∈ X \ {0}
we infer that ψ0 is Gˆ and ψ0 (x) = F (x) x. REMARK 3.2.18 Proposition 3.2.17 established the following duality implication. If X is a reflexive Banach space and X ∗ is strictly convex, then X is smooth. In fact the following stronger result is true. Namely, if X is reflexive, then X is strictly convex (resp., smooth) if and only if X ∗ is smooth (resp., strictly convex).
168
3 Nonlinear Operators and Fixed Points
PROPOSITION 3.2.19 If X is a reflexive Banach space and X ∗ is locally uniformly convex, then F : X −→ X ∗ is continuous and ψ0 (x) = x is Fr´echet differentiable at every x ∈ X \ {0}. PROOF: Let xn −→ x in X. Then F(xn )X −→ F (x)X and from Proposition w 3.2.16 we also have that F (xn ) −→ F (x) in X ∗ . But X ∗ being locally uniformly convex it has the Kadec–Klee property and so F(xn ) −→ F(x) in X ∗ (i.e., F is continuous). Combining this with Proposition 3.2.17, we see that x −→ η(x) = 1 x2X is Fr´echet differentiable (see Proposition 1.1.10). Therefore x −→ ψ0 (x) = 2
1/2 is Fr´echet differentiable at every x ∈ X \ {0}. x = 2η(x) REMARK 3.2.20 In fact if X is reflexive and both X and X ∗ are locally uniformly convex, then F : X −→ X ∗ is a homeomorphism. Also if X ∗ is uniformly convex, then F is uniformly continuous on bounded sets of X. EXAMPLE 3.2.21 (a) If (Ω, Σ, µ) is a σ-finite measure space and 1 ≤ p < ∞, then the duality map on Lp (Ω) corresponding to the gauge function ξ(r) = rp−1 , is the subdifferential of x −→ (1/p)xpp , x ∈ Lp (Ω). So
x∗ ∈ Fξ (x) if and only if x∗ (z) ∈ |x(z)|p−1 sgn x(z) a.e. on Ω. (b) If Ω ∈ RN is a bounded domain and 1 < p < ∞, then the duality map on the Sobolev space W01,p (Ω) with norm x = Dxp corresponding to the gauge function ξ(r) = rp−1 is
F (x) = −div(Dxp−2 Dx) ∈ W −1,p (Ω) = W01,p (Ω)∗ ,
1 1 + = 1. p p
The importance of maximal monotone operators stems from their remarkable surjectivity properties under coercivity conditions. Surjectivity results correspond to existence theorems for nonlinear boundary value problems. Next we prove the main surjectivity result for maximal monotone maps. To do this we need some preparation. We start with a finite-dimensional result. PROPOSITION 3.2.22 If X is a finite-dimensional Banach space, C ⊆ X is a ∗ nonempty closed convex set, A : X −→ 2X is a monotone map with D(A) ⊆ C, and ∗ B : C −→ X is monotone, continuous, and coercive, then there exists x0 ∈ C such that x∗ + B(x0 ), x − x0 X ≥ 0 for all (x, x∗ ) ∈ Gr A. PROOF: Without any loss of generality, we may assume that (0, 0) ∈ Gr A. Indeed if this is not the case, we fix x, x∗ ∈ Gr A and replace A and B, by A and B defined by A(x) = A(x + x) − x∗ and B(x) = B(x + x) − x∗ . Note that A and B still have all the properties of A and B, namely A is monotone with D(A) ⊆ C and B is monotone, continuous, and coercive. First suppose that D(A) is bounded. Let K = conv D(A). Then K is compact and convex. Suppose that the proposition is not true. Then for every y ∈ K we can find (x, x∗ ) ∈ Gr A such that
3.2 Monotone and Accretive Operators
Therefore K =
x∗ + B(y), x − yX < 0.
y ∈ K : x∗ + B(y), x − yX < 0 . Clearly each set in the
(x,x∗ )∈Gr
169
A
union is open. Because K is compact, we can find {(xk , x∗k )}n k=1 ⊆ Gr A such that n !
y ∈ K : x∗k + B(y), xk − yX < 0 .
K=
k=1
Let {ϑk }n k=1 be a continuous partition of unity subordinate to this cover and consider the map ϕ : K −→ K defined by ϕ(y) =
n
ϑk (y)xk .
k=1
By Brouwer’s fixed point theorem (see Theorem 3.5.3), we can find x0 ∈ K such that ϕ(x0 ) = x0 . For every y ∈ K, we have h(y) =
n k=1 n
= =
k=1 n
ϑk (y)x∗k + B(y), ϕ(y) − yX ϑk (y)x∗k + B(y),
n
ϑi (y)(xi − y)X
i=1
ϑk (y)ϑi (y) x∗k + B(y), xi − yX .
k,i=1
If k = i and ϑ2k (y) = 0, then y∈ K and so x∗k + B(y), xk − yX < 0. If k = i ∗ and ϑk (y)ϑi (y) = 0, then y ∈ y ∈ K : x + B(y), x − y < 0 ∩ y ∈ K : k k X x∗i + B(y), xi − yX < 0 and so exploiting the monotonicity of A, we have x∗k + B(y), xi − yX + x∗i + B(y), xk − yX = x∗k + B(y), xk − yX + x∗i + B(y), xi − yX + x∗k − x∗i , xk − xi X < 0. Therefore h(y) < 0 for all y ∈ K. But h(x0 ) =
n
ϑk (x0 )x∗k + B(x0 ), ϕ(x0 ) − x0 X = 0
(recall that ϕ(x0 ) = x0 ),
k=1
a contradiction. Next we remove the hypothesis that D(A) is bounded. From the first part of the proof, we can find xn ∈ C such that for all (x, x∗ ) ∈ Gr AB (0) . x∗ + B(xn ), x − xn X ≥ 0 Since (0, 0) ∈ Gr AB
n
n (0)
, we obtain
B(xn ), xn X ≤ 0
for all n ≥ 1.
Due to the coercivity of B, it follows that {xn }n≥1 ⊆ C is bounded. So we may assume that xn −→ x0 in X as n → ∞. Then x0 ∈ C and
170
3 Nonlinear Operators and Fixed Points x∗ + B(x0 ), x − x0 X
for all (x, x∗ ) ∈ Gr A.
We extend this proposition to infinite dimensional Banach spaces and then we use the extension to prove surjectivity results for maximal monotone operators. PROPOSITION 3.2.23 If X is a reflexive Banach space, C ⊆ X is a nonempty ∗ closed convex set, A : X −→ 2X is a monotone map with D(A) ⊆ C and B: C −→ X ∗ is monotone, hemicontinuous, bounded, and coercive, then there exists x0 ∈ C such that x∗ + B(x0 ), x − x0 X ≥ 0 for all (x, x∗ ) ∈ Gr A. PROOF: We employ the method of finite-dimensional approximations (Galerkin method). So let {Xα }α∈J be a directed family of finite dimensional subspaces of X such that Xα = X. Let pα ∈ L(X, Xα ) be the projection onto the Xα operator. α∈J
Then p∗α ∈ L(Xα∗ , X ∗ ) is the corresponding embedding map. We define Aα = p∗α ◦ A ◦ pα ,
Bα = p∗α ◦ B ◦ pα
and
Cα = C ∩ Xα
for all α ∈ J.
Then Aα and Bα satisfy the hypotheses of Proposition 3.2.22 on Xα and so we can find xα ∈ Cα such that x∗ + Bα (xα ), x − xα Xα ≥ 0
⇒ x∗ + B(xα ), x − xα X ≥ 0
for all (xα , x∗α ) ∈ Gr Aα , for all (x, x∗ ) ∈ Gr (A ◦ pα ). (3.16)
In particular, B(xα ), xα X ≤ 0 for all α ∈ J and due to the coercivity and boundedness of B, we can find M > 0 such that xα X ≤ M
and
B(xα )X ∗ ≤ M
for all α ∈ J.
Due to the reflexivity of X, we can find a subsequence {xαn }n≥1 ⊆ {xα }α∈J such that w
xαn −→ x0
B(xαn ) −→ x∗0 w
and
with (x0 , x∗0 ) ∈ C × X ∗ .
Then from (3.16), we have lim sup B(xαn ), xαn X ≤ x∗ , x − x0 X + x∗0 , xX n→∞
for all (x, x∗ ) ∈ Gr A.
(3.17) By virtue of Zorn’s lemma, without any loss of generality, we may assume that A is maximal on D(A). We claim that there exists (x1 , x∗1 ) ∈ Gr A such that x∗1 , x1 − x0 X + x∗0 , x1 X ≤ x∗0 , x0 X .
(3.18)
Indeed if (3.18) is not true, then we have x∗ + x∗0 , x − x0 X > 0 ⇒
(x0 , −x∗0 )
∈ Gr A
for all (x, x∗ ) ∈ Gr A,
(due to the maximality of A).
(3.19)
3.2 Monotone and Accretive Operators
171
So if in (3.19) we set x = x0 and x∗ = x∗0 , we reach a contradiction. Hence (3.18) holds and using this in (3.17), we obtain lim sup B(xαn ), xαn X ≤ x∗0 , x0 X , n→∞
⇒ lim sup B(xαn ), xαn − x0 X ≤ 0.
(3.20)
n→∞
Now let x ∈ D(A) and xλ = λx0 + (1 − λ)x, λ ∈ [0, 1]. Then xλ ∈ C and because of the monotonicity of B, we have B(xαn ) − B(xλ ), xαn − xλ X ≥ 0 ⇒
for all n ≥ 1 and all λ ∈ [0, 1],
λ B(xαn ), xαn − x0 X + (1 − λ) B(xαn ), xαn − xX ≥ λ B(xλ ), xαn − x0 X + (1 − λ) B(xλ ), xαn − xX
⇒
lim inf B(xαn ), xαn − xX ≥ B(xλ ), x0 − xX , n→∞
for all λ ∈ [0, 1] (see (3.20)). Because B is hemicontinuous, we have lim inf B(xαn ), xαn − xX ≥ B(x0 ), x0 − xX , n→∞
⇒ lim inf B(xαn ), xαn X ≥ B(x0 ), x0 − xX + x∗0 , xX n→∞
for all x ∈ D(A) (3.21)
Then from (3.17) and (3.21), we obtain B(x0 ), x0 − xX ≤ x∗ , x − x0 X
for all (x, x∗ ) ∈ Gr A.
Using this proposition we can prove some remarkable surjectivity results for maximal monotone operators. THEOREM 3.2.24 If X is a reflexive Banach space, C ⊆ X a nonempty, closed, ∗ convex set, A : X −→ 2X is a maximal monotone map with D(A) ⊆ C and B: C −→ X ∗ is monotone, hemicontinuous, bounded, and coercive, then A + B is surjective. PROOF: Let x∗0 ∈ X ∗ and introduce the map A(x) = A(x) − x∗0
for all x ∈ D(A).
Note that A is still maximal monotone and D(A) = D(A) ⊆ C. We can apply Proposition 3.2.23 and obtain x0 ∈ C such that for all (x, x∗ ) ∈ Gr A, x∗ + B(x0 ), x − x0 X ≥ 0 ∗ ∗ for all (x, x∗ ) ∈ Gr A. ⇒ x − x0 − B(x0 ) , x − x0 X ≥ 0
(3.22)
Due to the maximal monotonicity of A, from (3.22), we infer that
x0 , x∗0 − B(x0 ) ⊆ Gr A, ⇒ x∗0 ∈ A(x0 ) + B(x0 ). Because x∗0 ∈ X ∗ was arbitrary, we conclude that A + B is surjective.
In what follows we use the following theorem, due to Troyanski [587], to equivalently renorm X and X ∗ in a way that it is helpful in our analysis.
172
3 Nonlinear Operators and Fixed Points
THEOREM 3.2.25 If X is a reflexive Banach space, then there exists an equivalent norm on X so that both X and X ∗ are locally uniformly convex. REMARK 3.2.26 From Proposition 3.2.16 and Remark 3.2.20, we know that the duality map F : X −→ X ∗ corresponding to this new equivalent norm, is monotone, a homeomorphism, bounded, and coercive. ∗
THEOREM 3.2.27 If X is a reflexive Banach space and A : X −→ 2X is maximal monotone, then A is surjective if and only if A−1 is locally bounded. PROOF: ⇒: Note that A−1 is maximal monotone too. Moreover, D(A−1 ) = X ∗ . Then from Theorem 3.2.4 it follows that A−1 is locally bounded. ⇐: We show that the range R(A) of A is both closed and open in X ∗ . To this end let x∗n ∈ A(xn ), n ≥ 1, and suppose that x∗n −→ x∗ . Then xn ∈ −1 A (x∗n ), n ≥ 1. Because A−1 is locally bounded, {xn }n≥1 ⊆ X is bounded and so w we may assume that xn −→ x in X as n → ∞. Because (xn , x∗n ) ∈ Gr A for all n ≥ 1, from Proposition 3.2.7, we infer that (x, x∗ ) ∈ Gr A and so we have that R(A) is closed in X. Next we show that R(A) is open X. By virtue of Theorem 3.2.25, we may ∗ assume without any loss of generality that both X
and∗ X are locally uniformly ∗ −1 convex. Let x0 ∈ R(A) and r > 0 such that A B r (x0 ) is bounded in X. We can find x0 ∈ D(A) such that x∗0 ∈ A(x0 ). By virtue of Theorem 3.2.24, for every λ > 0 x −→ A(x) + λF(x − x0 ) is surjective (here F : X −→ X ∗ is the duality map). Given u∗ ∈ Br/2 (x∗0 ) we can find xλ ∈ D(A) and x∗λ ∈ A(xλ ) such that x∗λ + λF (xλ − x0 ) = u∗ ∗
⇒ u − λF (xλ − x0 ) −
x∗0 , xλ
(3.23) − x0 X ≥ 0
(because A is monotone)
⇒ u∗ − x∗0 , xλ − x0 X ≥ λ F (xλ − x0 ), xλ − x0 X = λxλ − x0 2X , r ⇒ λxλ − x0 X ≤ u∗ − x∗0 X ∗ < . 2
(3.24)
Also from (3.23), we have u∗ − x∗λ X ∗ = λF (xλ − x0 )X ∗ = λxλ − x0 X < ⇒ x∗λ − x∗0 X ∗ ≤ x∗λ − u∗ X ∗ + u∗ − x∗0 X ∗ < r Because A−1 B
r (x
∗)
is bounded, then the net {xλ }λ>0 is bounded in X and so
u∗ − x∗λ X ∗ = λxλ − xX −→ 0 ∗
⇒ u ∈ R(A) ⇒
Br/2 (x∗0 )
r 2 (see (3.23)).
as λ ↓ 0,
(because as we already proved R(A) is closed in X ∗ ),
⊆ R(A)
and so R(A) is open in X ∗ .
Because R(A) is both closed and open in X ∗ , we conclude that R(A) = X ∗ . COROLLARY 3.2.28 If X is a reflexive Banach space and A : X −→ 2X maximal monotone, and weakly coercive, then A is surjective.
∗
is
3.2 Monotone and Accretive Operators
173
PROOF: The weak coercivity of A implies that A−1 is locally bounded. Then from Theorem 3.2.27 it follows that A is surjective. Combining the above result with Corollary 3.2.11, we obtain the following. COROLLARY 3.2.29 If X is a reflexive Banach space and A : X −→ 2X monotone, hemicontinuous, and weakly coercive, then A is surjective.
∗
is
The next theorem provides a useful criterion for maximal monotonicity in terms of the duality map. THEOREM 3.2.30 If X is a reflexive Banach space such that both X and X ∗ are ∗ strictly convex and A : X −→ 2X is a monotone map, then A is maximal monotone if and only if for every λ > 0 (equivalently for some λ > 0) A + λF is surjective. PROOF: ⇒: Follows from Theorem 3.2.24. ⇐: Suppose that for some (y0 , y0∗ ) ∈ X × X ∗ , we have x∗ − y0∗ , x − y0 X ≥ 0
for all (x, x∗ ) ∈ Gr A.
(3.25)
Then by hypothesis we can find (x1 , x∗1 ) ∈ Gr A such that x∗1 + λF(x1 ) = y0∗ + λF(y0 ).
(3.26)
In (3.25) we set x = x1 and x∗ = x∗1 . We obtain λ F(y0 ) − F (x1 ), x1 − y0 X ≥ 0
(see (3.25)).
(3.27)
But because X, X ∗ are strictly convex, F is strictly monotone and so from (3.27) we infer that x1 = y0 . Hence (y0 , y0∗ ) ∈ Gr A and this proves the maximality of A. ∗
COROLLARY 3.2.31 If X is a reflexive Banach space, A : X −→ 2X is monotone and B : X −→ X ∗ is strictly monotone, hemicontinuous, bounded, and coercive, then A is maximal monotone if and only if A + B is surjective. ∗
COROLLARY 3.2.32 If X is a reflexive Banach space, A : X −→ 2X is maximal monotone and B : X −→ X ∗ is monotone, hemicontinuous, and bounded, then A + B is maximal monotone. PROOF: By virtue of Theorem 3.2.25 we may assume without any loss of generality that both X and X ∗ are locally uniformly convex. Also if we replace A and B by A(x) = A(x + x0 ) + B(x0 )
and
B(x) = B(x + x0 ) − B(x0 )
for some x0 ∈ X,
then we see that we may assume that 0 = B(0). Then B + F is monotone, hemicontinuous, bounded, and coercive. Given u∗ ∈ X ∗ , by Proposition 3.2.23 we can find x0 ∈ X such that x∗ + B(x0 ) + F (x0 ) − u∗ , x − x0 X ≥ 0
for all (x, x∗ ) ∈ Gr A.
174
3 Nonlinear Operators and Fixed Points Because A is maximal monotone, we have that u∗ ∈ A(x0 ) + B(x0 ) + F (x0 ), ⇒ R(A + B + F ) = X ∗
and this by Theorem 3.2.30 implies that A + B is maximal monotone.
Another result on the maximality of the sum is the following one whose proof can be found in Barbu [58, p. 46]. ∗
THEOREM 3.2.33 If X is a reflexive Banach space and A1 , A2 : X −→ 2X are two maximal monotone maps such that int D(A1 ) ∩ D(A2 ) = ∅, then A1 + A2 is maximal monotone. REMARK 3.2.34 If X =H = a Hilbert space, then the domain condition
in the above theorem can be replaced by a weaker one which says that 0 ∈ int D(A1 ) − D(A2 ) (recall that int D(A1 ) − D(A2 ) ⊇ int D(A1 ) − D(A2 ). This new condition is symmetric in A1 and A2 and can be satisfied even if D(A1 ) and D(A2 ) have an empty interior. For details we refer to Attouch [33]. It is easy to see that the subdifferential of a function ϕ ∈ Γ0 (X) (see Definition 1.2.1) is monotone. Next we show that in fact it is maximal monotone. THEOREM 3.2.35 If X is a Banach space and ϕ ∈ Γ0 (X), then ∂ϕ : X −→ 2X is maximal monotone.
∗
PROOF: We do the proof for the case when X is reflexive and for the general case we refer to Rockafellar [522]. Directly from the definition of the subdifferential (see Definition 1.2.28), we can see that ∂ϕ is monotone. So we need to show that ∂ϕ is maximal. By virtue of Theorem 3.2.30, it suffices to show that ∂ϕ + F is surjective. To this end, let u∗ ∈ X ∗ and consider the function ψ : X −→ R = R ∪ {+∞} defined by 1 for all x ∈ X. ψ(x) = ϕ(x) + x2X − u∗ , xX 2 Clearly ψ ∈ Γ0 (X). Also from Proposition 1.2.20 we know that we can find (x∗0 , ϑ0 ) ∈ X ∗ × R such that ϕ(x) ≥ x∗0 , xX − ϑ0 for all x ∈ X. So 1 x2X − u∗ xX , 2 as xX −→ ∞.
ψ(x) ≥ −x∗0 X ∗ xX + ⇒ ψ(x) −→ +∞
Invoking Corollary 2.1.11 we obtain x ∈ X such that ψ(x) = inf ψ, X
⇒ 0 ∈ ∂ψ(x) = ∂ϕ(x) + F(x) − u∗ ⇒ u∗ ∈ ∂ϕ(x) + F(x). Because u∗ ∈ X ∗ was arbitrary, we conclude that ∂ϕ + F is surjective, hence x −→ ∂ϕ(x) is maximal monotone. In order to identify those maximal monotone maps on X that are of the subdifferential type, we need to introduce the following specification of monotonicity.
3.2 Monotone and Accretive Operators
175
∗
DEFINITION 3.2.36 Let X be a Banach space and A : X −→ 2X . (a) We say that A is cyclically monotone if for any subset {x0 , . . . , xn } ⊆ D(A), n ≥ 1 and x∗k ∈ A(xk ), 0 ≤ k ≤ n we have n
x∗k , xk − xk+1 X ≥ 0,
with xn+1 = x0 .
k=0
(b) We say that A is maximal cyclically monotone if it is cyclically monotone and ∗ there is no cyclically monotone map A : X −→ 2X whose graph strictly contains the graph of A. REMARK 3.2.37 Every monotone map A : R −→ 2R is in fact cyclically mono∗ tone. To see this let {xk }n k=0 ⊆ D(A) and xk ∈ A(xk ) for all 0 ≤ k ≤ n. We may assume that xk < xk+1 for 0 ≤ k ≤ n − 1 and so x∗k ≤ x∗k+1 for all 0 ≤ k ≤ n − 1. So if xn+1 = x0 , we have n
x∗k (xk − xk+1 ) =
k=0
n−1
x∗k (xk − xk+1 ) + x∗n (xn − x0 )
k=0
=
n−1
(x∗k − x∗n )(xk − xk+1 ) ≥ 0.
k=0
EXAMPLE 3.2.38 Not every monotone map is cyclically monotone. Consider the linear map in R2 defined by A(x1 , x2 ) = (x2 , −x1 ). Consider the points (1, 1), (0, 1), and (1, 0) to check that A is not cyclically monotone. ∗
THEOREM 3.2.39 If X is a Banach space and A : X −→ 2X , then A is maximal cyclically monotone if and only if there exists ϕ ∈ Γ0 (X) such that A = ∂ϕ. PROOF: ⇐: Directly from Definition 1.2.28, we see that ∂ϕ is cyclically monotone and this combined with Theorem 3.2.25 implies that ∂ϕ is maximal cyclically monotone. ⇒: Let (x0 , x∗0 ) ∈ Gr A and define ϕ(x) = sup
n−1
x∗k , xk+1 − xk X + x∗n , x − xn X : (xk , x∗k ) ∈ Gr A,
k=0
0 ≤ k ≤ n, n ≥ 1 .
(3.28)
Evidently ϕ is convex and lower semicontinuous with values in R=R ∪ {+∞}. Moreover, ϕ(x0 ) ≤ 0 because A is cyclically monotone. Hence ϕ is proper; that is, ϕ ∈ Γ0 (X). Let (x, x∗ ) ∈ Gr A and u ∈ X. In the right-hand side of (3.28), we ∗ consider the (n + 1) pairs {(xk , x∗k )}n k=0 ∪ {(x, x )} ⊆ Gr A. We obtain ϕ(u) ≥
n−1
x∗k , xk+1 − xk X + x∗n , x − xn X + x∗ , u − xX ,
k=0
⇒ ϕ(u) ≥ ϕ(x) + x∗ , u − xX , ⇒ x∗ ∈ ∂ϕ(x).
176
3 Nonlinear Operators and Fixed Points
So Gr A ⊆ Gr ∂ϕ and from the first part of the proof we infer that Gr A = Gr ∂ϕ (i.e., A = ∂ϕ). COROLLARY 3.2.40 Every maximal monotone map A: R −→ 2R is of the subdifferential type. THEOREM 3.2.41 If X is a reflexive Banach space, ϕ ∈ Γ0 (X), and 0 ∈ D(∂ϕ), then ϕ(x) lim = +∞ xX →∞ xX x∈domϕ
if and only if A = ∂ϕ is coercive. PROOF: ⇒: Let x0 ∈ D(∂ϕ). Then for all (x, x∗ ) ∈ Gr ∂ϕ ϕ(x) − ϕ(x0 ) ≤ x∗ , x − x0 ∗ ∗ inf x , x − x0 : x ∈ ∂ϕ(x) ⇒ lim = +∞ (i.e., A = ∂ϕ is coercive). xX xX →∞ x∈D(∂ϕ)
⇐: Because A = ∂ϕ is coercive, maximal monotone (see Theorem 3.2.30) it is surjective (see Corollary 3.2.28). Also by virtue of Proposition 1.2.20, we may assume without any loss of generality that ϕ ≥ 0. Then for every x∗ ∈ X ∗ with x∗ X ∗ ≤ r, we can find x∈D(∂ϕ) and M > 0 such that x∗ ∈∂ϕ(x) and xX ≤ M . By definition x∗ , y − xX ≤ ϕ(y) − ϕ(x)
for all y ∈ X,
for all y ∈ X, ⇒ x∗ , yX ≤ ϕ(y) + M r ∗ x , yX ϕ(y) Mr ⇒ ≤ + , yX yX yX ϕ(y) = +∞. ⇒ lim yX →∞ yX
x∈domϕ
When we are in a Hilbert space we can introduce some useful single-valued approximations of a maximal monotone operator. DEFINITION 3.2.42 Let H be a Hilbert space identified with its dual (i.e., H = H ∗ , pivot space) and A : H −→ 2H a maximal monotone map. For every λ > 0 we define the following well-known operators. (a) Jλ = (I + λA)−1 , the resolvent of A. (b) Aλ = (1/λ)(I − Jλ ), the Yosida approximation of A. REMARK 3.2.43 Note that D(Jλ ) = D(Aλ ) = H for all λ > 0 and both maps Jλ and Aλ are single-valued. Several important properties of Jλ and Aλ are gathered in the next proposition. They follow easily from Definition 3.2.42.
3.2 Monotone and Accretive Operators
177
PROPOSITION 3.2.44 If H is a Hilbert space, H = H ∗ , and A : H −→ 2H is maximal monotone, then (a) Jλ is nonexpansive (i.e., Lipschitz continuous with constant 1) for all λ > 0.
(b) Aλ (x) ∈ A Jλ (x) for all x ∈ H and all λ > 0. (c) Aλ is monotone and Lipschitz continuous with constant 1/λ for all λ > 0. (d) For all x ∈ D(A), Aλ (x)H ≤ A0 (x)H = min x∗ H : x∗ ∈ A(x) for all λ > 0. (e) lim Aλ (x) = A0 (x) for all x ∈ D(A). λ→0
(f) D(A) is convex and lim Jλ (x) = proj x; D(A) for all x ∈ H. λ→0
REMARK 3.2.45 From (c) and Corollary 3.2.11 it follows that Aλ is maximal monotone. Also because A is maximal monotone, from Proposition 3.2.5 we know that A(x) is nonempty, closed, and convex for every x ∈ D(A). Hence the element of minimum norm in A(x) (the metric projection of the origin in A(x)) exists, is unique, and is denoted by A0 (x). In fact in every reflexive Banach space X, every ∗ maximal monotone map A : X −→ 2X has domain D(A) and range R(A)
which satisfy: D(A) and R(A) are both convex (virtual convexity). In (f) proj x; D(A) denotes the metric projection on the closed convex set D(A). The two operators Jλ and Aλ can also be defined when X is a reflexive Banach space that is not necessarily a Hilbert space. This is done as follows. DEFINITION 3.2.46 Let X be a reflexive Banach space such that both X and ∗ X ∗ are locally uniformly convex and A : X −→ 2X a maximal monotone map. Then by Theorem 3.2.30 for every λ > 0 and x ∈ X, the operator inclusion 0 ∈ F (y − x) + λA(y) has a solution. The hypothesis on X and X ∗ imply
that thissolution is unique and is denoted by Jλ (x). Also we set Aλ (x) = (1/λ)F x − Jλ (x) . REMARK 3.2.47 If H is a pivot Hilbert space (i.e., H = H ∗ ), then F = I and we recover Definition 3.2.42. Note that Jλ , Aλ are single-valued, and bounded and Aλ is also monotone, and demicontinuous (hence maximal monotone). Moreover, Aλ (x)X ∗ ≤ A0 (x)X ∗ for every x ∈ D(A) and lim Jλ (x) = x for every x ∈ D(A). λ↓0
For every x ∈ D(A), A(x) is nonempty, closed convex. Therefore due to the local uniform convexity of X ∗ , A0 (x) is well defined. If A is of the subdifferential type, then as we show below, Aλ is also of this type. To show this we introduce the following notion.
178
3 Nonlinear Operators and Fixed Points
DEFINITION 3.2.48 Let X be a Banach space and ϕ ∈ Γ0 (X). Then for every λ > 0, the Moreau–Yosida approximation ϕλ of ϕ, is defined by ϕλ (x) = inf ϕ(y) + (1/2λ)x − y2X : y ∈ X for all x ∈ X. REMARK 3.2.49 Note that ϕλ = ϕ ⊕ 1/(2λ) · 2X (see Definition 1.2.23). So ϕλ is convex and dom ϕλ = X. PROPOSITION 3.2.50 If X is a reflexive Banach space, X and X ∗ are both locally uniformly convex, ϕ ∈ Γ0 (X), and A = ∂ϕ, then
(a) ϕλ (x)=ϕ Jλ (x) + (1/2λ)x − Jλ (x)2X for all λ > 0 and all x ∈ X. ateaux differentiable and for all λ > 0, Aλ = (∂ϕ)λ = ∂ϕλ = ϕλ . (b) ϕλ is Gˆ (c) ϕ(Jλ x) ≤ ϕλ (x) ≤ ϕ(x) for all λ > 0, all x ∈ X, and lim ϕλ (x) = ϕ(x) for all λ↓0
x ∈ X.
PROOF: (a) For fixed x ∈ X, we consider the function y −→ ϑλ (y) = ϕ(y) + (1/2λ)x − y2X . Evidently ϑλ (·) is proper, lower semicontinuous, strictly convex and coercive. So there exists unique element xλ ∈ X such that ϕλ (x) = ϑλ (xλ ). The vector xλ ∈ X is the unique solution of the operator inclusion 1 0 ∈ − F (x − xλ ) + ∂ϕ(xλ ), λ ⇒ xλ = Jλ (x) (see Definition 3.2.46) and this proves (a).
(3.29)
(b) From (3.29), we obtain 0 ≤ ϕλ (y) − ϕλ (x) − Aλ (x), y − xX ≤ Aλ (y) − Aλ (x), y − xX for all x, y ∈ X. Let y = x + th with t > 0. Dividing with t > 0, we obtain lim t↓0
⇒ ϕλ
ϕλ (x + th) − ϕλ (x) for all h ∈ X, = Aλ (x), hX t is Gˆ ateaux differentiable and Aλ = (∂ϕ)λ = ∂ϕλ = ϕλ .
(c) In view of (a) we have
ϕ Jλ (x) ≤ ϕλ (x) ≤ ϕ(x)
for all x ∈ X.
(3.30)
Let x ∈ dom ϕ. Then from Remark 3.2.47 we know that Jλ (x) −→ x as λ ↓ 0 (because D(∂ϕ) = dom ψ). So we have
ϕ(x) ≤ lim inf ϕ Jλ (x) ≤ lim inf ϕλ (x) ≤ ϕ(x) (see (3.30)), λ↓0
⇒ ϕλ (x) ↑ ϕ(x)
λ↓0
as λ ↓ 0.
Next suppose x ∈ / dom ϕ. We show that ϕλ (x) −→ +∞ as λ ↓ 0. If this not the case, then we can find λn ↓ 0 and M > 0 such that
3.2 Monotone and Accretive Operators
179
ϕλn (x) ≤ M
for all n ≥ 1.
From part (a) we infer that Jλn (x) −→ x in X and ϕ Jλn (x) ≤ M . Hence ϕ(x) ≤ M , a contradiction to the fact that x ∈ / dom ϕ. In the context of a pivot Hilbert space, we can improve this proposition. COROLLARY 3.2.51 If X =H =a pivot Hilbert space, ϕ ∈ Γ0 (H), and A = ∂ϕ, then (a) ϕλ is Fr´echet differentiable and ∂ϕλ is Lipschitz continuous with constant 1/λ. (b) If λn −→ λ, xn −→ x in H, ∂ϕλn (xn ) −→ x∗ in H, then (x, x∗ ) ∈ Gr ϕ. w
(c) If λn −→ λ and xn −→ x in H, then ϕ(x) ≤ lim inf ϕλn (xn ) and if in addition n→∞ ϕλn (xn ) n≥1 ⊆ H, is bounded, then ϕλn (xn ) −→ ϕ(x). Before passing to generalizations of maximal monotonicity, let us mention the situation with linear operators. For a proof we refer to Brezis [102, p. 47]. PROPOSITION 3.2.52 If H is a pivot Hilbert space and A : H −→ H is linear, maximal monotone, then A = ∂ϕ with 1 A1/2 x2H if x ∈ D(A1/2 ) ϕ(x) = 2 +∞ if otherwise if and only if A is self-adjoint. Next we introduce some generalizations of the notion of maximal monotonicity that are useful in applications. ∗
DEFINITION 3.2.53 Let X be a reflexive Banach space and A : X −→ 2X . (a) We say that A is pseudomonotone if the following conditions are satisfied. (a1 ) For every x ∈ X, A(x) is nonempty, w-compact, and convex. (a2 ) A is upper semicontinuous (usc for short) from each finite-dimensional sub∗ space Y into X ∗ with the weak topology denoted by Xw (i.e., for all U ⊆ X ∗ + nonempty, w-open A (U ) = {x ∈ Y : A(x) ⊆ U } is open in Y ). (a3 ) If xn −→ x in X and if x∗n ∈ A(xn ) satisfies lim sup x∗n , xn − xX ≤ 0, w
n→∞
then for all u ∈ X there exists x∗ (u) ∈ A(x) such that x∗ (u), x − uX ≤ lim inf x∗n , xn − uX . n→∞
w
(b) We say that A is generalized pseudomonotone if for every sequence xn −→ x in w X and every sequence x∗n −→ x∗ in X ∗ with x∗n ∈ A(xn ) for all n ≥ 1 such that lim sup x∗n , xn − xX ≤ 0, n→∞
∗
then x ∈ A(x) and
x∗n , xn X
−→ x∗ , xX .
180
3 Nonlinear Operators and Fixed Points
PROPOSITION 3.2.54 If X is a reflexive Banach space and A : X −→ 2X pseudomonotone, then A is generalized pseudomonotone.
∗
is
PROOF: Let {(xn , x∗n )}n≥1 ⊆ Gr A such that xn −→ x in X, x∗n −→ x∗ in X ∗ and lim sup x∗n , xn − xX ≤ 0. Because A is pseudomonotone, for every u ∈ X we can w
w
n→∞
find x∗ (u) ∈ A(x) such that x∗ (u), x − uX ≤ lim inf x∗n , xn − uX . n→∞
The sequence {x∗n , xn X }n≥1 ⊆ R is bounded and so passing to a subsequence if necessary, we may assume that x∗n , xn X −→ β ∈ R. Then lim sup x∗n , xn − xX = β − x∗ , xX ≤ 0.
(3.31)
n→∞
On the other hand, β − x∗ , uX ≥ lim inf x∗n , xn − uX ≥ x∗ (u), x − uX n→∞
⇒ x∗ , x − uX ≥ x∗ (u), x − uX
for all u ∈ X
(see (3.31)). (3.32)
We claim that x∗ ∈ A(x). If this is not true and since A(x) is w-compact, convex in X ∗ , by the strong separation theorem we can find v ∈ X \ {0} and c ∈ R such that (3.33) x∗ , vX < c ≤ inf y ∗ , vX : for all y ∗ ∈ A(x) . If in (3.32) we choose u = x − v, we reach a contradiction to (3.33). So indeed x∗ ∈ A(x). Next note that for some x∗ (x) ∈ X ∗ we have lim inf x∗n , xn − xX ≥ x∗ (x), x − xX = 0 n→∞
⇒ lim inf x∗n , xn X ≥ x∗ , xX . n→∞
(3.34)
On the other hand from the choice of the sequences {xn }n≥1⊆X and {x∗n }n≥1 ⊆ X , we have (3.35) lim sup x∗n , xn X ≤ x∗ , xX . ∗
n→∞
From (3.34) and (3.35) we conclude that x∗n , xn X −→ x∗ , xX and so A is generalized pseudomonotone. There is a converse to the previous proposition. ∗
PROPOSITION 3.2.55 If X is a reflexive Banach space and A : X −→ 2X is bounded, generalized pseudomonotone and for all x ∈ X A(x) is nonempty, closed, and convex in X ∗ , then A is pseudomonotone. w
PROOF: First we show Condition [a3 ] in Definition 3.2.53(a), namely that xn −→ x in X and lim sup x∗n , xn X ≤ 0, with x∗n ∈ A(xn ); for every u ∈ X we can find n→∞
x∗ (u) ∈ A(x) such that
3.2 Monotone and Accretive Operators x∗ (u), x − uX ≤ lim inf x∗n , xn − uX .
181 (3.36)
n→∞
Because A is bounded, {x∗n }n≥1 ⊆ X ∗ is bounded and so by passing to subsew quence if necessary, we may assume that x∗n −→ x∗ in X ∗ . Suppose that (3.36) is not true. So we can find u ∈ X such that lim inf x∗n , xn − uX < inf y ∗ , x − uX : y ∗ ∈ A(x) . n→∞
By passing to a subsequence if necessary, we may assume that lim x∗n , xn − uX < inf y ∗ , x − uX : y ∗ ∈ A(x) .
(3.37)
n→∞
Because A is generalized pseudomonotone, we have x∗ ∈ A(x) and x∗n , xn X −→ x∗ , xX . Using this in (3.37), we obtain x∗ , x − uX < inf y ∗ , x − uX : y ∗ ∈ A(x) , which contradicts the fact that x∗ ∈ A(x). Finally we show that A is usc from every finite-dimensional subspace Y of X ∗ into Xw = the space X ∗ with the weak topology. But from Proposition 6.1.10, we ∗ know that it suffices to show that Gr A is sequentially closed in Y × Xw . It follows at once from Definition 3.2.53(a). PROPOSITION 3.2.56 If X is a reflexive Banach space and A : X −→ 2X maximal monotone, then A is generalized pseudomonotone.
∗
is
PROOF: Consider a sequence {(xn , x∗n )}n≥1 ⊆ Gr A such that xn −→ x in X, w x∗n −→ x∗ in X ∗ , and lim sup x∗n , xn − xX ≤ 0. We need to show that x∗ ∈ A(x) w
n→∞
and x∗n , xn X −→ x∗ , xX (see Definition 3.2.53(b)). For every (y, y ∗ ) ∈ Gr A, we have x∗n , xn X = x∗n − y ∗ , xn − yX + y ∗ , xn X + x∗n , yX − y ∗ , yX , for all n ≥ 1 ⇒ x∗ , xX ≥ y ∗ , xX + x∗ , yX − y ∗ , yX , ⇒ x∗ − y ∗ , x − yX ≥ 0
for all (y, y ∗ ) ∈ Gr A.
From the maximality of A, we infer that (x∗ , x) ∈ Gr A. Also for every n ≥ 1, we have x∗n − x∗ , xn − yX ≥ 0 ⇒ lim inf x∗n , xn X ≥ x∗ , xX ≥ lim sup x∗n , xn X . n→∞
x∗n , xn X
Therefore domonotone.
n→∞
∗
−→ x , xX and so we conclude that A is generalized pseu
Recalling that a maximal monotone operator is locally bounded on the interior of D(A) (see Theorem 3.2.4), we can easily prove the following result. We leave the details to the reader.
182
3 Nonlinear Operators and Fixed Points ∗
PROPOSITION 3.2.57 If X is reflexive and A : X −→ 2X is maximal monotone with D(A) = X, then A is pseudomonotone. The class of pseudomonotone maps is closed under addition. For a proof we refer to Browder–Hess [120]. ∗
PROPOSITION 3.2.58 If X is reflexive and A1 , A2: X −→ 2X are pseudomonotone maps, then A1 + A2 is pseudomonotone too. As was the case with maximal monotone maps, pseudomonotone maps exhibit remarkable surjectivity properties. The method of proof is based on Galerkin approximations, therefore we need the following finite-dimensional result whose proof uses fixed point results for multifunctions (see Section 6.5). PROPOSITION 3.2.59 If X is a finite-dimensional Banach space and F : X −→ ∗ 2X is usc, coercive, and has nonempty, compact, and convex values, then F is surjective. Using this result, we can prove the following surjectivity theorem for pseudomonotone maps. ∗
THEOREM 3.2.60 If X is a reflexive Banach space and A : X −→ 2X is pseudomonotone and coercive, then A is surjective. PROOF: Let S be the family of all finite-dimensional subspaces of X partially ordered by inclusion. If Y ∈ S and iY ∈ L(Y, X) is the embedding operator, then ∗ i∗Y = pY ∗ ∈ L(X ∗ , Y ∗ ) is the projection on Y ∗ . Let AY = i∗Y AiY : Y −→ 2Y . Then AY is usc, coercive, and is nonempty, compact, and convex. Note that if u∗ ∈ X ∗ , by considering Au∗ (x) = A(x) − u∗ , we see that Au∗ has the same properties as A and so we see that it suffices to show that 0 ∈ A(X). From Proposition 3.2.59 we see that for every Y ∈ S we can find xY ∈ Y such that 0 ∈ AY (xY ), hence 0 = i∗Y x∗Y
for some x∗Y ∈ A(xY ).
Because A is coercive {xY }Y ∈S ⊆ X is bounded. For Y ∈ S let CY = {xY }. Then CY ⊆ B M for some M > 0 large. From Y ⊇Y Y ∈S
the reflexivity of X and the finite intersection property, we have # w CY = ∅. Y ∈S
Let x0 ∈
Y ∈S
CY
w
and u ∈ X. Let Y ∈ S such that {x0 , u} ⊆ Y . We can find w
{xYk = xk }k≥1 ⊆ CV such that xk −→ x0 in X. Then x∗k , xk − x0 X = 0
with x∗k ∈ A(xk )
for all k ≥ 1.
Because A is pseudomonotone, for every u ∈ X, we can find u∗ (u) ∈ A(x0 ) such that
3.2 Monotone and Accretive Operators u∗ (u), x0 − uX ≤ lim x∗k , xk − uX = 0.
183 (3.38)
k→∞
If 0 ∈ / A(x0 ), then by the strong separation theorem, we can find u ∈ X such that 0 < inf x∗ , x0 − uX : x∗ ∈ A(x0 ) . (3.39) Comparing (3.38) and (3.39), we reach a contradiction. So A is indeed surjective. We conclude our discussion of maps of monotone type, with one more surjectivity result. First we have a definition. DEFINITION 3.2.61 Let X be a reflexive Banach space. ∗
(a) A map A : X −→ 2X is said to be quasibounded if for each M > 0, we can find K(M ) > 0 such for all (x, x∗ ) ∈ Gr A with x∗ , xX ≤ M xX and xX ≤ M , we have x∗ X ∗ ≤ K(M ). (b) A map C : X −→ X ∗ is said to be smooth if D(C) = X and it is bounded, coercive, and maximal monotone. ∗
(c) A map A : X −→ 2X is said to be regular if it is generalized pseudomonotone, and for any smooth map C : X −→ X ∗ we have A + C is surjective. (d) A map A:X−→X ∗ is said to be of type (S)+ if for any sequence {xn }n≥1⊆D(A) w the conditions xn −→ x in X and lim sup A(xn ), xn − x ≤ 0, imply that xn −→ x in X.
n→∞
∗
REMARK 3.2.62 Clearly every bounded map A : X −→ 2X is quasibounded. ∗ Also a monotone map A : X −→ 2X with 0 ∈ D(A) is regular if and only if it is maximal. A demicontinuous (S)+ map, is pseudomonotone. We have the following surjectivity result, whose proof can be found in Pascali– Sburlan [490, p. 139]. ∗
THEOREM 3.2.63 If X is a reflexive Banach space, A : X −→ 2X is a maximal monotone map with 0 ∈ D(A), and C : X −→ X ∗ is a regular coercive map and either A or C is quasibounded, then A + C is surjective. Thus far we have considered mappings from a Banach space into its dual. Next we deal with mappings from a Banach space into itself. Such operators are closely related to the generation theory of semigroups (linear and nonlinear), that play a central role in the theory of evolution equations. ∗ In what follows X is a Banach space and F : X −→ 2X is the normalized duality map. Additional hypotheses on X are introduced as needed. DEFINITION 3.2.64 Let A : X −→ 2X . Then (a) We say that A is accretive if for any (x, u), (y, u) ∈ Gr A, we can find x∗ ∈ F (x − y) such that x∗ , u − vX ≥ 0.
184
3 Nonlinear Operators and Fixed Points
(b) We say that A is maximal accretive if its graph is maximal with respect to inclusion among the graphs of all accretive mappings. (c) We say that A is m-accretive if R(I + A) = X. (d) We say that A is dissipative (m-dissipative) if −A is accretive (m-accretive). REMARK 3.2.65 If X= H = pivot Hilbert space (i.e., H = H ∗ ), then F = I and so A is accretive if and only if A is monotone. Moreover, in this case the notions of maximal accretivity and m-accretivity coincide and they correspond to maximal monotonicity (see Theorem 3.2.30). Note that maximal accretivity is equivalent to saying that if (x, u) ∈ X × X is such that for all (y, v) ∈ Gr A, we can find x∗ ∈ F (x − y) with x∗ , u − vX ≥ 0, then (x, u) ∈ Gr A. PROPOSITION 3.2.66 A mapping A : X −→ 2X is accretive if and only if x − y + λ(u − v)X ≥ x − yX for all λ > 0 and all (x, u), (y, v) ∈ Gr A. PROOF: ⇒: By Definition 3.2.64(a), we can find x∗ ∈ F (x − y) such that x∗ , u − vX ≥ 0. For λ > 0 we have x − y2X = x∗ , x − yX ≤ x∗ , x − y + λ x∗ , u − vX ≤ x∗ X ∗ x − y + λ(u − v)X , ⇒ x − yX ≤ x − y + λ(u − v)X (because x∗ X ∗ = x − yX ).
⇐: Let x∗λ ∈ F x − y + λ(u − v) and set yλ∗ = x∗λ x∗λ X ∗ . We have x − yX ≤ x − y + λ(u − v)X =
1 x∗λ , x − y + λ(u − v)X x∗λ X ∗
= yλ∗ , x − y + λ(u − v)X ≤ x − yX + λ yλ∗ , u − vX .
(3.40)
By Alaoglou’s theorem the net {yλ∗ }λ>0 has a limit point y ∗ and because of (3.40), we see that y ∗ X ∗ ≤ 1, y ∗ , u − vX ≥ 0 ⇒ y ∗ X ∗ = 1 and x∗ = xX
and y ∗ , x − yX ≥ x − yX ,
y ∗ ∈ F x − y), x∗ , u − vX ≥ 0,
⇒ A is accretive.
As we did for monotone operators in Definition 3.2.42, we introduce the following single-valued approximations of the identity and of the operator itself. DEFINITION 3.2.67 If A : X −→ 2X is an accretive map and λ > 0, then we set Jλ (x) = (I + λA)−1 (x), Aλ (x) = and
D(Aλ ) = Dλ = R(I + λA) |A(x)| = inf uX : u ∈ A(x) .
1 (I − Jλ )(x) λ
3.2 Monotone and Accretive Operators
185
Using Proposition 3.2.66 we check easily that the following is true. PROPOSITION 3.2.68 A : X −→ 2X is an accretive map if and only if for every λ > 0 Jλ is single-valued and Jλ (x) − Jλ (y) ≤ x − yX for all x, y ∈ Dλ . PROPOSITION 3.2.69 If A : X −→ 2X is m-accretive, then A is maximal accretive and R(I + λA) = X for every λ > 0. PROOF: Let K : X −→ 2X be an accretive operator such that Gr A ⊆ Gr K and let (x, u) ∈ Gr K. Because of the hypothesis A is m-accretive, thus we can find (y, v) ∈ Gr A such that x + u = y + v. Because K is accretive, from Proposition 3.2.66 we obtain x = y and so u = v. Therefore Gr A = Gr K and this proves that A is maximal accretive. Next let λ > 0 and u ∈ X. Then u ∈ R(I + λA) if and only if we can find x ∈ D(A) such that x = (I + A)−1
1
u−
1−λ x . λ
λ (1/λ)u− (1−λ) λ x . Then D(K) and using Proposition
Let K(x) = (I+A)−1 3.2.66 we see that 1 − λ (3.41) K(x) − K(y)X ≤ x − yX . λ If λ > 12 , then (1 − λ)/λ < 1 and so because of (3.41) we can apply Banach’s
fixed point theorem (see Theorem 3.4.3) and obtain x ∈ X such that K(x) = x. Now let β > 12 and set Aβ = βA. Then from the previous argument we have that R(I + θAβ ) = X for all θ > 12 , hence R(I + θβA) = X for all θβ > 14 . Continuing this way, we have that R(I + λA) = X for all λ > 1/2n , n ≥ 1. REMARK 3.2.70 When X =H = a pivot Hilbert space, we recover a special case of Theorem 3.2.30 (with F =I). PROPOSITION 3.2.71 If A : X −→ 2X is an accretive map, then (a) For every λ > 0 Aλ is accretive, Lipschitz continuous on
Dλ with constant 2/λ, Aλ (x)X ≤ |A(x)| for all x ∈ Dλ ∩ D(A) and Aλ ∈ A Jλ (x) for all x ∈ Dλ . (b)
lim Jλ (x) = x for all x ∈ D(A) ∩ ( ∩ Dλ ).
λ→0+
λ>0
PROOF: (a) Let x, y ∈ Dλ and x∗ ∈ F (x − y). We have 1 ∗ 1 x , x − yX − x∗ , Jλ (x) − Jλ (y)X λ λ 1 1 ≥ x − y2X − x − yX Jλ (x) − Jλ (y)X λ λ
1 ≥ x − yX x − yX − Jλ (x) − Jλ (y)X ≥ 0 λ
x∗ , Aλ (x) − Aλ (y)X =
(see Proposition 3.2.69), ⇒ Aλ is an accretive map defined on Dλ . Also from Proposition 3.2.68, we have
186
3 Nonlinear Operators and Fixed Points
1 x − y − Jλ (x) − Jλ (y) X λ 2 ≤ x − yX for all x, y ∈ Dλ . λ
Aλ (x) − Aλ (y)X =
If x ∈ Dλ ∩ D(A), then from Definition 3.2.67 we see that Jλ (x + λu) = x for every u ∈ A(x), 1 1 ⇒ Aλ (x)X = x − Jλ (x)X = Jλ (x + λu) − Jλ (x)X ≤ u λ λ (see Proposition 3.2.68), ⇒ Aλ (x)X ≤ |A(x)|
for all λ > 0 and all x ∈ Dλ ∩ D(A).
Finally let x ∈ Dλ and put y = Jλ (x). Then x = y + λv with v ∈ A(y) (see Definition 3.2.67). So
Aλ (x) = (1/λ) x − Jλ (x) = (1/λ)(x − y) = v ∈ A(y). Therefore Aλ (x) ∈ A Jλ (x) for all λ > 0 and all x ∈ Dλ . (b) If x ∈ D(A) ∩ ( ∩ Dλ ), then from Part (a) we have λ>0
x − Jλ (x)X = λAλ (x) ≤ |Aλ (x)| −→ 0
as λ ↓ 0.
PROPOSITION 3.2.72 If A : X −→ 2X is a maximal accretive map, then (a) Gr A ⊆ X ×X is closed and if X ∗ is uniformly convex, then Gr A is sequentially closed in X × Xw . (b) If X ∗ is strictly convex, then A(x) is closed and convex for all x ∈ D(A). PROOF: (a) Let (xn , un n≥1 ⊆ Gr A and suppose that xn −→ x and un −→ u in X as n → ∞. Then from Proposition 3.2.66, we have xn − xX ≤ xn − x + λ(un − u)X
for all n ≥ 1,
all λ > 0, and all (x, u) ∈ Gr A. Passing to the limit as n → ∞, we obtain x − xX ≤ x − x + λ(u − u)X
for all λ > 0 and all (x, u) ∈ GrA.
So Gr A∪{(x, u)} is the graph of an accretive map. But by hypothesis A is maximal accretive. Hence (x, u) ∈ Gr A. Because X ∗ is uniformly convex, F is uniformly continuous on bounded sets w of X (see Remark 3.2.20) and so if xn −→ x, un −→ u in X, the inequalities F (xn − x), un − uX ≥ 0 for all (x, u) ∈ Gr A, imply F(x − x), u − uX ≥ 0 for all (x, u) ∈ Gr A. Because of the maximality of A, we conclude that (x, u) ∈ Gr A. (b) From Proposition 3.2.16 we know that F is single-valued. The maximality of A implies that # u ∈ X : F (x − y), u − vX ≥ 0 , A(x) = (y,v)∈GrA
⇒ A(x) is closed and convex for every x ∈ D(A).
3.2 Monotone and Accretive Operators
187
DEFINITION 3.2.73 Let A : X −→ 2X . The minimal section of A is the map A0 : X −→ 2X defined by A0 (x) = u ∈ A(x) : uX = |A(x)| . PROPOSITION 3.2.74 If X is reflexive, strictly convex, X ∗ is strictly convex too and A : X −→ 2X is maximal accretive, then D(A0 ) = D(A) and A0 is singlevalued. PROOF: Let {un }n≥1 ⊆ A(x) be such that un X ↓ |A(x)|. Due to the reflexivity w of X we may assume (at least for a subsequence), that un −→ u in X. But from Proposition 3.2.72(b) we know that A(x) is closed, and convex. So u ∈ A(x). We have uX ≤ lim inf un X = |A(x)|, hence uX = |A(x)|, which proves that n→∞
D(A0 ) = D(A). Moreover, the strict convexity of X implies that A0 is single-valued. The significance of the minimal map is explained by the next theorem, whose proof can be found in Barbu [58, p. 79]. THEOREM 3.2.75 If X ∗ is uniformly convex and A, K : X −→ 2X are two maccretive maps such that A0 (x) ∩ K 0 (x) = ∅ 0
for all x ∈ D(A) = D(K),
0
then A = K. So if A = K , then A = K. Evidently the sum of two dissipative sets is a dissipative set on the intersection of the domains. But if the two operators are m-dissipative, it need not be mdissipative. The next theorem provides such a criterion which is easy to check in applications. For a proof of it we refer to Barbu [58, p. 82]. X THEOREM 3.2.76 If X ∗ is uniformly convex and A, K : X −→ 2 are two maccretive maps such that (i) D(A) ∩ D(K) = ∅ and (ii) F Kλ (x) , y ≥ 0 for all (x, y) ∈ Gr A and all λ > 0, then A + K is m-accretive.
The importance of accretive operators comes from their role in the generation theory of nonlinear semigroups. First let us briefly recall the very basic facts about linear semigroups. So suppose T = R+ , A is an N × N -matrix, f ∈ L1 (T, RN ), and x0 ∈ RN and we consider the following system, x (t) = Ax(t) + f (t), x(0) = x0 ,
t ∈ T.
From the variation of constants formula, we know that
b S(t − s)f (s)ds for all t ∈ T, x(t) = S(t)x0 +
(3.42)
0
where S(t) = eAt , t ∈ T , is the fundamental solution of the equation x (t) = Ax(t), x(0) = x0 . The theory of linear semigroups extends the concept of fundamental solutions to arbitrary Banach spaces X and gives precise meaning to (3.42).
188
3 Nonlinear Operators and Fixed Points
Let X be a Banach space and A ∈ L(X). Given x0 ∈ X, the function x(t) = eAt x0 is the unique solution of x (t) = Ax(t), t ∈ T, x(0) = x0 , where eAt = (At)k . Let us briefly check the properties of x0 −→ x(t). This is a linear map on k!
k≥0
X and x(t) ≤ etAL x0 . Hence this linear map is bounded. Moreover, as t ↓ 0 we have x(t) −→ x0 and also x(0) = x0 . Finally by the uniqueness of the solution to the problem, if the initial state is x(t0 ) and the system evolves for time t > 0, then we reach the state x(t + t0 ) (recall also that e(t+t0 )A = etA et0 A ). We formalize these properties in the following definition. DEFINITION 3.2.77 Let X be a Banach space and {S(t)}t≥0 ⊆ L(X). We say that {S(t)}t≥0 is a C0 -semigroup, if the following are true. (a) S(0) = I, the identity operator on X. (b) S(t + s) = S(t)S(s) for all t, s ≥ 0. (c) For every x ∈ X, S(t)x −→ x as t ↓ 0. REMARK 3.2.78 Property (b) is called the semigroup property. Property (c) implies continuity with respect to t in the strong operator topology. If A ∈ L(X), then we already saw that S(t) = eAt defines a C0 -semigroup. PROPOSITION 3.2.79 If {S(t)}t≥0 is a C0 -semigroup on X, then there exist M ≥ 1 and ω ≥ 0 such that S(t)L ≤ M eωt for all t ≥ 0. PROOF: We claim that we can find M ≥ 1 and δ > 0 suchthat for t ∈ [0, δ], S(t)L ≤ M . If not, then we can find tn → 0 such that S(tn )L n≥1 is unbounded. But from Definition 3.2.77(c), we have that S(tn )x −→ x in X for every x ∈ X. Hence S(tn )x n≥1 is bounded in X and so by the Banach–Steinhaus theorem, S(tn )L n≥1 is bounded, a contradiction. Let ω = (ln M )/δ ≥ 0. Given t ≥ 0 we can find an integer n ≥ 0 and 0 ≤ θ ≤ δ such that t = nδ + θ. Then S(t) = S(δ)n S(θ) and so S(t)L ≤ S(δ)n L S(θ)L ≤ M n M ≤ M eωt because ln M n = n ln M ≤ nωδ ≤ ωt. COROLLARY 3.2.80 For every x ∈ X, the map t −→ S(t)x is continuous from T = R+ into X. DEFINITION 3.2.81 If in Proposition 3.2.79, M = 1 and ω = 0, then S(t)L ≤ 1 for all t ≥ 0 and {S(t)}t≥0 is called a contraction semigroup. In the next definition we introduce an important concept in the theory of semigroups. DEFINITION 3.2.82 Let {S(t)}t≥0 be a C0 -semigroup on X. The infinitesimal generator of the semigroup is a linear operator A defined by Ax = lim t↓0
S(t)x − x t
S(t)x − x for all x ∈ D(A) = x ∈ X : lim exists . t↓0 t
3.2 Monotone and Accretive Operators
189
Next we derive some basic properties of the infinitesimal generator and for this reason we need the following simple lemma. LEMMA 3.2.83 If {S(t)}t≥0 is a C0 -semigroup, then lim 1/h h↓0
t+h t
S(τ )xdτ =
S(t)x for all t ≥ 0 and all x ∈ X. PROOF: We have
1 t+h
1 t+h S(τ )xdτ − S(t)x = S(τ ) − S(t) xdτ h t h t
1 t+h S(τ )x − S(t)xdτ. ≤ h t
(3.43)
Given ε > 0, we can find h > 0 small such that S(τ )x−S(t)x < ε for all |τ −t| < h (see Corollary 3.2.80). So from (3.43) we obtain
1 t+h S(τ )xdτ − S(t)x < ε h t
which proves the lemma.
PROPOSITION 3.2.84 If {S(t)}t≥0 is a C0 -semigroup with infinitesimal generator A and x0 ∈ D(A), then (a) S(t)x0 ∈ D(A) for each t ≥ 0. (b) (d/dt)S(t)x0 = AS(t)x0 = S(t)Ax0 for each t > 0.
(c) t −→ S(t)x0 belongs in C 1 (0, ∞), X ∩ C R+ , D(A) . PROOF: (a) We have lim
h→0
1
1
S(h)S(t)x0 − S(t)x0 = lim S(t)S(h)x0 − S(h)x0 h→0 h h 1
= S(t) S(h)x0 − x0 = S(t)Ax0 . h
Therefore, S(t)x0 ∈ D(A) (see Definition 3.2.82) and AS(t)x0 = S(t)Ax0 . (b) For h > 0, t ≥ 0, we have 1
1
1
S(t + h)x0 − S(t)x0 = S(t) S(h)x0 − x0 = S(h) − I S(t)x0 . h h h
By virtue of Definition 3.2.82 we know that lim (1/h) S(h)x0 − x0 exists and h→0
so the other two limits exist too. So it follows that S(t)x0 ∈ D(A). Also for t > 0 and h > 0 small, we have 1
1
S(t − h)x0 − S(t)x0 = −S(t − h) S(h)x0 − x0 . h h Hence we deduce that the strong derivative of t −→ S(t)x0 exists at each t > 0 and
190
3 Nonlinear Operators and Fixed Points d S(t)x0 = AS(t)x0 = S(t)Ax0 . dt
(c) From (b) and Corollary 3.2.80 we infer that t −→ S(t)x0 belongs in C 1 (0, ∞), X ∩ C R+ , D(A) . REMARK 3.2.85 From the above proposition it follows that t −→ x(t) = S(t)x0 is the unique solution of the initial value problem x (t) = Ax(t) t ≥ 0, x(0) = x0 , provided that the initial datum is in D(A). If x0 ∈ / D(A), then t −→ S(t)x0 is not differentiable with respect to t. We can, however, consider t −→ x(t) = S(t)x0 as a generalized solution of the initial value problem. PROPOSITION 3.2.86 If {S(t)}t≥0 is a C0 -semigroup with infinitesimal generator A, then A is closed and densely defined. PROOF: Let x ∈ X. Then for h > 0 we have
t 1 t
1
S(τ )xdτ = S(τ + h)x − S(τ )x dτ S(h) − I h h 0 0
h
1 t+h = S(τ )xdτ − S(τ )xdτ −→ S(t)x − x h t 0 t (see Lemma 3.2.83). Therefore 0 S(τ )xdτ ∈ D(A). Once again Lemma 3.2.83 implies that
1 h S(τ )xdτ −→ S(0)x = x, h 0 ⇒ D(A) is dense in X. If xn ∈ D(A) and xn −→ x in X, A(xn ) −→ u in X, we need to show that x ∈ D(A) and Ax = u,
1
1
1 h S(τ )Axn dτ. S(h)x − x = lim S(h)xn − xn = lim n→∞ h n→∞ h 0 h Because Axn −→ u, we have 1 1
S(h)x − x = h h
h
S(τ )udτ −→ u
as h ↓ 0
0
(see Lemma 3.2.83). Therefore x ∈ D(A) and Ax = u.
Now let us reverse the problem and ask ourselves what conditions must be placed on A in order that A is the generator of a C0 -semigroup. If A ∈ L(X), then S(t) = eAt =
(At)k . k!
k≥0
For the unbounded case, we know that if A is the infinitesimal generator of a strongly continuous semigroup, then we require that D(A) = X
and A is closed.
3.2 Monotone and Accretive Operators
191
The precise conditions are provided by the following classical result, known as the Hille–Yosida theorem. For a proof we refer to the book of Hille–Phillips [300, p. 360]. THEOREM 3.2.87 Necessary and sufficient conditions for a linear unbounded operator A on a Banach space X to be the infinitesimal generator of a C0 -semigroup satisfying that S(t)||L ≤ M eωt for some M ≥ 1, ω ≥ 0 are (a) A is closed and densely defined. (b) (λI − A)−1 exists for λ > ω, (c) (λI − A)−m L ≤
M , (λ−ω)m
λ > ω, m ≥ 1.
REMARK 3.2.88 The family of the operators R(λ) = (λI − A)−1 for λ > ω, is called the resolvent of A. A byproduct of the proof of the Hille–Yosida theorem, is the following exponential formula for the C0 -semigroup. THEOREM 3.2.89 If {S(t)}t≥0 is a contraction semigroup with infinitesimal ngenerator A, then for any x ∈ X, S(t)x= lim (I − (t/n)A)−n = lim (n/t)R(n/t) x. n→∞
n→∞
Let us give some characteristic examples of C0 -semigroups with their infinitesimal generators. EXAMPLE 3.2.90 (a) Let X = H = L2 (0, b) (a Hilbert space) and let us consider an operator A = d/dx with domain D(A) = {x ∈ W 1,2 (0, b) : x(b) = 0}. The operator A is the generator of the so-called left-shift semigroup {S(t)}t≥0 x(t + τ ) if t + τ ∈ (0, b) S(t)x(τ ) = . 0 if t + τ ∈ / (0, b) (b) Let H be a Hilbert space with a complete and orthonormal basis {en }n≥1 and let {λn }n≥1 be a sequence in R such that λn −→ −∞. We define λ t e n x, en H en , x ∈ H, t ≥ 0. (3.44) S(t)x = n≥1
It is easy to check that {S(t)}t≥0 is a C0 -semigroup. The infinitesimal generator of this semigroup is given by λn x, en en Ax = n≥1
2
with domain D(A) = x ∈ H : λn x, en < +∞ . n≥1
192
3 Nonlinear Operators and Fixed Points 2
(c) Let H = L2 [0, π] and Ax = ddt2x with domain D(A) = W01,2 (0, π) ∩ W 2,2 (0, π). Then A is the infinitesimal generator of a semigroup given by (3.44) with en (t) = 0 2 π
sin(nt), t ∈ [0, π], λn = −n2 , n ≥ 1.
(d) The infinitesimal generator A of the semigroup {S(t)}t≥0 on C(R) given by (λt)k S(t)x (τ ) = e−λt x(τ − kµ), k!
λ, µ > 0
k≥0
is the difference operator (Ax)(τ ) = λ[x(τ − µ) − x(τ )]. Now we pass to nonlinear semigroups. So let X be a Banach space and C ⊆ X be a nonempty subset of X. DEFINITION 3.2.91 A family of maps S(t) : C −→ C, t ≥ 0, is called a semigroup of nonexpansive maps on C if (a) S(t + τ ) = S(t)S(τ ) for all t, τ ≥ 0. (b) S(0) = IC . (c) lim S(t)x = x for each x ∈ C. t↓0
(d) S(t)x − S(t)u ≤ x − u for all t ≥ 0 and all x, u ∈ C. REMARK 3.2.92 Given a semigroup of nonexpansive maps on C, the function (t, x) −→ S(t)x is jointly continuous from R+ × C into C. The main generation theorem for nonlinear semigroups, is the following theorem due to Crandall–Liggett [166], where the interested reader can find its proof (see also Barbu [58, p. 104]). THEOREM 3.2.93 If A : D(A) ⊆ X −→ 2X is an m-accretive operator, then for
−n every x ∈ D(A) S(t)x = lim I + (t/n)A x exists for each x ∈ D(A) and n→∞
uniformly in t in compact subsets of R+ . The family of maps S(t) : D(A) −→ D(A), t ≥ 0, is a semigroup of nonexpansive mapsand for each x ∈ D(A) and t > 0, we have S(t)x − x ≤ t|A(x)|, where |A(x)|=inf y : y ∈ A(x) . Let A : D(A) ⊆ X −→ 2X be an m-accretive operator. According to Theorem 3.2.93 it generates a semigroup of nonlinear contractions S(t) : D(A) −→ D(A), t ≥ 0. Recall that for each λ > 0, Jλ and Aλ are the resolvent and the Yosida approximation of A (i.e., Jλ = (I + λA)−1 and Aλ = (1/λ)(I − Jλ ); see Definition 3.2.67). The next proposition relates the semigroup S(t) with the resolvent Jλ . Its proof can be found in Vrabie [597, p. 46]. PROPOSITION 3.2.94 If x ∈ D(A), t > 0 and λ >0,
t then S(t)x − x ≤ 2 + (t/λ) Jλ (x) − x and Jλ (x) − x ≤ (2/t) 1 + (λ/t) 0 S(τ )x − xdτ .
3.2 Monotone and Accretive Operators
193
REMARK 3.2.95 If X = H a Hilbert space and A = ∂ϕ with ϕ ∈ Γ0 (H), then the inequality can be proved in the following way: Jλ (x) − x ≤ √ second
1 + 1/ 2 S(t)x − x for each x ∈ D(∂ϕ) and t, λ > 0. Moreover, Jt (x) − x ≤ 3/2 S(t)x − x, with 3/2 being the best possible constant. DEFINITION 3.2.96 A nonlinear semigroup S(t) : C −→ C, t ≥ 0, of nonexpansive maps on C ⊆ X is called compact, if for every t > 0, S(t) is a compact operator. REMARK 3.2.97 Recall that S(0) = IC . So if S(t) is compact for all t ≥ 0, then C is compactly embedded in X. Moreover, if C = X, then X is finite dimensional. DEFINITION 3.2.98 A nonlinear semigroup of nonexpansive maps S(t) : C −→ C, t ≥ 0, is said to be equicontinuous, if for each bounded set K ⊆ X, the family {S(·)x : x ∈ K} is equicontinuous at every t > 0. PROPOSITION 3.2.99 If S(t) : C −→ C, t ≥ 0, is a semigroup of nonlinear nonexpansive maps which is compact, then it is equicontinuous. PROOF: Let K ⊆ X be bounded, t > 0, and choose λ ∈ (0, t). Due to the compactness of the semigroup, S(t − λ)K is totally bounded in X. So given ε > 0, we can find {xk }N k=1 such that S(t − λ)K ⊆
N !
Bε/3 S(t − λ)xk
(3.45)
k=1
where Bε/3 S(t−λ)xk = y ∈ X : y−S(t−λ)xk < ε/3 . Also from the continuity of S(·)xk we can find 0 < δ = δ(ε, t) < λ such that S(t + h)xk − S(t)xk <
ε 3
(3.46)
for all k ∈ {1, . . . , N } and all h ∈ R with |h| ≤ δ. Because of (3.45) for each x ∈ K there exists k ∈ {1, . . . , N } such that S(t − λ)x − S(t − λ)xk ≤
ε . 3
(3.47)
Using (3.46), (3.47), and Definition 3.2.91, we obtain S(t + h)x − S(t)x ≤ S(t + h)x − S(t + h)xk + S(t + h)xk − S(t)xk + S(t)xk − S(t)x = S(λ + h)S(t − λ)x − S(λ + h)S(t − λ)xk + S(t + h)xk − S(t)xk + S(λ)S(t − λ)xk − S(λ)S(t − λ)x ≤ 2 S(t − λ)x − S(t − λ)xk + S(t + h)xk − S(t)xk ≤ ε for all x ∈ K and all h ∈ R with |h| ≤ δ. This proves that {S(·)x : x ∈ K} is equicontinuous. Now we can characterize the compact nonlinear semigroups.
194
3 Nonlinear Operators and Fixed Points
THEOREM 3.2.100 If A : D(A) ⊆ X −→ 2X is an m-accretive operator and S(t) : D(A) −→ D(A), t ≥ 0, is the semigroup generated by A, then the following statements are equivalent. (a) The semigroup {S(t)}t≥0 generated by A is compact. (b) (b1 ) For every λ > 0 Jλ is compact. (b2 ) {S(t)}t≥0 is equicontinuous. PROOF: (a)⇒(b): From Proposition 3.2.99 we already know that {S(t)}t≥0 is equicontinuous. We have: S(t)Jλ (x) − Jλ (x) ≤ tAλ (x) =
t Jλ (x) − x. λ
(3.48)
Because Jλ is nonexpansive, from (3.48) it follows that lim S(t)Jλ = Jλ t↓0
uniformly on bounded sets in X. For every t > 0 S(t)Jλ is compact and so from Proposition 3.1.6 we infer that Jλ is compact. (b)⇒(a): From Proposition 3.2.94, we see that for each λ > 0, t > 0, and x ∈ D(A), we have
4 λ S(t + τ )x − S(t)xdτ. (3.49) Jλ S(t)x − S(t)x ≤ λ 0 Due to the equicontinuity of {S(t)}t≥0 from (3.49) it follows that lim Jλ S(t) = S(t) λ↓0
uniformly on bounded sets in D(A). But Jλ S(t) is compact. So Proposition 3.1.6 implies that {S(t)}t≥0 is compact. COROLLARY 3.2.101 If A : D(A) ⊆ X −→ 2X is a densely defined, linear, maccretive operator and {S(t)}t≥0 is the nonexpansive semigroup generated by A, then the following statements are equivalent. (a) The semigroup {S(t)}t≥0 is compact. (b) (b1 ) For each λ > 0 Jλ is compact. (b2 ) t −→ S(t) is continuous from R+ into L(X) with the uniform operator topology. REMARK 3.2.102 Recall the resolvent identity, which says that µ λ−µ Jλ (x) = Jµ x+ Jλ (x) λ λ for each x ∈ X and λ, µ > 0. So Jλ is compact for every λ > 0 if and only if it is compact for some λ > 0. So statement [b1 ] is equivalent to saying that (I + A)−1 is compact (i.e., (I + A)−1 ∈ K(X)).
3.2 Monotone and Accretive Operators
195
PROPOSITION 3.2.103 If A : D(A) ⊆ X −→ 2X is an m-accretive operator, then the following statements are equivalent. (a) For each λ > 0 Jλ is compact. (b) For each k > 0, the set Lk = {x ∈ D(A) : x + |A(x)| ≤ k} is relatively compact in X. PROOF: (a)⇒(b): Recall that Aλ (x) ≤ |A(x)| ≤ k for all x ∈ Lk and λ > 0. So x − Jλ (x) ≤ λk ⇒ Jλ −→ I
for each x ∈ Lk and λ > 0,
as λ ↓ 0 uniformly on Lk ,
⇒ ILk is compact by Proposition 3.1.6 (i.e., Lk is compact). (b)⇒(a): We have
Jλ (x) + |A Jλ (x) | ≤ Jλ (x) + Aλ (x) (because Aλ (x) ∈ A Jλ (x) ) 1 for all x ∈ X. ≤ Jλ (x) + x − Jλ (x) λ (3.50) If K ⊆ X is bounded, then Jλ (K) is bounded and so from (3.50) it follows that Jλ (K) ⊆ Lk for k > 0 large. Therefore Jλ (K) is relatively compact. Let X = H = a Hilbert space and ϕ ∈ Γ0 (H). In this case we can improve Proposition 3.2.103. First we have a definition. DEFINITION 3.2.104 A convex function ϕ : H −→ R = R ∪ {+∞} is said to be of compact type if for each k > 0, the level set Lk = {x ∈ H : x2 + ϕ(x) ≤ k} is relatively compact in H. REMARK 3.2.105 If ϕ ∈ Γ0 (H), then Lk is compact for every k > 0. Then we have the following improvement of Proposition 3.2.103. The proof of this result can be found in Vrabie [597, p. 58]. PROPOSITION 3.2.106 If H is a Hilbert space, ϕ ∈ Γ0 (H), and A = ∂ϕ, then the following statements are equivalent. (a) For each λ > 0 Jλ is compact. (b) ϕ is of compact type. (c) The semigroup generated by A on D(A) is compact.
196
3 Nonlinear Operators and Fixed Points
EXAMPLE 3.2.107 Let Z ⊆RN be a bounded domain with C 2 -boundary ∂Z, j∈ Γ0 (R), j ≥ 0, j(0) = 0, p ≥ 2, and λ > 0. We consider the function ϕλ : L2 (Z) −→ R+ = R+ ∪ {+∞} defined by ⎧
p p 1 λ ⎪ if x ∈ W 1,p (Z), ⎨ p Dxp + p xp + ∂Z j x(z) dσ
ϕλ (x) = j x(·) ∈ L1 (∂Z) ⎪ ⎩ +∞ otherwise.
2 Then ϕλ ∈ Γ0 L (Z) and it is of compact type. Note that ∂ϕλ (x) = −p x + λ|x|p−2 x
for all x ∈ D(∂ϕλ ) = x ∈ W 1,p (Z) : ∂x ∂n (z) ∈ ∂j x(z) a.e. on ∂Z .
3.3 Degree Theory Degree theory is a basic tool of nonlinear analysis and produces powerful existence and multiplicity results for nonlinear boundary value problems. It concerns operator equations of the form ϕ(x) = y0 , where ϕ is a map (often continuous) of U , the closure of an open set U of the domain space X into the range space Y and y0 ∈ Y satisfies y0 ∈ / ϕ(∂U ). Then the degree of S at y0 relative to U , written d(ϕ, U, y0 ), is an algebraic count of the number of solutions of the equation ϕ(x) = y0 . In particular the equation ϕ(x) = y0 will have solutions in U , whenever d(ϕ, U, y0 ) = 0. Here we deal with “classical” degree theories; that is, the value of the degree map is an integer. This integer can be both positive or negative and in the context of finitedimensional problems positive counts (positive degree) correspond to solutions at which ϕ is orientation preserving, whereas negative counts correspond to solutions at which ϕ is not orientation preserving. We start with a brief analytical presentation of Brouwer’s degree theory, which is the first such theory and was introduced by Brouwer in 1912. DEFINITION 3.3.1 Let U ⊆ RN be a nonempty, bounded open set and ϕ ∈ C 1 (U , RN ). We say that x ∈ U is a critical point of ϕ, if Jϕ (x) = det ∇ϕ(x) = 0
N . We set Cϕ = {x ∈ U : Jϕ (x) = 0} and ϕ(Cϕ ) where ∇ϕ(x) = ∂ϕi ∂xj (x) i,j=1
is called the crease of ϕ. If y ∈ / ϕ(Cϕ ), then y is a regular value of ϕ. Now we can give the first definition of degree. / [ϕ(Cϕ ) ∪ ϕ(∂U )], then the degree DEFINITION 3.3.2 If ϕ ∈ C 1 (U , RN ) and y ∈ of ϕ at y with respect to U is defined by d(ϕ, U, y) = sgn Jϕ (x). x∈ϕ−1 (y)
REMARK 3.3.3 Here sgn u = 1 if u > 0 and sgn u = −1 if u < 0. Note that because y is not a critical value, the set ϕ−1 (y) is discrete and so the summation in Definition 3.3.2 is finite. The determinant Jϕ (x) is positive or negative accordingly as ϕ is orientation preserving or orientation reversing at x.
3.3 Degree Theory
197
Next the goal is to remove from Definition 3.3.2 the restrictions that y is a regular value of ϕ and that ϕ ∈ C 1 (U , RN ). The first can be removed with the help of the so-called Sard’s theorem. THEOREM 3.3.4 (Sard) If ϕ ∈ C 1 (U , RN ), then ϕ(Cϕ ) is a set of measure zero. We use Theorem 3.3.4 and suitable mollification techniques to replace the sum in Definition 3.3.2 by an appropriate integral. First let us recall the notion of mollifier. DEFINITION 3.3.5 Consider the function ψ1 : RN −→ R defined by
c exp x12 −1 for x ≤ 1 ψ1 (x) = 0 otherwise with c > 0 chosen so that RN ψ1 (x)dx = 1. For ε > 0, we define ψε (x) =
1/εN ψ1 x/ε . We have ψε ∈ C ∞ (RN ), RN ψε (x)dx = 1, and supp ψε = B ε (0) = {x ∈ RN : x ≤ ε}. The family of functions {ψε }e>0 is called mollifiers. REMARK 3.3.6 If U ⊆ RN is open and f ∈ L1loc (U ), then we define fε = ψε ∗f = ψ (x − y)f (y)dy for all x ∈ Uε = {x ∈ U : d(x, ∂U ) > ε}. Evidently fε ∈ C ∞ (Uε ) U ε and if f ∈ C(U ), we have fε −→ f uniformly on compact subsets of U . Also if f ∈ Lploc (U ) for some 1 ≤ p < ∞, then fε −→ f in Lploc (U ). PROPOSITION 3.3.7 If (U, ϕ, y) are as in Definition 3.3.2 and {ψε }ε>0 is a family of mollifiers, then there exists ε0 = ε0 (y, ϕ) > 0 such that
d(ϕ, U, y) = ψε ϕ(x) − y Jϕ (x)dx for all ε ∈ (0, ε0 ). U
PROOF: If ϕ (y) = ∅, then the result is immediate because ψε ϕ(x) − y = 0 for
all ε < d∗ y, ϕ(U ) . So suppose ϕ−1 (y) = {xk }m k=1 . Then by the inverse function theorem we can find disjoint balls Br (xk ) such that ϕB (x ) is a homeomorphism onto a neighborhood r k m Vk and Vk of y and sgn Jϕ (x) = sgn Jϕ (xk ) for all x ∈ Br (xk ). Let B (y) ⊆ k=1
Ωk = Br (xk ) ∩ ϕ−1 B (y) . Then −1
ϕ(x) − y ≥ ξ on U \
m !
Uk
for some ξ > 0.
k=1
Therefore ε < ξ implies that
m
ψε ϕ(x) − y Jϕ (x)dx = sgn Jϕ (xk ) U
k=1
ψε ϕ(x) − y |Jϕ (x)|dx.
Uk
Because Jϕ (x) = Jϕ−y (x) and ϕ(Uk ) − y = Br (0), by change of variables, we obtain
ψε ϕ(x) − y |Jϕ−y (x)|dx = ψε (x)dx = 1 for ε ∈ (0, min{ξ, }). Uk
Br (0)
198
3 Nonlinear Operators and Fixed Points
We use this proposition to pass from regular to critical values in the definition of the degree. For this purpose we need the following two lemmata. LEMMA 3.3.8 If ψ ∈ Cc1 (RN ), K = supp ψ, U ⊆ RN a bounded open set and γ : [0, 1] −→ RN a continuous path such that A = {k + γ(t) : k ∈ K, t ∈ [0, 1]} ⊆ U , then we can find u ∈ Cc1 (U ) such that
(div u)(x) = f x − γ(0) − f x − γ(1) . 1 PROOF: First suppose that γ(t) = t¯ x and set Ψ(x) = 0 ψ(x−ϑ¯ x)dϑ, u(x) = x ¯Ψ(x). 1 x) = 0 for Clearly Ψ ∈ C (U ). Also if x ∈ U is such that Ψ(x) = 0, then ψ(x − ϑ¯ some ϑ ∈ [0, 1] and so x ∈ K + ϑ¯ x ⊆ A ⊆ U . Therefore supp Ψ ⊆ A and we have u ∈ Cc1 (U , RN ). Note that div u(x) =
N 0
k=1
=
N 1
N 1 0
k=1
=− 0
1
j=1
∂xj ∂ψ (x − ϑ¯ x) dϑ x ¯k ∂xj ∂xk
∂ψ (x − ϑ¯ x)dϑ x ¯k ∂xk
d ψ(x − ϑ¯ x)dϑ = ψ(x) − ψ(x − x ¯). dϑ
Now we consider a general path
γ. For some s, t ∈ [0, 1] introduce the equivalence relation s ∼ t if and only if ψ x − γ(s) − ψ x − γ(t) = div u(x) for some u ∈ Cc1 (U , RN ). We show that each equivalence class is an open set and this by the compactness of [0, 1] implies that there is only one equivalence class, which is what we want. Set yt = γ(t)
− γ(s), t ∈ [0, 1] and let E be an equivalence class for s. We introduce ψs (x) = ψ x − γ(s) , Ks = supp(ψs ) and β = d(Ks , ∂U ) > 0. We can find ε > 0 such that |t − s| < ε implies that yt < β/2. Therefore Ks = {k + ϑyt : k ∈ Ks , ϑ ∈ [0, 1]} ⊆ U. Then from the first part of the proof, we can find u ∈ Cc1 (U , RN ) such that if |t − s| < ε
div u(x) = ψs (x) − ψs (x − yt ) = ψ x − γ(s) − ψ x − γ(t) . This means that t ∼ s; that is, t ∈ E and so E is open, hence E = [0, 1].
LEMMA 3.3.9 If U ⊆ RN is a bounded open set, ϕ ∈ C 2 (U , RN ), and u ∈ Cc1 (RN , RN ) is such that supp u ∩ ϕ(∂U ) = ∅,
1 N then we can find w ∈ Cc (R , RN ) such that div w(x) = Jϕ (x)div u ϕ(x) . N
PROOF: Let Aij (x) i,j=1 be the matrix of cofactors of ∇ϕ(x). We set wi (x) =
N j=1
uj ϕ(x) Aji (x).
3.3 Degree Theory
199
It is easy to see that w ∈ Cc1 (U , RN ). Recalling from the theory of differential N ∂Aji (x) = 0, we obtain that forms that ∂xi i=1
N N
∂ϕk ∂Aji ∂uj
∂wi (x) = (x)uj ϕ(x) + Aji (x) (x) ϕ(x) ∂xi ∂xi ∂xk ∂xi j=1 k=1
N
∂uj
= ϕ(x) δjk Jϕ (x) = Jϕ (x)div u ϕ(x) . ∂xk
j,k=1
The last auxiliary result before extending Definition 3.3.2 to critical values too, says that the definition of degree as it stands at this point (see Definition 3.3.2) is stable with respect to small changes in the function ϕ. For a proof of it we refer to Lloyd [396, p. 4]. LEMMA 3.3.10 If U⊆RN is a bounded open set, ϕ∈C 1 (U , RN ), and y ∈ / ϕ(Cϕ )∪ ϕ(∂U ) , then there exists δ > 0 such that if ϕ1 ∈ C 1 (U , RN ) and ϕ − ϕ1 C 1 ≤ δ, we have y∈ / ϕ1 (Cϕ1 ) ∪ ϕ1 (∂U ) and d(ϕ, U, y) = d(ϕ1 , U, y). The next proposition allows us to admit critical values in Definition 3.3.2. PROPOSITION 3.3.11 If U ⊆ RN is a bounded open set, ϕ ∈ C 1 (U , RN ), Z is a connected component of RN \ ϕ(∂U ), and y1 , y2 ∈ Z \ ϕ(Cϕ ), then d(ϕ, U, y1 ) = d(ϕ, U, y2 ). PROOF: First we suppose that ϕ ∈ C 2 (U , RN ). Recall that an open set in RN is connected if and only if it is path-connected. So we can find a continuous path γ : [0, 1] −→ Z such that γ(0) = y1 , γ(1) = y2 . Let {ψε }ε>0 be a family of mollifiers. By virtue of Proposition 3.3.7, we can find ε0 > 0 such that 0 < ε ≤ ε0 implies that
ψε ϕ(x) − yk Jϕ (x)dx for k = 1, 2. d(ϕ, U, yk ) = U
Let 0 < ε1 < ε0 be such that the ε1 -neighborhood of the path γ is in Z. Set A = {k + γ(t) : k ∈ supp ψε1 , By Lemma 3.3.8, we can find u ∈
Cc1 (Z, RN )
t ∈ [0, 1]} ⊆ Z. such that
div u(x) = ϕε1 (x − y1 ) − ϕε1 (x − y2 ) and supp u ∩ ϕ(∂U ) ⊆ Z ∩ ϕ(∂U ) = ∅. So by Lemma 3.3.9 there exists w ∈ C 1 (U , RN ) such that
div w(x) = div u ϕ(x) Jϕ (x) = ψε1 ϕ(x) − y1 − ψε1 ϕ(x) − y2 Jϕ (x). Using Green’s formula, we conclude that
d(ϕ, U, y1 ) − d(ϕ, U, y2 ) = ψε1 ϕ(x) − y1 − ψε1 ϕ(x) − y2 Jϕ (x)dx
U
= div u ϕ(x) Jϕ (x)dx = div w(x)dx = 0. U
U
200
3 Nonlinear Operators and Fixed Points
Now we remove the restriction that ϕ ∈ C 2 (U , RN ). So if ϕ ∈ C 1 (U , RN ) we can find a sequence {ϕn }n≥1 ⊆ C 2 (U , RN ) such that ϕn − ϕC 1 −→ 0 as n → ∞.
With the path γ being as above, let δ = d1 γ, ϕ(∂U ) > 0. If ϕ − ϕn C 1 < (δ/2), then for x ∈ ∂U and t ∈ [0, 1], we have δ γ(t) − ϕn (x) ≥ γ(t) − ϕ(x) − ϕ(x) − ϕn (x) > . 2 Therefore y1 , y2 are also in the same component of RN \ϕn (∂U ). Then using Lemma 3.3.10 and the first part of the proof, we obtain d(ϕ, U, y1 ) = d(ϕn , U, y1 ) = d(ϕn , U, y2 ) = d(ϕ, U, y2 ). This proposition leads to the following generalization of Definition 3.3.2. DEFINITION 3.3.12 If U ⊆ RN is a bounded open set, ϕ ∈ C 1 (U , RN ), and y∈ / ϕ(∂U ), then we define d(ϕ, U, y) to be d(ϕ, U, y) for any y ∈ / ϕ(Cϕ ) ∪ ϕ(∂U )
such that y − y < d y, ϕ(∂U ) . REMARK 3.3.13 By Sard’s theorem (see Theorem 3.3.4) every ball Br (y) contains vectors y that are not critical values of ϕ. The component of y in RN \ ϕ(∂U ) contains the ball Bd1 (y,ϕ(∂U )) (y). So by Proposition 3.3.11, d(ϕ,
U, y) has the same value for all y that is not a critical value of ϕ and y − y < d y, ϕ(∂U ) . DEFINITION 3.3.14 Let U ⊆ RN be a bounded open set and ϕ0 , ϕ1 ∈ C 1 (U , RN ). A map h : [0, 1] × U −→ RN is a C 1 -homotopy between ϕ0 and ϕ1 , if (a) h(0, ·) = ϕ0 (·) and h(1, ·) = ϕ1 (·). (b) h(t, ·) ∈ C 1 (U , RN ) for every t ∈ [0, 1]. (c) lim h(t, ·) − h(s, ·)C 1 = 0 for every s ∈ [0, 1]. t→s
Using this notion and Sard’s theorem, we can easily establish some basic properties of the degree d(ϕ, U, y) for C 1 -functions. Namely we have the following. THEOREM 3.3.15 If U⊆ RN is bounded open and ϕ ∈ C 1 (U , RN ), then (a) d(ϕ, U, ·) is constant on each connected component of RN \ϕ(∂U ). / ϕ(∂U ) (b) If y ∈ / ϕ(∂U ), then we can find ε > 0 such that if ϕ − ϕC 1 ≤ ε; then y ∈ and d(ϕ, U, y) = d(ϕ, U, y). / h(t, ∂U ) for all (c) If h(t, x) is a C 1 -homotopy between ϕ0 , ϕ1 ∈C 1 (U , RN ) and y ∈ t ∈ [0, 1], then d(ϕ0 , U, y) = d(ϕ1 , U, y). (d) If y ∈ / ϕ(∂U ), then d(ϕ + z0 , U, y + z0 ) = d(ϕ, U, y) for all z0 ∈ RN .
3.3 Degree Theory
201
Property (c) (the homotopy invariance property) with a further approximation enables d(ϕ, U, y) to be defined when ϕ is only continuous and
not continuously differentiable. So let ϕ ∈ C(U , RN ) and y ∈ / ϕ(∂U ). Set β = d y, ϕ(∂U ) > 0. We can find ϕ0 , ϕ1 ∈ C 1 (U , RN ) such that ϕ − ϕk C 1 < β, k = 0, 1. We consider the C 1 -homotopy h(t, x) = tϕ0 (x) + (1 − t)ϕ1 (x)
for all t ∈ [0, 1] and all x ∈ U .
We have
h(t, x) − ϕ(x) = t ϕ0 (x) − ϕ(x) + (1 − t) ϕ1 (x) − ϕ(x) < β. So if x ∈ ∂U , then y − h(t, x) ≥ y − ϕ(x) − ϕ(x) − h(t, x) > 0 ⇒ y∈ / h(t, ∂U )
for all t ∈ [0, 1],
for all t ∈ [0, 1].
So by virtue of Theorem 3.3.15(c), we have d(ϕ0 , U, y) = d(ϕ1 , U, y). It follows that d(ϕ, U, y) is the same for all ϕ ∈ C 1 (U , RN ) within β of ϕ. This leads to a further generalization of Definition 3.3.2. DEFINITION 3.3.16 Let U ⊆ RN be a bounded open set, ϕ ∈ C(U , RN ), and y ∈ / ϕ(∂U ). We define d(ϕ, U, y) to be equal to d(ϕ, U, y), where ϕ ∈ C 1 (U , RN ) satisfies
ϕ(x) − ϕ(x) < d y, ϕ(∂U ) for all x ∈ U . REMARK 3.3.17 In fact it is easy to check that in the above definition we can choose ϕ ∈ C 1 (U , RN ) such that y ∈ / ϕ(Cϕ ). This way we have concluded the definition of Brouwer’s degree which has been defined for the class C(U , RN ). In the next theorem we summarize the basic properties of Brouwer’s degree. THEOREM 3.3.18 If U ⊆ RN is a bounded open set, ϕ ∈ C(U , RN ), and y ∈ / ϕ(∂U ), then (a) d(I, U, y) = 1 for all y ∈ U . (b) Additivity with respect to the domain: If U1 , U2 are disjoint open subsets of U and y ∈ / ϕ U \(U1 ∪ U2 ) , then d(ϕ, U, y) = d(ϕ, U1 , y) + d(ϕ, U2 , y). (c) Homotopy invariance: If h : [0, 1] × U −→RN is a continuous map and y ∈ / h(t, ∂U ) for all t ∈ [0, 1], then d h(t, ·), U, y is independent of t ∈ [0, 1]. (d) Dependence on the boundary values: If ϕ ∈ C(U , RN ) and ϕ∂U = ϕ∂U , then d(ϕ, U, y) = d(ϕ, U, y).
202
3 Nonlinear Operators and Fixed Points
(e) Excision property: If K ⊆ U is closed and y ∈ / ϕ(K), then d(ϕ, U, y) = d(ϕ, U \ K, y).
(f) Continuity with respect to ϕ: If ϕ ∈ C(U ) and ϕ − ϕ∞ < d y, ϕ(∂U ) , then d(ϕ, U, y) is defined and equals d(ϕ, U, y). (g) Existence property: d(ϕ, U, y) = 0 implies that ϕ−1 (y) = ∅. PROOF: (a) Follows at once from Definition 3.3.2. (b) First we show that ∂U1 , ∂U2 ⊆ ∂U . Clearly ∂Uk ⊆ U k ⊆ U for k = 1, 2. So if there is x ∈ ∂U1 with x ∈ / ∂U , then we must have x ∈ U . So x ∈ U2 and we find r > 0 such that Br (x) ⊆ U2 , hence Br (x) ∩ U1 = ∅. This contradicts the fact that x ∈ ∂U1 . So ∂U1 ⊆ ∂U and similarly ∂U2 ⊆ ∂U . We choose ϕ ∈ C 1 (U , RN ) such that
ϕ − ϕ∞ < d y, ϕ(∂U ) and y∈ / ϕ(Cϕ ). Because ∂Uk ⊆ ∂U , it follows that y ∈ / ϕ(∂Uk ) and
ϕ(x) − ϕ(x) < d y, ϕ(∂U ) for all x ∈ U k , k = 1, 2, ⇒ d(ϕ, Uk , y) = d(ϕ, Uk , y), k = 1, 2. So we have d(ϕ, U, y) = d(ϕ, U, y) =
sgn Jϕ (x)
x∈ϕ −1 (y)
=
sgn Jϕ (x) +
x∈ϕ −1 (y)∩U1
sgn Jϕ (x)
x∈ϕ −1 (y)∩U2
= d(ϕ, U1 , y) + d(ϕ, U2 , y) = d(ϕ, U1 , y) + d(ϕ, U2 , y). (c) It follows from Theorem 3.3.15(c) and Definition 3.3.16. (d) Consider the continuous map (homotopy) h(t, x) = tϕ(x) + (1 − t)ϕ(x) for all t ∈ [0, 1] and all x ∈ U . For x ∈ ∂U , we see that h(t, x) = ϕ(x) and so y ∈ / h(t, ∂U ) for all t ∈ [0, 1]. Therefore (c) implies that d(ϕ, U, y) = d(ϕ, U, y). (e) Again we choose ϕ ∈ C 1 (U , RN ) such that
ϕ − ϕ∞ < d y, ϕ(∂U ) , ϕ − ϕ∞ < d y, ϕ(K)
and
y∈ / ϕ(Cϕ ).
Then y ∈ / ϕ(K) and from the choice of ϕ, we have d(ϕ, U, y) = d(ϕ, U, y) = sgn Jϕ (x) = sgn Jϕ (x) x∈ϕ −1 (y)∩U
x∈ϕ −1 (y)∩(U \K)
= d(ϕ, U \K, y) = d(ϕ, U \K, y).
(f) Because ϕ − ϕ∞ < d y, ϕ(∂U ) and y ∈ / ϕ(∂U ), it follows that y ∈ / ϕ(∂U ) and so d(ϕ, U, y) is defined. Take g ∈ C 1 (U , RN ) such that
3.3 Degree Theory
g − ϕ∞ + ϕ − ϕ∞ < d y, ϕ(∂U ) ,
⇒ g − ϕ∞ < d y, ϕ(∂U ) , ⇒ d(g, U, y) = d(ϕ, U, y) (see Definition 3.3.16).
Because d y, ϕ(∂U ) ≤ d y, ϕ(∂U ) + ϕ − ϕ∞ , we have
g − ϕ∞ < d y, ϕ(∂U ) (see (3.51)).
203 (3.51) (3.52)
So once more Definition 3.3.16 implies that d(g, U, y) = d(ϕ, U, y).
Therefore finally we have that if ϕ − ϕ∞ < d y, ϕ(∂U ) , then d(ϕ, U, y) = d(ϕ, U, y)
(3.53)
(see (3.52) and (3.53)).
(g) If y ∈ / ϕ(U ), we take ϕ ∈ C 1 (U , RN ) such that
ϕ − ϕ∞ < d y, ϕ(U ) . Hence y ∈ / ϕ(U ) and so d(ϕ, U, y) = 0. Therefore by Definition 3.3.16 we have d(ϕ, U, y) = 0. From this we infer that y ∈ ϕ(U ) if d(ϕ, U, y) = 0. Next we present some consequences of these properties and of Definition 3.3.16. COROLLARY 3.3.19 If U ⊆ RN is bounded open and ϕ ∈ C(U , RN ), then d(ϕ, U, ·) is constant on the connected components of RN \ϕ(∂U ). PROOF: Let Z be a connected component of RN \ ϕ(∂U ) and let y1 , y2 ∈ Z. As before we can find a continuous path γ : [0, 1] −→ Z such that γ(0) = y1 and γ(1) = y2 . Choose ϕ ∈ C(U , RN ) such that
ϕ − ϕ∞ < d γ([0, 1]), ϕ(∂U ) . By virtue of Definition 3.3.16 we have that d(ϕ, U, yk ) = d(ϕ, U, yk ),
k = 1, 2
and y1 , y2 are in the same component of RN \ ϕ(∂U ). Then the result follows from Theorem 3.3.15(a). / ϕ(∂U ), COROLLARY 3.3.20 If U ⊆RN is bounded open, ϕ∈C(U , RN ), and y ∈ then d(ϕ, U, y) = d(ϕ − v, U, y − v) for all v ∈ RN . PROOF: Let ξ : [0, 1] −→ Z be defined by ξ(t) = d(ϕ − tv, U, y − tv). Note that y − tv ∈ / (ϕ − tv)(∂U ) and so ξ is well defined. Moreover, by virtue of Theorem 3.3.18(f) and Corollary 3.3.19, ξ(·) is continuous. Because it is Z-valued, it is constant. This permits the following improvement of the homotopy invariance property (see Theorem 3.3.18(c)).
204
3 Nonlinear Operators and Fixed Points
COROLLARY 3.3.21 If U⊆RN is bounded open, h : [0, 1]×U −→ R N , y : [0, 1] −→ RN are continuous maps, and y(t) ∈ / h(t, ∂U ) for all t ∈ [0, 1], then d h(t, ·), U, y(t) is independent of t ∈ [0, 1]. PROOF: Consider the continuous map h(t, x) = h(t, x) − y(t)
for all (t, x) ∈ [0, 1] × U .
Then from Corollary 3.3.20 we have
d h(t, ·), U, 0 = d h(t, ·), U, y(t)
for all t ∈ [0, 1].
But from Theorem 3.3.18(c) d h(t, ·),
U, 0 is independent of t ∈ [0, 1]. Hence the same can be said for d h(t, ·), U, y(t) . COROLLARY 3.3.22 If U ⊆ RN is bounded open, ϕ, ϕ ∈ C(U , RN ) and for all x ∈