Operator Theory: Advances and Applications Vol. 177 Editor: I. Gohberg Editorial Office: School of Mathematical Sciences Tel Aviv University Ramat Aviv, Israel Editorial Board: D. Alpay (Beer-Sheva) J. Arazy (Haifa) A. Atzmon (Tel Aviv) J. A. Ball (Blacksburg) A. Ben-Artzi (Tel Aviv) H. Bercovici (Bloomington) A. Böttcher (Chemnitz) K. Clancey (Athens, USA) L. A. Coburn (Buffalo) R. E. Curto (Iowa City) K. R. Davidson (Waterloo, Ontario) R. G. Douglas (College Station) A. Dijksma (Groningen) H. Dym (Rehovot) P. A. Fuhrmann (Beer Sheva) B. Gramsch (Mainz) J. A. Helton (La Jolla) M. A. Kaashoek (Amsterdam)
Subseries: Advances in Partial Differential Equations Subseries editors: Bert-Wolfgang Schulze Universität Potsdam Germany Sergio Albeverio Universität Bonn Germany
H. G. Kaper (Argonne) S. T. Kuroda (Tokyo) P. Lancaster (Calgary) L. E. Lerer (Haifa) B. Mityagin (Columbus) V. Olshevsky (Storrs) M. Putinar (Santa Barbara) L. Rodman (Williamsburg) J. Rovnyak (Charlottesville) D. E. Sarason (Berkeley) I. M. Spitkovsky (Williamsburg) S. Treil (Providence) H. Upmeier (Marburg) S. M. Verduyn Lunel (Leiden) D. Voiculescu (Berkeley) D. Xia (Nashville) D. Yafaev (Rennes) Honorary and Advisory Editorial Board: C. Foias (Bloomington) T. Kailath (Stanford) H. Langer (Vienna) P. D. Lax (New York) H. Widom (Santa Cruz)
J. López-Gómez C. Mora-Corral
Algebraic Multiplicity of Eigenvalues of Linear Operators
Birkhäuser Basel . Boston . Berlin
Authors: J. López-Gómez Department of Applied Mathematics Universidad Complutense de Madrid Ciudad Universitaria de Moncloa 28040 Madrid Spain e-mail:
[email protected]
C. Mora-Corral Mathematical Institute 8QLYHUVLW\RI2[IRUG 6W*LOHV¶ 2[IRUG2;/% UK HPDLOPRUDFRU#PDWKVR[DFXN
0DWKHPDWLFV6XEMHFW&ODVVL¿FDWLRQ$$$$$$ $+-
/LEUDU\RI&RQJUHVV&RQWURO1XPEHU
Bibliographic information published by Die Deutsche Bibliothek 'LH'HXWVFKH%LEOLRWKHNOLVWVWKLVSXEOLFDWLRQLQWKH'HXWVFKH1DWLRQDOELEOLRJUD¿HGHWDLOHG bibliographic data is available in the Internet at
.
,6%1%LUNKlXVHU9HUODJ$*%DVHO%RVWRQ%HUOLQ 7KLVZRUNLVVXEMHFWWRFRS\ULJKW$OOULJKWVDUHUHVHUYHGZKHWKHUWKHZKROHRUSDUWRIWKH PDWHULDOLVFRQFHUQHGVSHFL¿FDOO\WKHULJKWVRIWUDQVODWLRQUHSULQWLQJUHXVHRI LOOXVWUDWLRQVUHFLWDWLRQEURDGFDVWLQJUHSURGXFWLRQRQPLFUR¿OPVRULQRWKHUZD\VDQG storage in data banks. For any kind of use permission of the copyright owner must be obtained. %LUNKlXVHU9HUODJ$*32%R[&+%DVHO6ZLW]HUODQG 3DUWRI6SULQJHU6FLHQFH%XVLQHVV0HGLD 3ULQWHGRQDFLGIUHHSDSHUSURGXFHGIURPFKORULQHIUHHSXOS7&) f &RYHUGHVLJQ+HLQ]+LOWEUXQQHU%DVHO 3ULQWHGLQ*HUPDQ\ ,6%1
H,6%1
ZZZELUNKDXVHUFK
—Calla te digo otra vez, Sancho —dijo Don Quijote—; porque te hago saber que no s´ olo me trae por estas partes el deseo de hallar al loco, cuanto el que tengo de hacer en ellas una haza˜ na, con que he de ganar perpetuo nombre y fama en todo lo descubierto de la Tierra; y ser´ a tal, que he de echar con ella el sello a todo aquello que puede hacer perfecto y famoso a un andante caballero. Don Quijote de la Mancha (Cap´ıtulo 25) Miguel de Cervantes Saavedra
‘Peace, I say, Sancho, once again,’ said Don Quixote: ‘for know, that it is not barely the desire of finding the madman that brings me to these parts, but the intention I have to perform an exploit in them, whereby I shall acquire a perpetual name and renown over the face of the whole earth: and it shall be such an one as shall set the seal to all that can render a knight-errant complete and famous.’ Translated by Charles Jarvis. (Oxford University Press. Hong Kong, 1999.)
Contents Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
xi
I Finite-dimensional Classic Spectral Theory Part I: Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 The 1.1 1.2 1.3 1.4 1.5
Jordan Theorem Basic concepts . . . . . . . . . . . . . The Jordan theorem . . . . . . . . . . The Jordan canonical form . . . . . . The real canonical form . . . . . . . . An example . . . . . . . . . . . . . . . 1.5.1 The complex Jordan form of A 1.5.2 The real Jordan form of A . . . 1.6 Exercises . . . . . . . . . . . . . . . . 1.7 Comments on Chapter 1 . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
2
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
3 8 19 23 26 29 30 31 35
2 Operator Calculus 2.1 Norm of a linear operator . . . . . . . . . . . . 2.2 Introduction to operator calculus . . . . . . . . 2.3 Resolvent operator. Dunford’s integral formula 2.4 The spectral mapping theorem . . . . . . . . . 2.5 The exponential matrix . . . . . . . . . . . . . 2.6 An example . . . . . . . . . . . . . . . . . . . . 2.7 Exercises . . . . . . . . . . . . . . . . . . . . . 2.8 Comments on Chapter 2 . . . . . . . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
38 41 45 51 53 56 58 62
viii
Contents
3 Spectral Projections 3.1 Estimating the inverse of a matrix . . . . 3.2 Vector-valued Laurent series . . . . . . . . 3.3 The eigenvalues are poles of the resolvent 3.4 Spectral projections . . . . . . . . . . . . 3.5 Exercises . . . . . . . . . . . . . . . . . . 3.6 Comments on Chapter 3 . . . . . . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
63 65 66 68 70 72
Part II: Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
76
II Algebraic Multiplicities
4 Algebraic Multiplicity Through Transversalization 4.1 Motivating the concept of transversality . . . 4.2 The concept of transversal eigenvalue . . . . . 4.3 Algebraic eigenvalues and transversalization . 4.4 Perturbation from simple eigenvalues . . . . . 4.5 Exercises . . . . . . . . . . . . . . . . . . . . 4.6 Comments on Chapter 4 . . . . . . . . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. 84 . 87 . 89 . 99 . 103 . 105
5 Algebraic Multiplicity Through Polynomial Factorization 5.1 Derived families and factorization . . . . . . . . . . . 5.2 Connections between χ and µ . . . . . . . . . . . . . 5.3 Coincidence of the multiplicities χ and µ . . . . . . . 5.4 A formula for the partial µ-multiplicities . . . . . . . 5.5 Removable singularities . . . . . . . . . . . . . . . . 5.6 The product formula . . . . . . . . . . . . . . . . . . 5.7 Perturbation from simple eigenvalues revisited . . . . 5.8 Exercises . . . . . . . . . . . . . . . . . . . . . . . . 5.9 Comments on Chapter 5 . . . . . . . . . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
108 114 118 121 122 123 130 132 136
6 Uniqueness of the Algebraic Multiplicity 6.1 Similarity of rank-one projections . . . . . . 6.2 Proof of Theorem 6.0.1 . . . . . . . . . . . . 6.3 Relaxing the regularity requirements . . . . 6.4 A general uniqueness theorem . . . . . . . . 6.5 Applications. Classical multiplicity formulae 6.6 Exercises . . . . . . . . . . . . . . . . . . . 6.7 Comments on Chapter 6 . . . . . . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
141 142 144 147 148 151 152
. . . . . . .
. . . . . .
. . . . . . .
. . . . . .
. . . . . . .
. . . . . .
. . . . . . .
. . . . . . .
Contents
ix
7 Algebraic Multiplicity Through Jordan Chains. Smith Form 7.1 The concept of Jordan chain . . . . . . . . . . . . . . . 7.2 Canonical sets and κ-multiplicity . . . . . . . . . . . . 7.3 Invariance by continuous families of isomorphisms . . 7.4 Local Smith form for C ∞ matrix families . . . . . . . . 7.5 Canonical sets at transversal eigenvalues . . . . . . . . 7.6 Coincidence of the multiplicities κ and χ . . . . . . . . 7.7 Labeling the vectors of the canonical sets . . . . . . . 7.8 Characterizing the existence of the Smith form . . . . 7.9 Two illustrative examples . . . . . . . . . . . . . . . . 7.9.1 Example 1 . . . . . . . . . . . . . . . . . . . . . 7.9.2 Example 2 . . . . . . . . . . . . . . . . . . . . . 7.10 Local equivalence of operator families . . . . . . . . . 7.11 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . 7.12 Comments on Chapter 7 . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
155 157 161 167 171 174 180 181 189 189 191 193 199 204
8 Analytic and Classical Families. Stability 8.1 Isolated eigenvalues . . . . . . . . . . . . . . . 8.2 The structure of the spectrum . . . . . . . . . 8.3 Classic algebraic multiplicity . . . . . . . . . 8.4 Stability of the complex algebraic multiplicity 8.4.1 Local stability . . . . . . . . . . . . . 8.4.2 Global stability . . . . . . . . . . . . . 8.4.3 Homotopy invariance . . . . . . . . . . 8.5 Exercises . . . . . . . . . . . . . . . . . . . . 8.6 Comments on Chapter 8 . . . . . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
210 211 212 215 216 218 220 220 222
. . . . . . . . . . . . . . . . . . . . . two families . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
226 229 230 231 233 237 238 241 246
. . . . . . . . .
. . . . . . . . .
9 Algebraic Multiplicity Through Logarithmic Residues 9.1 Finite Laurent developments of L−1 . . . . . . . 9.2 The trace operator . . . . . . . . . . . . . . . . . 9.2.1 Concept of trace and basic properties . . 9.2.2 Traces of the coefficients of the product of 9.3 The multiplicity through a logarithmic residue . 9.4 Holomorphic and classical families . . . . . . . . 9.5 Spectral projection . . . . . . . . . . . . . . . . . 9.6 Exercises . . . . . . . . . . . . . . . . . . . . . . 9.7 Comments on Chapter 9 . . . . . . . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
x
Contents
10 The Spectral Theorem for Matrix Polynomials 10.1 Linearization of a matrix polynomial . . . 10.2 Generalized Jordan theorem . . . . . . . . 10.3 Remarks on scalar polynomials . . . . . . 10.4 Constructing a basis in the phase space . 10.5 Exercises . . . . . . . . . . . . . . . . . . 10.6 Comments on Chapter 10 . . . . . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
250 252 255 256 262 263
11 Further Developments of the Algebraic Multiplicity 11.1 General Fredholm operator families . . . . . . . 11.2 Meromorphic families . . . . . . . . . . . . . . 11.3 Unbounded operators . . . . . . . . . . . . . . 11.4 Non-Fredholm operators . . . . . . . . . . . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
265 266 267 269
III Nonlinear Spectral Theory Part III: Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 272 12 Nonlinear Eigenvalues 12.1 Bifurcation values. Nonlinear eigenvalues . . . . . . . . . . . . . . 12.2 A short introduction to the topological degree . . . . . . . . . . . 12.2.1 Existence and uniqueness . . . . . . . . . . . . . . . . . . 12.2.2 Computing the degree. Analytic construction . . . . . . . 12.2.3 The fixed point theorem of Brouwer, Schauder and Tychonoff . . . . . . . . . . . . . . . . . . . . . . . . 12.2.4 Further properties . . . . . . . . . . . . . . . . . . . . . . 12.3 The algebraic multiplicity as an indicator of the change of index 12.4 Characterization of nonlinear eigenvalues . . . . . . . . . . . . . 12.5 Comments on Chapter 12 . . . . . . . . . . . . . . . . . . . . . .
. . . .
275 278 279 281
. . . . .
283 284 284 286 291
Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295 Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303 Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
Preface This book analyzes the existence and uniqueness of a generalized algebraic multiplicity for a general one-parameter family L of bounded linear operators with Fredholm index zero at a value of the parameter λ0 where L(λ0 ) is non-invertible. Precisely, given K ∈ {R, C}, two Banach spaces U and V over K, an open subset Ω ⊂ K, and a point λ0 ∈ Ω, our admissible operator families are the maps L ∈ C r (Ω, L(U, V )) for some r ∈ N, such that
(1)
L(λ0 ) ∈ Fred0 (U, V );
here L(U, V ) stands for the space of linear continuous operators from U to V , and Fred0 (U, V ) is its subset consisting of all Fredholm operators of index zero. From the point of view of its novelty, the main achievements of this book are reached in case K = R, since in the case K = C and r = 1, most of its contents are classic, except for the axiomatization theorem of the multiplicity. The book consists of three parts, and, although the necessary background to understand the book differs from each part, the entire book might become easily accessible to a multidisciplinary audience by establishing all its results in a finitedimensional setting, which is not a serious restriction. Part I covers the classic finite-dimensional spectral theory, and assumes hardly any previous knowledge by the reader, except some basic facts in complex analysis. In fact, its contents are intended to be taught at an undergraduate level, as we have considerably tidied up and shortened most of the available material in the literature. Part II introduces a generalized concept of algebraic multiplicity, which substantially extends all previous available concepts, to cover the case of families L as in (1). Actually, this objective is accomplished by adopting several different perspectives, each of them of great interest in its own right. For a comfortable reading of this part, some basic background in Functional Analysis is appropriate; essentially, the Hahn–Banach theorem and the most important properties of the Fredholm operators. Finally, Part III, which consists of a single chapter, introduces some pivotal concepts in nonlinear analysis (like the concept of nonlinear eigenvalue) and characterizes the nonlinear eigenvalues of L through the value of (−1)m[L;λ0 ] , where m[L; λ0 ] denotes the generalized algebraic multiplicity of L at λ0 . Although it would be desirable
xii
Preface
to have a good knowledge of the topological degree for a comfortable reading of this part, this is far from necessary, because a self-contained introduction to the topological degree is provided therein. Going beyond would take us outside the general scope of this book. A great proportion of Part II consists of versions and new findings of recent results attributable to the authors of this book and coworkers, except for the classic case when K = C and r = 1, where most of the results are attributable to the Russian school. Among the most important results of Part II, there is the next axiomatization theorem of the multiplicity. We denote by Sλ∞0 (U ) the set of functions of class C ∞ defined in a neighborhood of λ0 with values in Fred0 (U, U ). Theorem 0.0.1. There exists a unique map m[·; λ0 ] : Sλ∞0 (U ) → [0, ∞] satisfying the following axioms: A1. For all L, M ∈ Sλ∞0 (U ), m[LM; λ0 ] = m[L; λ0 ] + m[M; λ0 ]. A2. There exists a rank one projection P0 ∈ L(U ) such that m[L; λ0 ] = 1, where L(λ) = (λ − λ0 )P0 + IU − P0 ,
λ ∈ K.
The value m[L; λ0 ] is called the algebraic multiplicity of L at λ0 . Axiom A1 is known as the product formula, while Axiom A2 is nothing but a normalization condition, as will discussed in Chapter 6. Before describing the properties of the multiplicity, we should recall the familiar concept of order of a zero of a function at a point. Let X be a K-Banach space, Ω ⊂ K an open set, r ≥ 0 an integer or infinity, λ0 ∈ Ω, and f ∈ C r (Ω, X). If there exists an integer 0 ≤ k ≤ r such that f j) (λ0 ) = 0 for all 0 ≤ j < k, and f k) (λ0 ) = 0, then we define ordλ0 f = k. If r = ∞ and f j) (λ0 ) = 0 for all integers j ≥ 0, then we define ordλ0 f = ∞. If f j) (λ0 ) = 0 for all 0 ≤ j ≤ r, and f is not of class C r+1 in any neighborhood of λ0 , then we leave ordλ0 f undefined. Now we describe some properties of the multiplicity. For every L ∈ Sλ∞0 (U ), the function m[·; λ0 ] inherits, from Axioms A1 and A2, the following properties: i) m[L; λ0 ] ∈ N ∪ {∞}. ii) m[L; λ0 ] = 0 if and only if L(λ0 ) is an isomorphism. iii) m[L; λ0 ] < ∞ if and only if there exists an integer k ≥ 0 such that (λ − λ0 )k L(λ)−1 exists and is bounded for λ in a perforated neighborhood of λ0 .
Preface
xiii
iv) If dim U < ∞, then m[L; λ0 ] = ordλ0 det L. v) If K = C and U = V = CN , then 1 m[L; λ0 ] = tr L (λ)L(λ)−1 dλ 2πi γ for every Cauchy contour γ with inner domain D containing λ0 such that ¯ \ {λ0 }. L−1 is holomorphic in D \ {λ0 } and continuous in D ∞ vi) For every K-Banach space V and M ∈ Sλ0 (V ), m[L ⊕ M; λ0 ] = m[L; λ0 ] + m[M; λ0 ]. vii) If L is analytic, Ω is connected, and L(Ω) contains an isomorphism, then m[L; λ] < ∞
for all λ ∈ Ω.
viii) If A ∈ L(U ) and L is the family defined by L(λ) := λI − A,
λ ∈ K,
then m[L; λ0 ] = sup dim N [(λ0 I − A)k ]. k∈N
˜ ⊂ Ω of λ0 , ix) m[L; λ0 ] < ∞ if and only if there exist an open neighborhood Ω a topological decomposition U = U0 ⊕ U1 with n := dim U0 < ∞ and two maps E, F ∈ Sλ∞0 (U ) such that E(λ0 ), F(λ0 ) are isomorphisms and L(λ) = E(λ) [S(λ) ⊕ IU1 ] F(λ),
˜ λ ∈ Ω,
where IU1 stands for the identity of U1 , and S(λ) = diag (λ − λ0 )κ1 , . . . , (λ − λ0 )κn ,
λ ∈ K,
for some integers κ1 ≥ · · · ≥ κn ≥ 1. Moreover, in such a case, m[L; λ0 ] = κ1 + · · · + κn . Owing to Theorem 0.0.1, each of the listed properties, and actually any further property of the multiplicity, must be a consequence of Axioms A1 and A2. The concept of multiplicity for maps L of the form (1), rather than for operators (as is the case in the context of the classic spectral theory) goes back to the Russian school; it began to be developed in the 1940s for holomorphic families, that is, for the special case when K = C and r = 1 (see Keldyˇs [66, 67] for probably the first definition, and Markus & Sigal [95], Eni [28], Gohberg [42], Gohberg & Sigal [54], Gohberg, Kaashoek & Lay [44], as well as the references therein, for
xiv
Preface
later generalizations and expositions). Most of the available underlying theories are based on generalized Jordan chains, as discussed in Chapter 7 of this book. The concept of multiplicity in the case when K = R came later, and was introduced independently through four rather different devices. By using generalized Jordan chains (see Sarreither [116] and later Rabier [110]), through a finitedimensional reduction of the family L so that it can be defined as the multiplicity of the determinant of the reduced family (see Ize [61]), by means of a polynomial factorization of L (see Gohberg [42], Gohberg & Sigal [54], and Magnus [92]), as discussed in Chapter 5 of this book, or through a change of variable giving rise to a transversal family (see Esquinas & L´opez-G´omez [30], Esquinas [29], and L´opez-G´omez [82]), as discussed in Chapter 4. According to Theorem 0.0.1, all these concepts of multiplicity must coincide as long as they satisfy Axioms A1 and A2, though the reader should be aware of the fact that obtaining the product formula may be fraught with higher technical difficulties than directly checking that they do coincide from their own definitions. This book gives a complete description of all these (equivalent) constructions of the algebraic multiplicity. The reasons to bring them together in this book include: a) all of them involve interesting constructions in their own right; b) although equivalent, a number of multiplicity concepts depart from rather separated starting points and, consequently, their mutual connections are not clear; c) some properties of the multiplicity are easier to prove through a particular definition than departing from another. Nevertheless, the existence of a number of constructions of the multiplicity from different perspectives facilitates the derivation of its properties, both from the theoretical point of view and from the point of view of applications. Although there are some previous and partial comparisons between several different theories of algebraic multiplicity (see, for example, Esquinas [29], Fitzpatrick & Pejsachowicz [33], Rabier [110] and L´ opez-G´omez [82]), this book should provide the most complete monograph encompassing all those different constructions from the point of view of the axiomatization of Theorem 0.0.1. These algebraic multiplicities have many applications in a number of separate areas of mathematics. Among them, the constructions of the algebraic multiplicity are used for accomplishing the following tasks: • Finding optimal criteria for the change of the topological degree of L(λ) as the parameter λ crosses an eigenvalue of L, within the context of local and global bifurcation theory (see Sarreither [116], Ize [61], Magnus [92], Esquinas & L´ opez-G´omez [31], Esquinas [29], L´ opez-G´omez [82], Rabier [110], Fitzpatrick & Pejsachowicz [34], L´ opez-Gomez & Mora-Corral [91]).
Preface
xv
• Establishing local classification of operator families L through the existence and uniqueness of the Smith canonical form (see Gohberg, Kaashoek & Lay [44]), as well as global spectral results for general operator families (see Gohberg, Kaashoek & Lay [44], Leiterer [78, 79], Gohberg, Lancaster & Rodman [50], L´opez-G´omez [82]). • Finding completeness criteria for eigenvectors and generalized eigenvectors of operators and operator families (see Keldyˇs [66, 67], Friedman & Shinbrot [35], Gohberg & Kre˘ın [45, 46]). • Analyzing the solution manifold of general classes of ordinary linear differential equations with constant coefficients, and boundary-value problems (see Gohberg, Lancaster & Rodman [50, 51], Rodman [114], Wloka, Rowley & Lawruk [127]), as well as difference equations with constant coefficients (see Gohberg, Lancaster & Rodman [50]). • Studying interpolation of matrix families (see Rodman [114], Ball, Gohberg & Rodman [8]), • Studying linear systems in control engineering (see Gohberg, Lancaster & Rodman [51], Rodman [114], Wyman, Sain, Conte & Perdon [129]). In the sequel, we will outline the contents of each chapter of this book, with particular emphasis on the new findings originated by the authors’ research in the field. Chapter 1 is devoted to a proof of the Jordan theorem and a construction of the underlying canonical form. Chapter 2 provides a short self-contained introduction to operator calculus, yet in finite dimension. Then, the Dunford integral formula is introduced and the spectral mapping theorem is studied. Chapter 3 describes the construction of the Jordan spectral projections. The proofs are based upon the fact that the ascent of each eigenvalue equals its order as a pole of the resolvent operator. This methodology substantially differs from the standard one adopted in most classic textbooks on elementary finite-dimensional spectral theory, shortens the inherent difficulties for the general infinite-dimensional framework, and facilitates the teaching of these materials at an undergraduate level. Actually, this is the pivotal idea upon which the development of the subsequent abstract general theory of this book relies. Part II and the general theory of multiplicities begin at Chapter 4, after introducing all the spaces and most common notation used in the rest of the book. Throughout Part II, r ≥ 1 is an integer or infinity, K is either the real field or the complex field, Ω ⊂ K is an open set containing λ0 , and L ∈ C r (Ω, L(U, V )) satisfies L(λ0 ) ∈ Fred0 (U, V ). Besides, the following notation for the derivatives at L at λ0 1 Lj := Lj) (λ0 ), 0 ≤ j < r + 1, j! is used everywhere, so that Lj equals the jth coefficient of the Taylor development of L at λ0 . The parameter value λ0 is said to be an eigenvalue of L when L(λ0 ) is
xvi
Preface
not invertible. As L(λ0 ) is Fredholm of index zero, this amounts to N [L(λ0 )] = {0}.
(2)
Let Iso(U, V ) denote the set of linear topological isomorphisms from U to V . When L(λ0 ) ∈ Iso(U, V ), all results become trivial; thus, we will subsequently focus our attention on the case when (2) occurs. The theory of algebraic multiplicity presented in Chapter 4 is based on the concept of transversality, which is a pivotal concept throughout this book; it goes back to Esquinas & L´ opez-G´omez [31]. Definition 0.0.2. Given an integer 1 ≤ k ≤ r, it is said that λ0 is a k-transversal eigenvalue of L if k
Lj (N [L0 ] ∩ · · · ∩ N [Lj−1 ]) ⊕ R[L0 ] = V,
j=1
and Lk (N [L0 ] ∩ · · · ∩ N [Lk−1 ]) = {0}. In such a case, the algebraic multiplicity of L at λ0 , denoted by χ[L; λ0 ], is defined through k j dim Lj (N [L0 ] ∩ · · · ∩ N [Lj−1 ]). χ[L; λ0 ] := j=1
Although, at a first glance, Definition 0.0.2 might look shocking, it turns out that transversal eigenvalues enjoy a special structure that makes most of the involved operator calculations straightforward from an algorithmic point of view. The concept of multiplicity was originally introduced to capture the order of det L at λ0 in the finite-dimensional setting, but this is far from being an elementary feature that can be briefly explained. Another key concept of Part II, going back to L´opez-G´omez [82], is the one introduced by the following definition. Definition 0.0.3. Given an integer k ≥ 1, it is said that λ0 is a k-algebraic eigen˜ ⊂ Ω of λ0 such that value of L when there exists an open neighborhood Ω ˜ L(λ) ∈ Iso(U, V ) for all λ ∈ Ω \ {λ0 }, the values of the family λ → (λ − λ0 )k L(λ)−1 ,
˜ \ {λ0 }, λ∈Ω
are bounded, but (λ − λ0 )k−1 L(λ)−1 is unbounded for λ in every perforated neighborhood of λ0 . In such a case, we will write that λ0 ∈ Algk (L). When L is analytic, it turns out that λ0 ∈ Algk (L) if and only if λ0 is a pole of L−1 of order k. Consequently, this concept is well known in the analytic case. But, since there is no available concept of pole for non-meromorphic families, the concept of algebraic eigenvalue is new in the general C r setting adopted in this book.
Preface
xvii
Chapter 9 shows that the concept of algebraic eigenvalue introduced by Definition 0.0.3 indeed provides us with a concept of pole for L−1 , thus considerably extending the classic concept of pole. Quite strikingly, it turns out that if λ0 ∈ Algk (L) and r ≥ 2k, then the inverse map L−1 possesses a Laurent asymptotic expansion at λ0 , L(λ)−1 =
−1
(L−1 )n (λ − λ0 )n + o (λ − λ0 )−1 ,
as
λ → λ0 ,
n=−k
as well as L L−1 , L (λ)L(λ)−1 =
−1
Mn (λ − λ0 )n + o (λ − λ0 )−1 ,
as λ → λ0 ,
n=−k
and, in addition, according to the main theorem of L´ opez-G´omez & Mora-Corral [90], 0 if − k ≤ n ≤ −2, tr Mn = χ[L; λ0 ] if n = −1, which is a deep generalization to the case when K = R and L is of class C r for some r ∈ N of the following classic well-known result attributable to Gohberg [42], Markus & Sigal [95] and Gohberg & Sigal [54] (see also Gohberg, Goldberg & Kaashoek [43]). That generalization constitutes the bulk of Chapter 9. Theorem 0.0.4. Let Ω ⊂ C be open and connected, and L ∈ H(Ω, L(U, V )) such that L(Ω) ⊂ Fred0 (U, V ) and L(Ω) ∩ Iso(U, V ) = ∅. Then, the set Σ(L) := λ ∈ Ω : N [L(λ)] = {0} (3) is discrete in Ω, and L−1 is holomorphic in Ω\Σ(L). Moreover, for each λ0 ∈ Σ(L), the meromorphic function L−1 admits a Laurent development L(λ)−1 =
∞
(L−1 )n (λ − λ0 )n
n=−k
for some integer k ≥ 1, where (L−1 )0 ∈ Fred0 (V, U ) and (L−1 )n has finite rank for all −k ≤ n ≤ −1. Furthermore, the coefficients of the Laurent development of L L−1 at λ0 , ∞ L (λ)L(λ)−1 = Mn (λ − λ0 )n , n=−k
have finite rank for every n ∈ {−k, . . . , −1}, and their traces are given through 0 if − k ≤ n ≤ −2, tr Mn = m[L; λ0 ] if n = −1.
xviii
Preface
In order to obtain our real non-analytic counterparts of Theorem 0.0.4, we need the previous analysis carried out in Chapters 4, 5 and 7. The transversalization theorem of Chapter 4 establishes that if λ0 ∈ Algk (L) for some 0 ≤ k < r + 1, then there exist a polynomial Φ : K → L(U ) with Φ(λ0 ) = IU , and an integer ν = ν(Φ) ∈ {1, . . . , k}, such that λ0 is a ν-transversal eigenvalue of the product family LΦ := LΦ. Moreover, ν(Φ) and χ[LΦ ; λ0 ] are independent of Φ; therefore, one can extend the concept of multiplicity introduced in Definition 0.0.2 by setting χ[L; λ0 ] := χ[LΦ ; λ0 ] if λ0 ∈ Algk (L), and
χ[L; λ0 ] := ∞
if r = ∞ and λ0 is not an algebraic eigenvalue of L. Further, from the analysis of Chapter 5, it will become apparent that, in fact, if λ0 ∈ Algk (L), then ν(Φ) = k for all transversalizing families of isomorphisms Φ, whether polynomial or not. When L(λ0 ) is an isomorphism, the multiplicity χ[L; λ0 ] is defined as zero. Consequently, the multiplicity χ is finite if and only if λ0 is an algebraic value of L, in the sense that either L(λ0 ) ∈ Iso(U, V ), or λ0 ∈ Algk (L) for some integer 1 ≤ k < r + 1. The main goal of Chapter 5 is to prove that this concept of multiplicity actually satisfies Axioms A1 and A2 of Theorem 0.0.1, thus providing us with the existence of the multiplicity m. The analysis of this chapter is based upon another independent concept of multiplicity, denoted by µ[L; λ0 ], going back to Magnus [92], and defined through a certain polynomial factorization of the family L. Once some hidden connections between the algebraic invariants invoked in the definitions of µ and χ are established, it will follow that χ = µ and that the following result is satisfied. Theorem 0.0.5. For every integer 1 ≤ k ≤ r there exist k finite-rank projections P1 , . . . , Pk ∈ L(U ) and Mk ∈ C r−k (Ω, L(U, V )) such that L(λ) = Mk (λ) [(λ − λ0 )P1 + IU − P1 ] · · · [(λ − λ0 )Pk + IU − Pk ]
(4)
for all λ ∈ Ω. Moreover, some of the following mutually exclusive options occur: O1. L(λ0 ) ∈ Iso(U, V ), and, in such a case, χ[L; λ0 ] = 0
and
P1 = · · · = Pk = 0.
O2. λ0 ∈ Algν (L) for some 1 ≤ ν < r + 1, and, in such a case, Mν (λ0 ) ∈ Iso(U, V ), the projections P1 , . . . , Pν are non-zero, and χ[L; λ0 ] =
ν i=1
dim R[Pi ].
Preface
xix
O3. There does not exist any integer 1 ≤ ν ≤ r for which λ0 ∈ Algν (L), and, in such a case, χ[L; λ0 ] = ∞ if r = ∞, whereas χ[L; λ0 ] remains undefined if r ∈ N. Moreover, the projections P1 , . . . , Pk are non-zero. Based on the Magnus factorization (4) guaranteed by Theorem 0.0.5, Chapter 6 proves Theorem 0.0.1 and some generalizations. Chapter 6 concludes by inferring Properties (iv), (v) and (viii) listed above from Theorem 0.0.1 and a number of variants of it. Chapter 7 studies the classic concepts of Jordan chains, partial multiplicities and local Smith form. These are very old concepts going back to Smith [121] and Frobenius [36, 37], and characterize the local behavior of L at λ0 . The starting point of Chapter 7 is the following classic result going back to Gohberg [41] (see Gohberg, Goldberg & Kaashoek [43], Gohberg & Sigal [54], Gohberg, Kaashoek & Lay [44] for later generalizations). Hereafter, H means holomorphic. Theorem 0.0.6. Suppose K = C, let Ω be an open and connected subset of C, and let L ∈ H(Ω, L(U, V )) satisfy L(λ0 ) ∈ Fred0 (U, V ) and L(Ω) ∩ Iso(U, V ) = ∅. Then, ˜ ⊂ Ω of λ0 , a topological for every λ0 ∈ Ω, there exist an open neighborhood Ω decomposition U = U0 ⊕ U1 with n := dim U0 = dim N [L(λ0 )] < ∞, and three maps ˜ L(U, V )), F ∈ H(Ω, ˜ L(U )), S ∈ H(Ω, ˜ L(U0 )) E ∈ H(Ω, such that E(λ0 ) and F(λ0 ) are isomorphisms and ˜ λ ∈ Ω,
L(λ) = E(λ) [S(λ) ⊕ IU1 ] F(λ),
where IU1 stands for the identity of U1 and S(λ) = diag (λ − λ0 )κ1 , . . . , (λ − λ0 )κn ,
λ∈K
(5)
(6)
for some integers κ1 ≥ · · · ≥ κn ≥ 1. The factorization (5), with S given through (6), is called the local Smith form of L at λ0 . The integers κ1 , . . . , κn of (6) must be uniquely determined, and are referred to as the partial multiplicities of L at λ0 . One of the main results of Chapter 7 uses the transversalization theorem of Chapter 4 to show that m[L; λ0 ] = χ[L; λ0 ] =
n
κj .
j=1
Essentially, the proof of Theorem 0.0.6 is based on a preliminary finite-dimensional reduction relying on the property that L(λ0 ) ∈ Fred0 (U, V ), and on a further diagonalization algorithm based on the Gaussian elimination method. At each step of the underlying scheme one must make sure that the invariants of the transformed families remain unchanged, and this can be easily accomplished through the generalized Jordan chains of L at λ0 .
xx
Preface
In this context, the analysis of Chapter 7 reveals that the most appropriate device for characterizing the existence of a local Smith form is the concept of algebraic eigenvalue introduced by Definition 0.0.3, since it is a manageable and versatile invariant, intrinsic to the family L, which does not involve any constructive scheme, as occurs when using Jordan chains. Actually, the following sharp version of Theorem 0.0.6, valid for K ∈ {R, C}, is satisfied; it constitutes the bulk of Chapter 7. Theorem 0.0.7. Suppose r ∈ N and L ∈ C r (Ω, L(U, V )) with L(λ0 ) ∈ Fred0 (U, V ). Then, the following assertions are equivalent: i) L admits a local Smith form at λ0 , in the sense that there exist an open ˜ ⊂ Ω of λ0 , two families neighborhood Ω ˜ L(U, V )), F ∈ C(Ω, ˜ L(U )) E ∈ C(Ω, such that E(λ0 ) and F(λ0 ) are isomorphisms, and a topological decomposition U = U0 ⊕ U1 with dim U0 = dim N [L(λ0 )] = n, such that (5) and (6) hold true for some integers κ1 ≥ · · · ≥ κn with κ1 ≤ r and κn ≥ 1. ii) λ0 ∈ Algν (L) for some integer ν ≤ r. iii) The length of every Jordan chain of L at λ0 is bounded above by ν ≤ r. iv) The multiplicity χ[L; λ0 ] is well defined and finite. Although some of the implications between the conditions stated in Theorem 0.0.7 were proved by Rabier [110], this characterization theorem is attributable to the authors. Chapter 7 concludes with a short introduction to the theory of equivalence of families, as discussed, for example, by Gohberg, Kaashoek & Lay [44]. The pivotal feature of the underlying theory is the fact that the local Smith form of a family L is the simplest representation of L through pre- and post-multiplication by families of isomorphisms. As a by-product of Theorem 0.0.7, it becomes apparent that L and M are equivalent if and only if they possess the same local Smith form at λ0 . Chapter 8 focuses the attention on analytic maps L ∈ C ω (Ω, L(U, V )), and families of the form λ ∈ C, (7) L(λ) := λIU − A, for a given A ∈ L(U ), in order to prove the following result (an early version of its first part can be found in Trofimov [124]). Theorem 0.0.8. Let Ω be an open and connected subset of K, and L ∈ C ω (Ω, L(U, V )) such that L(Ω) ⊂ Fred0 (U, V ) and L(Ω) ∩ Iso(U, V ) = ∅. Then, the spectrum (3) of L in Ω is discrete in Ω and consists of algebraic eigenvalues of L, as discussed by Definition 0.0.3. Moreover, the map L−1 is analytic in Ω \ Σ(L), and exhibits a pole of order ν ∈ N at every λ0 ∈ Algν (L). If, in addition, L has the form (7), and λ0 ∈ Algν (L), then ν equals the algebraic ascent of λ0 , as an eigenvalue of A, and m[L; λ0 ] = χ[L; λ0 ] = ma (λ0 ) = dim N [(λ0 IU − A)ν ].
Preface
xxi
Chapter 8 concludes by establishing the stability of the algebraic multiplicity for holomorphic families, as well as its homotopy invariance, within the spirit of the classic theorem of Rouch´e. Chapter 10 shows that the Jordan theorem and the fundamental theorem of algebra are particular cases of the spectral theorem for monic matrix polynomials. By a matrix polynomial is meant a family L ∈ H(C, L(CN )) of the form L(λ) =
An λn ,
λ ∈ C,
n=0
where A0 , . . . , A ∈ L(CN ). It is said to be monic when A = ICN . The results of this chapter give some new insights into the available results in the literature. Actually, they are intended as a first step to generalize the theory developed in this book to cover more abstract settings within the context of spectral theory. Chapter 11 has an expository and bibliographical character. It introduces briefly some further developments of the multiplicity not previously treated in this book that are of interest in their own right. Finally, Chapter 12 combines the linear theory developed in this book together with the topological degree to show that the algebraic multiplicity studied in this book provides an optimal algebraic invariant to characterize the nonlinear eigenvalues of a given family L. Thus, facilitating the transference of information from linear to nonlinear functional analysis. It should be emphasized that eliminating the standard assumption that L is holomorphic in Ω (through the concept of algebraic eigenvalue) gives rise to some deep versions of important classic results; for instance, the following striking version of the celebrated theorem of Riemann on removable singularities. Indeed, besides providing a particular case of the theorem of Riemann when K = C, it also covers the case K = R, where no previous result seems to be available. Its number of applications might be huge. Theorem 0.0.9. Let r ∈ N ∪ {∞}, a point λ0 ∈ Ω, and L ∈ C r (Ω, L(U, V )) with L(λ0 ) ∈ Fred0 (U, V ). Suppose that, for some integer 0 ≤ ν ≤ r, the mapping λ → (λ − λ0 )ν L(λ)−1
(8)
exists and is bounded in Ω \ {λ0 }. Then there exists an open subset Ω ⊂ Ω with λ0 ∈ Ω for which the mapping λ → (λ − λ0 )ν L(λ)−1 ,
λ ∈ Ω \ {λ0 },
admits an extension of class C r−ν to Ω . Consequently, to remove an isolated singularity for mappings of the form (8), it suffices to impose L(λ0 ) ∈ Fred0 (U, V ) and λ0 ∈ Algν (L) for some integer ν ≤ r; the holomorphy is not necessary. This result illustrates the strength of the general theory developed in this book.
xxii
Preface
Except Chapters 11 and 12, all chapters of this book end by proposing a list of exercises and some bibliographical comments. Some of the exercises are computational, but most of them ask the reader to provide alternative proofs of the results of the corresponding chapter, or to adapt the proofs already given in the chapter to obtain some related results. Although we are indeed scientifically indebted to many people, in this occasion we are extremely honored to express our deepest gratitude to Professor I. Gohberg, the Editor of this series. It is not only that his pioneering works for meromorphic maps have influenced many chapters of this book, but also that his strong and lucid mathematical criticism during the final steps of its preparation have been tremendously encouraging for us. Finally, we should thank the Ministry of Education and Science of Spain for research funding under grant CGL2006–00524/BOS (National Plan of Global Change and Biodiversity).
Madrid and Oxford, February 2007 The authors
Part I
Finite-dimensional Classic Spectral Theory
Part I: Summary Part I of this book is devoted to the finite-dimensional classic spectral theory. The main topics covered in this part are the Jordan theorem and operator calculus. We assume that the readers are familiar with the basic concepts of linear algebra. Among them, finite-dimensional vector spaces, linear dependence and independence, bases, matrices and their elementary operations, range and kernel of a matrix and of a linear operator, systems of linear equations, determinants, and the Cramer rule. Some basic properties of polynomials are also assumed to be known. In particular, elementary properties of the sum, product, factorization and division of polynomials, and the fundamental theorem of algebra. Finally, we also assume that the reader has an elementary knowledge of the theory of holomorphic functions of one complex variable, including the Cauchy integral formula, the Cauchy estimates, the Riemann theorem on removable singularities, and the Taylor and Laurent developments. Throughout this book, C and R stand for the fields of complex and real numbers, and, for any integer number N ≥ 1 and K ∈ {R, C}, the set MN (K) denotes the space of square matrices of order N over the field K. Part I is divided into three chapters. In Chapter 1 we prove the Jordan theorem. This theorem establishes that for every A ∈ MN (C), the space CN decomposes into the direct sum of the ascent generalized eigenspaces associated with each of the eigenvalues of the matrix A. Then, we use the Jordan theorem to construct the complex and the real Jordan canonical forms of the matrix A. Chapter 2 is an introduction to operator calculus. Given a holomorphic function f and a square matrix A, one of the main aims of operator calculus is to give an appropriate definition of f (A) and to study its properties. As a paradigmatic application of operator calculus, Chapter 2 presents a detailed calculation of the exponential of a matrix. Finally, in Chapter 3 we use the results of the previous two chapters to construct the spectral projections associated with a square matrix A; the spectral projections are the projections of CN onto each of the ascent generalized eigenspaces of the matrix A.
Chapter 1
The Jordan Theorem In this chapter we prove the Jordan theorem, a pivotal result in mathematics, which establishes that, for every A ∈ MN (C), the space CN decomposes as the direct sum of the ascent generalized eigenspaces associated with each of the eigenvalues of A. Then, by choosing an appropriate basis in each of the ascent generalized eigenspaces, the Jordan canonical form of A is constructed. These bases are chosen in order to attain a similar matrix to A with a maximum number of zeros. This chapter is organized as follows. In Section 1.1 we review some basic concepts in the theory of matrices and finite-dimensional operators; among them, the relationship between operators and matrices, and the concepts of eigenvalue, eigenvector, eigenspace, characteristic polynomial and multiplicity. Section 1.2 is devoted to the proof of the Jordan theorem. Some important intermediate results will also be proved, such as the existence of interpolating polynomials and the Cayley–Hamilton theorem. In Section 1.3 we construct the Jordan canonical form, while in Section 1.4 we construct the real Jordan canonical form. Finally, Section 1.5 shows an example of the calculation of the Jordan canonical form.
1.1 Basic concepts From now on, we consider the space MN (C) of the square matrices of order N with coefficients in C, and the space L(CN ) of the linear operators from CN to CN . Both have dimension N 2 and, hence, are isomorphic. Once a basis B := {e1 , . . . , eN }, in CN is fixed, every matrix A = (aij )1≤i,j≤N ∈ MN (C)
4
Chapter 1. The Jordan Theorem
defines a linear operator TA ∈ L(CN ) through TA u =
N N
aij uj ei
for each u =
i=1 j=1
N
u j e j ∈ CN .
j=1
As the coordinates of the N -tuple TA u with respect to the basis B are obtained by multiplying the matrix A by the N -tuple of the coordinates of u with respect to B, it is usual to identify TA with A. The resulting map MN (C) A
→ L(CN ) → TA
is an isomorphism of vector spaces and of algebras. Consequently, there is no ambiguity in making that identification. In practice, A is referred to as the matrix associated with the operator TA with respect to the basis B. Pick T ∈ L(CN ), let B := {e1 , . . . , eN },
Bˆ := {ˆ e1 , . . . , eˆN },
be two bases of CN , and let AB and ABˆ denote their associated matrices with ˆ respectively. Then, respect to the bases B and B, ABˆ = P −1 AB P,
(1.1)
where P ∈ MN (C) is the matrix whose jth column consists of the coordinates of eˆj with respect to the basis B, that is, P = (pij )1≤i,j≤N , where eˆj =
N
pij ei ,
1 ≤ j ≤ N.
i=1
The matrix P is known as the matrix of the change of basis. Identity (1.1) follows easily by taking into account that the fact u=
N j=1
implies
u j ej =
N
uˆj eˆj
j=1
⎞ ⎛ ⎞ u1 u ˆ1 ⎜ . ⎟ ⎜ . ⎟ ⎜ . ⎟ = P ⎜ . ⎟. ⎝ . ⎠ ⎝ . ⎠ uN u ˆN ⎛
Two matrices are said to be similar when they represent the same linear operator with respect to two certain bases. In other words, A, B ∈ MN (C) are similar when there exists an invertible matrix P ∈ MN (C) such that AP = P B.
1.1. Basic concepts
5
One of the main objectives in finite-dimensional spectral theory is the construction of bases so that a given linear operator possesses an associated matrix with a maximum number of zeros; the closer to a diagonal matrix, the better. To that aim, one has to find the eigenvectors of the operator (or matrix) A, which are the vectors u ∈ CN \ {0} for which there exists some λ ∈ C such that Au = λu. The direction of an eigenvector is therefore invariant under the action of the linear operator A. The corresponding λ is called an eigenvalue of A. The matrix associated with A with respect to any basis containing an eigenvector exhibits a column with the associated eigenvalue in the entry of the principal diagonal, while all remaining entries of that column equal zero. Hereafter, given A ∈ L(CN ), the sets N [A] and R[A] will stand for the kernel (null-space) and the range (image) of A, respectively. Also, I denotes the identity matrix in MN (C), or the identity operator in L(CN ). The following definition makes the concepts of eigenvalue and eigenvector precise. Definition 1.1.1. It is said that λ ∈ C is an eigenvalue of the matrix A ∈ MN (C) if there exists u ∈ CN \ {0} such that Au = λu. Every u ∈ N [A − λI] is called an eigenvector of A associated with the eigenvalue λ. The linear subspace N [A − λI] is called the eigenspace of A associated with λ. Thanks to the Cramer rule, the homogeneous linear system Au = λu admits a non-zero solution u if and only if det(A − λI) = 0. Consequently, the set of eigenvalues of A coincides with the set of roots of the polynomial PA defined by PA (z) := det(A − zI),
z ∈ C,
which will be referred to as the characteristic polynomial of A. A polynomial is a mapping P : C → C of the form P (z) =
n
aj z j ,
z ∈ C,
j=0
for some integer n ≥ 0 and some coefficients a0 , . . . , an ∈ C, of course.
6
Chapter 1. The Jordan Theorem
The characteristic polynomial is invariant under changes of basis, and, hence, so are the eigenvalues. This feature reveals the consistency of referring to the characteristic polynomial of a linear operator, and, hence, to the eigenvalues of a linear operator. Indeed, if A, Q ∈ MN (C) and det Q = 0, then, for all z ∈ C, PQ−1 AQ (z) = det(Q−1 (A − zI)Q) = det(A − zI) = PA (z); however, the eigenvectors are not invariant under changes of basis. The equation PA (z) = 0 is called the characteristic equation of A, and its roots are the eigenvalues of A. It is easy to check that the characteristic polynomial has degree N , and that its leading coefficient is (−1)N . Therefore, thanks to the fundamental theorem of algebra, it possesses exactly N roots, counting according to their multiplicities. Consequently, we can express PA (z) = (−1)N
p
(z − λj )ma (λj ) ,
z ∈ C,
(1.2)
j=1
for some complex numbers λ1 , . . . , λp and integers ma (λ1 ), . . . , ma (λp ) ≥ 1 with the convention that λi = λj
if
1 ≤ i < j ≤ p,
which will be maintained throughout this book. Then, the eigenvalues of the matrix A are λ1 , . . . , λp . Moreover, ma (λ1 ) + · · · + ma (λp ) = N. Definition 1.1.2. Let A ∈ MN (C). Then, the set of eigenvalues of A, hereafter denoted by σ(A), is called the spectrum of A. Moreover, if the characteristic polynomial PA of A is expressed by (1.2), then ma (λj ) is called the algebraic multiplicity of λj as an eigenvalue of A. For each λ ∈ σ(A), the geometric multiplicity of the eigenvalue λ, subsequently denoted by mg (λ), is defined through mg (λ) := dim N [A − λI]. In general, mg (λ) ≤ ma (λ)
for each λ ∈ σ(A),
but the algebraic and geometric multiplicities do not always coincide. For example, for each α ∈ C, the characteristic polynomial PA of the matrix α 0 A= 1 α
1.1. Basic concepts
7
is given by PA (z) = (z − α)2 ,
z ∈ C,
and, hence, α is the unique eigenvalue of A. Its algebraic multiplicity equals 2, whereas its geometric multiplicity equals 1, since 0 N [A − αI] = span . 1 The eigenvalues λ ∈ σ(A) for which mg (λ) = ma (λ) are called semisimple. An eigenvalue is semisimple if and only if its algebraic multiplicity equals the maximum number of linearly independent associated eigenvectors. We will see that a matrix is diagonalizable (that is, it is similar to a diagonal matrix) if and only if all its eigenvalues are semisimple. An eigenvalue λ ∈ σ(A) is said to be simple when ma (λ) = 1. If λ is simple, necessarily mg (λ) = 1, and, hence, λ is semisimple. Besides the eigenspace N [A − λI] itself, associated with each eigenvalue λ ∈ σ(A) there is the following increasing chain of generalized eigenspaces N [A − λI] ⊂ N [(A − λI)2 ] ⊂ N [(A − λI)3 ] ⊂ · · · ,
(1.3)
which is indeed increasing because N [C] ⊂ N [BC] for every B, C ∈ MN (C). Moreover, as CN is finite dimensional, the chain (1.3) must stabilize, and, hence, there exists some integer j ≥ 1 such that N [(A − λI)k ] = N [(A − λI)j ],
k ≥ j.
Actually, for every j ≥ 1 such that N [(A − λI)j ] = N [(A − λI)j+1 ] the identities (1.4) hold. Indeed, for each u ∈ N [(A − λI)j+2 ], we have that (A − λI)u ∈ N [(A − λI)j+1 ] = N [(A − λI)j ], and, hence, u ∈ N [(A − λI)j+1 ]. Consequently, N [(A − λI)j+2 ] ⊂ N [(A − λI)j+1 ] and, therefore, (1.4) holds, because N [(A − λI)j+1 ] ⊂ N [(A − λI)j+2 ]. Now, we are ready to introduce the following concept.
(1.4)
8
Chapter 1. The Jordan Theorem
Definition 1.1.3. For each λ ∈ σ(A), the ascent of λ, throughout denoted by ν(λ), is the minimum integer number k ≥ 1 for which N [(A − λI)k ] = N [(A − λI)k+1 ]. For any integer j ≥ 1, the linear subspace N [(A − λI)j ] is said to be a generalized eigenspace of A associated with the eigenvalue λ, and any u ∈ N [(A − λI)j ] is said to be a generalized eigenvector of A (associated with λ). The linear manifold N [(A − λI)ν(λ) ] is called the ascent generalized eigenspace of A associated with the eigenvalue λ. According to Definition 1.1.3 and the previous discussion, for every λ ∈ σ(A) and 0 ≤ i < j ≤ ν(λ) ≤ k, one has that N [(A − λI)i ] N [(A − λI)j ] ⊂ N [(A − λI)ν(λ) ] = N [(A − λI)k ].
(1.5)
1.2 The Jordan theorem Hereafter, for any A ∈ MN (C), when we write σ(A) = {λ1 , . . . , λp }, we will suppose that λi = λj
if 1 ≤ i < j ≤ p,
even though it is not explicitly stated. The following result, which collects the most important properties of the ascent generalized eigenspaces, is the central result of the finite-dimensional classic spectral theory. Theorem 1.2.1 (Jordan). Let A ∈ MN (C) be with σ(A) = {λ1 , . . . , λp }. Then
A N [(A − λj I)ν(λj ) ] ⊂ N [(A − λj I)ν(λj ) ],
1 ≤ j ≤ p.
Actually, if for any 1 ≤ j ≤ p we denote by Aj the restriction of A from N [(A − λj I)ν(λj ) ] to itself, then σ(Aj ) = {λj }, Moreover, CN =
p
1 ≤ j ≤ p.
N [(A − λj I)ν(λj ) ]
j=1
and ma (λj ) = dim N [(A − λj I)ν(λj ) ],
1 ≤ j ≤ p.
(1.6)
1.2. The Jordan theorem
9
The proof of Theorem 1.2.1 will be decomposed in a number of independent results of great intrinsic interest in their own right. Hereafter, given a matrix A ∈ MN (C) and the polynomial P defined through P (z) =
n
z ∈ C,
aj z j ,
j=0
we will denote by P (A) the matrix P (A) :=
n
aj Aj .
j=0
Note that if P is expressed as P (z) = an
q
(z − µi )mi ,
z ∈ C,
i=1
for some q, m1 , . . . , mq ∈ N, and µ1 , . . . , µq ∈ C, then P (A) = an
q
(A − µi I)mi ;
i=1
the product being independent of the order of the factors, because A commutes with itself and with the identity operator I. The next result shows that P (A) = 0 if σ(A) = {λ1 , . . . , λp } and P is divided by the polynomial p (z − λj )ν(λj ) , z ∈ C. z → j=1
Every polynomial P satisfying P (A) = 0 will be called an annihilator polynomial of the matrix A. Lemma 1.2.2. Let A ∈ MN (C) be with σ(A) = {λ1 , . . . , λp }. Then p
(A − λj I)ν(λj ) = 0.
j=1
Proof. Let B = {e1 , . . . , eN } be a basis of CN . Then, for each 1 ≤ i ≤ N , the N + 1 vectors 0 ≤ j ≤ N, Aj ei , must be linearly dependent, and, hence, there exist (αi0 , . . . , αiN ) ∈ CN +1 \ {0}
10
Chapter 1. The Jordan Theorem
such that
N
αij Aj ei = 0.
j=0
Now, consider the polynomials Q1 , . . . , QN defined by Qi (z) :=
N
z ∈ C,
αij z j ,
1 ≤ i ≤ N.
j=0
Each of them is non-zero and satisfies Qi (A)ei = 0. Thus, the product polynomial Q := Q1 · · · QN satisfies Q = 0 and Q(A)ei = 0,
1 ≤ i ≤ N,
since Q1 (A), . . . , QN (A) commute with one another. As the matrix Q(A) vanishes over the basis B, necessarily Q(A) = 0. We divide Q by a constant, so that its leading coefficient can be taken as the unity, and, hence, Q can be expressed in the form Q(z) =
q
(z − µj )mj ,
z ∈ C,
j=1
for some natural numbers q, m1 , . . . , mq ≥ 1, and certain µ1 , . . . , µq ∈ C mutually different. Now, we consider the polynomial R defined through q
R(z) :=
(z − µj )mj ,
z ∈ C,
j=1 µj ∈ σ(A)
if σ(A) ∩ {µ1 , . . . , µq } = ∅, and by R := 1 if σ(A) ∩ {µ1 , . . . , µq } = ∅. For these choices, Q admits the factorization Q(z) = R(z)
q j=1 µj ∈σ(A) /
(z − µj )mj ,
z ∈ C.
1.2. The Jordan theorem
11
On the other hand, we obtain from the definition of eigenvalue that q
det
(A − µj I)
mj
q
=
j=1 / µj ∈σ(A)
[det(A − µj I)]mj = 0,
j=1 / µj ∈σ(A)
and, hence, the matrix q
(A − µj I)mj
j=1 / µj ∈σ(A)
is invertible. Consequently, R(A) = 0 since Q(A) = 0; therefore, there exists i ∈ {1, . . . , q} such that µi ∈ σ(A). Let us check that the polynomial P defined by P (z) :=
q
(z − µj )min{ν(µj ),mj } ,
z ∈ C,
(1.7)
j=1 µj ∈σ(A)
also satisfies P (A) = 0. Indeed, if mj ≤ ν(µj ) for each µj ∈ σ(A), then P = R and we already know that R(A) = 0. So suppose that there exists µj ∈ σ(A) such that ν(µj ) < mj . Without loss of generality, we can assume that ν(µ1 ) < m1 . Then, 0 = R(A) = (A − µ1 I)m1
q
(A − µj I)mj
j=2 µj ∈σ(A)
and, therefore, R
q
(A − µj I)mj ⊂ N [(A − µ1 I)m1 ] = N [(A − µ1 I)ν(µ1 ) ],
j=2 µj ∈σ(A)
whence (A − µ1 I)ν(µ1 )
q
(A − µj I)mj = 0.
j=2 µj ∈σ(A)
By repeating this process for each µj ∈ σ(A) with ν(µj ) < mj , it is apparent that the polynomial P defined by (1.7) satisfies P (A) = 0. This concludes the proof. The next result characterizes the annihilator polynomials of a matrix.
12
Chapter 1. The Jordan Theorem
Theorem 1.2.3 (Cayley–Hamilton). Let A ∈ MN (C) be with σ(A) = {λ1 , . . . , λp }. Then, a polynomial P satisfies P (A) = 0 if and only if P (z) = Q(z)
p
(z − λj )ν(λj ) ,
z ∈ C,
(1.8)
j=1
for some polynomial Q. Proof. Suppose that P admits the factorization (1.8). Then, thanks to Lemma 1.2.2, p P (A) = Q(A) (A − λj I)ν(λj ) = 0. j=1
To show the converse suppose that a polynomial P satisfies P (A) = 0. Then, for each 1 ≤ j ≤ p and x ∈ N [A − λj I] \ {0}, one has that 0 = P (A)x = P (λj )x and, hence, P (λ) = 0 for every λ ∈ σ(A). Thus, there exist a polynomial Q and p natural numbers m1 , . . . , mp ≥ 1, such that P (z) = Q(z)
p
(z − λj )mj ,
z ∈ C.
j=1
Moreover, by choosing appropriate exponents m1 , . . . , mp ≥ 1, we can suppose that no eigenvalue of A is a root of the polynomial Q. To complete the proof of the theorem it suffices to check that mj ≥ ν(λj )
for each 1 ≤ j ≤ p.
(1.9)
The proof of (1.9) proceeds by contradiction. Suppose mj < ν(λj ) for some 1 ≤ j ≤ p. Changing the order of the eigenvalues, if necessary, we can assume that m1 < ν(λ1 ). Then, by (1.5), N [(A − λ1 I)m1 ] is a proper subspace of N [(A − λ1 I)m1 +1 ]. Let x ∈ N [(A − λ1 I)m1 +1 ] \ N [(A − λ1 I)m1 ] and consider y := (A − λ1 I)m1 x.
1.2. The Jordan theorem
13
By construction, we have that y = 0
and Ay = λ1 y.
Therefore, P (A)x = Q(A)
p
(A − λj I)mj y = Q(λ1 )
j=2
p
(λ1 − λj )mj y = 0,
j=2
because no eigenvalue of A is a root of Q, the numbers λ1 , . . . , λp are distinct, and y = 0. This contradicts the assumption P (A) = 0, which shows (1.9) and concludes the proof. The next result shows the existence of a class of interpolating polynomials. Lemma 1.2.4. Suppose h ≥ 1 is an integer, and r1 , . . . , rh ∈ C satisfy ri = rj if 1 ≤ i < j ≤ h. For each j ∈ {1, . . . , h} consider any integer number mj ≥ 0 and any complex numbers αj,0 , . . . , αj,mj . Then there exists a polynomial P such that P k) (rj ) = αj,k ,
1 ≤ j ≤ h,
0 ≤ k ≤ mj .
Proof. We will argue by induction on h. When h = 1, the polynomial P defined by m1 α1,k P (z) := (z − r1 )k , z ∈ C, k! k=0
satisfies the required conditions. Suppose the result is true for h = n, and let Pn be a polynomial such that Pnk) (rj ) = αj,k ,
1 ≤ j ≤ n,
0 ≤ k ≤ mj .
To prove the result for h = n + 1 it suffices to check that there exists a polynomial Q for which the polynomial Pn+1 defined by Pn+1 (z) := Pn (z) + Q(z)
n
(z − rj )mj +1 ,
z ∈ C,
(1.10)
j=1
satisfies the required conditions. The auxiliary polynomial Πn defined by n
Πn (z) :=
(z − rj )mj +1 ,
z ∈ C,
1 ≤ j ≤ n,
0 ≤ k ≤ mj .
j=1
satisfies Πk) n (rj ) = 0,
(1.11)
14
Chapter 1. The Jordan Theorem
Moreover, for every polynomial Q satisfying (1.10), and k ≥ 0, differentiating (1.10) gives k k k) (1.12) Qk−) Π) Pn+1 = Pnk) + n. =0
Suppose 1 ≤ j ≤ n and 0 ≤ k ≤ mj . Then, from (1.11), (1.12) and the induction hypothesis we obtain that k)
Pn+1 (rj ) = Pnk) (rj ) = αj,k . Thus, to conclude the proof it suffices to construct Q satisfying αn+1,k = Pnk) (rn+1 ) +
k k =0
Qk−) (rn+1 )Π) n (rn+1 )
(1.13)
for each 0 ≤ k ≤ mn+1 . For k = 0, (1.13) becomes αn+1,0 = Pn (rn+1 ) + Q(rn+1 )Πn (rn+1 ), and, since Πn (rn+1 ) = 0, the polynomial Q must satisfy Q(rn+1 ) = β0 , where β0 :=
αn+1,0 − Pn (rn+1 ) . Πn (rn+1 )
(1.14)
In general, according to (1.13), for each 1 ≤ k ≤ mn+1 the polynomial Q must satisfy Qk) (rn+1 ) = βk , where k k 1 k) ) βk := βk− Πn (rn+1 ) . αn+1,k − Pn (rn+1 ) − Πn (rn+1 ) =1
As this is a recurrence formula whose initialization is given by (1.14), substituting the polynomial Q defined through βk (z − rn+1 )k , k!
mn+1
Q(z) :=
z ∈ C,
k=0
into (1.10) provides us with a P satisfying all required conditions.
Now, given A ∈ MN (C), we use Lemma 1.2.4 to construct an auxiliary family of polynomials associated with A that will enable us to prove the Jordan theorem. From now on, δij stands for the Kronecker delta, that is to say, δij = 1 if i = j, while δij = 0 if i = j. Proposition 1.2.5. Let A ∈ MN (C) be a matrix with exactly p ≥ 1 eigenvalues. Then there exist p polynomials P1 , . . . , Pp satisfying the following properties:
1.2. The Jordan theorem
15
• Pj (A) = 0 for each 1 ≤ j ≤ p. • Pi (A)Pj (A) = δij Pi (A) for each 1 ≤ i, j ≤ p. p • I = j=1 Pj (A). Proof. Suppose σ(A) = {λ1 , . . . , λp }. By Lemma 1.2.4, for each 1 ≤ j ≤ p there exists a polynomial Pj such that Pj (λj ) = 1,
k)
1 ≤ k ≤ ν(λj ) − 1,
Pj (λj ) = 0,
and k)
Pj (λi ) = 0,
0 ≤ k ≤ ν(λi ) − 1,
i ∈ {1, . . . , p} \ {j}.
These polynomials P1 , . . . , Pp satisfy the conditions of the statement. Indeed, fix 1 ≤ j ≤ p. By construction, the polynomial Pj − 1 has a zero of order greater than or equal to ν(λj ) at λj and, consequently, there exists a polynomial Qj such that Pj (z) − 1 = (z − λj )ν(λj ) Qj (z),
z ∈ C.
(1.15)
Similarly, Pj has a zero of order greater than or equal to ν(λi ) at each λi ∈ σ(A) \ {λj }, and, hence, there exists a polynomial Rj such that Pj (z) = Rj (z)
p
(z − λi )ν(λi ) ,
z ∈ C.
(1.16)
i=1 i=j
As Pj (λj ) = 1 = 0, the polynomial z → (z − λj )ν(λj ) cannot divide Pj and, hence, by Theorem 1.2.3, Pj (A) = 0. Moreover, by (1.15) and (1.16), we find that Pj (z)[Pj (z) − 1] = Qj (z)Rj (z)
p
(z − λi )ν(λi ) ,
z ∈ C,
i=1
and, hence, according to Theorem 1.2.3, Pj (A)[Pj (A) − I] = 0. Similarly, for any 1 ≤ i ≤ p with i = j, it is easy to see that Pi (A)Pj (A) = 0. Again by (1.15) and (1.16), the polynomial z → (z − λj )ν(λj ) divides Pj − 1 and each Pi with i = j. Consequently, it also divides their sum p i=1
Pi − 1.
16
Chapter 1. The Jordan Theorem
Actually, as this property is valid for each 1 ≤ j ≤ p, the product polynomial z →
p
(z − λj )ν(λj )
j=1
p
also divides i=1 Pi −1, since its factors are mutually prime. Consequently, thanks again to Theorem 1.2.3, p Pj (A), I= j=1
which completes the proof. Now, we have all necessary background to prove the Jordan theorem.
Proof of Theorem 1.2.1. Consider the polynomials P1 , . . . , Pp , whose existence was guaranteed by Proposition 1.2.5, and the vector subspaces 1 ≤ j ≤ p.
Nj := R[Pj (A)], We claim that A(Nj ) ⊂ Nj ,
1 ≤ j ≤ p,
(1.17)
and CN = N 1 + · · · + N p .
(1.18)
Indeed, (1.17) follows readily from the fact that APj (A) = Pj (A)A ,
1 ≤ j ≤ p,
and Property (1.18) follows straight away from the identity I=
p
Pj (A).
j=1
Now, we will prove that Nj = N [(A − λj I)ν(λj ) ],
1 ≤ j ≤ p.
Thanks to (1.16), for each 1 ≤ i ≤ p, the polynomial z →
p
(z − λj )ν(λj )
j=1
divides the polynomial z → (z − λi )ν(λi ) Pi (z)
(1.19)
1.2. The Jordan theorem
17
and, hence, by Theorem 1.2.3, (A − λi I)ν(λi ) Pi (A) = 0. Consequently, Ni = R[Pi (A)] ⊂ N [(A − λi I)ν(λi ) ].
(1.20)
Combining these inclusions with (1.18) shows that CN = N [(A − λ1 I)ν(λ1 ) ] + · · · + N [(A − λp I)ν(λp ) ]. Therefore, in order to prove (1.6) it suffices to show that the facts uj ∈ N [(A − λj I)ν(λj ) ], and
p
1 ≤ j ≤ p,
uj = 0
(1.21)
(1.22)
j=1
imply uj = 0 for each 1 ≤ j ≤ p. This can be obtained by contradiction. Suppose that uj = 0 for some j ∈ {1, . . . , p}. By rearranging the eigenvalues, if necessary, we can assume that u1 = 0. Then, by construction, (A − λ1 I)ν(λ1 ) u1 = 0. Let m denote the largest k ∈ N for which (A − λ1 I)k u1 = 0; this m exists because u1 = 0 and (A − λ1 I)0 = I. Moreover, 0 ≤ m < ν(λ1 ). Set v1 := (A − λ1 I)m u1 . Then, v1 = 0,
(A − λ1 I)v1 = (A − λ1 I)m+1 u1 = 0
and, hence, Av1 = λ1 v1 .
(1.23)
Now, consider the auxiliary polynomial P defined by P (z) := (z − λ1 )m
p
(z − λj )ν(λj ) ,
z ∈ C.
j=2
By the definition of v1 , (1.23) implies that P (A)u1 =
p j=2
(A − λj I)ν(λj ) v1 =
p j=2
(λ1 − λj )ν(λj ) v1 = 0.
18
Chapter 1. The Jordan Theorem
On the other hand, using identity (1.22) gives P (A)u1 = − =−
p
P (A)uk
k=2 p
(A − λ1 I)m
p
(A − λj I)ν(λj ) (A − λk I)ν(λk ) uk
j=2 j=k
k=2
and, hence, by (1.21), we find that P (A)u1 = 0. This contradiction concludes the proof of (1.6). Identity (1.19) follows straight away from (1.6) and (1.20). Thanks to (1.17) and (1.19), A leaves N [(A − λj I)ν(λj ) ] invariant for each 1 ≤ j ≤ p. Thus, we can define the operators Aj ∈ L(N [(A − λj I)ν(λj ) ]),
1 ≤ j ≤ p,
as the restriction of A from N [(A − λj I)ν(λj ) ] to itself. Consider 1 ≤ j ≤ p, a complex number µ, and u ∈ N [(A − λj I)ν(λj ) ] \ {0} such that Aj u = µu. Then 0 = (A − λj I)ν(λj ) u = (µ − λj )ν(λj ) u and, therefore, µ = λj . Consequently, σ(Aj ) = {λj } for each 1 ≤ j ≤ p. Now we set dj := dim N [(A − λj I)ν(λj ) ],
1 ≤ j ≤ p.
For each 1 ≤ j ≤ p, let Bj be a basis of N [(A − λj I) union of these bases B := B1 ∪ · · · ∪ Bp
ν(λj )
]. By (1.6), the (ordered)
provides us with a basis of CN . Moreover, thanks to the invariance property (1.17), with respect to B, the linear operator A has the associated matrix ⎛ ⎞ A1,B1 0 ··· 0 ⎜ ⎟ A2,B2 · · · 0 ⎟ ⎜ 0 ⎜ (1.24) AB := ⎜ . .. ⎟ .. .. ⎟, . ⎝ .. . ⎠ . 0 0 · · · Ap,Bp where, for each 1 ≤ j ≤ p, the matrix Aj,Bj denotes the associated matrix with Aj with respect to the basis Bj . Note that Aj,Bj ∈ Mdj (C), for each 1 ≤ j ≤ p, and that p dj . N= j=1
1.3. The Jordan canonical form
19
Moreover, if PB denotes the matrix whose columns consist of the coordinates of the vectors of B with respect to the original basis, then A = PB AB PB−1 .
(1.25)
From (1.24) and (1.25), we find that det(A − zI) = det(AB − zI) =
p
det(Aj,Bj − zI)
j=1
for all z ∈ C. Moreover, as σ(Aj,Bj ) = {λj } for all 1 ≤ j ≤ p, it follows that det(Aj,Bj − zI) = (−1)dj (z − λj )dj ,
z ∈ C,
1 ≤ j ≤ p,
and, therefore, det(A − zI) = (−1)
N
p
(z − λj )dj ,
z ∈ C.
j=1
On the other hand, by definition, det(A − zI) = (−1)N
p
(z − λj )ma (λj ) ,
z ∈ C,
j=1
and, consequently, dj = ma (λj )
for each 1 ≤ j ≤ p.
This concludes the proof.
1.3 The Jordan canonical form Pick a natural number n ≥ 1, and, for each integer 1 ≤ j ≤ n, let kj ≥ 1 be an integer number, and Bj ∈ Mkj (C). Then, one can define ⎞ ⎛ B1 0 · · · 0 ⎟ ⎜ ⎜ 0 B2 · · · 0 ⎟ ⎜ diag{B1 , . . . , Bn } := ⎜ . .. ⎟ .. .. ⎟ ∈ MN (C), . . ⎝ . . ⎠ . 0 0 · · · Bn where N := k1 + · · · + kn . We consider a matrix A ∈ MN (C) with spectrum σ(A) = {λ1 , . . . , λp }. The main goal of this section consists in, for each 1 ≤ j ≤ p, constructing a basis Bj := {ej1 , . . . , ejma (λj ) }
20
Chapter 1. The Jordan Theorem
of the ascent generalized eigenspace N [(A − λj I)ν(λj ) ] so that the matrix Aj,Bj of the operator from N [(A − λj I)ν(λj ) ] to itself defined by restriction of A is blockdiagonal Aj,Bj = diag{Jj,i1 , Jj,i2 , . . . , Jj,inj } for some integer number nj ≥ 1, where ih ∈ {1, . . . , ν(λj )} for 1 ≤ h ≤ nj , and for each natural n ≥ 1 the matrix Jj,n ∈ Mn (C) stands for the Jordan block of order n associated with the eigenvalue λj , which is defined by Jj,1 := λj ,
Jj,2 :=
λj 1
⎛
Jj,n
λj ⎜ ⎜1 ⎜ ⎜0 ⎜ := ⎜ . ⎜ .. ⎜ ⎜ ⎝0 0
0 λj
⎛
,
0 λj 1 .. . 0 0
Jj,3
0 0 λj .. . 0 0
λj ⎜ := ⎝ 1 0
··· ··· ··· .. .
0 0 0 .. . · · · λj ··· 1
0 λj 1 ⎞
⎞ 0 ⎟ 0 ⎠,..., λj
0 ⎟ 0⎟ ⎟ 0⎟ ⎟ . .. ⎟ .⎟ ⎟ ⎟ 0⎠ λj
(1.26)
Fix j ∈ {1, . . . , p}. When ν(λj ) = 1, then the basis Bj consists of eigenvectors, and, hence, 1 ≤ k ≤ ma (λj ) = mg (λj ). Aj ejk = λj ejk , Consequently, in such a case the matrix Aj,Bj is diagonal and consists of ma (λj ) Jordan blocks Jj,1 of order 1. Suppose ν(λj ) ≥ 2, and for each 1 ≤ k ≤ ν(λj ) − 1 let Ckj be a linear supplement of N [(A − λj I)k ] in N [(A − λj I)k+1 ], that is, N [(A − λj I)k+1 ] = N [(A − λj I)k ] ⊕ Ckj ,
1 ≤ k ≤ ν(λj ) − 1.
(1.27)
Then, setting C0j := N [A − λj I], we have that
ν(λj )−1
N [(A − λj I)
ν(λj )
]=
Ckj
k=0
and, hence, in order to construct a basis of N [(A−λj I)ν(λj ) ] it suffices to construct a basis of Ckj for each 0 ≤ k ≤ ν(λj ) − 1. Now, for every 0 ≤ k ≤ ν(λj ) − 1, we set hk := dim Ckj .
1.3. The Jordan canonical form
21
Then, hk = dim N [(A − λj I)k+1 ] − dim N [(A − λj I)k ] ≥ 1. j Let {ej1 , . . . , ejhν(λ )−1 } be a basis of Cν(λ , and consider the images of the elej )−1 j ments of this basis under the action of the operator A − λj I,
{(A − λj I)eji : 1 ≤ i ≤ hν(λj )−1 }.
(1.28)
j These images form a linearly independent system of Cν(λ . Indeed, suppose j )−2 there exist ci ∈ C, for 1 ≤ i ≤ hν(λj )−1 , for which hν(λj )−1
ci (A − λj I)eji = 0.
i=1
Then, since ν(λj ) − 1 ≥ 1, we have that hν(λj )−1
ci eji ∈ N [A − λj I] ⊂ N [(A − λj I)ν(λj )−1 ]
i=1
and, hence, since ej1 , . . . , ejhν(λ
j )−1
j ∈ Cν(λ , j )−1
hν(λj )−1
j ci eji ∈ N [(A − λj I)ν(λj )−1 ] ∩ Cν(λ . j )−1
i=1
Thus, owing to (1.27), this gives hν(λj )−1
ci eji = 0.
i=1
As the set {eji : 1 ≤ i ≤ hν(λj )−1 } is linearly independent, necessarily ci = 0 for each 1 ≤ i ≤ hν(λj )−1 and, therefore, the system (1.28) is linearly independent j and contained in Cν(λ , as claimed above. Consequently, if hν(λj )−2 = hν(λj )−1 , j )−2 then j j j = span (A − λ I)e , . . . , (A − λ I)e Cν(λ j j 1 hν(λ )−1 , j )−2 j
whereas in the case hν(λj )−2 > hν(λj )−1 one can extend the system (1.28) to j complete a basis of Cν(λ , say j )−2 {(A − λj I)ej1 , . . . , (A − λj I)ejhν(λ
j )−1
, ejhν(λ
j )−1
Suppose ν(λj ) = 2. Then j = N [A − λj I] Cν(λ j )−2
j +1 , . . . , ehν(λj )−2 }.
22
Chapter 1. The Jordan Theorem
and the set Bj := {ej1 , (A − λj I)ej1 , ej2 , (A − λj I)ej2 , . . . , ejhν(λ
j )−1
, (A − λj I)ejhν(λ
j )−1
, ejhν(λ
j )−1
j +1 , . . . , ehν(λj )−2 }
provides us with a basis of N [(A − λj I)2 ]. Moreover, since Aeji = λj eji + (A − λj I)eji ,
1 ≤ i ≤ hν(λj )−1 ,
A(A − λj I)eji = λj (A − λj I)eji ,
1 ≤ i ≤ hν(λj )−1 ,
Aeji
=
λj eji ,
hν(λj )−1 + 1 ≤ i ≤ hν(λj )−2 ,
the matrix of Aj with respect to the basis Bj is the following: Aj,Bj = diag{Jj,2 , Jj,2 , . . . , Jj,2 , Jj,1 , Jj,1 , . . . , Jj,1 }. hν(λj )−2 −hν(λj )−1
hν(λj )−1
When ν(λj ) ≥ 3, as in the previous step, we consider the system formed by all j , that is, images under the action of A − λj I of the vectors of the basis of Cν(λ j )−2 " ! (A − λj I)2 eji : 1 ≤ i ≤ hν(λj )−1 " ! ∪ (A − λj I)eji : hν(λj )−1 + 1 ≤ i ≤ hν(λj )−2 .
(1.29)
j This system is linearly independent in Cν(λ . Indeed, suppose ci ∈ C, for 1 ≤ j )−3 i ≤ hν(λj )−2 , satisfy hν(λj )−1
hν(λj )−2
ci (A −
λj I)2 eji
+
i=1
ci (A − λj I)eji = 0.
i=hν(λj )−1 +1
Then, arguing as above, it follows from ν(λj ) − 2 ≥ 1 that hν(λj )−1
i=1
hν(λj )−2
ci (A −
λj I)eji
+
j ci eji ∈ N [(A − λj I)ν(λj )−2 ] ∩ Cν(λ j )−2
i=hν(λj )−1 +1
and, therefore, due to (1.27), ci = 0 for each 1 ≤ i ≤ hν(λj )−2 . Similarly, (1.29) j provides us with a basis of Cν(λ if hν(λj )−3 = hν(λj )−2 , whereas it can be j )−3 j extended to complete a basis of Cν(λ , by adding the appropriate system j )−3
{eji : hν(λj )−2 + 1 ≤ i ≤ hν(λj )−3 },
1.4. The real canonical form
23
if hν(λj )−3 > hν(λj )−2 . When ν(λj ) = 3, we are done. In the general case, after ν(λj ) steps we will have constructed an ordered basis of the ascent generalized eigenspace of the form #
ν(λj )
Bj :=
i=1
hν(λ
ν(λj )−i !
j )−i #
=hν(λ
j )−i+1
#
+1
" (A − λj I)k ej .
k=0
The matrix of Aj with respect to Bj has exactly hν(λj )−1 Jordan blocks of order ν(λj ), exactly hν(λj )−2 − hν(λj )−1 Jordan blocks of order ν(λj ) − 1 and, in general, hν(λj )−k − hν(λj )−k+1 Jordan blocks of order ν(λj ) − k + 1, for each 1 ≤ k ≤ ν(λj ). The ordered set of vectors of Bj is often called a chain of generalized eigenvectors. Note that the operator Aj can be expressed as Aj = λj I + (Aj − λj I) and, consequently, Aj is a sum of the diagonal operator λj I plus the nilpotent operator Aj − λj I, since (A − λj I)ν(λj ) (N [(A − λj )ν(λj ) ]) = {0}. Moreover, the basis Bj that we have just constructed provides us with a matrix of Aj − λj I with the maximum possible number of zero entries. Let P be the matrix whose columns consist of the coordinates of the vectors of the bases B1 , . . . , Bp that we have just constructed. The matrix J := P AP −1 is called the Jordan canonical form of the matrix A. In this section we have proved that J = diag{J1 , J2 , . . . , Jp }, where, for each 1 ≤ j ≤ p, the matrix Jj consists of a finite diagonal union of Jordan blocks of the type Jj,k , for 1 ≤ k ≤ ν(λj ).
1.4 The real canonical form Throughout this section we suppose that A ∈ MN (R). In such a case, the characteristic polynomial of A has real coefficients, and, hence, ¯ : λ ∈ σ(A)} σ(A) = {λ
24
Chapter 1. The Jordan Theorem
where the complex conjugate of any z ∈ C is denoted by z¯. Consequently, the corresponding ascent generalized eigenspaces in the decomposition (1.6) also appear in pairs. Suppose σ(A) = {λ1 , . . . , λp } and pick 1 ≤ j ≤ p. It is easy to see that the vectors of the basis Bj constructed in Section 1.3 all have real components if λj ∈ R, whereas if λj = αj + iβj ,
with
αj , βj ∈ R,
βj = 0,
then, their components are complex. Suppose this is the case, and reorder the eigenvalues, if necessary, so that ¯j . λj+1 = αj − iβj = λ Then, for each k ≥ 0 and e ∈ CN , (A − λj I)k e = 0 if and only if (A − λj+1 I)k e¯ = 0,
(1.30)
where e¯ is the complex conjugate vector of e, that is, the vector whose components are the complex conjugate components of e. Therefore, for each k ≥ 0, dim N [(A − λj I)k ] = dim N [(A − λj+1 I)k ] and, in particular, ν(λj ) = ν(λj+1 ) and ma (λj ) = ma (λj+1 ). Let Bj := {ej1 , . . . , ejma (λj ) } be the basis of N [(A − λj I)ν(λj ) ] constructed in Section 1.3. Thanks to (1.30), it is easy to see that ej1 , . . . , e¯jma (λj ) } Bj+1 := {¯ provides us with the Jordan basis of N [(A − λj+1 I)ν(λj+1 ) ] constructed in Section 1.3. In other words, we are choosing := e¯jk , ej+1 k
1 ≤ k ≤ ma (λj ) = ma (λj+1 ).
Actually, by construction, if a system {ejk+i : 0 ≤ i ≤ h − 1}, of h ≥ 1 vectors of the basis Bj , where 1 ≤ k ≤ ma (λj ), provides a Jordan block Jj,h of order h, then, their conjugate vectors ¯jk+i , ej+1 k+i = e
0 ≤ i ≤ h − 1,
also provide a Jordan block of type Jj+1,h .
1.4. The real canonical form
25
From now on, for any integer n ≥ 1 and z ∈ Cn , the vectors Re z ∈ Rn and Im z ∈ Rn will stand for the real and the imaginary parts of z, respectively. According to this notation, when h = 1, we have that Aejk = λj ejk and, hence, A Re ejk = αj Re ejk − βj Im ejk , A Im ejk = αj Im ejk + βj Re ejk . Consequently, A leaves the real linear manifold generated by Re ejk and Im ejk invariant, and the matrix of its restriction to this manifold with respect to the basis {Re ejk , Im ejk } is R αj βj . (1.31) Jj,2 := −βj αj Note that the system {Re ejk , Im ejk } is linearly independent, since the determinant R of Jj,2 is non-zero. Similarly, when h ≥ 2, the identities Aejk+i = λj ejk+i + ejk+i+1 , Aejk+h−1
=
0 ≤ i ≤ h − 2,
λj ejk+h−1 ,
hold and, hence, identifying real and imaginary parts in these identities shows that, for each 0 ≤ i ≤ h − 2, A Re ejk+i = Re λj Re ejk+i − Im λj Im ejk+i + Re ejk+i+1 , A Im ejk+i = Re λj Im ejk+i + Im λj Re ejk+i + Im ejk+i+1 , and A Re ejk+h−1 = Re λj Re ejk+h−1 − Im λj Im ejk+h−1 , A Im ejk+h−1 = Re λj Im ejk+h−1 + Im λj Re ejk+h−1 . Therefore, A leaves the real linear manifold span Re ejk , Im ejk , . . . , Re ejk+h−1 , Im ejk+h−1 invariant, and the matrix of its restriction to this linear manifold is ⎞ ⎛ R Jj,2 0 ··· 0 0 ⎟ ⎜ R ⎜ I2 Jj,2 · · · 0 0 ⎟ ⎟ ⎜ R ⎜ . .. .. ⎟ .. .. Jj,2h = ⎜ .. ⎟, . . . . ⎟ ⎜ R ⎜ 0 0 · · · Jj,2 0 ⎟ ⎠ ⎝ R 0 0 · · · I2 Jj,2
(1.32)
26
Chapter 1. The Jordan Theorem R
where Jj,2 is the Jordan block (1.31), and I2 is the identity matrix of order 2. Note R
that, since the determinant of Jj,2h is non-zero, the manifold (1.32) has dimension 2h. These features show that choosing the basis R
Bj := {Re ej1 , Im ej1 , . . . , Re ejma (λj ) , Im ejma (λj ) }, instead of Bj ∪Bj+1 , the endomorphism A leaves the real linear manifold generated by BjR invariant, and that its associated matrix with respect to this basis is blockdiagonal, each of its blocks being of type R
1 ≤ k ≤ ν(λj ).
Jj,2k ,
Iterating the same process for each pair of complex conjugate eigenvalues, one is naturally driven to the construction of the so-called real Jordan canonical form R of the matrix A. The block Jj,2k is often called the real Jordan block of order 2k associated with the complex eigenvalue λj .
1.5 An example Throughout this section we make ⎛ 2 ⎜−1 ⎜ A := ⎜ ⎝1 0
the particular choice ⎞ 2 −1 −1 3 −1 1 ⎟ ⎟ ⎟ ∈ M4 (R). 1 1 0⎠ 1
−1
(1.33)
2
After some straightforward, but tedious, calculations, we arrive at the identity $ $ $2 − z 2 −1 −1 $$ $ $ −1 3 − z −1 1 $$ $ det(A − zI) = $ z ∈ C. $ = [(z − 2)2 + 1]2 , $ $ 1 1 1 − z 0 $ $ $ 0 1 −1 2 − z $ Thus, σ(A) = {2 − i, 2 + i} with algebraic multiplicities ma (2 − i) = ma (2 + i) = 2. We have that
⎛
i ⎜−1 ⎜ A − (2 − i)I = ⎜ ⎝1 0
⎞ 2 −1 −1 1+i −1 1⎟ ⎟ ⎟ 1 −1 + i 0 ⎠ 1 −1 i
1.5. An example
27
and the minor of order 3 formed by the last three entries of the first, third and fourth columns, does not vanish; indeed, $ $ $ $ $ $ $−1 −1 1$$ $−1 + i 0$ $−1 1$ $ $ $ $ $ $ $ $ = 2i = 0. $−$ $ 1 −1 + i 0$ = − $ $ $−1 i $ $ −1 $ $ i $ $0 −1 i Hence, dim R[A − (2 − i)I] = 3,
dim N [A − (2 − i)I] = 4 − 3 = 1,
and, therefore, since A is a real matrix, Theorem 1.2.1 implies that 2
dim N [(A − (2 − i)I) ] = 2,
(1.34)
⎧ ⎨ N [A − (2 + i)I] = N [A − (2 − i)I],
(1.35)
⎩ N [(A − (2 + i)I)2 ] = N [(A − (2 − i)I)2 ], and ν(2 − i) = ν(2 + i) = 2, ¯ the conjugate of the set L ⊂ R4 , i.e., where we have denoted by L ¯ := {¯ L u : u ∈ L}. Clearly, (x, y, z, t) ∈ N [A − (2 − i)I] if and only if ⎛
−1 −1 ⎜ ⎝ 1 −1 + i 0 −1
⎞⎛ ⎞ ⎛ ⎞ 1 x 1+i ⎟⎜ ⎟ ⎜ ⎟ 0⎠ ⎝z ⎠ = − ⎝ 1 ⎠ y, i t 1
y ∈ C.
By solving this system for the choice y = 1, we are led to (x, z, t) = (1, 1 + i, 1). Therefore, ⎡⎛
⎞⎤ 1 ⎢⎜ 1 ⎟⎥ ⎢⎜ ⎟⎥ N [A − (2 − i)I] = span ⎢⎜ ⎟⎥ , ⎣⎝1 + i⎠⎦ 1
⎡⎛
⎞⎤ 1 ⎢⎜ 1 ⎟⎥ ⎢⎜ ⎟⎥ N [A − (2 + i)I] = span ⎢⎜ ⎟⎥ . ⎣⎝1 − i⎠⎦ 1
28
Chapter 1. The Jordan Theorem 2
Now, we will determine N [(A − (2 − i)I) ]. Multiplying A − (2 − i)I by itself we find that ⎛
−4 ⎜−2 − 2i ⎜ 2 (A − (2 − i)I) = ⎜ ⎝−2 + 2i −2
4i −2 + 2i 2 + 2i 2i
⎞ 2 − 2i 2 + 2i⎟ ⎟ ⎟. 0 ⎠
−2i −2i −2 − 2i −2i
0
According to (1.34), 2
dim R[(A − (2 − i)I) ] = 2. 2
Moreover, a non-vanishing minor of order 2 of (A − (2 − i)I) is the one formed by the last two entries of the first and fourth rows; indeed, $ $ $−2i 2 − 2i$ $ $ $ = 2i(2 − 2i) = 0. $ $−2i 0 $ Thus, the second and third rows must depend linearly on the first and fourth ones; consequently, 2
(x, y, z, t) ∈ N [(A − (2 − 2i)I) ] if and only if
−i 1 − i −i 0
z 2 2i = x− y. t 1 i
(1.36)
For every (x, y) ∈ C2 , the system (1.36) has a unique solution, and making the choices (x, y) ∈ {(2, 0), (0, 2)}, we are led to ⎡⎛
⎞ ⎛ ⎞⎤ 2 0 ⎢⎜ 0 ⎟ ⎜ 2 ⎟⎥ ⎢⎜ ⎟ ⎜ ⎟⎥ N [(A − (2 − i)I)2 ] = span ⎢⎜ ⎟,⎜ ⎟⎥ . ⎣⎝ 2i ⎠ ⎝ 2 ⎠⎦ 1+i 1−i Thus, owing to (1.35), we also obtain that ⎡⎛
⎞ ⎛ ⎞⎤ 2 0 ⎢⎜ 0 ⎟ ⎜ 2 ⎟⎥ ⎢⎜ ⎟ ⎜ ⎟⎥ 2 N [(A − (2 + i)I) ] = span ⎢⎜ ⎟,⎜ ⎟⎥ . ⎣⎝ −2i ⎠ ⎝ 2 ⎠⎦ 1−i 1+i
1.5. An example
29
1.5.1 The complex Jordan form of A As the first vector of the Jordan basis of A we consider ⎛ ⎞ 2 ⎜ 0 ⎟ C ⎜ ⎟ e1 := ⎜ ⎟. ⎝ 2i ⎠ 1+i It is easy to see that C
2
e1 ∈ N [(A − (2 − i)I) ] \ N [A − (2 − i)I] and, hence, C
C
e2 := (A − (2 − i)I) e1 ∈ N [A − (2 − i)I] \ {0}. Clearly,
⎛ ⎞ ⎞ 1 −1 − i ⎜ 1 ⎟ ⎜−1 − i⎟ C ⎜ ⎟ ⎜ ⎟ e2 = ⎜ ⎟ ⎟ = −(1 + i) ⎜ ⎝1 + i⎠ ⎝ −2i ⎠ ⎛
−1 − i
1
and, hence, since A is real, we also find that ⎛
⎞ 2 ⎜ 0 ⎟ C C ⎜ ⎟ 2 e3 := e¯1 = ⎜ ⎟ ∈ N [(A − (2 + i)I) ] \ N [A − (2 + i)I] ⎝ −2i ⎠ 1−i and
⎛
⎞ −1 + i ⎜−1 + i⎟ C C ⎜ ⎟ e4 := e¯2 = ⎜ ⎟ ∈ N [A − (2 + i)I] \ {0}. ⎝ 2i ⎠ −1 + i
By construction, C
C
C
C
C
C
Ae1 = (2 − i)e1 + e2 ,
C
C
C
C
Ae2 = (2 − i)e2 ,
Ae3 = (2 + i)e3 + e4 ,
Ae4 = (2 + i)e4 .
Therefore, with respect to the basis C
C
C
C
BC := {e1 , e2 , e3 , e4 },
30
Chapter 1. The Jordan Theorem
the associated matrix to A equals its complex Jordan form ⎞ ⎛ 2−i 0 0 0 ⎜ 1 2−i 0 0 ⎟ ⎟ ⎜ JC := ⎜ ⎟ = PC−1 APC ⎝ 0 0 2+i 0 ⎠ 0 0 1 2+i where PC is the matrix of change of basis ⎛ 2 −1 − i ⎜ 0 −1 − i ⎜ PC := ⎜ ⎝ 2i −2i 1 + i −1 − i
⎞ 2 −1 + i 0 −1 + i⎟ ⎟ ⎟. −2i 2i ⎠ 1 − i −1 + i
(1.37)
(1.38)
1.5.2 The real Jordan form of A The real Jordan form is obtained by considering the new basis R
R
R
R
BR := {e1 , e2 , e3 , e4 }, where
⎛ ⎞ 2 ⎜ ⎟ R C ⎜0⎟ e1 := Re e1 = ⎜ ⎟ , ⎝0⎠ 1 ⎛ ⎞ −1 ⎜ ⎟ R C ⎜−1⎟ e3 := Re e2 = ⎜ ⎟ , ⎝0⎠ −1
Since
R
Ae1 R Ae2 R Ae3 R Ae4
⎛ ⎞ 0 ⎜ ⎟ R C ⎜0⎟ e2 := Im e1 = ⎜ ⎟ , ⎝2⎠ 1 ⎛ ⎞ −1 ⎜ ⎟ R C ⎜−1⎟ e4 := Im e2 = ⎜ ⎟ . ⎝−2⎠ −1 R
R
R
= 2e1 + e2 + e3 , R R R = −e1 + 2e2 + e4 , R R = 2e3 + e4 , R R = −e3 + 2e4 ,
the real Jordan form of A is given through ⎛ ⎞ 2 −1 0 0 ⎜1 2 0 0 ⎟ ⎜ ⎟ JR = ⎜ ⎟ = PR−1 APR , ⎝1 0 2 −1⎠ 0
1
1
2
(1.39)
1.6. Exercises
31
where
⎛
2 ⎜0 ⎜ PR = ⎜ ⎝0 1
0 0 2 1
−1 −1 0 −1
⎞ −1 −1⎟ ⎟ ⎟. −2⎠
(1.40)
−1
1.6 Exercises 1. Determine the Jordan canonical forms (both complex and real) of each of the following real matrices: 1 2 −1 −1 1 −1 −1 2 3 4 , , , , , −5 −1 2 −1 5 −3 −7 8 −1 7 ⎛
10 ⎜ ⎝ 5 −9
4 3 −4
⎞ ⎛ 13 1 ⎟ ⎜ 7 ⎠ , ⎝1 −12 2 ⎛
0 ⎜ ⎝1 1 2.
1 0 1
1 2 1
⎞ ⎛ 2 1 ⎟ ⎜ 1⎠ , ⎝ 2 1 −3
⎞ ⎛ 1 3 ⎟ ⎜ 1⎠ , ⎝ 2 0 4
2 0 2
⎞ ⎛ 1 1 5 −3 ⎟ ⎜ 1 −1⎠ , ⎝ 8 −5 2 4 −4 3 ⎞ ⎛ ⎞ 1 1 1 1 4 ⎜ 2 2 2 2⎟ ⎟ ⎟ ⎜ 2⎠ , ⎜ ⎟. ⎝ 3 3 3 3⎠ 3 4 4 4 4
⎞ −2 ⎟ −4⎠ , 3
Let A be a square matrix such that σ(A) = {α, β, γ} and dim N [(A − αI)2 ] = 3,
dim N [A − βI] = 3,
dim N [(A − βI) ] = 4,
dim N [(A − βI)3 ] = 5,
dim N [(A − βI)4 ] = 5,
dim N [A − γI] = 2,
dim N [(A − γI)2 ] = 3,
dim N [(A − γI)3 ] = 3.
dim N [A − αI] = 3, 2
Determine its order and its Jordan canonical form. 3. Given A ∈ MN (C), the adjoint of A, denoted by A∗ , is defined as the conjugate matrix of the transposed matrix of A, that is, ¯T . A∗ := A The matrix A ∈ MN (C) is said to be Hermitian if A = A∗ . Let ·, · be the skew-linear product in CN , N uj v¯j , u, v = j=1
for each u, v ∈ C with u = (u1 , . . . , uN ) and v = (v1 , . . . , vN ). Prove the following: • The matrix A is Hermitian if and only if N
Au, v = u, Av
for each
u, v ∈ CN .
• The spectrum of every Hermitian matrix consists of real semisimple eigenvalues.
32
Chapter 1. The Jordan Theorem • Every Hermitian matrix is diagonalizable. • The eigenvectors associated with different eigenvalues of a Hermitian matrix must be orthogonal. By orthogonal vectors it is meant that their skew-linear product equals zero. • The matrix P of the change of basis from any Hermitian matrix to its Jordan canonical form can be chosen to satisfy P ∗ P = I. Such matrices P are said to be orthogonal.
4. Suppose Ω ⊂ R is an open interval containing zero, k ≥ 1 is an integer number, and aij ∈ C k (Ω, C) for each i, j ∈ {1, . . . , N }. Consider, for each s ∈ Ω, the matrix A(s) = (aij (s))1≤i,j≤N ∈ MN (C). Suppose λ0 ∈ C is a simple eigenvalue of A0 := A(0) and ϕ0 ∈ N [A0 − λ0 I] \ {0}. We ask the following: • Check that
CN = N [A0 − λ0 I] ⊕ R[A0 − λ0 I].
• Given a linear subspace Y ⊂ CN such that CN = N [A0 − λ0 I] ⊕ Y, use the implicit function theorem to prove that there exist a real number δ > 0 and two unique functions Λ ∈ C k ((−δ, δ), C) and Φ ∈ C k ((−δ, δ), Y ) such that Λ(0) = λ0 ,
Φ(0) = ϕ0 ,
and for all s ∈ (−δ, δ), Φ(s) − ϕ0 ∈ Y,
A(s)Φ(s) = Λ(s)Φ(s).
• Calculate the jth derivative of Λ at 0 for each 1 ≤ j ≤ k, and prove that Λ (0) = 0 if and only if A (0)ϕ0 ∈ R[A0 − λ0 I]. 5. Suppose Ω ⊂ R is an open interval containing zero, aij ∈ C(Ω, C) for each i, j ∈ {1, . . . , N }, and consider the matrices A(s) = (aij (s))1≤i,j≤N ∈ MN (C),
s ∈ Ω.
Suppose σ(A(0)) = {λ1 , . . . , λp }, and let L :=
min
1≤i<j≤N
{|λi − λj |} > 0.
Use a celebrated theorem on complex variable theory to prove that for each R ∈ (0, L) there exists δ > 0 with (−δ, δ) ⊂ Ω such that for every s ∈ (−δ, δ) and 1 ≤ j ≤ p the matrix A(s) has exactly ma (λj ) eigenvalues in the open disk of radius R centered at λj , counting according to their algebraic multiplicities.
1.6. Exercises 6.
33
Let A = (aij )1≤i,j≤N ∈ MN (C).
Prove that there exists a sequence {An }n∈N of matrices An = (an ij )1≤i,j≤N ∈ MN (C),
n ≥ 1,
such that, for each n ∈ N, all the eigenvalues of An are simple, and lim an ij = aij
n→∞
for all
i, j ∈ {1, . . . , N }.
7. Let α ∈ C \ {0} and A ∈ MN (C) be such that σ(A) = {λ1 , . . . , λp }. Construct a basis in CN so that the associated matrix of A is block-diagonal with blocks of order n of the form ⎛ ⎞ λj 0 0 ··· 0 0 ⎜α λ 0 ··· 0 0⎟ j ⎜ ⎟ ⎜ ⎟ ⎜0 ⎟ · · · 0 0 α λ j ⎜ ⎟ ⎜. ⎟, . . . . . ⎜ .. .. .. .. .. .. ⎟ ⎜ ⎟ ⎜ ⎟ ⎝0 0 0 · · · λj 0 ⎠ 0
0
0
···
α
λj
where 1 ≤ n ≤ ν(λj ) and 1 ≤ j ≤ p. 8. Prove that for each invertible matrix A ∈ MN (C) there exists a polynomial P such that P (A)2 = A. Prove also that for all B ∈ M2 (C) and every polynomial Q, 0 0 Q(B) = . 1 0 9. 10.
Let A ∈ MN (C) be with ν(0) ≥ 2. Prove that B 2 = A if B ∈ MN (C). For any matrix A = (aij )1≤i,j≤N ∈ MN (C),
the trace of A, hereafter denoted by tr A, is defined through tr A :=
N
ajj .
j=1
Prove the validity of the following assertions: • For each B ∈ MN (C), tr(AB) = tr(BA). • Two similar matrices have the same trace. • Let λ1 , . . . , λN be the eigenvalues of A, where each eigenvalue is repeated according to its multiplicity. Then, tr A =
N j=1
λj
and
det A =
N j=1
λj .
34 11.
Chapter 1. The Jordan Theorem Let A ∈ MN (R) be a diagonal matrix such that (A + I)2 = 0.
Determine its Jordan canonical form. 12.
Determine all matrices A ∈ M3 (C) satisfying the equation A3 − 2A2 + A = 0.
13.
Let A ∈ MN (C) be such that σ(A) = {α, β},
ν(α) = 2,
ν(β) = 1.
Construct a polynomial P such that P (A) = 0. 14. Let A ∈ MN (C) be a Hermitian matrix (see Exercise 3). The Rayleigh quotient of A is the mapping R : CN \ {0} → C defined by R(u) :=
Au, u , u, u
u ∈ CN \ {0},
where ·, · is the skew-linear product of CN . Let λ1 ≤ λ2 ≤ · · · ≤ λN be the eigenvalues of A, where each eigenvalue is repeated according to its algebraic multiplicity. Thanks to the result of Exercise 3, we already know that there exist N eigenvectors 1 ≤ j ≤ N, pj ∈ N [A − λj I], such that the basis {p1 , . . . , pN } is orthonormal in (CN , ·, ·), that is, pi , pj = δij
1 ≤ i, j ≤ N.
for all
For each 1 ≤ k ≤ N set Vk := span[p1 , . . . , pk ], and let Gk denote the set of vector subspaces of CN of dimension k. Finally, define V0 := {0} and G0 := {V0 }. Prove the following properties: • For each 1 ≤ k ≤ N , λk = R(pk ) = max R(u). u∈Vk \{0}
• For each 1 ≤ k ≤ N , λk =
min
⊥ \{0} u∈Vk−1
R(u),
where, given a linear subspace V , we define by V ⊥ the orthogonal subspace of V with respect to the skew-linear product ·, ·, that is to say, V ⊥ := {u ∈ CN : u, v = 0 for each v ∈ V }.
1.7. Comments on Chapter 1
35
• For each 1 ≤ k ≤ N , λk = min
max R(u) = max
V ∈Gk u∈V \{0}
• 15.
min
V ∈Gk−1 u∈V ⊥ \{0}
R(u).
R(u) : u ∈ CN \ {0} = [λ1 , λN ].
A Hermitian matrix A ∈ MN (C) is said to be positive if Au, u ≥ 0
for each
u ∈ CN .
Prove that A is positive if and only if λ ≥ 0 for all λ ∈ σ(A). 16.
A Hermitian matrix A ∈ MN (C) is said to be positive definite if Au, u > 0
for each
u ∈ CN \ {0}.
Prove that A is positive definite if and only if λ > 0 for all λ ∈ σ(A). 17. Let A ∈ MN (C) be invertible, and consider its characteristic polynomial PA . Prove that the characteristic polynomial PA−1 of A−1 satisfies PA−1 (z) =
1 (−z)n PA (z −1 ), det A
z ∈ C \ {0}.
1.7 Comments on Chapter 1 The material of this chapter is standard and can be found in most advanced textbooks on linear algebra. Classic books covering most of the material are Jacobson [63], Burton [17], Hirsch & Smale [59], Blyth & Robertson [13], Lang [76], and Lax [77]. In addition, Gantmacher [39] is an outstanding book in matrix theory covering both theory and applications; it counts among the most paradigmatic books in matrix theory of the 20th Century. There are a number of different approaches to the proof of the Jordan theorem, of course. In this chapter we have followed the one based on polynomial interpolation, which is based on the text-book L´ opez-G´omez [83], and was inspired by Guzm´ an [55]. An interesting approach to the Jordan theorem with emphasis on invariant subspaces can be found in Gohberg, Lancaster & Rodman [51]. Exercise 4 establishes a classic very celebrated result on perturbation from simple eigenvalues, and Exercise 5 establishes the continuous dependence of the spectrum. Both are pivotal results in the theory of perturbation of linear operators. The review paper by Gohberg & Kre˘ın [45] and the comprehensive book by Kato [65] are two of the most paradigmatic references on these topics; for a different perspective, see the book by Gohberg, Lancaster & Rodman [51]. Exercise 14 establishes the classic Courant–Fischer theorem. It plays a crucial role in the spectral theory of self-adjoint (or Hermitian) operators, and, in particular, in classic potential theory.
Chapter 2
Operator Calculus In Section 1.2 we defined P (A) when P is a polynomial and A ∈ MN (K) with K ∈ {R, C}. More generally, one of the main goals of operator calculus consists in giving an appropriate definition of f (A) when f : K → K is an arbitrary function, as well as in studying the most important analytical properties of f (A). This chapter covers these issues for the special, but important, case when f is a certain holomorphic function and A ∈ MN (C). This chapter begins by introducing the concept of norm of a linear operator, which will be very useful to get norm estimates for linear operators. Then, it will describe the construction of f (A) for the special case when f is holomorphic at zero and the square matrix A has sufficiently small norm. As in the case when f is a polynomial, f (A) can be defined as the matrix obtained by substituting the variable z by A in the Taylor series of f (z) at z = 0. As a paradigmatic example, for each A ∈ MN (C) the exponential of the matrix A can be defined through eA :=
∞ An . n! n=0
Then, we will obtain the Dunford integral formula, which is an extension of the Cauchy integral formula to the class of matrix-valued holomorphic functions. To obtain the Dunford integral formula we will have to study some fundamental properties of the resolvent operator R(z; A) := (zI − A)−1 ,
z ∈ C \ σ(A),
of a matrix A ∈ MN (C). Finally, we will determine the exponential of A through its Jordan canonical form. More precisely, Section 2.1 introduces the concept of norm equivalence, and proves that all norms in a finite-dimensional space are equivalent. It also presents the subordinated operator norm and establishes some of its main properties. Section 2.2 defines f (A) for holomorphic functions f at the origin, and matrices A
38
Chapter 2. Operator Calculus
with sufficiently small norm. This section provides the basic elements of operator calculus. Section 2.3 studies the properties of the resolvent operator and introduces the Dunford integral formula. Section 2.4 shows that, under the previous assumptions, σ (f (A)) = f (σ(A)) . Finally, Section 2.5 provides the algorithms to determine eA from the Jordan canonical form of A.
2.1 Norm of a linear operator Suppose K ∈ {R, C}. Then, the space MN (K) of the square matrices of order N 2 with coefficients in K is isomorphic to KN and, hence, it can be equipped with the 2 structure of Banach space from any norm of KN . For example, for each p ∈ [1, ∞) we can consider the norm · p defined by ⎞1/p ⎛ N N p |aij | ⎠ , A p := ⎝
A ∈ MN (K),
i=1 j=1
or the norm · ∞ defined by A ∞ := max {|aij |} , 1≤i,j≤N
A ∈ MN (K).
But none of these norms can be comfortably handled when the matrices are considered as endomorphisms of KN and, consequently, we ought to introduce a specific norm for linear operators. Since every norm defines a topology, we need to ascertain whether or not two norms define the same topology. Definition 2.1.1. Two norms of a vector space U are said to be equivalent if they induce in U the same topology. The next result provides a necessary and sufficient condition for two norms to be equivalent. Lemma 2.1.2. Let · and · be two norms of the vector space U . Then, they are equivalent if and only if there exist constants α, β > 0 such that α u ≤ u ≤ β u
for each
u ∈ U.
Proof. Let u0 ∈ U and r > 0. If there exist α, β > 0 satisfying (2.1), then {u ∈ U : u − u0 < r/β} ⊂ {u ∈ U : u − u0 < r} ⊂ {u ∈ U : u − u0 < r/α}, and, hence, the norms · and · induce the same topology in U .
(2.1)
2.1. Norm of a linear operator
39
Reciprocally, if the two induced topologies coincide, then the unit ball {u ∈ U : u < 1} is open in the normed vector space (U, · ), and, therefore, there exists m > 0 such that {u ∈ U : u < m} ⊂ {u ∈ U : u < 1}. By symmetry, there exists M > 0 such that {u ∈ U : u < M } ⊂ {u ∈ U : u < 1}.
From these inclusions, (2.1) can be easily obtained.
From the topological point of view, it is inessential to consider one norm or another if U is finite dimensional, since the next result establishes that, for each integer d ≥ 1, all norms in Kd are equivalent; in other words, Kd possesses a unique topology of normed vector space. The key property for this result to hold is the compactness of the unit ball in any finite-dimensional space. It is well known that every closed and bounded set in K is compact. Also, the space Kd is equipped with the product topology, which coincides with the topology induced by · ∞ . Moreover, the product of compact sets is compact. Consequently, every closed and bounded set of Kd equipped with the · ∞ -topology is compact. Theorem 2.1.3. For every d ≥ 1, all norms of Kd are equivalent. Proof. It suffices to prove that the norm · ∞ defined by u ∞ := max |uj |,
u = (u1 , . . . , ud ) ∈ Kd ,
1≤j≤d
is equivalent to every norm of Kd . So let · be a norm in Kd , and let e1 , . . . , ed denote the vectors of the canonical basis of Kd . Then, u =
d
u j ej ≤
j=1
d
uj ej =
j=1
d
|uj | · ej ≤ u ∞
j=1
d
ej .
j=1
In particular, the function · : (Kd , · ∞ ) → [0, ∞)
(2.2)
is continuous. The boundary ∂B1 := {u ∈ Kd : u ∞ = 1} of the unit ball, being closed and bounded, is compact in (Kd , · ∞ ). As the function (2.2) is continuous and ∂B1 is compact, there exists u∗ ∈ ∂B1 such that u ≥ u∗
for each u ∈ ∂B1 .
40
Chapter 2. Operator Calculus
Therefore, for each u ∈ Kd , u ≥ u∗ · u ∞ . By Lemma 2.1.2, the norms · and · ∞ are equivalent.
According to Theorem 2.1.3, there is a unique topological structure of finitedimensional Banach space. Now, fixing an integer N ≥ 1 and an arbitrary norm · KN in KN , we define, for each A ∈ MN (K), A L(KN ) := sup Au KN : u ∈ KN , u KN = 1 . (2.3) As every linear operator in KN is continuous, and the boundary of the unit ball is a compact subset of KN , the supremum of (2.3) is attained, and the magnitude A L(KN ) is finite. The number A L(KN ) is called the norm of the operator A subordinated to the norm · KN . The function MN (K) A
→ [0, ∞) → A L(KN )
is called the operator norm subordinated to · KN . The following result establishes its main properties. Lemma 2.1.4. Let · KN be a norm in KN . Then, the map · L(KN ) : MN (K) → [0, ∞) defined by (2.3) is a norm. Moreover, for each u ∈ KN and A ∈ MN (K), Au KN ≤ A L(KN ) u KN
(2.4)
and, hence, for each A, B ∈ MN (K), AB L(KN ) ≤ A L(KN ) B L(KN ) .
(2.5)
Therefore, for each A ∈ MN (K) and n ∈ N, the following estimate holds, An L(KN ) ≤ A nL(KN ) .
(2.6)
Proof. Pick A ∈ MN (K). By definition, A L(KN ) ≥ 0. Moreover, if A L(KN ) = 0, then Au KN = 0 for each u ∈ KN with u KN = 1 and, hence, A is zero over any basis, whence A = 0. For each λ ∈ K and u ∈ KN with u KN = 1, one has that λAu KN = |λ| · Au KN
2.2. Introduction to operator calculus
41
and, therefore, λA L(KN ) = |λ| · A L(KN ) . Finally, for each B ∈ MN (KN ) and u ∈ KN with u KN = 1, the following estimates hold, (A + B)u KN ≤ Au KN + Bu KN ≤ A L(KN ) + B L(KN ) , and, hence, A + B L(KN ) ≤ A L(KN ) + B L(KN ) . This shows that (2.3) indeed is a norm in MN (K). Now we check (2.4). Obviously, (2.4) is satisfied at u = 0. Suppose u = 0. Then, Au KN u = A N ≤ A L(KN ) , u KN u KN K whence (2.4). Finally, we will verify (2.5). By (2.4), for each u ∈ KN with u KN = 1, we have that ABu KN ≤ A L(KN ) Bu KN ≤ A L(KN ) B L(KN ) . This implies (2.5); inequality (2.6) is an immediate consequence of (2.5).
Lemma 2.1.4 and Theorem 2.1.3 prove that (2.3) equips MN (K) with its unique structure of normed space; actually, by Exercise 1, of Banach space. Property (2.6) is the main reason for having introduced the norm (2.3).
2.2 Introduction to operator calculus The next result explains how to generate operators from holomorphic functions at the origin. From now on, we will work in the complex field, so we make the choice K = C. The set DR stands for the open disk in C of radius R and center 0. Also, for any open subset Ω ⊂ C, the set H(Ω) denotes the space of holomorphic functions from Ω to C. Throughout the remaining of this chapter, we consider fixed a norm · CN of CN , and its associated subordinated operator norm · L(CN ) . When no ambiguity can arise, we will simply write · to denote either norm. Theorem 2.2.1. Let R > 0. Consider a function f ∈ H(DR ) and a matrix A ∈ MN (C) satisfying A L(CN ) < R. Then the series
∞ f j) (0) j=0
j!
Aj
(2.7)
42
Chapter 2. Operator Calculus
converges absolutely in L(CN ) to a matrix that will be denoted by f (A). Moreover, for any invertible matrix P ∈ MN (C), one has that f (P −1 AP ) = P −1 f (A)P.
(2.8)
Proof. Since A < R and f ∈ H(DR ), by (2.6) and the Cauchy estimates, it is apparent that ∞ ∞ |f j) (0)| j f j) (0) j A ≤ R < ∞. j! j! j=0 j=0 From the convergence of these series, it is easy to see that the sequence of partial sums n f j) (0) j Sn := A ∈ MN (C), n ≥ 1, j! j=0 is a Cauchy sequence in MN (C). By completeness, the limit f (A) := lim Sn n→∞
is well defined and, in fact, the series (2.7) converges absolutely to f (A). Now, suppose B = P −1 AP. Then, a straightforward induction argument shows that B j = P −1 Aj P,
j ≥ 0.
Consequently, for each n ≥ 1, n f j) (0) j=0
j!
B j = P −1
n f j) (0) j=0
j!
Aj P
and, taking limits as n → ∞, we conclude (2.8).
Property (2.8) is crucial from the point of view of the applications, since it establishes that in order to determine f (A) it suffices to determine f (J), where J is the Jordan canonical form of A. In general, calculating f (J) tends to be substantially easier than calculating f (A). In the next definition, we recall the concept of vector-valued holomorphic function. Definition 2.2.2. Consider an open set Ω ⊂ C, an integer d ≥ 1 and a function F : Ω → Cd . It is said that F is holomorphic in Ω when lim
w→z
F (w) − F (z) w−z
2.2. Introduction to operator calculus
43
exists in Cd for each z ∈ Ω. In such a case, this limit is denoted by F (z), and called the derivative of F at z. The set of holomorphic functions from Ω to Cd will be hereafter denoted by H(Ω, Cd ). By expressing F through its components F := (F1 , . . . , Fd ), it is apparent F ∈ H(Ω, Cd ) if and only if Fj ∈ H(Ω) for each j ∈ {1, . . . , d}. Moreover, in such a case, F = (F1 , . . . , Fd ). From this feature, it is easy to see that all algebraic properties of C-valued holomorphic functions remain true for vector-valued holomorphic functions. For instance, the derivative of a sum equals the sum of the derivatives, and the product formula for the derivative of a product of a scalar-valued function by a vector-valued function holds. More importantly, defining the path integral of a continuous vectorvalued function as the vector formed by the integrals of each of the components of the function, makes the Cauchy integral formula remain valid for vector-valued functions. The proof of the following elementary lemma is proposed in Exercise 4. Lemma 2.2.3. Suppose α, β are two distinct complex numbers, and n ≥ 2 is an integer. Then αn − β n − nβ n−1 = (α − β) kβ k−1 αn−k−1 . α−β n−1
k=1
Lemma 2.2.3 will provide us with a proof of a special, but important, case of the chain rule. Although there are more general versions of the chain rule, the next one suffices for the purposes of this book. Theorem 2.2.4. Suppose R > 0, consider f ∈ H(DR ) and A ∈ MN (C), and set ρ := R/ A L(CN ) . Then, the matrix-valued function F : Dρ → MN (C) defined by F (z) := f (zA),
z ∈ Dρ ,
is holomorphic in Dρ and F (z) = Af (zA),
z ∈ Dρ .
Proof. Throughout this proof, we denote an :=
f n) (0) , n!
n ≥ 0,
44
Chapter 2. Operator Calculus
and fix z ∈ Dρ . Let ε > 0 be such that (1 + ε)|z| < ρ. By Theorem 2.2.1 and our choice of ρ, both f (zA) and f (zA) are well defined. By definition, for each h ∼ 0 with h = 0, we have that . / ∞ (z + h)n − z n F (z + h) − F (z) − Af (zA) = − nz n−1 An . an h h n=2 Moreover, due to Lemma 2.2.3, (z + h)n − z n − nz n−1 = h kz k−1 (z + h)n−k−1 h n−1
k=1
for each n ≥ 2 and, hence, ∞ n−1 F (z + h) − F (z) − Af (zA) = h an kz k−1 (z + h)n−k−1 An . h n=2
(2.9)
k=1
¯ ε|z| the following inequalities hold, On the other hand, for all h ∈ D |
n−1
kz k−1 (z + h)n−k−1 | ≤
k=1
n−1
k|z|k−1 (|z| + |h|)n−k−1
k=1
≤
n−1
k(|z| + |h|)n−2 ≤ n2 [(1 + ε)|z|]n−2
k=1
and, hence, for each n ≥ 2, an
n−1
kz k−1 (z + h)n−k−1 An L(CN ) ≤ |an |n2 [(1 + ε)|z|]n−2 A nL(CN ) .
(2.10)
k=1
Moreover, by the Cauchy estimates, we get 1/n (1 + ε)|z| lim sup |an |n2 [(1 + ε)|z|]n−2 A nL(CN ) A L(CN ) ≤ R n→∞ ρ < A L(CN ) = 1. R Therefore, by (2.10) and the root test for the convergence of series, it is apparent that the matrix series of the right-hand side of (2.9) is convergent and that, actu¯ ε|z| . Finally, taking limits as h → 0 in ally, its sum is uniformly bounded for h ∈ D (2.9) completes the proof.
2.3. Resolvent operator. Dunford’s integral formula
45
The following property provides us with the series of the product of the matrix functions generated through Theorem 2.2.1 by means of the Cauchy product of the corresponding matrix series. Lemma 2.2.5. Suppose R > 0, take f, g ∈ H(DR ) and let A, B ∈ MN (C) satisfy B L(CN ) < R.
A L(CN ) < R, Then f (A)g(B) =
∞ n f n−j) (0) g j) (0) n=0 j=0
(n − j)!
j!
An−j B j .
Proof. Clearly, for each z, w ∈ DR one has that f (z)g(w) =
∞ n f n−j) (0) g j) (0) n=0 j=0
(n − j)!
j!
wj .
Consequently, arguing as is the proof of Theorem 2.2.1, one can easily complete all technical details of the proof.
2.3 Resolvent operator. Dunford’s integral formula In this section we will obtain a generalized version of the Cauchy integral formula valid for matrix-valued functions; namely, the Dunford integral formula. We begin by introducing the concept of resolvent and by studying some of its main properties. Definition 2.3.1. Let A ∈ MN (C). The resolvent set of A, denoted by (A), is defined as the complement of the spectrum of A in C, (A) := C \ σ(A). The resolvent operator of A is the matrix function R(·; A) defined by R(z; A) := (zI − A)−1 ,
z ∈ (A).
It turns out that, for each z ∈ (A) and v ∈ CN , the vector u := R(z; A)v provides us with the unique solution of the linear system (zI − A)u = v, hence the name of resolvent operator. The following classic result provides a sufficient condition for an operator to be invertible. For each R > 0 and z0 ∈ C, the subset DR (z0 ) ⊂ C denotes the open disk of radius R centered at z0 . We have already defined DR as DR (0).
46
Chapter 2. Operator Calculus
Lemma 2.3.2. Let T ∈ L(CN ) be such that T L(CN ) < 1.
(2.11)
Then I − T is invertible and its inverse is given through the series ∞
(I − T )−1 =
T n.
(2.12)
n=0
Moreover, 1 . 1 − T L(CN )
(I − T )−1 L(CN ) ≤
(2.13)
Proof. The function f : D1 → C defined by f (z) :=
∞ 1 = zn, 1 − z n=0
z ∈ D1 ,
is holomorphic, and, hence, according to Theorem 2.2.1, the matrix f (T ) =
∞
Tj
j=0
is well defined. To prove (2.12) it suffices to show that f (T ) is the inverse of I − T . Indeed, for each n ≥ 1 one has that n
T j (I − T ) = (I − T )
j=0
n
T j = I − T n+1 .
(2.14)
j=0
On the other hand, by (2.6) and (2.11), lim T n+1 = 0.
n→∞
Consequently, passing to the limit as n → ∞ in (2.14) gives f (T )(I − T ) = (I − T )f (T ) = I. Finally, the estimate (2.13) is easily obtained from the next one,
n
T j L(CN ) ≤
j=0
n
T jL(CN ) ,
n ≥ 1,
j=0
by taking limits as n → ∞. The next result, although straightforward, is extremely useful.
2.3. Resolvent operator. Dunford’s integral formula
47
Lemma 2.3.3. For each A ∈ MN (C) and z, w ∈ (A), the following identity holds R(z; A) − R(w; A) = (w − z) R(z; A)R(w; A).
(2.15)
Proof. By definition, R(z; A) = R(z; A)(wI − A)R(w; A) = R(z; A)[(w − z)I + (zI − A)]R(w; A) = (w − z)R(z; A)R(w; A) + R(w; A),
whence (2.15) follows.
Identity (2.15) is usually referred to as the resolvent formula. The next result establishes that the resolvent operator is holomorphic. Theorem 2.3.4. For each A ∈ MN (C) the operator-valued function R(·; A) : (A) → L(CN ) is holomorphic, and its derivative at each z ∈ (A) equals −[R(z; A)]2 . Moreover, R(·; A) admits the following Laurent development at zero: R(z; A) =
∞
1 An , n+1 z n=0
¯ A z ∈ Ω := C \ D , L(CN )
(2.16)
uniformly in compact subsets of Ω. Proof. First, we show the continuity of the resolvent in (A). By (2.15), for each z, w ∈ (A), R(z; A) = [I + (w − z)R(z; A)]R(w; A). ¯ ε (z), Fix z ∈ (A). Then, there exists ε > 0 such that for each w ∈ D (w − z)R(z; A) L(CN ) < 1 and, hence, by Lemma 2.3.2, the operator I+(w−z)R(z; A) is invertible. Therefore, ¯ ε (z) the following identity holds for each w ∈ D R(w; A) = [I + (w − z)R(z; A)]−1 R(z; A). Applying again Lemma 2.3.2 yields [I + (w − z)R(z; A)]−1 =
∞
(z − w)n [R(z; A)]n ,
n=0
(2.17)
48
Chapter 2. Operator Calculus
whence
lim [I + (w − z)R(z; A)]−1 = I.
w→z
Consequently, taking limits in (2.17) gives lim R(w; A) = R(z; A),
w→z
which proves the continuity of the function R(·; A) in (A). Now, its holomorphy is an immediate consequence of (2.15). Indeed, for all z, w ∈ (A) with w = z, we have that R(w; A) − R(z; A) = −R(w; A)R(z; A) w−z and, hence, R(w; A) − R(z; A) lim = −[R(z; A)]2 . w→z w−z Finally, let K be a compact subset of the open set Ω. Then, there exists ε > 0 such that (2.18) |z| > A L(CN ) + ε for each z ∈ K. According to Lemma 2.3.2 applied to z −1 A, it is apparent that, for each z ∈ K, R(z; A) =
∞ A 1 1 (I − )−1 = An . n+1 z z z n=0
Moreover, this series is uniformly convergent in K, because, due to (2.18), we have that, for all n ≥ 1 and z ∈ K, R(z; A) −
n j=0
1
z
∞
1 Aj L(CN ) j+1 z j=n+1 j ∞ A L(CN ) 1 ≤ A L(CN ) + ε j=n+1 A L(CN ) + ε n+1 A L(CN ) 1 = . ε A L(CN ) + ε
Aj L(CN ) = j+1
This concludes the proof.
Note that Theorem 2.3.4 actually proves the convergence of the series (2.16) ¯ ρ as long as to the resolvent operator uniformly in the open unbounded set C \ D ρ > A L(CN ) . Now we introduce some preliminaries for the Dunford integral formula. That formula, besides being a substantial generalization of the Cauchy integral formula, plays a pivotal role in Functional Analysis; very especially, in the spectral theory
2.3. Resolvent operator. Dunford’s integral formula
49
of linear operators. Prior to this, we need to recall some basic concepts about closed path (or contour) integrals. First, we should make precise the class of contours that will be used in the integrals. By definition, a Cauchy contour is the oriented boundary of a Cauchy domain in C. By a Cauchy domain is meant any disjoint union in C of finitely many non-empty open, bounded and connected sets ∆1 , . . . , ∆r such that ∆i ∩ ∆j = ∅,
1 ≤ i < j ≤ r,
and, for each 1 ≤ j ≤ r, the boundary of ∆j consists of finitely many nonintersecting closed rectifiable Jordan curves, each of them C is oriented clockwise or counterclockwise according to whether the points of ∆j near a point of C are outside or inside of C. In such a case, the inner domain of the Cauchy contour γ is defined through r # ∆i . Dγ := i=1
For every non-empty compact subset σ of an open set Ω ⊂ C, there exists a Cauchy contour γ in Ω for which σ ⊂ Dγ . Indeed, construct in the complex plane a grid of congruent hexagons of diameter less than one third of the distance between σ and C \ Ω, and let ∆ be the interior of the union of all closed hexagons of the grid that have non-empty intersection with σ. Clearly, the boundary of ∆ provides us with a Cauchy contour in Ω whose inner domain contains σ. Let d ≥ 1 be an integer number, γ a Cauchy contour, and f : γ → Cd a continuous function component-wise expressed by f = (f1 , . . . , fd ). Then, the integral of f along γ is defined through f (z) dz := f1 (z) dz, . . . , fd (z) dz . γ
γ
γ
Finally, we make precise the version of the Cauchy integral formula that will be subsequently used. Theorem 2.3.5 (Cauchy’s integral formula). Suppose Ω ⊂ C is open, f ∈ H(Ω), ¯ γ ⊂ Ω. Then, and γ is a Cauchy contour whose inner domain Dγ satisfies D f (z) 1 dz for each z0 ∈ Dγ . (2.19) f (z0 ) = 2πi γ z − z0 The following result provides us with a substantial generalization of the Cauchy integral formula (2.19). It establishes that the operator f (A) defined by Theorem 2.2.1 can be represented through a vector-valued contour integral within the spirit of (2.19). The formula, being attributable to Dunford, is usually referred to as the Dunford integral formula. Throughout the remaining of this book, CR stands for the positively oriented boundary of DR , for each R > 0.
50
Chapter 2. Operator Calculus
Theorem 2.3.6. Suppose R > 0, the matrix A ∈ MN (C) satisfies A L(CN ) < R, and f ∈ H(DR ). Let γ be a Cauchy contour in DR whose inner domain contains the spectrum of A. Then 1 f (A) = f (z)R(z; A) dz. (2.20) 2πi γ Proof. For each λ ∈ σ(A) there exists u ∈ CN such that u CN = 1
and Au = λu.
Thus, |λ| = Au CN ≤ A L(CN ) < R and, therefore, ¯ A ⊂ DR . σ(A) ⊂ D L(CN )
(2.21)
Now we consider r satisfying A L(CN ) < r < R. By (2.21), the circle Cr is a Cauchy contour satisfying the hypothesis of the theorem. Moreover, according to Theorem 2.3.4, R(z; A) =
∞ n=0
1 z n+1
An
uniformly in z ∈ Cr .
Therefore, 1 2πi
∞ ∞ 1 f (z) f n) (0) n n A = f (A). f (z)R(z; A) dz = dz A = 2πi Cr z n+1 n! Cr n=0 n=0
This proves (2.20) for the special case when γ = Cr . To complete the proof in the general case, it suffices to note that, according to Theorem 2.3.5, by the definition of holomorphic vector-valued function, f (z)R(z; A) dz = f (z)R(z; A) dz. γ
This concludes the proof.
Cr
Actually, Theorem 2.3.6 shows the consistence of the following concept, which provides us with a substantial and sharp generalization of the corresponding one introduced by Theorem 2.2.1.
2.4. The spectral mapping theorem
51
Definition 2.3.7. Let A ∈ MN (C), and denote by F (A) the family of complex functions of a complex variable that are holomorphic in an open neighborhood (not necessarily connected) of σ(A). Let f ∈ F(A), and Ω ⊂ C be an open set such that σ(A) ⊂ Ω and f ∈ H(Ω). Then, f (A) ∈ MN (C) is the linear operator defined through 1 f (z)R(z; A) dz, f (A) := 2πi ∂∆
(2.22)
where ∆ is a Cauchy domain in Ω such that ¯ ⊂ Ω. σ(A) ⊂ ∆ ⊂ ∆ Remark 2.3.8. By applying Theorem 2.3.5 to every coefficient of the matrix f (z)R(z; A),
z ∈ ∂∆,
it is apparent that the Dunford integral of (2.22) does not depend on the choice of Ω, but exclusively on the function f and on the operator A. Moreover, under the assumptions of Theorem 2.3.6, it turns out that (2.22) equals the operator f (A) as defined through its Taylor series centered at zero, by Theorems 2.2.1 and 2.3.6. It should be remembered that the existence of Cauchy domains ∆ fulfilling the requirements of Definition 2.3.7 has already been established.
2.4 The spectral mapping theorem We begin by establishing a very natural and useful product formula. The notation introduced in Section 2.3 and, in particular, in Definition 2.3.7, will be maintained through this section. Proposition 2.4.1. If A ∈ MN (C) and f, g ∈ F(A), then f g ∈ F(A) and (f g)(A) = f (A)g(A). Proof. Since f g is defined in the intersection of the domains of f and g, and f g is holomorphic therein, necessarily f g ∈ F(A). Let ∆1 and ∆2 be two Cauchy domains such that ¯ 1 ⊂ ∆2 σ(A) ⊂ ∆1 ⊂ ∆ ¯ 2 . Then, by Remark for which f and g are holomorphic in a neighborhood of ∆ 2.3.8, we have that 2 1 f (A)g(A) = f (z)R(z; A) dz g(w)R(w; A) dw 2πi ∂∆1 ∂∆2 2 1 = f (z)g(w)R(z; A)R(w; A) dw dz 2πi ∂∆1 ∂∆2
52
Chapter 2. Operator Calculus
and, hence, using Lemma 2.3.3 gives 2 1 R(z; A) − R(w; A) dw dz f (z)g(w) f (A)g(A) = 2πi w−z ∂∆1 ∂∆2 / . 1 1 g(w) = dw dz f (z)R(z; A) 2πi ∂∆1 2πi ∂∆2 w − z / . 1 1 f (z) − dz dw. g(w)R(w; A) 2πi ∂∆2 2πi ∂∆1 w − z ¯ 1 ⊂ ∆2 , according to Theorem 2.3.5, for each z ∈ ∂∆1 On the other hand, since ∆ and w ∈ ∂∆2 , we have that 1 g(w) 1 f (z) dw = g(z) and dz = 0. 2πi ∂∆2 w − z 2πi ∂∆1 w − z Therefore, inserting these identities in the previous one gives 1 f (A)g(A) = f (z)g(z)R(z; A) dz = (f g)(A), 2πi ∂∆1
as claimed in the statement.
The main result of this section is the following. It describes how the spectrum of a matrix is transformed by holomorphic functions. Theorem 2.4.2 (Spectral mapping theorem). For every A ∈ MN (C) and f ∈ F (A), the following identity of sets is satisfied, σ(f (A)) = f (σ(A)). Proof. Pick λ ∈ σ(A), and let D ⊂ C be an open set containing σ(A) such that f is holomorphic in D. Now, let g denote the auxiliary function defined by if z ∈ D \ {λ}, (f (z) − f (λ))(z − λ)−1 g(z) := f (λ) if z = λ. By the celebrated theorem of Riemann on removable singularities, we obtain that g ∈ H(D). Moreover, by construction, g(z)(z − λ) = f (z) − f (λ),
z ∈ D,
and, hence, owing to Proposition 2.4.1, g(A)(A − λI) = f (A) − f (λ)I. Consequently, since λ ∈ σ(A), det[f (A) − f (λ)I] = det g(A) · det(A − λI) = 0,
2.5. The exponential matrix
53
whence f (λ) ∈ σ(f (A)) and, therefore, f (σ(A)) ⊂ σ(f (A)). Now, suppose λ ∈ / f (σ(A)). Then, there exists an open subset Ω ⊂ C such that σ(A) ⊂ Ω and f (z) = λ for each z ∈ Ω. Consequently, the auxiliary function h defined by h(z) :=
1 , f (z) − λ
z ∈ Ω,
is holomorphic in Ω. According to Proposition 2.4.1, we have that h(A)(f (A) − λI) = I and, in particular, 1 = det h(A) · det[f (A) − λI]. Therefore λ ∈ / σ(f (A)). This ends the proof.
2.5 The exponential matrix Owing to Theorem 2.2.1, for each A ∈ MN (C) we can define the exponential eA of the matrix A through the identity ∞ An . e := n! n=0 A
(2.23)
The following result collects its main properties. Proposition 2.5.1. Let A, B ∈ MN (C). Then, (a) eA L(CN ) ≤ eAL(CN ) . (b) eA+B = eA eB = eB eA if AB = BA. (c) The matrix eA is invertible, e0 = I, and (eA )−1 = e−A . (d) eB = P −1 eA P if B = P −1 AP for some invertible P ∈ MN (C). Proof. For each n ≥ 1 the following is satisfied,
n Aj j=0
j!
L(CN ) ≤
n A j L(CN ) j=0
Taking limits as n → ∞ shows Part (a).
j!
≤ eAL(CN ) .
54
Chapter 2. Operator Calculus
Suppose AB = BA. Then, an easy induction argument proves that (A + B)k =
k k j=0
j
Aj B k−j
for every integer k ≥ 0. Consequently, e
A+B
=
∞ (A + B)k k=0
k!
k ∞ Aj B k−j = . j! (k − j)! j=0 k=0
As the second series is the Cauchy product of the series defining eA and eB , by Lemma 2.2.5, Part (b) follows. The identity e0 = I follows from the definition of the exponential. Moreover, as A commutes with −A, Part (b) yields I = e0 = eA−A = eA e−A = e−A eA and, therefore, e−A is the inverse matrix of eA . This proves Part (c). Finally, Property (d) is a consequence of identity (2.8). In practice, calculating the matrix eA from (2.23) may be extraordinarily involved, unless A is nilpotent or an appropriate basis of CN has been chosen to get an easy algorithm to identify An in terms of A, for each n ≥ 2. Nevertheless, according to Proposition 2.5.1(d), the problem of calculating eA can be reduced to the problem of determining eJ , where J is the Jordan form of A. Consequently, the problem simplifies to the calculation of the exponential of the Jordan blocks, which can be accomplished very easily. Indeed, for A ∈ MN (C), let P be the matrix of the change of basis to its Jordan canonical form J. Then, A = P JP −1 and, hence, by Proposition 2.5.1(d), ezA = P ezJ P −1
for each
z ∈ C.
Remember that the columns of P consist of the generalized eigenvectors constructed in Section 1.3. Moreover, the canonical form J has the form J = diag{J1 , J2 , . . . , J−1 , J } for a certain family of Jordan blocks J1 , . . . , J , each of them having the form Jλ,h (see (1.26)), for some λ ∈ σ(A) and some integer 1 ≤ h ≤ ν(λ). In other
2.5. The exponential matrix
55
words, for each 1 ≤ k ≤ , the block Jk is a square matrix of order h whose main diagonal consists of λ’s, whose subdiagonal consists of 1’s, whereas all remaining coefficients vanish. This has already been discussed in Section 1.3. Multiplying by blocks shows that, for each integer n ≥ 0, n , Jn , J n = diag J1n , J2n , . . . , J−1 and, consequently, for each z ∈ C, ezJ = diag ezJ1 , ezJ2 , . . . , ezJ−1 , ezJ . Fix k ∈ {1, . . . , } and suppose Jk = Jλ,h (see (1.26)), for some λ ∈ σ(A) and 1 ≤ h ≤ ν(λ). Then Jk = J0,h + λIh , where Ih stands for the identity matrix of order h. As the identity commutes with all matrices, by Proposition 2.5.1(b), it follows that ezJk = eλz ezJ0,h ,
z ∈ C.
From now on, given two natural numbers n, k ≥ 1 will denote ⎛ 0 ··· B1 ⎜ B1 ··· ⎜ B2 trng{B1 , B2 , . . . , Bn } := ⎜ .. .. ⎜ .. . ⎝ . . Bn
Bn−1
and B1 , . . . , Bn ∈ Mk (C), we
⎞ 0 ⎟ 0⎟ .. ⎟ ⎟ ∈ Mnk (C). . ⎠ · · · B1
(2.24)
h = 0 that Using this notation (with n = h and k = 1), we find from J0,h
ezJ0,h =
0 1 z h−2 z h−1 zn n z2 J0,h = trng 1, z, , . . . , , n! 2! (h − 2)! (h − 1)! n=0 h−1
and, therefore, 0 1 z 2 λz z h−2 z h−1 e ,..., eλz , eλz . ezJk = trng eλz , z eλz , 2! (h − 2)! (h − 1)! Consequently, the exponential ezA can be determined through a finite algorithm from the Jordan canonical form of A. When A has real coefficients, then so does etA for each t ∈ R, and, in a number of circumstances, it is imperative to determine etA from the real Jordan R canonical form J of A. As we discussed earlier, that problem can be reduced to
56
Chapter 2. Operator Calculus
calculate etJk for each 1 ≤ k ≤ . When Jk is a Jordan block associated with a real eigenvalue of A we can proceed as described above. If α, β ∈ R and R
Jk = Jα+iβ,2 :=
α −β
β , α
then, the calculation of etJk should be carried out as follows. First, decompose
α −β
0 β = α I2 + −β α
β 0
.
Then, according to Proposition 2.5.1(b) and using the definition of the exponential, one obtains cos(βt) − sin(βt)
etJk = eαt
sin(βt) , cos(βt)
because αI2 commutes with all matrices. In general, when ! R " R Jk = Jα+iβ,2h = trng Jα+iβ,2 , I2 , 0, . . . , 0
for some
h ≥ 2,
R
one first decomposes Jα+iβ,2h into the sum of two commuting matrices R
R
Jα+iβ,2h = trng{0, I2 , 0, . . . , 0} + trng{Jα+iβ,2 , 0, 0, . . . , 0}, R
in order to determine etJα+iβ,2h by means of Proposition 2.5.1(b). This shows that 0 R R R etJα+iβ,2h = trng etJα+iβ,2 , t etJα+iβ,2 , . . . , where
R
e
tJα+iβ,2
=e
αt
R th−1 etJα+iβ,2 (h − 1)!
1 ,
cos(βt) sin(βt) . − sin(βt) cos(βt)
2.6 An example In this section we shall determine ezA , for each z ∈ C, where A is the matrix introduced in (1.33). According to (1.37) and Proposition 2.5.1(d) we have that, for every z ∈ C, ezA = PC ezJC PC−1 ,
2.6. An example
57
where JC and PC are the matrices defined in (1.37) and (1.38), respectively. Moreover, owing to the results of Section 2.5, ⎛ ⎜2 z⎝
! ezJC = diag e ⎛ (2−i)z e ⎜ze(2−i)z ⎜ =⎜ ⎝ 0 0
⎛
⎞
−i 1
0 ⎟ ⎠ 2−i 0
e(2−i)z 0 0
⎜2 z⎝
,e 0 0
e(2+i)z ze(2+i)z
⎞
+i 1
0 ⎟ ⎠" 2+i 0 0 0
⎞ ⎟ ⎟ ⎟ ⎠
e(2+i)z
and, therefore, ⎛
⎞ e(2−i)z 0 0 0 ⎜ze(2−i)z e(2−i)z 0 0 ⎟ ⎜ ⎟ −1 ezA = PC ⎜ ⎟P = ⎝ 0 0 ⎠ C 0 e(2+i)z 0 0 ze(2+i)z e(2+i)z ⎛ ⎞ cos z − z sin z z cos z + sin z − sin z −z(cos z − sin z) ⎜ −(z + 1) sin z (z + 1) cos z − sin z −z cos z + (z + 2) sin z ⎟ ⎜ ⎟ e2z ⎜ ⎟ ⎝z(cos z − sin z) z(cos z + sin z) cos z − sin z ⎠ −2(z cos z − sin z) −z sin z z cos z − sin z (1 − z) cos z + (z + 1) sin z for every z ∈ C. Alternatively, it follows from (1.39) that, for every z ∈ C, ⎛
ezA = PR ezJR PR−1 ⎛
e2z cos z ⎜ e2z sin z ⎜ = PR ⎜ 2z ⎝ze cos z ze2z sin z
−e2z sin z e2z cos z −ze2z sin z ze2z cos z
0 0 2z e cos z e2z sin z
cos z − z sin z z cos z + sin z − sin z ⎜ −(z + 1) sin z (z + 1) cos z − sin z ⎜ e2z ⎜ ⎝z(cos z − sin z) z(cos z + sin z) cos z − sin z −z sin z z cos z − sin z where PR is the matrix defined in (1.40).
⎞ 0 ⎟ 0 ⎟ −1 ⎟P = −e2z sin z ⎠ R e2z cos z
⎞ −z(cos z − sin z) −z cos z + (z + 2) sin z ⎟ ⎟ ⎟, ⎠ −2(z cos z − sin z) (1 − z) cos z + (z + 1) sin z
58
Chapter 2. Operator Calculus
2.7 Exercises 1. Prove that every norm of Kd equips it with the structure of Banach space (complete normed space). 2.
Prove that the norm (2.3) satisfies 0
A L(KN ) = max { Au KN : u KN ≤ 1} = max
1
Au KN : u ∈ KN \ {0}
u KN
= min {L ≥ 0 : Au KN ≤ L u KN } for every A ∈ MN (C). 3. Let · and · be two norms in a given vector space U . Consider their subordinated norms · L(U ) and · L(U ) in L(U ), respectively. Show that · and · are equivalent if and only if so are · L(U ) and · L(U ) . 4.
Use induction on n to prove Lemma 2.2.3.
5. Use Lemma 2.3.2 to prove that the set of invertible matrices in MN (K) is open, where K ∈ {R, C}. 6. Calculate etA , for every t ∈ R, where A is each one of the matrices of Exercise 1 of Chapter 1. 7.
Calculate sin A and cos A, where ⎛
0 ⎜1 ⎜ A=⎜ ⎝0 0
8.
Let
⎛
0 0 1 0
0 ⎜ A = ⎝1 0
⎞ 0 0⎟ ⎟ ⎟. 0⎠
0 0 0 1
0 0 1
0 ⎞ 1 ⎟ 0⎠ . 0
Calculate cos A, sin A and eA from the corresponding Taylor series. This is one of the few circumstances where the Jordan form does not simplify the necessary calculations. 9. Let A ∈ MN (C). Prove that for each ε > 0 there exist an invertible matrix P , a diagonal matrix D and a nilpotent matrix R such that P −1 AP = D + R 10.
and
R L(CN ) ≤ ε.
Let A ∈ MN (C) and α, β ∈ R be such that α < Re λ < β
for each
λ ∈ σ(A).
Prove that there exists a basis {e1 , . . . , eN } of CN such that α u 2 ≤ Re Au, u ≤ β u 2
for each
u ∈ CN ,
2.7. Exercises
59
where, for each uj , vj ∈ C and 1 ≤ j ≤ N , we have denoted 2
N j=1
uj ej ,
N
3 vj ej
:=
j=1
N
uj v¯j
and
j=1
N
uj ej :=
j=1
N
1/2 2
|uj |
.
j=1
11. For each A ∈ MN (C), the spectral radius of A, usually denoted by spr A, is the real number defined through spr A := max {|λ| : λ ∈ σ(A)} . Prove the following properties: • spr A ≤ A L(CN ) for every norm · of CN . • For each ε > 0 there exists a norm · of CN such that
A L(CN ) ≤ spr A + ε. • Let S denote the set of norms · L(CN ) of L(CN ) that are subordinated to some norm of CN . Then, spr A = inf A L(CN ) : · L(CN ) ∈ S . 12.
Prove that, for all A ∈ MN (C) and z ∈ C, det ezA = ez tr A .
The concept of trace was given in Exercise 10 of Chapter 1. 13.
Pick R > 0 and f ∈ H(DR ); suppose A ∈ MN (C) satisfies spr A < R.
Use the Jordan canonical form to prove that σ(f (A)) = f (σ(A)) and that, actually, f (λ) is an eigenvalue of f (A) of multiplicity m if λ is an eigenvalue of A of multiplicity m. This result provides us with a sharp version of Theorem 2.4.2, though the proposed proof cannot be adapted to the infinite-dimensional setting. 14.
Let A ∈ MN (C) be an invertible matrix. Prove that A = eL
for some L ∈ MN (C). 15.
Suppose that A ∈ MN (C) and f ∈ F(A) satisfy f −1 (0) ∩ σ(A) = ∅.
Prove that f (A) is invertible.
60
Chapter 2. Operator Calculus
16. Let A ∈ MN (C) and an open set Ω ⊂ C such that σ(A) ⊂ Ω. Prove that there exists ε > 0 such that if B ∈ MN (C) and A − B ≤ ε, then σ(B) ⊂ Ω. 17.
Let A ∈ MN (C) and x ∈ CN . Prove the following: • The function f : C → MN (C) defined by f (z) = ezA for z ∈ C is holomorphic, and f (z) = Af (z) for each z ∈ C. • For each x ∈ CN , the function ϕx : C → CN defined by ϕx (z) = ezA x for z ∈ C provides us with the unique solution in H(C, CN ) of the initial-value problem
u (z) = Au(z), u(0) = x.
z ∈ C,
18. For each 1 ≤ p ≤ ∞ and A ∈ MN (C), let A p denote the norm of A subordinated to the norm · p of CN . Set A = (aij )N i,j=1 ∈ MN (C). The following properties are requested to be proved: N |aij |. • A 1 = max 1≤j≤N
i=1
• A 2 = [spr(AA∗ )]1/2 , where A∗ is the adjoint matrix of A, and spr denotes the spectral radius (see Exercise 3 of Chapter 1 and Exercise 11 above for the definitions, if necessary). • A 2 = spr(A) if A ∈ MN (C) is Hermitian. • A ∞ = max
1≤i≤N
• A 2 ≤
N
|aij |.
j=1
N N
|aij |2
1/2 =
4
tr(AA∗ ) ≤ N A 2 .
i=1 j=1
19.
Let A ∈ MN (CN ). Prove the equivalence of the following four conditions: • lim An = 0. n→∞
• lim An u = 0 for each u ∈ CN . n→∞
• spr A < 1 (see Exercise 11 above, if necessary). • There exists a norm · in CN for which
A L(CN ) < 1, where · L(CN ) is the norm subordinated to · . Conclude that, for every norm · of CN , 1/n
spr A = lim An L(CN ) . n→∞
2.7. Exercises
61
20. Let b ∈ CN and A ∈ MN (C) be such that I − A is invertible, and, for every u0 ∈ C, let {un }n≥0 denote the sequence of iterates defined by un+1 := Aun + b,
n ≥ 0.
Prove the equivalence of the following conditions: • The sequence {un }n≥0 converges for all u0 ∈ C. • For every u0 ∈ C,
lim un = (I − A)−1 b.
n→∞
• spr A < 1. 21.
Let A, B ∈ MN (C) be two Hermitian matrices, and let α1 ≤ · · · ≤ αN
and
β1 ≤ · · · ≤ βN
be their respective systems of eigenvalues, counting according to their multiplicity. Prove that max |αn − βn | ≤ A − B 2 , 1≤n≤N
where · 2 denotes the operator norm subordinated to the norm · 2 in CN . 22.
Let A ∈ MN (C), and consider ω := max{Re λ : λ ∈ σ(A)}.
This exercise suggests two different proofs of the fact that, for every ε > 0, there exists M (ε) > 0 such that
etA L(CN ) ≤ M (ε)e(ω+ε)t
for all
t > 0.
• Choose an appropriate Cauchy contour whose inner domain contains σ(A), and use the Dunford integral formula to prove the result. • Use, instead, the Jordan canonical form. 23. Let A ∈ MN (C) and λ ∈ σ(A). Use Exercise 5 of Chapter 1 to prove the existence of δ > and R > 0 with the property that for every B ∈ MN (C) satisfying A − B ≤ δ, the matrix B has exactly ma (λ) eigenvalues in DR (λ), counting according to their algebraic multiplicities. 24. Show that assertion “The set of matrices whose spectrum consists of simple eigenvalues is dense in MN (C)” is nothing but a re-statement of the main result established by Exercise 6 of Chapter 1.
62
Chapter 2. Operator Calculus
2.8 Comments on Chapter 2 This chapter contains standard material, though not really elementary, which can be found in a number of classic textbooks such as Taylor [122], Gantmacher [39], Dunford & Schwartz [27], Yosida [130], or Gohberg, Goldberg & Kaashoek [43]. Usually, operator calculus is introduced from the very beginning in the infinite-dimensional setting, which makes it difficult to teach it at an undergraduate level. In such a setting, f is a holomorphic function, A is a linear endomorphism of a Banach space, and the main goal is to analyze the properties of f (A). Nevertheless, these general approaches do not differ substantially from the one adopted in this chapter, which goes back to the textbooks of L´ opez-G´omez [83, 84] and can be comfortably taught to undergraduate students. Other finite-dimensional approaches to operator calculus can be found in the books of Gohberg, Lancaster & Rodman [51], and Gantmacher [39]. In the latter, a very detailed and complete description is given. Certainly, operator calculus is a very active field of research. So far, one of the major advances has been carried out for holomorphic functions f . Also well known is the operator calculus for continuous functions f : R → R and for selfadjoint operators A (see, for example, Gohberg, Goldberg & Kaashoek [43]). The analysis of the next chapters will give some answers to these and other related questions in the general case when f ∈ C ∞ (R, R), not necessarily real analytic, and A is a Fredholm operator of index zero, not necessarily selfadjoint. Lemma 2.3.2 is sometimes known as the Banach lemma. The series of (2.12) is called the Neumann series. Exercise 17 is the starting point for the theory of linear differential equations. Classic books on this vast subject are Coddington & Levinson [21], Hartman [57], Hale [56], Arrowsmith & Place [7], and Amann [2], though this list is not exhaustive. Applications of the operator calculus to the theory of linear differential equations, from a viewpoint of matrix theory, can be found in Gantmacher [39]. Exercise 20 presents a paradigmatic iterative scheme for solving linear equations (see Ciarlet [20]). A number of the proposed exercises were borrowed from Guzm´an [55] and L´opez-G´omez [83, 84].
Chapter 3
Spectral Projections This chapter considers A ∈ MN (C) and uses the Dunford integral formula to construct the spectral projections of CN onto N [(A − λI)ν(λ) ] for every λ ∈ σ(A). It also shows that, for each λ ∈ σ(A), the algebraic ascent ν(λ) equals the order of λ as a pole of the associated resolvent operator R(z; A) := (zI − A)−1 ,
z ∈ (A) := C \ σ(A).
(3.1)
Precisely, this chapter is structured as follows. Section 3.1 gives a universal estimate for the norm of the inverse of a matrix in terms of its determinant and its norm. From this estimate it will become apparent that the eigenvalues of A are poles of the resolvent operator (3.1). The necessary analysis to show this feature will be carried out in Section 3.3. Section 3.2 gives a result on Laurent series valid for vector-valued holomorphic functions. Finally, Section 3.4 constructs the spectral projections associated with the direct sum decomposition (1.6), whose validity was established by the Jordan Theorem 1.2.1.
3.1 Estimating the inverse of a matrix From now on, for any integer numbers d, k ≥ 1 and a1 , . . . , ak ∈ Cd , we shall denote by [a1 , . . . , ak ] the matrix with k columns and d rows, whose k columns consist of the ordered column vectors a1 , . . . , ak . The next inequality estimates the norm of the inverse of a matrix in terms of the norm of the matrix and of its determinant.
64
Chapter 3. Spectral Projections
Proposition 3.1.1. Let · be a norm in MN (C). Then there exists a constant γ > 0 such that, for every invertible matrix A ∈ MN (C), A−1 ≤ γ
A N −1 . | det A|
Proof. Pick v ∈ CN , set u := Av, and let a1 , . . . , aN ∈ CN denote the columns of A. Then A = [a1 , . . . , aN ]. Now we consider, for each 1 ≤ j ≤ N , the value bj := det[a1 , . . . , aj−1 , u, aj+1 , . . . , aN ]. By the Cramer rule, for each 1 ≤ j ≤ N , the jth component vj of the vector v satisfies bj . vj = det A Let aj1 , . . . , ajN ∈ C denote the components of aj for 1 ≤ j ≤ N . By definition of determinant, for each 1 ≤ j ≤ N , we have that bj =
(−1)sign σ uσ(j)
N
ai,σ(i) ,
i=1 i=j
σ∈PN
where PN stands for the set of permutations of {1, . . . , N }, and the sign or parity of any σ ∈ PN is denoted by sign σ. Then, for each 1 ≤ j ≤ N , |bj | ≤
σ∈PN
|uσ(j) |
N
−1 |ai,σ(i) | ≤ N ! u ∞ A N ∞ .
i=1 i=j
Therefore, v ∞ ≤ N !
1 −1 u ∞ A N ∞ . | det A|
(3.2)
Take · CN any norm in CN , and let · L(CN ) be its subordinated operator norm. By the equivalence of norms established by Theorem 2.1.3, it follows from (3.2) that there exists a constant γ > 0 such that A−1 u CN ≤ γ
1 −1 u CN A N L(CN ) , | det A|
whence A−1 L(CN ) ≤ γ
1 −1 A N . L(CN ) | det A|
A further application of Theorem 2.1.3 concludes the proof.
3.2. Vector-valued Laurent series
65
3.2 Vector-valued Laurent series The theory of Laurent series is valid not only for complex-valued holomorphic functions, but also for complex vector-valued holomorphic functions. Although the general theory works in more general contexts, this chapter uses exclusively the following special case of it, valid for matrix-valued holomorphic functions on a perforated disk. Theorem 3.2.1. Suppose N ≥ 1 is an integer, and f ∈ H (DR (z0 ) \ {z0 }, MN (C)) for some R > 0 and z0 ∈ C. Then there exists a unique sequence of matrices {Ln }n∈Z in MN (C) such that f (z) =
∞
(z − z0 )n Ln
for each
z ∈ DR (z0 ) \ {z0 },
(3.3)
n=−∞
uniformly for z in compact subsets of DR (z0 ) \ {z0 }. Moreover, 1 1 Ln = f (z) dz 2πi Cr (z0 ) (z − z0 )n+1 for each r ∈ (0, R) and n ∈ Z. The series (3.3) is called the Laurent series of f at z0 , and its coefficient operators Ln , for n ∈ Z, are the Laurent coefficients of f at z0 . Proof. Define Ω := DR (z0 ) \ {z0 }. For each 1 ≤ i, j ≤ N and z ∈ Ω, let fij (z) denote the (i, j)th entry of the matrix f (z); fix such an (i, j). Then fij ∈ H(Ω), and, hence, by the classic Laurent theorem, there exists a unique sequence of complex numbers {Lij n }n∈Z such that fij (z) =
∞
n Lij n (z − z0 )
for each
z ∈ Ω,
n=−∞
uniformly on compact subsets of Ω. Moreover, for each r ∈ (0, R) and n ∈ Z, 1 1 = fij (z) dz. Lij n 2πi Cr (z0 ) (z − z0 )n+1 For each n ∈ Z, let Ln ∈ MN (C) be the matrix whose (i, j)th entry equals Lij n. It is easy to see that the sequence {Ln }n∈Z satisfies all the requirements of the theorem. The uniqueness is an immediate consequence of the uniqueness of the Lij n ’s, once the entries in (3.3) are identified. Now, we can make the following concept precise.
66
Chapter 3. Spectral Projections
Definition 3.2.2 (Pole). Suppose N ≥ 1 is an integer, and f ∈ H (DR (z0 ) \ {z0 }, MN (C)) for some R > 0 and z0 ∈ C. Then, it is said that z0 is a pole of order m ≥ 1 of f when the coefficients Ln , for n ∈ Z, of the Laurent series (3.3) satisfy L−m = 0
for each k ≥ 1.
and L−(m+k) = 0
(3.4)
3.3 The eigenvalues are poles of the resolvent The next result shows that the eigenvalues of any matrix A ∈ MN (C) are poles of its resolvent operator (3.1), and it establishes some important relationships between the underlying Laurent coefficients. It should be remembered that, for any λ ∈ σ(A), we denote by ma (λ) the algebraic multiplicity of λ. Proposition 3.3.1. Consider A ∈ MN (C). Let λ ∈ σ(A) and R > 0 be such that DR (λ) \ {λ} ⊂ (A) = C \ σ(A). Let Ln :=
1 2πi
Cr (λ)
R(z; A) dz, (z − λ)n+1
n ∈ Z,
0 < r < R,
be the Laurent coefficients of R(·; A) at λ, whose existence is guaranteed by Theorems 2.3.4 and 3.2.1. Then L−(n+1) = (A − λI)n L−1 ,
n ≥ 0,
(3.5)
and there exists an integer m = m(λ) with 1 ≤ m(λ) ≤ ma (λ) for which (3.4) and R[L−1 ] ⊂ N [(A − λI)m(λ) ] are satisfied. In particular, λ is a pole of order m(λ) of the resolvent operator R(·; A). Proof. By Proposition 3.1.1, there exists γ > 0 such that R(z; A) ≤ γ
zI − A N −1 | det(zI − A)|
for each z ∈ (A).
(3.6)
As the function z → zI − A ¯ R (λ) is compact, there exists a constant C1 > 0 such is continuous and the set D that ¯ R (λ). γ zI − A N −1 ≤ C1 for each z ∈ D
3.3. The eigenvalues are poles of the resolvent
67
Moreover, since λ is a root of order ma (λ) of the characteristic polynomial z → det(zI − A), there exists a constant C2 > 0 such that | det(zI − A)| ≥ C2 |z − λ|ma (λ)
¯ R (λ). for each z ∈ D 2
Thus, inserting these inequalities in (3.6) shows that there exists a constant C3 > 0 for which R(z; A) ≤
C3 |z − λ|ma (λ)
¯ R (λ) \ {λ}. for each z ∈ D 2
(3.7)
Therefore, for each r ∈ (0, R/2) and k ≥ 1, we find from (3.7) that R(z; A) 1 L−[ma (λ)+k] ≤ dz 2π Cr (λ) |z − λ|−[ma (λ)+k]+1 1 C3 ≤ dz = C3 rk 2π Cr (λ) |z − λ|−k+1 and, consequently, passing to the limit as r 0 shows that L−[ma (λ)+k] = 0 for all k ≥ 1.
(3.8)
Now, we will check that L−n = 0
for some n ∈ {1, . . . , ma (λ)}.
(3.9)
The proof proceeds by contradiction. Suppose (3.9) does not hold. Then, using (3.8) shows that λ is a removable singularity of R(·; A) and lim R(z; A) = L0 .
z→λ
Then 1 = lim det [R(z; A)(zI − A)] = det L0 det(λI − A), z→λ
which shows that λ is not an eigenvalue of A. This contradiction proves (3.9). Obviously, combining (3.8) and (3.9) shows that λ is a pole of order m of the function R(·; A) for some 1 ≤ m ≤ ma (λ). Now, by the definition of R(z; A), Theorem 3.2.1 implies that, for every z ∈ DR (λ) \ {λ}, I = (zI − A)R(z; A) = [(z − λ)I + (λI − A)]
∞ n=−∞
Ln (z − λ)n
68
Chapter 3. Spectral Projections
and, hence, I=
∞
[Ln−1 + (λI − A)Ln ] (z − λ)n .
n=−∞
Therefore, by the uniqueness of the Laurent expansion as a consequence of Theorem 3.2.1, it is apparent that 0 = Ln−1 + (λI − A)Ln
for all n ≤ −1.
By induction, (3.5) is easily obtained. In particular, (A − λI)m L−1 = L−(m+1) = 0, because λ is a pole of order m of R(·; A). Equivalently, R[L−1 ] ⊂ N [(A − λI)m ],
which concludes the proof.
3.4 Spectral projections This section constructs the spectral projections associated with each of the factors of the direct sum decomposition of CN given by (1.6) in the Jordan Theorem 1.2.1. These projections are constructed through the Dunford integrals of the resolvent operator R(z; A) over a series of Cauchy contours surrounding each of the eigenvalues of the matrix, and no other eigenvalue. It should be remembered that δij stands for the Kronecker delta, and that, given a Cauchy contour γ, we are denoting by Dγ its inner domain. Theorem 3.4.1. Let A ∈ MN (C) be with σ(A) = {λ1 , . . . , λp }, and set L :=
min
1≤i<j≤N
|λi − λj | > 0.
Then, the following properties are satisfied: (a) For every Cauchy contour γ such that σ(A) ⊂ Dγ , 1 R(z; A) dz. I= 2πi γ (b) For each 1 ≤ j ≤ p, let Pj be the operator defined by 1 R(z; A) dz, Pj := 2πi Cr (λj )
3.4. Spectral projections
69
where r ∈ (0, L) is arbitrary. Then, p
Pk = I
k=1
and Pi Pj = δij Pj , (c) C
N
=
p
i, j ∈ {1, . . . , p}.
R[Pk ].
k=1
(d) For each 1 ≤ j ≤ p, the ascent ν(λj ) of the eigenvalue λj equals the order of λj as a pole of R(·; A). Moreover, R[Pj ] = N [(A − λj I)ν(λj ) ]. Remark 3.4.2. The operators P1 , . . . , Pp are usually referred to as the spectral projections of the matrix A. According to Theorems 2.3.4 and 3.2.1, for each 1 ≤ j ≤ p, the spectral projection Pj of CN onto N [(A − λj I)ν(λj ) ] equals the operator coefficient L−1 of the Laurent series of R(·; A) at λj . As L−1 is usually referred to as the residue of the resolvent operator at λj , one might re-state the previous theorem by simply saying that the spectral projections of a matrix are the residua of its resolvent operator at each of the eigenvalues of the matrix. Proof. Part (a) is a direct consequence of Theorem 2.3.6 applied to the constant polynomial 1. Now we consider the operators P1 , . . . , Pp defined in Part (b). According to Part (a) and Theorem 2.3.6, it is apparent that p k=1
1 Pk = 2πi
R(z; A) dz = I. γ
Now, fix 0 < ρ ≤ L/2 and, for each 1 ≤ j ≤ p, consider the function fj :
p #
Dρ (λk ) → C
k=1
defined by
fj (z) :=
1 0
if z ∈ Dρ (λj ), 5p if z ∈ k=1 Dρ (λk ) \ Dρ (λj ).
Clearly, fj ∈ F(A) and 1 Pj = fj (z)R(z; A) dz = fj (A), 2πi Cρ (λj )
1 ≤ j ≤ p.
70
Chapter 3. Spectral Projections
In addition, 1 ≤ i, j ≤ p.
fi fj = δij fi ,
Thus, we find from Proposition 2.4.1 that fi fj ∈ F(A) and 1 fi (z)fj (z)R(z; A)dz = δij Pi , 1 ≤ i, j ≤ p, Pi Pj = 2πi γ which concludes the proof of Part (b). So far, we have shown that the operators P1 , . . . , Pp are disjoint projections whose sum equals the identity. In particular, this implies Part (c). Finally, we will prove Part (d). For each 1 ≤ j ≤ p, let mj denote the order of λj as a pole of the resolvent R(·; A). By Proposition 3.3.1 and Remark 3.4.2, we have that 1 ≤ mj ≤ ma (λj ) and R[Pj ] ⊂ N [(λj I − A)mj ],
1 ≤ j ≤ p,
and, hence, R[Pj ] ⊂ N [(A − λj I)mj ] ⊂ N [(A − λj I)ν(λj ) ],
1 ≤ j ≤ p.
(3.10)
On the other hand, by Part (c), the Jordan Theorem 1.2.1 shows that CN =
p
R[Pj ] =
j=1
p
N [(A − λj I)ν(λj ) ].
j=1
Consequently, the inclusions (3.10) must be equalities, and, therefore, according to the definition of algebraic ascent, it is apparent that ν(λj ) = mj
for every 1 ≤ j ≤ p,
which concludes the proof.
3.5 Exercises 1.
Prove that, necessarily, α = N − 1 if there exist γ, α ∈ R satisfying
A−1 ≤ γ
A α | det A|
for all invertible matrices A ∈ MN (C). 2. The purpose of this exercise is to give an alternative proof of Theorem 3.4.1, based on the Jordan canonical form. Let A ∈ MN (C) be with σ(A) = {λ1 , . . . , λp },
3.5. Exercises
71
and let J denote its Jordan canonical form constructed in Section 1.3. It is already known that A = P −1 JP for some invertible matrix P ∈ MN (C), and that J can be expressed in the form J = diag{J1 , . . . , Jp }, where, for each 1 ≤ j ≤ p, Jj = diag{Jj,i1 , . . . , Jj,inj }, with ν(λj ) = max{ih : 1 ≤ h ≤ nj }, and for each natural number n ≥ 1, the matrix Jj,n is a Jordan block of the form (1.26). Prove successively the following: • For each z ∈ (A), R(z; A) = P R(z; J)P −1 ,
R(z; J) = diag{R(z; J1 ), . . . , R(z; Jp )},
and R(z; Jj ) = diag{R(z; Jj,i1 ), . . . , R(z; Jj,inj )} for all 1 ≤ j ≤ p. • For each 1 ≤ k ≤ p and every Cauchy contour γk satisfying γk ∩ σ(A) = ∅
and
σ(A) ∩ Dγk = {λk },
the following identities are satisfied: 1 1 R(z; A) dz = P R(z; J) dz P −1 , 2πi γk 2πi γk 1 2πi
0
R(z; J) dz = diag γk
1 2πi
R(z; J1 ) dz, . . . , γk
1 2πi
1 R(z; Jp ) dz ,
γk
and, for each 1 ≤ j ≤ p, 0 1 1 1 1 R(z; Jj ) dz = diag R(z; Jj,i1 ) dz, . . . , R(z; Jj,inj ) dz . 2πi γk 2πi γk 2πi γk • For each 1 ≤ j ≤ p and 1 ≤ h ≤ nj , " ! R(z; Jj,h ) = trng (z − λj )−1 , . . . , (z − λj )−h . • For each 1 ≤ j, k ≤ p, the matrix 1 2πi
R(z; Jj ) dz γk
is the identity matrix if j = k, and is the zero matrix if j = k. Moreover, p 1 R(z; J) dz = I. 2πi γk k=1
72
Chapter 3. Spectral Projections • For each 1 ≤ k ≤ p define 1 Pˆk = 2πi
R(z; J) dz. γk
Then, Pˆ1 , . . . , Pˆp are mutually disjoint projections whose sum is the identity. Moreover, for each 1 ≤ k ≤ p the ascent ν(λk ) of the eigenvalue λk equals its order as a pole of R(·; J), and R[Pˆk ] = N [(J − λk I)ν(λk ) ]. • For each 1 ≤ k ≤ p define Pk =
1 2πi
R(z; A) dz. γk
Then, P1 , . . . , Pp are mutually disjoint projections whose sum is the identity. Moreover, for each 1 ≤ k ≤ p the ascent ν(λk ) of the eigenvalue λk equals its order as a pole of R(·; A), and R[Pk ] = N [(A − λk I)ν(λk ) ].
3.6 Comments on Chapter 3 Although this chapter contains standard material, its approach differs substantially from the one adopted in classic textbooks, such as Gohberg & Kre˘ın [45], Taylor [122], Dunford & Schwartz [27], Yosida [130], Kato [65], and Gohberg, Goldberg & Kaashoek [43], where the fact that the eigenvalues are poles of the resolvent is proved once the spectral projections are constructed. Actually, in most of the available texts the Jordan theorem is derived from the properties of the spectral projections, and at a later step it is shown that any eigenvalue must be a pole of the resolvent. This chapter has adopted the converse methodology. The use of the elementary Proposition 3.1.1, attributable to Kato [65], to prove from the very beginning that any eigenvalue is a pole of the resolvent, simplifies tremendously the mathematical apparatus required to cover these topics. As a by-product, it facilitates the teaching of these topics at an undergraduate level. Nevertheless, this is not the unique advantage of the approach chosen in this chapter. Indeed, the fact that all spectral properties can be easily obtained from the fact that the eigenvalues are poles of the resolvent suggests that for general one-parameter families of operators L, not necessarily of the special form L(z) = zI − A,
z ∈ K,
most of their local spectral properties at any singular value z0 ∈ K should follow, by some method, by simply imposing the growth condition L(z)−1 ≤
C , |z − z0 |ν
z ∼ z0 , z = z0 ,
3.6. Comments on Chapter 3
73
even if L is not real analytic. This crucial observation is on the foundations of the general abstract theory that is going to be developed in the next chapters. It actually triggered it from the very beginning. In most textbooks it is usual to introduce the spectral projections in the infinite-dimensional setting for the special case when A is compact and, possibly, selfadjoint. Although this introductory chapter has dealt exclusively with the finite-dimensional setting, in Chapter 9 we will generalize these results to cover the general case when L is a one-parameter family of Fredholm operators of index zero. As in Chapters 1 and 2, the approach to this chapter has been based on the books by L´ opez-G´omez [83, 84]. Exercise 2 is based on the finite-dimensional approach to operator calculus given in the book by Gohberg, Lancaster & Rodman [50]. The theory of Laurent series also holds for vector-valued holomorphic functions. In the book by Gohberg, Goldberg & Kaashoek [43] a general way of reasoning to prove results on vector-valued functions from the corresponding ones for scalar-valued functions is explained. Applications of the Laurent series to linear ordinary differential equations, from the point of view of matrix theory, can be found in Gantmacher [39].
Part II
Algebraic Multiplicities
Part II: Summary Banach spaces and linear bounded operators Throughout Part II, we consider the field K ∈ {R, C}, and U, V, W, X, Y . . . will denote non-zero K-Banach spaces. Now we introduce the main classes of linear bounded operators used all through the book. Given two K-Banach spaces U and V , the set L(U, V ) denotes the K-Banach space of the linear bounded operators from U to V , and L(U ) := L(U, U ). As U and V are Banach spaces, they are equipped with norms. Both norms are always denoted by · , as well as the operator norm subordinated to those norms in L(U, V ). For any T ∈ L(U, V ), the sets N [T ] and R[T ] stand for the null space (kernel) and the range (image) of T , respectively, and the rank of T is defined by rank T := dim R[T ]. An operator T ∈ L(U, V ) is said to be a finite rank operator if rank T < ∞. An operator P ∈ L(U ) is said to be a projection if P 2 = P . In such a case, P is said to project U onto R[P ]. An operator T ∈ L(U, V ) is said to be a Fredholm operator when dim N [T ] < ∞ and
codim R[T ] < ∞.
In such a case, R[T ] must be closed. Throughout Part II, we denote by Fred(U, V ) the set of all Fredholm operators in L(U, V ), and Fred(U ) := Fred(U, U ). Moreover, for every T ∈ Fred(U, V ), the index of T is defined through ind T := dim N [T ] − codim R[T ]. The set of Fredholm operators of index zero of L(U, V ) is denoted by Fred0 (U, V ). Consequently, T ∈ Fred0 (U, V ) if and only if T ∈ L(U, V ) and
dim N [T ] = codim R[T ] < ∞.
We also denote Fred0 (U ) := Fred0 (U, U ). The identity operator of U , always denoted by IU , lies in Fred0 (U ), of course. But 0 ∈ / Fred(U, V ) if U or V are infinite dimensional. In most of Part II we will assume that Fred0 (U, V ) = ∅; then U and V must be isomorphic. Therefore, assuming U = V is far from being a serious restriction. In such a case, the most paradigmatic subset of Fred0 (U ) consists of the set of compact perturbations of the identity IU . An operator T ∈ L(U, V ) is said to be compact if the closure T (B) is a compact subset of V for all bounded sets B ⊂ U . We denote by K(U, V ) the subset of L(U, V ) formed by all compact operators. It is well known that IU ∈ K(U ) if and only if dim U < ∞. Another important subset of Fred0 (U, V ) is the set Iso(U, V ) consisting of all the isomorphisms from U to V . As usual, K(U ) := K(U, U ) and Iso(U ) := Iso(U, U ).
Part II: Summary
77
Continuous and smooth maps Throughout Part II, given K ∈ {R, C}, an open subset Ω ⊂ K, and a K-Banach space W , we denote by C(Ω, W ) the set of continuous maps from Ω to W , and, more generally, for each integer r ≥ 1, the set C r (Ω, W ) stands for the subset of C(Ω, W ) of those maps having a continuous rth differential. We also consider 6 C 0 (Ω, W ) := C(Ω, W ), C ∞ (Ω, W ) := C r (Ω, W ), r∈N
and denote by C ω (Ω, W ) the set of analytic maps from Ω to W . It should be noted that if K = C, then C 1 (Ω, W ) = C ω (Ω, W ) = H(Ω, W ), all these sets being the space of holomorphic maps from Ω to W . Finally, C r (Ω) will denote C r (Ω, K), for each r ∈ N ∪ {∞, ω}. Given λ0 ∈ Ω, a map f : Ω \ {λ0 } → W , and k ∈ Z, it is said that f (λ) = o((λ − λ0 )k )
as λ → λ0
if
f (λ) = 0. (λ − λ0 )k When λ0 is clear from the context, it is simply said that lim
λ→λ0
f (λ) = o((λ − λ0 )k ). Given λ0 ∈ Ω, a map f ∈ C r (Ω, W ) for some r ∈ N ∪ {∞}, and an integer 0 ≤ k ≤ r, we will write ordλ0 f := k when f j) (λ0 ) = 0 for all 0 ≤ j < k and f k) (λ0 ) = 0, while ordλ0 f := ∞ if r = ∞ and f (λ0 ) = 0 for all j ≥ 0. The expression ordλ0 f will be read: the order of f at λ0 . We leave ordλ0 f undefined when, for some integer k ≥ 0, the function f is not of class C k+1 in any neighborhood of λ0 , and f j) (λ0 ) exists and equals zero for all 0 ≤ j ≤ k. For the sake of notation in Taylor developments, throughout this part, from its beginning to its end, given λ0 ∈ Ω, a natural number k and f ∈ C k (Ω, W ), we use the notation 1 fk := f k) (λ0 ). k! It should not cause any confusion, because λ0 will always be fixed beforehand. In particular, we will subsequently set j)
f0 := f (λ0 ), if there is no ambiguity. It is important to keep this notation in mind from now on, as it will be used throughout the remainder of the book.
78
Part II: Summary
Operator families and generalized spectrum Throughout Part II, given two K-Banach spaces U, V , and r ∈ N ∪ {∞, ω}, any map L ∈ C r (Ω, L(U, V )) will be referred to as an operator family of class C r in Ω from U to V . They will be ˆ . . . Among them, polynomial operator families will denoted hereafter by L, M, L play a pivotal role. A map Φ ∈ C ω (K, L(U, V )) is said to be a polynomial operator family if there exist d ∈ N and F0 , . . . Fd ∈ L(U, V ) such that Φ(λ) =
d
λj Fj ,
λ ∈ K.
j=0
The set of all polynomial operator families from U to V will be denoted by P[L(U, V )], and P[L(U )] := P[L(U, U )]. Usually, polynomial operator families will be named by Greek capital letters Φ, Ψ, Υ . . . The product of two operator families is defined in the natural way by means of their composition. Precisely, if Ω and Ω are two open subsets of K and L : Ω → L(U, V ),
M : Ω → L(W, U )
are two arbitrary maps, then the product map LM : Ω ∩ Ω → L(W, V ) is defined by LM(λ) := L(λ) ◦ M(λ),
λ ∈ Ω ∩ Ω ,
though, in practice, the composition symbol ◦ will not be written. Given an operator family L ∈ C(Ω, L(U, V )), the point λ0 ∈ Ω is said to be a singular value of L if L0 := L(λ0 ) ∈ / Iso(U, V ), while it is said to be an eigenvalue of L if dim N [L0 ] ≥ 1. The spectrum of L, denoted by Σ(L), is defined as the set of singular values of L, while Eig(L) stands for the set of eigenvalues of L. Obviously, Eig(L) ⊂ Σ(L). Thanks to the open mapping theorem, in the special case when L0 ∈ Fred0 (U, V ), one has that λ0 ∈ Σ(L) if and only if λ0 ∈ Eig(L). Consequently, if L(Ω) ⊂ Fred0 (U, V ), then Σ(L) = Eig(L). Such concepts should not be confused with
Part II: Summary
79
the classic concept of spectrum of the operator L(λ), denoted by σ(L(λ)), for a particular value λ ∈ Ω. By definition, for every T ∈ L(U ), σ(T ) = Σ(LT ), where LT (λ) := λIU − T,
λ ∈ K.
Operations and order in N ∪ {∞, ω} We will sometimes use the sets N ∪ {∞} and N ∪ {∞, ω}; for example, to consider maps of class C r (Ω, W ) for some r belonging to N ∪ {∞} or to N ∪ {∞, ω}. Consequently, it is appropriate to fix the following conventions. The sum, difference and total order in N ∪ {∞} are the usual ones. The sum, difference and partial order in N ∪ {∞, ω} are defined so that N ∪ {∞} preserves them, and, in addition, for all k ∈ N, k + ω = ω, k < ω, ω − k = ω. Also, ω becomes a synonym for ∞ when it is used for labeling sequences, or it indicates cardinality, so that the following expressions have the same meaning: {xn }n∈N ,
{xn }∞ n=0 ,
{xn }ω n=0 .
Main general goal Essentially, classic spectral theory studies holomorphic operator families L ∈ H(C, MN (C)) of the special type L(λ) = λICN − A,
λ ∈ C,
for a given A ∈ MN (C). These are the families already studied in Part I. More generally, the Riesz–Fredholm theory deals with holomorphic families L ∈ H(C, L(U )) of the form L(λ) = λIU − T, λ ∈ C, for a given T ∈ L(U ), where U is a complex Banach space. In particular, it analyzes the concepts of algebraic multiplicity, ascent. . . at any eigenvalue λ0 ∈ σ(T ), and studies their main properties. Part II introduces a generalized concept of algebraic multiplicity at every λ0 ∈ Eig(L) for a general operator family L ∈ C r (Ω, L(U, V )), for some r ∈ N such that L0 ∈ Fred0 (U, V ), and studies its most relevant properties; among them, the product formula (see Chapter 5). Actually, the product formula and a certain normalization condition determine the algebraic multiplicity uniquely (see Chapter 6). As a by-product, we will get an extremely simple axiomatic for all existing
80
Part II: Summary
concepts of algebraic multiplicity available in the specialized literature. According to that axiomatic, it will become apparent that the generalized concept of algebraic multiplicity introduced in Part II indeed extends all classic concepts of algebraic multiplicity. The most significant consequences of the theory developed in this part will be discussed throughout each of the chapters forming it.
Prerequisites The reading of Part II requires more mathematical background than the one necessary for Part I. But not that much, as only the most basic concepts and results of Functional Analysis, such as the Hahn–Banach theorem, are needed. In addition, the knowledge of the most basic features of the theory of (bounded) Fredholm operators is required. The following list collects the main results that will be invoked throughout Part II: If L ∈ Fred0 (U, V ) and T ∈ K(U, V ), then L + T ∈ Fred0 (U, V ). If L ∈ Fred0 (U, V ) and M ∈ Fred0 (W, U ), then LM ∈ Fred0 (W, V ). Fred0 (U, V ) is an open subset of L(U, V ). For each L ∈ Fred0 (U, V ) there exists a finite-rank operator F ∈ L(U, V ) such that L + F ∈ Iso(U, V ). • The Fredholm index defines a continuous map • • • •
T → ind T from Fred(U, V ) to Z. Two good sources for the theory of Fredholm operators are the review paper by Gohberg & Kre˘ın [45] and the comprehensive treatise of Kato [65]. The book of Gohberg, Goldberg & Kaashoek [43] also provides an elementary introduction to that theory. Although the Riesz–Fredholm theory of compact operators and their algebraic multiplicities is useful to understand why the generalized concept of algebraic multiplicity introduced in Part II is indeed a generalization of the classic concept of multiplicity for a compact operator, some of its most significant results will follow in a series of corollaries of the abstract theory developed herein. Consequently, no previous knowledge of it is required. Except in Section 11.3, where certain features about non-bounded operators will be discussed, throughout Part II, by an operator is always meant a linear and bounded operator.
Structure Part II is divided into eight chapters. Chapters 4 and 5 construct two different but equivalent algebraic multiplicities. Chapter 6 gives an axiomatic for the algebraic multiplicity. Chapter 7 characterizes the existence of the local Smith form
Part II: Summary
81
of a family at a singular value. Chapter 8 focuses attention on holomorphic and classical operator families, obtaining the most important results of the classic theory of Riesz–Fredholm. Chapter 9 constructs finite Laurent developments for the inverses of wide classes of non-analytic families, and ascertains some important properties concerning the logarithmic residues. Chapter 10 gives a proof of the spectral theorem for matrix polynomials. Finally, in Chapter 11 we describe some further developments of the algebraic multiplicity to enhance further research in some related areas of great interest.
Chapter 4
Algebraic Multiplicity Through Transversalization Throughout this chapter we will consider K ∈ {R, C}, two K-Banach spaces U and V , an open subset Ω ⊂ K, a point λ0 ∈ Ω, and a family L ∈ C r (Ω, L(U, V )), for some r ∈ N ∪ {∞}, such that L0 := L(λ0 ) ∈ Fred0 (U, V ). When λ0 ∈ Eig(L), the point λ0 is said to be an algebraic eigenvalue of L if there exist δ, C > 0 and m ≥ 1 such that, for each 0 < |λ − λ0 | < δ, the operator L(λ) is an isomorphism and C . L(λ)−1 ≤ |λ − λ0 |m The main goal of this chapter is to introduce the concept of algebraic multiplicity of L at any algebraic eigenvalue λ0 . This algebraic multiplicity will be denoted by χ[L; λ0 ], and will be defined through the auxiliary concept of transversal eigenvalue. Such concept will be motivated in Section 4.1 and will be formally defined in Section 4.2. Essentially, λ0 is a transversal eigenvalue of L when it is an algebraic eigenvalue for which the perturbed eigenvalues a(λ) ∈ σ(L(λ)) from 0 ∈ σ(L0 ), as λ moves from λ0 , can be determined through standard perturbation techniques; these perturbed eigenvalues a(λ) are those satisfying a(λ0 ) = 0. This feature will be clarified in Sections 4.1 and 4.4, where we study the behavior of the eigenvalue a(λ) and its associated eigenvector in the special case when 0 is a simple eigenvalue of L0 . In such a case, the multiplicity of L at λ0 equals the order of the function a at λ0 . Section 4.3 shows that every operator family L satisfying the general requirements of this chapter can be tranversalized through a polynomial
84
Chapter 4. Algebraic Multiplicity Through Transversalization
family Φ ∈ P[L(U, V )] with Φ0 ∈ Iso(U, V ), provided λ0 is an algebraic eigenvalue of L; that means that the product family LΦ is transversal at λ0 . The algebraic multiplicity of L at λ0 is then defined through χ[LΦ; λ0 ]. The consistency of this concept of multiplicity relies upon the fact that it does not depend on the local transversalizing family Φ.
4.1 Motivating the concept of transversality Originally, the interest of the concept of transversality goes back to the fact that transversality makes the resolution of a special class of triangular systems trivial. Although the precise meaning of this claim will not become apparent until Chapters 7 and 9, we consider now a simple example to illustrate it. The deepest significance of the concept of transversal eigenvalue will be revealed later; through, e.g., Proposition 7.1.3 and the results of Section 7.2, where it will be made apparent that, at transversal eigenvalues, the structure of the canonical sets of Jordan chains are themselves canonical. According to Theorem 4.3.2, which establishes the existence of transversalizing isomorphisms at any eigenvalue λ0 , it seems rather superfluous to give non-trivial examples for transversality (see Theorem 5.3.1 as well). Indeed, by Theorem 4.3.2, through the appropriate local change of coordinates at λ0 , any operator family can be transversalized. Suppose we are given a natural number k ≥ 0 and k + 1 operators L0 , . . . , Lk ∈ L(U, V ), and consider the homogeneous linear system j
Li uj−i = 0,
0 ≤ j ≤ k,
(4.1)
i=0
in the unknowns u0 , . . . , uk ∈ U . The next lemma reveals that under a special condition, closely related to the concept of transversality, system (4.1) becomes the uncoupled system Li uj−i = 0,
0 ≤ i ≤ j ≤ k.
Lemma 4.1.1. Let k ∈ N and L0 , . . . , Lk ∈ L(U, V ) be such that the spaces k−1 6
R[L0 ], L1 (N [L0 ]), . . . , Lk (
N [Lj ])
(4.2)
j=0
are in direct sum. Then, (4.1) is satisfied if and only if uj ∈ N [L0 ] ∩ · · · ∩ N [Lk−j ],
0 ≤ j ≤ k.
(4.3)
4.1. Motivating the concept of transversality
85
Proof. Obviously, (4.3) implies (4.1). To prove the converse implication, we will proceed by induction on k. Suppose (4.1). Then, L0 u0 = 0 and, hence, (4.3) holds true for k = 0. Assume that the facts (y0 , . . . , yk−1 ) ∈ U k
and
j
Li yj−i = 0,
0 ≤ j ≤ k − 1,
i=0
imply yj ∈
k−1−j 6
0 ≤ j ≤ k − 1.
N [Li ],
i=0
Then, applying this induction hypothesis to (u0 , . . . , uk−1 ) shows that uj ∈
k−1−j 6
0 ≤ j ≤ k − 1.
N [Li ],
(4.4)
i=0
On the other hand, particularizing (4.1) at j = k gives L0 uk +
k
Li uk−i = 0.
(4.5)
i=1
Moreover, by (4.4), we have that L0 uk ∈ R[L0 ],
Li uk−i ∈ Li (N [L0 ] ∩ · · · ∩ N [Li−1 ]) ,
1 ≤ i ≤ k.
Thus, since the spaces (4.2) are in direct sum, (4.5) implies L0 uk = 0 and Li uk−i = 0
for each 1 ≤ i ≤ k.
Equivalently, Lk−j uj = 0 for each 0 ≤ j ≤ k. Combining these relations with (4.4) gives uj ∈
k−j 6
N [Li ] for each 0 ≤ j ≤ k,
i=0
and, therefore, (4.1) is satisfied.
There are many situations where systems of the form (4.1) appear; for instance, in setting the concept of generalized Jordan chain. But those applications are postponed until Chapters 7 and 9. Now we will analyze another important example closely related to the problem of ascertaining the perturbed eigenvalues from 0 for the family L(λ) as λ moves from λ0 . As already announced, this problem will be dealt with in Section 4.4. We use the notation introduced in the general presentation of Part II. Lemma 4.1.2. Suppose L ∈ C r (Ω, L(U, V )) and ϕ ∈ C r (Ω, U ) for some r ∈ N∪{∞}. Consider λ0 ∈ Ω and assume that the spaces (4.2) are in direct sum for some
86
Chapter 4. Algebraic Multiplicity Through Transversalization
integer 1 ≤ k ≤ r. Then the following properties are equivalent: • L(λ)ϕ(λ) = o((λ − λ0 )k ). j • i=0 Li ϕj−i = 0 for all 0 ≤ j ≤ k. • Li ϕj−i = 0 for all 0 ≤ i ≤ j ≤ k. Proof. As Lϕ ∈ C r (Ω, V ), the condition L(λ)ϕ(λ) = o((λ − λ0 )k ) is equivalent to (Lϕ)j) (λ0 ) = 0,
0 ≤ j ≤ k.
By the Leibniz rule, this is equivalent to j
Li ϕj−i = 0,
0 ≤ j ≤ k.
(4.6)
i=0
Finally, according to Lemma 4.1.1, (4.6) is satisfied if and only if 0 ≤ i ≤ j ≤ k,
Li ϕj−i = 0,
which concludes the proof.
Based on Lemma 4.1.2, we can easily obtain the following perturbation result. It clearly reveals how the transversality of the spaces (4.2) tremendously facilitates the calculations in ascertaining the perturbations of eigenvalues and associated eigenvectors for linear operators. Its full significance will become apparent in Section 4.4. Lemma 4.1.3. Suppose that for some r ∈ N ∪ {∞} the functions L ∈ C r (Ω, L(U )),
ϕ ∈ C r (Ω, U ),
a ∈ C r (Ω)
satisfy L(λ)ϕ(λ) = a(λ)ϕ(λ),
λ ∈ Ω,
and, for some point λ0 ∈ Ω and some integer 1 ≤ k ≤ r, the spaces (4.2) are in direct sum, and 0 ≤ i ≤ k. ai = 0, Then Li ϕj−i = 0,
0 ≤ i ≤ j ≤ k.
Proof. Define the auxiliary map M ∈ C r (Ω, L(U )) through M(λ) := L(λ) − a(λ)I,
λ ∈ Ω.
Then, Mϕ = 0 in Ω, and Mi = Li ,
0 ≤ i ≤ k.
Consequently, Lemma 4.1.2 concludes the proof.
4.2. The concept of transversal eigenvalue
87
4.2 The concept of transversal eigenvalue The next definition introduces the concept of transversal eigenvalue. It should not be forgotten that 0 ≤ j < r + 1. j!Lj = Lj) (λ0 ), Definition 4.2.1. Let L ∈ C r (Ω, L(U, V )) satisfy L0 ∈ Fred0 (U, V ) for some r ≥ 1; consider λ0 ∈ Eig(L), and k ∈ N ∩ [1, r]. Then, λ0 is said to be a k-transversal eigenvalue of L if the following topological direct sum decomposition is satisfied: k
Lj (N [L0 ] ∩ · · · ∩ N [Lj−1 ]) ⊕ R[L0 ] = V,
(4.7)
j=1
with Lk (N [L0 ] ∩ · · · ∩ N [Lk−1 ]) = {0}.
(4.8)
In such a case, the integer k is called the order of transversality of L at λ0 . More generally, given k ∈ N ∩ [0, r], the point λ0 is said to be a k-transversal value of L when either k = 0 and L0 ∈ Iso(U, V ), or k ≥ 1 and λ0 is a k-transversal eigenvalue of L. Condition (4.8) makes the integer k uniquely determined. The next result provides us with some useful relationships between the dimensions of the vector spaces arising in (4.7), as well as with a characterization of transversal eigenvalues. Proposition 4.2.2. Let r ∈ N∗ ∪ {∞} and L ∈ C r (Ω, L(U, V )) be such that L0 ∈ Fred0 (U, V ), with λ0 ∈ Eig(L), and the spaces (4.2) are in direct sum for some integer 1 ≤ k ≤ r. Set ni := dim
i 6
0 ≤ i ≤ k,
N [Lj ],
j=0
i := dim Li
6 i−1
N [Lj ] ,
1 ≤ i ≤ k.
j=0
Then ni−1 = ni + i ,
1 ≤ i ≤ k,
(4.9)
and, consequently, ni = nk +
k
j ,
0 ≤ i ≤ k − 1.
(4.10)
j=i+1
Moreover, λ0 is a k-transversal eigenvalue of L if and only if nk = 0,
k ≥ 1,
(4.11)
88
Chapter 4. Algebraic Multiplicity Through Transversalization
and, in such a case, ni =
k
j ,
0 ≤ i ≤ k − 1.
(4.12)
j=i+1
Proof. Since i 6 j=0
N [Lj ] ⊂
i−1 6
N [Lj ] ⊂ N [L0 ],
1 ≤ i ≤ k,
j=0
and dim N [L0 ] < ∞, for each 1 ≤ i ≤ k there exists a finite-dimensional subspace Ui ⊂ U such that N [L0 ] ∩ · · · ∩ N [Li−1 ] = Ui ⊕ (N [L0 ] ∩ · · · ∩ N [Li ])
(4.13)
N [L0 ] = U1 ⊕ · · · ⊕ Uk ⊕ (N [L0 ] ∩ · · · ∩ N [Lk ]) .
(4.14)
and, hence, By construction, Li (N [L0 ] ∩ · · · ∩ N [Li−1 ]) = Li (Ui ),
1 ≤ i ≤ k,
(4.15)
and, in addition, dim Ui = dim Li (Ui ),
1 ≤ i ≤ k,
(4.16)
because the restriction of Li from Ui to Li (Ui ) is an isomorphism. Thanks to (4.13), (4.15) and (4.16), we find that ni−1 = dim Ui + ni = dim Li (Ui ) + ni = i + ni ,
1 ≤ i ≤ k,
which provides us with (4.9). Identity (4.10) is a direct consequence of the identities of (4.9). Now, assume that λ0 is a k-transversal eigenvalue of L. Then, L1 (U1 ) ⊕ · · · ⊕ Lk (Uk ) ⊕ R[L0 ] = V
(4.17)
and, hence, dim N [L0 ] = codim R[L0 ] =
k
dim Li (Ui ) =
i=1
k
dim Ui ,
i=1
because L0 ∈ Fred0 (U, V ). Thus, we find from (4.14) that N [L0 ] = U1 ⊕ · · · ⊕ Uk
and N [L0 ] ∩ · · · ∩ N [Lk ] = {0}.
Therefore, nk = 0. Note that k ≥ 1 holds from (4.8), and that (4.12) is just (4.10) with nk = 0.
4.3. Algebraic eigenvalues and transversalization
89
To show the converse implication, suppose (4.11). Then, (4.10) implies (4.12). In particular, k j dim N [L0 ] = n0 = j=1
and, hence, n0 = codim R[L0 ] ≥
k
dim Li (Ui ) = n0 .
i=1
Consequently, codim R[L0 ] =
k
dim Li (Ui )
i=1
and (4.17) holds. As k ≥ 1, the point λ0 must be a k-transversal eigenvalue of L. This concludes the proof.
4.3 Algebraic eigenvalues and transversalization The following definition fixes the pivotal concept of algebraic eigenvalue. Definition 4.3.1. Suppose r ∈ N ∪ {∞}, and L ∈ C r (Ω, L(U, V )) satisfy L0 ∈ Fred0 (U, V ), with λ0 ∈ Eig(L). Then, λ0 is said to be an algebraic eigenvalue of L if there are an integer ν ≥ 1 and two positive constants δ > 0 and C > 0 such that, for each 0 < |λ − λ0 | < δ, the operator L(λ) is an isomorphism and L(λ)−1 ≤
C . |λ − λ0 |ν
(4.18)
The least integer ν ≥ 1 satisfying these requirements will be called the order of λ0 as an algebraic eigenvalue of L. More generally, for a given ν ∈ N, the point λ0 is said to be a ν-algebraic value of L when either ν = 0 and L0 ∈ Iso(U, V ), or ν ≥ 1 and λ0 is an algebraic eigenvalue of order ν of L. For every ν ∈ N, we denote by Algν (L) the set of all ν-algebraic values of L in Ω, and # Alg(L) := Algν (L). ν∈N
It must be emphasized that 0-algebraic values of L are not eigenvalues of L; however, they will be useful to extend the concept of algebraic multiplicity to cover all values of λ ∈ Ω for which L(λ) ∈ Iso(U, V ). We also note Alg0 (L) = Ω \ Σ(L)
and
Alg(L) \ Alg0 (L) ⊂ Eig(L).
90
Chapter 4. Algebraic Multiplicity Through Transversalization
The order of λ0 as an algebraic eigenvalue of L equals the order of λ0 as a pole of L−1 if L is analytic. Rather strikingly, although the concept of pole is not available for non-analytic families, the theory developed in Chapter 9 will reveal that the concept of order of λ0 as an algebraic eigenvalue of L in the non-analytic case shares most of the local properties with the concept of order of λ0 as a pole of L−1 in the analytic case. Among them, the existence of Laurent expansions of L−1 , necessarily finite if L is not analytic. The main result of this section establishes that if λ0 ∈ Ω is a ν-algebraic eigenvalue of L ∈ C r (Ω, L(U, V )), for some r ≥ 1 and some integer 1 ≤ ν ≤ r, then there exist a natural number 1 ≤ k ≤ ν and a polynomial family Φ ∈ P[L(U, V )] with Φ0 ∈ Iso(U, V ) such that λ0 is a k-transversal eigenvalue of the transformed family LΦ defined as LΦ (λ) := L(λ)Φ(λ),
λ ∈ Ω.
(4.19)
Moreover, the dimensions Φ Φ dim LΦ j (N [L0 ] ∩ · · · ∩ N [Lj−1 ]),
0 ≤ j < r + 1,
do not depend on the family of isomorphisms Φ and, consequently, they may be regarded as algebraic invariants of L. This result can be stated briefly by simply saying that L can be transversalized at λ0 if λ0 is an algebraic eigenvalue of order 1 ≤ ν ≤ r. In such a case, any local family of isomorphisms Φ for which λ0 is a transversal eigenvalue of (4.19) will be referred to as a transversalizing family for L at λ0 . It turns out that if r = ∞, then λ0 is an algebraic eigenvalue of L if and only if L can be transversalized at λ0 , but the complete proof of this characterization is postponed until Chapter 5, as it uses another concept of multiplicity to be introduced there. The main result of this chapter can be stated as follows. Theorem 4.3.2 (of transversalization). Suppose r ∈ N∪{∞}. Let L ∈ C r (Ω, L(U, V )) satisfy L0 ∈ Fred0 (U, V ) and λ0 ∈ Eig(L). Then, for each integer 1 ≤ k ≤ r there k exists Φk ∈ P[L(U )] with Φk0 = IU such that the product family LΦ defined by k
LΦ (λ) := L(λ)Φk (λ),
λ ∈ Ω,
satisfies Vk :=
k
k
k
k
k
Φ Φ Φ LΦ j (N [L0 ] ∩ · · · ∩ N [Lj−1 ]) ⊕ R[L0 ] ⊂ V.
j=1
If, in addition, λ0 ∈ Algν (L) for some integer 1 ≤ ν ≤ r, then there exists a least 1 ≤ k ≤ ν for which Vk = V and, therefore, λ0 is a k-transversal eigenvalue k of LΦ .
4.3. Algebraic eigenvalues and transversalization
91
Moreover, if Φ, Ψ ∈ C r (Ω, L(U )) are two families for which Φ0 , Ψ0 ∈ Iso(U ) and, for some 1 ≤ k, ≤ ν, the transformed families LΦ := LΦ,
LΨ := LΨ,
satisfy k
j−1 6
LΦ j (
j=1
i=0
j−1 6
LΨ j (
j=1
Φ N [LΦ i ]) ⊕ R[L0 ] = V,
k−1 6
LΦ k(
N [LΦ i ]) = {0},
i=0 Ψ N [LΨ i ]) ⊕ R[L0 ] = V,
i=0
−1 6
LΨ (
N [LΨ i ]) = {0},
i=0
then k = and, for each 1 ≤ j ≤ k, j−1 6 Φ dim Lj ( N [LΦ i ]) i=0
=
j−1 6 Ψ dim Lj ( N [LΨ i ]). i=0
Before giving the proof of Theorem 4.3.2, we discuss some of its main consequences. According to Theorem 4.3.2, the following concept of algebraic multiplicity is consistent. Definition 4.3.3. Suppose r ∈ N ∪ {∞}, the family L ∈ C r (Ω, L(U, V )) satisfies L0 ∈ Fred0 (U, V ), and either r = ∞, or λ0 ∈ Algν (L) for some integer 0 ≤ ν < r + 1. Then, the algebraic multiplicity of L at λ0 , denoted by χ[L; λ0 ], is defined as follows: • χ[L; λ0 ] :=
k j=0
j−1 6
j · dim LΦ j (
N [LΦ i ]), if λ0 ∈ Algν (L) for some 1 ≤ ν < r+1,
i=0
where Φ ∈ C r (Ω, L(U )) is any family for which λ0 is a k-transversal eigenvalue of LΦ := LΦ, for a certain 1 ≤ k ≤ ν. • χ[L; λ0 ] := 0, if λ0 ∈ Alg0 (L); equivalently, if L0 ∈ Iso(U, V ). • χ[L; λ0 ] := ∞, if r = ∞ and λ0 ∈ / Alg(L). The multiplicity χ[L; λ0 ] is left undefined in all remaining cases, that is, when # r ∈ N and λ0 ∈ / Algν (L). 0≤ν≤r
As commented earlier, if r = ∞ and λ0 ∈ Eig(L), then L can be transversalized at λ0 if and only if λ0 ∈ Alg(L). Actually, in such a case, as a consequence of the theory developed in Chapter 5, for any local transversalizing isomorphism Φ ∈ C ∞ (Ω, L(U )), the order of λ0 as an algebraic eigenvalue of L equals the order of transversality of λ0 as a transversal eigenvalue of the transversalized family LΦ := LΦ.
92
Chapter 4. Algebraic Multiplicity Through Transversalization
Consequently, the hypothesis λ0 ∈ Algν (L), for some 1 ≤ ν ≤ r, in the second assertion of Theorem 4.3.2 is not only sufficient for its validity, but also necessary. This is an extremely sharp result, because it entails that Vk must be a proper subspace of V for all k ≥ 1 if λ0 ∈ / Alg(L) (see the statement of Theorem 4.3.2). Simple examples show that the assumption that λ0 is an algebraic eigenvalue of L cannot be removed from the statement of Theorem 4.3.2 without seriously affecting its validity. Indeed, the family L ∈ C ∞ (R) defined by −2 if λ ∈ R \ {0}, e−λ L(λ) := (4.20) 0 if λ = 0 is real analytic in R \ {0}, but 0 ∈ / Alg(L). Moreover, Lj = 0 for all j ≥ 0, and, therefore, 0 cannot be a k-transversal eigenvalue of LΦ for any integer k ≥ 0 and Φ ∈ C ∞ (R). The proof of Theorem 4.3.2 is based on the following lemma. Lemma 4.3.4. Let m ∈ N∗ and L ∈ C m+1 (Ω, L(U, V )) be such that L0 ∈ Fred0 (U, V ) and m Vm := Lj (N [L0 ] ∩ · · · ∩ N [Lj−1 ]) ⊕ R[L0 ] ⊂ V. (4.21) j=1
Then there exists Φ ∈ P[L(U )] with Φ0 = IU for which the new family M := LΦ satisfies Vm+1 :=
m+1
Mj (N [M0 ] ∩ · · · ∩ N [Mj−1 ]) ⊕ R[M0 ] ⊂ V
(4.22)
j=1
and Mh = Lh ,
0 ≤ h ≤ m.
(4.23)
Proof. Let Y be a closed subspace of U such that U = N [L0 ] ⊕ Y. Arguing as in the proof of Proposition 4.2.2, for each 1 ≤ j ≤ m there exists a subspace Uj of N [L0 ] such that N [L0 ] ∩ · · · ∩ N [Lj−1 ] = Uj ⊕ (N [L0 ] ∩ · · · ∩ N [Lj ]). Moreover, these subspaces satisfy Lj (Uj ) = Lj (N [L0 ] ∩ · · · ∩ N [Lj−1 ]),
1 ≤ j ≤ m,
and dim Uj = dim Lj (Uj ),
1 ≤ j ≤ m.
(4.24)
4.3. Algebraic eigenvalues and transversalization
93
Thus, (4.21) can be expressed as Vm =
m
Lj (Uj ) ⊕ R[L0 ].
j=1
From now on, we set
m
Xm :=
Uj ⊕ Y.
j=1
Clearly, codim Xm = codim Vm , since L0 ∈ Fred0 (U, V ). Actually, the operators L0 |Y : Y → R[L0 ] and Lj |Uj : Uj → Lj (Uj ),
1 ≤ j ≤ m,
are isomorphisms, and Uj ⊂ N [Lh ] whenever 0 ≤ h < j ≤ m. Now, consider the projections P0 , . . . , Pm ∈ L(U )
and Q0 , . . . , Qm ∈ L(V )
such that R[P0 ] = Y,
N [P0 ] = N [L0 ],
R[Ph ] = Uh ,
N [Ph ] =
m
Uj ⊕ Y ,
1 ≤ h ≤ m,
j=1 j=h
R[Q0 ] = R[L0 ],
N [Q0 ] =
m
Lj (Uj ),
j=1
R[Qh ] = Lh (Uh ),
N [Qh ] =
m
Lj (Uj ) ⊕ R[L0 ], 1 ≤ h ≤ m.
j=1 j=h
Then, by definition of direct sum, in order to obtain (4.22) it suffices to construct Φ ∈ P[L(U )] such that M := LΦ satisfies (4.23) and Qh Mm+1 = 0,
0 ≤ h ≤ m.
(4.25)
0 ≤ h ≤ m + 1.
(4.26)
From the definition of M it is apparent that Mh =
h j=0
Lh−j Φj ,
94
Chapter 4. Algebraic Multiplicity Through Transversalization
Thus, to obtain (4.23) it is sufficient to choose Φ such that Φ0 = IU and Lh−j Φj = 0,
1 ≤ j ≤ h ≤ m.
These relations can be equivalently written in the form R[Φj ] ⊂ N [L0 ] ∩ · · · ∩ N [Lm−j ],
1 ≤ j ≤ m.
(4.27)
By construction, for each 1 ≤ j ≤ m, N [L0 ] ∩ · · · ∩ N [Lm−j ] = Um−j+1 ⊕ · · · ⊕ Um ⊕ (N [L0 ] ∩ · · · ∩ N [Lm ]) and, hence, (4.27) is accomplished for every family Φ satisfying Ph−j Φj = 0,
1 ≤ j ≤ h ≤ m.
(4.28)
Indeed, (4.28) implies P0 Φj = 0,
1 ≤ j ≤ m,
and, hence, R[Φj ] ⊂ N [L0 ] = U1 ⊕ · · · ⊕ Um ⊕ (N [L0 ] ∩ · · · ∩ N [Lm ]). Moreover, P1 Φj = · · · = Pm−j Φj = 0. Therefore, (4.28) implies (4.27). Assume Φ0 = IU and (4.27). Using (4.26), we find that (4.25) is satisfied if and only if m+1
Qh Lm−j+1 Φj = 0,
0 ≤ h ≤ m.
(4.29)
j=0
Moreover, it follows from (4.27) that, for each 1 ≤ j ≤ m, R[Lm−j+1 Φj ] ⊂ Lm−j+1 (Um−j+1 ), since R[Φj ] ⊂ N [L0 ] ∩ · · · ∩ N [Lm−j ] = Um−j+1 ⊕ (N [L0 ] ∩ · · · ∩ N [Lm−j+1 ]). Thus, for each 1 ≤ j ≤ m and 0 ≤ h ≤ m with h = m − j + 1, Qh Lm−j+1 Φj = 0 and, hence, (4.29) can be written in the form Qh Lm+1 = −Qh Lh Φm+1−h ,
0 ≤ h ≤ m.
(4.30)
4.3. Algebraic eigenvalues and transversalization
95
Further, since the operators Q0 L0 |Y : Y → R[L0 ], Qh Lh |Uh : Uh → Lh (Uh ), 1 ≤ h ≤ m, are isomorphisms, (4.30) is satisfied provided Φm+1 = −P0 (Q0 L0 |Y )−1 Q0 Lm+1 and
Φm+1−h = −Ph (Qh Lh |Uh )−1 Qh Lm+1 ,
(4.31)
1 ≤ h ≤ m.
(4.32)
As (4.28) does not entail any restriction on Φm+1 , it is clear that (4.31) is compatible with (4.28). Moreover, choosing (4.32) yields R[Φm+1−h ] ⊂ Uh ⊂ N [L0 ] ∩ · · · ∩ N [Lh−1 ],
1 ≤ h ≤ m.
Equivalently, R[Φj ] ⊂ N [L0 ] ∩ · · · ∩ N [Lm−j ],
1 ≤ j ≤ m.
Therefore, (4.27) holds true. This concludes the proof.
Throughout the rest of this book, for any integer n ≥ 1, vector spaces X1 , . . . , Xn and vectors xj ∈ Xj , for 1 ≤ j ≤ n, we will denote ⎛ ⎞ x1 ⎜ . ⎟ . ⎟ col[x1 , . . . , xn ] := ⎜ (4.33) ⎝ . ⎠ ∈ X1 × · · · × Xn . xn Also, we use the notation trng, which has been partially introduced in (2.24). Given an integer n ≥ 1, two Banach spaces U, V , and n operators B1 , . . . , Bn ∈ L(U, V ), the operator
⎛
B1 ⎜ ⎜ B2 trng{B1 , B2 , . . . , Bn } := ⎜ ⎜ .. ⎝ . Bn
0 B1 .. . Bn−1
⎞ 0 ⎟ 0⎟ .. ⎟ ⎟ . ⎠ · · · B1
··· ··· .. .
(4.34)
will denote the element of L(U n , V n ) defined through trng{B1 , B2 , . . . , Bn } col[u1 , . . . , un ] := col[B1 u1 , B2 u1 + B1 u2 , . . . , Bn u1 + Bn−1 u2 + · · · + B1 un ] for each u1 , . . . , un ∈ U . The following result, of technical nature, will be useful in the proof of Theorem 4.3.2.
96
Chapter 4. Algebraic Multiplicity Through Transversalization
Lemma 4.3.5. Let r ∈ N and L, M ∈ C r (Ω, L(U, V )) be such that, for some integer 1 ≤ k ≤ r, the spaces k−1 6
R[L0 ], L1 (N [L0 ]), . . . , Lk (
N [Lj ]),
j=0
are in direct sum, and so are k−1 6
R[M0 ], M1 (N [M0 ]), . . . , Mk (
N [Mj ]).
j=0
Suppose, in addition, that there exists Υ ∈ C r (Ω, L(U )) such that Υ0 ∈ Iso(U )
and
L = MΥ.
(4.35)
Then, for every 0 ≤ j ≤ k, Υ0 (N [L0 ] ∩ · · · ∩ N [Lj ]) = N [M0 ] ∩ · · · ∩ N [Mj ] and, consequently, dim N [L0 ] ∩ · · · ∩ N [Lj ] = dim N [M0 ] ∩ · · · ∩ N [Mj ]. Proof. Applying the Leibniz rule to (4.35) yields trng{L0 , . . . , Ls } = trng{M0 , . . . , Ms } · trng{Υ0 , . . . , Υs }
(4.36)
for all integers 0 ≤ s ≤ r. Now pick 0 ≤ j ≤ k and x ∈ N [L0 ] ∩ · · · ∩ N [Lj ]. Then col[x, . . . , x] ∈ N [trng{L0 , . . . , Lj }] , and, thanks to (4.36), we find that trng{Υ0 , . . . , Υj } col[x, . . . , x] ∈ N [trng{M0 , . . . , Mj }] . Consequently, Lemma 4.1.1 implies that Υ0 x ∈ dim N [M0 ] ∩ · · · ∩ N [Mj ] and, therefore, for each 0 ≤ j ≤ k, Υ0 (N [L0 ] ∩ · · · ∩ N [Lj ]) ⊂ N [M0 ] ∩ · · · ∩ N [Mj ]. As Υ0 is an isomorphism, there exists an open neighborhood Ω of λ0 such that the function Υ−1 defined by Υ−1 (λ) := Υ(λ)−1
for
λ ∈ Ω
4.3. Algebraic eigenvalues and transversalization
97
belongs to C r (Ω , L(U )). In Ω we have M = LΥ−1 , and, therefore, according to the result that we have just proved, for each 0 ≤ j ≤ k, Υ−1 0 (N [M0 ] ∩ · · · ∩ N [Mj ]) ⊂ N [L0 ] ∩ · · · ∩ N [Lj ] and, consequently, N [M0 ] ∩ · · · ∩ N [Mj ] ⊂ Υ0 (N [L0 ] ∩ · · · ∩ N [Lj ]),
which concludes the proof. Now, we proceed to prove Theorem 4.3.2.
Proof of Theorem 4.3.2. Let Y be a closed subspace of U , and Z a finite-dimensional subspace of V such that U = N [L0 ] ⊕ Y
and V = Z ⊕ R[L0 ].
Then, since L0 ∈ Fred0 (U, V ), we have dim Z = dim N [L0 ]. Consider continuous projections P0 ∈ L(U ) and Q0 ∈ L(V ) such that R[P0 ] = Y,
N [P0 ] = N [L0 ],
R[Q0 ] = R[L0 ],
N [Q0 ] = Z.
The construction of the transversalizing local isomorphisms of U will be accomplished iteratively. We begin by constructing a polynomial Φ1 ∈ P[L(U )] of the form Φ1 (λ) := IU + (λ − λ0 )Φ11 , λ ∈ K, so that the family L1 := LΦ1 satisfies V1 := L11 (N [L10 ]) ⊕ R[L10 ] ⊂ V. Necessarily, by (4.37), L10 = L0
and L11 = L1 + L0 Φ11 .
Clearly, it suffices to construct Φ11 ∈ L(U ) such that Q0 L1 + Q0 L0 Φ11 = 0, which can be accomplished by making the choice Φ11 := −P0 (Q0 L0 |Y )−1 Q0 L1 .
(4.37)
98
Chapter 4. Algebraic Multiplicity Through Transversalization
Now consider an integer 1 ≤ k ≤ r. Then, based on the previous result and applying Lemma 4.3.4 recursively, there exist Ψ1 , . . . , Ψk ∈ P[L(U )] such that m Ψm 0 := Ψ (λ0 ) = IU ,
1 ≤ m ≤ k,
for which the family Lm defined by Lm (λ) := L(λ)Ψ1 (λ) · · · Ψm (λ), satisfies Vm :=
m
λ ∈ Ω,
m m m Lm j (N [L0 ] ∩ · · · ∩ N [Lj−1 ]) ⊕ R[L0 ] ⊂ V.
j=1
This ends the proof of the first part of the theorem. Now, we shall show that Vν = V if λ0 ∈ Algν (L) for some 1 ≤ ν ≤ r. As in the proof of Lemma 4.3.4, for each 1 ≤ j ≤ ν let Uj be a subspace of N [L0 ] satisfying (4.24), and set Xm :=
m
Uj ⊕ Y,
1 ≤ m ≤ ν.
j=1
Arguing as in the proof of Lemma 4.3.4 shows that codim Xm = codim Vm ,
1 ≤ m ≤ ν.
(4.38)
Recall that L0 ∈ Fred0 (U, V ) and Lm 0 = L0 ,
1 ≤ m ≤ ν.
Looking for a contradiction, assume that λ0 ∈ Algν (L) with 1 ≤ ν ≤ r and Vν V . Then, it follows from (4.38) that Xm is a proper subspace of U for each 1 ≤ m ≤ ν. Moreover, by construction, we already know that N [L0 ] = N [Lν0 ] = U1 ⊕ · · · ⊕ Uν ⊕ (N [Lν0 ] ∩ · · · ∩ N [Lνν ]). Thus, since U = N [L0 ] ⊕ Y
and Xν U,
we find that N [Lν0 ] ∩ · · · ∩ N [Lνν ] = {0} and, therefore, we can pick a vector u0 ∈ N [Lν0 ] ∩ · · · ∩ N [Lνν ] \ {0}. Necessarily, Lν (λ)u0 = o((λ − λ0 )ν ) as λ → λ0 .
(4.39)
4.4. Perturbation from simple eigenvalues
99
Consequently, since λ0 ∈ Algν (L) and, by construction, Ψ1 (λ) · · · Ψν (λ)u0 = L(λ)−1 Lν (λ)u0 , we find from (4.39) that 0 = u0 = lim Ψ1 (λ) · · · Ψν (λ)u0 = lim L(λ)−1 Lν (λ)u0 = 0, λ→λ0
λ→λ0
which is impossible. This contradiction shows that Vν = V and concludes the proof of the second assertion of the theorem. Finally, suppose that λ0 ∈ Algν (L), with 1 ≤ ν ≤ r, and let Φ, Ψ ∈ C r (Ω, L(U )) be such that Φ0 , Ψ0 ∈ Iso(U ) and, for some 1 ≤ k, ≤ ν, the point λ0 is a k-transversal eigenvalue of LΦ := LΦ, while λ0 is an -transversal eigenvalue of LΨ := LΨ. Then, LΦ = LΨ Ψ−1 Φ and, according to Lemma 4.3.5, it is apparent that Φ Ψ Ψ dim N [LΦ 0 ] ∩ · · · ∩ N [Lj ] = dim N [L0 ] ∩ · · · ∩ N [Lj ]
(4.40)
for all 0 ≤ j ≤ min{k, }. On the other hand, according to Proposition 4.2.2, we have that, for each 1 ≤ j ≤ min{k, }, dim
dim
j−1 6 i=0
j−1 6 Φ dim Lj ( N [LΦ i ]) i=0
j−1 6
j−1 6
N [LΦ i ] N [LΨ i ]
i=0
=
=
dim LΨ j (
N [LΨ i ])
+ dim
j 6
N [LΦ i ],
i=0
+ dim
i=0
j 6
N [LΨ i ].
i=0
Consequently, putting together the above equalities with (4.40) shows Φ Φ Ψ Ψ Ψ dim LΦ j (N [L0 ] ∩ · · · ∩ N [Lj−1 ]) = dim Lj (N [L0 ] ∩ · · · ∩ N [Lj−1 ])
for all 0 ≤ j ≤ min{k, }. As, by Definition 4.2.1, we have that k−1 6
LΦ k(
−1 6
Ψ N [LΦ i ]) = {0} and L (
i=0
N [LΨ i ]) = {0},
i=0
necessarily k = . This concludes the proof.
4.4 Perturbation from simple eigenvalues Throughout this section we assume that U is a subspace of V with continuous inclusion, that L ∈ C r (Ω, L(U, V )) for some r ≥ 1, and that 0 is a simple eigenvalue of L0 , which means that dim N [L0 ] = 1 and N [L0 ] ⊕ R[L0 ] = V.
(4.41)
100
Chapter 4. Algebraic Multiplicity Through Transversalization
Exercises 2 and 3 will provide a list of necessary and sufficient conditions for the transversality condition of (4.41) to hold. In particular, it will be shown that L0 ∈ Fred0 (U, V ) if dim N [L0 ] < ∞ and N [L0 ] ⊕ R[L0 ] = V. Consequently, in this case, it is not necessary to impose the Fredholm condition L0 ∈ Fred0 (U, V ), as we have done in this chapter. Under these general assumptions, the zero eigenvalue of L0 perturbs into a unique eigenvalue a(λ) of L(λ). Precisely, the following perturbation result is satisfied. Lemma 4.4.1. Suppose U is a subspace of V with continuous inclusion, r ∈ N∗ ∪ {∞, ω}, the family L ∈ C r (Ω, L(U, V )) satisfies (4.41), and λ0 ∈ Ω. Let Y be a closed subspace of U and ϕ0 ∈ N [L0 ] \ {0} such that N [L0 ] = span[ϕ0 ]
and
N [L0 ] ⊕ Y = U.
Then there exist an open neighborhood Ω of λ0 and two unique functions a ∈ C r (Ω , K) and ϕ ∈ C r (Ω , U ) such that, for each λ ∈ Ω , L(λ)ϕ(λ) = a(λ)ϕ(λ)
(4.42)
and a(λ0 ) = 0,
ϕ(λ0 ) = ϕ0 ,
ϕ(λ) − ϕ0 ∈ Y.
Proof. Let U be a neighborhood of (λ0 , 0, 0) in K × K × Y such that the operator F : U → V defined by F(λ, a, z) := L(λ)(ϕ0 + z) − a(ϕ0 + z),
(λ, a, z) ∈ U,
is well defined. Then, F ∈ C r (U, V ) and F(λ0 , 0, 0) = 0. Moreover, the derivative of F(λ0 , ·, ·) at (0, 0) equals the operator T ∈ L(K × Y, V ) defined through T (a, z) := L0 z − aϕ0 ,
(a, z) ∈ K × Y.
Condition (4.41) entails T being an isomorphism. The implicit function theorem easily completes the proof. One of the main goals of perturbation theory is to ascertain the first nonvanishing term of the Taylor expansion of the perturbed eigenvalue function a, as the knowledge of those terms is imperative in most applications of the underlying theory. The next result shows that a1 := a (λ0 ) = 0 if and only if λ0 is a 1transversal eigenvalue of L. Proposition 4.4.2. Under the same hypotheses and notation of Lemma 4.4.1, a1 = 0 if and only if λ0 is a 1-transversal eigenvalue of L.
4.4. Perturbation from simple eigenvalues
101
Proof. Differentiating (4.42) and particularizing at λ0 gives L1 ϕ0 + L0 ϕ1 = a1 ϕ0 .
(4.43)
Thus, L1 ϕ0 = −L0 ϕ1 ∈ R[L0 ] if a1 = 0. Conversely, L1 ϕ0 ∈ R[L0 ] implies that L1 ϕ0 + L0 ϕ1 ∈ R[L0 ] and, hence, due to (4.43), a1 ϕ0 ∈ R[L0 ]. Therefore, a1 = 0, because we are assuming that ϕ0 ∈ / R[L0 ], by (4.41). The following result shows that the algebraic multiplicity χ[L; λ0 ] of L at λ0 equals ordλ0 a, where a is the perturbed eigenvalue function from the zero eigenvalue of L0 , whose existence was established by Lemma 4.4.1. Theorem 4.4.3. Under the same hypotheses and notation of Lemma 4.4.1, suppose, in addition, that λ0 ∈ Algν (L) for some integer 1 ≤ ν ≤ r. Then, for every choice of Y , χ[L; λ0 ] = ordλ0 a. Moreover, χ[L; λ0 ] equals the order of transversality of all transversalized families from L at λ0 . Proof. According to Theorem 4.3.2, there exist k ∈ {1, . . . , ν} and Φ ∈ P[L(U )] with Φ0 = IU for which λ0 is a k-transversal eigenvalue of LΦ := LΦ. According to Definitions 4.2.1 and 4.3.3, we have that χ[L; λ0 ] = k, because codim R[L0 ] = 1, by (4.41). Consequently, to prove the theorem it suffices to show the identity ordλ0 a = k. Note that, by Definition 4.2.1, Φ Φ LΦ k (N [L0 ] ∩ · · · ∩ N [Lk−1 ]) = {0} Φ and, hence, N [LΦ 0 ] ∩ · · · ∩ N [Lk−1 ] is a non-zero space contained in
N [LΦ j ] = span[ϕ0 ], so
k−1 6 j=0
N [LΦ j ] = span[ϕ0 ].
102
Set
Chapter 4. Algebraic Multiplicity Through Transversalization
ψ(λ) := Φ(λ)−1 ϕ(λ)
for λ ∼ λ0 .
Then, identity (4.42) can be expressed in the form LΦ (λ)ψ(λ) = a(λ)ϕ(λ)
for λ ∼ λ0 .
(4.44)
We now show that am = 0 for some 1 ≤ m ≤ k. Suppose the opposite to be true, so that aj = 0 for each 0 ≤ j ≤ k. Then, by (4.44), LΦ (λ)ψ(λ) = o((λ − λ0 )k ) for λ ∼ λ0 and, hence, according to Lemma 4.1.2 applied to LΦ , k 6
ψ0 ∈
N [LΦ j ].
j=0
On the other hand, by Proposition 4.2.2 applied to LΦ , we have k 6
N [LΦ j ] = {0}.
j=0
Therefore, ψ0 = 0, which is a contradiction, since ψ0 = Φ−1 0 ϕ0 = ϕ0 = 0. Consequently, 1 ≤ m := ordλ0 a ≤ k and, hence, it follows from (4.44) that LΦ (λ)ψ(λ) = o((λ − λ0 )m−1 ) for λ ∼ λ0 . Thus, Lemma 4.1.2 applied to LΦ shows that ψ0 , . . . , ψm−1 ∈ N [LΦ 0]=
m−1 6
N [LΦ j ] = span[ϕ0 ].
j=0
Combining this with (4.44) and using the transversality of LΦ yields Φ LΦ 0 ψm + Lm ψ0 = am ϕ0 = 0 Φ and, hence, LΦ m ϕ0 = 0, because of L0 = L0 and (4.41). Therefore, Φ Φ dim LΦ m (N [L0 ] ∩ · · · ∩ N [Lm−1 ]) = 1.
This implies k = m and ends the proof.
Theorem 5.7.1 will provide us with an improvement of Theorem 4.4.3 by simply assuming that χ[L; λ0 ] is well defined, even if λ0 ∈ / Alg(L) (see also Exercise 5).
4.5. Exercises
103
4.5 Exercises 1. Identify L(K2 ) with M2 (K), and let L, L∗ ∈ L(K, L(K2 )) be the operator families defined by λ λ2 λ ∈ K. , L∗ (λ) := L(λ)∗ , L(λ) := 1 0 Prove that 0 is a 2-transversal eigenvalue of L, but it is not a transversal eigenvalue of L∗ . 2.
Suppose U is a subspace of V with continuous inclusion and let B ∈ L(U, V ) satisfy dim N [B] < ∞
and
N [B] ⊕ R[B] = V.
Prove that B ∈ Fred0 (U, V ). 3. Prove that the following conditions are equivalent for every A ∈ Fred0 (U, V ) and α ∈ N: • N [Aα ] ⊕ R[Aα ] = V . • N [Aα ] ∩ R[Aα ] = {0}. • N [Aα ] + R[Aα ] = V . • N [Aα ] ⊕ (U ∩ R[Aα ]) = U . • The restriction of Aα from U ∩ R[Aα ] to V is injective. • The restriction of Aα from U ∩ R[Aα ] to R[Aα ] is an isomorphism. • N [Aα ] = N [Aα+1 ]. • N [Aα ] = N [Aβ ] for all β ≥ α. • R[Aα ] = R[Aα+1 ]. • R[Aα ] = R[Aβ ] for all β ≥ α. 4.
Given T ∈ L(U ), consider the family L ∈ C ω (K, L(U )) defined by L(λ) := λI − T,
λ ∈ K,
and let λ0 ∈ Eig(L) be such that L0 ∈ Fred0 (U ). Prove the equivalence of the following assertions: • λ0 is a transversal eigenvalue of L. • λ0 is a 1-transversal eigenvalue of L. • N [L0 ] ⊕ R[L0 ] = U . In such a case, χ[L; λ0 ] = dim N [L0 ]. 5. Identify L(R) with R, and suppose L ∈ C r (Ω, L(R)) for some r ∈ N ∪ {∞}. Prove that ordλ0 L is defined if and only if so is χ[L; λ0 ], and that, in such a case, χ[L; λ0 ] = ordλ0 L. 6. Suppose L ∈ C r (Ω, L(U, V )) for some r ∈ N ∪ {∞}, and for a certain λ0 ∈ Ω one has L0 ∈ Fred0 (U, V ), and χ[L; λ0 ] is defined. Prove that χ[L; λ0 ] ≥ dim N [L0 ].
104
Chapter 4. Algebraic Multiplicity Through Transversalization
7. Let L ∈ C r (Ω, L(U, V )) be a family for which χ[L; λ0 ] is defined, and consider the new family M defined by M(λ) := L(λ + λ0 ),
for λ + λ0 ∈ Ω.
Prove that χ[M; 0] = χ[L; λ0 ]. 8.
Let U, V, W be Banach spaces, r ∈ N ∪ {∞}, and L ∈ C r (Ω, L(U, V )),
Φ ∈ C r (Ω, L(V, W ))
such that L0 ∈ Fred0 (U, V ) and Φ0 ∈ Iso(V, W ) for some λ0 ∈ Ω. Given an integer 0 ≤ k ≤ r, prove the following: • λ0 is a k-transversal eigenvalue of L if and only if it is a k-transversal eigenvalue of ΦL. • χ[L; λ0 ] is defined if and only if χ[ΦL; λ0 ] is defined, and, in such a case, χ[L; λ0 ] = χ[ΦL; λ0 ]. 9.
Let U1 , U2 , V1 , V2 be Banach spaces and λ0 ∈ Ω ⊂ K. Consider L ∈ C r (Ω, L(U1 , V1 ))
and
M ∈ C r (Ω, L(U2 , V2 ))
such that L0 ∈ Fred0 (U1 , V1 ) and M0 ∈ Fred0 (U2 , V2 ). Define the product family L × M as λ ∈ Ω. (L × M)(λ) = L(λ) × M(λ) ∈ L(U1 × U2 , V1 × V2 ), Prove, step by step, the following: • For all integers 0 ≤ s ≤ r, (L × M)s
6 s−1 j=0
6 6 s−1 s−1 N [(L × M)j ] = Ls N [Lj ] × Ms N [Mj ] . j=0
j=0
• If λ0 is a k-transversal eigenvalue of L and λ0 is an -transversal eigenvalue of M, then λ0 is a max{k, }-transversal eigenvalue of L × M. • If λ0 is a k-algebraic eigenvalue of L and λ0 is an -algebraic eigenvalue of M, then λ0 is a max{k, }-algebraic eigenvalue of L × M. / Alg(L) or λ0 ∈ / Alg(M), then λ0 ∈ / Alg(L × M). • Suppose r = ∞. If λ0 ∈ • χ[L × M; λ0 ] is defined if and only if both χ[L; λ0 ] and χ[M; λ0 ] are defined, and, in such a case, χ[L × M; λ0 ] = χ[L; λ0 ] + χ[M; λ0 ].
4.6. Comments on Chapter 4
105
4.6 Comments on Chapter 4 The construction of the algebraic multiplicity presented in this chapter goes back to Esquinas & L´opez-G´omez [29, 30, 31, 82]. Originally, it was introduced in the context of bifurcation theory to characterize the nonlinear eigenvalues of L, which further enhanced a huge industry in topological global analysis. A value λ0 ∈ Ω is said to be a nonlinear eigenvalue of L ∈ C r (Ω, L(U, V )), for some r ≥ 2, if for every map N ∈ C 2 (Ω × U, V ) such that N(λ, 0) = 0,
lim
u→0
N(λ, u) = 0, u
λ ∼ λ0 ,
there exists a sequence {(ξn , un )}n≥1 in Ω × (U \ {0}) such that lim (ξn , un ) = (λ0 , 0) and L(ξn )un + N(ξn , un ) = 0,
n→∞
n ≥ 1.
The theory of Esquinas & L´ opez-G´omez established that, when χ[L; λ0 ] is defined, a λ0 ∈ Eig(L) is a nonlinear eigenvalue of L if and only if χ[L; λ0 ] ∈ 2N + 1. These topics will be treated in Chapter 12, where we shall give a proof of the theorem of characterization of nonlinear eigenvalues through the local Smith form studied in Chapter 7 and the topological degree, which will be introduced there. So, we stop this discussion here. The concept of algebraic eigenvalue goes back to L´opez-G´omez [82]. It was introduced to overcome a serious gap in the proof of the main theorem of Esquinas [29], which is true as stated there in if L ∈ C ω (Ω, L(U, V )), because in such a case all isolated eigenvalues must be algebraic, as will become apparent in Chapter 8. Since at least Poincar´e, the study of eigenvalue perturbations has been a milestone in the generation of new problems and ideas in spectral theory. Possibly, the paradigm of the perturbation theory of linear operators is the celebrated book of Kato [65]. A briefer text in the theory of perturbation theory of Fredholm operators is the review paper by Gohberg & Kre˘ın [45]. In fact, Lemma 4.4.1 is attributable to Kato [65], where, in addition, the problem of constructing generalized algebraic multiplicities for families of the form L(λ) = L0 + (λ − λ0 )L1 ,
λ ∈ K,
in the context of perturbation theory, was originally addressed. Theorem 4.4.3 gives a rather satisfactory answer to the problem of analyzing spectral perturbations from simple eigenvalues; it goes back to L´ opez-G´omez [82], where, actually, a completely general answer to the perturbation problem was proposed by means of the topological degree. Essentially, when K = R, the algebraic multiplicity χ[L; λ0 ] measures the parity of the Poincar´e crossing number of L(λ) as λ crosses λ0 . By
106
Chapter 4. Algebraic Multiplicity Through Transversalization
crossing number is meant the total number of classic eigenvalues of L(λ) that crosses the imaginary axis as λ crosses λ0 . This feature is crucial in the context of the theory of dynamical systems. According to Theorem 4.4.3, a(λ) changes sign as λ crosses λ0 if and only if χ[L; λ0 ] is odd, and, consequently, χ[L; λ0 ] provides us with an algebraic invariant characterizing whether or not a(λ) crosses the imaginary axis along the real axis. Such characterizations are imperative to study the physical plausibility of (λ, 0), as a mathematical solution, in a number of nonlinear equations describing real world models of the form L(λ)u + N(λ, u) = 0, where N(λ, u) = o( u ) is some nonlinear operator. Further details on these and some other closely related nonlinear topics, directed to an interdisciplinary audience, can be found in L´ opez-G´omez [85, 82]. Proposition 4.4.2 can be stated by saying that if zero is a simple eigenvalue of L0 , then a1 := a (λ0 ) = 0 (a transversality condition of dynamical nature) if and only if (4.45) L1 (N [L0 ]) ⊕ R[L0 ] = V (a transversality condition of algebraic nature). This crucial feature goes back to Crandall & Rabinowitz [22, 23], and is on the roots of their extremely celebrated bifurcation theorem and exchange stability principle. Actually, (4.45) is referred to in the specialized literature on nonlinear analysis as the transversality condition of Crandall and Rabinowitz. From the very beginning, (4.45) triggered the abstract theory developed in this chapter. By its huge number of applications in the context of nonlinear partial differential equations, there is no doubt that the results of Crandall & Rabinowitz [22, 23] are among the most important mathematical works of the last decades. Although the general exposition of this chapter has been based on [82], the notation and materials included here have been considerably polished and refined.
Chapter 5
Algebraic Multiplicity Through Polynomial Factorization This chapter describes an equivalent approach to the concept of multiplicity χ[L; λ0 ] introduced in Chapter 4; in this occasion by means of an appropriate polynomial factorization of L at λ0 . However, at first glance these approaches are seemingly completely different. The approach adopted in this chapter provides two extremely relevant properties of χ[L; λ0 ], not discussed in Chapter 4, and most of the uniqueness results of Chapter 6. Precisely, it might be viewed as a technical device to prove the following: • Given λ0 ∈ Ω and L ∈ C ∞ (Ω, L(U, V )), the family L can be transversalized at λ0 ∈ Ω if and only if λ0 ∈ Alg(L), equivalently, if and only if χ[L; λ0 ] < ∞. • The algebraic multiplicity of a product equals the sum of the algebraic multiplicities (product formula). Chapter 5 is organized as follows. Section 5.1 constructs the new concept of multiplicity, denoted by µ[L; λ0 ], and proves its most elementary properties. Section 5.2 establishes some hidden connections between the multiplicities µ and χ. Section 5.3 shows that µ = χ and uses this equivalence to prove that a C ∞ family L can be transversalized at λ0 if and only if λ0 ∈ Alg(L), which is an improvement of the second assertion of Theorem 4.3.2. Section 5.4 gives a formula for the partial multiplicities introduced in Section 5.1. Section 5.5 consists of the proof of the following real non-analytic counterpart of the celebrated theorem of Riemann on removable singularities. Theorem 5.0.1 (theorem of removable singularities). Let r ∈ N ∪ {∞}, consider λ0 ∈ Ω and L ∈ C r (Ω, L(U, V )) with L(λ0 ) ∈ Fred0 (U, V ). Suppose (λ − λ0 )ν L(λ)−1 exists and is bounded for λ in Ω \ {λ0 }, for some ν ∈ [0, r] ∩ Z. Then
108
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
there exists an open subset Ω ⊂ Ω with λ0 ∈ Ω for which the function λ → (λ − λ0 )ν L(λ)−1 ,
λ ∈ Ω \ {λ0 },
admits an extension of class C r−ν to Ω . Theorem 5.0.1 is a deep result whose proof is based on the main theorem of this chapter (Theorem 5.3.1). The condition L0 ∈ Fred0 (U, V ) cannot be removed from its statement (see Exercise 9). The assumption (λ − λ0 )ν L(λ)−1 exists and is bounded for λ in Ω \ {λ0 }, for some ν ∈ [0, r] ∩ Z holds if and only if λ0 ∈ Algk (L) for some k ∈ [0, r]∩Z. In such a case, the theorem applies for all ν ∈ [k, r] ∩ Z. Chapter 8 shows that this is actually the case when L is analytic and λ0 is an isolated singularity of L−1 . Section 5.6 is devoted to the proof of the product formula. Finally, Section 5.7 gives the sharp version of Theorem 4.4.3 announced at the end of Section 4.4. As in Chapter 4, throughout this chapter we consider K ∈ {R, C}, two KBanach spaces U and V , an open subset Ω ⊂ K, a point λ0 ∈ Ω, and a family L ∈ C r (Ω, L(U, V )) for some r ∈ N ∪ {∞}, such that L0 := L(λ0 ) ∈ Fred0 (U, V ), even if not mentioned. As Fred0 (U, V ) is an open set of L(U, V ), the previous conditions actually imply L(λ) ∈ Fred0 (U, V )
for
λ ∼ λ0 .
5.1 Derived families and factorization Given the family L we consider the r + 1 auxiliary families M{j} : Ω → L(U, V ),
0 ≤ j < r + 1,
defined inductively as follows: 1. M{0} := L. 2. Let 0 ≤ i < r and assume that a family M{i} ∈ C r−i (Ω, L(U, V )) has been defined. Consider a projection Πi ∈ L(U ) with range N [M{i} (λ0 )]. Then, we define M{i} (λ) (λ − λ0 )−1 Πi + IU − Πi if λ = λ0 , M{i+1} (λ) := if λ = λ0 . M{i} (λ0 )Πi + M{i} (λ0 ) Note that M{i} (λ0 )Πi = 0 and M{i+1} ∈ C r−i−1 (Ω, L(U, V )).
5.1. Derived families and factorization
109
Definition 5.1.1. The (finite or infinite) sequence {M{j} }rj=0 is called a derived sequence from L at λ0 . For each 0 ≤ j < r + 1, the family M{j} is said to be a jth derived family from L at λ0 . The sequence {Πj }rj=0 is said to be the sequence of projections corresponding to {M{j} }rj=0 . From now on, given a finite-rank projection P ∈ L(U ), we will consider the polynomial family RP ∈ P[L(U )] defined by RP (t) := P + t(IU − P ),
t ∈ K.
(5.1)
Note that RP (t) is invertible for all t = 0 and that RP (t)−1 = RP (t−1 ),
t ∈ K \ {0}.
(5.2)
Using this notation, one may express M{i+1} (λ) = (λ − λ0 )−1 M{i} (λ)RΠi (λ − λ0 ),
λ ∈ Ω \ {λ0 }.
In the construction of M{j+1} from M{j} , the projection Πj can be chosen in many different ways. Consequently, there are, in fact, infinitely many derived sequences from L at λ0 . The following result collects their main properties. In particular, it justifies the way they have been constructed. Note that, in Step 2 above, the projection Πj exists if dim N [M{j} (λ0 )] < ∞, since every finitedimensional subspace of U possesses a topological supplement. Lemma 5.1.2. Let {M{j} }rj=0 be a derived sequence from L at λ0 with corresponding sequence of projections {Πj }rj=0 . Take j ∈ N ∩ [0, r]. Then M{j} (λ) ∈ Fred0 (U, V ) for all λ ∈ Ω satisfying L(λ) ∈ Fred0 (U, V ). Moreover, M{j} (λ) = (λ − λ0 )−j L(λ)RΠ0 (λ − λ0 ) · · · RΠj−1 (λ − λ0 )
(5.3)
for all λ ∈ Ω \ {λ0 }. Furthermore, for every j ∈ N ∩ [0, r − 1], N [Πj ] ∩ N [M{j+1} (λ0 )] = {0}
(5.4)
dim N [M{j+1} (λ0 )] ≤ dim N [M{j} (λ0 )].
(5.5)
and Proof. First, we show that M{j} (λ) ∈ Fred0 (U, V ) if L(λ) ∈ Fred0 (U, V ). The proof is a simple induction on j. As M{0} = L, there is nothing to prove when j = 0. Suppose M{j} (λ) ∈ Φ0 (U, V ) for some 0 ≤ j < r and all λ ∈ Ω satisfying L(λ) ∈ Φ0 (U, V ). Then, N [M{j} (λ0 )] is finite dimensional and, hence, there exists a projection Πj ∈ L(U ) with R[Πj ] = N [M{j} (λ0 )].
110
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
Thus, by definition, M{j+1} (λ0 ) = M{i} (λ0 )Πi + M{i} (λ0 ) is a sum of a finite-rank operator plus an element of Fred0 (U, V ), and, hence, it belongs to Fred0 (U, V ). If λ = λ0 and L(λ) ∈ Fred0 (U, V ), then, by definition, M{j+1} (λ) := (λ − λ0 )−1 M{j} (λ)RΠj (λ − λ0 ) and, hence, due to the induction hypothesis, M{j+1} (λ) is given by a product of a Fredholm operator of index zero with an invertible operator. Therefore, M{j+1} (λ) ∈ Fred0 (U, V ) (see the properties of Fredholm operators listed in the presentation of Part II). We now prove (5.3). By definition, for each λ ∈ Ω \ {λ0 }, M{1} (λ) = (λ − λ0 )−1 L(λ)RΠ0 (λ − λ0 ). Suppose (5.3) is satisfied by a particular j. Then, M{j+1} (λ) =(λ − λ0 )−1 M{j} (λ)RΠj (λ − λ0 ) =(λ − λ0 )−(j+1) L(λ)RΠ0 (λ − λ0 ) · · · RΠj (λ − λ0 ), which proves (5.3). To prove (5.4), let x ∈ N [Πj ] ∩ N [M{j+1} (λ0 )]. Then,
0 = M{j+1} (λ0 )x = M{i} (λ0 )Πi x + M{i} (λ0 )x = M{j} (λ0 )x
and, hence, x ∈ N [M{j} (λ0 )]. Therefore, 0 = Πj x = x. This proves (5.4), and, hence, Πj establishes a linear injection from N [M{j+1} (λ0 )] to N [M{j} (λ0 )] and, consequently, (5.5) holds. Suppose M{j} (λ0 ) is invertible for some j ≥ 0. Then, it follows from (5.5) that for each j ≤ k < r + 1, N [M{k} (λ0 )] = N [M{j} (λ0 )] = {0} and, hence, M{k} = M{j} , by definition. Bearing this in mind, we can introduce the following concepts of ascent and multiplicity. Definition 5.1.3. Let {M{j} }rj=0 be a derived sequence from L at λ0 . Then, the ascent of L at λ0 , denoted by α[L; λ0 ], is defined as follows:
5.1. Derived families and factorization
111
• α[L; λ0 ] equals the least j ∈ N ∩ [0, r] for which M{j} (λ0 ) ∈ Iso(U, V ), if such a j exists. • α[L; λ0 ] = ∞, if r = ∞ and dim N [M{j} (λ0 )] ≥ 1 for all j ∈ N. For every integer 0 ≤ j ≤ r, the jth partial µ-multiplicity of L at λ0 is defined through j µj [L; λ0 ] := dim N [M{i} (λ0 )], i=0
and the µ-multiplicity of the operator family L at λ0 , denoted by µ[L; λ0 ], is defined by: • µ[L; λ0 ] := µα[L;λ0 ] [L; λ0 ], if α[L; λ0 ] < ∞. • µ[L; λ0 ] := ∞, if α[L; λ0 ] = ∞. The ascent α[L; λ0 ] and the µ-multiplicity µ[L; λ0 ] are left undefined when r ∈ N, the family L is of class C r , but L is not of class C r+1 in any neighborhood of λ0 , and M{r} (λ0 ) is not invertible. Moreover, we have actually defined α[L; λ0 ] = µ[L; λ0 ] = 0 if L0 ∈ Iso(U, V ). Conversely, L0 ∈ Iso(U, V ) if α[L; λ0 ] = 0 or µ[L; λ0 ] = 0. The concepts introduced by Definition 5.1.3 are consistent, in the sense that they do not vary when the sequence of derived families changes. Indeed, ˆ {j} }r let {M{j} }rj=0 and {M j=0 be two arbitrary derived sequences from L at λ0 with corresponding projections {Πj }rj=0 and {Πˆj }rj=0 , respectively. We claim that for each 0 ≤ j < r + 1 there exists a polynomial Θj ∈ P[L(U )] such that Θj (λ0 ) ∈ Iso(U ) and ˆ {j} (λ) = M{j} (λ)Θj (λ), M
λ ∈ Ω.
(5.6)
This actually shows the consistency of Definition 5.1.3, because it implies ˆ {j} (λ0 )] = dim N [M{j} (λ0 )], dim N [M
j ∈ N ∩ [0, r].
To prove the previous claim we proceed by induction on j. Assume j = 0. Then, (5.6) is satisfied with λ ∈ K, Θ0 (λ) = IU , since ˆ {0} = M{0} = L. M Now, assume that (5.6) is satisfied for some particular j ≥ 0 and that Θj and Θ−1 j are polynomials. Then, ˆ {j} (λ0 )]) = N [M{j} (λ0 )] Θj (λ0 )(N [M
112
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
and, hence, ˆ j = Θj (λ0 )Π ˆj, Πj Θj (λ0 )Π
ˆ j Θj (λ0 )−1 Πj = Θj (λ0 )−1 Πj . Π
(5.7)
Thus, using the induction hypothesis and (5.2), one obtains that, for each λ ∈ Ω \ {λ0 }, ˆ j (λ)R ˆ (λ − λ0 ) ˆ {j+1} (λ) = (λ − λ0 )−1 M M Πj = (λ − λ0 )−1 M{j} (λ)Θj (λ)RΠˆ j (λ − λ0 ) = (λ − λ0 )−1 M{j} (λ)RΠj (λ − λ0 )Θj+1 (λ)
(5.8)
= M{j+1} (λ)Θj+1 (λ), where Θj+1 is defined through Θj+1 (λ) := RΠj ((λ − λ0 )−1 )Θj (λ)RΠˆ j (λ − λ0 ),
λ ∈ K \ {λ0 },
whose inverse is given by Θj+1 (λ)−1 = RΠˆ j ((λ − λ0 )−1 )Θj (λ)−1 RΠj (λ − λ0 ),
λ ∈ K \ {λ0 }.
It remains to show that the families Θj+1 and Θ−1 j+1 are indeed polynomials when extended to K by passing to the limit as λ → λ0 . The unique doubtful terms in their developments are ˆj (λ − λ0 )−1 (IU − Πj )Θj (λ)Π
ˆ j )Θj (λ)−1 Πj , and (λ − λ0 )−1 (IU − Π
respectively, but, actually, owing to (5.7), we have that ˆ j = 0 and (IU − Π ˆ j )Θj (λ0 )−1 Πj = 0. (IU − Πj )Θj (λ0 )Π As, according to the induction hypothesis Θj and Θ−1 j are polynomials, necessarily so are Θj+1 and Θ−1 . Finally, passing to the limit as λ → λ0 in (5.8) shows also j+1 that ˆ {j+1} (λ0 ) = M{j+1} (λ0 )Θj+1 (λ0 ). M This concludes the induction and proves the consistency of Definition 5.1.3. The next result shows that the ascent α[L; λ0 ] and the multiplicity µ[L; λ0 ] are invariant by pre- and post-multiplication of local isomorphism families. ˆ ∈ C r (Ω, L(U, V )) with L0 ∈ Fred0 (U, V ). Proposition 5.1.4. Suppose r ≥ 1 and L, L r ˆ = LΦ, then If there exist Φ ∈ C (Ω, L(U )) such that Φ0 ∈ Iso(U ) and L ˆ λ0 ] = µj [L; λ0 ], µj [L;
0 ≤ j < r + 1.
(5.9)
ˆ λ0 ] = µ[L; λ0 ] µ[L;
(5.10)
Consequently, ˆ λ0 ] = α[L; λ0 ] α[L;
and
if µ[L; λ0 ] is defined. Similarly, (5.9) and (5.10) are satisfied if there exists Ψ ∈ C r (Ω, L(V )) with ˆ = ΨL. Ψ0 ∈ Iso(V ) such that L
5.1. Derived families and factorization
113
Proof. Note that ˆ 0 = L0 Φ0 ∈ Fred0 (U, V ). L By making Ω smaller, if necessary, we can suppose, without loss of generality, that Φ(λ) ∈ Iso(U ) for all λ ∈ Ω. ˆ {j} }r ˆ Let {M{j} }rj=0 and {M j=0 be two derived sequences from L and L, r r respectively, at λ0 with corresponding projections {Πj }j=0 and {Πˆj }j=0 . As in the proof of the consistency of Definition 5.1.3, it suffices to show that, for each 0 ≤ j < r + 1, there exists Θj ∈ C r−j (Ω, L(U )) such that Θj (λ0 ) ∈ Iso(U ) and ˆ {j} = M{j} Θj . M
(5.11)
Similarly, the proof of (5.11) involves an induction argument. Clearly, when j = 0, equality (5.11) holds true with Θ0 := Φ ∈ C r (Ω, L(U )). Suppose (5.11) holds for a particular 0 ≤ j < r and some Θj ∈ C r−j (Ω, L(U )) with Θ(λ0 ) ∈ Iso(U ). Then, for each λ ∈ Ω \ {λ0 }, it follows from (5.11) and the definition of derived family that ˆ {j+1} (λ) = M{j+1} (λ)Θj+1 (λ), M where
(5.12)
Θj+1 (λ) := RΠj ((λ − λ0 )−1 )Θj (λ)RΠˆ j (λ − λ0 ).
Note that, for each λ ∈ Ω \ {λ0 }, Θj+1 (λ)−1 = RΠˆ j ((λ − λ0 )−1 )Θj (λ)−1 RΠj (λ − λ0 ), and that Θ−1 ∈ C r−j (Ω, L(U )) as well. As in the proof of the consistency, it is j apparent from the induction hypothesis that ˆ j = Θj (λ0 )Π ˆj, Πj Θj (λ0 )Π
ˆ j Θj (λ0 )−1 Πj = Θj (λ0 )−1 Πj , Π
and, therefore, ˆ j = (IU − Πj )Θj (λ0 )Π ˆj, lim (λ − λ0 )−1 (IU − Πj )Θj (λ)Π
λ→λ0
ˆ j )Θj (λ)−1 Πj = (IU − Π ˆ j )[Θ−1 ] (λ0 )Πj . lim (λ − λ0 )−1 (IU − Π j
λ→λ0
In particular, the operators Θj+1 (λ0 ) := lim Θj+1 (λ) λ→λ0
and
lim Θj+1 (λ)−1
λ→λ0
are well defined and mutually inverse. Consequently, the families Θj+1 and Θ−1 j+1 are of class C r−j−1 in Ω. Passing to the limit as λ → λ0 in (5.12) completes the proof of the first claim. The proof of the last assertion of the statement is proposed in Exercise 1.
114
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
Chapter 7 will provide a general version of Proposition 5.1.4, where the regularity assumptions imposed on the isomorphisms families are shown to be superfluous.
5.2 Connections between χ and µ This section reveals the rather hidden connections between the multiplicity µ[L; λ0 ] introduced by Definition 5.1.3 and the multiplicity χ[L; λ0 ] introduced by Definition 4.3.3. As a by-product, it will become apparent that µ[L; λ0 ] < ∞ if λ0 ∈ Algν (L) for some integer 0 ≤ ν < r + 1. In such a case, according to Definition 4.3.3, the multiplicity χ[L; λ0 ] is well defined and finite. It turns out that # µ[L; λ0 ] = χ[L; λ0 ] if λ0 ∈ Algν (L). (5.13) 0≤ν
The proof of (5.13) is based on the next result. Theorem 5.2.1. Suppose r ≥ 0, the family L ∈ C r (Ω, L(U, V )) satisfies L0 ∈ Fred0 (U, V ), and, for some k ∈ N ∩ [0, r], the linear spaces k−1 6
R[L0 ], L1 (N [L0 ]), . . . , Lk (
N [Lj ])
(5.14)
j=0
are in direct sum. Then, for every sequence {M{j} }rj=0 of derived families from L at λ0 , (5.15) N [M{i} (λ0 )] = N [L0 ] ∩ · · · ∩ N [Li ], for all i ∈ {0, . . . , k}, and µk−1 [L; λ0 ] =
k j=1
j−1 6
j · dim Lj (
N [Li ])+k · dim N [M{k} (λ0 )].
(5.16)
i=0
Proof. Let {M{j} }rj=0 be a sequence of derived families from L at λ0 with corresponding sequence of projections {Πj }rj=0 . Proving (5.15) requires induction. By construction, N [M{0} (λ0 )] = N [L0 ]. Now, take 1 ≤ j ≤ k and assume that (5.15) is satisfied for each 0 ≤ i ≤ j − 1. Then, for each 0 ≤ ≤ i ≤ j − 1, N [M{i} (λ0 )] ⊂ N [M{} (λ0 )]
5.2. Connections between χ and µ
115
and, hence, (IU − Π )Πi = 0, (IU − Π )(IU − Πi ) = IU − Π .
Π Πi = Πi , Π (IU − Πi ) = Π − Πi ,
(5.17)
Now, it follows from (5.1) and (5.17) that, for every λ ∈ Ω, RΠ0 (λ − λ0 )RΠ1 (λ − λ0 ) · · · RΠj−1 (λ − λ0 ) = Πj−1 +
j−1 (λ − λ0 )i Πj−i−1 (IU − Πj−i ) + (λ − λ0 )j (IU − Π0 ).
(5.18)
i=1
On the other hand, according to (5.3), M{j} (λ) = (λ − λ0 )−j
j
(λ − λ0 )i Li + o((λ − λ0 )j )
i=0
(5.19)
· RΠ0 (λ − λ0 )RΠ1 (λ − λ0 ) · · · RΠj−1 (λ − λ0 ). Therefore, substituting (5.18) into (5.19) and using the induction hypothesis demonstrate that M{j} (λ0 ) = L0 (IU − Π0 ) +
j−1
Li Πi−1 (IU − Πi ) + Lj Πj−1 .
(5.20)
Li (N [L0 ] ∩ · · · ∩ N [Li−1 ]) ⊕ R[L0 ].
(5.21)
i=1
In particular, by (5.20), R[M{j} (λ0 )] ⊂
j i=1
Now we will prove that N [M{j} (λ0 )] ⊂ N [L0 ] ∩ · · · ∩ N [Lj ].
(5.22)
Take u0 ∈ N [M{j} (λ0 )]. Then, using (5.20) and (5.21), we observe that, for each 1 ≤ i ≤ j − 1, 0 = L0 (I − Π0 )u0 = Li Πi−1 (I − Πi )u0 = Lj Πj−1 u0 .
(5.23)
On the other hand, it follows from the definition of Π0 that Π0 u0 ∈ N [M{0} (λ0 )] = N [L0 ] and so L0 Π0 u0 = 0. Thus, the first equality of (5.23) implies L0 u0 = 0. In particular, Π0 u0 = u0 .
116
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
Now, fix 0 ≤ ≤ j − 2 and assume u0 ∈ N [L0 ] ∩ · · · ∩ N [L ].
(5.24)
By (5.17), equation (5.23) implies that 0 = L+1 Π (IU − Π+1 )u0 = L+1 (Π u0 − Π+1 u0 ) = L+1 Π u0 , since Π+1 u0 ∈ N [M{+1} (λ0 )] = N [L0 ] ∩ · · · ∩ N [L+1 ] ⊂ N [L+1 ], because of the induction hypothesis. Thus, Π u0 ∈ N [L+1 ]. On the other hand, using the induction hypothesis, we find from (5.24) that u0 ∈ N [M{} (λ0 )]. Hence, Π u0 = u0 and, therefore, u0 ∈ N [L0 ] ∩ · · · ∩ N [L+1 ]. We have just proved that u0 ∈ N [L0 ] ∩ · · · ∩ N [Lj−1 ].
(5.25)
Moreover, it follows from the last identity of (5.23) that Πj−1 u0 ∈ N [Lj ], and, using the induction assumption, (5.25) implies u0 ∈ N [M{j−1} (λ0 )]. Therefore, Πj−1 u0 = u0 and u0 ∈ N [L0 ] ∩ · · · ∩ N [Lj ],
(5.26)
which concludes the proof of (5.22). Now, we prove the converse inclusion of (5.22). Suppose (5.26). By the induction hypothesis, u0 ∈ N [M{0} (λ0 )] ∩ · · · ∩ N [M{j−1} (λ0 )], and, therefore, Π0 u0 = · · · = Πj−1 u0 = u0 .
5.2. Connections between χ and µ
117
By (5.20), these equalities imply M{j} (λ0 )u0 = Lj u0 = 0, which concludes the proof of (5.15). Finally, by (5.15), Proposition 4.2.2 shows that, for each 0 ≤ i ≤ k − 1, dim N [M{i} (λ0 )] = dim N [M{i+1} (λ0 )] + dim Li+1 (N [M{i} (λ0 )]). Thus, for each 0 ≤ ≤ k − 1, k−1
dim N [M{i} (λ0 )] =
i=
k−1
dim Li+1 (N [M{i} (λ0 )]) + dim N [M{i+1} (λ0 )]
i=
=
k
dim Li (N [M{i−1} (λ0 )])
i=+1
+
k−1
dim N [M{i} (λ0 )] + dim N [M{k} (λ0 )].
i=+1
Therefore, iterating the previous identity gives k−1
dim N [M{i} (λ0 )] =
i=0
k
j · dim Lj (N [M{j−1} (λ0 )])+k · dim N [M{k} (λ0 )],
j=1
since dim N [M{k−1} (λ0 )] = dim Lk (N [M{k−1} (λ0 )]) + dim N [M{k} (λ0 )].
This proves (5.16) and concludes the proof.
Based on Theorem 5.2.1, Proposition 5.1.4 and Theorem 4.3.2, we can obtain the main result of this section. Theorem 5.2.2. Suppose r ∈ N∪{∞}, the family L ∈ C r (Ω, L(U, V )) satisfies L0 ∈ Fred0 (U, V ), and λ0 ∈ Algν (L) for some integer 1 ≤ ν ≤ r. Let Φ ∈ C r (Ω, L(U )) satisfy Φ0 ∈ Iso(U ) and λ0 is a k-transversal eigenvalue of LΦ := LΦ for some k ∈ {1, . . . , ν}. Then α[L; λ0 ] = k and µj [L; λ0 ] = µ[L; λ0 ] = χ[L; λ0 ], {M{j} }rj=0
Proof. Let nition 4.3.3,
k − 1 ≤ j < r + 1,
be a sequence of derived families from LΦ at λ0 . By Defi-
χ[L; λ0 ] =
k h=1
Φ Φ h dim LΦ h (N [L0 ] ∩ · · · ∩ N [Lh−1 ])
118
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
and, according to Proposition 5.1.4, α[L; λ0 ] = α[LΦ ; λ0 ] and 0 ≤ j < r + 1.
µj [L; λ0 ] = µj [LΦ ; λ0 ]
Thus, to complete the proof, it suffices to show α[LΦ ; λ0 ] = k and Φ
µj [L ; λ0 ] =
k
Φ Φ h dim LΦ h (N [L0 ] ∩ · · · ∩ N [Lh−1 ])
(5.27)
h=1
for each integer k − 1 ≤ j ≤ r. Indeed, as λ0 is a k-transversal eigenvalue of LΦ , by Proposition 4.2.2, Φ N [LΦ 0 ] ∩ · · · ∩ N [Lk ] = {0} and, hence, due to Theorem 5.2.1, N [M{j} (λ0 )] = {0},
k ≤ j < r + 1.
(5.28)
On the other hand, since λ0 is a k-transversal eigenvalue of LΦ , Φ N [LΦ 0 ] ∩ · · · ∩ N [Lk−1 ] = {0}
and, hence, thanks again to Theorem 5.2.1, we find that N [M{k−1} (λ0 )] = {0}. Therefore, k is the least natural number j ≥ 0 for which M{j} (λ0 ) is invertible. Consequently, α[LΦ ; λ0 ] = k, by Definition 5.1.3. Finally, (5.27) follows straight from (5.16) and (5.28).
5.3 Coincidence of the multiplicities χ and µ This section shows that both multiplicities χ and µ are defined if and only if either r = ∞, or r ∈ N and λ0 ∈ Algν (L) for some integer ν ∈ {0, . . . , r}; in any of these cases, µ = χ. Moreover, it reveals that the multiplicity of L at λ0 exists and is finite if and only if λ0 ∈ Algν (L) for some 0 ≤ ν < r + 1. In particular, in the second assertion of Theorem 4.3.2, the assumption that λ0 is an algebraic eigenvalue of L is not only sufficient for its validity, but also necessary. Precisely, the following result is satisfied. Theorem 5.3.1 (of coincidence and finiteness of χ and µ). Let r ∈ N ∪ {∞} and L ∈ C r (Ω, L(U, V )) be with L0 ∈ Fred0 (U, V ). Then the following assertions are equivalent: i) λ0 ∈ Algν (L) for some integer 0 ≤ ν ≤ r. ii) µ[L; λ0 ] is defined and finite.
5.3. Coincidence of the multiplicities χ and µ
119
iii) There exist an integer 0 ≤ k ≤ r and a family Φ ∈ C r (Ω, L(U )) with Φ0 ∈ Iso(U ) for which λ0 is a k-transversal value of LΦ := LΦ. iv) There exist an integer 0 ≤ k ≤ r and a polynomial Φ ∈ P[L(U )] with Φ0 = IU for which λ0 is a k-transversal value of LΦ := LΦ. Moreover, in such a case, α[L; λ0 ] = k = ν
and
µ[L; λ0 ] = χ[L; λ0 ].
(5.29)
Furthermore, µ[L; λ0 ] = ∞ if and only if χ[L; λ0 ] = ∞; and µ[L; λ0 ] is undefined if and only if so is χ[L; λ0 ]. In any of these cases, for every integer 1 ≤ k ≤ r, the subspace Vk constructed in Theorem 4.3.2 is a proper subspace of V . Proof. The conclusions follow straight away from the definitions if L0 is an isomorphism. So, throughout the proof, we will assume that λ0 ∈ Eig(L). Suppose µ[L; λ0 ] < ∞ and set := α[L; λ0 ] ≥ 1. Let {M{j} }rj=0 be any sequence of derived families from L at λ0 , with corresponding sequence of projections {Πj }rj=0 . By Definition 5.1.3, the operator M{} (λ0 ) is an isomorphism. Moreover, according to (5.3), for each λ ∈ Ω \ {λ0 }, M{} (λ) = (λ − λ0 )− L(λ)RΠ0 (λ − λ0 ) · · · RΠ−1 (λ − λ0 ). Since M{} (λ0 ) is invertible, then M{} (λ) ∈ Iso(U, V ) for each λ ∼ λ0 , and, therefore, L(λ) ∈ Iso(U, V ) if λ ∼ λ0 with λ = λ0 . Thus, for each λ ∼ λ0 with λ = λ0 , L(λ)−1 = (λ − λ0 )− RΠ0 (λ − λ0 ) · · · RΠ−1 (λ − λ0 )M{} (λ)−1 .
(5.30)
Consequently, by (5.30), there exists a constant C > 0 such that L(λ)−1 ≤ C|λ − λ0 |− ,
λ ∼ λ0 , λ = λ0 .
This shows that λ0 ∈ Algν (L) for some ν ∈ {1, . . . , }. Moreover, according to Theorem 4.3.2, there exist k ∈ {1, . . . , ν} and a polynomial Φ ∈ P[L(U )] with Φ0 = IU for which λ0 is a k-transversal eigenvalue of LΦ. In particular, k ≤ ν ≤ = α[L; λ0 ]. According to Theorem 5.2.2, we actually have k = α[L; λ0 ] and µ[L; λ0 ] = µk−1 [L; λ0 ] = χ[L; λ0 ]. Therefore, (5.29) holds.
120
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
Reciprocally, when λ0 ∈ Algν (L) for some integer 1 ≤ ν < r+1, by Theorems 4.3.2 and 5.2.2, L admits a transversalizing polynomial Φ and k = α[L; λ0 ] ≤ ν
and µ[L; λ0 ] = χ[L; λ0 ] < ∞.
This shows (5.29). Finally, assume that either α[L; λ0 ] equals infinity or it is not defined. Then N [M{j} (λ0 )] = {0}
for each 0 ≤ j < r + 1.
(5.31)
For each integer 1 ≤ k ≤ r, let Vk be any of the subspaces of V constructed in Theorem 4.3.2. If Vk = V for some 1 ≤ k < r + 1, then, owing to Propositions 4.2.2, 5.1.4 and Theorem 5.2.1, the operator M{k} (λ0 ) must be an isomorphism, which contradicts (5.31). Therefore, Vk V
for each integer 1 ≤ k ≤ r.
Consequently, in the case r = ∞, α[L; λ0 ] = ∞ and µ[L; λ0 ] = χ[L; λ0 ] = ∞, by definition, whereas neither α, µ nor χ are defined if r ∈ N.
According to Theorem 5.3.1, throughout the rest of this book we may use the notation χ[L; λ0 ] for the µ-multiplicity introduced by Definition 5.1.3. We will sometimes set χj [L; λ0 ] := µj [L; λ0 ], 0 ≤ j < r + 1. (5.32) For each integer 0 ≤ j ≤ r, the number χj [L; λ0 ] will be referred to as the jth partial algebraic µ-multiplicity of L at λ0 , or as the jth partial algebraic χ-multiplicity of L at λ0 . From now on, given a finite-rank projection P ∈ L(U ), we will consider the polynomial family CP ∈ P[L(U )] defined by CP (t) := tP + IU − P,
t ∈ K.
(5.33)
According to (5.1) and (5.2), RP (t)−1 = RP (t−1 ) = t−1 CP (t),
t ∈ K \ {0}.
(5.34)
Consequently, CP (t) is invertible for all t ∈ K \ {0}, and (5.3) can be equivalently written in the form L(λ) = M{j} (λ)CΠj−1 (λ − λ0 ) · · · CΠ0 (λ − λ0 ). As a by-product of Theorem 5.3.1, the next corollary is found.
(5.35)
5.4. A formula for the partial µ-multiplicities
121
Corollary 5.3.2. Let r ∈ N∪{∞} and L ∈ C r (Ω, L(U, V )) be with L0 ∈ Fred0 (U, V ). Then, the following characterizations, describing mutually exclusive options, hold true: (a) L0 ∈ Iso(U, V ) if and only if χ[L; λ0 ] = 0. (b) λ0 ∈ Algν (L) for some integer 1 ≤ ν ≤ r if and only if there exist M ∈ C r−ν (Ω, L(U, V )) with M0 ∈ Iso(U, V ), and ν finite-rank projections P0 , . . . , Pν−1 ∈ L(U ) \ {0} such that L(λ) = M(λ)CPν−1 (λ − λ0 ) · · · CP0 (λ − λ0 ),
λ ∈ Ω.
(5.36)
Moreover, in such a case, χ[L; λ0 ] =
ν−1
rank Pi .
i=0
5 / 0≤ν
5.4 A formula for the partial µ-multiplicities The following result provides us with a finite algorithm to calculate the jth partial χ-multiplicities of a family L of class C r at any λ0 ∈ Algν (L) with ν < r + 1. Theorem 5.4.1. Let r ∈ N∪{∞} and L ∈ C r (Ω, L(U, V )) be with L0 ∈ Fred0 (U, V ). Suppose λ0 ∈ Algν (L) for some integer 1 ≤ ν ≤ r. Let Φ ∈ C r (Ω, L(U )) be such that Φ0 ∈ Iso(U ), for which λ0 is a ν-transversal eigenvalue of LΦ := LΦ, and set j := dim LΦ j
6 j−1
N [LΦ i ] ,
1 ≤ j ≤ ν,
i=0
A := (aij )1≤i,j≤ν ∈ Mν (R),
aij := min{i, j},
1 ≤ i, j ≤ ν.
Then, the matrix A is invertible and col[χ0 [L; λ0 ], . . . , χν−1 [L; λ0 ]] = A col[ 1 , . . . , ν ]. In particular, χ[L; λ0 ] = χν−1 [L; λ0 ] =
ν j=1
j j .
122
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
Proof. The existence of the transversalizing family Φ is guaranteed by Theorem 5.3.1. Moreover, by (5.32) and Proposition 5.1.4, χj [L; λ0 ] = χj [LΦ ; λ0 ],
0 ≤ j ≤ ν − 1.
Let {M{j} }rj=0 be a sequence of derived families from LΦ at λ0 . Then, thanks to Theorem 5.2.1, Φ N [M{i} (λ0 )] = N [LΦ 0 ] ∩ · · · ∩ N [Li ],
0 ≤ i ≤ ν,
and, hence, χj [L; λ0 ] =
j
Φ dim N [LΦ 0 ] ∩ · · · ∩ N [Li ],
0 ≤ j ≤ ν − 1.
i=0
Consequently, thanks to Proposition 4.2.2, we find that χj [L; λ0 ] =
j ν
h =
i=0 h=i+1
ν
min{h, j + 1} h
h=1
for each 0 ≤ j ≤ ν − 1. The invertibility of the matrix A is evident.
5.5 Removable singularities This section consists of the proof of Theorem 5.0.1. Let r ∈ N ∪ {∞} and L ∈ C r (Ω, L(U, V )), with L0 ∈ Fred0 (U, V ), be such that (λ−λ0 )ν L(λ)−1 exists and is bounded for λ in Ω \ {λ0 }, for some integer 0 ≤ ν ≤ r. Then, λ0 ∈ Algk (L) for some k ∈ {0, . . . , ν}. Suppose k = 0. Then, L0 ∈ Iso(U, V ) and, hence, the family L−1 is of class r C in a neighborhood of λ0 . So we are done in this case. Suppose k ≥ 1. Then, by Corollary 5.3.2(b), there exist k finite-rank projections P0 , . . . , Pk−1 ∈ L(U ) \ {0} and M ∈ C r−k (Ω, L(U, V )) for which M0 ∈ Iso(U, V ) and (5.36) is satisfied, where the number ν in (5.36) is to be replaced with k. As M0 is an isomorphism, there exists Ω ⊂ Ω, with λ0 ∈ Ω , such that the family M−1 is of class C r−k in Ω . By (5.36) and (5.34), it is apparent that, for each λ ∈ Ω \ {λ0 }, L(λ)−1 = CP0 (λ − λ0 )−1 · · · CPk−1 (λ − λ0 )−1 M(λ)−1 = (λ − λ0 )−k RP0 (λ − λ0 ) · · · RPk−1 (λ − λ0 )M(λ)−1
5.6. The product formula
123
and, consequently, (λ − λ0 )k L(λ)−1 = RP0 (λ − λ0 ) · · · RPk−1 (λ − λ0 )M(λ)−1 .
(5.37)
As the right-hand side of (5.37) is of class C r−k in Ω , it indeed provides us with an extension of class C r−k of the function λ → (λ − λ0 )k L(λ)−1 to Ω , which concludes the proof of Theorem 5.0.1, because ν ≥ k.
5.6 The product formula This section shows that the multiplicity of the product of two families equals the sum of their multiplicities. This property will be referred to as the product formula. It is a pivotal property, because it is the basis of all uniqueness results of Chapter 6. Theorem 5.6.1 (product formula). Let U, V, W be three K-Banach spaces, r, s ∈ N ∪ {∞}, and L ∈ C r (Ω, L(U, V )), M ∈ C s (Ω, L(W, U )), with L0 ∈ Fred0 (U, V ) and M0 ∈ Fred0 (W, U ), such that the algebraic multiplicities χ[L; λ0 ] and χ[M; λ0 ] are well defined, and min{r, s} ≥ α[L; λ0 ] + α[M; λ0 ].
(5.38)
Then, χ[LM; λ0 ] is well defined, max {α[L; λ0 ], α[M; λ0 ]} ≤ α[LM; λ0 ] ≤ α[L; λ0 ] + α[M; λ0 ],
(5.39)
and χ[LM; λ0 ] = χ[L; λ0 ] + χ[M; λ0 ].
(5.40)
Remark 5.6.2. According to Theorem 5.3.1, given q ∈ N ∪ {∞} and a family N ∈ C q (Ω, L(U, V )) with N0 ∈ Fred0 (U, V ), the algebraic multiplicity χ[N; λ0 ] is well defined if and only if either q = ∞, or q ∈ N and λ0 ∈ Algk (L) for some k ∈ {0, . . . , q}. Identity (5.40) will be referred to as the product formula. By Corollary 5.3.2, the proof of Theorem 5.6.1 may be based on the special case emphasized by the next result. Proposition 5.6.3. Suppose L ∈ C r (Ω, L(U, V )) for some r ∈ N∪{∞}, the operator L0 ∈ Fred0 (U, V ), and λ0 ∈ Algk (L) for some integer 0 ≤ k ≤ r. Then, for every finite-rank projection Q ∈ L(U ) \ {0}, χ[CQ (· − λ0 ); λ0 ] = rank Q,
(5.41)
124
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
where CQ (t) = tQ + IU − Q,
t ∈ K.
If, in addition, the function λ → L(λ)CQ (λ − λ0 )
belongs to
C k+1 (Ω, L(U, V )),
(5.42)
then χ[LCQ (· − λ0 ); λ0 ] = χ[L; λ0 ] + rank Q.
(5.43)
Remark 5.6.4. The assumption (5.42) is crucial for the validity of this result. In some sense, this condition imposes that L is a first-order derived family from LCQ (· − λ0 ) at λ0 with corresponding projection Q. As λ0 may be a (k + 1)algebraic eigenvalue of LCQ (· − λ0 ), the multiplicity of LCQ (· − λ0 ) at λ0 might not be defined if (5.42) fails. This explains why we are imposing the restriction (5.38) on the regularity of the families in the statement of Theorem 5.6.1. It is satisfied if r = s = ∞, of course. Proof. To simplify the notation, we simply set C(λ) := CQ (λ − λ0 ) = (λ − λ0 )Q + IU − Q,
λ ∈ K.
Then, C0 = IU − Q and C1 = Q; therefore, N [C0 ] = R[Q],
R[C0 ] = N [Q],
N [Q] ⊕ R[Q] = U,
because Q2 = Q. Moreover, C1 (N [C0 ]) = Q(R[Q]) = R[Q], and, therefore, C1 (N [C0 ]) ⊕ R[C0 ] = R[Q] ⊕ N [Q] = U. Consequently, λ0 is a 1-transversal eigenvalue of C and, according to Definition 4.3.3, χ[C; λ0 ] = dim C1 (N [C0 ]) = dim R[Q] = rank Q. This concludes the proof of (5.41). The proof of (5.43) will proceed by induction on k ≥ 0. Suppose k = 0. Then, ˜ defined by by definition, L0 ∈ Iso(U, V ). By (5.42), the map L ˜ L(λ) := L(λ)CQ (λ − λ0 ),
λ ∈ Ω,
˜ because of (5.34). Thus, acbelongs to C 1 (Ω, L(U, V )). Moreover, λ0 ∈ Alg1 (L), ˜ cording to Theorem 5.3.1, χ[L; λ0 ] is well defined and finite. Necessarily, ˜ 0 = L0 (IU − Q), L
˜ 1 = L0 Q + A(IU − Q), L
5.6. The product formula
125
for a certain operator A, and, since L0 ∈ Iso(U, V ), we have that ˜ 0 ] = R[Q], N [L
˜ 0 ] = L0 (N [Q]), R[L
˜ 1 (N [L ˜ 0 ]) = L0 (R[Q]). L
Consequently, since U = N [Q] ⊕ R[Q] and, hence, V = L0 (N [Q]) ⊕ L0 (R[Q]), we find that ˜ 1 (N [L ˜ 0 ]) ⊕ R[L ˜ 0 ] = V. L Therefore, ˜ 1 (N [L ˜ 0 ]) = dim L0 (R[Q]) = dim R[Q], ˜ λ0 ] = dim L χ[L; which concludes the proof of (5.43) in the case k = 0. Suppose k ≥ 1, fix 0 ≤ s < k, and assume that χ[MCQ (· − λ0 ); λ0 ] = χ[M; λ0 ] + rank Q for all families M of class C s such that λ0 ∈ Algj (M) for some j ∈ {0, . . . , s} and all finite-rank projections Q ∈ L(U ) \ {0} for which MCQ (· − λ0 ) ∈ C s+1 (Ω, L(U, V )). Let L ∈ C s+1 (Ω, L(U, V )) be such that λ0 ∈ Algs+1 (L), and Q ∈ L(U ) \ {0} a finite-rank projection such that LCQ (· − λ0 ) ∈ C s+2 (Ω, L(U, V )). Since the spaces N [Q] ∩ N [L0 ] and R[Q] are finite dimensional and their intersection equals {0}, there exists a projection P ∈ L(U ) such that R[P ] = N [Q] ∩ N [L0 ],
R[Q] ⊂ N [P ].
Then, P Q = QP = 0.
(5.44)
Consequently, (P + Q)2 = P 2 + Q2 = P + Q and, therefore, P + Q is a finite-rank projection for which R[P + Q] = R[P ] ⊕ R[Q],
rank(P + Q) = rank P + rank Q.
Indeed, due to (5.44), for all x, y ∈ U we have that P x + Qy = P 2 x + Q2 y = (P + Q)(P x + Qy) ∈ R[P + Q]
(5.45)
126
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
and, hence, R[P ] + R[Q] ⊂ R[P + Q]. This shows that R[P + Q] = R[P ] + R[Q]. Now, let x ∈ R[P ] ∩ R[Q]. Then, x = P x = Qx and, hence, P x = P Qx = 0
and (IU − P )x = (IU − P )P x = 0,
which implies x = 0. Therefore, (5.45) holds. It turns out that, in addition, N [L(λ0 )CQ (0)] = R[P + Q].
(5.46)
Indeed, since R[P ] ⊂ N [L0 ], (5.44) implies L(λ0 )CQ (0)(P + Q) = L0 (IU − Q)(P + Q) = L0 P = 0 and, hence, R[P + Q] ⊂ N [L(λ0 )CQ (0)]. On the other hand, for any u ∈ N [L(λ0 )CQ (0)] = N [L0 (IU − Q)] we have that (IU − Q)u ∈ N [L0 ] ∩ N [Q] = R[P ] and, hence, using (5.45) gives u ∈ R[P ] + R[Q] = R[P + Q], which concludes the proof of (5.46). Thanks to (5.46), P +Q is a projection onto N [L(λ0 )CQ (0)] and, hence, there exists a sequence of derived families {M{j} }s+2 j=0 from the family Ω λ → L(λ)CQ (λ − λ0 ) at λ0 with corresponding projections {Pj }s+2 j=0 such that P0 = P + Q. The family M{1} is of class C s+1 and, according to (5.3), for each λ ∈ Ω \ {λ0 }, M{1} (λ) = (λ − λ0 )−1 L(λ)CQ (λ − λ0 )RP +Q (λ − λ0 ).
(5.47)
5.6. The product formula
127
Moreover, by Definition 5.1.3, Theorem 5.3.1, and (5.45), we can infer from (5.47) that (5.48) χ[LCQ (· − λ0 ); λ0 ] = χ[M{1} ; λ0 ] + rank P + rank Q. On the other hand, due to (5.44), CQ (t)RP +Q (t) = (tQ + IU − Q)[P + Q + t(IU − P − Q)] = P + t(IU − P ) = RP (t) for each t ∈ K, and, consequently, we can express (5.47) in the form M{1} (λ) = (λ − λ0 )−1 L(λ)RP (λ − λ0 ),
λ ∈ Ω \ {λ0 }.
(5.49)
Since N [L0 ] is a finite-dimensional space containing R[P ], and N [P ] is a finite codimensional subspace, because R[P ] is finite dimensional and U = N [P ] ⊕ R[P ], then, there exists a projection Π ∈ L(U ) such that R[Π] = N [L0 ],
N [Π] ⊂ N [P ].
Let {N{j} }s+1 j=0 be a sequence of derived families from L at λ0 with corresponding s projections {Πj }s+1 j=0 for which Π0 = Π. Then, N{1} is of class C and, according to (5.3), N{1} (λ) = (λ − λ0 )−1 L(λ)RΠ (λ − λ0 ),
λ ∈ Ω \ {λ0 }.
(5.50)
Moreover, by Definition 5.1.3 and Theorem 5.3.1, χ[L; λ0 ] = χ[N{1} ; λ0 ] + rank Π,
(5.51)
and λ0 is an algebraic value of N{1} of order α[N{1} ; λ0 ] = s. In addition, substituting (5.50) into (5.49) and using (5.2) show that M{1} (λ) = N{1} (λ)RΠ (λ − λ0 )−1 RP (λ − λ0 )
(5.52)
(5.53)
for each λ ∈ Ω \ {λ0 }. To simplify the right-hand side of (5.53), we still need some additional information. As R[P ] ⊂ R[Π], we have that ΠP = P . Also, P Π = P , since N [Π] ⊂ N [P ]. Thus, P Π = ΠP = P (5.54) and, hence, (Π − P )2 = Π − P. Consequently, R[Π] = R[Π − P ] ⊕ R[P ]
128
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
and, therefore rank(Π − P ) = rank Π − rank P.
(5.55)
Also, again by (5.54), we have that, for each t ∈ K \ {0}, RΠ (t−1 ) RP (t) = [Π + t−1 (IU − Π)][P + t(IU − P )] = t(Π − P ) + IU − Π + P = CΠ−P (t) and, hence, (5.53) becomes M{1} (λ) = N{1} (λ)CΠ−P (λ − λ0 ),
λ ∈ Ω.
Note that N{1} is of class C s , and that M{1} is of class C s+1 . By (5.52) and (5.55), the induction hypothesis implies χ[M{1} ; λ0 ] = χ[N{1} ; λ0 ] + rank Π − rank P.
(5.56)
Therefore, applying (5.48), (5.56) and (5.51) gives χ[LCQ (· − λ0 ); λ0 ] = χ[M{1} ; λ0 ] + rank P + rank Q = χ[N{1} ; λ0 ] + rank Π + rank Q = χ[L; λ0 ] + rank Q,
which concludes the proof. Proof of Theorem 5.6.1. We set k := α[L; λ0 ],
:= α[M; λ0 ].
According to Theorem 5.3.1, k ∈ N (respectively, ∈ N) if and only if λ0 ∈ Algk (L) (respectively, λ0 ∈ Alg (M)). Suppose k, ∈ N. Then, there exists a constant C > 0 such that for every λ in some perforated neighborhood of λ0 , (LM)−1 (λ) ≤ M(λ)−1 · L(λ)−1 ≤
C . |λ − λ0 |k+
Thus, λ0 ∈ Algν (LM) for some integer 0 ≤ ν ≤ k + , and, since LM ∈ C k+ (Ω, L(W, V )), it follows from Theorem 5.3.1 that χ[LM; λ0 ] is well defined and that α[LM; λ0 ] = ν ∈ N. There also exists a constant B > 0 such that for every λ in some perforated neighborhood of λ0 , L(λ)−1 ≤ M(λ) · (LM)−1 (λ) ≤
B . |λ − λ0 |ν
(5.57)
5.6. The product formula
129
Hence, k ≤ ν. Similarly, one can conclude that ≤ ν and, therefore, max{k, } ≤ ν ≤ k + .
(5.58)
Therefore, (5.39) holds true if k, ∈ N. Now, suppose k = ∞. Then, by (5.38), L and M are of class C ∞ and, hence, LM is also of class C ∞ . In particular, χ[LM; λ0 ] is well defined. Moreover, by (5.57), it follows from Theorem 5.3.1 that α[LM; λ0 ] = ∞, because k = ∞. Therefore, when k = ∞, max{k, } = α[LM; λ0 ] = k + = ∞. Also, in such a case, by Definition 5.1.3 and Theorem 5.3.1, χ[LM; λ0 ] = χ[L; λ0 ] + χ[M; λ0 ] = ∞. By symmetry, the same features hold if = ∞. The previous arguments show that χ[LM; λ0 ] is well defined in all possible cases and that (5.39) is always satisfied. Moreover, (5.40) is satisfied if k = ∞ or = ∞. Consequently, to complete the proof it suffices to show (5.40) when k, ∈ N. In such a case, we already know that ν := α[LM; λ0 ] ∈ N. By definition, χ[L; λ0 ] = 0 if k = 0, and χ[M; λ0 ] = 0 if = 0. Therefore, (5.40) follows straight away from Proposition 5.1.4 and Theorem 5.3.1 if k = 0 or = 0. It remains to complete the proof in the case 1 ≤ k ∈ N,
1 ≤ ∈ N.
(5.59)
Suppose (5.59). Let {M{j} }j=0 be a derived sequence from M at λ0 with corresponding sequence of projections {Πj }j=0 . Then, M{} (λ0 ) is an isomorphism, M{0} = M, and, for every j ∈ {0, . . . , }, M{j} (λ0 ) ∈ Fred0 (W, U ),
M{j} ∈ C s−j (Ω, L(W, U )),
(5.60)
and M{j} (λ) = M{j+1} (λ)CΠj (λ − λ0 ),
λ ∈ Ω.
Moreover, χ[M; λ0 ] =
−1 j=0
rank Πj .
(5.61)
130
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
In particular, for each j ∈ {0, . . . , − 1}, L(λ)M{j} (λ) = L(λ)M{j+1} (λ)CΠj (λ − λ0 ),
λ ∈ Ω.
Fix a j ∈ {0, . . . , − 1}. Then, by (5.38) and (5.60), LM{j} is of class C k+−j and LM{j+1} is of class C k+−j−1 . Moreover, λ0 is an algebraic eigenvalue of LM{j+1} with order less than or equal to k + − j − 1. Thus, according to Proposition 5.6.3, we have that χ[LM{j} ; λ0 ] = χ[LM{j+1} ; λ0 ] + rank Πj . Consequently, using (5.61), shows that χ[LM; λ0 ] = χ[LM{} ; λ0 ] +
−1
rank Πj = χ[LM{} ; λ0 ] + χ[M; λ0 ].
j=0
As M{} is of class C k and M{} (λ0 ) is an isomorphism, due to Proposition 5.1.4, χ[LM{} ; λ0 ] = χ[L; λ0 ] and, therefore, χ[LM; λ0 ] = χ[L; λ0 ] + χ[M; λ0 ],
which concludes the proof.
5.7 Perturbation from simple eigenvalues revisited According to Theorem 5.3.1, the following substantial extension of Theorem 4.4.3 holds. It should be noted that λ0 might not be a ν-algebraic eigenvalue of L for any 1 ≤ ν ≤ r, and that, in such a case, Theorem 4.4.3 cannot be applied. Theorem 5.7.1. Suppose U, V are K-Banach spaces such that U is a subspace of V with continuous inclusion, Ω ⊂ K is open, r ∈ N∗ ∪ {∞, ω}, the family L ∈ C r (Ω, L(U, V )) satisfies λ0 ∈ Ω and dim N [L0 ] = 1
and
N [L0 ] ⊕ R[L0 ] = V.
(5.62)
Let Y be a closed subspace of U and ϕ0 ∈ N [L0 ] \ {0} such that N [L0 ] = span[ϕ0 ]
and
N [L0 ] ⊕ Y = U,
and denote by a and ϕ the perturbed functions from 0 ∈ K and ϕ0 , whose existence was guaranteed by Lemma 4.4.1. Then, ordλ0 a is defined and ordλ0 a := χ[L; λ0 ] = α[L; λ0 ]
(5.63)
when χ[L; λ0 ] is defined, while ordλ0 a is undefined or ordλ0 a > r if χ[L; λ0 ] is undefined.
5.7. Perturbation from simple eigenvalues revisited
131
Proof. By Theorem 5.3.1, we already know that χ[L; λ0 ] is defined if and only if λ0 ∈ Algν (L) for some integer 1 ≤ ν ≤ r, or r = ∞. Actually, χ[L; λ0 ] < ∞ if and only if λ0 ∈ Algν (L) for some integer 1 ≤ ν ≤ r and, in such a case, both α[L; λ0 ] and ν equal the order of transversality of every transversalized family from L at λ0 . Consequently, (5.63) follows straight ahead from Theorem 4.4.3 if the algebraic multiplicity is finite. / Alg(L). By Lemma 4.4.1, the Suppose χ[L; λ0 ] = ∞. Then r = ∞ and λ0 ∈ functions a and ϕ are of class C ∞ and, hence, ordλ0 a ≥ 1 is well defined. We claim that ordλ0 a = ∞. Suppose, looking for a contradiction, that k := ordλ0 a ∈ N. By Theorems 4.3.2 and 5.3.1, there exists a polynomial Φ ∈ P[L(U )] such that Φ(λ0 ) = IU and the product family LΦ := LΦ satisfies Vk :=
k
Φ Φ Φ LΦ j (N [L0 ] ∩ · · · ∩ N [Lj−1 ]) ⊕ R[L0 ] V.
(5.64)
Φ Φ LΦ j (N [L0 ] ∩ · · · ∩ N [Lj−1 ]) = {0},
(5.65)
j=1
Actually, (5.64) implies k j=1
because LΦ = L0 and codim R[L0 ] = 1. Now we set ψ(λ) := Φ(λ)−1 ϕ(λ),
λ ∼ λ0 .
Since Lϕ = aϕ, we have that LΦ (λ)ψ(λ) = a(λ)ϕ(λ),
λ ∼ λ0 .
Thus, LΦ (λ)ψ(λ) = o((λ − λ0 )k−1 ), and
k
as λ → λ0 ,
LΦ i ψk−i = ak ψ0 = 0.
i=0
Thanks to Lemma 4.1.2, (5.66) implies ψ0 ∈
k−1 6 j=0
N [LΦ j ],
ψ0 , . . . , ψk−1 ∈ N [L0 ],
(5.66)
(5.67)
132
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
and, consequently, N [L0 ] =
k−1 6
N [LΦ j ]
and
ψ0 , . . . , ψk−1 ∈
j=0
k−1 6
N [LΦ j ],
j=0
because dim N [L0 ] = 1. Thus, (5.67) becomes Φ LΦ 0 ψk + Lk ψ0 = ak ψ0 = 0.
By (5.62), we find from this identity that LΦ k ψ0 = 0 and, therefore, LΦ 0
6 k−1
N [LΦ j ] = {0},
j=0
which contradicts (5.65). This contradiction shows that ordλ0 a = ∞, so concluding the proof when χ[L; λ0 ] is defined. Finally, suppose χ[L; λ0 ] is undefined. Then, there exists an integer k ≥ r such that L is of class C k in a neighborhood of λ0 , but in no neighborhood of λ0 is it of class C k+1 . Consequently, according to Theorems 4.3.2 and 5.3.1, there exists a polynomial Φ ∈ P[L(U )] such that Φ(λ0 ) = IU and LΦ := LΦ satisfies (5.64). Arguing as in the previous case when the multiplicity was infinity shows that a0 = · · · = ak = 0.
(5.68)
As, in general, the perturbed eigenvalue a is of C k , but it is not necessarily of class C k+1 , it is apparent that either ordλ0 a is undefined, or, due to (5.68) ordλ0 a > k ≥ r.
This concludes the proof.
5.8 Exercises 1. Suppose r ≥ 1 and the families L ∈ C r (Ω, L(U, V )) and Ψ ∈ C r (Ω, L(V )) satisfy L0 ∈ Fred0 (U, V ) and Ψ0 ∈ Iso(V ). Let {L{j} }∞ j=0 be a derived sequence of L at λ0 with ∞ corresponding projections {Πj }∞ j=0 . Prove that {L{j} }j=0 is a derived sequence of ΨL ∞ at λ0 with corresponding projections {Πj }j=0 . Use this fact to give a proof of the last assertion of Proposition 5.1.4. 2. Prove the result of Exercise 5 of Chapter 4 by using the definition of the µmultiplicity. 3. Let r ∈ N ∪ {∞}, consider λ0 ∈ Ω and L ∈ C r (Ω, L(U, V )) with L0 ∈ Fred0 (U, V ) such that χ[L; λ0 ] is defined. Prove that χ[L; λ0 ] = dim N [L0 ] if and only if λ0 is a k-algebraic value of L for some k ∈ {0, 1} ∩ [0, r]. This complements the result proposed in Exercise 6 of Chapter 4.
5.8. Exercises
133
4. Let r ∈ N ∪ {∞}, consider λ0 ∈ Ω and L ∈ C r (Ω, L(U, V )) such that L0 ∈ Fred0 (U, V ) and λ0 ∈ Algk (L) for some k ∈ N ∩ [0, r]. Let Φ ∈ C ∞ (Ω, L(U )) be such that Φ(λ0 ) is an isomorphism, and λ0 is a k-transversal value of LΦ. Prove that, for ˆ ∈ C r (Ω, L(U, V )) satisfying every L ˆ j = Lj , L
0 ≤ j ≤ k,
ˆ and a k-transversal value of LΦ. ˆ Moreover, λ0 is a k-algebraic value of L ˆ λ0 ]. χ[L; λ0 ] = χ[L; 5. This exercise provides a dual construction of the construction carried out in Section 5.1. Suppose Ω ⊂ K is open, U and V are K-Banach spaces, λ0 ∈ Ω, and L ∈ C r (Ω, L(U, V )) satisfies L0 ∈ Fred0 (U, V ) for some r ∈ N ∪ {∞}. Consider the r + 1 families M{j} ∈ C r−i (Ω, L(U, V )), for 0 ≤ j < r + 1, defined inductively as follows: • M{0} := L. • Given 0 ≤ i < r and M{i} ∈ C r−i (Ω, L(U, V )), let σi ∈ L(V ) be a projection with range R[M{i} (λ0 )] and define [σi + (λ − λ0 )−1 (IV − σi )]M{i} (λ) if λ ∈ Ω \ {λ0 }, M{i+1} (λ) := σi M{i} (λ0 ) + (IV − σi )M{i} (λ0 ) if λ = λ0 . The (finite or infinite) sequence {M{j} }rj=0 is called a sequence of dual derived families from L at λ0 . The aim of this exercise is to show that the dual derived families enjoy dual properties of the derived families constructed in Section 5.1. Precisely, it is requested to prove the following: • M{j} (λ) ∈ Fred0 (U, V ) for all 0 ≤ j < r + 1 and each λ ∈ Ω satisfying L(λ) ∈ Fred0 (U, V ). Moreover, for all λ ∈ Ω \ {λ0 } and 0 ≤ j < r + 1, M{j} (λ) = [σj−1 +(λ−λ0 )−1 (IV −σj−1 )] · · · [σ0 +(λ−λ0 )−1 (IV −σ0 )]L(λ). In addition, N [σj ] + R[σj+1 ] = V and, so, dim R[σj ] ≤ dim R[σj+1 ] for each 0 ≤ j < r. • Define, for each 0 ≤ j < r + 1, the dual partial µ-multiplicity of L at λ0 by µ∗j [L; λ0 ] :=
j
codim R[σi ].
i=0
If M{j} (λ0 ) is invertible for some integer 0 ≤ j ≤ r, then the dual ascent of L at λ0 , denoted by α∗ [L; λ0 ], is defined as the least integer j for which M{j} (λ0 ) is invertible. In such a case, the dual multiplicity of L at λ0 , denoted by µ∗ [L; λ0 ], is defined through µ∗ [L; λ0 ] := µ∗α∗ [L;λ0 ] [L; λ0 ].
134
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization If r = ∞ and there does not exist j ∈ N for which M{j} (λ0 ) is invertible, then the dual ascent and dual multiplicity are defined as α∗ [L; λ0 ] = µ∗ [L; λ0 ] = ∞. Prove the consistency of these concepts. • Prove the dual counterpart of Proposition 5.1.4. • The reader may try to find the relationships between this dual construction and the construction of Section 5.1; in particular, that the functions µ and µ∗ are identical, and so are the functions α and α∗ . But an easier proof will be sketched in Exercise 17 of Chapter 7.
6. Let U = V = K2 , identify L(U, V ) with M2 (K), and consider the families L, M ∈ P[M2 (K)] defined by M(λ) := diag{λs , λ },
L(λ) := diag{λk , 1},
λ ∈ K,
for some integers k, s, ≥ 0. Prove that α[L; 0] = µ[L; 0] = k,
α[M; 0] = max{s, },
α[LM; 0] = max{k + s, },
µ[M; 0] = s + ,
µ[LM; 0] = k + s + ,
to conclude that the inequalities (5.39) are optimal. 7. This exercise proposes an alternative proof of the main result of Exercise 9 of Chapter 4 by means of the characterization of χ provided by µ through Theorem 5.3.1. Precisely, under the same assumptions as in that exercise, let {L{j} }rj=0 and {M{j} }rj=0 be two sequences of derived families from L and M at λ0 with corresponding projections {Πj }rj=0 and {Pj }rj=0 , respectively. Prove the following: • {L{j} × M{j} }rj=0 is a sequence of derived families from L × M at λ0 with corresponding projections {Πj × Pj }rj=0 . • µj [L × M; λ0 ] = µj [L; λ0 ] + µj [M; λ0 ] for all 0 ≤ j < r + 1. • µ[L × M; λ0 ] is defined if and only if both µ[L; λ0 ] and µ[M; λ0 ] are defined, and, in such a case, µ[L × M; λ0 ] = µ[L; λ0 ] + µ[M; λ0 ] and α[L × M; λ0 ] = max {α[L; λ0 ], α[M; λ0 ]} . 8. Let Ω , Ω be two open neighborhoods of λ0 ∈ K, suppose r, s ∈ N ∪ {∞}, consider L ∈ C r (Ω, L(U, V )) with L0 ∈ Fred0 (U, V ), and let f ∈ C s (Ω ) satisfy f (λ0 ) = λ0
and
f (Ω ) ⊂ Ω.
Let g ∈ C s (Ω ) be the function defined by g(λ) := f (λ) − λ0 ,
λ0 ∈ Ω .
5.8. Exercises
135
We ask the following: • Assume r = s = ∞ and, using Theorem 5.6.1, (5.3) and Exercise 2, prove the following identities: α[L ◦ f ; λ0 ] = µ[g; λ0 ] α[L; λ0 ],
µ[L ◦ f ; λ0 ] = µ[g; λ0 ] µ[L; λ0 ].
(5.69)
• Assume that the three multiplicities µ[L; λ0 ], µ[g; λ0 ] and µ[L ◦ f ; λ0 ] are defined, impose conditions on r, s, and use Theorem 5.6.1, (5.3) and Exercise 2 to obtain (5.69). 9. This exercise shows that Theorem 5.0.1 may fail when the assumption L0 ∈ Fred0 (U, V ) is removed. Let K = R, the spaces U = V = C([0, 1], C), and the operator T ∈ L(U ) defined by t f (s) ds, t ∈ [0, 1], f ∈ U. T f (t) = 0
Let L ∈ P[L(U )] be the real polynomial defined by L(λ) = iIU λ − T,
λ ∈ R.
Prove, step by step, the following: • T is injective but not surjective. Therefore, T is not Fredholm of index zero. • L(λ) is invertible for each λ = 0 and, actually, for each f ∈ U , t 1 1 f (s)e(t−s)/(iλ) ds, t ∈ [0, 1]. f (t) − 2 L(λ)−1 f (t) = iλ λ 0 • T is not a Fredholm operator. • L(λ)−1 ≤ 2|λ|−2 for all λ ∈ R \ {0}. • There does not exist any integer n for which the limit lim λn L(λ)−1
λ→0
does exist.
136
Chapter 5. Algebraic Multiplicity Through Polynomial Factorization
5.9 Comments on Chapter 5 The most pioneering materials of this chapter were developed by Gohberg & Sigal [54] and Gohberg [42]. The concept of multiplicity introduced by Definition 5.1.3 goes back to Magnus [92]. It was introduced in the context of nonlinear analysis to generalize some celebrated results by Krasnosel’ski˘ı [69] and Rabinowitz [111, 112]. It is extremely significant that Magnus [92] himself asserted “It looks as if the calculation of multiplicity might be fraught with difficulties, as our definition is far from transparent.” This sincere declaration might have been provoked by the fact that, except when U = V = Rd , or U = V and L(λ) = λIU − T for some T ∈ L(U ) and every λ ∈ K, Magnus [92] could not ascertain whether or not µ[L; λ0 ] < ∞. Theorem 5.3.1 has actually shown that µ[L; λ0 ] < ∞ if and only if
λ0 ∈ Alg(L)
through the identification χ = µ. Chapter 7 will show that χ[L; λ0 ] < ∞ if λ0 is an isolated eigenvalue of an analytic family L. Essentially, Theorem 5.3.1 is attributable to L´ opez-G´omez [82]. Besides Definition 5.1.3 and Theorem 4.3.2, the crucial step in the proof of Theorem 5.3.1 relies on Theorem 5.2.1, which goes back to Esquinas & L´opez-G´omez [31]. The key step in proving Theorem 5.2.1 was to show that, for every 1 ≤ j ≤ k, M{j} (λ0 ) = L0 (IU − Π0 ) +
j−1
Li Πi−1 (IU − Πi ) + Lj Πj−1
i=1
if λ0 ∈ Algk (L), which expresses M{j} (λ0 ) in terms of the classical derivatives of L at λ0 . When λ0 is not a transversal eigenvalue of L, in order to construct the derived sequence {M{j} }kj=0 , one should first search for a local transversalizing family of isomorphisms Φ, and then apply the previous formula to LΦ := LΦ. Going back to the proof of Theorem 4.3.2, it is easily realized that such a task might be extremely tedious and hard. Consequently, establishing the identification χ = µ involves plenty of serious technical difficulties. Nevertheless, the approach adopted in this chapter provides an extremely versatile polynomial factorization of L through L(λ) = M{k} (λ)CΠk−1 (λ − λ0 ) · · · CΠ0 (λ − λ0 ),
λ ∼ λ0 ,
which is the main technical tool used in the proof of the product formula χ[LM; λ0 ] = χ[L; λ0 ] + χ[M; λ0 ],
5.9. Comments on Chapter 5
137
which has been established by Theorem 5.6.1, attributable to Magnus [92]. Originally, Magnus established it for the very special case when r = s = ∞, where most of the technical difficulties of the general case covered in this chapter are easily overcome; however, this should not underrate the well-deserved merit of his result. Actually, from Definition 5.1.3 itself, it becomes apparent that µ was introduced having in mind the product formula. Seemingly, the idea of factorization of the family goes back to Gohberg & Sigal [54] and Gohberg [42]. In these papers, with a similar idea of factorization, but overall different approach, they obtain fundamental properties of the multiplicity, like the stability property (see Chapter 8) and the logarithmic residue theorem. Rather strikingly, Chapter 6 shows that the product formula together with the property that the multiplicity of some rank-one projection equals one do characterize the algebraic multiplicity χ = µ, in the sense that all remaining properties must follow from these two. The importance of all these features greatly escapes from linear to nonlinear analysis, as, in the case K = R, those polynomial factorizations of L considerably facilitate the analysis of the problem of ascertaining whether or not the Poincar´e topological index of L(λ) at u = 0, to be introduced in Section 12.2, changes as λ crosses λ0 . It turns out that it changes if and only if χ[L; λ0 ] ∈ 2N + 1, if and only if λ0 is a nonlinear eigenvalue of L, as discussed in Chapter 12. The result of Exercise 8 goes back, essentially, to Magnus [92] (the product formula for the multiplicity to be introduced in Chapter 7 was already proved by Sigal [119]). The counter-example of Exercise 9 was constructed by Magnus & Mora-Corral [94]. We think that Theorem 5.0.1 is a striking property of Fredholm operators that deserves further attention.
Chapter 6
Uniqueness of the Algebraic Multiplicity Throughout this chapter, given K ∈ {R, C}, two non-zero K-Banach spaces U, V , and λ0 ∈ K, we denote by Sλ∞0 (U, V ) the set of all families L of class C ∞ in a neighborhood of λ0 with values in L(U, V ) such that L0 := L(λ0 ) ∈ Fred0 (U, V ); the neighborhood may depend on L. We also set Sλ∞0 (U ) := Sλ∞0 (U, U ). Clearly, LM ∈ Sλ∞0 (U, V ) if L ∈ Sλ∞0 (W, V ) and M ∈ Sλ∞0 (U, W ), where W is another K-Banach space. Moreover, L−1 ∈ Sλ∞0 (V, U ) whenever L ∈ Sλ∞0 (U, V ) and L0 ∈ Iso(U, V ). So far, in Chapters 4 and 5 we have constructed a function χ[ · ; λ0 ] : Sλ∞0 (U, V ) → N ∪ {∞} that satisfies the following properties: M1. χ[L; λ0 ] = 0 if and only if L0 ∈ Iso(U, V ); in this case, α[L; λ0 ] = 0. M2. 1 ≤ χ[L; λ0 ] < ∞ if and only if λ0 ∈ Algν (L) for some integer ν ≥ 1; in this case, α[L; λ0 ] = ν. / Alg(L); in this case, α[L; λ0 ] = ∞. M3. χ[L; λ0 ] = ∞ if and only if λ0 ∈ M4. For every L ∈ Sλ∞0 (W, V ) and M ∈ Sλ∞0 (U, W ), χ[LM; λ0 ] = χ[L; λ0 ] + χ[M; λ0 ].
140
Chapter 6. Uniqueness of the Algebraic Multiplicity
M5. χ[CP (· − λ0 ); λ0 ] = rank P for every finite-rank projection P ∈ L(U ), where CP (t) = t P + IU − P,
t ∈ K.
Indeed, these properties are consequences of Theorem 5.3.1, Proposition 5.6.3 and Theorem 5.6.1. The main goal of this chapter is to show that all properties of the algebraic multiplicity χ (equivalently, µ) can be obtained from Properties M4 and M5. For example, in the case U = V , the following uniqueness theorem is satisfied. Theorem 6.0.1 (of uniqueness). Let U be a non-zero K-Banach space and λ0 ∈ K. Then, there exists a unique function m[ · ; λ0 ] : Sλ∞0 (U ) → [0, ∞] satisfying the following properties: A1. For all L, M ∈ Sλ∞0 (U ), m[LM; λ0 ] = m[L; λ0 ] + m[M; λ0 ]. A2. There exists a rank-one projection P0 ∈ L(U ) such that m[CP0 (· − λ0 ); λ0 ] = 1. Moreover, m[L; λ0 ] = χ[L; λ0 ]
for all L ∈ Sλ∞0 (U )
and, in particular, m ranges over N ∪ {∞}. Consequently, all definitions, constructions, properties and relationships established in Chapters 4 and 5 do actually follow from Axioms A1 and A2 if U = V . Axiom 2 can be regarded as a normalization property of the algebraic multiplicity, in the sense that the algebraic multiplicity is uniquely determined by the product formula (Axiom A1) up to a multiplicative constant, which is determined by fixing the value of m[CP0 (· − λ0 ); λ0 ] for some rank-one projection P0 . This chapter is organized as follows. Section 6.1 shows the similarity of two arbitrary rank-one projections, which is needed in the proof of the uniqueness theorems. Section 6.2 gives the proof of Theorem 6.0.1 and establishes another version of it. Section 6.3 relaxes the regularity requirements of Theorem 6.0.1. Section 6.4 extends Theorem 6.0.1 to cover the general case when the spaces U, V are different but isomorphic. Finally, Section 6.5 applies these uniqueness theorems to get some explicit formulae for χ.
6.1. Similarity of rank-one projections
141
6.1 Similarity of rank-one projections The following result will be useful in the proof of Theorem 6.0.1. Lemma 6.1.1. Let P, Q ∈ L(U ) be two rank-one projections. Then, there exists an isomorphism T ∈ L(U ) such that P = T QT −1.
(6.1)
Proof. As P, Q ∈ L(U ) are projections, U = N [P ] ⊕ R[P ] = N [Q] ⊕ R[Q]. To construct the isomorphism T we distinguish two cases. First, suppose N [P ] ⊂ N [Q] or N [Q] ⊂ N [P ].
(6.2)
Since codim N [P ] = codim N [Q] = 1, necessarily N [P ] = N [Q]. Let p ∈ R[P ] \ {0} and q ∈ R[Q] \ {0}. Then, the unique operator T ∈ L(U ) satisfying T |N [Q] = I|N [Q] = I|N [P ] ,
T q = p,
where I stands for the identity, provides us with an isomorphism for which P T = T Q. Now, suppose that none of the inclusions (6.2) holds. Then, N [P ] ∩ N [Q] = N [P ] and N [P ] ∩ N [Q] = N [Q]. Take y ∈ N [P ],
x0 ∈ N [P ] \ N [Q].
Then, Qy ∈ R[Q] and Qx0 ∈ R[Q] \ {0}. Since rank Q = 1, we obtain that there exists λ ∈ K such that Qy = λQx0 . Thus, y − λx0 ∈ N [P ] ∩ N [Q]. This proves that N [P ] = (N [P ] ∩ N [Q]) + span[x0 ] and, hence, the codimension of N [P ] ∩ N [Q] in N [P ] is 1. Therefore, N [P ] ∩ N [Q] is a closed hyperplane of N [P ] and admits a one-dimensional topological supplement U0 N [P ] = (N [P ] ∩ N [Q]) ⊕ U0 .
142
Chapter 6. Uniqueness of the Algebraic Multiplicity
By symmetry, N [P ] ∩ N [Q] is a closed hyperplane of N [Q] and there exists a one-dimensional subspace U1 of U such that N [Q] = (N [P ] ∩ N [Q]) ⊕ U1 . Let u0 ∈ U0 \ {0},
u1 ∈ U1 \ {0},
p ∈ R[P ] \ {0},
q ∈ R[Q] \ {0}.
Then, it is easy to see that the unique operator T ∈ L(U ) satisfying T |N [P ]∩N [Q] = I|N [P ]∩N [Q] ,
T u1 = u0 ,
T q = p,
is an isomorphism that satisfies (6.1). This concludes the proof.
6.2 Proof of Theorem 6.0.1 This section is devoted to the proof of Theorem 6.0.1. Let U be a non-zero K-Banach space and λ0 ∈ K. Then, thanks to the Hahn– Banach theorem, U admits rank-1 projections. Moreover, by Theorem 5.6.1 and Proposition 5.6.3, we already know that the function χ[·; λ0 ] satisfies Axioms A1 and A2. It remains to prove the uniqueness. Let m[·; λ0 ] : Sλ∞0 (U ) → [0, ∞] satisfy Axioms A1 and A2. Then, the following properties hold: i) m[L; λ0 ] = 0 if L ∈ Sλ∞0 (U ) and L0 ∈ Iso(U ). ii) m[CP (· − λ0 ); λ0 ] = 1 for every rank-1 projection P ∈ L(U ). iii) m[CP (· − λ0 ); λ0 ] = rank P for every non-zero finite-rank projection P ∈ L(U ). Indeed, let L ∈ Sλ∞0 (U ) be such that L(λ0 ) is invertible. Then, by Axioms A1 and A2, we find 1 = m[CP0 (· − λ0 ); λ0 ] = m[CP0 (· − λ0 )LL−1 ; λ0 ] = m[CP0 (· − λ0 ); λ0 ] + m[L; λ0 ] + m[L−1 ; λ0 ] = 1 + m[L; λ0 ] + m[L−1 ; λ0 ]. Consequently, m[L; λ0 ] = 0, because m ≥ 0. This concludes the proof of Property i). To prove Property ii), let P ∈ L(U ) be a rank-1 projection. By Lemma 6.1.1, there exists an invertible operator T ∈ L(U ) such that P = T P0 T −1 , where P0 is the projection of Axiom A2. Thus, CP = T CP0 T −1
6.2. Proof of Theorem 6.0.1
143
and, therefore, combining Axioms A1 and A2 with Property i) shows that m[CP (· − λ0 ); λ0 ] = m[T ; λ0 ] + m[CP0 (· − λ0 ); λ0 ] + m[T −1 ; λ0 ] = m[CP0 (· − λ0 ); λ0 ] = 1, which concludes the proof of Property ii). To prove Property iii), let P ∈ L(U ) be a projection with rank n ≥ 1. Then, there exist n rank-1 projections P1 , . . . , Pn ∈ L(U ) such that P =
n
Pi
i=1
and 1 ≤ i, j ≤ n,
Pi Pj = 0,
i = j.
These projections satisfy CP = CP1 · · · CPn and, therefore, by Axiom A1 and Property ii), we find that m[CP (· − λ0 ); λ0 ] =
n
m[CPi (· − λ0 ); λ0 ] = n = rank P.
i=1
This concludes the proof of Property iii). We have all the necessary ingredients to conclude the proof of Theorem 6.0.1. Let L ∈ Sλ∞0 (U ). Then, some of the following mutually exclusive options occur: either L(λ0 ) is an isomorphism, or λ0 is a k-algebraic eigenvalue of L(λ0 ) for some integer k ≥ 1, or λ0 is not an algebraic eigenvalue of L. Suppose L(λ0 ) is an isomorphism. Then, according to Property i) we have that m[L; λ0 ] = 0. Suppose λ0 is a k-algebraic eigenvalue of L(λ0 ) for some integer k ≥ 1. Then, by Corollary 5.3.2(b), there exist k finite-rank projections Π0 , . . . , Πk−1 ∈ L(U ) \ {0} and a family M ∈ Sλ∞0 (U ) with M(λ0 ) invertible, such that L(λ) = M(λ)CΠk−1 (λ − λ0 ) · · · CΠ0 (λ − λ0 ),
λ ∼ λ0 .
Consequently, by Axiom A1 and Properties iii) and i), we have that m[L; λ0 ] = m[M; λ0 ] +
k−1
m[CΠi (· − λ0 ); λ0 ] =
i=0
k−1
rank Πi .
i=0
Finally, suppose that λ0 is not an algebraic eigenvalue of L. Then, according to Corollary 5.3.2(c), for every integer ν ≥ 1 there are ν finite-rank projections Π0 , . . . , Πν−1 ∈ L(U ) \ {0}
144
Chapter 6. Uniqueness of the Algebraic Multiplicity
and an operator Mν ∈ Sλ∞0 (U ) such that L(λ) = Mν (λ)CΠν−1 (λ − λ0 ) · · · CΠ0 (λ − λ0 ),
λ ∼ λ0 .
Therefore, again by Axiom A1 and Property iii), we find that m[L; λ0 ] = m[Mν ; λ0 ] +
ν−1
rank Πi ≥ ν,
(6.3)
i=0
because m ≥ 0. As ν ≥ 1 is arbitrary, this implies that m[L; λ0 ] = ∞ and completes the proof of Theorem 6.0.1. In the previous proof the hypothesis that m takes values in [0, ∞] was used exclusively to show that m[L; λ0 ] = 0 if L ∈ Sλ∞0 (U ) is invertible, and in (6.3). Therefore, the following uniqueness result holds true (see Exercise 4). Theorem 6.2.1 (of uniqueness). Let U be a non-zero K-Banach space, λ0 ∈ K, and denote ∞ A∞ λ0 (U ) := L ∈ Sλ0 (U ) : λ0 ∈ Alg(L) . Then, there exists a unique function m[ · ; λ0 ] : A∞ λ0 (U ) → C satisfying the following properties: A1. For all L, M ∈ A∞ λ0 (U ), m[LM; λ0 ] = m[L; λ0 ] + m[M; λ0 ]. A2. There exists a rank-1 projection P0 ∈ L(U ) such that m[CP0 (· − λ0 ); λ0 ] = 1. A3. m[L; λ0 ] = 0 for all L ∈ A∞ λ0 (U ) such that L(λ0 ) ∈ Iso(U ). Moreover, m[L; λ0 ] = χ[L; λ0 ]
for all L ∈ A∞ λ0 (U )
and, in particular, m ranges over N.
6.3 Relaxing the regularity requirements The main difficulty in generalizing Theorem 6.0.1 to a C r class regularity setting relies on the troubling fact that χ[LM; λ0 ] may be undefined even if χ[L; λ0 ] and χ[M; λ0 ] are defined. In other words, we should overcome the difficulty that the class of families of class C r in a neighborhood of λ0 with values in L(U ) for which χ[L; λ0 ] is defined is not closed under the composition, which makes it impossible
6.3. Relaxing the regularity requirements
145
to impose the product formula as an axiom. To overcome such a problem we must reduce the class of admissible families in order to guarantee that χ[LM; λ0 ] is defined whenever χ[L; λ0 ] and χ[M; λ0 ] are so. We have seen that algebraic families at λ0 provide a reasonable class of families for which a uniqueness theorem from the product formula can be given. Precisely, given a point λ0 ∈ K and two non-zero K-Banach spaces U and V , let Mλ0 (U, V ) denote the set of functions L ∈ C r (Ω, L(U, V )), for some open neighborhood Ω ⊂ K of λ0 , such that L(λ0 ) ∈ Fred0 (U, V ) and either r = ∞, or r ∈ N and λ0 ∈ Algk (L) for some integer 0 ≤ k ≤ r. Note that these are the functions for which the multiplicity χ[L; λ0 ] is well defined. Set also Mλ0 (U ) := Mλ0 (U, U ). As Sλ∞0 (U ) ⊂ Mλ0 (U ), the next uniqueness theorem provides an extension of Theorem 6.0.1. Theorem 6.3.1. Let U be a non-zero K-Banach space and λ0 ∈ K. Then, there exists a unique function m[·; λ0 ] : Mλ0 (U ) → [0, ∞] satisfying the following properties: A1. For every L, M ∈ Mλ0 (U ) such that L, M are of class C α[L;λ0 ]+α[M;λ0 ] in a neighborhood of λ0 , m[LM; λ0 ] = m[L; λ0 ] + m[M; λ0 ]. A2. There exists a rank-1 projection P0 ∈ L(U ) such that m[CP0 (· − λ0 ); λ0 ] = 1. Moreover, m[L; λ0 ] = χ[L; λ0 ]
for all L ∈ Mλ0 (U )
and, in particular, m ranges over N ∪ {∞}. Proof. Let U be a non-zero K-Banach space and λ0 ∈ K. Then, thanks to the Hahn–Banach theorem, U admits rank-1 projections. Moreover, thanks to Theorem 5.6.1 and Proposition 5.6.3, we know that the function χ[·; λ0 ] satisfies Axioms A1 and A2. It remains to prove the uniqueness. Let m[·; λ0 ] : Mλ0 (U ) → [0, ∞] satisfy Axioms A1 and A2.
146
Chapter 6. Uniqueness of the Algebraic Multiplicity
Then, the following properties hold: i) m[L; λ0 ] = 0 if L ∈ Mλ0 (U ) and L(λ0 ) is invertible. ii) m[CP (· − λ0 ); λ0 ] = 1 for every rank-1 projection P ∈ L(U ). iii) m[CP (· − λ0 ); λ0 ] = rank P for every non-zero finite-rank projection P ∈ L(U ). Indeed, let L ∈ Mλ0 (U ) be such that L(λ0 ) is invertible. Then, CP0 , L, L−1 , CP0 LL−1 , LL−1 ∈ Mλ0 (U ) and, hence, according to Axioms A1 and A2, 1 = m[CP0 (· − λ0 ); λ0 ] = 1 + m[L; λ0 ] + m[L−1 ; λ0 ]. Therefore,
m[L; λ0 ] = m[L−1 ; λ0 ] = 0,
because m ≥ 0, which ends the proof of Property i). Properties ii) and iii) have already been shown in the proof of Theorem 6.0.1. Let L ∈ Mλ0 (U ). Then, L is of class C r for some r ∈ N ∪ {∞}, and some of the following mutually exclusive alternatives occur: either L0 ∈ Iso(U ); or λ0 ∈ Algk (L) for some integer 1 ≤ k ≤ r; or r = ∞ but λ0 ∈ / Alg(L). If L(λ0 ) is an isomorphism, then m[L; λ0 ] = 0, by Property i). Suppose λ0 is a k-algebraic eigenvalue of L(λ0 ) for some integer number 1 ≤ k ≤ r. By Theorem 5.3.1, k = α[L; λ0 ]. Let {M{j} }rj=0 be a derived family from L at λ0 with associated projections {Πj }rj=0 . Then, M{0} = L, the family M{k} is continuous and take invertible values, and, for every j ∈ {0, . . . , k − 1}, the family M{j} is of class C k−j , λ ∈ Ω, M{j} (λ) = M{j+1} (λ)CΠj (λ − λ0 ), and α[M{j+1} ; λ0 ] = α[L; λ0 ] − j − 1,
α[CΠj (· − λ0 ); λ0 ] = 1.
Thus, for each 0 ≤ j ≤ k − 1, M{j} is of class C α[M{j+1} ;λ0 ]+α[CΠj (·−λ0 );λ0 ] in a neighborhood of λ0 , and, according to Axiom A1 and Properties iii) and i), we have that m[L; λ0 ] = m[M{k} ; λ0 ] +
k−1
m[CΠi (· − λ0 ); λ0 ] =
i=0
k−1
rank Πi .
i=0
Finally, suppose r = ∞ and λ0 is not an algebraic eigenvalue of L. Let {M{j} }∞ j=0 be a derived family from L at λ0 with associated projections {Πj }∞ j=0 . Then, for every integer ν ≥ 1, the family Mν ∈ Sλ∞0 (U ) satisfies L(λ) = Mν (λ)CΠν−1 (λ − λ0 ) · · · CΠ0 (λ − λ0 ),
λ ∼ λ0 .
6.4. A general uniqueness theorem
147
Therefore, again by Axiom A1 and Property iii), we find that m[L; λ0 ] = m[Mν ; λ0 ] +
ν−1
rank Πi ≥ ν,
i=0
because m ≥ 0. As ν ≥ 1 is arbitrary, this implies that m[L; λ0 ] = ∞ and concludes the proof.
6.4 A general uniqueness theorem The assumption U = V in the statement of Theorems 6.0.1, 6.2.1 and 6.3.1 is not really restrictive, since U and V must be isomorphic if Fred0 (U, V ) is non-empty. In fact, the following improvement of Theorem 6.3.1 can be obtained. Theorem 6.4.1. Let X be a non-zero K-Banach space and λ0 ∈ K. Let J(X) be a set of K-Banach spaces isomorphic to X such that X ∈ J(X). Then, there exists a unique function # m[ · ; λ0 ] : Mλ0 (U, V ) → [0, ∞] U,V ∈J(X)
satisfying the following properties: A1. If U, V, W ∈ J(X) with L ∈ Mλ0 (U, V ),
M ∈ Mλ0 (W, U ),
and L, M are of class C α[L;λ0 ]+α[M;λ0 ] in a neighborhood of λ0 , then m[LM; λ0 ] = m[L; λ0 ] + m[M; λ0 ]. A2. There exists a rank-1 projection P0 ∈ L(X) such that m[CP0 (· − λ0 ); λ0 ] = 1. Actually, for every U, V ∈ J(X) and L ∈ Mλ0 (U, V ), m[L; λ0 ] = χ[L; λ0 ]. In particular, m ranges over N ∪ {∞}. Proof. Thanks to Theorem 5.6.1, we know that the algebraic multiplicity χ constructed in Chapter 4, or Chapter 5, satisfies Axioms A1 and A2. It remains to prove its uniqueness. Let # Mλ0 (U, V ) → [0, ∞] m[ · ; λ0 ] : U,V ∈J(X)
148
Chapter 6. Uniqueness of the Algebraic Multiplicity
be a function satisfying Axioms A1 and A2 of this theorem. Then, the auxiliary function mX [ · ; λ0 ] : Mλ0 (X) → [0, ∞] defined through mX [L; λ0 ] := m[L; λ0 ],
L ∈ Mλ0 (X),
satisfies Axioms A1 and A2 of Theorem 6.3.1. Consequently, mX [L; λ0 ] = χ[L; λ0 ]
for all L ∈ Mλ0 (X).
(6.4)
Let U ∈ J(X) and consider any isomorphism J ∈ L(X, U ). Then, according to Axioms A2 and A1, we have that 1 = m[CP0 (· − λ0 ); λ0 ] = m[CP0 (· − λ0 )J −1 J; λ0 ] = m[CP0 (· − λ0 ); λ0 ] + m[J −1 ; λ0 ] + m[J; λ0 ] = 1 + m[J −1 ; λ0 ] + m[J; λ0 ] and, therefore,
m[J −1 ; λ0 ] = m[J; λ0 ] = 0,
(6.5)
because m ≥ 0. Let U, V ∈ J(X) and L ∈ Mλ0 (U, V ). Then, there exist isomorphisms M ∈ L(V, X) and J ∈ L(X, U ). Thanks to (6.5), m[J; λ0 ] = m[M ; λ0 ] = 0 and, hence, by Axiom A1, m[L; λ0 ] = m[M LJ; λ0 ]. As M LJ ∈ Mλ0 (X), (6.4) and the product formula for χ show that m[L; λ0 ] = mX [M LJ; λ0 ] = χ[M LJ; λ0 ] = χ[L; λ0 ].
This concludes the proof.
6.5 Applications. Classical multiplicity formulae This section gives two applications of Theorems 6.0.1 and 6.2.1 to characterize χ[L; λ0 ] in the special case when U = V = KN . Corollary 6.5.1. Let N ≥ 1 be an integer and choose a basis in KN to identify L(KN ) with MN (K). Then, for every λ0 ∈ K and L ∈ Sλ∞0 (KN ), χ[L; λ0 ] = ordλ0 det L.
6.5. Applications. Classical multiplicity formulae
149
Proof. Fix λ0 ∈ K. Then, the function m[·; λ0 ] : Sλ∞0 (KN ) → [0, ∞] defined by m[L; λ0 ] := ordλ0 det L,
L ∈ Sλ∞0 (KN ),
satisfies Axioms A1 and A2 of Theorem 6.0.1. Indeed, m is well defined because L is of class C ∞ in a neighborhood of λ0 . Moreover, for every L, M ∈ Sλ∞0 (KN ), we have that m[LM; λ0 ] = ordλ0 det(LM) = ordλ0 [det L · det M] = ordλ0 det L + ordλ0 det M = m[L; λ0 ] + m[M; λ0 ]. Consequently, m satisfies Axiom A1. Let P0 be the rank-one projection P0 := diag{1, 0, . . . , 0}. Then, for each t ∈ K, CP0 (t) = t P0 + IN − P0 = diag{t, 1, . . . , 1} and, hence, m[CP0 (· − λ0 ); λ0 ] = ordλ0 det CP0 (· − λ0 ) = ordλ0 (· − λ0 ) = 1. Consequently, m also satisfies Axiom A2. Therefore, by Theorem 6.0.1, m[L; λ0 ] = χ[L; λ0 ] for all L ∈ Sλ∞0 (KN ).
This concludes the proof. Corollary 6.5.2. Let N ≥ 1 be an integer and choose a basis in C N L(CN ) with MN (C). Then, for all λ0 ∈ C and L ∈ A∞ λ0 (C ), 1 L (λ)L(λ)−1 dλ, χ[L; λ0 ] = tr 2πi γ
N
to identify
(6.6)
where γ is any Cauchy contour whose inner domain Dγ contains λ0 , the family ¯ γ , and D ¯ γ \ {λ0 } contains no eigenvalue L is holomorphic in a neighborhood of D of L. N Proof. Fix λ0 ∈ C, and note that L is holomorphic at λ0 if L ∈ A∞ λ0 (C ). By Theorem 6.2.1, the proof will be completed if we show that the function m[·; λ0 ] : N A∞ λ0 (C ) → C defined through 1 N L (λ)L(λ)−1 dλ, L ∈ A∞ m[L; λ0 ] := tr λ0 (C ), 2πi γ
satisfies Axioms A1–A3 of Theorem 6.2.1, where γ is any Cauchy contour satisfying the requirements of the statement.
150
Chapter 6. Uniqueness of the Algebraic Multiplicity
We point out that this is a typical example where checking that m is nonnegative may be rather involved, though Axiom A3 of Theorem 6.2.1 is a direct consequence of the fact that L L−1 is holomorphic in an open neighborhood of λ0 if L(λ0 ) is an isomorphism and, therefore, in such a case, the Cauchy theorem guarantees that m[L; λ0 ] = 0. N Let L, M ∈ A∞ λ0 (C ) and consider a Cauchy contour γ with inner domain ¯ γ , and D ¯ γ \ {λ0 } Dγ containing λ0 such that both families are holomorphic in D contains no eigenvalue of L or of M. Then, (LM) (LM)−1 = L L−1 + LM M−1 L−1 and, hence, 1 m[LM; λ0 ] = tr (LM) (λ)(LM)(λ)−1 dλ 2πi γ 1 1 −1 = tr L (λ)L(λ) dλ + tr L(λ)M (λ)M(λ)−1 L(λ)−1 dλ 2πi γ 2πi γ 1 M (λ)M(λ)−1 dλ = m[L; λ0 ] + m[M; λ0 ], = m[L; λ0 ] + tr 2πi γ because the trace is invariant by similarity. Therefore, m satisfies Axiom A1 of Theorem 6.2.1. Finally, let P ∈ M(C) be a rank-1 projection. Then, CP (t)CP (t)−1 = P t−1 P + ICN − P = t−1 P, t ∈ C \ {0}, and, hence, m[CP (· − λ0 ); λ0 ] =
1 2πi
(λ − λ0 )−1 dλ tr P = 1. γ
Consequently, Axiom A2 of Theorem 6.2.1 is satisfied as well. Therefore, the result is a direct consequence of Theorem 6.2.1. Remark 6.5.3. Actually, as an easy consequence of Proposition 3.1.1, it readily follows that every isolated eigenvalue λ0 of a holomorphic family must be an algeN ∞ N braic eigenvalue (see Exercise 3). Therefore, A∞ λ0 (C ) consists of all L ∈ Sλ0 (C ) for which either L(λ0 ) is an isomorphism, or λ0 is an isolated eigenvalue of L. The following result is an immediate consequence of Corollary 6.5.2. Corollary 6.5.4. Let N ≥ 1 be an integer and choose a basis in CN to identify L(CN ) with MN (C). Then, for all A ∈ MN (C) and λ0 ∈ σ(A), χ[·ICN − A; λ0 ] = ma (λ0 ), where ma (λ0 ) denotes the algebraic multiplicity of λ0 as an eigenvalue of the matrix A.
6.6. Exercises
151
Proof. According to (6.6), we have that, for sufficiently small ε > 0, χ[·ICN − A; λ0 ] = tr
1 2πi
Cε (λ0 )
(λICN − A)−1 dλ = tr
1 2πi
R(λ; A) dλ. Cε (λ0 )
On the other hand, by Theorem 3.4.1, the operator Pλ0 :=
1 2πi
R(λ; A) dλ Cε (λ0 )
projects CN onto N [(λ0 ICN − A)ν(λ0 ) ], where ν(λ0 ) is the algebraic ascent of λ0 as an eigenvalue of A. Therefore, we conclude from Theorem 1.2.1 that χ[·ICN − A; λ0 ] = tr Pλ0 = rank Pλ0 = dim N [(λ0 ICN − A)ν(λ0 ) ] = ma (λ0 ). The fact that the trace of Pλ0 equals its range follows very easily from the fact that Pλ0 |N [(λ0 ICN −A)ν(λ0 ) ] = IN [(λ0 ICN −A)ν(λ0 ) ] ; see Proposition 9.2.2 for a general proof of this feature. This concludes the proof. In Chapters 7 and 9, all the results of this section will be generalized to the infinite-dimensional setting.
6.6 Exercises 1.
Prove successively the following: • If T ∈ L(U ) is an operator of finite rank, then there exist a finite-dimensional subspace X ⊂ U and a closed subspace Y ⊂ U such that U = X ⊕ Y,
T (X) ⊂ X
and
Y ⊂ N [T ].
• Use this feature to obtain the following generalization of Lemma 6.1.1: If P, Q ∈ L(U ) are two projections of the same finite rank then there exists an isomorphism T ∈ L(U ) such that P = T QT −1 . 2. Use Lemma 6.1.1 and induction to give an alternative proof of the second result of Exercise 1: If P, Q ∈ L(U ) are two projections of the same finite rank then there exists an isomorphism T ∈ L(U ) such that P = T QT −1 . 3. Use Proposition 3.1.1 to prove that every isolated eigenvalue λ0 of a holomorphic family with values in MN (C) must be algebraic.
152
Chapter 6. Uniqueness of the Algebraic Multiplicity
4.
The following is requested to be done: ∞ • Prove that LM ∈ A∞ λ0 (U ) if L, M ∈ Aλ0 (U ). • Given a semigroup (G, +) containing (N, +) as a sub-semigroup, prove that there exists a unique function m[ · ; λ0 ] : A∞ λ0 (U ) → G satisfying the following properties: A1. m[LM; λ0 ] = m[L; λ0 ] + m[M; λ0 ] for all L, M ∈ A∞ λ0 (U ). A2. m[CP0 (· − λ0 ); λ0 ] = 1 for some rank-1 projection P0 ∈ L(U ). A3. m[L; λ0 ] = 0 whenever L ∈ A∞ λ0 (U ) and L(λ0 ) is an isomorphism.
5.
Prove that there are two different functions m[ · ; λ0 ] : Sλ∞0 (U ) → Z ∪ {∞}
satisfying Axioms A1 and A2 of the statement of Theorem 6.0.1. 6. Prove that Axioms A1–A3 of Exercise 4 are independent. In other words, none of them is inferable from the remaining two. 7. State and prove the version of the result of Exercise 4 for the general case when U = V . 8. Let U , V be non-zero spaces with the same finite dimension, and choose bases so that the determinant can be defined in L(U, V ). Prove that χ[L; λ0 ] = ordλ0 det L
for all
L ∈ Sλ∞0 (U, V ).
9. Generalize the result of Corollary 6.5.2 to cover the general case when U and V are isomorphic to CN , for some N ≥ 1. 10. Adapt the proof of Theorem 6.3.1 to prove the following result: Let U be a Banach space, and λ0 ∈ K. Then there exists at most one function m[·; λ0 ] : Mλ0 (U ) → [0, ∞] satisfying the following properties: • For all L, M ∈ Mλ0 (U ) such that LM ∈ Mλ0 (U ), m[LM; λ0 ] = m[L; λ0 ] + m[M; λ0 ]. • A projection P0 ∈ L(U ) of rank-one exists such that m[CP0 (· − λ0 ); λ0 ] = 1.
6.7 Comments on Chapter 6 This chapter is based on Mora-Corral [99]. Actually, all the uniqueness theorems studied in this chapter go back to Mora-Corral [100, 99]. More general uniqueness theorems can be found in [99] and in the list of exercises of Chapter 7. The results of Section 6.5 reveal that the concept of multiplicity introduced in Chapter 4 equals the classic concepts of algebraic multiplicity in Euclidean spaces, which might have been expected from the very beginning of Chapter 4. All those results will be generalized in Chapters 7 and 9 through the local Smith form. So deeper discussions are postponed.
Chapter 7
Algebraic Multiplicity Through Jordan Chains. Smith Form This chapter studies the algebraic multiplicity according to the theory of Jordan chains. The concept of Jordan chain extends the classic concept of chain of generalized eigenvectors, already studied in Section 1.3. It will provide us with a further approach to the algebraic multiplicities χ and µ introduced and analyzed in Chapters 4 and 5, respectively, whose axiomatization has already been accomplished through the uniqueness theorems included in Chapter 6. More precisely, the new concept of multiplicity to be introduced in this chapter is based upon the number and lengths of all Jordan chains of the family L at the value λ0 , through the concept of canonical set of Jordan chains. Not surprisingly, it equals the multiplicities χ[L; λ0 ] and µ[L; λ0 ], because it satisfies the product formula and, consequently, it inherits the axiomatic of Chapter 6. Actually, establishing the hidden inter-relations connecting the associated invariants of all those different approaches to the algebraic multiplicity will extraordinarily facilitate the derivation of a series of extremely sharp properties of the canonical sets of Jordan chains. For example, it will reveal that, for a given family L ∈ C r (Ω, L(U, V )) with r ∈ N ∪ {∞} (not necessarily analytic) with L0 ∈ Fred0 (U, V ), the lengths of all Jordan chains of L at λ0 ∈ Eig(L) are uniformly bounded above if and only if λ0 is an algebraic eigenvalue of L. As a by-product, this pivotal property will allow us to characterize whether or not the family L admits a local Smith form at λ0 . Basically, the local Smith form of L at λ0 is the simplest canonical form that can be obtained through pre- and postmultiplication of L by two families of isomorphisms. Among the main results of this chapter, it will be shown that L possesses a local Smith form of at λ0 if and only if λ0 ∈ Alg(L). In other words, if and only if χ[L; λ0 ] = µ[L; λ0 ] < ∞.
154
Chapter 7. Algebraic Multiplicity Through Jordan Chains. Smith Form
The local Smith form tremendously facilitates the proof of some of the most useful properties of the algebraic multiplicity that has been axiomatized in Chapter 6, such as the stability theorem for holomorphic families (see Section 8.4), and the product formula in its more general version (see next Exercise 19). In addition to that, another important interest relies on the fact that it provides the most versatile way to characterize whether two given families are locally equivalent. Two families are said to be locally equivalent when one of them can be obtained from the other through pre- and post-multiplication by two isomorphism families. It turns out that two families are locally equivalent at λ0 if and only if they possess the same local Smith form at λ0 . The general plan of this chapter is as follows. Section 7.1 introduces the concept of Jordan chain and uses the theory of Chapter 4 for characterizing the Jordan chains at any transversal eigenvalue. Section 7.2 fixes the concepts of canonical set of Jordan chains and of partial and total κ-multiplicities, denoted by κj [L; λ0 ] and κ[L; λ0 ], through the number of Jordan chains of a given length in any canonical set. Section 7.3 shows the invariance of the partial κ-multiplicities under pre- and post-multiplication by continuous isomorphism families. Section 7.4 introduces the concept of local Smith form for L ∈ C r (Ω, L(U, V )) at any λ0 ∈ Eig(L) and establishes the existence of a local Smith form when r = ∞ and no Jordan chain of L can be continued indefinitely in the special case when U and V are isomorphic to Km , for some m ≥ 1. Section 7.5 combines the transversalization theorem of Chapter 4 with the invariance theorem of Section 7.3 to obtain a finite scheme for ascertaining the partial κ-multiplicities and, consequently, constructing canonical sets of Jordan chains systematically. The remaining sections contain some of the main consequences of the basic analysis carried out in the previous ones. Namely, in Section 7.6 it is proved that the multiplicity κ[L; λ0 ] coincides with the multiplicities χ[L; λ0 ] and µ[L; λ0 ], and that κ[L; λ0 ] < ∞ if and only if the length of every Jordan chain of L at λ0 is bounded above by a ν < r + 1. According to the results of Chapters 4 and 5, it turns out that κ[L; λ0 ] < ∞ if and only if λ0 ∈ Algν (L) for some 0 ≤ ν < r + 1. Incidentally, much like in the context of classic spectral theory, ν can be characterized as the lowest natural number k for which dim N [trng {L0 , . . . , Lk−1 }] = dim N [trng {L0 , . . . , Lk }] , though this point will not be completely clarified until Chapter 8. Section 7.7 labels the vectors of a canonical set of Jordan chains in an appropriate way useful in Chapter 10. All previous information will be brought together in Section 7.8 to characterize the existence of the local Smith form. Section 7.9 illustrates that characterization by analyzing two simple examples. Finally, Section 7.10 introduces the notion of local equivalence of families and uses the theorem of characterization of the local Smith form to determine whether two given families are locally equivalent at a point.
7.1. The concept of Jordan chain
155
As in Chapters 4 and 5, throughout this chapter we consider K ∈ {R, C}, two K-Banach spaces U and V , an open subset Ω ⊂ K, a point λ0 ∈ Ω, and a family L ∈ C r (Ω, L(U, V )), for some r ∈ N ∪ {∞, ω}, with L0 ∈ Fred0 (U, V ), even if not mentioned. As Fred0 (U, V ) is an open set of L(U, V ), we actually have that L(λ) ∈ Fred0 (U, V ) for λ sufficiently close to λ0 . Throughout the rest of this book, for any family L ∈ C r (Ω, L(U, V )) and any integer 0 ≤ s ≤ r, we will denote ⎛ ⎞ L0 0 ··· 0 ⎜ ⎟ L0 ··· 0 ⎟ ⎜L1 (7.1) L[s] := trng{L0 , . . . , Ls } = ⎜ . ⎟ .. .. ⎜ .. ⎟, . .. ⎠ ⎝ . . Ls Ls−1 · · · L0 where, as usual in this book, j!Lj = Lj) (λ0 ),
0 ≤ j < r + 1.
These conventions will substantially simplify most of the subsequent notation and statements.
7.1 The concept of Jordan chain The next definition introduces the concept of Jordan chain. Definition 7.1.1. Let r ∈ N ∪ {∞} and L ∈ C r (Ω, L(U, V )). Then, for a given integer 0 ≤ s ≤ r, a vector (u0 , . . . , us ) ∈ U s+1 with u0 = 0 is said to be a Jordan chain of length s + 1 of L at λ0 starting at u0 if j
Li uj−i = 0,
0 ≤ j ≤ s.
(7.2)
i=0
Remark 7.1.2. Using (7.1), the identities (7.2) can be equivalently expressed as L[s] col[u0 , . . . , us ] = 0 and, consequently, the set of Jordan chains of length s + 1 of L at λ0 is given through the column vectors col[u0 , . . . , us ] ∈ N [L[s] ] with u0 = 0. Therefore, the following properties are satisfied: • If (u0 , . . . , us ) is a Jordan chain of L at λ0 , then, so is (u0 , . . . , up ) for each integer 0 ≤ p ≤ s. • If (u0 , . . . , us ) and (v0 , . . . , vs ) are two Jordan chains of length s+1 of L at λ0 , then, so is (λu0 + µv0 , . . . , λus + µvs ) for every λ, µ ∈ K with λu0 + µv0 = 0.
156
Chapter 7. Algebraic Multiplicity Through Jordan Chains. Smith Form
As (7.2) imposes L0 u0 = 0, the family L admits a Jordan chain at λ0 if and only if λ0 ∈ Eig(L). In such a case, any vector u0 ∈ N [L0 ] \ {0} is said to be an eigenvector of L at λ0 ; the vector (u0 ) itself provides a Jordan chain of length 1 of L at λ0 starting at u0 , of course. Suppose U ⊂ V with continuous embedding J : U → V , and consider the associated operator family L(λ) = λJ − T,
λ ∈ K,
for a given T ∈ L(U, V ). Then, L ∈ P[L(U, V )] and for any λ0 ∈ K, L0 = λ0 J − T,
L1 = J,
Lh = 0
for all h ≥ 2.
Thus, in this special case, system (7.2) becomes (T − λ0 J)u0 = 0,
(T − λ0 J)u1 = u0 ,
...,
(T − λ0 J)us = us−1 ,
and, hence, the vector (u0 , . . . , us ) is a Jordan chain of length s + 1 of L at λ0 starting at u0 if and only if it equals (T − λ0 J)s us , (T − λ0 J)s−1 us , . . . , (T − λ0 J)2 us , (T − λ0 J)us , us with us ∈ N [(T − λ0 J)s+1 ] \ N [(T − λ0 J)s ]. Consequently, in the classical setting, the Jordan chains provide all possible chains of generalized eigenvectors forming the Jordan basis, as discussed in Section 1.3. So the concept of Jordan chain introduced by Definition 7.1.1 is a natural generalization of the concept of generalized eigenvector chain associated with an eigenvalue λ0 of a square matrix. Systems of the type (7.2) were already introduced in Section 4.1 to motivate the concept of transversal eigenvalue. Actually, the concept of transversal eigenvalue was introduced to get system (7.2) uncoupled and, consequently, at a transversal eigenvalue the structure of the Jordan chains should be extremely simple. In fact, the following result holds. Proposition 7.1.3. Suppose r ∈ N∗ ∪ {∞}, the family L ∈ C r (Ω, L(U, V )) satisfies L0 ∈ Fred0 (U, V ), and, for some integer 1 ≤ ν ≤ r, the subspaces ν−1 6
R[L0 ], L1 (N [L0 ]), . . . , Lν (
N [Lj ])
j=0
are in direct sum. Then, for each integer 0 ≤ s ≤ ν, the vector (u0 , . . . , us ) ∈ U s+1 is a Jordan chain of L at λ0 if and only if u0 = 0 and uj ∈
s−j 6 i=0
N [Li ],
0 ≤ j ≤ s.
(7.3)
7.2. Canonical sets and κ-multiplicity
157
In other words, ⎛ N [L[s] ] = ⎝
s 6
⎞
⎛
N [Lj ]⎠ × ⎝
j=0
s−1 6
⎞ N [Lj ]⎠ × · · · × N [L0 ].
j=0
Consequently, s + 1 ≤ ν when λ0 is a ν-transversal eigenvalue of L and there are Jordan chains of L at λ0 of length s + 1. Proof. Let s be an integer such that 0 ≤ s ≤ ν. According to Lemma 4.1.1, it is obvious that (u0 , . . . , us ) ∈ U s+1 is a Jordan chain of L at λ0 if and only if u0 = 0 and (7.3) is satisfied. Suppose λ0 is a ν-transversal eigenvalue of L for some integer 1 ≤ ν ≤ r. Then, by Proposition 4.2.2, ν 6 N [Lj ] = {0} j=0
and, therefore, s ≤ ν − 1 for all Jordan chains of length s + 1, which concludes the proof.
7.2 Canonical sets and κ-multiplicity The next definition introduces the concept of rank map associated with an operator family at a given λ0 ∈ Eig(L). Definition 7.2.1. Let r ∈ N ∪ {∞} and L ∈ C r (Ω, L(U, V )) with λ0 ∈ Eig(L) and L0 ∈ Fred0 (U, V ). Let Lr+1 denote either the empty set, if r = ∞, or the set of eigenvectors u0 ∈ N [L0 ] \ {0} for which L admits a Jordan chain of length r + 1 at λ0 starting at u0 , if r ∈ N. Then, the rank map associated with L at λ0 is the map rank : N [L0 ] \ (Lr+1 ∪ {0}) → N ∪ {∞} defined, for every u0 ∈ N [L0 ] \ (Lr+1 ∪ {0}) , as follows: • rank(u0 ) = k ∈ N if k < r + 1 and L admits a Jordan chain of length k at λ0 starting at u0 , but not a Jordan chain of length k + 1. • rank(u0 ) = ∞ when, for every integer k ≥ 1, the family L possesses a Jordan chain of length k at λ0 starting at u0 . In the case r = ∞, the rank map has been defined over all N [L0 ] \ {0}. Another closely related concept of infinity rank might be given through the following definition.
158
Chapter 7. Algebraic Multiplicity Through Jordan Chains. Smith Form
Definition 7.2.2. Suppose r = ∞ and (u0 , . . . , us ) is a Jordan chain of L at λ0 . It is said that the Jordan chain (u0 , . . . , us ) can be continued indefinitely if there exists a sequence {un }n≥s+1 in U such that (u0 , . . . , un ) is a Jordan chain of L at λ0 for all n ≥ s + 1. According to Definition 7.2.1, rank u0 = ∞ if the Jordan chain (u0 ) can be continued indefinitely; however, in general there might exist some u0 ∈ N [L0 ] \ {0} with rank u0 = ∞ for which (u0 ) cannot be continued indefinitely. Actually, / Fred0 (U, V ). Nevertheless, Exercise 15 shows that this can indeed occur if L0 ∈ in the case L0 ∈ Fred0 (U, V ), it will become apparent from Theorem 7.8.3 that rank u0 = ∞ if and only if the chain (u0 ) can be continued indefinitely. Simple examples show the existence of eigenvectors with infinity rank. Indeed, suppose U = V = K = R, the point λ0 is 0, and L is the family defined by (4.20). Then, Lj = 0 for all j ≥ 0, and, hence, rank u0 = ∞
for all u0 ∈ R \ {0},
because, for any n ≥ 1, the vector (u0 , . . . , u0 ) ∈ Rn is a Jordan chain of length n. Now we describe the concept of canonical set of Jordan chains. To this aim, we consider r ∈ N ∪ {∞} and L ∈ C r (Ω, L(U, V )) with L0 = L(λ0 ) ∈ Fred0 (U, V ) \ Iso(U, V ),
(7.4)
for which the length of all Jordan chains of L at λ0 is uniformly bounded above by some integer k ≤ r. Then, the rank map is defined over the whole N [L0 ] \ {0}. Let κ1 ≤ k satisfy that L possesses a Jordan chain of length κ1 , but it does not admit a Jordan chain of length κ1 + 1. Then, there exists u0,1 ∈ N [L0 ] \ {0} with
rank u0,1 = κ1 ,
and the length of all Jordan chains of L at λ0 is bounded above by κ1 . Define n := dim N [L0 ], and proceeding inductively, suppose that for some 2 ≤ i ≤ n we have chosen i − 1 linearly independent vectors u0,1 , . . . , u0,i−1 ∈ N [L0 ], and take u0,i ∈ Ci := N [L0 ] \ span[u0,1 , . . . , u0,i−1 ] such that rank u0,i = κi := max{rank u : u ∈ Ci }. This process can be repeated until n linearly independent vectors u0,1 , . . . , u0,n ∈ N [L0 ] have been selected. They form a basis of N [L0 ], since n = dim N [L0 ]. Finally, for each i ∈ {1, . . . , n}, let (u0,i , u1,i , . . . , uκi −1,i ) be any Jordan chain of length κi of L at λ0 starting at u0,i .
7.2. Canonical sets and κ-multiplicity
159
Definition 7.2.3. Any ordered family u0,1 , . . . , uκ1 −1,1 ; · · · ; u0,i , . . . , uκi −1,i ; · · · ; u0,n , . . . , uκn −1,n
(7.5)
constructed through the previous scheme is said to be a canonical set of Jordan chains of L at λ0 . By construction, κ1 ≥ · · · ≥ κn ≥ 1 and the following result is obtained. Proposition 7.2.4. Let r ∈ N ∪ {∞} and L ∈ C r (Ω, L(U, V )) satisfy (7.4) for which the length of all Jordan chains of L at λ0 is uniformly bounded above by some integer k ≤ r. Then, the integers κ1 , . . . , κn of the construction of any canonical set of Jordan chains are the same for all canonical sets of Jordan chains. Proof. Clearly, κ1 is the same for every canonical set of Jordan chains. Set K1 := {u ∈ N [L0 ] \ {0} : rank u = κ1 }. By Remark 7.1.2, E1 := K1 ∪ {0} is the linear subspace of N [L0 ] generated by K1 . Set := dim E1 and let {u0,1 , . . . , u0,n } be a basis of N [L0 ] selected from a canonical set of Jordan chains. Then, E1 = span[u0,1 , . . . , u0, ], because these vectors are linearly independent, by construction. Thus, κ1 = · · · = κ are independent of the canonical set. This concludes the proof if = n. Suppose < n. Clearly, κ+1 is independent of the canonical set of Jordan chains. Then, reasoning as before, we consider K2 := {u ∈ N [L0 ] \ {0} : rank u ≥ κ+1 }. By Remark 7.1.2, E2 := K2 ∪ {0} is the subspace of N [L0 ] generated by K2 . Moreover, since κ1 ≥ κ+1 , we have that E1 ⊂ E2 = span[u0,1 , . . . , u0,dim E2 ]. Consequently, κ+1 = · · · = κdim E2 are independent of the canonical set of Jordan chains. Repeating this scheme as many times as necessary concludes the proof. Proposition 7.2.4 actually shows the consistency of the following concept of algebraic κ-multiplicity. Definition 7.2.5. Let r ∈ N∪{∞} and L ∈ C r (Ω, L(U, V )) be with L0 ∈ Fred0 (U, V ). Then, the algebraic κ-multiplicity of L at λ0 , denoted by κ[L; λ0 ], is defined through:
160
Chapter 7. Algebraic Multiplicity Through Jordan Chains. Smith Form
• κ[L; λ0 ] = 0, if L0 ∈ Iso(U, V ). n • κ[L; λ0 ] := j=1 κj , if n := dim N [L0 ] ≥ 1 and the length of all Jordan chains of L at λ0 is uniformly bounded above by some integer k ≤ r. In such a case, for each 1 ≤ j ≤ n, the integer κj [L; λ0 ] := κj is said to be the jth partial κ-multiplicity of L at λ0 . • κ[L; λ0 ] = ∞, if r = ∞ and L possesses Jordan chains at λ0 with arbitrarily large length. The multiplicity κ[L; λ0 ], as well as the partial κ-multiplicities, is left undefined when r ∈ N, the family L is not of class C r+1 in any neighborhood of λ0 , and L possesses a Jordan chain of length r + 1 at λ0 . The extension of the concept of partial κ-multiplicities to the case when r = ∞ and the lengths of the Jordan chains of L are unbounded has been postponed until Exercise 5. Theorem 7.6.3 establishes that κ coincides with the multiplicity χ introduced in Chapter 4. Consequently, according to Theorem 5.3.1, it must also coincide with the multiplicity µ introduced in Chapter 5. Example. Suppose U = V = Km for some integer m ≥ 1, and L(λ) = diag{(λ − λ0 )p1 , . . . , (λ − λ0 )pm },
λ ∈ K,
for some p1 , . . . , pm ∈ N. Then, n := dim N [L0 ] = Card{i ∈ {1, . . . , m} : pi ≥ 1} and, according to Definition 7.2.5, κ[L; λ0 ] =
m
pj .
j=1
Moreover, in the case n ≥ 1, κ1 := κ1 [L; λ0 ] = max{p1 , . . . , pm } and, in general, when n ≥ 2, κj [L; λ0 ] = max ({p1 , . . . , pm } \ {κ1 , . . . , κj−1 }) , In particular, if
2 ≤ j ≤ n.
L(λ) = diag (λ − λ0 )p1 , . . . , (λ − λ0 )pn , 1, . . . , 1 m−n
with p1 ≥ · · · ≥ pn ≥ 1, then, n = dim N [L0 ], κ[L; λ0 ] =
n j=1
pj ,
and κj [L; λ0 ] = pj ,
1 ≤ j ≤ n.
7.3. Invariance by continuous families of isomorphisms
161
7.3 Invariance by continuous families of isomorphisms The next result shows the invariance of the partial multiplicities under multiplication by continuous families of isomorphisms. Theorem 7.3.1 (of invariance). Let r ∈ N ∪ {∞}, and let there be four K-Banach ˆ , Vˆ , and four operator families spaces U , V , U ˆ , Vˆ )), M ∈ C r (Ω, L(U ˆ F ∈ C(Ω, L(U, U)),
L ∈ C r (Ω, L(U, V )), E ∈ C(Ω, L(Vˆ , V )), such that E0 := E(λ0 ) ∈ Iso(Vˆ , V ),
ˆ F0 := F(λ0 ) ∈ Iso(U, U),
(7.6)
and L = EMF.
(7.7)
ˆ , Vˆ ), and, in such a case, Then, L0 ∈ Fred0 (U, V ) if and only if M0 ∈ Fred0 (U for every integer 0 ≤ s ≤ r there is a linear bijection between the sets of Jordan chains of length s + 1 of L and M at λ0 . In particular, the length of all Jordan chains of L at λ0 is uniformly bounded above by some integer k ≤ r if and only if so is the length of all Jordan chains of M. Moreover, in such a circumstance, κ[L; λ0 ] = κ[M; λ0 ], and, actually, when L0 ∈ / Iso(U, V ), κj [L; λ0 ] = κj [M; λ0 ],
1 ≤ j ≤ dim N [L0 ] = dim N [M0 ].
Proof. By (7.6) and (7.7), it is clear that ˆ , Vˆ ). L0 ∈ Fred0 (U, V ) if and only if M0 ∈ Fred0 (U Throughout the rest of the proof we will work under this assumption. ˆ , Vˆ ). Again by (7.6) and (7.7), L0 ∈ Iso(U, V ) if and only if M0 ∈ Iso(U Moreover, in such a case, according to Definition 7.2.5, we have that κ[L; λ0 ] = κ[M; λ0 ] = 0, which concludes the proof. So, we will subsequently assume that n = dim N [L0 ] = dim N [M0 ] ≥ 1. First, we will prove the theorem in the special case when E ∈ C r (Ω, L(Vˆ , V ))
ˆ )). and F ∈ C r (Ω, L(U, U
Fix an integer 0 ≤ s ≤ r. Then, applying the Leibniz rule to (7.7) gives L[s] = E[s] M[s] F[s] .
162
Chapter 7. Algebraic Multiplicity Through Jordan Chains. Smith Form
By Remark 7.1.2, the spaces N [M[s] ] and N [L[s] ] provide all Jordan chains of length s + 1 of M and L at λ0 , respectively. Moreover, by (7.6), E[s] ∈ Iso(Vˆ s+1 , V s+1 ),
ˆ s+1 ). F[s] ∈ Iso(U s+1 , U
Therefore, the map Is : N [L[s] ] → N [M[s] ] col[u0 , . . . , us ] → F[s] col[u0 , . . . , us ] establishes an isomorphism. Moreover, setting col[ˆ u0 , . . . , uˆs ] := F[s] col[u0 , . . . , us ] shows that u ˆ0 = 0 if and only if u0 = 0, since u ˆ0 = F0 u0 . Consequently, the map Is establishes a linear bijection between the Jordan chains of length s + 1 of M and those of L. The remaining assertions of the theorem are straightforward consequences of this fact. The same idea can be adapted to cover the general case when E and F are continuous, although carrying out all technical details in the general case is more involved, as identity (7.7) cannot be differentiated. Fix an integer 0 ≤ s ≤ r. By Theorem 4.3.2, there exists Φ ∈ P[L(U )] with Φ0 = IU for which the transformed family LΦ := LΦ satisfies Vs :=
s
(7.8)
Φ Φ Φ LΦ j (N [L0 ] ∩ · · · ∩ N [Lj−1 ]) ⊕ R[L0 ] ⊂ V.
j=1
Then, setting FΦ := FΦ, we have FΦ 0 = F0
and LΦ = EMFΦ .
(7.9)
By (7.8), according to the result already established in the regular case, it is apparent that the map N [LΦ [s] ] → N [L[s] ] col[u0 , . . . , us ] → Φ[s] col[u0 , . . . , us ] establishes a linear bijection between the Jordan chains of length s + 1 of LΦ and those of L. Consequently, to complete the proof it suffices to establish a linear bijection between the Jordan chains of length s + 1 of LΦ and those of M. According to (7.6) and (7.9), we have that M0 F0 u0 = 0 if and only if
u0 ∈ N [LΦ 0]
(7.10)
7.3. Invariance by continuous families of isomorphisms
163
and, hence, in the case s = 0, the map u0 → F0 u0 indeed establishes a linear bijection between the Jordan chains of length 1 of LΦ and those of M. Suppose 1 ≤ s < r + 1, and let (u0 , . . . , us ) be a Jordan chain of LΦ . Then, by Proposition 7.1.3, u0 = 0 and uj ∈
s−j 6
N [LΦ i ],
0 ≤ j ≤ s.
i=0
In particular, dim
s 6
N [LΦ i ]≥ 1
i=0
and there exist s + 1 natural numbers ns ≤ ns−1 ≤ · · · ≤ n1 ≤ n0 , and n0 linearly independent vectors u1 , . . . , un0 in U such that j 6
1 nj N [LΦ i ] = span[u , . . . , u ],
0 ≤ j ≤ s.
i=0
Clearly,
! " i N [LΦ ] = span col[0, . . . , 0 , u , 0, . . . , 0 ] : 1 ≤ i ≤ n , 0 ≤ j ≤ s . s−j [s] j
s−j
On the other hand, for each integer 0 ≤ ≤ s, i−1 LΦ (λ) − j=0 (λ − λ0 )j LΦ j Φ Φ 0= Li u−i = L0 u + lim u−i . i λ→λ0 (λ − λ ) 0 i=0 i=1 Moreover, owing to Remark 7.1.2, we have that, for any λ = λ0 , i−1
(λ − λ0 )j−i LΦ j u−i =
i=1 j=0
−1
(λ − λ0 )k
+k
LΦ j u+k−j = 0.
j=0
k=−
Thus, 0 = lim
λ→λ0
(λ − λ0 )−i LΦ (λ)u−i = lim
λ→λ0
i=0
(λ − λ0 )−i E(λ)M(λ)FΦ (λ)u−i .
i=0
As E0 ∈ Iso(Vˆ , V ), the inverse operator E−1 is continuous in a neighborhood of λ0 and, hence, for each integer 0 ≤ ≤ s, lim
λ→λ0
i=0
(λ − λ0 )−i M(λ)FΦ (λ)u−i = 0.
164
Chapter 7. Algebraic Multiplicity Through Jordan Chains. Smith Form
For each λ = λ0 and 0 ≤ ≤ s, we also have M(λ) =
(λ − λ0 )j Mj + o (λ − λ0 )
j=0
and, consequently, lim λ→λ0
i
Mj (λ − λ0 )j−i FΦ (λ)u−i = 0,
0 ≤ ≤ s.
i=0 j=0
Therefore, for every 0 ≤ ≤ s, lim M[] FΦ [[]] (λ) col[u0 , . . . , u ] = 0,
λ→λ0
(7.11)
where +1 ˆ +1 FΦ ,U ) [[]] : Ω \ {λ0 } → L(U
stands for the family defined through Φ −1 Φ FΦ F (λ), . . . , (λ − λ0 )− FΦ (λ) [[]] (λ) := trng F (λ), (λ − λ0 ) for all λ ∈ Ω \ {λ0 }. Take 1 ≤ ≤ s and col[u0 , . . . , u ] ∈ N [LΦ [] ]. Then, taking into account that FΦ 0 = F0 , we find from (7.11) that 0 = lim M[] FΦ [[]] (λ) col[u0 , . . . , u ] λ→λ0
= M[] diag{F0 , . . . , F0 } col[u0 , . . . , u ] + lim M[] trng{0, (λ − λ0 )−1 FΦ (λ), . . . , (λ − λ0 )− FΦ (λ)} col[u0 , . . . , u ] λ→λ0 0 = col[M0 F0 u0 , . . . , M F0 u0 ] + M[−1] col[F0 u1 , . . . , F0 u ] 0 + lim M[] λ→λ0 trng{(λ − λ0 )−1 FΦ (λ), . . . , (λ − λ0 )− FΦ (λ)} col[u0 , . . . , u−1 ] 0 = col[M0 F0 u0 , . . . , M F0 u0 ] + M[−1] col[F0 u1 , . . . , F0 u ] 0 + lim . λ→λ0 (λ − λ0 )−1 M[−1] FΦ [[−1]] (λ) col[u0 , . . . , u−1 ]
7.3. Invariance by continuous families of isomorphisms
165
Therefore, identifying the last rows shows that lim (λ − λ0 )−1 M[−1] FΦ [[−1]] (λ) col[u0 , . . . , u−1 ]
λ→λ0
= − col[M1 F0 u0 , . . . , M F0 u0 ] − M[−1] col[F0 u1 , . . . , F0 u ]. By the result of Exercise 1, ˆ , Vˆ ), M[−1] ∈ Fred0 (U so the space R[M[−1] ] is closed, and, hence, we find from this identity that there exists ˆ ˆ−1 ] ∈ U col[ˆ u0 , . . . , u such that M[−1] col[ˆ u0 , . . . , u ˆ−1 ] = − col[M1 F0 u0 , . . . , M F0 u0 ] − M[−1] col[F0 u1 , . . . , F0 u ].
(7.12)
To summarize, for each 1 ≤ ≤ s and col[u0 , . . . , u ] ∈ N [LΦ [] ] there exists ˆ ˆ−1 ] ∈ U col[ˆ u0 , . . . , u satisfying (7.12). For every 1 ≤ i ≤ ns , we have that col[ui , 0, . . . , 0] ∈ N [LΦ [s] ] s
and, hence, due to (7.12), there exists ˆs col[ˆ ui0 , . . . , u ˆis−1 ] ∈ U such that ui0 , . . . , uˆis−1 ] = − col[M1 F0 ui , . . . , Ms F0 ui ]. M[s−1] col[ˆ Now, let 1 ≤ j ≤ s and nj < i ≤ nj−1 . Then, ui ∈ span[u1 , . . . , unj−1 ] =
j−1 6
N [LΦ i ]
i=0
and, hence, col[ui , 0, . . . , 0] ∈ N [LΦ [j−1] ]. j−1
(7.13)
166
Chapter 7. Algebraic Multiplicity Through Jordan Chains. Smith Form
Thus, by (7.12), there exists ˆj col[ˆ ui0 , . . . , u ˆij−1 ] ∈ U such that M[j−1] col[ˆ ui0 , . . . , u ˆij−1 ] = − col[M1 F0 ui , . . . , Mj F0 ui ].
(7.14)
Moreover, if 1 ≤ i ≤ n0 , then ui ∈ N [LΦ 0 ], and (7.10) implies M0 F0 ui = 0.
(7.15)
As the vectors u1 , . . . , un0 are linearly independent, there exist operators ˆ) F1 , . . . , Fs ∈ L(U, U such that Fj ui = u ˆij−1 ,
1 ≤ j ≤ s,
1 ≤ i ≤ nj .
ˆ we have that Since F0 ∈ Iso(U, U), ˆ s+1 ). F{s} := trng{F0 , F1 , . . . , Fs } ∈ Iso(U s+1 , U Moreover,
F{s} N [LΦ [s] ] ⊂ N [M[s] ].
Indeed, by (7.13), (7.14), and (7.15), we have that, for every 0 ≤ j ≤ s − 1 and 1 ≤ i ≤ ns−j , M[s] F{s} col[0, . . . , 0, ui , 0, . . . , 0] j
s−j
= M[s] col[0, . . . , 0, F0 ui , F1 ui , . . . , Fs−j ui ] j
= M[s] col[0, . . . , 0, F0 ui , u ˆi0 , . . . , u ˆis−1−j ] j
= col[0, . . . , 0, M0 F0 ui , . . . , Ms−j F0 ui ] j
ui0 , . . . , u ˆis−1−j ] + col 0, . . . , 0, M[s−1−j] col[ˆ
j+1
= col[0, . . . , 0, M1 F0 ui , . . . , Ms−j F0 ui ] j+1
ui0 , . . . , u ˆis−1−j ] + col 0, . . . , 0, M[s−1−j] col[ˆ
j+1
= 0.
7.4. Local Smith form for C ∞ matrix families
167
Moreover, for every 1 ≤ i ≤ n0 , M[s] F{s} col[0, . . . , 0, ui ] = col[0, . . . , 0, M0 F0 ui ] = 0, s
s
because of (7.15). Therefore, the map F{s} : N [LΦ [s] ] → N [M[s] ] is well defined, linear, continuous and injective. Moreover, it sends Jordan chains of LΦ into Jordan chains of M, because if u0 ∈ U \ {0} then FΦ 0 u0 = F0 u0 = 0. Therefore, F[s] establishes a linear injection from the set of Jordan chains of length s + 1 of LΦ at λ0 to the set of Jordan chains of length s + 1 of M. As we have already constructed a linear bijection between the Jordan chains of length s + 1 of LΦ and those of L, we have actually established a linear injection from the set of Jordan chains of length s + 1 of L to the set of Jordan chains of length s + 1 of M. By the symmetric nature of the problem, transversalizing in this occasion M instead of L, it is easily realized that there is another linear injection from the set of Jordan chains of length s + 1 of M to the set of Jordan chains of length s + 1 of L. Consequently, we actually have established a linear bijection between both sets of Jordan chains, which concludes the proof.
7.4 Local Smith form for C ∞ matrix families As usual, for any integer m ≥ 1, we identify the space of m × m square matrices Mm (K) with L(Km ). The following result establishes the importance of the family considered in the Example of Section 7.2. Theorem 7.4.1. Let m ≥ 1 be an integer, r ∈ {∞, ω} and λ0 ∈ Ω. Consider an operator family L ∈ C r (Ω, Mm (K)) such that n := dim N [L0 ] ≥ 1 and no Jordan chain of L at λ0 can be continued indefinitely. Then, there exist an open subset Ω ⊂ Ω with λ0 ∈ Ω , and two families E, F ∈ C r (Ω , Mm (K)) such that E0 , F0 ∈ Iso(Km ) and L(λ) = E(λ) D(λ) F(λ),
λ ∈ Ω ,
(7.16)
where D ∈ P[Mm (K)] is the family defined, for each λ ∈ K, by D(λ) := diag (λ − λ0 )κ1 [L;λ0 ] , . . . , (λ − λ0 )κn [L;λ0 ] , 1, . . . , 1 . m−n
(7.17)
168
Chapter 7. Algebraic Multiplicity Through Jordan Chains. Smith Form
Remark 7.4.2. If n = m, then no entry 1 appears in the expression of D in (7.17). In general, D exhibits as many 1’s as indicated by the difference m − n. Obviously, the result is also satisfied if n = 0. In such a case, D = Im and one can make the choice E = Im and F = L. Proof of Theorem 7.4.1. It is based on the Gaussian elimination method, and proceeds by induction on m. Suppose m = 1. Then, L is a K-valued function and L0 = 0. Moreover, since no Jordan chain of L at λ0 can be continued indefinitely, 1 ≤ κ := κ[L; λ0 ] = κ1 [L; λ0 ] = ordλ0 L < ∞ and, hence, there exists F ∈ C r (Ω) such that F0 = 0 and L(λ) = (λ − λ0 )κ F(λ),
λ ∈ Ω.
Therefore, (7.16) holds true by making the choice E(λ) = 1 and D(λ) = (λ − λ0 )κ for each λ ∈ Ω. Suppose m ≥ 2 and the result to be true for every family in C r (Ω, Mm−1 (K)) satisfying the requirements of the theorem. Let L ∈ C r (Ω, Mm (K)) satisfy the requirements of the theorem. If ordλ0 L = ∞, then Lj = 0 for all j ≥ 0 and, hence, every Jordan chain of L at λ0 can be continued indefinitely. Thus, (7.18) ordλ0 L < ∞. Now, for each 1 ≤ i, j ≤ m, we denote by (i,j) the (i, j)th entry of L. Let (i0 , j0 ) be such that 0 ≤ h := ordλ0 (i0 ,j0 ) = min ordλ0 (i,j) . 1≤i,j≤m
By (7.18), h < ∞. Let P, Q ∈ Mm (K) be two permutation matrices (constant and ˜ defined by invertible) for which the family L ˜ L(λ) := P L(λ)Q,
λ ∈ Ω,
(7.19)
satisfies h = ordλ0 ˜(m,m) = where we have denoted
min ordλ0 ˜(i,j) ,
1≤i,j≤m
˜ = ˜(i,j) L
. 1≤i,j≤m
By the choice of h, for each (i, j) ∈ {1, . . . , m}2 there exists b(i,j) ∈ C r (Ω) such that λ ∈ Ω. ˜(i,j) (λ) = (λ − λ0 )h b(i,j) (λ), ˜ ⊂ Ω of λ0 Moreover, since b(m,m) (λ0 ) = 0, there exists an open neighborhood Ω such that ˜ b−1 (m,m) (0) ∩ Ω = ∅.
7.4. Local Smith form for C ∞ matrix families
169
˜ F ˜ ∈ C r (Ω, ˜ Mm (K)) defined by Now we consider the matrix families E, ⎛
b
⎜ ⎜ ˜ := ⎜ E ⎜ ⎜ ⎝
Im−1
(1,m) − b(m,m) .. . b(m−1,m) − b(m,m)
0 ··· 0
1
⎛ ⎜ ⎜ ˜ := ⎜ F ⎜ ⎜ ⎝
b
··· −
⎟ ⎟ ⎟ ⎟, ⎟ ⎠
0 .. . 0
Im−1 (m,1) − b(m,m)
⎞
b(m,m−1) b(m,m)
⎞ ⎟ ⎟ ⎟ ⎟. ⎟ ⎠
1
˜ and F ˜ take invertible values. Moreover, for each λ ∈ Ω, ˜ we have that Clearly, E ˜ L(λ) ˜ F(λ) ˜ ˜ E(λ) = diag{M(λ), ˜(m,m) (λ)} ˜ = diag{M(λ), (λ − λ0 )h } diag{Im−1 , b(m,m) (λ)},
(7.20)
˜ ∈ C r (Ω, ˜ Mm−1 (K)) stands for the matrix whose (i, j)th entry is given where M by b(i,m) , 1 ≤ i, j ≤ m − 1. m ˜ (i,j) := ˜(i,j) − ˜(m,j) b(m,m) Since diag{Im−1 , b(m,m) (λ0 )} ∈ Iso(Km ), by (7.19) and (7.20), we find from Theorem 7.3.1 that no Jordan chain of ˜ ˜mm } diag{M, can be continued indefinitely, as it was assumed to occur for L. On the other hand, a vector us u0 ,..., ∈ (Km )s+1 0 0 ˜ ˜mm } at λ0 whenever the vector is a Jordan chain of diag{M, (u0 , . . . , us ) ∈ (Km−1 )s+1 ˜ at λ0 . Therefore, no Jordan chain of M ˜ can be continis a Jordan chain of M ued indefinitely. Consequently, by the induction hypothesis, there exist an open ˆ ⊂Ω ˜ of λ0 and two families neighborhood Ω ˆ F ˆ ∈ C r (Ω, ˆ Mm−1 (K)) E,
170
Chapter 7. Algebraic Multiplicity Through Jordan Chains. Smith Form
ˆ 0, F ˆ 0 ∈ Iso(Km−1 ) and such that E ˜ ˆ D(λ) ˜ ˆ M(λ) = E(λ) F(λ),
ˆ λ ∈ Ω,
(7.21)
˜ is given through where D ˜ ˜ ˜ D(λ) := diag (λ − λ0 )κ1 [M;λ0 ] , . . . , (λ − λ0 )κn˜ [M;λ0 ] , 1, . . . , 1 m−1−˜ n
˜ 0 ]. By (7.21), we have that, for each λ ∈ Ω, ˆ and n ˜ := dim N [M ˜ ˆ ˜ ˆ diag{M(λ), (λ − λ0 )h } = diag{E(λ), 1} · diag{D(λ), (λ − λ0 )h } · diag{F(λ), 1}. Therefore, substituting this identity into (7.20), we find from (7.19) that there ˆ of λ0 such that exists an open neighborhood Ω ⊂ Ω L(λ) = E (λ)D (λ)F (λ),
λ ∈ Ω ,
where, for each λ ∈ Ω , ˜ −1 diag{E(λ), ˆ E (λ) := P −1 E(λ) 1}, ˜ D (λ) := diag{D(λ), (λ − λ0 )h }, ˆ ˜ −1 Q−1 . 1} diag{Im−1 , b(m,m) (λ)}F(λ) F (λ) := diag{F(λ), According to Theorem 7.3.1, n = dim N [L0 ] = dim N [D0 ] and κj [L; λ0 ] = κj [D ; λ0 ],
1 ≤ j ≤ n.
Note that n ˜ = n if h = 0, while n ˜ = n − 1 if h ≥ 1. Moreover, according to the Example of Section 7.2, there exist two permutation matrices P and Q such that D (λ) := P diag (λ − λ0 )κ1 [L;λ0 ] , . . . , (λ − λ0 )κn [L;λ0 ] , 1, . . . , 1 Q . m−n
Consequently, making the choice E(λ) := E (λ)P , concludes the proof.
F(λ) := Q F (λ),
λ ∈ Ω ,
Based on the previous result, it becomes rather natural to introduce the following concept of local Smith form.
7.5. Canonical sets at transversal eigenvalues
171
Definition 7.4.3. Let r ∈ N ∪ {∞} and L ∈ C r (Ω, L(U, V )) be with L0 ∈ Fred0 (U, V ) and n := dim N [L0 ] ≥ 1. The operator family L is said to admit a local Smith form at λ0 when there exist an open neighborhood Ω ⊂ Ω of λ0 , two families E ∈ C(Ω , L(U, V ))
and F ∈ C(Ω , L(U ))
with E0 ∈ Iso(U, V ) and F0 ∈ Iso(U ), a direct sum topological decomposition U = U0 ⊕ U1 , with n = dim U0 , and n integer positive numbers k1 ≥ · · · ≥ kn such that L(λ) = E(λ) [S(λ) ⊕ IU1 ] F(λ), where
λ ∈ Ω ,
S(λ) = diag (λ − λ0 )k1 , . . . , (λ − λ0 )kn ,
λ ∈ K.
In such a case, S is said to be a local Smith form of L at λ0 . According to Theorem 7.3.1, if the lengths of all Jordan chains of L at λ0 are uniformly bounded above by some integer k ≤ r, necessarily kj = κj [L; λ0 ],
1 ≤ j ≤ n,
and, consequently, the local Smith form should be unique, if it exists, but the rigorous proof of this feature is postponed until Proposition 7.10.2. Theorem 7.4.1 established that every C ∞ family of square matrices for which no Jordan chain can be continued indefinitely indeed possesses a local Smith form. Theorem 7.8.1 will show that this condition on the Jordan chains of L is not only sufficient for the existence of the local Smith form but also necessary. Necessary and sufficient conditions for the existence of the local Smith form for general operator-valued families of class C r will be established by Theorem 7.8.3. The Smith form of a family is the simplest canonical form that can be obtained from it through preand post-multiplication by isomorphism families, of course.
7.5 Canonical sets at transversal eigenvalues In this section we combine the transversalization Theorem 4.3.2 with the invariance Theorem 7.3.1 to provide a scheme to calculate the partial κ-multiplicities and, thus, building up, in a rather systematic way, canonical sets of Jordan chains. Proposition 7.5.1. Let r ∈ N ∪ {∞} and L ∈ C r (Ω, L(U, V )) satisfy that L0 ∈ Fred0 (U, V ) and λ0 is a ν-transversal eigenvalue for some integer 1 ≤ ν ≤ r. Set j := dim Lj (N [L0 ] ∩ · · · ∩ N [Lj−1 ]),
1 ≤ j ≤ ν.
(7.22)
172
Chapter 7. Algebraic Multiplicity Through Jordan Chains. Smith Form
Then, every canonical set of Jordan chains of L at λ0 consists of exactly j Jordan chains of length j for all j ∈ {1, . . . , ν}. Consequently, the partial κ-multiplicities of L at λ0 are given through ·· = 1 ν = · · · = ν > ν − 1 = · · · = ν − 1 > · · · > 1 = · ν
(7.23)
1
ν−1
and, therefore, κ1 [L; λ0 ] = ν and κ[L; λ0 ] =
n
κj [L; λ0 ] =
j=1
ν
i i = χ[L; λ0 ],
(7.24)
i=1
where χ i