Daizhan Cheng Xiaoming Hu Tielong Shen
Analysis and Design of Nonlinear Control Systems
Daizhan Cheng Xiaoming Hu Tielong Shen
Analysis and Design of Nonlinear Control Systems With 63 figures
Authors Daizhan Cheng Academy of Mathematics & Systems Science Chinese Academy of Sciences Beijing, 100190, China Email:
[email protected]
Xiaoming Hu Optimization and Systems Theory Royal Institute of Technology 100 44 Stockholm, Sweden Email:
[email protected]
Tielong Shen Department of Engineering and Applied Sciences Sophia University Kiocho 7-1, Chiyoda-ku Tokyo, 102-8554 Japan Emai:
[email protected]
ISBN 978-7-03-025964-6 Science Press Beijing ISBN 978-3-642-11549-3 e-ISBN 978-3-642-11550-9 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2009942528 © Science Press Beijing and Springer-Verlag Berlin Heidelberg 2010 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer-Verlag. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover design: Frido Steinen-Broo, EStudio Calamar, Spain Printed on acid-free paper Springer is a part of Springer Science+Business Media (www.springer.com)
Preface
The purpose of this book is to present a comprehensive introduction to the theory and design technique of nonlinear control systems. It may serve as a standard reference of nonlinear control theory and applications for control scientists and control engineers as well as Ph.D students majoring in Automation or some related elds such as Operational Research, Management, Communication etc. In the book we emphasize on the geometric approach to nonlinear control systems. In fact, we intend to put nonlinear control theory and its design techniques into a geometric framework as much as we can. The main motivation to write this book is to bring readers with basic engineering background promptly to the frontier of the modern geometric approach on the dynamic systems, particularly on the analysis and control design of nonlinear systems. We have made a considerable effort on the following aspects: First of all, we try to visualize the concepts. Certain concepts are dened over local coordinates, but in a coordinate free style. The purpose for this is to make them easily understandable, particularly at the rst reading. Through this way a reader can understand a concept by just considering the case in ℝn . Later on, when the material has been digested, it is easy to lift them to general topological spaces or manifolds. Secondly, we emphasize the numerical or computational aspect. We believe that making things computable is very useful not only for solving engineering problems but also for understanding the concepts and methods. Thirdly, certain proofs have been simplied and some elementary proofs are presented to make the materials more readable for engineers or readers not specializing in mathematics. Finally, the topics which can be found easily in some other standard textbooks or references are briey introduced and the corresponding references are included. Much attention has been put on new topics, new results, and new design techniques. For convenience, a brief survey on linear control theory is included, which can be skipped for readers who are already familiar with the subject. For those who are not majoring in control theory, it provides a tutorial introduction to the eld, which is sufcient for the further study of this book. The other mathematical prerequirements are Calculus, Linear Algebra, Ordinal Differential Equation.
vi
Preface
The materials in the book are selected and organized as self-sustained as possible. Chapter 1 is a general introduction to dynamic (control) systems. First, a brief survey for the theory of linear control systems is given. It provides certain necessary knowledge of systems and control, which will be used in the sequel. Then some special characteristics of nonlinear dynamics are discussed. Finally, some sample nonlinear control systems in practice are presented. Chapter 2 gives an elementary introduction to topological spaces. It focuses primarily on those fundamental concepts of topological space. We emphasize on the second countable Hausdorff space, which is the enduring space of a manifold. Continuity of a mapping, homeomorphism, connectness, and quotient space etc. are also discussed. Chapter 3 investigates differential manifolds. It is the basic tool for the geometric approach to nonlinear control systems. The concept of differential manifold is discussed rst. Fiber bundle is then introduced. Vector elds, their integral curves and Lie brackets etc. are discussed subsequently. Then form, distribution and codistribution are investigated. In fact, smooth function, vector eld and co-vector eld (one-form) are the three fundamental elements in nonlinear geometric control theory. Some important theorems such as Frobenius’ Theorem, Lie series expansions and Chow’s Theorem are presented with proofs. Finally, the tensor eld is introduced, and based on it two important manifolds, namely, Riemanian manifold and symplectic manifold are investigated. Chapter 4 gives a brief review on some basic concepts on abstract algebra, including group, ring and algebra. Then there is a brief introduction to some elementary concepts in algebraic topology, such as fundamental group, covering space etc. The main effort is focused on Lie group and Lie algebra. Particularly, the general linear group, general linear algebra and their sub-groups and sub-algebras are investigated. In brief summary, Chapters 2–4 provide the mathematical foundation for nonlinear control theory that should sufce for the study of the rest of the book. Chapter 5 considers controllability and observability of nonlinear systems. Similar to linear systems, the “controllable” and “observable” sub-manifolds are obtained. Based on them the Kalman decomposition is obtained. Algorithms for some control related distributions are provided. Chapter 6 provides some further discussion for the global controllability of nonlinear systems. It is based on the properties of the integral orbits of a set of vector elds and under a general framework of switched systems. First, a heuristic sufcient condition is provided, which shows the geometric insight of the controllability. Then it is generalized to the case of nested distributions. Finally, it is shown that under certain circumstances the sufcient condition becomes necessary too. Chapter 7 considers stability of nonlinear dynamic systems and feedback stabilization of nonlinear control systems. The Lyapunov theory and its generalization – LaSalle’s invariance principle and their applications are discussed rst. Converse theorems to Lyapunov’s stability theorems are investigated. Stability of invariant set is then considered. Both input-to-output and input-to-state stabilities and stabilizations via control Lyapunov function are also discussed. Finally, for an asymptotically stable equilibrium the region of attraction is investigated. Chapter 8 discusses the decoupling problems. First, as a generalization of (A, B)invariant subspace, the ( f , g)-invariant sub-distribution is dened. It is used to solve
Preface
vii
the disturbance decoupling problem. Then the controlled invariant distribution is introduced and it is used for block decomposition of state space by state coordinate transformation with or without controls. Chapter 9 considers the input-output structure of nonlinear systems. First, the decoupling matrix for afne nonlinear systems is introduced. In the light of it, the input-output decoupling problem (also called the Morgan’s problem), the invertibility of nonlinear systems, and the dynamic feedback decoupling problems are investigated. The normal form is introduced, and then by using the point relative degree (vector), the generalized normal form is presented. Finally, the Fliess functional expansion is introduced to describe the input-output mapping of afne nonlinear systems. Following it, the application of Fliess expansion to tracking problem is discussed. Chapter 10 discusses different linearizations of nonlinear control systems. First, linearization without control, called the Poincar’e linearization, is considered. Then regular state feedback linearization with or without outputs is considered. The results for regular state feedback linearization have a fundamental meaning. Then global linearization is considered. Finally linearization via non-regular state feedback is discussed. Chapters 5–10 may be considered as the kernel of nonlinear control theory. Chapter 11 gives an introduction for the theory of center manifold rst. Then the center manifold is used for the design of stabilizers for nonlinear systems with either minimum or non-minimum phase. For non-minimum phase systems a new tool, called the Lyapunov function with homogeneous derivative is proposed. It is then applied to stabilizing zero dynamics on the center manifold of nonlinear systems with both zero center and oscillatory center separately. The technique developed is applied to stabilization of systems in generalized normal form. Some stabilizer design methods are presented. Chapter 12 is an elementary introduction to output regulation. First, the internal model principle of linear systems is introduced. Then the local output regulation problem is considered in detail. Finally, the results obtained for local output regulation are adopted to solving the robust local output regulation problem. Chapter 13 discusses dissipative systems. First, denition and some useful properties of dissipative systems are introduced. Then, the passivity, as a special case of dissipativity, is investigated, where the main attention is focused on the KalmanYakubovich-Popov lemma. Passivity-based controller design methods are introduced for general nonlinear systems. Finally, some further applications of the design technique are discussed for Lagrange systems and Hamiltonian systems from different physical backgrounds. Chapter 14 considers L2 -gain synthesis problems. Fundamentals of L2 -gain, and Hf norm in linear systems, are discussed. The Hf control problem for linear systems is considered and the extension to nonlinear systems is investigated. Finally, a control system synthesis technique with L2 -gain, mainly disturbance attenuation, is provided using the method of storage function construction. Chapter 15 is about switched systems. Based on the fact that a switched linear system is also a nonlinear system, we consider equally the switched linear and nonlinear systems. Common quadratic Lyapunov functions are considered rst. Based on common Lyapunov functions, the stabilization of switched systems is consid-
viii
Preface
ered. Then the controllability of linear and bilinear switched systems is investigated in detail. A LaSalle’s invariance principle for switched systems has been developed. Finally, the methods developed for switched systems are applied to investigate the consensus problem of different types of multi-agent systems. Chapter 16 provides a tutorial introduction to discontinuous dynamical systems. The Filippov-framework for differential equations with discontinuous right hand side is discussed rstly. Then the non-smooth analysis method, which is motivated by the design problem for non-smooth Lyapunov functions, is reviewed. Stability conditions for the Filippov solutions are discussed and the control design is also investigated for a class of discontinuous systems. Finally, the behavior of sliding mode control systems is revisited in term of Filippov-framework. The issues discussed in Chapters 11–16 are some special systems and special control techniques. Parts of the contents were originally prepared for teaching the course of nonlinear control systems at the Institute of Systems Science, Academy of Mathematics and Systems Science, Chinese Academy of Sciences. The authors are in debt to their graduate students for their assistance in preparing the materials, pointing out typos and for their suggestions for improving the statements and proofs. Particularly, we thank Dr. Hongsheng Qi, and Dr. Zhiqiang Li for helping in proof-reading and picture redrawing. The authors would like to thank Science Press for their support in editing and publishing this book.
March 1, 2010 Daizhan Cheng Xiaoming Hu Tielong Shen
Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 Linear Control Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1.1 Controllability, Observability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.2 Invariant Subspaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.1.3 Zeros, Poles, Observers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.1.4 Normal Form and Zero Dynamics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 1.2 Nonlinearity vs. Linearity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 1.2.1 Localization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 1.2.2 Singularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 1.2.3 Complex Behaviors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 1.3 Some Examples of Nonlinear Control Systems . . . . . . . . . . . . . . . . . . . . . 20 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 2. Topological Space . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 2.1 Metric Space . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 2.2 Topological Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 2.3 Continuous Mapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 2.4 Quotient Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 3. Differentiable Manifold . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 3.1 Structure of Manifolds . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 3.2 Fiber Bundle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 3.3 Vector Field . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56 3.4 One Parameter Group . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60 3.5 Lie Algebra of Vector Fields . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 3.6 Co-tangent Space . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 3.7 Lie Derivatives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66 3.8 Frobenius’ Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 3.9 Lie Series, Chow’s Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 3.10 Tensor Field . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75 3.11 Riemannian Geometry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 3.12 Symplectic Geometry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89
x
Contents
4. Algebra, Lie Group and Lie Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91 4.1 Group . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91 4.2 Ring and Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 4.3 Homotopy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100 4.4 Fundamental Group . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101 4.5 Covering Space . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109 4.6 Lie Group . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113 4.7 Lie Algebra of Lie Group . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115 4.8 Structure of Lie Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119 5. Controllability and Observability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121 5.1 Controllability of Nonlinear Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121 5.2 Observability of Nonlinear Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 136 5.3 Kalman Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145 6. Global Controllability of Afne Control Systems . . . . . . . . . . . . . . . . . . . . . 147 6.1 From Linear to Nonlinear Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 147 6.2 A Sufcient Condition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 150 6.3 Multi-hierarchy Case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163 6.4 Codim(G ) = 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 168 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171 7. Stability and Stabilization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173 7.1 Stability of Dynamic Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173 7.2 Stability in the Linear Approximation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 175 7.3 The Direct Method of Lyapunov . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 177 7.3.1 Positive Denite Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 177 7.3.2 Critical Stability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179 7.3.3 Instability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180 7.3.4 Asymptotic Stability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180 7.3.5 Total Stability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 182 7.3.6 Global Stability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 182 7.4 LaSalle’s Invariance Principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 183 7.5 Converse Theorems to Lyapunov’s Stability Theorems . . . . . . . . . . . . . 185 7.5.1 Converse Theorems to Local Asymptotic Stability . . . . . . . . . . . . . . . . . . . 185 7.5.2 Converse Theorem to Global Asymptotic Stability . . . . . . . . . . . . . . . . . . . 187 7.6 Stability of Invariant Set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188 7.7 Input-Output Stability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189 7.7.1 Stability of Input-Output Mapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 190 7.7.2 The Lur’e Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192 7.7.3 Control Lyapunov Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193 7.8 Region of Attraction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 194 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 205 8. Decoupling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 207 8.1 ( f , g)-invariant Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 207 8.2 Local Disturbance Decoupling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 213 8.3 Controlled Invariant Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 218 8.4 Block Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 223
Contents
9.
10.
11
12
13
14
xi
8.5 Feedback Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 232 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 235 Input-Output Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237 9.1 Decoupling Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237 9.2 Morgan’s Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 240 9.3 Invertibility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 243 9.4 Decoupling via Dynamic Feedback . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 247 9.5 Normal Form of Nonlinear Control Systems . . . . . . . . . . . . . . . . . . . . . . 253 9.6 Generalized Normal Form . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 256 9.7 Fliess Functional Expansion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 264 9.8 Tracking via Fliess Functional Expansion . . . . . . . . . . . . . . . . . . . . . . . . . 267 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 277 Linearization of Nonlinear Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279 10.1 Poincar´e Linearization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279 10.2 Linear Equivalence of Nonlinear Systems . . . . . . . . . . . . . . . . . . . . . . . . 282 10.3 State Feedback Linearization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287 10.4 Linearization with Outputs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 292 10.5 Global Linearization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295 10.6 Non-regular Feedback Linearization . . . . . . . . . . . . . . . . . . . . . . . . . . . . 306 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 313 Design of Center Manifold . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 315 11.1 Center Manifold . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 315 11.2 Stabilization of Minimum Phase Systems . . . . . . . . . . . . . . . . . . . . . . . . 317 11.3 Lyapunov Function with Homogeneous Derivative . . . . . . . . . . . . . . . . 319 11.4 Stabilization of Systems with Zero Center . . . . . . . . . . . . . . . . . . . . . . . 328 11.5 Stabilization of Systems with Oscillatory Center . . . . . . . . . . . . . . . . . 335 11.6 Stabilization Using Generalized Normal Form . . . . . . . . . . . . . . . . . . . 341 11.7 Advanced Design Techniques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 349 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 353 Output Regulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 355 12.1 Output Regulation of Linear Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . 355 12.2 Nonlinear Local Output Regulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 366 12.3 Robust Local Output Regulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 374 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 377 Dissipative Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 379 13.1 Dissipative Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 379 13.2 Passivity Conditions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 383 13.3 Passivity-based Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 388 13.4 Lagrange Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 393 13.5 Hamiltonian Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 397 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 401 L 2 -Gain Synthesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 403 14.1 Hf Norm and L2 -Gain . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 403 14.2 Hf Feedback Control Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 409 14.3 L2 -Gain Feedback Synthesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 411 14.4 Constructive Design Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 417 14.5 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 423 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 429
xii
Contents
15 Switched Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 431 15.1 Common Quadratic Lyapunov Function . . . . . . . . . . . . . . . . . . . . . . . . . 431 15.2 Quadratic Stabilization of Planar Switched Systems . . . . . . . . . . . . . . 454 15.3 Controllability of Switched Linear Systems . . . . . . . . . . . . . . . . . . . . . . 467 15.4 Controllability of Switched Bilinear Systems . . . . . . . . . . . . . . . . . . . . . 476 15.5 LaSalle’s Invariance Principle for Switched Systems . . . . . . . . . . . . . . 483 15.6 Consensus of Multi-Agent Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 492 15.6.1 Two Dimensional Agent Model with a Leader . . . . . . . . . . . . . . . . . . . . . . 493 15.6.2 n Dimensional Agent Model without Lead . . . . . . . . . . . . . . . . . . . . . . . . 495 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 508 16 Discontinuous Dynamical Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 509 16.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 509 16.2 Filippov Framework . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 510 16.2.1 Filippov Solution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 510 16.2.2 Lyapunov Stability Criteria . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 513 16.3 Feedback Stabilization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 517 16.3.1 Feedback Controller Design: Nominal Case . . . . . . . . . . . . . . . . . . . . . . . 518 16.3.2 Robust Stabilization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521 16.4 Design Example of Mechanical Systems . . . . . . . . . . . . . . . . . . . . . . . . . 523 16.4.1 PD Controlled Mechanical Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 523 16.4.2 Stationary Set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 524 16.4.3 Application Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 528 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 531 Appendix A Some Useful Theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 533 A.1 Sard’s Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 533 A.2 Rank Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 533 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 533 Appendix B Semi-Tensor Product of Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . 535 B.1 A Generalized Matrix Product . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 535 B.2 Swap Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 537 B.3 Some Properties of Semi-Tensor Product . . . . . . . . . . . . . . . . . . . . . . . . . 538 B.4 Matrix Form of Polynomials . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 539 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 540 Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 541
Symbols
ℂ ℝ ℚ ℤ ℕ := Mm×n Mn V (A) Im(A) Ker(C) C O ⟨A ∣W ⟩ (M, T ) Br (x) A A¯ T (M) T ∗ (M) Cf (M) CZ (M) V (M) V Z (M) etX (x0 ) Lf h ad f g adkf g Lkf h [⋅, ⋅] {⋅ ⋅ ⋅ }LA {⋅, ⋅}
Set of complex numbers Set of real numbers Set of rational numbers Set of integers Set of natural numbers Dened as Set of m × n real matrices Set of n × n real matrices Set of eigenvalues of matrix A Subspace spanned by the columns of A Subspace generated by {X ∣ XC = 0} Controllable subspace Observable subspace Smallest subspace containing W and A invariant Topological space M with topology T Open ball with center x and radius r Interior of A Closure of A Tangent space on manifold M Cotangent space on manifold M Set of Cf functions on M Set of analytic functions on M Set of smooth vector elds on manifold M Set of analytic vector elds on manifold M Integral curve of X with initial value x0 Lie derivative of h (function or form) w.r.t. f Lie derivative of vector eld g w.r.t. f k-th Lie derivative of vector eld g w.r.t. f k-th Lie derivative of h (function or form) w.r.t. f Lie bracket Lie algebra generated by ⋅ ⋅ ⋅ Poisson bracket
xiv
Symbols
Hess(h(x)) H
Hessian matrix of h(x) H is a sub-group of G H is a normal sub-group of G General linear group General linear algebra Special orthogonal linear group Orthogonal linear algebra Symplectic group Symplectic algebra Symmetric group Set of tensors over V with co-variant r and contra-variant s Differential of F Gradient of F Integral manifold of ' passing x0 Involutive closure of a distribution Set of proper stable rational matrices of size n × m Set of proper stable rational functions
Chapter 1
Introduction
In this chapter we give an introduction to control theory and nonlinear control systems. In Section 1.1 we briey review some basic concepts and results for linear control systems. Section 1.2 describes some basic characteristics of nonlinear dynamics. A few typical nonlinear control systems are presented in Section 1.3.
1.1 Linear Control Systems A control system can be described as a black box in Fig. 1.1 (a), with input (or control) u and output y. In this sense, a control system is considered as a mapping from the input space to the output space. Before 1950’s, primarily due to the nature of many electrical and electronic engineering problems then, control problems were largely treated as ltering problems and in the frequency domain, which is particularly suitable for single-input and single-output systems. During 1950’s Rudolf E. Kalman proposed a state space description for control systems. A set of state variables were introduced to describe the box. Intuitively, the black box is split into two parts: the rst part is a set of differential (or difference) equations, which are used to describe the dynamics from control u to state variables x, and then a static equation is used to describe the mapping from state variables x to output y. See Fig. 1.1 (b). There are many different state space descriptions that realize the same inputoutput mapping. These are called the state space realizations of the input-output mapping. A realization is minimum if there is no other realization that has less dimension of the state space. Feedback is perhaps the most fundamental concept in automatic control and has a long history. Feedback means that the control strategy relies on the current status of the system. Depending on what information on the current status is available, it can be classied as state feedback control, see Fig. 1.1 (c), and output feedback control, see Fig. 1.1 (d). A nonlinear control system considered throughout this book is described by { x = F(x, u), x ∈ M, u ∈ U (1.1) y = h(x), y ∈ N, where M, U, and N are manifolds of dimensions n, m, p respectively. F(x, u) and h(x) are smooth mappings (C f mappings unless elsewhere stated). In fact, we conD. Cheng et al., Analysis and Design of Nonlinear Control Systems © Science Press Beijing and Springer-Verlag Berlin Heidelberg 2010
2
1 Introduction
Fig. 1.1
A Control System
sider (1.1) as an expression of the system in a coordinate chart, and under the local coordinates x. In many applications we simply have M = ℝn , U = ℝm , and N = ℝ p . Particularly, when F(x, u) is afne with respect to u, system (1.1) becomes an afne nonlinear system. It is commonly expressed as ⎧ m ⎨x = f (x) + gi (x)ui := f (x) + g(x)u, x ∈ M, u ∈ U ¦ (1.2) i=1 ⎩y = h(x), y ∈ N. System (1.2) becomes a linear control system if f (x) = Ax, h(x) = Cx are linear and gi (x) are constant. That is
1.1 Linear Control Systems
⎧ ⎨x = Ax + ⎩y = Cx,
m
¦ biui := Ax + Bu,
x ∈ ℝn , u ∈ ℝm
i=1
3
(1.3)
y ∈ ℝ p.
It is clear that all the denitions and results for (1.1) are also applicable to (1.2) and (1.3). Observing the history of modern control theory, one sees that the theory was rstly developed for linear systems, and then as the theory for linear control systems had become considerably mature, theory for nonlinear control systems started to take off. So in nonlinear control theory, there are many concepts and results that are originated, inherited, developed, or extended from their linear counterparts. For the sake of easy reference, we give a brief survey on linear control theory in the following. Most of the proofs are omitted in the survey. We refer to standard references such as [11, 6, 4] for details of linear control systems.
1.1.1 Controllability, Observability Denition 1.1. System (1.1) is said to be controllable (on a subset V ⊂ M) if for any two points x, z ∈ M (respectively, x, z ∈ V ) there exists a control u such that under this control the trajectory goes from x(0) = x to x(T ) = z for some T > 0 with x(t) ∈ M (respectively, x(t) ∈ V ), t ∈ [0, T ]. Theorem 1.1. For linear system (1.3) the controllable subspace C is C = Span{B, AB, ⋅ ⋅ ⋅ , An−1 B}.
(1.4)
Consequently, the system is controllable, if and only if C = ℝn . Proof. Dene the following matrix
) (t0 ,t) =
∫ t
eA(t−W ) BBT eA
T (t−W )
t0
dW ,
t > t0 .
(1.5)
We claim that C has full rank, if and only if ) (t0 ,t) is nonsingular. If rank(C ) < n, there exists 0 ∕= X ∈ ℝn such that X T Ak B = 0,
k = 0, 1, ⋅ ⋅ ⋅ , n − 1.
It follows from Taylor expansion and Cayley-Hamilton’s theorem that X T eA(t−W ) B = 0. So ) (t0 ,t) is singular. Conversely, if ) (t0 ,t) is singular, then there exists 0 ∕= X ∈ ℝn such that ∫ t ∥X T eA(t−W ) B∥2 dW = 0. t0
Hence,
X T eA(t−W ) B ≡ 0,
t0 ⩽ W ⩽ t.
4
1 Introduction
Differentiate it with respect to W for k times, and set W = t, we have X T Ak B = 0,
k = 0, 1, ⋅ ⋅ ⋅ , n − 1.
The claim is proved. For system (1.3), the trajectory can be expressed as x(t) = eA(t−t0 ) x0 +
∫t t0
eA(t−W ) Bu(W )dW .
(1.6)
Now if rank(C ) < n, and assume the system is controllable. Let 0 ∕= X ∈ ℝn , such that X T Ak B = 0, k = 0, 1, ⋅ ⋅ ⋅ , n − 1. Set x0 = X and x(t) = 0, then by controllability, (1.6) yields ∫ x0 = −
t
t0
eA(t0 −W ) Bu(W )dW .
Multiply both sides by X T yields ∥X∥2 = 0, which is absurd. Next, assume rank(C ) = n. For any x0 and xt , we can choose u as u(W ) = BT eA Then (1.6) yields
T (t−W )
v.
(1.7)
xt = eA(t−t0 ) x0 + ) v.
Using the claim, ) is invertible. So v = ) −1 (xt − eA(t−t0 ) x0 ).
(1.8)
That is, the control (1.7) with v as in (1.8) drives x0 to x1 .
⊔ ⊓
We gave the proof here since the above theorem is fundamental and the proof is constructive. Remark 1.1. 1. Throughout this book we assume the set of admissible controls is the set of measurable functions, unless elsewhere stated. 2. Let x(0) = x0 and u = u(t). Then the solution of (1.3) is x(t) = e x0 + At
∫t 0
eA(t−W ) Bu(W )dW .
(1.9)
3. System (1.3) is controllable, if and only if W (t0 ,t1 ) =
∫ t1 t0
e−AW BBT e−A W dW T
(1.10)
is nonsingular for t1 > t0 . Moreover, in this case the control u, which drives x from x0 at t0 to x1 at t1 is:
1.1 Linear Control Systems
[ ] T u(t) = BT e−A t W −1 (t0 ,t1 ) e−At1 x1 − e−At0 x0 .
5
(1.11)
Denition 1.2. System (1.1) is said to be observable (on a subset V ⊂ M) if for any two points x, z ∈ M (respectively, x, z ∈ V ) there exists a control u such that under this control the output y(t, u, x) ∕= y(t, u, z) for some t > 0. Theorem 1.2. For linear system (1.3) the observable subspace O is O = Span{CT , ATCT , ⋅ ⋅ ⋅ , (AT )n−1CT }.
(1.12)
Consequently, the system is observable, if and only if O = ℝn . Remark 1.2. 1. From Theorem 1.2 one sees that for linear systems the observability is independent of the inputs. However, this is in general not true for nonlinear systems. 2. System (1.3) is observable, if and only if Q(t0 ,t1 ) =
∫ t1 t0
eA W CTCeAW dW T
(1.13)
is nonsingular for t1 > t0 . Spliting the state space into four parts as: C ∩O, C ∩O ⊥ , C ⊥ ∩O, C ⊥ ∩O ⊥ , and choosing coordinates x = (x1 , x2 , x3 , x4 ) in such a way that each block of state variables corresponds to the above four subspaces, then we have the following Kalman decomposition: Theorem 1.3. (Kalman Decomposition) The system (1.3) can be expressed as ⎧⎡ ⎤ ⎡ ⎤ ⎡ 1⎤ ⎡ ⎤ x1 A11 0 A13 0 x B1 ⎢ ⎢ ⎢ ⎢ ⎥ ⎥ ⎥ ⎥ 2 2 ⎢x ⎥ ⎢A21 A22 A23 A24 ⎥ ⎢x ⎥ ⎢B2 ⎥ u = + ⎢ ⎢ ⎢ ⎢ ⎥ ⎥ ⎥ 3 3 ⎨⎣x ⎦ ⎣ 0 0 A33 0 ⎦ ⎣x ⎦ ⎣ 0 ⎥ ⎦ (1.14) x4 0 0 A43 A44 x4 0 ] [ ⎩y = C1 0 C3 0 . Moreover, { z = A11 z + B1 u y = C1 z
(1.15)
is a minimum realization of the system (1.3). From the above argument it is clear that a linear system is a minimum realization, if and only if it is controllable and observable. A controllable linear system can be expressed into a canonical form, called the Brunovsky canonical form.
6
1 Introduction
Theorem 1.4. (Brunovsky Canonical Form) Assume system (1.3) is controllable. Then its state equations can be expressed as ⎧ x11 = x12 .. . x1n1 −1 = x1n1 m ni m x1n1 = ¦ ¦ Di1j xij + ¦ Ei1 ui i=1 j=1 i=1 ⎨. .. (1.16) m m x1 = x2 .. . m xm nm −1 = xnm m ni m m m i m ⎩xnm = ¦ ¦ Di j x j + ¦ Ei ui . i=1 j=1
i=1
Remark 1.3. It is a common assumption that the columns of B are linearly independent, otherwise some input channel(s) will be redundant. In this case, if we use a state feedback ⎛ ⎤⎞ ⎡m n i
⎡
⎤
⎡
E11
u1 ⎢ .. ⎥ ⎢ .. ⎣ . ⎦=⎣ . um E1m
⎤−1 ⎜⎡ ⎤ ⎢ ¦ ¦ Di j x j ⎥⎟ ⎜ v1 ⎥⎟ ⎢i=1 j=1 ⋅ ⋅ ⋅ Em1 ⎜ ⎥⎟ ⎢ .. ⎥⎟ .. ⎥ ⎜⎢ .. ⎥ − ⎢ ⎜ ⎥⎟ , ⎢ . . ⎦ ⎜⎣ . ⎦ ⎢ ⎥⎟ m ⎜ ⎥⎟ ⎢ n m i ⋅ ⋅ ⋅ Em ⎝ vm ⎣ m i D x ¦ ¦ i j j ⎦⎠ 1 i
i=1 j=1
then the system (1.16) has a very neat form, called the feedback Brunovsky canonical form as ⎧ xk1 = xk2 ⎨.. . (1.17) k k x = x n n −1 k k ⎩xk = v , k = 1, 2, ⋅ ⋅ ⋅ , m. nk
k
1.1.2 Invariant Subspaces Denition 1.3. 1. For linear system (1.3), a subspace V is called an (A, B)-invariant subspace if there exists an m × n matrix F such that (A + BF)V ⊂ V.
(1.18)
1.1 Linear Control Systems
7
V is called an A-invariant subspace if AV ⊂ V.
(1.19)
2. The matrix F satisfying (1.18) is said to be a friend to V . The set of matrices that are friends to V , is denoted by F (V ) = {F∣(A + BF)V ⊂ V }. Proposition 1.1. (Quaker Lemma) V is an (A, B)-invariant subspace, if and only if AV ⊂ V + Im(B).
(1.20)
If we denote by ⟨A∣W ⟩ the smallest subspace that contains W and is A-invariant, then the controllable subspace of system (1.3) can be expressed as C = ⟨A ∣ Im(B)⟩. Based on this observation, we dene the reachability subspace as follows: A subspace V is called a reachability subspace if there exist matrices F and G with proper dimensions such that V = ⟨A + BF ∣ Im(BG)⟩ . It is obvious that a reachability subspace is an (A, B)-invariant subspace. Proposition 1.2. A subspace V is a reachability subspace, if and only if there exists F such that V = ⟨A + BF ∣ Im(B) ∩V ⟩ .
(1.21)
Now let Z ⊂ ℝn be a subspace. Then we have 1. There exists a maximal (A, B)-invariant subspace S∗ ⊂ Z, denoted by S∗ (Z). That is, for any S ⊂ Z being (A, B)-invariant, S ⊂ S∗ . 2. There exists a maximal reachability subspace R∗ ⊂ Z. 3. Let F ∈ F (S∗ ), then R∗ = ⟨A + BF ∣ Im(B) ∩ S∗ ⟩ .
(1.22)
As an application, we consider the following example. Example 1.1. Consider a system { x = Ax + Bu + Ew y = Cx,
(1.23)
where w is disturbance. The disturbance decoupling problem is to nd a control u = Fx, such that for the closed-loop system the disturbance w does not affect y. It is easy to prove that the disturbance decoupling problem is solvable, if and only if
8
1 Introduction
Im(E) ⊂ S∗ (Ker(C)).
(1.24)
1.1.3 Zeros, Poles, Observers Consider a single-input single-output (SISO) system, namely system (1.3) with m = p = 1. Then W (s) := c(sI − A)−1 b
(1.25)
is called the transfer function of system (1.3). The transfer function can be expressed as a proper rational fraction of polynomials as W (s) =
q(s) , p(s)
where p(s) and q(s) are polynomials with deg(p(s)) > deg(q(s)). The zeros of q(s) and p(s) are called the zeros and the poles of the system respectively. It is easy to see that the poles are the eigenvalues of A. Proposition 1.3. Consider the system (1.3). The followings are equivalent: ∙ It is a minimum realization; ∙ It is controllable and observable; ∙ Its transfer function has no zero/pole cancellation. If there is no zero/pole cancellation, it is the presence of zeros on the transfer function W (s) that makes S ∗ (Ker(C)) nontrivial. Hence for a SISO system it follows that dim(S∗ (Ker(C))) = Number of{zeros of W (s)}.
(1.26)
While the zeros can not be changed by the state feedback control, the poles may. In fact, pole (eigenvalue) assignment is very important for control design. Theorem 1.5. Given a set of n numbers / = {O1 , ⋅ ⋅ ⋅ , On }. 1. Assume (1.3) is controllable (briey, (A, B) is a controllable pair), there exists an F, such that V (A + BF) = / . 2. Assume (1.3) is observable (briey, (C, A) is an observable pair), there exists an L, such that V (A + LC) = / . When the system state is not completely measurable, an observer can be designed to estimate the state. A full-dimensional observer has the following form xˆ = Axˆ + Bu + L(y − Cxˆ). Then the error e := x − xˆ satises
(1.27)
1.1 Linear Control Systems
e = (A − LC)e.
9
(1.28)
As long as the system is observable, Theorem 1.5 assures that there exists L such that A − LC is a Hurwitz matrix. Hence lim e(t) = 0.
t→f
In fact, y is a part of the state that is already available. Thus, it may sufce to construct just a reduced-dimensional observer. Choosing R such that [ ] C T= R is a nonsingular matrix. Let z = T x. Then (1.3) becomes ] [ ] [ ⎧[ ] ⎨ z1 = TAT −1 z + T Bu := A¯11 A¯12 z + B¯1 u z2 B¯2 A¯21 A¯22 ⎩ y = z1 .
(1.29)
Let v := A¯21 y + B¯2 u,
w := y − A¯11y − B¯1 u,
we have {
z2 = A¯22 z2 + v w = A¯12 z2 .
(1.30)
As long as (C, A) is observable, it is easy to prove that (A¯12 , A¯22 ) is observable [4]. So we can choose an L such that A¯22 − LA¯12 is Hurwitz. Then we can construct an observer for z2 from (1.30) as zˆ2 = (A¯22 − LA¯12 )ˆz2 + Lw + v = (A¯22 − LA¯12 )ˆz2 + L(y − A¯11y − B¯1 u) + (A¯21y + B¯2 u).
(1.31)
This equation contains the derivative of y. It can be eliminated by dening
[ = zˆ2 − Ly.
(1.32)
Then the observer becomes [ ] [ = (A¯22 − LA¯12)[ + (A¯22 − LA¯12 )L + (A¯21 − LA¯11 ) y + (B¯2 − LB¯1 )u.
(1.33)
Finally, the estimator is xˆ = T
−1
[
Ip 0 L In−p
][ ] y . [
(1.34)
10
1 Introduction
1.1.4 Normal Form and Zero Dynamics Next, we consider the zeros and zero dynamics of a linear control system. For a SISO system, assume its transfer function is expressed as W (s) =
D (sm + q1 sm−1 + ⋅ ⋅ ⋅ + qm) q(s) = . p(s) sn + p1sn−1 + ⋅ ⋅ ⋅ + pn
(1.35)
The roots of q(x)–the zeros of the system, are also called the transmission zeros of the system. The relative degree U is dened as
U = deg(p(s)) − deg(q(s)) = n − m.
(1.36)
Assume q(s) and p(s) are coprime, then a minimum state space realization is ⎡ ⎤ ⎡ ⎤ ⎧ 0 0 1 0 ⋅⋅⋅ 0 ⎢ .. ⎥ ⎢ .. .. .. .. ⎥ ⎢ ⎥ ⎢ . . . ⎥ ⎥x + ⎢ . ⎥u ⎨x = ⎢ . ⎣0 ⎦ ⎣ 0 0 0 ⋅⋅⋅ 1 ⎦ (1.37) −p −p ⋅ ⋅ ⋅ −p D −p n n−1 n−2 1 ] [ ⎩y = q ⋅ ⋅ ⋅ q 1 0 ⋅ ⋅ ⋅ 0 x. m 1 The problem is: Find, if possible, a control u and a set Z ∗ of initial conditions x0 , such that y(t) = 0, ∀t ⩾ 0. If such Z ∗ exists, the restriction of (1.37) on Z ∗ is called the zero dynamics. Calculating the derivatives of the outputs, y(i) , i = 0, 1, ⋅ ⋅ ⋅ , one sees that cAi b = 0, i = 0, 1, ⋅ ⋅ ⋅ , U − 2;
cAU −1 b ∕= 0.
(1.38)
That is y(i−1) = cAi−1 x, y(U )
i = 1, ⋅ ⋅ ⋅ , U ;
= cAU x + cAU −1bu.
(1.39)
It is easy to see that cAi−1 , i = 1, ⋅ ⋅ ⋅ , U are linearly independent. So we can choose a new coordinate frame by letting
[i := cAi−1 x, i = 1, ⋅ ⋅ ⋅ , U ; zi := xi , i = 1, ⋅ ⋅ ⋅ , m.
(1.40)
Then the system becomes ⎧ z = Nz + M[1 [1 = [2 . ⎨..
[U −1 = [U [U = Rz + S[ + D u, ⎩ y = [1 .
(1.41)
1.1 Linear Control Systems
11
where ⎡ ⎢ ⎢ ⎢ N=⎢ ⎢ ⎢ ⎣
0
1
0
.. .
.. .
.. .
0
0
0
⋅⋅⋅
−qm −qm−1 −qm−2
⎤
0
⎥ .. ⎥ . ⎥ ⎥, ⎥ ⋅⋅⋅ 1 ⎥ ⎦ ⋅ ⋅ ⋅ −q1
⎡ ⎤ 0 ⎢ ⎥ ⎢ .. ⎥ ⎢.⎥ ⎥ M=⎢ ⎢ ⎥. ⎢0⎥ ⎣ ⎦ 1
(1.42)
In order to keep y(t) = 0, we must have
[1 = [2 = ⋅ ⋅ ⋅ = [U = 0, and 1 u = − (Rz + S[ ). D It follows that the zero dynamics is dened on the subspace { } Z ∗ = x∣cAi x = 0, i = 0, ⋅ ⋅ ⋅ , U − 1 , and represented by
z = Nz.
The eigenvalues of N are the zeros of q(s). Next, we consider multiple input-multiple output (MIMO) systems. Similar to the SISO case, we dene the transfer function matrix as C(sI − A)−1B. The relative degree vector, denoted by U = (U1 , ⋅ ⋅ ⋅ , U p ), is dened as ci Ak B = 0, k = 0, ⋅ ⋅ ⋅ , Ui − 2; i = 1, ⋅ ⋅ ⋅ , p.
ci AUi −1 B ∕= 0,
(1.43)
Denote the decoupling matrix ⎤ c1 AU1 −1 B ⎥ ⎢ .. D=⎣ ⎦. . ⎡
cp
(1.44)
AU p −1 B
Dene
[ ji = ci A j−1 x,
i = 1, ⋅ ⋅ ⋅ , p, j = 1, ⋅ ⋅ ⋅ , Ui .
It is easy to prove that if D has full row rank (which implies that p ⩽ m), then L := { ci A j−1 i = 1, ⋅ ⋅ ⋅ , p; j = 1, ⋅ ⋅ ⋅ , Ui } p
are linearly independent. Choosing {zk = pk x∣pk ∈ L⊥ } (there are n − ¦ Ui linearly i=1
independent pk ). Using ([ ji , zk ) as coordinates, the system (1.3) can be converted to
12
1 Introduction
⎧ z = Nz + M [ i i [1 = [2 .. . ⎨ i [Ui −1 = [Ui i U −1 i [U = Ri z + Si [ + ci A i Bu, y = [1i , ⎩ i = 1, 2, ⋅ ⋅ ⋅ , p.
(1.45)
Theorem 1.6. Consider the system (1.3). Assume (i). the relative degree vector is (U1 , ⋅ ⋅ ⋅ , U p ); (ii). the decoupling matrix D has full row rank. Then the zero dynamics under the normal form (1.45) is represented by z = Nz,
(1.46)
which is dened on } { Z ∗ = x ci A j−1 x = 0, i = 1, ⋅ ⋅ ⋅ , p, j = 1, ⋅ ⋅ ⋅ , Ui . Moreover, the control which makes y(t) = 0, ∀t ⩾ 0 is u = −DT (DDT )−1 (Rz + S[ ). The eigenvalues of N is called the transmission zeros of system (1.3). Dene ] [ sI − A B . P(s) = −C 0 Then we have Proposition 1.4. s is a transmission zero of system (1.3), if and only if rank(P(s)) < n + min(p, m). In most useful cases we assume p ⩽ m because of the aforementioned reason. As an application of the normal form we consider the output tracking problem. Let yd (t) ∈ ℝ p be the reference signal to be tracked. Our goal is to nd a control u(t) = Fx(t)+ G(t) ∈ ℝm , such that y(t)− yd (t) → 0 as t → f and x(t) stay bounded. p Denote yd (t) = [y1d (t), ⋅ ⋅ ⋅ , yd (t)]T and assume (yid (t))(k) , i = 1, ⋅ ⋅ ⋅ , p, k = 0, 1, ⋅ ⋅ ⋅, Ui − 1 are bounded. We dene the (enlarged) tracking errors eij := ci A j−1 x − (yid )( j−1) , Using the normal form (1.45), we have
i = 1, ⋅ ⋅ ⋅ , p, j = 1, ⋅ ⋅ ⋅ , Ui .
1.1 Linear Control Systems
⎧ z = Nz + ME + MYd [ i i e1 = e2 .. . ⎨ i eUi −1 = eiUi i i (U ) U −1 eUi = Ri z + SiE + SiYd + (yd ) i + ci A i Bu y = [1i , ⎩ i = 1, 2, ⋅ ⋅ ⋅ , p. where
p
13
(1.47)
p
E = [e11 , ⋅ ⋅ ⋅ , e1U1 ; ⋅ ⋅ ⋅ ; e1 , ⋅ ⋅ ⋅ , eU p ]T ; Yd = [y1d , ⋅ ⋅ ⋅ , (y1d )(U1 −1) ; ⋅ ⋅ ⋅ ; ydp , ⋅ ⋅ ⋅ , (ydp )(U p −1) ]T .
Using control where
[ ] U u = −DT (DDT )−1 Rz + SE + SYd + Yd + v , R = [R1 , ⋅ ⋅ ⋅ , R p ]T ; U
S = [S1 , ⋅ ⋅ ⋅ , S p ]T ;
Yd = [(y1d )(U1 ) , ⋅ ⋅ ⋅ , (yd )(U p ) ]T ; v = [v1 , ⋅ ⋅ ⋅ , v p ]. Then the last equation in i-th block becomes p
eiUi = vi ,
i = 1, ⋅ ⋅ ⋅ , p.
So we can choose D ij such that vi = D1i ei1 + ⋅ ⋅ ⋅ + DUi i eiUi ,
i = 1, ⋅ ⋅ ⋅ , p,
which assigns negative eigenvalues to i-th block. Finally, since (yid )(k−1) , i = 1, ⋅ ⋅ ⋅ , p, k = 1, ⋅ ⋅ ⋅ , Ui are bounded, N is Hurwitz, z(t) is bounded. Remark 1.4. For MIMO systems the poles and zeros are dened through its SmithMcMillan form. We give the following example to show this, and refer to [6] for details. Example 1.2. Assume a transfer function matrix is given as ] [ s s(s − 2)2 1 H(s) = , d(s) −s(s − 2)2 2s(3s − 2)(s − 2)2 d(s) =
(1.48)
(s − 2)2 (s + 2)2 .
Then we can nd two unimodular matrices (A unimodular matrix is a polynomial matrix, whose determinant equals 1.) ] ] [ [ 1 0 1 (s − 2)2 , U , U1 (s) = (s) = 2 −(s − 2)2 1 0 1 to convert H(s) into diagonal form (called the Smith-McMillan form) as
14
1 Introduction
[
] s/(s − 2)2 (s + 2)2 0 H(s) = U1 (s) U (s). 0 s2 /(s + 2) 2
(1.49)
From this form, we said that H(s) has three zeros at s = 0, two poles at s = 2, and three poles at s = −2. The aforementioned properties of linear control systems are fundamental. Their counterparts for nonlinear systems will be discussed throughout this book. In this section we skipped some important issues such as output regulation and internal model, linear Hf control etc. It seems better to discuss them together with the nonlinear case.
1.2 Nonlinearity vs. Linearity Many concepts, methods, results or even terminologies in nonlinear control systems have their origins in linear control systems. So we may say that the linear control theory is one of the major foundations of the nonlinear control theory. But nonlinear (control) systems are much more complicated than linear (control) systems. In fact, linear (control) systems are a particular and the simplest class of nonlinear (control) systems. Then one would like to ask what are the fundamental differences between linear (control) systems and general nonlinear (control) systems? In this section we try to answer this question, and for this purpose some special characteristics of nonlinear (control) systems are discussed.
1.2.1 Localization For linear (control) systems most of the properties are global, namely, they are valid for all initial states in ℝn . But for nonlinear (control) systems, a large number of properties are local, namely, valid only for some of the initial states. The rst example of such properties is stability. Example 1.3. Consider a linear system x = Ax,
x ∈ ℝn .
(1.50)
It is well known that the system is asymptotically stable if all the eigenvalues of A have negative real parts. It is unstable if at least one eigenvalue has positive real part. Now consider a nonlinear system x = f (x),
x ∈ ℝn ,
(1.51)
where f (0) = 0. Let A := ww xf ∣x=0 . As will be discussed later on, if all the eigenvalues of A have negative real parts the system is locally asymptotically stable around the origin, and if at least one eigenvalue has positive real part the system is unstable. However, alone from the eigenvalues of A we can not tell anything about the behavior of the system at initial points far from the origin. Moreover, even though we know that there exists a neighborhood U of the origin such that a trajectory starting
1.2 Nonlinearity vs. Linearity
15
from U is bounded and converges to the origin, it is hard to tell in general how large this neighborhood U is. The second example is about controllability. Example 1.4. For linear control system (1.3), it is controllable, if and only if dim(C ) = n. Then for any two points x, y ∈ ℝn , there is an admissible control u, which drives the system from x to y. Now consider the afne nonlinear control system (1.2). Let x0 be an equilibrium point of f (x). Then its linear approximation near x0 is m w f x = x + gi (x0 )ui := Ax + Bu. ¦ w x x0 i=1 It is well known that [8] if (A, B) is controllable, then there exists a neighborhood U of x0 such that the system (1.2) is locally controllable on U. That is, for any two points x, y ∈ U, there is an admissible control u that drives the system from x to y. Again, what we do have is a local property. The third example is about the normal form. Example 1.5. Consider system (1.2) again. Assume m = p = 1. Similar to the linear case, we can dene the relative degree at a point x0 as Lg Lkf h(x) = 0, U −1
Lg L f
k < U − 1,
x∈U
h(x0 ) ∕= 0,
where U is a neighborhood of x0 . (One may change the above denition to be global, but it will not help for the normal form.) We can prove that dh(x), dL f h(x), ⋅ ⋅ ⋅ , U −1 dL f h(x) are linearly independent on a neighborhood U of x0 . (We use the same notation U but it could be different in different context.) Then we can choose z(x) = [z1 (x), ⋅ ⋅ ⋅ , zn−U (x)]T such that the set of functions {Lkf h(x), k = 0, ⋅ ⋅ ⋅ , U − 1; z(x)} becomes a local coordinate frame. Under it, a normal form similar to (1.41) can be obtained as ⎧ z = I (z, [ ) [1 = [2 . ⎨.. (1.52) [U −1 = [U [ = D (z, [ ) + E (z, [ )u, U ⎩ y = [1 , (z, [ ) ∈ U. this normal form is only dened on U, a certain neighborhood of x0 . It is also difcult to tell how large this U is. When analyzing the geometric structures, most of the results for nonlinear (control) systems are local. If we want to obtain global (or even semi-global) results,
16
1 Introduction
usually some special efforts have to be implemented since it is in general difcult to nd straightforward veriable and globally applicable necessary and sufcient conditions.
1.2.2 Singularity For nonlinear (control) systems, there is usually a characteristic number (possibly, more than one) associated with a certain property. For instance, the rank of the decoupling matrix, the dimension of the Lie algebra (as a distribution) etc. If the characteristic quantity has a constant value on a neighborhood of a point x0 , x0 is called a regular point. If such a neighborhood doesn’t exist, it is called a singular point. Roughly speaking, if a point x0 is a regular point , then on a neighborhood U of x0 the system behaves like a linear system as long as U is small enough. Around a singular point the system may behave strange. We investigate singularities through some examples. Example 1.6. Consider Example 1.5 again. Assume at point x0 we have Lg Lkf h(x0 ) = 0, U −1
Lg L f
k < U − 1, (1.53)
h(x0 ) ∕= 0.
Instead of a neighborhood of x0 , we have only zero value of Lie derivatives at x0 . Since we couldn’t nd a neighborhood U of x0 such that Lg Lkf h(x) = 0, x ∈ U, k < U − 1, then x0 becomes a singular point. It is easy to prove that in this case we are not able to get the normal form as (1.52). In a singular case, some special consideration is necessary. For instance, condition (1.53) can be used to dene the so called point relative degree. Using the point relative degree, a generalized normal form, which is different from (1.45) (for SISO case) or (1.47) (for MIMO case) can be obtained. [5] Next, we consider the reachable set of a nonlinear control system. Example 1.7. Consider a nonlinear system ⎡ ⎤ ⎡ ⎤ 0 x ⎢ ⎥ ⎢ ⎥ ⎥ ⎢ ⎥ [ = ⎢ ⎣y⎦ + ⎣ 0 ⎦ u := f ([ ) + g([ )u, z x2
[ ∈ ℝ3 .
(1.54)
It is easy to see that
' ([ ) := Span{ f ([ ), g([ )} is involutive. According to the generalized Frobenius’ theorem (for analytic distribution) passing each [ ∈ ℝ3 there exists a unique maximal integral manifold of ' . It is easy to see that there are three different cases. Case 1. When [ = O, dim(' (O)) = 0. So the maximal integral manifold of ' passing through O consists of only one point O (where O is the origin).
1.2 Nonlinearity vs. Linearity
17
Case 2. When [ = P ∈ {(x, y, z) ∈ ℝ3 ∖{0}∣x = 0}, dim(' (P)) = 1. The maximal integral manifold of ' passing through P consists of a line passing through O and P (see Fig. 1.2). Taking into consideration the non-negative time, the reachable set of P, denoted by R(P), is the ray starting from P and goes against O. Case 3. When [ = Q ∈ {(x, y, z) ∈ ℝ3 ∣x ∕= 0}, dim(' (Q)) = 2. The maximal integral manifold of ' passing through Q consists of a plane L, satisfying yQx − xQy = 0 (also see Fig. 1.2). Taking into consideration the non-negative time, the reachable set of Q, R(Q), is an open semi-plane (plus {Q}) on the right hand side of Q. In fact, Cases 1 and 2 are singular and Case 3 is regular.
Fig. 1.2
Reachable Sets
Next, we consider singularity of a nonlinear mapping. Consider a mapping S : N → M, where N and M are Cf manifolds of dimension n and m respectively. For the reader who is not familiar with differential geometry, simply set N = ℝn and M = ℝm . Let x0 ∈ N. The rank of S at x0 is the rank of the Jacobian matrix of S at x0 , i.e., [ ] wS rank(S )∣x0 := rank (x0 ) . wx A point x0 is called a regular point if rank(S )x0 = m, otherwise, it is called a singular point. A point y0 ∈ M is called a regular value if S −1 (y0 ), dened as
S −1 (y0 ) := {x ∈ N∣S (x) = y0 }, consists of regular points only. Otherwise, it is called a singular value. For regular value we have
18
1 Introduction
Theorem 1.7. [1] Assume y0 ∈ M is a regular value, then S −1 (y0 ) (if it is not ∅) is a regular sub-manifold of N of dimension n − m. If y0 is a singular value, then we can not draw any conclusion. Fortunately, we have the following Theorem 1.8. (Sard) The set of singular values is nowhere dense in M. The behavior of a nonlinear system at a singular point is different from that at a regular point. Particular attention has to be paid to the singularities of nonlinear systems.
1.2.3 Complex Behaviors A nonlinear dynamic system may have some complex behaviors, which make it completely different from a linear system. We give some examples here. The rst example is the Hopf bifurcation. Example 1.8. (Bifurcation) Consider a dynamic system x = f (x, D ).
(1.55)
The appearance of a topologically nonequivalent phase portrait under variation of parameters is called a bifurcation. In the following we consider a particular system where a bifurcation called Hopf bifurcation appears. { x1 = D x1 − x2 − x1 (x21 + x22 ) (1.56) x2 = x1 + D x2 − x2 (x21 + x22 ). It is not difcult to convert this system into the polar coordinates as in [7] { U = U (D − U 2) M = 1.
(1.57)
Now consider the equilibrium x = 0. If D < 0 the origin is linearly stable (exponentially stable); if D = 0 the origin is nonlinearly stable (not exponentially stable); if D > 0 the origin is linearly unstable (exponentially diverges). We refer to Fig.√1.3 for the phase portrait. Particularly, note that as D > 0 there is a limit circle U = D , which is globally asymptotically stable. This bifurcation is called the Hopf bifurcation. It is also depicted in the phase-parameter space as in Fig. 1.4. The second example is a chaotic system. Example 1.9. (Lorenz System) A dynamic system x = f (x) is a chaotic system if the solution has sensitive dependence on initial conditions [2]. Lorenz system could be the most famous chaotic system. Consider the system ⎧ ⎨x = V (y − x) (1.58) y = rx − y − xz ⎩ z = xy − bz.
1.2 Nonlinearity vs. Linearity
Fig. 1.3
Hopf Bifurcation
Fig. 1.4
Hopf Bifurcation in Phase-Parameter Space
19
Under some particular chosen parameters the system becomes a chaotic system. Following Lorenz, we choose V = 10, r = 28, and b = 83 . We have four equilibrium √ √ points at (±6 2, ±6 2, 27). The system does not have a global section so the projection onto the x-z plane is shown in Fig. 1.5. It can be seen that the projected orbit
Fig. 1.5
Chaos in Lorenz System
20
1 Introduction
√ √ switches between revolving about (x, z) = (6 2, 27) and (x, z) = (−6 2, 27) in an apparently random way. Moreover, there are two strange attractors as the revolving centers.
1.3 Some Examples of Nonlinear Control Systems In this section some typical nonlinear control systems are presented. They will be discussed in detail somewhere later. The rst example is a car steering system. Example 1.10. (Car Steering System) Consider a car moving in a plane (see Fig. 1.6), where x and y are Cartesian coordinates of the middle point on the rear axle, T is ori-
Fig. 1.6
The Geometry of A Car
entation angle, v is the longitudinal velocity measured at that point, L is the distance of the two axles, and I is the steering angle. In this example we briey review the nonholonomic constraints on such a system. The nonholonomic constraints are basically due to two assumptions on the motion of car: no movement in the direction orthogonal to the front wheels and in the direction orthogonal to the rear wheels. Naturally if dynamical factors such as friction forces acting on the tires are considered, then the situation is much more complicated. That the velocity orthogonal to the rear wheels should be zero implies x sin(T ) − ycos( T ) = 0.
(1.59)
That the velocity orthogonal to the front wheels should be zero implies d d (x + L cos(T )) sin(T + I ) − (y + L sin(T )) cos(T + I ) = 0. dt dt One can easily verify that the state equations dened by
(1.60)
1.3 Some Examples of Nonlinear Control Systems
⎧ x = v cos(T ) ⎨ y = v sin(T ) ⎩T = v tan I L
21
(1.61)
satisfy the nonholonomic constraints. An alternative way to derive the third equation is to use the facts: LT = v f sin I , v f cos I = v. One can simplify the model a bit by dening the right hand side of the third equation as a new control Z : ⎧ x = v cos(T ) ⎨ (1.62) y = v sin(T ) ⎩ T = Z. By this way we obtain the so-called unicycle model. Example 1.11. (Attitude Control of Spacecraft) The model consists of equations used for describing a rotating rigid body and for describing the effect of control torques. Therefore one can separate the equations into kinematic equations and dynamic equations. Consider a rigid body rotating in the inertial space. Introduce a coordinate system, N, xed in the inertial space and a coordinate system, B, xed in the body. Let the coordinates of an arbitrary point be denoted by [ N if expressed in the N-frame and by [ B if expressed in the B-frame. Then the relation between the two frames is [ B = R[ N , where R is a rotation matrix, that is RT R = I, det R = 1, and
where
R = S(Z )R
(1.63)
⎤ 0 Z3 −Z2 S(Z ) = ⎣ −Z3 0 Z1 ⎦ , Z2 −Z1 0
(1.64)
⎡
Zi are the components of the angular velocity expressed in the B-frame. Alternatively, the angular position can be described by three angles (Euler angles) I , T , \ , consecutive clockwise rotations about the axes in the B-frame. If we use the standard basis in ℝ3 , then ⎤⎡ ⎤ ⎡ ⎤ ⎡ ⎤ ⎡ 0 Z1 1 0 0 I ⎣ Z2 ⎦ = ⎣ 0 ⎦ + ⎣ 0 cos I sin I ⎦ ⎣ T ⎦ Z3 0 − sin I cos I 0 0 ⎤⎡ ⎤⎡ ⎤ ⎡ cos T 0 − sin T 0 1 0 0 (1.65) + ⎣ 0 cos I sin I ⎦ ⎣ 0 1 0 ⎦ ⎣ 0 ⎦ . sin T 0 cos T 0 − sin I cos I \
22
1 Introduction
Thus, ⎤ ⎡ ⎤⎡ ⎤ I 1 sin I tan T cos I tan T Z1 ⎣ T ⎦ = ⎣ 0 cos I − sin I ⎦ ⎣ Z2 ⎦ . 0 sin I sec T cos I sec T Z3 \ ⎡
(1.66)
Clearly this description is only valid in the region ∣T ∣ ⩽ S2 . The dynamic equations depend on how the craft is controlled. We assume here that m gas jet actuators are used for control. Let J be the inertia matrix of the spacecraft, b1 , ⋅ ⋅ ⋅ , bm be the axes about which the corresponding control torque of magnitude ∥bi ∥ui is applied by means of opposing pairs of gas jets. Then m
J Z = S(Z )J Z + ¦ bi ui .
(1.67)
i=1
The third example is the control of PVTOL aircraft: Example 1.12. (Dynamics of PVTOL) The dynamics of a PVTOL aircraft is described as [3] ⎧ x¨ = − sin(T )u1 + H cos(T )u2 ⎨ y¨ = cos(T )u1 + H sin(T )u2 − 1 ⎩T¨ = u , 2
(1.68)
where x and y are the horizontal and vertical displacements, T is the angle the PVTOL makes with the horizontal line, u1 is the collective input and u2 is the torque. The parameter H is a small coefcient that characterizes the coupling between the rolling moment and the lateral acceleration of the aircraft. The term −1 is the normalized gravitational acceleration. The system is depicted in Fig. 1.7.
Fig. 1.7
PVTOL Aircraft
Using the coordinate transformation:
1.3 Some Examples of Nonlinear Control Systems
z1 = x − H sin(T ) z3 = y + H (cos(T ) − 1) z5 = T , system (1.68) can be expressed in a normal form as ⎧ z1 = z2 z2 − sin(z5 )u1 ⎨z = z 3 4 z4 = cos(z5 )u1 − 1 z5 = z6 ⎩ z6 = u2 .
23
(1.69)
(1.70)
The next example is the control of a robot arm. Example 1.13. (Robot Arm) A robot manipulator consists of a kinematic chain of n + 1 links connected by n joints [10]. It is depicted in Fig. 1.8. Its dynamics can be derived using the general Lagrange equation: d wL wL − = [i , dt w qi w qi
i = 1, 2, ⋅ ⋅ ⋅ , n,
(1.71)
where qi , i = 1, ⋅ ⋅ ⋅ , n are general coordinates for n joints. The Lagrange is L = T −U ,
(1.72)
where T is the kinetic energy and U is the potential energy. The kinetic energy is 1 T = qT B(q)q. 2
(1.73)
Denote the forces generated by the potential energy by gi (q) =
wU . w qi
(1.74)
Putting (1.72)–(1.74) into (1.71) yields B(q)q¨ + C(q, q) q + g(q) = [ , where 1 q) C(q, q) q = B(q, q − 2
(
)T w T (q B(q)q) wq
(1.75)
(1.76)
is the vector of Coriolis and centrifugal torques. Finally, we give a detailed description on [ .
[i = Wi − W fi − Wei ,
(1.77)
24
1 Introduction
Wi , i = 1, ⋅ ⋅ ⋅ , n are the driving torques at the joints, W f = F q
(1.78)
is the viscous friction. Let f and P be the external end-effector force and the external end-effector moment respectively. Then the ending point torque is [ ] f T We = J (q) , (1.79) P where J is the end-effector geometric Jacobian matrix. Then the transfer matrix from general velocity to ending point velocity becomes: ve = J(q)q.
(1.80)
Plugging specied [ into (1.75) yields the dynamics of the robot manipulator as B(q)q¨ + C(q, q) q + F q + g(q) = W − J T (q)h,
(1.81)
[ ] f . P Denote the generalized velocity by p = q, we can express (1.81) in a 2n dimensional form as (it is reasonable to assume B(q) is nonsingular) { q = p [ ] (1.82) p = [B(q)]−1 −C(q, p)p − F p − g(q) + W − J T (q)h . where
h=
Another example is an electrical power generator system. Example 1.14. (Power Generator) Consider an electrical power generator system. As sketched in Fig. 1.9, the synchronous generator is driven by the mechanical power pm that is provided by the hydraulic turbine in the hydroelectric plant. Suppose that the mechanical power controlled by the turbine governor is constant, and the electric load of the generator can be modeled as a single machine of innity bus system. Then, the dynamics of the power system consists of mechanical and electrical parts. First, the mechanical dynamics of the rotor of generator is represented by { G = Z − Z0 D Z0 Z = − {Z − Z0 } + {pm − pe (Eq′ , G )}, M M
(1.83)
with the active electrical power pe given by pe (Eq′ , G ) =
Eq′ Vs V 2 (x′ − xq6 ) sin G + s ′d 6 sin 2G , ′ xd 6 xd 6 xq6
where the variables G , Z and Eq′ denote the angle, the speed of rotor and the transient EMF in the quadrature axis of the generator respectively. The rest of the letters
1.3 Some Examples of Nonlinear Control Systems
Fig. 1.8
Robot Manipulator
Fig. 1.9
Sketch of Hydroelectric Plant
25
are physical parameters that can be found in [9]. Then, the dynamics of electrical part coordinated by Eq′ , which represents the electrical behavior of the generator including the line and the loads, is describe as 1 1 xd − x′d 1 Vs cos G + (V f + E0 ), E q′ = − ′ Eq′ + ′ Td Td0 x6 Td0
(1.84)
26
1 Introduction
where E0 is the nominal value of the excitation signal that is to establish the equilibrium of the system, and V f denotes the excitation signal for stabilizing the system at the equilibrium. Other physical parameters can be found in [9]. For given constant pm and E0 , the equilibrium of the system, denoted by (G0 , Z0 , ′ ), is given by the algebraic equation Eq0 ⎧ Z0 ′ , G0 )] [pm − pe (Eq0 ⎨0 = M 1 ′ 1 xd − x′d 1 + Vs cos G0 + E0 ⎩ 0 = − ′ Eq0 Td Td0 x′6 Td0
(1.85)
For the sake of simplicity, we summarize the physical parameters and dene ′ . Then we obtain the model of the system in x1 = G − G0 , x2 = Z − Z0 , x3 = Eq′ − Eq0 the following form ⎧ ⎨ x1 = x2 [ ] ′ ,x + G ) (1.86) x2 = −b1 x2 + b2 pm − pe (x3 + Eq0 1 0 ⎩ x3 = b3 [cos(x1 + G0 ) − cos G0 ] − b4x3 + u where the excitation signal u = T1 V f (t) is the control input. d Then, the stabilization problem of the generator system is to nd a state feedback control law such that the closed-loop system is asymptotically stable at the origin (x1 , x2 , x3 ) = (0, 0, 0). The system diagram is shown in Fig. 1.10.
Fig. 1.10
Structure of the Power System
The last example is the control of a dual-ended hydroelectric actuation system. Example 1.15. (Hydroelectric Actuator) The schematic diagram of a double-ended hydraulic actuation system is shown in Fig. 1.11. In the system, the piston is driven by the hydraulic force provided by the load pressure pL . The motion of the piston can be represented as x¨ =
d f A pL − x − sgn(x), m m m
(1.87)
where m, A, d, f denote the mass of actuator’s moving part, the piston area, friction and the dry friction coefcients respectively. The load pressure is generated by the hydraulic part and its dynamics is described by
References
A cd w pL = − x + √ xsp C C U
√
Ps − sgn(xsp )pL
27
(1.88)
with w the orice area gradient, U the hydraulic uid density, Ps the pump pressure, and cd the orice coefcient of charge. C = Vt /4E is the hydraulic compliance where Vt and E denote the total actuator volume and the effective bulk modulus of the system, respectively. Consider the spool displacement xsp as the control input. Then the positioning problem of this system is to nd a feedback control law for the control input u = xsp such that for any given desired position xd , the closed loop system is stable and x(t) → xd as t → f.
Fig. 1.11
Dual-ended Hydroelectric Actuation System
References 1. Abraham R, Marsden J. Foundations of Mechanics. Reading: Benjamin/Cummings Pub. Com. Inc., 1978. 2. Arrowsmith D, Place C. An Introduction to Dynamic Systems. New York: Cambridge Univ. Press, 1999. 3. Astol A. Nonlinear and Adaptive Control, Tools and Algorithms for the User. London: Imperial College Press, 2006. 4. Chen C. Linear System Theory and Design. New York: CBS College Pub., 1984. 5. Cheng D, Zhang L. Generalized normal form and stabilization of nonlinear systems. Int. J. Contr., 2003, 76(2): 116–128. 6. Kailath T. Linear Systems. New York: Prentice-Hill, Inc., 1980. 7. Kuznetsov Y. Elements of Applied Bifurcation Theory, 2nd edn. New York: Springer, 1995. 8. Nijmeijer H, Van der Schaft A. Nonlinear Dynamical Control Systems. New York: SpringerVerlag, 1990. 9. Shen T, Mei S, Lu Q, et al. Adaptive nonlinear excitation control with L2 distrbance attenuation for power systems. Automatica, 2003, 39(1): 81–89. 10. Siciliano B, Villani L. Robot Force Control. Boston: Kluwer, 1999. 11. Wonham W. Linear Multivariable Control: A Geometric Aproach, 2nd edn. Berlin: SpringerVerlag, 1979.
Chapter 2
Topological Space
The purpose of this chapter is to present some basic topological concepts of point sets. What we discuss here is very elementary, thus should not be considered as a comprehensive introduction to topology. But it sufces for our goal-providing a foundation for further discussion, particularly for the introduction of differential manifold and the geometrical framework for nonlinear control systems. Many standard text books such as [1, 2, 3] can serve as further references. Section 2.1 is about metric space. It is probably the most fundamental and useful topological space since many concepts of general topological spaces can be understood through it. In fact, many of them are motivated and generalized from the corresponding concepts in the metric space. Section 2.2 introduces topological space and its fundamental properties. Some important classes of topological spaces, such as second countable space, Hausdorff space, etc. are discussed. Mappings between topological spaces are considered in Section 2.3. In terms of continuous mappings the relations between topological spaces are discussed. Particular interest is paid to homeomorphic spaces. Section 2.4 considers reduced new topological spaces from given spaces. Subspace, product space and quotient space etc. are discussed.
2.1 Metric Space Denition 2.1. A metric space (M, d) consists of a set M and a mapping, called distance, d : M × M → ℝ, which satises the following: (i). 0 ⩽ d(x, y) < f, ∀ x, y ∈ M; (ii). d(x, y) = 0, if and only if x = y; (iii). d(x, y) = d(y, x); (iv). (Triangle Inequality) d(x, z) ⩽ d(x, y) + d(x, z),
x, y, z ∈ M.
Example 2.1. Usually, ℝn is considered as a metric space with (but not restrict to) one of the following commonly used distances: (i). √ d(x, y) =
n
¦ (xi − yi )2
i=1
D. Cheng et al., Analysis and Design of Nonlinear Control Systems © Science Press Beijing and Springer-Verlag Berlin Heidelberg 2010
(2.1)
30
2 Topological Space
(ii). d(x, y) = max ∣xi − yi ∣
(2.2)
1⩽i⩽n
(iii). n
d(x, y) = ¦ ∣xi − yi ∣
(2.3)
i=1
(iv). d(x, y) =
√ (x − y)TP(x − y),
(2.4)
where P is a given positive denite matrix. We prove that with d dened in (i), (ℝn , d) is a metric space, and leave the others to the reader as an exercise. Requirements (i)–(iii) are obvious. To prove (iv), i.e., √ √ √ n
n
n
i=1
i=1
i=1
¦ (xi − zi )2 ⩽ ¦ (xi − yi)2 + ¦ (yi − zi )2 .
It follows immediately from Schwarz inequality [4]: √ √ n
n
n
i=1
i=1
i=1
¦ ui vi ⩽ ¦ u2i ¦ v2i .
(2.5)
Example 2.2. Consider ℝn again. Dene the distance as { 0, x = y d(x, y) = 1, x ∕= y. It is left to the reader to show that this is a distance. (In fact, in this example the space ℝn can be replaced by any set, S, and dene the distance between two points x, y ∈ S as in the above.) Later, we will show that the topological structures induced by the distances in Example 2.1 are the same. But the topological structure induced by the distance in Example 2.2 is different from the others. Denition 2.2. Let V be a vector space, if there exists a mapping ∣∣ ⋅ ∣∣ : V → ℝ, satisfying (i). ∣∣x∣∣ ⩾ 0, ∀x ∈ V , and ∣∣x∣∣ = 0, if and only if x = 0; (ii). ∣∣rx∣∣ = ∣r∣∣∣x∣∣, r ∈ ℝ, x ∈ V ; (iii). (Triangle Inequality) ∣∣x + y∣∣ ⩽ ∣∣x∣∣ + ∣∣y∣∣,
x, y ∈ V ;
Then (M, ∣∣ ⋅ ∣∣) is called a normed space, and ∣∣x∣∣ is called the norm of x[4].
2.1 Metric Space
31
Example 2.3. Consider ℝn again. With usual addition and scalar multiplication it is a vector space. We can dene different norms as (i). (
)1/2
n
¦ x2i
∣∣x∣∣ =
(2.6)
i=1
(ii). ∣∣x∣∣ = max ∣xi ∣
(2.7)
1⩽i⩽n
(iii). n
∣∣x∣∣ = ¦ ∣xi ∣
(2.8)
i=1
(iv). ∣∣x∣∣ =
√ xT Px,
(2.9)
where P is a given positive denite matrix. We leave as exercise the verication that (2.6)–(2.9) are all norms. Example 2.4. Let L2 [a, b] be the set of (complex) functions which are square integrable, i.e., ∫ b { } L2 [a, b] = f (x) f (x) f (x)dx < f . a
It is a vector space over ℂ. Dene √ ∣∣ f (x)∣∣ =
∫ b a
f (x) f (x)dx.
(2.10)
Then it is easy to check that (2.10) denes a norm. Therefore, L2 [a, b] is a normed space. To show this, the only non-trivial thing is to prove the triangle inequality, which simultaneously proves that (2.10) is well dened, i.e., the integral is nite. It can be done easily by use the following Schwarz inequality: √ √ ∫ b a
f (x)g(x)dx ⩽
∫ b a
f (x) f (x)dx
∫ b
g(x)g(x)dx.
(2.11)
a
Denition 2.3. Given a vector space V . If there exists a mapping ⟨⋅, ⋅⟩ : V ×V → ℂ, satises the following requirements: (i). ⟨x, x⟩ ⩾ 0, ∀x ∈ V . Moreover, ⟨x, x⟩ = 0, if and only if x = 0; (ii). ⟨x, y⟩ = ⟨y, x⟩, x, y ∈ V ; (iii). ⟨ax + by, z⟩ = a ⟨x, z⟩ + b ⟨y, z⟩ , x, y, z ∈ V, a, b ∈ ℂ; Then (V, ⟨⋅, ⋅⟩) is called an inner product space, and ⟨x, y⟩ is called the inner product of x, y.
32
2 Topological Space
Note that from (ii) and (iii) we have ⟨x, ay + bz⟩ = a¯⟨x, y⟩ + b¯ ⟨x, z⟩ . Example 2.5. Let l2 be the set of square convergence series, i.e., { } f l2 = {xi } ¦ x¯i xi < f . i=1 Dene the inner product as f
⟨{xi }, {yi }⟩ = ¦ x¯i yi .
(2.12)
i=1
To see that this is a well dened inner product, the only non-trivial thing is to show that this inner product is well dened, i.e., the LHS (left hand side) of (2.12) converges. Again we can use Schwarz inequality √ √ f
f
f
i=1
i=1
i=1
¦ x¯i yi ⩽ ¦ x¯i xi ¦ y¯i yi .
(2.13)
Proposition 2.1. 1. Let V be an inner product space. Dene a norm on V as √ ∣∣x∣∣ = ⟨x, x⟩.
(2.14)
Then V becomes a normed space. Such a norm is called the norm induced by the inner product. 2. Let M be a normed space. Dene a distance d as d(x, y) = ∣∣x − y∣∣,
(2.15)
Then M becomes a metric space. We leave the verication that (2.14) is a norm and (2.15) is a distance to the reader as exercises. In an inner product space, the vectors X , Y are said to be orthogonal if ⟨X,Y ⟩ = 0. In ℝ2 or ℝ3 it is easy to verify that ⟨X ,Y ⟩ = 0 means X ⊥ Y , i.e., they are perpendicular to each other. Example 2.6. Let X , Y be two vectors in an inner product space H. Vector Z is called the projection of X on Y , if (i). Z = cY , for some c ∈ ℂ. (ii). (X − Z) ⊥ Y .
Fig. 2.1
Projection of Vector Fields
2.1 Metric Space
33
It is easy to check that the projection of X on Y is Z=
⟨X ,Y ⟩ Y. ⟨Y,Y ⟩
Since ⟨X − Z, X − Z⟩ ⩾ 0, using above equality we get √ √ ⟨X ,Y ⟩ ⩽ ⟨X , X ⟩ ⟨Y,Y ⟩
(2.16)
and the equality holds if and only if X − Z = 0, i.e., X = cY for some c ∈ ℂ. (2.16) is a general form of Schwarz inequality. Using it to ℝn , L2 [a, b], l2 , we have Schwarz inequalities (2.5), (2.11), and (2.13) respectively. Based on Proposition 2.1, inner product spaces and normed spaces are always considered as metric spaces in this book. Unless otherwise stated, the distance is always considered as the one induced by the inner product or norm. In a metric space (M, d), let x ∈ M, r > 0. We denote by Br (x) the open ball with radius r and center at x, i.e., Br (x) = {y ∈ X ∣ d(y, x) < r}. Note that the shape of a ball depends on how the distance is dened. For instance, in ℝ2 corresponding to the distances D1–D4 the balls B1 (0) are drawn in Fig. 2.2. For D4 the matrix is chosen as ] [ 10 . P= 02
Fig. 2.2
Shapes of A Ball in Different Distances
In a metric space, M, a sequence {xn } is called a Cauchy sequence if for any H > 0, there exists an N > 0, such that as m, n > N, we have d(xm , xn ) < H .
34
2 Topological Space
Denition 2.4. A metric space M is complete if each Cauchy sequence {xn } converges to a point x ∈ M. Example 2.7. 1. ℝn with a conventional distance is a complete metric space. 2. Let C[a, b] ⊂ L2 [a, b], which is dened in Example 2.4. It is easy to show that C[a, b] is a metric space. But it is not complete. To see this, we dene { nx, 0 ⩽ x ⩽ n1 Fn = 1, otherwise. Then {Fn } is a Cauchy sequence in C[0, 1], but it does not converge to a point in C[0, 1].
2.2 Topological Spaces Denition 2.5. Given a set X and a set of its subsets T . 1. (X, T ) is called a topological space, if T satises the following (i). X ∈ T , ∅ ∈ T ; (ii). If UO ∈ T , ∀O ∈ / ⊂ ℝ, then ∪O ∈/ UO ∈ T ; (iii). If Ui ∈ T , i = 1, ⋅ ⋅ ⋅ , n, then ∩ni=1Ui ∈ T . 2. An element in U ∈ T is called an open set. Its complement, denoted by U c is called a closed set. 3. For a point x ∈ X, a subset N is called a neighborhood of x if there exists an open set U such that x ∈ U ⊂ N. 4. Let B ⊂ T . B is a topological basis if any element U ∈ T can be expressed as a union of some elements in B. 5. A set of neighborhoods N ⊂ T is called a neighborhood basis of x if for any neighborhood N of x, there is an N0 ∈ N , such that N0 ⊂ N. In fact, for a set M, let B be a set of subsets of M, then B can be a topological basis of M for a certain topology if and only if, (i). ∪{V ∣ V ∈ B} = M, and (ii). an intersection of nite elements from B can always be expressed as a union of certain elements from B. The topology, T , on M with B as its topological basis is called the topology generated by B. Example 2.8. At a university the set of all graduate students is denoted by S . Let M be the subset of male students, F be the subset of female students, Ci , i = 1, 2, 3 be the set of i-th year students. Given a set of subsets as B0 = {M, F,C1 }, and the smallest topology containing B0 is denoted by T . Then (i). A topological basis of T is: {A1 = M ∩C1 , A2 = F ∩C1 , A3 = M ∩ (C2 ∪C3 ), A4 = F ∩ (C2 ∪C3 )}; (ii). In (S , J): C1 is an open set, C1 is also a closed set; C2 is neither an open set nor a closed set.
2.2 Topological Spaces
35
(iii). Let x be a male second year graduate student. A neighborhood basis of x consists of a single element set {A3 }. Of course, the neighborhood basis of x is not unique. Say, {A3 , M} is another one. Denition 2.6. 1. A topological space is said to be second countable, if there exists a countable topological basis. 2. A topological space is said to be rst countable, if for each point x ∈ X there exists a countable neighborhood basis. From the denition it is easy to see that second countable implies rst countable. Example 2.9. Given any set X. 1. Dene T = {X , ∅}. It is ready to see that T is a topology. This topology is called the trivial topology. It is the roughest topology. 2. Dene T = {U ∣ U ⊂ X }, namely T consists of all subsets of X. Then it is obvious that T is a topology. This topology is called the discrete topology. It is the nest topology. Example 2.10. In ℝn we consider the set of all open balls: Br (c) = {x ∈ ℝn ∣ ∥x − c∥ < r},
∀c ∈ ℝn , r > 0,
denoted by B. Note that an intersection of nite balls in B can be expressed as a union of some elements in B. Based on this fact, one sees easily that all possible unions of some elements in B form a topology. This topology is the conventional topology in ℝn because the elements in this topology are exactly what we called “open sets” in the usual sense. The topology, T , obtained in the above is called the topology induced by distance, because the balls are dened by distance. By denition, B is a topological basis of ℝn . Consider a subset B r ⊂ B, which consists of all balls with rational center (i.e., the coordinates of the center are rational numbers.) and rational radius. Then B r is a countable set. Moreover, one sees easily that B r is a topological basis of ℝn . Hence ℝn with the conventional topology is a second countable topological space. It is easy to show that in a nite dimensional normed space, all the norms induce the same topology. This fact is commonly expressed as that in a nite dimensional vector space any two norms are equivalent. Example 2.11. Consider a proper polynomial (as a transfer function in control theory) Q(s) qn−1 sn−1 + qn−2sn−2 + ⋅ ⋅ ⋅ + q0 = . P(s) sn + pn−1sn−1 + ⋅ ⋅ ⋅ + p0 To determine if Q(s) and P(s) are co-prime is important in control theory. As we saw in Chapter 1, co-prime Q(s) and P(s) correspond to a minimum realization. Consider the set of coefcients, {qn−1, ⋅ ⋅ ⋅ , q0 , pn−1 , ⋅ ⋅ ⋅ , p0 } as a point in ℝ2n we claim that the set for Q(s) and P(s) to be co-prime is open. Dene a 2n × 2n matrix
36
2 Topological Space
⎡
1 pn−1
⎢ ⎢ 0 1 pn−1 ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ S=⎢ ⎢ 0 qn−1 ⎢ ⎢ ⎢ 0 qn−1 ⎢ ⎢ ⎢ ⎢ ⎣ 0 0
⋅ ⋅ ⋅ p0 ⋅⋅⋅ ..
.
1 pn−1 ⋅ ⋅ ⋅ q0 ⋅⋅⋅ ..
.
0 qn−1
⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⋅ ⋅ ⋅ p0 ⎥ ⎥ ⎥. ⎥ ⎥ ⎥ ⎥ q0 ⎥ ⎥ ⎥ ⎥ ⎦ ⋅ ⋅ ⋅ q0 p0
It can be proved by mathematical induction that Q(s) and P(s) are co-prime if and only if det(S) ∕= 0. Then the claim follows. (Later on, we will show that the co-prime set is also dense in ℝ2n .) Denition 2.7. Let A ⊂ M. 1. The closure of A, denoted by A¯ or cl(A), is the smallest closed set containing A. Equivalently, A¯ = ∩{C ∣ C is closed and C ⊃ A}. is the largest open set contained in A. 2. The interior of A, denoted by int(A) or A, Equivalently, A = ∪{U ∣ U is open and U ⊂ A}. 3. The boundary of A, denoted by bd(A), is bd(A) = A¯ ∩ Ac . 4. A is a dense set of M if A¯ = M. 5. A is nowhere dense in M if A¯ contains no non-empty open set. Example 2.12. Consider ℝ1 with the conventional topology. 1. Let A = [0, 1) ⊂ ℝ1 . Then (i). A¯ = [0, 1]; (ii). A = (0, 1); (iii). bd(A) = {0, 1}. 2. Let ℚ be the set of rational numbers. Then ℚ is dense in ℝ1 . 3. Let ℤ be the set of integers. Then ℤ is nowhere dense in ℝ1 . Proposition 2.2. Let A ⊂ M. Then 1. x ∈ A¯ if and only if for any neighborhood Nx of x, Nx ∩ A ∕= ∅; 2. x ∈ A if and only if there exists an open neighborhood Nx of x, Nx ⊂ A; 3. x ∈ bd(A) if and only if any neighborhood Nx of x, Nx ∩ A ∕= ∅ and Nx ∩ Ac ∕= ∅. Proof. We prove item 1 only by contradiction. Assume x ∈ A¯ and there exists an neighborhood U ∋ x such that U ∩ A = ∅. Without loss of generality we can assume U is open. Then A ⊂ U c . But U c is closed, then A¯ ⊂ U c . Hence x ∈ U c , which is absurd. ¯ then x ∈ (A) ¯ c , which is, therefore, an open neighborConversely, assume x ∕∈ A, c ¯ ¯ hood of x. Obviously, (A) ∩ A = ∅. The proofs of items 2 and 3 are similar and are left for the reader. ⊔ ⊓
2.2 Topological Spaces
37
Denition 2.8. Let M be a topological space. 1. M is said to be separable if there exists a countable subset A that is dense in M. 2. M is said to be of rst category if it can be expressed as a countable union of nowhere dense sets. Otherwise, it is of second category. Theorem 2.1. (Baire’s Category Theorem) If a metric space X ∕= ∅ is complete, it is of second category. Proof. Suppose X=
f
¦ Mk .
k=1
We have only to show that at least one Mk is not nowhere dense. Assume the converse: all Mk are nowhere dense. Choosing p1 and H1 < 1, a ball B1 can be constructed as B1 = BH1 (p1 ) ⊂ M¯1c with H1 < 1. Construct C1 = B0.5H1 (p1 ). Since M2 is nowhere dense and M¯2 does not contain C1 , we can construct an open ball B2 = BH2 (p2 ) ⊂ M¯2c ∩C1 with H2 < 2−1 H1 . Construct C2 = B0.5H2 (p2 ). In general, since Mk+1 is nowhere dense, M¯k+1 does not contain Ck . We can thus nd an open ball Bk+1 = BHk+1 (pk+1 ) ⊂ (M¯k+1 )c ∩Ck with Hk+1 < 2−1 Hk . Construct Ck+1 = B0.5Hk+1 (pk+1 ). Now Bk+1 ⊂ Ck ⊂ Bk . Hence Bk+t ⊂ Ck , and for m > k
t > 0,
d(pk , pm ) < 2−1 Hk ,
which means {pk } is a Cauchy sequence. Since X is complete, pk → p ∈ X, (k → f). Since d(pk , p) ⩽ d(pk , pm ) + d(pm , p) < 2−1 Hk + d(pm, p) < Hk , (m → f) p ∈ Bk ⊂ (M¯k )c . That means p ∕∈ Mk . Then which is a contradiction.
p ∕∈ ∪f k=1 Mk = X , ⊔ ⊓
Denition 2.9. 1. A topological space, (X, T ) is called a T0 space, if for any two points x, y ∈ X there exists either a Ux ∈ T such that x ∈ Ux and y ∕∈ Ux or a Uy ∈ T such that y ∈ Uy and x ∕∈ Uy .
38
2 Topological Space
2. A topological space, (X , T ) is called T1 space, if for any two points x, y ∈ X there exist both Ux ∈ T and Uy ∈ T , such that x ∈ Ux and y ∕∈ Ux and y ∈ Uy and x ∕∈ Uy . 3. A topological space, (X , T ) is called T2 space, if for any two points x, y ∈ X there exist both Ux ∈ T and Uy ∈ T , such that x ∈ Ux , y ∈ Uy and Ux ∩Uy = ∅. T2 space is also called Hausdorff space. It follows from denition that T2 ⇒ T1 ⇒ T0 . Example 2.13. Consider ℝ1 . 1. Dene a subset T as the set of semi-lines: T = {(−f, r) ∣ r ∈ ℝ}. Then (ℝ1 , T ) is a topological space. Moreover, it is easy to check that this space is T0 . But it is not T1 . 2. Dene a subset T as T = {U ⊂ ℝ ∣ U c is nite.} Then (ℝ1 , T ) is also a topological space. One can show that this is a T1 space. But it is not T2 . 3. With the convenient topology, it is easy to show that ℝ1 is a T2 space. Denition 2.10. Let (X, T ) be a topological space, S ⊂ X. S is called a topological subspace of X, if the topology of S is dened as TS = {U ∩ S ∣ U ∈ T }. We have to check that TS is really a topology. We leave it as an exercise. Denition 2.11. Let (Xi , Ti ), i = 1, 2 be two topological spaces. Consider the Cartesian product, X1 × X2 = {(x, y) ∣ x ∈ X1 , y ∈ X2 }. Let {U1 × U2 ∣ U1 ∈ T1 , U2 ∈ T2 } be a topological basis, and the topology generated by this basis be denoted by T1 × T2 . Then (X1 × X2 , T1 × T2 ) is a topological space, which is called the product topological space of X1 and X2 . The following theorem is useful: Theorem 2.2. Topological space (X , T ) is Hausdorff, if and only if the diagonal set of the product space (X × X, T × T ), denoted by D = {(x, x) ∣ x ∈ X}, is a closed set in the product space. Proof. (Necessity) Assume X is Hausdorff. Let (x, y) ∈ X × X and (x, y) ∕∈ D, which means x ∕= y. Then there exist open sets Ux ∋ x and Uy ∋ y, such that Ux ∩ Uy = ∅. Now Ux × Uy ⊂ X × X , Ux × Uy is open and Ux × Uy ∩ D = ∅. Hence, Dc is open, i.e., D is closed.
2.3 Continuous Mapping
39
(Sufciency) Assume D is closed. Given any x, y ∈ X and x ∕= y, we know that (x, y) ∈ Dc , which is open. So, there is an open set U ⊂ X × X such that (x, y) ∈ U ⊂ Dc . But {U × V ∣ U,V ∈ T } is the topological basis of T × T , hence there exist Ux ,Vy ∈ T such that (x, y) ∈ Ux × Uy ⊂ U ⊂ Dc . That is, x ∈ Ux and y ∈ Uy and Ux ∩Uy = ∅. Hence X is Hausdorff.
⊔ ⊓
2.3 Continuous Mapping Denition 2.12. Let M, N be two topological spaces. A mapping S : M → N is continuous, if one of the following two equivalent conditions holds: ∙ For any U ⊂ N open, its inverse image
S −1 (U) := {x ∈ M ∣ S (x) ∈ U} is open. ∙ For any C ⊂ N closed, its inverse image S −1 (C) is closed. We need to verify that these two conditions are equivalent. It is straight forward and we leave it to reader. Denition 2.13. Let M, N be two topological spaces. M and N are said to be homeomorphic if there exists a mapping S : M → N, which is one-to-one (injective), onto (surjective) and continuous. Moreover, S −1 is also continuous. S is called a homeomorphism. If a mapping is both injective and surjective it is said to be bijective. Example 2.14. Let S2 be a sphere: S2 = {(x, y, z) ∈ ℝ3 ∣ x2 + y2 + z2 = 1} and N be the north pole, i.e., N = (0, 0, 1). Then S2 ∖N, with the inherited topology from ℝ3 , is homeomorphic to ℝ2 . One of the homeomorphisms is: ⎧ ⎨X = x/(1 − z) ⎩Y = y/(1 − z), where (X,Y ) are the coordinates on ℝ2 . Note that if M and N are two metric spaces and F : M → N is a mapping, we may dene the continuity by H − G language as what we did in Calculus: F is continuous in x0 if for any given H > 0 there exists G > 0 such that d(x, x0 ) < G implies d(F(x), F(x0 )) < H . F is continuous if it is continuous everywhere. It is easily seen that for metric spaces this denition coincides with the general denition for topological spaces as long as the topologies are induced by the metrics.
40
2 Topological Space
Denition 2.14. Given a topological space M. 1. A set U ⊂ M is said to be clopen if it is both closed and open. A topological space, M, is said to be connected if the only two clopen sets are M and ∅. 2. A continuous mapping S : I = [0, 1] → M is called a path on M. M is said to be pathwise (or arcwise) connected if for any two points x, y ∈ M there exists a path, S , such that S (0) = x and S (1) = y. Example 2.15. 1. ℝ is connected. Assume U ∕= ∅ and U ∕= ℝ is a clopen set in ℝ. Choose x ∈ U and y ∈ U c . Say x < y. Consider set V = {z ∈ U ∣ z < y}. Then set V has a lowest upper bound m ⩽ y. Since U is closed m ∈ U, so m < y. Moreover, (m, y] ⊂ U c . Because U is open, U c is closed. Hence (m, y] = (−f, y] ∩ U c is closed. Then m ∈ U c , which is a contradiction. The same argument shows that any interval in ℝ is connected. 2. A pathwise connected space, M, is connected. Assume U ∕= ∅ and U ∕= M is a clopen set in M. Choose x ∈ U and y ∈ U c . Since M is path connected, there is a path S : I → M such that S (0) = x and S (1) = y. By continuity, both S −1 (U) and S −1 (U c ) are clopen non-empty sets on I, which contradicts 1. The following example shows that the converse of the second statement of the above example is incorrect. Example 2.16. On ℝ2 dene a topological ( )subspace as 1 , x > 0} ∪ {(0, y) ∣ y ∈ ℝ}. S = {(x, y) ∈ ℝ2 ∣ y = sin x It is connected, because both Y -axis and the curve can not be open. But it is not pathwise connected, because there is no path connecting such two points, one of which is on Y -axis and the other one on the curve. (Refer to Fig. 2.3)
Fig. 2.3
Connected but not Pathwise Connected
Denition 2.15. A topological space M is said to be locally connected at x ∈ M if every neighborhood Nx of x contains a connected neighborhood Ux , i.e., x ∈ Ux ⊂ Nx . M is said to be locally connected if it is locally connected at each x ∈ M.
2.3 Continuous Mapping
41
The following example shows that local connectedness does not imply connectedness (hence no pathwise connectedness); conversely, pathwise connectedness (connectedness) does not imply local connectedness. Example 2.17. 1. Let ℝ be with its discrete topology. Then it is locally connected, because each point itself is a connected neighborhood. But it is not connected because each point is clopen. 2. Let Bi , i = 1, 2, ⋅ ⋅ ⋅ be closed segments starting from origin and ending at (1, 1i ). B0 is the segment [0, 1] on X-axis. As shown in Fig. 2.4. An innite broom consists of 2 B = ∪f i=0 Bi ⊂ ℝ , which is obviously pathwise connected. But it is not locally connected. For instance, consider a point x = (0.5, 0). The ball B0.2 (x) does not contain a connected neighborhood. (Refer to Fig. 2.4)
Fig. 2.4
Innite Broom
Denition 2.16. Let {UO ∣ O ∈ / } be a set of open sets in M. The set is called an open covering of M if ∪O ∈/ UO ⊃ M. M is said to be a compact space if every open covering has a nite sub-covering, i.e., there exists a nite subset {UOi ∣ i = 1, 2, ⋅ ⋅ ⋅ , k} such that ∪ki=1UOi ⊃ M. From Calculus we know that with the conventional topology, a set, U ⊂ ℝn is compact, if and only if it is bounded and closed. Unfortunately, it is not true for
42
2 Topological Space
general metric spaces. For instance, consider the set of {xk } ∈ l 2 , k = 1, 2, ⋅ ⋅ ⋅ , where (xk )i = Gik , i.e., x1 = (1, 0, 0, ⋅ ⋅ ⋅ ), x2 = (0, 1, 0, ⋅ ⋅ ⋅ ), etc. It is obvious that {{xk }, k = 1, 2, ⋅ ⋅ ⋅ } is a closed and bounded set, but it is not compact. Denition 2.17. In a topological space, M, a sequence {xk } is said to converge to x, if for any neighborhood U ∋ x there exists a positive integer N > 0 such that when n > N, xn ∈ U. To emphasize that the convergence is a topological concept we consider the following simple example: Example 2.18. Consider ℝ1 and let xk = 1k , k = 1, 2, ⋅ ⋅ ⋅ . 1. Under the conventional topology it is obvious that xk → 0 because for any neighborhood U there exists an open neighborhood, ball BH (0) = {x ∣ ∣x∣ < H } such that BH (0) ⊂ U. When N > H1 and n > N, xn ∈ U. So the general denition coincides with that in Calculus. 2. Impose the discrete topology on ℝ1 . i.e., each point is an open set. Then xk converges to nowhere. Because it can never get into any {r}, which is a neighborhood of r. 3. Impose the co-nite topology on ℝ1 . Recall that in this topology U ∕= ∅ is open, if and only if U c is nite. Then xk converges to every point. Let r ∈ ℝ be any point, and U ∋ r be a co-nite neighborhood. Since U c is nite at most nite xk ∈ U c . The conclusion follows. Proposition 2.3. Let M, N be two topological spaces. M is rst countable. f : M → N is continuous, if and only if for each xk → x, f (xk ) → f (x). Proof. (Sufciency) For any open U ∋ f (x), by continuity f −1 (U) ∋ x is open. Since xn → x there is a N > 0 such that xn ∈ f −1 (U), n > N. It follows that f (xn ) ∈ U, n > N. (Necessity) Let U ⊂ N be open. we need to show that f −1 (U) is open. It is enough to show that for each x ∈ f −1 (U) there exists an open V such that x ∈ V ⊂ f −1 (U). If it is not true then there exists at least one point x0 ∈ f −1 (U), such that any neighborhood of it is not contained in f −1 (U). Since M is rst countable, let Uk be its countable neighborhood base, and set Vk = ∩ki=1Ui , we have a sequence of shrinking neighborhoods. Since Vk ∕⊂ f −1 (U), there exists xk ∈ Vk and xk ∕∈ f −1 (U). Now since xk → x0 so f (xk ) → f (x0 ) ∈ U. Then there is an integer N > 0 such that f (xn ) ∈ U, n > N, which means xn ∈ f −1 (U), which is a contradiction. ⊔ ⊓ Denition 2.18. A topological space is called sequentially compact if every sequence contains a convergent subsequence. Theorem 2.3. (Bolzano-Weierstrass) Let M be a rst countable topological space. if M is compact, it is sequentially compact. ¯ We claim that there exists a sequence {ak } ∈ A such Proof. Let A ⊂ M, x ∈ A. that ak → x. Since M is rst countable, using the above argument (in the proof of Proposition 2.3), we see that there exists a set of shrinking neighborhoods Vi ∋ x. Since Vk ∩ A ∕= ∅ we can choose ak ∈ Vk ∩ A for each k. Then ak → x.
2.3 Continuous Mapping
43
Now let {uk } be a sequence and denoted by A = {uk , k = 1, 2, ⋅ ⋅ ⋅ }. If A is not ¯ closed then by the above argument, we can choose x ∈ A∖A, and aki → x. Thus we can assume A is closed. Now we claim that for each ai there exists an open neighborhood Ui such that a j ∕∈ Ui , j ∕= i. If for a point ai such a neighborhood does no exist, then any neighborhood would contain some points from the sequence but itself. Hence there exists a sequence converging to it. Now {Ui , i = 1, 2, ⋅ ⋅ ⋅ } ∪ Ac is an open covering of M, but it does not have any nite sub-covering.
⊔ ⊓
The inverse of the Theorem 2.3 is also true. We prove it for metric spaces. We need some lemmas that themselves are interesting. Lemma 2.1. Let M be a sequentially compact space. Then for any H > 0, there exist x1 , ⋅ ⋅ ⋅ , xn ∈ M such that ∩ni=1 BH (xi ) ⊃ M. Such a structure is called an H -net. Proof. Choose x1 . If BH (x1 ) ⊃ M, we are done. Otherwise, choose x2 ∈ (BH (x1 ))c , and construct BH (x2 ). Keep going in this way and at the k-th step choose xi ∈ c (∪i−1 k=1 BH (xk )) . If at the i-th step we could not nd such xi we are done. Otherwise, we nd a sequence, xi , with d(xi , x j ) ⩾ H . This sequence has no convergent sub-sequence, which is a contradiction. ⊔ ⊓ Lemma 2.2. Let M be a sequentially compact metric space and {UO ∣ O ∈ / } is an open covering. Then there exists a number P > 0, called Lebesgue number such that for any x ∈ M, the ball BP (x) ∈ UO for some UO . Proof. For each x ∈ M choose maximal Px > 0 such that Bx (Px ) ⊂ UOx . It is enough to show that inf Px := P > 0. x∈M
Let {xn } be a sequence that makes Pxn → P . By sequential compactness, there is a sub-sequence xni → x0 . Now for this x0 there exists P0 and UO0 , such that BP0 (x0 ) ∈ UO0 . Once again by the sequential compactness, there is an N > 0 such that xni ∈ B P0 /2 (x0 ). Then BP0 /2 (x0 ) ⊂ UO0 , which implies Pni ⩾ P0 /2. But Pni → P . Hence P ⩾ P0 /2 > 0. ⊔ ⊓ Theorem 2.4. Let M be a sequentially compact metric space. Then M is compact. Proof. Let {UO ∣ O ∈ / } be an open covering. Lemma 2.2 says that there exists a P > 0 such that B P (x) ⊂ UOx . It is trivial to see that {B P (x) ∣ x ∈ M} is an open covering of M. By Lemma 2.1, there exist x1 , ⋅ ⋅ ⋅ , xn such that ∪ni=1 BP (xi ) ⊃ M. A sub-covering is obtained as {UOx ∣ i = 1, 2, ⋅ ⋅ ⋅ , n}. i
⊔ ⊓
The following proposition is simple but very useful. It says that the continuous image of a compact set is compact.
44
2 Topological Space
Proposition 2.4. Let f : M → N be a continuous mapping, and V ⊂ M be a compact set. Then f (V ) is compact. Proof. Let {UO ∣ O ∈ / } be an open covering of f (V ). Then { f −1 (UO ) ∣ O ∈ / } is an open covering of V . Since V is compact, there is a nite sub-covering { f −1 (UOi ), i = 1, ⋅ ⋅ ⋅ , k} of V . It follows immediately that ∪ki=1UOi ⊃ V.
⊔ ⊓
We know that for a continuous mapping the inverse image of an open (or closed) set remains open (closed respectively). But the continuous inverse image of a compact set is not necessarily compact. For example, f (x) = sin(x) : ℝ → ℝ is continuous and I = [−1, 1] is compact, but f −1 (I) = ℝ is not compact. Denition 2.19. Let f : M → N be a continuous mapping. If for any compact set, V ⊂ M, f −1 (V ) is compact, f is called a proper mapping.
2.4 Quotient Spaces Denition 2.20. Let S be any set and ∼ be a relation between two elements of S. ∼ is said to be an equivalent relation if (i). x ∼ x; (ii). If x ∼ y, then y ∼ x; (iii). If x ∼ y and y ∼ z, then x ∼ z. Denition 2.21. Let M be a topological space, “∼” an equivalent relation on M. 1. For each x ∈ M, an equivalent class, denoted by [x], is dened as [x] = {y ∈ M ∣ y ∼ x} 2. The set of equivalent classes is denoted by M/ ∼, and a mapping S : x → [x] is called the canonical projection. 3. Dene a set of subsets on M/ ∼, called the quotient topology, as T∼ = {U ∈ M/ ∼ ∣ S −1(U) is open in M}. Proposition 2.5. Let M/ ∼ and T∼ be as dened above. Then (M/ ∼, T∼ ) is a topological space, called the quotient space of M with respect to ∼. Proof. We have only to show that T∼ is a topology. Obviously, M/ ∼, ∅ ∈ T∼ . Let UO ∈ T∼ , O ∈ / . Since ∪O ∈/ S −1 (UO ) is open in M and ∪O ∈/ S −1 (UO ) = S −1 (∪O ∈/ UO ), we have ∪O ∈/ UO ∈ T∼ . Let Ui ∈ T∼ , i = 1, ⋅ ⋅ ⋅ , k. Since ∩ki=1 S −1 (Ui ) is open in M and
2.4 Quotient Spaces
45
∩ki=1 S −1 (Ui ) = S −1 (∩ki=1Ui ), we have ∩ki=1Ui ∈ T∼ . ⊔ ⊓
Hence, T∼ is a topology.
If in a topological space M, we have an equivalent relation ∼ such that x ∼ y, it is said that these two points are glued together. Various topological spaces are constructed by gluing certain points together. Example 2.19. Let S be a rectangle on ℝ2 S = [0, 1] × [0, 1] ⊂ ℝ2 . Give ℝ2 the convenient topology and consider S ⊂ ℝ2 as a topological subspace with inherited topology.
Fig. 2.5
Gluing Spaces
1. If we glue the right side with the left side of S, i.e., set (0, y) ∼ (1, y),
0 ⩽ y ⩽ 1.
Then the quotient space S/ ∼ is a cylinder. (Fig. 2.5 (a)) 2. If we glue the right side with the left side of S in reverse way, i.e., set (0, y) ∼ (1, 1 − y),
0 ⩽ y ⩽ 1.
46
2 Topological Space
Then the quotient space S/ ∼ is a strip, which doesn’t have “inside” and “outside”. Intuitively, an ant can move from one side of the strip to another side without crossing the edge. Such a surface is said to be not orientable. This strip is called Mobius strip. (Fig. 2.5 (b)) 3. If we glue the right side with the upper side of S, i.e., set (1, z) ∼ (z, 1),
0⩽z⩽1
and the left side with the lower side of S, i.e., set (0, z) ∼ (z, 0),
0 ⩽ z ⩽ 1.
Then the quotient space S/ ∼ is a sphere. (Fig. 2.5 (c)) 4. If we glue the right side with the left side of S, i.e., set (0, y) ∼ (1, y),
0⩽y⩽1
and the upper side with the lower side of S, i.e., set (x, 0) ∼ (x, 1),
0 ⩽ x ⩽ 1.
Then the quotient space S/ ∼ is a torus. (Fig. 2.5 (d)) 5. If we glue the right side with the left side of S, i.e., set (0, y) ∼ (1, y),
0⩽y⩽1
and the upper side with the lower side of S in a reverse way, i.e., set (x, 0) ∼ (1 − x, 1),
0 ⩽ x ⩽ 1.
Then the quotient space S/ ∼ is such a sealed “bottle” that an ant can move from inside to outside. It is called Klein bottle. (Fig. 2.5 (e)) In fact such a bottle can not be visualized in ℝ3 .
References 1. Abraham R, Marsden J. Foundations of Mechanics. Reading: Benjamin/Cummings Pub. Com. Inc., 1978 2. Choquet G. Topology. New York: Academic Press, 1966. 3. Janich K. Topology. New York: Springer-Verlag, 1984. Translated by Levy S. 4. Scechter M. Principles of Functional Analysis. New York: Academic Press, 1971.
Chapter 3
Differentiable Manifold
This chapter provides an outline of Differential Geometry. First we describe the fundamental structure of a differentiable manifold and some related basic concepts, including mappings between manifolds, smooth functions, sub-manifolds. The concept of ber bundle is also introduced. Then vector elds, their integral curves, Lie derivatives, distributions are discussed intensively. The dual concepts, namely, covector elds, their Lie derivatives with respect to a vector eld, co-distributions and the relations with the prime ones are also discussed. Finally, some important theorems and formulas, such as Frobenius’ theorem, Lie series expansions and Chow’s theorem etc. are presented. This chapter provides a fundamental tool for the analysis of nonlinear control systems.
3.1 Structure of Manifolds Denition 3.1. Let (M, T ) be a second countable, T2 (Hausdorff) topological space. M is called an n dimensional topological manifold if there exists a subset A = {AO ∣ O ∈ / } ⊂ T , such that (i). ∪O ∈/ AO ⊃ M; (ii). For each U ∈ A there exists a homeomorphism I : U → I (U) ⊂ ℝn , which is called a coordinate chart, denoted by (U, I ). Moreover, if (iii). For two coordinate charts: (U, I ) and (V, \ ), if U ∩ V is not empty, then both \ ∘ I −1 : I (U ∩V ) → \ (U ∩V ) and I ∘ \ −1 : \ (U ∩V ) → I (U ∩V ) are Cr (Cf , CZ ). Such two coordinate charts are said to be consistent. (iv). If a coordinate chart, W , is consistent with all charts in A , then W ∈ A . Then (M, T ) is called a Cr (Cf , analytic, respectively) differentiable manifold. Remark 3.1. In fact, (i)–(iii) are enough to determine a differentiable manifold. Condition (iv) is just for convenience in making certain statements. Example 3.1. 1. Any open subset of ℝn is an n-dimensional manifold. 2. Figure “8” in ℝ2 , dened in polar coordinates as F = {(r, T ) ∣ r = ∣ sin(T )∣, 0 ⩽ T ⩽ 2π} is not a manifold, because around the origin, r = 0, it can not be homeomorphic to an open set of ℝ1 . D. Cheng et al., Analysis and Design of Nonlinear Control Systems © Science Press Beijing and Springer-Verlag Berlin Heidelberg 2010
48
3 Differentiable Manifold
Fig. 3.1
Differentiable Manifold
3. S2 is a two dimensional analytic manifold. To see this we may choose six coordinate charts as (Ux+ , Sx+ ), (Ux− , Sx− )(Uy+ , Sy+ ), (Uy− , Sy− ), (Uz+ , Sz+ ), (Uz− , Sz− ), where Ux+ = {(x, y, z) ∈ S2 ∣ x > 0}. ( ) ( ) y Y , (x, y, z)T ∈ Ux+ . = Sx+ (x, y, z) = z Z Then Sx+ (Ux+ ) is an open disk in ℝ2 . Moreover, it is obvious that Sx+ is a homeomorphism and both S and S −1 are analytic. The other ve coordinate charts are dened in a similar way. Recalling with Example 2.19, another set of coordinate charts may be chosen as UN = S2 ∖{N},
US = S2 ∖{S}.
Then dene IN : UN → ℝ2 as {
X = x/(1 − z) Y = y/(1 − z),
and IS : US → ℝ2 as
{
X = x/(1 + z) Y = y/(1 + z)
Therefore, {(UN , IN ), (US , IS )} determines a CZ structure on S2 . Example 3.2. (Grassmann Manifold) Consider the set of k dimensional subspaces in ℝn . We try to “impose” an analytic structure on the set. First, let F(k, n) be a set of bases of the k dimensional subspaces. That is X ∈ F if and only if X = (x1 , ⋅ ⋅ ⋅ , xk ), where xi = (xi1 , ⋅ ⋅ ⋅ , xin )T , i = 1, ⋅ ⋅ ⋅ , k and x1 , ⋅ ⋅ ⋅ , xk are linearly independent. For convenience, we identify each X with an n × k matrix with full column rank. Now it is easily seen that taking xij , i = 1, ⋅ ⋅ ⋅ , k, j = 1, ⋅ ⋅ ⋅ , n as coordinates, F(k, n) can be considered as an open subspace of ℝn×k .
3.1 Structure of Manifolds
49
Let X , Y ∈ F(k, n). It is known that X and Y generate the same subspace if and only if there exists an A ∈ GL(k, ℝ) such that X = YA. Here GL(k, ℝ) is the set of k × k non-singular real matrices. Set an equivalent relation ∼ on F(k, n) as X ∼ Y ⇔ X ∈ Y GL(k, ℝ). Then we can dene the quotient space as G(k, n) = F(k, n)/ ∼ . Then G(k, n) is a well dened topological space. We set a differential structure on G(k, n) in the following way: Since X ∈ F(k, n), it has a k × k non-singular minor, say it consists of the rst k rows. Then ⎞ ⎛ Ik ⎛ 1 ⎞ k ⎟ ⎜ x ⎜ k+1 ⋅ ⋅ ⋅ xk+1 ⎟ (3.1) X ∼ ⎜⎜ . ⎟ . .. ⎠ ⎟ ⎠ ⎝ ⎝ .. x1n ⋅ ⋅ ⋅ xkn Now dene a coordinate chart of G(k, n) as all the equivalent classes [X ] where the rst k rows of X are linearly independent. Then in each equivalent class choose a representation of the form of (3.1). Note that in this chart each [X] has unique representation, we, therefore, can choose I ([X ]) = x1k+1 , x1k+2 , ⋅ ⋅ ⋅ , xkn−1 , xkn as its local coordinates. Choosing k rows from n, we can get totally ( ) n! n N= = k k!(n − k)! such coordinate charts, U i , corresponding to the set of [X] with pre-assigned k linearly independent rows. In this way, we obtain N coordinate charts as (Ui , Ii ). Finally, we have only to show that this is an analytic structure. Let [X] ∈ Ui ∩U j . Then in Ui some required linearly independent rows of X form Ii , that is, I˜i = XA−1 i and the pre-assigned k rows of I˜i forms coordinates Ii , and in U j a certain required linearly independent rows of X form I j , that is, I˜ j = XA−1 j and some other preassigned k rows of I˜ j form coordinates I j . Then the coordinate change: Ii → I j is determined by the transformation mapping
I˜ j = I˜i Ai A−1 j , which is obviously analytic. From the above discussion one sees clearly that the dimension of the Grassmann manifold is dim(G(k, n)) = k(n − k). Denition 3.2. Let M, N be two Cr manifolds with dimensions m, n respectively. F : M → N is called a Cr mapping, if for each x ∈ M and y = F(x) ∈ N there are coordinate charts (U, I ) about x and (V, \ ) about y, such that F˜ = \ ∘ F ∘ I −1
50
3 Differentiable Manifold
is Cr . Moreover, the rank of F at x is dened as the rank of F˜ at I (x). Recall that if a mapping F : ℝm → ℝn is expressed as yi = yi (x1 , ⋅ ⋅ ⋅ , xm ),
i = 1, ⋅ ⋅ ⋅ , n,
then the rank of F at x is dened as ⎛
w y1 w y1 ⋅⋅⋅ w xm ⎜ w x1 ⎜ ⎜ .. rank(F)∣x = rank ⎜ ... . ⎜ ⎝ w yn w yn ⋅⋅⋅ w x1 w xm
⎞ ⎟ ⎟ ⎟ ⎟ . ⎟ ⎠
(3.2)
x
Later on, in most cases we identify F˜ with F when there is no risk of misleading. Denition 3.3. Let N = ℝ. Then a Cr (Cf , CZ ) mapping from M to N = ℝ is called a Cr mapping (Cf mapping, analytic mapping, respectively), denoted by Cr (M)(Cf (M), CZ (M), respectively). Denition 3.4. Let M, N be two differentiable manifolds, and S : M → N a homeomorphism. If both S and S −1 are Cr (Cf , CZ ), then M, N are said to be Cr (Cf , CZ respectively) diffeomorphic, and S is called a Cr (Cf , CZ , respectively) diffeomorphism. Let x ∈ M. If there exist neighborhoods U ∋ x and V ∋ y such that S : U → V with y = S (x) is a diffeomorphism, then M and N are said to be locally diffeomorphic from x to y, and S is called a local diffeomorphism. Example 3.3. Consider an open disk D = {(x, y) ∈ ℝ2 ∣ x2 + y2 < r2 }, and an elliptic disk
} x2 y2 E = (x, y) ∈ ℝ ∣ 2 + 2 < 1 , a b {
2
they are CZ diffeomorphic. A diffeomorphism, F : D → E, can simply dened as ( ) (a) b F1 (x, y) = x, F2 (x, y) = y. r r Note that the same mapping can also be considered as F : w D → w E. Then one sees that the two boundaries are also diffeomorphic. It can be shown that ℝ2 is diffeomorphic to D. But ℝ can never be diffeomorphic to w D because a diffeomorphism is a homeomorphism, but ℝ and w D can not be homeomorphic. Say they have different fundamental groups. (Z for w D and trivial group {e} for ℝ.) Locally, they are diffeomorphic. In fact, ℝ is the covering space of w D. (Refer to Chapter 4 for fundamental group and covering space.)
3.1 Structure of Manifolds
51
Denition 3.5. Let M, N be two differentiable manifolds with dim(M) = m ⩾ n = dim(N) and F : N → M be a smooth injective mapping. Then F : N → N˜ = F(N) ˜ provides an one-to-one correspondence between N and N. 1. When N˜ is endured with the topology of N, it is called an immersed sub-manifold of M. 2. If N˜ is an immersed sub-manifold, and when it is endured with the inherited topology from M, the F : N → N˜ is a homeomorphism, then N˜ is called an embedded sub-manifold. 3. If N ⊂ M and for every p ∈ N there exists a coordinate chart (U, I ), such that ⎧ ⎨I (p) = 0, (3.3) I (U) = {x ∈ ℝn ∣ ∣xi ∣ < H }, ⎩ I (N ∩U) = {x ∈ I (U) ∣ xn+1 = ⋅ ⋅ ⋅ = xm = 0}, then N is called a regular sub-manifold of M. The coordinate frame (3.3) is called a at coordinate system for N. Example 3.4. 1. Consider a mapping F : ℝ → ℝ2 dened as ( ( π) ( ( π ))) F(t) = 2 cos t − , sin 2 t − . 2 2 The image of F is a gure “8”, F is an immerse because rank(F) = 1. But F is not one-to-one. In fact, as t goes over 2π, F(t) runs an “8”. Thus the image is not an immersed sub-manifold. (cf. Fig. 3.2 (a)) 2. Let g(t) : ℝ → (−π, π) be dened as g(t) = 2tan−1 (t). Dene F : ℝ → ℝ2 as ( ( ( ( π ))) π) , sin 2 g(t) + . F(t) = 2 cos g(t) + 2 2 (cf. Fig. 3.2 (b)) Now F(t) draws only one “8”. This time it is one to one. So F(ℝ) is an immersed sub-manifold. But F(ℝ) is not an embedded sub-manifold because if we give F(ℝ) the subspace topology of ℝ2 , then as t = n → f, F(n) → F(0) = 0. It is obvious that F −1 is not continuous. 3. S2 as a subspace of ℝ3 is a regular sub-manifold. To see this we need to nd a at coordinate chart. It is clear that the natural coordinate frame is not a at chart. Now for any p0 ∈ S2 , there is at least one coordinate of p0 , say the z-coordinate, z p ∕= 0. Assume z p > 0, by continuity, there is a neighborhood U ∋ p0 , such 0
0
that z p ∕= 0, ∀p ∈ U. Dene a mapping I : U → ℝ3 as ⎧ ⎨X = x Y =y √ ⎩ Z = z − 1 − x2 − y2 . It is easily seen that the Jacobian of I at p0 is non-singular, then it is a local diffeomorphism. So as U is small enough, I : U → I (U) ⊂ ℝ3 is a diffeomorphism.
52
3 Differentiable Manifold
Then consider (U, I ) as a local coordinate chart, we have S2 ∩U = {p ∈ U ∣ Z(p) = 0}.
Fig. 3.2
Immersion
The essential difference between immersed sub-manifold and embedded submanifold lies on the topology of the subspace. An immersed sub-manifold endures its own topology passed over from the other manifold. Unlike it, an embedded submanifold keeps the subspace topology inherited from its mother’s topology. It is not difcult to see that an immersed sub-manifold is locally an embedded sub-manifold, and an embedded sub-manifold is a regular sub-manifold. [2] Theorem 3.1. Let N, M be two smooth manifolds of dimensions n, m respectively. Suppose a smooth mapping F : N → M has a constant rank, rank(F) = k. Then for any q ∈ F(N), F −1 (q) is an (n − k) dimensional closed regular sub-manifold. Proof. Since the rank of F is k. Let p ∈ N and q = F(p) ∈ M. About p we assume the left upper k × k minor of JF is non-singular. Then we can change the local coordinates about p ∈ N by { X 1 = F 1 (x) X 2 = x2 , dim(X 1 ) = k, dim(X 2 ) = n − k. This is a local coordinate transformation because the assumption assures the Jacobian of the transformation to be locally non-singular. Under this new coordinate frame F becomes { F1 = X1 (3.4) F 2 = F 2 (X 1 ). Note that F 2 depends only on X 1 , otherwise it will violate the rank assumption of F. Now about q = F(p) we change the local coordinates by { Y 1 = y1 (3.5) Y 2 = y2 − F 2 (X 1 (y1 , y2 )), dim(X 1 ) = k, dim(X 2 ) = n − k,
3.2 Fiber Bundle
53
where X 1 = X 1 (y1 , y2 ) is assured by implicit function theorem. Now note that (3.4) yields that on the image of F(N) the F 2 depends on X 1 = y1 only. So
wF2 = O(∥y∥), w y2 which means (3.5) is a local coordinate transformation. Under these new coordinate frames on both sides, we have an expression of F as { Xi , i ⩽ k (3.6) Fi (X1 , ⋅ ⋅ ⋅ , Xn ) = 0, i > k. Now, under new coordinate frames around q and p ∈ F −1 (q) we have F −1 (q) ∩U = {X ∈ U ∣ X1 = ⋅ ⋅ ⋅ = Xk = 0}. Hence F −1 (q) is an (n − k) dimensional regular sub-manifold.
⊔ ⊓
In fact, the expression (3.6) itself is useful. We refer to [9] for detailed constructing process. Example 3.5. Let F : ℝ3 → ℝ be dened as F(x, y, z) =
x2 y2 z2 + + . a2 b 2 c 2
Since JF = (2x, 2y, 2z), for any p ∈ F −1 (1) the rank(JF ) = 1 because x, y, z can not be simultaneously zero. So the ellipsoid F −1 (1) is a regular sub-manifold of ℝ3 of dimension 3 − 1 = 2.
3.2 Fiber Bundle Denition 3.6. A ber bundle consists of three topological spaces: B, M, Y , called the total space, base space, and ber space respectively, and a continuous mapping p : B → M, called the projection, which satisfy the following conditions: (i). p : B → M is surjective (onto). (ii). Yx := p−1 (x), x ∈ M. Then Yx is homeomorphic to Y . Yx is called the bundle over x. (iii). For each point x ∈ M, there is a neighborhood x ∈ U ⊂ M and a homeomorphism h : U × Y → p−1 (U) such that p ∘ h(z, y) = z,
∀z ∈ U, y ∈ Y.
A section is a continuous mapping f : M → B, such that p ∘ f (x) = x. A conventional way to denote a ber bundle is (B, p, M). In fact Y is an interior structure. Example 3.6. 1. Let M and Y be two topological spaces. Dene B = M × Y , and p : M × Y → M is the natural projection. Then (B, p, M) becomes a ber bundle. Such a ber bundle is called a product bundle.
54
3 Differentiable Manifold
Fig. 3.3
Bundle over S2
2. Let M = S2 . At each point p ∈ M a tangent space can be attached, which is ℝ2 . Now on a neighborhood p ∈ U ⊂ M, as U is small enough, we can dene a continuous coordinate frame (Xq , Yq ), say a Cartesian frame on the tangent space Tq . Then t ∈ Tq can be expressed by (xt , yt ) as the projection of t on Xq and Yq respectively. Now locally we can dene a continuous mapping I : U × ℝ2 → U × {(p,t) ∣ p ∈ U,t ∈ Tp } as (u, (x, y)) → (u,t) with t ∈ Tu and tx = x, ty = y. In this bundle, the total space is B = {(u,t) ∣ u ∈ S2 ,t ∈ Tu }, base space is M = S2 , bundle space is Y = ℝ2 . B = {(X,t) ∈ ℝ3 × ℝ3 ∣ X12 + X22 + X32 = 1, t1 X1 + t2 X2 + t3 X3 = 0}. Moreover, if the Cartesian coordinates are used, let Pi = (X i ,t i ) ∈ B, i = 1, 2, and X i = (xi1 , xi2 , xi3 ), t i = (t1i ,t2i ,t3i ). Then the topology over B is deduced from d(P1 , P2 ) = d(X 1 , X 2 ) + d(t 1 ,t 2 ). Denition 3.7. Assume two ber bundles (Bi , pi , M) share the same base space. A continuous mapping ) : B1 → B2 is called a bundle mapping if p1 = p2 ∘ ) , i.e., the graph in Fig. 3.4 is commute. A bundle mapping is called a bundle isomorphism if it is a homeomorphism and its inverse ) −1 is also a bundle mapping.
Fig. 3.4
Bundle Isomorphism
3.2 Fiber Bundle
55
Denition 3.8. A ber bundle (B, p, M) is said to be a k dimensional vector bundle, if its ber space is Y = ℝk , and the homeomorphism h : U ×Y → p−1 (U), restricted to each x ∈ U, as hx : {x} × Y → p−1 (x) is a vector space isomorphism, i.e., hx ∈ GL(k, ℝ). A vector bundle is called a trivial bundle if B ≃ M × Y = M × ℝn . Example 3.7. Consider the second example in Example 3.6. The tangent bundle over S2 is obviously a vector bundle. But it is not a trivial bundle. To see this, assume B ≃ S2 × ℝ2 . Let F : B → S2 × ℝ2 be the homeomorphism. We choose 0 ∕= Y ∈ ℝ2 . Then F −1 (S2 × Y ) is a continuous vector eld, which is nowhere zero. It is well known that this is impossible [2]. Denition 3.9. Let (Bi , pi , M), i = 1, 2, be two vector bundles. The bundle mapping ) : B1 → B2 is called a vector bundle mapping if for each x ∈ M −1 ) : p−1 1 (x) → p2 (x)
is linear. Theorem 3.2. Let (Bi , pi , M), i = 1, 2, be two vector bundles. ) : B1 → B2 is a vector bundle mapping. ) is a bundle isomorphism, if and only if, for each x ∈ M −1 ) : p−1 1 (x) → p2 (x)
is a vector space isomorphism. i.e.,
) ∣ p−1 (x) ∈ GL(k, ℝ). 1
Proof. (Sufciency) Let x ∈ U1 ∩U2 where
Ii : Ui × Y → p−1 i (Ui ),
i = 1, 2
are homeomorphisms respectively. Let U = U1 ∩U2 . Since ) : B1 → B2 is a homeomorphism and by commutativity one sees that
) : I1−1 (U) → I2−1 (U) is a homeomorphism. Restricting it to p−1 1 (x), we have
) : {x} × Y → {x} × Y to be bijective. By denition it is linear. Then it is a linear space isomorphism. That is, ) ∣ p−1 (x) ∈ GL(k, ℝ). 1
(Necessity) We prove it by constructing the inverse, ) −1 . For each x ∈ M since ) ∣ p−1 (x) is a linear isomorphism, let < ∣ p−1 (x) be the inverse of ) ∣ p−1 (x) . Then we 1 2 1 can construct the inverse of ) point-wise as < ∣ p−1 (x) ∈ GL(k, ℝ). Thus it is enough 2 to show that < is continuous.
56
3 Differentiable Manifold
Using the above notations, we have, on U, that
I2−1 )I1 : (x, y) $→ (x, fx (y)), where fx (y) ∈ GL(k, ℝ) is continuous with respect to x. But I1−1< I2 : (x, y) is the point inverse of I2−1< I1 , it can then be expressed as
I1−1< I2 : (x, y) $→ (x, fx−1 (y)), where fx−1 (y) is the matrix inverse of fx (y). Then it is obvious that I1−1< I2 is continuous, and so is < . ⊔ ⊓ For our purpose, the ber bundle, particularly the vector bundle, is used for investigating a manifold and its tangent space. We may replace all the above topological spaces by Cr manifolds and the mappings by Cr mappings. We refer to [6] for further study.
3.3 Vector Field Let M be an n dimensional smooth manifold, x ∈ M. Denote by Cr (M, x) the set of Cr functions dened around x, in other words, over some neighborhoods of x. Let 0 ∈ (a, b) ⊂ ℝ, and T : (a, b) → M be a smooth mapping such that T (t), t ∈ (a, b) is a curve on M with T (0) = x.
Fig. 3.5
Tangent Vector
( ) For any h ∈ Cr (M, x) dene a mapping T∗ dtd : Cr (M, x) → ℝ as: ( ) d d T∗ h = (h ∘ T )∣t=0 dt dt
(3.7)
Intuitively, it seems that this mapping transfers a derivative operator on ℝ to a derivative operator on M. To make it more clear we express it on a coordinate chart. Now on a coordinate chart about x we express T by its components as
T (t) = (T1 (t), ⋅ ⋅ ⋅ , Tn (t))T and h can be expressed as h = h(x1 , ⋅ ⋅ ⋅ , xn ). Then (3.7) is expressed, by using chain rule, as
3.3 Vector Field
( ) n dTi d h= ¦ T∗ dt i=1 dt
t=0
wh . w xi
It is ready to see that under a local coordinate system the operator T∗ ( ) n dTi w d = ¦ T∗ . dt dt w xi i=1
57
(3.8) (d) dt
is (3.9)
t=0
It is also easily seen that (3.8) is ℝ-linear, i.e., ( ) ( ) ( ) d d d (aT1 + bT2 )∗ h = a(T1 )∗ h + b(T2 )∗ h. dt dt dt Hence, under system all the curves, passing x ∈ M, form a vector { a local coordinate } w w space with w x1 , ⋅ ⋅ ⋅ , w xn as a basis. It can be considered as a space of the directional derivatives acting on Cr (M, x). Denition 3.10. For a given point x ∈ M, the vector space of directional derivatives, acting on Cr (M, x), is called the tangent space of M at x and denoted by Tx (M). There are several points that should be claried: First of all, for a given coordinate p p chart (U, I ) we identify a point p ∈ U with I (p) = (x1 , ⋅ ⋅ ⋅ , xn ) ∈ ℝn . For instance, we denote T (t) = (T1 (t), ⋅ ⋅ ⋅ , Tn (t)), in fact it should be I ∘ (T (t)), because only on I (U) ⊂ ℝn the coordinates make sense. This identication, if there is no risk of misleading, is conventional and commonly used. It is known as a local coordinate representation. Similarly, h = h(x1 , ⋅ ⋅ ⋅ , xn ) is a local coordinate representation of h ∘ I −1. Since the denition of tangent space is done under a local coordinate system, to make it uniquely dened we have to prove that it is independent on the choice of the local coordinate frame. i.e., the same T plays the same rule under different coordinate frames. It is easy and left for reader. Under a given coordinate chart, a tangent vector X p ∈ Tp (M) can be expressed as m
X p = ¦ vi i=1
w . w xi
As in Linear Algebra, the basis of vectors may be omitted, so X p can also be briey denoted as a vector: X p = (v1 , ⋅ ⋅ ⋅ , vn )T . Thus, for any h ∈ Cr (M, p), n
X p (h) = ¦ vi i=1
w (h). w xi
Denition 3.11. Let M, N be two smooth manifolds, and F : M → N a smooth mapping. For a point p ∈ M and F(p) ∈ N we dene a mapping F∗ : Tp (M) → TF(p) (N) as
58
3 Differentiable Manifold
F∗ (X p )h = X p (h ∘ F),
X p ∈ Tp (M), h ∈ Cr (N, F(p)).
(3.10)
Next, we want to nd the local coordinate representation of F∗ (X p ), which is particularly important in applications. Let x and y be local coordinates of p ∈ M and F(p) ∈ N respectively. Moreover, X p and F∗ (X p ) are presented as X p = a1
w w + ⋅ ⋅ ⋅ + an , w x1 w xn
F∗ (X p ) = b1
w w + ⋅ ⋅ ⋅ + bn , w y1 w yn
and F : M → N, as x $→ y, is expressed as yi = fi (x1 , ⋅ ⋅ ⋅ , xm ),
i = 1, ⋅ ⋅ ⋅ , n.
Then (3.10) can be expressed as m
F∗ (X p )h = X p (h ∘ F) = ¦ ai w (h ∘ F) w xi i=1 ( ) m n w fj w = ¦ ai ¦ h w y j w xi i=1 j=1 ( ) n m w fj = ¦ ¦ ai w h∣F(p) := w x wyj i j=1 i=1 where
w fj ai , i=1 w xi m
bj = ¦
n
¦ b j wwy j h(y)∣F(p),
j=1
j = 1, ⋅ ⋅ ⋅ , n.
Under the matrix form, this relation can be expressed as ⎡
w f1 w f1 ⋅⋅⋅ w xm b1 ⎢ w x1 ⎢ .. ⎥ ⎢ . .. ⎣ . ⎦=⎢ . ⎢ .. ⎣ bn w fn w fn ⋅⋅⋅ w x1 w xm ⎡
⎤
⎤
⎡ ⎤ ⎥ a1 ⎥ ⎢ . ⎥ ⎥ ⎢ . ⎥, ⎥ ⎣ . ⎦ ⎦ am
(3.11)
p
or briey, F∗ (X p ) = JF (p)X p . Since X p is essentially a directional derivative, it has the characteristic of an ordinary derivative. For instance, starting from the denition we can show easily that if f , g ∈ Cr (M, p) and a, b ∈ ℝ, then { X p (a f + bg) = aX p ( f ) + bX p (g) (3.12) X p ( f g) = X p ( f )g + f X p (g).
3.3 Vector Field
59
In fact, Tp (M) is the set of all mappings Cr (M, p) → ℝ, which satisfy (3.12). We refer to [2] for detail. Now we can put all tangent spaces, passing through different points of M together, and denote it as T (M) = ∪x∈M {(x, Tx (M))}. Over each coordinate chart (U, I ) of M we may dene a mapping < : I (U) × ℝn → T (M) as ( ) n w (x1 , ⋅ ⋅ ⋅ , xn )T × (a1 , ⋅ ⋅ ⋅ , an )T $→ q, ¦ ai , i=1 w xi where (x1 , ⋅ ⋅ ⋅ , xn ) = I (q). Since < is a diffeomorphism from an open set of ℝn × ℝn to T (M), we may consider (< (I (U) × ℝn ), < −1 ) as a coordinate chart of T (M). It is ready to verify that (i). such charts form an open covering of T (M); (ii). if M is a Cr manifold then such charts are Cr compatible. We conclude that if M is an n dimensional Cr manifold then with the structure described above, T (M) is a 2n dimensional Cr manifold. Let p : T (M) → M be the natural projection: (p, Tp ) $→ p. Then (T (M), p, M) becomes a vector bundle. It is known as tangent bundle of M. In many cases, we simply use an alternative expression of T (M), which ignores the rst component formally and indicates it implicitly. Then it is expressed as T (M) = ∪x∈M {Tx (M)}. Unless we emphasize some particular bundle properties, this simple form will be used hereafter. Denition 3.12. A vector eld X on M is a section of the tangent bundle T (M), i.e., X : M → T (M). X is called a Cr vector eld if this section is Cr . Under a local coordinate system X can be expressed as n
X = ¦ ai (x) i=1
w . w xi
By denition, that X is Cr means all ai (x), i = 1, ⋅ ⋅ ⋅ , n are Cr . The set of smooth vector elds on manifold M is denoted by V r (M), where r can be any non-negative integer, or f, or Z . In a situation when the degree of smoothness is not concerned, it may simply be denoted by V (M). Recall that if we have two smooth manifolds M and N and a smooth mapping F : M → N, F∗ can map a tangent vector of M to a tangent vector of N. Precisely, let q ∈ M and F(q) ∈ N, Xq ∈ Tq (M), then F∗ (Xq ) ∈ TF(q) (N) as dened in (3.10), and can be calculated in local coordinate frames by (3.11). Now a natural question is: Can F map a vector eld on M to a vector eld on N? The answer is that this is not always true. We discuss it in the following example.
60
3 Differentiable Manifold
Example 3.8. Consider a vector eld X = (t 2 + 1) dtd on ℝ. Let F : ℝ → ℝ2 be dened as ) ( 1 1 F : t $→ sin πt, cos πt . 2 2 Choosing any t, say t = 1, then F∗ : T1 (ℝ) → T(1,0) (ℝ2 ) maps X ∣t=1 = 2 dtd to ⎡
dF1 dt ⎣ F∗ (Xt=1 ) = dF2 dt
⎤ ⎦
) 0 ∈ T(1,0) (ℝ2 ). = −π (
t=1
For any t we can dene F∗ in the same way. But obviously {F∗ (Xt ) ∣ t ∈ ℝ} is not a vector eld on ℝ2 because it is even not dened everywhere. In general, it is easily seen that if F : M → N is a diffeomorphism and X ∈ V (M), then F∗ (X) is a vector eld on N. Moreover, F∗ (X ) = JF X (∘F −1 ).
(3.13)
(3.13) is just a generalization of (3.11). Example 3.9. Let T ∈ GL(n, ℝ), F : ℝn → ℝn be dened as y = T x. Let X = (v1 (x), ⋅ ⋅ ⋅ , vn (x))T . Then
F∗ (X ) = JF X ∣y=T x = T X(T −1 y).
Particularly, we can let X = (sin(x1 + x2 ), ex1 )T and ] [ 10 . T= 11 Then
][ ] 1 0 sin(x1 + x2 ) 11 e x1 ] [ [ ] y=T x sin(x1 + x2 ) sin y2 . = = y1 ex1 + sin(x1 + x2 ) x=T −1 y e + sin y2 [
F∗ (X) =
3.4 One Parameter Group Denition 3.13. Let T : I → M be a curve on M, with the interval, 0 ∈ I ⊂ ℝ. If there exists a vector eld X ∈ V (M), and x0 ∈ M, such that d T (t) = XT (t) , dt
T (0) = x0
then T (t) is called the integral curve of X with initial value T (0) = x0 . As the solution of an ordinary differential equation T (t) has the following properties:
3.4 One Parameter Group
61
1. T (t) ∘ T (s) = T (t + s); 2. T (−t) ∘ T (t) = T (0) = id, where id is the identity mapping. Hence T (t) forms a group with respect to t. (Precisely, only when I = R, T (t) becomes a group.) This group is called the one parameter group generated by X . To emphasize the dependence of the integral curve on the vector eld, one parameter group can also be denoted by etX (x0 ). When this notation is used, we always assume that t is in the largest interval, 0 ∈ I ⊂ ℝ, such that the integral curve exists. Denition 3.14. A vector eld X ∈ V (M) is said to be complete if it is completely integrable, namely, for any x0 ∈ M the integral curve exists for all t ∈ (−f, f). If a vector eld on ℝn satises the Lipschitz condition, i.e., there exists a K > 0 such that ∥X(x) − X(y)∥ ⩽ K∥x − y∥, ∀x, y ∈ ℝn , then it is complete. For a manifold, if there exists a covering of charts such that the Lipschitz condition is satised with the same K, then X is complete. Lemma 3.1. Let etX (x0 ) be the integral curve of X . Assume there exists a neighborhood U ∋ x0 such that etX (x) is dened on U × I. Then for any t0 ∈ I there exists a neighborhood U0 ∋ x0 such that etX0 : U0 → etX0 (U0 ) is a diffeomorphism. Proof. We start from t = 0. Since eX0 is an identity mapping, there exists an open neighborhood t ∈ I0 such that etX has nonsingular Jacobian matrix at x0 . That is, there exists a neighborhood Ux0 ∋ x0 and I0 ∋ 0 such that for any t ∈ I0 , etX : Ux0 → etX (Ux0 ) is a diffeomorphism. A similar argument shows that for each t ∈ I there exists Uxt ∋ etX (x0 ) and an open t ∈ It such that etX : Uxt → etX (Uxt ) is a diffeomorphism. Now for any T ∈ I, {It ∣ 0 ⩽ t ⩽ T } form an open covering of [0, T ]. Hence there exists a nite subcovering {Iti ∣ i = 1, ⋅ ⋅ ⋅ , k}. Now we can construct { U¯k = Uk , U¯i−1 = Ui−1 ∩ (etXi−1 )−1 (U¯i ) , i = k, k − 1, ⋅ ⋅ ⋅ , 1. Then it is ready to see that for U0 = U¯0 the mapping eXT : U0 → eXT (U0 ) is a diffeomorphism. Not that T ∈ I is chosen arbitrarily, the conclusion follows. ⊔ ⊓ The above Lemma can be visualized as follows: for any x0 ∈ M there exists a neighborhood U0 ∋ x0 and an interval 0 ∈ I0 ⊂ ℝ such that U0 “moves” along the time-axis in a “diffeomorphic” way. It seems like a tube of “ow”. So the set of integral curves are called the ow of X. Proposition 3.1. Let X be a complete vector eld. Then for any xed t ∈ ℝ, etX : M → M, dened as: x $→ etX (x), is a diffeomorphism. Proof. We already know that for any vector X , etX is a local diffeomorphism as long as it is dened. Now etX is dened for any x ∈ M and any t ∈ ℝ. We have only to show that it is one-to-one and onto. One-to-one is from the uniqueness of solution of differential equations. Onto is obvious because for any y ∈ M, etX (eX−t (y)) = y. ⊓ ⊔
62
3 Differentiable Manifold
Note that if M is a compact manifold, then every X ∈ V (M) is complete [2]. Proposition 3.2. Let F : M → N be a diffeomorphism, X ∈ V (M), and etX (x0 ) the integral curve of X with initial condition x(0) = x0 . Then the integral curve of F∗ (X) is the image of the integral curve of X. Precisely, F (X)
et ∗
(F(x0 )) = F ∘ etX (x0 ).
(3.14)
Proof. We have only to prove it over each coordinate chart. In other words, under a local coordinate representation. Using the chain rule we have d d F ∘ etX (x0 ) = JF [etX (x0 )] = JF X (F −1 ) = F∗ (X). dt dt F (X)
As for the initial condition, it is et ∗
(F(x0 )) = F(x0 ).
⊔ ⊓
3.5 Lie Algebra of Vector Fields Recall that a tangent vector X p is an operator acting on Cr (M, p). Now if X ∈ V (M) and f ∈ Cr (M), then X p ∈ Tp (M) and f ∈ Cr (M, p) at every p ∈ M. Hence we can dene the action of X on f in a natural way as [X ( f )] p := X p ( f ). It is obvious that X( f ) is dened everywhere. Moreover, if we express the above equation on a local coordinate frame, say n
X = ¦ vi (x) i=1
w , w xi
f = f (x1 , ⋅ ⋅ ⋅ , xn ),
the action becomes n
X ( f ) = ¦ vi (x) i=1
wf . w xi
It turns out that X ( f ) ∈ Cr−1 (M). Thus a vector eld X can be considered as a mapping X : Cr (M) → Cr−1 (M). Particularly, if r = f or r = Z , it becomes a mapping on Cf (M) (or CZ (M)). Next, we impose an algebraic structure on V (M). First of all, we introduce the concept of Lie algebra. Denition 3.15. A vector space V over ℝ with the product, denoted by [X,Y ], X,Y ∈ V , is called a Lie algebra if for X,Y, Z ∈ V we have (i). [(aX1 + bX2 ),Y ] = a[X1 ,Y ] + b[X2,Y ], a, b ∈ ℝ; (ii). [X ,Y ] = −[Y, X]; (iii). (Jacobi Identity) [X , [Y, Z]] + [Y, [Z, X ]] + [Z, [X,Y]] = 0. The product, [X,Y ], is called Lie bracket. Now consider the set of vector elds V (M). We dene the Lie bracket as
3.5 Lie Algebra of Vector Fields
[X ,Y ] = XY − Y X.
63
(3.15)
That is, for each p ∈ M and h ∈ Crp (M) [X ,Y ] p (h) = X (Y (h)) − Y (X (h))∣ p . It should be shown rst that this is well dened, namely [X,Y ] p ∈ Tp (M), which implies that we have to prove that [X ,Y ] satises (3.12). This is a straightforward computation, and we leave it to reader. Proposition 3.3. Let X, Y ∈ V (M), and under a local coordinate system X = (a1 (x), ⋅ ⋅ ⋅ , an (x))T ,
Y = (b1 (x), ⋅ ⋅ ⋅ , bn (x))T .
Then [X ,Y ] = where
wY wx
and
wX wx
wY wX X− Y, wx wx
(3.16)
are the Jacobian matrices of X and Y respectively.
Proof. Assume n
[X ,Y ] = ¦ ci (x) i=1
w . w xi
(3.17)
Choosing a particular h = x j , then (3.17) provides [X ,Y ](h) = c j (x). On the other hand, by denition [X,Y ](h) = X (Y (h)) − Y (X (h)) n n = ¦ ai (x) w (b j (x)) − ¦ bi (x) w (a j (x)). w xi w xi i=1 i=1 Thus n
c j (x) = ¦ ai (x) i=1
n w b j (x) w a j (x) − ¦ bi (x) , w xi w xi i=1
j = 1, ⋅ ⋅ ⋅ , n.
It is ready to see that (3.16) is the matrix representation of (3.18).
(3.18) ⊔ ⊓
To understand the geometric meaning of the Lie bracket of two vectors, we consider the following case. Let X,Y ∈ V (M). Consider the compounded integral curve: eY−t eX−t eYt etX (x0 ). We may describe this physically as follows: A particle, starting from x0 , moves along the direction of X. After time t, it changes the direction from X to Y and goes along the direction of Y for time t. Then it moves backward on direction of X by the
64
3 Differentiable Manifold
same time period. Finally, backward on direction of Y for still the same length of time. If X and Y are constant vectors, it is obvious that the particle will back to the starting point x0 . But if they are not constant, the end position, xe , may be different from x0 . What is the direction of the particle really goes? Roughly speaking, this direction from x0 to xe is the direction of [X ,Y ]∣x0 . Precisely, ) 1( Y X Y X e−t e−t et et (x0 ) − x0 = [X ,Y ]x0 . 2 t→0 t lim
(3.19)
(3.19) can be proved by using the Taylor expansion etX (x) = x + X(x)t + O(∣t∣2 ) We encourage our readers to show this, as it was commented in [3] that to understand the meaning of Lie bracket you have to do it at least once in your life time. Proposition 3.4. V (M) with Lie bracket dened above is a Lie algebra. Proof. The rst two conditions of Lie algebra follow from denition (3.15) immediately. We prove only the Jacobi identity. Let h ∈ Cr (M), then ([X , [Y, Z]] + [Y, [Z, X ]] + [Z, [X ,Y]])(h) = X (Y Z(h) − ZY (h)) − (Y Z − ZY )X (h) + Y (ZX(h) − XZ(h)) − (ZX − XZ)Y (h) + Z(XY (h) − Y X(h)) − (XY − Y X)Z(h) = 0, ∀h ∈ Cr (M).
⊔ ⊓
Example 3.10. Consider a control system x = f (x) + g(x)u,
x ∈ ℝn ,
(3.20)
where f (x) and g(x) can be considered as vector elds on ℝn . Then the Lie subalgebra of V (ℝn ), generated by f (x) and g(x) is denoted as C = { f (x), g(x)}LA and is called the accessibility Lie algebra [7]. If f (x) = Ax and g(x) = b, where A is an n × n matrix and b ∈ ℝn . The system becomes a linear system. A simple computation shows [ f , g] = −Ab [ f , [ f , g]] = A2 b .. . [ f , ⋅ ⋅ ⋅ , [ f , g] ⋅ ⋅ ⋅ ] = (−1)k Ak b. Note that if the above multi-fold brackets contain more than one b, the resulting vector eld will be zero. So to get non-zero vector elds, we have only to consider brackets with a single b. Then the controllability Lie bracket becomes C = Span{b, Ab, ⋅ ⋅ ⋅ , An−1 b}.
3.6 Co-tangent Space
65
From linear system theory it is known [11] that a linear system is controllable if and only if rank(C) = n. Proposition 3.5. Let X,Y ∈ V (M), p, q ∈ Cr (M). Then [pX, qY ] = pq[X ,Y ] + pX (q)Y − qY (p)X.
(3.21)
Proof. For any h ∈ Cr (M) [pX, qY ]h = pX(qY (h)) − qY (pX(h)) = pX (q)Y (h) + pqX(Y(h)) − qY (p)X(h) − qpY(X (h)) = pq[X ,Y ](h) + pX(q)Y(h) − qY (p)X(h) = (pq[X ,Y ] + pX(q)Y − qY (p)X )(h). ⊔ ⊓
Since h is arbitrary, the conclusion follows.
3.6 Co-tangent Space For a given manifold M and x ∈ M, the tangent space, Tx (M) at x ∈ M is a nite dimensional vector space. So from linear algebra we know that there is a dual space, denoted by Tx∗ (M). Thus we dene Denition 3.16. 1. The co-tangent space of the manifold M is dened as T ∗ (M) = ∪x∈M Tx∗ (M). 2. A co-vector eld I is a mapping that assigns a co-vector I (x) ∈ Tx∗ (M) at each point x ∈ M. 3. A co-distribution Z is an assignment that assigns a subspace Z (x) ⊂ Tx∗ (M) at each point x ∈ M. Z is said to have a constant dimension r if dim(Z (x)) = r, ∀x ∈ M. Example 3.11. 1. In ℝ3 consider two smooth functions h1 (x) = ex1 + sin(x2 ) + x3 ,
h2 (x) = ex1 + cos(x2 ) − x3 .
Then the differentials of hi (x), i = 1, 2, are dh1 (x) = ex1 dx1 + cos(x2 )dx2 + dx3 , dh2 (x) = ex1 dx1 − sin(x2 )dx2 − dx3. We may consider {dxi ∣ i = 1, 2, 3} as the basis, then dhi (x), i = 1, 2, can simply be expressed as a row vectors { dh1 (x) = (ex1 , cos(x2 ), 1), dh2 (x) = (ex1 , − sin(x2 ), −1).
66
3 Differentiable Manifold
Point-wise, dhi (x) are co-vectors in Tx∗ (ℝ2 ). In this way we have dhi ∈ T ∗ (ℝ3 ), i = 1, 2. 2. Using the two functions we can dene a co-distribution Z as
Z = Span{dh1 , dh2 }. Precisely,
Z (x) = Span{dh1 (x), dh2 (x)},
∀x ∈ ℝ3 .
It is easy to show that Z (x) has constant dimension: dim(Z (x)) = 2, ∀x ∈ ℝ2 . Motivated by the above example we choose {dxi , i = 1, ⋅ ⋅ ⋅ , n} as the canonical basis of T ∗ (M) in a coordinate chart. Now if there is a vector eld X(x) = n
n
i=1
i=1
¦ ai (x) wwxi and dh(x) = ¦ wwh(x) xi dxi , then their inner-product is n
⟨dh(x), X(x)⟩ = ¦ ai (x) i=1
w h(x) . w xi
It is exactly the action of X on h(x). A co-vector eld is also called a one form. Using {dxi , i = 1, ⋅ ⋅ ⋅ , n} as the basis of T ∗ (M) in a coordinate chart, a co-vector eld can be expressed as I (x) = n
¦ Ii (x)dxi .
i=1
n
Denition 3.17. A one form I (x) = ¦ Ii (x)dxi is called a closed one form if i=1
w Ii (x) w I j (x) = , wxj w xi
i ∕= j.
(3.22)
I (x) is an exact one form if there exists a smooth function h(x) such that I (x) = dh(x). Theorem 3.3. (Poincare’s Lemma [1]) 1. Locally a closed one form is an exact one form. 2. If M is a simply connected topological space, a closed one form is globally an exact one form.
3.7 Lie Derivatives Denition 3.18. Let F : M → N be a diffeomorphism. 1. For a function f (x) ∈ Cr (N), an induced mapping F ∗ : Cr (N) → Cr (M) is dened by F ∗ ( f ) = f ∘ F ∈ Cr (M).
3.7 Lie Derivatives
67
2. For a vector eld X ∈ V r (M), an induced mapping F∗ : V r (M) → V r (N) is dened by F∗ (X)(h) = X(h ∘ F), ∀h ∈ Cr (N). 3. For a co-vector eld I ∈ V ∗r (N), an induced mapping F ∗ : V ∗r (N) → V ∗r (M) is dened by ⟨F ∗ (I ), X⟩ = ⟨I , F∗ (X)⟩ , ∀X ∈ V r (M). If F is a local diffeomorphism, then the above mappings are locally dened. Denition 3.19. Let X ∈ V (M), f ∈ Cr (M). The Lie derivative of f with respect to X , denoted by LX ( f ), is dened as 1 LX ( f ) = lim [(etX )∗ f (x) − f (x)]. t→0 t
(3.23)
Proposition 3.6. Under the local coordinates Lie derivative (3.23) can be expressed as n
LX ( f ) = ⟨d f , X⟩ = ¦ Xi i=1
wf . w xi
(3.24)
Proof. By denition, (etX )∗ f (x) = f (etX (x)). The Taylor expansion of it with respect to t is ) ( f etX (x) = f (x) + td f ⋅ X (x) + O(t 2). ⊔ ⊓
Plugging it into (3.23) yields (3.24).
Denition 3.20. Let X , Y ∈ V (M). The Lie derivative of Y with respect to X, denoted by adX (Y ), is dened as 1 adX (Y ) = lim [(eX−t )∗Y (etX (x)) − Y (x)]. t→0 t
(3.25)
Proposition 3.7. Under the local coordinates Lie derivative (3.25) can be expressed as adX (Y ) = JY X − JX Y = [X,Y ].
(3.26)
Note that JY denotes the Jacobian of Y , namely, ⎡
w Y1 ⋅ ⋅ ⋅ w Y1 w xn ⎢ w x1 ⎢ .. .. JY = ⎢ . . ⎣ w Yn ⋅ ⋅ ⋅ w Yn w x1 w xn
⎤ ⎥ ⎥ ⎥. ⎦
Proof. Using the Taylor expansion, we have etX (x) = x + (tX) + O(t 2),
(3.27)
Y (etX (x)) = Y (x) + JY (tX) + O(t 2 ).
(3.28)
68
3 Differentiable Manifold
Using (3.27), the Jacobian of eX−t becomes JeX = I − tJX + O(t 2 ).
(3.29)
−t
(3.27)–(3.29) yield (eX−t )∗Y (etX (x)) = (I − tJX + O(t 2 ))(Y (x) + JY (tX) + O(t 2 )) = Y (x) + t(JY X − JX Y ) + O(t 2 ). ⊔ ⊓
Putting it into (3.25) yields (3.26). Denition 3.21. Let X ∈ V (M) and Z to X, denoted by LX (Z ), is dened as
∈ V ∗ (M). The Lie derivative of Z
with respect
1 LX (Z ) = lim [(etX )∗ Z (etX (x)) − Z (x)]. t→0 t
(3.30)
Proposition 3.8. Under the local coordinates Lie derivative (3.27) can be expressed as LX (Z ) = (JZ T X )T + Z JX .
(3.31)
Proof. Mimicing the proof of Proposition 3.7, we use the Taylor expansion to get (etX )∗ Z (etX (x)) = (Z (x) + t(JZ T X )T + O(t 2 ))(I + tJX + O(t 2 )) = Z (x) + t(JZ T X )T + t Z (x)JX + O(t 2 ),
where the transpose comes from the convention that under local coordinates a covector eld is expressed as a row. Putting it into (3.30), equation (3.31) follows. ⊓ ⊔ The geometric meaning of Lie derivative adXY is the varying rate of a vector eld Y along the integral curve of X . Fig. 3.6 gives such a description. For a function h and a co-vector eld Z , the corresponding Lie derivatives LX ( f ), and LX (Z ) respectively, have a similar meaning.
Fig. 3.6
Lie Derivative adXY
Some useful formulas are collected in the following:
3.7 Lie Derivatives
69
Proposition 3.9. Let p, q, h ∈ Cr (M), X, Y ∈ V (M), Z ∈ V ∗ (M). Then 1. (Leibnitz Equality) LX ⟨Z ,Y ⟩ = ⟨LX Z ,Y ⟩ + ⟨Z , LX Y ⟩ .
(3.32)
L pX (qZ ) = pqLX (Z ) + pLX (q)Z + q ⟨Z , X⟩ dh.
(3.33)
LX (Z ) = d ⟨ Z , X ⟩ .
(3.34)
2.
3. If Z = dh, then
Proof. 1. First, we prove a formula that itself is useful: d ⟨Z , X⟩ = X T
wX wZ +Z . wx wx
(3.35)
Since n
d ⟨Z , X⟩ = d ¦ Zi Xi i=1
=
n
¦
i=1
(
n
¦ ww Zx ji j=1
)
n
xi + ¦
i=1
(
n
¦ ww Xx ji j=1
)
Zi .
Put RHS into a matrix form. The RHS of (3.35) follows. Using (3.35) to (3.32): ) ( LHS = ⟨d ⟨Z ,Y ⟩ , X ⟩ = Y T w Z + Z w Y X wx wx w w Z Y T X +Z X. =Y wx wx ) ( ( )T w X T wZ Y + Z w Y X − Z w X Y. +Z RHS = X wx wx wx wx It follows that LHS=RHS. 2.
(
w qZ wx
)T
w pX wx [ )T ] ) ( ( = pX T (dq)T Z + w Z q + qZ p w X + X dp wx wx
L pX (qZ ) =
pX T
+ qZ
= pqLX (Z ) + pLX (q)Z + q ⟨Z , X⟩ dp. 3. Using (3.35) again, we have d ⟨Z , X⟩ = d ⟨dh, X⟩ = X T
w (dh) wX wX + dh = X T Hess(h) + dh . wx wx wx
70
3 Differentiable Manifold
Since Hess(h) is symmetric, the above becomes
wX = X (Hess(h)) + dh wx T
(
T
w (dh) X wx
)T + dh
wX = LX dh. wx
⊔ ⊓
3.8 Frobenius’ Theory Denition 3.22. 1. A distribution D is involutive if for any two vectors X,Y ∈ D we have [X,Y ] ∈ D,
∀X,Y ∈ D.
(3.36)
2. A sub-manifold S is called the integral manifold of a given distribution D if for each x ∈ S its tangent space is D, i.e., Tx (S) = D(x),
∀x ∈ S.
If a distribution D(x) has its integral manifold, it is said to be integrable. Frobenius’ Theorem is a fundamental tool in the application of Differential Geometry to nonlinear system analysis and control design. To present this theorem, we need some preparations. Lemma 3.2. Let X ∈ V 1 (M) be a C1 vector eld and F : M → M be a diffeomorphism. X is F invariant (i.e., F∗ (X(p)) = X (F(p))), if and only if F(etX (x)) = etX (F(p)).
(3.37)
Proof. (Necessity) Assume X is F invariant. Using the chain rule, we have d X (p)) = J d eX (p) F dt t dt (F ∘ et = JF X (etX (p)) = F∗ (X (F −1 ∘ etX (p)))
(3.38)
= X (etX (p)). But the integral curve of X (etX (p)) is etX (p), the uniqueness of solution of a differential equation assures (3.37). (Sufciency) Assume (3.37). Differentiating both sides yields F∗ (X(etX (p))) = X (etX (F(p))). Setting t = 0 yields
F∗ (X(p)) = X (F(p)).
⊔ ⊓
Lemma 3.3. Let X and Y be two C1 vector elds in M. Then [X,Y ] = 0 if and only if for each point p ∈ M there exists a G p > 0 such that etX ∘ eYs (p) = eYs ∘ etX (p),
∣s∣, ∣t∣ < G p .
(3.39)
3.8 Frobenius’ Theory
71
Proof. (Sufciency) (3.39) means that Y is etX invariant and X is eYt invariant. It follows that there exists a neighborhood V of p such that for q ∈ V , 1 1 [X ,Y ]q = lim ((eX−t )∗ (Y (etX (q)) − Y (q)) = lim (Y (q) − Y (q)) = 0. t→0 t t→0 t (Necessity) Assume [X,Y ] = 0. Set q′ = etX (q) and let
Tq (t) = (eX−t )∗ (Y (etX (q)). Then
Tq (t) = lim 1 [(eX−t+δt (q))∗ (Y (eXδt (q′ )) − (eX−t )∗ (Y (q′ ))] δt→0 δt = (eX−t )∗ ( lim 1 (eX−δt )∗ (Y (eXδt (q′ )) − Y (q′ ))) δt→0 δt = (eX−t )∗ ([X ,Y ]q′ ) = 0.
That is, Tq (t) is constant for t < G and q ∈ V , which means Y is etX invariant. (3.39) follows from Lemma 3.2. ⊔ ⊓ Theorem 3.4. (Frobenius’ Theorem) A distribution D is integrable if and only if it is involutive and has constant dimension. Proof. (Necessity) Assume D is integrable around p, then there exists an integral manifold S of D passing through x0 such that Tp (S) = D(p). Since S is a submanifold, there exists a local coordinate chart (U, x) with p ∈ U such that S = {x ∈ U ∣ xk+1 = ⋅ ⋅ ⋅ = xn = 0}. {
Then it is clear that D = Span
w w ,⋅⋅⋅ , w x1 w xk
} .
The necessity follows. (Sufciency) Assume dim(D) = k. For a given p ∈ M, there exists a neighborhood of p, say V , in which we can nd a local basis: X1 , ⋅ ⋅ ⋅ , Xk such that D(q) = Span{X1 (q), ⋅ ⋅ ⋅ , Xk (q)},
q ∈ V.
Without loss of generality we may assume the upper k × k block of the matrix X (q) = (X1 (q), ⋅ ⋅ ⋅ , Xk (q)), denoted by Q(q), is nonsingular. Then dene −1
Y (q) = X(q)(Q(q))
( ) I := (Y1 (q), ⋅ ⋅ ⋅ ,Yk (q)) = k . ∗
Since D is involutive, [Yi ,Y j ] =
k
¦ cs (q)Ys .
s=1
(3.40)
72
3 Differentiable Manifold
Using formula (3.26), we have
( ) 0 . [Yi ,Y j ] = ∗
(3.41)
Putting (3.40) and (3.41) together, it is clear that [Yi ,Y j ] = 0,
0 ⩽ i, j ⩽ k.
That is, (Y1 , ⋅ ⋅ ⋅ ,Yk ) is a commutative basis of D. Now we can choose Yk+1 , ⋅ ⋅ ⋅ ,Yn such that (Y1 (q), ⋅ ⋅ ⋅ ,Yn (q)) is a basis of Tq (M), q ∈ V . Then we can nd a G > 0 and dene the mapping
) (y1 , ⋅ ⋅ ⋅ , yn ) = eYy11 ⋅ ⋅ ⋅ eYynn (p),
∣yi ∣ < G , i = 1, ⋅ ⋅ ⋅ , n.
(3.42)
Since the Jacobian matrix J) (0) = In is nonsingular, so ) denes a local diffeomorphism from a neighborhood of 0 ∈ ℝn to a neighborhood of p ∈ M. By denition
w) = Y1 (eYy11 ⋅ ⋅ ⋅ eYynn (p)). w y1
(3.43)
Y
Since eYyii and ey jj are exchangeable, exchanging eYy11 with eYyii in the right side of (3.42) yields that
w) = Yi (eYy11 ⋅ ⋅ ⋅ eYynn (p)), w yi
i = 1, ⋅ ⋅ ⋅ , k.
(3.44)
That is, in new coordinate frame y, Yi = Gi , i = 1, ⋅ ⋅ ⋅ , k. Therefore S = {y ∈ V ∣ yk+1 = 0, ⋅ ⋅ ⋅ , yn = 0} ⊔ ⊓
is an integral manifold of D. Remark 3.2.
1. Frobenius’ theorem also claims that if the distribution is involutive and with constant dimension, there exists a unique largest integral sub-manifold through each x ∈ M [2]. 2. A generalized version of the Frobenius’ theorem says that if the manifold is analytic and the distribution is also analytic, then the integral sub-manifold exists without the assumption of constant dimension [10].
3.9 Lie Series, Chow’s Theorem In this section all the manifolds, functions, vector elds, and co-vector elds are assumed to be analytic. Proposition 3.10. Let X, Y ∈ V Z (M), h ∈ CZ (M), Z ∈ V ∗ (M). Then 1. d h(eX (x)) = LX h(etX (x)). dt t
(3.45)
3.9 Lie Series, Chow’s Theorem
73
2. (Lie Series of Smooth Functions) h(etX (x)) =
f
tk k ¦ LX h(x). k=0 k!
(3.46)
3. (Lie Series of Vector Fields) f
(eX−t )∗Y (etX (x)) =
tk k ¦ adX Y (x). k=0 k!
(etX )∗ Z (etX (x)) =
¦ k! LkX Z (x).
(3.47)
4. (Lie Series of Forms) f
tk
(3.48)
k=0
Lie series (3.46)–(3.48) are also called the Campbell-Baker-Hausdorff formulas. Proof. 1. Using the chain rule, we have LHS = dh
d X (e (x)) = dhX(etX (x)) = LX h(etX (x)). dt t
2. Using (3.45) recursively, we have dk h(eX (x))∣t=0 = LkX h(etX (x)), dt k t
k ⩾ 0.
(3.49)
Now (3.46) can be obtained by the Taylor expansion with respect to t. 3. We rst work out the derivatives with respect to t. d X X dt (e−t )∗Y (et (x)) 1 [(eX X X X = lim 't −t−'t )∗Y (et+'t (x)) − (e−t )∗Y (et (x))] 't→0
1 [(eX ) (eX ) Y (eX (x)) − (eX ) Y (eX (x))] = lim 't −t ∗ t −'t ∗ −t ∗ t+'t 't→0 X X X X X = (e−t )∗ lim [(e−'t )∗Y (e't et (x)) − Y (et (x))] 't→0
= (eX−t )∗ adX Y (etX (x)). It follows recursively that k−1 dk (eX ) Y (x)∣ X ∗ t=0 = (et )∗ adX Y (x)∣t=0 dt k t = adkX Y (x), k ⩾ 0.
(3.50)
Again a Taylor expansion yields (3.47). 4. The proof for (3.48) is basically the same and can be done in a similar way. Since d X ∗ (e ) Z (etX (x)) = (etX )∗ LX Z (etX (x)), dt t
74
3 Differentiable Manifold
dk X ∗ (e ) Z (etX (x)) = (etX )∗ LkX Z (etX (x)), dt k t hence dk X ∗ X (e ) Z (et (x)) = LkX Z (x). dt k t t=0 Using the Taylor expansion yields (3.48). ⊔ ⊓ Corollary 3.1. f
t k+1 k LX (X(x)). k=1 (k + 1)!
etX (x) = x + tX(x) + ¦
(3.51)
Proof. Applying (3.46) for coordinate function xi , one sees f
tk k LX (xi ). k=2 k!
xi (etX (x)) = xi + tLX (xi ) + ¦
Note that LX (xi ) = Xi , which is the i-th component of X . Replacing LkX (xi ), k ⩾ 2 by Lk−1 (Xi ) and arranging n components together, we have (3.51). ⊔ ⊓ Let H be a real subspace of V (M), generated by a set of vector elds over ℝ. A curve V (t), 0 ⩽ t ⩽ 1 is called the integral curve of H if d V (t) ∈ HV (t) , dt
0 ⩽ t ⩽ 1.
Let p ∈ M. The reachable set of H from p, denoted by R(H, p), is the set of points, x ∈ M, for which there exists an integral curve V such that V (0) = p and V (1) = x. Theorem 3.5. (Chow’s Theorem) Let H be a set of completely integrable vector elds, L(H) be the Lie algebra generated by H, and M be path-wise connected. If L(H) = V (M) (under the sense of distribution), then R(H, p) = M. Proof. If [H, H] ⊂ H, we are done. Otherwise there exists at lease a pair of vector elds X,Y ∈ H, such that (eYt )∗ X ∕∈ H for some t. Add (eYt )∗ X into H to get a new vector space, H1 . Replace H by H1 , either [H1 , H1 ] ⊂ H1 , or we can generate H2 . We make three claims: Fact 1: Hk ⊂ L(H). This fact follows from Lie series (3.47). Fact 2: For each x ∈ M there exists a nite k < n such that Hk ∣x = Vx (M). It is obvious because dimVx (M) = n and each time we at least raise the dimension by 1. Fact 3: If X, Y are completely integrable, then so is (etX )∗Y . Therefore, etX is a global diffeomorphism (∀t), and then [(etX )∗Y ]
etX eYs (x) = es
(etX (x)).
(3.52)
Now since M is path-wise connected, there exists a path V (t), 0 ⩽ t ⩽ 1. such that V (0) = p and V (1) = x. According to Fact 2, for each t there exist n vectors X1 , ⋅ ⋅ ⋅ , Xn in Hk such that dimHk (V (t)) = n. Then n
exp(ti Xi )(V (t)) i=1
3.10 Tensor Field
75
is a local diffeomorphism from a neighborhood of 0 ∈ ℝn to a neighborhood of V (t). Moreover, by (3.52) this diffeomorphism can be realized by the integral curves of the vector elds in H. In other words, R(H, V (t)) contains a neighborhood of V (t). Now V (t), 0 ⩽ t ⩽ 1 is a compact set, it can be covered by nite R(H, V (ti )), i = 1, ⋅ ⋅ ⋅ , m < f. We conclude that x ∈ R(H, p). ⊔ ⊓
3.10 Tensor Field Let V be an n dimensional vector space. A mapping I : V × ⋅ ⋅ ⋅ × V → ℝ is called a / 01 2 k
multi-linear mapping, if it satises (i).
I (X1 , ⋅ ⋅ ⋅ , cXr , ⋅ ⋅ ⋅ , Xk ) = cI (X1 , ⋅ ⋅ ⋅ , Xr , ⋅ ⋅ ⋅ , Xk ); (ii).
I (X1 , ⋅ ⋅ ⋅ ,Yr + Zr , ⋅ ⋅ ⋅ , Xk ) = I (X1 , ⋅ ⋅ ⋅ ,Yr , ⋅ ⋅ ⋅ , Xk ) + I (X1 , ⋅ ⋅ ⋅ , Zr , ⋅ ⋅ ⋅ , Xk ). Let {e1 , ⋅ ⋅ ⋅ , en } be a basis of V . The dual space of V is denoted by V ∗ . A basis of V ∗ , denoted by {d 1 , ⋅ ⋅ ⋅ , d n }, is called the dual basis of {ei }, if it satises { 1, i = j i d (e j ) = 0, i ∕= j. Denition 3.23. A multi-linear mapping I :
I:V × ⋅ ⋅ ⋅ × V ×V ∗ × ⋅ ⋅ ⋅ × V ∗ → ℝ / 01 2 / 01 2 r
s
is called an (r, s)-order tensor on V , where r is called the covariant order, and s is called the contra-variant order. The set of (r, s)-order tensors is denoted by Tsr (V ). Denote by
,ir j1 js J ij11,⋅⋅⋅ ,⋅⋅⋅ , js = I (ei1 , ⋅ ⋅ ⋅ , eir , d , ⋅ ⋅ ⋅ , d ),
where 1 ⩽ i1 , ⋅ ⋅ ⋅ , ir ⩽ r, 1 ⩽ j1 , ⋅ ⋅ ⋅ , js ⩽ s. We construct a matrix, called the structure matrix of I as ⎡ 11⋅⋅⋅1 11⋅⋅⋅n ⋅ ⋅ ⋅ J nn⋅⋅⋅1 ⋅ ⋅ ⋅ J nn⋅⋅⋅n ⎤ J11⋅⋅⋅1 ⋅ ⋅ ⋅ J11⋅⋅⋅1 11⋅⋅⋅1 11⋅⋅⋅1 .. .. .. ⎥ ⎢ .. ⎢ . . . . ⎥ ⎢ 11⋅⋅⋅1 ⎥ 11⋅⋅⋅n nn⋅⋅⋅1 nn⋅⋅⋅n ⎥ ⎢J ⎢ 11⋅⋅⋅n ⋅ ⋅ ⋅ J11⋅⋅⋅n ⋅ ⋅ ⋅ J11⋅⋅⋅n ⋅ ⋅ ⋅ J11⋅⋅⋅n ⎥ ⎢ .. .. .. ⎥ * = ⎢ ... (3.53) . . . ⎥ ⎢ ⎥ 11⋅⋅⋅1 11⋅⋅⋅n nn⋅⋅⋅1 nn⋅⋅⋅n ⎢J ⎥ ⎢ nn⋅⋅⋅1 ⋅ ⋅ ⋅ Jnn⋅⋅⋅1 ⋅ ⋅ ⋅ Jnn⋅⋅⋅1 ⋅ ⋅ ⋅ Jnn⋅⋅⋅1 ⎥ ⎢ . ⎥ . . . .. .. .. ⎦ ⎣ .. 11⋅⋅⋅1 ⋅ ⋅ ⋅ J 11⋅⋅⋅n ⋅ ⋅ ⋅ J nn⋅⋅⋅1 ⋅ ⋅ ⋅ J nn⋅⋅⋅n Jnn⋅⋅⋅n nn⋅⋅⋅n nn⋅⋅⋅n nn⋅⋅⋅n
76
3 Differentiable Manifold n
Let X ∈ V be a column vector. We denote it as X = (a1 , ⋅ ⋅ ⋅ , an )T , i.e., X = ¦ ai ei . Similarly, Z ∈ V ∗ can be denoted as Z = (b1 , ⋅ ⋅ ⋅ , bn ), i.e., Z =
n
i=1
¦ bi d i . Then the
i=1
tensor value can be obtained as
I (X1 , ⋅ ⋅ ⋅ , Xr , Z1 , ⋅ ⋅ ⋅ , Zs ) = Zs ⋉ ⋅ ⋅ ⋅ ⋉ Z1 ⋉ * ⋉ X1 ⋉ ⋅ ⋅ ⋅ ⋉ Xr .
(3.54)
We refer to the Appendix for “ ⋉ ”, which is the symbol for semi-tensor product of matrices. Denition 3.24. Let I ∈ Tsr (V ) and \ ∈ Tqp (V ). Then their tensor product, I ⊗ r+p \ ∈ Ts+q (V ), is dened as
I ⊗ \ (X1 , ⋅ ⋅ ⋅ , Xr+p , Z1 , ⋅ ⋅ ⋅ , Zs+q ) = I (X1 , ⋅ ⋅ ⋅ , Xr , Z1 , ⋅ ⋅ ⋅ , Zs )\ (Xr+1 , ⋅ ⋅ ⋅ , Xr+p , Zs+1 , ⋅ ⋅ ⋅ , Zs+q ). It is easy to prove the following Proposition 3.11. Let I and \ have the structure matrices MI and M\ respectively. Then the structure matrix of I ⊗ \ is MI ⊗\ = MI ⊗ M\ .
(3.55)
Two important special cases are that the covariant order r = 0 and that contravariant order s = 0. They are simply denoted by T r (V ) and Ts (V ) respectively. Next, we consider T r (V ) . Denition 3.25. I ∈ T r (V ) is called a symmetric covariant tensor, if
I (X1 , ⋅ ⋅ ⋅ , Xi , ⋅ ⋅ ⋅ , X j , ⋅ ⋅ ⋅ , Xr ) = I (X1 , ⋅ ⋅ ⋅ , X j , ⋅ ⋅ ⋅ , Xi , ⋅ ⋅ ⋅ , Xr ), X1 , ⋅ ⋅ ⋅ , Xr ∈ V. I is called a skew-symmetric covariant tensor, if
I (X1 , ⋅ ⋅ ⋅ , Xi , ⋅ ⋅ ⋅ , X j , ⋅ ⋅ ⋅ , Xr ) = −I (X1 , ⋅ ⋅ ⋅ , X j , ⋅ ⋅ ⋅ , Xi , ⋅ ⋅ ⋅ , Xr ), X1 , ⋅ ⋅ ⋅ , Xr ∈ V. Denote by S k (V ) ⊂ T k (V ) the set of k-th order symmetric covariant tensors and : k (V ) ⊂ T k (V ) the set of k-th order skew-symmetric covariant tensors. We consider the skew-symmetric case rst. We have
: k (V ) = {0},
k > n.
To prove this, consider a skew-symmetric tensor I , if Xi = X j then
I (X1 , ⋅ ⋅ ⋅ , Xi , ⋅ ⋅ ⋅ , X j , ⋅ ⋅ ⋅ , Xr ) = −I (X1 , ⋅ ⋅ ⋅ , X j , ⋅ ⋅ ⋅ , Xi , ⋅ ⋅ ⋅ , Xr ) = −I (X1 , ⋅ ⋅ ⋅ , Xi , ⋅ ⋅ ⋅ , X j , ⋅ ⋅ ⋅ , Xr ). Therefore, it is zero. Now if r > n, let Xi be a vector from a basis {e1 , ⋅ ⋅ ⋅ , en }, it is obvious that I (ei1 , ⋅ ⋅ ⋅ , eir ) = 0. By multi-linearity I (X1 , ⋅ ⋅ ⋅ , Xr ) is a linear combination of I (ei1 , ⋅ ⋅ ⋅ , eir ), it is zero. Hence we have
3.10 Tensor Field
77
: (V ) = : 0 (V ) ⊕ : 1 (V ) ⊕ ⋅ ⋅ ⋅ ⊕ : n (V ), which is the space of skew-symmetric tensors, where : 0 (V ) := ℝ. Denition 3.26. A symmetric mapping P : T r (V ) → S r (V ) is dened as P(I )(X1 , ⋅ ⋅ ⋅ , Xr ) =
1 (XV (1) , ⋅ ⋅ ⋅ , XV (r) ). r! V¦ ∈Sr
A skew-symmetric mapping A : T r (V ) → : r (V ) is dened as A (I )(X1 , ⋅ ⋅ ⋅ , Xr ) =
1 sgn(V )(XV (1) , ⋅ ⋅ ⋅ , XV (r) ), r! V¦ ∈Sr
where the summation is over the k-th order symmetric group Sk . Proposition 3.12. Let V be an n dimensional vector space. Then the dimension of : (V ) is dim(: (V )) = 2n .
(3.56)
Proof. Note that I ∈ T k (V ) is determined uniquely by
I (ei1 , ⋅ ⋅ ⋅ , eik ),
1 ⩽ i1 < i2 < ⋅ ⋅ ⋅ < ik ⩽ n.
In other words, {
) } ( A d i1 ⊗ ⋅ ⋅ ⋅ ⊗ d ik 1 ⩽ i1 < i2 < ⋅ ⋅ ⋅ < ik ⩽ n
is a basis of T k (V ). Hence dim(: k (V )) =
(k ) n
. The conclusion follows.
⊔ ⊓
The wedge product is particularly important in tensor analysis. Denition 3.27. Let I ∈ : r (V ) and \ ∈ : s (V ). The wedge product, ∧ : I ∧ \ , is dened as
I ∧\ =
(r + s)! A (I ⊗ \ ) ∈ : r+s (V ). r!s!
(3.57)
The following properties are immediate consequences of the denition. Proposition 3.13. 1. (Bi-linearity)
I ∧ (\1 + \2 ) = I ∧ \1 + I ∧ \2 .
(3.58)
I ∧ (\ ∧ K ) = (I ∧ \ ) ∧ K .
(3.59)
2. (Associativity)
78
3 Differentiable Manifold
3. If I ∈ : r (V ) and \ ∈ : s (V ), then
I ∧ \ = (−1)rs \ ∧ I .
(3.60)
4. Let Ii ∈ : ri (V ), i = 1, ⋅ ⋅ ⋅ , k. Then
I1 ∧ ⋅ ⋅ ⋅ ∧ Ir =
(r1 + ⋅ ⋅ ⋅ + rk )! A (I1 ⊗ ⋅ ⋅ ⋅ ⊗ Ik ). r1 !r2 ! ⋅ ⋅ ⋅ rk !
(3.61)
Next, we dene the tensor eld on a manifold. Denition 3.28. On a Ck manifold M, a Ck tensor eld I (x) ∈ Tsr (M) is a rule that assigns for each point x0 ∈ M a tensor I (x0 ) ∈ Tsr (Tx0 (M)), such that for any sets of Ck vectors X1 (x), ⋅ ⋅ ⋅ , Xr (x) and any co-vectors Z1 (x), ⋅ ⋅ ⋅ , Zs (x) the mapping
I (X1 (x), ⋅ ⋅ ⋅ , Xr (x), Z1 (x), ⋅ ⋅ ⋅ , Zs (x)) is a Ck function. Similar to tensors, for tensor elds we can dene symmetry, skew-symmetry, etc. The tensor product and wedge product can also be well dened by using point-wise denition. Locally, in an n dimensional manifold M, let a coordinate chart be (U, x). Then the natural basis of Tx (M) is { wwx ∣i = 1, ⋅ ⋅ ⋅ , n}, and its dual basis is {dxi ∣i = i 1, ⋅ ⋅ ⋅ , n}. Skew-symmetric tensor elds are important both in theory and applications. A natural basis of : k (M) is { } dxi1 ∧ ⋅ ⋅ ⋅ ∧ dxik 1 ⩽ i1 < ⋅ ⋅ ⋅ < ik ⩽ n . A tensor eld Z ∈ : k (M) is called a k-form. It is obvious that the set of n forms has dim(: n (M)) = 1. An n-form can be used to orient the manifold. Denition 3.29. A manifold M is said to be orientable, if there is a Cr n-form Z , such that Z (p) ∕= 0, ∀p ∈ M. We refer to [2] for more about the orientation of manifolds. Finally, we dene the external differential. It is well known that for a smooth function h ∈ Cr (M) = : 0 (M), its differential is a mapping d : h $→ dh, which is an ℝ linear mapping from : 0 (M) to : 1 (M). In general, we dene an ℝ linear mapping d : Ck (M) → Ck+1 (M) as follows, which is called an external differential: Let Z = a(x)dxi1 ∧ ⋅ ⋅ ⋅ ∧ dxik , and dZ = da(x) ∧ dxi1 ∧ ⋅ ⋅ ⋅ ∧ dxik .
(3.62)
Since d is ℝ linear, the mapping is uniquely determined by (3.62). Theorem 3.6. 1. d2 Z = 0;
(3.63)
3.11 Riemannian Geometry
79
2. Let T ∈ : r (M) and Z ∈ : s (M). Then d(T ∧ Z ) = dT ∧ Z + (−1)r T ∧ dZ .
(3.64)
Proof. Without loss of generality, we assume Z has only one term, i.e., Z = a(x)dxi1 ∧ ⋅ ⋅ ⋅ ∧ dxis . Then d2 Z =
w 2 a(x) k dx ∧ dx j ∧ dxi1 ∧ ⋅ ⋅ ⋅ ∧ dxis . j k j,k∕=i1 ,⋅⋅⋅ ,is w x w x
¦
= wwxka(x) and dxk ∧ dx j = −dx j ∧ dxk , (3.63) follows immediately. To Since wwx ja(x) w xk wxj prove (3.64), let T = a(x)dxi1 ∧ ⋅ ⋅ ⋅ ∧ dxir and Z = b(x)dx j1 ∧ ⋅ ⋅ ⋅ ∧ dx js , assume 2
2
i p ∕= jq ,
p = 1, ⋅ ⋅ ⋅ , r, q = 1, ⋅ ⋅ ⋅ , s.
Otherwise, both sides of (3.64) become zero and the equality is trivial. Then
= =
Z) d(T ∧ (
) b w at + a w bt dxt ∧ dxi1 ∧ ⋅ ⋅ ⋅ ∧ dxir ∧ dx j1 ∧ ⋅ ⋅ ⋅ ∧ dx js wx wx
¦
t∕=i p , j q
¦
t∕=i p , j q
+
w a dxt ∧ dxi1 ∧ ⋅ ⋅ ⋅ ∧ dxir ∧ bdx j1 ∧ ⋅ ⋅ ⋅ ∧ dx js w xt
¦p q a wwxbt dxt ∧ dxi1 ∧ ⋅ ⋅ ⋅ ∧ dxir ∧ dx j1 ∧ ⋅ ⋅ ⋅ ∧ dx js
t∕=i , j
= bdT ∧ Z + (−1)r adxi1 ∧ ⋅ ⋅ ⋅ ∧ dxir
¦
t∕=i p , j q
w b dxt ∧ dx j1 ∧ ⋅ ⋅ ⋅ ∧ dx js w xt ⊔ ⊓
= dT ∧ Z + (−1)r T ∧ dZ .
3.11 Riemannian Geometry When r = 2, the tensor eld I (x) ∈ T 2 (M) is a quadratic form. Under a local coordinate frame it can be expressed as
I (X,Y ) = X T (x)MI (x)Y (x),
X(x),Y (x) ∈ V (M),
where MI (x) is the matrix representation of I , and its entries are ) ( w w i, j . MI (x) = I (x) , w xi w x j The tensor eld I (x) is symmetric (skew-symmetric), if and only if MI (x) is a symmetric (skew-symmetric) matrix. If I (x)(X , X) ⩾ 0, and I (X(x), X (x)) = 0, if and only if X(x) = 0, ∀x ∈ M, then I (x) is positive denite. It is obvious that I (x) is positive denite if and only if MI (x) is a positive denite matrix.
80
3 Differentiable Manifold
Denition 3.30. A Cf manifold M with a symmetric tensor eld I ∈ T 2 (M) is called a pseudo-Riemannian manifold. If, in addition, I is positive denite, (M, I ) is called a Riemannian manifold. Let M be a Riemannian manifold. A smooth curve L is a mapping L : [a, b] → M. The length of L is dened as √ ( ) ∫ b dL dL I , dt. (3.65) ∣L∣ = dt dt a The Riemannian distance between two points A = L(a) and B = L(b) is dened as d(A, B) = inf {∣L∣ ∣ L(a) = A, L(b) = B} . L
(3.66)
We leave to readers to check that this is a distance [2]. Therefore, Riemannian manifold is a metric space. Example 3.12. 1. In ℝn assume I is obtained by MI = In . Then it is obvious that this is a Riemannian manifold. In fact, the distance dened by this quadratic form I is the conventional distance on ℝn . 2. In ℝ4 assume I is determined by ⎡ ⎤ c 0 0 0 ⎢ 0 −1 0 0 ⎥ ⎥ MI = ⎢ ⎣ 0 0 −1 0 ⎦ , 0 0 0 −1 where c is the speed of light. Then ℝ4 with this I is a pseudo-Riemannian manifold. It is the frame for time-space continuum in relativity [5]. Next, we consider the integral on Riemannian manifold. First, consider the integral on a manifold. Let M be an oriented manifold, and Z ∈ : n (M) be a nowhere zero n-form, which provides the orientation of M. Z is called a unit volume. Denition 3.31. Let (U, x) be a coordinate chart, i.e., I (U) ⊂ ℝn , under this coordinate, I is expressed as Z (x) = g(x)dx1 ∧ ⋅ ⋅ ⋅ ∧ dxn . Let C ⊂ I (U) be a cub. Then the integral of Z over I −1 (C) is dened as ∫ I −1 (C)
∫
Z=
g(x)dv.
(3.67)
C
Let f (x) be a bounded piece-wise continuous function. Then the integral of f over I −1 (C) is dened as ∫ I −1 (C)
fZ =
∫ C
f (x)g(x)dv.
(3.68)
3.11 Riemannian Geometry
81
To show this integral is well dened, we have to show that it is independent of the choice of the local coordinate chart. Let y = y(x) be another coordinate chart. It is known from calculus that the right hand side of (3.67) is ∫ C′
g(x(y))det(Jx (y))dv′ .
But Z is expressed under y coordinates as
Z = det(Jx (y))dy1 ∧ ⋅ ⋅ ⋅ ∧ dyn . Hence (3.67) remains true. As long as the integral is dened over a small cub, it is dened over any domain, because a domain can be split up into a number of small cubs. It is obvious that the integral over a manifold depends on the choice of unit volume. Fortunately, the following theorem ensures the existence of the unique integral over Riemannian manifold. (We refer to [2] for the proof.) Theorem 3.7. Let M be an oriented Riemannian manifold with Riemannian distance ) . Then there exists a unique tensor eld Z ∈ : n (M) such that for any orthogonal basis e1 , ⋅ ⋅ ⋅ , en , Z (e1 , ⋅ ⋅ ⋅ , en ) = 1. Moreover, Let M) (x) be the matrix form of ) under given coordinate frame x. Then Z can be expressed as
Z=
√
gdx1 ∧ ⋅ ⋅ ⋅ ∧ dxn ,
(3.69)
where g = det(M) ). This Z is called the natural unit volume. When the integral is dened on an oriented Riemannian manifold, the integral is conventionally dened with respect to this Z . Example 3.13. In ℝ3 assume the surface S is dened by z = F(x, y). On S the distance is dened as the distance inherited from ℝ3 . (Shortest curve on the surface ˜ where under the distance of ℝ3 .) Consider the integral over D, D˜ = {(x, y, F(x, y)) ∣ (x, y) ∈ D}. Denote the basis of T ∗ (S) by (E1 , E2 ). Then ⎡ 1 0 [ ] ⎢ 0 1 1 E1 = I −1 ( wwx ) = JI −1 =⎢ ⎣ 0 wF wF wx wy Similarly,
⎡
⎤ 1 ⎢ 0 ⎥ ⎥. E2 = ⎢ ⎦ ⎣ wF wy
Now the matrix of the natural unit volume is M)
⎡ ⎤ 1 [ ] ⎢ 0 ⎥ ⎥ 1 ⎢ ⎥ ⎥. ⎦ 0 =⎣ ⎦ wF wx ⎤
82
3 Differentiable Manifold
⎡
⎤ ) ( wF 2 wF wF 1 + ⎢ wx w( x w y) ⎥ ⟨E1 , E1 ⟩ ⟨E1 , E2 ⟩ M) = 2 ⎥. =⎢ ⎣ wF wF ⎦ ⟨E2 , E1 ⟩ ⟨E2 , E2 ⟩ 1+ wF wy wx wy [
]
Hence √ g=
√
(
wF 1+ wx
)2
(
wF + wy
)2 .
Let h(x, y) be a function on S. Its integral over D˜ is √ ( ) ( ) ∫ wF 2 wF 2 h(x, y) 1 + + dx ∧ dy. wx wy D Next, we consider the differential on Riemannian manifolds. It is called connection. Connection is important in both geometry and physics [4]. We use semitensor product of matrices to express some fundamental formulas for the connection. (Please refer to the Appendix for semi-tensor product of matrices.) Denition 3.32. Let f , g ∈ V (M) be two vector elds. A mapping : V (M) × V (M) → V (M), satisfying (i). r f sg = rs f g,
r, s ∈ ℝ;
(3.70)
(ii). h f g = h f g,
f (hg) = L f (h)g + h f g,
h ∈ Cf (M),
(3.71)
is called a connection. Under a coordinate frame x, the action of connection on a basis is expressed as ( ) n w w , w = ¦ Jikj wxj w xk w xi k=1 where Jikj is called the Christoffel symbol. Dene Christoffel matrix * as ⎡
1 ⋅⋅⋅ J11 ⎢ .. * =⎣ .
1 ⋅⋅⋅ J1n .. .
1 ⋅⋅⋅ Jn1 .. .
⎤ 1 Jnn .. ⎥ . . ⎦
n ⋅ ⋅ ⋅ Jn ⋅ ⋅ ⋅ Jn ⋅ ⋅ ⋅ Jn J11 nn 1n n1
The connection on two vector elds can be expressed in matrix form as: n
Proposition 3.14. Let f = ¦ fi wwxi and g = i=1
n
¦ g j wwx j . Then
j=1
f g = Dg ⋉ f + * ⋉ f ⋉ g.
(3.72)
3.11 Riemannian Geometry
Proof. By denition (3.70) and (3.71), we have [ ] n n n n w w k + ¦ ¦ g j Ji j f g = ¦ fi ¦ L w g j w x j j=1 w xk i=1 j=1 w xi k=1
83
(3.73)
= Dg ⋉ f + * ⋉ f ⋉ g. Note that the vector elds in (3.73) are expressed in vector form. That is, f = n
¦ fi wwxi is simply expressed as f = ( f1 , f2 , ⋅ ⋅ ⋅ , fn )T.
⊔ ⊓
i=1
Let y = y(x) be another coordinate frame. We want to express * in this new coordinate frame. Denote by *˜ and J˜ikj the matrix and its entries under new coordinate frame. Then Lemma 3.4. Under the new coordinate frame y we have ⎞ ⎛ 2 w x1 ⋅ ⋅ ⋅ w 2 x1 ⎛ 1⎞ J˜i j w y j w yn ⎟ ( ⎜ w y j w y1 ) ⎜ .. ⎟ ⎜ w xn T . .. ⎟ ⎟ w x1 ⎜ . ⎝.⎠=⎜ . . ⎟ w yi , ⋅ ⋅ ⋅ , w yi ⎠ ⎝ 2 J˜inj w xn ⋅ ⋅ ⋅ w 2 xn w y j w y1 w y j w yn )T ( ) ( wx wx wx T +* ⋉ w x1 , ⋅ ⋅ ⋅ , n ⋉ w y1 , ⋅ ⋅ ⋅ , w yn . w yi w yi j j Proof. f=
n w w w xs =¦ , w yi s=1 w xs w yi
g=
n w w w xt =¦ . w y j t=1 w xt w y j
(3.74)
Recalling the denition of J , one sees that n
w
¦ J˜ikj w yk = f g.
k=1
⊔ ⊓
Applying (3.72) to the above equation yields (3.74). Theorem 3.8. Under the new coordinate frame y, *˜ has the form
*˜ = D2 xDx + * ⋉ Dx(I ⊗ Dx). Proof. A straightforward computation shows that ⎛ n w 2 x1 w xs ⎜ ¦ w ys w y1 w y1 ⋅ ⋅ ⋅ ⎜ s=1 ⎜ .. D2 x ⋉ Dx = ⎜ . ⎜ ⎜ n ⎝ w 2 xn w xs ⋅ ⋅ ⋅ ¦ w ys w y1 w y1 s=1
n
(3.75)
¦ wwys wx1yn ww yx1s
s=1
2
.. . n w 2 xn w xs ¦ w ys w yn w y1 s=1
84
3 Differentiable Manifold n
2 ⋅ ⋅ ⋅ ¦ w x1 w xs ⋅ ⋅ ⋅ w y s w y1 w yn s=1 .. . n 2 ⋅ ⋅ ⋅ ¦ w xn w xs ⋅ ⋅ ⋅ w ys w y1 w yn s=1
n
2 ¦ wwys wx1yn ww yxns s=1 .. . n 2 ¦ wwys wxnyn ww yxns s=1
⎞ ⎟ ⎟ ⎟ ⎟. ⎟ ⎟ ⎠
Using (i j) to label its columns, then its (i j)-th column is the rst term of the right hand side of (3.74). Next, denote the i-th column of Dx by Ji , then
* ⋉ Dx = (* ⋉ J1 , * ⋉ J2 , ⋅ ⋅ ⋅ , * ⋉ Jn ). Since I ⊗ Dx = diag(J, ⋅ ⋅ ⋅ , J), we have
* ⋉ Dx ⋉ (I ⊗ Dx) = (* ⋉ J1 ⋉ J1 , ⋅ ⋅ ⋅ , * ⋉ J1 ⋉ Jn , ⋅ ⋅ ⋅ , * ⋉ Jn ⋉ J1, ⋅ ⋅ ⋅ , * ⋉ Jn ⋉ Jn ) . It is clear that the (i j)-column of the above form is the second term of the right hand side of (3.74). ⊔ ⊓ Let M be a Riemannian manifold, with Riemannian distance determined by G = (gi j )n×n . The fundamental theorem of the Riemannian geometry says that there exists a unique Riemannian connection on M [1]. Moreover, its Christoffel symbols are determined by ( ) 1 n ks w gsi w gi j w g js k , (3.76) Ji j = ¦ g − + 2 s=1 wxj w xs w xi where gi j is the (i, j)-th element of G−1 . It is well known that [4] Proposition 3.15. There exists a unique Riemannian connection satisfying (i). [ f , g] = f g − g f ,
(3.77)
LX (Z (Y, Z)) = Z (X Y, Z) + Z (Y, X Z).
(3.78)
(ii). for X ,Y, Z ∈ V (M)
The Christoffel matrix is said to be symmetric if
Jikj = J kji ,
∀i, j, k.
(3.79)
In fact, we have Theorem 3.9. If there exists a connection on N that has symmetric Christoffel matrix, then (3.77) holds. Proof. It is easily veried that if the Christoffel matrix * is symmetric, then
3.12 Symplectic Geometry
* ⋉ f ⋉g = * ⋉g⋉ f,
85
∀ f , g ∈ V (N).
Using (3.72) yields f g − g f = Dg f − D f g = [ f , g].
⊔ ⊓
Equation (3.76) shows that since for a Riemannian manifold there exists the symmetric Christoffel matrix, we have (3.77). Now Theorem 3.9 says that it is enough if the Christoffel matrix of a manifold is symmetric. A related problem is the geodesic. The equation of a geodesic can also be expressed in matrix form [1]. A curve, r(t), is called a geodesic on M, if and only if it satises the following equation: r¨t = * ⋉ r2 .
(3.80)
In a local coordinate chart, r(t) can be expressed as r(t) = (x1 (t), ⋅ ⋅ ⋅ , xn (t))T . Then the equation (3.80) can be expressed into matrix form as ⎡
⎤ ⎡ ⎤2 x¨1 x1 ⎢ .. ⎥ ⎢ .. ⎥ ⎣ . ⎦=* ⎣ . ⎦ . x¨n
xn
3.12 Symplectic Geometry Denition 3.33. A 2n dimensional Cf manifold M with a 2-form Z is called a symplectic geometry, if Z is skew-symmetric, nonsingular and closed. A k-form Z is said to be closed if dZ = 0. The following method can be used to check whether a 2-form is closed. Proposition 3.16. Let the matrix expression of the Z under a given coordinate chart be MZ = (Vi, j ). Then dZ = 0 if and only if
w w w (V jk ) + (Vki ) + (Vi j ) = 0, w xi wxj w xk
∀i, j, k.
(3.81)
Proof. Since V = ¦ ¦ Vi, j dxi ∧ dx j , then i
j
dV = ¦ ¦ ¦ k
i
j
w Vi, j k dx ∧ dxi ∧ dx j . w xk
For a given index group I, J, K we collect the terms of the form dxI ∧ dxJ ∧ dxK . Let k = I, i = J, j = K. Then we have
w VJK I dx ∧ dxJ ∧ dxK . w xI
86
3 Differentiable Manifold
Let k = I, i = K, and j = J. By skew-symmetry, we have
w VKJ I w VJK I w VJK I dx ∧ dxK ∧ dxJ = − dx ∧ dxK ∧ dxJ = dx ∧ dxJ ∧ dxK . w xI w xI w xI Similarly, for k = K, i = I, and j = J (or i = J, and j = I) we have
w VIJ I dx ∧ dxJ ∧ dxK . w xK For k = J, i = K, and j = I (or i = I, and j = K) we have
w VKI I dx ∧ dxJ ∧ dxK . w xJ Collecting the 6 terms yields that the coefcient of dxI ∧ dxJ ∧ dxK is 2
w w w (VJK ) + 2 (VKI ) + 2 (VIJ ) w xI w xJ w xK ⊔ ⊓
which is zero. The conclusion follows.
Example 3.14. In ℝ2n , dene a 2-form Z with its matrix form MZ = J, where ] [ 0 In , (3.82) J= −In 0 then (ℝ2n , Z ) is a symplectic manifold. In fact, equation (3.82) has a general meaning. The following theorem is a fundamental result. We refer to [8] for proof. Theorem 3.10. (Darboux) On a 2n dimensional manifold, a 2-form is a symplectic structure, if and only if for any point p ∈ M there is a local coordinate chart (U, (x, y)) ∋ p such that Z can be expressed locally as n
Z = ¦ dxi ∧ dyi . i=1
Denition 3.34. Let (M, Z ) be a symplectic manifold, and X ∈ V (M) and P ∈ V ∗ (M) be connected by iX (Z ) := Z (X, ⋅) = P . Dene two diffeomorphisms ♯ : V ∗ (M) → V (M) and ♭ : V (M) → V ∗ (M) as X = P ♯,
and P = X ♭ .
(3.83)
If there exists a function H such that X = (dH)♯ , then H is called a Hamiltonian manifold, and X is called the Hamiltonian vector eld deduced by H, denoted by X = XH . Let M and N be two manifolds and F : M → N a diffeomorphism, Z ∈ : k (N). Then a deduced mapping F ∗ : : k (N) → : k (M) is dened by
3.12 Symplectic Geometry
F ∗ (Z )(X1 , ⋅ ⋅ ⋅ , Xk ) = Z (F∗ (X1 ), ⋅ ⋅ ⋅ , F∗ (Xk )),
X1 , ⋅ ⋅ ⋅ , Xk ∈ V (M).
87
(3.84)
The following theorem is sometimes called the Principle of structure invariance. Theorem 3.11. (Liouville’s Theorem) Let (M, Z ) be a symplectic manifold and XH a Hamiltonian vector eld. Then (etXH )∗ (Z (x)) = Z (etXH (x)).
(3.85)
We refer to [1] for the proof. Since symplectic manifolds can only be used for a dynamics with even dimension, a more general geometric structure is necessary. The Poisson manifold is introduced to serve this purpose. Denition 3.35. A Poisson bracket on a manifold M is a smooth mapping: Cr (M) × Cr (M) → Cr (M), satisfying the following (i). (Bi-linearity) {cF + dP, H} = c{F, H} + d{P, H}, {F, cH + dP} = c{F, H} + d{F, P}, where c, d ∈ ℝ; (ii). (Leibniz Rule) {F, GH} = {F, G}H + G{F, H}; (iii). (Skew-symmetry) {F, H} = −{H, F}; (iv). (Jacobi Identity) {F, {G, H}} + {G, {H, F}} + {H, {F, G}} = 0. A manifold M with a Poisson bracket is called a Poisson manifold. The Poisson bracket is said to dene a Poisson structure on M. To show that a Poisson manifold is more general than a symplectic manifold we give the following. Proposition 3.17. Let (M, Z ) be a symplectic manifold. Then there exists a Poisson bracket such that M with this bracket becomes a Poisson manifold. Proof. For any two functions f , g ∈ Cr (M) dene a Poisson bracket as { f , g} = Z (X f , Xg ),
∀ f , g ∈ Cr (M).
It is easy to verify that this is a Poisson bracket.
(3.86) ⊔ ⊓
Denition 3.36. Let M be a Poisson manifold. A smooth real function C : M → ℝ is called a Casimir function, if the Poisson bracket of C with any function is zero. That is, {C, H} = 0, ∀H ∈ Cr (M). To test the stability of a dynamic system, we may search a Hamiltonian function as a candidate for Lyapunov function. In this case Casimir functions provide us more freedom, because for a Casimir function C, we always have XH = XH+C .
88
3 Differentiable Manifold
Denition 3.37. Let M be a Poisson manifold, H : M → ℝ a smooth function. The vector eld VH , generated by H, is the unique vector eld on M satisfying VH (F) = {F, H} = −{H, F},
∀F : M → ℝ.
Proposition 3.18. Let M be a Poisson manifold, F, H ∈ Cr (M) with their generated Hamiltonian vector elds VF , VH , respectively. Then the Hamiltonian vector eld generated by their Poisson bracket {F, H} is V{F,H} = −[VF ,VH ] = [VH ,VF ]. Let x = (x1 , ⋅ ⋅ ⋅ , xm ) be a local coordinate frame on M. The Poisson bracket of basis elements are denoted by J i j (x) = {xi , x j },
i, j = 1, ⋅ ⋅ ⋅ , m.
They are called the structure functions of the Poisson manifold M with respect to the coordinate frame. The structure functions uniquely determine the structure of a Poisson manifold. For convenience, they are arranged as an m × m matrix J(x), called the structure matrix of the manifold. Using the structure matrix, the Poisson bracket can be expressed locally as {F, H} = dFJ(x)H(x). Proposition 3.19. Let J(x) = (J i j (x)) be an m × m matrix of functions of x = (x1 , ⋅ ⋅ ⋅ , xm ) dened on an open set M ⊂ ℝm . Then J(x) with {F, H} = dFJH is a Poisson bracket on M, if and only if it satises (i). (Skew-symmetry) J i j (x) = −J ji (x),
i, j = 1, ⋅ ⋅ ⋅ , m.
(ii). (Jacobi Identity) m
¦ {J il (x)wl J jk (x) + J kl (x)wl J i j (x) + J jl (x)wl J ki (x)} = 0,
l=1
i, j, k = 1, ⋅ ⋅ ⋅ , m, x ∈ M. Proposition 3.20. Let M be a Poisson manifold, x ∈ M. Then there exists a unique linear mapping S = S ∣x : T ∗ M∣x → T M∣x , such that for any real function H ∈ Cr (M),
S (dH(x)) = VH ∣x . Denition 3.38. Let M be a Poisson manifold, x ∈ M. The rank of M at x is dened as the rank of the linear mapping S ∣x : T ∗ M∣x → T M∣x . Proposition 3.21. The rank of a Poisson manifold at any point is even.
References
89
Denition 3.39. Let M and N be two Poisson manifolds. A mapping I : M → N is called a Poisson mapping, if it keeps the bracket unchanged. That is, {I ∗ (F), I ∗ (H)}M = I ∗ {F, H}N ,
F, H ∈ Cr (N).
Proposition 3.22. Let M be a Poisson manifold XH be a Hamiltonian eld. Then for each t, etXH : M → M determined a Poisson mapping from M to itself. Corollary 3.2. Let XH be a Hamiltonian vector eld on a Poisson manifold M. Then the rank of M at etXH (x) for any t ∈ ℝ equals to the rank of M at x. The following is a generalized Darboux’ theorem. Theorem 3.12. ((Generalized) Darboux’ Theorem) Let M be an m dimensional Poisson manifold with constant rank 2n ⩽ m. Then at any point x0 ∈ M there is a local coordinate chart (p, q, z) = (p1 , ⋅ ⋅ ⋅ , pn , q1 , ⋅ ⋅ ⋅ , qn , z1 , ⋅ ⋅ ⋅ , zℓ ),
2n + ℓ = m,
such that the Poisson bracket can be expressed as ) n ( wF wH wF wH {F, H} = ¦ − i i , i i w p wq i=1 w q w p where z1 , ⋅ ⋅ ⋅ , zℓ are Casimir functions.
References 1. Abraham R, Marsden J. Foundations of Mechanics. Reading: Benjamin/Cummings Pub. Com. Inc., 1978. 2. Boothby W. An Introduction to Differentiable Manifolds and Riemannian Geometry, 2nd edn. Orlando: Academic Press, 1986. 3. Brockett R. Asymptotic stability and feedback stabilization//Brockett R, Millmann R, Sussmann H. Differential Geometric Control Theory, Progress in Mathematics. Boston: Birkhauser, 1983. 4. Chern S, Chen W. Lectures on Differential Geometry. Beijing: Beijing Univ. Press, 1983. 5. Clarke C. Elementary General Relativity. New York: John Wiley & Sons, 1979. 6. Husemoller D. Fibre Bundles, 2nd edn. New York: Springer-Verlag, 1966. 7. Isidori A. Nonlinear Control Systems, 3rd edn. London: Springer, 1995. 8. Olver P. Applications of Lei Groups to Differential Equations, 2nd edn. New York: SpringerVerlag, 1993. 9. Spivak M. A Comprehensive Introduction to Differential Geometry. Berkeley: Publish or Perish Inc., 1979. 10. Sussmann H. Orbits of families of vector elds and integrability of distributions. Trans. American Math. Soc., 1973, 180: 171–188. 11. Wonham W. Linear Multivariable Control: A Geometric Aproach, 2nd edn. Berlin: Springer, 1979.
Chapter 4
Algebra, Lie Group and Lie Algebra
Geometry, algebra, and analysis are usually called the three main branches of mathematics. This chapter introduces some fundamental results in algebra that are mostly useful in systems and control. In section 4.1 some basic concepts of group and three homomorphism theorems are discussed. Ring and algebra are introduced briey in section 4.2. As a tool, homotopy is investigated in section 4.3. Sections 4.4 and 4.5 contain some primary knowledge about algebraic topology, such as fundamental group, covering space etc. In sections 4.6 and 4.7, Lie group and its Lie algebra are discussed. Section 4.8 considers the structure of Lie algebra.
4.1 Group Denition 4.1. A set G with an operator ⊗ : G × G → G is called a group if the followings are satised: (i). (a ⊗ b) ⊗ c = a ⊗ (b ⊗ c), a, b, c ∈ G. (associative) (ii). There exists an element, e, such that g ⊗ e = e ⊗ g = g,
∀ g ∈ G.
e is called the identity. (iii). For every g ∈ G, there exists an element g−1 , called the inverse of g, such that g ⊗ g−1 = g−1 ⊗ g = e. If in addition we have a ⊗ b = b ⊗ a,
∀ a, b ∈ G,
G is called an Abelian group. Example 4.1. 1. ℂ (set of complex numbers), ℝ (set of real numbers), ℚ (set of rational numbers), ℤ (set of integers) with the conventional addition, “+”, are groups. 2. ℂ∖{0}, ℝ∖{0}, ℚ∖{0} with the conventional multiplication, “×”, are groups. 3. ℤ with the conventional multiplication, “×”, is not a group because ±1 ∕= z ∈ ℤ does not have an inverse in ℤ. 4. Let gl(n, ℂ) (gl(n, ℝ)) be the set of n × n complex (real) matrices. With the conventional matrix addition gl(n, ℂ) (gl(n, ℝ)) is a group. D. Cheng et al., Analysis and Design of Nonlinear Control Systems © Science Press Beijing and Springer-Verlag Berlin Heidelberg 2010
92
4 Algebra, Lie Group and Lie Algebra
5. Let GL(n, ℂ) (GL(n, ℝ)) be the set of n × n invertible complex (real) matrices. With the conventional matrix multiplication GL(n, ℂ) (GL(n, ℝ)) is a group. However, this group is not Abelian. Example 4.2. Let ℤn = {0, 1, ⋅ ⋅ ⋅ , n − 1} with operator ⊕ be dened as a ⊕ b := a + b (mod(n)). Then ℤn is a group, called the n-th order circular group. The identity of this group is 0, and the inverse of 0 ∕= z ∈ ℤn is n − z. For instance, in ℤ5 : 3 ⊕ 4 = 2; 4−1 = 1 etc. Example 4.3. Let Gn = {1, 2, ⋅ ⋅ ⋅ , n}. All the permutations on Gn with compound of permutations, as the operator, form a group called the n-th order symmetric group, denoted by Sn . (In fact, it has been used several times before.) For instance, consider G5 : A permutation of it can be expressed as V1 = (1, 2, 3) (4, 5) ∈ Sn , which performs the following permutation: 1 → 2, 2 → 3, 3 → 1, and 4 → 5, 5 → 4. Let another permutation be V2 = (3, 2, 1, 4) ∈ Sn , which performs the following permutation: 3 → 2, 2 → 1, 1 → 4, 4 → 3, and 5 → 5. Now V1 ⊗ V2 is dened as 1 → 2 → 1, 2 → 3 → 2, 3 → 1 → 4, 4 → 5 → 5, 5 → 4 → 3. Putting them together yields V1 ⊗ V2 = (3, 4, 5). This group is not Abelian. Denition 4.2. 1. Let (G, ⊗) be a group, and H ⊂ G. H is called a subgroup of G, denoted by H < G, if (H, ⊗) is also a group. 2. Let H < G, g ∈ G. The set g ⊗ H := {g ⊗ h ∣ h ∈ H} is called the left g coset of H. Similarly H ⊗ g := {h ⊗ g ∣ h ∈ H} is called the right g coset of H. 3. H < G is called a normal subgroup of G, denoted by H ⊲ G, if for any g ∈ G g ⊗ H = H ⊗ g. When there is no risk of confusion, we may omit ⊗. Then a ⊗ b is simply written as ab. Proposition 4.1. ∅ ∕= H ⊂ G is a subgroup of G, if and only if for any two elements h1 , h2 ∈ H, h−1 1 h2 ∈ H. Proof. Necessity is trivial. To prove sufciency, we have to show that H satises (i)–(iii). Choose h ∈ H, then h−1 h = e ∈ H. Hence e ∈ H, which implies (ii). Next, for any h ∈ H, h−1 = h−1 e ∈ H, which is (iii). To see (i) we have only to show that when
4.1 Group
93
−1 −1 h1 , h2 ∈ H, h1 h2 ∈ H . This is true because h1 ∈ H ⇒ h−1 1 ∈ H ⇒ (h1 ) h2 = h1 h2 ∈ H. ⊔ ⊓
Proposition 4.2. Left (right) cosets form a partition, i.e., if g1 H ∩ g2 H ∕= ∅ (Hg1 ∩ Hg2 ∕= ∅) then g1 H = g2 H (Hg1 = Hg2 ). Proof. Assume g1 H ∩ g2 H ∕= ∅, and choose c ∈ g1 H ∩ g2 H. Then c = g1 h1 = g2 h2 for some hi ∈ H, i = 1, 2. For g ∈ g1 H there is a h ∈ H such that g = g1 h. Then −1 g = g1 h = g1 h1 h−1 1 h = g2 h2 h1 h ∈ g2 H.
so g1 H ⊂ g2 H. Similarly, we can prove g2 H ⊂ g1 H. So g1 H = g2 H.
⊔ ⊓
For any group G, it has two trivial subgroups: (i). {e}, a single element group; (ii). G itself, which is called its non-proper subgroup. Both of them are normal. For an Abelian group, every subgroup is normal. Let G be a group, and S ⊂ G. The smallest subgroup H containing S is called the subgroup generated by S. It is easy to see that such a group exists and is unique, because it is the intersection of all subgroups that contain S. −1 Example 4.4. Given a group G. An element g = g−1 1 g2 g1 g2 is called a commutator of G. The group generated by the commutators is called the commutator group, denoted by G′ . It is easy to check that G′ consists of all nite products of the commutators: { }
G′ =
−1 a−1 i b i ai bi ∣ a i , b i ∈ G
.
i
In fact, G′ ⊲ G. To see this it sufces to show that ( ) g−1
−1 a−1 i b i a i bi
g ∈ G′ ,
∀g ∈ G.
i
By plugging g−1 g into commutators, one easily sees that it is enough to show g−1 a−1 b−1 abg ∈ G′ . Note that g−1 (a−1 b−1 ab)g = (ag)−1 b−1 (ag)b b−1 g−1 bg ∈ G′ , which completes the proof. Let H ⊲ G. Then gH = Hg for all g ∈ G. Now we dene an operator ⊗ over the cosets as aH ⊗ bH := abH.
(4.1)
Since representation of the cosets is not unique, we have to show that (4.1) is well dened. That is, if a1 H = a2 H and b1 H = b2 H then a1 b1 H = a2 b2 H. Let x = a1 b1 h ∈ a1 b1 H. Since a1 H = a2 H, there exist h1 , h2 ∈ H such that a1 h1 = a2 h2 . i.e., a1 = a2 h2 h−1 1 := a2 h3 for some h3 ∈ H. Similarly, b1 = b2 h4 for some h4 ∈ H. Then x ∈ a2 h3 b2 h4 H. Since H is normal h3 b2 = b2 h5 for some h5 ∈ H.
94
4 Algebra, Lie Group and Lie Algebra
Hence x ∈ a2 b2 h5 h4 H = a2 b2 H. That is, a1 b1 H ⊂ a2 b2 H. By symmetry, we also have a2 b2 H ⊂ a1 b1 H. It is ready to verify that the set of cosets with operator dened in (4.1) form a group. So we have Denition 4.3. Let H ⊲ G. The cosets of H with the operator dened in (4.1) form a group, which is called the quotient group of H in G. Denoted by G/H. Denition 4.4. 1. Let G and Q be two groups. A mapping F : G → Q is called a homomorphism if F(g1 g2 ) = F(g1 )F(g2 ).
(4.2)
The set of homomorphisms from G to Q is denoted by Hom(G, Q). Hence F ∈ Hom(G, Q). 2. If a homomorphism is a bijective mapping, i.e., it is one to one and onto, then it is called an isomorphism. The set of isomorphisms is denoted by Iso(G, Q). 3. If F ∈ Hom(G, G), i.e., a homomorphism from a group G to itself, it is called an endomorphism. The set of endomorphisms is denoted by End(G). 4. If F ∈ Iso(G, G), i.e., an isomorphism from a group G to itself, it is called an automorphism. The set of automorphisms is denoted by Aut(G). Example 4.5. 1. Denote by ℝ+ the set of positive real numbers. With the conventional multiplication, “ ⋅ ”, both G = (ℝ∖{0}, ⋅) and H = (ℝ+ , ⋅) are groups. Moreover, H ⊲ G and G/H = {H, −H}. If we dene F : G → H by x $→ ∣x∣, then F ∈ Hom(G, H). 2. Let W = (ℝ, +), i.e., W is the group of real numbers with the conventional addition, and H is as above. Dene F : H → W by F(x) = log(x). Then F ∈ Iso(H,W ). 3. Consider F : GL(n, ℝ) → G, (refer to Example 4.1 for GL(n, ℝ)) G is as in 1, and F is dened as F(X ) = det(X ). Then F ∈ Hom(GL(n, ℝ), G). 4. Let Z ∈ GL(n, ℝ). Dene F : GL(n, ℝ) → GL(n, ℝ) as F(X) = Z −1 XZ. Then F ∈ Aut(GL(n, ℝ)). All the above statements are easily veriable. Let F ∈ Hom(G, Q), the image of F is dened as im(F) = {F(g) ∣ g ∈ G} ⊂ Q, and the kernel of F is dened as ker(F) = {g ∈ G ∣ F(g) = e ∈ Q}. Then we have Proposition 4.3. 1. im(F) < Q; 2. ker(F) ⊲ G.
4.1 Group
95
Proof. 1. Let x, y ∈ im(F). Then there exist g, h ∈ G such that F(g) = x and F(h) = y. So x−1 y = (F(g))−1 F(h) = F(g−1 )F(h) = F(g−1 h) ∈ im(F). So im(F) < Q. 2. It is easy to see that ker(F) < G. To prove it is normal, let g ∈ G, and k ∈ ker(F). We have only to show that g−1 kg ∈ ker(F). F(g−1 kg) = F(g−1 )F(k)F (g) = F(g−1 )F(g) = F(e) = e, which means g−1 kg ∈ ker(F). Hence, ker(F) ⊲ G.
⊔ ⊓
Theorem 4.1. (First Homomorphism Theorem) 1. Let F ∈ Hom(G, Q). K = ker(F). Then T : G/K → im(F), dened as gK $→ F(g), is an isomorphism, i.e., G/ ker(F) ∼ = im(F). 2. If H ⊲ G, then S : G → G/H dened by g $→ gH is a homomorphism, which is surjective (onto). Moreover, ker(S ) = H. Proof. 1. We rst prove that T is well dened: Assume gK = hK. Then g−1 h ∈ K. Hence
T (hK) = T (gg−1hK) = F(gg−1 h) = F(g)F(g−1 h) = F(g) = T (gK). Next, we have
T (ghK) = F(gh) = F(g)F(h) = T (gK)T (hK). Hence, T is a homomorphism. T is obviously surjective. To see T is an isomorphism we have only to show that T is injective (one to one). Assume T (gK) = F(g) = e. Then g ∈ K, and hence gK = K, which means T is injective. 2. Using the same argument as in the proof of 1, it is easily seen that S is a homomorphism and onto. Now if g ∈ H then S (g) = gH = H, and if g ∕∈ H then S (g) = gH ∕= H. So ker(S ) = H. ⊔ ⊓ Theorem 4.2. (Second Homomorphism Theorem) 1. Let H < G, and N ⊲ G. Then N ∩ H ⊲ H. 2. Set NH = {nh ∣ n ∈ N, h ∈ H}. Then NH < G. 3. For h ∈ H dening S : H/(N ∩ H) → NH/N as h(N ∩ H) $→ hN, then S is an isomorphism, i.e., H/(H ∩ N) ∼ = NH/N.
96
4 Algebra, Lie Group and Lie Algebra
Proof. 1. Let h ∈ H and n ∈ N ∩ H. We have only to show that h−1 nh ∈ N ∩ H. It is obvious that h−1 nh ∈ H. Since n ∈ N, which is normal, hn = n′ h for some n′ ∈ N. Hence h−1 nh = n′ ∈ N. 2. Let n1 , n2 ∈ N and h1 , h2 ∈ H, we have only to show that (n1 h1 )−1 n2 h2 ∈ NH. Since −1 −1 −1 (n1 h1 )−1 n2 h2 = h−1 1 n1 n2 h2 = h1 n3 h2 = n4 h1 h2 ∈ NH, −1 −1 where n3 , n4 ∈ N with n3 = n−1 1 n2 and h1 n3 = n4 h1 . (Since N is normal such n4 exists.) 3. First, we show S is a homomorphism:
S (x(N ∩ H)y(N ∩ H)) = S (xy(N ∩ H)) = xyN = (xN)(yN) = S (x(N ∩ H))S (y(N ∩ H)), x, y ∈ H. Next, we show S is surjective. For any x = nh ∈ NH we have xN = nhN = hn′ N = hN, for some n′ ∈ N. Then
S (h(N ∩ H)) = hN = xN. Finally, we prove S is injective: Let x ∈ H and assume
S (x(N ∩ H)) = xN = N. Then x ∈ N, i.e., x ∈ N ∩ H.
⊔ ⊓
Theorem 4.3. (Third Homomorphism Theorem) Assume M ⊲ G, N ⊲ G and N < M. Then 1. M/N ⊲ G/N; 2. (G/N)/(M/N) ∼ = G/M. Proof. 1. M/N < G/N is obvious. We prove it is normal: Let g ∈ G, and m ∈ M. Then (gN)−1 (mN)(gN) = (g−1 mg)N = m′ N ∈ M/N, where m′ ∈ M. So M/N ⊲ G/N. 2. Dene S : (G/N)/(M/N) → G/M by gN(M/N) $→ gM. We rst show that S is well dened. Let g1 N(M/N) = g2 N(M/N). Then (g1 N)−1 (g2 N) ∈ M/N. That −1 is, (g−1 1 g2 )N ∈ M/N, which means g1 g2 ∈ M. Equivalently, g1 M = g2 M. Then
S (g1 N(M/N)) = g1 M = g2 M = S (g2 N(M/N)). Next, we prove S is a homomorphism:
S ((g1 N)(g2 N)(M/N)) = S ((g1 g2 N)(M/N)) = (g1 M)(g2 M) = g1 g2 M = S ((g1 N)(M/N))S ((g2 N)(M/N)).
4.2 Ring and Algebra
97
It is obvious that S is surjective, so we have only to show that S is injective. Assume S (gN(M/N)) = gM = M. Then g ∈ M, i.e., gN ∈ M/N, which means S is injective.
⊔ ⊓
Example 4.6. 1. Let G, Q be two groups. On G × Q dene an operator ⊗ as (g1 , q1 ) ⊗ (g1 , q2 ) := (g1 g2 , q1 q2 ), with g1 , g2 ∈ G and q1 , q2 ∈ Q. Then G× Q becomes a group, which is called the product group of G and Q. If we identify G × {e} with G. Then it is easy to check that G ⊲ G × Q. Similarly, if we identify Q with {e} × Q, Q ⊲ G × Q. 2. The center Z(G) of a given group G is dened as Z(G) = {x ∈ G ∣ xy = yx, ∀y ∈ G}. It is easy to see that Z(G) ⊲ G. 3. Let Q < G. Then for any g ∈ G, g−1 Qg < G. Q and g−1 Qg are called two conjugated subgroups.
4.2 Ring and Algebra Denition 4.5. A set R with two operators : addition, “+”, and multiplication, “⋅”, is called a ring if they satisfy the following conditions: (i). (R, +) is an Abelian group; (ii). The multiplication is associative, i.e., for any a, b, c ∈ ℝ (ab)c = a(bc). (iii). (Distributive Rule) (a + b)c = ac + bc,
a(b + c) = ab + ac.
Example 4.7. 1. The set of integers, ℤ, with the conventional addition and multiplication is a ring. 2. The set of polynomials over a eld, F, i.e., F = ℝ, F = ℂ etc., is a ring, denoted as F(x). 3. Set of n × n matrices with the conventional addition and multiplication is a ring, denoted by Mn . 4. (Boolean Algebra) Consider B = {0, 1}, we dene two operators as: conjunction ∧, and disjunction ∨ as: a ∧ b = min{a, b},
a ∨ b = max{a, b}.
(a) Consider ∨ as the addition + and ∧ as the multiplication, then (B, ∨, ∧) is a ring. (b) Consider ∧ as the addition + and ∨ as the multiplication, then (B, ∧, ∨) is also a ring.
98
4 Algebra, Lie Group and Lie Algebra
Denition 4.6. 1. A ring R is called a commutative ring if ab = ba,
∀a, b ∈ R.
2. An element, e ∈ R, is called the identity of ring R, if re = er = r, ∀r ∈ R. If R has identity, it is called a ring with identity. 3. If 0 ∕= a ∈ R and 0 ∕= b ∈ R and ab = 0, then a is called a left zero factor and b is called a right zero factor. 4. A ring with identity and without zero factor is called an integral ring. Example 4.8. In Example 4.7, ℤ and ℝ[x] (or ℂ[x]) are commutative integral rings. Mn is not commutative. It has identity, In . It has zero factors: say, in M2 ] ] [ [ 10 01 . , B= A= 00 00 Both A ∕= 0 and B ∕= 0, but AB = 0. So A is a left zero factor and B is a right zero factor. Denition 4.7. Let S ⊂ R. If S is a ring with the same operators as in R, S is called a subring of R. Proposition 4.4. Let S ⊂ R. S is a subring if (i). For any a, b ∈ S, a + b ∈ S; (ii). For any a, b ∈ S, ab ∈ S. Proof. (i) makes S with addition a group. (ii) makes it closed under multiplication. The conclusion follows. ⊔ ⊓ Denition 4.8. 1. A subring S ⊂ R is called an ideal if rs ∈ S,
sr ∈ S,
∀r ∈ R, s ∈ S.
2. Given an element r ∈ R, the smallest ideal containing r is called a principal ideal, denoted by S = (r). Remark 4.1. It is easy to see that the intersection of any ideals is an ideal. So the principal ideal, (r), is the intersection of all ideals containing r. (r) is also called the ideal generated by r. Example 4.9. 1. In ℤ n dene ⊗ as
a ⊗ b = ab (mod(n)).
Then it is easy to check that ℤn with ⊕ and ⊗ is a commutative ring, with identity 1. If n is a prime number, it is an integral ring.
4.2 Ring and Algebra
99
2. Consider ℤ6 . It is not an integral ring because 2 ⊗ 3 = 0. S = {2, 4, 0} is a subring of it. S is an ideal. In fact, S = (2) is a principal ideal. Denition 4.9. Let R1 , R2 be two rings. F : R1 → R2 is called a ring homomorphism if in addition to a group homomorphism it also satises the following F(ab) = F(a)F(b). A ring homomorphism is a ring isomorphism if it is bijective. Example 4.10. 1. Let F : ℤ → ℤn be dened as z $→ z (mod(n)). It is easy to check that F is a ring homomorphism. 2. Recall the Boolean algebra dened in item 4 of Example 4.7. In Boolean set B dene a mapping ¬ : B → B as ¬(a) = 1 − a. Then it is easy to check that ¬ : (B, ∨, ∧) → (B, ∧, ∨) is a ring isomorphism. Denition 4.10. Let V be a linear space over eld F (In most cases we consider F = ℝ). V is called an algebra if there is a multiplication ⋅ : V × V → V , such that (i). (aX1 + bX2) ⋅Y = aX1 ⋅Y + bX2 ⋅Y , (ii). Y ⋅ (aX1 + bX2 ) = aY ⋅ X1 + bY ⋅ X2 , X1 , X2 ,Y ∈ V and a, b ∈ F. Moreover, if (X ⋅Y ) ⋅ Z = X ⋅ (Y ⋅ Z), ∀X ,Y, Z ∈ V, then it is called an associative algebra. If X ⋅Y = Y ⋅ X,
∀X ,Y ∈ V,
it is called a commutative algebra. Remark 4.2. An associative algebra is obviously a ring. So the structure of an algebra is almost parallel to that of the ring. We outline them briey. Denition 4.11. Given two algebras V, W . 1. A subspace M ⊂ V is called a sub-algebra of V , if with the same multiplication M is an algebra. 2. A sub-algebra M of V is called an ideal of V if XZ ∈ M,
ZY ∈ M,
∀X ,Y ∈ V, Z ∈ M.
3. A linear mapping F : V → W is called an algebra homomorphism if F(X ⋅Y ) = F(X ) ⋅ F(Y ). 4. A homomorphism F : V → W is called an algebra isomorphism if it is bijective.
100
4 Algebra, Lie Group and Lie Algebra
Example 4.11. 1. Let Mn be the set of n × n matrices. Under the conventional matrix addition, multiplication and scalar multiplication it is an algebra. This algebra is associative, not commutative, and with identity In . 2. Let Un ⊂ Mn be the set of upper triangular matrices. Then it is easy to check that Un is a subalgebra of Mn . 3. If we consider Mn as a Banach space with a conventional norm, say, √ ∥A∥ = max{O ∈ V (AT A)} then it is called a Banach algebra. 4. If dene on Mn a multiplication, denoted by [⋅, ⋅], as [A, B] = AB − BA. It is easy to check that Mn with this multiplication is an algebra. This algebra is known as Lie algebra. It is not even associative and does not have an identity.
4.3 Homotopy Denition 4.12. Let X , Y be two topological spaces, f , g two continuous mappings from X to Y . 1. f and g are said to be homotopic, denoted by f ≃ g, if there exists a continuous mapping H : X × I → Y , called a homotopy of f and g, such that { H(x, 0) = f (x) (4.3) H(x, 1) = g(x). 2. Let A ⊂ X . f and g are said to be homotopic related to A, denoted by f ≃A g, if in addition to (4.3) we have H(x,t) = f (x) = g(x),
x ∈ A.
(4.4)
3. X, Y are homotopic, denoted by X ≃ Y, if there exist mappings f : X → Y and h : Y → X , such that h ∘ f ≃ idX ;
f ∘ h ≃ idY ,
where idX and idY are the identity mappings on X and Y respectively. 4. X is said to be contractable if it is homotopic to a single point. Example 4.12. 1. If two topological spaces X and Y are homeomorphic then they are homotopic; 2. ℝ2 ∖{0} ≃ S1 ; 3. A star shape set S ⊂ ℝn is such a set that there is a point c ∈ S such that if x ∈ S then the segment (x, c) ∈ S. Particularly, a convex set is a star shape set.
4.4 Fundamental Group
101
A star shape set on ℝn is contractable. We prove them as follows: 1. Let f : X → Y be the homeomorphism. We can set g = f −1 : Y → X. Then g ∘ f = idX and f ∘ g = idY . Hence the homotopy mappings can be chosen trivially as H(x,t) = idX (respectively H(y,t) = idY ). 2. Using the polar coordinate system, then X := ℝ2 ∖{0} = {(r, T ) ∣ r > 0, 0 ⩽ T < 2π}. Y := S1 = {(1, T ) ∣ 0 ⩽ T < 2π}. Choose f : X → Y as (r, T ) $→ (1, T ), and g : Y → X as (1, T ) $→ (1, T ). Then g ∘ f : (r, T ) → (1, T ), and f ∘ g : (1, T ) → (1, T ). So f ∘ g = idY , and we have only to show that g ∘ f ≃ idX . Set H : M × I → M as H((r, T ),t) = (1 + (r − 1)t, T ). It follows that
{
H((r, T ), 0) = (1, T ) = g ∘ f H((r, T ), 1) = (r, T ) = idX .
3. Let Y = {c}. Dene f : S → Y by f (x) = c, and dene g : Y → S by g(c) = c. Since f ∘ g = idY , we have only to show that g ∘ f ≃ idX . Setting H(x,t) = (1 − t)c + tx, then H(x, 0) = c = g ∘ f , and H(x, 1) = idX . We conclude that S ≃ Y = {c}. Hence, X is contractable. Intuitively, if two mappings are homotopic, then one mapping can be continuously moved to the other. Similarly, two spaces are homotopic if one can be continuously deformed to the other. A space is contractable if it can be continuously shrunk to a point. For instance, ℝ can be shrunk continuously to a point. But a circle can not be shrunk continuously to a point. If one wants to shrink a circle to a point, it would have to be cut at some point x. Then the points on its left can shrink towards the left, and the points on its right towards the right. But at this point the continuity of the shrinking mapping is broken.
4.4 Fundamental Group A way to describe the structural characteristics of a topological space is to investigate a loop on the space. Roughly speaking, on S1 a loop can not shrink to a point. But on ℝ2 , any loop can be shrank to a point. This is the idea behind the fundamental group. We start with paths. Denition 4.13. 1. Let f1 , f2 be two paths. they are equivalent, denoted by f1 ∼ f2 , if they are homotopic related to the two end points. In other words they have the same end points and are homotopic. It can also be denoted as
102
4 Algebra, Lie Group and Lie Algebra
f1 ≃({0},{1}) f2 . The equivalence class is denoted as [ f ]. 2. Let f , g be two paths on X , f (0) = x, f (1) = y, g(0) = y, and g(1) = z. We dene the product of these two paths as a path from x to z by { f (2t), 0 ⩽ t ⩽ 1/2 f ∘g = (4.5) g(2t − 1), 1/2 ⩽ t ⩽ 1. Intuitively, the set of paths would form a group by using the product dened by (4.5). The identity element is a single point path, and the inverse element is the inverse path, which goes backward. Unfortunately, the product dened by (4.5) is not associative, i.e., ( f ∘ g) ∘ h ∕= f ∘ (g ∘ h). So we have to consider their equivalent classes. Lemma 4.1. Let f1 , f2 , g1 , g2 be paths on X. If f1 ∼ f2 and g1 ∼ g2 , and f1 (1) = g1 (0), then f1 ∘ g1 ∼ f2 ∘ g2 . Proof. Let H1 (s,t) : I × I be the homotopy of f1 ≃({0},{1}) f2 and H2 (s,t) : I × I the homotopy of g1 ≃({0},{1}) g2 . Dene { H(s,t) =
H1 (2s,t), 0 ⩽ s ⩽ 1/2 H2 (2s − 1,t), 1/2 ⩽ s ⩽ 1.
It is continuous because H1 (1,t) = f1 (1) = g1 (0) = H2 (0,t). From the denition we have H(s, 0) = f1 ∘ g1 ; Moreover {
H(s, 1) = f2 ∘ g2.
H(0,t) = H1 (0,t) = f1 (0) = f2 (0) = f1 ∘ g1 (0) = f1 ∘ g2 (0) H(1,t) = H2 (1,t) = g1 (1) = g2 (1) = f1 ∘ g1 (1) = f2 ∘ g2 (1).
Hence f1 ∘ g1 ∼ f2 ∘ g2 .
⊔ ⊓
The above lemma makes it possible to dene a product over the equivalent classes of paths as [ f ][g] := [ f ∘ g]
(4.6)
Denition 4.14. A path f is called a loop if f (0) = f (1) = x. Point x is called the base point. Next, we want to show that with the multiplication of equivalence classes, dened in (4.6), the equivalence classes of loops form a group. The following three lemmas provide associativity, unit and inverse elements for the group respectively.
4.4 Fundamental Group
103
Lemma 4.2. Let D (s), E (s) and J (s) be three sequentially connected paths, i.e., D (1) = E (0) and E (1) = J (0). Then ([D ][E ])[J ] = [D ]([E ][J ]). Proof. We have only to show that (D ∘ E ) ∘ J ≃({0},{1}) D ∘ (E ∘ J ). According to the denition, we have ⎧ ⎨D (4s), 0 ⩽ s ⩽ 1/4 (D ∘ E ) ∘ J (s) = E (4s − 1), 1/4 ⩽ s ⩽ 1/2 ⎩ J (2s − 1), 1/2 ⩽ s ⩽ 1, and
⎧ ⎨D (2s), 0 ⩽ s ⩽ 1/2 D ∘ (E ∘ J )(s) = E (4s − 2), 1/2 ⩽ s ⩽ 3/4 ⎩ J (4s − 3), 3/4 ⩽ s ⩽ 1.
Dene a homotopy of the two paths as ) ⎧ ( 4s , 4s − 1 ⩽ t ⩽ 1 D 1+t ⎨ H(s,t) = E (4s − t − 1), 4s − 2 ⩽ t ⩽ 4s − 1 ) ( ⎩J 4s − t − 2 , 0 ⩽ t ⩽ 4s − 2. 2−t We leave to reader for checking that H(s,t) is continuous and xes the two ending points (for t = 0 and t = 1). ⊔ ⊓ For convenience, we denote by ex the xed loop with base point x, i.e., ex (t) = x, ∀t ∈ [0, 1]. Lemma 4.3. Let D (s) be a path with D (0) = x and D (1) = y. Then [ex ][D ] = [D ] = [D ][ey ]. Proof. We prove the rst equality. The second equality can be proved similarly. We have only to prove that ex ∘ D ≃({0},{1}) D . Construct a homotopy as (Refer to Fig. 4.1) ⎧ ⎨x, 0 ⩽ t ⩽ 1 − 2s ( ) H(s,t) = ⎩D 2s + t − 1 , 1 − 2s ⩽ t ⩽ 1. t +1 {
Then H(s, 0) =
x, s ⩽ 1/2 D (2s − 1), s ⩾ 1/2.
104
4 Algebra, Lie Group and Lie Algebra
It is ex ∘ D . Meanwhile,
H(s, 1) = D (s).
In addition, H(0,t) = x; Hence ex ∘ D ∼ D .
Fig. 4.1
H(1,t) = D (1) = y. ⊔ ⊓
Homotopy
When the homotopy is constructed the proof of the above or similar problems is easy. The question is how to construct a homotopy? We explain it briey by using the above proof as example. Refer to Fig. 4.1, for the rectangle, on t = 0 we need two segments: the rst half is x and the second half is D (s). While on t = 1 we have only D . On the left, s = 0 it is x, and on the right s = 1, we have y. One way to construct H is to split the rectangle into two parts: t ⩽ 1 − 2s and t ⩾ 1 − 2s. Then on the left triangle area set H = x, and on the right trapezoid set for each pair (s,t) the value H(s,t) = H(s∗ , 1), where s∗ = 2s+t−1 t+1 . By this way we obtain a H as required. The inverse D −1 (t) of D (t) can simply be dened as D −1 (t) = D (1 − t). It is clear that when D goes from x to y, D −1 goes from y to x. They have to satisfy the following: Lemma 4.4. Let D be a path, with D (0) = x and D (1) = y. Then [D ][D −1 ] = [ex ] and [D −1 ][D ] = [ey ]. Proof. We prove D ∘ D −1 ∼ ex . Using Fig. 4.2, let H(p) = H(p∗ ) and H(q) = H(q∗ ). A homotopy follows as
4.4 Fundamental Group
Fig. 4.2
105
Path of D and D −1
⎧ x, 0 ⩽ s ⩽ t ⎨ ( 2(s − t) ) 1 , t <s⩽ t+ H(s,t) = D 1 − t 2 ) ( ⎩D 2(1 − s) , t + 1 < s ⩽ 1. 1−t 2 Similarly, we can prove D −1 ∘ D ∼ ey .
⊔ ⊓
Summarizing Lemmas 4.2–4.4 yields a complete group structure. Theorem 4.4. Let x ∈ X. Denote the equivalent classes of the loops with x as its base point by : (X, x). Adopting the multiplication of equivalent classes dened by (4.5) and (4.6), : (X , x) becomes a group. It is called the fundamental group based on x, denoted by S1 (X, x). The following theorem shows that the fundamental group is independent of the choice of base point provided the space X is pathwise connected. Theorem 4.5. Let X be a pathwise connected topological space, and x1 , x2 ∈ X. Then S1 (X , x1 ) ∼ = S1 (X, x2 ). Proof. Let f (s) be a path with ends f (0) = x1 and f (1) = x2 , and D (s) be a loop based on x2 . Then f ∘ D ∘ f −1 is a loop based on x1 . Now we dene a mapping f ∗ : S1 (X, x2 ) → S1 (X, x1 ) as f∗ : [D ] $→ [ f ][D ][ f −1 ].
(4.7)
106
4 Algebra, Lie Group and Lie Algebra
It is sufcient to show that f∗ is a group isomorphism. First, we have f∗ ([D ][E ]) = [ f ][D ][E ][ f −1 ] = [ f ][D ][ f −1 ][ f ][E ][ f −1 ] = f∗ ([D ]) f∗ ([E ]). So f∗ is a homomorphism. Next, assume that g is another path connecting x2 to x3 , and [J ] ∈ S1 (X, x3 ). We prove that ( f ∘ g)∗([J ]) = f∗ (g∗ ([J ])). ( f ∘ g)∗ ([J ]) = = = =
(4.8)
[ f ∘ g][J ][( f ∘ g)−1 ] [ f ][g][J ][g−1 ][ f −1 ] [ f ][g][J ][g]−1 [ f ]−1 f∗ (g∗ ([J ]))
which proves (4.8). Using (4.8), we have (ex1 )∗ = ( f ∘ f −1 )∗ = f∗ ∘ f∗−1 . But (ex1 )∗ is an identity mapping, which means f∗ is a bijective mapping. Hence f∗ is an isomorphism. ⊔ ⊓ Based on the previous theorem, when the space X is pathwise connected, we may omit the base point and simply denote the fundamental group S (X, x) by S (X). Example 4.13. 1. Let S ⊂ ℝn be a star shape subset, with x the “center”, and D (s) be a loop with x as the base point. Dene a homotopy H(s,t) = t D (s) + (1 − t)x. It follows that D ∼ ex . Moreover, since S is path connected, the fundamental group is independent of the base point. Hence
S1 (X) = {e}, which is a trivial group containing only one element, identity. Such a fundamental group is called a trivial group. For a pathwise connected topological space, if its fundamental group is trivial, it is said to be simply connected. 2. Let X = S1 . Intuitively, we can imagine that the fundamental group is S1 (S1 ) ∼ = ℤ, where ℤ stands for the addition group of integers. In fact, a path twisted around the circle n times corresponds n ∈ ℤ. When the twisting goes on the opposite direction we have a negative integer, n < 0, to represent the n times twisting on the counter-direction. The detailed argument is tedious. (See i.e., [1].) 3. Let X, Y be two topological spaces, f : X → Y continuous, and f (x) = y. Dene a mapping f∗ : S1 (X, x) → S1 (Y, y) as
4.4 Fundamental Group
f∗ ([D ]) = [ f ∘ D ],
107
(4.9)
which is a group homomorphism. First, we have to show that (4.9) is well dened. Let D ∼ E . Then there exists a homotopy h(s,t) such that h(s, 0) = D (s);
h(s, 1) = E (s).
Then f ∘ h(s, 0) = f ∘ D (s);
f ∘ h(s, 1) = f ∘ E (s),
which means f ∘ D (s) ∼ f ∘ E (s). Hence f∗ is well dened. Next f∗ ([D ][E ]) = f∗ ([D ∘ E ]) = [ f ∘ (D ∘ E )] = [( f ∘ D ) ∘ ( f ∘ E )] = [ f ∘ D ][ f ∘ E ] = f ∗ [D ] f∗ [E ]. Hence, f ∗ is a group homomorphism. Roughly speaking, for product space its fundamental group is the product of the fundamental groups. Proposition 4.5. Let X, Y be two path connected topological spaces. Then
S1 (X × Y ) ∼ = S1 (X ) × S1 (Y ).
(4.10)
Proof. Let x0 ∈ X and y0 ∈ Y , p : X ×Y → X and q : X ×Y → Y the natural projections. Assume D (s) = (x(s), y(s)) be a loop on the product space based on (x0 , y0 ). Then p∗ : S1 (X × Y ) → S1 (X) is a homomorphism, and p∗ ([D ]) = [x(s)]. Similarly, q∗ : S1 (X × Y ) → S1 (Y ) is also a homomorphism, and p∗ ([D ]) = [y(s)]. We claim that (p∗ × q∗ ) : S1 (X × Y ) → S1 (X ) × S1 (Y ) is an isomorphism. For each pair [x(s)] × [y(s)] ∈ S1 (X ) × S1 (Y ) we can construct [x(s), y(s)] ∈ S1 (X × Y ), such that (p∗ × q∗ )([x(s) × y(s)]) = [x(s)] × [y(s)] ∈ S1 (X) × S1 (Y ). Hence, p∗ × q∗ is surjective. To see that it is also injective, let Di = (xi (s), yi (s)), i = 1, 2 be such that (p∗ × q∗ )([D1 ]) = p∗ × q∗ ([D2 ]). Then [x1 ] = [x2 ] and [y1 ] = [y2 ]. That is x1 (s) ∼ x2 (s),
y1 (s) ∼ y2 (s).
Let the homotopies between them be h1 (s,t) and h2 (s,t) respectively. Then we construct H(s,t) = (h1 (s,t), h2 (s,t)). It is easy to verify that this is a homotopy between D1 and D2 . That is [D1 ] = [D2 ]. Hence p∗ × q∗ is injective. ⊔ ⊓
108
4 Algebra, Lie Group and Lie Algebra
Example 4.14. Consider a torus (Refer to Example 2.19), denote it by T 2 . It is easy to see that T 2 ∼ = S1 × S1 . (In fact, it can be considered as a particular case of the general denition of T k ∼ ⋅ ⋅ × S21 .) According to the above proposition: = S/ 1 × ⋅01 k
S1 (T ) ∼ = S1 (S1 ) × S1(S1 ) ∼ = ℤ × ℤ = ℤ2 . 2
Next, we will prove an important fact that the fundamental group is invariant under homotopy. We need some preparation. Lemma 4.5. Let g, f be two homotopic continuous mapping from X to Y, H(x,t) a homotopy from g to f . For x ∈ X, dene a path
Z = H(x, s),
s ∈ I = [0, 1].
Then the following graph Fig. 4.3 is commutative. That is, Z∗ ∘ f∗ = g∗ .
Fig. 4.3
Z∗
Proof. Mind that the denition of f∗ , g∗ is different from Z∗ . They have a different meaning. Let [D ] ∈ S1 (X, x). We have to show that g ∘ D ≃({0},{1}) Z ∘ ( f ∘ D ) ∘ Z −1.
(4.11)
Since H is a homotopy from g to f , setting x = D (r) we have a graph as Fig. 4.4 (a). Our purpose is to construct a homotopy such that Fig. 4.4 (b) holds. On two slices t = 4s and t = 4(1 − s), we need Z (t). Then it is easy to see that on the left and right triangle areas we can use Z (4s) and Z (4 − 4s) respectively. For the center trapezoid, we have only to deform Fig. 4.4 (a) by 4s − t . 4 − 2t Summarizing them, we obtain the following homotopy: ⎧ Z (4s), 4s ⩽ t )) ⎨ ( ( ˜ H(s,t) = H D 4s − t ,t , t ⩽ 4s ⩽ 4 − t 4 − 2t ⎩ Z (4 − 4s), 4s ⩾ 4 − t. r=
(4.12)
⊔ ⊓
4.5 Covering Space
Fig. 4.4
109
Homotopy of Two Mappings with A Path
Theorem 4.6. Let X, Y be two path connected spaces, f : X ≃ Y a homotopy. Then f∗ : S1 (X ) ∼ = S1 (Y ). Proof. Let x ∈ X and y = f (x) ∈ Y and g : Y → X the homotopy inverse of f . Denote by F : g ∘ f ≃ idX , G : f ∘ g ≃ idY , the corresponding homotopies. Set paths
D (s) := F(x, s), Using Lemma 4.5, we have {
E (s) := G(x, s).
g∗ ∘ f∗ = D∗ (idX )∗ = D∗ f∗ ∘ g∗ = E∗ (idY )∗ = E∗ .
Note that both D∗ and E∗ are isomorphisms, because, say, D −1 = F(x, 1 − s) and hence D∗ D∗−1 = (id)∗ . Therefore, both f∗ and g∗ are isomorphic. ⊔ ⊓
4.5 Covering Space ˜ p) is called a covering space of Denition 4.15. Let X be a topological space. (X, X if (i). X˜ is a topological space, and p : X˜ → X, called the projection, is a continuous surjective mapping; (ii). For each x ∈ X , there exists a neighborhood, U, called a basic neighborhood, such that p−1 (U) consists of disjoint open sets, {VO ∣ O ∈ / }. Moreover, for each O , p : VO → U is a homeomorphism. ˜ The cardinal number of / , ∣/ ∣ is called the multiplicity of X.
110
4 Algebra, Lie Group and Lie Algebra
Proposition 4.6. Let (X˜ , p) be a covering space of X, and f : I → X a path with ˜ f (0) = x0 . Suppose a point x˜0 ∈ p−1 (x0 ). Then there exists a unique path f˜ : I → X, such that f˜(0) = x˜0 and p ∘ f˜ = f . Proof. If f (I) is contained in a basic neighborhood, the conclusion is obvious. Otherwise, Let {UO ∣ O ∈ / } be a covering consists of basic neighborhoods. Then { f −1 (UO ) ∣ O ∈ / } is an open covering of I. Let n be large enough such that 1n i is less than the Lebesgue number of the cover. Setting Ii = [ i−1 n , n ], i = 1, 2, ⋅ ⋅ ⋅ , n, then each f (Ii ) is contained in a basic neighborhood. Starting with i = 1 it is easily seen that each f (Ii ) has a unique lift with the initial point as the end point of the previous path lift. ⊔ ⊓ Note that from above proof we can easily see that the set I can be replaced by any compact set in a nite dimensional normed space. Then the following is an immediate consequence: Proposition 4.7. Let (X˜ , p) and X be as in the above, and f : I × I → X a path homotopy, f (0, 0) = x0 , x˜0 ∈ p−1 (x0 ). Then there exists a unique path homotopy ˜ g(0, 0) = x˜0 , such that p ∘ g = f . g : I × I → X, ˜ p) and X be as in the above, x˜0 ∈ p−1 (x0 ). Then p∗ : Proposition 4.8. Let (X, ˜ S (X, x˜0 ) → S (X, x0 ) is a one-to-one homomorphism. Proof. Refer to Example 4.13 to show it is a homomorphism. Here we will only prove it is injective. Let D˜ , E˜ be two loops with x˜0 as their base point. Suppose p∗ ([D˜ ]) = p∗ ([E˜ ]), and denote D = p ∘ D˜ and E = p ∘ E˜ . Then D ∼ E , say, with a homotopy h(s,t). That is, h(s, 0) = D (s), h(s, 1) = E (s), h(0,t) = x0 . ˜ By Proposition 4.7, there is a unique h(s,t) such that ˜ 0) = x˜0 , h(0,
p ∘ h˜ = h.
˜ 0) = D , by Proposition 4.6, Since p ∘ h(s, ˜ 0) = D˜ (s). h(s, Similarly, We conclude that i.e., [D˜ (s)] = [E˜ (s)].
˜ 1) = E˜ (s). h(s,
D˜ (s) ∼ E˜ (s), ⊔ ⊓
Intuitively, we may say that the covering space enlarged the original space but simplied the topological structure, which is one of the implications of the above proposition. The following theorem shows that the lifting paths form the same group at different base points:
4.5 Covering Space
111
Theorem 4.7. Let (X˜ , p) and X be as in the above. Then {p∗ S (X˜ , x˜0 ) ∣ x˜0 ∈ p−1 (x0 )} is a set of conjugate subgroup of S (X , x0 ). Proof. Let p(x˜1 ) = p(x˜2 ) = x0 , J be a path connecting x˜1 to x˜2 . Then p∗ ([J ]) = [p ∘ J ] ∈ S (X , x0 ). ˜ x˜1 ) → S (X, ˜ x˜2 ) as Dene an isomorphism u : S (X, u([D ]) = [J ]−1 [D ][J ] and an isomorphism v : S (X, x0 ) → S (X , x0 ) as v([E ]) = (p∗ [J ])−1 [E ](p∗ [J ]). It is easily seen that the graph Fig. 4.5 is commutative.
Fig. 4.5
Path Homotopy
Namely,
˜ x˜2 ) = [p ∘ J ]−1[p∗ S (X, ˜ x˜1 )][p ∘ J ]. p∗ S (X,
⊔ ⊓
Finally we introduce a theorem for the existence of covering spaces. (Refer to [5] for the proof.) We need a new concept rst. A topological space, X, is said to be semilocally simply connected if each point x ∈ X has a simply connected neighborhood. Theorem 4.8. Let X be a topological space satisfying (i). path connected; (ii). locally connected; (iii). semilocally simply connected. Then there exists a covering space, called the universal covering space (X˜ , p), satisfying (i). If (X˜1 , p1 ) and (X˜2 , p2 ) are two universal covering spaces, then X˜ 1 and X˜2 are homeomorphic. Moreover, the homeomorphism, f , makes the following graphs (Fig. 4.6 (a) and (b)) commutative. (ii). If (X˜ , p) is a universal covering space of X, and (Y, q) is a covering space, ˜ S ) is a covering space of Y . then there exists a mapping S : X˜ → Y , such that (X, Moreover, the following graph (Fig. 4.7) commute.
112
4 Algebra, Lie Group and Lie Algebra
Fig. 4.6
University Covering Space
Fig. 4.7
Covering Space
Fig. 4.8
ℝ as the Covering Space of S1
Example 4.15. Let p : ℝ → S1 be dened as p : t $→ (cos(2πt), sin(2πt)). Choose ˆ any point x0 ∈ S1 , say x0 = (1, 0). Consider a neighborhood U = Px 0 Q, which is −1 the right semi-sphere. This is a basic neighborhood because p (U) = {Vk {=}(k − 1 1 2 , k + 2 ) ∣ k ∈ ℤ}. Now the restriction p : Vk → U is a homeomorphism. Hence p is a projection. It results that (ℝ, p) is a covering space of S1 . The multiplicity is F0 . (i.e., countable.) Since S (ℝ) = {0} and S (S1 ) ∼ = ℤ, the induced homomorphism p∗ is p∗ S (ℝ) = {0} < ℤ. (Refer to Fig. 4.8.)
4.6 Lie Group
113
4.6 Lie Group Denition 4.16. A set G is a Lie group, if (i). G is a group; (ii). G is an analytic differentiable manifold; (iii). The group operation ⊗ : G × G → G is analytic; The inverse operation: G → G, as: g $→ g−1 , is analytic. Consider Mn the set of n × n matrices. Set V (A) = (AT1 , ⋅ ⋅ ⋅ , ATn )T ,
A ∈ Mn ,
where Ai is the i-th column of A. Then V is a bijective mapping. Through V and V −1 we can identify Mn with ℝn×n . Later on, we will give Mn the conventional topology of ℝn×n . Example 4.16. Consider GL(n, ℝ) ⊂ Mn . It is an open subset of Mn , and hence it is an n × n analytic manifold. As we have mentioned above, with the matrix multiplication it is also a group. Finally, by considering the elements ai, j as the coordinates of A, one sees that both A × B → AB and A → A−1 are analytic. We conclude that GL(n, ℝ) is a Lie group. In fact, this is a very important Lie group, called the general linear group. Denition 4.17. Given a Lie group G. A subset H ⊂ G is called a Lie subgroup if (i). H is a subgroup of G; (ii). H is a regular sub-manifold of G; (iii). With the subgroup structure and sub-manifold structure, H is a Lie group. Remark 4.3. In some books the Lie subgroup H ⊂ G is dened as an immersed sub-manifold. Hence, H may not be a closed sub-manifold of G. Unless elsewhere stated, we consider only closed Lie subgroup to avoid some complex discussion. Theorem 4.9. Let H ⊂ G be a subgroup of Lie group G. In addition, it is also a regular sub-manifold. Then 1. H itself is a Lie group; 2. H is a closed subgroup of G. Proof. 1. Let gi ∈ H, i = 1, 2, 3. g1 g2 = g3 , and (Ui , Ii ), i = 1, 2, 3 be at coordinate charts around gi , i = 1, 2, 3 respectively. Say, dim(G) = m and dim(H) = n. Under the at coordinates we denote g1 = (x1 , ⋅ ⋅ ⋅ , xn , 0, ⋅ ⋅ ⋅ , 0), g2 = (y1 , ⋅ ⋅ ⋅ , yn , 0, ⋅ ⋅ ⋅ , 0), g3 = (z1 , ⋅ ⋅ ⋅ , zn , 0, ⋅ ⋅ ⋅ , 0). Then the product: U1 ×U2 → U3 (by possibly shrinking U1 and U2 ) can be expressed as zi = zi (x1 , ⋅ ⋅ ⋅ , xm , y1 , ⋅ ⋅ ⋅ , ym ), Restricting it to H, we have
i = 1, ⋅ ⋅ ⋅ , m.
114
4 Algebra, Lie Group and Lie Algebra
z˜i = zi (x1 , ⋅ ⋅ ⋅ , xn , 0, ⋅ ⋅ ⋅ , 0, y1 , ⋅ ⋅ ⋅ , yn , 0, ⋅ ⋅ ⋅ , 0),
i = 1, ⋅ ⋅ ⋅ , m,
which is obviously analytic. A similar argument shows that g $→ g−1 is also analytic. Hence H is a Lie group. 2. Let hi ∈ H and hi → h0 , and (U, x) be a at coordinate chart about h0 . Then for some N > 0 when i > N, hi ∈ U. Denote hi = (xi1 , ⋅ ⋅ ⋅ , xin , 0, ⋅ ⋅ ⋅ , 0). Since hi → h0 , xij → xi0 , i → f, j = 1, ⋅ ⋅ ⋅ , m, it is easily seen that h0j = 0, j = n + 1, ⋅ ⋅ ⋅ , m. That is, h0 ∈ H. H is therefore closed. ⊔ ⊓ In fact, the converse of the above 2 is also true. That is: A closed subgroup of a Lie group is a Lie subgroup [6]. Theorem 4.10. Let F : G1 → G2 be a Lie group homomorphism. Then the rank of F is constant. Moreover, the kernel, K = ker(F), is a Lie subgroup of G1 with codimension codim(K) = rank(F). Proof. From Theorem 3.1, if the rank of F is constant, then K = F −1 (e) is a closed sub-manifold of G1 with co-dimension of rank(F). Thus it is a Lie subgroup. So it sufces to prove the constancy of the rank of F. Let a ∈ G1 and b = F(a) ∈ G2 . Then F(x) = F(a)F(a−1 x) = bF(a−1 x) := Lb F(a−1 x), where Lb stands for left-multiplication by b. Now it is obvious that Lb is analytic. Moreover, its inverse, (Lb )−1 = Lb−1 is also analytic. It is therefore a diffeomorphism. We conclude that rank(F(x)) = rank(F(a−1 x)). Since a ∈ G1 is arbitrary, rank (F) is constant everywhere.
⊔ ⊓
Example 4.17. 1. Special linear group: Let SL(n, ℝ) = {A ∈ GL(n, ℝ) ∣ det(A) = 1}. SL(n, ℝ) is called the special linear group, which is a Lie subgroup of GL(n, ℝ). 2. Orthogonal group: Let O(n, ℝ) = {A ∈ GL(n, ℝ) ∣ AT A = I}. O(n, ℝ) is called the orthogonal group, which is a Lie subgroup of GL(n, ℝ). 3. Unitary group: Let U(n, ℂ) = {A ∈ GL(n, ℂ) ∣ A¯T A = I}. U(n, ℝ) is called the unitary group, which is a Lie subgroup of GL(n, ℂ). 4. Symplectic group: Denote ] [ 0 In . J= −In 0
4.7 Lie Algebra of Lie Group
115
Dene Sp(2n, ℝ) = {A ∈ GL(2n, ℝ) ∣ AT JA = J}. Sp(2n, ℝ) is called the symplectic group , which is a Lie subgroup of GL(2n, ℝ). The arguments are more or less similar. We give a detailed discussion for SL(n, ℝ). Consider F : GL(n, ℝ) → (ℝ+ , ×), dened as A → F(A) = det(A). It is obvious that F is a Lie group homomorphism. For any A = (ai j ) ∈ GL(n, ℝ), denote by Ai j the algebraic complement minor of ai j . Since F(A) =
n
¦ (−1)k−1a1k det(A1k ) ∕= 0,
k=1
there exists at least one k such that det(A1k ) ∕= 0. Hence
wF = (−1)k−1 det(A1k ) ∕= 0, w a1k which means rank(F) = 1. Theorem 4.10 tells us that SL(n, ℝ) = ker(F) is a Lie subgroup of GL(n, G) of dimension n2 − 1. For a differentiable manifold M, under Lie bracket [⋅, ⋅], V (M) becomes a Lie algebra. Hence, it is convenient to consider V (M) as a Lie algebra.
4.7 Lie Algebra of Lie Group Consider a Lie group G and let a ∈ G. From the above discussion we know that the left-multiplication (or left-displacement) La : G → G, dened as g $→ ag, is a diffeomorphism. Let X ∈ V (G). X is called a left-invariant vector eld if (La )∗ X = X ,
∀a ∈ G.
Similarly, we can dene a right-invariant vector eld and obtain all parallel results. Now we denote the set of left-invariant vector elds on G by g(G), or simply g, i.e., g = {X ∈ V (G) ∣ (La )∗ X = X , ∀a ∈ G}. g is a Lie sub-algebra of V (M). To see this let X , Y ∈ g and D , E ∈ ℝ, and a ∈ G. Then 1. (La )∗ (D X + E Y ) = D (La )∗ X + E (La )∗Y = D X + E Y ; 2. (La )∗ [X ,Y ] = [(La )∗ X , (La )∗Y ] = [X ,Y ]. Denition 4.18. Given a Lie group G, the set g of the left-invariant vector elds, g = g(G) is called the Lie algebra of the Lie group G. Proposition 4.9. Let X ∈ g. Dene a mapping < : g → Te (G) as X $→ Xe . Then < is a linear isomorphism. Proof. Linearity is trivial. We only need to show that it is bijective. Assuming X ∕= Y , then at a certain point x ∈ G, X(x) ∕= Y (x). Thus
116
4 Algebra, Lie Group and Lie Algebra
(Lx−1 )∗ Xx ∕= (Lx−1 )∗Yx . That is: Xe ∕= Ye . So < is one to one. To show that this mapping is a surjective, let Xe ∈ Te (G) and dene a vector eld as X(x) = (Lx )∗ Xe . Since Lx is analytic, X(x) is obviously an analytic vector eld. To see that Xe ∈ g we have only to show that it is left-invariant. For any b ∈ G (Lb )∗ Xx = (Lb )∗ ((La )∗ Xe ) = (Lbx )∗ Xe = Xbx , ⊔ ⊓
which completes the proof.
The above theorem tells that dim(g(G)) = dim(G). It is easily seen by continuity that left-invariant vectors on Lie group are complete. So we can dene the following: Denition 4.19. (Exponential Mapping) Let X ∈ g(G). Dene an exponential mapping exp : g → G as exp(X) = eX1 (e).
(4.13)
Then it is obviously true that exp(tX) = etX (e). Moreover, if G = GL(n, F) or its subgroup, the exponential mapping becomes the conventional matrix exponential mapping. Example 4.18. If we identify a left-invariant vector eld X(x) with its value at identity X(e), we have the following: (The eld F can be either ℝ or ℂ) 1. The Lie algebra of GL(n, F) is gl(n, F). 2. The Lie algebra of SL(n, ℝ) is sl(n, ℝ), where sl(n, ℝ) = {X ∈ gl(n, ℝ) ∣ tr(X) = 0}. 3. The Lie algebra of O(n) is o(n), where o(n) = {X ∈ gl(n, ℝ) ∣ X T = −X}. 4. The Lie algebra of U(n) is u(n), where u(n) = {X ∈ gl(n, ℂ) ∣ X¯T = −X}. 5. The Lie algebra of Sp(2n, ℝ) is sp(2n, ℝ), where sp(2n, ℝ) = {X ∈ gl(2n, ℝ) ∣ X T J + JX = 0}. Example 4.19. Denote SO(n) = {A ∈ O(n) ∣ det(A) = 1},
4.8 Structure of Lie Algebra
117
which is called the special orthogonal group. Consider the Lie algebra of SO(n). Note that the Lie algebra of a Lie group depends only on the property of the Lie group around the identity. Hence if a Lie group as a topological space has several disconnect components, its Lie algebra is determined by the component containing its identity. So O(n) and SO(n) have the same Lie algebra, namely, o(n). In fact, all nite dimensional Lie algebras are basically a sub-algebra of gl(n, F). Theorem 4.11. (Ado’s Theorem) Any nite dimensional Lie algebra g over eld F is isomorphic to a subalgebra of gl(n, F). For a proof we refer to [3]. The following theorem is fundamental for the relationship between Lie group and their Lie algebra. Theorem 4.12. Each nite dimensional Lie algebra, g, corresponds to a unique ˜ Moreover, any other connected Lie connected, simply connected Lie group G. group, G, having g as its Lie algebra is isomorphic to the quotient group of G˜ over a discrete normal subgroup D, i.e., ˜ G ≃ G/D. We refer to [4] for details. In fact, all Lie groups G with the same g as their Lie ˜ All of them are locally isomoralgebra have a common uniform covering space G. phic.
4.8 Structure of Lie Algebra Lie algebra itself is an important concept and useful tool in mathematics as well as in systems and control theory. This section considers Lie algebra independently. We refer to [2] for details. Let L be a given Lie algebra. We dene a sequence of ideals of L , called the derived series, as [ ] L (0) = L , L (k+1) = L (k) , L (k) , k ⩾ 0. Denition 4.20. A Lie algebra, L , is solvable if there exist a k∗ > 0 such that ∗
L (k ) = 0.
(4.14)
For a given Lie algebra, L , we can also dene a descending central series as [ ] L 0 = L , L k+1 = L , L k , k ⩾ 0. Denition 4.21. A Lie algebra, L , is nilpotent if there exist a k∗ > 0 such that ∗
L k = 0.
(4.15)
It follows from the denitions that if a Lie algebra, L , is solvable, it is also nilpotent.
118
4 Algebra, Lie Group and Lie Algebra
Denition 4.22. 1. A Lie algebra, L , is said to be simple, if it has no nontrivial idea. That is, L has no idea except {0} and itself. 2. A Lie algebra, L , is said to be semi-simple, if it has no non-zero solvable idea. Denition 4.23. The largest solvable idea of L is called its radical, denoted by r. Theorem 4.13. (Levi Decomposition)[6] A Lie algebra can be decomposed as L = s ⊕ r,
(4.16)
where s is a semi-simple Lie algebra, r is the radical of L . The solvability and the semi-simple property of a Lie algebra can be veried via its representation. We discuss it in the following. Let G be a Lie algebra, and V be an n dimensional vector space, gl(V ) be the Lie algebra consists of all linear transformations on V . (When the basis of V is xed, it becomes gl(n, ℝ).) Denition 4.24. A Lie algebra homomorphism I : G → gl(V ) is called a representation of G on V . The representation of G on itself is called an adjoint representation, and denoted by adG . Example 4.20. sl(2, ℝ) is the set of 2 × 2 real matrices, whose traces equal to zero. It is easy to verify that sl(2, ℝ) is a Lie sub-algebra of gl(n, ℝ). A basis of sl(2, ℝ) is: ] [ [ ] [ ] 1 0 01 00 , e2 = , e3 = . e1 = 0 −1 00 10 Then we can calculate adG . Note that [e1 , e2 ] = e1 e2 − e2 e1 = 2e2 , [e1 , e3 ] = e1 e3 − e3 e1 = −2e3 , [e2 , e3 ] = e2 e3 − e3 e2 = e1 . We also know that [ei , ei ] = 0,
[ei , e j ] = −[e j , ei ],
i, j = 1, 2, 3.
It is clear that corresponding to this set of basis the matrix forms of the adjoint representations of ei are ⎡ ⎤ ⎡ ⎤ ⎡ ⎤ 00 0 0 01 0 −1 0 ade1 = ⎣0 2 0 ⎦ , ade2 = ⎣−2 0 0⎦ , ade1 = ⎣0 0 0⎦ . 0 0 −2 0 00 2 0 0 Now let D ∈ sl(2, ℝ), with D = D1 e1 + D2 e2 + D3 e3 . We express it in vector form as D = (D1 , D2 , D3 )T . Let E = adei D = (E1 , E2 , E3 )T . Then in vector form we have
E = adei D .
References
119
Denition 4.25. The Killing form of a Lie algebra G is dened as K(X ,Y ) = tr(adX adY ),
X,Y ∈ G .
(4.17)
Theorem 4.14. [6] A Lie algebra G is solvable, if and only if K(X ,Y ) ≡ 0,
X,Y ∈ G .
(4.18)
Assume G is a nite dimensional Lie algebra with a basis {e1 , ⋅ ⋅ ⋅ , en }. For this basis we can dene an n × n matrix as MK = (K(ei , e j )),
(4.19)
i.e., the (i, j)-th element of the matrix is K(ei , e j ). It is easy to check that the rank of MK is independent of the choice of the basis. Moreover, we have the following. Theorem 4.15. [6] A nite dimensional Lie algebra G is semi-simple, if and only if its Killing matrix is non-singular.
References 1. Croom F. Basic Concepts of Algebraic Topology. New York: Springer-Verlag, 1978. 2. Humphreys J. Introduction to Lie Algebras and Representation Theory, 2nd edn. New York: Springer-Verlag, 1970. 3. Jacobson N. Lie Algerba. New York: Interscience Publishers, 1962. 4. Pontryagin L S. Topological Groups, 2nd edn. New York: Gordon and Breach, 1966. 5. Massey W. Algebraic Topology: An Introduction. New York: Springer-Verlag, 1967. 6. Varadarajan V. Lie Groups, Lie Algebras, and Their Representations. New York: SpringerVerlag, 1984.
Chapter 5
Controllability and Observability
In section 5.1 we consider controllability of nonlinear systems. The materials are mainly based on [11, 10]. We also refer to [5, 9] for related results, to [4] for later developments. Section 5.2 is about observability of nonlinear systems. The observability of nonlinear control systems is closely related to their controllability [1, 3, 8]. The Kalman decomposition of nonlinear systems is investigated in section 5.3. This section is based on [2]. We refer to [6, 7] for decomposition of nonlinear control systems.
5.1 Controllability of Nonlinear Systems Consider a nonlinear system x = f (x, u), x ∈ ℝn , u ∈ ℝm y = h(x), y ∈ ℝ p ,
(5.1)
where x is the state variable, y the output, and u the control. In (5.1), f (x, u) is a smooth mapping. In most cases it is assumed that f (0, 0) = 0. Depending on the context “smooth” could mean Cr , Cf or CZ respectively. Mostly, h(x) is also assumed to be smooth (as smooth as f (x, u)) with h(0) = 0. u can assumed to be piecewise continuous or measurable or smooth as you wish. (In fact, it does not affect the controllability and observability much [11].) When u = u(t), it is called an open-loop control; when u = u(x) (u = u(y)) it is called a state feedback (output feedback) closed-loop control. Generally, the state, control and output spaces may be replaced by n, m, and p dimensional manifolds respectively. A particular form of system (5.1) is afne nonlinear system, which is nonlinear in state x and linear in control u. An afne nonlinear control system is generally described as ⎧ m ⎨x = f (x) + gi (x)ui := f (x) + g(x)u, x ∈ ℝn , u ∈ ℝm ¦ (5.2) i=1 ⎩y = h(x), y ∈ ℝ p . The afne nonlinear systems are the main object in this book. In fact, it is also the main object of nonlinear control theory. In the geometric approach, the f (x) and gi (x), i = 1, ⋅ ⋅ ⋅ , m in system (5.2) are considered as smooth vector elds on ℝn . D. Cheng et al., Analysis and Design of Nonlinear Control Systems © Science Press Beijing and Springer-Verlag Berlin Heidelberg 2010
122
5 Controllability and Observability
Consider system (5.2). The state space, M, is assumed to be ℝn or any path connected n dimensional differentiable manifold. Let the control, u(t), be measurable functions. For the ease of statement, we also assume that for any feasible control u the vector eld f (x, u) is complete. Although this assumption is not necessary for the following discussion on controllability, It serves the purpose of avoiding discussion of the existence of solution over t. Let x0 ∈ M. If there exists a feasible control u and a moment T > 0 such that the trajectory x(t) satises: x(0) = x0 and x(T ) = x1 , then x1 is said to be in the reachable set of x0 . The reachable set of x0 is denoted by R(x0 ). The reachable set at a particular moment T is denoted by R(x0 , T ). Denition 5.1. Consider system (5.1) and let x0 ∈ M. If the reachable set R(x0 ) = M, the system (5.1) is said to be controllable at x0 . If R(x) = M,
∀x ∈ M,
the system (5.1) is said to be controllable. In many cases it is difcult to get the global properties of a nonlinear system, so we turn to consider the local situation. As for local controllability, let x0 ∈ M and U be a neighborhood of x0 . A point x1 is said to be U-reachable, if x1 ∈ U and there exists a feasible control u and a moment T > 0, such that the trajectory x(t) satises x(0) = x0 , x(T ) = x1 and x(t) ∈ U, 0 ⩽ t ⩽ T. The U-reachable set of x0 is denoted by RU (x0 ). Denition 5.2. Consider system (5.1) and let x0 ∈ M. If for any neighborhood U of x0 the reachable set RU (x0 ) is also a neighborhood of x0 , system (5.1) is said to be locally controllable at x0 . If the system is locally controllable at each x ∈ M, system (5.1) is said to be locally controllable. Neither controllability nor local controllability is symmetric with respect to any two ending points. That is, for two given points x1 , x2 ∈ M, x2 ∈ R(x1 ) doesn’t mean x1 ∈ R(x2 ). Similarly, there exists a neighborhood U of x1 such that x2 ∈ RU (x1 ) does not mean x1 ∈ RU (x2 ). We give a symmetric denition as follows: Denition 5.3. Let x0 , xT ∈ M be given. If there exist x1 , ⋅ ⋅ ⋅ , xk = xT , such that or xi ∈ R(xi−1 ),
or xi−1 ∈ R(xi ),
i = 1, ⋅ ⋅ ⋅ , k,
then xT is said to be weakly reachable from x0 . The weakly reachable set of x0 is denoted by W R(x0 ). Similarly, we can dene a locally weakly reachable set as Denition 5.4. For system (5.1), xT is said to be locally weakly reachable from x0 with respect to a neighborhood, U, if there exist x0 , x1 , ⋅ ⋅ ⋅ , xk = xT , such that the trajectories xs (t) either from xs−1 to xs , or from xs to xs−1 , are contained in U, s = 1, ⋅ ⋅ ⋅ , k. The locally weakly reachable set of x0 with respect to U is denoted as W RU (x0 ).
5.1 Controllability of Nonlinear Systems
123
Denition 5.5. System (5.1) is weakly controllable at x0 ∈ M if the weakly reachable set W R(x0 ) = M. The system is said to be weakly controllable if it is weakly controllable everywhere, i.e., W R(x) = M, ∀x ∈ M. The system is said to be locally weakly controllable at x0 ∈ M, if for any neighborhood U of x0 the locally weakly reachable set W RU (x0 ) is still a neighborhood of x0 . If System (5.1) is locally weakly controllable at every x ∈ M, the system is said to be locally weakly controllable. Proposition 5.1. If system (5.1) is locally weakly controllable, then it is weakly controllable. Proof. For any two points x0 , xT draw a path P = {p(t) ∣ 0 ⩽ t ⩽ 1}, connecting x0 and xT . Using local weak controllability, for each point x = p(t), 0 ⩽ t ⩽ 1, there exists an open neighborhood Vx ⊂ W RU (x). Then ∪x∈PVx ⊃ P, is an open covering of the compact set P. Thus we can nd a nite sub-covering {Vxi ∣ 1 ⩽ i ⩽ k}. By the symmetry of local weak controllability, xi+1 ∈ W R(xi ),
i = 0, ⋅ ⋅ ⋅ , k,
where xk+1 := xT . Therefore, xT ∈ W R(x0 ), which means the system is weakly controllable. ⊔ ⊓ A point xT is said to be reachable from x0 with negative time, denoted as xT ∈ f (x,u) (x0 ) = xT . R− (x0 ) if there exists a feasible u and t < 0 such that et Proposition 5.2. Assume the feasible controls are state feedback controls, u = u(x), which are piecewise constant, then R± (x0 ) = W R(x0 ). f (x,u)
(5.3) f (x,u)
(x0 ). Then x0 = e−t (xT ). Now Proof. Assume xT ∈ R(x0 ). That is, xT = et f (x,u ) ± assume xT ∈ R (x0 ), namely there exist x1 , ⋅ ⋅ ⋅ , xk = xT , ui , Gi , such that eG i (xi ) = i xi+1 , i = 0, ⋅ ⋅ ⋅ , k. If Gi > 0, xk+1 ∈ R(xk ); and if Gi < 0, xk ∈ R(xk+1 ). That is, xT ∈ W R(x0 ). Similarly, xT ∈ W R(x0 ) implies xT ∈ R± (x0 ). ⊔ ⊓ In the following we assume that the feasible controls are piecewise constant. Dene a set of vector elds as F = { f (x, u) ∣ u = const.}. Denition 5.6. The Lie algebra generated by F, F = {F}LA is called the accessibility Lie algebra. Consider F as a distribution. If dim(F )(x0 ) = n, then it is said that the accessibility rank condition of the system (5.1) is satised at x0 . If the accessibility rank condition is satised at every x ∈ M, it is said that for system (5.1) the accessibility rank condition is satised.
124
5 Controllability and Observability
Proposition 5.3. System (5.1) is controllable, if (i). M is simply connected; (ii). all the vector elds in F are complete; (iii). if X ∈ F, then −X ∈ F; and (iv). the accessibility rank condition is satised. Proof. Note that condition (iii) implies that R± (x) = R(x),
∀x ∈ M.
Then the negative t is allowed. Using Chow’s theorem, the conclusion follows.
⊔ ⊓
Example 5.1. For an afne nonlinear system (5.2), if the drifting term f (x) = 0, then condition (iii) in the above Proposition 5.3 is satised automatically. Thus if M is simply connected; gi , i = 1, ⋅ ⋅ ⋅ , m are complete; and dim{g1 , ⋅ ⋅ ⋅ , gm }LA = n, the system is controllable. In general, to verify controllability of a nonlinear control system is a hard work. Thus we consider some weaker types of controllability. Weak controllability and local weak controllability are two of them. We consider the relationship between weak controllability and the accessibility rank condition. Theorem 5.1. Consider system (5.1), if the accessibility rank condition is satised at x0 , the system is locally weakly controllable at x0 . Proof. Since rank(F x0 ) = n, there exists a neighborhood U of x0 such that rank(F x ) = n, x ∈ U. Now if X (x0 ) = 0, ∀X ∈ F, it is obvious that rank(F x ) = 0. Therefore, there exists a f1 ∈ F such that f1 (x) ∕= 0, x ∈ U1 ⊂ U. Then we have an f integral curve, et11 (x0 ), −H1 < t1 < H1 , which is a one dimensional sub-manifold, denoted by L1 . We then claim that there exists a −H1 < t10 < H1 , and f2 ∈ F such that f at t10 , f2 (x1 ) ∕∈ Tx1 (L1 ), where x1 = et 01 (x0 ). Otherwise dim (F (x)) = 1, x ∈ L1 . (We 1
leave the detailed verication to reader.) Now consider the mapping
S2 (t2 ,t1 ) := etf22 etf11 (x0 ). Since the Jacobian matrix JS2 (0,t10 ) = ( f2 (x1 ), f1 (x1 )) is nonsingular, locally this is a diffeomorphism from ∣t2 ∣ < H2 , ∣t1 − t10 ∣ < e1 to the image of S2 . The image is a two dimensional manifold, denoted by L2 . Using the above argument again, we can show that there exists ∣t20 ∣ < H2 and ∣t˜10 − t10 ∣ < e1 , f f such that for a f 3 ∈ F, f3 (x2 ) ∕∈ Tx2 (L2 ), where x2 = et 02 et˜01 (x0 ). For notational ease, we still use t10 for t˜10 and dene
2
1
S3 (t3 ,t2 ,t1 ) := etf33 etf22 etf11 (x0 ). We obtain a three dimensional sub-manifold L3 this way. Continuing this procedure, we can nally nd f1 , ⋅ ⋅ ⋅ , fn ∈ F and construct a local diffeomorphism
5.1 Controllability of Nonlinear Systems
Sn (tn , ⋅ ⋅ ⋅ ,t2 ,t1 ) := S2 (t2 ,t1 ) := etfnn ⋅ ⋅ ⋅ etf22 etf11 (x0 ),
125
(5.4) f
0 from a neighborhood Vn of (0,tn−1 , ⋅ ⋅ ⋅ ,t10 ) ∈ ℝn to a neighborhood Un of e0n ⋅ ⋅ ⋅ f2 f1 et 0 et 0 (x0 ). In addition, we can construct a diffeomorphism 2
1
f
f
f
G(x) = e−t1 0 e−t2 0 ⋅ ⋅ ⋅ e−tn−1 0 (x), 1
2
n−1
x ∈ Un ,
which maps Un back to a neighborhood of x0 . Finally, we dene
S := G ∘ Sn (t),
t ∈ Vn ,
which is a local diffeomorphism from Vn to a neighborhood of x0 . By denition
S (Vn ) ⊂ W RU (x0 ). That is, the system is locally weakly controllable at x0 .
⊔ ⊓
Conversely, if the system is locally weakly controllable or even weakly controllable, we would like to know whether the accessibility rank condition is satised. Proposition 5.4. Assume system (5.1) is locally weakly controllable, then there exists an open dense set D ⊂ M such that the accessibility rank condition is satised on D, i.e., dim{F }∣x = n, x ∈ D. Proof. If the accessibility rank condition is satised at a point x0 , then there is a neighborhood, Ux0 of x0 , such that the accessibility rank condition is satised at all x ∈ Ux0 . So, it is obvious that the set of points, D, where the accessibility condition is satised, is an open set. Now assume D is not dense. Then there is an open set U ∕= ∅, such that dim{F }∣x < n, x ∈ U. Let k be the largest dimension of F on U, i.e., k = max dim {F }∣x < n. x∈U
Then there exists a non-empty open subset V ⊂ U, such that dim{F }∣x = k,
x ∈ V.
According to Frobenius’ theorem, for any x0 ∈ V , there exists an integral submanifold of F , I(F , x0 ), which has dimension k. It is obvious that WAV (x0 ) ⊂ I(F , x0 ) ∩V, which contradicts to the local accessibility of x0 . For analytic case, accessibility implies the accessibility rank condition.
⊔ ⊓
126
5 Controllability and Observability
Proposition 5.5. Assume system (5.1) is analytic and weakly controllable, then the accessibility rank condition is satised, i.e., dim{F }∣x = n,
x ∈ M.
dim{F }∣x < n,
∀x ∈ M.
Proof. Assume Then for any x0 ∈ M the integral sub-manifold has dim(I(F , x0 )) < n. But WA(x0 ) ⊂ I(F , x0 ), which contradicts with weak controllability. Hence there is at least one point x0 ∈ M, such that dim{F }∣x0 = n. Next we claim that if the system is weakly controllable, then for any two points x, y ∈ M, dim{F }∣x = dim{F }∣y . If we can prove the claim then the proof is done. Using the denition of accessibility, we see that there exist x0 = x, x1 , ⋅ ⋅ ⋅ , xk = y, such that xi and xi+1 can be connected by an integral curve of X ∈ F , i.e., xi+1 = etX (xi ). Now for any Y ∈ F , using the Campbell-Baker-Hausdorff formula we have (eX−t )∗Y (xi+1 ) =
f
tk
¦ adkX Y (xi ) k! .
(5.5)
k=0
Since the right hand side of (5.5) is in F (xi ) and the Y ∈ F is arbitrary (eX−t )∗ F ∣xi+1 ⊂ F ∣xi . Since (eX−t )∗ is a diffeomorphism, it is clear that dim{F }∣xi+1 ⩽ dim{F }∣xi . Exchanging xi with xi+1 and using Campbell-Baker-Hausdorff formula again we can show that dim{F }∣xi ⩽ dim{F }∣xi+1 . It follows that dim{F }∣x = dim{F }∣x1 = ⋅ ⋅ ⋅ = dim{F }∣y .
⊔ ⊓
The following corollary is an immediate consequence of Proposition 5.1, Theorem 5.1 and Proposition 5.5. Corollary 5.1. For an analytic nonlinear system of the form of (5.1), local weak controllability is equivalent to the accessibility rank condition.
5.1 Controllability of Nonlinear Systems
127
Next, we consider the real reachable set. Denote the reachable set of x0 ∈ M at time t by R(x0 ,t). It is obvious that R(x0 ) = ∪t⩾0 R(x0 ,t). Denition 5.7. 1. System (5.1) is said to be accessible at x0 ∈ M, if R(x0 ) contains a non-empty open set. The system is said to be accessible if it is accessible at every x ∈ M. 2. System (5.1) is said to be strongly accessible at x0 ∈ M, if for any T > 0, R(x0 , T ) contains a non-empty open set. The system is said to be strongly accessible if it is strongly accessible at every x ∈ M. Theorem 5.2. 1. For system (5.1) assume the accessibility rank condition is satised at x0 ∈ M, i.e., dim{F }∣x0 = n.
(5.6)
Then it is accessible at x0 . Moreover, for any T > 0 the reachable set ∪0⩽t⩽T R(x0 ,t)
(5.7)
has a non-empty interior. 2. If the system is analytic, then the accessibility rank condition (5.6) is necessary and sufcient for the system to be accessible at x0 . 3. Assume the system is analytic and the accessibility rank condition (5.6) holds. Then the set of interiors is dense in the set ∪0⩽t⩽T R(x0 ,t). Proof. 1. Recall the proof of Theorem 5.1, it is clear that in equation (5.4) all the parameters ti , i = 1, ⋅ ⋅ ⋅ , n can be chosen to be positive. Hence it implies that Sn (Vn ) is a non-empty open set, which is contained in R(x0 ). Moreover, all ti can be chosen as small as required. So for any given T > 0, we can assume ∥t∥ < T , that is, (5.7) contains a non-empty set of interiors. 2. We only have to prove the necessity. Assume dim{F }∣x0 = k < n, and p is an interior point in the reachable set of x0 . Then there is a neighborhood of p, denoted by Vp, such that Vp ⊂ R(x0 ). As argued in the proof of Proposition 5.11, dim{F } should be the same over R(x0 ), hence dim{F }∣x = k, ∀x ∈ Vp . Using Frobenius’ theorem we have I(F , p)∩Vp to be a k dimensional sub-manifold. But I(F , p) = I(F , x0 ), and R(x0 ) ⊂ I(F , x0 ), thus
128
5 Controllability and Observability
Vp = R(x0 ) ∩Vp ⊂ I(F , p) ∩Vp ⫋ Vp , which is a contradiction. 3. Assume (5.6). First, we can nd a nite subset D of F such that dim {D}LA ∣x0 = n.
(5.8)
Since dim{F }∣x0 = n, there exist n-vector elds Yi ∈ F , i = 1, ⋅ ⋅ ⋅ , n that are linearly independent at x0 . Now since each Yi can be generated by nite vector elds in F via Lie brackets, there exist nite vector elds D = {X1 , ⋅ ⋅ ⋅ , Xk } ⊂ F, such that (5.8) is satised. Without loss of generality, we assume F = D. Expand F to a symmetric set as ±F = {X1 , ⋅ ⋅ ⋅ , Xk , −X1 , ⋅ ⋅ ⋅ , −Xk }. Choose t = (t1 ,t2 , ⋅ ⋅ ⋅ ,tm ) ∈ ℝm +,
0 ⩽ m < f,
and Xi1 , Xi2 , ⋅ ⋅ ⋅ , Xim ∈ ±F, then for all possible choices of t and i = (i1 , i2 , ⋅ ⋅ ⋅ , im ) we can construct the set Xi
Xi
R∗ (x0 ) = ∪i,t et1 1 et2 2 ⋅ ⋅ ⋅ etmim (x0 ) := ∪i,t Ii (t, x0 ), X
which is the reachable set of ±F, starting from x0 . Since et−X (x0 ) = eX−t (x0 ), we can equally express Xi Xi X Ii (t, x0 ) = et1 1 et2 2 ⋅ ⋅ ⋅ etmim (x0 ), with Xi ∈ F and t ∈ ℝm . According to Chow’s theorem, R∗ (x0 ) = I (F, x0 ). Since the integral sub-manifold I (F, x0 ) has dimension n over a neighborhood of x0 , so R∗ (x0 ) contains a non-empty interior. Next, for any natural number N, we dene R∗i (x0 , N) := ∪∥t∥⩽N Ii (t, x0 ), where
(5.9)
m
∥t∥ = ¦ ∥ti ∥. i=1
Since J := {t ∈ ℝm ∣ ∥t∥ ⩽ N} ⊂ ℝm is a compact set, and R∗i (x0 , N) is the image set of J under the continuous mapping Ii (t, x0 ), R∗i (x0 , N) is also compact in M. It follows by denition that
5.1 Controllability of Nonlinear Systems
R∗ (x0 ) = ∪t,N R∗i (x0 , N).
129
(5.10)
Now Since F is a nite set, its nite subsets (ki , i = 0, 1, 2, ⋅ ⋅ ⋅ ) is countable. So the right hand side of (5.10) is a countable union. Since the left hand side contains a non-empty open set, it is of the second category. By Baire category theorem, at least one R∗i (x0 , N) is not nowhere dense. Say a particular R∗i (x0 , N) is not nowhere dense, that is, its closure R∗i (x0 , N) contains a non-empty open set. But since R∗i (x0 , N) is compact, R∗i (x0 , N) = R∗i (x0 , N) contains a non-empty open set. Say, this particular i we have Xi1 , ⋅ ⋅ ⋅ , Xim ∈ F. Dene a mapping P : ℝm → M as Xi
Xi
X
P(t1 , ⋅ ⋅ ⋅ ,tm ) = et1 1 et2 2 ⋅ ⋅ ⋅ etmim (x0 ). Then R∗i (x0 , N) ⊂ P(ℝm ).
(5.11)
Since the left hand side contains a non-empty open set, using Sard’s theorem (Refer to Appendix A.1) there is at least one point t0 , such that the Jacobian matrix of P, JP has full rank, i.e., rank(JP ∣t0 ) = n. By the analyticity we know that S := {t ∈ ℝm ∣ rank(JP ∣t ) < n} ⊂ ℝm has no interior, otherwise, rank(JP ∣t ) < n, ∀t. Then its complement Sc = ℝm 6 = {t ∈ ℝm ∣ rank(JP ∣t ) = n} is an open dense set. Now let T > 0 and let a point y be y ∈ ∪0⩽t⩽T R(x0 ,t).
(5.12)
we proceed to show that y is in the closure of ∪0⩽t⩽T R(x0 ,t), i.e., y ∈ int(∪0⩽t⩽T R(x0 ,t)). Using (5.12), we have y ∈ ∪0⩽t
130
5 Controllability and Observability
U = Sc ∩ {t ∣ ∥t∥ < T − t0 } ∩ {t ∈ ℝm + }, ¯ Since the rank of P on which is obviously an open set in ℝm . Moreover, 0 ∈ U. U is n, by the Rank theorem (Refer to Appendix A.2), P(U) is an open set in M. Let V = {I j (s, P(t)) ∣ t ∈ U}. Then V is the image of P(U) under a diffeomorphism: z $→ I j (s, z). Hence, V is open. Since ti ⩾ 0, s j ⩾ 0, and ∥t∥ + ∥s∥ < T , then V ⊂ ∪0⩽t⩽T R(x0 ,t), which means that the points in V are the interior of the reachable set (on the right hand side). Now it is enough to show that y ∈ V¯. Choose a sequence {tk } ⊂ U, such that {tk } → 0, then by continuity, lim I j (s, P(tk )) = I j (s, x0 ) = y,
k→f
which completes the proof. ⊔ ⊓ In order to investigate the strong accessibility, we need some preparations. Let L be a Lie algebra, the derived Lie algebra of L is dened as L′ = [L, L] = {[X ,Y ] ∣ X ,Y ∈ L}.
(5.13)
It is obvious that the derived Lie algebra is not only a sub-algebra but also an ideal. Now we dene a sub-algebra F 0 of F as { } s s ′ (5.14) F 0 = ¦ Oi Xi + Y Oi ∈ ℝ, s ⩾ 0, ¦ Oi = 0, Xi ∈ F , Y ∈ F . i=1 i=1 It is easy to verify that F 0 is a Lie sub-algebra. Denition 5.8. Consider the system (5.1). The Lie algebra F 0 is called the strong accessibility Lie algebra. If for x0 ∈ M dim(F 0 (x0 )) = n, it is said that the strong accessibility rank condition is satised at x0 . If the strong accessibility rank condition is satised at every x ∈ M, it is said that the strong accessibility rank condition is satised. Lemma 5.1. For any point x ∈ M, dim(F (x)) − dim(F 0 (x)) ⩽ 1. Proof. In fact, F = {F, F ′ } and F 0 ⊃ {F ′ }. According to the structures of F and F 0 one sees easily that if there is a vector eld X ∈ F, which is also in F 0 , i.e., X ∈ F 0 , then F ⊂ F 0 . The conclusion follows. ⊔ ⊓
5.1 Controllability of Nonlinear Systems
131
Since time t is taken into consideration in strong accessibility, we consider the time-state product space ℝ × M, and construct a subset of V (ℝ × M) as } { w ⊕ X X ∈ F . (5.15) Fˆ = wt ˆ = {F} ˆ LA , the Lie algebra generated by F. ˆ A simple computation Denote by F shows that its derived Lie algebra is ˆ ′ = {0 ⊕ Y ∣ Y ∈ F ′ }. F ˆ can be expressed as Hence the Lie algebra F } { ( ) s w ′ ˆ F = ¦ Oi ⊕ X + 0 ⊕ Y Oi ∈ ℝ, X ∈ F, Y ∈ F . wt i=1 Consider an extended system ] [ [ ] 1 t . = fˆ = f (x, u) x
(5.16)
(5.17)
Note that each integral curve of F with initial value x0 corresponds to an integral curve of Fˆ with initial value (0, x0 ). It follows that y ∈ R(x0 , T ), if and only if ˆ (T, y) ∈ R((0, x0 )). ˆ x0 )) has nonLemma 5.2. R(x0 , T ) has non-empty interior in M, if and only if R((0, empty interior in ℝ × M. Proof. (Sufciency) Let V ⊂ R(x0 , T ) be a non-empty open set. Choose an X ∈ F and construct a mapping P : ℝ × V → ℝ × M as P(t, v) = (T + t, etX (v)).
(5.18)
Then the Jacobian matrix of P can be expressed as ] [ 1 0 JP = , ∗ Je where Je is the Jacobian of the diffeomorphism: x $→ etX (x), which is nonsingular. So, JP is nonsingular, and hence the mapping P is an open mapping. According to the construction of P, one sees ˆ P((0, f) × V ) ⊂ R((0, x0 )). Moreover, since P is an open mapping, P((0, f) ×V ) is a non-empty open subset in ˆ R((0, x0 )).
132
5 Controllability and Observability
ˆ (Necessity) Since R((0, x0 )) has a non-empty open subset, according to Theorem 5.2, for any t ∈ (0, T ) ˆ x0 ), s) ∪0⩽s⩽t R((0, contains a non-empty open subset. Let W be a non-empty open set in ℝ and V be a non-empty open set in M, such that ˆ W × V ⊂ ∪0⩽s⩽t R((0, x0 ), s). Then for any t0 ∈ W we have ˆ {t0 } × V ⊂ ∪0⩽s⩽t R((0, x0 ), s), which means V ⊂ R(x0 ,t0 ). Choose any X ∈ F and construct the mapping G : y $→ eXT −t0 (y). Since G is a diffeomorphism, G(V ) is a non-empty open set, and G(V ) ⊂ R(x0 , T ).
⊔ ⊓
From the above Lemma one sees that if there exists a T > 0 such that R(x0 , T ) has non-empty interior, then for any t > 0, R(x0 ,t) has non-empty interior as well, ˆ since the condition that R((0, x0 )) has non-empty interior is independent of time t. Now we are ready to give conditions for the strong accessibility. Theorem 5.3. Consider system (5.1). 1. If it satises the strong accessibility rank condition at x0 ∈ M, i.e., dim{F 0 }∣x0 = n,
(5.19)
then it is strong accessible at x0 . 2. If it is an analytic system and strongly accessible at x0 , it satises the strong accessibility rank condition at x0 . 3. If it either is strongly accessible at x0 or satises the strong accessibility rank condition at x0 , then for any T > 0, the int (R(x0 , T )) is dense in R(x0 , T ). Proof. From Lemma 5.2, the strong accessibility of system (5.1) at x0 is equivalent to the accessibility of system (5.17) at (0, x0 ). According to Theorem 5.14, the accessibility of system (5.17) is assured by dim{F 0 }∣(0,x0 ) = n + 1.
(5.20)
In the analytic case, it is equivalent to (5.20). Hence, to prove items 1 and 2 of the theorem we only have to show that (5.20) is equivalent to (5.19). Assume (5.20). Choosing any vector eld V ∈ Tx0 , we have ( ) 0 ˆ ∣x . ∈F 0 V ˆ , we have Recalling (5.16) for the expression of F
5.1 Controllability of Nonlinear Systems
V=
) s O X + Y , ¦ i i i=1
133
(
(5.21)
x0
with Xi ∈ F, Y ∈ F ′ , and s
0 = ¦ Oi i=1
w . wt
(5.22)
s
Now (5.22) implies
¦ Oi = 0, and (5.21) implies that V ∈ F 0 ∣x0 . But V ∈ Tx0 (M)
i=1
is chosen arbitrary, which means Tx0 (M) ⊂ F 0 ∣x0 . Hence dim{F 0 }∣x0 = n. Conversely, assume (5.19). Then for V ∈ Tx0 (M) we can express it as ) ¦ Oi Xi + Y , i=1
( V=
s
x0
where Xi ∈ F, Y ∈ F ′ , and
s
¦ Oi = 0. Then
i=1
( (0 ⊕ V ) =
w ¦ Oi ( w t ⊕ Xi) + 0 ⊕ Y i=1 s
)
ˆ ∣(0,x ) . ∈F 0
(5.23)
(0,x0 )
Choose any X ∈ F, then by denition, (
) w ˆ ∣(0,x ) . ˆ (0,x ) ⊂ F ⊕ X ∈ F∣ 0 0 wt (0,x0 )
(5.24)
Particularly, let V = X , then (5.23) and (5.24) imply that
w ˆ ∣(0,x ) . ⊕0 ∈ F 0 wt
(5.25)
ˆ ∣(0,x ) contains all the vectors in T(0,x ) (ℝ × M), Now (5.23) and (5.24) show that F 0 0 hence ˆ }∣(0,x ) = n + 1. dim{F 0 Next, we prove item 3. Let y ∈ R(x0 , T ), then there exist X1 , ⋅ ⋅ ⋅ , Xm ∈ F, and t = (t1 , ⋅ ⋅ ⋅ ,tm ) ∈ ℝm + , ∥t∥ = T , such that y = etX11 ⋅ ⋅ ⋅ etXmm (x0 ). Choose a sequence {sk } ⊂ (0,tm ), such that
134
5 Controllability and Observability
lim sk = 0.
k→f
Using Theorem 5.2, for each sk we can nd an interior xk in R(x0 , sk ). Set t k = (t1 , ⋅ ⋅ ⋅ ,tm−1 ,tm − sk ), then we can construct a sequence {yk } ⊂ M as yk = etX11 ⋅ ⋅ ⋅ etXmm−sk (xk ) := I (t k , xk ) ∈ R(x0 , T ). Since xk lies in the interior of R(x0 , sk ), and z $→ I (t k , z) is a diffeomorphism, yk is in the interior of R(x0 , T ). Let k → f, then t k → t, and by continuity lim yk = y.
k→f
⊔ ⊓
In summary, we have shown: 1. 2. 3. 4. 5. 6. 7.
Accessibility rank condition (at x0 ) ⇒ Weak controllability (at x0 ); Weak controllability ⇒ Accessibility rank condition on an open dense set; Weak controllability + Analyticity ⇒ Accessibility rank condition; Accessibility rank condition (at x0 ) ⇒ Accessibility (at x0 ); Accessibility (at x0 ) + Analyticity ⇒ Accessibility rank condition (at x0 ); Strong accessibility rank condition (at x0 ) ⇒ Strong accessibility (at x0 ); Strong accessibility (at x0 ) + Analyticity ⇒ Strong accessibility rank condition (at x0 ).
Denition 5.9. Given a vector eld X. A distribution D is said to be X invariant, if adX Y ∈ D,
∀Y ∈ D,
Similarly, a Lie algebra L is said to be X invariant, if adX Y ∈ L,
∀Y ∈ L.
Given two sets of vector elds, F, G, the smallest distribution that contains G and is F invariant is denoted by ⟨F ∣ G⟩. The smallest involutive distribution that contains G and is F invariant is denoted by [F ∣ G]. When Lie algebra is considered as a distribution, the same notations are used. In fact, when the dimension of accessibility or strong accessibility Lie algebra is considered, they are regarded as distributions. Next, we consider an afne nonlinear system (5.2). By denition we have Proposition 5.6. For the afne nonlinear system (5.2) the accessibility Lie algebra is the Lie algebra generated by { f , g1 , ⋅ ⋅ ⋅ , gm }, i.e., F = { f , g1 , ⋅ ⋅ ⋅ , gm }LA . The strong accessibility Lie algebra is the smallest Lie algebra contains {g1 , ⋅ ⋅ ⋅ , gm } and f -invariant, i.e., F 0 = [ f ∣ g1 , ⋅ ⋅ ⋅ , gm ].
5.1 Controllability of Nonlinear Systems
135
Example 5.2. Consider the linear system (1.3). It is ready to verify that the accessibility Lie algebra is F = Span{Ax, B, AB, ⋅ ⋅ ⋅ , An−1 B};
(5.26)
and the strong accessibility Lie algebra is F 0 = Span{B, AB, ⋅ ⋅ ⋅ , An−1 B}.
(5.27)
So for linear systems controllability, weak controllability, accessibility, and strong accessibility are all equivalent. Example 5.3. Consider a time-varying linear system ⎧ m ⎨x = A(t)x + b (t)u := A(t)x + B(t)u ⎩y = c(t)x.
¦
i
i
i=1
Consider t as a variable, then system (5.28) can be expressed as ⎧ t = 1 m ⎨ x = A(t)x + B(t)u := f (t, x) + ¦ gi (t)ui i=1 ⎩ y = c(t)x.
(5.28)
(5.29)
It is easy to obtain that [ [ f , gi ] =
]
0
, w bi (t) − A(t)bi(t) wt
1 ⩽ i ⩽ m;
and [gi , g j ] = 0,
1 ⩽ i, j ⩽ m.
Finally, we dene (
'ck B(t) =
) w − A(t) 'ck−1 B(t), wt
k = 1, 2, ⋅ ⋅ ⋅ ,
where 'c0 B(t) := B(t). Then it is easy to see that the accessibility Lie algebra is F = Span{Bic (t) ∣ i = 0, 1, 2, ⋅ ⋅ ⋅ }.
(5.30)
Example 5.4. Consider a bilinear system m
x = Ax + ¦ ui Bi x, i=1
Note that the Lie bracket of two linear forms is
x ∈ ℝn .
(5.31)
136
5 Controllability and Observability
[Px, Qx] = (QP − PQ)x = [Q, P]x, where the Lie bracket [Q, P] of two n × n matrices is dened as in the Lie algebra gl(n, ℝ). Consider a Lie sub-algebra H ⊂ gl(n, ℝ), generated as H = {A, B1 , ⋅ ⋅ ⋅ , Bm }LA < gl(n, ℝ), then it is clear that for system (5.31) the accessibility Lie algebra is F = {Dx ∣ D ∈ H}.
5.2 Observability of Nonlinear Systems For system (5.1), if in the state space there are two points x1 and x2 such that for any feasible control u the outputs are identically the same, i.e., y(t, x1 , u) ≡ y(t, x2 , u),
t ⩾ 0, ∀u,
then x1 and x2 are said to be in-distinguishable. The set of in-distinguishable points with respect to x0 is denoted by ID(x0 ). Denition 5.10. System (5.1) is said to be observable at x0 if its in-distinguishable set contains only one point, i.e., ID(x0 ) = x0 . Remark 5.1. For a linear system (1.3), observability is independent of the control, since ∫t y = CeA(t−t0 ) x0 + C eA(t−W ) Bu(W )dW . t0
This implies
y2 − y1 = CeA(t−t0 ) (x2 − x1 ),
which is independent of control u. Similar to the case of controllability, global observability is also a difcult topic in the investigation of nonlinear systems. For this reason we are primarily interested in local observability. For a point x0 ∈ M and a neighborhood U of x0 , given a T > 0, a U feasible control u is such a control that the trajectory remains in U, i.e., x(t, x0 , u) ∈ U,
∀t ∈ [0, T ].
If for any T > 0 and any corresponding U feasible control u, y(t, x1 , u) = y(t, x2 , u),
t ∈ [0, T ],
then x1 and x2 are said to be U-in-distinguishable. The set of U-in-distinguishable points of x0 is denoted by IDU (x0 ).
5.2 Observability of Nonlinear Systems
137
Denition 5.11. System (5.1) is said to be locally observable at x0 if for any neighborhood U of x0 the U-in-distinguishable set consists of only one point, i.e., IDU (x0 ) = {x0 },
∀U.
The system is said to be locally weakly observable at x0 if there exists a neighborhood U of x0 such that the U-in-distinguishable set consists only one point, i.e., IDU (x0 ) = {x0 }. It is worth noting that local observability is a very strong property. In fact, it implies observability. So we are mostly interested in local weak observability. To investigate the observability we construct a set of output related functions. } { s i (5.32) H = ¦ Oi LX i ⋅ ⋅ ⋅ LX i (h j ) s, ki < f, 1 ⩽ j ⩽ m, Oi ∈ ℝ, Xk ∈ F . 1 ki i=1 Using H we dene a co-distribution as H = {dh ∣ h ∈ H}. H is called the observability co-distribution. Denition 5.12. System (5.1) is said to satisfy the observability rank condition at x0 if dim{H }∣x0 = n.
(5.33)
If for every x ∈ M (5.33) is satised, the system is said to satisfy the observability rank condition. Next, we consider the relationship between observability and local weak observability. Theorem 5.4. If system (5.1) satises the observability rank condition at x0 , then it is locally weakly observable at x0 . To prove this theorem we need the following lemma. Lemma 5.3. Let V ⊂ M be an open set. If there exist x1 , x2 ∈ V such that x1 ∈ IDV (x2 ), then for any function c(x) ∈ H, c(x1 ) = c(x2 ). Proof. Choosing any X1 , ⋅ ⋅ ⋅ , Xk ∈ F, we construct X
Ik (x) = etX11 ⋅ ⋅ ⋅ etkk (x).
(5.34)
138
5 Controllability and Observability
when ∥t∥ is small enough, we have h j (Ik (x1 )) = h j (Ik (x2 )),
j = 1, ⋅ ⋅ ⋅ , m.
(5.35)
Differentiating both sides with respect to t1 we have X
X
X
X
LX1 h j (etX11 ⋅ ⋅ ⋅ etkk (x1 )) = LX1 h j (etX11 ⋅ ⋅ ⋅ etkk (x2 )). Setting t1 = 0 yields LX1 h j (etX22 ⋅ ⋅ ⋅ etkk (x1 )) = LX1 h j (etX22 ⋅ ⋅ ⋅ etkk (x2 )). Continuing this procedure with respect to t2 , t3 , ⋅ ⋅ ⋅ , tk , we nally have LXk LXk−1 ⋅ ⋅ ⋅ LX1 h j (x1 ) = LXk LXk−1 ⋅ ⋅ ⋅ LX1 h j (x2 ).
⊔ ⊓
Now we are ready to prove Theorem 5.4. Proof. (Proof of Theorem 5.4) Since dim H = n, we can choose n functions ci (x), i = 1, ⋅ ⋅ ⋅ , n, such that they are linearly independent at x0 . Dene a mapping P(x) = (c1 (x), c2 (x), ⋅ ⋅ ⋅ , cn (x))T . By construction there exists a neighborhood U of x0 such that P : U → P(U) ⊂ ℝn is a diffeomorphism. Now for any x0 ∕= x ∈ U, since P(x) ∕= P(x0 ), x ∕∈ IDU (x0 ). Hence ⊔ ⊓ IDU (x0 ) = x0 . Now a natural question is if the observability rank condition is necessary for local weak observability. We have the following results. Theorem 5.5. If system (5.1) is locally weakly observable, then the observability rank condition is satised on an open dense subset of M. Proof. The set of points where the observability rank condition is satised is obviously an open set. So we have only to prove it is dense. Assume there is a non-empty open set U, such that dim(H (x)) = k < n,
x ∈ U.
(5.36)
In fact, we can assume k = maxx∈U dim(H (x)). Then there exists an open subset V ⊂ U, such that dim(H (x)) = k, x ∈ V . Then we can nd k functions in H such that all the co-vector elds in H can be expressed as a linear combination of the k forms dci (x), i = 1, ⋅ ⋅ ⋅ , k, locally on U. Constructing a local coordinate chart as (U, z), where z = (z1 , z2 ) and z1 = (c1 , ⋅ ⋅ ⋅ , ck )T . Then the system (5.1) can be expressed as ⎧ 1 1 ⎨z = f (z, u) 2 (5.37) z = f 2 (z, u) ⎩ y j = h j (z), j = 1, ⋅ ⋅ ⋅ , p.
5.2 Observability of Nonlinear Systems
139
Since dh j ∈ H , h j depends only on z1 , i.e., h j (z) = h j (z1 ). Next, we claim that f 1 depends only on z1 too, i.e., f 1 (z, u) = f 1 (z1 , u). Otherwise, say for some 1 ⩽ i ⩽ k, k + 1 ⩽ j ⩽ n
w fi1 (z, u) (x) ∕= 0, w z2j
x ∈ U.
Then the j-th component of L f (z,u) (ci (x)) is w f 1 (z, u) dL f (z,u) (ci (x)) j = i 2 (x) ∕= 0. wzj Hence for some x ∈ U,
dL f (z,u) (ci (x)) ∕∈ H (x),
which is a contradiction. Now system (5.37) can be locally expressed as ⎧ 1 1 1 ⎨z = f (z , u) 2 z = f 2 (z, u) ⎩ y j = h j (z1 ), j = 1, ⋅ ⋅ ⋅ , p.
(5.38)
Choosing two points z1 , z2 ∈ U as z1 = (z11 , z21 ),
z2 = (z12 , z22 ),
z11 = z12 ,
z21 ∕= z22 .
Then y(z1 , u(t)) ≡ y(z2 , u(t)), The system is not locally observable at x0 .
z ∈ U. ⊔ ⊓
Note that in the above proof, we assume the feasible controls are piecewise constant. If the feasible controls are state feedback controls, the proof remains true (with some mild modication). Finally we consider the analytic case. Theorem 5.6. Assume system (5.1) is analytic and satises the controllability rank condition. It is locally weakly observable if and only if the observability rank condition is satised. Proof. Since the controllability rank condition is satised, it is locally weakly controllable. That is, for any two points x, y ∈ M, x ∈ W R(y). Using Theorem 5.4, we only have to prove the necessity. Using Theorem 5.5, it sufces to show that H has constant dimension everywhere. Using the local weak controllability, it is enough
140
5 Controllability and Observability
to show dim(H ) is the same for any two points connected by an integral curve of F . Let x2 = etX (x1 ), for some X ∈ F . For any Z ∈ H , we use Campbell-BakerHausdorff formula to get (etX )∗ Z (x2 ) =
f
tk
¦ LkX Z (x1 ) k! .
k=0
Now the left hand side is in H ∣x1 and (etX )∗ is an isomorphism. It follows that dim{H }∣x2 ⩽ dim{H }∣x1 . Using (eX−t )∗ in reverse time, we also have dim{H }∣x1 ⩽ dim{H }∣x2 .
⊔ ⊓
Example 5.5. Consider a linear system (1.3). As we know from the last section that F = Span{Ax, B, AB, ⋅ ⋅ ⋅ , An−1 B}. Then H = Spanℝ {C j x, ⋅ ⋅ ⋅ ,C j An−1 ,C j Ax,C j B, ⋅ ⋅ ⋅ ,C j An−1 B ∣ 1 ⩽ j ⩽ m}, where the subscript ℝ is used to emphasize the span is over ℝ. Then it is ready to verify that the observability co-distribution is H = Span{C,CA, ⋅ ⋅ ⋅ ,CAn−1 }.
(5.39)
So for linear systems observability is equivalent to the observability rank condition. Example 5.6. Consider a time-varying linear system (5.28). Using the extended system (5.29), we can verify that the observability rank condition is equivalent to ⎡ ⎤ c(t) ⎢ oC(t) ⎥ ⎢ ⎥ rank ⎢ 2C(t) ⎥ = n, ⎣ o ⎦ .. . where oC(t) = and k+1 o C(t) =
d k C(t) + koC(t)A(t), dt o
5.3 Kalman Decomposition Consider a dynamic system
d C(t) + C(t)A(t), dt k ⩾ 1.
5.3 Kalman Decomposition
x = f (x),
x ∈ M.
141
(5.40)
Let ' be a distribution, and assume for a given x0 ∈ M there is a neighborhood U of x0 such that ' is involutive over U and with dim(' (x)) = k, ∀x ∈ U. Then by Frobenius’ theorem there exists a local coordinate chart (V, z), x0 ∈ V ⊂ U, such that { } w w ' = Span ,⋅⋅⋅ , . (5.41) w z1 w zk Such a coordinate frame is called a at coordinate frame with respect to ' . Lemma 5.4. Let ' be as above. If ' is f -invariant, then under the at coordinate frame the system (5.40) can be expressed as { z1 = f 1 (z) (5.42) z2 = f 2 (z2 ), z ∈ V, where z1 = (z1 , ⋅ ⋅ ⋅ , zk ). Proof. Assume f 2 (z) ∕= f 2 (z2 ), say
w f 2 (z) w z1i
∕= 0 for some 1 ⩽ i ⩽ k. Then
⎡
⎤ w f 1 (z) ] ⎢ [ 1 ⎥ w ⎢ wz ⎥ f , 1 = ⎢ 2 i ⎥ ∕∈ ' , ⎣ w f (z) ⎦ w zi
w z1i ⊔ ⊓
which is a contradiction.
Next we consider system (5.1). Assume x0 is a regular point with respect to F 0 . That is, there exists a neighborhood U of x0 such that dim(F 0 (x)) = k,
x ∈ U.
Proposition 5.7. Assume x0 is a regular point of F 0 with dim(F 0 ) = k. Then there exists a local coordinate chart (V, z) of x0 , such that system (5.1) can be locally expressed as { z1 = f 1 (z, u) (5.43) z2 = f 2 (z2 ), z ∈ V, where F 0 = Span{ wwz1 , i = 1, 2, ⋅ ⋅ ⋅ , k}. i
Proof. Since F 0 is a Lie algebra, as a distribution it is involutive. Moreover, it is obvious that F 0 is F invariant. According to Lemma 5.4, there exists a local at coordinate frame such that the system can be expressed as { z1 = f 1 (z, u) z2 = f 2 (z2 , u), z ∈ V,
142
5 Controllability and Observability
with F 0 = Span wwz1 . Now we only have to show that f 2 is independent of u. If f 2 i
would depend on u, then we can nd two different constant controls u1 ∕= u2 , such that f 2 (u1 ) ∕= f 2 (u2 ). Then f (u1 ) − f (u2 ) ∕∈ F 0 , which contradicts to the denition of F 0 . ⊔ ⊓ Applying the above proposition to an afne nonlinear system (5.2), we have the following result: Corollary 5.2. For system (5.2), assume x0 is a regular point of F 0 with dim(F 0 ) = k. Then there exists a local coordinate chart (V, z) of x0 , such that the system can be locally expressed as ⎧ m ⎨z1 = f 1 (z) + g (z)u ¦ i i (5.44) i=1 ⎩z2 = f 2 (z2 ), z ∈ V, where F 0 = Span{ wwz1 , i = 1, 2, ⋅ ⋅ ⋅ , k}. i
Remark 5.2. Replacing the strong accessibility Lie algebra F 0 by the accessibility Lie algebra F , similar decompositions can be obtained. Next, we consider the observability co-distribution H . A vector eld X is said to be perpendicular to H if for any Z ∈ H , ⟨Z , X ⟩ = 0. Now we dene a distribution H ⊥ as H ⊥ = Span{X ∣ ⟨Z , X⟩ = 0, ∀ Z ∈ H }.
(5.45)
Lemma 5.5. The distribution H ⊥ is involutive and F invariant. Proof. Let X ,Y ∈ H
⊥
and Z ∈ H . Then
⟨Z , adX Y ⟩ = LX ⟨Z ,Y ⟩ − ⟨LX Z ,Y ⟩ = 0. Hence [X,Y ] ∈ H ⊥ , which means H ⊥ is involutive. Let X ∈ F and Y ∈ H ⊥ , to show that H ⊥ is F invariant we have to show that adX Y ∈ H ⊥ . Now let Z ∈ H , then ⟨Z ,Y ⟩ = 0, and ⟨Z , adX Y ⟩ = LX ⟨Z ,Y ⟩ − ⟨LX Z ,Y ⟩ = 0. To see that the second term is zero we note that since X ∈ F and Z ∈ H , LX Z ∈H . ⊓ ⊔ Theorem 5.7. Assume x0 is a regular point for the observability co-distribution H . Then there exists a local coordinate chart (V, z) of x0 , such that system (5.1) can be expressed locally as ⎧ 1 1 ⎨z = f (z, u) 2 (5.46) z = f 2 (z2 , u), z ∈ V ⎩ 2 y = h(z ),
5.3 Kalman Decomposition
143
{
} where the distribution H ⊥ = Span wwz1 . i
Proof. Choose a at local coordinate frame z such that { } w , i = 1, ⋅ ⋅ ⋅ , k . H ⊥ = Span w z1i 〈 〉 Under this coordinate frame, since dh ∈ H , dh, wwz1 = 0. So h(z) = h(z2 ). Since H
⊥
i
is F invariant,
w f 2 (z) = 0, w z1i
i = 1, ⋅ ⋅ ⋅ , k. ⊔ ⊓
(5.46) follows.
Corollary 5.3. For afne nonlinear system (5.2) assume x0 is a regular point for the observability co-distribution H . Then there exists a local coordinate chart (V, z) of x0 , such that the system (5.2) can be expressed locally as ⎧ m 1 z1 = f (z) + ¦ gi (z)ui i=1 ⎨ m (5.47) 2 2 2 z = f (z ) + ¦ gi (z2 )ui , z ∈ V i=1 ⎩ y = h(z2 ), where the distribution H ⊥ = Span{ wwz1 }. i
To obtain a Kalman decomposition for nonlinear control systems, we need the following lemmas. Lemma 5.6. The distributions F 0 ∩H
⊥
and F 0 ∪H ⊥ are involutive.
Proof. The involutivity of F 0 ∩H ⊥ is obvious, because according to the denition it is ready to verify that the intersection of any two involutive distributions is still involutive. As for the involutivity of F 0 ∪H ⊥ , since H ⊥ is invariant with respect to F, it is also invariant with respect to F , particularly to F 0 . ⊔ ⊓ The following lemma is called the generalized Frobenius’ theorem in some literatures. Lemma 5.7. Assume distributions '1 ⊂ ' 2 ⊂ ⋅ ⋅ ⋅ ⊂ 'k are involutive with dimensions d1 < d2 < ⋅ ⋅ ⋅ < dk on a neighborhood, U of x0 . Then there exists a local coordinate frame (V, z), x0 ∈ V ⊂ U, z = {z11 , ⋅ ⋅ ⋅ , z1d1 , z21 , ⋅ ⋅ ⋅ , z2d2 −d1 , ⋅ ⋅ ⋅ , zk1 , ⋅ ⋅ ⋅ , zkdk −dk−1 , zk+1 }, such that {
's =
} w i ⩽ s, j = 1, ⋅ ⋅ ⋅ , ds − ds−1 , w zij
1 ⩽ s ⩽ k.
(5.48)
144
5 Controllability and Observability
Proof. We prove it inductively. Since D1 is involutive, we can nd a at coordinate chart (U, z) such that (5.48) holds for s = 1. Now assume it holds for i ⩽ s. Denote ps := ds − ds−1 , with d0 = 0. Then we can nd ps+1 vector elds {X1 , ⋅ ⋅ ⋅ , X ps+1 } such that ⎫ ⎧⎛ ⎞ ⎛ ⎞ ⎛ ⎞ 0 I p1 0 ⎜ 0 ⎟ ⎜I p2 ⎟ ⎜ 0 ⎟ ⎜ ⎟ ⎟ ⎜ ⎜ ⎟ ⎜ ⎟ ⎟ ⎜ ⎜ ⎟ . . . ⎬ ⎨⎜ . ⎟ ⎜ . ⎟ ⎜ . ⎟ ( ) . . . ⎟ , ⎜ ⎟ , ⎜ ⎟ , X1 , ⋅ ⋅ ⋅ , X p = 's+1 . Span ⎜ s+1 ⎜ ⎟ ⎟ ⎜ ⎜ ⎟ 0 ⎟ ⎜ 0 ⎟ ⎜ I ps ⎟ ⎜ ⎜ . ⎟ ⎜ . ⎟ ⎜ . ⎟ ⎝ .. ⎠ ⎝ .. ⎠ ⎝ .. ⎠ ⎭ ⎩ 0 0 0 Note that there is at least a ps+1 × ps+1 minor in the last n − ds rows of ) ( X1 , ⋅ ⋅ ⋅ , X ps+1 that is non-singular. Without loss of generality, assume the last ps+1 rows are linearly independent. Denote this minor by T , and dene ( ) ( ) ( ) −1 ∗ Y1 , ⋅ ⋅ ⋅ , Yps+1 = X1 , ⋅ ⋅ ⋅ , X ps+1 T = . I ps+1 Then Y1 , ⋅ ⋅ ⋅ ,Yps+1 are commutative. (Refer to the proof of Frobenius’ theorem.) Let Vi , i = 1, ⋅ ⋅ ⋅ , n be a set of linearly independent vector elds, where the rst ds vector elds are wwzi , i = 1, ⋅ ⋅ ⋅ , s, j = 1, ⋅ ⋅ ⋅ , pi , and j
Vds + j = Y j ,
j = 1, ⋅ ⋅ ⋅ , ps+1 .
Construct a local diffeomorphism from a neighborhood of the origin, W ⊂ ℝn to U as I (t) := eVt11 ⋅ ⋅ ⋅ eVtnn (x0 ). Then (I (W ),t) is a local coordinate chart of x0 . Moreover, on this coordinate chart (5.48) holds for s + 1. (Refer to the proof of Frobenius’ theorem for detailed argument.) Assume x0 ∈ M is a regular point for F 0 , F 0 ∩H ⊥ , F 0 ∪H ⊥ . Using Lemmas 5.6 and 5.7, we can nd a local coordinate chart (V, z), V ⊂ U with z = (z1 , z2 , z3 , z4 ) such that { } F 0 ∩H ⊥ = Span w 2 , wz { } w w , (5.49) , F 0 = Span w z2 w z1 } { H ⊥ = Span w 2 , w 4 . wz wz ⊔ ⊓
References
145
Theorem 5.8. (Kalman Decomposition) Assume for system (5.1) x0 ∈ M is a regular point for F 0 , F 0 ∩H ⊥ , F 0 ∪H ⊥ . Then we can nd a local coordinate chart (V, z) of x0 such that system (5.1) can be locally expressed as ⎧ 1 1 1 3 z = f (z , z , u) z2 = f 2 (z, u) ⎨ (5.50) z3 = f 3 (z3 ) 4 4 3 4 z = f (z , z ) ⎩y = h(z1 , z3 ), where F 0 = Span{ wwz2 , wwz1 }, H ⊥ = Span{ wwz2 , wwz4 }. Proof. Express the system into the coordinate frame introduced in (5.49). Arguing as in the proofs of Proposition 5.7 and Theorem 5.7, equation (5.50) follows. ⊔ ⊓ Applying Theorem 5.8 to afne nonlinear systems we have Corollary 5.4. (Kalman Decomposition) Assume for system (5.2) x0 ∈ M is a regular point for F 0 , F 0 ∩H ⊥ , F 0 ∪H ⊥ . Then we can nd a local coordinate chart (V, z) of x0 such that system (5.2) can be locally expressed as ⎧⎡ ⎤ ⎡ ⎤ ⎡ 1 1 3 ⎤ f 1 (z1 , z3 ) z1 g (z , z ) ⎢ ⎥ ⎥ ⎢ 2⎥ 2 (z) ⎥ ⎢ ⎢ ⎥ ⎢ z f ⎥ ⎢ ⎥ ⎢ g2 (z) ⎥ ⎨⎢ ⎥u ⎥+⎢ ⎢ ⎥=⎢ ⎢z3 ⎥ ⎢ f 3 (z3 ) ⎥ ⎣ ⎦ (5.51) 0 ⎣ ⎦ ⎦ ⎣ 0 z4 f 4 (z3 , z4 ) ⎩y = h(z1 3 , z ), where F 0 = Span{ wwz2 , wwz1 }, H ⊥ = Span{ wwz2 , wwz4 }.
References 1. Baillieul J. Controllability and observability of polynomial dynamical systems. Nonlin. Anal., Theory, Meth. Appl., 1981, 5(5): 543–552. 2. Cheng D. Canonical structure of nonlinear systems. Proc. 10th IFAC World Congress, 1987: 103–107. 3. Gauthier J, Bornard G. Observability of any u(t) of a class of nonlinear systems. IEEE Trans. Aut. Contr., 1981, 26(4): 922–926. 4. Jurdjevic V. Geometric Control Theory. Cambridge: Cambridge University Press, 1997. 5. Jurdjevic V, Sallet G. Controllability properties of afne systems. SIAM J. Contr. Opt., 1984, 22(3): 501–508. 6. Krener A. A decomposition theory for differentiable systems. SIAM J. Contr. Opt., 1977, 15(5): 289–297. 7. Respondek W. On decomposition of nonlinear control systems. Sys. Contr. Lett., 1982, 1(5): 301–308. 8. Van der Schaft A. Observability and controllability for smooth nonlinear systems. SIAM J. Contr. Opt., 1982, 20(3): 338–354.
146
5 Controllability and Observability
9. Stefani G. On the local controllability of a scalar input-control system//Byrnes C, Lindquist A. Theory and Application of Nonlinear Control System Amsterdam: Morth-Holland, 1986: 167–182. 10. Susmann H. A general theorem on local controllability. SIAM J. Contr. Opt., 1987, 25(1): 158–194. 11. Sussmann H. Orbits of families of vector elds and integrability of distributions. Trans. American Math. Soc., 1973, 180: 171–188.
Chapter 6
Global Controllability of Afne Control Systems
This chapter investigates global controllability of general afne control systems, including linear and nonlinear, switched and non-switched ones. The main purpose is to establish criteria for the controllability of nonlinear systems, which is similar to those for linear systems. Since controllability is a property of a set of vector elds, there is no essential difference between switched and non-switched systems as far as controllability is concerned. That is the reason we treat all types of systems together.
6.1 From Linear to Nonlinear Systems Investigation of controllability is one of the most fundamental tasks in control theory. It has been investigated since the very early days of the modern control theory and many signicant results have been obtained. For a linear control system m
x = Ax + ¦ bi ui := Ax + Bu,
x ∈ ℝ n , ui ∈ U .
(6.1)
i=1
Denote by U the set of feasible controls. For convenience, in this chapter we assume U is the set of piecewise continuous functions. It is well known that (6.1) is controllable, if and only if the controllability matrix ] [ (6.2) C = B AB ⋅ ⋅ ⋅ An−1 B has full row rank, i.e., rank(C ) = n. Consider an afne nonlinear control system m
x = f (x) + ¦ gi (x)ui := f (x) + G(x)u,
x ∈ M, u ∈ U m ,
(6.3)
i=1
where M is an n dimensional manifold (with ℝn as a special case); f (x), gi (x) ∈ V f (M), i.e., they are Cf vector elds on M. As we have discussed in the previous chapter, in this case the controllability matrix is generalized to the accessibility Lie algebra La = { f , g1 , ⋅ ⋅ ⋅ , gm }LA , and the strong accessibility Lie algebra D. Cheng et al., Analysis and Design of Nonlinear Control Systems © Science Press Beijing and Springer-Verlag Berlin Heidelberg 2010
(6.4)
148
6 Global Controllability of Afne Control Systems
Lsa = {adkf gi ∣ i = 1, ⋅ ⋅ ⋅ , m; k = 0, 1, ⋅ ⋅ ⋅ }LA .
(6.5)
Note that in the linear case (6.5) is degenerated to (6.3), while La may have one more dimension caused by f (x) if f (x) ∕∈ Lsa (x). In the last chapter, we use R(x0 ) to denote the reachable set from x0 . That is, y ∈ R(x0 ) means there exists u(t) ∈ U , such that the trajectory of the controlled system starting from x0 will reach y at certain time t1 > t0 . We use R(x0 , T ) to denote the reachable set from x0 at a particular moment T > t0 . A big difference between linear and nonlinear systems is that the reachability of linear systems is symmetric, i.e., x ∈ R(y) implies y ∈ R(x) and vise versa. But, it is in general not true for nonlinear systems. Using the (strong) accessibility Lie algebra, we obtained some local control properties of nonlinear systems. But the (strong) accessibility Lie algebra can not determine even the local controllability. Although there are many other controllability results for nonlinear systems, particularly for some nonlinear systems of special forms, such as those in [6, 10], there are few simple, general or global controllability results as in the linear case. This fact shows that controllability of nonlinear systems is a very difcult topic, and global controllability is even more difcult. In [11] Sun and Lei proved a necessary and sufcient condition for planar nonlinear control systems to be globally controllable. Its basic idea is: on each integral curve of g, f has to cross “in” and “out” of the curve at certain points. It will be discussed in Example 6.2 for details. Before our general discussion on nonlinear controllability, we want rst to point out that the controllability rank condition is not a precise description of controllability. It can hardly provide any global picture. The following example shows that it is far from being necessary for global controllability of nonlinear systems. Example 6.1. Consider the following system x = f (y), y = u, (x, y) ∈ ℝ2 , u ∈ U ,
(6.6)
where (0 < G ≪ 1)
f (y) =
⎧ 1 − 1 2 − (y−1) e (y−1−G )2 , ⎨e −
1 (y+1)2
−
1 (y+1+G )2
−e e ⎩ 0, otherwise.
1 < y < 1+G ,
−1 − G < y < −1
This is a Cf system. Due to the special form of the vector elds, it is easy to see that the system is globally controllable, but the rank of its accessibility Lie algebra is 1 except over two narrow strips, where the rank is 2. Next, if we restrict the system on each strip, say, let M = {(x, y) ∈ ℝ2 ∣ 1 < y < 1 + G }. Then the rank condition is satised but it is not even locally controllable. (Refer to Fig. 6.1.)
6.1 From Linear to Nonlinear Systems
Fig. 6.1
149
Rank Condition vis Controllability
So the (strong) accessibility Lie algebra is not enough to describe controllability. We have to “dig in” into its hierarchy structure. Since controllability is basically the property of a set of vector elds, there is no additional difculties when we consider a switched system. A switched afne nonlinear system is dened as m
V (t)
x = f V (t) + ¦ gi
ui ,
(6.7)
i=1
where V : [0, f) → / is a right continuous function, and the index set / = {1, 2, ⋅ ⋅ ⋅ , N} is for N different smooth models: { f i , gi1 , ⋅ ⋅ ⋅ , gim ∣i = 1, ⋅ ⋅ ⋅ , N}. As a special case, a switched linear system is dened as x = AV (t) x + BV (t)u,
x ∈ ℝn , u ∈ U m .
(6.8)
In this chapter, controllability of afne systems is treated in a unied way, no matter linear or nonlinear, switched or no-switched. In the sequel, only controllability of system (6.7) is treated formally. (6.8) is considered as a particular case of (6.7). Moreover, in our approach N = 1 is allowed. That is, we also consider (6.3) (including (6.1)) as a particular case of (6.7) with only a single switching model. The basic idea in the following approach is rst to construct a sequence of distributions, called the controllability distributions, ' 1 , '2 , ⋅ ⋅ ⋅ , which correspond to Span{B}, Span{B, AB}, Span{B, AB, A2B}, ⋅ ⋅ ⋅ , of the linear case, then to check when the trajectory can be driven from the integral manifold of some lower dimensional distribution to the integral manifold of some higher dimensional distribution. For statement ease, we introduce some notations: ∙ IGk := (−G , G ) × (−G , G ) × ⋅ ⋅ ⋅ × (−G , G ) ⊂ ℝk , where 0 < G ≪ 1. We simply use / 01 2 k
I k when we don’t need to specify how small G > 0 is.
150
6 Global Controllability of Afne Control Systems
∙ F is used to describe the set of drift vector elds of (6.7), i.e., F = ( f 1 , f 2 , ⋅ ⋅ ⋅ , f N ). ∙ Gi is the set of input channels of the i-th switching model, i.e., Gi = (gi1 , ⋅ ⋅ ⋅ , gim ), and G as the union of Gi , i.e., G = (G1 , ⋅ ⋅ ⋅ , GN ). ∙ G : the Lie algebra generated by all input channels, i.e., G = {G}LA . ∙ IG : The integral manifold of G (with IG (x0 ) as the maximal integral manifold of G passing through x0 ). ∙ Let ' be a distribution. '¯ denotes its involutive closure, i.e., the smallest involutive distribution containing ' .
6.2 A Sufcient Condition This section presents a sufcient condition for controllability of system (6.7). As a byproduct we also show how the trajectories can go from leaves (i.e., integral manifolds) of a lower dimensional distribution to leaves of the enlarged distribution. To begin with, we need some new concepts: Denition 6.1. Let S := {XO ∣O ∈ / } ⊂ V (M) be a (nite or innite) set of vector elds. A point x0 ∈ M is called an interior (point) of S, if there exists a nite set {Y1 , ⋅ ⋅ ⋅ ,Ys } ⊂ S such that 0 is an interior point of the convex cone generated by Y1 (x0 ), ⋅ ⋅ ⋅ ,Ys (x0 ). The following proposition tells how to verify the interior of S. Proposition 6.1. x0 is an interior of S, if and only if there exists a nite set {Y1 , ⋅ ⋅ ⋅ , Ys } ⊂ S such that (i). there exist n vectors from {Y1 (x0 ), ⋅ ⋅ ⋅ ,Ys (x0 )} that are linearly independent; (ii). there exist ci > 0, i = 1, ⋅ ⋅ ⋅ , s such that s
¦ ciYi (x0 ) = 0.
(6.9)
i=1
Proof. Necessity of (i) comes from the fact that if (i) fails, it means that Yi (0) are linearly dependent. Then the convex cone generated by them, denoted by con {Y1 (0), ⋅ ⋅ ⋅ ,Ys (0)}, has dimension less than n. Thus it does not have any interior point in the ℝn topology. s
(6.9) with
¦ ci = 1 is a necessary and sufcient condition for 0 to be an interior
i=1
point of the convex cone (with respect to subspace topology, which could be of s
lower dimension). Since the interior is empty, the condition ¦ ci = 1 can obviously i=1
be removed.
6.2 A Sufcient Condition
151
As for the sufciency, condition (i) assures that the cone has dimension n. So as an interior of the cone, 0 is also an interior in the ℝn topology. ⊔ ⊓ Remark 6.1. From Proposition 6.1 it is obvious that to satisfy conditions (i) and (ii) the number of vectors should be s ⩾ n + 1. But it is easy to see that if such a set of vectors exist then at most 2n should be enough (the others are redundant). Throughout this chapter we need the following assumption: A1. G has constant dimension. From Frobenius’ theorem [9] A1 assures that for each x ∈ M the maximal integral manifold IG (x) exists. We now give a rigorous denition for controllability discussed in this chapter. Denition 6.2. System (6.7) is said to be controllable if for any two given points x, y ∈ M, x ∈ R(y). It is controllable on a subset, W ⊂ M, (briey, W is controllable) if for any two given points x, y ∈ W , x ∈ RW (y), which means that there is a trajectory that starts from y, travels within W , and then reaches x. The following lemma is a key for our main result, and is also interesting in its own right: Lemma 6.1. Assume A1 and let x0 ∈ M be an interior of {F, G }. Then there exists a neighborhood W of x0 , which is a controllable subset. To prove Lemma 6.1, we need some preparations: Lemma 6.2. Let Z = {Z1 , ⋅ ⋅ ⋅ , Zs } be a set of vector elds, and G = {Z}LA be of constant dimension m and x0 ∈ IG (x0 ). Then there exist m vector elds {X1 , ⋅ ⋅ ⋅ , Xm } ⊂ G (since m ⩾ s, some Xi may be equal to some Z j ), and t10 , ⋅ ⋅ ⋅ ,tm0 , such that the mapping X1 X1 Xm Xm ) (t1 , ⋅ ⋅ ⋅ ,tm ) := I−t 0 ∘ ⋅ ⋅ ⋅ ∘ I−t 0 ∘ It 0 +t ∘ ⋅ ⋅ ⋅ ∘ It 0 +t (x0 ) m
1
m
m
1
1
(6.10)
is a diffeomorphism from a neighborhood 0 ∈ I m ⊂ ℝm to a neighborhood x0 ∈ W ⊂ IG (x0 ). Proof. Choose any X1 ∈ G such that X1 (x0 ) ∕= 0. Construct a mapping
)1 (t) := ItX1 (x0 ), which is a diffeomorphism from 0 ∈ I 1 ⊂ ℝ1 onto its image. Since the dimension dim (IG (x0 )) = m, there exists a t10 ∈ I 1 and a vector eld X2 ∈ G such that at point p1 = )1 (t10 ), X1 (p1 ) and X2 (p1 ) are linearly independent. (Otherwise, along the integral curve of X1 dim(IG (x0 )) = 1, which is a contradiction.) Next, we construct a mapping )2 (t1 ,t2 ) := ItX2 2 ∘ ItX01+t (x0 ), 1
ℝ2
1
onto its image. A similar argument which is a diffeomorphism from 0 ∈ ⊂ shows that there exists a point p2 = )2 (t10 + δt10 ,t02 ), and a X3 ∈ G, such that X1 (p2 ), X2 (p2 ), and X3 (p2 ) are linearly independent. For notational ease, we still use t10 for t10 + δt10 . Continuing this procedure, we can nally construct a mapping I2
152
6 Global Controllability of Afne Control Systems X
)m (t1 , ⋅ ⋅ ⋅ ,tm ) := ItX0m+t ∘ It 0m−1+t m
m
m−1
m−1
∘ ⋅ ⋅ ⋅ ∘ ItX01+t (x0 ) 1
1
(6.11)
which is a diffeomorphism from 0 ∈ I m ⊂ ℝm to a neighborhood of pm = ItX0m ∘ m
X
It 0m−1 ∘ ⋅ ⋅ ⋅ ∘ ItX01 (x0 ) in IG (x0 ). (Note that according to our construction tm0 = 0.) m−1
Dene
1
X1 Xm ) c (x) := I−t 0 ∘ ⋅ ⋅ ⋅ ∘ I−t 0 (x), m
1
which is a diffeomorphism from a neighborhood of pm back to a neighborhood of x0 . Composing it with )m (t1 , ⋅ ⋅ ⋅ ,tm ) yields
) (t1 , ⋅ ⋅ ⋅ ,tm ) := ) c ∘ )m (t1 , ⋅ ⋅ ⋅ ,tm ) which is a diffeomorphism from 0 ∈ I m ⊂ ℝm to x0 ∈ W ⊂ IG (x0 ).
⊔ ⊓
Remark 6.2. Basically, the above proof is a mimic of the proof of Chow’s Theorem [7]. Lemma 6.3. If there exists a nite set {Y1 , ⋅ ⋅ ⋅ ,Ys } ⊂ S such that conditions (i) and (ii) of Proposition 6.1 are satised, then for any Z ∈ S, we can assume it is a vector in (6.9), i.e., Z = Yi for some i. Proof. Since Y1 , ⋅ ⋅ ⋅ ,Yn are linearly independent, we can express Z as n
Z(x0 ) = ¦ diYi (x0 ).
(6.12)
i=1
Adding (6.12) to (6.9) yields n
Z(x0 ) + ¦ (ci − di)Yi (x0 ) + i=1
s
¦
ciYi (x0 ) = 0.
(6.13)
i=n+1
Now if all the coefcients are positive we are done. Since in (6.9) we can choose ⊔ ⊓ ci > 0 as large as we wish the conclusion follows. Denition 6.3. A mapping ItX (x) : M × ℝ1 → M is called (physically) realizable (by system (6.7)) if { } m i i X ∈ f + ¦ g j u j i = 1, ⋅ ⋅ ⋅ , N; u j ∈ U j=1 and t ⩾ 0. Now we are ready to prove Lemma 6.1. Proof. (Proof of Lemma 6.1) According to Proposition 6.1, we can nd Y1 , ⋅ ⋅ ⋅ , Ys ∈ {F, G }, such that (6.9) holds. Moreover, there is a subset of n vector elds, say, Y1 , ⋅ ⋅ ⋅ , Yn , which are linearly independent at x0 (and hence linearly independent over a neighborhood W ∋ x0 ). Construct a mapping
6.2 A Sufcient Condition
4 (t1 , ⋅ ⋅ ⋅ ,tn ) := ItY11 ∘ ItY22 ∘ ⋅ ⋅ ⋅ ∘ ItYnn (x0 ),
153
(6.14)
which is a diffeomorphism from 0 ∈ I n ⊂ ℝn to a neighborhood x0 ∈ W ⊂ M. Note that the region of 4 (t1 , ⋅ ⋅ ⋅ ,tn )(x0 ) contains a neighborhood of x0 . So if each segment of its integral curves is realizable, then the reachable set R(x0 ) of x0 contains a neighborhood of x0 . The following discussion is devoted to modifying 4 to make it realizable. Consider Yi , which should be in one of the following three categories: Case 1. Yi ∈ F: According to Lemma 6.3, we can assume that this Yi is an element in (6.9). Say, it is the Yi in (6.9). Then we construct the following mapping ⎧ Y ⎨It i (x0 ), t ⩾ 0, \i (t) := (6.15) Yi+1 Yn ⎩I Y1c ∘ ⋅ ⋅ ⋅ ∘ I Yi−1 t < 0. ci−1 ∘ I ci+1 ∘ ⋅ ⋅ ⋅ ∘ I cn (x0 ), 1 − t −c t
− c t i
i
We show that
− c t i
ci
d\i (t) = Yi (0). dt t=0
(6.16)
d\i (t) = Yi (0). dt t=0+
It is obvious that
So we have only to consider the case of t → 0− . Denote
\i− (t) := I Y1c1 ∘ ⋅ ⋅ ⋅ ∘ I −c t i
Yi−1 c − i−1 c t i
Yi+1 c − i+1 c t
∘I
i
∘ ⋅ ⋅ ⋅ ∘ I−Yncn t (x0 ). ci
Using the fact that I0X (p) = p, (I0X )∗ = identity, and an easily proved formula
w X Y I ∘ I (x) = (ItX1 )∗Y (ItX1 ∘ ItY2 (x)), w t2 t1 t2 we can prove that
(6.17)
s cj w − \i (t) = − ¦ Y j (x0 ) = Yi (x0 ). wt c t=0 j=1, j∕=i i
The last equality is from (6.9). We hence proved (6.16). Recall 4 of (6.14). If there is an integral segment of Yi ∈ F as its component , we replace ItYi i by \i (ti ). Then we have a new 4 . For notational easy, we still denote it by 4 . We claim that new 4 (t1 , ⋅ ⋅ ⋅ ,tn ) is still a diffeomorphism from 0 ∈ I n ⊂ ℝn to a neighborhood x0 ∈ W ⊂ M. (I n may be shrank if necessary.) Using (6.16), it is easy to prove that we still have the Jacobian matrix of 4 at zero as J4 (0) = [Y1 (x0 ),Y2 (x0 ), ⋅ ⋅ ⋅ ,Yn (x0 )]. The linear independence of {Yi } implies that 4 is a local diffeomorphism. The advantage of new 4 is that any segment of the integral curves in 4 , which involves Yi ∈ F, is now realizable because of its corresponding non-negative time. (Recall (6.15) and note that all ci > 0.)
154
6 Global Controllability of Afne Control Systems
Case 2. Yi ∈ G: Say Yi = gij . Then we have
ItYi i
( f i +gij u)− f i u ti
=I
.
(6.18)
When ti ⩾ 0 choose corresponding control u > 0 and when ti < 0 let u < 0. Then we have ( f i +gij u)− f i
ItYi i = It /u i
.
(6.19)
,
(6.20)
Now we dene ( f i +gij u)
\i (t) := It/u
where t/u ⩾ 0. So \i (t) is also physically realizable. Replacing ItYi i in 4 by this \i (ti ) as Yi ∈ G, we can prove that as ∣u∣ becomes large enough 4 is still a local diffeomorphism. It is because w \i (t) = Yi (0) + f i (0)/u. w ti t=0 As ∣u∣ is large enough, similar to Case 1, we can prove that the Jacobian matrix for modied 4 is still non-singular at t = 0. Case 3.Yi ∈ G ∖G: Assume that the region W = 4 (I n ) and 4 : I n → W is a diffeomorphism. We claim that W is a reachable set of x0 . Let x1 ∈ W . It sufces to show that x1 ∈ R(x0 ). After components of Case 1 and Case 2 have been treated, we have only to treat the components of Case 3. Let Yi ∈ G ∖G. Then there exists t 0 = (t10 , ⋅ ⋅ ⋅ ,tn0 ) ∈ I n , such that x1 = 4 (t 0 ) = ItY01 ∘ ItY02 ∘ ⋅ ⋅ ⋅ ∘ ItY0n (x0 ). 1
n
2
(6.21)
Since I n is an open set, we can nd H > 0 such that if t = (t1 , ⋅ ⋅ ⋅ ,tn ) satisfying ∥t∥ < H , then t 0 + t ∈ I n . Dene
4˜ (t) = ItY01+t ∘ ItY02+t ∘ ⋅ ⋅ ⋅ ∘ ItY0n+t (x0 ), 1
1
2
n
2
∥t∥ < H .
n
(6.22)
Checking the Jacobian matrix, it is easy to see that 4˜ is a diffeomorphism from a neighborhood 0 ∈ I n (H ) ⊂ ℝn to a neighborhood of x1 ∈ W1 ⊂ W . Denote by Y
p = It 0i+1 ∘ ⋅ ⋅ ⋅ ∘ ItY0n (x0 ); i+1
n
q = ItY0i (p). i
Since Yi ∈ G , by Chow’s Theorem, we can nd Z1 , ⋅ ⋅ ⋅ , Z j ∈ G and d1 , ⋅ ⋅ ⋅ , d j ∈ ℝ, such that Z q = IdZ11 ∘ IdZ22 ∘ ⋅ ⋅ ⋅ ∘ Id jj (p).
6.2 A Sufcient Condition
155
Using Lemma 6.2, we can construct a ) (W1 , ⋅ ⋅ ⋅ , Wm ) as in (6.10) which is a local diffeomorphism from I m to a neighborhood of q (with respect to the inherited topology from M to the sub-manifold IG (q)). Now dene Z
\i (W1 , ⋅ ⋅ ⋅ , Wm ) := ) (W1 , ⋅ ⋅ ⋅ , Wm ) ∘ IdZ11 ∘ IdZ22 ∘ ⋅ ⋅ ⋅ ∘ Id jj (p). Note that the region of \i (W1 , ⋅ ⋅ ⋅ , Wm )(p) over I m contains a neighborhood of q (under the sub-manifold topology). While ItY0i+t (p), ti ∈ I 1 (H ) contains a special integral i
i
curve of Yi on the sub-manifold. As H > 0 is small enough, we conclude that } { ItY0i+t (p)ti ∈ I 1 (H ) ⊂ { \i (W )∣ W ∈ I m } . i
i
Note that since \i (W1 , ⋅ ⋅ ⋅ , Wm ) is dened at q, i.e. \i (W1 , ⋅ ⋅ ⋅ , Wm )(q) is a local diffeomorphism, by continuity of the Jacobian matrix one sees easily that as a neighborhood Wq of q being small enough, the mapping \i (W1 , ⋅ ⋅ ⋅ , Wm )(q′ ), q′ ∈ Wq , is also a diffeomorphism. In our case since I n (H ) can be arbitrary small, \i (W1 , ⋅ ⋅ ⋅ , Wm ) is diffeomorphism for each q′ ∈ Wq . Now we replace ItY0i+t in 4˜ by \i (W1 , ⋅ ⋅ ⋅ , Wm ). Then according to the above ari i gument one sees easily that the region of new 4˜ over I i−1 (H ) × I m × I n−i covers the region of the old 4˜ over I n (H ). Therefore, it covers a neighborhood of x1 . After this modication we can replace all Yi ∈ G ∖G by some Z ∈ G. Then using the technique in Case 2, we can further modify 4˜ to make it realizable. We conclude that W is a reachable set of x0 . Note that unlike Case 1 and Case 2, in Case 3 for each x1 ∈ W we dene 4˜ = 4˜ x1 , which depends on x1 and is a submersion (onto mapping) to a neighborhood of x1 . It is not a diffeomorphism any more. Finally, we have to show that W is a controllable neighborhood of x0 . To see that let x1 ∈ W . Construct 4˜ (t) = 4˜ x1 (t) which starts from x0 and mapped over a neighborhood of x1 . Replace all the constant time variables ti0 by −ti0 to get 4˜ c (t). Then it maps from x1 back to a neighborhood of x0 . Note that in 4˜ (t) there is no vector eld of Case 3. It is so for 4˜ c (t) as well. Using the tricks used in Case 1 and Case 2 for handling negative time, we can show that x0 ∈ R(x1 ), which completes the proof. ⊔ ⊓ The geometric meaning of Lemma 6.1 is obvious. Refer to Fig. 6.2, since x0 is an interior of {F, G }, intuitively it can go wherever within the cone. The disadvantage of Lemma 6.1 is obvious. If the codimension of G is k, then, according to Proposition 6.1, at least k + 1 switching models are required. Thus it can not be applied to non-switched system (6.3). We need to improve it. For this purpose, some new concepts are required: Denition 6.4. 1. Let ' be an involutive distribution on M with constant dimension k. A coordinate frame x is said to be at with respect to ' , if under this coordinate frame } { w w . (6.23) ' = Span ,⋅⋅⋅ , w x1 w xk
156
6 Global Controllability of Afne Control Systems
Fig. 6.2
An Interior Point of {F, G }
2. Let x be a coordinate frame at with respect to an involutive distribution ' , and a vector eld f ∈ V (M) is expressed in this coordinate frame as f (x) = ( f 1 (x), ⋅ ⋅ ⋅ , fn (x))T . The quotient vector eld of f (x) over ' , denoted by f /' , is dened as f (x)/' = f 2 (x), [ where f (x) =
(6.24)
] f 1 (x) and f 2 (x) = ( fk+1 (x), ⋅ ⋅ ⋅ , fn (x))T . f 2 (x)
From Frobenius’ theorem we know that for an involutive distribution with constant dimension, its local at coordinate chart (a chart with at coordinate ame) always exists. Moreover, we would like to emphasize that the quotient vector eld is well dened. Proposition 6.2. [4] Let ' be an involutive distribution with constant dimension, and a vector eld f ∈ V (M) be given. Then the quotient vector eld f /' is uniquely dened. Denition 6.5. 1. Given Y ∈ V (M), a vector X(x0 ) ∈ Tx0 (M) is said to be a G -shifted Y from x1 , denoted by X(x0 ) ∈ G (x0 , x1 )∗Y (x1 ),
(6.25)
if there exist a nite set of vector elds Z1 , ⋅ ⋅ ⋅ , Zs ∈ G, such that x0 = ItZ01 ∘ ⋅ ⋅ ⋅ ∘ ItZ0s (x1 ); s
1
and
( ) ( ) X (x0 ) = ItZ01 ∘ ⋅ ⋅ ⋅ ∘ ItZ0s Y (x1 ). 1
∗
s
∗
2. Let S ⊂ V (M) be a set of vector elds. We may G-shift all vector elds f ∈ S from all points x1 ∈ IG (x0 ) to one point x0 , and denote them by G∗ S(x0 ). That is G∗ S(x0 ) = ∪ { G (x0 , x1 )∗Y (x1 )∣Y ∈ S, x1 ∈ IG (x0 )} .
(6.26)
The following lemma shows that G -shift is “quotient-independent” of the choice of trajectories, which is very important for our purpose.
6.2 A Sufcient Condition
157
Proposition 6.3. Let X(x0 ), Z(x0 ) ∈ G (x0 , x1 )∗Y (x1 ). Then with respect to ' = G we have X(x0 )/' = Z(x0 )/' .
(6.27)
Proof. Assume X (x0 ) is obtained through the mapping: x0 = ItZ01 ∘ ⋅ ⋅ ⋅ ∘ ItZ0s (x1 ); 1
s
Note that Zi ∈ G, so under a at coordinate frame with respect to G (i.e., ' = Span{ wwx , ⋅ ⋅ ⋅ , wwx }), we have 1 k [ 1] Z Zi = i . 0 So the Jacobian matrix of ItZi i has the form ] [ J 0 JI = 11 . 0 I It follows that
(
ItZ01 1
)
[ ] ( ) I (Y 1 (x )) ∘ ⋅ ⋅ ⋅ ∘ ItZ0s Y (x1 ) = ∗ 2 1 Y (x1 ) s ∗ ∗
That is X (x0 )/' = Y 2 (x1 ), which means the quotient vector eld is independent of the choice of Zi .
(6.28) ⊔ ⊓
Note that (6.28) shows that when a vector eld is a G -shifted Y from one point to another, its quotient part is unchanged. Fig. 6.3 depicts this. In Fig. 6.3, [1 , [2 , ⋅ ⋅ ⋅ , K1 , K2 , ⋅ ⋅ ⋅ are vector elds in ' . fa moves along two different paths of ' to b, and results in f ′ and f¯ at b. But they have the same quotient vector fb /' .
Fig. 6.3
Shift f a along '
Now we are ready to present the second key lemma. Lemma 6.4. Assume A1 and let x0 ∈ M. If x0 is an interior of {G∗ F(x0 ); G }, then there exists a neighborhood W of x0 that is a controllable subset.
158
6 Global Controllability of Afne Control Systems
Proof. Exactly following the same procedure proposed in the proof of Lemma 6.1, one sees easily that we can nd an open neighborhood W of x0 and for each x1 ∈ W construct a 4˜ : I ℓ → M, which is composed of a set of integral curves, with the region coving a neighborhood x1 ∈ W1 ⊂ W . Note that ℓ ⩾ n might be a very large integer. Precisely, 4˜ is composed of the integral curves of two categories of vector elds: the rst group of vector elds are as f k + gkj with non-negative time, which is realizable; the second group of vector elds are as f˜i ∈ G (x0 , xi )∗ ( f i ) with non-negative time. That is, there exist Z1 , ⋅ ⋅ ⋅ , Z j ∈ G such that ( ) ( ) ˜f i = I Z01 ∘ ⋅ ⋅ ⋅ ∘ I Z0 j fi (6.29) t t ∗
1
j
∗
Without loss of generality and for notational ease, we assume j = 1, that is ( ) (6.30) f˜i = ItZ0 ∗ f i , ˜i
where Z ∈ G. Now we have to make Itif (x˜0 ) realizable, where x˜0 is a point near x0 (corresponding to the “p” in the proof of Lemma 6.1). A simple computation shows that ˜
(I Z0 )∗ f i
It f0i (x˜0 ) = Iti
t
fi
(x˜0 ) = ItZ0 ∘ Iti
) ( fi Z Z I−t ˜0 ) = ItZ0 ∘ Iti ∘ I−t ˜0 ). 0 (x 0 (x
(6.31)
As is discussed in Case 2 of the proof of Lemma 6.1, we can easily replace the integral of Z ∈ G in (6.31) by some realizable vector elds. Then we have proved that any point x1 in W is reachable from x0 . Note that after the treatment of (6.31), there is no component involving f˜i . Then showing x0 ∈ R(x1 ) is exactly the same as in the proof of Lemma 6.1. ⊔ ⊓ Remark 6.3. The physical meaning of (6.31) is: instead of going along the direction of f˜i , we can go along −Z from x˜0 to x˜1 , then along f from x˜1 to A, and then along Z from A to B. (Refer to Fig. 6.4.) Now let us see the direction of f˜i . In fact, if we set ti = t0 := t and let the trajectory continue to go from B along − f˜i for time t to C, then it is well known [3] that the vector from x˜0 to C is adZ f˜i + O(t 2 ). (Refer to Fig. 6.4.) We conclude that (ItZ )∗ f i ≈ f i + t ⋅ adZ f i .
(6.32)
Similarly, for more than one shifting such as in (6.29) we have j
(ItZ1 1 )∗ ⋅ ⋅ ⋅ (It j j )∗ f i ≈ f i + ¦ tk ⋅ adZk f i . Z
(6.33)
k=1
The advantage of Lemma 6.4 over Lemma 6.1 lies in that the f i (x0 ) in Lemma 6.1 is replaced by f i (xi ). That is, f i ∈ F can be “moved” from all different points of IG (x0 ) to x0 to generate the convex cone. Remark 6.4. It is worthwhile noting that the condition in Lemma 6.4 is a property of the system itself. It can be seen from the following three points:
6.2 A Sufcient Condition
Fig. 6.4
159
Integral Curve of G (x0 , xi )∗ (F)
∙ Condition (i) and (ii) of Proposition 6.1 are independent of the choice of coordinates. So the interior of {F, G } is also coordinate free. ∙ Based on Proposition 6.3 one sees that as ' = G , F/' is invariant under the G (x0 , x1 )∗ transformation. Hence Cx0 := con{G∗ (F)(x0 ); G },
(6.34)
is uniquely and well dened. ∙ It is easy to see that if x0 is an interior of the convex cone of Cx0 , i.e, it satises the condition of Lemma 6.4, then all points x ∈ IG (x0 ) are also interior points of the corresponding convex cones, because shifting is a diffeomorphism. So the condition in Lemma 6.4 is a property of each maximum integral manifold of G . Therefore, instead of {G∗ (F)(x0 ); G }, we can use {G∗ (F); G }. Now we are ready to state the rst main theorem: Theorem 6.1. Assume A1 and that M is pathwise connected. Then system (6.7) is controllable if for each maximum integral manifold IG (x0 ), ∀x0 ∈ M, there exists a point y ∈ IG (x0 ) (equivalently, every point on this integral manifold) that is an interior of Cy = con{G∗ (F); G }. Proof. For any two points x, y ∈ M, connect them by a path c(t), 0 ⩽ t ⩽ 1 (c(0) = x and c(1) = y). According to Lemma 6.4 each point c(t) has a controllable neighborhood, called W (xt ), where xt = c(t). Since c(t) is the continuous image of a compact set [0, 1], it is compact. Since {W (xt )∣0 ⩽ t ⩽ 1} is a covering of c(t), it has a nite sub-covering {W (x0 = x),W (x1 ), ⋅ ⋅ ⋅ ,W (x j = y)}. Without loss of generality, we can assume W (xi ) ∩ W (xi+1 ) ∕= ∅, and pi ∈ W (xi ) ∩ W (xi+1 ). Then x ∈ R(pi ), ∀i, which means x ∈ R(y). Similarly, we have y ∈ R(x). ⊔ ⊓ We give some examples to illustrate this theorem. Example 6.2. 1. Consider the following system ⎧ x1 = xn x = x3n ⎨ 2 .. . xn−1 = x2n−1 n ⎩ xn = u, x ∈ ℝn , u ∈ U .
(6.35)
160
6 Global Controllability of Afne Control Systems
For notational ease, denote the system as x = f (x) + g(x)u, and x = (x1 , x2 ), where x1 = (x1 , x2 , ⋅ ⋅ ⋅ , xn−1 )T . The integral manifold of G passing x0 is { } IG (x0 ) = x ∈ ℝn ∣ x1 = x10 . Choosing yi = (x10 , ki ), zi = (x10 , −ki ), i = 1, ⋅ ⋅ ⋅ , n − 1, where ki > 0, and ki ∕= k j (i ∕= j). Dene vectors Yi = f (yi ), Zi = f (zi ), i = 1, ⋅ ⋅ ⋅ , n − 1. It is obvious that g∗ (Yi ) = Yi and g∗ (Zi ) = Zi . Choose Yn = (0, ⋅ ⋅ ⋅ , 0, 1)T ∈ G , and Zn = −Yn . Then as a Vandermonde determinant, we have [ ] n−1 det Y1 , ⋅ ⋅ ⋅ ,Yn = ki i=1
(k2j − ki2 ) ∕= 0.
n⩾ j>i⩾1
So, {Yi } are linearly independent. In addition, n
n
i=1
i=1
¦ Yi + ¦ Zi = 0.
Using Proposition 6.1, x0 is an interior point of {G∗ (F); G }. Since x0 is arbitrary, Theorem 6.1 tells us that the system (6.35) is controllable. 2. Consider a planar controllable nonlinear system x = f (x) + g(x)u,
x ∈ ℝ2 .
(6.36)
If g(x) is complete, each integral curve of g(x) splits ℝ2 into two disjoint parts. Now if on each integral curve of g(x) there exist two points, say p and q, where f (p) and f (q) directed to two opposite sides, then the system is globally controllable. This is a particular case of Theorem 6.1. Obviously, it is also necessary [11]. (Please refer to Fig. 6.5.) Particularly, consider a linear system { x1 = x2 (6.37) x2 = ax1 + bx2 + u. It is a special case of system (6.36), thus controllable.
Fig. 6.5
Controllable Planar System
6.2 A Sufcient Condition
161
3. Consider the following system ⎧ x1 = xqn1 + P1 (x) q2 ⎨x2 = xn + P2 (x) .. . q xn−1 = xnn−1 + Pn−1 (x) ⎩ xn = fn (x) + gn (x)u, x ∈ ℝn .
(6.38)
Assume that (i). gn (x) ∕= 0, ∀x ∈ ℝn ; (ii). qi , i = 1, ⋅ ⋅ ⋅ , n − 1 are distinguished positive odd numbers; (iii) Function Pi (x) has the following property lim
xn →f
Pi (x) = 0, xqni
i = 1, ⋅ ⋅ ⋅ , n − 1.
Then system (6.38) is controllable. The proof is sketched as follows: Using the prefeedback 1 [v − fn (x)] u= gn (x) to simplify f and g rst, we have fn (x) = 0 and gn (x) = 1. Then we consider these simplied f and g. Using similar notations as for system (6.35) and let ki be large enough, since Yi are linearly independent, we can express Zi as n
Zi = f (zi ) = − ¦ ci jY j . j=1
Moreover, as ki → f, it is obvious that cii → 1,
ci j → 0, j ∕= i.
Now we have n−1
n−1 n−1
n−1
n−1
i=1
i=1 j=1
i=1
i=1
¦ Zi + ¦ ¦ ci jY j + Yn + Zn = ¦ Zi + ¦
(6.39)
(
) cii + ¦ ci j Yi + Yn + Zn = 0. j∕=i
The positivity of the coefcients is from (6.39). Example 6.3. Consider the following switched system x = f V (t) (x) + gV (t) (x)u,
x ∈ M, u ∈ U ,
where M = ℝ3 ∖{0} ⊂ ℝ3 , / = {1, 2} and f 1 = (sin(x1 ), 0, 0)T ; f 2 = (0, 0, 0)T ; ⎡ ⎤ ⎡ ⎤ 0 10 0 01 g1 (x) = ⎣−1 0 0⎦ x := B1 x; g2 (x) = ⎣ 0 0 0⎦ x := B2 x. 0 00 −1 0 0 It is easy to verify that as the subset of gl(3, ℝ) we have
(6.40)
162
6 Global Controllability of Afne Control Systems
{B1 , B2 }LA = o(3, ℝ). That is, G = o(3, ℝ)x. So the maximum integral manifolds of G are spheres IG (x0 ) = SO(3, ℝ)x0 = ∥x0 ∥S2 , { } where S2 = x ∈ ℝ3 ∣ ∥x∥ = 1 . Now on each ∥x0 ∥S2 we can nd two points x, y with 0 < x1 < π, x3 > 0 and −π < y1 < 0, y3 > 0 (on upper hemisphere). Then it is easy to see that f1 (x1 ) is going out from and f1 (x2 ) is going in into the sphere. A straightforward verication shows that the condition of Theorem 6.1 is satised. So the system is controllable on M = ℝ3 ∖{0}. Remark 6.5. Motivated by the above example, we have the following observation: Let S ⊂ M be a pathwise connected open subset of M. Then S is a sub-manifold of M with the same dimension. So the controllability result obtained in Theorem 6.1 can be easily extended to the semi-global controllability over S. Example 6.4. [5, 11] Consider the following system [ ] [ ] ] [ − sin(x2 ) cos(x2 ) x1 sin(x2 )e−x1 = u, + x2 cos(x2 )e−x1 sin2 (x2 )
x ∈ ℝ2 .
(6.41)
[5] proved that it is not globally linearizable. [11] proved that it is not globally controllable. We claim that it is semi-globally controllable on each strip Mk = {x ∈ ℝ2 ∣kπ − π/2 < x2 < kπ + π/2},
k ∈ ℤ.
We prove it for k = 0 only. (Argument for other k’s is the same.) A basis of G is ((sin(x2 ), cos(x2 ))T . A straightforward computation shows that the integral manifold passing through x0 ∈ M0 is ⎧ 2 2t 2 ⎨x1 = ln(D e + 1) − t − ln(D + 1) + x1(0), ( t ) 1 + sin(x2 (0)) ⎩x2 = 2 tan−1 D et − 1 , where D = . cos(x1 (0)) De + 1 Now since t → −f, x2 → −π/2 and t → f, x2 → π/2, so there exists t0 such that x2 (t0 ) = 0. It is easy to see that as t > t0 and t < t0 f points to different sides of IG (x0 ). So the system is semi-globally controllable on M0 . Theorem 6.1 is based on G. It was shown in the previous chapter that a switched system without control may still be controllable. In fact, we can prove the following corollary for switched systems in a similar way as before: Corollary 6.1. System (6.7) is controllable if every point in M is an interior point of F.
6.3 Multi-hierarchy Case
163
Proof. Using equation (6.15) in the proof of Lemma 6.1 and the same argument there, and then the same argument in the proof of Theorem 6.1, the conclusion follows. ⊔ ⊓ Example 6.5. Consider a switched system x = fV (t) (x),
x ∈ ℝn ∖{0},
(6.42)
where V ∈ / = {1, 2, ⋅ ⋅ ⋅ , n(n − 1) + 2}, and fi = Bi x,
fn(n−1)/2+i = −Bi x,
i = 1, 2, ⋅ ⋅ ⋅ , n(n − 1)/2,
with {B1 , B2 , ⋅ ⋅ ⋅ , Bn(n−1)/2 } a basis of o(n, ℝ), and the last two are ±In . It is easy to see that at each x ∈ M fi (x), i = 1, ⋅ ⋅ ⋅ , n(n − 1) span a convex cone on the tangent space of Sn−1 at x with x as it interior point (with respect to the sub-space topology of Sn−1). Adding the last two vectors fn(n−1)+1(x) and fn(n−1)+2 (x) as vectors at the ± radius directions make x an interior point of {F, G }. So (6.42) is controllable. This example shows that Corollary 6.1 is not necessary since it is easy to see that modes i = 1, 2, ⋅ ⋅ ⋅ , n(n − 1)/2 plus the last two are enough to make the system controllable.
6.3 Multi-hierarchy Case Before giving general results we want to give some motivations for considering the hierarchical structure of a controllable set. First, consider linear system (6.1). Assume m = 1 and put it into Brunovsky canonical form ⎧ x1 = x2 ⎨.. . (6.43) xn−1 = xn ⎩ xn = u, x ∈ ℝn , u ∈ U . Check the condition of Theorem 6.1. Now along IG (x0 ) the vector eld has the form as f = ((x2 )0 , ⋅ ⋅ ⋅ , (xn−1 )0 , xn , 0) . When following the moving style as proposed in Section 6.2 the only direction we can go out of the IG (x0 ) is the xn−1 direction. This motivates us that what is proposed in Section 6.2 is only the “rst step” of the motion. To nd all the ways the system can be driven, a sequence of motions should be followed. For the linear case, it is not difcult to see that the rst motion can reach B, AB. So the second motion will go to A2 B and so on. (Refer to Fig. 6.6(a).) The second motivation is from Lemma 6.1 and Lemma 6.4. In fact, it is obvious that in Lemma 6.1 the movable direction (out of IG (x0 ) ) is f . In the proof of Lemma 6.4, it was shown that, roughly speaking, in addition to the direction of f the additional direction is adkG f (see the Remark after the proof of Lemma 6.4). In fact,
164
6 Global Controllability of Afne Control Systems
( ) the directions the trajectories can really go are ItG ∗ f . Using Baker-CampbellHausdorff formula [1] for any X ∈ G yields ( X) 1 It ∗ f (x0 ) = f (x0 ) + adX f (x0 )t + ad2X f t 2 + ⋅ ⋅ ⋅ . 2!
(6.44)
This equation clearly shows that all the possible directions for the rst step of motion is adkG f , k ⩾ 0. Similar to the linear case, we may consider [g∗ ( f )]∗ f as the next step and keep going on. (Refer to Fig. 6.6(b).)
Fig. 6.6
Controllability Distributions
Motivated by the aforementioned argument, we will construct a sequence of distributions for controllability of system (6.7). To begin with, we need some preparations: 1. Let '1 ⊂ ' 2 ⊂ ⋅ ⋅ ⋅ ⊂ 'k∗ = T (M) be a sequence of nested involutive distributions of constant dimensions, dim(' i ) = ni . Using generalized Frobenious’ theorem (Lemma 5.7), there is a at coordinate chart (U, x), such that locally { } w w 'i = Span ,⋅⋅⋅ , , i = 1, ⋅ ⋅ ⋅ , k∗ . w x1 w xni 2. Let ' be an involutive { distribution}of dimension k, and x be a at coordinate frame, such that ' = wwx , ⋅ ⋅ ⋅ , wwx . Assume a vector eld f (x) is locally ex1
k
pressed as f = ( f1 , ⋅ ⋅ ⋅ , fn )T . Then the projection of f on ' is dened as f ∣' = f − icl∗ ( f /' ), where icl : (I' )⊥ → M is the inclusion mapping. Precisely, let f /' = ( fk+1 (x), ⋅ ⋅ ⋅ , fn (x))T . Then f ∣' = ( f1 (x), ⋅ ⋅ ⋅ , fk (x), 0, ⋅ ⋅ ⋅ , 0)T , and icl∗ ( f /' ) = (0, ⋅ ⋅ ⋅ , 0, fk+1 (x), ⋅ ⋅ ⋅ , fn (x))T . Now we can dene the following sequence of distributions, called the set of controllability distributions, as: { '1 := G { } (6.45) 'k+1 := '¯k + Span ad j F j ⩾ 1 , k = 1, 2, ⋅ ⋅ ⋅ . '¯k
6.3 Multi-hierarchy Case
165
Denition 6.6. System (6.7) is said to have a proper set of controllability distributions if the sequence of distributions ' i dened in (6.45) satisfy the following conditions: 1. There exists k∗ such that '¯k∗ = T (M); 2. '¯1 , ⋅ ⋅ ⋅ , '¯k∗ −1 have constant dimensions. It is worth to mention that for linear systems '1 = Span{B}, ' 2 = Span{B, AB}, ⋅⋅⋅. Denition 6.7. Let ' be an involutive distribution on M with constant dimension. A point x ∈ I' (x0 ) is said to be a deep interior point of {(' )∗ (F), ' } if for any r > 0 there exist nite vectors Yi (x0 ) ∈ {(' )∗ (F), ' }, i = 1, ⋅ ⋅ ⋅ , s such that the whole ball Br (0) is in the interior of the convex cone: con{Yi (x0 )∣ i = 1, ⋅ ⋅ ⋅ , s}. Note that here the radius r can be arbitrary large, but assigned before choosing Yi . Now we are ready to state our main result. Theorem 6.2. Consider system (6.7). Assume it has a proper set of controllability distributions dened in (6.45), which satisfy the following conditions (for each x0 ∈ M) : (i). There exists xi ∈ I'¯i (x0 ) (equivalently, for any point x ∈ I'¯i (x0 )), such that { } xi is a deep interior point of ('¯i )∗ (F∣'¯i+1 ), '¯i , with respect to the sub-space topology of I'¯i+1 (x0 ), for i = 1, ⋅ ⋅ ⋅ , k∗ − 2. (ii). There exists xk∗ −1 ∈ I'¯k∗ −1 (x0 ) (equivalently, for any point x ∈ I'¯k∗ −1 (x0 )), { } such that xk∗ −1 is an interior point of ('¯k∗ −1 )∗ (F), '¯k∗ −1 . Then system (6.7) is globally controllable. Proof. First consider '¯k∗ −1 as G , and similar to the proofs of Lemmas 6.1 and 6.4, it is easy to nd for each x0 ∈ M a mapping 4 as in (6.14), such that 4 : I n → W ⊂ M is a diffeomorphism, where W is a neighborhood of x0 . Note that this 4 is composed of integral curves of the vector elds in '¯k∗ −1 or F. Using the same argument as in Case 1 and Case 3 of the proof of Lemma 6.1 and the proof of Lemma 6.4, we can nd, for each x1 ∈ W , Z1 , ⋅ ⋅ ⋅ , Zℓ ∈ 'k∗ −1 ∪ F, such that the modied 4˜ : I ℓ → Wx1 ⊂ W starts from x0 , use the integral curves of Zi , and nally maps onto a neighborhood of x1 . Moreover, for Zi ∈ F the corresponding time is non-negative. When reversing the time and modifying f ∈ F, a new 4˜ , denoted by 4˜ c : I ℓ → Wx0 ⊂ W , goes backward from x1 to a neighborhood of x0 . Roughly speaking, x0 is locally controllable by {F; 'k∗ −1 }. Next, we conne to each leave I'¯k∗ −1 (x0 ), and show that for Z ∈ ' k∗ −1 the corresponding component ItZ in 4˜ can be replaced by the integral curves of vector elds in 'k∗ −2 ∪ F. First, using Baker-Campbell-Hausdorff formula, we can prove easily that } { (6.46) 'k∗ −1 ⊂ Span ('¯k∗ −2 )∗ F ' ∗ ; '¯k∗ −2 . k −1
166
6 Global Controllability of Afne Control Systems
According to (6.46) and the argument in the{proof of Lemma}2.9, ItZ can be replaced by the integral curves of vector elds in '¯k∗ −2 ∪ F∣'k∗ −1 . Repeating the same argument as in Case 1 and Case 3 of the prove of Lemma 6.1 and the proof of Lemma 6.4, one sees that we can do this. In the resulting mapping we have integral curves of vector elds as Z ∈ '¯k∗ −2 and f ∣'k∗ −1 , f ∈ F. For Z ∈ '¯k∗ −2 we know how to replace it by a set of Zi ∈ 'k∗ −2 as in the rst step. As for f ∣'k∗ −1 , we can formally replace it by its corresponding f . Then the problem caused by this replacement is that the components of the vector eld belong to f ∣'¯k∗ = f have been changed from (0, ⋅ ⋅ ⋅ , 0)T ∗ to f k = ( fnk∗ −1 +1 , fnk∗ −1 +2 , ⋅ ⋅ ⋅ , fn )T . This makes the destination point drift. Fortu∗ nately from Proposition 6.3, f k is coordinate-independent of '¯k∗ −2 . So when the system goes along the trajectories of '¯k∗ −2 and F∣'¯k∗ −1 the part of variables corre∗
sponding to f k drift freely. By the denition of deep interior, the movement along '¯k∗ −2 and f ∣'k∗ −1 can be within a time period as short as we wish. This makes the drift be as small as possible. So it does not affect the property that the region of the corresponding transfer mapping covers a neighborhood of x and vise versa. By induction, we can keep on reducing the subscript of the distributions of {'l } till '1 . Using the argument for Case 2 of the proof of Lemma 6.1, we can easily convert the vector elds in ' 1 to being realizable. ⊔ ⊓ Remark 6.6. Assume (6.7) has a proper set of controllability distributions. We may express (6.7) in a coordinate chart that is at with respect to '¯i . For notational ease, denote {x1 , ⋅ ⋅ ⋅ , xi } = {x1 , x2 , ⋅ ⋅ ⋅ , xni }, i = 1, 2, ⋅ ⋅ ⋅ , k∗ . Then (6.7) can be expressed locally as ⎧ 1 x = f V (t),1 (x) + GV (t),1 (x)u x2 = f V (t),2 (x) 3 V (t),3 (x2 , x3 , ⋅ ⋅ ⋅ , xk∗ ) ⎨x = f ∗ x4 = f V (t),4 (x3 , x4 , ⋅ ⋅ ⋅ , xk ) . .. xk∗ −1 = f V (t),k∗ −1 (xk∗ −2 , xk∗ −1 , xk∗ ) ⎩ k∗ ∗ ∗ ∗ x = f V (t),k (xk −1 , xk ).
(6.47)
We may call it the controllability canonical form of afne control systems. We give some examples. Example 6.6. 1. For linear systems Theorem 6.2 becomes necessary and sufcient. To see this we only have to prove the necessity. Consider a controllable linear system. We prove it for the single-input case. The proof for the multi-input case is exactly the same. Assume the system is already in the canonical form (6.43). First, the set of controllability distributions are easily computed as
6.3 Multi-hierarchy Case
167
'1 = Span{b} = Span{Gn } '2 = Span{b, Ab} = Span{Gn , Gn−1 } .. . 'n = Span{b, Ab, ⋅ ⋅ ⋅ , An−1 b} = T (ℝn ), where Gi is the i-th column of the identity matrix In . Now the restriction of f = Ax on '2 is f ∣'2 = (0, ⋅ ⋅ ⋅ , 0, xn , 0)T and it is obvious that corresponding to the subspace topology of I'2 the f ∣'{2 can approach to} ±f. That is, any point on I'1 is obviously a deep interior of (' 1 )∗ (F∣'2 ), '1 . Continuing the same argument shows that the conditions of Theorem 6.2 are satised. We conclude that the conditions of Theorem 6.2 are necessary and sufcient for linear systems. 2. Consider the following system ⎧ x1 = sin(x2 ) ⎨x2 = x3 .. . xn−1 = xn ⎩ xn = u.
(6.48)
Similar to the rst example, one sees easily that the conditions of Theorem 6.2 are satised. So (6.48) is globally controllable. (Note that only at the last step for x ∈ I'n−1 , it is only an interior (not deep interior) of {(' n−1 )∗ (F), 'n−1 }, but it is enough.) Example 6.7. Consider switched linear system (6.8). It is easy to see that
'1 = Span{ Bi ∣ 1 ⩽ i ⩽ N}; '2 = '1 + Span{ Ai1 Bi2 ∣ 1 ⩽ i1 , i2 ⩽ N}; and so on. {As argued in the } linear (non-switched) case, x ∈ I'i is always a deep interior of ('i )∗ (F∣'i+1 ), ' i . (In fact, if a straight line is not in a subspace, we can always nd two points which are on the opposite directions and as far from the subspace as we wish.) So the only condition we have to check is: Whether there exists a k∗ such that 'k∗ = ℝn . This argument leads to the following known result [12]. Proposition 6.4. The switched linear system is controllable, if and only if 'n = Span{Bi1 , Ai2 Bi2 , ⋅ ⋅ ⋅ , Ain1 Ain2 ⋅ ⋅ ⋅ Ainn−1 Binn 1 ⩽ ikj ⩽ N} = ℝn . 1
1
2
Example 6.8. Consider the following system ⎧ x1 = xq21 ⎨.. . q xn−1 = xnn−1 ⎩ xn = u,
(6.49)
(6.50)
168
6 Global Controllability of Afne Control Systems
where q1 , ⋅ ⋅ ⋅ , qn−1 are positive odd integers. Arguing as for linear systems, it is easy to prove that this system is controllable. q q Moreover, if xi i are replaced by xi i + LOT(xi ), the conclusion remains true. (LOT: lower order terms.) Example 6.9. Consider the following system ⎤ ⎡ ⎤ ⎡ cos(x2 + x3 ) 1 ⎥ ⎢ ⎥ ⎢ x 1 ⎥ + ⎢0⎥ u. x = ⎢ ⎦ ⎣0⎦ ⎣ x34 sin(x2 + x3) 1 Calculate that
⎧⎡ ⎤⎫ 1 ⎨ ⎢0⎥⎬ ⎥ ; '1 = G = Span ⎢ ⎣ ⎦ 0 ⎩ ⎭ 1
(6.51)
⎧⎡ ⎤ ⎡ ⎤ ⎡ ⎤⎫ 0 0 1 ⎨ ⎢0⎥ ⎢1⎥ ⎢0⎥⎬ ⎥,⎢ ⎥,⎢ ⎥ . '2 = Span ⎢ ⎣ ⎦ ⎣0⎦ ⎣1⎦ 0 ⎭ ⎩ 1 0 0
Then it is easy to see that ' 1 is in the deep interior of {(' 1 )∗ f ∣'2 , ' 1 }. Moreover, it is also easy to check '¯3 = T (ℝ4 ). So we only have to check whether ' 2 is in the interior of {(' 2 )∗ f , ' 2 }. At p1 = (0, π/2, 0, 0)T and p2 = 0 we have f (p1 ) = (0, 0, 0, 1)T ,
f (p2 ) = (1, 0, 0, 0)T .
Choosing g1,2 = ±(0, 1, 0, 0)T and g3,4 = ±(0, 0, 1, 0)T , g5 = (1, 0, 0, 1)T and setting Z (p ) = p , we have Z = g1 = (0, 1, 0, 0)T. Iπ/2 2 1 ( ) Z Iπ/2 f (p2 ) = (1, 0, 0, 0)T . ∗
Then we have
( ) Z f (p2 ) + (−g5) + g1 + g2 + g3 + g4 = 0. f (p1 ) + Iπ/2 ∗
Since all ±gi ∈ G , using Proposition 2.2, one sees that ' 2 is in the interior of T (ℝ4 ). We conclude that the system (6.51) is controllable.
6.4 Codim(G ) = 1 This section considers the case when Codim(G ) = 1. We will do two things for this particular case. First, simplify the sufcient condition. Secondly, show that under certain mild restriction on systems the condition is also necessary. Recall that an n dimensional manifold is orientable if it is possible to dene a C f n-form Z on M that is not zero at any point. In this case M is said to be oriented by Z. Denition 6.8. Let f ∈ V (M). It deduces a mapping i f : : k+1 → : k , which is dened for each Z ∈ : k+1 as
6.4 Codim(G ) = 1
i f (Z )(⋅) := Z ( f , ⋅).
169
(6.52)
Now we are ready to give a general result. Theorem 6.3. 1. Assume for each x0 ∈ M there exist V1 ∈ : 1 (M), VG ∈ : n−1 (M), where VG is an orientation of IG (x0 ), and V1 (Z) = 0, ∀Z ∈ G , such that V = V1 ∧ VG is an orientation of M. Moreover, on each IG (x) there are two vector elds f1 , f2 ∈ F and two points x1 , x2 ∈ IG (x0 ) such that i f1 (V )∣G (x1 ) = c1 VG (x1 ),
i f2 (V )∣G (x2 ) = c2 VG (x2 ),
(6.53)
where f1 , f2 ∈ F and c1 , c2 < 0. Then the system (6.7) is globally controllable. 2. If, in addition, each IG (x0 ) separates M, then (6.53) is also necessary. Proof. (Sufciency) According to Theorem 6.1, we only have to prove that G (x2 , x1 )∗ f1 (x1 ) and f2 (x2 ) are on the two sides of IG (x2 ). Since IG (x) is orientable, we can nd a set of coherently oriented coordinate charts (UP , xP ), such that [2] P VG = K P (x)x1P ∧ x2P ∧ ⋅ ⋅ ⋅ ∧ xn−1 ,
where K P (x) > 0, x ∈ UP . Let a canonical local basis of G be chosen as Zi =
w , w xiP
x ∈ UP , i = 1, ⋅ ⋅ ⋅ , n − 1,
which are chart-depending. We have
VG (Z1 , ⋅ ⋅ ⋅ , Zn−1 )(x) > 0,
∀x ∈ M.
(6.54)
P
(Precisely, x ∈ UP and Zi = Zi , which are dened over UP .) Now we have i f1 V (Z1 , ⋅ ⋅ ⋅ , Zn−1 ) = V1 ( f1 )VG (Z1 , ⋅ ⋅ ⋅ , Zn−1 ) = c1 (x)VG (Z1 , ⋅ ⋅ ⋅ , Zn−1 ).
(6.55)
So we have
V1 ( f1 )(x1 ) = c1 (x1 ).
(6.56)
V1 ( f2 )(x2 ) = c2 (x2 ).
(6.57)
Similarly, we have
Recall that G (x2 , x1 )∗ f1 (x1 ) = icl∗ [ f1 (x1 )/G ] + K ,
K ∈ G.
Then using the fact that V1 (Z) = 0, Z ∈ G , we have
V1 [G (x2 , x1 )∗ f1 (x1 )](x2 ) = V1 ( f1 ) = c1 (x1 ). Now since
V [G∗ f1 (x2 , x1 ), Z1 , ⋅ ⋅ ⋅ , Zn−1 ](x2 ) = c1 (x1 )VG (Z1 , ⋅ ⋅ ⋅ , Zn−1 )
(6.58)
170
6 Global Controllability of Afne Control Systems
and
V [ f2 , Z1 , ⋅ ⋅ ⋅ , Zn−1 ](x2 ) = c2 (x2 )VG (Z1 , ⋅ ⋅ ⋅ , Zn−1 ) have opposite signs, [G (x2 , x1 )∗ f1 (x1 )](x2 ) and f2 (x2 ) must be on the different sides of IG (x2 ). To see this dene Y (t) = tY1 + (1 − t)Y2,
t ∈ [0, 1],
where Y1 = [G (x2 , x1 )∗ f1 (x1 )](x2 ) and Y2 = f 2 (x2 ). If both Y1 and Y2 are on the same side of IG (x2 ), then Y (t) is always linearly independent of G (x2 ). But V [Y (t), Z1 , ⋅ ⋅ ⋅ , Zn−1 ](x2 ) has different signs at t = 0 and t = 1, so there exits a 0 < t ∗ < 1, such that V [Y (t ∗ ), Z1 , ⋅ ⋅ ⋅ , Zn−1 ](x2 ) = 0, which is a contradiction. (Because an orientation can never be zero over a set of n linearly independent vector elds.) (Necessity) Assume there is a IG (x) such that (6.53) fails. According to our previous argument we know that for all y, z ∈ IG (x) and f 1 , f2 ∈ F we have V1 ( f1 (y)) and V1 ( f2 (z)) have the same sign. That is, all the f ∈ F point to the same side of IG (x). Since IG (x) separates M, it is easy to see that the half M that is pointed by fi ’s is an invariant set. So the system is not controllable. ⊔ ⊓ Some conditions in Theorem 6.3 are related. We refer to [8] for verication and possible simplication of those conditions. Corollary 6.2. Assume M = ℝn . Let G (x0 ), ∀x0 ∈ M, be an n − 1 hyperplane, and Z1 , ⋅ ⋅ ⋅ , Zn−1 be a basis of G . Then a necessary and sufcient condition for system (6.7) to be globally controllable is that on each IG (x0 ), x0 ∈ M, there are two vector elds, f1 , f2 ∈ F, and two points x1 , x2 ∈ IG (x0 ) (same fi and/or xi are allowed), such that det( f 1 , Z1 , ⋅ ⋅ ⋅ , Zn−1 )(x1 ) det( f2 , Z1 , ⋅ ⋅ ⋅ , Zn−1 )(x2 ) < 0.
(6.59)
Proof. First, (6.59) is equivalent to the following statement: Choose V = dx1 ∧dx2 ∧ ⋅ ⋅ ⋅ ∧ dxn , then
V ( f1 , Z1 , ⋅ ⋅ ⋅ , Zn−1 )(x1 )V ( f2 , Z1 , ⋅ ⋅ ⋅ , Zn−1 )(x2 ) < 0.
(6.60)
Since (6.59) is independent of the choice of orientation V , we only have to prove that there exists a particular orientation such that (6.59) implies (6.53). Choose a particular coordinate frame z = z(x) such that { G = Span
w w ,⋅⋅⋅ , w z2 w zn
} .
Then we simply choose V = dz1 ∧ dz2 ∧ ⋅ ⋅ ⋅ ∧ dzn , and set V1 = dz1 and VG = dz2 ∧ ⋅ ⋅ ⋅ ∧ dzn . Let fi (z) = ( fi1 (z), ⋅ ⋅ ⋅ , fin (z))T , i = 1, 2. Then i f1 V = f11 dz2 ∧ ⋅ ⋅ ⋅ ∧ dzn + dx1 ∧ K ,
where K ∈ : n−2 (M).
References
So
i f1 V G = f11 dz2 ∧ ⋅ ⋅ ⋅ ∧ dzn .
Similarly,
i f2 V G = f21 dz2 ∧ ⋅ ⋅ ⋅ ∧ dzn .
171
Note that if Zi ∈ G , then Zi = (0, zi2 , ⋅ ⋅ ⋅ , zin )T . So (6.60) implies that f11 (x1 ) and f21 (x2 ) have different signs, which implies (6.53). ⊔ ⊓ Example 6.10. Consider the following system ⎤ ⎡ ⎤ ⎤ ⎡ ⎡ 2 0 0 x2 + x3 ⎥ ⎢ ⎥ ⎥ ⎢ ⎢ ⎢ sin(x4 ) ⎥ ⎢ f2 ⎥ ⎢0⎥ ⎢ ⎥ ⎥ ⎥ ⎢ ⎢ x = ⎢ ⎥ + ⎢ ⎥ u1 + ⎢ ⎥u . ⎢cos(x4 )⎥ 2 ⎢ f3 ⎥ ⎢0⎥ ⎦ ⎣ ⎦ ⎦ ⎣ ⎣ It is easy to check that
{ G=
A basis of G is
⎡ ⎤ 0 ⎢ ⎥ ⎢0⎥ ⎢ ⎥ Z1 = ⎢ ⎥ ; ⎢0⎥ ⎣ ⎦ 1
⎡
g24
1
f4
0
w w w , , w x2 w x3 w x4
} .
⎤
⎥ ⎢ ⎢ sin(x4 ) ⎥ ⎥ ⎢ Z2 = ⎢ ⎥; ⎢cos(x4 )⎥ ⎦ ⎣
(6.61)
⎡
0
⎤
⎥ ⎢ ⎢ cos(x4 ) ⎥ ⎥ ⎢ Z3 = [Z1 , Z2 ] = ⎢ ⎥. ⎢− sin(x4 )⎥ ⎦ ⎣
0
0
{ } Moreover, IG (x0 ) = x ∈ ℝ4 x4 = x4 (x0 ) , and det( f , Z1 , Z2 , Z3 ) = x22 + x3 . Obviously, (6.59) is satised for some x2 , x3 ∈ IG (x0 ). So system (6.61) is controllable.
References 1. Abraham R, Marsden J, Ratiu T. Manifolds, Tensor Analysis and Applications. New York: Springer-Verlag, 1988. 2. Boothby W. An Introduction to Differentiable Manifolds and Riemannian Geometry, 2nd edn. Orlando: Academic Press, 1986. 3. Brockett R. Nonlinear systems and differential geometry. Proceedings of the IEEE, 1976, 64(1): 61–72. 4. Cheng D, Isidori A, Respondic W, et al. On the linearization of nonlinear systems with outputs. Mathenatical Systems Theory, 1988, 21(2): 63–83. 5. Cheng D, Tarn T, Isidori A. Global external linearization of nonlinear systems via feedback. IEEE Trans. Aut. Contr., 1985, 30(8): 808–811. 6. Clarke F, Stern R. Lyapunov and feedback characterizations of state constrained controllability and stabilization. Sys. Contr. Lett., 2005, 54(8): 747–752. 7. Hermann R. Differential Geometry and the Calculus of Variations. New York:Academic Press, 1968.
172
6 Global Controllability of Afne Control Systems
8. Hirsch M. Differential Topology. New York: Springer-Verlag, 1976. 9. Olver P. Applications of Lei Groups to Differential Equations, 2nd edn. New York: SpringerVerlag, 1993. 10. Respondek J. Controllability of dynamical systems with constraints. Sys. Contr. Lett., 2005, 54(4): 293–314. 11. Sun Y. Necessary and sufcient condition for global controllability of planar afne nonlinear systems. IEEE Trans. Aut. Contr., 2007, 52(8): 1454–1460. 12. Sun Z, Ge S, Lee T. Controllability and reachability criteria for switched linear systems. Automatica, 2002, 38(5): 775–786.
Chapter 7
Stability and Stabilization
Stability is a fundamental property for dynamic systems. In most engineering projects unstable systems are useless. Therefore in system analysis and control design the stability and stabilization become the rst priority to be consider. This chapter considers the stability of dynamic systems and the stabilization and stabilizer design of nonlinear control systems. In Section 7.1 the concepts about stability of dynamic systems are presented. Section 7.2 considers the stability of nonlinear systems via its linear approximation. The Lapunov direct method is discussed in Section 7.3. Section 7.4 presents the LaSalle’s invariance principle. The converse theory of Lyapunov stability is introduced in Section 7.5. Section 7.6 is about the invariant set. The input-output stability of control systems is discussed in Section 7.7. In section 7.8 the semi-tensor product is used to nd the region of attraction. Many results in this chapter are classical, hence the proofs are omitted.
7.1 Stability of Dynamic Systems Stability theory has had a long history. The concept of stability came originally from mechanics where the equilibrium of a rigid body was studied. The modern stability theory that allows the analysis of a general differential equation was rst developed by Russian mathematician Aleksandr M. Lyapunov (1857–1918). In this section we will introduce stability concepts in the sense of Lyapunov [6, 14]. Consider a time-varying dynamic nonlinear system x = f (x,t),
x ∈ ℝn ,t ⩾ 0.
(7.1)
A point x0 is called an equilibrium if f (x0 ,t) = 0,
t ⩾ 0.
Without loss of generality, we assume x0 = 0. Because if x0 ∕= 0 we may make a coordinate change z = x − x0 . Then, expressing (7.1) into z coordinate frame, z = 0 becomes the equilibrium. For convenience we also assume that the system has a unique solution for each initial condition x0 in a neighborhood N0 of x0 and each t0 , which is denoted by x(x0 ,t,t0 ). We refer to standard ODE textbooks for the existence and uniqueness of the solution of (7.1). In the following we give a simple commonly used result. System (7.1) (or briey, f (t, x)) is said to satisfy Lipschitz condition if there exists a constant D. Cheng et al., Analysis and Design of Nonlinear Control Systems © Science Press Beijing and Springer-Verlag Berlin Heidelberg 2010
174
7 Stability and Stabilization
number L > 0, such that ∥ f (x,t) − f (y,t)∥ ⩽ L∥x − y∥,
x, y ∈ ℝn ,t ⩾ 0.
(7.2)
It is said to satisfy the Lipschitz condition on a region U ⊂ ℝn if (7.2) is satised for any x, y ∈ U. Theorem 7.1. [8] Consider system (7.1). Assume that it satises Lipschitz condition (7.2) for x, y ∈ Br (x0 ) and t ∈ [t0 ,t1 ]. Then there exists a G > 0 such that system (7.1) with initial condition x(t0 ) = x0 has a unique solution on [t0 ,t0 + G ] ⊂ [t0 ,t1 ]. If the time t does not appear explicitly on the right hand side of (7.1), we have x = f (x),
x ∈ ℝn ,
(7.3)
which is called an autonomous system. Autonomous system is mostly important in engineering applications. Because of autonomy we have x(x0 ,t + c,t0 + c) = x(x0 ,t,t0 ), which implies that the solution does not depend on a particular initial time. Thus we can rewrite the solution as x(x0 ,t − t0 ) or simply assume t0 = 0. First, we consider the Lyapunov stability. Denition 7.1. Consider system (7.1) and assume x = 0 is an equilibrium. 1. x = 0 is stable, if for any H > 0 and any t0 ⩾ 0, there exists a G (H ,t0 ) > 0, such that ∥x0 ∥ < G (H ,t0 ) ⇒ ∥x(x0 ,t,t0 )∥ < H ,
∀t ⩾ t0 ⩾ 0.
(7.4)
2. x = 0 is uniformly stable, if it is stable, and in (7.4) the G is independent of t0 , i.e., G (H ,t0 ) = G (H ). 3. x = 0 is unstable, if it is not stable. Next, we consider the convergence of the solutions. Denition 7.2. Consider system (7.1) and assume x = 0 is an equilibrium. 1. x = 0 is attractive, if for each t0 ⩾ 0 there exists a K (t0 ) > 0 such that ∥x0 ∥ < K (t0 ) ⇒ lim x(x0 ,t + t0 ,t0 ) = 0. t→+f
(7.5)
2. x = 0 is uniformly attractive, if there exists an K > 0 such that ∥x0 ∥ < K implies that x(x0 ,t + t0 ,t0 ) converges to zero uniformly in t0 and x0 . Finally we consider the asymptotical stability. Denition 7.3. Consider system (7.1) and assume x = 0 is an equilibrium. 1. x = 0 is asymptotically stable (A.S.), if x = 0 is stable and attractive.
7.2 Stability in the Linear Approximation
175
2. x = 0 is uniformly asymptotically stable (U.A.S.), if x = 0 is uniformly stable and uniformly attractive. We give some simple examples to depict this. Example 7.1. 1. Consider the following system x = −(2 + sin(t))x.
(7.6)
Under the initial condition x(t0 ) = x0 , the solution can be obtained and then it is easy to check that ∥x(t)∥ ⩽ ∥x0 ∥e−(t−t0 ) ,
(7.7)
which implies that the system is uniformly asymptotically stable. 2. Consider the following system x = −
1 x. 1+t
(7.8)
The solution is x=
1 + t0 x0 . 1 + t0 + t
(7.9)
From (7.9) it is clear that the system is asymptotically stable. But it is not uniformly asymptotically stable because it is not uniformly attractive. If the solution of a system satises an exponential relation as (7.7), the system is said to be exponentially stable. We give a rigorous denition. Denition 7.4. System (7.1) is said to be exponentially stable at x0 = 0, if there exist positive numbers a > 0 and b > 0 and a neighborhood N0 of the origin, such that ∥x(x0 ,t,t0 )∥ ⩽ a∥x0 ∥e−b(t−t0 ) ,
t ⩾ t0 ⩾ 0, x0 ∈ N0 .
(7.10)
For autonomous systems, it follows from denitions that the stability and uniform stability are equivalent. In fact, it is also true for periodic system. Autonomy is a special case of periodicity. Lemma 7.1. [6] If f (t, x) is periodic, then uniform (asymptotical) stability is equivalent to (respectively, asymptotical) stability.
7.2 Stability in the Linear Approximation We consider rst a time-invariant linear system: x = Ax,
x ∈ ℝn .
(7.11)
For such a system, we state some well known stability properties as a lemma.
176
7 Stability and Stabilization
Lemma 7.2. Consider system (7.11). 1. x = 0 is asymptotically stable, if and only if all the eigenvalues of A have negative real parts. 2. For system (7.11), asymptotic stability is equivalent to exponential stability. 3. x = 0 is stable, if and only if (i). it does not have eigenvalues with positive real parts; (ii). for imaginary eigenvalues (including 0), their algebraic multiplicity should be equal to their geometric multiplicity. Equivalently, their corresponding Jordan blocks are diagonal. [7] 4. A is asymptotically stable, if and only if for any positive denite matrix Q > 0, there exists a positive denite matrix P > 0 such that PA + ATP = −Q
(7.12)
In other words, if we use such P to construct a quadratic form V (x) = xT Px, then V = −xT Qx < 0. When in (7.1) the coefcient matrix is time-varying, the stability analysis is more difcult [9]. Now let us consider (7.1) and suppose it can be written as: x = A(t)x + g(x,t),
(7.13)
where g(x,t) = O(∥x∥2 ), x ∈ Br (0),t ⩾ t0 ⩾ 0. Then we call z = A(t)x,
(7.14)
the Jacobian linearized system of (7.1). About the exponential stability we have the following: Theorem 7.2. [6] If the equilibrium x = 0 of (7.14) is exponentially stable, the x = 0 of (7.13) is also exponentially stable. We have the following unstable result. Theorem 7.3. [6] Consider system (7.11). If A(t) = A is a constant matrix, and at least one of the eigenvalues of A is located in the open right half plane, then x = 0 of (7.11) is unstable. Remark 7.1. Consider a nonlinear system, it is important to know how much its linear approximation (also called the Jacobian linearization) can tell us. Moreover, the difference between linear time-varying and time-invariant systems is also signicant. We would like to emphasize the followings: 1. The principle of stability in the linear approximation only applies to local stability analysis. 2. In the case where the linearized system is autonomous, and some of the eigenvalues are on the imaginary axis, and the rest are on the left open half plane, (“the critical case”) then one has to consider the nonlinear terms to determine stability.
7.3 The Direct Method of Lyapunov
177
3. In the case of a time-varying linearized system, if z = 0 is only (non-uniformly) asymptotically stable, then one also has to consider the nonlinear terms. Before ending this section, we give two useful results on nonlinear stability. The rst result is for the so-called triangular systems. Proposition 7.1. [13] Consider { z = f (z, y), z ∈ ℝ p y = g(