Chapman & Hall/CRC Taylor & Francis Group 6000 Broken Sound Parkway NW, Suite 300 Boca Raton, FL 334872742 © 2007 by Taylor & Francis Group, LLC Chapman & Hall/CRC is an imprint of Taylor & Francis Group, an Informa business No claim to original U.S. Government works Printed in the United States of America on acidfree paper 10 9 8 7 6 5 4 3 2 1 International Standard Book Number10: 1584885106 (Hardcover) International Standard Book Number13: 9781584885108 (Hardcover) This book contains information obtained from authentic and highly regarded sources. Reprinted material is quoted with permission, and sources are indicated. A wide variety of references are listed. Reasonable eﬀorts have been made to publish reliable data and information, but the author and the publisher cannot assume responsibility for the validity of all materials or for the consequences of their use. No part of this book may be reprinted, reproduced, transmitted, or utilized in any form by any electronic, mechanical, or other means, now known or hereafter invented, including photocopying, microﬁlming, and recording, or in any information storage or retrieval system, without written permission from the publishers. For permission to photocopy or use material electronically from this work, please access www.copyright.com (http:// www.copyright.com/) or contact the Copyright Clearance Center, Inc. (CCC) 222 Rosewood Drive, Danvers, MA 01923, 9787508400. CCC is a notforproﬁt organization that provides licenses and registration for a variety of users. For organizations that have been granted a photocopy license by the CCC, a separate system of payment has been arranged. Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and are used only for identiﬁcation and explanation without intent to infringe. Visit the Taylor & Francis Web site at http://www.taylorandfrancis.com and the CRC Press Web site at http://www.crcpress.com
Dedication
I dedicate this book to my husband, Mark Hunacek, with gratitude both for his support throughout this project and for our wonderful life together.
vii
Acknowledgments
I would like to thank Executive Editor Bob Stern of Taylor & Francis Group, who envisioned this project and whose enthusiasm and support has helped carry it to completion. I also want to thank Yolanda Croasdale, Suzanne Lassandro, Jim McGovern, Jessica Vakili and Mimi Williams, for their expert guidance of this book through the production process. I would like to thank the many authors whose work appears in this volume for the contributions of their time and expertise to this project, and for their patience with the revisions necessary to produce a unified whole from many parts. Without the help of the associate editors, Richard Brualdi, Anne Greenbaum, and Roy Mathias, this book would not have been possible. They gave freely of their time, expertise, friendship, and moral support, and I cannot thank them enough. I thank Iowa State University for providing a collegial and supportive environment in which to work, not only during the preparation of this book, but for more than 25 years. Leslie Hogben
ix
The Editor
Leslie Hogben, Ph.D., is a professor of mathematics at Iowa State University. She received her B.A. from Swarthmore College in 1974 and her Ph.D. in 1978 from Yale University under the direction of Nathan Jacobson. Although originally working in nonassociative algebra, she changed her focus to linear algebra in the mid1990s. Dr. Hogben is a frequent organizer of meetings, workshops, and special sessions in combinatorial linear algebra, including the workshop, “Spectra of Families of Matrices Described by Graphs, Digraphs, and Sign Patterns,” hosted by American Institute of Mathematics in 2006 and the Topics in Linear Algebra Conference hosted by Iowa State University in 2002. She is the Assistant Secretary/Treasurer of the International Linear Algebra Society. An active researcher herself, Dr. Hogben particularly enjoys introducing graduate and undergraduate students to mathematical research. She has three current or former doctoral students and nine master’s students, and has worked with many additional graduate students in the Iowa State University Combinatorial Matrix Theory Research Group, which she founded. Dr. Hogben is the codirector of the NSFsponsored REU “Mathematics and Computing Research Experiences for Undergraduates at Iowa State University” and has served as a research mentor to ten undergraduates.
xi
Contributors
Marianne Akian INRIA, France
Ralph Byers University of Kansas
Zhaojun Bai University of CaliforniaDavis
Peter J. Cameron Queen Mary, University of London, England
Ravindra Bapat Indian Statistical Institute Francesco Barioli University of TennesseeChattanooga Wayne Barrett Brigham Young University, UT Christopher Beattie Virginia Polytechnic Institute and State University
Zlatko Drmaˇc University of Zagreb, Croatia
Fritz Colonius Universit¨at Augsburg, Germany
Victor Eijkhout University of Tennessee
Robert M. Corless University of Western Ontario, Canada
Mark Embree Rice University, TX
Biswa Nath Datta Northern Illinois University Jane Day San Jose State University, CA
Dario A. Bini Universit`a di Pisa, Italy
Luz M. DeAlba Drake University, IA
Murray R. Bremner University of Saskatchewan, Canada Richard A. Brualdi University of WisconsinMadison
Jack Dongarra University of Tennessee and Oakridge National Laboratory
Alan Kaylor Cline University of Texas
Peter Benner Technische Universit¨at Chemnitz, Germany
Alberto Borobia U. N. E. D, Spain
J. A. Dias da Silva Universidade de Lisboa, Portugal
James Demmel University of CaliforniaBerkeley
Shaun M. Fallat University of Regina, Canada Miroslav Fiedler Academy of Sciences of the Czech Republic Roland W. Freund University of CaliforniaDavis Shmuel Friedland University of IllinoisChicago St´ephane Gaubert INRIA, France
Inderjit S. Dhillon University of Texas
Anne Greenbaum University of Washington
Zijian Diao Ohio University Eastern
Willem H. Haemers Tilburg University, Netherlands
xiii
Frank J. Hall Georgia State University Lixing Han University of MichiganFlint Per Christian Hansen Technical University of Denmark Daniel Hershkowitz Technion, Israel
Steven J. Leon University of MassachusettsDartmouth ChiKwong Li College of William and Mary, VA RenCang Li University of TexasArlington Zhongshan Li Georgia State University
Nicholas J. Higham University of Manchester, England
Raphael Loewy Technion, Israel
Leslie Hogben Iowa State University
Armando Machado Universidade de Lisboa, Portugal
Randall Holmes Auburn University, AL Kenneth Howell University of Alabama in Huntsville Mark Hunacek Iowa State University, Ames David J. Jeffrey University of Western Ontario, Canada Charles R. Johnson College of William and Mary, VA Steve Kirkland University of Regina, Canada Wolfgang Kliemann Iowa State University
Roy Mathias University of Birmingham, England Volker Mehrmann Technical University Berlin, Germany Beatrice Meini Universit`a di Pisa, Italy Carl D. Meyer North Carolina State University Mark Mills Central College, Iowa Lucia I. Murakami Universidade de S˜ao Paulo, Brazil
Julien Langou University of Tennessee
Michael G. Neubauer California State UniversityNorthridge
Amy N. Langville The College of Charleston, SC
Michael Neumann University of Connecticut
´ Antonio Leal Duarte Universidade de Coimbra, Portugal
Esmond G. Ng Lawrence Berkeley National Laboratory, CA
xiv
Michael Ng Hong Kong Baptist University Hans Bruun Nielsen Technical University of Denmark Simo Puntanen University of Tampere, Finland Robert Reams Virginia Commonwealth University Joachim Rosenthal University of Zurich, Switzerland Uriel G. Rothblum Technion, Israel Heikki Ruskeep¨aa¨ University of Turku, Finland Carlos M. Saiago Universidade Nova de Lisboa, Portugal Lorenzo Sadun University of Texas Hans Schneider University of WisconsinMadison George A. F. Seber University of Auckland, NZ ˇ Peter Semrl University of Ljubljana, Slovenia Bryan L. Shader University of Wyoming Helene Shapiro Swarthmore College, PA Ivan P. Shestakov Universidad de S˜ao Paulo, Brazil Ivan Slapniˇcar University of Spilt, Croatia
Danny C. Sorensen Rice University, TX
T. Y. Tam Auburn University, AL
David S. Watkins Washington State University
Michael Stewart Georgia State University
Michael Tsatsomeros Washington State University
William Watkins California State UniversityNorthridge
Jeffrey L. Stuart Pacific Lutheran University, WA
Leonid N. Vaserstein Pennsylvania State University
Paul Weiner St. Mary’s University of Minnesota
George P. H. Styan McGill University, Canada
Amy Wangsness Fitchburg State College, MA
Robert Wilson Rutgers University, NJ
Tatjana Stykel Technical University Berlin, Germany
Ian M. Wanless Monash University, Australia
Henry Wolkowicz University of Waterloo, Canada
BitShun Tam Tamkang University, Taiwan
Jenny Wang University of CaliforniaDavis
Zhijun Wu Iowa State University
xv
Contents
Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . P1
Part I Linear Algebra Basic Linear Algebra
1
Vectors, Matrices and Systems of Linear Equations Jane Day . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
2
Linear Independence, Span, and Bases Mark Mills . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
3
Linear Transformations Francesco Barioli . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
4
Determinants and Eigenvalues Luz M. DeAlba . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
5
Inner Product Spaces, Orthogonal Projection, Least Squares and Singular Value Decomposition Lixing Han and Michael Neumann . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
Matrices with Special Properties
6
Canonical Forms Leslie Hogben . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
7
Unitary Similarity, Normal Matrices and Spectral Theory Helene Shapiro . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71
8
Hermitian and Positive Definite Matrices Wayne Barrett . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
9
Nonnegative and Stochastic Matrices Uriel G. Rothblum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91 xvii
10
Partitioned Matrices Robert Reams . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
Advanced Linear Algebra
11
Functions of Matrices Nicholas J. Higham . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
12
Quadratic, Bilinear and Sesquilinear Forms Raphael Loewy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121
13
Multilinear Algebra J. A. Dias da Silva and Armando Machado . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131
14
Matrix Equalities and Inequalities Michael Tsatsomeros . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
15
Matrix Perturbation Theory RenCang Li . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 151
16
Pseudospectra Mark Embree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 161
17
Singular Values and Singular Value Inequalities Roy Mathias . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171
18
Numerical Range ChiKwong Li . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181
19
Matrix Stability and Inertia Daniel Hershkowitz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191
Topics in Advanced Linear Algebra
20
Inverse Eigenvalue Problems Alberto Borobia . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201
21
Totally Positive and Totally Nonnegative Matrices Shaun M. Fallat . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211
22
Linear Preserver Problems ˇ Peter Semrl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221
23
Matrices over Integral Domains Shmuel Friedland . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 231
24
Similarity of Families of Matrices Shmuel Friedland . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241
25
MaxPlus Algebra Marianne Akian, Ravindra Bapat, St´ephane Gaubert . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 251
xviii
26
Matrices Leaving a Cone Invariant BitShun Tam and Hans Schneider . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 261
Part II Combinatorial Matrix Theory and Graphs Matrices and Graphs
27
Combinatorial Matrix Theory Richard A. Brualdi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 271
28
Matrices and Graphs Willem H. Haemers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 281
29
Digraphs and Matrices Jeffrey L. Stuart . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
30
Bipartite Graphs and Matrices Bryan L. Shader . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 301
Topics in Combinatorial Matrix Theory
31
Permanents Ian M. Wanless . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 311
32
DOptimal Designs Michael G. Neubauer and William Watkins . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 321
33
Sign Pattern Matrices Frank J. Hall and Zhongshan Li . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331
34
Multiplicity Lists for the Eigenvalues of Symmetric Matrices with a Given Graph Charles R. Johnson, Ant´onio Leal Duarte, and Carlos M. Saiago . . . . . . . . . . . . . . . . . . . . . . . 341
35
Matrix Completion Problems Leslie Hogben and Amy Wangsness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 351
36
Algebraic Connectivity Steve Kirkland . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 361
Part III Numerical Methods Numerical Methods for Linear Systems
37
Vector and Matrix Norms, Error Analysis, Efficiency and Stability Ralph Byers and Biswa Nath Datta . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 371
38
Matrix Factorizations, and Direct Solution of Linear Systems Christopher Beattie . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 381 xix
39
Least Squares Solution of Linear Systems Per Christian Hansen and Hans Bruun Nielsen . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 391
40
Sparse Matrix Methods Esmond G. Ng . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 401
41
Iterative Solution Methods for Linear Systems Anne Greenbaum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 411
Numerical Methods for Eigenvalues
42
Symmetric Matrix Eigenvalue Techniques Ivan Slapniˇcar . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 421
43
Unsymmetric Matrix Eigenvalue Techniques David S. Watkins . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 431
44
The Implicitly Restarted Arnoldi Method D. C. Sorensen . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 441
45
Computation of the Singular Value Deconposition Alan Kaylor Cline and Inderjit S. Dhillon . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 451
46
Computing Eigenvalues and Singular Values to High Relative Accuracy Zlatko Drmaˇc . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 461
Computational Linear Algebra
47
Fast Matrix Multiplication Dario A. Bini . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 471
48
Structured Matrix Computations Michael Ng . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 481
49
LargeScale Matrix Computations Roland W. Freund . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 491
Part IV Applications Applications to Optimization
50
Linear Programming Leonid N. Vaserstein . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 501
51
Semidefinite Programming Henry Wolkowicz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 511
xx
Applications to Probability and Statistics
52
Random Vectors and Linear Statistical Models Simo Puntanen and George P. H. Styan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521
53
Multivariate Statistical Analysis Simo Puntanen, George A. F. Seber, and George P. H. Styan . . . . . . . . . . . . . . . . . . . . . . . . . . . . 531
54
Markov Chains Beatrice Meini . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 541
Applications to Analysis
55
Differential Equations and Stability Volker Mehrmann and Tatjana Stykel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 551
56
Dynamical Systems and Linear Algebra Fritz Colonius and Wolfgang Kliemann . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 561
57
Control Theory Peter Benner . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 571
58
Fourier Analysis Kenneth Howell . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 581
Applications to Physical and Biological Sciences
59
Linear Algebra and Mathematical Physics Lorenzo Sadun . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 591
60
Linear Algebra in Biomolecular Modeling Zhijun Wu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 601
Applications to Computer Science
61
Coding Theory Joachim Rosenthal and Paul Weiner . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 611
62
Quantum Computation Zijian Diao . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 621
63
Information Retrieval and Web Search Amy Langville and Carl Meyer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 631
64
Signal Processing Michael Stewart . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 641
Applications to Geometry
65
Geometry Mark Hunacek . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 651 xxi
66
Some Applications of Matrices and Graphs in Euclidean Geometry Miroslav Fiedler . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 661
Applications to Algebra
67
Matrix Groups Peter J. Cameron . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 671
68
Group Representations Randall Holmes and T. Y. Tam . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 681
69
Nonassociative Algebras Murray R. Bremner, Lucia I. Muakami and Ivan P. Shestakov . . . . . . . . . . . . . . . . . . . . . . . . . 691
70
Lie Algebras Robert Wilson . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 701
Part V Computational Software Interactive Software for Linear Algebra
71
MATLAB Steven J. Leon . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 711
72
Linear Algebra in Maple David J. Jeffrey and Robert M. Corless . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 721
73
Mathematica Heikki Ruskeep¨aa¨ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 731
Packages of Subroutines for Linear Algebra
74
BLAS Jack Dongarra, Victor Eijkhout, and Julien Langou . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 741
75
LAPACK Zhaojun Bai, James Demmel, Jack Dongarra, Julien Langou, and Jenny Wang . . . . . . . . . 751
76
Use of ARPACK and EIGS D. C. Sorensen . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 761
77
Summary of Software for Linear Algebra Freely Available on the Web Jack Dongarra, Victor Eijkhout, and Julien Langou . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 771
Glossary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . G1 Notation Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . N1 Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . I1 xxii
Preface
It is no exaggeration to say that linear algebra is a subject of central importance in both mathematics and a variety of other disciplines. It is used by virtually all mathematicians and by statisticians, physicists, biologists, computer scientists, engineers, and social scientists. Just as the basic idea of first semester differential calculus (approximating the graph of a function by its tangent line) provides information about the function, the process of linearization often allows difficult problems to be approximated by more manageable linear ones. This can provide insight into, and, thanks to evermorepowerful computers, approximate solutions of the original problem. For this reason, people working in all the disciplines referred to above should find the Handbook of Linear Algebra an invaluable resource. The Handbook is the first resource that presents complete coverage of linear algebra, combinatorial linear algebra, and numerical linear algebra, combined with extensive applications to a variety of fields and information on software packages for linear algebra in an easy to use handbook format.
Content The Handbook covers the major topics of linear algebra at both the graduate and undergraduate level as well as its offshoots (numerical linear algebra and combinatorial linear algebra), its applications, and software packages for linear algebra computations. The Handbook takes the reader from the very elementary aspects of the subject to the frontiers of current research, and its format (consisting of a number of independent chapters each organized in the same standard way) should make this book accessible to readers with divergent backgrounds.
Format There are five main parts in this book. The first part (Chapters 1 through Chapter 26) covers linear algebra; the second (Chapter 27 through Chapter 36) and third (Chapter 37 through Chapter 49) cover, respectively, combinatorial and numerical linear algebra, two important branches of the subject. Applications of linear algebra to other disciplines, both inside and outside of mathematics, comprise the fourth part of the book (Chapter 50 through Chapter 70). Part five (Chapter 71 through Chapter 77) addresses software packages useful for linear algebra computations. Each chapter is written by a different author or team of authors, who are experts in the area covered. Each chapter is divided into sections, which are organized into the following uniform format: r Definitions r Facts r Examples
xxiii
Most relevant definitions appear within the Definitions segment of each chapter, but some terms that are used throughout linear algebra are not redefined in each chapter. The Glossary, covering the terminology of linear algebra, combinatorial linear algebra, and numerical linear algebra, is available at the end of the book to provide definitions of terms that appear in different chapters. In addition to the definition, the Glossary also provides the number of the chapter (and section, thereof) where the term is defined. The Notation Index serves the same purpose for symbols. The Facts (which elsewhere might be called theorems, lemmas, etc.) are presented in list format, which allows the reader to locate desired information quickly. In lieu of proofs, references are provided for all facts. The references will also, of course, supply a source of additional information about the subject of the chapter. In this spirit, we have encouraged the authors to use texts or survey articles on the subject as references, where available. The Examples illustrate the definitions and facts. Each section is short enough that it is easy to go back and forth between the Definitions/Facts and the Examples to see the illustration of a fact or definition. Some sections also contain brief applications following the Examples (major applications are treated in their own chapters).
Feedback To see updates and provide feedback and errata reports, please consult the web page for this book: http:// www.public.iastate.edu/∼lhogben/HLA.html or contact the editor via email,
[email protected], with HLA in the subject heading.
xxiv
Preliminaries This chapter contains a variety of definitions of terms that are used throughout the rest of the book, but are not part of linear algebra and/or do not fit naturally into another chapter. Since these definitions have little connection with each other, a different organization is followed; the definitions are (loosely) alphabetized and each definition is followed by an example.
Algebra An (associative) algebra is a vector space A over a field F together with a multiplication (x, y) → xy from A × A to A satisfying two distributive properties and associativity, i.e., for all a, b ∈ F and all x, y, z ∈ A: (ax + by)z = a(xz) + b(yz),
x(ay + bz) = a(xy) + b(xz)
(xy)z = x(yz).
Except in Chapter 69 and Chapter 70 the term algebra means associative algebra. In these two chapters, associativity is not assumed. Examples: The vector space of n × n matrices over a field F with matrix multiplication is an (associative) algebra.
Boundary The boundary ∂S of a subset S of the real numbers or the complex numbers is the intersection of the closure of S and the closure of the complement of S. Examples: The boundary of S = {x ∈ C : z ≤ 1} is ∂S = {x ∈ C : z = 1}.
Complement The complement of the set X in universe S, denoted S \ X, is all elements of S that are not in X. When the universe is clear (frequently the universe is {1, . . . , n}) then this can be denoted X c . Examples: For S = {1, 2, 3, 4, 5} and X = {1, 3}, S \ X = {2, 4, 5}.
Complex Numbers Let a, b ∈ R. The symbol i denotes
√
−1.
The complex conjugate of a complex number c = a + bi is c = a − bi . The imaginary part of a + bi is im(a + bi√ ) = b and the real part is re(a + bi ) = a. The absolute value of c = a + bi is c  = a 2 + b 2 . xxv
The argument of the nonzero complex number rei θ is θ (with r, θ ∈ R and 0 < r and 0 ≤ θ < 2π). The open right half plane C+ is {z ∈ C : re(z) > 0}. The closed right half plane C+ 0 is {z ∈ C : re(z) ≥ 0}. The open left half plane C− is {z ∈ C : re(z) < 0}. The closed left half plane C− is {z ∈ C : re(z) ≤ 0}. Facts: 1. 2. 3. 4.
c  = c c rei θ  = r rei θ = r cos θ + r sin θi rei θ = re−i θ
Examples: 2 + 3i = 2 − 3i , 1.4 = 1.4, 1 + i =
√
2e i π/4 .
Conjugate Partition Let υ = (u1 , u2 , . . . , un ) be a sequence of integers such that u1 ≥ u2 ≥ · · · ≥ un ≥ 0. The conjugate partition of υ is υ ∗ = (u∗1 , . . . , u∗t ), where ui∗ is the number of j s such that u j ≥ i . t is sometimes taken to be u1 , but is sometimes greater (obtained by extending with 0s). Facts: If t is chosen to be the minimum, and un > 0, υ ∗∗ = υ. Examples: (4, 3, 2, 2, 1)∗ = (5, 4, 2, 1).
Convexity Let V be a real or complex vector space. Let {v1 , v2 , . . . , vk } ∈ V . A vector of the form a1 v1 +a2 v2 +· · ·+ak vk with all the coefficients ai nonnegative and ai = 1 is a convex combination of {v1 , v2 , . . . , vk }. A set S ⊆ V is convex if any convex combination of vectors in S is in S. The convex hull of S is the set of all convex combinations of S and is denoted by Con(S). An extreme point of a closed convex set S is a point v ∈ S that is not a nontrivial convex combination of other points in S, i.e., ax + (1 − a)y = v and 0 ≤ a ≤ 1 implies x = y = v. A convex polytope is the convex hull of a finite set of vectors in Rn . Let S ⊆ V be convex. A function f : S → R is convex if for all a ∈ R, 0 < a < 1, x, y ∈ S, f (ax + (1 − a)y) ≤ a f (x) + (1 − a) f (y). Facts: 1. A set S ⊆ V is convex if and only if Con(S) = S. 2. The extreme points of Con(S) are contained in S. 3. [HJ85] KreinMilman Theorem: A compact convex set is the convex hull of its extreme points. Examples: 1. [1.9, 0.8]T is a convex combination of [1, −1]T and [2, 1]T , since [1.9, 0.8]T = 0.1[1, −1]T + 0.9[2, 1]T . 2. The set K of all v ∈ R3 such that v i ≥ 0, i = 1, 2, 3 is a convex set. Its only extreme point is the zero vector. xxvi
Elementary Symmetric Function The kth elementary symmetric function of αi , i = 1, . . . , n is Sk (α1 , . . . , αn ) =
αi 1 αi 2 . . . αi k .
1
Examples: S2 (α1 , α2 , α3 ) = α1 α2 + α1 α3 + α2 α3 , S1 (α1 , . . . , αn ) = α1 + α2 + · · · + αn , Sn (α1 , . . . , αn ) = α1 α2 . . . αn .
Equivalence Relation A binary relation ≡ in a nonempty set S is an equivalence relation if it satisfies the following conditions: 1. (Reflexive) For all a ∈ S, a ≡ a. 2. (Symmetric) For all a, b ∈ S, a ≡ b implies b ≡ a. 3. (Transitive) For all a, b, c ∈ S, a ≡ b and a ≡ b imply a ≡ c . Examples: Congruence mod n is an equivalence relation on the integers.
Field A field is a set F with at least two elements together with a function F × F → F called addition, denoted (a, b) → a + b, and a function F × F → F called multiplication, denoted (a, b) → ab, which satisfy the following axioms: (Commutativity) For each a, b ∈ F , a + b = b + a and ab = ba. (Associativity) For each a, b, c ∈ F , (a + b) + c = a + (b + c ) and (ab)c = a(bc ). (Identities) There exist two elements 0 and 1 in F such that 0 + a = a and 1a = a for each a ∈ F . (Inverses) For each a ∈ F , there exists an element −a ∈ F such that (−a) + a = 0. For each nonzero a ∈ F , there exists an element a −1 ∈ F such that a −1 a = 1. 5. (Distributivity) For each a, b, c ∈ F , a(b + c ) = ab + ac .
1. 2. 3. 4.
Examples: The real numbers, R, the complex numbers, C, and the rational numbers, Q, are all fields. The set of integers, Z, is not a field.
Greatest Integer Function The greatest integer or floor function x (defined on the real numbers) is the greatest integer less than or equal to x. Examples: 1.5 = 1, 1 = 1, −1.5 = −2. xxvii
Group (See also Chapter 67 and Chapter 68.) A group is a nonempty set G with a function G × G → G denoted (a, b) → ab, which satisfies the following axioms: 1. (Associativity) For each a, b, c ∈ G , (ab)c = a(bc ). 2. (Identity) There exists an element e ∈ G such that ea = a = ae for each a ∈ G . 3. (Inverses) For each a ∈ G , there exists an element a −1 ∈ G such that a −1 a = e = aa −1 . A group is abelian if ab = ba for all a, b ∈ G . Examples: 1. Any vector space is an abelian group under +. 2. The set of invertible n × n real matrices is a group under matrix multiplication. 3. The set of all permutations of a set is a group under composition.
Interlaces Let a1 ≥ a2 ≥ · · · ≥ an and b1 ≥ b2 ≥ · · · ≥ bn−1 , two sequences of real numbers arranged in decreasing order. Then the sequence {bi } interlaces the sequence {ai } if an ≤ bn−1 ≤ an−1 · · · ≤ b1 ≤ a1 . Further, if all of the above inequalities can be taken to be strict, the sequence {bi } strictly interlaces the sequence {ai }. Analogous definitions are given when the numbers are in increasing order. Examples: 7 ≥ 2.2 ≥ −1 strictly interlaces 11 ≥ π ≥ 0 ≥ −2.6.
Majorization Let α = (a1 , a2 , . . . , an ), β = (b1 , b2 , . . . , bn ) be sequences of real numbers. ↓ ↓ ↓ ↓ α ↓ = (a1 , a2 , . . . , an↓ ) is the permutation of α with entries in nonincreasing order, i.e., a1 ≥ a2 ≥ . . . ≥ an↓ . ↑ ↑ ↑ ↑ α ↑ = (a1 , a2 , . . . , an↑ ) is the permutation of α with entries in nondecreasing order, i.e., a1 ≤ a2 ≤ . . . ≤ an↑ . α weakly majorizes β, written α w β or β w α, if: k i =1
↓
ai ≥
k
↓
bi
i =1
α majorizes β, written α β or β α, if α w β and
for all k = 1, . . . n. n
i =1
ai =
n
i =1
bi .
Examples: 1. If α = (2, 2, −1.3, 8, 7.7), then α ↓ = (8, 7.7, 2, 2, −1.3) and α ↑ = (−1.3, 2, 2, 7.7, 8). 2. (5,3,1.5,1.5,1) (4,3,2,2,1) and (6,5,0) w (4,3,2).
Metric A metric on a set S is a realvalued function f : S × S → R satisfying the following conditions: 1. 2. 3. 4. 5.
For all x, y ∈ S, f (x, y) ≥ 0. For all x ∈ S, f (x, x) = 0. For all x, y ∈ S, f (x, y) = 0 implies x = y. For all x, y ∈ S, f (x, y) = f (y, x). For all x, y, z ∈ S, f (x, y) + f (y, z) ≥ f (x, z).
A metric is intended as a measure of distance between elements of the set. xxviii
Examples: If · is a norm on a vector space, then f (x, y) = x − y is a metric.
Multiset A multiset is an unordered list of elements that allows repetition. Examples: Any set is a multiset, but {1, 1, 3, −2, −2, −2} is a multiset that is not a set.
O and o Let, f, g be real valued functions of N or R, i.e., f, g : N → R or f, g : R → R. f is O(g ) (bigoh of g ) if there exist constants C, k such that  f (x) ≤ C g (x) for all x ≥ k. (n) f is o(g ) (littleoh of g ) if limx→∞ gf (n) = 0. Examples: x 2 + x is O(x 2 ) and ln x is o(x).
Pathconnected A subset S of the complex numbers is pathconnected if for any x, y ∈ S there exists a continuous function p : [0, 1] → S with p(0) = x and p(1) = y. Examples: S = {z ∈ C : 1 ≤ z ≤ 2} and the line {a + bi : a = 2b + 3} are pathconnected.
Permutations A permutation is a onetoone onto function from a set to itself. The set of permutations of {1, . . . , n} is denoted Sn . The identity permutation is denoted εn . In this book, permutations are generally assumed to be elements of Sn for some n. A cycle or kcycle is a permutation τ such that there is a subset {a1 , . . . , ak } of {1, . . . , n} satisfying τ (ai ) = ai +1 and τ (ak ) = a1 ; this is denoted τ = (a1 , a2 , . . . , ak ). The length of this cycle is k. A transposition is a 2cycle. A permutation is even (respectively, odd) if it can be written as the product of an even (odd) number of transpositions. The sign of a permutation τ , denoted sgn τ , is +1 if τ is even and −1 if τ is odd. Note: Permutations are functions and act from the left (see Examples). Facts: 1. Every permutation can be expressed as a product of disjoint cycles. This expression is unique up to the order of the cycles in the decomposition and cyclic permutation within a cycle. 2. Every permutation can be written as a product of transpositions. If some such expression includes an even number of transpositions, then every such expression includes an even number of transpositions. 3. Sn with the operation of composition is a group. xxix
Examples: 1. If τ = (1523) ∈ S6 , then τ (1) = 5, τ (2) = 3, τ (3) = 1, τ (4) = 4, τ (5) = 2, τ (6) = 6. 2. (123)(12)=(13). 3. sgn(1234) = −1, because (1234) = (14)(13)(12).
Ring (See also Section 23.1) A ring is a set R together with a function R × R → R called addition, denoted (a, b) → a + b, and a function R × R → R called multiplication, denoted (a, b) → ab, which satisfy the following axioms: 1. 2. 3. 4. 5.
(Commutativity of +) For each a, b ∈ R, a + b = b + a. (Associativity) For each a, b, c ∈ R, (a + b) + c = a + (b + c ) and (ab)c = a(bc ). (+ identity) There exists an element 0 in R such that 0 + a = a. (+ inverse) For each a ∈ R, there exists an element −a ∈ R such that (−a) + a = 0. (Distributivity) For each a, b, c ∈ R, a(b + c ) = ab + ac and (a + b)c = ac + bc .
A zero divisor in a ring R is a nonzero element a ∈ R such that there exists a nonzero b ∈ R with ab = 0 or ba = 0. Examples: r The set of integers, Z, is a ring. r Any field is a ring.
r Let F be a field. Then F n×n , with matrix addition and matrix multiplication as the operations, is
a ring. E 11 =
1 0
0 0 and E 22 = 0 0
0 are zero divisors since E 11 E 22 = 02 . 1
Sign (For sign of a permutation, see permutation.) The sign of a complex number is defined by:
sign(z) =
z/z, if z = 0; 1, if z = 0.
If z is a real number, this sign function yields 1 or −1. This sign function is used in numerical linear algebra. The sign of a real number (as used in sign patterns) is defined by: sgn(a) =
+,
if a > 0; 0, if a = 0; −, if a < 0.
This sign function is used in combinatorial linear algebra, and the product of a sign and a real number is interpreted in the obvious way as a real number. Warning: The two sign functions disagree on the sign of 0. Examples: sgn(−1.3) = −, sign(−1.3) = −1, sgn(0) = 0, sign(0) = 1, (1 + i ) sign(1 + i )= √ . 2
References [HJ85] [HJ85] R. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985. xxx
I Linear Algebra Basic Linear Algebra 1 2 3 4 5
Vectors, Matrices, and Systems of Linear Equations Jane Day . . . . . . . . . . . . . . . . . . Linear Independence, Span, and Bases Mark Mills . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Linear Transformations Francesco Barioli . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Determinants and Eigenvalues Luz M. DeAlba . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Inner Product Spaces, Orthogonal Projection, Least Squares, and Singular Value Decomposition Lixing Han and Michael Neumann . . . . . . . . .
11 21 31 41 51
Matrices with Special Properties 6 7 8 9 10
Canonical Forms Leslie Hogben . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Unitary Similarity, Normal Matrices, and Spectral Theory Helene Shapiro . . . . . Hermitian and Positive Definite Matrices Wayne Barrett . . . . . . . . . . . . . . . . . . . . . . Nonnegative and Stochastic Matrices Uriel G. Rothblum . . . . . . . . . . . . . . . . . . . . . . . Partitioned Matrices Robert Reams . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
61 71 81 91 101
Advanced Linear Algebra 11 12 13 14 15 16 17 18 19
Functions of Matrices Nicholas J. Higham . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Quadratic, Bilinear, and Sesquilinear Forms Raphael Loewy . . . . . . . . . . . . . . . . . . . Multilinear Algebra Jos´e A. Dias da Silva and Armando Machado . . . . . . . . . . . . . . . Matrix Equalities and Inequalities Michael Tsatsomeros . . . . . . . . . . . . . . . . . . . . . . . . Matrix Perturbation Theory RenCang Li . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Pseudospectra Mark Embree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Singular Values and Singular Value Inequalities Roy Mathias . . . . . . . . . . . . . . . . . . Numerical Range ChiKwong Li . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Matrix Stability and Inertia Daniel Hershkowitz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
111 121 131 141 151 161 171 181 191
Topics in Advanced Linear Algebra 20 21 22 23 24 25 26
Inverse Eigenvalue Problems Alberto Borobia . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Totally Positive and Totally Nonnegative Matrices Shaun M. Fallat . . . . . . . . . . . . ˇ Linear Preserver Problems Peter Semrl ........................................ Matrices over Integral Domains Shmuel Friedland . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Similarity of Families of Matrices Shmuel Friedland . . . . . . . . . . . . . . . . . . . . . . . . . . . MaxPlus Algebra Marianne Akian, Ravindra Bapat, St´ephane Gaubert . . . . . . . . . Matrices Leaving a Cone Invariant BitShun Tam and Hans Schneider . . . . . . . . . .
201 211 221 231 241 251 261
Basic Linear Algebra 1 Vectors, Matrices, and Systems of Linear Equations
Jane Day . . . . . . . . . . . . . . . . . . 11
Vector Spaces • Matrices • Gaussian and Gauss–Jordan Elimination • Systems of Linear Equations • Matrix Inverses and Elementary Matrices • LU Factorization
2 Linear Independence, Span, and Bases
Mark Mills . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
Span and Linear Independence • Basis and Dimension of a Vector Space • Direct Sum Decompositions • Matrix Range, Null Space, Rank, and the Dimension Theorem • Nonsingularity Characterizations • Coordinates and Change of Basis • Idempotence and Nilpotence
3 Linear Transformations
Francesco Barioli . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
Basic Concepts • The Spaces L (V, W) and L (V, V ) • Matrix of a Linear Transformation • Change of Basis and Similarity • Kernel and Range • Invariant Subspaces and Projections • Isomorphism and Nonsingularity Characterization • Linear Functionals and Annihilator
4 Determinants and Eigenvalues Determinants
•
Luz M. DeAlba . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
Determinants: Advanced Results
•
Eigenvalues and Eigenvectors
5 Inner Product Spaces, Orthogonal Projection, Least Squares, and Singular Value Decomposition Lixing Han and Michael Neumann . . . . . . . . . 51 Inner Product Spaces • Orthogonality • Adjoints of Linear Operators on Inner Product Spaces • Orthogonal Projection • Gram–Schmidt Orthogonalization and QR Factorization • Singular Value Decomposition • PseudoInverse • Least Squares Problems
1 Vectors, Matrices, and Systems of Linear Equations
Jane Day San Jose State University
1.1 Vector Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.2 Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 1.3 Gaussian and GaussJordan Elimination . . . . . . . . . . . . . . 17 1.4 Systems of Linear Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 1.5 Matrix Inverses and Elementary Matrices . . . . . . . . . . . . . . 111 1.6 LU Factorization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116
Throughout this chapter, F will denote a field. The references [Lay03], [Leo02], and [SIF00] are good sources for more detail about much of the material in this chapter. They discuss primarily the field of real numbers, but the proofs are usually valid for any field.
1.1
Vector Spaces
Vectors are used in many applications. They often represent quantities that have both direction and magnitude, such as velocity or position, and can appear as functions, as ntuples of scalars, or in other disguises. Whenever objects can be added and multiplied by scalars, they may be elements of some vector space. In this section, we formulate a general definition of vector space and establish its basic properties. An element of a field, such as the real numbers or the complex numbers, is called a scalar to distinguish it from a vector. Definitions: A vector space over F is a set V together with a function V × V → V called addition, denoted (x,y) → x + y, and a function F × V → V called scalar multiplication and denoted (c ,x) → c x, which satisfy the following axioms: 1. 2. 3. 4. 5. 6.
(Commutativity) For each x, y ∈ V, x + y = y + x. (Associativity) For each x, y, z ∈ V, (x + y) + z = x + (y + z). (Additive identity) There exists a zero vector in V, denoted 0, such that 0 + x = x for each x ∈ V. (Additive inverse) For each x ∈ V, there exists −x ∈ V such that (−x) + x = 0. (Distributivity) For each a ∈ F and x, y ∈ V, a(x + y) = ax + ay. (Distributivity) For each a, b ∈ F and x ∈ V, (a + b) x = ax + bx. 11
12
Handbook of Linear Algebra
7. (Associativity) For each a, b ∈ F and x ∈ V, (ab) x = a(bx). 8. For each x ∈ V, 1x = x. The properties that for all x, y ∈ V, and a ∈ F , x + y ∈ V and ax ∈ V, are called closure under addition and closure under scalar multiplication, respectively. The elements of a vector space V are called vectors. A vector space is called real if F = R, complex if F = C. (written These are If n is a positive integer, F n denotes the set of all ordered ntuples ⎡ ⎤ as⎡columns). ⎤ x1 y1 ⎢ ⎥ ⎢ ⎥ sometimes written instead as rows [x1 · · · xn ] or (x1 , . . . , xn ). For x = ⎣ ... ⎦, y = ⎣ ... ⎦ ∈ F n and c ∈ F , xn yn
⎡
⎤
⎡
⎤
x 1 + y1 c x1 ⎢ .. ⎥ ⎢ .. ⎥ define addition and scalar multiplication coordinatewise: x + y = ⎣ . ⎦ and c x = ⎣ . ⎦. Let 0 x n + yn c xn denote the ntuple of zeros. For x ∈ F n, x j is called the jth coordinate of x. A subspace of vector space V over field F is a subset of V, which is itself a vector space over F when the addition and scalar multiplication of V are used. If S1 and S2 are subsets of vector space V, define S1 + S2 = {x + y : x ∈ S1 and y ∈ S2 }. Facts: Let V be a vector space over F . 1. F n is a vector space over F . 2. [FIS03, pp. 11–12] (Basic properties of a vector space): r The vector 0 is the only additive identity in V. r For each x ∈ V, −x is the only additive inverse for x in V. r For each x ∈ V, −x = (−1)x. r If a ∈ F and x ∈ V, then ax = 0 if and only if a = 0 or x = 0. r (Cancellation) If x, y, z ∈ V and x + y = x + z, then y = z. 3. [FIS03, pp. 16–17] Let W be a subset of V. The following are equivalent: r W is a subspace of V. r W is nonempty and closed under addition and scalar multiplication. r 0 ∈ W and for any x, y ∈ W and a, b ∈ F , ax + by ∈ W. 4. For any vector space V, {0} and V itself are subspaces of V. 5. [FIS03, p. 19] The intersection of any nonempty collection of subspaces of V is a subspace of V. 6. [FIS03, p. 22] Let W1 and W2 be subspaces of V . Then W1 + W2 is a subspace of V containing W1 and W2 . It is the smallest subspace that contains them in the sense that any subspace that contains both W1 and W2 must contain W1 + W2 . Examples: 1. The set Rn of all ordered ntuples of real numbers is a vector space over R, and the⎡set ⎤ Cn of 3 all ordered ntuples of complex numbers is a vector space over C. For instance, x = ⎣ 0⎦ and −1
⎡
⎤
⎡
⎤
⎡
⎤
⎡
⎤
2i 3 + 2i −2i −2 y = ⎣ 4 ⎦ are elements of C3 ; x + y = ⎣ 4 ⎦, −y = ⎣ −4 ⎦, and i y = ⎣ 4i ⎦. 2 − 3i 1 − 3i −2 + 3i 3 + 2i 2. Notice Rn is a subset of Cn but not a subspace of Cn, since Rn is not closed under multiplication by nonreal numbers.
13
Vectors, Matrices, and Systems of Linear Equations
3. The vector spaces R, R2 , and R3 are the usual Euclidean spaces of analytic geometry. There are three types of subspaces of R2 : {0}, a line through the origin, and R2 itself. There are four types of subspaces of R3 : {0}, a line through the origin, a plane through the origin, and R3 itself. For instance, let v = (5, −1, −1) and w = (0, 3, −2). The lines W1 = {s v : s ∈ R} and W2 = {s w : s ∈ R} are subspaces of R3 . The subspace W1 + W2 = {s v + t w : s , t ∈ R} is a plane. The set {s v + w: s ∈ R} is a line parallel to W1 , but is not a subspace. (For more information on geometry, see Chapter 65.) 4. Let F [x] be the set of all polynomials in the single variable x, with coefficients from F . To add polynomials, add coefficients of like powers; to multiply a polynomial by an element of F , multiply each coefficient by that scalar. With these operations, F [x] is a vector space over F . The zero polynomial z, with all coefficients 0, is the additive identity of F [x]. For f ∈ F [x], the function − f defined by − f (x) = (−1) f (x) is the additive inverse of f. 5. In F [x], the constant polynomials have degree 0. For n > 0, the polynomials with highest power term x n are said to have degree n. For a nonnegative integer n, let F [x; n] be the subset of F [x] consisting of all polynomials of degree n or less. Then F [x; n] is a subspace of F [x]. 6. When n > 0, the set of all polynomials of degree exactly n is not a subspace of F [x] because it is not closed under addition or scalar multiplication. The set of all polynomials in R[x] with rational coefficients is not a subspace of R[x] because it is not closed under scalar multiplication. 7. Let V be the set of all infinite sequences (a1 , a2 , a3 , . . .), where each a j ∈ F . Define addition and scalar multiplication coordinatewise. Then V is a vector space over F . 8. Let X be a nonempty set and let F(X, F ) be the set of all functions f : X → F . Let f, g ∈ F(X, F ) and define f + g and cf pointwise, as ( f + g )(x) = f (x) + g (x) and (cf )(x) = cf (x) for all x ∈ X. With these operations, F(X, F ) is a vector space over F . The zero function is the additive identity and (−1) f = − f, the additive inverse of f. 9. Let X be a nonempty subset of Rn . The set C (X) of all continuous functions f : X → R is a subspace of F(X, R). The set D(X) of all differentiable functions f : X → R is a subspace of C (X) and also of F(X, R).
1.2
Matrices
Matrices are rectangular arrays of scalars that are used in a great variety of ways, such as to solve linear systems, model linear behavior, and approximate nonlinear behavior. They are standard tools in almost every discipline, from sociology to physics and engineering. Definitions:
⎡
a11 ⎢ .. An m × p matrix over F is an m × p rectangular array A = ⎣ . am1
···
⎤
a 1p .. ⎥, with entries from F. The ··· . ⎦ · · · amp
notation A = [aij ] that displays a typical entry is also used. The element aij of the matrix A is called the (i, j ) entry of A and can also be denoted (A)ij . The shape (or size) of A is m × p, and A is square if m = p; in this case, m is also called the size of A. Two matrices A = [aij ] and B = [bij ] are said to be equal if they have the same shape and aij = bij for all i, j. Let A = [aij ] and B = [bij ] be m × p matrices, and let c be a scalar. Define addition and scalar multiplication on the set of all m × p matrices over F entrywise, as A + B = [aij + bij ] and cA = [c aij ]. The set of all m × p matrices over F with these operations is denoted F m× p .
⎡
⎤
a 1j ⎢ .. ⎥ If A is m × p , row i is [ai1 , . . . , aip ] and column j is ⎣ . ⎦. These are called a row vector and amj a column vector respectively, and they belong to F n×1 and F 1×n , respectively. The elements of F n are identified with the elements of F n×1 (or sometimes with the elements of F 1×n ). Let 0mp denote the m × p matrix of zeros, often shortened to 0 when the size is clear. Define −A = (−1)A.
14
Handbook of Linear Algebra
Let A = [a1
...
⎡ ⎤ b1 ⎢ .. ⎥ m× p ap] ∈ F , where a j is the j th column of A, and let b = ⎣ . ⎦ ∈ F p×1 . The bp
matrix–vector product of A and b is Ab = b1 a1 + · · · + b p a p . Notice Ab is m × 1. If A ∈ F m× p and C = [c1 . . . cn ] ∈ F p×n , define the matrix product of A and C as AC = [Ac1 . . . Acn ]. Notice AC is m × n. Square matrices A and B commute if AB = BA. When i = j, aii is a diagonal entry of A and the set of all its diagonal entries is the main diagonal of A. When i = j, aij is an offdiagonal entry. n The trace of A is the sum of all the diagonal entries of A, tr A = i =1 aii . A matrix A = [aij ] is diagonal if aij = 0 whenever i = j, lower triangular if aij = 0 whenever i < j, and upper triangular if aij = 0 whenever i > j. A unit triangular matrix is a lower or upper triangular matrix in which each diagonal entry is 1. The identity matrix In , often shortened to I when the size is clear, is the n × n matrix with main diagonal entries 1 and other entries 0. A scalar matrix is a scalar multiple of the identity matrix. A permutation matrix is one whose rows are some rearrangement of the rows of an identity matrix. Let A ∈ F m× p . The transpose of A, denoted AT , is the p × m matrix whose (i, j ) entry is the ( j, i ) entry of A. The square matrix A is symmetric if AT = A and skewsymmetric if AT = −A. When F = C, that is, when A has complex entries, the Hermitian adjoint of A is its conjugate transpose, A∗ = A¯ T ; that is, the (i, j ) entry of A∗ is aji . Some authors, such as [Leo02], write A H instead of A∗ . The square matrix A is Hermitian if A∗ = A and skewHermitian if A∗ = −A. Let α be a nonempty set of row indices and β a nonempty set of column indices. A submatrix of A is a matrix A[α, β] obtained by choosing the entries of A, which lie in rows α and columns β. A principal submatrix of A is a submatrix of the form A[α, α]. A leading principal submatrix of A is one of the form A[{1, . . . , k}, {1, . . . , k}]. Facts: 1. [SIF00, p. 5] F m× p is a vector space over F . That is, if 0, A, B, C ∈ F m× p , and c ,d ∈ F , then: r A+ B = B + A r (A + B) + C = A + (B + C ) r A+ 0 = 0 + A = A r A + (−A) = (−A) + A = 0 r c (A + B) = cA + cB r (c + d)A = cA + dA r (cd) A = c (dA) r 1A = A p 2. If A ∈ F m× p and C ∈ F p×n , the (i, j ) entry of AC is (AC)ij = k=1 a ik a kj . This is the matrix product of row i of A and column j of C. 3. [SIF00, p. 88] Let c ∈ F , let A and B be matrices over F , let I denote an identity matrix, and assume the shapes allow the following sums and products to be calculated. Then: r AI = IA = A r A0 = 0 and 0A = 0 r A(BC) = (AB)C r A(B + C ) = AB + AC r (A + B)C = AC + BC r c (AB) = A(cB) = (cA)B for any scalar c
Vectors, Matrices, and Systems of Linear Equations
15
4. [SIF00, p. 5 and p. 20] Let c ∈ F , let A and B be matrices over F , and assume the shapes allow the following sums and products to be calculated. Then: r (AT )T = A r (A + B)T = AT + B T r (cA)T = cAT r (AB)T = B T AT 5. [Leo02, pp. 321–323] Let c ∈ C, let A and B be matrices over C, and assume the shapes allow the following sums and products to be calculated. Then: r (A∗ )∗ = A r (A + B)∗ = A∗ + B ∗ r (c A)∗ = c¯ A∗ r (AB)∗ = B ∗ A∗ 6. If A and B are n × n and upper (lower) triangular, then AB is upper (lower) triangular.
⎡ ⎤ 7 1 2 3 1 2 3 −4 1. Let A = and b = ⎣ 8⎦. By definition, Ab = 7 +8 −9 = . Hand 4 5 6 4 5 6 14 −9 1·7+2·8−3·9 −4 calculation of Ab can be done more quickly using Fact 2: Ab = = . 4·7+5·8−6·9 14 ⎡ ⎤ 1 −1 8 1 −3 4 −3 8 0 ,B = , and C = ⎣1 2. Let A = 3 0⎦. Then A + B = 2 0 8 1 2 −5 1 2 −2 −2 5 4 2 −6 8 and 2A = . The matrices A + C, BA, and AB are not defined, but 3 2 3 4 0 16 ⎡ ⎡ ⎤ ⎡ ⎤ ⎡ ⎤⎤ 1 −1 8 2 −2 0 ⎣ ⎣ ⎦ ⎣ ⎦ ⎣ ⎦ ⎦ = . AC = A 1 A 3 A 0 10 14 0 1 2 −2
Examples:
3. Even when the shapes of A and B allow both AB and BA to be calculated, AB and BA are not usually
1 0 a b a b a 2b and B = ; then AB = and BA = , equal. For instance, let A = c 2d 0 2 c d 2c 2d which will be equal only if b = c = 0. 4. The product of matrices can be a zero matrix even if neither has any zero entries. For example, if 1 −1 1 1 0 0 A= and B = , then AB = . Notice that BA is also defined but has no 2 −2 1 1 0 0 3 −3 . zero entries: BA = 3 −3 ⎡ ⎤ ⎡ ⎤ 1 0 0 1 0 0 1 0 0 1 0 0 ⎣ ⎦ ⎣ ⎦ are diagonal, 2 0 are 5. The matrices 0 0 0 and 0 and 0 −3 0 2 −3 0 0 0 −9 1 5 −9 ⎡ ⎤ ⎡ ⎤ ⎡ ⎤ 1 2 3 1 −4 7 1 0 0 ⎢0 4 5⎥ ⎥ ⎣ ⎦ lower triangular, and ⎣0 1 2⎦ and ⎢ ⎣0 0 0⎦ are upper triangular. The matrix 2 1 0 0 0 −9 1 5 1 0 0 0 is unit lower triangular, and its transpose is unit upper triangular.
16
Handbook of Linear Algebra
⎡ ⎤ ⎡ ⎤ 0 0 1 0 0 1 0 1 ⎣ 6. Examples of permutation matrices include every identity matrix, , 0 1 0⎦, and ⎣1 0 0⎦. 1 0 1 0 0 0 1 0 ⎡
1+i 7. Let A = 1 + 2i
⎡ ⎤ ⎡ 1 2 3 i 8. The matrices ⎣2 4 5⎦ and ⎣ 2 3 + 2i 3 5 6 ⎡
0 9. The matrices ⎣−2 −3
⎤
2 0 −5
⎡
1 10. The matrix ⎣ 2 − i 1 + 3i
⎤
1+i 4 . Then AT = ⎣ −3i 0 4
−3i 5i
⎡
2+i 0 1
⎤
1 − 2i −5i ⎦. 0
⎤
3 + 2i 5i ⎦ are symmetric. 6
2 4−i 5i
3 0 5⎦ and ⎣ −2 −3 − 2i 0
⎡
1 + 2i 1−i 5i ⎦ and A∗ = ⎣ 3i 0 4
2 0 5
⎤
3 + 2i −5 ⎦ are skewsymmetric. 0
⎤
1 − 3i 1 ⎦ is Hermitian, and any real symmetric matrix, such as 6
⎡ ⎤ 4 2 3 ⎣2 0 5⎦, is also Hermitian. 3 5 −1 ⎡
⎤
2 −3 + 2i 4i 5 ⎦ is skewHermitian, and any real skewsymmetric matrix, −5 0
i 11. The matrix ⎣ −2 3 + 2i
⎡
0 such as ⎣−2 3
⎡
⎤
2 −3 0 5⎦ , is also skewHermitian. −5 0
⎡ ⎤ 3 ⎢ 7⎥ ⎥ 2 3 4], column 3 is ⎢ ⎣11⎦ , and the submatrix 15 ⎡ ⎤ 2 3 4 in rows {1, 2, 4} and columns {2, 3, 4} is A[{1, 2, 4}, {2, 3, 4}] = ⎣ 6 7 8⎦ . A principal 14 15 16 ⎡ ⎤ 1 2 4 submatrix of A is A[{1, 2, 4}, {1, 2, 4}] = ⎣ 5 6 8⎦. The leading principal submatrices of 13 14 16
1 ⎢ 5 12. Let A = ⎢ ⎣ 9 13
2 6 10 14
3 7 11 15
⎤
4 8⎥ ⎥ . Row 1 of A is [1 12⎦ 16
⎡ ⎤ 1 2 3 1 2 ⎣ , 5 6 7⎦, and A itself. A are [1], 5 6 9 10 11
Vectors, Matrices, and Systems of Linear Equations
1.3
17
Gaussian and GaussJordan Elimination
Definitions: Let A be a matrix with m rows. When a row of A is not zero, its first nonzero entry is the leading entry of the row. The matrix A is in row echelon form (REF) when the following two conditions are met: 1. Any zero rows are below all nonzero rows. 2. For each nonzero row i, i ≤ m − 1, either row i + 1 is zero or the leading entry of row i + 1 is in a column to the right of the column of the leading entry in row i. The matrix A is in reduced row echelon form (RREF) if it is in row echelon form and the following third condition is also met: 3. If aik is the leading entry in row i, then aik = 1, and every entry of column k other than aik is zero. Elementary row operations on a matrix are operations of the following types: 1. Add a multiple of one row to a different row. 2. Exchange two different rows. 3. Multiply one row by a nonzero scalar. The matrix A is row equivalent to the matrix B if there is a sequence of elementary row operations that transforms A into B. The reduced row echelon form of A, RREF(A), is the matrix in reduced row echelon form that is row equivalent to A. A row echelon form of A is any matrix in row echelon form that is row equivalent to A. The rank of A, denoted rank A or rank( A), is the number of leading entries in RREF(A). If A is in row echelon form, the positions of the leading entries in its nonzero rows are called pivot positions and the entries in those positions are called pivots. A column (row) that contains a pivot position is a pivot column (pivot row). Gaussian Elimination is a process that uses elementary row operations in a particular way to change, or reduce, a matrix to row echelon form. Gauss–Jordan Elimination is a process that uses elementary row operations in a particular way to reduce a matrix to RREF. See Algorithm 1 below. Facts: Let A ∈ F m× p . 1. 2. 3. 4. 5. 6. 7.
[Lay03, p. 15] The reduced row echelon form of A, RREF(A), exists and is unique. A matrix in REF or RREF is upper triangular. Every elementary row operation is reversible by an elementary row operation of the same type. If A is row equivalent to B, then B is row equivalent to A. If A is row equivalent to B, then RREF(A) = RREF(B) and rank A = rank B. The number of nonzero rows in any row echelon form of A equals rank A. If B is any row echelon form of A, the positions of the leading entries in B are the same as the positions of the leading entries of RREF( A). 8. [Lay03, pp. 17–20] (Gaussian and Gauss–Jordan Elimination Algorithms) When one or more pivots are relatively small, using the algorithms below in floating point arithmetic can yield inaccurate results. (See Chapter 38 for more accurate variations of them, and Chapter 75 for information on professional software implementations of such variations.)
18
Handbook of Linear Algebra
Algorithm 1. Gaussian and GaussJordan Elimination Let A ∈ F m× p . Steps 1 to 4 below do Gaussian Elimination, reducing A to a matrix that is in row echelon form. Steps 1 to 6 do Gauss–Jordan Elimination, reducing A to RREF(A). 1. Let U = A and r = 1. If U = 0, U is in RREF. 2. If U = 0, search the submatrix of U in rows r to m to find its first nonzero column, k, and the first nonzero entry, ai k , in this column. If i > r, exchange rows r and i in U, thus getting a nonzero entry in position (r, k). Let U be the matrix created by this row exchange. 3. Add multiples of row r to the rows below it, to create zeros in column k below row r. Let U denote the new matrix. 4. If either r = m − 1 or rows r + 1, . . . , m are all zero, U is now in REF. Otherwise, let r = r + 1 and repeat steps 2, 3, and 4. 5. Let k1 , . . . , ks be the pivot columns of U, so (1, k1 ), . . . , (s , ks ) are the pivot positions. For i = s , s − 1, . . . , 2, add multiples of row i to the rows above it to create zeros in column ki above row i. 6. For i = 1, . . . , s , divide row s by its leading entry. The resulting matrix is RREF(A).
Examples: 1. The RREF of a zero matrix is itself, and its rank is zero.
⎡ ⎤ ⎡ ⎤ 1 3 4 −8 1 3 4 −8 2. Let A = ⎣0 0 2 4⎦ and B = ⎣0 0 0 4⎦. Both are upper triangular, but A is in REF 0 0 0 0 0 0 1 0 and B is not. Use Gauss–Jordan Elimination to calculate RREF( A) and RREF(B).
⎡ ⎤ 1 3 0 −16 For A, add (−2)(row 2) to row 1 and multiply row 2 by 12 . This yields RREF(A) = ⎣0 0 1 2⎦. 0 0 0 0 ⎡ ⎤ 1 3 4 −8 For B, exchange rows 2 and 3 to get ⎣0 0 1 0⎦, which is in REF. Then add 2(row 3) to 0 0 0 4 row 1 to get a new matrix. In this new matrix, add (−4)(row 2) to row 1, and multiply row 3 by 14 . ⎡ ⎤ 1 3 0 0 This yields RREF(B) = ⎣0 0 1 0⎦. 0 0 0 1 Observe that rank ( A) = 2 and rank (B) = 3.
⎡
⎤
2 6 4 4 ⎢−4 −12 −8 −7⎥ ⎥. 3. Apply Gauss–Jordan Elimination to A = ⎢ ⎣ 0 0 −1 −4⎦ 1 3 1 −2 Step 1. Let U (1) = A and r = 1. Step 2. No row exchange is needed since a11 = 0.
Step 3. Add (2)(row 1) to row 2, and (− 12 )(row 1) to row 4 to get U (2)
⎡ 2 ⎢0 =⎢ ⎣0 0
6 0 0 0
Step 4. The submatrix in rows 2, 3, 4 is not zero, so let r = 2 and return to Step 2.
4 0 1 −1
⎤
4 1⎥ ⎥. 4⎦ −4
19
Vectors, Matrices, and Systems of Linear Equations
Step 2. Search the submatrix in rows 2 to 4 of U (2) to see that its first nonzero column is column 3 and the first nonzero entry in this column is in row 3 of U (2) . Exchange rows 2 and 3 in U (2) to get U (3)
⎡ 2 ⎢0 ⎢ =⎣ 0 0
6 0 0 0
4 1 0 −1
⎤
4 4⎥ ⎥. 1⎦ −4
Step 3. Add row 2 to row 4 in U (3) to get U (4)
⎡ 2 ⎢0 =⎢ ⎣0 0
6 0 0 0
⎤
4 1 0 0
4 4⎥ ⎥. 1⎦ 0
Step 4. Now U (4) is in REF, so Gaussian Elimination is finished. Step 5. The pivot positions are (1, 1), (2, 3), and (3, 4). Add –4(row 3) to rows 1 and 2 of U (4) to get U (5)
⎡ 2 ⎢0 =⎢ ⎣0 0
6 0 0 0
4 1 0 0
⎤
⎡
0 2 ⎢ 0⎥ ⎥. Add –4(row 2) of U (5) to row 1 of U (5) to get U (6) = ⎢0 ⎣0 1⎦ 0 0
⎡ 1 ⎢ 0 Step 6. Multiply row 1 of U (6) by 12 , obtaining U (7) = ⎢ ⎣0 0
1.4
3 0 0 0
0 1 0 0
⎤
6 0 0 0
0 1 0 0
⎤
0 0⎥ ⎥. 1⎦ 0
0 0⎥ ⎥, which is RREF(A). 1⎦ 0
Systems of Linear Equations
Definitions: A linear equation is an equation of the form a1 x1 +· · ·+a p x p = b where a1 , . . . , a p , b ∈ F and x1 , . . . , x p are variables. The scalars a j are coefficients and the scalar b is the constant term. A system of linear equations, or linear system, is a set of one or more linear equations in the same a11 x1 + · · · + a1 p x p = b1 a x + · · · + a2 p x p = b2 . A solution of the system is a ptuple (c 1 , . . . , c p ) such that variables, such as 21 2 ··· am1 x1 + · · · + amp x p = bm letting x j = c j for each j satisfies every equation. The solution set of the system is the set of all solutions. A system is consistent if there exists at least one solution; otherwise it is inconsistent. Systems are equivalent if they have the same solution set. If b j = 0 for all j, the system is homogeneous. A formula that describes a general vector in the solution set is called the general solution. ⎡ ⎤ a11 x1 + · · · + a1 p x p = b1 a11 · · · a1 p a x + · · · + a2 p x p = b2 ⎢ .. ⎥ is the coefficient For the system 21 2 , the m × p matrix A = ⎣ ... ··· . ⎦ ··· · · · a a m1 mp am1 x1 + · · · + amp x p = bm
⎡
⎤
⎡ ⎤
b1 x1 ⎢ ⎥ ⎢ ⎥ matrix, b = ⎣ ... ⎦ is the constant vector, and x = ⎣ ... ⎦ is the unknown vector. The m × ( p + 1) matrix bm xp [A b] is the augmented matrix of the system. It is customary to identify the system of linear equations
⎡ ⎤ c1 ⎢ .. ⎥ with the matrixvector equation Ax = b. This is valid because a column vector x = ⎣ . ⎦ satisfies Ax = b if and only if (c 1 , . . . , c p ) is a solution of the linear system.
cp
110
Handbook of Linear Algebra
Observe that the coefficients of xk are stored in column k of A. If Ax = b is equivalent to C x = d and column k of C is a pivot column, then xk is a basic variable; otherwise, xk is a free variable. Facts: Let Ax = b be a linear system, where A is an m × p matrix. 1. [SIF00, pp. 27, 118] If elementary row operations are done to the augmented matrix [ A b], obtaining a new matrix [C d], the new system C x = d is equivalent to Ax = b. 2. [SIF00, p. 24] There are three possibilities for the solution set of Ax = b: either there are no solutions or there is exactly one solution or there is more than one solution. If there is more than one solution and F is infinite (such as the real numbers or complex numbers), then there are infinitely many solutions. If there is more than one solution and F is finite, then there are at least F  solutions. 3. A homogeneous system is always consistent (the zero vector 0 is always a solution). 4. The set of solutions to the homogeneous system Ax = 0 is a subspace of the vector space F p . 5. [SIF00, p. 44] The system Ax = b is consistent if and only if b is not a pivot column of [A b], that is, if and only if rank([ A b]) = rank A. 6. [SIF00, pp. 29–32] Suppose Ax = b is consistent. It has a unique solution if and only there is a pivot position in each column of A, that is, if and only if there are no free variables in the equation Ax = b. Suppose there are t ≥ 1 nonpivot columns in A. Then there are t free variables in the system. If RREF([A b]) = [C d], then the general solution of C x = d, hence of Ax = b, can be written in the form x = s 1 v1 + · · · + s t vt + w where v1 , . . . , vt , w are column vectors and s 1 , . . . , s t are parameters, each representing one of the free variables. Thus x = w is one solution of Ax = b. Also, the general solution of Ax = 0 is x = s 1 v1 + · · · + s t vt . 7. [SIF00, pp. 29–32] (General solution of a linear system algorithm) Algorithm 2: General Solution of a Linear System Ax = b This algorithm is intended for small systems using rational arithmetic. It is not the most efficient and when some pivots are relatively small, using this algorithm in floating point arithmetic can yield inaccurate results. (For more accurate and efficient algorithms, see Chapter 38.) Let A ∈ F m× p and b ∈ F p×1 . 1. Calculate RREF([A b]), obtaining [C d]. 2. If there is a pivot in the last column of [C d], stop. There is no solution. 3. Assume the last column of [C d] is not a pivot column, and let d = [d1 , . . . , dm ]T . a. If rank(C ) = p, so there exists a pivot in each column of C, then x = d is the unique solution of the system. b. Suppose rank C = r < p. i. Write the system of linear equations represented by the nonzero rows of [C d]. In each equation, the first nonzero term will be a basic variable, and each basic variable appears in only one of these equations. ii. Solve each equation for its basic variable and substitute parameter names for the p − r free variables, say s 1 , . . . , s p−r . This is the general solution of C x = d and, thus, the general solution of Ax = b. iii. To write the general solution in vector form, as x = s 1 v(1) +· · ·+s p−r v( p−r ) +w, let (i, ki ) be the i th pivot position of C. Define w ∈ F p by w ki = di for i = 1, . . . , r, and all other entries of w are 0. Let xu j be the j th free variable, and define the vectors v( j ) ∈ F p as follows: For j = 1, . . . , p − r, the u j entry of v( j ) is 1, for i = 1, . . . , r, the ki entry of v( j ) is −c iu j , and all other entries of v( j ) are 0.
111
Vectors, Matrices, and Systems of Linear Equations
Examples:
1. The linear system
x1 + x2 = 0 1 1 0 1 0 0 . The RREF of this is , has augmented matrix −x1 + x2 = 0 −1 1 0 0 1 0
x1 = 0 . Thus, the original system has a x2 = 0 x 0 . unique solution in R2 , (0,0). In vector form the solution is x = 1 = x2 0 which is the augmented matrix for the equivalent system
2. The system
x1 + x2 = 2 x 1 . has a unique solution in R2 , (1, 1), or x = 1 = x2 x1 − x2 = 0 1
⎡ ⎤
0 x1 + x2 + x3 = 2 3. The system x2 + x3 = 2 has a unique solution in R3 , (0, 2, 0), or x = ⎣2⎦ . x3 = 0 0 4. The system
x1 + x2 = 2 has infinitely many solutions in R2 . The augmented matrix reduces 2x1 + 2x2 = 4
1 1 2 , so the only equation left is x1 + x2 = 2. Thus x1 is basic and x2 is free. Solving to 0 0 0 x = −s + 2 , or all for x1 and letting x2 = s gives x1 = −s + 2. Then the general solution is 1 x2 = s x1 , the vector form of the general solution is vectors of the form (−s + 2, s ). Letting x = x2 −s + 2 −1 2 =s + . x= s 1 0 5. The system
x1 + x2 + x3 + x4 = 1 has infinitely many solutions in R4 . Its augmented matrix x2 + x3 − x4 = 3
1 1 1 1 1 1 0 0 2 −2 reduces to . Thus, x1 and x2 are the basic variables, and 0 1 1 −1 3 0 1 1 −1 3 x3 and x4 are free. Write each of the new equations and solve it for its basic variable to see x1 x2 x3 x4
x1 = −2x4 − 2 . Let x3 x2 = −x3 + x4 + 3
=
=
s 1 and x4
⎡
⎤
s 2 to get the general solution
⎡
⎤
⎡
⎤
= −2s 2 − 2 0 −2 −2 ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ = −s 1 + s 2 + 3 −1 1 ⎥ ⎢ ⎥ ⎢ 3⎥ , or x = s 1 v(1) + s 2 v(2) + w = s 1 ⎢ ⎣ 1⎦ + s 2 ⎣ 0⎦ + ⎣ 0⎦ . = s1 = s2 0 1 0
6. These systems have no solutions:
x1 + x2 + x3 = 0 x1 + x2 = 0 and x1 − x2 − x3 = 0. This can be verified by x1 + x2 = 1 x2 + x3 = 1
inspection, or by calculating the RREF of the augmented matrix of each and observing that each has a pivot in its last column.
1.5
Matrix Inverses and Elementary Matrices
Invertibility is a strong and useful property. For example, when a linear system Ax = b has an invertible coefficient matrix A, it has a unique solution. The various characterizations of invertibility in Fact 10 below are also quite useful. Throughout this section, F will denote a field.
112
Handbook of Linear Algebra
Definitions: An n × n matrix A is invertible, or nonsingular, if there exists another n × n matrix B, called the inverse of A, such that AB = BA = In . The inverse of A is denoted A−1 (cf. Fact 1). If no such B exists, A is not invertible, or singular. . . . A . It is also convenient For an n×n matrix and a positive integer m, the mth power of A is Am = AA m copies of A
to define A0 = In . If A is invertible, then A−m = (A−1 )m . An elementary matrix is a square matrix obtained by doing one elementary row operation to an identity matrix. Thus, there are three types: 1. A multiple of one row of In has been added to a different row. 2. Two different rows of In have been exchanged. 3. One row of In has been multiplied by a nonzero scalar. Facts: 1. [SIF00, pp. 114–116] If A ∈ F n×n is invertible, then its inverse is unique. 2. [SIF00, p. 128] (Method to compute A−1 ) Suppose A ∈ F n×n . Create the matrix [A In ] and calculate its RREF, which will be of the form [RREF( A)X]. If RREF(A) = In , then A is invertible and X = A−1 . If RREF(A) = In , then A is not invertible. As with the Gaussian algorithm, this method is theoretically correct, but more accurate and efficient methods for calculating inverses are used in professional computer software. (See Chapter 75.) 3. [SIF00, pp. 114–116] If A ∈ F n×n is invertible, then A−1 is invertible and ( A−1 )−1 = A. 4. [SIF00, pp. 114–116] If A, B ∈ F n×n are invertible, then AB is invertible and (AB)−1 = B −1 A−1 . 5. [SIF00, pp. 114–116] If A ∈ F n×n is invertible, then AT is invertible and ( AT )−1 = (A−1 )T . 6. If A ∈ F n×n is invertible, then for each b ∈ F n×1 , Ax = b has a unique solution, and it is x = A−1 b. 7. [SIF00, p. 124] If A ∈ F n×n and there exists C ∈ F n×n such that either AC = In or CA = In , then A is invertible and A−1 = C. That is, a left or right inverse for a square matrix is actually its unique twosided inverse. 8. [SIF00, p. 117] Let E be an elementary matrix obtained by doing one elementary row operation to In . If that same row operation is done to an n × p matrix A, the result equals EA. 9. [SIF00, p. 117] An elementary matrix is invertible and its inverse is another elementary matrix of the same type. 10. [SIF00, pp. 126] (Invertible Matrix Theorem) (See Section 2.5.) When A ∈ F n×n , the following are equivalent: r A is invertible. r RREF(A) = I . n r Rank(A) = n. r The only solution of Ax = 0 is x = 0. r For every b ∈ F n×1 , Ax = b has a unique solution. r For every b ∈ F n×1 , Ax = b has a solution. r There exists B ∈ F n×n such that AB = I . n r There exists C ∈ F n×n such that CA = I . n r AT is invertible. r There exist elementary matrices whose product equals A. 11. [SIF00, p. 148] and [Lay03, p.132] Let A ∈ F n×n be upper (lower) triangular. Then A is invertible if and only if each diagonal entry is nonzero. If A is invertible, then A−1 is also upper (lower) triangular, and the diagonal entries of A−1 are the reciprocals of those of A. In particular, if L is a unit upper (lower) triangular matrix, then L −1 is also a unit upper (lower) triangular matrix.
113
Vectors, Matrices, and Systems of Linear Equations
12. Matrix powers obey the usual rules of exponents, i.e., when As and At are defined for integers s and t, then As At = As +t , (As )t = Ast . Examples: 1. For any n, the identity matrix In is invertible and is its own inverse. If P is a permutation matrix, −1 T it is invertible and P = P . 7 3 1 −3 2. If A = and B = , then calculation shows AB = BA = I2 , so A is invertible and 2 1 −2 7 B. A−1 = ⎡ 0.2 3. If A = ⎣ 0 0 4.
5.
6.
7.
1.6
4 2 0
⎤
⎡
⎤
1 5 −10 −5 0.5 0.5⎦ , as can be verified by multiplication. 1⎦, then A−1 = ⎣0 0 0 −1 −1
1 2 The matrix A = is not invertible since RREF(A) = I2 . Alternatively, if B is any 2 × 2 2 4 r s matrix, AB is of the form , which cannot equal I2 . 2r 2s Let A be an n × n matrix A with a zero row (zero column). Then A is not invertible since RREF(A) = In . Alternatively, if B is any n × n matrix, AB has a zero row (BA has a zero column), so B is not an inverse for A. a b is any 2 × 2 matrix, then A is invertible if and only if ad − bc = 0; further, when If A = c d 1 d −b −1 . The scalar ad − bc is called the determinant of A. ad − bc = 0, A = a ad − bc −c (The determinant is defined for any n × n matrix in Section 4.1.) Using this formula, the matrix 7 3 1 −3 A= from Example 2 (above) has determinant 1, so A is invertible and A−1 = , 2 1 −2 7 1 2 from Example 3 (above) is not invertible since its determinant as noted above. The matrix 2 4 is 0. ⎡ ⎤ ⎡ ⎤ 1 3 0 1 0 0 7 −3 0 Let A = ⎣2 7 0⎦ . Then RREF([ A In ]) = ⎣0 1 0 −2 1 0⎦, so A−1 exists and 1 1 1 0 0 1 −5 2 1 ⎡ ⎤ 7 −3 0 equals ⎣−2 1 0⎦ . −5 2 1
LU Factorization
This section discusses the LU and PLU factorizations of a matrix that arise naturally when Gaussian Elimination is done. Several other factorizations are widely used for real and complex matrices, such as the QR, Singular Value, and Cholesky Factorizations. (See Chapter 5 and Chapter 38.) Throughout this section, F will denote a field and A will denote a matrix over F . The material in this section and additional background can be found in [GV96, Sec. 3.2]. Definitions: Let A be a matrix of any shape. An LU factorization, or triangular factorization, of A is a factorization A = LU where L is a square unit lower triangular matrix and U is upper triangular. A PLU factorization of A is a factorization of
114
Handbook of Linear Algebra
the form PA = LU where P is a permutation matrix, L is square unit lower triangular, and U is upper triangular. An LDU factorization of A is a factorization A = LDU where L is a square unit lower triangular matrix, D is a square diagonal matrix, and U is a unit upper triangular matrix. A PLDU factorization of A is a factorization PA = LDU where P is a permutation matrix, L is a square unit lower triangular matrix, D is a square diagonal matrix, and U is a unit upper triangular matrix. Facts: [GV96, Sec. 3.2] 1. Let A be square. If each leading principal submatrix of A, except possibly A itself, is invertible, then A has an LU factorization. When A is invertible, A has an LU factorization if and only if each leading principal submatrix of A is invertible; in this case, the LU factorization is unique and there is also a unique LDU factorization of A. 2. Any matrix A has a PLU factorization. Algorithm 1 (Section 1.3) performs the addition of multiples of pivot rows to lower rows and perhaps row exchanges to obtain an REF matrix U. If instead, the same series of row exchanges are done to A before any pivoting, this creates PA where P is a permutation matrix, and then PA can be reduced to U without row exchanges. That is, there exist unit lower triangular matrices E j such that E k . . . E 1 (PA) = U. It follows that PA = LU, where L = (E k . . . E 1 )−1 is unit lower triangular and U is upper triangular. 3. In most professional software packages, the standard method for solving a square linear system Ax = b, for which A is invertible, is to reduce A to an REF matrix U as in Fact 2 above, choosing row exchanges by a strategy to reduce pivot size. By keeping track of the exchanges and pivot operations done, this produces a PLU factorization of A. Then A = P T LU and P T LU x = b is the equation to be solved. Using forward substitution, P T L y = b can be solved quickly for y, and then U x = y can either be solved quickly for x by back substitutution, or be seen to be inconsistent. This method gives accurate results for most problems. There are other types of solution methods that can work more accurately or efficiently for special types of matrices. (See Chapter 7.) Examples:
⎡
1 ⎢−1 1. Calculate a PLU factorization for A = ⎢ ⎣ 0 −1
1 −1 1 0
⎤
2 3 −3 1⎥ ⎥. If Gaussian Elimination is performed 1 1⎦ −1 1
on A, after adding row 1 to rows 2 and 4, rows 2 and 3 must be exchanged and the final result is
⎡ ⎤ 1 1 2 3 ⎢0 1 1 1⎥ ⎥ U = E 3 PE2 E 1 A = ⎢ ⎣0 0 −1 4⎦ where E 1 , E 2 , and E 3 are lower triangular unit matrices and 0 0 0 3 P is a permutation matrix. This will not yield an LU factorization of A. But if the row exchange ⎡ ⎤ ⎡ ⎤ 1 0 0 0 1 1 2 3 ⎢0 0 1 0⎥ ⎢ 0 1 1 1⎥ ⎥ ⎢ ⎥ is done to A first, by multiplying A by P = ⎢ ⎣0 1 0 0⎦, one gets PA = ⎣−1 −1 −3 1⎦; 0 0 0 1 −1 0 −1 1 then Gaussian Elimination can proceed without any row exchanges. Add row 1 to rows 3 ⎡ ⎤ ⎡ ⎤ ⎡ ⎤and 4 to get 1 1 2 3 1 0 0 0 1 0 0 0 ⎢0 1 ⎢0 1 0 0⎥ ⎢0 1 0 0⎥ 1 1⎥ ⎥ ⎢ ⎥ ⎢ ⎥ F 2 F 1 PA = ⎢ ⎣0 0 −1 4⎦ where F 1 = ⎣1 0 1 0⎦ and F 2 = ⎣0 0 1 0⎦. Then add 0 1 1 4 0 0 0 1 1 0 0 1 ⎡ ⎤ ⎡ ⎤ 1 1 2 3 1 0 0 0 ⎢0 1 ⎢0 1 1⎥ 1 0 0⎥ ⎥ ⎢ ⎥. (−1)(row 2) to row 4 to get U = F 3 F 2 F 1 PA = ⎢ ⎣0 0 −1 4⎦, where F 3 = ⎣0 0 1 0⎦ 0 0 0 3 0 −1 0 1
115
Vectors, Matrices, and Systems of Linear Equations
Note that U is the same upper triangular matrix as before. Finally, L = (F 3 F 2 F 1 )−1 is unit lower triangular and PA = LU is true, so this is a PLU factorization of A. To get a PLDU factorization,
⎡ ⎤ ⎡ ⎤ 1 0 0 0 1 1 2 3 ⎢0 1 ⎢0 1 1 0 0⎥ 1⎥ ⎥ ⎢ ⎥ use the same P and L , and define D = ⎢ ⎣0 0 −1 0⎦ and U = ⎣0 0 1 −4⎦. 0 0 0 3 0 0 0 1 ⎡ ⎤ 1 3 4 2. Let A = LU = ⎣−1 −1 −5⎦ . Each leading principal submatrix of A is invertible so A has 2 12 3 both LU and LDU factorizations:
⎡
A=
⎡ 1 ⎣0 0
⎤⎡
⎤
⎡
⎤⎡
⎤
1 0 0 1 3 4 1 0 0 1 0 0 LU = ⎣−1 1 0⎦⎣0 2 −1⎦. This yields an LDU factorization of A, ⎣−1 1 0⎦⎣0 2 0⎦ 2 3 1 0 0 −2 ⎤2 3 1 0 0 −2 ⎡ ⎤ 3 4 1 1 −0.5⎦. With the LU factorization, an equation such as Ax = ⎣1⎦ can be solved efficiently 0 1 0
⎡ ⎤ ⎡ ⎤ 1 1 as follows. Use forward substitution to solve L y = ⎣1⎦, getting y = ⎣ 2⎦, and then backward 0 −8 ⎡ ⎤ −24 substitution to solve U x = y, getting x = ⎣ 3⎦. 4 ⎡ ⎤ 0 −1 5 0 1 3. Any invertible matrix whose (1, 1) entry is zero, such as or ⎣1 1 1⎦, does not have 1 0 1 0 3 an LU factorization. ⎡ ⎤ 1 3 4 4. The matrix A = ⎣−1 −3 −5⎦ is not invertible, nor is its leading principal 2 × 2 submatrix, 2 6 6 ⎡ ⎤⎡ ⎤ 1 0 0 1 3 4 but it does have an LU factorization: A = LU = ⎣−1 1 0⎦ ⎣0 0 −1⎦. To find out if an 2 3 1 0 0 1 ⎡ ⎤ ⎡ ⎤ ⎡ ⎤ 1 1 1 equation such as Ax = ⎣1⎦ is consistent, notice L y = ⎣1⎦ yields y = ⎣ 2⎦, but U x = y is 0 0 −8 ⎡ ⎤ 1 inconsistent, hence Ax = ⎣1⎦ has no solution. 0 ⎡ ⎤ 0 −1 5 5. The matrix A = ⎣1 1 1⎦ has no LU factorization, but does have a PLU factorization with 1 0 2 ⎡ ⎤ ⎡ ⎤ ⎡ ⎤ 0 1 0 1 0 0 1 1 1 P = ⎣1 0 0⎦ , L = ⎣0 1 0⎦, and U = ⎣0 −1 5⎦ . 0 0 −4 0 0 1 1 1 1
116
Handbook of Linear Algebra
References [FIS03] S.H. Friedberg, A.J. Insel, and L.E. Spence. Linear Algebra, 3rd ed. Pearson Education, Upper Saddle River, NJ, 2003. [GV96] G.H. Golub and C.F. Van Loan. Matrix Computations, 3rd ed. Johns Hopkins Press, Baltimore, MD, 1996. [Lay03] David C. Lay. Linear Algebra and Its Applications, 3rd ed. Addison Wesley, Boston, 2003. [Leo02] Steven J. Leon. Linear Algebra with Applications, 6th ed. Prentice Hall, Upper Saddle River, NJ, 2003. [SIF00] L.E. Spence, A.J. Insel, and S.H. Friedberg. Elementary Linear Algebra. Prentice Hall, Upper Saddle River, NJ, 2000.
2 Linear Independence, Span, and Bases Span and Linear Independence . . . . . . . . . . . . . . . . . . . . . . . Basis and Dimension of a Vector Space . . . . . . . . . . . . . . . . Direct Sum Decompositions . . . . . . . . . . . . . . . . . . . . . . . . . . Matrix Range, Null Space, Rank, and the Dimension Theorem. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.5 Nonsingularity Characterizations . . . . . . . . . . . . . . . . . . . . . 2.6 Coordinates and Change of Basis . . . . . . . . . . . . . . . . . . . . . 2.7 Idempotence and Nilpotence . . . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.1 2.2 2.3 2.4
Mark Mills Central College
2.1
21 23 24 26 29 210 212 212
Span and Linear Independence
Let V be a vector space over a field F . Definitions: A linear combination of the vectors v1 , v2 , . . . , vk ∈ V is a sum of scalar multiples of these vectors; that is, c 1 v1 + c 2 v2 + · · · + c k vk , for some scalar coefficients c 1 , c 2 , . . . , c k ∈ F . If S is a set of vectors in V , a linear combination of vectors in S is a vector of the form c 1 v1 + c 2 v2 + · · · + c k vk with k ∈ N, vi ∈ S, c i ∈ F . Note that S may be finite or infinite, but a linear combination is, by definition, a finite sum. The zero vector is defined to be a linear combination of the empty set. When all the scalar coefficients in a linear combination are 0, it is a trivial linear combination. A sum over the empty set is also a trivial linear combination. The span of the vectors v1 , v2 , . . . , vk ∈ V is the set of all linear combinations of these vectors, denoted by Span(v1 , v2 , . . . , vk ). If S is a (finite or infinite) set of vectors in V, then the span of S, denoted by Span(S), is the set of all linear combinations of vectors in S. If V = Span(S), then S spans the vector space V . A (finite or infinite) set of vectors S in V is linearly independent if the only linear combination of distinct vectors in S that produces the zero vector is a trivial linear combination. That is, if vi are distinct vectors in S and c 1 v1 + c 2 v2 + · · · + c k vk = 0, then c 1 = c 2 = · · · = c k = 0. Vectors that are not linearly independent are linearly dependent. That is, there exist distinct vectors v1 , v2 , . . . , vk ∈ S and c 1 , c 2 , . . . , c k not all 0 such that c 1 v1 + c 2 v2 + · · · + c k vk = 0.
21
22
Handbook of Linear Algebra
Facts: The following facts can be found in [Lay03, Sections 4.1 and 4.3]. 1. 2. 3. 4.
5. 6. 7. 8. 9.
10.
Span(∅) = {0}. A linear combination of a single vector v is simply a scalar multiple of v. In a vector space V , Span(v1 , v2 , . . . , vk ) is a subspace of V . Suppose the set of vectors S = {v1 , v2 , . . . , vk } spans the vector space V . If one of the vectors, say vi , is a linear combination of the remaining vectors, then the set formed from S by removing vi still spans V . Any single nonzero vector is linearly independent. Two nonzero vectors are linearly independent if and only if neither is a scalar multiple of the other. If S spans V and S ⊆ T , then T spans V . If T is a linearly independent subset of V and S ⊆ T , then S is linearly independent. Vectors v1 , v2 , . . . , vk are linearly dependent if and only if vi = c 1 v1 + · · · + c i −1 vi −1 + c i +1 vi +1 + · · · + c k vk , for some 1 ≤ i ≤ k and some scalars c 1 , . . . , c i −1 , c i +1 , . . . , c k . A set S of vectors in V is linearly dependent if and only if there exists v ∈ S such that v is a linear combination of other vectors in S. Any set of vectors that includes the zero vector is linearly dependent.
Examples:
1 0 1 0 c1 , ∈ R2 are vectors of the form c 1 + c2 = , 1. Linear combinations of −c 1 + 3c 2 −1 3 −1 3
for any scalars c 1 , c 2 ∈ R. Any vector of
Span
this form is in Span
1 , −1
0 3
1 0 , −1 3
. In fact,
= R2 and these vectors are linearly independent.
2. If v ∈ Rn and v = 0, then geometrically Span(v) is a line in Rn through the origin. 3. Suppose n ≥ 2 and v1 , v2 ∈ Rn are linearly independent vectors. Then geometrically Span(v1 , v2 ) is a plane in Rn through the origin. 4. Any polynomial p(x) ∈ R[x] of degree less than or equal to 2 can easily be seen to be a linear combination of 1, x, and x 2 . However, p(x) is also a linear combination of 1, 1 + x, and 1 + x 2 . So Span(1, x, x 2 ) = Span(1, 1 + x, 1 + x 2 ) = R[x; 2]. ⎡ ⎤
⎡ ⎤
⎡ ⎤
1 0 0 ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢0⎥ ⎢1⎥ ⎢0⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢.⎥ 5. The n vectors e1 = ⎢ 0 ⎥ , e2 = ⎢ 0 ⎥ , . . . , en = ⎢ .. ⎥ span F n , for any field F . These vectors are ⎢.⎥ ⎢.⎥ ⎢ ⎥ ⎢.⎥ ⎢.⎥ ⎢ ⎥ ⎣.⎦ ⎣.⎦ ⎣0⎦ 0 0 1 also linearly independent.
6. In R , 2
1 −1
and
dependent, because
0 3
are linearly independent. However,
1 5
=
1 , −1
0 , and 3
1 5
are linearly
1 0 +2 . −1 3
7. The infinite set {1, x, x 2 , . . . , x n , . . .} is linearly independent in F [x], for any field F . 8. In the vector space of continuous realvalued functions on the real line, C(R), the set {sin(x), sin(2x), . . . , sin(nx), cos(x), cos(2x), . . . , cos(nx)} is linearly independent for any n ∈ N. The infinite set {sin(x), sin(2x), . . . , sin(nx), . . . , cos(x), cos(2x), . . . , cos(nx), . . .} is also linearly independent in C(R).
23
Linear Independence, Span, and Bases
Applications:
d2 y dy + 2y = 0 has as solutions y1 (x) = e 2x and −3 d x2 dx y2 (x) = e x . Any linear combination y(x) = c 1 y1 (x) + c 2 y2 (x) is a solution of the differential equation, and so Span(e 2x , e x ) is contained in the set of solutions of the differential equation (called the solution space for the differential equation). In fact, the solution space is spanned by e 2x and e x , and so is a subspace of the vector space of functions. In general, the solution space for a homogeneous differential equation is a vector space, meaning that any linear combination of solutions is again a solution.
1. The homogeneous differential equation
2.2
Basis and Dimension of a Vector Space
Let V be a vector space over a field F . Definitions: A set of vectors B in a vector space V is a basis for V if r B is a linearly independent set, and r Span(B) = V .
⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨
⎡ ⎤
⎡ ⎤
⎡ ⎤⎫
1 0 0 ⎪ ⎪ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥⎪ ⎪ ⎢0⎥ ⎢1⎥ ⎢ 0 ⎥⎪ ⎪ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥⎪ ⎬ ⎢0⎥ ⎢0⎥ ⎢ .. ⎥ The set En = e1 = ⎢ ⎥ , e2 = ⎢ ⎥ , . . . , en = ⎢ . ⎥ is the standard basis for F n . ⎪ ⎢.⎥ ⎢.⎥ ⎢ ⎥⎪ ⎪ ⎪ ⎪ ⎢.⎥ ⎢.⎥ ⎢ ⎥⎪ ⎪ ⎪ ⎪ ⎣.⎦ ⎣.⎦ ⎣ 0 ⎦⎪ ⎪ ⎪ ⎪ ⎪ ⎩ ⎭ 0 0 1 The number of vectors in a basis for a vector space V is the dimension of V , denoted by dim(V ). If a basis for V contains a finite number of vectors, then V is finite dimensional. Otherwise, V is infinite dimensional, and we write dim(V ) = ∞. Facts: All the following facts, except those with a specific reference, can be found in [Lay03, Sections 4.3 and 4.5]. 1. Every vector space has a basis. 2. The standard basis for F n is a basis for F n , and so dim F n = n. 3. A basis B in a vector space V is the largest set of linearly independent vectors in V that contains B, and it is the smallest set of vectors in V that contains B and spans V . 4. The empty set is a basis for the trivial vector space {0}, and dim({0}) = 0. 5. If the set S = {v1 , . . . , v p } spans a vector space V , then some subset of S forms a basis for V . In particular, if one of the vectors, say vi , is a linear combination of the remaining vectors, then the set formed from S by removing vi will be “closer” to a basis for V . This process can be continued until the remaining vectors form a basis for V . 6. If S is a linearly independent set in a vector space V , then S can be expanded, if necessary, to a basis for V . 7. No nontrivial vector space over a field with more than two elements has a unique basis. 8. If a vector space V has a basis containing n vectors, then every basis of V must contain n vectors. Similarly, if V has an infinite basis, then every basis of V must be infinite. So the dimension of V is unique. 9. Let dim(V ) = n and let S be a set containing n vectors. The following are equivalent: r S is a basis for V . r S spans V . r S is linearly independent.
24
Handbook of Linear Algebra
10. If dim(V ) = n, then any subset of V containing more than n vectors is linearly dependent. 11. If dim(V ) = n, then any subset of V containing fewer than n vectors does not span V . 12. [Lay03, Section 4.4] If B = {b1 , . . . , b p } is a basis for a vector space V , then each x ∈ V can be expressed as a unique linear combination of the vectors in B. That is, for each x ∈ V there is a unique set of scalars c 1 , c 2 , . . . , c p such that x = c 1 b1 + c 2 b2 + · · · + c p b p . Examples:
1 0 1. In R , and are linearly independent, and they span R2 . So they form a basis for R2 and −1 3 2
dim(R2 ) = 2. 2. In F [x], the set {1, x, x 2 , . . . , x n } is a basis for F [x; n] for any n ∈ N. The infinite set {1, x, x 2 , x 3 , . . .} is a basis for F [x], meaning dim(F [x]) = ∞. 3. The set of m × n matrices E ij having a 1 in the i, j entry and zeros everywhere else forms a basis for F m×n . Since there are mn such matrices, dim(F m×n ) = mn.
4. The set S =
1 0 1 , , 0 1 2
clearly spans R2 , but it is not a linearly independent set. However,
removing any single vector from S will cause the remaining vectors to be a basis for R2 , because any pair of vectors is linearly independent and still spans R2 .
⎧ ⎡ ⎤ ⎡ ⎤⎫ 1 0 ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎢ 1 ⎥ ⎢ 0 ⎥⎪ ⎬ ⎢ ⎥ ⎢ ⎥ 5. The set S = ⎢ ⎥, ⎢ ⎥ is linearly independent, but it cannot be a basis for R4 since it does ⎪ ⎣ 0 ⎦ ⎣ 1 ⎦⎪ ⎪ ⎪ ⎪ ⎪ ⎩ ⎭
0
1
not span R . However, we can start expanding it to a basis for R4 by first adding a vector that is not 4
⎡ ⎤
1
⎢0⎥ ⎢ ⎥ in the span of S, such as ⎢ ⎥. Then since these three vectors still do not span R4 , we can add a ⎣0⎦
0
⎡ ⎤
0
⎢0⎥ ⎢ ⎥ vector that is not in their span, such as ⎢ ⎥. These four vectors now span R4 and they are linearly ⎣1⎦
0 independent, so they form a basis for R . 6. Additional techniques for determining whether a given finite set of vectors is linearly independent or spans a given subspace can be found in Sections 2.5 and 2.6. 4
Applications: 1. Because y1 (x) = e 2x and y2 (x) = e x are linearly independent and span the solution space for the dy d2 y + 2y = 0, they form a basis for the solution space homogeneous differential equation 2 − 3 dx dx and the solution space has dimension 2.
2.3
Direct Sum Decompositions
Throughout this section, V will be a vector space over a field F , and Wi , for i = 1, . . . , k, will be subspaces of V . For facts and general reading for this section, see [HK71].
25
Linear Independence, Span, and Bases
Definitions:
The sum of subspaces Wi , for i = 1, . . . , k, is ik=1 Wi = W1 + · · · + Wk = {w1 + · · · + wk  wi ∈ Wi }. The sum W1 + · · · + Wk is a direct sum if for all i = 1, . . . , k, we have Wi ∩ j =i W j = {0}. W = W1 ⊕ · · · ⊕ Wk denotes that W = W1 + · · · + Wk and the sum is direct. The subspaces Wi , for i = i, . . . , k, are independent if for wi ∈ Wi , w1 + · · · + wk = 0 implies wi = 0 for all i = 1, . . . , k. Let Vi , for i = 1, . . . , k, be vector spaces over F . The external direct sum of the Vi , denoted V1 × · · · × Vk , is the cartesian product of Vi , for i = 1, . . . , k, with coordinatewise operations. Let W be a subspace of V . An additive coset of W is a subset of the form v + W = {v + w  w ∈ W} with v ∈ V . The quotient of V by W, denoted V/W, is the set of additive cosets of W with operations (v 1 + W) + (v 2 + W) = (v 1 + v 2 ) + W and c (v + W) = (c v) + W, for any c ∈ F . Let V = W ⊕ U , let BW and BU be bases for W and U respectively, and let B = BW ∪ BU . The induced basis of B in V/W is the set of vectors {u + W  u ∈ BU }. Facts: 1. W = W1 ⊕ W2 if and only if W = W1 + W2 and W1 ∩ W2 = {0}. 2. If W is a subspace of V , then there exists a subspace U of V such that V = W ⊕ U . Note that U is not usually unique. 3. Let W = W1 + · · · + Wk . The following are equivalent: r W = W ⊕ · · · ⊕ W . That is, for all i = 1, . . . , k, we have W ∩ 1 k i j =i W j = {0}. r W ∩ i −1 W = {0}, for all i = 2, . . . , k. i j j =1
r For each w ∈ W, w can be expressed in exactly one way as a sum of vectors in W , . . . , W . That 1 k
is, there exist unique wi ∈ Wi , such that w = w1 + · · · + wk .
r The subspaces W , for i = 1, . . . , k, are independent. i
r If B is an (ordered) basis for W , then B = k B is an (ordered) basis for W. i i i =1 i
4. If B is a basis for V and B is partitioned into disjoint subsets Bi , for i = 1, . . . , k, then V = Span(B1 ) ⊕ · · · ⊕ Span(Bk ). 5. If S is a linearly independent subset of V and S is partitioned into disjoint subsets Si , for i = 1, . . . , k, then the subspaces Span(S1 ), . . . , Span(Sk ) are independent. 6. If V is finite dimensional and V = W1 + · · · + Wk , then dim(V ) = dim(W1 ) + · · · + dim(Wk ) if and only if V = W1 ⊕ · · · ⊕ Wk . 7. Let Vi , for i = 1, . . . , k, be vector spaces over F . r V × · · · × V is a vector space over F . 1 k r V i = {(0, . . . , 0, v i , 0, . . . , 0)  v i ∈ Vi } (where v i is the i th coordinate) is a subspace of
V1 × · · · × Vk .
r V × ··· × V = V 1 ⊕ · · · ⊕ V k . 1 k r If V , for i = 1, . . . , k, are finite dimensional, then dim V i = dim Vi and dim(V1 × · · · × Vk ) = i
dim V1 + · · · + dim Vk .
8. If W is a subspace of V , then the quotient V/W is a vector space over F . 9. Let V = W ⊕ U , let BW and BU be bases for W and U respectively, and let B = BW ∪ BU . The induced basis of B in V/W is a basis for V/W and dim(V/W) = dim U . Examples: 1. Let B = {v1 , . . . , vn } be a basis for V . Then V = Span(v1 ) ⊕ · · · ⊕ Span(vn ).
2. Let X =
x 0
 x ∈ R ,Y =
X ⊕ Y = Y ⊕ Z = X ⊕ Z.
0 y
 y ∈ R , and Z =
z z
 z ∈ R . Then R2 =
26
Handbook of Linear Algebra
3. In F n×n , let W1 be the subspace of symmetric matrices and W2 be the subspace of skewsymmetric A + AT A − AT A + AT matrices. Clearly, W1 ∩ W2 = {0}. For any A ∈ F n×n , A = + , where ∈ 2 2 2 T A− A W1 and ∈ W2 . Therefore, F n×n = W1 ⊕ W2 . 2 4. Recall that the function f ∈ C(R) is even if f (−x) = f (x) for all x, and f is odd if f (−x) = − f (x) for all x. Let W1 be the subspace of even functions and W2 be the subspace of odd functions. f (x) + f (−x) ∈ W1 Clearly, W1 ∩ W2 = {0}. For any f ∈ C(R), f = f 1 + f 2 , where f 1 (x) = 2 f (x) − f (−x) ∈ W2 . Therefore, C(R) = W1 ⊕ W2 . and f 1 (x) = 2 5. Given a subspace W of V , we can find a subspace U such that V = W ⊕ U by choosing a basis for W, extending this linearly independent set to a basis for V , and setting U equal to the span of ⎫ ⎧⎡ ⎤ ⎡ ⎤ ⎪ ⎪ a 1 ⎬ ⎨ ⎢ ⎥ ⎢ ⎥ the basis vectors not in W. For example, in R3 , Let W = ⎣ −2a ⎦  a ∈ R . If w = ⎣ −2 ⎦, ⎪ ⎪ ⎭ ⎩
a
1
then {w} is a basis for W. Extend this to a basis for R , for example by adjoining e1 and e2 . Thus, V = W ⊕ U , where U = Span(e1 , e2 ). Note: there are many other ways to extend the basis, and many other possible U . 1 2 0 1 2×2 2 2 + 3 x + 4x − 2, = 6. In the external direct sum R[x; 2] × R , 2x + 7, 3 4 −1 0 3
1 5x + 12x + 1, 0 2
5 4
.
7. The subspaces X, Y, Z of R in Example 2 have bases B X = 2
1 1
, BY =
0 1
, BZ =
, respectively. Then B XY = B X ∪ BY and B X Z = B X ∪ B Z are bases for R2 . In R2 / X, the
induced bases of B XY and B X Z are
1 +X= because 1
2.4
1 0
0 +X 1
0 1 + +X= 1 0
and
1 + X , respectively. These are equal 1
0 + X. 1
Matrix Range, Null Space, Rank, and the Dimension Theorem
Definitions: For any matrix A ∈ F m×n , the range of A, denoted by range(A), is the set of all linear combinations of the columns of A. If A = [m1 m2 . . . mn ], then range(A) = Span(m1 , m2 , . . . , mn ). The range of A is also called the column space of A. The row space of A, denoted by RS(A), is the set of all linear combinations of the rows of A. If A = [v1 v2 . . . vm ]T , then RS(A) = Span(v1 , v2 , . . . , vm ). The kernel of A, denoted by ker(A), is the set of all solutions to the homogeneous equation Ax = 0. The kernel of A is also called the null space of A, and its dimension is called the nullity of A, denoted by null(A). The rank of A, denoted by rank(A), is the number of leading entries in the reduced row echelon form of A (or any row echelon form of A). (See Section 1.3 for more information.)
27
Linear Independence, Span, and Bases
A, B ∈ F m×n are equivalent if B = C 1−1 AC 2 for some invertible matrices C 1 ∈ F m×m and C 2 ∈ F n×n. A, B ∈ F n×n are similar if B = C −1 AC for some invertible matrix C ∈ F n×n . For square matrices A1 ∈ F n1 ×n1 , . . . , Ak ∈ F nk ×nk, the matrix direct sum A = A1 ⊕ · · · ⊕ Ak is the block diagonal matrix ⎡ ⎢
A1
with the matrices Ai down the diagonal. That is, A = ⎢ ⎣
0 ..
0
.
⎤
k ⎥ ⎥, where A ∈ F n×n with n = ni . ⎦
Ak
i =1
Facts: Unless specified otherwise, the following facts can be found in [Lay03, Sections 2.8, 4.2, 4.5, and 4.6]. 1. The range of an m × n matrix A is a subspace of F m . 2. The columns of A corresponding to the pivot columns in the reduced row echelon form of A (or any row echelon form of A) give a basis for range(A). Let v1 , v2 , . . . , vk ∈ F m . If matrix A = [v1 v2 . . . vk ], then a basis for range(A) will be a linearly independent subset of v1 , v2 , . . . , vk having the same span. 3. dim(range(A)) = rank(A). 4. The kernel of an m × n matrix A is a subspace of F n . 5. If the reduced row echelon form of A (or any row echelon form of A) has k pivot columns, then null(A) = n − k. 6. If two matrices A and B are row equivalent, then RS( A) = RS(B). 7. The row space of an m × n matrix A is a subspace of F n . 8. The pivot rows in the reduced row echelon form of A (or any row echelon form of A) give a basis for RS(A). 9. dim(RS(A)) = rank(A). 10. rank(A) = rank(AT ). 11. (Dimension Theorem) For any A ∈ F m×n , n = rank(A) + null(A). Similarly, m = dim(RS(A)) + null(AT ). 12. A vector b ∈ F m is in range(A) if and only if the equation Ax = b has a solution. So range(A) = F m if and only if the equation Ax = b has a solution for every b ∈ F m . 13. A vector a ∈ F n is in RS(A) if and only if the equation AT y = a has a solution. So RS(A) = F n if and only if the equation AT y = a has a solution for every a ∈ F n . 14. If a is a solution to the equation Ax = b, then a + v is also a solution for any v ∈ ker(A). 15. [HJ85, p. 14] If A ∈ F m×n is rank 1, then there are vectors v ∈ F m and u ∈ F n so that A = vuT . 16. If A ∈ F m×n is rank k, then A is a sum of k rank 1 matrices. That is, there exist A1 , . . . , Ak with A = A1 + · · · + Ak and rank(Ai ) = 1, for i = 1, . . . , k. 17. [HJ85, p. 13] The following are all equivalent statements about a matrix A ∈ F m×n . (a) (b) (c) (d) (e) (f)
The rank of A is k. dim(range(A)) = k. The reduced row echelon form of A has k pivot columns. A row echelon form of A has k pivot columns. The largest number of linearly independent columns of A is k. The largest number of linearly independent rows of A is k.
18. [HJ85, p. 13] (Rank Inequalities) (Unless specified otherwise, assume that A, B ∈ F m×n .) (a) rank(A) ≤ min(m, n). (b) If a new matrix B is created by deleting rows and/or columns of matrix A, then rank(B) ≤ rank(A). (c) rank(A + B) ≤ rank(A) + rank(B). (d) If A has a p × q submatrix of 0s, then rank(A) ≤ (m − p) + (n − q ).
28
Handbook of Linear Algebra
(e) If A ∈ F m×k and B ∈ F k×n , then rank(A) + rank(B) − k ≤ rank(AB) ≤ min{rank(A), rank(B)}. 19. [HJ85, pp. 13–14] (Rank Equalities) (a) If A ∈ Cm×n , then rank(A∗ ) = rank(AT ) = rank(A) = rank(A). (b) If A ∈ Cm×n , then rank(A∗ A) = rank(A). If A ∈ Rm×n , then rank(AT A) = rank(A). (c) Rank is unchanged by left or right multiplication by a nonsingular matrix. That is, if A ∈ F n×n and B ∈ F m×m are nonsingular, and M ∈ F m×n , then rank(AM) = rank(M) = rank(MB) = rank(AMB). (d) If A, B ∈ F m×n , then rank(A) = rank(B) if and only if there exist nonsingular matrices X ∈ F m×m and Y ∈ F n×n such that A = X BY (i.e., if and only if A is equivalent to B). (e) If A ∈ F m×n has rank k, then A = XBY, for some X ∈ F m×k , Y ∈ F k×n , and nonsingular B ∈ F k×k . (f) If A1 ∈ F n1 ×n1 , . . . , Ak ∈ F nk ×nk , then rank(A1 ⊕ · · · ⊕ Ak ) = rank(A1 ) + · · · + rank(Ak ). 20. Let A, B ∈ F n×n with A similar to B. (a) A is equivalent to B. (b) rank(A) = rank(B). (c) tr A = tr B. 21. Equivalence of matrices is an equivalence relation on F m×n . 22. Similarity of matrices is an equivalence relation on F n×n .
23. If A ∈ F
m×n
I and rank(A) = k, then A is equivalent to k 0
0 , and so any two matrices of the 0
same size and rank are equivalent. 24. (For information on the determination of whether two matrices are similar, see Chapter 6.) 25. [Lay03, Sec. 6.1] If A ∈ Rn×n , then for any x ∈ RS(A) and any y ∈ ker(A), xT y = 0. So the row space and kernel of a real matrix are orthogonal to one another. (See Chapter 5 for more on orthogonality.) Examples: ⎡
⎤
⎡
⎤⎛ ⎡
⎤⎡ ⎤⎞
1 7 −2 a + 7b − 2c 1 7 −2 a ⎢ ⎥ ⎢ ⎥⎜ ⎢ ⎥⎢ ⎥⎟ 1. If A = ⎣ 0 −1 1 ⎦ ∈ R3×3 , then any vector of the form ⎣ −b + c ⎦⎝= ⎣ 0 −1 1 ⎦⎣ b ⎦⎠ 2 13 −3 2a + 13b − 3c 2 13 −3 c ⎡
1 ⎢ is in range(A), for any a, b, c ∈ R. Since a row echelon form of A is ⎣ 0 0 ⎧⎡ ⎤ ⎡ ⎧⎡ ⎤⎫ ⎪ ⎪ 7 ⎪ ⎨ 1 ⎨ ⎬ ⎢ ⎥ ⎢ ⎢ ⎥ the set ⎣ 0 ⎦ , ⎣ −1 ⎦ is a basis for range(A), and the set ⎣ ⎪ ⎪ ⎪ ⎩ ⎩ ⎭
2
13
⎡
1 ⎢ RS(A). Since its reduced row echelon form is ⎣ 0 0 basis for RS(A).
0 1 0
⎤
7 1 0
⎤ ⎡
⎤
−2 ⎥ −1 ⎦, we know that 0 ⎤⎫
1 0 ⎪ ⎬ ⎥ ⎢ ⎥ 7 ⎦ , ⎣ 1 ⎦ is a basis for ⎪ ⎭ −2 −1 ⎧⎡ ⎤ ⎡
⎤⎫
⎪ 5 0 ⎪ ⎨ 1 ⎬ ⎢ ⎥ ⎢ ⎥ ⎥ −1 ⎦, the set ⎣ 0 ⎦ , ⎣ 1 ⎦ is another ⎪ ⎪ ⎩ ⎭ 0 5 −1
29
Linear Independence, Span, and Bases ⎡
⎤
1 7 −2 ⎢ ⎥ 2. If A = ⎣ 0 −1 1 ⎦ ∈ R3×3 , then using the reduced row echelon form given in the previ2 13 −3 ⎡
⎤
−5 ⎢ ⎥ ous example, solutions to Ax = 0 have the form x = c ⎣ 1 ⎦, for any c ∈ R. So ker( A) = 1 ⎛⎡
⎤⎞
−5 ⎜⎢ ⎥⎟ Span ⎝⎣ 1 ⎦⎠. 1 3. If A ∈ R3×5
⎡
1 ⎢ has the reduced row echelon form ⎣ 0 0
Ax = 0 has the form
⎡
−3
⎤
⎤
0 1 0 ⎡
3 0 2 ⎥ −2 0 7 ⎦, then any solution to 0 1 −1
−2
⎤
⎢ ⎥ ⎢ ⎥ ⎢ 2 ⎥ ⎢ −7 ⎥ ⎢ ⎥ ⎢ ⎥ ⎥ ⎢ ⎥ x = c1 ⎢ ⎢ 1 ⎥ + c2 ⎢ 0 ⎥ ⎢ ⎥ ⎢ ⎥ ⎣ 0 ⎦ ⎣ 1 ⎦
0 for some c 1 , c 2 ∈ R. So,
⎛⎡
1 ⎤ ⎡
⎤⎞
−3 −2 ⎜⎢ ⎥ ⎢ ⎥⎟ ⎜⎢ 2 ⎥ ⎢ −7 ⎥⎟ ⎜⎢ ⎥ ⎢ ⎥⎟ ⎥ ⎢ ⎥⎟ ⎢ ker(A) = Span ⎜ ⎜ ⎢ 1 ⎥ , ⎢ 0 ⎥⎟ . ⎜⎢ ⎥ ⎢ ⎥⎟ ⎝ ⎣ 0 ⎦ ⎣ 1 ⎦⎠ 0 1 ⎧⎡ ⎤ ⎡ ⎤⎫ ⎪ 7 ⎪ ⎨ 1 ⎬ ⎢ ⎥ ⎢ ⎥ 4. Example 1 above shows that ⎣ 0 ⎦ , ⎣ −1 ⎦ is a linearly independent set having the same span ⎪ ⎪ ⎩ ⎭
2
⎧⎡ ⎤ ⎡ ⎤ ⎡ ⎤⎫ ⎪ 7 −2 ⎪ ⎨ 1 ⎬ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ as the set ⎣ 0 ⎦ , ⎣ −1 ⎦ , ⎣ 1 ⎦ . ⎪ ⎪ ⎩ ⎭ 2 13 −3
5.
2.5
1 2
7 37 is similar to −3 31
13
−46 37 because −39 31
−46 −2 3 = −39 3 −4
−1
1 2
7 −3
−2 3 . 3 −4
Nonsingularity Characterizations
From the previous discussion, we can add to the list of nonsingularity characterizations of a square matrix that was started in the previous chapter. Facts: The following facts can be found in [HJ85, p. 14] or [Lay03, Sections 2.3 and 4.6]. 1. If A ∈ F n×n , then the following are equivalent. (a) A is nonsingular. (b) The columns of A are linearly independent. (c) The dimension of range( A) is n.
210
Handbook of Linear Algebra
(d) The range of A is F n . (e) The equation Ax = b is consistent for each b ∈ F n . (f) If the equation Ax = b is consistent, then the solution is unique. (g) The equation Ax = b has a unique solution for each b ∈ F n . (h) The rows of A are linearly independent. (i) The dimension of RS( A) is n. (j) The row space of A is F n . (k) The dimension of ker( A) is 0. (l) The only solution to Ax = 0 is x = 0. (m) The rank of A is n. (n) The determinant of A is nonzero. (See Section 4.1 for the definition of the determinant.)
2.6
Coordinates and Change of Basis
Coordinates are used to transform a problem in a more abstract vector space (e.g., the vector space of polynomials of degree less than or equal to 3) to a problem in F n . Definitions: Suppose that B = (b1 , b2 , . . . , bn ) is an ordered basis for a vector space V over a field F and x ∈ V . The coordinates of x relative to the ordered basis B (or the Bcoordinates of x) are the scalar coefficients c 1 , c 2 , . . . , c n ∈ F such that x = c 1 x1 + c 2 x2 + · · · + c n xn . Whenever coordinates are involved, the vector space is assumed to be nonzero and finite dimensional. If c 1 , c 2 , . . . , c n are the Bcoordinates of x, then the vector in F n , ⎡
⎤
c1 ⎢c ⎥ ⎢ 2⎥ ⎥ [x]B = ⎢ ⎢ .. ⎥ , ⎣ . ⎦ cn is the coordinate vector of x relative to B or the Bcoordinate vector of x. The mapping x → [x]B is the coordinate mapping determined by B. If B and B are ordered bases for the vector space F n , then the changeofbasis matrix from B to B is the matrix whose columns are the B coordinate vectors of the vectors in B and is denoted by B [I ]B . Such a matrix is also called a transition matrix. Facts: The following facts can be found in [Lay03, Sections 4.4 and 4.7] or [HJ85, Section 0.10]: 1. For any vector x ∈ F n with the standard ordered basis En = (e1 , e2 , . . . , en ), we have x = [x]En . 2. For any ordered basis B = (b1 , . . . , bn ) of a vector space V , we have [bi ]B = ei . 3. If dim(V ) = n, then the coordinate mapping is a onetoone linear transformation from V onto F n . (See Chapter 3 for the definition of linear transformation.) 4. If B is an ordered basis for a vector space V and v1 , v2 ∈ V , then v1 = v2 if and only if [v1 ]B = [v2 ]B . 5. Let V be a vector space over a field F , and suppose B is an ordered basis for V . Then for any x, v1 , . . . , vk ∈ V and c 1 , . . . , c k ∈ F , x = c 1 v1 + · · · + c k vk if and only if [x]B = c 1 [v1 ]B + · · · + c k [vk ]B . So, for any x, v1 , . . . , vk ∈ V , x ∈ Span(v1 , . . . , vk ) if and only if [x]B ∈ Span([v1 ]B , . . . , [vk ]B ). 6. Suppose B is an ordered basis for an ndimensional vector space V over a field F and v1 , . . . , vk ∈ V. The set S = {v1 , . . . , vk} is linearly independent in V if and only if the set S = {[v1 ]B , . . . , [vk ]B} is linearly independent in F n .
211
Linear Independence, Span, and Bases
7. Let V be a vector space over a field F with dim(V ) = n, and suppose B is an ordered basis for V . Then Span(v1 , v2 , . . . , vk ) = V for some v1 , v2 , . . . , vk ∈ V if and only if Span([v1 ]B , [v2 ]B , . . . , [vk ]B ) = F n . 8. Suppose B is an ordered basis for a vector space V over a field F with dim(V ) = n, and let S = {v1 , . . . , vn } be a subset of V . Then S is a basis for V if and only if {[v1 ]B , . . . , [vn ]B } is a basis for F n if and only if the matrix [[v1 ]B , . . . , [vn ]B ] is invertible. 9. If B and B are ordered bases for a vector space V , then [x]B = B [I ]B [x]B for any x ∈ V . Furthermore, B [I ]B is the only matrix such that for any x ∈ V , [x]B = B [I ]B [x]B . 10. Any changeofbasis matrix is invertible. 11. If B is invertible, then B is a changeofbasis matrix. Specifically, if B = [b1 · · · bn ] ∈ F n×n , then B = En [I ]B , where B = (b1 , . . . , bn ) is an ordered basis for F n . 12. If B = (b1 , . . . , bn ) is an ordered basis for F n , then En [I ]B = [b1 · · · bn ]. 13. If B and B are ordered bases for a vector space V , then B [I ]B = (B [I ]B )−1 . 14. If B and B are ordered bases for F n , then B [I ]B = (B [I ]En )(En [I ]B ). Examples: 1. If p(x) = an x n + an−1 x n−1 + · · · + a1 x + a0 ∈ F [x; n] with the standard ordered basis ⎡
⎤
a0 ⎢a ⎥ ⎢ 1⎥ ⎥ B = (1, x, x 2 , . . . , x n ), then [ p(x)]B = ⎢ ⎢ .. ⎥. ⎣ . ⎦ an
2. The set B =
1 0 , −1 3
forms an ordered basis for R2 . If E2 is the standard ordered basis
for R , then the changeofbasis matrix from B to E2 is E2 [T ]B = 2
1
0
1 3
1 3
1 −1
0 , and (E2 [T ]B )−1 = 3
3 in the standard ordered basis, we find that [v]B = (E2 [T ]B )−1 v = 1
. So for v =
To check this, we can easily see that v =
3 1
=3
1 + −1
3 4 3
.
0 . 3
4 3
3. The set B = (1, 1 + x, 1 + x 2 ) is an ordered basis for R[x; 2], and using the standard ordered basis ⎡
B = (1, x, x 2 ) for R[x; 2] we have B [P ]B ⎡
and [5 − 2x + 3x 2 ]B
1 ⎢ = ⎣0 0
⎤
4. If we want to change from the ordered basis B1 =
2 1
5 0
−1
⎤
⎤
0 3
−1 1 0
⎤
−1 ⎥ 0⎦ 1
1 0 , −1 3
, then the resulting changeofbasis matrix is 1 −1
⎡
1 1 ⎥ ⎢ −1
0 ⎦. So, (B [P ]B ) = ⎣ 0 1 0
5 4 ⎢ ⎥ ⎢ ⎥ = (B [P ]B )−1 ⎣ −2 ⎦ = ⎣ −2 ⎦. Of course, we can see 5 − 2x + 3x 2 = 3 3
4(1) − 2(1 + x) + 3(1 + x 2 ).
2 5 , 1 0
⎡
1 1 0
=
−1
3
3 5
− 65
.
in R2 to the ordered basis B2 =
B2 [T ]B1
= (E2 [T ]B2 )−1 (E2 [T ]B1 ) =
212
Handbook of Linear Algebra
5. Let S = {5 − 2x + 3x 2 , 3 − x + 2x 2 , 8 + 3x} in R[x; 2] with the standard ordered basis B = ⎡
⎤
5 3 8 ⎢ ⎥ (1, x, x 2 ). The matrix A = ⎣ −2 −1 3 ⎦ contains the Bcoordinate vectors for the polynomials 3 2 0 ⎡
5 ⎢ in S and it has row echelon form ⎣ 0 0
⎤
3 1 0
8 ⎥ 31 ⎦. Since this row echelon form shows that A is 1
nonsingular, we know by Fact 8 above that S is a basis for R[x; 2].
2.7
Idempotence and Nilpotence
Definitions: A is an idempotent if A2 = A. A is nilpotent if, for some k ≥ 0, Ak = 0. Facts: All of the following facts except those with a specific reference are immediate from the definitions. 1. Every idempotent except the identity matrix is singular. 2. Let A ∈ F n×n . The following statements are equivalent. (a) A is an idempotent. (b) I − A is an idempotent. (c) If v ∈ range(A), then Av = v. (d) F n = ker A ⊕ rangeA.
I (e) [HJ85, p. 37 and p. 148] A is similar to k 0
0 , for some k ≤ n. 0
3. If A1 and A2 are idempotents of the same size and commute, then A1 A2 is an idempotent. 4. If A1 and A2 are idempotents of the same size and A1 A2 = A2 A1 = 0, then A1 + A2 is an idempotent. 5. If A ∈ F n×n is nilpotent, then An = 0. 6. If A is nilpotent and B is of the same size and commutes with A, then AB is nilpotent. 7. If A1 and A2 are nilpotent matrices of the same size and A1 A2 = A2 A1 = 0, then A1 + A2 is nilpotent. Examples:
1.
−8 −6
12 1 −1 is an idempotent. is nilpotent. 9 1 −1
References [Lay03] D. C. Lay. Linear Algebra and Its Applications, 3rd ed. AddisonWesley, Reading, MA, 2003. [HK71] K. H. Hoffman and R. Kunze. Linear Algebra, 2nd ed. PrenticeHall, Upper Saddle River, NJ, 1971. [HJ85] R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985.
3 Linear Transformations
Francesco Barioli University of Tennessee at Chattanooga
3.1
3.1 Basic Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.2 The Spaces L (V, W) and L (V, V ) . . . . . . . . . . . . . . . . . . . . 3.3 Matrix of a Linear Transformation . . . . . . . . . . . . . . . . . . . . 3.4 Change of Basis and Similarity . . . . . . . . . . . . . . . . . . . . . . . . 3.5 Kernel and Range . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.6 Invariant Subspaces and Projections . . . . . . . . . . . . . . . . . . 3.7 Isomorphism and Nonsingularity Characterization . . . . 3.8 Linear Functionals and Annihilator . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
31 32 33 34 35 36 37 38 39
Basic Concepts
Let V, W be vector spaces over a field F . Definitions: A linear transformation (or linear mapping) is a mapping T : V → W such that, for each u, v ∈ V , and for each c ∈ F , T (u + v) = T (u) + T (v), and T (c u) = c T (u). V is called the domain of the linear transformation T : V → W. W is called the codomain of the linear transformation T : V → W. The identity transformation I V : V → V is defined by I V (v) = v for each v ∈ V . I V is also denoted by I . The zero transformation 0: V → W is defined by 0(v) = 0W for each v ∈ V . A linear operator is a linear transformation T : V → V . Facts: Let T : V → W be a linear transformation. The following facts can be found in almost any elementary linear algebra text, including [Lan70, IV§1], [Sta69, §3.1], [Goo03, Chapter 4], and [Lay03, §1.8]. 1. 2. 3. 4. 5.
T ( n1 ai vi ) = n1 ai T (vi ), for any ai ∈ F , vi ∈ V , i = 1, . . . , n. T (0V ) = 0W . T (−v) = −T (v), for each v ∈ V . The identity transformation is a linear transformation. The zero transformation is a linear transformation.
31
32
Handbook of Linear Algebra
6. If B = {v1 , . . . , vn } is a basis for V , and w1 , . . . , wn ∈ W, then there exists a unique T : V → W such that T (vi ) = wi for each i . Examples: Examples 1 to 9 are linear transformations. ⎛ ⎡ ⎤⎞
x
⎜ ⎢ ⎥⎟ 1. T : R → R where T ⎝⎣ y ⎦⎠ = 3
2. 3. 4. 5. 6. 7. 8. 9. 10. 11.
3.2
2
x+y
. 2x − z z T : V → V , defined by T (v) = −v for each v ∈ V . If A ∈ F m×n , T : F n → F m , where T (v) = Av. T : F m×n → F , where T (A) = trA. Let C([0, 1]) be the vector space of all continuous functions on [0, 1] into R, and let T : C([0, 1]) → R 1 be defined by T ( f ) = 0 f (t)dt. Let V be the vector space of all functions f : R → R that have derivatives of all orders, and D: V → V be defined by D( f ) = f . 2 an angle θ. The transformation, which rotates every vector in⎛ the ⎤⎞ R⎡through ⎤ ⎡ plane x x ⎜ ⎢ ⎥⎟ ⎢ ⎥ The projection T onto the xyplane of R3 , i.e., T ⎝⎣ y ⎦⎠ = ⎣ y ⎦. z 0 T : R3 → R3 , where T (v) = b × v, for some b ∈ R3 . Examples 10 and 11 are not lineartransformations. x y+1 2 2 = is not a linear transformation because f (0) = 0. f : R → R , where f y x −y−2 x 1 2 2 = x is not a linear transformation because f 2 = 4 = 2 = f : R → R, where f y 0 1 . 2f 0
The Spaces L (V,W) and L (V,V )
Let V, W be vector spaces over F . Definitions: L (V, W) denotes the set of all linear transformations of V into W. For each T1 , T2 ∈ L (V, W) the sum T1 + T2 is defined by (T1 + T2 )(v) = T1 (v) + T2 (v). For each c ∈ F , T ∈ L (V, W) the scalar multiple c T is defined by (c T )(v) = c T (v). For each T1 , T2 ∈ L (V, V ) the product T1 T2 is the composite mapping defined by (T1 T2 )(v) = T1 (T2 (v)). T1 , T2 ∈ L (V, V ) commute if T1 T2 = T2 T1 . T ∈ L (V, V ) is a scalar transformation if, for some c ∈ F , T (v) = c v for each v ∈ V . Facts: Let T, T1 , T2 ∈ L (V, W). The following facts can be found in almost any elementary linear algebra text, including [Fin60, §3.2], [Lan70, IV §4], [Sta69, §3.6], [SW68, §4.3], and [Goo03, Chap. 4]. 1. T1 + T2 ∈ L (V, W). 2. c T ∈ L (V, W).
Linear Transformations
3. 4. 5. 6. 7. 8.
33
If T1 , T2 ∈ L (V, V ), then T1 T2 ∈ L (V, V ). L (V, W), with sum and scalar multiplication, is a vector space over F . L (V, V ), with sum, scalar multiplication, and composition, is a linear algebra over F . Let dim V = n and dim W = m. Then dim L (V, W) = mn. If dim V > 1, then there exist T1 , T2 ∈ L (V, V ), which do not commute. T0 ∈ L (V, V ) commutes with all T ∈ L (V, V ) if and only if T0 is a scalar transformation.
Examples: 1. For each j = 1, . . . , n let Tj ∈ L (F n , F n ) be defined by Tj (x) = x j e j . Then in=1 Tj is the identity transformation in V . 2. Let T1 and T2 be the transformations that rotates every vector in R2 through an angle θ1 and θ2 respectively. Then T1 T2 is the rotation through the angle θ1 + θ2 . 3. Let T1 be the rotation through an angle θ in R2 and let T2 be the reflection on the horizontal axis, that is, T2 (x, y) = (x, −y). Then T1 and T2 do not commute.
3.3
Matrix of a Linear Transformation
Let V, W be nonzero finite dimensional vector spaces over F .
Definitions: The linear transformation associated to a matrix A ∈ F m×n is TA : F n → F m defined by TA (v) = Av. The matrix associated to a linear transformation T ∈ L (V, W) and relative to the ordered bases B = (b1 , . . . , bn ) of V , and C of W, is the matrix C [T ]B = [[T (b1 )]C · · · [T (bn )]C ]. If T ∈ L (F n , F m ), then the standard matrix of T is [T ] = Em[T ]En , where En is the standard basis for F n . Note: If V = W and B = C, the matrix B [T ]B will be denoted by [T ]B . If T ∈ L (V, V ) and B is an ordered basis for V , then the trace of T is tr T = tr [T ]B . Facts: Let B and C be ordered bases V and W, respectively. The following facts can be found in almost any elementary linear algebra text, including [Lan70, V §2], [Sta69, §3.4–3.6], [SW68, §4.3], and [Goo03, Chap. 4]. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11.
The trace of T ∈ L (V, V ) is independent of the ordered basis of V used to define it. For A, B ∈ F m×n , TA = TB if and only if A = B. For any T1 , T2 ∈ L (V, W), C [T1 ]B = C [T2 ]B if and only if T1 = T2 . If T ∈ L (F n , F m ), then [T ] = [T (e1 ) · · · T (en )]. The changeofbasis matrix from basis B to C, C [I ]B , as defined in Chapter 2.6, is the same matrix as the matrix of the identity transformation with respect to B and C. Let A ∈ F m×n and let TA be the linear transformation associated to A. Then [TA ] = A. If T ∈ L (F n , F m ), then T[T ] = T . For any T1 , T2 ∈ L (V, W), C [T1 + T2 ]B = C [T1 ]B + C [T2 ]B . For any T ∈ L (V, W) , and c ∈ F , C [c T ]B = c C [T ]B . For any T1 , T2 ∈ L (V, V ), [T1 T2 ]B = [T1 ]B [T2 ]B . If T ∈ L (V, W), then, for each v ∈ V , [T (v)]C = C [T ]B [v]B . Furthermore C [T ]B is the only matrix A such that, for each v ∈ V , [T (v)]C = A[v]B .
34
Handbook of Linear Algebra
Examples: 1. Let T be the projection of R3 onto the xyplane of R3 . Then ⎡
⎤
1
0
0
[T ] = ⎢ ⎣0
1
0⎥ ⎦.
0
0
0
⎢
⎥
2. Let T be the identity in F n . Then [T ]B = In . 3. Let T be the rotation by θ in R2 . Then
[T ] =
cos θ
− sin θ
sin θ
cos θ
.
4. Let D: R[x; n] → R[x; n − 1] be the derivative transformation, and let B = {1, x, . . . , x n }, C = {1, x, . . . , x n−1 }. Then ⎡
0
⎢ ⎢0 ⎢ C [T ]B = ⎢. ⎢. ⎣.
0
3.4
⎤
0
···
0
0 2 .. .. . .
··· .
0 .. .
0
···
n−1
1
0
..
⎥ ⎥ ⎥ ⎥. ⎥ ⎦
Change of Basis and Similarity
Let V, W be nonzero finite dimensional vector spaces over F . Facts: The following facts can be found in [Gan60, III §5–6] and [Goo03, Chap. 4]. 1. Let T ∈ L (V, W) and let B, B be bases of V , C, C be bases of W. Then C [T ]B
=
C [I ]C C [T ]B B [I ]B .
2. Two m × n matrices are equivalent if and only if they represent the same linear transformation T ∈ L (V, W), but possibly in different bases, as in Fact 1. 3. Any m × n matrix A of rank r is equivalent to the m × n matrix
˜Ir =
Ir
0
0
0
.
4. Two m × n matrices are equivalent if and only if they have the same rank. 5. Two n × n matrices are similar if and only if they represent the same linear transformation T ∈ L (V, V ), but possibly in different bases, i.e., if A1 is similar to A2 , then there is T ∈ L (V, V ) and ordered bases B1 , B2 of V such that Ai = [T ]Bi and conversely. Examples: 2 1. Let T be the projection on the xaxis of R , i.e., T(x, y) = (x, 0). If B = {e1 , e2 } and C = 1 0 1/2 1/2 {e1 + e2 , e1 − e2 }, then [T ]B = , [T ]C = , and [T ]C = Q −1 [T ]B Q with 0 0 1/2 1/2 1 1 . Q= 1 −1
35
Linear Transformations
3.5
Kernel and Range
Let V, W be vector spaces over F and let T ∈ L (V, W). Definitions: T is onetoone (or injective) if v1 = v2 implies T (v1 ) = T (v2 ). The kernel (or null space) of T is the set ker T = {v ∈ V  T (v) = 0}. The nullity of T , denoted by null T , is the dimension of ker T . T is onto (or surjective) if, for each w ∈ W, there exists v ∈ V such that T (v) = w. The range (or image) of T is the set range T = {w ∈ W  ∃v, w = T (v)}. The rank of T , denoted by rank T , is the dimension of range T . Facts: The following facts can be found in [Fin60, §3.3], [Lan70, IV §3], [Sta69, §3.1–3.2], and [Goo03, Chap. 4]. 1. ker T is a subspace of V . 2. The following statements are equivalent. (a) T is onetoone. (b) ker T = {0}. (c) Each linearly independent set is mapped to a linearly independent set. (d) Each basis is mapped to a linearly independent set. (e) Some basis is mapped to a linearly independent set. 3. 4. 5. 6. 7. 8. 9. 10. 11.
range T is a subspace of W. rank T = rank C [T ]B for any finite nonempty ordered bases B, C. For A ∈ F m×n , ker TA = ker A and range TA = range A. (Dimension Theorem) Let T ∈ L (V, W) where V has finite dimension. Then null T + rank T = dim V . Let T ∈ L (V, V ), where V has finite dimension, then T is onetoone if and only if T is onto. Let T (v) = w. Then {u ∈ V  T (u) = w} = v + ker T . Let V = Span{v1 , . . . , vn }. Then range T = Span{T (v1 ), . . . , T (vn )}. Let T1 , T2 ∈ L (V, V ). Then ker T1 T2 ⊇ ker T2 and range T1 T2 ⊆ range T1 . Let T ∈ L (V, V ). Then {0} ⊆ ker T ⊆ ker T 2 ⊆ · · · ⊆ ker T k ⊆ · · · V ⊇ range T ⊇ range T 2 ⊇ · · · ⊇ range T k ⊇ · · · . Furthermore, if, for some k, range T k+1 = range T k , then, for each i 1, range T k+i = range T k . If, for some k, ker T k+1 = ker T k , then, for each i 1, ker T k+i = ker T k .
Examples: 1. Let T be the projection of R3 onto the xyplane of R3 . Then ker T = {(0, 0, z): z ∈ R}; range T = {(x, y, 0): x, y ∈ R}; null T = 1; and rank T = 2. 2. Let T be the linear transformation in Example 1 of Section 3.1. Then ker T = Span{[1 − 1 2]T }, while range T = R2 . 3. Let D ∈ L (R[x], R[x]) be the derivative transformation, then ker D consists of all constant polynomials, while range D = R[x]. In particular, D is onto but is not onetoone. Note that R[x] is not finite dimensional.
36
Handbook of Linear Algebra
4. Let T1 , T2 ∈ L (F n×n , F n×n ) where T1 (A) = 12 (A − AT ), T2 (A) = 12 (A + AT ), then ker T1 = range T2 = {n × n symmetric matrices}; ker T2 = range T1 = {n × n skewsymmetric matrices}; null T1 = rank T2 =
n(n + 1) ; 2
null T2 = rank T1 =
n(n − 1) . 2
5. Let T (v) = b × v as in Example 9 of Section 3.1. Then ker T = Span{b}.
3.6
Invariant Subspaces and Projections
Let V be a vector space over F , and let V = V1 ⊕ V2 for some V1 , V2 subspaces of V . For each v ∈ V , let vi ∈ Vi denote the (unique) vector such that v = v1 + v2 (see Section 2.3). Finally, let T ∈ L (V, V ). Definitions: For i, j ∈ {1, 2}, i = j , the projection onto Vi along V j is the operator projVi ,V j : V → V defined by projVi ,V j (v) = vi for each v ∈ V (see also Chapter 5). The complementary projection of the projection projVi ,V j is the projection projV j ,Vi . T is an idempotent if T 2 = T . A subspace V0 of V is invariant under T or T invariant if T (V0 ) ⊆ V0 . The fixed space of T is fix T = {v ∈ V  T (v) = v}. T is nilpotent if, for some k 0, T k = 0. Facts: The following facts can be found in [Mal63, §43–44]. projVi ,V j ∈ L (V, V ). projV1 ,V2 + projV2 ,V1 = I , the identity linear operator in V . range (projVi ,V j ) = ker(projV j ,Vi ) = Vi . Sum and intersection of invariant subspaces are invariant subspaces. If V has a nonzero subspace different from V that is invariant under T , then there exists a suitable A11 A12 A11 A12 . Conversely, if [T ]B = , where ordered basis B of V such that [T ]B = 0 A22 0 A22 A11 is an mbym block, then the subspace spanned by the first m vectors in B is a T invariant subspace. 6. Let T have two nonzero finite dimensional invariant subspaces V1 and V2 , with ordered bases B1 and B2 , respectively, such that V1 ⊕ V2 = V . Let T1 ∈ L (V1 , V1 ), T2 ∈ L (V2 , V2 ) be the restrictions of T on V1 and V2 , respectively, and let B = B1 ∪ B2 . Then [T ]B = [T1 ]B1 ⊕ [T2 ]B2 . The following facts can be found in [Hoh64, §6.15; §6.20]. 7. Every idempotent except the identity is singular. 8. The statements 8a through 8e are equivalent. If V is finite dimensional, statement 8f is also equivalent to these statements. 1. 2. 3. 4. 5.
(a) T is an idempotent. (b) I − T is an idempotent. (c) fix T = range T . (d) V = ker T ⊕ fix T .
37
Linear Transformations
(e) T is the projection onto V1 along V2 for some V1 , V2 , with V = V1 ⊕ V2 .
(f) There exists a basis B of V such that [T ]B =
I
0
0
0
.
9. If T1 and T2 are idempotents on V and commute, then T1 T2 is an idempotent. 10. If T1 and T2 are idempotents on V and T1 T2 = T2 T1 = 0, then T1 + T2 is an idempotent. 11. If dim V = n and T ∈ L (V, V ) is nilpotent, then T n = 0. ⎛⎡ ⎤⎞
Examples:
x
⎡ ⎤
x
⎜⎢ ⎥⎟ ⎢ ⎥ ⎢ ⎥⎟ ⎢ ⎥ 1. Example 8 of Section 3.1, T : R → R , where T ⎜ ⎝⎣ y ⎦⎠ = ⎣ y ⎦ is the projection onto Span{e1 , e2 } 3
3
z 0 along Span{e3 }. 2. The zero subspace is T invariant for any T . 3. T1 and T2 , defined in Example 4 of Section 3.5, are the projection of F n×n onto the subspace of nbyn symmetric matrices along the subspace of nbyn skewsymmetric matrices, and the projection of F n×n onto the skewsymmetric matrices along the symmetric matrices, respectively. 4. Let T be a nilpotent linear transformation on V . Let T p = 0 and T p−1 (v) = 0. Then S = Span{v, T (v), T 2 (v), . . . , T p−1 (v)} is a T invariant subspace.
3.7
Isomorphism and Nonsingularity Characterization
Let U , V , W be vector spaces over F and let T ∈ L (V, W). Definitions: T is invertible (or an isomorphism) if there exists a function S: W → V such that ST = I V and T S = I W . S is called the inverse of T and is denoted by T −1 . V and W are isomorphic if there exists an isomorphism of V onto W. T is nonsingular if ker T = {0}; otherwise T is singular. Facts: The following facts can be found in [Fin60, §3.4], [Hoh64, §6.11], and [Lan70, IV §4]: 1. 2. 3. 4. 5.
The inverse is unique. T −1 is a linear transformation, invertible, and (T −1 )−1 = T . If T1 ∈ L (V, W) and T2 ∈ L (U, V ), then T1 T2 is invertible if and only if T1 and T2 are invertible. If T1 ∈ L (V, W) and T2 ∈ L (U, V ), then (T1 T2 )−1 = T2−1 T1−1 . Let T ∈ L (V, W), and let dim V = dim W = n. The following statements are equivalent: (a) T is invertible. (b) T is nonsingular. (c) T is onetoone. (d) ker T = {0}. (e) null T = 0. (f) T is onto. (g) range T = W.
38
Handbook of Linear Algebra
(h) rank T = n. (i) T maps some bases of V to bases of W. 6. If V and W are isomorphic, then dim V = dim W. 7. If dim V = n > 0, then V is isomorphic to F n through ϕ defined by ϕ(v) = [v]B for any ordered basis B of V . 8. Let dim V = n > 0, dim W = m > 0, and let B and C be ordered bases of V and W, respectively. Then L (V, W) and F m×n are isomorphic through ϕ defined by ϕ(T ) = C [T ]B . Examples: 1. V = F [x; n] and W = F n+1 are isomorphic through T ∈ L (V, W) defined by T ( n0 ai x i ) = [a0 . . . an ]T . 2. If V is an infinite dimensional vector space, a nonsingular linear operator T ∈ L (V, V ) need not be invertible. For example, let T ∈ L (R[x], R[x]) be defined by T ( p(x)) = xp(x). Then T is nonsingular but not invertible since T is not onto. For matrices, nonsingular and invertible are equivalent, since an n × n matrix over F is an operator on the finite dimensional vector F n .
3.8
Linear Functionals and Annihilator
Let V, W be vector spaces over F . Definitions: A linear functional (or linear form) on V is a linear transformation from V to F . The dual space of V is the vector space V ∗ = L (V, F ) of all linear functionals on V . If V is nonzero and finite dimensional, the dual basis of a basis B = {v1 , . . . , vn } of V is the set B ∗ = { f 1 , . . . , f n } ⊆ V ∗ , such that f i (v j ) = δi j for each i, j . The bidual space is the vector space V ∗∗ = (V ∗ )∗ = L (V ∗ , F ). The annihilator of a set S ⊆ V is S a = { f ∈ V ∗  f (v) = 0, ∀v ∈ S}. The transpose of T ∈ L (V, W) is the mapping T T ∈ L (W ∗ , V ∗ ) defined by setting, for each g ∈ W ∗ , T T (g ) : V → F v → g (T (v)). Facts: The following facts can be found in [Hoh64, §6.19] and [SW68, §4.4]. 1. For each v ∈ V , v = 0, there exists f ∈ V ∗ such that f (v) = 0. 2. For each v ∈ V define h v ∈ L (V ∗ , F ) by setting h v ( f ) = f (v). Then the mapping ϕ : V →V ∗∗ v → h v is a onetoone linear transformation. If V is finite dimensional, ϕ is an isomorphism of V onto V ∗∗ . 3. S a is a subspace of V ∗ . 4. {0}a = V ∗ ; V a = {0}. 5. S a = (Span{S})a . The following facts hold for finite dimensional vector spaces. 6. If V is nonzero, for each basis B of V , the dual basis exists, is uniquely determined, and is a basis for V ∗ . 7. dim V = dim V ∗ . 8. If V is nonzero, each basis of V ∗ is the dual basis of some basis of V .
Linear Transformations
9. 10. 11. 12. 13. 14. 15. 16. 17.
39
Let B be a basis for the nonzero vector space V . For each v ∈ V , f ∈ V ∗ , f (v) = [ f ]BT ∗ [v]B . If S is a subspace of V , then dim S + dim S a = dim V . If S is a subspace of V , then, by identifying V and V ∗∗ , S = (S a )a . Let S1 , S2 be subspaces of V such that S1a = S2a . Then S1 = S2 . Any subspace of V ∗ is the annihilator of some subspace S of V . Let S1 , S2 be subspaces of V . Then (S1 ∩ S2 )a = S1a + S2a and (S1 + S2 )a = S1a ∩ S2a . ker T T = (range T )a . rank T = rank T T . If B and C are nonempty bases of V and W, respectively, then B∗ [T T ]C ∗ = ( C [T ]B )T .
Examples: 1. Let V = C[a, b] be the vector space of continuous functions ϕ : [a, b] → R, and let c ∈ [a, b]. Then f (ϕ) = ϕ(c ) is a linear functional on V . b 2. Let V = C[a, b], ψ ∈ V , and f (ϕ) = a ϕ(t)ψ(t)dt. Then f is a linear functional. 3. The trace is a linear functional on F n×n . 4. let V = F m×n . B = {E i j : 1 i m, 1 j n} is a basis for V . The dual basis B ∗ consists of the linear functionals f i j , 1 i m, 1 j n, defined by f i j (A) = ai j .
References [Fin60] D.T. Finkbeiner, Introduction to Matrices and Linear Transformations. San Francisco: W.H. Freeman, 1960. [Gan60] F.R. Gantmacher, The Theory of Matrices. New York: Chelsea Publishing, 1960. [Goo03] E.G. Goodaire. Linear Algebra: a Pure and Applied First Course. Upper Saddle River, NJ: Prentice Hall, 2003. [Hoh64] F.E. Hohn, Elementary Matrix Algebra. New York: Macmillan, 1964. [Lan70] S. Lang, Introduction to Linear Algebra. Reading, MA: AddisonWesley, 1970. [Lay03] D.C. Lay, Linear Algebra and Its Applications, 3rd ed. Boston: AddisonWesley, 2003. [Mal63] A.I. Maltsev, Foundations of Linear Algebra. San Francisco: W.H. Freeman, 1963. [Sta69] J.H. Staib, An Introduction to Matrices and Linear Transformations. Reading, MA: AddisonWesley, 1969. [SW68] R.R. Stoll and E.T. Wong, Linear Algebra. New York: Academic Press, 1968.
4 Determinants and Eigenvalues 4.1 Determinants . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.2 Determinants: Advanced Results . . . . . . . . . . . . . . . . . . . . . . 4.3 Eigenvalues and Eigenvectors . . . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Luz M. DeAlba Drake University
4.1
41 43 46 411
Determinants
Definitions: The determinant, det A, of a matrix A = [ai j ] ∈ F n×n is an element in F defined inductively: r det [a] = a. r For i, j ∈ {1, 2, . . . , n}, the i j th minor of A corresponding to a is defined by m = det A({i }, { j }). ij ij r The i j th cofactor of a is c = (−1)i + j m . ij
ij
ij
r det A = n (−1)i + j a m = n a c for i ∈ {1, 2, . . . , n}. ij ij j =1 j =1 i j i j
This method of computing the determinant of a matrix is called Laplace expansion of the determinant by minors along the i th row. The determinant of a linear operator T : V → V on a finite dimensional vector space, V , is defined as det(T ) = det ([T ]B ), where B is a basis for V .
Facts: All matrices are assumed to be in F n×n , unless otherwise stated. All the following facts except those with a specific reference can be found in [Lay03, pp. 185–213] or [Goo03, pp. 167–193]. a a12 = a11 a22 − a12 a21 . 1. det 11 a21 a22 ⎡
2.
3. 4. 5. 6.
⎤
a11 a12 a13 ⎢ ⎥ det A = det⎣a21 a22 a23 ⎦ = a11 a22 a33 + a21 a13 a32 + a31 a12 a23 − a31 a13 a22 − a21 a12 a33 a31 a32 a33 −a11 a32 a23 . The determinant is independent of the row i used to evaluate it. (Expansion of the determinant by minors along the j th column) Let j ∈ {1, 2, . . . , n}. Then det A = in=1 (−1)i + j ai j mi j = in=1 ai j c i j . det In = 1. If A is a triangular matrix, then det A = a11 a22 · · · ann . 41
42
Handbook of Linear Algebra
7. If B is a matrix obtained from A by interchanging two rows (or columns), then det B = − det A. 8. If B is a matrix obtained from A by multiplying one row (or column) by a nonzero constant r , then det B = r det A. 9. If B is a matrix obtained from A by adding to a row (or column) a multiple of another row (or column), then det B = det A. 10. If A, B, and C differ only in the r th row (or column), and the r th row (or column) of C is the sum of the r th rows (or columns) of A and B, then det C = det A + det B. 11. If A is a matrix with a row (or column) of zeros, then det A = 0. 12. If A is a matrix with two identical rows (or columns), then det A = 0. 13. Let B be a row echelon form of A obtained by Gaussian elimination, using k row interchange operations and adding multiples of one row to another (see Algorithm 1 in Section 1.3). Then det A = (−1)k det B = (−1)k b11 b22 · · · bnn . 14. det AT = det A. 15. If A ∈ Cn×n , then det A∗ = det A. 16. det AB = det A det B. 17. If c ∈ F , then det(c A) = c n det A. if and only if det A = 0. 18. A is nonsingular, that is A−1 exists, 19. If A is nonsingular, then det A−1 = det1 A . 20. If S is nonsingular, then det S −1 AS = det A. 21. [HJ85] det A = σ sgnσ a1σ (1) a2σ (2) · · · anσ (n) , where summation is over the n! permutations, σ , of the n indices {1, 2, . . . , n}. The weight “sgnσ ” is 1 when σ is even and −1 when σ is odd. (See Preliminaries for more information on permutations.) 22. If x, y ∈ F n , then det(I + xyT ) = 1 + yT x. 23. [FIS89] Let T be a linear operator on a finite dimensional vector space V . Let B and B be bases for V . Then det(T ) = det ([T ]B ) = det ([T ]B ). 24. [FIS89] Let T be a linear operator on a finite dimensional vector space V . Then T is invertible if and only if det(T ) = 0. 25. [FIS89] Let T be an invertible linear operator on a finite dimensional vector space V . Then 1 . det(T −1 ) = det(T ) 26. [FIS89] Let T and U be linear operators on a finite dimensional vector space V . Then det(TU ) = det(T ) · det(U ). Examples: ⎡
3 −2 ⎢ 1. Let A = ⎣ 2 5 −3 1
2 · det
⎤
4 ⎥ −6⎦. Expanding the determinant of A along the second column: det A = 5
2 −6 3 + 5 · det −3 5 −3 ⎡
−1
3 −2 5 8 −4 0 0 3 1
⎢ ⎢ 2 2. Let A = ⎢ ⎣ 7 ⎡
⎤
4 3 − det 5 2
⎤
4 = 2 · (−8) + 5 · 27 + 26 = 145. −6
4 1⎥ ⎥ ⎥. Expanding the determinant of A along the third row: det A = −6⎦ 5 ⎡
⎤
⎡
3 −2 4 −1 −2 4 −1 ⎢ ⎥ ⎢ ⎥ ⎢ 7 · det ⎣5 8 1⎦ + 4 · det ⎣ 2 8 1⎦ + 6 · det ⎣ 2 3 1 5 0 1 5 0
3. Let T : R2 → R2 defined by T
det
x1 x2
2 −3 = 15. Now let B = 1 6
=
3 5 3
2x1 − 3x2 . With B = x1 + 6x2
1 1 , 1 0
⎤
−2 ⎥ 8⎦ = 557. 1
1 0 , 0 1
. Then det ([T ]B ) = det
7 −8
, then det ([T ]B ) =
1 = 15. 1
43
Determinants and Eigenvalues
Applications: 1. (Cramer’s Rule) If A ∈ F n×n is nonsingular, then the equation Ax = b, where x, b ∈ F n , has the ⎡ ⎤
s1
⎢s ⎥ ⎢ 2⎥ ⎥ unique solution s = ⎢ ⎢ .. ⎥, where s i = ⎣.⎦
det Ai det A
and Ai is the matrix obtained from A by replacing
sn the i th column with b.
⎡
⎤
1 ··· 1 ⎢ x2 · · · xn ⎥ ⎢ ⎥ ⎢ x22 · · · xn2 ⎥ ⎥= 2. [Mey00, p. 486] (Vandermonde Determinant) det ⎢ 1≤i < j ≤n (xi − x j ). ⎢ ⎥ . . .. ⎢ ⎥ . . ⎣ . . ⎦ . x1n−1 x2n−1 · · · xnn−1 3. [FB90, pp. 220–235] (Volume) Let a1 , a2 , . . . , an be linearly independent vectors in Rm . The volume, V , of the ndimensional solid in Rm , defined by S = { in=1 ti ai , 0 ≤ ti ≤ 1, i = 1, 2, . . . , n}, is
1 x1 x12 .. .
given by V = det AT A , where A is the matrix whose i th column is the vector ai . Let m ≥ n and T : Rn → Rm be a linear transformation whose standard matrix representation is the m × n matrix A. Let S be a region in Rn of volume VS . Then the volume of the image of S
under the transformation T is VT (S) = det AT A · VS . 4. [Uhl02, pp. 247–248] (Wronskian) Let f 1 , f 2 , . . . , f n be n − 1 times differentiable functions of the real variable x. The determinant ⎡
f 1 (x) ⎢ f (x) ⎢ 1 W( f 1 , f 2 , . . . , f n )(x) = det ⎢ .. ⎢ ⎣ . (n−1) f1 (x)
f 2 (x) ··· f 2 (x) ··· .. .. . . (n−1) f2 (x) · · ·
f n (x) f n (x) .. . (n−1) fn (x)
⎤ ⎥ ⎥ ⎥ ⎥ ⎦
is called the Wronskian of f 1 , f 2 , . . . , f n . If W( f 1 , f 2 , . . . , f n )(x) = 0 for some x ∈ R, then the functions f 1 , f 2 , . . . , f n are linearly independent.
4.2
Determinants: Advanced Results
Definitions: A principal minor is the determinant of a principal submatrix. (See Section 1.2.) A leading principal minor is the determinant of a leading principal submatrix. The sum of all the k × k principal minors of A is denoted Sk (A).
m n × matrix C k (A) whose entries are the k × k The kth compound matrix of A ∈ F m×n is the k k minors of A, usually in lexicographical order. T The adjugate of A ∈ F n×n is the matrix adj A = c j i = c i j , where c i j is the i j thcofactor.
n n × matrix adj (k) A, whose a j i entry is the cofactor, k k in A, of the (n − k)th minor, of A, in the i j th position of the compound. Let α ⊆ {1, 2, . . . , n} and A ∈ F n×n with A[α] nonsingular. The matrix The kth adjugate of A ∈ F n×n is the
A/A[α] = A[α c ] − A[α c , α]A[α]−1 A[α, α c ] is called the Schur complement of A[α].
44
Handbook of Linear Algebra
Facts: All matrices are assumed to be in F n×n , unless otherwise stated. All the following facts except those with a specific reference can be found in [Lay03, pp. 185–213] or [Goo03, pp. 167–193]. 1. A (adj A) = (adj A) A = (det A) In . 2. det (adj A) = (det A)n−1 . 3. If det A = 0, then adj A is nonsingular, and (adj A)−1 = (det A)−1 A. ⎡
a11 ⎢a ⎢ 21 ⎢a 31 4. [Ait56] (Method of Condensation) Let A = ⎢ ⎢ . ⎢ . ⎣ . an1
a12 a22 a32 .. . an2
a13 a23 a33 .. . an3
⎤
· · · a1n · · · a2n ⎥ ⎥ · · · a3n ⎥ ⎥, and assume without .. ⎥ .. ⎥ . . ⎦ · · · ann
loss of generality that a11 = 0, otherwise a nonzero element can be brought to the (1, 1) position by interchanging two rows, which will change the sign of the determinant. Multiply all the rows of A except the first by a11 . For i = 2, 3, . . . , n, perform the row operations: replace row i with row i −ai 1 · ⎡
a11 ⎢ 0 ⎢ ⎢ 0 n−1 det A = det ⎢ row 1. Thus a11 ⎢ . ⎢ . ⎣ . 0
⎡
a11 ⎢ det a21 ⎢
So, det A =
1 n−2 a11
⎢ ⎢ ⎢ ⎢ det a 11 ⎢ a31 · det ⎢ ⎢ .. ⎢ ⎢ . ⎢ ⎢ ⎢ a11 ⎣
det
an1
a12 a22 a12 a32
a12 an2
a12 a11 a22 − a21 a12 a11 a32 − a31 a12 .. . a11 an2 − an1 a12
a det 11 a21
a13 a23
a11 a31 .. .
a13 a33
a det 11 an1
a12 an3
det
a13 a11 a23 − a21 a13 a11 a33 − a31 a13 .. . a11 an3 − an1 a12
···
a det 11 a21
a1n a2n
a11 a31 .. .
a1n a32
a det 11 an1
a1n ann
··· ..
det
.
···
⎤
··· a1n · · · a11 a2n − a21 a1n ⎥ ⎥ · · · a11 a3n − a31 a1n ⎥ ⎥. ⎥ .. .. ⎥ ⎦ . . · · · a11 ann − an1 a1n
⎤
⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥. ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦
5. [Ait56] A(k) (adj (k) A) = (adj (k) A)A(k) = (det A)I n .
(k) n−1 6. [Ait56] det A = det (Ar ), where r = . k−1
7. [Ait56] det A(n−k) = det(adj (k) A). 8. [HJ85] If A ∈ F n×n , B ∈ F m×m , then det (A B) = (det A)m (det B)n . (See Section 10.5 for the definition of A B.) 9. [Uhl02] For A ∈ F n×n , det A is the unique normalized, alternating, and multilinear function d : F n×n → F . That is, d(In ) = 1, d(A) = −d(A ), where A denotes the matrix obtained from A, by interchanging two rows, and d is linear in each row of A, if the remaining rows of A are held fixed. 10. [HJ85] (Cauchy–Binet) Let A ∈ F n×k , B ∈ F k×n , and C = AB. Then det C [α, β] =
det A[α, γ ] det B[γ , β],
γ
where α ⊆ {1, 2, . . . , m}, β ⊆ {1, 2, . . . , n}, with α = β = r , 1 ≤ r ≤ min{m, k, n}, and the sum is taken over all sets γ ⊆ {1, 2, . . . , k} with γ  = r . 11. [HJ85] (Schur Complement). Let A[α] be nonsingular. Then
det A = det A[α] det A[α c ] − A [α c , α] A[α]−1 A [α, α c ] .
45
Determinants and Eigenvalues
12. [HJ85] (Jacobi’s Theorem) Let A be nonsingular and let α, β ⊆ {1, 2, . . . , n}, with α = β. Then
det A−1 [α c , β c ] = (−1)(
i ∈α
i+
j ∈β
A[β, α] . det A
j ) det
In particular, if α = β. Then det A−1 [α c ] = detdetA[α] . A 13. [HJ85] (Sylvester’s Identity) Let α ⊆ {1, 2, . . . , n} with α = k, and i, j ∈ {1, 2, . . . , n}, with i, j ∈ / α. For A ∈ F n×n , let B = [bi j ] ∈ F (n−k)×(n−k) be defined by bi j = det A [α ∪ {i } , α ∪ { j }]. Then det B = (det A[α])n−k−1 det A. Examples: ⎡
1 ⎢ ⎢0 1. Let A = ⎢ ⎣0 0
1 1 0 −1
⎤
⎡ 0 1 ⎥ 1⎥ ⎢ ⎥. S3 (A) = 23 because det A[{1, 2, 3}] = det⎣0 2⎦ 0 −4
0 0 −3 −2
⎡
1 ⎢ det A[{1, 2, 4}] = det ⎣0 0
⎤
1 1 −1
⎡
⎡
0 1 0 ⎥ ⎢ 1⎦ = −3, det A[{1, 3, 4}] = det⎣0 −3 0 −2 −4 ⎤
1 0 ⎢ det A[{2, 3, 4}] = det ⎣ 0 −3 −1 −2
⎤
1 1 0
0 ⎥ 0⎦ = −3, −3 ⎤
0 ⎥ 2⎦ = 16, and −4
1 ⎥ 2⎦ = 13. From the Laplace expansion on the first column −4
and det A[{2, 3, 4}] = 13, it follows that S4 (A) = det A = 13. Clearly, S1 (A) = tr A = −5. ⎡
1
⎢ ⎢1 2. (kth compound) Let A = ⎢ ⎣1
1 and det (C 2 (A)) = 729.
⎡
−1 ⎢ ⎢ 2 3. (Cauchy–Binet) Let A = ⎢ ⎣ i 0
1 0 1 4
1 1 0 0
⎡
−1 ⎢ 0 1 ⎢ ⎢ 4⎥ ⎥ ⎢ 3 ⎥. Then det A = 9, C 2 (A) = ⎢ ⎢ 1 1⎦ ⎢ ⎣ 4 1 3 ⎤
0 3 −1 0 −1 0 −1 −3 −1 −3 0 0
1 4 −1 0 −4 −3 −1 −4 −4 −16 0 −3
⎤
⎡ ⎤ 3 −1 3 2 −3 0 0 0⎥ ⎢ ⎥ ⎥ 4 3i ⎦, and C = AB. ⎥, B = ⎣0 −4 −4 0⎦ 7 −6i 5 4 1+i 1
Then det C [{2, 4}, {2, 3}] = det A[{2, 4}, {1, 2}] det B[{1, 2}, {2, 3}] + det A[{2, 4}, {1, 3}] det B[{1, 3}, {2, 3}] + det A[{2, 4}, {2, 3}] det B[{2, 3}, {2, 3}] = 12 − 44i .
a 4. (Schur Complement) Let A = b
b∗ , where a ∈ C, b ∈ Cn−1 , and C ∈ C(n−1)×(n−1) . If C is C
nonsingular, then det A = (a − b∗ C −1 b) det C . If a = 0, then det A = a det C − a1 bb∗ . ⎡ ⎤ 1 −2 0 ⎢ ⎥ 5. (Jacobi’s Theorem) Let A = ⎣ 3 4 0⎦ and α = {2} = β. By Jacobi’s formula, det A−1 (2) = −1 0 5 ⎡
det A[2] det A
=
−1
4 50
=
2 . This can be readily verified by computing 25
det A [{1, 3}] =
2 . 25
A−1 =
2 ⎢ 35 ⎢− ⎣ 10 2 25
1 5 1 10 1 25
0
⎤ ⎥
0⎥ ⎦, and verifying 1 5
⎤
3 1⎥ ⎥ 1⎥ ⎥ ⎥, 1⎥ ⎥ 1⎦ 0
46
Handbook of Linear Algebra ⎡
−7 i ⎢ 6. (Sylvester’s Identity) Let A = ⎣ −i −2 −3 1 − 4i
⎤
−3 ⎥ 1 + 4i ⎦ and α = {1}. Define B ∈ C2×2 , with entries 5
b11 = det A[{1, 2}] = 13, b12 = det A[{1, 2}, {1, 3}] = −7 − 31i , b21 = det A[{1, 3}, {1, 2}] = −7 + 31i , b22 = det A[{1, 3}] = −44. Then −1582 = det B = (det A[{1}]) det A = (−7) det A, so det A = 226.
4.3
Eigenvalues and Eigenvectors
Definitions: An element λ ∈ F is an eigenvalue of a matrix A ∈ F n×n if there exists a nonzero vector x ∈ F n such that Ax = λx. The vector x is said to be an eigenvector of A corresponding to the eigenvalue λ. A nonzero row vector y is a left eigenvector of A, corresponding to the eigenvalue λ, if yA = λy. For A ∈ F n×n , the characteristic polynomial of A is given by p A (x) = det(x I − A). The algebraic multiplicity, α(λ), of λ ∈ σ (A) is the number of times the eigenvalue occurs as a root in the characteristic polynomial of A. The spectrum of A ∈ F n×n , σ (A), is the multiset of all eigenvalues of A, with eigenvalue λ appearing α(λ) times in σ (A). The spectral radius of A ∈ Cn×n is ρ(A) = max{λ : λ ∈ σ (A)}. Let p(x) = c n x n + c n−1 x n−1 + · · · + c 2 x 2 + c 1 x + c 0 be a polynomial with coefficients in F . Then p(A) = c n An + c n−1 An−1 + · · · + c 2 A2 + c 1 A + c 0 I . For A ∈ F n×n , the minimal polynomial of A, q A (x), is the unique monic polynomial of least degree for which q A (A) = 0. The vector space ker(A − λI ), for λ ∈ σ (A), is the eigenspace of A ∈ F n×n corresponding to λ, and is denoted by E λ (A). The geometric multiplicity, γ (λ), of an eigenvalue λ is the dimension of the eigenspace E λ (A). An eigenvalue λ is simple if α(λ) = 1. An eigenvalue λ is semisimple if α(λ) = γ (λ). For K = C or any other algebraically closed field, a matrix A ∈ K n×n is nonderogatory if γ (λ) = 1 for all λ ∈ σ (A), otherwise A is derogatory. Over an arbitrary field F , a matrix is nonderogatory (derogatory) if it is nonderogatory (derogatory) over the algebraic closure of F . For K = C or any other algebraically closed field, a matrix A ∈ K n×n is nondefective if every eigenvalue of A is semisimple, otherwise A is defective. Over an arbitrary field F , a matrix is nondefective (defective) if it is nondefective (defective) over the algebraic closure of F . A matrix A ∈ F n×n is diagonalizable if there exists a nonsingular matrix B ∈ F n×n , such that A = B D B −1 for some diagonal matrix D ∈ F n×n . For a monic polynomial p(x) = x n + c n−1 x n−1⎤+ · · · + c 2 x 2 + c 1 x + c 0 with coefficients in F , the ⎡ 0 0 0 · · · 0 −c 0 ⎢1 0 0 · · · 0 −c 1 ⎥ ⎢ ⎥ ⎢0 1 0 · · · 0 −c 2 ⎥ ⎥ is called the companion matrix of p(x). n × n matrix C ( p) = ⎢ ⎢. . . .. ⎥ .. ⎢. . . .. ⎥ ⎣. . . . . . ⎦ 0 0 0 · · · 1 −c n−1 Let T be a linear operator on a finite dimensional vector space, V , over a field F . An element λ ∈ F is an eigenvalue of T if there exists a nonzero vector v ∈ V such that T (v) = λv. The vector v is said to be an eigenvector of T corresponding to the eigenvalue λ. For a linear operator, T , on a finite dimensional vector space, V , with a basis, B, the characteristic polynomial of T is given by p T (x) = det([T ])B . A linear operator T on a finite dimensional vector space, V , is diagonalizable if there exists a basis, B, for V such that [T ]B is diagonalizable.
Determinants and Eigenvalues
47
Facts: These facts are grouped into the following categories: Eigenvalues and Eigenvectors, Diagonalization, Polynomials, Other Facts. All matrices are assumed to be in F n×n unless otherwise stated. All the following facts, except those with a specific reference, can be found in [Mey00, pp. 489–660] or [Lay03, pp. 301–342]. Eigenvalues and Eigenvectors 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14.
15.
16. 17.
18.
λ ∈ σ (A) if and only if p A (λ) = 0. For each eigenvalue λ of a matrix A, 1 ≤ γ (λ) ≤ α(λ). A simple eigenvalue is semisimple. For any F , σ (A) ≤ n. If F = C or any algebraically closed field, then σ (A) = n. If F = C or any algebraically closed field, then det A = in=1 λi , λi ∈ σ (A). n If F = C or any algebraically closed field, then tr A = i =1 λi , λi ∈ σ (A). For A ∈ Cn×n , λ ∈ σ (A) if and only if λ¯ ∈ σ (A∗ ). For A ∈ Rn×n , viewing A ∈ Cn×n , λ ∈ σ (A) if and only if λ¯ ∈ σ (A). If A ∈ Cn×n is Hermitian (e.g., A ∈ Rn×n is symmetric), then A has real eigenvalues and A can be diagonalized. (See also Section 7.2.) A and AT have the same eigenvalues with same algebraic multiplicities. If A = [ai j ] is triangular, then σ (A) = {a11 , a22 , . . . , ann }. If A has all row (column) sums equal to r , then r is an eigenvalue of A. A is singular if and only if det A = 0, if and only if 0 ∈ σ (A). If A is nonsingular and λ is an eigenvalue of A of algebraic multiplicity α(λ), with corresponding eigenvector x, then λ−1 is an eigenvalue of A−1 with algebraic multiplicity α(λ) and corresponding eigenvector x. Let λ1 , λ2 , . . . , λs be distinct eigenvalues of A. For each i = 1, 2, . . . , s let xi 1 , xi 2 , . . . , xir i be linearly independent eigenvectors corresponding to λi . Then the vectors x11 , . . . , x1r 1 , x21 , . . . , x2r 2 , . . . , xs 1 , . . . , xs r s are linearly independent. [FIS89] Let T be a a linear operator on a finite dimensional vector space over a field F , with basis B. Then λ ∈ F is an eigenvalue of T if and only if λ is an eigenvalue of [T ]B . [FIS89] Let λ1 , λ2 , . . . , λs be distinct eigenvalues of the linear operator T , on a finite dimensional space V . For each i = 1, 2, . . . , s let xi 1 , xi 2 , . . . , xir i be linearly independent eigenvectors corresponding to λi . Then the vectors x11 , . . . , x1r 1 , x21 , . . . , x2r 2 , . . . , xs 1 , . . . , xs r s are linearly independent. Let T be linear operator on a finite dimensional vector space V over a field F . Then λ ∈ F is an eigenvalue of T if and only if p T (λ) = 0.
Diagonalization 19. [Lew91, pp. 135–136] Let λ1 , λ2 , . . . , λs be distinct eigenvalues of A. If A ∈ Cn×n , then A is diagonalizable if and only if α(λi ) = γ (λi ) for i = 1, 2, . . . , s . If A ∈ Rn×n , then A is diagonalizable by a nonsingular matrix B ∈ Rn×n if and only if all the eigenvalues of A are real and α(λi ) = γ (λi ) for i = 1, 2, . . . , s . 20. Method for Diagonalization of A over C: This is a theoretical method using exact arithmetic and is undesirable in decimal arithmetic with rounding errors. See Chapter 43 for information on appropriate numerical methods. r Find the eigenvalues of A. r Find a basis x , . . . , x for E (A) for each of the distinct eigenvalues λ , . . . , λ of A. i1 ir i λi 1 k r If r +· · ·+r = n, then let B = [x . . . x . . .x . . .x ]. B is invertible and D = B −1 AB is a 1 k 11 1r 1 k1 kr k
diagonal matrix, whose diagonal entries are the eigenvalues of A, in the order that corresponds to the order of the columns of B. Else A is not diagonalizable. 21. A is diagonalizable if and only if A has n linearly independent eigenvectors.
48
22. 23. 24. 25. 26. 27. 28. 29. 30.
31. 32.
Handbook of Linear Algebra
A is diagonalizable if and only if σ (A) = n and A is nondefective. If A has n distinct eigenvalues, then A is diagonalizable. A is diagonalizable if and only if q A (x) can be factored into distinct linear factors. If A is diagonalizable, then so are AT , Ak , k ∈ N. If A is nonsingular and diagonalizable, then A−1 is diagonalizable. If A is an idempotent, then A is diagonalizable and σ (A) ⊆ {0, 1}. If A is nilpotent, then σ (A) = {0}. If A is nilpotent and is not the zero matrix, then A is not diagonalizable. [FIS89] Let T be a linear operator on a finite dimensional vector space V with a basis B. Then T is diagonalizable if and only if [T ]B is diagonalizable. [FIS89] A linear operator, T , on a finite dimensional vector space V is diagonalizable if and only if there exists a basis B = {v1 , . . . , vn } for V , and scalars λ1 , . . . , λn , such that T (vi ) = λi vi , for 1 ≤ i ≤ n. [FIS89] If a linear operator, T , on a vector space, V , of dimension n, has n distinct eigenvalues, then it is diagonalizable. [FIS89] The characteristic polynomial of a diagonalizable linear operator on a finite dimensional vector space can be factored into linear terms.
Polynomials 33. [HJ85] (Cayley–Hamilton Theorem) Let p A (x) = x n + an−1 x n−1 + · · · + a1 x + a0 be the characteristic polynomial of A. Then p A (A) = An + an−1 An−1 + · · · + a1 A + a0 In = 0. 34. [FIS89] (Cayley–Hamilton Theorem for a Linear Operator) Let p T (x) = x n + an−1 x n−1 + · · · + a1 x + a0 be the characteristic polynomial of a linear operator, T , on a finite dimensional vector space, V . Then p T (T ) = T n + an−1 T n−1 + · · · + a1 T + a0 In = T0 , where T0 is the zero linear operator on V . 35. p AT (x) = p A (x). 36. The minimal polynomial q A (x) of a matrix A is a factor of the characteristic polynomial p A (x) of A. 37. If λ is an eigenvalue of A associated with the eigenvector x, then p(λ) is an eigenvalue of the matrix p(A) associated with the eigenvector x, where p(x) is a polynomial with coefficients in F . 38. If B is nonsingular, p A (x) = p B −1 AB (x), therefore, A and B −1 AB have the same eigenvalues. 39. Let p A (x) = x n + an−1 x n−1 + · · · + a1 x + a0 be the characteristic polynomial of A. If σ (A) = n, then ak = (−1)n−k Sn−k (λ1 , . . . , λn ), k = 0, 1, . . . , n − 1, where Sk (λ1 , . . . , λn ) is the kth symmetric function of the eigenvalues of A. 40. Let p A (x) = x n + an−1 x n−1 + · · · + a1 x + a0 be the characteristic polynomial of A. Then ak = (−1)n−k Sn−k (A), k = 0, 1, . . . , n − 1. 41. If σ (A) = n, then Sk (A) = Sk (λ1 , . . . , λn ). 42. If C ( p) is the companion matrix of the polynomial p(x), then p(x) = pC ( p) (x) = q C ( p) (x). 43. [HJ85, p. 135] If σ (A) = n, A is nonderogatory, and B commutes with A, then there exists a polynomial f (x) of degree less than n such that B = f (A). Other Facts: 44. If A is nonsingular and λ is an eigenvalue of A of algebraic multiplicity α(λ), with corresponding eigenvector x, then det( A)λ−1 is an eigenvalue of adj A with algebraic multiplicity α(λ) and corresponding eigenvector x. 45. [Lew91] If λ ∈ σ (A), then any nonzero column of adj ( A−λI ) is an eigenvector of A corresponding to λ. 46. If AB = B A, then A and B have a common eigenvector. 47. If A ∈ F m×n and B ∈ F n×m , then σ (AB) = σ (B A) except for the zero eigenvalues.
49
Determinants and Eigenvalues
48. If A ∈ F m×m and B ∈ F n×n , λ ∈ σ (A), µ ∈ σ (B), with corresponding eigenvectors u and v, respectively, then λµ ∈ σ (A B), with corresponding eigenvector u v. (See Section 10.5 for the definition of A B.) Examples:
0 −1 1. Let A = . Then, viewing A ∈ Cn×n , σ (A) = {−i, i }. That is, A has no eigenvalues over 1 0 the reals. ⎡
⎤
−3 ⎢ 2. Let A = ⎣ 6 72
7 −1 ⎥ 8 −2⎦. Then p A (x) = (x + 6)(x − 15)2 = q A (x), λ1 = −6, α(λ1 ) = 1, −28 19
γ (λ1 ) = 1, λ2 = 15, α(λ2 ) = 2, γ (λ2 ) = 1. Also, a set of linearly independent eigenvectors is
⎧ ⎡ ⎤ ⎡ ⎤⎫ ⎪ −1 ⎪ ⎨ −1 ⎬ ⎢ ⎥ ⎢ ⎥ ⎣−2⎦ , ⎣ 1⎦ . So, A is not diagonalizable. ⎪ ⎪ ⎩ 4 4 ⎭ ⎡ ⎤
57 ⎢ 3. Let A = ⎣ −14 −140
−21 21 ⎥ 22 −7⎦. Then p A (x) = (x + 6)(x − 15)2 , q A (x) = (x + 6)(x − 15), 70 −55
λ1 = −6, α(λ1 ) = 1, γ (λ1 ) = 1, λ2 = 15, α(λ2 ) = 2, γ (λ2 ) = 2. Also, a set of linearly ⎧ ⎡ ⎤ ⎡ ⎤ ⎡ ⎤⎫ ⎪ 1 −3 ⎪ ⎨ −1 ⎬ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ independent eigenvectors is ⎣ 0⎦ , ⎣2⎦ , ⎣ 1⎦ . So, A is diagonalizable. ⎪ ⎪ ⎩ 2 0 10 ⎭ ⎡ ⎤
−5 + 4i ⎢ 4. Let A = ⎣ 2 + 8i 20 − 4i
1 i ⎥ −4 2i ⎦. Then σ (A) = {−6, −3, 3i }. If B = −4 −i
σ (B) = {−12, −9, −5 + 6i }. ⎡
⎤
⎡
1 9
A2 + 2A − 4I , then
⎤
−2 1 0 −2 1 0 ⎢ ⎥ ⎢ ⎥ 5. Let A = ⎣ 0 −3i 0⎦ and B = ⎣ 3 −1 1⎦. B is nonsingular, so A and B −1 AB = 0 0 1 4 0 1 ⎡
−1 + 3i ⎢ ⎣ 5 + 6i 8 − 12i
1−i −1 − 2i −4 + 4i
6. Let A
=
⎤
i ⎥ 1 + 2i ⎦ have the same eigenvalues, which are given in the diagonal of A. 1 − 4i
2 −1 0 0 3 1
⎡
and B
= ⎡
3 ⎢ ⎣2 1
⎤
0 ⎥ 1⎦. Then AB 0
=
4 −1 , σ (AB) 7 3
=
⎤
6 −3 0 √ √ √ ⎢ ⎥ 1 1 (7 + 3 3i ), (7 − 3 3i ) , B A = 4 1 1⎦, and σ (B A) = 12 (7 + 3 3i ), 12 (7 − 3 3i ), 0 . ⎣ 2 2 2 −1 0 √
⎡
1 ⎢ 7. Let A = ⎣0 0
1 1 0
⎤
⎡
⎤
⎡
⎤
0 −2 7 0 −2 5 0 ⎥ ⎢ ⎥ ⎢ ⎥ 0⎦ and B = ⎣ 0 −2 0⎦. Then AB = B A = ⎣ 0 −2 0⎦. A and B −3i 0 0 i 0 0 3 ⎡ ⎤
1 ⎢ ⎥ share the eigenvector x = ⎣0⎦, corresponding to the eigenvalues λ = 1 of A and µ = −2 of B. 0
410
Handbook of Linear Algebra ⎡
1 ⎢ ⎢0 8. Let A = ⎢ ⎣0 0
1 1 0 −1
0 0 −3 −2
⎤
0 1⎥ ⎥ ⎥. Then p A (x) = x 4 +5x 3 +4x 2 −23x +13. S4 (A), S3 (A), and S1 (A) 2⎦ −4
were computed in Example 1 of Section 4.2, and it is straightforward to verify that S2 (A) = 4. Comparing these values to the characteristic polynomial, S4 (A) = 13 = (−1)4 13, S3 (A) = 23 = (−1)3 (−23), S2 (A) = (−1)2 4, and S1 (A) = (−1)(5). It follows that S4 (λ1 , λ2 , λ3 , λ4 ) = λ1 λ2 λ3 λ4 = 13, S3 (λ1 , λ2 , λ3 , λ4 ) = 23, S2 (λ1 , λ2 , λ3 , λ4 ) = 4, and S1 (λ1 , λ2 , λ3 , λ4 ) = λ1 + λ2 + λ3 + λ4 = −5 (these values can also be verified with a computer algebra system or numerical software). ⎡
⎤
0 0 −2 ⎢ ⎥ 9. Let p(x) = x 3 − 7x 2 − 3x + 2, C = C ( p) = ⎣1 0 3⎦. Then pC (x) = x 3 − 7x 2 − 3x + 2 = 0 1 7 ⎡
⎤
⎡
−2 −14 −104 0 ⎢ ⎥ ⎢ p(x). Also, pC (C ) = −C 3 + 7C 2 + 3C − 2I = − ⎣ 3 19 142⎦ + 7 ⎣0 7 52 383 1 ⎡
0 ⎢ + 3 ⎣1 0
0 0 1
⎤
⎡
−2 1 ⎥ ⎢ 3⎦ − 2 ⎣ 0 7 0
0 1 0
⎤
⎡
0 0 ⎥ ⎢ 0⎦ = ⎣ 0 1 0
0 0 0
⎤
−2 −14 ⎥ 3 19⎦ 7 52
⎤
0 ⎥ 0 ⎦. 0
Applications: 1. (Markov Chains) (See also Chapter 54 for more information.) A Markov Chain describes a process in which a system can be in any one of n states: s 1 , s 2 , . . . , s n . The probability of entering state s i depends only on the state previously occupied by the system. The transition probability of entering state j , given that the system is in state i , is denoted by pi j . The transition matrix is the matrix P = [ pi j ]; its rows have sum 1. A (row or column) vector is a probability vector if its entries are nonnegative and sum to 1. The probabilty row vector π (k) = (π1(k) , π2(k) , . . . πn(k) ), k ≥ 0, is called the state vector of the system at time k if its i th entry is the probability that the system is in state s i at time k. In particular, when k = 0, the state vector is called the initial state vector and its i th entry is the probability that the system begins at state s i . It follows from probability theory that π (k+1) = π (k) P , and thus inductively then P is said⎤to be that π (k) = π (0) P k . If the entries of some power of P are all positive, ⎡ π1 π2 · · · πn ⎢π π · · · π ⎥ 2 n⎥ ⎢ 1 n regular. If P is a regular transition matrix, then as n → ∞, P → ⎢ .. . . .. ⎥ ⎢ .. ⎥. The . ⎣ . . . ⎦ π1 π2 · · · πn row vector π = (π1 , π2 , . . . , πn ) is called the steady state vector, π is a probability vector, and as n → ∞, π (n) → π. The vector π is the unique probability row vector with the property that π P = π. That is, π is the unique probability row vector that is a left eigenvector of P for eigenvalue 1. 2. (Differential Equations) [Mey00, pp. 541–546] Consider the system of linear differential equations ⎧ x1 = a11 x1 + a12 x2 + . . . + a1n xn ⎪ ⎪ ⎪ ⎪ ⎨ x2 = a 21 x1 + a 22 x2 + . . . + a 2n xn .. , where each of the unknowns x1 , x2 , . . . , xn .. .. .. ⎪ ⎪ . . . . ⎪ ⎪ ⎩ xn = an1 x1 + an2 x2 + . . . + ann xn
411
Determinants and Eigenvalues
is a differentiable function of the real variable t. This system of linear differential equations can ⎡
⎤
⎡
⎤
x1 (t) x1 (t) ⎢ x (t) ⎥ ⎢ x (t) ⎥ ⎢ 2 ⎥ ⎢ 2 ⎥ ⎥ ⎢ ⎥ be written in matrix form as x = Ax, where A = [ai j ], x = ⎢ ⎢ .. ⎥, and x = ⎢ .. ⎥. If A ⎣ . ⎦ ⎣ . ⎦ xn (t) xn (t) is diagonalizable, there exists a nonsingular matrix B (the columns of the matrix B are linearly independent eigenvectors of A), such that B −1 AB = D is a diagonal matrix, so x = B D B −1 x, or B −1 x = D B −1 x. Let u = B −1 x. The linear system of differential equations u = Du has solution ⎡
⎤
k1 e λ1 t ⎢ k e λ2 t ⎥ ⎢ 2 ⎥ ⎥ u = ⎢ ⎢ .. ⎥, where λ1 , λ2 , . . . , λn are the eigenvalues of A. It follows that x = Bu. (See also ⎣ . ⎦ kn e λn t Chapter 55.) 3. (Dynamical Systems) [Lay03, pp. 315–316] Consider the dynamical system given by uk+1 = Auk , ⎡
⎤
a1 ⎢a ⎥ ⎢ 2⎥ ⎥ where A = [ai j ], u0 = ⎢ ⎢ .. ⎥. If A is diagonalizable, there exist n linearly independent eigenvectors, ⎣.⎦ an x1 , x2 , . . . , xn , of A. The vector u0 can then be written as a linear combination of the eigenvectors, that is, u0 = c 1 x1 + c 2 x2 + · · · + c n xn . Then u1 = Au0 = A (c 1 x1 + c 2 x2 + · · · + c n xn ) = k+1 k+1 c 1 λ1 x1 + c 2 λ2 x2 + · · · + c n λn xn . Inductively, uk+1 = Auk = c 1 λk+1 1 x1 + c 2 λ2 x2 + · · · + c n λn xn . Thus, the longterm behavior of the dynamical system can be studied using the eigenvalues of the matrix A. (See also Chapter 56.)
References [Ait56] A. C. Aitken. Determinants and Matrices, 9th ed. Oliver and Boyd, Edinburgh, 1956. [FB90] J. B. Fraleigh and R. A. Beauregard. Linear Algebra, 2nd ed. AddisonWesley, Reading, PA, 1990. [FIS89] S. H. Friedberg, A. J. Insel, and L. E. Spence. Linear Algebra, 2nd ed. Prentice Hall, Upper Saddle River, NJ, 1989. [Goo03] E. G. Goodaire. Linear Algebra a Pure and Applied First Course. Prentice Hall, Upper Saddle River, NJ, 2003. [HJ85] R. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985. [Lay03] D. C. Lay. Linear Algebra and Its Applications, 3rd ed. AddisonWesley, Boston, 2003. [Lew91] D. W. Lewis. Matrix Theory. Word Scientific, Singapore, 1991. [Mey00] C. D. Meyer. Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia, 2000. [Uhl02] F. Uhlig. Transform Linear Algebra. Prentice Hall, Upper Saddle River, NJ, 2002.
5 Inner Product Spaces, Orthogonal Projection, Least Squares, and Singular Value Decomposition Inner Product Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Orthogonality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Adjoints of Linear Operators on Inner Product Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.4 Orthogonal Projection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.5 Gram−Schmidt Orthogonalization and QR Factorization. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.6 Singular Value Decomposition . . . . . . . . . . . . . . . . . . . . . . . . 5.7 PseudoInverse . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.8 Least Squares Problems. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.1 5.2 5.3
Lixing Han University of MichiganFlint
Michael Neumann University of Connecticut
5.1
51 53 55 56 58 510 512 514 516
Inner Product Spaces
Definitions: Let V be a vector space over the field F , where F = R or F = C. An inner product on V is a function ·, ·: V × V → F such that for all u, v, w ∈ V and a, b ∈ F , the following hold: r v, v ≥ 0 and v, v = 0 if and only if v = 0. r au + bv, w = au, w + bv, w.
r For F = R: u, v = v, u; For F = C: u, v = v, u (where bar denotes complex conjugation).
A real (or complex) inner product space is a vector space V over R (or C), together with an inner product defined on it. √ In an inner product space V , the norm, or length, of a vector v ∈ V is v = v, v. A vector v ∈ V is a unit vector if v = 1. The angle between two nonzero vectors u and v in a real inner product space is the real number θ, 0 ≤ θ ≤ π, such that u, v = uv cos θ. See the Cauchy–Schwarz inequality (Fact 9 below). Let V be an inner product space. The distance between two vectors u and v is d(u, v) = u − v. 51
52
Handbook of Linear Algebra
A Hermitian matrix A is positive definite if x∗ Ax > 0 for all nonzero x ∈ Cn . (See Chapter 8 for more information on positive definite matrices.) Facts: All the following facts except those with a specific reference can be found in [Rom92, pp. 157–164]. 1. The vector space Rn is an inner product space under the standard inner product, or dot product, defined by u, v = uT v =
n
ui v i .
i =1
This inner product space is often called n–dimensional Euclidean space. 2. The vector space Cn is an inner product space under the standard inner product, defined by u, v = v∗ u =
n
ui v¯ i .
i =1
This inner product space is often called ndimensional unitary space. 3. [HJ85, p. 410] In Rn , a function ·, ·: Rn × Rn → R is an inner product if and only if there exists a real symmetric positive definite matrix G such that u, v = uT G v, for all u, v ∈ Rn . 4. [HJ85, p. 410] In Cn , a function ·, ·: Cn × Cn → C is an inner product if and only if there exists a Hermitian positive definite matrix H such that u, v = v∗ Hu, for all u, v ∈ Cn . 5. Let l 2 be the vector space of all infinite complex sequences v = (v n ) with the property that ∞
v n 2 < ∞. Then l 2 is an inner product space under the inner product
n=1
u, v =
∞
un v¯ n .
n=1
6. The vector space C [a, b] of all continuous realvalued functions on the closed interval [a, b] is an inner product space under the inner product
f, g =
b
f (x)g (x)d x. a
7. If V is an inner product space and u, w = v, w for all w ∈ V , then u = v. 8. The inner product on an inner product space V , when restricted to vectors in a subspace S of V , is an inner product on S. 9. Let V be an inner product space. Then the norm function · on V has the following basic properties for all u, v ∈ V : r v ≥ 0 and v = 0 if and only if v = 0. r av = av, for all a ∈ F . r (The triangle inequality) u + v ≤ u + v with equality if and only if v = au, for some
a ∈ F.
r (The Cauchy–Schwarz inequality) u, v ≤ uv with equality if and only if v = au, for some
a ∈ F.
r u − v ≤ u − v.
53
Inner Product Spaces, Orthogonal Projection, Least Squares r (The parallelogram law) u + v2 + u − v2 = 2u2 + 2v2 . r (Polarization identities)
4u, v =
⎧ ⎨u + v2 − u − v2 , if F = R. ⎩u + v2 − u − v2 + i u + i v2 − i u − i v2 , if F = C.
Examples: 1. Let R4 be the Euclidean space with the inner product u, v = uT v. Let x = [1, 2, 3, 4]T ∈ R4 and y = [3, −1, 0, 2]T ∈ R4 be two vectors. Then √ √ r x, y = 9, x = 30, and y = 14. √ r The distance between x and y is d(x, y) = x − y = 26. 9 r The angle between x and y is θ = arccos √ 9√ = arccos √ ≈ 1.116 radians. 30 14 2 105
2. u, v = u1 v 1 + 2u1 v 2 + 2u2 v 1 + 6u2 v 2 = uT
G=
1 2
2 v is an inner product on R2 , as the matrix 6
1 2 is symmetric positive definite. 2 6
3. Let C [−1, 1] be the vector space with the inner product f, g =
and g (x) = x 2 be two functions in C [−1, 1]. Then f, g =
and g , g =
1 −1
1 −1
1 −1
f (x)g (x)d x and let f (x) = 1
x 2 d x = 2/3, f, f =
1 −1
1d x = 2,
√ x 4 d x = 2/5. The angle between f and g is arccos( 5/3) ≈ 0.730 radians.
4. [Mey00, p. 286] A, B = tr(AB ∗ ) is an inner product on Cm×n .
5.2
Orthogonality
Definitions: Let V be an inner product space. Two vectors u, v ∈ V are orthogonal if u, v = 0, and this is denoted by u ⊥ v. A subset S of an inner product space V is an orthogonal set if u ⊥ v, for all u, v ∈ S such that u = v. A subset S of an inner product space V is an orthonormal set if S is an orthogonal set and each v ∈ S is a unit vector. Two subsets S and W of an inner product space V are orthogonal if u ⊥ v, for all u ∈ S and v ∈ W, and this is denoted by S ⊥ W. The orthogonal complement of a subset S of an inner product space V is S ⊥ = {w ∈ V w, v = 0 for all v ∈ S}. A complete orthonormal set M in an inner product space V is an orthonormal set of vectors in V such that for v ∈ V , v ⊥ M implies that v = 0. An orthogonal basis for an inner product space V is an orthogonal set that is also a basis for V . An orthonormal basis for V is an orthonormal set that is also a basis for V . A matrix U is unitary if U ∗ U = I . A real matrix Q is orthogonal if Q T Q = I .
54
Handbook of Linear Algebra
Facts: 1. [Mey00, p. 298] An orthogonal set of nonzero vectors is linearly independent. An orthonormal set of vectors is linearly independent. 2. [Rom92, p. 164] If S is a subset of an inner product space V , then S ⊥ is a subspace of V . Moreover, if S is a subspace of V , then S ∩ S ⊥ = {0}. 3. [Mey00, p. 409] In an inner product space V , {0}⊥ = V and V ⊥ = {0}. 4. [Rom92, p. 168] If S is a finite dimensional subspace of an inner product space V , then for any v ∈ V, r There are unique vectors s ∈ S and t ∈ S ⊥ such that v = s + t. This implies V = S ⊕ S ⊥ . r There is a unique linear operator P such that P (v) = s.
5. [Mey00, p. 404] If S is a subspace of an n−dimensional inner product space V , then r (S ⊥ )⊥ = S. r dim(S ⊥ ) = n − dim(S).
6. [Rom92, p. 174] If S is a subspace of an infinite dimensional inner product space, then S ⊆ (S ⊥ )⊥ , but the two sets need not be equal. 7. [Rom92, p. 166] An orthonormal basis is a complete orthonormal set. 8. [Rom92, p. 166] In a finitedimensional inner product space, a complete orthonormal set is a basis. 9. [Rom92, p. 165] In an infinitedimensional inner product space, a complete orthonormal set may not be a basis. 10. [Rom92, p. 166] Every finitedimensional inner product space has an orthonormal basis. 11. [Mey00, p. 299] Let B = {u1 , u2 , . . . , un } be an orthonormal basis for V . Every vector v ∈ V can be uniquely expressed as v=
n
v, ui ui .
i =1
The expression on the right is called the Fourier expansion of v with respect to B and the scalars v, ui are called the Fourier coefficients. 12. [Mey00, p. 305] (Pythagorean Theorem) If {vi }ik=1 is an orthogonal set of vectors in V , then ik=1 vi 2 = ik=1 vi 2 . 13. [Rom92, p. 167] (Bessel’s Inequality) If {ui }ik=1 is an orthonormal set of vectors in V , then v2 ≥ ik=1 v, ui 2 . 14. [Mey00, p. 305] (Parseval’s Identity) Let B = {u1 , u2 , . . . , un } be an orthonormal basis for V . Then for each v ∈ V , v2 =
n
v, ui 2 .
i =1 m×n
15. [Mey00, p. 405] Let A ∈ F
, where F = R or C. Then
r ker(A)⊥ = range(A∗ ), range(A)⊥ = ker(A∗ ). r F m = range(A) ⊕ range(A)⊥ = range(A) ⊕ ker(A∗ ). r F n = ker(A) ⊕ ker(A)⊥ = ker(A) ⊕ range(A∗ ).
16. [Mey00, p. 321] (See also Section 7.1.) The following statements for a real matrix Q ∈ Rn×n are equivalent: r Q is orthogonal. r Q has orthonormal columns. r Q has orthonormal rows. r Q Q T = I , where I is the identity matrix of order n. r For all v ∈ Rn , Qv = v.
55
Inner Product Spaces, Orthogonal Projection, Least Squares
17. [Mey00, p. 321] (See also Section 7.1.) The following statements for a complex matrix U ∈ Cn×n are equivalent: r U is unitary. r U has orthonormal columns. r U has orthonormal rows. r U U ∗ = I , where I is the identity matrix of order n. r For all v ∈ Cn , U v = v.
Examples:
1. Let C [−1, 1] be the vector space with the inner product f, g =
and g (x) = x be two functions in C [−1, 1]. Then f, g =
1 −1
1 −1
f (x)g (x)d x and let f (x) = 1
xd x = 0. Thus, f ⊥ g .
2. The standard basis {e1 , e2 , . . . , en } is an orthonormal basis for the unitary space Cn . 3. If {v1 , v2 , · · · , vn } is an orthogonal basis for Cn and S = span {v1 , v2 , · · · , vk } (1 ≤ k ≤ n − 1), then S ⊥ = span {vk+1 , · · · , vn }. They 4. The vectors v1 = [2, 2, 1]T , v2 = [1, −1, 0]T , and v3 = [−1, −1, 4]T are mutually √ orthogonal. √ T T = v /v = [2/3, 2/3, 1/3] , u = v /v = [1/ 2, −1/ 2, 0] , and can be normalized to u√ 1 1 √1 2 2 2 √ u3 = v3 /v3 = [− 2/6, − 2/6, 2 2/3]T . The set B = {u1 , u2 , u3 } forms an orthonormal basis for the Euclidean space R3 . r If v = [v , v , v ]T ∈ R3 , then v = v, u u + v, u u + v, u u , that is, 1 2 3 1 1 2 2 3 3
v=
2v 1 + 2v 2 + v 3 v1 − v2 −v 1 − v 2 + 4v 3 √ u3 . u1 + √ u2 + 3 2 3 2
r The matrix Q = [u , u , u ] ∈ R3×3 is an orthogonal matrix. 1 2 3
5. Let S be the subspace of C3 spanned by the vectors u = [i, 1, 1]T and v = [1, i, 1]T . Then the orthogonal complement of S is S ⊥ = {ww = α[1, 1, −1 + i ]T , where α ∈ C}. 6. Consider the inner product space l 2 from Fact 5 in Section 5.1. Let E = {ei i = 1, 2, . . .}, where ei has a 1 on i th place and 0s elsewhere. It is clear that E is an orthonormal set. If v = (v n ) ⊥ E, then for each n, v n = v, en = 0. This implies v = 0. Therefore, E is a complete orthonormal set. However, E is not a basis for l 2 as S = span{E} = l 2 . Further, S ⊥ = {0}. Thus, (S ⊥ )⊥ = l 2 ⊆ S and l 2 = S ⊕ S ⊥ .
5.3
Adjoints of Linear Operators on Inner Product Spaces
Let V be a finite dimensional (real or complex) inner product space and let T be a linear operator on V . Definitions: A linear operator T ∗ on V is called the adjoint of T if T (u), v = u, T ∗ (v) for all u, v ∈ V . The linear operator T is selfadjoint, or Hermitian, if T = T ∗ ; T is unitary if T ∗ T = I V .
56
Handbook of Linear Algebra
Facts: The following facts can be found in [HK71]. 1. Let f be a linear functional on V . Then there exists a unique v ∈ V such that f (w) = w, v for all w ∈ V . 2. The adjoint T ∗ of T exists and is unique. 3. Let B = (u1 , u2 , . . . , un ) be an ordered, orthonormal basis of V . Let A = [T ]B . Then ai j = T (uj ), ui ,
i, j = 1, 2, . . . , n.
Moreover, [T ∗ ]B = A∗ , the Hermitian adjoint of A. 4. (Properties of the adjoint operator) (a) (T ∗ )∗ = T for every linear operator T on V . (b) (aT )∗ = a¯ T ∗ for every linear operator T on V and every a ∈ F . (c) (T + T1 )∗ = T ∗ + T1 ∗ for every linear operators T, T1 on V . (d) (T T1 )∗ = T1 ∗ T ∗ for every linear operators T, T1 on V . 5. Let B be an ordered orthonormal basis of V and let A = [T ]B . Then (a) T is selfadjoint if and only if A is a Hermitian matrix. (b) T is unitary if and only if A is a unitary matrix. Examples: 1. Consider the space R3 equipped with the standard inner product and let f (w) = 3w 1 − 2w 3 . Then with v = [3, 0, −2]T , f (w) = w, v. ⎡ ⎤ x ⎢ ⎥ 2. Consider the space R3 equipped with the standard inner product. Let v = ⎣ y ⎦ and T (v) = z ⎡
⎤
⎡
2x + y 2 ⎢ ⎥ ⎢ ⎣ y − 3z ⎦. Then [T ] = ⎣0 x+y+z 1
1 1 1
⎤
⎡
0 2 ⎥ ⎢ −3⎦ , so [T ]∗ = ⎣1 1 0
0 1 −3
⎤
⎡
⎤
1 2x + z ⎥ ⎢ ⎥ 1⎦, and T ∗ (v) = ⎣ x + y + z ⎦. 1 −3y + z
3. Consider the space Cn×n equipped with the inner product in Example 4 of section 5.1. Let A, B ∈ Cn×n and let T be the linear operator on Cn×n defined by T (X) = AX + X B, X ∈ Cn×n . Then T ∗ (X) = A∗ X + X B ∗ , X ∈ Cn×n . 4. Let V be an inner product space and let T be a linear operator on V . For a fixed u ∈ V , f (w) = T (w), u is a linear functional. By Fact 1, there is a unique vector v such that f (w) = w, v. Then T ∗ (u) = v.
5.4
Orthogonal Projection
Definitions: Let S be a finitedimensional subspace of an inner product space V . Then according to Fact 4 in Section 5.2, each v ∈ V can be written uniquely as v = s + t, where s ∈ S and t ∈ S ⊥ . The vector s is called the orthogonal projection of v onto S and is often written as Proj S v, where the linear operator Proj S is called the orthogonal projection onto S along S ⊥ . When V = Cn or V = Rn with the standard inner product, the linear operator Proj S is often identified with its standard matrix [Proj S ] and Proj S is used to denote both the operator and the matrix.
Inner Product Spaces, Orthogonal Projection, Least Squares
57
Facts: 1. An orthogonal projection is a projection (as defined in Section 3.6). 2. [Mey00, p. 433] Suppose that P is a projection. The following statements are equivalent: r P is an orthogonal projection. r P∗ = P. r range(P ) ⊥ ker(P ).
3. [Mey00, p. 430] If S is a subspace of a finite dimensional inner product space V , then Proj S ⊥ = I − Proj S . 4. [Mey00, p. 430] Let S be a p–dimensional subspace of the standard inner product space Cn , and let the columns of matrices M ∈ Cn× p and N ∈ Cn×(n− p) be bases for S and S ⊥ , respectively. Then the orthogonal projections onto S and S ⊥ are Proj S = M(M ∗ M)−1 M ∗
and Proj S ⊥ = N(N ∗ N)−1 N ∗ .
If M and N contain orthonormal bases for S and S ⊥ , then Proj S = M M ∗ and Proj S ⊥ = N N ∗ . 5. [Lay03, p. 399] If {u1 , . . . , u p } is an orthonormal basis for a subspace S of Cn , then for any v ∈ Cn , Proj S v = (u∗1 v)u1 + · · · + (u∗p v)u p . 6. [TB97, p. 46] Let v ∈ Cn be a nonzero vector. Then ∗ r Proj = vv is the orthogonal projection onto the line L = span{v}. v ∗
v v
∗
r Proj = I − vv is the orthogonal projection onto L ⊥ . ⊥v v∗ v
7. [Mey00, p. 435] (The Best Approximation Theorem) Let S be a finite dimensional subspace of an inner product space V and let b be a vector in V . Then Proj S b is the unique vector in S that is closest to b in the sense that min b − s = b − Proj S b. s∈S
The vector Proj S b is called the best approximation to b by the elements of S. Examples: 1. Generally, an orthogonal projection P ∈ Cn×n is not a unitary matrix. 2. Let {v1 , v2 , · · · , vn } be an orthogonal basis for Rn and let S the subspace of Rn spanned by {v1 , · · · , vk }, where 1 ≤ k ≤ n − 1. Then w = c 1 v1 + c 2 v2 + · · · + c n vn ∈ Rn can be written as w = s + t, where s = c 1 v1 + · · · + c k vk ∈ S and t = c k+1 vk+1 + · · · + c n vn ∈ S ⊥ . 3. Let u1 = [2/3, 2/3, 1/3]T , u2 = [1/3, −2/3, 2/3]T , and x = [2, 3, 5]T . Then {u1 , u2 } is an orthonormal basis for the subspace S = span {u1 , u2 } of R3 . r The orthogonal projection of x onto S is
Proj S x = u1T xu1 + u2T x u2 = [4, 2, 3]T . r The orthogonal projection of x onto S ⊥ is y = x − Proj x = [−2, 1, 2]T . S r The vector in S that is closest to x is Proj x = [4, 2, 3]T . S
58
Handbook of Linear Algebra r Let M = [u , u ]. Then the orthogonal projection onto S is 1 2
⎡
5 1⎢ Proj S = M M T = ⎣2 9 4
⎤
2 4 ⎥ 8 −2⎦ . −2 5
r The orthogonal projection of any v ∈ R3 onto S can be computed by Proj v = M M T v. In S
particular, M M T x = [4, 2, 3]T .
4. Let w1 = [1, 1, 0]T and w2 = [1, 0, 1]T . Consider the subspace W = span{w1 , w2 } of R3 . Define ⎡
⎤
1 2 ⎥ T 0⎦. Then M M = 1 1
1 ⎢ the matrix M = [w1 , w2 ] = ⎣1 0
1 . 2
r The orthogonal projection onto W is Proj = M(M T M)−1 M T = W
⎡
1 ⎢ ⎣1 0
⎤
1 ⎥ 2 0⎦ 1 1
1 2
−1
1 1
1 0
⎡
2 1⎢ 0 = ⎣1 1 3 1
1 2 −1
⎤
1 ⎥ −1⎦ . 2
r The orthogonal projection of any v ∈ R3 onto W can be computed by Proj v. For v = [1, 2, 3]T , W
ProjW v = ProjW [1, 2, 3]T = [7/3, 2/3, 5/3]T .
5.5
Gram−Schmidt Orthogonalization and QR Factorization
Definitions: Let {a1 , a2 , . . . , an } be a basis for a subspace S of an inner product space V . An orthonormal basis {u1 , u2 , . . . , un } for S can be constructed using the following Gram–Schmidt orthogonalization process: a1 u1 = a1
and uk =
ak − ak −
k−1
i =1 ak , ui ui
k−1
i =1 ak , ui ui
,
for k = 2, . . . , n.
ˆ where Qˆ ∈ Cm×n has A reduced QR factorization of A ∈ Cm×n (m ≥ n) is a factorization A = Qˆ R, n×n is an upper triangular matrix. orthonormal columns and Rˆ ∈ C A QR factorization of A ∈ Cm×n (m ≥ n) is a factorization A = Q R, where Q ∈ Cm×m is a unitary matrix and R ∈ Cm×n is an upper triangular matrix with the last m − n rows of R being zero. Facts: 1. [TB97, p. 51] Each A ∈ Cm×n (m ≥ n) has a full Q R factorization A = Q R. If A ∈ Rm×n , then both Q and R may be taken to be real. ˆ If A ∈ Rm×n , 2. [TB97, p. 52] Each A ∈ Cm×n (m ≥ n) has a reduced Q R factorization A = Qˆ R. then both Qˆ and Rˆ may be taken to be real. ˆ 3. [TB97, p. 52] Each A ∈ Cm×n (m ≥ n) of full rank has a unique reduced Q R factorization A = Qˆ R, where Qˆ ∈ Cm×n and Rˆ ∈ Cn×n with real r ii > 0. 4. [TB97, p. 48] The orthonormal basis {u1 , u2 , . . . , un } generated via the Gram–Schmidt orthogonalization process has the property Span({u1 , u2 , . . . , uk }) = Span({a1 , a2 , . . . , ak }), for k = 1, 2, . . . , n.
Inner Product Spaces, Orthogonal Projection, Least Squares
59
5. [TB97, p. 51] Algorithm 1: Classical Gram–Schmidt Orthogonalization: input: a basis {a1 , a2 , . . . , an } for a subspace S output: an orthonormal basis {u1 , u2 , . . . , un } for S for j = 1 : n u j := a j for i = 1 : j − 1 r i j := a j , ui u j := u j − r i j ui end r j j := u j u j := u j /r j j end
6. [TB97, p. 58] Algorithm 2: Modified Gram–Schmidt Orthogonalization input: a basis {a1 , a2 , . . . , an } for a subspace S output: an orthonormal basis {u1 , u2 , . . . , un } for S wi := ai , i = 1 : n for i = 1 : n r ii := wi ui := wi /r ii for j = i + 1 : n r i j := w j , ui w j := w j − r i j ui end end
7. [Mey00, p. 315] If exact arithmetic is used, then Algorithms 1 and 2 generate the same orthonormal basis {u1 , u2 , . . . , un } and the same r i j , for j ≥ i . 8. [GV96, pp. 230–232] If A = [a1 , a2 , . . . , an ] ∈ Cm×n (m ≥ n) is of full rank n, then the classic ˆ with Qˆ = or modified Gram–Schmidt process leads to a reduced QR factorization A = Qˆ R, [u1 , u2 , . . . , un ] and Rˆ i j = r i j , for j ≥ i , and Rˆ i j = 0, for j < i . 9. [GV96, p. 232] The costs of Algorithm 1 and Algorithm 2 are both 2mn2 flops when applied to compute a reduced QR factorization of a matrix A ∈ Rm×n . 10. [Mey00, p. 317 and p. 349] For the QR factorization, Algorithm 1 and Algorithm 2 are not numerically stable. However, Algorithm 2 often yields better numerical results than Algorithm 1. 11. [Mey00, p. 349] Algorithm 2 is numerically stable when it is used to solve least squares problems. 12. (Numerically stable algorithms for computing the QR factorization using Householder reflections and Givens rotations are given in Chapter 38.) 13. [TB97, p. 54] (See also Chapter 38.) If A = Q R is a QR factorization of the rank n matrix A ∈ Cn×n , then the linear system Ax = b can be solved as follows: r Compute the factorization A = Q R. r Compute the vector c = Q ∗ b. r Solve Rx = c by performing back substitution.
510
Handbook of Linear Algebra
Examples: ⎡
1 ⎢ 1. Consider the matrix A = ⎣2 0
⎤
2 ⎥ 0 ⎦. 2
r A has a (full) QR factorization A = Q R:
⎡
1
2
⎢ ⎢2 ⎣
⎤
⎡
⎥
0⎥ ⎦=
0
√1 5 ⎢ 2 ⎢√ ⎣ 5
2
0
4 √ 3 5 − 3√2 5 √ 5 3
− 23
⎤ ⎡√
⎢ 1⎥ ⎥⎢ 3⎦⎣ 2 3
0
⎤ √2 5 ⎥ √6 ⎥ . 5⎦
0
0
5
r A has a reduced QR factorization A = Q ˆ R: ˆ
⎡
1
2
0
2
⎢ ⎢2 ⎣
⎤
⎡
⎥ 0⎥ ⎦=
⎡
√1 ⎢ 25 ⎢√ ⎣ 5
0
⎤
4 ⎡√ √ 3 5 5 ⎥ 2 ⎣ − 3√5 ⎥ ⎦ 0 √ 5 3
⎤
√2 5⎦ . √6 5
⎤
3 1 −2 ⎢ 1⎥ ⎢3 −4 ⎥ 2. Consider the matrix A = ⎢ ⎥. Using the classic or modified Gram–Schmidt process ⎣3 −4 −1⎦ 3 1 0 gives the following reduced QR factorization: ⎡
⎤
⎡1
2 3 1 −2 1 ⎢ ⎥ ⎢ ⎢ 3 −4 1 ⎢ ⎥ ⎢2 ⎢ ⎥= 1 ⎣3 −4 −1⎦ ⎢ ⎣2 3 1 0 1 2
5.6
1 2 − 12 − 12 1 2
⎤
− 12 ⎡
1⎥ 6 ⎥ 2⎥⎢ 0 1⎥⎣ −2⎦ 0 1 2
⎤
−3 −1 ⎥ 5 −1⎦ . 0 2
Singular Value Decomposition
Definitions: A singular value decomposition (SVD) of a matrix A ∈ Cm×n is a factorization A = U V ∗ , = diag(σ1 , σ2 , . . . , σ p ) ∈ Rm×n , p = min{m, n}, where σ1 ≥ σ2 ≥ . . . ≥ σ p ≥ 0 and both U = [u1 , u2 , . . . , um ] ∈ Cm×m and V = [v1 , v2 , . . . , vn ] ∈ Cn×n are unitary. The diagonal entries of are called the singular values of A. The columns of U are called left singular vectors of A and the columns of V are called right singular vectors of A. Let A ∈ Cm×n with rank r ≤ p = min{m, n}. A reduced singular value decomposition (reduced SVD) of A is a factorization ˆ Vˆ ∗ , ˆ = diag(σ1 , σ2 , . . . , σr ) ∈ Rr ×r , A = Uˆ where σ1 ≥ σ2 ≥ . . . ≥ σr > 0 and the columns of Uˆ = [u1 , u2 , . . . , ur ] ∈ Cm×r and the columns of Vˆ = [v1 , v2 , . . . , vr ] ∈ Cn×r are both orthonormal. (See §8.4 and §3.7 for more information on singular value decomposition.)
Inner Product Spaces, Orthogonal Projection, Least Squares
511
Facts: All the following facts except those with a specific reference can be found in [TB97, pp. 25–37]. 1. Every A ∈ Cm×n has a singular value decomposition A = U V ∗ . If A ∈ Rm×n , then U and V may be taken to be real. 2. The singular values of a matrix are uniquely determined. 3. If A ∈ Cm×n has a singular value decomposition A = U V ∗ , then Av j = σ j u j ,
A∗ u j = σ j v j ,
u∗j Av j = σ j ,
for j = 1, 2, . . . , p = min{m, n}. 4. If U V ∗ is a singular value decomposition of A, then V T U ∗ is a singular value decomposition of A∗ . 5. If A ∈ Cm×n has r nonzero singular values, then r rank(A) = r . r A=
r
σ j u j v∗j .
j =1
r ker(A) = span{v , . . . , v }. r +1 n r range(A) = span{u , . . . , u }. 1
r
6. Any A ∈ Cm×n of rank r ≤ p = min{m, n} has a reduced singular value decomposition, ˆ = diag(σ1 , σ2 , . . . , σr ) ∈ Rr ×r , ˆ Vˆ ∗ , A = Uˆ
7. 8. 9. 10.
where σ1 ≥ σ2 ≥ · · · ≥ σr > 0 and the columns of Uˆ = [u1 , u2 , . . . , ur ] ∈ Cm×r and the columns of Vˆ = [v1 , v2 , . . . , vr ] ∈ Cn×r are both orthonormal. If A ∈ Rm×n , then Uˆ and Vˆ may be taken to be real. If rank(A) = r , then A has r nonzero singular values. The nonzero singular values of A are the square roots of the nonzero eigenvalues of A∗ A or AA∗ . [HJ85, p. 414] If U V ∗ is a singular value decomposition of A, then the columns of V are eigenvectors of A∗ A; the columns of U are eigenvectors of AA∗ . [HJ85, p. 418] Let A ∈ Cm×n and p = min{m, n}. Define
0 G= A∗
A ∈ C(m+n)×(m+n) . 0
If the singular values of A are σ1 , . . . , σ p , then the eigenvalues of G are σ1 , . . . , σ p , −σ1 , . . . , −σ p and additional n − m zeros. 11. If A ∈ Cn×n is Hermitian with eigenvalues λ1 , λ2 , · · · , λn , then the singular values of A are λ1 , λ2 , · · · , λn . 12. For A ∈ Cn×n , det A = σ1 σ2 · · · σn . 13. [Aut15; Sch07] (Eckart–Young Low Rank Approximation Theorem) Let A = U V ∗ be an SVD of A ∈ Cm×n and r = rank(A). For k < r , define Ak = kj =1 σ j u j v∗j . Then r A − A = k 2 r A − A = k F
min A − B2 = σk+1 ;
rank(B)≤k
min
rank(B)≤k
r A − B F = σ j2 , j =k+1
n m mi2j are the 2norm and Frobenius norm of where M2 = max Mx2 and M F = x2 =1
i =1 j =1
matrix M, respectively. (See Chapter 37 for more information on matrix norms.)
512
Handbook of Linear Algebra
Examples: ⎡
⎤
2 1 ⎥ T and B = A = 0⎦ 2 2
1 ⎢ Consider the matrices A = ⎣2 0
5 1. The eigenvalues of A A = 2 T
⎡
3. u1 =
1 3
Av1 =
⎡
and u2 = ⎡
u1 , u2 , and e1 produces u3 =
0 . 2
2 are 9 and 4. So, the singular values of A are 3 and 2. 8
2. Normalized eigenvectors for AT A are v1 = √ ⎤ 5 ⎢ 23 ⎥ ⎢ √ ⎥ ⎣3 5⎦ 4 √ 3 5
2 0
1 2
Av2 =
⎤
√1 5 √2 5
0
and v2 = ⎤
⎢ √2 ⎥ ⎣ 5 ⎦. − √15
√2 5 − √15
.
Application of the Gram–Schmidt process to
2 ⎢ 31 ⎥ ⎢− ⎥ . ⎣ 3⎦ − 23
4. A has the singular value decomposition A = U V T , where ⎡
5 0 1 ⎢ U = √ ⎣2 6 3 5 4 −3
⎡ √ ⎤ 2√5 3 ⎥ ⎢ −√5⎦ , = ⎣0 0 −2 5
⎤
0 1 1 ⎥ 2⎦ , V = √ 5 2 0
2 . −1
ˆ Vˆ T , where 5. A has the reduced singular value decomposition A = Uˆ ⎡
5 1 ⎢ Uˆ = √ ⎣2 3 5 4
⎤
0 3 ⎥ ˆ = 6⎦ , 0 −3
6. B has the singular value decomposition B = U B B VBT , where
1 1 U B = VA = √ 5 2
2 3 , B = −1 0
0 2
1 1 0 , Vˆ = √ 2 5 2
2 . −1
⎡
5 1 ⎢ 0 , VB = U A = √ ⎣2 0 3 5 4
0 6 −3
√ ⎤ 2√5 ⎥ −√5⎦ . −2 5
(U A = U and VA = V for A were given in Example 4.)
5.7
PseudoInverse
Definitions: A Moore–Penrose pseudoinverse of a matrix A ∈ Cm×n is a matrix A† ∈ Cn×m that satisfies the following four Penrose conditions: AA† A = A; A† AA† = A† ; (AA† )∗ = AA† ; (A† A)∗ = A† A. Facts: All the following facts except those with a specific reference can be found in [Gra83, pp. 105–141]. 1. Every A ∈ Cm×n has a unique pseudoinverse A† . If A ∈ Rm×n , then A† is real.
513
Inner Product Spaces, Orthogonal Projection, Least Squares
2. [LH95, p. 38] If A ∈ Cm×n of rank r ≤ min{m, n} has an SVD A = U V ∗ , then its pseudoinverse is A† = V † U ∗ , where † = diag(1/σ1 , . . . , 1/σr , 0, . . . , 0) ∈ Rn×m . 1 † = mn J nm , where 0mn ∈ Cm×n is the all 0s matrix and J mn ∈ Cm×n is the all 1s 3. 0†mn = 0nm and J mn matrix. 4. (A† )∗ = (A∗ )† ; (A† )† = A. 5. If A is a nonsingular square matrix, then A† = A−1 . 6. If U has orthonormal columns or orthonormal rows, then U † = U ∗ . 7. If A = A∗ and A = A2 , then A† = A. 8. A† = A∗ if and only if A∗ A is idempotent. 9. If A = A∗ , then AA† = A† A. 10. If U ∈ Cm×n is of rank n and satisfies U † = U ∗ , then U has orthonormal columns. 11. If U ∈ Cm×m and V ∈ Cn×n are unitary matrices, then (U AV )† = V ∗ A† U ∗ . 12. If A ∈ Cm×n (m ≥ n) has full rank n, then A† = (A∗ A)−1 A∗ . 13. If A ∈ Cm×n (m ≤ n) has full rank m, then A† = A∗ (AA∗ )−1 . 14. Let A ∈ Cm×n . Then
r A† A, AA† , I − A† A, and I − AA† are orthogonal projections. n m r rank(A) = rank(A† ) = rank(AA† ) = rank(A† A). r rank(I − A† A) = n − rank(A). n r rank(I − AA† ) = m − rank(A). m
15. If A = A1 + A2 + · · · + Ak , Ai∗ A j = 0, and Ai A∗j = 0, for all i, j = 1, · · · , k, i = j , then †
†
†
A† = A1 + A2 + · · · + Ak . 16. If A is an m × r matrix of rank r and B is an r × n matrix of rank r , then (AB)† = B † A† . 17. (A∗ A)† = A† (A∗ )† ; (AA∗ )† = (A∗ )† A† . 18. [Gre66] Each one of the following conditions is necessary and sufficient for ( AB)† = B † A† : r range(B B ∗ A∗ ) ⊆ range(A∗ ) and range(A∗ AB) ⊆ range(B). r A† AB B ∗ and A∗ AB B † are both Hermitian matrices. r A† AB B ∗ A∗ = B B ∗ A∗ and B B † A∗ AB = A∗ AB. r A† AB B ∗ A∗ AB B † = B B ∗ A∗ A. r A† AB = B(AB)† AB and B B † A∗ = A∗ AB(AB)† .
19. Let A ∈ Cm×n and b ∈ Cm . Then the system of equations Ax = b is consistent if and only if AA† b = b. Moreover, if Ax = b is consistent, then any solution to the system can be expressed as x = A† b + (In − A† A)y for some y ∈ Cn .
Examples: ⎡
⎤
1 ⎢ 1. The pseudoinverse of the matrix A = ⎣2 0
2 ⎥ 0⎦ is A† = 2
1 18
2 4
8 −2
2. (AB)† = B † A† generally does not hold. For example, if
1 A= 0
0 0
and
1 B= 0
1 , 1
−2 . 5
514
Handbook of Linear Algebra
then
1 (AB) = 0 †
1 0
†
1 1 = 2 1
0 . 0
However,
1 B A = 0 †
5.8
†
0 . 0
Least Squares Problems
Definitions: Given A ∈ F m×n (F = R or C), m ≥ n, and b ∈ F m , the least squares problem is to find an x0 ∈ F n such that b − Ax is minimized: b − Ax0 = minn b − Ax. x∈F
r Such an x is called a solution to the least squares problem or a least squares solution to the linear 0
system Ax = b.
r The vector r = b − Ax ∈ F m is called the residual. r If rank(A) = n, then the least squares problem is called the full rank least squares problem.
r If rank(A) < n, then the least squares problem is called the rank–deficient least squares problem.
The system A∗ Ax = A∗ b is called the normal equation for the least squares problem. (See Chapter 39 for more information on least squares problems.) Facts: 1. [Mey00, p. 439] Let A ∈ F m×n (F = R or C, m ≥ n) and b ∈ F m be given. Then the following statements are equivalent: r x is a solution for the least squares problem. 0 r min b − Ax = b − Ax . 0
x∈F n
r Ax = P b, where P is the orthogonal projection onto range( A). 0 r A∗ r = 0, where r = b − Ax . 0 0 0 r A∗ Ax = A∗ b. 0
r x = A† b + y for some y ∈ ker(A). 0 0 0
2. [LH95, p. 36] If A ∈ F m×n (F = R or C, m ≥ n) and rank(A) = r ≤ n, then x0 = A† b is the unique solution of minimum length for the least squares problem. 3. [TB97, p. 81] If A ∈ F m×n (F = R or C, m ≥ n) has full rank, then x0 = A† b = (A∗ A)−1 A∗ b is the unique solution for the least squares problem. 4. [TB97, p. 83] Algorithm 3: Solving Full Rank Least Squares via QR Factorization input: matrix A ∈ F m×n (F = R or C, m ≥ n) with full rank n and vector b ∈ F m output : solution x0 for minx∈F n b − Ax ˆ compute the reduced QR factorization A = Qˆ R; compute the vector c = Qˆ ∗ b; ˆ 0 = c using back substitution. solve Rx
515
Inner Product Spaces, Orthogonal Projection, Least Squares
5. [TB97, p. 84] Algorithm 4: Solving Full Rank Least Squares via SVD input: matrix A ∈ F m×n (F = R or C, m ≥ n) with full rank n and vector b ∈ F m output : solution x0 for minx∈F n b − Ax ˆ = diag(σ1 , σ2 , · · · , σn ); ˆ Vˆ ∗ with compute the reduced SVD A = Uˆ ∗ ˆ compute the vector c = U b; compute the vector y: yi = c i /σi , i = 1, 2, · · · , n; compute x0 = Vˆ y.
6. [TB97, p. 82] Algorithm 5: Solving Full Rank Least Squares via Normal Equations input: matrix A ∈ F m×n (F = R or C, m ≥ n) with full rank n and vector b ∈ F m output : solution x0 for minx∈F n b − Ax compute the matrix A∗ A and the vector c = A∗ b; solve the system A∗ Ax0 = c via the Cholesky factorization.
Examples: 1. Consider the inconsistent linear system Ax = b, where ⎡
⎤
1 ⎢ A = ⎣2 0
⎡ ⎤
2 1 ⎥ ⎢ ⎥ 0⎦ , b = ⎣ 2⎦ . 2 3
Then the normal equations are given by AT Ax = AT b, where
5 A A= 2 T
2 8
and
A b= T
5 . 8
A least squares solution to the system Ax = b can be obtained via solving the normal equations:
x0 = (A A) T
−1
2/3 A b= A b= . 5/6 †
T
2. We use Algorithm 3 to find a least squares solution of the system Ax = b given in Example 1. The reduced QR factorization A = Qˆ Rˆ found in Example 1 in Section 5.5 gives ⎡
Qˆ T b =
√1 ⎢ 25 ⎢√ ⎣ 5
⎤ ⎡ ⎤
T 4 √ 3 5 ⎥ − 3√2 5 ⎥ √ ⎦ 5 3
√ 1 ⎢ ⎥ ⎢2⎥ = √5 . ⎣ ⎦ 5
⎡
⎤T ⎡ ⎤
3 0 √ √ T ˆ = [ 5, 5] gives the least squares solution x0 = [2/3, 5/6]T . Now solving Rx 3. We use Algorithm 4 to solve the same problem given in Example 1. Using the reduced singular ˆ Vˆ T obtained in Example 5, Section 5.6, we have value decomposition A = Uˆ 5 1 ⎢ c = Uˆ T b = √ ⎣2 3 5 4
7 0 1 √ ⎥ ⎢ ⎥ 6⎦ ⎣2⎦ = 15 . √ 5 −3 3
516
Handbook of Linear Algebra
Now we compute y = [y1 , y2 ]T : 7 y1 = c 1 /σ1 = √ 3 5
and
1 y2 = c 2 /σ2 = √ . 2 5
Finally, the least squares solution is obtained via ⎡
1 1 x0 = Vˆ y = √ ⎣ 5 2
⎤⎡
⎤
7 √ ⎦ ⎣315⎦ √ −1 2 5
2
⎡
=⎣
2/3 5/6
⎤ ⎦.
References [Aut15] L. Auttone. Sur les Matrices Hypohermitiennes et sur les Matrices Unitaires. Ann. Univ. Lyon, Nouvelle S´erie I, Facs. 38:1–77, 1915. [Gra83] F. A. Graybill. Matrices with Applications in Statistics. 2nd ed., Wadsworth Intl. Belmont, CA, 1983. [Gre66] T. N. E. Greville. Notes on the generalized inverse of a matrix product. SIAM Review, 8:518–521, 1966. [GV96] G. H. Golub and C. F. Van Loan. Matrix Computations. 3rd ed., Johns Hopkins University Press, Baltimore, 1996. [Hal58] P. Halmos. FiniteDimensional Vector Spaces. Van Nostrand, New York, 1958. [HK71] K. H. Hoffman and R. Kunze. Linear Algebra. 2nd ed., Prentice Hall, Upper Saddle River, NJ, 1971. [HJ85] R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985. [Lay03] D. Lay. Linear Algebra and Its Applications. 3rd ed., Addison Wesley, Boston, 2003. [LH95] C. L. Lawson and R. J. Hanson. Solving Least Squares Problems. SIAM, Philadelphia, 1995. [Mey00] C. Meyer. Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia, 2000. [Rom92] S. Roman. Advanced Linear Algebra. SpringerVerlag, New York, 1992. [Sch07] E. Schmidt. Zur Theorie der linearen und nichtliniearen Integralgleichungen. Math Annal, 63:433476, 1907. [TB97] L. N. Trefethen and D. Bau. Numerical Linear Algebra. SIAM, Philadelphia, 1997.
Matrices with Special Properties Leslie Hogben . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
6 Canonical Forms
Generalized Eigenvectors • Jordan Canonical Form • RealJordan Canonical Form • Rational Canonical Form: Elementary Divisors • Smith Normal Form on F [x]n×n • Rational Canonical Form: Invariant Factors
Helene Shapiro . . . . . 71
7 Unitary Similarity, Normal Matrices, and Spectral Theory Unitary Similarity
•
Normal Matrices and Spectral Theory
8 Hermitian and Positive Definite Matrices
Wayne Barrett . . . . . . . . . . . . . . . . . . . . . . 81
Hermitian Matrices • Order Properties of Eigenvalues of Hermitian Matrices • Congruence • Positive Definite Matrices • Further Topics in Positive Definite Matrices
9 Nonnegative Matrices and Stochastic Matrices
Uriel G. Rothblum. . . . . . . . . . . . . . 91
Notation, Terminology, and Preliminaries • Irreducible Matrices Matrices • Stochastic and Substochastic Matrices • MMatrices Matrices • Miscellaneous Topics
10 Partitioned Matrices
• •
Reducible Scaling of Nonnegative
Robert Reams . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
Submatrices and Block Matrices • Block Diagonal and Block Triangular Matrices Complements • Kronecker Products
•
Schur
6 Canonical Forms
Leslie Hogben Iowa State University
6.1 Generalized Eigenvectors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.2 Jordan Canonical Form . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.3 RealJordan Canonical Form . . . . . . . . . . . . . . . . . . . . . . . . . 6.4 Rational Canonical Form: Elementary Divisors . . . . . . . . 6.5 Smith Normal Form on F [x]n×n . . . . . . . . . . . . . . . . . . . . . 6.6 Rational Canonical Form: Invariant Factors . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
62 63 66 68 611 612 615
A canonical form of a matrix is a special form with the properties that every matrix is associated to a matrix in that form (the canonical form of the matrix), it is unique or essentially unique (typically up to some type of permutation), and it has a particularly simple form (or a form well suited to a specific purpose). A canonical form partitions the set matrices in F m×n into sets of matrices each having the same canonical form, and that canonical form matrix serves as the representative. The canonical form of a given matrix can provide important information about the matrix. For example, reduced row echelon form (RREF) is a canonical form that is useful in solving systems of linear equations; RREF partitions F m×n into sets of row equivalent matrices. The previous definition of a canonical form is far more general than the canonical forms discussed in this chapter. Here all matrices are square, and every matrix is similar to its canonical form. This chapter discusses the two most important canonical forms for square matrices over fields, the Jordan canonical form (and its real version) and (two versions of) the rational canonical form. These canonical forms capture the eigenstructure of a matrix and play important roles in many areas, for example, in matrix functions, Chapter 11, and in differential equations, Chapter 55. These canonical forms partition F n×n into similarity classes. The Jordan canonical form is most often used when all eigenvalues of the matrix A ∈ F n×n lie in the field F , such as when the field is algebraically closed (e.g., C), or when the field is R; otherwise the rational canonical form is used (e.g., for Q). The Smith normal form is a canonical form for square matrices over principal ideal domains (see Chapter 23); it is discussed here only as it pertains to the computation of the rational canonical form. If any one of these canonical forms is known, it is straightforward to determine the others (perhaps in the algebraic closure of the field F ). Details are given in the sections on rational canonical form. Results about each type of canonical form are presented in the section on that canonical form, which facilitates locating a result, but obscures the connections underlying the derivations of the results. The facts about all of the canonical forms discussed in this section can be derived from results about modules over a principal ideal domain; such a moduletheoretic treatment is typically presented in abstract algebra texts, such as [DF04, Chap. 12].
61
62
Handbook of Linear Algebra
None of the canonical forms discussed in this chapter is a continuous function of the entries of a matrix and, thus, the computation of such a canonical form is inherently unstable in finite precision arithmetic. (For information about perturbation theory of eigenvalues see Chapter 15; for information specifically about numerical computation of the Jordan canonical form, see [GV96, Chapter 7.6.5].)
6.1
Generalized Eigenvectors
The reader is advised to consult Section 4.3 for information about eigenvalues and eigenvectors. In this section and the next, F is taken to be an algebraically closed field to ensure that an n × n matrix has n eigenvalues, but many of the results could be rephrased for a matrix that has all its eigenvalues in F , without the assumption that F is algebraically closed. The real versions of the definitions and results are presented in Section 6.3. Definitions: Let F be an algebraically closed field (e.g., C), let A ∈ F n×n , let µ1 , . . . , µr be the distinct eigenvalues of A, and let λ be any eigenvalue of A. For k a nonnegative integer, the keigenspace of A at λ, denoted Nλk (A), is ker(A − λI )k . The index of A at λ, denoted νλ (A), is the smallest integer k such that Nλk (A) = Nλk+1 (A). When λ and A are clear from the context, νλ (A) will be abbreviated to ν, and νµi (A) to νi . The generalized eigenspace of A at λ is the set Nλν (A), where ν is the index of A at λ. The vector x ∈ F n is a generalized eigenvector of A for λ if x = 0 and x ∈ Nλν (A). Let V be a finite dimensional vector space over F , and let T be a linear operator on V . The definitions of keigenspace of T , index, and generalized eigenspace of T are analogous. Facts: Facts requiring proof for which no specific reference is given can be found in [HJ85, Chapter 3] or [Mey00, Chapter 7.8]. Notation: F is an algebraically closed field, A ∈ F n×n , V is an n dimensional vector space over F , T ∈ L (V, V ), µ1 , . . . , µr are the distinct eigenvalues of A or T , and λ = µi for some i ∈ {1, . . . , r }. 1. An eigenvector for eigenvalue λ is a generalized eigenvector for λ, but the converse is not necessarily true. 2. The eigenspace for λ is the 1eigenspace, i.e., E λ (A) = Nλ1 (A). 3. Every keigenspace is invariant under multiplication by A. 4. The dimension of the generalized eigenspace of A at λ is the algebraic multiplicity of λ, i.e., dim Nµνii (A) = α A (µi ). 5. A is diagonalizable if and only if νi = 1 for i = 1, . . . , r . 6. F n is the vector space direct sum of the generalized eigenspaces, i.e., F n = Nµν11 (A) ⊕ · · · ⊕ Nµνrr (A). This is a special case of the Primary Decomposition Theorem (Fact 12 in Section 6.4). 7. Facts 1 to 6 remain true when the matrix A is replaced by the linear operator T . 8. If Tˆ denotes T restricted to Nµνii (T ), then the characteristic polynomial of Tˆ is p Tˆ (x) = (x−µi )α(µi ) . In particular, Tˆ − µi I is nilpotent.
63
Canonical Forms
Examples: ⎡
⎤
65 18 −21 4 ⎢ 63 −12⎥ ⎢−201 −56 ⎥ 1. Let A = ⎢ ⎥ ∈ C4×4 . p A (x) = x 4 + 8x 3 + 24x 2 + 32x + 16 = (x + 2)4 , 18 −23 4⎦ ⎣ 67 134 36 −42 6 so the only eigenvalue of A is −2 with algebraic multiplicity 4. The reduced row echelon form of ⎡
1 ⎢0 ⎢ A + 2I is ⎢ ⎣0 0
18 67
0 0 0
− 21 67 0 0 0
⎤
⎛⎡
⎤ ⎡
⎤ ⎡
⎤⎞
−18 21 −4 ⎜⎢ ⎥ ⎢ ⎥ ⎢ ⎥⎟ 0⎥ 67 0 0 ⎥⎟ ⎥ ⎜ ⎥ ⎢ ⎥ ⎢ ⎢ 1 (A) = Span ⎜⎢ ⎥, so N−2 ⎥ , ⎢ ⎥ , ⎢ ⎥⎟ . 0⎦ ⎝⎣ 0⎦ ⎣67⎦ ⎣ 0⎦⎠ 0 0 0 67
4 67
2 1 (A + 2I )2 = 0, so N−2 (A) = C4 . Any vector not in N−2 (A), e.g., e1 = [1, 0, 0, 0]T , is a generalized eigenvector for −2 that is not an eigenvector for −2.
6.2
Jordan Canonical Form
The Jordan canonical form is perhaps the single most important and widely used similaritybased canonical form for (square) matrices. Definitions: Let F be an algebraically closed field (e.g., C), and let A ∈ F n×n . (The real versions of the definitions and results are presented in Section 6.3.) For λ ∈ F and positive integer k, the Jordan block of size k with eigenvalue λ is the k × k matrix having every diagonal entry equal to λ, every first superdiagonal entry equal to 1, and every other entry equal to 0, i.e., ⎡
λ 1 ⎢0 λ ⎢ ⎢. . .. J k (λ) = ⎢ ⎢ .. ⎢ ⎣0 · · · 0 ···
0 1 .. . 0 0
··· ..
. λ 0
⎤
0 0⎥ ⎥
⎥ ⎥. ⎥ ⎥ 1⎦
λ
A Jordan matrix (or a matrix in Jordan canonical form) is a block diagonal matrix having Jordan blocks as the diagonal blocks, i.e., a matrix of the form J k1 (λ1 ) ⊕ · · · ⊕ J kt (λt ) for some positive integers t, k1 , . . . , kt and some λ1 , . . . , λt ∈ F . (Note: the λi need not be distinct.) A Jordan canonical form of matrix A, denoted J A or JCF(A), is a Jordan matrix that is similar to A. It is conventional to group the blocks for the same eigenvalue together and to order the Jordan blocks with the same eigenvalue in nonincreasing size order. The Jordan invariants of A are the following parameters: r The set of distinct eigenvalues of A. r For each eigenvalue λ, the number b and sizes p , . . . , p of the Jordan blocks with eigenvalue λ λ 1 bλ
in a Jordan canonical form of A.
The total number of Jordan blocks in a Jordan canonical form of A is bµ , where the sum is taken over all distinct eigenvalues µ. If J A = C −1 AC , then the ordered set of columns of C is called a Jordan basis for A. Let x be an eigenvector for eigenvalue λ of A. If x ∈ range(A − λI )h − range(A − λI )h+1 . Then h is called the depth of x.
64
Handbook of Linear Algebra
Let x be an eigenvector of depth h for eigenvalue λ of A. A Jordan chain above x is a sequence of vectors x0 = x, x1 , . . . , xh satisfying xi = (A − λI )xi +1 for i = 0, . . . , h − 1. Let V be a finite dimensional vector space over F , and let T be a linear operator on V . A Jordan basis for T is an ordered basis B of V , with respect to which the matrix B [T ]B of T is a Jordan matrix. In this case, B [T ]B is a Jordan canonical form of T , denoted JCF(T ) or J T , and the Jordan invariants of T are the Jordan invariants of JCF(T ) =B [T ]B . Facts: Facts requiring proof for which no specific reference is given can be found in [HJ85, Chapter 3] or [Mey00, Chapter 7.8]. Notation: F is an algebraically closed field, A, B ∈ F n×n , and λ is an eigenvalue of A. 1. A has a Jordan canonical form J A , and J A is unique up to permutation of the Jordan blocks. In particular, the Jordan invariants of A are uniquely determined by A. 2. A, B are similar if and only if they have the same Jordan invariants. 3. The Jordan invariants and, hence, the Jordan canonical form of A can be found from the eigenvalues and the ranks of powers of A − λI . Specifically, the number of Jordan blocks of size k in J A with eigenvalue λ is rank(A − λI )k−1 + rank(A − λI )k+1 − 2 rank(A − λI )k . 4. The total number of Jordan blocks in a Jordan canonical form of A is the maximal number of linearly independent eigenvectors of A. 5. The number bλ of Jordan blocks with eigenvalue λ in J A equals the geometric multiplicity γ A (λ) of λ. A is nonderogatory if and only if for each eigenvalue λ of A, J A has exactly one block with λ. 6. The size of the largest Jordan block with eigenvalue λ equals the multiplicity of λ as a root of the minimal polynomial q A (x) of A. 7. The size of the largest Jordan block with eigenvalue λ equals the size of the index νλ (A) of A at λ. 8. The sum of the sizes of all the Jordan blocks with eigenvalue λ in J A (i.e., the number of times λ appears on the diagonal of the Jordan canonical form) equals the algebraic multiplicity α A (λ) of λ. 9. Knowledge of both the characteristic and minimal polynomials suffices to determine the Jordan block sizes for any eigenvalue having algebraic multiplicity at most 3 and, hence, to determine the Jordan canonical form of A if no eigenvalue of A has algebraic multiplicity exceeding 3. This is not necessarily true when the algebraic multiplicity of an eigenvalue is 4 or greater (cf. Example 3 below). 10. Knowledge of the the algebraic multiplicity, geometric multiplicity, and index of an eigenvalue λ suffices to determine the Jordan block sizes for λ if the algebraic multiplicity of λ is at most 6. This is not necessarily true when the algebraic multiplicity of an eigenvalue is 7 or greater (cf. Example 4 below). 11. The following are equivalent: (a) A is similar to a diagonal matrix. (b) The total number of Jordan blocks of A equals n. (c) The size of every Jordan block in a Jordan canonical form J A of A is 1. 12. If A is real, then nonreal eigenvalues of A occur in conjugate pairs; furthermore, if λ is a nonreal eigenvalue, then each size k Jordan block with eigenvalue λ can be paired with a size k Jordan block for λ. 13. If A = A1 ⊕ · · · ⊕ Am , then J A1 ⊕ · · · ⊕ J Am is a Jordan canonical form of A. 14. [Mey00, Chapter 7.8] A Jordan basis and Jordan canonical form of A can be constructed by using Algorithm 1.
65
Canonical Forms
Algorithm 1: Jordan Basis and Jordan Canonical Form Input: A ∈ F n×n , the distinct eigenvalues µ1 , . . . , µr , the indices ν1 , . . . , νr . Output: C ∈ F n×n such that C −1 AC = J A . Initially C has no columns. FOR i = 1, . . . , r % working on eigenvalue µi Step 1: Find a special basis Bµi for E µi (A). (a) Initially Bµi has no vectors. (b) FOR k = νi − 1 down to 0 Extend the set of vectors already found to a basis for range( A − µi I )k ∩ E µi (A). (c) Denote the vectors of Bµi by b j (ordered as found in step (b)). Step 2: For each vector b j found in Step 1, build a Jordan chain above b j . % working on b j FOR j = 1, . . . , dim ker(A − µi I ) (a) Solve (A − µi I )h j u j = b j for u j where h j is the depth of b j . (b) Insert (A − µi I )h j u j , (A − µi I )h j −1 u j , . . . , (A − µi I )u j , u j as the next h + 1 columns of C . 15. A and its transpose AT have the same Jordan canonical form (and are, therefore, similar). 16. For a nilpotent matrix, the list of block sizes determines the Jordan canonical form or, equivalently, determines the similarity class. The number of similarity classes of nilpotent matrices of size n is the number of partitions of n. 17. Let J A be a Jordan matrix, let D be the diagonal matrix having the same diagonal as J A , and let N = J A − D. Then N is nilpotent. 18. A can be expressed as the sum of a diagonalizable matrix A D and a nilpotent matrix A N , where A D and A N are polynomials in A (and A D and A N commute). 19. Let V be an ndimensional vector space over F and T be a linear operator on V . Facts 1, 3 to 10, 16, and 18 remain true when matrix A is replaced by linear operator T ; in particular, JCF(T ) exists and is independent (up to permutation of the diagonal Jordan blocks) of the ordered basis of V used to compute it, and the Jordan invariants of T are independent of basis.
Examples:
1. 2.
3.
4.
⎡
⎤
3 1 0 0 ⎢ ⎥ ⎢ 0 3 1 0⎥ J 4 (3) = ⎢ ⎥. ⎣ 0 0 3 1⎦ 0 0 0 3 Let A be the matrix in Example 1 in Section 6.1. p A (x) = x 4 +8x 3 +24x 2 +32x +16 = (x +2)4 , so the only eigenvalue of A is −2 with algebraic multiplicity 4. From Example 1 in section 6.1, A has 3 linearly independent eigenvectors for eigenvalue −2, so J A has 3 Jordan blocks ⎡ with eigenvalue −2. ⎤ −2 1 0 0 ⎢ 0 0⎥ ⎢ 0 −2 ⎥ In this case, this is enough information to completely determine that J A = ⎢ ⎥. 0 −2 0⎦ ⎣ 0 0 0 0 −2 The Jordan canonical form of A is not necessarily determined by the characteristic and minimal polynmials of A. For example, the Jordan matrices A = J 2 (0)⊕ J 1 (0)⊕ J 1 (0) and B = J 2 (0)⊕ J 2 (0) are not similar to each other, but have p A (x) = p B (x) = x 4 , q A (x) = q B (x) = x 2 . The Jordan canonical form of A is not necessarily determined by the eigenvalues and the algebraic multiplicity, geometric multiplicity, and index of each eigenvalue. For example, the Jordan matrices A = J 3 (0) ⊕ J 3 (0) ⊕ J 1 (0) and B = J 3 (0) ⊕ J 2 (0) ⊕ J 2 (0) are not similar to each other, but have α A (0) = α B (0) = 7, γ A (0) = γ B (0) = 3, ν0 (A) = ν0 (B) = 3 (and p A (x) = p B (x) = x 7 , q A (x) = q B (x) = x 3 ).
66
Handbook of Linear Algebra TABLE 6.1 k= λ=1 λ=2 λ=3
1 11 12 12
rank(A − λI )k 2 10 10 11
3 9 10 10
4 9 10 9
5 9 10 9
5. We use Algorithm 1 to find a matrix C such that C −1 AC = J A for ⎡
⎤
−2 3 0 1 −1 ⎢ 4 0 3 0 −2⎥ ⎢ ⎥ ⎢ ⎥ A = ⎢ 6 −3 3 −1 −1⎥. Computations show that p A (x) = x 5 and kerA = Span(z1 , z2 , z3 ), ⎢ ⎥ ⎣−8 6 −3 2 0⎦ 2 3 3 1 −3 where z1 = [3, 2, −4, 0, 0]T , z2 = [0, 1, 0, −3, 0]T , z3 = [3, 4, 0, 0, 6]T . For Step 1, A3 = 0, and range(A2 ) = Span(b1 ) where b1 = [−1, −1, 0, −1, −2]T . Then B = {b1 , z1 , z2 } is a suitable basis (any 2 of {z1 , z2 , z3 } will work in this case). For Step 2, construct a Jordan chain above b1 by solving A2 u1 = b1 . There are many possible solutions; we choose u1 = [0, 0, 0, 0, 1]T . Then Au1 = [−1, −2, −1, 0, −3]T , ⎡ ⎤ −1 −1 0 3 0 ⎡ ⎤ ⎢−1 −2 0 0 1 0 2 1⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ C = ⎢ 0 −1 0 −4 0⎥ , and J A = ⎣0 0 1⎦ ⊕ [0] ⊕ [0]. ⎢ ⎥ ⎣−1 0 0 0 0 0 0 −3⎦ −2 −3 1 0 0 6. We compute the Jordan canonical form of a 14 × 14 matrix A by the method in Fact 3, where the necessary data about the eigenvalues of A and ranks is given in Table 6.1. λ=1
– The number of blocks of size 1 is 14 + 10 − 2 · 11 = 2. – The number of blocks of size 2 is 11 + 9 − 2 · 10 = 0. – The number of blocks of size 3 is 10 + 9 − 2 · 9 = 1. So ν1 = 3 and b1 = 3.
λ=2
– The number of blocks of size 1 is 14 + 10 − 2 · 12 = 0. – The number of blocks of size 2 is 12 + 10 − 2 · 10 = 2. So, ν2 = 2 and b2 = 2.
λ=3
– The number of blocks of size 1 is 14 + 11 − 2 · 12 = 1. – The number of blocks of size 2 is 12 + 10 − 2 · 11 = 0. – The number of blocks of size 3 is 11 + 9 − 2 · 10 = 0. – The number of blocks of size 4 is 10 + 9 − 2 · 9 = 1. So, ν3 = 4 and b3 = 2.
From this information, J A = J 3 (1) ⊕ J 1 (1) ⊕ J 1 (1) ⊕ J 2 (2) ⊕ J 2 (2) ⊕ J 4 (3) ⊕ J 1 (3).
6.3
RealJordan Canonical Form
The realJordan canonical form is used in applications to differential equations, dynamical systems, and control theory (see Chapter 56). The realJordan canonical form is discussed here only for matrices and with limited discussion of generalized eigenspaces; more generality is possible, and is readily derivable from the corresponding results for the Jordan canonical form.
67
Canonical Forms
Definitions: Let A ∈ Rn×n , α, β, α j , β j ∈ R. The real generalized eigenspace of A at eigenvalue α + βi is
E (A, α + βi ) =
ker((A2 − 2α A + (α 2 + β 2 )I )ν ) if β = 0 Nαν (A) = ker((A − α I )ν ) if β = 0.
The vector x ∈ Rn is a real generalized eigenvector of A for α + βi if x = 0 and x ∈ E (A, α + βi ). block of size 2k with eigenvalue For α, β ∈ R with β = 0, and even positive integer 2k, the realJordan α β α +βi is the 2k ×2k matrix having k copies of M2 (α, β) = on the (block matrix) diagonal, k −1 −β α
1 copies of I2 = 0 else, i.e.,
0 0 on the first (block matrix) superdiagonal, and copies of 02 = 1 0 ⎡
M2 (α, β) ⎢ 0 2 ⎢ ⎢ .. R (α + βi ) = ⎢ J 2k ⎢ . ⎢ ⎣ 02 02
I2 M2 (α, β) .. . ··· ···
02 I2 .. . 02 02
··· ··· M2 (α, β) 02
0 everywhere 0
⎤
02 02 ⎥ ⎥ ⎥ .. ⎥. ⎥ . ⎥ I2 ⎦ M2 (α, β)
A realJordanmatrix (or a matrixinrealJordancanonicalform) is a block diagonal matrix having diagonal blocks that are Jordan blocks or realJordan blocks, i.e., a matrix of the form R (α R J m1 (α1 ) ⊕ · · · ⊕ J mt (αt ) ⊕ J 2k t+1 + βt+1 i ) ⊕ · · · ⊕ J 2ks (αs + βs i ) (or a permutation of the direct t+1 summands). A realJordan canonical form of matrix A, denoted J AR or JCFR (A), is a realJordan matrix that is similar to A. It is conventional to use β j > 0, to group the blocks for the same eigenvalue together, and to order the Jordan blocks with the same eigenvalue in nonincreasing size order. The total number of Jordan blocks in a realJordan canonical form of A is the number of blocks (Jordan or realJordan) in J AR . Facts: Facts requiring proof for which no specific reference is given can be found in [HJ85, Chapter 3]. Notation: A, B ∈ Rn×n , α, β, α j , β j ∈ R. 1. The real generalized eigenspace of a complex number λ = α + βi and its conjugate λ = α − βi are equal, i.e., E (A, α + βi ) = E (A, α − βi ). 2. The realJordan blocks with a nonreal complex number and its conjugate are similar to each other. 3. A has a realJordan canonical form J AR , and J AR is unique up to permutation of the diagonal (real) Jordan blocks. 4. A, B are similar if and only if their realJordan canonical forms have the same set of Jordan and realJordan blocks (although the order may vary). 5. If all the eigenvalues of A are real, then J AR is the same as J A (up to the order of the Jordan blocks). 6. The realJordan canonical form of A can be computed from the Jordan canonical form of A. The nonreal eigenvalues occur in conjugate pairs, and if β > 0, then each size k Jordan block with eigenvalue α + βi can be paired with a size k Jordan block for α − βi . Then J k (α + βi ) ⊕ J k (α − βi ) R (α + βi ). The Jordan blocks of J R with real eigenvalues are the same as the those is replaced by J 2k A of J A . 7. The total number of Jordan and realJordan blocks in a realJordan canonical form of A is the number of Jordan blocks with a real eigenvalue plus half the number of Jordan blocks with a nonreal eigenvalue in a Jordan canonical form of A.
68
Handbook of Linear Algebra
8. If β = 0, the size of the largest realJordan block with eigenvalue α + βi is twice the multiplicity of x 2 − 2αx + (α 2 + β 2 ) as a factor of the minimal polynomial q A (x) of A. 9. If β = 0, the sum of the sizes of all the realJordan blocks with eigenvalue α + βi in J A equals twice the algebraic multiplicity α A (α + βi ). 10. If β = 0, dim E (A, α + βi ) = α A (α + βi ). 11. If A = A1 ⊕ · · · ⊕ Am , then J AR1 ⊕ · · · ⊕ J ARm is a realJordan canonical form of A. Examples: ⎡
−10
⎢ ⎢−17 ⎢ ⎢ 1. Let a = ⎢ −4 ⎢ ⎢−11 ⎣
⎤
6
−4
4
0
10
−4
6
2
−3
−1⎥ ⎥
2
6
−11
6
⎥
⎥ ⎥ 3⎥ ⎦
1⎥. Since the characteristic and minimal polynomials of A are
−4 2 −4 2 2 2 both x 5 − 5x 4 + 12x 3 − 16x 2 + 12x − 4 = (x − 1) x 2 − 2x + 2 , ⎡
J AR
1
⎢ ⎢−1 ⎢ ⎢ =⎢ 0 ⎢ ⎢ 0 ⎣
0
⎤
1
1
0
0
1
0
1
0⎥ ⎥
0
1
1
0
−1
1
⎥ ⎥ 0⎥ ⎦
0
0
0
1
⎥
0 ⎥. ⎡
⎤
0
0
1
0
⎢0 2. The requirement that β = 0 is important. A = ⎢ ⎢ ⎣0
0
0
1⎥
0
0
⎥ ⎥ is not a realJordan matrix; 0⎥ ⎦
0
0
0
0
⎢
⎡
0
⎢ ⎢0 JA = ⎢ ⎢0 ⎣
0
6.4
0
⎤
1
0
0
0
0
0
⎥ 0⎥ ⎥. 1⎥ ⎦
0
0
0
Rational Canonical Form: Elementary Divisors
The elementary divisors rational canonical form is closely related to the Jordan canonical form (see Fact 7 below). A rational canonical form (either the elementary divisors or the invariant factors version, cf. Section 6.6) is used when it is desirable to stay within a field that is not algebraically closed, such as the rational numbers. Definitions: Let F be a field. For a monic polynomial p(x) = x n + c n−1 x n−1 + · · · + c 2 x 2 + c 1 x + c 0 ∈ F [x] (with n ≥ 1), the ⎡ ⎤ 0 0 · · · −c 0 ⎢ ⎢1 ⎢ companion matrix of p(x) is the n × n matrix C ( p) = ⎢ . ⎢. ⎣.
0 ..
.
···
−c 1 .. .
⎥ ⎥ ⎥ ⎥. ⎥ ⎦
0 · · · 1 −c n−1 An elementary divisors rational canonical form matrix (EDRCF matrix) (over F ) is a block diagonal mt 1 matrix of the form C (h m 1 ) ⊕ · · · ⊕ C (h t ) where each h i (x) is a monic polynomial that is irreducible over F .
69
Canonical Forms
mt 1 mi The elementary divisors of the EDRCF matrix C (h m 1 ) ⊕ · · · ⊕ C (h t ) are the polynomials h i (x) , i = 1, . . . t. An elementary divisors rational canonical form of matrix A ∈ F n×n , denoted RCFED (A), is an EDRCF matrix that is similar to A. It is conventional to group the companion matrices associated with powers of the same irreducible polynomial together, and within such a group to order the blocks in size order. The elementary divisors of A are the elementary divisors of RCFED (A). Let V be a finite dimensional vector space over F , and let T be a linear operator on V. An EDRCF basis for T is an ordered basis B of V , with respect to which the matrix B [T ]B of T is an EDRCF matrix. In this case, B [T ]B is an elementary divisors rational canonical form of T , denoted RCFED (T ), and the elementary divisors of T are the elementary divisors of RCFED (T ) =B [T ]B . Let q (x) be a monic polynomial over F . A primary decomposition of a nonconstant monic polynomial q (x) over F is a factorization q (x) = (h 1 (x))m1 · · · (h r (x))mr , where the h i (x), i = 1, . . . , r are distinct monic irreducible polynomials over F . The factors (h i (x))mi in a primary decomposition of q (x) are the primary factors of q (x).
Facts: Facts requiring proof for which no specific reference is given can be found in [HK71, Chapter 7] or [DF04, Chapter 12]. 1. The characteristic and minimal polynomials of the companion matrix C ( p) are both equal to p(x). 2. Whether or not a matrix is an EDRCF matrix depends on polynomial irreducibility, which depends on the field. See Example 1 below. 3. Every matrix A ∈ F n×n is similar to an EDRCF matrix, RCFED (A), and RCFED (A) is unique up to permutation of the companion matrix blocks on the diagonal. In particular, the elementary divisors of A are uniquely determined by A. 4. A, B ∈ F n×n are similar if and only if they have the same elementary divisors. 5. (See Fact 3 in Section 6.2) For A ∈ F n×n , the elementary divisors and, hence, RCFED (A) can be found from the irreducible factors h i (x) of the characteristic polynomial of A and the ranks of powers of h i (A). Specifically, the number of times h i (x)k appears as an elementary divisor of A is 1 (rank(h i (A))k−1 + rank(h i (A))k+1 − 2 rank(h i (A))k ). deg h i (x) 6. If A ∈ F n×n has n eigenvalues in F , then the elementary divisors of A are the polynomials (x − λ)k , where the J k (λ) are the Jordan blocks of J A . 7. There is a natural association between the diagonal blocks in the elementary divisors rational canonical form of A and the Jordan canonical form of A in Fˆ n×n , where Fˆ is the algebraic closure of F . Let h(x)m be an elementary divisor of A, and factor h(x) into monic linear factors over Fˆ , h(x) = (x − λ1 ) · · · (x − λt ). If the roots of h(x) are distinct (e.g., if the characteristic of F is 0 or F is a finite field), then the EDRCF diagonal block C (h m ) is associated with the Jordan blocks J m (λi ), i = 1, . . . , t. If the characteristic of F is p and h(x) has repeated roots, then all roots have the same multiplicity p k (for some positive integer k) and the EDRCF diagonal block C (h m ) is associated with the Jordan blocks J p k m (λi ), i = 1, . . . , t. 8. [HK71, Chapter 4.5] Every monic polynomial q (x) over F has a primary decomposition. The primary decomposition is unique up to the order of the monic irreducible polynomials, i.e., the set of primary factors of q (x) is unique. 9. [HK71, Chapter 6.8] Let q (x) ∈ F [x], let h i (x)mi , i = 1, . . . , r be the primary factors, and define (x) f i (x) = hiq(x) mi . Then there exist polynomials g i (x) such that f 1 (x)g 1 (x) + · · · + f r (x)g r (x) = 1. n×n and let q A (x) = (h 1 (x))m1 · · · (h r (x))mr be a primary decomposition of its minimal Let A ∈ F polynomial. 10. Every primary factor h i (x)mi of q A (x) is an elementary divisor of A. 11. Every elementary divisor of A is of the form (h i (x))m with m ≤ mi for some i ∈ {1, . . . , r }.
610
Handbook of Linear Algebra
12. [HK71, Chapter 6.8] Primary Decomposition Theorem (a) F n = ker(h 1 (A)m1 ) ⊕ · · · ⊕ ker(h r (A)mr ). (b) Let f i and g i be as defined in Fact 9. Then for i = 1, . . . , r , E i = f i (A)g i (A) is the projection onto ker(h i (A)mi ) along ker(h 1 (A)m1 ) ⊕ · · · ⊕ ker(h i −1 (A)mi −1 ) ⊕ ker(h i +1 (A)mi +1 ) ⊕ · · · ⊕ ker(h r (A)mr ). (c) The E i = f i (A)g i (A) are mutually orthogonal idempotents (i.e., E i2 = E i and E i E j = 0 if i = j ) and I = E 1 + · · · + E r . 13. [HK71, Chapter 6.7] If A ∈ F n×n is diagonalizable, then A = µ1 E 1 + · · · + µr E R where the E i are the projections defined in Fact 12 with primary factors h i (x)mi = (x − µi ) of q A (x). Let V be an ndimensional vector space over F , and let T be a linear operator on V . 14. Facts 3, 5 to 7, and 10 to 13 remain true when matrix A is replaced by linear operator T ; in particular, RCFED (T ) exists and is independent (up to permutation of the companion matrix diagonal blocks) of the ordered basis of V used to compute it, and the elementary divisors of T are independent of basis. 15. If Tˆ denotes T restricted to ker(h i (T )mi ), then the minimal polynomial of Tˆ is h i (T )mi . Examples: ⎡
0 ⎢ 1. Let A = [−1] ⊕ [−1] ⊕ ⎣1 0
0 0 1
⎤
−1 0 ⎥ −3⎦ ⊕ 1 −3
⎡
0 ⎢1 2 ⎢ ⊕⎢ 0 ⎣0 0
0 0 1 0
0 0 0 1
⎤
−4 0⎥ ⎥ ⎥. Over Q, A is an EDRCF 4⎦ 0
matrix and its elementary divisors are x + 1, x + 1, (x + 1)3 , x 2 − 2, (x 2 − 2)2 . A is not an EDRCF over C. matrix over C because x 2 ⎡− 2 is not irreducible ⎤ √ √ −1 1 0 √ √ 2 √1 − 2 1 ⎢ ⎥ √ JCF(A)=[−1] ⊕ [−1] ⊕ ⎣ 0 −1 ⊕ [ 2] ⊕ [− 2] ⊕ ⊕ , 1⎦ 0 0 − 2 2 0 0 −1 where the order of the Jordan blocks has been chosen to emphasize the connection to RCFED (A) = A. ⎡ ⎤ −2 2 −2 1 1 ⎢ 6 −2 2 −2 0⎥ ⎢ ⎥ ⎢ ⎥ 2. Let A = ⎢ 0 0 0 0 1⎥ ∈ Q5×5 . We use Fact 5 to determine the elementary divisors ⎢ ⎥ ⎣−12 7 −8 5 4⎦ 0 0 −1 0 2 rational canonical form of A. The following computations can be performed easily over Q in a 73), or computer algebra system such as Mathematica, Maple, or MATLABR (see Chapters 71, 72, on a matrixcapable calculator. p A (x) = x 5 − 3x 4 + x 3 + 5x 2 − 6x + 2 = (x − 1)3 x 2 − 2 . Table 6.2 gives the of ranks h i (A)k where h i (x) is shown in the left column. h(x) = x − 1 The number of times x − 1 appears as an elementary divisor is 5 + 2 − 2 · 3 = 1. The number of (x − 1)2 appears as an elementary divisor is 3 + 2 − 2 · 2 = 1. h(x) = x 2 − 2 The number of times x 2 −2 appears as an elementary divisor is (5+3−2·3)/2 = 1.
0 −1 0 Thus, RCFED (A) = C (x − 1) ⊕ C ((x − 1) ) ⊕ C (x − 2) = [1] ⊕ ⊕ 1 2 1 2
TABLE 6.2
2
rank(h(A)k )
k= h 1 (x) = x − 1 h 2 (x) = x 2 − 2
1 3 3
2 2 3
3 2 3
2 . 0
Canonical Forms
611
3. We find the projections E i , i = 1, 2 in Fact 12 for A in the previous example. From the elementary divisors of A, q A (x) = (x − 1)2 (x 2 − 2). Let h 1 (x) = (x − 1)2 , h 2 (x) = x 2 − 2. Then f 1 (x) = x 2 −2, f 2 (x) = (x −1)2 . Note: normally the f i (x) will not be primary factors; this happens here because there are only two primary factors. If we choose g 1 (x) = −(2x − 1), g 2 (x) = 2x + 3, then 1 = f 1 (x)g 1 (x) + f 2 (x)g 2 (x) (g 1 , g 2 can be found by the Euclidean algorithm). Then ⎡ ⎤ ⎡ ⎤ −2 1 −1 1 0 3 −1 1 −1 0 ⎢ 0 0 ⎢0 0 0 0⎥ 1 0 0 0⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ E 1 = f 1 (A)g 1 (A) = ⎢ 0 0 1 0 0⎥ and E 2 = f 2 (A)g 2 (A) = ⎢0 0 0 0 0 ⎥, ⎢ ⎥ ⎢ ⎥ ⎣−6 3 −2 3 0⎦ ⎣6 −3 2 −2 0⎦ 0 0 0 0 1 0 0 0 0 0 and it is easy to verify that E 12 = E 1 , E 22 = E 2 , E 1 E 2 = E 2 E 1 = 0, and E 1 + E 2 = I .
6.5
Smith Normal Form on F [x]n×n
For a matrix A ∈ F n×n , the Smith normal form of x In − A is an important tool for the computation of the invariant factors rational canonical form of A discussed in Section 6.6. In this section, Smith normal form is discussed only for matrices in F [x]n×n , and the emphasis is on finding the Smith normal form of x In − A, where A ∈ F n×n . Smith normal form is used more generally for matrices over principal ideal domains (see Section 23.2); it is not used extensively as a canonical form within F n×n , since the Smith normal form of a matrix A ∈ F n×n of rank k is Ik ⊕ 0n−k . Definitions: Let F be a field. For M ∈ F [x]n×n , the following operations are the elementary row and column operations on M: (a) Interchange rows i, j , denoted Ri ↔ R j (analogous column operation denoted C i ↔ C j ). (b) Add a p(x) multiple of row j to row i , denoted Ri + p(x)R j → Ri (analogous column operation denoted C i + p(x)C j → C i ). (c) Multiply row i by a nonzero element b of F , denoted b Ri → Ri (analogous column operation denoted bC i → C i ). A Smith normal matrix in F [x]n×n is a diagonal matrix D = diag(1, . . . , 1, a1 (x), . . . , as (x), 0, . . . , 0), where the ai (x) are monic nonconstant polynomials such that ai (x) divides ai +1 (x) for i = 1, . . . , s − 1. The Smith normal form of M ∈ F [x]n×n is the Smith normal matrix obtained from M by elementary row and column operations. For A ∈ F n×n , the monic nonconstant polynomials of the Smith normal form of x In − A are the Smith invariant factors of A. Facts: Facts requiring proof for which no specific reference is given can be found in [HK71, Chapter 7] or [DF04, Chapter 12]. 1. Let M ∈ F [x]n×n . Then M has a unique Smith normal form. 2. Let A ∈ F n×n . There are no zeros on the diagonal of the Smith normal form of x In − A. 3. (Division Property) If a(x), b(x) ∈ F [x] and b(x) = 0, then there exist polynomials q (x), r (x) such that a(x) = q (x)b(x) + r (x) and r (x) = 0 or deg r (x) < deg b(x). 4. The Smith normal form of M = x I − A and, thus, the Smith invariant factors of A can be computed as follows:
612
Handbook of Linear Algebra r For k = 1, . . . , n − 1
– Use elementary row and column operations and the division property of F [x] to place the greatest common divisor of the entries of M[{k, . . . , n}] in the kth diagonal position. – Use elementary row and column operations to create zeros in all nondiagonal positions in row k and column k. r Make the nth diagonal entry monic by multiplying the last column by a nonzero element of
F. This process is illustrated in Example 1 below. Examples: ⎡
⎤
1 1 1 −1 ⎢ ⎥ ⎢0 3 2 −2⎥ 1. Let A = ⎢ ⎥. We use the method in Fact 4 above to find the Smith normal form of ⎣2 0 4 −2⎦ 4 0 6 −3 M = x I − A and invariant factors of A. r k = 1: Use the row and column operations on M (in the order shown):
R1 ↔ R3 , − 12 R1 → R1 , R3 + (1 − x)R1 → R3 , R4 + 4R1 → R4 , C 3 + (−2 + x2 )C 1 → C 3 , C 4 + C 1 → C 4 ⎡
1 ⎢0 ⎢ to obtain M1 = ⎢ ⎣0 0
0 x −3 −1 0
0 −2 x2 − 5x2 + 1 2 2 − 2x
⎤
0 2 ⎥ ⎥ ⎥. x ⎦ x −1
r k = 2: Use the row and column operations on M (in the order shown): 1
R3 ↔ R2 , −1R2 → R2 , R3 + (3 − x)R2 → R3 , C 3 + (1 −
5x 2
+
x2
⎡2
)C 2 → C 3 , C 4 + xC 2 → C 4
1 0 ⎢0 1 ⎢ to obtain M2 = ⎢ ⎣0 0 0 0
x3 2
0 0 2 − 4x + 17x −5 2 2 − 2x
⎤
0 ⎥ 0 ⎥ ⎥. x 2 − 3x + 2⎦ x −1
r k = 3 (and final step): Use the row and column operations on M (in the order shown): 2
R3 ↔ R4 , − 12 R3 → R3 , R4 + C4 +
1 C 2 3
→ C 4 , 4C 4 → C 4
−1 (x 2
− 2)(x − 5)R3 → R4 , ⎡
1 0 ⎢ ⎢0 1 to obtain the Smith normal form of M, M3 = ⎢ ⎣0 0 0 0
0 0 x −1 0
⎤
0 ⎥ 0 ⎥ ⎥. 0 ⎦ 3 2 x − 4x + 5x − 2
The Smith invariant factors of A are x − 1, x 3 − 4x 2 + 5x − 2.
6.6
Rational Canonical Form: Invariant Factors
Like the elementary divisors version, the invariant factors rational canonical form does not require the field to be algebraically closed. It has two other advantages: This canonical form is unique (not just unique up to permutation), and (unlike elementary divisors rational canonical form) whether a matrix is in invariant factors rational canonical form is independent of the field (see Fact 2 below).
Canonical Forms
613
Definitions: Let F be a field. An invariant factors rational canonical form matrix (IFRCF matrix) is a block diagonal matrix of the form C (a1 ) ⊕ · · · ⊕ C (as ), where ai (x) divides ai +1 (x) for i = 1, . . . , s − 1. The invariant factors of the IFRCF matrix C (a1 ) ⊕ · · · ⊕ C (as ) are the polynomials ai (x), i = 1, . . . s . The invariant factors rational canonical form of matrix A ∈ F n×n , denoted RCF I F (A), is the IFRCF matrix that is similar to A. The invariant factors of A are the invariant factors of RCF I F (A). Let V be a finite dimensional vector space over F and let T be a linear operator on V . An IFRCF basis for T is an ordered basis B of V , with respect to which the matrix B [T ]B of T is an IFRCF matrix. In this case, B [T ]B is the invariant factors rational canonical form of T , denoted RCF I F (T ), and the invariant factors of T are the invariant factors of RCF I F (T ) =B [T ]B .
Facts: Facts requiring proof for which no specific reference is given can be found in [HK71, Chapter 7] or [DF04, Chapter 12]. Notation: A ∈ F n×n . 1. Every square matrix A is similar to a unique IFRCF matrix, RCF I F (A). 2. RCF I F (A) is independent of field. That is, if K is an extension field of F and A is considered as an element of K n×n , RCF I F (A) is the same as when A is considered as an element of F n×n . 3. Let B ∈ F n×n . Then A, B are similar if and only if RCF I F (A) = RCF I F (B). 4. The characteristic polynomial is the product of the invariant factors of A, i.e., p A (x) = a1 (x) · · · as (x). 5. The minimal polynomial of A is the invariant factor of highest degree, i.e., q A (x) = as (x). 6. The elementary divisors of A ∈ F n×n are the primary factors (over F ) of the invariant factors of A. 7. The Smith invariant factors of A are the invariant factors of A. 8. [DF04, Chapter 12.2] RCF I F (A) and a nonsingular matrix S ∈ F n×n such that S −1 AS = RCF I F (A) can be computed by Algorithm 2. Algorithm 2: Rational Canonical Form (invariant factors) 1. Compute the Smith normal form D of M = x I − A as in Fact 4 of section 6.5, keeping track of the elementary row operations, in the order performed (column operations need not be recorded). 2. The invariant factors are the nonconstant diagonal elements a1 (x), . . . , as (x) of D. 3. Let d1 , . . . , ds denote the degrees of a1 (x), . . . , as (x). 4. Let G = I . 5. FOR k = 1, . . . , number of row operations performed in step 1 (a) If the kth row operation is Ri ↔ R j , then perform column operation C j ↔ C i on G . (b) If the kth row operation is Ri + p(x)R j → Ri , then perform column operation C j − p(A)C i → C j on G (note index reversal). (c) If the kth row operation is b Ri → Ri , then perform column operation 1 C → C i on G . b i 6. G will have 0s in the first n − s columns; denote the remaining columns of G by g1 , . . . , gs . 7. Initially S has no columns. 8. FOR k = 1, . . . , s (a) Insert gk as the next column of S (working left to right). (b) FOR i = 1, . . . , dk − 1. Insert A times the last column inserted as the next column of S. 9. RCF I F (A) = S −1 AS.
614
Handbook of Linear Algebra
9. Let V be an ndimensional vector space over F , and let T be a linear operator on V . Facts 1, 2, 4 to 6 remain true when matrix A is replaced by linear operator T ; in particular, RCF I F (T ) exists and is unique (independent of the ordered basis of V used to compute it). Examples: 1. We can use the elementary divisors already computed to find the invariant factors and IFRCF of A in Example 2 of Section 6.4. The elementary divisors of A are x − 1, (x − 1)2 , x 2 − 2. We combine these, working down from the highest power of each irreducible polynomial. a2 (x) = (x − 1)2 (x 2 − 2) = x 4 − 2x 3 − x 2 + 4x − 2, a1 (x) = x − 1. Then ⎡ ⎤ 1 0 0 0 0 ⎢0 0 0 0 2 ⎥ ⎢ ⎥ ⎢ ⎥ RCF I F (A) = C (x − 1) ⊕ C (x 4 − 2x 3 − x 2 + 4x − 2) = ⎢0 1 0 0 −4⎥. ⎢ ⎥ ⎣0 0 1 0 1 ⎦ 0 0 0 1 2 2. By Fact 7, for the matrix A in Example 1 in Section 6.5, RCF I F (A) = C (x−1)⊕C (x 3 −4x 2 +5x−2). 3. We can use Algorithm 2 to find a matrix S such that RCF I F (A) = S −1 AS for the matrix A in Example 1. r k = 1: Starting with G = I , perform the column operations (in the order shown): 4
C 1 ↔ C 3 , −2C 1 → C 1 , C 1 − (I4 − A)C 3 → C 1 , C 1 − 4C 4 → C 1 , ⎡
0 ⎢ ⎢0 to obtain G 1 = ⎢ ⎣0 0
0 1 0 0
1 0 0 0
⎤
0 0⎥ ⎥ ⎥. 0⎦ 1
r k = 2: Use column operations on G (in the order shown):
C 3 ↔ C 2 , −1C 2 → C 2 , C 2 − (3I4 − A)C 3 → C 2 , ⎡
0 ⎢ ⎢0 to obtain G = ⎢ ⎣0 0
0 0 0 0
0 1 0 0
⎤
0 0⎥ ⎥ ⎥. 0⎦ 1
r k = 3 (and final step of Fact 4 in Section 6.5):
Use column operations on G (in the order shown): C 3 ↔ C 4 , −2C 3 → C 3 , C 3 + 12 (A − 2I4 )(A − 5I4 )C 4 → C 3 , ⎡
⎤
0 0 − 32 0 ⎢ ⎥ ⎢0 0 −1 1⎥ to obtain G = [g1 , g2 , g3 , g4 ] = ⎢ ⎥. 1 0⎦ ⎣0 0 0 0 0 0 ⎡
−3
⎤
0 1 4 1 3 9⎥ ⎥ ⎥ 0 0 2⎦ 0 0 0 4
⎢ 2 ⎢ −1 2 Then S = [g3 , g4 , Ag4 , A g4 ] = ⎢ ⎣ 1
⎡
and
1
⎢ ⎢0 RCF I F (A) = S −1 AS = ⎢ ⎣0
0
0 0 1 0
0 0 0 1
⎤
0 2⎥ ⎥ ⎥. −5⎦ 4
Acknowledgment The author thanks Jeff Stuart and Wolfgang Kliemann for helpful comments on an earlier version of this chapter.
Canonical Forms
615
References [DF04] D. S. Dummit and R. M. Foote. Abstract Algebra, 3rd ed. John Wiley & Sons, New York, 2004. [GV96] G. H. Golub and C. F. Van Loan. Matrix Computations, 3rd ed. Johns Hopkins University Press, Baltimore, 1996. [HK71] K. H. Hoffman and R. Kunze. Linear Algebra, 2nd ed. Prentice Hall, Upper Saddle River, NJ, 1971. [HJ85] R. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985. [Mey00]C. D. Meyer. Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia, 2000.
7 Unitary Similarity, Normal Matrices, and Spectral Theory Helene Shapiro Swarthmore College
7.1 Unitary Similarity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 7.2 Normal Matrices and Spectral Theory . . . . . . . . . . . . . . . . 75 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79
Unitary transformations preserve the inner product. Hence, they preserve the metric quantities that stem from the inner product, such as length, distance, and angle. While a general similarity preserves the algebraic features of a linear transformation, such as the characteristic and minimal polynomials, the rank, and the Jordan canonical form, unitary similarities also preserve metric features such as the norm, singular values, and the numerical range. Unitary similarities are desirable in computational linear algebra for stability reasons. Normal transformations are those which have an orthogonal basis of eigenvectors and, thus, can be represented by diagonal matrices relative to an orthonormal basis. The class of normal transformations includes Hermitian, skewHermitian, and unitary transformations; studying normal matrices leads to a more unified understanding of all of these special types of transformations. Often, results that are discovered first for Hermitian matrices can be generalized to the class of normal matrices. Since normal matrices are unitarily similar to diagonal matrices, things that are obviously true for diagonal matrices often hold for normal matrices as well; for example, the singular values of a normal matrix are the absolute values of the eigenvalues. Normal matrices have two important properties — diagonalizability and an orthonormal basis of eigenvectors — that tend to make life easier in both theoretical and computational situations.
7.1
Unitary Similarity
In this subsection, all matrices are over the complex numbers and are square. All vector spaces are finite dimensional complex inner product spaces. Definitions: A matrix U is unitary if U ∗ U = I . A matrix Q is orthogonal if Q T Q = I . Note: This extends the definition of orthogonal matrix given earlier in Section 5.2 for real matrices.
71
72
Handbook of Linear Algebra
Matrices A and B are unitarily similar if B = U ∗ AU for some unitary matrix U . The term unitarily equivalent is sometimes used in the literature. The numerical range of A is W(A) = {v∗ Avv∗ v = 1}. n 1/2 2 1/2 = tr (A∗ A) . (See The Frobenius (Eulidean) norm of the matrix A is A F = i, j =1 a i j  Chapter 37 for more information on norms.) The operator norm of the matrix A induced by the vector 2norm ·2 is A2 = max{Avv = 1}; this norm is also called the spectral norm. Facts: Most of the material in this section can be found in one or more of the following: [HJ85, Chap. 2] [Hal87, Chap. 3] [Gan59, Chap. IX] [MM64, I.4, III.5]. Specific references are also given for some facts. 1. A real, orthogonal matrix is unitary. 2. The following are equivalent: r U is unitary. r U is invertible and U −1 = U ∗ . r The columns of U are orthonormal. r The rows of U are orthonormal. r For any vectors x and y, we have U x, U y = x, y. r For any vector x, we have U x = x.
3. If U is unitary, then U ∗ , U T , and U¯ are also unitary. 4. If U is unitary, then every eigenvalue of U has modulus 1 and  det(U ) = 1. Also, U 2 = 1. 5. The product of two unitary matrices is unitary and the product of two orthogonal matrices is orthogonal. 6. The set of n × n unitary matrices, denoted U (n), is a subgroup of G L (n, C), called the unitary group. The subgroup of elements of U (n) with determinant one is the special unitary group, denoted SU (n). Similarly, the set of n × n real orthogonal matrices, denoted O(n), is a subgroup of G L (n, R), called the real, orthogonal group, and the subgroup of real, orthogonal matrices of determinant one is S O(n), the special orthogonal group. 7. Let U be unitary. Then r A = U ∗ AU . F F r A = U ∗ AU . 2 2 r A and U ∗ AU have the same singular values, as well as the same eigenvalues. r W(A) = W(U ∗ AU ).
8. [Sch09] Any square, complex matrix A is unitarily similar to a triangular matrix. If T = U ∗ AU is triangular, then the diagonal entries of T are the eigenvalues of A. The unitary matrix U can be chosen to get the eigenvalues in any desired order along the diagonal of T . Algorithm 1 below gives a method for finding U , assuming that one knows how to find an eigenvalue and eigenvector, e.g., by exact methods for small matrices (Section 4.3), and how to find an orthonormal basis containing the given vector, e.g., by the GramSchmidt process (Section 5.5). This algorithm is designed to illuminate the result, not for computation with large matrices in finite precision arithmetic; for such problems appropriate numerical methods should be used (cf. Section 43.2).
Unitary Similarity, Normal Matrices, and Spectral Theory
73
Algorithm 1: Unitary Triangularization Input: A ∈ Cn×n . Output: unitary U such that U ∗ AU = T is triangular. 1. A1 = A. 2. FOR k = 1, . . . , n − 1 (a) Find an eigenvalue and normalized eigenvector x of the (n + 1 − k) × (n + 1 − k) matrix Ak . (b) Find an orthonormal basis x, y2 , . . . , yn+1−k for Cn+1−k . (c) Uk = [x, y2 , . . . , yn+1−k ]. (U˜ 1 = U1 ). (d) U˜ k = Ik−1 ⊕ Uk ∗ (e) Bk = Uk Ak Uk . (f) Ak+1 = Bk (1), the (n − k) × (n − k) matrix obtained from Bk by deleting the first row and column. 3. U = U˜ 1 U˜ 2 , . . . , U˜ n−1 . 9. (A strictly real version of the Schur unitary triangularization theorem) If A is a real matrix, then there is a real, orthogonal matrix Q such that Q T AQ is block triangular, with the blocks of size 1 × 1 or 2 × 2. Each real eigenvalue of A appears as a 1 × 1 block of Q T AQ and each nonreal pair of complex conjugate eigenvalues corresponds to a 2 × 2 diagonal block of Q T AQ. 10. If F is a commuting family of matrices, then F is simultaneously unitarily triangularizable — i.e., there is a unitary matrix U such that U ∗ AU is triangular for every matrix A in F. This fact has the analogous real form also. 11. [Lit53] [Mit53] [Sha91] Let λ1 , λ2 , · · · , λt be the distinct eigenvalues of A with multiplicities m1 , m2 , · · · , mt . Suppose U ∗ AU is block triangular with diagonal blocks A1 , A2 , ..., At , where Ai is size mi × mi and λi is the only eigenvalue of Ai for each i . Then the Jordan canonical form of A is the direct sum of the Jordan canonical forms of the blocks A1 , A2 , ..., At . Note: This conclusion also holds if the unitary similarity U is replaced by an ordinary similarity. 12. Let λ1 , λ2 , · · · , λn be the eigenvalues of the n × n matrix A and let T = U ∗ AU be triangular. Then A2F = in=1 λi 2 + i < j ti j 2 . Hence, A2F ≥ in=1 λi 2 and equality holds if and only if T is diagonal, or equivalently, if and only if A is normal (see Section 7.2). λ1 r , 13. A 2 × 2 matrix A with eigenvalues λ1 , λ2 is unitarily similar to the triangular matrix 0 λ2
14. 15. 16. 17.
where r = A2F − (λ1 2 + λ2 2 ). Note that r is real and nonnegative. Two 2 × 2 matrices, A and B, are unitarily similar if and only if they have the same eigenvalues and A F = B F . Any square matrix A is unitarily similar to a matrix in which all of the diagonal entries are equal tr (A) . to n [Spe40] Two n × n matrices, A and B, are unitarily equivalent if and only if tr ω(A, A∗ ) = tr ω(B, B ∗ ) for every word ω(s , t) in two noncommuting variables. [Pea62] Two n × n matrices, A and B, are unitarily equivalent if and only if tr ω(A, A∗ ) = tr ω(B, B ∗ ) for every word ω(s , t) in two noncommuting variables of degree at most 2n2 .
Examples:
1 1 1. The matrix √ 2 i 2. The matrix √
1 is unitary but not orthogonal. −i
1 1 1 + 2i 1 + i
1+i is orthogonal but not unitary. −1
74
Handbook of Linear Algebra
3 3. Fact 13 shows that A = 2
1 4 is unitarily similar to A = 2 0
3 r 3 and 4. For any nonzero r , the matrices 0 2 0 ⎡
1 . 1
0 are similar, but not unitarily similar. 2
⎤
−31 21 48 ⎢ ⎥ 5. Let A = ⎣ −4 4 6 ⎦. Apply Algorithm 1 to A: −20 13 31 Step 1. A1 = A. Step 2. For k = 1 : (a) p A1 (x) = x 3 − 4x 2 + 5x − 2 = (x − 2)(x − 1)2 , so the eigenvalues are 1, 1, 2. From the reduced row echelon form of A − I3 , we see that [3, 0, 2]T is an eigenvector for 1 and, thus, x = [ √313 , 0, √213 ]T is a normalized eigenvector. (b) One expects to apply the Gram–Schmidt process to a basis that includes x as the first vector to produce an orthonormal basis. In this example, it is obvious how to find an orthonormal basis for C3 : ⎡ ⎢
√3 13
− √213
0
(c) U1 = ⎢ ⎣ 0
⎥
0 ⎥ ⎦.
1 0
√2 13
⎤
√3 13
(d) unnecessary.
⎡
⎤
√89 13
1
⎢ 4 (e) B1 = U1∗ A1 U1 = ⎣0 0 − √313 √ 4 2 13 . (f) A2 = −1 − √313
68 √ 2 13⎥ ⎦. −1
k = 2 : (a) 1 is still an eigenvalue of A2 . From the reduced row echelon form of A2 − I2 , √ , √361 ]T we see that [−2 13, 3]T is an eigenvector for 1 and, thus, x = [−2 13 61 is a normalized eigenvector. (b) Again, the orthonormal basis is obvious: ⎡
⎢−2
(c) U2 = ⎣ ⎡
√3 61
2
1
⎢
⎢ (d) U˜ 2 = ⎢0 ⎣
0
0
√3 61
1
− √2913
(e) B2 =
−2
√3 13
⎢ ⎢ Step 3. U = U˜ 1 U˜ 2 = ⎢ 0 ⎣
√2 13
⎥ ⎦.
13 61
⎤
⎥ ⎥ ⎥. ⎦ √3 61
2
13 61
.
6 − √793
−2
13 61
0
0 2 (f) unnecessary. ⎡
⎤
√3 61
13 61
13 61
√9 793
− √461 √3 61 √6 61
⎤
⎡ 1 ⎥ ⎢ ⎥ ⎥. T = U ∗ AU = ⎢ ⎣0 ⎦
0
√26 61
1 0
2035 ⎤ √ 793 ⎥ − √2913 ⎥ ⎦.
2
Unitary Similarity, Normal Matrices, and Spectral Theory
75
6. [HJ85, p. 84] Schur’s theorem tells us that every complex, square matrix is unitarily similar to a triangular matrix. However, it is not true that every complex, square matrix is similar to a triangular matrix via a complex, orthogonal similarity. For, suppose A = QT Q T , where Q is complex orthogonal and T is triangular. Let q be the first column of Q. Then q is an eigenvector of
A and qT q = 1. However, the matrix A =
1 i has no such eigenvector; A is nilpotent and i −1
any eigenvector of A is a scalar multiple of
7.2
1 . i
Normal Matrices and Spectral Theory
In this subsection, all matrices are over the complex numbers and are square. All vector spaces are finite dimensional complex inner product spaces. Definitions: The matrix A is normal if AA∗ = A∗ A. The matrix A is Hermitian if A∗ = A. The matrix A is skewHermitian if A∗ = −A. The linear operator, T , on the complex inner product space V is normal if T T ∗ = T ∗ T . Two orthogonal projections, P and Q, are pairwise orthogonal if PQ = QP = 0. (See Section 5.4 for information about orthogonal projection.) The matrices A and B are said to have Property L if their eigenvalues αk , βk , (k = 1, · · · , n) may be ordered in such a way that the eigenvalues of x A + y B are given by xαk + yβk for all complex numbers x and y. Facts: Most of the material in this section can be found in one or more of the following: [HJ85, Chap. 2] [Hal87, Chap. 3] [Gan59, Chap. IX] [MM64, I.4, III.3.5, III.5] [GJSW87]. Specific references are also given for some facts. 1. Diagonal, Hermitian, skewHermitian, and unitary matrices are all normal. Note that real symmetric matrices are Hermitian, real skewsymmetric matrices are skewHermitian, and real, orthogonal matrices are unitary, so all of these matrices are normal. 2. If U is unitary, then A is normal if and only if U ∗ AU is normal. 3. Let T be a linear operator on the complex inner product space V . Let B be an ordered orthonormal basis of V and let A = [T ]B . Then T is normal if and only if A is a normal matrix. 4. (Spectral Theorem) The following three versions are equivalent. r A matrix is normal if and only if it is unitarily similar to a diagonal matrix. (Note: This is sometimes
taken as the definition of normal. See Fact 6 below for a strictly real version.) r The matrix A is normal if and only if there is an orthonormal basis of eigenvectors of A. r Let λ , λ , . . . , λ be the distinct eigenvalues of A with algebraic multiplicities m , m , . . . , m . 1 2 t 1 2 t
Then A is normal if and only if there exist t pairwise orthogonal, orthogonal projections P1 , P2 , . . . , Pt such that it =1 Pi = I , rank(Pi ) = mi , and A = it =1 λi Pi . (Note that the two orthogonal projections P and Q are pairwise orthogonal if and only if range(P ) and range(Q) are orthogonal subspaces.) 5. (Principal Axes Theorem) A real matrix A is symmetric if and only if A = Q D Q T , where Q is a real, orthogonal matrix and D is a real, diagonal matrix. Equivalently, a real matrix A is symmetric
76
Handbook of Linear Algebra
if and only if there is a real, orthonormal basis of eigenvectors of A. Note that the eigenvalues of A appear on the diagonal of D, and the columns of Q are eigenvectors of A. The Principal Axes Theorem follows from the Spectral Theorem, and the fact that all of the eigenvalues of a Hermitian matrix are real. 6. (A strictly real version of the Spectral Theorem) If A is a real, normal matrix, then there is a real, orthogonal matrix Q such that Q T AQ is block diagonal, with the blocks of size 1 × 1 or 2 × 2. Each real eigenvalue of A appears as a 1 × 1 block of Q T AQ and each nonreal pair of complex conjugate eigenvalues corresponds to a 2 × 2 diagonal block of Q T AQ. 7. The following are equivalent. See also Facts 4 and 8. See [GJSW87] and [EI98] for more equivalent conditions. r A is normal. r A∗ can be expressed as a polynomial in A. r For any B, AB = B A implies A∗ B = B A∗ .
r Any eigenvector of A is also an eigenvector of A∗ . r Each invariant subspace of A is also an invariant subspace of A∗ . r For each invariant subspace, V, of A, the orthogonal complement, V ⊥ , is also an invariant subspace
of A. r Ax, Ay = A∗ x, A∗ y for all vectors x and y. r Ax, Ax = A∗ x, A∗ x for every vector x. r Ax = A∗ x for every vector x.
r A∗ = U A for some unitary matrix U . r A2 = n λ 2 , where λ , λ , · · · , λ are the eigenvalues of A. 1 2 n i =1 i F r The singular values of A are λ , λ , · · · , λ , where λ , λ , · · · , λ are the eigenvalues of A. 1 2 n 1 2 n r If A = U P is a polar decomposition of A, then U P = P U. (See Section 8.4.) r A commutes with a normal matrix with distinct eigenvalues. r A commutes with a Hermitian matrix with distinct eigenvalues.
r The Hermitian matrix AA∗ − A∗ A is semidefinite (i.e., it does not have both positive and negative
eigenvalues). A − A∗ A + A∗ and K = . Then H and K are Hermitian and A = H + i K . The matrix 2 2i A is normal if and only if H K = K H. 9. If A is normal, then 8. Let H =
r A is Hermitian if and only if all of the eigenvalues of A are real. r A is skewHermitian if and only if all of the eigenvalues of A are pure imaginary. r A is unitary if and only if all of the eigenvalues of A have modulus 1.
10. The matrix U is unitary if and only if U = exp(i H) where H is Hermitian. 11. If Q is a real matrix with det(Q) = 1, then Q is orthogonal if and only if Q = exp(K ), where K is a real, skewsymmetric matrix. 12. (Cayley’s Formulas/Cayley Transform) If U is unitary and does not have −1 as an eigenvalue, then U = (I + i H)(I − i H)−1 , where H = i (I − U )(I + U )−1 is Hermitian. 13. (Cayley’s Formulas/Cayley Transform, real version) If Q is a real, orthogonal matrix which does not have −1 as an eigenvalue, then Q = (I − K )(I + K )−1 , where K = (I − Q)(I + Q)−1 is a real, skewsymmetric matrix. 14. A triangular matrix is normal if and only if it is diagonal. More generally, if the block triangular
matrix,
B11 0
B12 (where the diagonal blocks, Bii , i = 1, 2, are square), is normal, then B12 = 0. B22
77
Unitary Similarity, Normal Matrices, and Spectral Theory
15. Let A be a normal matrix. Then the diagonal entries of A are the eigenvalues of A if and only if A is diagonal. 16. If A and B are normal and commute, then AB is normal. However, the product of two noncommuting normal matrices need not be normal. (See Example 3 below.) 17. If A is normal, then ρ(A) = A2 . Consequently, if A is normal, then ρ(A) ≥ ai j  for all i and j . The converses of both of these facts are false (see Example 4 below). 18. [MM64, p. 168] [MM55] [ST80] If A is normal, then W(A) is the convex hull of the eigenvalues of A. The converse of this statement holds when n ≤ 4, but not for n ≥ 5. 19. [WW49] [MM64, page 162] Let A be a normal matrix and suppose x is a vector such that ( Ax)i = 0 (Ax) j whenever xi = 0. For each nonzero component, x j , of x, define µ j = . Note that µ j is a xj complex number, which we regard as a point in the plane. Then any closed disk that contains all of the points µ j must contain an eigenvalue of A. 20. [HW53] Let A and B be normal matrices with eigenvalues α1 , · · · , αn and β1 , · · · , βn . Then min σ ∈Sn
n
i =1
αi − βσ (i ) 2 ≤ A − B2F ≤ max σ ∈Sn
n
αi − βσ (i ) 2 ,
i =1
where the minimum and maximum are over all permutations σ in the symmetric group Sn (i.e., the group of all permutations of 1, . . . , n). 21. [Sun82] [Bha82] Let A and B be n×n normal matrices with eigenvalues α1 , · · · , αn and β1 , · · · , βn . Let A , B be the diagonal matrices with diagonal entries α1 , · · · , αn and β1 , · · · , βn , respectively. Let · be any unitarily invariant norm. Then, if A − B is normal, we have min A − P −1 B P ≤ A − B ≤ max A − P −1 B P , P
P
where the maximum and minimum are over all n × n permutation matrices P . Observe that if A and B are Hermitian, then A − B is also Hermitian and, hence, normal, so this inequality holds for all pairs of Hermitian matrices. However, Example 6 gives a pair of 2 × 2 normal matrices (with A − B not normal) for which the inequality does not hold. Note that for the Frobenius norm, we get the Hoffman–Wielandt inequality (20), which does hold for all pairs of normal matrices. For the operator norm, · 2 , this gives the inequality min max α j − βσ ( j )  ≤ A − B2 ≤ max max α j − βσ ( j )  σ ∈Sn
j
σ ∈Sn
j
(assuming A − B is normal), which, for the case of Hermitian A and B, is a classical result of Weyl [Wey12]. 22. [OS90][BEK97][BDM83][BDK89][Hol92][AN86] Let A and B be normal matrices with eigen√ values α1 , · · · , αn and β1 , · · · , βn , respectively. Using A2 ≤ A F ≤ nA2 together with the Hoffman–Wielandt inequality (20) yields √ 1 √ min max α j − βσ ( j )  ≤ A − B2 ≤ n max max α j − βσ ( j ) . σ ∈Sn j n σ ∈Sn j √ √ On the righthand side, the factor n may be replaced by 2 and it is known that this constant is 1 1 , but the best possible. On the lefthand side, the factor √ may be replaced by the constant 2.91 n the best possible value for this constant is still unknown. Thus, we have √ 1 min max α j − βσ ( j )  ≤ A − B2 ≤ 2 max max α j − βσ ( j ) . σ ∈Sn j 2.91 σ ∈Sn j See also [Bha82], [Bha87], [BH85], [Sun82], [Sund82].
78
Handbook of Linear Algebra
23. If A and B are normal matrices, then AB = B A if and only if A and B have Property L. This was established for Hermitian matrices by Motzkin and Taussky [MT52] and then generalized to the normal case by Wiegmann [Wieg53]. For a stronger generalization see [Wiel53]. n(n + 1) complex numbers. Then there 24. [Fri02] Let ai j , i = 1, . . . , n, j = 1, . . . , n, be any set of 2 exists an n × n normal matrix, N, such that ni j = ai j for i ≤ j . Thus, any upper triangular matrix A can be completed to a normal matrix. 25. [Bha87, p. 54] Let A be a normal n × n matrix and let B be an arbitrary n × n matrix such that A − B2 < . Then every eigenvalue of B is within distance of an eigenvalue of A. Example 7 below shows that this need not hold for an arbitrary pair of matrices. 26. There are various ways to measure the “nonnormality” of a matrix. For example, if A has eigen
values λ1 , λ2 , . . . , λn , the quantity A2F − in=1 λi 2 is a natural measure of nonnormality, as is A∗ A − AA∗ 2 . One could also consider A∗ A − AA∗ for other choices of norm, or look at min{A − N : N is normal}. Fact 8 above suggests H K − K H as a possible measure of nonnormality, while the polar decomposition (see Fact 7 above) A = UP of A suggests UP − PU. See [EP87] for more measures of nonnormality and comparisons between them. 27. [Lin97] [FR96] For any > 0 there is a δ > 0 such that, for any n × n complex matrix A with AA∗ − A∗ A2 < δ, there is a normal matrix N with N − A2 < . Thus, a matrix which is approximately normal is close to a normal matrix. Examples:
3 1. Let A = 1
1 1 1 and U = √ 3 2 1
1 4 0 . Then U ∗ AU = and A = 4P1 + 2P2 , where the −1 0 2
Pi s are the pairwise orthogonal, orthogonal projection matrices
1 1 0 U∗ = 0 2 1
1 P1 = U 0 ⎡
⎤
1 4 + 2i ⎢ 2. A = ⎣0 8 + 2i 2 −2i
1 1
and
0 P2 = U 0 ⎡
6 1 ⎥ ⎢ 0 ⎦ = H + i K , where H = ⎣2 − i 4i 4
1 1 −1 0 U∗ = . 1 2 −1 1 2+i 8 −i
⎤
⎡
4 0 ⎥ ⎢ i ⎦ and K = ⎣1 + 2i 0 2i
are Hermitian. 0 1 0 1 1 3. A = and B = are both normal matrices, but the product AB = 1 0 1 1 0 not normal. ⎡ ⎤ 2 0 0 ⎢ ⎥ 4. Let A = ⎣0 0 1⎦. Then ρ(A) = 2 = A2 , but A is not normal. 0 0 0
5. Let Q =
cos θ − sin θ
θ U exp i 0
0 −θ
sin θ . Put U = cos θ
√1 2
θ U = exp i U 0 ∗
1 i
i eiθ and D = 1 0
0
e −i θ
0 θ U ∗ . Put H = U −θ 0
⎤
1 − 2i 2 −1
−2i ⎥ −1 ⎦ 4
1 is 1
. Then Q = U DU ∗ =
0 0 U∗ = −θ iθ
−i θ . 0
0 θ is a real, skewsymmetric Then H is Hermitian and Q = exp(i H). Also, K = i H = −θ 0 matrix and Q = exp(K ). 6. Here is an example from [Sund82] that the condition that A − B be normal cannot be showing 0 1 0 −1 dropped from 21. Let A = and B = . Then A is Hermitian with eigenvalues ±1 1 0 1 0
Unitary Similarity, Normal Matrices, and Spectral Theory
79
√ −1 and B is skewHermitian with eigenvalues ±i . So, we have A − P B P 2 = 2, regardless 0 2 of the permutation P . However, A − B = and A − B2 = 2. 0 0 7. This example shows that Fact 25 above does not hold for general pairs of matrices. Let α > β > 0 √ 0 α 0 α−β and put A = and B = . Then the eigenvalues of A are ± αβ and both β 0 0 0
0 eigenvalues of B are zero. We have A − B = β √ have αβ > β = A − B2 .
β and A − B2 = β. But, since α > β, we 0
References [AN86] T. Ando and Y. Nakamura. “Bounds for the antidistance.” Technical Report, Hokkaido University, Japan, 1986. [BDK89] R. Bhatia, C. Davis, and P. Koosis. An extremal problem in Fourier analysis with applications to operator theory. J. Funct. Anal., 82:138–150, 1989. [BDM83] R. Bhatia, C. Davis, and A. McIntosh. Perturbation of spectral subspaces and solution of linear operator equations. Linear Algebra Appl., 52/53:45–67, 1983. [BEK97] R. Bhatia, L. Elsner, and G.M. Krause. Spectral variation bounds for diagonalisable matrices. Aequationes Mathematicae, 54:102–107, 1997. [Bha82] R. Bhatia. Analysis of spectral variation and some inequalities. Transactions of the American Mathematical Society, 272:323–331, 1982. [Bha87] R. Bhatia. Perturbation Bounds for Matrix Eigenvalues. Longman Scientific & Technical, Essex, U.K. (copublished in the United States with John Wiley & Sons, New York), 1987. [BH85] R. Bhatia and J. A. R. Holbrook. Short normal paths and spectral variation. Proc. Amer. Math. Soc., 94:377–382, 1985. [EI98] L. Elsner and Kh.D. Ikramov. Normal matrices: an update. Linear Algebra Appl., 285:291–303, 1998. [EP87] L. Elsner and M.H.C Paardekooper. On measures of nonnormality of matrices. Linear Algebra Appl., 92:107–124, 1987. [Fri02] S. Friedland. Normal matrices and the completion problem. SIAM J. Matrix Anal. Appl., 23:896– 902, 2002. [FR96] P. Friis and M. Rørdam. Almost commuting selfadjoint matrices — a short proof of Huaxin Lin’s theorem. J. Reine Angew. Math., 479:121–131, 1996. [Gan59] F.R. Gantmacher. Matrix Theory, Vol. I. Chelsea Publishing, New York, 1959. [GJSW87] R. Grone, C.R. Johnson, E.M. Sa, and H. Wolkowicz. Normal matrices. Linear Algebra Appl., 87:213–225, 1987. [Hal87] P.R. Halmos. FiniteDimensional Vector Spaces. SpringerVerlag, New York, 1987. [HJ85] R.A. Horn and C.R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985. [Hol92] J.A. Holbrook. Spectral variation of normal matrices. Linear Algebra Appl., 174:131–144, 1992. ˇ [HOS96] J. Holbrook, M. Omladiˇc, and P. Semrl. Maximal spectral distance. Linear Algebra Appl., 249:197–205, 1996. [HW53] A.J. Hoffman and H.W. Wielandt. The variation of the spectrum of a normal matrix. Duke Math. J., 20:37–39, 1953. [Lin97] H. Lin. Almost commuting selfadjoint matrices and applications. Operator algebras and their applications (Waterloo, ON, 1994/95), Fields Inst. Commun., 13, Amer. Math Soc., Providence, RI, 193–233, 1997. [Lit53] D.E. Littlewood. On unitary equivalence. J. London Math. Soc., 28:314–322, 1953.
710
Handbook of Linear Algebra
[Mir60] L. Mirsky. Symmetric guage functions and unitarily invariant norms. Quart. J. Math. Oxford (2), 11:50–59, 1960. [Mit53] B.E. Mitchell. Unitary transformations. Can. J. Math, 6:69–72, 1954. [MM55] B.N. Moyls and M.D. Marcus. Field convexity of a square matrix. Proc. Amer. Math. Soc., 6:981–983, 1955. [MM64] M. Marcus and H. Minc. A Survey of Matrix Theory and Matrix Inequalities. Allyn and Bacon, Boston, 1964. [MT52] T.S. Motzkin and O. Taussky Todd. Pairs of matrices with property L. Trans. Amer. Math. Soc., 73:108–114, 1952. ˇ [OS90] M. Omladiˇc and P. Semrl. On the distance between normal matrices. Proc. Amer. Math. Soc., 110:591–596, 1990. [Par48] W.V. Parker. Sets of numbers associated with a matrix. Duke Math. J., 15:711–715, 1948. [Pea62] C. Pearcy. A complete set of unitary invariants for operators generating finite W∗ algebras of type I. Pacific J. Math., 12:1405–1416, 1962. [Sch09] I. Schur. U¨ ber die charakteristischen Wurzeln einer linearen Substitutionen mit einer Anwendung auf die Theorie der Intergralgleichungen. Math. Ann., 66:488–510, 1909. [Sha91] H. Shapiro. A survey of canonical forms and invariants for unitary similarity. Linear Algebra Appl., 147:101–167, 1991. [Spe40] W. Specht. Zur Theorie der Matrizen, II. Jahresber. Deutsch. Math.Verein., 50:19–23, 1940. [ST80] H. Shapiro and O. Taussky. Alternative proofs of a theorem of Moyls and Marcus on the numerical range of a square matrix. Linear Multilinear Algebra, 8:337–340, 1980. [Sun82] V.S. Sunder. On permutations, convex hulls, and normal operators. Linear Algebra Appl., 48:403– 411, 1982. [Sund82] V.S. Sunder. Distance between normal operators. Proc. Amer. Math. Soc., 84:483–484, 1982. [Wey12] H. Weyl. Das assymptotische Verteilungsgesetz der Eigenwerte linearer partieller Diffferentialgleichungen. Math. Ann., 71:441–479, 1912. [Wieg53] N. Wiegmann. Pairs of normal matrices with property L. Proc. Am. Math. Soc., 4: 3536, 1953. [Wiel53] H. Wielandt. Pairs of normal matrices with property L. J. Res. Nat. Bur. Standards, 51:89–90, 1953. [WW49] A.G. Walker and J.D. Weston. Inclusion theorems for the eigenvalues of a normal matrix. J. London Math. Soc., 24:28–31, 1949.
8 Hermitian and Positive Definite Matrices Hermitian Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Order Properties of Eigenvalues of Hermitian Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8.3 Congruence. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8.4 Positive Definite Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8.5 Further Topics in Positive Definite Matrices. . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8.1 8.2
Wayne Barrett Brigham Young University
8.1
81 83 85 86 89 812
Hermitian Matrices
All matrices in this section are either real or complex, unless explicitly stated otherwise. Definitions: A matrix A ∈ Cn×n is Hermitian or selfadjoint if A∗ = A, or elementwise, a¯ i j = a j i , for i, j = 1, . . . , n. The set of Hermitian matrices of order n is denoted by Hn . Note that a matrix A ∈ Rn×n is Hermitian if and only if AT = A. A matrix A ∈ Cn×n is symmetric if AT = A, or elementwise, ai j = a j i , for i, j = 1, . . . , n. The set of real symmetric matrices of order n is denoted by Sn . Since Sn is a subset of Hn , all theorems for matrices in Hn apply to Sn as well. Let V be a complex inner product space with inner product v, w and let v1 , v2 , . . . , vn ∈ V . The matrix G = [g i j ] ∈ Cn×n defined by g i j = vi , v j , i, j ∈ {1, 2, . . . , n} is called the Gram matrix of the vectors v1 , v2 , . . . , vn . The inner product x, y of two vectors x, y ∈ Cn will mean the standard inner product, i.e., x, y = y∗ x, unless stated otherwise. The term orthogonal will mean orthogonal with respect to this inner product, unless stated otherwise. Facts: For facts without a specific reference, see [HJ85, pp. 38, 101–104, 169–171, 175], [Lax96, pp. 80–83], and [GR01, pp. 169–171]. Many are an immediate consequence of the definition. 1. A real symmetric matrix is Hermitian, and a real Hermitian matrix is symmetric. 2. Let A, B be Hermitian. 81
82
Handbook of Linear Algebra
(a) Then A + B is Hermitian. (b) If AB = B A, then AB is Hermitian. (c) If c ∈ R, then c A is Hermitian. A + A∗ , A∗ + A, AA∗ , and A∗ A are Hermitian for all A ∈ Cn×n . If A ∈ Hn , then Ax, y = x, Ay for all x, y ∈ Cn . If A ∈ Hn , then Ak ∈ Hn for all k ∈ N. If A ∈ Hn is invertible, then A−1 ∈ Hn . The main diagonal entries of a Hermitian matrix are real. All eigenvalues of a Hermitian matrix are real. Eigenvectors corresponding to distinct eigenvalues of a Hermitian matrix are orthogonal. Spectral Theorem — Diagonalization version: If A ∈ Hn , there is a unitary matrix U ∈ Cn×n such that U ∗ AU = D, where D is a real diagonal matrix whose diagonal entries are the eigenvalues of A. If A ∈ Sn , the same conclusion holds with an orthogonal matrix Q ∈ Rn×n , i.e., Q T AQ = D. 11. Spectral Theorem — Orthonormal basis version: If A ∈ Hn , there is an orthonormal basis of Cn consisting of eigenvectors of A. If A ∈ Sn , the same conclusion holds with Cn replaced by Rn . 12. [Lay97, p. 447] Spectral Theorem — Sum of rank one projections version: Let A ∈ Hn with eigenvalues λ1 , λ2 , . . . , λn , and corresponding orthonormal eigenvectors u1 , u2 , . . . , un . Then 3. 4. 5. 6. 7. 8. 9. 10.
A = λ1 u1 u∗1 + λ2 u2 u∗2 + · · · + λn un u∗n . If A ∈ Sn , then A = λ1 u1 u1T + λ2 u2 u2T + · · · + λn un unT . If A ∈ Hn , then rank A equals the number of nonzero eigenvalues of A. Each A ∈ Cn×n can be written uniquely as A = H + i K , where H, K ∈ Hn . Given A ∈ Cn×n , then A ∈ Hn if and only if x∗ Ax is real for all x ∈ Cn . Any Gram matrix is Hermitian. Some examples of how Gram matrices arise are given in Chapter 66 and [Lax96, p. 124]. 17. The properties given above for Hn and Sn are generally not true for symmetric matrices in Cn×n , but there is a substantial theory associated with them. (See [HJ85, sections 4.4 and 4.6].)
13. 14. 15. 16.
Examples:
3 1. The matrix 2+i
⎡
6 0 2−i ⎢ ∈ H2 and ⎣0 −1 −5 2 5
⎤
2 ⎥ 5⎦ ∈ S3 . 3
2. Let D be an open set in Rn containing the point x0 , and let f : D → R be a twice continu∂2 f (x0 .). Then H is a real ously differentiable function on D. Define H ∈ Rn×n by h i j = ∂ xi ∂ x j symmetric matrix, and is called the Hessian of f . 3. Let G = (V, E ) be a simple undirected graph with vertex set V = {1, 2, 3, . . . , n}. The n × n adjacency matrix A(G ) = [ai j ] (see Section 28.3) is defined by
ai j =
1
if i j ∈ E
0 otherwise.
In particular, all diagonal entries of A(G ) are 0. Since i j is an edge of G if and only if j i is, the
adjacency matrix is real symmetric. Observe that for each i ∈ V , nj=1 ai j = δ(i ), i.e., the sum of the i th row is the degree of vertex i .
83
Hermitian and Positive Definite Matrices
8.2
Order Properties of Eigenvalues of Hermitian Matrices
Definitions: Given A ∈ Hn , the Rayleigh quotient R A : Cn \{0} → R is R A (x) =
Ax, x x∗ Ax = . x∗ x x, x
Facts: For facts without a specific reference, see [HJ85, Sections 4.2, 4.3]; however, in that source the eigenvalues are labeled from smallest to greatest and the definition of majorizes (see Preliminaries) has a similar reversal of notation. 1. Rayleigh–Ritz Theorem: Let A ∈ Hn , with eigenvalues λ1 ≥ λ2 ≥ · · · ≥ λn . Then λn ≤
x∗ Ax ≤ λ1 , x∗ x
for all nonzero x ∈ Cn ,
λ1 = max
x∗ Ax = max x∗ Ax, x 2 =1 x∗ x
λn = min
x∗ Ax = min x∗ Ax. x 2 =1 x∗ x
x=0
and x=0
2. Courant–Fischer Theorem: Let A ∈ Mn be a Hermitian matrix with eigenvalues λ1 ≥ λ2 ≥ . . . ≥ λn , and let k be a given integer with 1 ≤ k ≤ n. Then max
w1 ,w2 ,..., wn−k ∈ C
n
min
x = 0, x ∈ C x ⊥ w1 ,w2 ,..., wn−k n
x∗ Ax = λk x∗ x
and min
w1 ,w2 ,..., wk−1 ∈ C
n
max
x = 0, x ∈ C x ⊥ w1 ,w2 ,..., wk−1 n
x∗ Ax = λk . x∗ x
3. (Also [Bha01, p. 291]) Weyl Inequalities: Let A, B ∈ Hn and assume that the eigenvalues of A, B and A+B are arranged in decreasing order. Then for every pair of integers j, k such that 1 ≤ j, k ≤ n and j + k ≤ n + 1, λ j +k−1 (A + B) ≤ λ j (A) + λk (B) and for every pair of integers j, k such that 1 ≤ j, k ≤ n and j + k ≥ n + 1, λ j +k−n (A + B) ≥ λ j (A) + λk (B). 4. Weyl Inequalities: These inequalities are a prominent special case of Fact 3. Let A, B ∈ Hn and assume that the eigenvalues of A, B and A + B are arranged in decreasing order. Then for each j ∈ {1, 2, . . . , n}, λ j (A) + λn (B) ≤ λ j (A + B) ≤ λ j (A) + λ1 (B). 5. Interlacing Inequalities: Let A ∈ Hn , let λ1 ≥ λ2 ≥ · · · ≥ λn be the eigenvalues of A, and for any i ∈ {1, 2, . . . , n}, let µ1 ≥ µ2 ≥ · · · ≥ µn−1 be the eigenvalues of A(i ), where A(i ) is the principal
84
Handbook of Linear Algebra
submatrix of A obtained by deleting its i th row and column. Then λ1 ≥ µ1 ≥ λ2 ≥ µ2 ≥ λ3 ≥ . . . ≥ λn−1 ≥ µn−1 ≥ λn . 6. Let A ∈ Hn and let B be any principal submatrix of A. If λk is the k th largest eigenvalue of A and µk is the k th largest eigenvalue of B, then λk ≥ µk . 7. Let A ∈ Hn with eigenvalues λ1 ≥ λ2 ≥ · · · ≥ λn . Let S be a kdimensional subspace of Cn with k ∈ {1, 2, . . . , n}. Then (a) If there is a constant c such that x∗ Ax ≥ c x∗ x for all x ∈ S, then λk ≥ c . (b) If there is a constant c such that x∗ Ax ≤ c x∗ x for all x ∈ S, then λn−k+1 ≤ c . 8. Let A ∈ Hn . (a) If x∗ Ax ≥ 0 for all x in a kdimensional subspace of Cn , then A has at least k nonnegative eigenvalues. (b) If x∗ Ax > 0 for all nonzero x in a kdimensional subspace of Cn , then A has at least k positive eigenvalues. 9. Let A ∈ Hn , let λ = (λ1 , λ2 , . . . , λn ) be the vector of eigenvalues of A arranged in decreasing order, and let α = (a1 , a2 , . . . , an ) be the vector consisting of the diagonal entries of A arranged in decreasing order. Then λ α. (See Preliminaries for the definition of .) 10. Let α = (a1 , a2 , . . . , an ), β = (b1 , b2 , . . . , bn ) be decreasing sequences of real numbers such that α β. Then there exists an A ∈ Hn such that the eigenvalues of A are a1 , a2 , . . . , an , and the diagonal entries of A are b1 , b2 , . . . , bn . 11. [Lax96, pp. 133–6] or [Bha01, p. 291] (See also Chapter 15.) Let A, B ∈ Hn with eigenvalues λ1 (A) ≥ λ2 (A) ≥ · · · ≥ λn (A) and λ1 (B) ≥ λ2 (B) ≥ · · · ≥ λn (B). Then (a) λi (A) − λi (B) ≤ A − B2 , i = 1, . . . , n. (b)
n
[λi (A) − λi (B)]2 ≤ A − B2F .
i =1
Examples: 1. Setting x = ei in the RayleighRitz theorem, we obtain λn ≤ aii ≤ λ1 . Thus, for any A ∈ Hn , we have λ1 ≥ max{aii  i ∈ {1, 2, . . . , n}} and λn ≤ min{aii  i ∈ {1, 2, . . . , n}}.
2. Setting x = [1, 1, . . . , 1]T in the RayleighRitz theorem, we find that λn ≤ n1 i,n j =1 ai j ≤ λ1 . If we take A to be the adjacency matrix of a graph, then this inequality implies that the largest eigenvalue of the graph is greater than or equal to its average degree. 3. The Weyl inequalities in Fact 3 above are a special case of the following general class of inequalities: k∈K
λk (A + B) ≤
i ∈I
λi (A) +
λ j (B),
j ∈J
where I, J , K are certain subsets of {1, 2, . . . , n}. In 1962, A. Horn conjectured which inequalities of this form are valid for all Hermitian A, B, and this conjecture was proved correct in papers by A. Klyachko in 1998 and by A. Knutson and T. Tao in 1999. Two detailed accounts of the problem and its solution are given in [Bha01] and [Ful00]. ⎡
1 ⎢ ⎢1 4. Let A = ⎢ ⎣1 0
1 1 1 0
1 1 1 1
⎤
⎡ 0 1 ⎥ 0⎥ ⎢ ⎥ have eigenvalues λ1 ≥ λ2 ≥ λ3 ≥ λ4 . Since A(4) = ⎣1 1⎦ 1 1
1 1 1
⎤
1 ⎥ 1⎦ 1
has eigenvalues 3, 0, 0, by the interlacing inequalities, λ1 ≥ 3 ≥ λ2 ≥ 0 ≥ λ3 ≥ 0 ≥ λ4 . In particular, λ3 = 0.
85
Hermitian and Positive Definite Matrices
Applications: 1. To use the Rayleigh–Ritz theorem effectively to estimate the largest or smallest eigenvalue of a Hermitian matrix, one needs ⎡to take into ⎤ account the relative magnitudes of the entries of the 1 1 1 ⎢ ⎥ matrix. For example, let A = ⎣1 2 2⎦. In order to estimate λ1 , we should try to maximize the 1 2 3 Rayleigh quotient. A vector x ∈ R3 is needed for which no component is zero, but such that each component is weighted more than the last. In a few trials, one is led to x = [1, 2, 3]T , which gives a 1 π Rayleigh quotient of 5. So λ1 ≥ 5. This is close to the actual value of λ1 , which is csc2 ≈ 5.049. 4 14 This example is only meant to illustrate the method; its primary importance is as a tool for estimating the largest (smallest) eigenvalue of a large Hermitian matrix when it can neither be found exactly nor be computed numerically. 2. The interlacing inequalities can sometimes be used to efficiently find all the eigenvalues of a Hermitian matrix. The Laplacian matrix (from spectral graph theory, see Section 28.4) of a star is ⎡
n−1 ⎢ −1 ⎢ ⎢ −1 ⎢ L =⎢ ⎢ .. ⎢ . ⎢ ⎣ −1 −1
−1 1 0 .. . 0 0
−1 0 1
··· ··· ..
0 0
−1 0 0
.
...
1 0
⎤
−1 0⎥ ⎥ 0⎥ ⎥ .. ⎥ ⎥. . ⎥ ⎥ 0⎦ 1
Since L (1) is an identity matrix, the interlacing inequalities relative to L (1) are: λ1 ≥ 1 ≥ λ2 ≥ 1 ≥ . . . ≥ λn−1 ≥ 1 ≥ λn . Therefore, n − 2 of the eigenvalues of L are equal to 1. Since the columns sum to 0, another eigenvalue is 0. Finally, since tr L = 2n − 2, the remaining eigenvalue is n. 3. The sixth fact above is applied in spectral graph theory to establish the useful fact that the k th largest eigenvalue of a graph is greater than or equal to the k th largest eigenvalue of any induced subgraph.
8.3
Congruence
Definitions: Two matrices A, B ∈ Hn are ∗ congruent if there is an invertible matrix C ∈ Cn×n such that B = C ∗ AC , c denoted A ∼ B. If C is real, then A and B are also called congruent. Let A ∈ Hn . The inertia of A is the ordered triple in(A) = (π(A), ν(A), δ(A)), where π(A) is the number of positive eigenvalues of A, ν(A) is the number of negative eigenvalues of A, and δ(A) is the number of zero eigenvalues of A. In the event that A ∈ Cn×n has all real eigenvalues, we adopt the same definition for in( A). Facts: The following can be found in [HJ85, pp. 221–223] and a variation of the last in [Lax96, pp. 77–78]. 1. 2. 3. 4. 5.
Unitary similarity is a special case of ∗ congruence. ∗ Congruence is an equivalence relation. For A ∈ Hn , π (A) + ν(A) + δ(A) = n. For A ∈ Hn , rank A = π (A) + ν(A). Let A ∈ Hn with inertia (r, s , t). Then A is ∗ congruent to Ir ⊕ (−Is ) ⊕ 0t . A matrix C that implements this ∗ congruence is found as follows. Let U be a unitary matrix for which U ∗ AU = D
86
Handbook of Linear Algebra
is a diagonal matrix with d11 , . . . , dr r the positive eigenvalues, dr +1,r +1 , . . . , dr +s ,r +s the negative eigenvalues, and dii = 0, k > r + s . Let
si =
⎧ √ ⎪ ⎪ ⎨1/√dii ,
i = 1, . . . , r
1/ −dii ,
⎪ ⎪ ⎩1,
i = r + 1, . . . , s
i >r +s
and let S = diag(s 1 , s 2 , . . . , s n ). Then C = U S. 6. Sylvester’s Law of Inertia: Two matrices A, B ∈ Hn are ∗ congruent if and only if they have the same inertia. Examples: ⎡
⎤
0 0 3 ⎢ ⎥ 1. Let A = ⎣0 0 4⎦. Since rank A = 2, π(A) + ν(A) = 2, so δ(A) = 1. Since tr A = 0, we have 3 4 0 π(A) = ν(A) = 1, and in(A) = (1, 1, 1). Letting ⎡
C=
√3 5 10 √4 5 10 − √110
√3 ⎢ 5 10 ⎢ √4 ⎢ 5 10 ⎣ √1 10
4 5
⎤ ⎥
− 35 ⎥ ⎥ ⎦
0
we have ⎡
⎤
1 0 ⎢ C ∗ AC = ⎣0 −1 0 0
0 ⎥ 0⎦ . 0
Now suppose ⎡
0
⎢ B = ⎣1
0
1 0 1
⎤
0 ⎥ 1⎦ . 0
Clearly in(B) = (1, 1, 1) also. By Sylvester’s law of inertia, B must be ∗ congruent to A.
8.4
Positive Definite Matrices
Definitions: A matrix A ∈ Hn is positive definite if x∗ Ax > 0 for all nonzero x ∈ Cn . It is positive semidefinite if x∗ Ax ≥ 0 for all x ∈ Cn . It is indefinite if neither A nor −A is positive semidefinite. The set of positive definite matrices of order n is denoted by PDn , and the set of positive semidefinite matrices of order n by PSDn . If the dependence on n is not significant, these can be abbreviated as PD and PSD. Finally, PD (PSD) are also used to abbreviate “positive definite” (“positive semidefinite”). Let k be a positive integer. If A, B are PSD and B k = A, then B is called a PSD k th root of A and is denoted A1/k . A correlation matrix is a PSD matrix in which every main diagonal entry is 1.
87
Hermitian and Positive Definite Matrices
Facts: For facts without a specific reference, see [HJ85, Sections 7.1 and 7.2] and [Fie86, pp. 51–57]. 1. A ∈ Sn is PD if xT Ax > 0 for all nonzero x ∈ Rn , and is PSD if xT Ax ≥ 0 for all x ∈ Rn . 2. Let A, B ∈ PSDn . (a) (b) (c) (d)
Then A + B ∈ PSDn . If, in addition, A ∈ PDn , then A + B ∈ PDn . If c ≥ 0, then c A ∈ PSDn . If, in addition, A ∈ PDn and c > 0, then c A ∈ PDn .
3. If A1 , A2 , . . . , Ak ∈ PSDn , then so is A1 + A2 + · · · + Ak . If, in addition, there is an i ∈ {1, 2, . . . , k} such that Ai ∈ PDn , then A1 + A2 + · · · + Ak ∈ PDn . 4. Let A ∈ Hn . Then A is PD if and only if every eigenvalue of A is positive, and A is PSD if and only if every eigenvalue of A is nonnegative. 5. If A is PD, then tr A > 0 and det A > 0. If A is PSD, then tr A ≥ 0 and det A ≥ 0. 6. A PSD matrix is PD if and only if it is invertible. 7. Inheritance Principle: Any principal submatrix of a PD (PSD) matrix is PD (PSD). 8. All principal minors of a PD (PSD) matrix are positive (nonnegative). 9. Each diagonal entry of a PD (PSD) matrix is positive (nonnegative). If a diagonal entry of a PSD matrix is 0, then every entry in the row and column containing it is also 0. 10. Let A ∈ Hn . Then A is PD if and only if every leading principal minor of A is positive. A is PSD
0 if and only if every principal minor of A is nonnegative. (The matrix 0
0 shows that it is not −1
sufficient that every leading principal minor be nonnegative in order for A to be PSD.) 11. Let A be PD (PSD). Then Ak is PD (PSD) for all k ∈ N. 12. Let A ∈ PSDn and express A as A = U DU ∗ , where U is unitary and D is the diagonal matrix of eigenvalues. Given any positive integer k, there exists a unique PSD k th root of A given by A1/k = U D 1/k U ∗ . If A is real so is A1/k . (See also Chapter 11.2.) 13. If A is PD, then A−1 is PD. 14. Let A ∈ PSDn and let C ∈ Cn×m . Then C ∗ AC is PSD. 15. Let A ∈ PDn and let C ∈ Cn×m , n ≥ m. Then C ∗ AC is PD if and only if rank C = m; i.e., if and only if C has linearly independent columns. 16. Let A ∈ PDn and C ∈ Cn×n . Then C ∗ AC is PD if and only if C is invertible. 17. Let A ∈ Hn . Then A is PD if and only if there is an invertible B ∈ Cn×n such that A = B ∗ B. 18. Cholesky Factorization: Let A ∈ Hn . Then A is PD if and only if there is an invertible lower triangular matrix L with positive diagonal entries such that A = L L ∗ . (See Chapter 38 for information on the computation of the Cholesky factorization.) 19. Let A ∈ PSDn with rank A = r < n. Then A can be factored as A = B ∗ B with B ∈ Cr ×n . If A is a real matrix, then B can be taken to be real and A = B T B. Equivalently, there exist vectors v1 , v2 , . . . , vn ∈ Cr (or Rr ) such that ai j = vi∗ v j (or viT v j ). Note that A is the Gram matrix (see section 8.1) of the vectors v1 , v2 , . . . , vn . In particular, any rank 1 PSD matrix has the form xx∗ for some nonzero vector x ∈ Cn . 20. [Lax96, p. 123]; see also [HJ85, p. 407] The Gram matrix G of a set of vectors v1 , v2 , . . . , vn is PSD. If v1 , v2 , . . . , vn are linearly independent, then G is PD. 21. [HJ85, p. 412] Polar Form: Let A ∈ Cm×n , m ≥ n. Then A can be factored A = U P , where P ∈ PSDn , rank P = rank A, and U ∈ Cm×n has orthonormal columns. Moreover, P is uniquely determined by A and equals (A∗ A)1/2 . If A is real, then P and U are real. (See also Section 17.1.) 22. [HJ85, p. 400] Any matrix A ∈ PDn is diagonally congruent to a correlation matrix via the diagonal √ √ matrix D = (1/ a11 , . . . , 1/ ann ).
88
Handbook of Linear Algebra
23. [BJT93] Parameterization of Correlation Matrices in S3 : Let 0 ≤ α, β, γ ≤ π. Then the matrix ⎡
1 ⎢ C = ⎣cos α cos γ
cos α 1 cos β
is PSD if and only if α ≤ β + γ , β ≤ α + γ , γ ≤ α + β, is PD if and only if all of these inequalities are strict.
24. [HJ85, p. 472] and [Fie86, p. 55] Let A =
B C∗
⎤
cos γ ⎥ cos β ⎦ 1 α + β + γ ≤ 2π. Furthermore, C
C ∈ Hn , and assume that B is invertible. Then D
A is PD if and only if the matrices B and its Schur complement S = D − C ∗ B −1 C are PD.
B C 25. [Joh92] and [LB96, pp. 93–94] Let A = be PSD. Then any column of C lies in the span C∗ D of the columns of B. 26. [HJ85, p. 465] Let A ∈ PDn and B ∈ Hn . Then (a) AB is diagonalizable. (b) All eigenvalues of AB are real. (c) in(AB) = in(B). 27. Any diagonalizable matrix A with real eigenvalues can be factored as A = BC , where B is PSD and C is Hermitian. 28. If A, B ∈ PDn , then every eigenvalue of AB is positive. 29. [Lax96, p. 120] Let A, B ∈ Hn . If A is PD and AB + B A is PD, then B is PD. It is not true that if
1 A, B are both PD, then AB + B A is PD as can be seen by the example A = 2
2 5 , B= 5 2
2 . 1
30. [HJ85, pp. 466–467] and [Lax96, pp. 125–126] The real valued function f (X) = log(det X) is concave on the set PDn ; i.e., f ((1 − t)X + tY ) ≥ (1 − t) f (X) + t f (Y ) for all t ∈ [0, 1] and all X, Y ∈ P Dn . π n/2 T 31. [Lax96, p. 129] If A ∈ PDn is real, e −x Ax dx = √ . n R det A −1 32. [Fie60] Let A = [ai j ], B = [bi j ] ∈ PDn , with A = [αi j ], B −1 = [βi j ]. Then n
(ai j − bi j )(αi j − βi j ) ≤ 0,
i, j =1
with equality if and only if A = B. 2 2 33. [Ber73, p. 55] Consider PDn to be a subset of Cn (or for real matrices of Rn ). Then the (topological) boundary of PDn is PSDn .
Examples: 1. If A = [a] is 1 × 1, then A is PD if and only if a > 0, and is PSD if and only if a ≥ 0; so PD and PSD matrices are a generalization of positive numbers and nonnegative numbers. 2. If one attempts to define PD (or PSD) for nonsymmetric real matrices according to the the usual definition, many of the facts above for (Hermitian) PD matrices no longer hold. For example,
0 1 . Then xT Ax = 0 for all x ∈ R2 . But σ (A) = {i, −i }, which does not agree suppose A = −1 0 with Fact 4 above.
89
Hermitian and Positive Definite Matrices
3. The matrix A =
17 8
8 17
1 1 factors as √ 2 1
1 −1
25 0
0 1 1 √ 9 2 1
1 , so −1
A1/2 =
1 1 1 5 0 1 1 1 4 1 √ √ = . 1 −1 0 3 1 −1 1 4 2 2 4. A selfadjoint linear operator on a complex inner product space V (see Section 5.3) is called positive if Ax, x > 0 for all nonzero x ∈ V . For the usual inner product in Cn we have Ax, x = x∗ Ax, in which case the definition of positive operator and positive definite matrix coincide. 5. Let X 1 , X 2 , . . . , X n be realvalued random variables on a probability space, each with mean zero and finite second moment. Define the matrix ai j = E (X i X j ),
i, j ∈ {1, 2, . . . , n}.
The real symmetric matrix A is called the covariance matrix of X 1 , X 2 , . . . , X n , and is necessarily PSD. If we let X = (X 1 , X 2 , . . . , X n )T , then we may abbreviate the definition to A = E (X X T ).
Applications: 1. [HFKLMO95, p. 181] or [MT88, p. 253] Test for Maxima and Minima in Several Variables: Let D be an open set in Rn containing the point x0 , let f : D → R be a twice continuously differentiable function on D, and assume that all first derivatives of f vanish at x0 . Let H be the Hessian matrix of f (Example 2 of Section 8.1). Then (a) f has a relative minimum at x0 if H(x0 ) is PD. (b) f has a relative maximum at x0 if −H(x0 ) is PD. (c) f has a saddle point at x0 if H(x0 ) is indefinite. Otherwise, the test is inconclusive. 2. Section 1.3 of the textbook [Str86] is an elementary introduction to real PD matrices emphasizing the significance of the Choleskylike factorization L D L T of a PD matrix. This representation is then used as a framework for many applications throughout the first three chapters of this text. 3. Let A be a real matrix in PDn . A multivariate normal distribution is one whose probability density function in Rn is given by f (x) = √
1 1 T −1 e − 2 x A x. (2π)n det A
It follows from Fact 31 above that Rn f (x) dx = 1. A Gaussian family X 1 , X 2 , . . . X n , where each X i has mean zero, is a set of random variables that have a multivariate normal distribution. The entries of the matrix A satisfy the identity ai j = E (X i X j ), so the distribution is completely determined by its covariance matrix.
8.5
Further Topics in Positive Definite Matrices
Definitions: Let A, B ∈ F n×n , where F is a field. The Hadamard product or Schur product of A and B, denoted A ◦ B, is the matrix in F n×n whose (i, j )th entry is ai j bi j . A function f : R → C is called positive semidefinite if for each n ∈ N and all x1 , x2 , . . . , xn ∈ R, the n × n matrix [ f (xi − x j )] is PSD.
810
Handbook of Linear Algebra
Let A, B ∈ Hn . We write A B if A − B is PD, and A B if A − B is PSD. The partial ordering on Hn induced by is called the partial semidefinite ordering or the Loewner ordering. Let V be an ndimensional inner product space over C or R. A set K ⊆ V is called a cone if (a) For each x, y ∈ K , x + y ∈ K . (b) If x ∈ K and c ≥ 0, then c x ∈ K . A cone is frequently referred to as a convex cone. A cone K is closed if K is a closed subset of V , is pointed if K ∩ −K = {0}, and is full if it has a nonempty interior. The set K ∗ = {y ∈ V  x, y ≥ 0
∀ x ∈ K}
is called the dual space.
Facts: 1. [HJ91, pp. 308–309]; also see [HJ85, p. 458] or [Lax96, pp. 124, 234] Schur Product Theorem: If A, B ∈ PSDn , then so is A ◦ B. If A ∈ PSDn , aii > 0, i = 1, . . . , n, and B ∈ PDn , then A ◦ B ∈ PDn . In particular, if A and B are both PD, then so is A ◦ B. 2. [HJ85, p. 459] Fejer’s Theorem: Let A = [ai j ] ∈ Hn . Then A is PSD if and only if n
ai j bi j ≥ 0
i, j =1
for all matrices B ∈ PSDn . 3. [HJ91, pp. 245–246] If A ∈ PDm and B ∈ PDn , then the Kronecker (tensor) product (see Section 10.4) A ⊗ B ∈ PDmn . If A ∈ PSDm and B ∈ PSDn , then A ⊗ B ∈ PSDmn . 4. [HJ85, p. 477] or [Lax96, pp. 126–127, 131–132] Hadamard’s Determinantal Inequality: If A ∈ PDn , then det A ≤ in=1 aii . Equality holds if and only if A is a diagonal matrix. 5. [FJ00, pp. 199–200] or [HJ85, p. 478] Fischer’s Determinantal Inequality: If A ∈ PDn and α is any subset of {1, 2, . . . , n}, then det A ≤ det A[α] det A[α c ] (where det A[∅] = 1). Equality occurs if and only if A[α, α c ] is a zero matrix. (See Chapter 1.2 for the definition of A[α] and A[α, β].) 6. [FJ00, pp. 199–200] or [HJ85, p. 485] Koteljanskii’s Determinantal Inequality: Let A ∈ PDn and let α, β be any subsets of {1, 2, . . . , n}. Then det A[α ∪ β] det A[α ∩ β] ≤ det A[α] det A[β]. Note that if α ∩ β = ∅, Koteljanskii’s inequality reduces to Fischer’s inequality. Koteljanskii’s inequality is also called the Hadamard–Fischer inequality. For other determinantal inequalities for PD matrices, see [FJ00] and [HJ85, §7.8]. 7. [Fel71, pp. 620–623] and [Rud62, pp. 19–21] Bochner’s Theorem: A continuous function from R into C is positive semidefinite if and only if it is the Fourier transform of a finite positive measure. 8. [Lax96, p. 118] and [HJ85, p. 475, 470] Let A, B, C, D ∈ Hn . (a) If A ≺ B and C ≺ D, then A + C ≺ B + D. (b) If A ≺ B and B ≺ C , then A ≺ C . (c) If A ≺ B and S ∈ Cn×n is invertible, then S ∗ AS ≺ S ∗ B S. The three statements obtained by replacing each occurrence of ≺ by are also valid. 9. [Lax96, pp. 118–119, 121–122] and [HJ85, pp. 471–472] Let A, B ∈ PDn with A ≺ B. Then (a) (b) (c) (d)
A−1 B −1 . A1/2 ≺ B 1/2 . det A < det B. tr A < tr B.
If A B, then statement (a) holds with replaced by , statement (b) holds with ≺ replaced by , and statements (c) and (d) hold with < replaced by ≤.
811
Hermitian and Positive Definite Matrices
10. [HJ85, pp. 182, 471–472] Let A, B ∈ Hn with eigenvalues λ1 (A) ≥ λ2 (A) ≥ · · · ≥ λn (A) and λ1 (B) ≥ λ2 (B) ≥ · · · ≥ λn (B). If A ≺ B, then λk (A) < λk (B), k = 1, . . . , n. If A B, then λk (A) ≤ λk (B), k = 1, . . . , n. 11. [HJ85, p. 474] Let A be PD and let α ⊆ {1, 2, . . . , n}. Then A−1 [α] (A[α])−1 . 12. [HJ85, p. 475] If A is PD, then A−1 ◦ A I (A−1 ◦ A)−1 . 13. [Hal83, p. 89] If K is a cone in an inner product space V , its dual space is a closed cone and is called the dual cone of K . If K is a closed cone, then (K ∗ )∗ = K . 14. [Ber73, pp. 49–50, 55] and [HW87, p. 82] For each pair A, B ∈ Hn , define A, B = tr (AB). (a) Hn is an inner product space over the real numbers with respect to ·, ·. (b) PSDn is a closed, pointed, full cone in Hn . (c) (PSDn )∗ = PSDn . Examples: 1. The matrix C = [cos i − j ] ∈ Sn is PSD, as can be verified with Fact 19 of section 8.4 and the addition formula for the cosine. But a quick way to see it is to consider the measure µ(x) = 1 [δ(x + 1) + δ(x − 1)]; i.e., µ(E ) = 0 if −1, 1 ∈ / E , µ(E ) = 1 if −1, 1 ∈ E , and µ(E ) = 1/2 2 if exactly one of −1, 1 ∈ E . Since the Fourier transform of µ is cos t, if we let x1 , x2 , . . . , xn be 1, 2, . . . , n in the definition of positive definite function, we see immediately by Bochner’s Theorem that the matrix [cos(i − j )] = [cos i − j ] = C is PSD. By Hadamard’s determinantal inequality det C ≤ in=1 c ii = 1.
1 2. Since 1
1 2 ≺ 2 2 ⎡
1 ⎢ 3. The matrix A = ⎣1 1
1.5 −.5 ⎡
8 1 ⎢ 3 ⎣ 13 2
−.5 .5 3 6 4
2 0
2 .7 , taking inverses we have 7 −.2 1 2 2
⎤
⎡
1 2 −1 ⎥ ⎢ 2⎦ is PD with inverse A−1 = ⎣−1 2 3 0 −1 ⎡
0 = A−1 [{1, 3}]. Also, A−1 1
⎤
2 ⎥ 4⎦ = (A−1 ◦ A)−1 . 7
−.2 2 −1 ≺ . .2 −1 1 ⎤
0 ⎥ −1⎦. Then (A[{1, 3}])−1 = 1
2 −1 ⎢ ◦ A = ⎣−1 4 0 −2
2 4. If A B 0, it does not follow that A B . For example, if A = 1 then B and A − B are PSD, but A2 − B 2 is not. 2
2
⎤
⎡
0 1 ⎥ ⎢ −2⎦ ⎣0 3 0
⎤
0 1 0
0 ⎥ 0⎦ 1
1 1 and B = 1 0
0 , 0
Applications: 1. Hadamard’s determinantal inequality can be used to obtain a sharp bound on the determinant of a matrix in Cn×n if only the magnitudes of the entries are known. [HJ85, pp. 477–478] or [Lax96, p. 127]. Hadamard’s Determinantal Inequality for Matrices in Cn×n : Let B ∈ Cn×n . Then  det B ≤ n n 2 1/2 with equality holding if and only if the rows of B are orthogonal. i =1 ( j =1 b i j  ) In the case that B is invertible, the inequality follows from Hadamard’s determinantal inequality for positive definite matrices by using A = B B ∗ ; if B is singular, the inequality is obvious. The inequality can be alternatively expressed as  det B ≤ in=1 bi 2 , where bi are the rows of B. If B is a real matrix, it has the geometric meaning that among all parallelepipeds with given side lengths bi 2 , i = 1, . . . , n, the one with the largest volume is rectangular. There is a corresponding inequality in which the righthand side is the product of the lengths of the columns of B.
812
Handbook of Linear Algebra
2. [Fel71, pp. 620–623] A special case of Bochner’s theorem, important in probability theory, is: A continuous function φ is the characteristic function of a probability distribution if and only if it is positive semidefinite and φ(0) = 1. 3. Understanding the cone PSDn is important in semidefinite programming. (See Chapter 51.)
References [BJT93] W. Barrett, C. Johnson, and P. Tarazaga. The real positive definite completion problem for a simple cycle. Linear Algebra and Its Applications, 192: 3–31 (1993). [Ber73] A. Berman. Cones, Matrices, and Mathematical Programming. SpringerVerlag, Berlin, 1973. [Bha97] R. Bhatia. Matrix Analysis. SpringerVerlag, New York, 1997. [Bha01] R. Bhatia. Linear algebra to quantum cohomology: The story of Alfred Horn’s inequalities. The American Mathematical Monthly, 108 (4): 289–318, 2001. [FJ00] S. M. Fallat and C. R. Johnson. Determinantal inequalities: ancient history and recent advances. D. ´ Huynh, S. Jain, and S. LopezPermouth, Eds., Algebra and Its Applications, Contemporary Mathematics and Its Applications, American Mathematical Society, 259: 199–212, 2000. [Fel71] W. Feller. An Introduction to Probability Theory and Its Applications, 2nd ed., Vol. II. John Wiley & Sons, New York, 1996. [Fie60] M. Fiedler. A remark on positive definite matrices (Czech, English summary). Casopis pro pest. mat., 85: 75–77, 1960. [Fie86] M. Fiedler. Special Matrices and Their Applications in Numerical Mathematics. Martinus Nijhoff Publishers, Dordrecht, The Netherlands, 1986. [Ful00] W. Fulton. Eigenvalues, invariant factors, highest weights, and Schubert calculus. Bulletin of the American Mathematical Society, 37: 209–249, 2000. [GR01] C. Godsil and G. Royle. Algebraic Graph Theory. SpringerVerlag, New York, 2001. [Hal83] M. Hall, Jr. Combinatorial Theory. John Wiley & Sons, New York, 1983. [HFKLMO95] K. Heuvers, W. Francis, J. Kursti, D. Lockhart, D. Mak, and G. Ortner. Linear Algebra for Calculus. Brooks/Cole Publishing Company, Pacific Grove, CA, 1995. [HJ85] R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985. [HJ91] R. A. Horn and C. R. Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, 1991. [HW87] R. Hill and S. Waters. On the cone of positive semidefinite matrices. Linear Algebra and Its Applications, 90: 81–88, 1987. [Joh92] C. R. Johnson. Personal communication. [Lax96] P. D. Lax. Linear Algebra. John Wiley & Sons, New York, 1996. [Lay97] D. Lay. Linear Algebra and Its Applications, 2nd ed., AddisonWesley, Reading, MA., 1997. [LB96] M. Lundquist and W. Barrett. Rank inequalities for positive semidefinite matrices. Linear Algebra and Its Applications, 248: 91–100, 1996. [MT88] J. Marsden and A. Tromba. Vector Calculus, 3rd ed., W. H. Freeman and Company, New York, 1988. [Rud62] W. Rudin. Fourier Analysis on Groups. Interscience Publishers, a division of John Wiley & Sons, New York, 1962. [Str86] G. Strang. Introduction to Applied Mathematics. WellesleyCambridge Press, Wellesley, MA, 1986.
9 Nonnegative Matrices and Stochastic Matrices 9.1 9.2 9.3 9.4 9.5 9.6 9.7
Uriel G. Rothblum Technion
Notation, Terminology, and Preliminaries . . . . . . . . . . . . . Irreducible Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Reducible Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Stochastic and Substochastic Matrices. . . . . . . . . . . . . . . . . MMatrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Scaling of Nonnegative Matrices . . . . . . . . . . . . . . . . . . . . . . Miscellaneous Topics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
91 92 97 915 917 920 922
Nonnegative Factorization and Completely Positive Matrices • The Inverse Eigenvalue Problem • Nonhomogenous Products of Matrices • Operators Determined by Sets of Nonnegative Matrices in Product Form • Max Algebra over Nonnegative Matrices
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 923
Nonnegativity is a natural property of many measured quantities (physical and virtual). Consequently, nonnegative matrices arise in modelling transformations in numerous branches of science and engineering — these include probability theory (Markov chains), population models, iterative methods in numerical analysis, economics (input–output models), epidemiology, statistical mechanics, stability analysis, and physics. This section is concerned with properties of such matrices. The theory of the subject was originated in the pioneering work of Perron and Frobenius in [Per07a,Per07b,Fro08,Fro09, and Fro12]. There have been books, chapters in books, and hundreds of papers on the subject (e.g., [BNS89], [BP94], [Gan59, Chap. XIII], [Har02] [HJ85, Chap. 8], [LT85, Chap. 15], [Min88], [Sen81], [Var62, Chap. 1]). A brief outline of proofs of the classic result of Perron and a description of several applications of the theory can be found in the survey paper [Mac00]. Generalizations of many facts reported herein to coneinvariant matrices can be found in Chapter 26.
9.1
Notation, Terminology, and Preliminaries
Definitions: For a positive integer n, n = {1, . . . , n}. For a matrix A ∈ Cm×n : A is nonnegative (positive), written A ≥ 0 (A > 0), if all of A’s elements are nonnegative (positive). 91
92
Handbook of Linear Algebra
A is semipositive, written A 0 if A ≥ 0 and A = 0. A will denote the nonnegative matrix obtained by taking elementwise absolute values of A’s coordinates. For a square matrix A = [ai j ] ∈ Cn×n : The keigenspace of A at a complex number λ, denoted Nλk (A), is ker(A − λI )k ; a generalized eigenk vector of P at λ is a vector in ∪∞ k=0 Nλ (A). The index of A at λ, denoted ν A (λ), is the smallest integer k with Nλk (A) = Nλk+1 (A). The ergodicity coefficient of A, denoted τ (A), is max{λ : λ ∈ σ (A) and λ = ρ(A)} (with the maximum over the empty set defined to be 0 and ρ(A) being the spectral radius of A). A group inverse of a square matrix A, denoted A# , is a matrix X satisfying AX A = A, X AX = X, and AX = X A (whenever there exists such an X, it is unique). The digraph of A, denoted (A), is the graph with vertexset V (A) = n and arcset E (A) = {(i, j ) : i, j ∈ n and ai j = 0}; in particular, i = 1, . . . , n are called vertices. Vertex i ∈ n has access to vertex j ∈ n, written i → j , if either i = j or (A) contains a simple walk (path) from i to j ; we say that i and j communicate, written i ∼ j , if each has access to the other. A subset C of n is final if no vertex in C has access to a vertex not in C . Vertexcommunication is an equivalence relation. It partitions n into equivalence classes, called the access equivalence classes of A. (A) is strongly connected if there is only one access equivalence class. An access equivalence class C has access to an access equivalence class C , written C → C if some, or equivalently every, vertex in C has access to some, or equivalently every, vertex in C ; in this case we also write i → C and C → i when i ∈ C and i ∈ C . An access equivalence class C of A is final if its final as a subset of n, that is, it does not have access to any access equivalence class but itself. The reduced digraph of (A), denoted R[(A)], is the digraph whose vertexset is the set of access equivalence classes of A and whose arcs are the pairs (C, C ) with C and C as distinct classes satisfying C → C . For a sequence {am }m=0,1,... of complex numbers and a complex number a: a is a (C, 0)limit of {am }m=0,1,... , written limm→∞ am = a (C, 0), if limm→∞ am = a (in the sense of a regular limit). a is the (C, 1)limit of {am }m=0,1,... , written limm→∞ am = a (C, 1), if limm→∞ m−1 m−1 s =0 a s = a. Inductively for k = 2, 3, . . . , a is a (C, k)limit of {am }m=0,1,... , written limm→∞ am = a (C, k), if limm→∞ m−1 m−1 s =0 a s = a (C, k − 1). For 0 ≤ β < 1, {am }m=0,1,... converges geometrically to a with (geometric) rate β if for each β < γ < 1, : m = 0, 1, . . . } is bounded. (For simplicity, we avoid the reference of the set of real numbers { amγ −a m geometric convergence for (C, k)limits.) For a square nonnegative matrix P : ρ(P ) (the spectral radius of P ) is called the Perron value of P (see Facts 9.2–1(b) and 9.2–5(a) and 9.3–2(a)). A distinguished eigenvalue of P is a (necessarily nonnegative) eigenvalue of P that is associated with a semipositive (right) eigenvector. For more information about generalized eigenvectors, see Chapter 6.1. An example illustrating the digraph definitions is given in Figure 9.1; additional information about digraphs can be found in Chapter 29.
9.2
Irreducible Matrices
(See Chapter 27.3, Chapter 29.5, and Chapter 29.6 for additional information.)
93
Nonnegative Matrices and Stochastic Matrices
Definitions: A nonnegative square matrix P is irreducible if it is not permutation similar to any matrix having the (nontrivial) blockpartition
A B 0 C
with A and C square. The period of an irreducible nonnegative square matrix P (also known as the index of imprimitivity of P ) is the greatest common divisor of lengths of the cycles of (P ), the digraph of P . An irreducible nonnegative square matrix P is aperiodic if its period is 1. Note: We exclude from further consideration the (irreducible) trivial 0 matrix of dimension 1 × 1. Facts: Facts requiring proofs for which no specific reference is given can be found in [BP94, Chap. 2]. 1. (Positive Matrices — Perron’s Theorem) [Per07a, Per07b] Let P be a positive square matrix with spectral radius ρ and ergodicity coefficient τ . (a) P is irreducible and aperiodic. (b) ρ is positive and is a simple eigenvalue of P ; in particular, the index of P at ρ is 1. (c) There exist positive right and left eigenvectors of P corresponding to ρ, in particular, ρ is a distinguished eigenvalue of both P and P T . (d) ρ is the only distinguished eigenvalue of P . (e) ρ is the only eigenvalue λ of P with λ = ρ. (f) If x ∈ Rn satisfies x ≥ 0 and either (ρ I − P )x ≥ 0 or (ρ I − P )x ≤ 0, then (ρ I − P )x = 0. (g) If v and w are positive right and left eigenvectors of P corresponding to ρ (note that w is a row and the convergence is geometric with rate ρτ . vector), then limm→∞ ( Pρ )m = vw wv (h) Q ≡ ρ I − P has a group inverse; further, if v and w are positive right and left eigenvectors of P is nonsingular, Q # = (Q+ vw )−1 (I − vw ), and vw = I − Q Q#. corresponding to ρ, then Q+ vw wv wv wv wv (i) limm→∞
m−1 t=0
( Pρ )t − m vw = (ρ I − P )# and the convergence is geometric with rate ρτ . wv
2. (Characterizing Irreducibility) Let P be a nonnegative n × n matrix with spectral radius ρ. The following are equivalent: (a) (b) (c) (d) (e) (f) (g)
P is irreducible. s s =0 P > 0. n−1 (I + P ) > 0. The digraph of P is strongly connected, i.e., P has a single access equivalence class. Every eigenvector of P corresponding to ρ is a scalar multiple of a positive vector. For some µ > ρ, µI − P is nonsingular and (µI − P )−1 > 0. For every µ > ρ, µI − P is nonsingular and (µI − P )−1 > 0. n−1
3. (Characterizing Aperiodicity) Let P be an irreducible nonnegative n × n matrix. The following are equivalent: (a) P is aperiodic. (b) P m > 0 for some m. (See Section 29.6.) (c) P m > 0 for all m ≥ n. 4. (The Period) Let P be an irreducible nonnegative n × n matrix with period q . (a) q is the greatest common divisor of {m : m is a positive integer and (P m )ii > 0} for any one, or equivalently all, i ∈ {1, . . . , n}.
94
Handbook of Linear Algebra
(b) There exists a partition C 1 , . . . , C q of {1, . . . , n} such that: i. For s , t = 1, . . . , q , P [C s , C t ] = 0 if and only if t = s + 1 (with q + 1 identified with 1); in particular, P is permutation similar to a block rectangular matrix having a representation ⎡
0 ⎢ 0 ⎢ ⎢ .. ⎢ ⎢ . ⎢ ⎣ 0 P [C q , C 1 ]
P [C 1 , C 2 ] 0 .. . 0 0
0 ... P [C 2 , C 3 ] . . . .. . ... 0 ... 0 ...
0 0 .. .
⎤
⎥ ⎥ ⎥ ⎥. ⎥ ⎥ P [C q −1 , C q ]⎦
0
ii. P q [C s ] is irreducible for s = 1, . . . , q and P q [C s , C t ] = 0 for s , t = 1, . . . , n with s = t; in particular, P q is permutation similar to a block diagonal matrix having irreducible blocks on the diagonal. 5. (Spectral Properties — The Perron–Frobenius Theorem) [Fro12] Let P be an irreducible nonnegative square matrix with spectral radius ρ and period q . (a) ρ is positive and is a simple eigenvalue of P ; in particular, the index of P at ρ is 1. (b) There exist positive right and left eigenvectors of P corresponding to ρ; in particular, ρ is a distinguished eigenvalue of both P and P T . (c) ρ is the only distinguished eigenvalue of P and of P T . (d) If x ∈ Rn satisfies x ≥ 0 and either (ρ I − P )x ≥ 0 or (ρ I − P )x ≤ 0, then (ρ I − P )x = 0. (e) The eigenvalues of P with modulus ρ are {ρe (2πi )k/q : k = 0, . . . , q − 1} (here, i is the complex root of −1) and each of these eigenvalues is simple. In particular, if P is aperiodic (q = 1), then every eigenvalue λ = ρ of P satisfies λ < ρ. (f) Q ≡ ρ I − P has a group inverse; further, if v and w are positive right and left eigenvectors of P corresponding to ρ, then Q+ vw is nonsingular, Q # = (Q+ vw )−1 (I − vw ), and vw = I − Q Q#. wv wv wv wv 6. (Convergence Properties of Powers) Let P be an irreducible nonnegative square matrix with spectral radius ρ, index ν, period q , and ergodicity coefficient τ . Also, let v and w be positive right and . left eigenvectors of P corresponding to ρ and let P ≡ vw wv (a) limm→∞ ( Pρ )m = P (C,1).
−1 P t ( ρ ) = P and the convergence is geometric with rate ρτ < 1. In particular, (b) limm→∞ q1 m+q t=m if P is aperiodic (q = 1), then limm→∞ ( Pρ )m = P and the convergence is geometric with rate τ < 1. ρ (c) For each k = 0, . . . , q − 1, limm→∞ ( Pρ )mq +k exists and the convergence of these sequences to their limit is geometric with rate ( ρτ )q < 1.
P t
−1 P )# (C,1); further, if P is aperiodic, this limit holds (d) limm→∞ m−1 t=0 ( ρ ) − mP = (I − ρ as a regular limit and the convergence is geometric with rate ρτ < 1.
7. (Bounds on the Perron Value) Let P be an irreducible nonnegative n × n matrix with spectral radius ρ, let µ be a nonnegative scalar, and let ∈ {<, , ≤, =, ≥, , >}. The following are equivalent: (a) ρ µ. (b) There exists a vector u 0 in Rn with P u µu. (c) There exists a vector u > 0 in Rn with P u µu. In particular, (P x)i (P x)i = min max {i :xi >0} x0 {i :xi >0} xi xi
ρ = max min x0
= max min x>0
i
(P x)i (P x)i = min max . x>0 i xi xi
95
Nonnegative Matrices and Stochastic Matrices
Since ρ(P T ) = ρ(P ), the above properties (and characterizations) of ρ can be expressed by applying the above conditions to P T . Consider the sets (P ) ≡ {µ ≥ 0 : ∃x 0, P x ≥ µx}, 1 (P ) ≡ {µ ≥ 0 : ∃x > 0, P x ≥ µx}, (P ) ≡ {µ ≥ 0 : ∃x 0, P x ≤ µx}, 1 (P ) ≡ {µ ≥ 0 : ∃x > 0, P x ≤ µx}; these sets were named the Collatz–Wielandt sets in [BS75], giving credit to ideas used in [Col42], [Wie50]. The above properties (and characterizations) of ρ can be expressed through maximal/minimal elements of the Collatz–Wielandt sets of P and P T . (For further details see Chapter 26.) 8. (Bounds on the Spectral Radius) Let A be a complex n × n matrix and let P be an irreducible nonnegative n × n matrix such that A ≤ P . (a) ρ(A) ≤ ρ(P ). (b) [Wie50], [Sch96] ρ(A) = ρ(P ) if and only if there exist a complex number µ with µ = 1 and a complex diagonal matrix D with D = I such that A = µD −1 P D; in particular, in this case A = P . (c) If A is real and µ and ∈ {<, } satisfy the condition stated in 7b or 7c, then ρ(A) < µ. (d) If A is real and µ and ∈ {≤, =} satisfy the condition stated in 7b or 7c, then ρ(A) ≤ µ. 9. (Functional Inequalities) Consider the function ρ(.) mapping irreducible, nonnegative n × n matrices to their spectral radius. (a) ρ(.) is strictly increasing in each element (of the domain matrices), i.e., if A and B are irreducible, nonnegative n × n matrices with A B ≥ 0, then ρ(A) > ρ(B). (b) [Coh78] ρ(.) is (jointly) convex in the diagonal elements, i.e., if A and D are n × n matrices, with D diagonal, A and A + D nonnegative and irreducible and if 0 < α < 1, then ρ[α A + (1 − α)(A + D)] ≤ αρ(A) + (1 − α)ρ(A + D). For further functional inequalities that concern the spectral radius see Fact 8 of Section 9.3. 10. (Taylor Expansion of the Perron Value) [HRR92] The function ρ(.) mapping irreducible nonnegative n × n matrices X = [xi j ] to their spectral radius is differentiable of all orders and has a converging Taylor expansion. In particular, if P is an irreducible nonnegative n × n matrix with spectral radius ρ and corresponding positive right and left eigenvectors v = [v i ] and w = [w j ], normalized so that wv = 1, and if F is an n × n matrix with P + F ≥ 0 for all sufficiently small positive , k # then ρ(P + F ) = ∞ k=0 ρk with ρ0 = ρ, ρ1 = wF v, ρ2 = wF (ρ I − P ) F v, ρ3 = wF (ρ I − ∂ρ(X) # # P ) (wF vI − F )(ρ I − P ) F v; in particular, ∂ xi j  X=P = w i v j . An algorithm that iteratively generates all coefficients of the above Taylor expansion is available; see [HRR92]. 11. (Bounds on the Ergodicity Coefficient) [RT85] Let P be an irreducible nonnegative n × n matrix with spectral radius ρ, corresponding positive right eigenvector v, and ergodicity coefficient τ ; let D be a diagonal n × n matrix with positive diagonal elements; and let . be a norm on Rn . Then τ≤
x∈R
n
max ,x≤1,xT
D −1 v=0
xT D −1 P D.
Examples: 1. We illustrate Fact 1 using the matrix ⎡1
P =
2 ⎢1 ⎢ ⎣4 3 4
1 6 1 4 1 8
1⎤ 3 ⎥ 1⎥ . 2⎦ 1 8
√ 1
√ 1 −3 − 33 , 48 −3 + 33 , so ρ(A) = 1. Also, v = [1, 1, 1]T and The eigenvalues of P are 1, 48 w = [57, 18, 32] are positive right and left eigenvectors, respectively, corresponding to eigenvalue
96
Handbook of Linear Algebra
1 and ⎡
vw = wv
57 107 ⎢ 57 ⎢ ⎣ 107 57 107
32 ⎤ 107 ⎥ 32 ⎥ . 107 ⎦ 32 107
18 107 18 107 18 107
2. We illustrate parts of Facts 5 and 6 using the matrix
P ≡
0
1
1
0
.
The spectral radius of P is 1 with corresponding right and left eigenvectors v = (1, 1)T and . Evidently, w = (1, 1), respectively, the period of P is 2, and (I − P )# = I −P 4
P
m
=
I
if m is even
P
if m is odd .
In particular, lim P 2m = I
and
lim P 2m+1 = P
and
m→∞
.5 I+P 1 m [P + P m+1 ] = = 2 2 .5
.5
m→∞
= v(wv)−1 w for each m = 0, 1, . . . ,
.5
assuring that, trivially,
.5 1 m+1 Pt = lim m→∞ 2 .5 t=m
.5
.5
= v(wv)−1 w.
In this example, τ (P ) is 0 (as the maximum over the empty set) and the convergence of the above sequences is geometric with rate 0. Finally, m−1
m(I +P )
Pt =
t=0
2 m(I +P ) 2
if m is even +
I −P 2
if m is odd,
implying that lim P m =
m→∞
(I + P ) = v(wv)−1 w (C,1) 2
and lim
m→∞
m−1
t=0
Pt − m
I+P 2
=
I−P (C,1) . 4
0 1 . Then ρ(P + F ) = 3. We illustrate parts of Fact 10 using the matrix P of Example 2 and F ≡ 0 0 √ k (−1)k+1 2k−3 1 + = 1 + 12 + ∞ k=2 k22k−2 k−2 . 4. [RT85, Theorem 4.1] and [Hof67] With . as the 1norm on Rn and d1 , . . . , dn as the (positive) diagonal elements of D, the bound in Fact 11 on the coefficient of ergodicity τ (P ) of P becomes max
r,s =1,...,n,r =s
1 ds v r + dr v s
n
k=1
dk v s Pr k − v r Ps k  .
97
Nonnegative Matrices and Stochastic Matrices
With D = I , a relaxation of this bound on τ (P ) yields the expression ≤ min
⎧ ⎨ ⎩
ρ−
n
j =1
min i
Pi j v j vi
n
,
max i
j =1
Pi j v j vi
−ρ
⎫ ⎬ ⎭
.
5. [RT85, Theorem 4.3] For a positive vector u ∈ Rn , consider the function M u : Rn → R defined for a ∈ Rn by M u (a) = max{xT a : x ∈ Rn , x ≤ 1, xT u = 0}. This function has a simple explicit representation obtained by sorting the ratios a permutation j (1), . . . , j (n) of 1, . . . , n such that
aj uj
, i.e., identifying
a j (1) a j (2) a j (n) ≤ ≤ ··· ≤ . u j (1) u j (2) u j (n) With k as the smallest integer in {1, . . . , n} such that 2 ⎛
µ≡1+⎝
n
k
p=1
u j ( p) >
ut − 2
t=1
t=1
ut and
⎞
k
n
u j ( p) ⎠ ,
p=1
we have that M u (a) =
k −1
a j ( p) + µa j (k ) −
n
a j ( p) .
p=k +1
p=1
With . as the ∞norm on Rn and (D −1 P D)1 , . . . , (D −1 P D)n as the columns of D −1 P D, the bound in Fact 11 on the coefficient of ergodicity τ (P ) of P becomes max M D
r =1,...,n
9.3
−1
w
[(D −1 P D)r ].
Reducible Matrices
Definitions: For a nonnegative n × n matrix P with spectral radius ρ: A basic class of P is an access equivalence class B of P with ρ(P [B]) = ρ. The period of an access equivalence class C of P (also known as the index of imprimitivity of C ) is the period of the (irreducible) matrix P [C ]. The period of P (also known as the index of imprimitivity of P ) is the least common multiple of the periods of its basic classes. P is aperiodic if its period is 1. The index of P , denoted ν P , is ν P (ρ). The coindex of P , denoted ν¯ P , is max{ν P (λ) : λ ∈ σ (P ), λ = ρ and λ = ρ} (with the maximum over the empty set defined as 0). The basic reduced digraph of P , denoted R ∗ (P ), is the digraph whose vertexset is the set of basic classes of P and whose arcs are the pairs (B, B ) of distinct basic classes of P for which there exists a simple walk in R[(P )] from B to B . The height of a basic class is the largest number of vertices on a simple walk in R ∗ (P ) which ends at B. The principal submatrix of P at a distinguished eigenvalue λ, denoted P [λ], is the principal submatrix of P corresponding to a set of vertices of (P ) having no access to a vertex of an access equivalence class C that satisfies ρ(P [C ]) > λ.
98
Handbook of Linear Algebra
P P P P
is convergent or transient if limm→∞ P m = 0. is semiconvergent if limm→∞ P m exists. is weakly expanding if P u ≥ u for some u > 0. is expanding if for some P u > u for some u > 0.
An n×n matrix polynomial of degree d in the (integer) variable m is a polynomial in m with coefficients that are n × n matrices (expressible as S(m) = dt=0 mt Bt with B1 , . . . , Bd as n × n matrices and Bd = 0). Facts: Facts requiring proofs for which no specific reference is given can be found in [BP94, Chap. 2]. 1. The set of basic classes of a nonnegative matrix is always nonempty. 2. (Spectral Properties of the Perron Value) Let P be a nonnegative n × n matrix with spectral radius ρ and index ν. (a) [Fro12] ρ is an eigenvalue of P . (b) [Fro12] There exist semipositive right and left eigenvectors of P corresponding to ρ, i.e., ρ is a distinguished eigenvalue of both P and P T . (c) [Rot75] ν is the largest number of vertices on a simple walk in R ∗ (P ). (d) [Rot75] For each basic class B having height h, there exists a generalized eigenvector v B in Nρh (P ), with (v B )i > 0 if i → B and (v B )i = 0 otherwise. (e) [Rot75] The dimension of Nρν (P ) is the number of basic classes of P . Further, if B1 , . . . , B p are the basic classes of P and v B1 , . . . , v Br are generalized eigenvectors of P at ρ that satisfy the conclusions of Fact 2(d) with respect to B1 , . . . , Br , respectively, then v B1 , . . . , v B p form a basis of Nρν (P ). (f) [RiSc78, Sch86] If B1 , . . . , B p is an enumeration of the basic classes of P with nondecreasing heights (in particular, s < t assures that we do not have Bt → Bs ), then there exist generalized eigenvectors v B1 , . . . , v B p of P at ρ that satisfy the assumptions and conclusions of Fact 2(e) and a nonnegative p × p upper triangular matrix M with all diagonal elements equal to ρ, such that P [v B1 , . . . , v B p ] = [v B1 , . . . , v B p ]M (in particular, v B1 , . . . , v B p is a basis of Nρν (P )). Relationships between the matrix M and the Jordan Canonical Form of P are beyond the scope of the current review; see [Sch56], [Sch86], [HS89], [HS91a], [HS91b], [HRS89], and [NS94]. (g) [Vic85], [Sch86], [Tam04] If B1 , . . . , Br are the basic classes of P having height 1 and v B1 , . . . , v Br are generalized eigenvectors of P at ρ that satisfy the conclusions of Fact 2(d) with respect to B1 , . . . , Br , respectively, then v B1 , . . . , v Br are linearly independent, nonnegative eigenvectors + n n 1 1 of P at ρ that span the cone (R+ 0 ) ∩ Nρ (P ); that is, each vector in the cone (R0 ) ∩ Nρ (P ) is a B1 Br Bs linear combination with nonnegative coefficients of v , . . . , v (in fact, the sets {αv : α ≥ 0} n 1 for s = 1, . . . , r are the the extreme rays of the cone (R+ 0 ) ∩ Nρ (P )). 3. (Spectral Properties of Eigenvalues λ = ρ(P ) with λ = ρ(P )) Let P be a nonnegative n × n matrix with spectral radius ρ, index ν, coindex ν¯ , period q , and coefficient of ergodicity τ . (a) [Rot81a] The following are equivalent: i. {λ ∈ σ (P ) \ {ρ} : λ = ρ} = ∅. ii. ν¯ = 0. iii. P is aperiodic (q = 1).
99
Nonnegative Matrices and Stochastic Matrices
(b) [Rot81a] If λ ∈ σ (P ) \ {ρ} and λ = ρ, then ( ρλ )h = 1 for some h ∈ {2, . . . , n}; further, q = min{h = 2, . . . , n : ( ρλ )h = 1 for each λ ∈ σ (P ) \ {ρ} with λ = ρ} ≤ n (here the minimum over the empty set is taken to be 1). (c) [Rot80] If λ ∈ σ (P ) \ {ρ} and λ = ρ, then ν P (λ) is bounded by the largest number of vertices on a simple walk in R ∗ (P ) with each vertex corresponding to a (basic) access equivalence class C that has λ ∈ σ (P [C ]); in particular, ν¯ ≤ ν. 4. (Distinguished Eigenvalues) Let P be a nonnegative n × n matrix. (a) [Vic85] λ is a distinguished eigenvalue of P if and only if there is a final set C with ρ(P [C ]) = λ. It is noted that the set of distinguished eigenvalues of P and P T need not coincide (and the above characterization of distinguished eigenvalues is not invariant of the application of the transpose operator). (See Example 1 below.) (b) [HS88b] If λ is a distinguished eigenvalue, ν P (λ) is the largest number of vertices on a simple walk in R ∗ (P [λ]). (c) [HS88b] If µ > 0, then µ ≤ min{λ : λ is a distinguished eigenvalue of P } if and only if there exists a vector u > 0 with P u ≥ µu. (For additional characterizations of the minimal distinguished eigenvalue, see the concluding remarks of Facts 12(h) and 12(i).) Additional properties of distinguished eigenvalues λ of P that depend on P [λ] can be found in [HS88b] and [Tam04]. 5. (Convergence Properties of Powers) Let P be a nonnegative n × n matrix with positive spectral radius ρ, index ν, coindex ν¯ , period q , and coefficient of ergodicity τ (for the case where ρ = 0, see Fact 12(j) below). (a) [Rot81a] There exists an n × n matrix polynomial S(m) of degree ν − 1 in the (integer) variable m such that limm→∞ [( Pρ )m − S(m)] = 0 (C, p) for every p ≥ ν¯ ; further, if P is aperiodic, this limit holds as a regular limit and the convergence is geometric with rate ρτ < 1. (b) [Rot81a] There exist matrix polynomials S 0 (m), . . . , S q −1 (m) of degree ν − 1 in the (integer) variable m, such that for each k = 0, . . . , q − 1, limm→∞ [( Pρ )mq +k − S t (m)] = 0 and the convergence of these sequences to their limit is geometric with rate ( ρτ )q < 1. (c) [Rot81a] There exists a matrix polynomial T (m) of degree ν in the (integer) variable m with P s ¯ ; further, if P is aperiodic, this limit limm→∞ [ m−1 s =0 ( ρ ) − T (m)] = 0 (C, p) for every p ≥ ν holds as a regular limit and the convergence is geometric with rate ρτ < 1. (d) [FrSc80] The limit of
Pm [I ρ m mν−1
+
P ρ
+ · · · + ( Pρ )q −1 ] exists and is semipositive.
(e) [Rot81b] Let x = [xi ] be a nonnegative vector in Rn and let i ∈ n. With K (i, x) ≡ { j ∈ n : j → i } ∩ { j ∈ n : u → j for some u ∈ n with xu > 0}, r (i x, P ) ≡ inf{α > 0 : lim α −m (P m x)i = 0} = ρ(P [K (i, x)]) m→∞
and if r ≡ r (i x, P ) > 0, k(i x, P ) ≡ inf{k = 0, 1, . . . : lim m−k r −m (P m x)i = 0} = ν P [K (i,x)] (r ). m→∞
Explicit expressions for the polynomials mentioned in Facts 5(a) to 5(d) in terms of characteristics of the underlying matrix P are available in Fact 12(a)ii for the case where ν = 1 and in [Rot81a] for the general case. In fact, [Rot81a] provides (explicit) polynomial approximations of additional highorder partial sums of normalized powers of nonnegative matrices. 6. (Bounds on the Perron Value) Let P be a nonnegative n × n matrix with spectral radius ρ and let µ be a nonnegative scalar.
910
Handbook of Linear Algebra
(a) For ∈ {<, ≤, =, ≥, >}, [P u µu for some vector u > 0] ⇒ [ρ µ] ; further, the inverse implication holds for as <, implying that ρ = max min
x0 {i : xi >0}
(Ax)i . xi
(b) For ∈ {, ≤, =, ≥, }, [ρ µ] ⇒ [P u µu for some vector u 0] ; further, the inverse implication holds for as ≥ . (c) ρ < µ if and only if P u < ρu for some vector u ≥ 0 . Since ρ(P T ) = ρ(P ), the above properties (and characterizations) of ρ can be expressed by applying the above conditions to P T . (See Example 3 below.) Some of the above results can be expressed in terms of the Collatz–Wielandt sets. (See Fact 7 of Section 9.2 and Chapter 26.) 7. (Bounds on the Spectral Radius) Let P be a nonnegative n × n matrix and let A be a complex n × n matrix such that A ≤ P . Then ρ(A) ≤ ρ(P ). 8. (Functional Inequalities) Consider the function ρ(.) mapping nonnegative n × n matrices to their spectral radius. (a) ρ(.) is nondecreasing in each element (of the domain matrices); that is, if A and B are nonnegative n × n matrices with A ≥ B ≥ 0, then ρ(A) ≥ ρ(B). (b) [Coh78] ρ(.) is (jointly) convex in the diagonal elements; that is, if A and D are n × n matrices, with D diagonal, A and A+ D nonnegative, and if 0 < α < 1, then ρ[α A+(1−α)(A+ D)] ≤ αρ(A) + (1 − α)ρ(A + D). (c) [EJD88] If A = [ai j ] and B = [bi j ] are nonnegative n × n matrices, 0 < α < 1 and C = [c i j ] for each i, j = 1, . . . , n, then ρ(C ) ≤ ρ(A)α ρ(B)1−α . with c i j = aiαj bi1−α j Further functional inequalities about ρ(.) can be found in [EJD88] and [EHP90]. 9. (Resolvent Expansions) Let P be a nonnegative square matrix with spectral radius ρ and let µ > ρ. Then µI − P is invertible and (µI − P )−1 =
∞
Pt t=0
µt+1
≥
P I I + ≥ ≥0 µ µ2 µ
(the invertibility of µI − P and the power series expansion of its inverse do not require nonnegativity of P ). For explicit expansions of the resolvent about the spectral radius, that is, for explicit power series representations of [(z + ρ)I − P ]−1 with z positive and sufficiently small, see [Rot81c], and [HNR90] (the latter uses such expansions to prove Perron–Frobeniustype spectral results for nonnegative matrices). 10. (Puiseux Expansions of the Perron Value) [ERS95] The function ρ(.) mapping irreducible nonnegative n × n matrices X = [xi j ] to their spectral radius has a converging Puiseux (fractional power series) expansion at each point; i.e., if P is a nonnegative n × n matrix and if F is an n × n matrix with P + F ≥ 0 for all sufficiently small positive , then ρ(P + F ) has a representation ∞ k/q with ρ0 = ρ(P ) and q as a positive integer. k=0 ρk 11. (Bounds on the Ergodicity Coefficient) [RT85, extension of Theorem 3.1] Let P be a nonnegative n × n matrix with spectral radius ρ, corresponding semipositive right eigenvector v, and ergodicity
911
Nonnegative Matrices and Stochastic Matrices
coefficient τ , let D be a diagonal n × n matrix with positive diagonal elements, and let . be a norm on Rn . Then τ≤
max
x∈R ,x≤1,xT D −1 v=0 n
xT D −1 P D.
12. (Special Cases) Let P be a nonnegative n × n matrix with spectral radius ρ, index ν, and period q . (a) (Index 1) Suppose ν = 1. i. ρ I − P has a group inverse. ii. [Rot81a] With P ≡ I − (ρ I − P )(ρ I − P )# , all of the convergence properties stated in Fact 6 of Section 9.2 apply. iii. If ρ > 0, then
Pm ρm
is bounded in m (elementwise).
iv. ρ = 0 if and only if P = 0. (b) (Positive eigenvector) The following are equivalent: i. P has a positive right eigenvector corresponding to ρ. ii. The final classes of P are precisely its basic classes. iii. There is no vector w satisfying wT P ρwT . Further, when the above conditions hold: i. ν = 1 and the conclusions of Fact 12(a) hold. ii. If P satisfies the above conditions and P = 0, then ρ > 0 and there exists a diagonal matrix D having positive diagonal elements such that S ≡ ρ1 D −1 P D is stochastic (that is, S ≥ 0 and S1 = 1; see Chapter 4). (c) [Sch53] There exists a vector x > 0 with P x ≤ ρx if and only if every basic class of P is final. (d) (Positive generalized eigenvector) [Rot75], [Sch86], [HS88a] The following are equivalent: i. P has a positive right generalized eigenvector at ρ. ii. Each final class of P is basic. iii. P u ≥ ρu for some u > 0. iv. Every vector w ≥ 0 with wT P ≤ ρwT must satisfy wT P = ρwT . v. ρ is the only distinguished eigenvalue of P . (e) (Convergent/Transient) The following are equivalent: i. P is convergent. ii. ρ < 1. iii. I − P is invertible and (I − P )−1 ≥ 0. iv. There exists a positive vector u ∈ R n with P u < u. Further, when the above conditions hold, (I − P )−1 =
∞
t=0
Pt ≥ I.
(f) (Semiconvergent) The following are equivalent: i. P is semiconvergent. ii. Either ρ < 1 or ρ = ν = 1 and 1 is the only eigenvalue λ of P with λ = 1. (g) (Bounded) P m is bounded in m (elementwise) if and only if either ρ < 1 or ρ = 1 and ν=1. (h) (Weakly Expanding) [HS88a], [TW89] [DR05] The following are equivalent: i. P is weakly expanding. ii. There is no vector w ∈ R n with w ≥ 0 and w T P w T . iii. Every distinguished eigenvalue λ of P satisfies λ ≥ 1.
912
Handbook of Linear Algebra
iv. Every final class C of P has ρ(P [C ]) ≥ 1. v. If C is a final set of P , then ρ(P [C ]) ≥ 1. Given µ > 0, the application of the above equivalence to µP yields characterizations of instances where each distinguished eigenvalue of P is bigger than or equal to µ. (i) (Expanding) [HS88a], [TW89] [DR05] The following are equivalent: i. P is expanding. ii. There exists a vector u ∈ R n with u ≥ 0 and P u > u. iii. There is no vector w ∈ R n with w 0 and w T P ≤ w T . iv. Every distinguished eigenvalue λ of P satisfies λ > 1. v. Every final class C of P has ρ(P [C ]) > 1. vi. If C is a final set of P , then ρ(P [C ]) > 1. Given µ > 0, the application of the above equivalence to µP yields characterizations of instances where each distinguished eigenvalue of P is bigger than µ. (j) (Nilpotent) The following are equivalent conditions: i. P is nilpotent; that is, P m = 0 for some positive integer m. ii. P is permutation similar to an upper triangular matrix all of whose diagonal elements are 0. iii. ρ = 0. iv. P n = 0. v. P ν = 0. (k) (Symmetric) Suppose P is symmetric. i. ρ = maxu0 ii. ρ =
uT P u . uT u
uT P u uT u
for u 0 if and only if u is an eigenvector of P corresponding to ρ. √ T T iii. [CHR97, Theorem 1] For u, w 0 with w i = ui (P u)i for i = 1, . . . , n, uuTPuu ≤ wwTPww and equality holds if and only if u[S] is an eigenvector of P [S] corresponding to ρ, where S ≡ {i : ui > 0}. Examples: 1. We illustrate parts of Fact 2 using the matrix ⎡
2 ⎢0 ⎢ ⎢ ⎢0 P =⎢ ⎢0 ⎢ ⎣0 0
2 2 0 0 0 0
2 0 1 0 0 0
0 0 2 1 1 0
0 0 0 1 1 0
⎤
0 0⎥ ⎥ 0⎥ ⎥ ⎥. 0⎥ ⎥ 1⎦ 1
The eigenvalues of P are 2,1, and 0; so, ρ(P ) = 2 ∈ σ (P ) as is implied by Fact 2(a). The vectors v = [1, 0, 0, 0, 0, 0]T and w = [0, 0, 0, 1, 1, 1] are semipositive right and left eigenvectors corresponding to the eigenvalue 2; their existence is implied by Fact 2(b). The basic classes are B1 = {1}, B1 = {2} and B3 = {4, 5}. The digraph corresponding to P , its reduced digraph, and the basic reduced digraph of P are illustrated in Figure 9.1. From Figure 9.1(c), the largest number of vertices in a simple walk in the basic reduced digraph of P is 2 (going from B1 to either B2 or B3 ); hence, Fact 2(c) implies that ν P (2) = 2. The height of basic class B1 is 1 and the height of basic classes B2 and B3 is 2. Semipositive generalized eigenvectors of P at (the eigenvalue)
913
Nonnegative Matrices and Stochastic Matrices
1 3
2
{3}
4
{1}
{1}
{2}
{2}
{4,5} {4,5}
5
{6}
6 (a)
(b)
(c)
FIGURE 9.1 (a) The digraph (P ), (b) reduced digraph R[(P )], and (c) basic reduced digraph R ∗ (P ).
2 that satisfy the assumptions of Fact 2(f) are u B1 = [1, 0, 0, 0, 0, 0]T , u B2 = [1, 1, 0, 0, 0, 0]T , and u B3 = [1, 0, 2, 1, 1, 0]T . The implied equality P [u B1 , . . . , u B p ] = [u B1 , . . . , u B p ]M of Fact 2(f) holds as ⎡
2 ⎢0 ⎢ ⎢ ⎢0 ⎢ ⎢0 ⎢ ⎣0 0
2 2 0 0 0 0
2 0 1 0 0 0
0 0 2 1 1 0
0 0 0 1 1 0
⎤⎡
0 1 ⎢ 0⎥ ⎥ ⎢0 ⎥⎢ 0⎥ ⎢0 ⎥⎢ 0⎥ ⎢0 ⎥⎢ 1⎦ ⎣0 1 0
1 1 0 0 0 0
⎤
⎡
1 2 ⎢ 0⎥ ⎥ ⎢0 ⎢ 2⎥ ⎥ ⎢0 ⎥=⎢ 1⎥ ⎢0 ⎥ ⎢ 1⎦ ⎣0 0 0
4 2 0 0 0 0
⎤
⎡
6 1 ⎢ 0⎥ ⎥ ⎢0 ⎢ 4⎥ ⎥ ⎢0 ⎥=⎢ 2⎥ ⎢0 ⎥ ⎢ 2⎦ ⎣0 0 0
1 1 0 0 0 0
⎤
1 ⎡ 0⎥ ⎥ 2 ⎥ 2⎥ ⎢ ⎥ ⎣0 1⎥ ⎥ 0 1⎦ 0
2 2 0
⎤
4 ⎥ 0⎦. 2
ν(P ) 2 In particular, Fact 2(e) implies that u B1 , u B2 , u B3 form a basis of Nρ(P ) = N2 . We note that 1 B1 while there is only a single basic class of height 1, dim[Nρ (P )] = 2 and u , 2u B2 − u B3 = n 1 [−1, 2, −2, −1, −1, 0]T form a basis of Nρ1 (P ). Still, Fact 2(g) assures that (R+ 0 ) ∩ Nρ (P ) is the B1 cone {αu : α ≥ 0} (consisting of its single ray). Fact 4(a) and Figure 9.1 imply that the distinguished eigenvalues of P are 1 and 2, while 2 is the T only distinguished eigenvalue of P . 0 1 2. Let H = ; properties of H were demonstrated in Example 2 of section 9.2. We will demon1 0
strate Facts 2(c), 5(b), and 5(a) on the matrix
H P ≡ 0
I . H
The spectral radius of P is 1 and its basic classes of P are B1 = {1, 2} and B2 = {3, 4} with B1 having access to B2 . Thus, the index of 1 with respect to P , as the largest number of vertices on a walk of the marked reduced graph of P , is 2 (Fact 2(c)). Also, as the period of each of the two basic
914
Handbook of Linear Algebra
classes of P is 2, the period of P is 2. To verify the convergence properties of P , note that
P
m
⎧ I mH ⎪ ⎪ ⎪ ⎪ ⎨ 0 I = ⎪ ⎪ ⎪ H mI ⎪ ⎩
0
if m is even if m is odd,
H
immediately providing matrix–polynomials S 0 (m) and S 1 (m) of degree 1 such that limm→∞ P 2m − S 0 (m) = 0 and limm→∞ P 2m+1 − S 1 (m) = 0. In this example, τ (P ) is 0 (as the maximum over the empty set) and the convergence of the above sequences is geometric with rate 0. The above representation of P m shows that
P
m
Hm = 0
mH m+1 Hm
and Example 2 of section 9.2 shows that
lim H m =
m→∞
I+H .5 = .5 2
.5 .5
(C,1).
We next consider the upperright blocks of P m . We observe that
1 m−1 P t [B1 , B2 ] = m t=0
=
mI
+ (m−2)H 4 4 (m−1)2 I (m2 −1)H + 4m 4m m(I +H) H − 4 2 m(I +H) I −H − + I 4m 4 2
if m is even if m is odd, if m is even if m is odd,
implying that
1 m−1 P t [B1 , B2 ] − m m→∞ m t=0
lim
As m − 1 =
1 m
m−1 t=0
I+H 4
+
I+H = 0 (C,1). 4
t for each m = 1, 2, . . . , the above shows that
1 m−1 P t [B1 , B2 ] − t m→∞ m t=0
lim
I+H 4
= 0 (C,1),
and, therefore (recalling that (C,1)convergence implies (C,2)convergence), ⎧ ⎪ ⎪ ⎪ ⎨
⎡
.5 .5 −.25m ⎢ ⎢.5 .5 −.25m lim P m − ⎢ m→∞ ⎪ .5 ⎣0 0 ⎪ ⎪ ⎩ 0 0 .5
⎤⎫
−.25m ⎪ ⎪ ⎪ ⎬ −.25m⎥ ⎥ ⎥ = 0 (C,2). .5 ⎦⎪ ⎪ ⎪ ⎭ .5
3. Fact 6 implies many equivalencies, in particular, as the spectral radius of a matrix equals that of its transpose. For example, for a nonnegative n × n matrix P with spectral radius ρ and nonnegative scalar µ, the following are equivalent: (a) ρ < µ. (b) P u < µu for some vector u > 0. (c) wT P < µwT for some vector w > 0.
Nonnegative Matrices and Stochastic Matrices
915
(d) P u < ρu for some vector u ≥ 0. (e) wT P < ρwT for some vector w ≥ 0. (f) There is no vector u 0 satisfying P u ≥ µu. (g) There is no vector w 0 satisfying wT P ≥ µwT .
9.4
Stochastic and Substochastic Matrices
(For more information about stochastic matrices see Chapter 54 (including examples).) Definitions: A square n ×n matrix P = [ pi j ] is stochastic if it is nonnegative and P 1 = 1 where 1 = [1, . . . , 1]T ∈ R n . (Stochastic matrices are sometimes referred to as rowstochastic, while columnstochastic matrices are matrices whose transpose is (row)stochastic.) A square n × n matrix P is doubly stochastic if both P and its transpose are stochastic. The set of doubly stochastic matrices of order n is denoted n . A square n × n matrix P is substochastic if it is nonnegative and P 1 ≤ 1. A transient substochastic matrix is also called stopping. An ergodic class of a stochastic matrix P is a basic class of P . A transient class of a stochastic matrix P is an access equivalence class of P which is not ergodic. A state of an n × n stochastic matrix P is an index i ∈ {1, . . . , n}. Such a state is ergodic or transient depending on whether it belongs to an ergodic class or to a transient class. A stationary distribution of a stochastic matrix P is a nonnegative vector π that satisfies π T 1 = 1 and T π P = πT . Facts: Facts requiring proofs for which no specific reference is given follow directly from facts in Sections 9.2 and 9.3 and/or can be found in [BP94, Chap. 8]. 1. Let P = [ pi j ] be an n × n stochastic matrix. (a) ρ(P ) = 1, 1 ∈ R n is a right eigenvector of P corresponding to 1 and the stationary distributions of P are nonnegative eigenvectors of P corresponding to 1. (b) ν P (1) = 1. (c) I − P has a group inverse. (d) The height of every ergodic class is 1. (e) The final classes of P are precisely its ergodic classes. (f) i. For every ergodic class C , P has a unique stationary distribution π C of P with (π C )i > 0 if i ∈ C and (π C )i = 0 otherwise. ii. If C 1 , . . . , C p are the ergodic classes of P , then the corresponding stationary distributions 1 p π C , . . . , π C (according to Fact 1(f)i above) form a basis of the set of left eigenvectors of P corresponding to the eigenvalue 1; further, every stationary distribution of P is a convex combination of these vectors.
916
Handbook of Linear Algebra
(g) i. Let T and R be the sets of transient and ergodic states of P , respectively. The matrix I − P [T ] is nonsingular and for each ergodic class C of P , the vector uC given by (uC )[K ] =
⎧ ⎪ ⎨e
if K = C if K = R \ C if K = T
0 ⎪ ⎩(I − P [T ])−1 P [T, C ]e
is a right eigenvector of P corresponding to the eigenvalue 1; in particular, (uC )i > 0 if i has access to C and (uC )i = 0 if i does not have access to C . 1
p
ii. If C 1 , . . . , C p are the ergodic classes of P , then the corresponding vectors uC , . . . , uC (referred to in Fact 1(g)i above) form a basis of the set of right eigenvectors of P correp t sponding to the eigenvalue 1; further, t=1 uC = e. 1
p
(h) Let C 1 , . . . , C p be the ergodic classes of P , π C , . . . , π C the corresponding stationary dis1 p tributions (referred to in Fact 1(f)i above), and uC , . . . , uC the corresponding eigenvectors referred to in Fact 1(g)i above. Then the matrix ⎡ 1⎤ πC " ⎢ 1 p . ⎥ ⎥ P = uC , . . . , uC ⎢ ⎣ .. ⎦ !
πC
p
is stochastic and satisfies P [n, C ] = 0 if C is a transient class of P , P [i, C ] = 0 if C is an ergodic class and i has access to C , and P [i, C ] = 0 if C is an ergodic class and i does not have access to C . (i) The matrix P from Fact 1(h) above has the representation I − (I − P )# (I − P ); further, I − P + P is nonsingular and (I − P )# = (I − P + P )−1 (I − P ). (j) With P as the matrix from Fact 1(h) above, limm→∞ P m = P (C,1); further, when P is aperiodic, this limit holds as a regular limit and the convergence is geometric with rate τ (P ) < 1.
t
# (k) With P as the matrix from Fact 1(h) above, limm→∞ m−1 t=0 P − mP = (I − P ) (C,1); further, when P is aperiodic, this limit holds as a regular limit and the convergence is geometric with rate τ (P ) < 1.
(l) With D a diagonal n × n matrix with positive diagonal elements and . a norm on Rn , τ (P ) ≤
x∈R
n
max ,x≤1,xT
D −1 1=0
xT D −1 P D.
In particular, with . as the 1norm on Rn and D = I , the above bound specializes to τ (P ) ≤
max
r,s =1,...,n,r =s
n
 pr k − p s k  k=1
2
≤ min 1 −
n
k=1
min pr k , r
n
k=1
#
max pr k − 1 r
(cf. Fact 11 of section 9.3 and Example 4 of section 9.2). (m) For every 0 < α < 1, Pα ≡ (1 − α)I + α P is an aperiodic stochastic matrix whose ergodic classes, transient classes, stationary distributions, and the vectors of Fact 1(g)i coincide with those of P . In particular, with P and Pα as the matrices from Fact 1(h) corresponding to P and Pα , respectively, limm→∞ (Pα )m = Pα = P .
917
Nonnegative Matrices and Stochastic Matrices
2. Let P be an irreducible stochastic matrix with coefficient of ergodicity τ . (a) P has a unique stationary distribution, say π. Also, up to scalar multiple, 1 is a unique right eigenvector or P corresponding to the eigenvalue 1. (b) With π as the unique stationary distribution of P , the matrix P from Fact 1(h) above equals 1π. 3. A doubly stochastic matrix is a convex combination of permutation matrices (in fact, the n × n permutation matrices are the extreme points of the set n of n × n doubly stochastic matrices). 4. Let P be an n × n substochastic matrix. (a) ρ(P ) ≤ 1. (b) ν P (1) ≤ 1. (c) I − P has a group inverse. (d) The matrix P ≡ I − (I − P )# (I − P ) is substochastic; further, I − P + P is nonsingular and (I − P )# = (I − P + P )−1 (I − P ). (e) With P as in Fact 4(d), limm→∞ P m = P (C,1); further, when every access equivalence class C with ρ(P [C ]) = 1 is aperiodic, this limit holds as a regular limit and the convergence is geometric with rate max{λ : λ ∈ σ (P ) and λ = 1} < 1.
t
# (f) With P as the matrix from Fact 4(d) above, limm→∞ m−1 t=0 P − mP = (I − P ) (C,1); further, when every access equivalence class C with ρ(P [C ]) = 1 is aperiodic, this limit holds as a regular limit and the convergence is geometric with rate max{λ : λ ∈ σ (P ) and λ = 1} < 1.
(g) The following are equivalent: i. ii. iii. iv.
P is stopping. ρ(P ) < 1. I − P is invertible. There exists a positive vector u ∈ R n with P u < u.
Further, when the above conditions hold, (I − P )−1 =
∞
t=0
P t ≥ 0.
9.5 MMatrices Definitions: An n × n real matrix A = [ai j ] is a Zmatrix if its offdiagonal elements are nonpositive, i.e., if ai j ≤ 0 for all i, j = 1, . . . , n with i = j . An M0 matrix is a Zmatrix A that can be written as A = s I − P with P as a nonnegative matrix and with s as a scalar satisfying s ≥ ρ(P ). An Mmatrix A is a Zmatrix A that can be written as A = s I − P with P as a nonnegative matrix and with s as a scalar satisfying s > ρ(P ). A square real matrix A is an inverse Mmatrix if it is nonsingular and its inverse is an Mmatrix. A square real matrix A is inversenonnegative if it is nonsingular and A−1 ≥ 0 (the property is sometimes referred to as inversepositivity). A square real matrix A has a convergent regular splitting if A has a representation A = M − N such that N ≥ 0, M invertible with M −1 ≥ 0 and M −1 N is convergent. A square complex matrix A is positive stable if the real part of each eigenvalue of A is positive; A is nonnegative stable if the real part of each eigenvalue of A is nonnegative. An n × n complex matrix A = [ai j ] is strictly diagonally dominant (diagonally dominant) if aii  > nj=1, j =i ai j  (aii  ≥ nj=1, j =i ai j ) for i = 1, . . . , n. An n × n Mmatrix A satisfies property C if there exists a representation of A of the form A = s I − P with s > 0, P ≥ 0 and Ps semiconvergent.
918
Handbook of Linear Algebra
Facts: Facts requiring proofs for which no specific reference is given follow directly from results about nonnegative matrices stated in Sections 9.2 and 9.3 and/or can be found in [BP94, Chap. 6]. 1. Let A be an n × n real matrix with n ≥ 2. The following are equivalent: (a) A is an Mmatrix; that is, A is a Zmatrix that can be written as s I − P with P nonnegative and s > ρ(P ). (b) A is a nonsingular M 0 matrix. (c) For each nonnegative diagonal matrix D, A + D is inversenonnegative. (d) For each µ ≥ 0, A + µI is inversenonnegative. (e) Each principal submatrix of A is inversenonnegative. (f) Each principal submatrix of A of orders 1, . . . , n is inversenonnegative. 2. Let A = [ai j ] be an n × n Zmatrix. The following are equivalent:∗ (a) A is an Mmatrix. (b) Every real eigenvalue of A is positive. (c) A + D is nonsingular for each nonnegative diagonal matrix D. (d) All of the principal minors of A are positive. (e) For each k = 1, . . . , n, the sum of all the k × k principal minors of A is positive. (f) There exist lower and upper triangular matrices L and U , respectively, with positive diagonal elements such that A = LU . (g) A is permutation similar to a matrix satisfying condition 2(f). (h) A is positive stable. (i) There exists a diagonal matrix D with positive diagonal elements such that AD + D AT is positive definite. (j) There exists a vector x > 0 with Ax > 0. (k) There exists a vector x > 0 with Ax 0 and
i
j =1
ai j x j > 0 for i = 1, . . . , n.
(l) A is permutation similar to a matrix satisfying condition 2(k). (m) There exists a vector x > 0 such that Ax 0 and the matrix Aˆ = [aˆ i j ] defined by
aˆ i j =
1 if either ai j = 0 or (Ax)i = 0 0 otherwise
is irreducible. (n) All the diagonal elements of A are positive and there exists a diagonal matrix D such that AD is strictly diagonally dominant. (o) A is inversenonnegative. (p) Every representation of A of the form A = M − N with N ≥ 0 and M inversepositive must have M −1 N convergent (i.e., ρ(M −1 N) < 1). (q) For each vector y ≥ 0, the set {x ≥ 0 : AT x ≤ y} is bounded and A is nonsingular.
∗ Each of the 17 conditions that are listed in Fact 2 is a representative of a set of conditions that are known to be equivalent for all matrices (not just Zmatrices); see [BP94, Theorem 6.2.3]. For additional characterizations of Mmatrices, see [FiSc83].
Nonnegative Matrices and Stochastic Matrices
919
3. Let A be an irreducible n × n Zmatrix with n ≥ 2. The following are equivalent: (a) A is an Mmatrix. (b) A is a nonsingular and A−1 > 0. (c) Ax 0 for some x > 0. 4. Let A = [ai j ] be an n × n Mmatrix and let B = [bi j ] be an n × n Zmatrix with B ≥ A. Then: (a) B is an Mmatrix. (b) detB ≥ detA. (c) A−1 ≥ B −1 . (d) detA ≤ a11 . . . ann . 5. If P is an inverse Mmatrix, then P ≥ 0 and (P ) is transitive; that is, if (v, u) and (u, w ) are arcs of (P ), then so is (v, w ). 6. Let A be an n × n real matrix with n ≥ 2. The following are equivalent: (a) A is a nonsingular M 0 matrix. (b) For each diagonal matrix D with positive diagonal elements, A + D is inversenonnegative. (c) For each µ > 0, A + µI is inversenonnegative. 7. Let A be an n × n Zmatrix. The following are equivalent:∗ (a) A is an M 0 matrix. (b) Every real eigenvalue of A is nonnegative. (c) A + D is nonsingular for each diagonal matrix D having positive diagonal elements. (d) For each k = 1, . . . , n, the sum of all the k × k principal minors of A is nonnegative. (e) A is permutation similar to a matrix having a representation LU with L and U as lower and upper triangular matrices having positive diagonal elements. (f) A is nonnegative stable. (g) There exists a nonnegative matrix Y satisfying Y Ak+1 = Ak for some k ≥ 1. (h) A has a representation of the form A = M − N with M inversenonnegative, N ≥ 0 and k ∞ k B ≡ M −1 N satisfying ∩∞ k=0 range(B ) = ∩k=0 range(A ) and ρ(B) ≤ 1. (i) A has a representation of the form A = M − N with M inversenonnegative, M −1 N ≥ 0 and k ∞ k B ≡ M −1 N satisfying ∩∞ k=0 range(B ) = ∩k=0 range(A ) and ρ(B) ≤ 1. 8. Let A be an M 0 matrix. (a) A satisfies property C if and only if ν A (0) ≤ 1. (b) A is permutation similar to a matrix having a representation LU with L as a lower triangular Mmatrix and U as an upper triangular M 0 matrix. 9. [BP94, Theorem 8.4.2] If P is substochastic (see Section 9.4), then I − P is an M 0 matrix satisfying property C. 10. Let A be an irreducible n × n singular M 0 matrix. (a) A has rank n − 1. (b) There exists a vector x > 0 such that Ax = 0.
∗ Each of the 9 conditions that are listed in Fact 7 is a representative of a set of conditions that are known to be equivalent for all matrices (not just Zmatrices); see [BP94, Theorem 6.4.6]. For additional characterizations of Mmatrices, see [FiSc83].
920
Handbook of Linear Algebra
(c) A has property C. (d) Each principal submatrix of A other than A itself is an Mmatrix. (e) [Ax ≥ 0] ⇒ [Ax = 0].
9.6
Scaling of Nonnegative Matrices
A scaling of a (usually nonnegative) matrix is the outcome of its pre and postmultiplication by diagonal matrices having positive diagonal elements. Scaling problems concern the search for scalings of given matrices such that specified properties are satisfied. Such problems are characterized by: (a) The class of matrices to be scaled. (b) Restrictions on the pre and postmultiplying diagonal matrices to be used. (c) The target property. Classes of matrices under (a) may refer to arbitrary rectangular matrices, square matrices, symmetric matrices, positive semidefinite matrices, etc. For possible properties of pre and postmultiplying diagonal matrices under (b) see the following Definition subsection. Finally, examples for target properties under (c) include: i. The specification of the row and/or columnsums; for example, being stochastic or being doubly stochastic. See the following Facts subsection. ii. The specification of the row and/or columnmaxima. iii. (For a square matrix) being linesymmetric, that is, having each rowsum equal to the corresponding columnsum. iv. Being optimal within a prescribed class of scalings under some objective function. One example of such optimality is to minimize the maximal element of a scalings of the form X AX −1 . Also, in numerical analysis, preconditioning a matrix may involve its replacement with a scaling that has a low ratio of largest to smallest element; so, a potential target property is to be a minimizer of this ratio among all scalings of the underlying matrix. Typical questions that are considered when addressing scaling problems include: (a) Characterizing existence of a scaling that satisfies the target property (precisely of approximately). (b) Computing a scaling of a given matrix that satisfies the target property (precisely or approximately) or verifying that none exists. (c) Determining complexity bounds for corresponding computation. Early references that address scaling problems include [Kru37], which describes a heuristic for finding a doubly stochastic scaling of a positive square matrix, and Sinkhorn’s [Sin64] pioneering paper, which provides a formal analysis of that problem. The subject has been intensively studied and an aspiration to provide a comprehensive survey of the rich literature is beyond the scope of the current review; consequently, we address only scaling problems where the target is to achieve, precisely or approximately, prescribed row and columnsums. Definitions: Let A = [ai j ] be an m × n matrix. A scaling (sometimes referred to as an equivalencescaling or a D AE scaling) of A is any matrix of the form D AE where D and E are square diagonal matrices having positive diagonal elements; such a scaling is a rowscaling of A if E = I and it is a normalizedscaling if det(D) = det(E ) = 1. If m = n, a scaling D AE of A is a similarityscaling (sometimes referred to as a D AD −1 scaling) of A if E = D −1 , and D AE is a symmetricscaling (sometimes referred to as a D AD scaling) of A if E = D.
921
Nonnegative Matrices and Stochastic Matrices
The support (or sparsity pattern) of A, denoted Struct( A), is the set of indices i j with ai j = 0; naturally, this definition applies to vectors. Facts: 1. (PrescribedLineSum Scalings) [RoSc89] Let A = [ai j ] ∈ Rm×n be a nonnegative matrix, and let r = [r i ] ∈ Rm and c = [c j ] ∈ Rn be positive vectors. (a) The following are equivalent: i. There exists a scaling B of A with B1 = r and 1T B = cT . ii. There exists nonnegative m × n matrix B having the same support as A with B1 = r and 1T B = cT . iii. For every I ⊆ {1, . . . , m} and J ⊆ {1, . . . , m} for which A[I c , J ] = 0,
ri ≥
i ∈I
cj
j ∈J
and equality holds if and only if A[I, J c ] = 0. iv. 1T r = 1T r and the following (geometric) optimization problem has an optimal solution: min xT Ay subject to : x = [xi ] ∈ Rm , y = [y j ] ∈ Rn x ≥ 0, y ≥ 0 m $
(xi )r i =
i =1
n $
(y j )c j = 1.
j =1
A standard algorithm for approximating a scaling of a matrix to one that has prescribed rowand columnsums (when one exists) is to iteratively scale rows and columns separately so as to achieve corresponding linesums. (b) Suppose 1T r = 1T r and x¯ = [x¯ i ] and y¯ = [¯y j ] form an optimal solution of the optimization T y problem of Fact 1(d). Let λ¯ ≡ x¯1TA¯ and let X¯ ∈ Rm×m and Y¯ ∈ Rn×n be the diagonal matrices r x¯ i ¯ having diagonal elements X ii = λ and Y¯ j j = y¯ j . Then B ≡ X¯ AY¯ is a scaling of A satisfying B1 = r and 1T B = cT . (c) Suppose X¯ ∈ Rm×m and Y¯ ∈ Rn×n are diagonal matrices such that B ≡ X¯ AY¯ is a scaling of A satisfying B1 = r and 1T B = cT . Then 1T r = 1T r and with λ¯ ≡
m $
( X¯ ii )−r i /1
T
r
i =1
and ¯ ≡ µ
m $
(Y¯ j j )−c j /1 c , T
i =1
¯ ii for i = 1, . . . , m and y¯ j = µY ¯ jj the vectors x¯ = [x¯ i ] ∈ R and y¯ = [ y¯ j ] ∈ Rn with x¯ i = λX for j = 1, . . . , n are optimal for the optimization problem of Fact 1(d). m
2. (Approximate PrescribedLineSum Scalings) [RoSc89] Let A = [ai j ] ∈ Rm×n be a nonnegative matrix, and let r = [r i ] ∈ Rm and c = [c j ] ∈ Rn be positive vectors. (a) The following are equivalent: i. For every > 0 there exists a scaling B of A with B1 − r1 ≤ and 1T B − cT 1 ≤ .
922
Handbook of Linear Algebra
ii. There exists nonnegative m×n matrix A = [ai j ] with Struct( A ) ⊆Struct(A) and ai j = ai j for each i j ∈ Struct(A ) such that A has a scaling B satisfying B1 = r and 1T B = cT . iii. For every > 0 there exists a matrix B having the same support as A and satisfying B1 − r1 ≤ and 1T B − cT 1 ≤ . iv. There exists a matrix B satisfying Struct(B) ⊆ Struct(A), B1 = r and 1T B = cT . v. For every I ⊆ {1, . . . , m} and J ⊆ {1, . . . , m} for which A[I c , J ] = 0,
ri ≥
i ∈I
c j.
j∈ j
vi. 1T r = 1T r and the objective of the optimization problem of Fact 2(a)iii is bounded away from zero. See [NR99] for a reduction of the problem of finding a scaling of A that satisfies B1 − r1 ≤ and 1T B − cT 1 ≤ for a given > 0 to the approximate solution of geometric program that is similar to the one in Fact 1(a)iv and for the description of √ an (ellipsoid) algorithm that solves 3 3 ln(mnβ) ], where β is the ratio the latter with complexity bound of O(1)(m + n)4 ln[2 + mn m +n 3 between the largest and smallest positive entries of A.
9.7
Miscellaneous Topics
In this subsection, we mention several important topics about nonnegative matrices that are not covered in detail in the current section due to size constraint; some relevant material appears in other sections.
9.7.1 Nonnegative Factorization and Completely Positive Matrices A nonnegative factorization of a nonnegative matrix A ∈ R m×n is a representation A = L R of A with L and R as nonnegative matrices. The nonnegative rank of A is the smallest number of columns of L (rows of R) in such a factorization. A square matrix A is doubly nonnegative if it is nonnegative and positive semidefinite. Such a matrix A is completely positive if it has a nonnegative factorization A = B B T ; the CPrank of A is then the smallest number of columns of a matrix B in such a factorization. Facts about nonnegative factorizations and completely positive matrices can be found in [CR93], [BSM03], and [CP05].
9.7.2 The Inverse Eigenvalue Problem The inverse eigenvalue problem concerns the identification of necessary conditions and sufficient conditions for a finite set of complex numbers to be the spectrum of a nonnegative matrix. Facts about the inverse eigenvalue problem can be found in [BP94, Sections 4.2 and 11.2] and Chapter 20.
9.7.3 Nonhomogenous Products of Matrices A nonhomogenous product of nonnegative matrices is the finite matrix product of nonnegative matrices P1 P2 . . . Pm , generalizing powers of matrices where the multiplicands are equal (i.e., P1 = P2 = · · · = Pm ); the study of such products focuses on the case where the multiplicands are taken from a prescribed set. Facts about Perron–Frobenius type properties of nonhomogenous products of matrices can be found in [Sen81], and [Har02].
Nonnegative Matrices and Stochastic Matrices
923
9.7.4 Operators Determined by Sets of Nonnegative Matrices in Product Form A finite set of nonnegative n × n matrices {Pδ : δ ∈ } is said to be in product form if there exists finite % sets of row vectors 1 , . . . , n such that = in=1 i and for each δ = (δ1 , . . . , δn ) ∈ , Pδ is the matrix whose rows are, respectively, δ1 , . . . , δn . Such a family determines the operators Pmax and Pmin on Rn with Pmax x = maxδ∈ Pδ x and Pmin x = minδ∈ Pδ x for each x ∈ Rn . Facts about Perron–Frobeniustype properties of the operators corresponding to families of matrices in product form can be found in [Zij82], [Zij84], and [RW82].
9.7.5 Max Algebra over Nonnegative Matrices Matrix operations under the max algebra are executed with the max operator replacing (real) addition and (real) addition replacing (real) multiplication. Perron–Frobeniustype results and scaling results are available for nonnegative matrices when considered as operators under the max algebra; see [RSS94], [Bap98], [But03], [BS05], and Chapter 25.
Acknowledgment The author wishes to thank H. Schneider for comments that were helpful in preparing this section.
References [Bap98] R.B. Bapat, A max version of the Perron–Frobenius Theorem, Lin. Alg. Appl., 3:18, 275–276, 1998. [BS75] G.P. Barker and H. Schneider, Algebraic Perron–Frobenius Theory, Lin. Alg. Appl., 11:219–233, 1975. [BNS89] A. Berman, M. Neumann, and R.J. Stern, Nonnegative Matrices in Dynamic Systems, John Wiley & Sons, New York, 1989. [BP94] A. Berman and R.J. Plemmons, Nonnegative Matrices in the Mathematical Sciences, Academic, 1979, 2nd ed., SIAM, 1994. [BSM03] A. Berman and N. ShakedMonderer, Completely Positive Matrices, World Scientific, Singapore, 2003. [But03] P. Butkovic, Maxalgebra: the linear algebra of combinatorics? Lin. Alg. Appl., 367:313–335, 2003. [BS05] P. Butkovic and H. Schneider, Applications of max algebra to diagonal scaling of matrices, ELA, 13:262–273, 2005. [CP05] M. Chu and R. Plemmons, Nonnegative matrix factorization and applications, Bull. Lin. Alg. Soc. — Image, 34:2–7, 2005. [Coh78] J.E. Cohen, Derivatives of the spectral radius as a function of nonnegative matrix elements, Mathematical Proceedings of the Cambridge Philosophical Society, 83:183–190, 1978. [CR93] J.E. Cohen and U.G. Rothblum, Nonnegative ranks, decompositions and factorizations of nonnegative matrices, Lin. Alg. Appl., 190:149–168, 1993. [Col42] L. Collatz, Einschliessungssatz f¨ur die charakteristischen Zahlen von Matrizen, Math. Z., 48:221–226, 1942. [CHR97] D. Coppersmith, A.J. Hoffman, and U.G. Rothblum, Inequalities of Rayleigh quotients and bounds on the spectral radius of nonnegative symmetric matrices, Lin. Alg. Appl., 263:201–220, 1997. [DR05] E.V. Denardo and U.G. Rothblum, Totally expanding multiplicative systems, Lin. Alg. Appl., 406:142–158, 2005. [ERS95] B.C. Eaves, U.G. Rothblum, and H. Schneider, Perron–Frobenius theory over real closed fields and fractional power series expansions, Lin. Alg. Appl., 220:123–150, 1995. [EHP90] L. Elsner, D. Hershkowitz, and A. Pinkus, Functional inequalities for spectral radii of nonnegative matrices, Lin. Alg. Appl., 129:103–130, 1990.
924
Handbook of Linear Algebra
[EJD88] L. Elsner, C. Johnson, and D. da Silva, The Perron root of a weighted geometric mean of nonnegative matrices, Lin. Multilin. Alg., 24:1–13, 1988. [FiSc83] M. Fiedler and H. Schneider, Analytic functions of Mmatrices and generalizations, Lin. Multilin. Alg., 13:185–201, 1983. [FrSc80] S. Friedland and H. Schneider, The growth of powers of a nonnegative matrix, SIAM J. Alg. Disc. Meth., 1:185–200, 1980. ¨ [Fro08] G.F. Frobenius, Uber Matrizen aus positiven Elementen, S.B. Preuss. Akad. Wiss. Berlin, 471–476, 1908. ¨ Matrizen aus positiven Elementen, II, S.B. Preuss. Akad. Wiss. Berlin, 514–518, [Fro09] G.F. Frobenius, Uber 1909. ¨ Matrizen aus nicht negativen Elementen, Sitzungsber. K¨on. Preuss. Akad. Wiss. [Fro12] G.F. Frobenius, Uber Berlin, 456–457, 1912. [Gan59] F.R. Gantmacher, The Theory of Matrices, Vol. II, Chelsea Publications, London, 1958. [Har02] D.J. Hartfiel, Nonhomogeneous Matrix Products, World Scientific, River Edge, NJ, 2002. [HJ85] R.A. Horn and C.R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, 1985. [HNR90] R.E. Hartwig, M. Neumann, and N.J. Rose, An algebraicanalytic approach to nonnegative basis, Lin. Alg. Appl., 133:77–88, 1990. [HRR92] M. Haviv, Y. Ritov, and U.G. Rothblum, Taylor expansions of eigenvalues of perturbed matrices with applications to spectral radii of nonnegative matrices, Lin. Alg. Appli., 168:159–188, 1992. [HS88a] D. Hershkowitz and H. Schneider, Solutions of Zmatrix equations, Lin. Alg. Appl., 106:25–38, 1988. [HS88b] D. Hershkowitz and H. Schneider, On the generalized nullspace of Mmatrices and Zmatrices, Lin. Alg. Appl., 106:5–23, 1988. [HRS89] D. Hershkowitz, U.G. Rothblum, and H. Schneider, The combinatorial structure of the generalized nullspace of a block triangular matrix, Lin. Alg. Appl., 116:9–26, 1989. [HS89] D. Hershkowitz and H. Schneider, Height bases, level bases, and the equality of the height and the level characteristic of an Mmatrix, Lin. Multilin. Alg., 25:149–171, 1989. [HS91a] D. Hershkowitz and H. Schneider, Combinatorial bases, derived Jordan and the equality of the height and level characteristics of an Mmatrix, Lin. Multilin. Alg., 29:21–42, 1991. [HS91b] D. Hershkowitz and H. Schneider, On the existence of matrices with prescribed height and level characteristics, Israel Math J., 75:105–117, 1991. [Hof67] A.J. Hoffman, Three observations on nonnegative matrices, J. Res. Nat. Bur. StandardsB. Math and Math. Phys., 71B:39–41, 1967. [Kru37] J. Kruithof, Telefoonverkeersrekening, De Ingenieur, 52(8):E15–E25, 1937. [LT85] P. Lancaster and M. Tismenetsky, The Theory of Matrices, 2nd ed., Academic Press, New York, 1985. [Mac00] C.R. MacCluer, The many proofs and applications of Perron’s theorem, SIAM Rev., 42:487–498, 2000. [Min88] H. Minc, Nonnegative Matrices, John Wiley & Sons, New York, 1988. [NR99] A. Nemirovski and U.G. Rothblum, On complexity of matrix scaling, Lin. Alg. Appl., 302303:435– 460, 1999. [NS94] M. Neumann and H. Schneider, Algorithms for computing bases for the Perron eigenspace with prescribed nonnegativity and combinatorial properties, SIAM J. Matrix Anal. Appl., 15:578–591, 1994. [Per07a] O. Perron, Grundlagen f¨ur eine Theorie des Jacobischen Kettenbruchalogithmus, Math. Ann., 63:11– 76, 1907. [Per07b] O. Perron, Z¨ur Theorie der u¨ ber Matrizen, Math. Ann., 64:248–263, 1907. [RiSc78] D. Richman and H. Schneider, On the singular graph and the Weyr characteristic of an Mmatrix, Aequationes Math., 17:208–234, 1978. [Rot75] U.G. Rothblum, Algebraic eigenspaces of nonnegative matrices, Lin. Alg. Appl., 12:281–292, 1975. [Rot80] U.G. Rothblum, Bounds on the indices of the spectralcircle eigenvalues of a nonnegative matrix, Lin. Alg. Appl., 29:445–450, 1980.
Nonnegative Matrices and Stochastic Matrices
925
[Rot81a] U.G. Rothblum, Expansions of sums of matrix powers, SIAM Rev., 23:143–164, 1981. [Rot81b] U.G. Rothblum, Sensitive growth analysis of multiplicative systems I: the stationary dynamic approach, SIAM J. Alg. Disc. Meth., 2:25–34, 1981. [Rot81c] U.G. Rothblum, Resolvant expansions of matrices and applications, Lin. Alg. Appl., 38:33–49, 1981. [RoSc89] U.G. Rothblum and H. Schneider, Scalings of matrices which have prespecified rowsums and columnsums via optimization, Lin. Alg. Appl., 114/115:737–764, 1989. [RSS94] U.G. Rothblum, H. Schneider, and M.H. Schneider, Scalings of matrices which have prespecified rowmaxima and columnmaxima, SIAM J. Matrix Anal., 15:1–15, 1994. [RT85] U.G. Rothblum and C.P. Tan, Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices, Lin. Alg. Appl., 66:45–86, 1985. [RW82] U.G. Rothblum and P. Whittle, Growth optimality for branching Markov decision chains, Math. Op. Res., 7:582–601, 1982. [Sch53] H. Schneider, An inequality for latent roots applied to determinants with dominant principal diagonal, J. London Math. Soc., 28:8–20, 1953. [Sch56] H. Schneider, The elementary divisors associated with 0 of a singular Mmatrix, Proc. Edinburgh Math. Soc., 10:108–122, 1956. [Sch86] H. Schneider, The influence of the marked reduced graph of a nonnegative matrix on the Jordan form and on related properties: a survey, Lin. Alg. Appl., 84:161–189, 1986. [Sch96] H. Schneider, Commentary on “Unzerlegbare, nicht negative Matrizen,” in Helmut Wielandt’s “Mathematical Works,” Vol. 2, B. Huppert and H. Schneider, Eds., Walter de Gruyter Berlin, 1996. [Sen81] E. Seneta, Nonnegative matrices and Markov chains, Springer Verlag, New York, 1981. [Sin64] R. Sinkhorn, A relationship between arbitrary positive and stochastic matrices, Ann. Math. Stat., 35:876–879, 1964. [Tam04] B.S. Tam, The Perron generalized eigenspace and the spectral cone of a conepreserving map, Lin. Alg. Appl., 393:375429, 2004. [TW89] B.S. Tam and S.F. Wu, On the CollatzWielandt sets associated with a conepreserving map, Lin. Alg. Appl., 125:77–95, 1989. [Var62] R.S. Varga, Matrix Iterative Analysis, PrenticeHall, Upper Saddle River, NJ, 1962, 2nd ed., Springer, New York, 2000. [Vic85] H.D. Victory, Jr., On nonnegative solutions to matrix equations, SIAM J. Alg. Dis. Meth., 6: 406–412, 1985. [Wie50] H. Wielandt, Unzerlegbare, nicht negative Matrizen, Mathematische Zeitschrift, 52:642–648, 1950. [Zij82] W.H.M. Zijm, Nonnegative Matrices in Dynamic Programming, Ph.D. dissertation, Mathematisch Centrum, Amsterdam, 1982. [Zij84] W.H.M. Zijm, Generalized eigenvectors and sets of nonnegative matrices, Lin. Alg. Appl., 59:91–113, 1984.
10 Partitioned Matrices
Robert Reams Virginia Commonwealth University
10.1
10.1 Submatrices and Block Matrices . . . . . . . . . . . . . . . . . . . . 10.2 Block Diagonal and Block Triangular Matrices . . . . . . 10.3 Schur Complements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10.4 Kronecker Products . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
101 104 106 108 1010
Submatrices and Block Matrices
Definitions: Let A ∈ F m×n . Then the row indices of A are {1, . . . , m}, and the column indices of A are {1, . . . , n}. Let α, β be nonempty sets of indices with α ⊆ {1, . . . , m} and β ⊆ {1, . . . , n}. A submatrix A[α, β] is a matrix whose rows have indices α among the row indices of A, and whose columns have indices β among the column indices of A. A(α, β) = A[α c , β c ], where α c is the complement of α. A principal submatrix is a submatrix A[α, α], denoted more compactly as A[α]. Let the set {1, . . . m} be partitioned into the subsets α1 , . . . , αr in the usual sense of partitioning a set (so that αi ∩ α j = ∅, for all i = j , 1 ≤ i, j ≤ r , and α1 ∪ · · · ∪ αr = {1, . . . , m}), and let {1, . . . , n} be partitioned into the subsets β1 , . . . , βs . The matrix A ∈ F m×n is said to be partitioned into the submatrices A[αi , β j ], 1 ≤ i ≤ r , 1 ≤ j ≤ s . A block matrix is a matrix that is partitioned into submatrices A[αi , β j ] with the row indices {1, . . . , m} and column indices {1, . . . , n} partitioned into subsets sequentially, i.e., α1 = {1, . . . , i 1 }, α2 = {i 1 + 1, . . . , i 2 }, etc. Each entry of a block matrix, which is a submatrix A[αi , β j ], is called a block, and we will sometimes write A = [Aij ] to label the blocks, where Aij = A[αi , β j ]. If the block matrix A ∈ F m× p is partitioned with αi s and β j s, 1 ≤ i ≤ r , 1 ≤ j ≤ s , and the block matrix B ∈ F p×n is partitioned with β j s and γk s, 1 ≤ j ≤ s , 1 ≤ k ≤ t, then the partitions of A and B are said to be conformal (or sometimes conformable). Facts: The following facts can be found in [HJ85]. This information is also available in many other standard references such as [LT85] or [Mey00]. 1. Two block matrices A = [Aij ] and B = [Bij ] in F m×n , which are both partitioned with the same αi s and β j s, 1 ≤ i ≤ r , 1 ≤ j ≤ s , may be added blockwise, as with the usual matrix addition, so that the (i, j ) block entry of A + B is (A + B)ij = Aij + Bij .
101
102
Handbook of Linear Algebra
2. If the block matrix A ∈ F m× p and the block matrix B ∈ F p×n have conformal partitions, then we can think of A and B as having entries, which are blocks, so that we can then multiply A and B blockwise to form the m × n block matrix C = AB. Then C i k = sj =1 Aij Bjk , and the matrix C will be partitioned with the αi s and γk s, 1 ≤ i ≤ r , 1 ≤ k ≤ t, where A is partitioned with αi s and β j s, 1 ≤ i ≤ r , 1 ≤ j ≤ s , and B is partitioned with β j s and γk s, 1 ≤ j ≤ s , 1 ≤ k ≤ t. 3. With addition and multiplication of block matrices described as in Facts 1 and 2 the usual properties of associativity of addition and multiplication of block matrices hold, as does distributivity, and commutativity of addition. The additive identity 0 and multiplicative identity I are the same under block addition and multiplication, as with the usual matrix addition and multiplication. The additive identity 0 has zero matrices as blocks; the multiplicative identity I has multiplicative identity submatrices as diagonal blocks and zero matrices as offdiagonal blocks. 4. If the partitions of A and B are conformal, the partitions of B and A are not necessarily conformal, even if B A is defined. A11 A12 n×n 5. Let A ∈ F be a block matrix of the form A = , where A12 is k × k, and A21 is A21 0 (n − k) × (n − k). Then det( A) = (−1)(n+1)k det(A12 )det(A21 ).
Examples:
1. Let the block matrix A ∈ C
n×n
given by A =
A11 A21
A12 be Hermitian. Then A11 and A22 are A22
Hermitian, and A21 = A∗12 . 2. If A = [aij ], then A[{i }, { j }] is the 1 × 1 matrix whose entry is aij . The submatrix A({i }, { j }) is the submatrix of A obtained by deleting row i and column j of A. ⎡
⎤
1 −2 ⎢ Let A = ⎣−3 0 2 7
5 3 −1 ⎥ 1 6 1 ⎦. 4 5 −7
3. Then A[{2}, {3}] = [a23 ] = [1] and A({2}, {3}) =
1 −2 2 7
3 −1 . 5 −7
1 −2 4. Let α = {1, 3} and β = {1, 2, 4}. Then the submatrix A[α, β] = 2 7
1 submatrix A[α] = 2
3 , and the principal 5
5 . 4
5. Let α1 = {1}, α2 = {2, 3} and let β1 = {1, 2}, β2 = {3}, β3 = {4, 5}. Then the block matrix, with (i, j ) block entry Aij = A[αi , β j ], 1 ≤ i ≤ 2, 1 ≤ j ≤ 3, is
A=
A11 A21
6. Let B =
A12 A22
B11 B21
A13 A23
B12 B22
⎡
⎤
1 −2  5  3 −1 ⎢ ⎥ ⎢− − − − −  − −  − − − − −⎥ =⎢ ⎥. 0  1  6 1 ⎦ ⎣ −3 2 7  4  5 −7
B13 B23
⎡
⎤
2 −1  0  6 −2 ⎢ ⎥ ⎢− − − − −  − −  − − − − −⎥ =⎢ ⎥. Then the matrices A 0  5  3 7 ⎦ ⎣ −4 1 1  −2  2 6
(of this example) and B are partitioned with the same αi s and β j s, so they can be added blockwise
103
Partitioned Matrices
A11 as A21
A12 A22
A13 B + 11 A23 B21
B12 B22
B13 B23
A11 + B11 = A21 + B21
A12 + B12 A22 + B22
A13 + B13 A23 + B23
⎡
⎤
3 −3  5  9 −3 ⎢− − − − −  − −  − − − − −⎥ ⎢ ⎥ =⎢ ⎥. 0  6  9 8 ⎦ ⎣ −7 3 8  2  7 −1
7. The block matrices A =
⎡
A11 A21
⎤
B11 A13 ⎢ ⎥ and B = ⎣ B21⎦ have conformal partitions if the β j A13 B31
A12 A22
index sets, which form the submatrices Aij = A[αi , β j ] of A, are the same as the β j index sets, which form the submatrices Bjk = B[β j , γk ] of B. For instance, the matrix
A=
A11 A21
A12 A22
A13 A23
⎡
⎤
1 −2  5  3 −1 ⎢ − − − − −  − −  − − − − −⎥ ⎢ ⎥ =⎢ ⎥ 0  1  6 1 ⎦ ⎣ −3 2 7  4  5 −7
⎡
⎤
−1 9 ⎥ ⎥ −−⎥ ⎥ ⎥ 2 ⎥ have conformal partitions, so A and B can be ⎥ −−⎥ ⎥ −8 ⎦ −1
4 ⎢ 3 ⎢ ⎡ ⎤ ⎢−− B11 ⎢ ⎢ ⎥ ⎢ and the matrix B = ⎣ B21⎦ = ⎢ 5 ⎢ ⎢−− B31 ⎢ ⎣ 2 7
multiplied blockwise to form the 3 × 2 matrix
A11 B11 + A12 B21 + A13 B31 AB = A21 B11 + A22 B21 + A23 B31
⎡
2] + [3
4 −1 1 + [5 3 9 4
2] +
−2]
=⎢ ⎢ ⎣ −3 2
0 7
4 −1 + 5[5 3 9
[1
⎢ ⎢
⎡ [−2 −19] + [25 10] + [−1 ⎢ = ⎣ −12 3 5 2 19
29
8. Let A =
1 2 4 5
61
+
⎡
20
8
7  ⎢  3  ⎢ 9 and B = ⎢  6 ⎣−− 1 
+
−1]
−39
6 5
2 −8 7 −1
1 −7
2 7
⎤ ⎡ −23] ⎥ ⎢22 −49 ⎦ = ⎣12
−33
⎤
10
⎤
⎥ ⎥ ⎥ ⎥ −8 ⎦
−1
⎤
−32 ⎥ −44⎦ . 36
8 0 ⎥ ⎥ ⎥. Then A and B have conformal partitions. BA −−⎦ 2
is defined, but B and A do not have conformal partitions.
104
10.2
Handbook of Linear Algebra
Block Diagonal and Block Triangular Matrices
Definitions: A matrix A = [aij ] ∈ F n×n is diagonal if aij = 0, for all i = j , 1 ≤ i, j ≤ n. A diagonal matrix A = [aij ] ∈ F n×n is said to be scalar if aii = a, for all i , 1 ≤ i ≤ n, and some scalar a ∈ F , i.e., A = a In . A matrix A ∈ F n×n is block diagonal if A as a block matrix is partitioned into submatrices Aij ∈ ni ×n j , so that A = [Aij ], ik=1 ni = n, and Aij = 0, for all i = j , 1 ≤ i, j ≤ k. Thus, A = F ⎡ ⎤ A11 0 ··· 0 ⎢ 0 0 ⎥ A22 · · · ⎢ ⎥ ⎢ . .. ⎥ .. ⎢ . ⎥. This block diagonal matrix A is denoted A = diag(A11 , . . . , Akk ), where Aii is . ⎣ . . ⎦ 0 0 · · · Akk ni × ni , (or sometimes denoted A = A11 ⊕ · · · ⊕ Akk , and called the direct sum of A11 , . . . , Akk ). A matrix A = [aij ] ∈ F n×n is upper triangular if aij = 0, for all i > j 1 ≤ i, j ≤ n. An upper triangular matrix A = [aij ] ∈ F n×n is strictly upper triangular if aij = 0 for all i ≥ j , 1 ≤ i, j ≤ n. A matrix A ∈ F n×n is lower triangular if aij = 0 for all i < j , 1 ≤ i, j ≤ n, i.e., if AT is upper triangular. A matrix A ∈ F n×n is strictly lower triangular if AT is strictly upper triangular. A matrix is triangular it is upper or lower triangular. A matrix A ∈ F n×n is block upper triangular, if A as a block matrix is partitioned into the submatrices Aij ∈ F ni ×n j , so that A = [Aij ], ik=1 ni = n, and Aij = 0, for all i > j , 1 ≤ i, j ≤ k, i.e., considering ⎡
⎤
A11 A12 · · · A1k ⎢ 0 A22 · · · A2k ⎥ ⎢ ⎥ the Aij blocks as the entries of A, A is upper triangular. Thus, A = ⎢ .. ⎥ .. ⎢ .. ⎥, where each . ⎣ . . ⎦ 0 0 · · · Akk Aij is ni × n j , and ik=1 ni = n. The matrix A is strictly block upper triangular if Aij = 0, for all i ≥ j , 1 ≤ i, j ≤ k. A matrix A ∈ F n×n is block lower triangular if AT is block upper triangular. A matrix A ∈ F n×n is strictly block lower triangular if AT is strictly block upper triangular. A matrix A = [aij ] ∈ F n×n is upper Hessenberg if aij = 0, for all i − 2 ≥ j , 1 ≤ i, j ≤ n, i.e., A has ⎡
a11
⎢ ⎢a 21 ⎢ ⎢ ⎢0 ⎢ the form A = ⎢ . ⎢ . ⎢ . ⎢ ⎢0 ⎣
0
⎤
a12
a13
···
a1n−1
a1n
a22
a23
···
a2n−1
a32 .. .
a33
···
a2n ⎥ ⎥
a3n−1
..
..
0
···
an−1n−2
an−1n−1
···
0
ann−1
0
A matrix A = [aij ] ∈ F
.
n×n
.
⎥
⎥ ⎥ ⎥ ⎥. ⎥ ⎥ ⎥ an−1n⎥ ⎦
a3n .. .
ann T
is lower Hessenberg if A is upper Hessenberg.
Facts: The following facts can be found in [HJ85]. This information is also available in many other standard references such as [LT85] or [Mey00].
105
Partitioned Matrices
1. Let D, D ∈ F n×n be any diagonal matrices. Then D + D and D D are diagonal, and D D = D D. If D = diag(d1 , . . . , dn ) is nonsingular, then D −1 = diag(1/d1 , . . . , 1/dn ). 2. Let D ∈ F n×n be a matrix such that D A = AD for all A ∈ F n×n . Then D is a scalar matrix. 3. If A ∈ F n×n is a block diagonal matrix, so that A = diag(A11 , . . . , Akk ), then tr(A) = ik=1 tr(Aii ), det(A) = ik=1 det(Aii ), rank(A) = ik=1 rank(Aii ), and σ (A) = σ (A11 ) ∪ · · · ∪ σ (Akk ). 4. Let A ∈ F n×n be a block diagonal matrix, so that A = diag(A11 , A22 . . . , Akk ). Then A is nonsingu−1 −1 lar if and only if Aii is nonsingular for each i , 1 ≤ i ≤ k. Moreover, A−1 = diag(A−1 11 , A22 . . . , Akk ). 5. See Chapter 4.3 for information on diagonalizability of matrices. 6. Let A ∈ F n×n be a block diagonal matrix, so that A = diag(A11 , . . . , Akk ). Then A is diagonalizable if and only if Aii is diagonalizable for each i , 1 ≤ i ≤ k. 7. If A, B ∈ F n×n are upper (lower) triangular matrices, then A + B and AB are upper (lower) triangular. If the upper (lower) triangular matrix A = [aij ] is nonsingular, then A−1 is upper (lower) triangular with diagonal entries 1/a11 , . . . , 1/ann . ⎡
8. Let A ∈ F n×n
⎢ ⎢ be block upper triangular, so that A = ⎢ ⎢ ⎣
k
ik=1 det(Aii ),
A11 0 .. . 0
k
A12 A22 0
··· ··· .. . ···
⎤
A1k A2k ⎥ ⎥ .. ⎥ ⎥. Then tr(A) = . ⎦ Akk
rank(A) ≥ i =1 tr(Aii ), det(A) = i =1 rank(Aii ), and σ (A) = σ (A11 ) ∪ · · · ∪ σ (Akk ). 9. Let A = (Aij ) ∈ F n×n be a block triangular matrix (either upper or lower triangular). Then A is nonsingular if and only if Aii is nonsingular for each i , 1 ≤ i ≤ k. Moreover, the ni × ni diagonal block entries of A−1 are Aii−1 , for each i , 1 ≤ i ≤ k. 10. Schur’s Triangularization Theorem: Let A ∈ Cn×n . Then there is a unitary matrix U ∈ Cn×n so that U ∗ AU is upper triangular. The diagonal entries of U ∗ AU are the eigenvalues of A. 11. Let A ∈ Rn×n . Then there is an orthogonal matrix V ∈ Rn×n so that V T AV is of upper Hessenberg ⎡
A11 ⎢ 0 ⎢ form ⎢ ⎢ .. ⎣ . 0
A12 A22 0
··· ··· .. . ···
⎤
A1k A2k ⎥ ⎥ .. ⎥ ⎥, where each Aii , 1 ≤ i ≤ k, is 1 × 1 or 2 × 2. Moreover, when Aii is . ⎦ Akk
1 × 1, the entry of Aii is an eigenvalue of A, whereas when Aii is 2 × 2, then Aii has two eigenvalues which are nonreal complex conjugates of each other, and are eigenvalues of A. 12. (For more information on unitary triangularization, see Chapter 7.2.) 13. Let A = [Aij ] ∈ F n×n with σ (A) = n, where λ1 , . . . , λk ∈ σ (A) are the distinct eigenvalues of A. Then there is a nonsingular matrix T ∈ F n×n so that T −1 AT = diag(A11 , . . . , Akk ), where each A ∈ F ni ×ni is upper triangular with all diagonal entries of Aii equal to λi , for 1 ≤ i ≤ k (and iik i =1 ni = n).
14. Let A ∈ F n×n be a block upper triangular matrix, of the form A =
A11 0
A12 , where Aij is A22
ni × n j , 1 ≤ i, j ≤ 2, and i2=1 ni = n. (Note that any block upper triangular matrix can be said to have this form.) Let x be an eigenvector of A11 , with corresponding eigenvalue λ, so that A11 x = λx, where x is a (column) vector with n1 components. Then the (column) vector with n
components
x is an eigenvector of A with eigenvalue λ. Let y be a left eigenvector of A22 , with 0
corresponding eigenvalue µ, so that yA22 = yµ, where y is a row vector with n2 components. Then the (row) vector with n components [0 y] is a left eigenvector of A with eigenvalue µ.
106
Handbook of Linear Algebra
Examples: ⎡
1 ⎢2 ⎢ ⎢ 1. The matrix A = ⎢0 ⎢ ⎣0 0 3
i =1
⎡
⎢a ⎢ ⎢ ⎢ ⎢0 ⎢ ⎢ ⎣
−
⎤
b d 0
0
⎡
1 ⎢2 ⎢ ⎢ 3. The matrix B = ⎢0 ⎢ ⎣0 0
with B11
1 = 2
3 4 0 0 0
0 5 0 0 0
i =1
rank(Aii ).
⎤
0 0 6 0 0
0 0⎥ ⎥ ⎥ 0⎥ is not block diagonal. However, B is block upper triangular, ⎥ 7⎦ 8
3 0 , B22 = 0, B33 = 4 0
Notice that 4 = rank(B) ≥ ⎡
1 ⎢ ⎢3 4. The 4 × 4 matrix ⎢ ⎣6 10
10.3
3
c ⎥ e ⎦ ∈ F 3×3 , an upper triangular matrix. If a, d, f are nonzero, then A−1 = f
be − c d ⎤ ad f ⎥ ⎥ e ⎥ ⎥ − ⎥. df ⎥ ⎥ 1 ⎦ f
b ad 1 d
0
0 0 0 6 7
tr(Aii ), det(A) = (−2)(5)(−2) = i3=1 det(Aii ), and rank(A) = 5 =
a ⎢ 2. Let A = ⎣0 0 ⎡1
0 0 5 0 0
⎤
0 0⎥ ⎥ ⎥ 0⎥ is a block diagonal matrix, and the trace, determinant, and ⎥ 8⎦ 9 1 3 6 8 rank can be calculated blockwise, where A11 = , A22 = 5, and A33 = , as tr(A) = 2 4 7 9 25 =
3 4 0 0 0
2 4 7 11
3
i =1
0 5 8 12
7 0 0 , B12 = , B13 = 8 5 0
0 , and B23 = [6 0
0].
rank(Bii ) = 2 + 0 + 1 = 3. ⎤
0 0⎥ ⎥ ⎥ is not lower triangular, but is lower Hessenberg. 9⎦ 13
Schur Complements
In this subsection, the square matrix A = nonsingular.
A11 A21
A12 is partitioned as a block matrix, where A11 is A22
Definitions: The Schur complement of A11 in A is the matrix A22 − A21 A−1 11 A12 , sometimes denoted A/A11 . Facts:
1. [Zha99]
I
−A21 A−1 11
2. [Zha99] Let A =
0 I A11 A21
A11 A21
A12 A22
I 0
−A−1 A 11 A12 = 11 I 0
0 . A/A11
A12 , where A11 is nonsingular. Then det(A) = det(A11 )det(A/A11 ). A22
Also, rank(A) = rank(A11 ) + rank(A/A11 ).
107
Partitioned Matrices
A11 A12 3. [Zha99] Let A = . Then A is nonsingular if and only if both A11 and the Schur A21 A22 complement of A11 in A are nonsingular.
4. [HJ85] Let A =
−1
A
A11 A21
A12 , where A11 , A22 , A/A11 , A/A22 , and A are nonsingular. Then A22
−1 (A/A22 )−1 −A−1 11 A12 (A/A11 ) = . −1 −A−1 (A/A11 )−1 22 A21 (A/A22 )
A11 5. [Zha99] Let A = A21
A12 , where A11 , A22 , A/A11 , and A/A22 are nonsingular. An equation reA22
−1 −1 lating the Schur complements of A11 in A and A22 in A is (A/A22 )−1 = A−1 11 + A11 A12 (A/A11 ) A21 −1 A11 . A11 A12 6. [LT85] Let A = , where the k × k matrix A11 is nonsingular. Then rank(A) = k if and A21 A22
only if A/A11 = 0.
A11 A12 7. [Hay68] Let A = be Hermitian, where A11 is nonsingular. Then the inertia of A is A∗12 A22 in(A) = in(A11 ) + in(A/A 11 ). A11 A12 8. [Hay68] Let A = be Hermitian, where A11 is nonsingular. Then A is positive A∗12 A22 (semi)definite if and only if both A11 and A/A11 are positive (semi)definite. Examples: ⎡
1 ⎢ 1. Let A = ⎣4 7 ⎡
1 ⎢ 4 ⎣ −
⎤
2 5 8
3 ⎥ 6 ⎦. Then with A11 = 1, we have 10 ⎤⎡
0
1 ⎥⎢ ⎦⎣4 I2 7
7
⎤
⎡
3 ⎥1 6⎦ 0 10
2 5 8
1
−[2 3] ⎢ =⎣ 0 I2
5 8
⎡
1
⎢
=⎣ 0 ⎡
1 ⎢ 2. Let A = ⎣4 7
1 − [2
5 3] 8
−1
A
⎤ ⎥ −6 ⎦ .
4 = − 32 , and 7
⎡
⎢ ⎢ ⎢ =⎢ ⎢ 5 ⎣
−
⎡
8
− 23
⎢⎡ ⎢ ⎣⎣
= ⎢ − 23 1
− 13
4 (− 32 )−1 7
1 [−4 3
⎤ ⎦
−[2
−1
6 10
−11 6
−1⎤
−1 − 32
3]
⎤
⎡
−3 −6 3] −6 −11 −1
−3 −6 −6 −11
− 23
⎥ ⎢ ⎥ ⎢ 2 = ⎢− 6 ⎥ ⎦ ⎣ 3
−3
6 −3 −6 , then A/A11 = , A/A22 = −6 −11 10
−1
6 10
⎥ ⎦
3]
−3 −6 −11
⎤
3 5 ⎥ 6 ⎦. With A11 = 1, and A22 = 8 10
2 5 8
6 4 −1 − 1 [2 10 7 0
⎤
0
1
− 43 11 3
−2
1
⎤ ⎥ ⎥ ⎦
−2⎥ . 1
⎥ ⎥ ⎥ ⎥ ⎥ ⎦
108
Handbook of Linear Algebra ⎡
1 ⎢ 3. Let A = ⎣4 7
2 5 8
⎤
3 ⎥ 6 ⎦. 10
Then, from Fact 5,
−1
(A/A22 )
3 = − 2
−1
−1
=1
−1
+ 1 [2
−1
−3 −6 3] −6 −11
4 −1 1 , 7
−1 −1 −1 = A−1 11 + A11 A12 (A/A11 ) A21 A11 .
10.4
Kronecker Products
Definitions: Let A ∈ F m×n and B ∈ F p×q . Then the Kronecker product (sometimes called the tensor product) of A ⎡
a11 B ⎢a B ⎢ 21 and B, denoted A ⊗ B, is the mp × nq partitioned matrix A ⊗ B = ⎢ ⎢ .. ⎣ . an1 B
a12 B a22 B .. . an2 B
··· ··· .. . ···
⎤
a1n B a2n B ⎥ ⎥ .. ⎥ ⎥. . ⎦ ann B
Let A ∈ F m×n and let the j th column of A, namely, A[{1, . . . , m}, { j }] be denoted a j , for 1 ≤ j ≤ n. ⎡ ⎤
a1
⎢a ⎥ ⎢ 2⎥ mn ⎥ The column vector with mn components, denoted vec(A), defined by vec(A) = ⎢ ⎢ .. ⎥ ∈ F , is the ⎣.⎦
an vecfunction of A, i.e., vec(A) is formed by stacking the columns of A on top of each other in their natural order. Facts: All of the following facts except those for which a specific reference is given can be found in [LT85]. Let A ∈ F m×n and B ∈ F p×q . If a ∈ F , then a(A ⊗ B) = (a A) ⊗ B = A ⊗ (a B). Let A, B ∈ F m×n and C ∈ F p×q . Then (A + B) ⊗ C = A ⊗ C + B ⊗ C . Let A ∈ F m×n and B, C ∈ F p×q . Then A ⊗ (B + C ) = A ⊗ B + A ⊗ C . Let A ∈ F m×n , B ∈ F p×q , and C ∈ F r ×s . Then A ⊗ (B ⊗ C ) = (A ⊗ B) ⊗ C . Let A ∈ F m×n and B ∈ F p×q . Then (A ⊗ B)T = AT ⊗ B T . [MM64] Let A ∈ Cm×n and B ∈ C p×q . Then (A ⊗ B) = A ⊗ B. [MM64] Let A ∈ Cm×n and B ∈ C p×q . Then (A ⊗ B)∗ = A∗ ⊗ B ∗ . Let A ∈ F m×n , B ∈ F p×q , C ∈ F n×r , and D ∈ F q ×s . Then (A ⊗ B)(C ⊗ D) = AC ⊗ B D. Let A ∈ F m×n and B ∈ F p×q . Then A ⊗ B = (A ⊗ I p )(In ⊗ B) = (Im ⊗ B)(A ⊗ Iq ). If A ∈ F m×m and B ∈ F n×n are nonsingular, then A⊗B is nonsingular and (A⊗B)−1 = A−1 ⊗B −1 . Let A1 , A2 , · · · , Ak ∈ F m×m , and B1 , B2 , · · · , Bk ∈ F n×n . Then (A1 ⊗B1 )(A2 ⊗B2 ) · · · (Ak ⊗Bk ) = (A1 A2 · · · Ak ) ⊗ (B1 B2 · · · Bk ). 12. Let A ∈ F m×m and B ∈ F n×n . Then (A ⊗ B)k = Ak ⊗ B k . 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11.
109
Partitioned Matrices
13. If A ∈ F m×m and B ∈ F n×n , then there is an mn×mn permutation matrix P so that P T (A⊗ B)P = B ⊗ A. 14. Let A, B ∈ F m×n . Then vec(a A + b B) = a vec(A) + b vec(B), for any a, b ∈ F . 15. If A ∈ F m×n , B ∈ F p×q , and X ∈ F n× p , then vec(AX B) = (B T ⊗ A)vec(X). 16. If A ∈ F m×m and B ∈ F n×n , then det(A⊗ B) = (det(A))n (det(B))m , tr(A⊗ B) = (tr(A))(tr(B)), and rank(A ⊗ B) = (rank(A))(rank(B)). 17. Let A ∈ F m×m and B ∈ F n×n , with σ (A) = {λ1 , . . . , λm } and σ (B) = {µ1 , . . . , µn }. Then A ⊗ B ∈ F mn×mn has eigenvalues {λs µt 1 ≤ s ≤ m, 1 ≤ t ≤ n}. Moreover, if the right eigenvectors of A are denoted xi , and the right eigenvectors of B are denoted y j , so that Axi = λi xi and By j = µ j y j , then (A ⊗ B)(xi ⊗ y j ) = λi µ j (xi ⊗ y j ). 18. Let A ∈ F m×m and B ∈ F n×n , with σ (A) = {λ1 , . . . , λm } and σ (B) = {µ1 , . . . , µn }. Then (In ⊗ A) + (B ⊗ Im ) has eigenvalues {λs + µt 1 ≤ s ≤ m, 1 ≤ t ≤ n}. 19. Let p(x, y) ∈ F [x, y] so that p(x, y) = i,k j =1 aij x i y j , where aij ∈ F , 1 ≤ i ≤ k, 1 ≤ j ≤ k. Let A ∈ F m×m and B ∈ F n×n . Define p(A; B) to be the mn × mn matrix p(A; B) = i,k j =1 aij (Ai ⊗ j B ). If σ (A) = {λ1 , . . . , λm } and σ (B) = {µ1 , . . . , µn }, then σ ( p(A; B)) = { p(λs , µt )1 ≤ s ≤ m, 1 ≤ t ≤ n}. 20. Let A1 , A2 ∈ F m×m , B1 , B2 ∈ F n×n . If A1 and A2 are similar, and B1 and B2 are similar, then A1 ⊗ B1 is similar to A2 ⊗ B2 . 21. If A ∈ F m×n , B ∈ F p×q , and X ∈ F n× p , then vec(AX) = (I p ⊗ A)vec(X), vec(X B) = (B T ⊗ In )vec(X), and vec(AX + X B) = [(I p ⊗ A) + (B T ⊗ In )]vec(X). 22. If A ∈ F m×n , B ∈ F p×q , C ∈ F m×q , and X ∈ F n× p , then the equation AX B = C can be written in the form (B T ⊗ A)vec(X) = vec(C ). 23. Let A ∈ F m×m , B ∈ F n×n , C ∈ F m×n , and X ∈ F m×n . Then the equation AX + X B = C can be written in the form [(In ⊗ A) + (B T ⊗ Im )]vec(X) = vec(C ). 24. Let A ∈ Cm×m and B ∈ Cn×n be Hermitian. Then A ⊗ B is Hermitian. 25. Let A ∈ Cm×m and B ∈ Cn×n be positive definite. Then A ⊗ B is positive definite. Examples: ⎡
⎡
1 1 −1 ⎢ and B = ⎣4 1. Let A = 0 2 7
2 5 8 ⎡
1 ⎢4 ⎤ ⎢ 3 ⎢7 ⎥ ⎢ 6⎦. Then A ⊗ B = ⎢ ⎢0 ⎢ 9 ⎣0 0 ⎤
2 5 8 0 0 0
⎤
3 −1 −2 −3 6 −4 −5 −6⎥ ⎥ 9 −7 −8 −9⎥ ⎥ ⎥. 0 2 4 6⎥ ⎥ 0 8 10 12 ⎦ 0 14 16 18
1 ⎢ ⎥ 1 −1 ⎢ 0⎥ 2. Let A = . Then vec(A) = ⎢ ⎥. 0 2 ⎣−1⎦ 2
3. Let A ∈ F m×m and B ∈ F n×n . If A is upper (lower) triangular, then A ⊗ B is block upper (lower) triangular. If A is diagonal then A ⊗ B is block diagonal. If both A and B are upper (lower) triangular, then A ⊗ B is (upper) triangular. If both A and B are diagonal, then A ⊗ B is diagonal. 4. Let A ∈ F m×n and B ∈ F p×q . If A ⊗ B = 0, then A = 0 or B = 0. ⎡
a11 In ⎢a I ⎢ 21 n 5. Let A ∈ F m×n . Then A ⊗ In = ⎢ ⎢ .. ⎣ . am1 In
a12 In a22 In .. . an2 In
··· ··· .. . ···
⎤
a1n In a2n In ⎥ ⎥ mn×n2 . Let B ∈ F p× p . Then .. ⎥ ⎥∈ F . ⎦ amn In
In ⊗ B = diag(B, B, . . . , B) ∈ F np×np , and Im ⊗ In = Imn .
1010
Handbook of Linear Algebra
References [Hay68] E. Haynsworth, Determination of the Inertia of a Partitioned Matrix, Lin. Alg. Appl., 1:73–81 (1968). [HJ85] R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, Combridge, 1985. [LT85] P. Lancaster and M. Tismenetsky, The Theory of Matrices, with Applications, 2nd ed., Academic Press, San Diego, 1985. [MM64] M. Marcus and H. Minc, A Survey of Matrix Theory and Matrix Inequalities, Prindle, Weber, & Schmidt, Boston, 1964. [Mey00] C. Meyer, Matrix Analysis and Applied Linear Algebra, SIAM, 2000. [Zha99] F. Zhang, Matrix Theory, SpringerVerlag, New York, 1999.
Advanced Linear Algebra 11 Functions of Matrices
Nicholas J. Higham . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
General Theory • Matrix Square Root • Matrix Exponential • Matrix Logarithm • Matrix Sine and Cosine • Matrix Sign Function • Computational Methods for General Functions • Computational Methods for Specific Functions
12 Quadratic, Bilinear, and Sesquilinear Forms
Raphael Loewy . . . . . . . . . . . . . . . . . . . 121
Bilinear Forms • Symmetric Bilinear Forms • Alternating Bilinear Forms • ϕSesquilinear Forms • Hermitian Forms
13 Multilinear Algebra
Jos´e A. Dias da Silva and Armando Machado . . . . . . . . . . . . . . . 131
Multilinear Maps • Tensor Products • Rank of a Tensor: Decomposable Tensors • Tensor Product of Linear Maps • Symmetric and Antisymmetric Maps • Symmetric and Grassmann Tensors • The Tensor Multiplication, the AltMultiplication, and the SymMultiplication • Associated Maps • Tensor Algebras • Tensor Product of Inner Product Spaces • Orientation and Hodge Star Operator
14 Matrix Equalities and Inequalities
Michael Tsatsomeros . . . . . . . . . . . . . . . . . . . . . . . . 141
Eigenvalue Equalities and Inequalities • Spectrum Localization • Inequalities for the Singular Values and the Eigenvalues • Basic Determinantal Relations • Rank and Nullity Equalities and Inequalities • Useful Identities for the Inverse
15 Matrix Perturbation Theory
RenCang Li . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 151
Eigenvalue Problems • Singular Value Problems • Polar Decomposition • Generalized Eigenvalue Problems • Generalized Singular Value Problems • Relative Perturbation Theory for Eigenvalue Problems • Relative Perturbation Theory for Singular Value Problems
16 Pseudospectra
Mark Embree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 161
Fundamentals of Pseudospectra • Toeplitz Matrices • Behavior of Functions of Matrices • Computation of Pseudospectra • Extensions
17 Singular Values and Singular Value Inequalities
Roy Mathias . . . . . . . . . . . . . . . . . . 171
Definitions and Characterizations • Singular Values of Special Matrices • Unitarily Invariant Norms • Inequalities • Matrix Approximation • Characterization of the Eigenvalues of Sums of Hermitian Matrices and Singular Values of Sums and Products of General Matrices • Miscellaneous Results and Generalizations
18 Numerical Range
ChiKwong Li . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181
Basic Properties and Examples • The Spectrum and Special Boundary Points • Location of the Numerical Range • Numerical Radius • Products of Matrices • Dilations and Norm Estimation • Mappings on Matrices
19 Matrix Stability and Inertia Inertia • Stability Diagonal Stability
•
Daniel Hershkowitz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191
Multiplicative DStability
•
Additive DStability
•
Lyapunov
11 Functions of Matrices 11.1 General Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.2 Matrix Square Root . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.3 Matrix Exponential . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.4 Matrix Logarithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.5 Matrix Sine and Cosine . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.6 Matrix Sign Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.7 Computational Methods for General Functions . . . . . 11.8 Computational Methods for Specific Functions . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Nicholas J. Higham University of Manchester
111 114 115 116 117 118 119 1110 1112
Matrix functions are used in many areas of linear algebra and arise in numerous applications in science and engineering. The most common matrix function is the matrix inverse; it is not treated specifically in this chapter, but is covered in Section 1.1 and Section 38.2. This chapter is concerned with general matrix functions as well as specific cases such as matrix square roots, trigonometric functions, and the exponential and logarithmic functions. The specific functions just mentioned can all be defined via power series or as the solution of nonlinear systems. For example, cos(A) = I − A2 /2! + A4 /4! − · · ·. However, a general theory exists from which a number of properties possessed by all matrix functions can be deduced and which suggests computational methods. This chapter treats general theory, then specific functions, and finally outlines computational methods.
11.1
General Theory
Definitions: A function of a matrix can be defined in several ways, of which the following three are the most generally useful. r Jordan canonical form definition. Let A ∈ Cn×n have the Jordan canonical form Z −1 AZ = J = A
diag J 1 (λ1 ), J 2 (λ2 ), . . . , J p (λ p ) , where Z is nonsingular, ⎡ ⎢ ⎢
J k (λk ) = ⎢ ⎢ ⎣
λk
⎤
1 λk
..
.
..
.
⎥ ⎥ ⎥ ∈ Cmk ×mk , ⎥ 1 ⎦
(11.1)
λk 111
112
Handbook of Linear Algebra
and m1 + m2 + · · · + m p = n. Then f (A) := Z f (J A )Z −1 = Z diag( f (J k (λk )))Z −1 ,
(11.2)
where ⎡ ⎢ ⎢ ⎢ f (J k (λk )) := ⎢ ⎢ ⎢ ⎣
f (λk )
f (λk )
...
f (λk )
.. ..
.
f (mk −1) (λk ) ⎤ (mk − 1)! ⎥ ⎥ .. ⎥ ⎥. .
.
f (λk ) f (λk )
⎥ ⎥ ⎦
(11.3)
r Polynomial interpolation definition. Denote by λ , . . . , λ the distinct eigenvalues of A and let n be 1 s i
the index of λi , that is, the order of the largest Jordan block in which λi appears. Then f (A) := r (A), where r is the unique Hermite interpolating polynomial of degree less than is =1 ni that satisfies the interpolation conditions r ( j ) (λi ) = f ( j ) (λi ),
j = 0: ni − 1,
i = 1: s .
(11.4)
Note that in both these definitions the derivatives in (11.4) must exist in order for f (A) to be defined. The function f is said to be defined on the spectrum of A if all the derivatives in (11.4) exist. r Cauchy integral definition.
f (A) :=
1 2πi
f (z)(z I − A)−1 dz,
(11.5)
where f is analytic inside a closed contour that encloses σ (A). When the function f is multivalued and A has a repeated eigenvalue occurring in more than one Jordan block (i.e., A is derogatory), the Jordan canonical form definition has more than one interpretation. Usually, for each occurrence of an eigenvalue in different Jordan blocks the same branch is taken for f and its derivatives. This gives a primary matrix function. If different branches are taken for the same eigenvalue in two different Jordan blocks, then a nonprimary matrix function is obtained. A nonprimary matrix function is not expressible as a polynomial in the matrix, and if such a function is obtained from the Jordan canonical form definition (11.2) then it depends on the matrix Z. In most applications it is primary matrix functions that are of interest. For the rest of this section f (A) is assumed to be a primary matrix function, unless otherwise stated. Facts: Proofs of the facts in this section can be found in one or more of [Hig], [HJ91], or [LT85], unless otherwise stated. 1. The Jordan canonical form and polynomial interpolation definitions are equivalent. Both definitions are equivalent to the Cauchy integral definition when f is analytic. 2. f (A) is a polynomial in A and the coefficients of the polynomial depend on A. 3. f (A) commutes with A. 4. f (AT ) = f (A)T . 5. For any nonsingular X, f (X AX −1 ) = X f (A)X −1 . 6. If A is diagonalizable, with Z −1 AZ = D = diag(d1 , d2 , . . . , dn ), then f (A) = Z f (D)Z −1 = Z diag( f (d1 ), f (d2 ), . . . ,f (dn ))Z −1 . 7. f diag(A1 , A2 , . . . , Am ) = diag( f (A1 ), f (A2 ), . . . , f (Am )).
113
Functions of Matrices
8. Let f and g be functions defined on the spectrum of A. (a) If h(t) = f (t) + g (t), then h(A) = f (A) + g (A). (b) If h(t) = f (t)g (t), then h(A) = f (A)g (A). 9. Let G (u1 , . . . , ut ) be a polynomial in u1 , . . . , ut and let f 1 , . . . , f t be functions defined on the spectrum of A. If g (λ) = G ( f 1 (λ), . . . , f t (λ)) takes zero values on the spectrum of A, then g (A) = G ( f 1 (A), . . . , f t (A)) = 0. For example, sin2 (A) + cos2 (A) = I , (A1/ p ) p = A, and e i A = cos A + i sin A. 10. Suppose f has a Taylor series expansion f (z) =
∞
ak (z − α)
k
k=0
f (k) (α) ak = k!
with radius of convergence r . If A ∈ Cn×n , then f (A) is defined and is given by f (A) =
∞
ak (A − α I )k
k=0
if and only if each of the distinct eigenvalues λ1 , . . . , λs of A satisfies one of the conditions: (a) λi − α < r . (b) λi − α = r and the series for f ni −1 (λ), where ni is the index of λi , is convergent at the point λ = λi , i = 1: s . 11. [Dav73], [Des63], [GVL96, Theorem 11.1.3]. Let T ∈ Cn×n be upper triangular and suppose that f is defined on the spectrum of T . Then F = f (T ) is upper triangular with f ii = f (tii ) and
fi j =
ts 0 ,s 1 ts 1 ,s 2 . . . ts k−1 ,s k f [λs 0 , . . . , λs k ],
(s 0 ,...,s k )∈Si j
where λi = tii , Si j is the set of all strictly increasing sequences of integers that start at i and end at j , and f [λs 0 , . . . , λs k ] is the kth order divided difference of f at λs 0 , . . . , λs k . Examples: 1. For λ1 = λ2 ,
f
λ1 0
For λ1 = λ2 = λ,
α λ2
f
⎡
=⎣
f (λ1 )
f (λ2 ) − f (λ1 ) ⎤ ⎦. λ2 − λ1 f (λ2 )
α
0
λ 0
α λ
=
f (λ) 0
α f (λ) . f (λ)
2. Compute e A for the matrix ⎡
⎤
−7 −4 −3 A = ⎣ 10 6 4⎦. 6 3 3 We have A = X J A X
−1
1 , where J A = [0] ⊕ 0 ⎡
1 X = ⎣ −1 −1
1 and 1 −1 2 0
⎤
−1 0⎦. 3
114
Handbook of Linear Algebra
Hence, using the Jordan canonical form definition, we have
e A = Xe AJ X −1 = X [1] ⊕ ⎡
1 = ⎣ −1 −1
−1 2 0
⎤⎡
−1 1 0⎦⎣0 3 0
⎡
6 − 7e = ⎣ −6 + 10e −6 + 6e
3 − 4e −3 + 6e −3 + 3e
e e 0e
0 e 0
X −1 ⎤⎡
0 6 e ⎦⎣2 e 2
3 2 1
⎤
2 1⎦ 1
⎤
2 − 3e −2 + 4e ⎦ . −2 + 3e
√ 3. Compute A for the matrix in Example 2. To obtain the square root, we use the polynomial interpolation definition. The eigenvalues of A are 0 and 1, with indices 1 and 2, respectively. The unique polynomial r of degree at most 2 satisfying the interpolation conditions r (0) = f (0), r (1) = f (1), r (1) = f (1) is r (t) = f (0)(t − 1)2 + t(2 − t) f (1) + t(t − 1) f (1). With f (t) = t 1/2 , taking the positive square root, we have r (t) = t(2 − t) + t(t − 1)/2 and, therefore, ⎡
A1/2
−6 −3.5 = A(2I − A) + A(A − I )/2 = ⎣ 8 5 6 3
⎤
−2.5 3 ⎦. 3
4. Consider the mk × mk Jordan block J k (λk ) in (11.1). The polynomial satisfying the interpolation conditions (11.4) is r (t) = f (λk ) + (t − λk ) f (λk ) +
(t − λk )2 (t − λk )mk −1 (mk −1) f (λk ) + · · · + f (λk ), 2! (mk − 1)!
which, of course, is the first mk terms of the Taylor series of f about λk . Hence, from the polynomial interpolation definition, f (J k (λk )) = r (J k (λk )) = f (λk )I + (J k (λk ) − λk I ) f (λk ) + +
(J k (λk ) − λk I )2 f (λk ) + · · · 2!
(J k (λk ) − λk I )mk −1 (mk −1) f (λk ). (mk − 1)!
The matrix (J k (λk ) − λk I ) j is zero except for 1s on the j th superdiagonal. This expression for f (J k (λk )) is, therefore, equal to that in (11.3), confirming the consistency of the first two definitions of f (A).
11.2
Matrix Square Root
Definitions: Let A ∈ Cn×n . Any X such that X 2 = A is a square root of A.
115
Functions of Matrices
Facts: Proofs of the facts in this section can be found in one or more of [Hig], [HJ91], or [LT85], unless otherwise stated. 1. If A ∈ Cn×n has no eigenvalues on R− 0 (the closed negative real axis) then there is a unique square root X of A each of whose eigenvalues is 0 or lies in the open right halfplane, and it is a primary matrix function of A. This is the principal square root of A and is written X = A1/2 . If A is real then A1/2 is real. An integral representation is A1/2 =
2 A π
∞ 0
(t 2 I + A)−1 dt.
2. A positive (semi)definite matrix A ∈ Cn×n has a unique positive (semi)definite square root. (See also Section 8.3.) 3. [CL74] A singular matrix A ∈ Cn×n may or may not have a square root. A necessary and sufficient condition for A to have a square root is that in the “ascent sequence” of integers d1 , d2 , . . . defined by di = dim(ker(Ai )) − dim(ker(Ai −1 )), no two terms are the same odd integer. 4. A ∈ Rn×n has a real square root if and only if A satisfies the condition in the previous fact and A has an even number of Jordan blocks of each size for every negative eigenvalue. 5. The n × n identity matrix In has 2n diagonal square roots diag(±1). Only two of these are primary matrix functions, namely I and −I . Nondiagonal but symmetric nonprimary square roots of In include any Householder matrix I − 2vvT /(vT v) (v = 0) and the identity matrix with its columns in reverse order. Nonsymmetric square roots of In are easily constructed in the form X D X −1 , where X is nonsingular but nonorthogonal and D = diag(±1) = ±I . Examples:
1. The Jordan block
01 00
has no square root. The matrix ⎡
0 ⎣0 0
1 0 0
⎤
0 0⎦ 0
has ascent sequence 2, 1, 0, . . . and so does have a square root — for example, the matrix ⎡
0 ⎣0 0
11.3
0 0 1
⎤
1 0⎦. 0
Matrix Exponential
Definitions: The exponential of A ∈ Cn×n , written e A or exp( A), is defined by eA = I + A +
A2 Ak + ··· + + ···. 2! k!
116
Handbook of Linear Algebra
Facts: Proofs of the facts in this section can be found in one or more of [Hig], [HJ91], or [LT85], unless otherwise stated. 1. e (A+B)t = e At e Bt holds for all t if and only if AB = B A. 2. The differential equation in n × n matrices dY = AY, dt
Y (0) = C,
A, Y ∈ Cn×n ,
has solution Y (t) = e At C . 3. The differential equation in n × n matrices dY = AY + YB, dt
Y (0) = C,
A, B, Y ∈ Cn×n ,
has solution Y (t) = e At C e Bt . 4. A ∈ Cn×n is unitary if and only if it can be written A = e i H , where H is Hermitian. In this representation H can be taken to be Hermitian positive definite. 5. A ∈ Rn×n is orthogonal with det(A) = 1 if and only if A = e S with S ∈ Rn×n skewsymmetric. Examples: 1. Fact 5 is illustrated by the matrix
A= for which
eA =
11.4
0 −α
cos α − sin α
α , 0
sin α . cos α
Matrix Logarithm
Definitions: Let A ∈ Cn×n . Any X such that e X = A is a logarithm of A. Facts: Proofs of the facts in this section can be found in one or more of [Hig], [HJ91], or [LT85], unless otherwise stated. 1. If A has no eigenvalues on R− , then there is a unique logarithm X of A all of whose eigenvalues lie in the strip { z : −π < Im(z) < π }. This is the principal logarithm of A and is written X = log A. If A is real, then log A is real. 2. If ρ(A) < 1, log(I + A) = A −
A3 A4 A2 + − + ···. 2 3 4
3. A ∈ Rn×n has a real logarithm if and only if A is nonsingular and A has an even number of Jordan blocks of each size for every negative eigenvalue. 4. exp(log A) = A holds when log is defined on the spectrum of A ∈ Cn×n . But log(exp( A)) = A does not generally hold unless the spectrum of A is restricted. 5. If A ∈ Cn×n is nonsingular then det(A) = exp(tr(log A)), where log A is any logarithm of A.
117
Functions of Matrices
Examples: For the matrix
⎡
1 ⎢0 ⎢ A=⎣ 0 0 we have
1 1 0 0
⎡
0 ⎢0 log(A) = ⎢ ⎣0 0
11.5
⎤
1 2 1 0
1 0 0 0
1 3⎥ ⎥, 3⎦ 1
0 2 0 0
⎤
0 0⎥ ⎥. 3⎦ 0
Matrix Sine and Cosine
Definitions: The sine and cosine of A ∈ Cn×n are defined by (−1)k 2k A2 + ··· + A + ···, 2! (2k)! (−1)k A3 + ··· + A2k+1 + · · · . sin(A) = A − 3! (2k + 1)!
cos(A) = I −
Facts: Proofs of the facts in this subsection can be found in one or more of [Hig], [HJ91], or [LT85], unless otherwise stated. 1. 2. 3. 4.
cos(2A) = 2 cos2 (A) − I . sin(2A) = 2 sin(A) cos(A). cos2 (A) + sin2 (A) = I . The differential equation d2 y + Ay = 0, dt 2
y (0) = y0
y(0) = y0 ,
has solution √ −1 √ √ A sin( At)y0 , y(t) = cos( At)y0 +
where
√
A denotes any square root of A.
Examples: 1. For
A= we have
eA =
0 iα
cos α i sin α
iα , 0
i sin α . cos α
118
Handbook of Linear Algebra
2. For
⎡
⎤
1 1 1 1 ⎢ 0 −1 −2 −3 ⎥ ⎥, A=⎢ ⎣0 0 1 3⎦ 0 0 0 −1 we have
⎡
cos(A) = cos(1)I,
⎤
sin(1) ⎢ 0 sin(A) = ⎢ ⎣ 0 0
sin(1) sin(1) sin(1) − sin(1) −2 sin(1) −3 sin(1) ⎥ ⎥, 0 sin(1) 3 sin(1) ⎦ 0 0 − sin(1)
and sin2 (A) = sin(1)2 I , so cos(A)2 + sin(A)2 = I .
11.6
Matrix Sign Function
Definitions: If A = Z J A Z −1 ∈ Cn×n is a Jordan canonical form arranged so that
JA =
J A(1) 0
0 J A(2)
,
where the eigenvalues of J A(1) ∈ C p× p lie in the open left halfplane and those of J A(2) ∈ Cq ×q lie in the open right halfplane, with p + q = n, then
sign(A) = Z
−I p 0
0 Iq
Z −1 .
Alternative formulas are sign(A) = A(A2 )−1/2 ,
∞ 2 sign(A) = A (t 2 I + A2 )−1 dt. π 0
(11.6)
If A has any pure imaginary eigenvalues, then sign( A) is not defined. Facts: Proofs of the facts in this section can be found in [Hig]. Let S = sign(A) be defined. Then 1. 2. 3. 4. 5.
S 2 = I (S is involutory). S is diagonalizable with eigenvalues ±1. S A = AS. If A is real, then S is real. If A is symmetric positive definite, then sign(A) = I .
Examples: 1. For the matrix A in Example 2 of the previous subsection we have sign(A) = A, which follows from (11.6) and the fact that A is involutory.
119
Functions of Matrices
11.7
Computational Methods for General Functions
Many methods have been proposed for evaluating matrix functions. Three general approaches of wide applicability are outlined here. They have in common that they do not require knowledge of Jordan structure and are suitable for computer implementation. References for this subsection are [GVL96], [Hig]. 1. Polynomial and Rational Approximations: Polynomial approximations
pm (X) =
m
bk X k ,
bk ∈ C, X ∈ Cn×n ,
k=0
to matrix functions can be obtained by truncating or economizing a power series representation, or by constructing a best approximation (in some norm) of a given degree. How to most efficiently evaluate a polynomial at a matrix argument is a nontrivial question. Possibilities include Horner’s method, explicit computation of the powers of the matrix, and a method of Paterson and Stockmeyer [GVL96, Sec. 11.2.4], [PS73], which is a combination of these two methods that requires fewer matrix multiplications. Rational approximations r mk (X) = pm (X)q k (X)−1 are also widely used, particularly those arising from Pad´e approximation, which produces rationals matching as many terms of the Taylor series of the function at the origin as possible. The evaluation of rationals at matrix arguments needs careful consideration in order to find the best compromise between speed and accuracy. The main possibilities are r Evaluating the numerator and denominator polynomials and then solving a multiple righthand
side linear system.
r Evaluating a continued fraction representation (in either topdown or bottomup order). r Evaluating a partial fraction representation.
Since polynomials and rationals are typically accurate over a limited range of matrices, practical methods involve a reduction stage prior to evaluating the polynomial or rational. 2. Factorization Methods: Many methods are based on the property f (X AX −1 ) = X f (A)X −1 . If X can be found such that B = X AX −1 has the property that f (B) is easily evaluated, then an obvious method results. When A is diagonalizable, B can be taken to be diagonal, and evaluation of f (B) is trivial. In finite precision arithmetic, though, this approach is reliable only if X is well conditioned, that is, if the condition number κ(X) = XX −1 is not too large. Ideally, X will be unitary, so that in the 2norm κ2 (X) = 1. For Hermitian A, or more generally normal A, the spectral decomposition A = Q D Q ∗ with Q unitary and D diagonal is always possible, and if this decomposition can be computed then the formula f (A) = Q f (D)Q ∗ provides an excellent way of computing f (A). For general A, if X is restricted to be unitary, then the furthest that A can be reduced is to Schur form: A = QT Q ∗ , where Q is unitary and T upper triangular. This decomposition is computed by the QR algorithm. Computing a function of a triangular matrix is an interesting problem. While Fact 11 of section 11.1 gives an explicit formula for F = f (T ), the formula is not practically viable due to its exponential cost in n. Much more efficient is a recurrence of Parlett [Par76]. This is derived by starting with the observation that since F is representable as a polynomial in T , F is upper triangular, with diagonal elements f (tii ). The elements in the strict upper triangle are determined by solving the equation F T = T F . Parlett’s recurrence is:
1110
Handbook of Linear Algebra
Algorithm 1. Parlett’s recurrence. f ii = f (tii ), i = 1: n for j = 2: n for i = j − 1: −1: 1 f ii − f j j + f i j = ti j tii − t j j
j −1
f i k tk j − ti k f k j
(tii − t j j )
k=i +1
end end
This recurrence can be evaluated in 2n3 /3 operations. The recurrence breaks down when tii = t j j for some i = j . In this case, T can be regarded as a block matrix T = (Ti j ), with square diagonal blocks, possibly of different sizes. T can be reordered so that no two diagonal blocks have an eigenvalue in common; reordering means applying a unitary similarity transformation to permute the diagonal elements whilst preserving triangularity. Then a block form of the recurrence can be employed. This requires the evaluation of the diagonal blocks F ii = f (Tii ), where Tii will typically be of small dimension. A general way to obtain F ii is via a Taylor series. The use of the block Parlett recurrence in combination with a Schur decomposition represents the state of the art in evaluation of f (A) for general functions [DH03]. 3. Iteration Methods: Several matrix functions f can be computed by iteration: X k+1 = g (X k ),
X 0 = A,
(11.7)
where, for reasons of computational cost, g is usually a polynomial or a rational function. Such an iteration might converge for all A for which f is defined, or just for a subset of such A. A standard means of deriving matrix iterations is to apply Newton’s method to an algebraic equation satisfied by f (A). The iterations most used in practice are quadratically convergent, but iterations with higher orders of convergence are known. 4. Contour Integration: The Cauchy integral definition (11.5) provides a way to compute or approximate f (A) via contour integration. While not suitable as a practical method for all functions or all matrices, this approach can be effective when numerical integration is done over a suitable contour using the repeated trapezium rule, whose high accuracy properties for periodic functions integrated over a whole period are beneficial [DH05], [TW05].
11.8
Computational Methods for Specific Functions
Some methods specialized to particular functions are now outlined. References for this section are [GVL96], [Hig]. 1. Matrix Exponential: A large number of methods have been proposed for the matrix exponential, many of them of pedagogic interest only or of dubious numerical stability. Some of the more computationally useful methods are surveyed in [MVL03]. Probably the best generalpurpose method is the scaling and squaring method. In this method an integral power of 2, σ = 2s say, is chosen so that A/σ has norm not too far from 1. The s exponential of the scaled matrix is approximated by an [m/m] Pad´e approximant, e A/2 ≈ r mm (A/2s ), A A s 2s and then s repeated squarings recover an approximation to e : e ≈ r mm (A/2 ) . Symmetries in the Pad´e
1111
Functions of Matrices
approximant permit an efficient evaluation of r mm (A). The scaling and squaring method was originally developed in [MVL78] and [War77], and it is the method employed by MATLAB’s expm function. How best to choose σ and m is described in [Hig05]. 2. Matrix Logarithm: The (principal) matrix logarithm can be computed using an inverse scaling and squaring method based k on the identity log A = 2k log A1/2 , where A is assumed to have no eigenvalues on R− . Square roots k k are taken to make A1/2 − I small enough that an [m/m] Pad´e approximant approximates log A1/2 sufficiently accurately, for some suitable m. Then log A is recovered by multiplying by 2k . To reduce the cost of computing the square roots and evaluating the Pad´e approximant, a Schur decomposition can be computed initially so that the method works with a triangular matrix. For details, see [CHKL01], [Hig01], or [KL89, App. A]. 3. Matrix Cosine and Sine: A method analogous to the scaling and squaring method for the exponential is the standard method for computing the matrix cosine. The idea is again to scale A to have norm not too far from 1 and then compute a Pad´e approximant. The difference is that the scaling is undone by repeated use of the doubleangle formula cos(2A) = 2 cos2 A− I , rather than by repeated squaring. The sine function can be obtained as sin(A) = cos(A − π2 I ). (See [SB80], [HS03], [HH05].) 4. Matrix Square Root: The most numerically reliable way to compute matrix square roots is via the Schur decomposition, A = QT Q ∗ [BH83]. Rather than use the Parlett recurrence, a square root U of the upper triangular factor T can be computed by directly solving the equation U 2 = T . The choices of sign in the diagonal of U , √ uii = tii , determine which square root is obtained. When A is real, the real Schur decomposition can be used to compute real square roots entirely in real arithmetic [Hig87]. Various iterations exist for computing the principal square root when A has no eigenvalues on R− . The basic Newton iteration, X k+1 =
1 (X k + X k−1 A), 2
X 0 = A,
(11.8)
is quadratically convergent, but is numerically unstable unless A is extremely well conditioned and its use is not recommended [Hig86]. Stable alternatives include the Denman–Beavers iteration [DB76] 1 X k + Yk−1 , 2 1 Yk + X k−1 , Yk+1 = 2
X k+1 =
X 0 = A, Y0 = I,
for which limk→∞ X k = A1/2 and limk→∞ Yk = A−1/2 , and the Meini iteration [Mei04] Yk+1 = −Yk Z k−1 Yk ,
Y0 = I − A,
Z k+1 = Z k + 2Yk+1 ,
Z 0 = 2(I + A),
for which Yk → 0 and Z k → 4A1/2 . Both of these iterations are mathematically equivalent to (11.8) and, hence, are quadratically convergent. An iteration not involving matrix inverses is the Schulz iteration Yk+1 = 12 Yk (3I − Z k Yk ), Z k+1 = 12 (3I − Z k Yk )Z k ,
Y0 = A, Z 0 = I,
for which Yk → A1/2 and Z k → A−1/2 quadratically provided that diag(A − I, A − I ) < 1, where the norm is any consistent matrix norm [Hig97].
1112
Handbook of Linear Algebra
5. Matrix Sign Function: The standard method for computing the matrix sign function is the Newton iteration X k+1 =
1 (X k + X k−1 ), 2
X 0 = A,
which converges quadratically to sign( A), provided A has no pure imaginary eigenvalues. In practice, a scaled iteration X k+1 =
1 −1 (µk X k + µ−1 k X k ), 2
X0 = A
is used, where the scale parameters µk are chosen to reduce the number of iterations needed to enter the regime where asymptotic quadratic convergence sets in. (See [Bye87], [KL92].) The Newton–Schulz iteration X k+1 =
1 X k (3I − X k2 ), 2
X 0 = A,
involves no matrix inverses, but convergence is guaranteed only for I − A2 < 1. A Pad´e family of iterations
X k+1 = X k pm 1 − X k2 q m 1 − X k2
−1
,
X0 = A
is obtained in [KL91], where pm (ξ )/q m (ξ ) is the [/m] Pad´e approximant to (1 − ξ )−1/2 . The iteration is globally convergent to sign(A) for = m − 1 and = m, and for ≥ m − 1 is convergent when I − A2 < 1, with order of convergence + m + 1 in all cases.
References [BH83] ˚Ake Bj¨orck and Sven Hammarling. A Schur method for the square root of a matrix. Lin. Alg. Appl., 52/53:127–140, 1983. [Bye87] Ralph Byers. Solving the algebraic Riccati equation with the matrix sign function. Lin. Alg. Appl., 85:267–279, 1987. [CHKL01] Sheung Hun Cheng, Nicholas J. Higham, Charles S. Kenney, and Alan J. Laub. Approximating the logarithm of a matrix to specified accuracy. SIAM J. Matrix Anal. Appl., 22(4):1112–1125, 2001. [CL74] G.W. Cross and P. Lancaster. Square roots of complex matrices. Lin. Multilin. Alg., 1:289–293, 1974. [Dav73] Chandler Davis. Explicit functional calculus. Lin. Alg. Appl., 6:193–199, 1973. [DB76] Eugene D. Denman and Alex N. Beavers, Jr. The matrix sign function and computations in systems. Appl. Math. Comput., 2:63–94, 1976. [Des63] Jean Descloux. Bounds for the spectral norm of functions of matrices. Numer. Math., 15:185–190, 1963. [DH03] Philip I. Davies and Nicholas J. Higham. A Schur–Parlett algorithm for computing matrix functions. SIAM J. Matrix Anal. Appl., 25(2):464–485, 2003. [DH05] Philip I. Davies and Nicholas J. Higham. Computing f (A)b for matrix functions f . In Artan ´ Anthony Kennedy, and Brian Pendleton, Eds., QCD and Boric¸i, Andreas Frommer, B´aalint Joo, Numerical Analysis III, Vol. 47 of Lecture Notes in Computational Science and Engineering, pp. 15–24. SpringerVerlag, Berlin, 2005. [GVL96] Gene H. Golub and Charles F. Van Loan. Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996. [HH05] Gareth I. Hargreaves and Nicholas J. Higham. Efficient algorithms for the matrix cosine and sine. Numerical Algorithms, 40:383–400, 2005. [Hig] Nicholas J. Higham. Functions of a Matrix: Theory and Computation. (Book in preparation.) [Hig86] Nicholas J. Higham. Newton’s method for the matrix square root. Math. Comp., 46(174):537–549, 1986.
Functions of Matrices
1113
[Hig87] Nicholas J. Higham. Computing real square roots of a real matrix. Lin. Alg. Appl., 88/89:405–430, 1987. [Hig97] Nicholas J. Higham. Stable iterations for the matrix square root. Num. Algor.,15(2):227–242, 1997. [Hig01] Nicholas J. Higham. Evaluating Pad´e approximants of the matrix logarithm. SIAM J. Matrix Anal. Appl., 22(4):1126–1135, 2001. [Hig05] Nicholas J. Higham. The scaling and squaring method for the matrix exponential revisited. SIAM J. Matrix Anal. Appl., 26(4):1179–1193, 2005. [HJ91] Roger A. Horn and Charles R. Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, 1991. [HS03] Nicholas J. Higham and Matthew I. Smith. Computing the matrix cosine. Num. Algor., 34:13–26, 2003. [KL89] Charles S. Kenney and Alan J. Laub. Condition estimates for matrix functions. SIAM J. Matrix Anal. Appl., 10(2):191–209, 1989. [KL91] Charles S. Kenney and Alan J. Laub. Rational iterative methods for the matrix sign function. SIAM J. Matrix Anal. Appl., 12(2):273–291, 1991. [KL92] Charles S. Kenney and Alan J. Laub. On scaling Newton’s method for polar decomposition and the matrix sign function. SIAM J. Matrix Anal. Appl., 13(3):688–706, 1992. [LT85] Peter Lancaster and Miron Tismenetsky. The Theory of Matrices, 2nd ed., Academic Press, London, 1985. [Mei04] Beatrice Meini. The matrix square root from a new functional perspective: theoretical results and computational issues. SIAM J. Matrix Anal. Appl., 26(2):362–376, 2004. [MVL78] Cleve B. Moler and Charles F. Van Loan. Nineteen dubious ways to compute the exponential of a matrix. SIAM Rev., 20(4):801–836, 1978. [MVL03] Cleve B. Moler and Charles F. Van Loan. Nineteen dubious ways to compute the exponential of a matrix, twentyfive years later. SIAM Rev., 45(1):3–49, 2003. [Par76] B. N. Parlett. A recurrence among the elements of functions of triangular matrices. Lin. Alg. Appl., 14:117–121, 1976. [PS73] Michael S. Paterson and Larry J. Stockmeyer. On the number of nonscalar multiplications necessary to evaluate polynomials. SIAM J. Comput., 2(1):60–66, 1973. [SB80] Steven M. Serbin and Sybil A. Blalock. An algorithm for computing the matrix cosine. SIAM J. Sci. Statist. Comput., 1(2):198–204, 1980. [TW05] L. N. Trefethen and J. A. C. Weideman. The fast trapezoid rule in scientific computing. Paper in preparation, 2005. [War77] Robert C. Ward. Numerical computation of the matrix exponential with accuracy estimate. SIAM J. Numer. Anal., 14(4):600–610, 1977.
12 Quadratic, Bilinear, and Sesquilinear Forms
Raphael Loewy Technion
12.1 Bilinear Forms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121 12.2 Symmetric Bilinear Forms . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123 12.3 Alternating Bilinear Forms . . . . . . . . . . . . . . . . . . . . . . . . . . . 125 12.4 ϕSesquilinear Forms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126 12.5 Hermitian Forms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129
Bilinear forms are maps defined on V × V , where V is a vector space, and are linear with respect to each of their variables. There are some similarities between bilinear forms and inner products that are discussed in Chapter 5. Basic properties of bilinear forms, symmetric bilinear forms, and alternating bilinear forms are discussed. The latter two types of forms satisfy additional symmetry conditions. Quadratic forms are obtained from symmetric bilinear forms by equating the two variables. They are widely used in many areas. A canonical representation of a quadratic form is given when the underlying field is R or C. When the field is the complex numbers, it is standard to expect the form to be conjugate linear rather than linear in the second variable; such a form is called sesquilinear. The role of a symmetric bilinear form is played by a Hermitian sesquilinear form. The idea of a sesquilinear form can be generalized to an arbitrary automorphism, encompassing both bilinear and sesquilinear forms as ϕsesquilinear forms, where ϕ is an automorphism of the field. Quadratic, bilinear, and ϕsesquilinear forms have applications to classical matrix groups. (See Chapter 67 for more information.)
12.1
Bilinear Forms
It is assumed throughout this section that V is a finite dimensional vector space over a field F . Definitions: A bilinear form on V is a map f from V × V into F which satisfies f (au1 + bu2 , v) = a f (u1 , v) + b f (u2 , v),
u1 , u2 , v ∈ V, a, b ∈ F ,
f (u, av1 + bv2 ) = a f (u, v1 ) + b f (u, v2 ),
u, v1 , v2 ∈ V, a, b ∈ F .
and
121
122
Handbook of Linear Algebra
The space of all bilinear forms on V is denoted B(V, V, F ). Let B = (w1 , w2 , . . . , wn ) be an ordered basis of V and let f ∈ B(V, V, F ). The matrix representing f relative to B is the matrix A = [ai j ] ∈ F n×n such that ai j = f (wi , wj ). The rank of f ∈ B(V, V, F ), rank( f ), is rank(A), where A is a matrix representing f relative to an arbitrary ordered basis of V . f ∈ B(V, V, F ) is nondegenerate if its rank is equal to dim V , and degenerate if it is not nondegenerate. Let A, B ∈ F n×n . B is congruent to A if there exists an invertible P ∈ F n×n such that B = P T AP . Let f, g ∈ B(V, V, F ). g is equivalent to f if there exists an ordered basis B of V such that the matrix of g relative to B is congruent to the matrix of f relative to B. Let T be a linear operator on V and let f ∈ B(V, V, F ). T preserves f if f (T u, T v) = f (u, v) for all u, v ∈ V . Facts: Let f ∈ B(V, V, F ). The following facts can be found in [HK71, Chap. 10]. 1. f is a linear functional in each of its variables when the other variable is held fixed. 2. Let B = (w1 , w2 , . . . , wn ) be an ordered basis of V and let u=
n
v=
ai wi ,
i =1
n
bi wi .
i =1
Then, f (u, v) =
n n
ai b j f (wi , wj ).
i =1 j =1
3. Let A denote the matrix representing f relative to B, and let [u]B and [v]B be the vectors in F n that are the coordinate vectors of u and v, respectively, with respect to B. Then f (u, v) = [u]BT A[v]B . 4. Let B and B be ordered bases of V , and P be the matrix whose columns are the Bcoordinates of vectors in B . Let f ∈ B(V, V, F ). Let A and B denote the matrices representing f relative to B and B . Then B = P T AP . 5. The concept of rank of f , as given, is well defined. 6. The set L = {v ∈ V : f (u, v) = 0 for all u ∈ V } is a subspace of V and rank( f ) = dim V −dim L . In particular, f is nondegenerate if and only if L = {0}. 7. Suppose that dim V = n. The space B(V, V, F ) is a vector space over F under the obvious addition of two bilinear forms and multiplication of a bilinear form by a scalar. Moreover, B(V, V, F ) is isomorphic to F n×n . 8. Congruence is an equivalence relation on F n×n . 9. Let f ∈ B(V, V, F ) be nondegenerate. Then the set of all linear operators on V , which preserve f , is a group under the operation of composition. Examples: 1. Let A ∈ F n×n . The map f : F n × F n → F defined by f (u, v) = uT Av =
n n
ai j ui v j ,
u, v ∈ F n ,
i =1 j =1
is a bilinear form. Since f (ei , ej ) = ai j , i, j = 1, 2, . . . , n, f is represented in the standard basis of F n by A. It follows that rank( f ) = rank(A), and f is nondegenerate if and only if A is invertible.
123
Quadratic, Bilinear, and Sesquilinear Forms
2. Let C ∈ F m×m and rank(C ) = k. The map f : F m×n × F m×n → F defined by f (A, B) = tr(AT C B) is a bilinear form. This follows immediately from the basic properties of the trace function. To compute rank( f ), let L be defined as in Fact 6, that is, L = {B ∈ F m×n : tr(AT C B) = 0 for all A ∈ F m×n }. It follows that L = {B ∈ F m×n : C B = 0}, which implies that dim L = n(m − k). Hence, rank( f ) = mn − n(m − k) = kn. In particular, f is nondegenerate if and only if C is invertible. 3. Let R[x; n] denote the space of all real polynomials of the form in=0 ai x i . Then f ( p(x), q (x)) = p(0)q (0) + p(1)q (1) + p(2)q (2) is a bilinear form on R[x; n]. It is nondegenerate if n = 2 and degenerate if n 3.
12.2
Symmetric Bilinear Forms
It is assumed throughout this section that V is a finite dimensional vector space over a field F . Definitions: Let f ∈ B(V, V, F ). Then f is symmetric if f (u, v) = f (v, u) for all u, v ∈ V . Let f be a symmetric bilinear form on V , and let u, v ∈ V ; u and v are orthogonal with respect to f if f (u, v) = 0. Let f be a symmetric bilinear form on V . The quadratic form corresponding to f is the map g : V → F defined by g (v) = f (v, v), v ∈ V . A symmetric bilinear form f on a real vector space V is positive semidefinite (positive definite) if f (v, v) 0 for all v ∈ V ( f (v, v) > 0 for all 0 = v ∈ V ). f is negative semidefinite (negative definite) if − f is positive semidefinite (positive definite). The signature of a real symmetric matrix A is the integer π − ν, where (π, ν, δ) is the inertia of A. (See Section 8.3.) The signature of a real symmetric bilinear form is the signature of a matrix representing the form relative to some basis. Facts: Additional facts about real symmetric matrices can be found in Chapter 8. Except where another reference is provided, the following facts can be found in [Coh89, Chap. 8], [HJ85, Chap. 4], or [HK71, Chap. 10]. 1. A positive definite bilinear form is nondegenerate. 2. An inner product on a real vector space is a positive definite symmetric bilinear form. Conversely, a positive definite symmetric bilinear form on a real vector space is an inner product. 3. Let B be an ordered basis of V and let f ∈ B(V, V, F ). Let A be the matrix representing f relative to B. Then f is symmetric if and only if A is a symmetric matrix, that is, A = AT . 4. Let f be a symmetric bilinear form on V and let g be the quadratic form corresponding to f . Suppose that the characteristic of F is not 2. Then f can be recovered from g : f (u, v) = 12 [g (u + v) − g (u) − g (v)]
for all u, v ∈ V .
5. Let f be a symmetric bilinear form on V and suppose that the characteristic of F is not 2. Then there exists an ordered basis B of V such that the matrix representing f relative to it is diagonal; i.e., if A ∈ F n×n is a symmetric matrix, then A is congruent to a diagonal matrix. 6. Suppose that V is a complex vector space and f is a symmetric bilinear form on V . Let r = rank( f ). Then there is an ordered basis B of V such that the matrix representing f relative to B is Ir ⊕ 0. In matrix language, this fact states that if A ∈ Cn×n is symmetric with rank(A) = r, then it is congruent to Ir ⊕ 0. 7. The only invariant of n × n complex symmetric matrices under congruence is the rank. 8. Two complex n × n symmetric matrices are congruent if and only if they have the same rank.
124
Handbook of Linear Algebra
9. (Sylvester’s law of inertia for symmetric bilinear forms) Suppose that V is a real vector space and f is a symmetric bilinear form on V . Then there is an ordered basis B of V such that the matrix representing f relative to it has the form Iπ ⊕ −Iν ⊕ 0δ . Moreover, π, ν, and δ do not depend on the choice of B, but only on f . 10. (Sylvester’s law of inertia for matrices) If A ∈ Rn×n is symmetric, then A is congruent to the diagonal matrix D = Iπ ⊕ −Iν ⊕ 0δ , where (π, ν, δ) = in(A). 11. There are exactly two invariants of n × n real symmetric matrices under congruence, namely the rank and the signature. 12. Two real n × n symmetric matrices are congruent if and only if they have the same rank and the same signature. 13. The signature of a real symmetric bilinear form is well defined. 14. Two real symmetric bilinear forms are equivalent if and only if they have the same rank and the same signature. 15. [Hes68] Let n 3 and let A, B ∈ Rn×n be symmetric. Suppose that x ∈ Rn , xT Ax = xT Bx = 0 ⇒ x = 0. Then ∃ a, b ∈ R such that aA + bB is positive definite. n n 16. The group of linear operators preserving the form f (u, v) = i =1 u i v i on R is the real n ndimensional orthogonal group, while the group preserving the same form on C is the complex ndimensional orthogonal group. Examples: 1. Consider Example 1 in section 12.1. The map f is a symmetric bilinear form if and only if A = AT . The quadratic form g corresponding to f is given by g (u) =
n n
ai j ui u j ,
u ∈ F n.
i =1 j =1
2. Consider Example 2 in section 12.1. The map f is a symmetric bilinear form if and only if C = C T . 3. The symmetric bilinear form f a on R2 given by f a (u, v) = u1 v 1 − 2u1 v 2 − 2u2 v 1 + au2 v 2 ,
u, v ∈ R2 ,
a ∈ R is a parameter,
is an inner product on R2 if and only if a > 4. 4. Since we consider in this article only finite dimensional vector spaces, let V be any finite dimensional subspace of C [0, 1], the space of all real valued, continuous functions on [0, 1]. Then the map f : V × V → R defined by
f (u, v) =
1 0
t 3 u(t)v(t)dt,
u, v ∈ V,
is a symmetric bilinear form on V. Applications: 1. Conic sections: Consider the set of points (x1 , x2 ) in R2 , which satisfy the equation ax12 + bx1 x2 + c x22 + d x1 + e x2 + f = 0, where a, b, c , d, e, f ∈ R. The solution set is a conic section, namely an ellipse, hyperbola, parabola, or a degenerate form of those. The analysis of this equation depends heavily on the quadratic form a b/2 ax12 + bx1 x2 + c x22 , which is represented in the standard basis of R2 by A = . If the b/2 c solution of the quadratic equation above represents a nondegenerate conic section, then its type is determined by the sign of 4ac − b 2 . More precisely, the conic is an ellipse, hyperbola, or parabola if 4ac − b 2 is positive, negative, or zero, respectively.
125
Quadratic, Bilinear, and Sesquilinear Forms
2. Theory of small oscillations: Suppose a mechanical system undergoes small oscillations about an equilibrium position. Let x1 , x2 , . . . , xn denote the coordinates of the system, and let x = (x1 , x2 , . . . , xn )T . Then the kinetic energy of the system is given by a quadratic form (in the velocities ˙ where A is a positive definite matrix. If x = 0 is the equilibrium position, x˙ 1 , x˙ 2 , . . . , x˙ n ) 12 x˙ T Ax, then the potential energy of the system is given by another quadratic form 12 xT Bx, where B = B T . The equations of motion are A¨x + Bx = 0. It is known that A and B can be simultaneously diagonalized, that is, there exists an invertible P ∈ Rn×n such that P T AP and P T B P are diagonal matrices. This can be used to obtain the solution of the system.
12.3
Alternating Bilinear Forms
It is assumed throughout this section that V is a finite dimensional vector space over a field F . Definitions: Let f ∈ B(V, V, F ). Then f is alternating if f (v, v) = 0 for all v ∈ V . f is antisymmetric if f (u, v) = − f (v, u) for all u, v ∈ V . Let A ∈ F n×n . Then A is alternating if aii = 0, i = 1, 2, . . . , n and a j i = −ai j , 1 i < j n. Facts: The following facts can be found in [Coh89, Chap. 8], [HK71, Chap. 10], or [Lan99, Chap. 15]. 1. Let f ∈ B(V, V, F ) be alternating. Then f is antisymmetric because for all u, v ∈ V , f (u, v) + f (v, u) = f (u + v, u + v) − f (u, u) − f (v, v) = 0. The converse is true if the characteristic of F is not 2. 2. Let A ∈ F n×n be an alternating matrix. Then AT = −A. The converse is true if the characteristic of F is not 2. 3. Let B be an ordered basis of V and let f ∈ B(V, V, F ). Let A be the matrix representing f relative to B. Then f is alternating if and only if A is an alternating matrix. 4. Let f be an alternating bilinear form on V and let r = rank( f ). Then r is even and there exists an ordered basis B of V such that the matrix representing f relative to it has the form
0
1
−1
0
⊕
0
1
−1
0
⊕ ··· ⊕
r/2 − times
0
1
−1
0
⊕ 0.
0 Ir/2 ⊕ 0. There is an ordered basis B1 where f is represented by the matrix −Ir/2 0 5. Let f ∈ B(V, V, F ) and suppose that the characteristic of F is not 2. Define: f 1 : V × V → F by f 1 (u, v) = 12 [ f (u, v) + f (v, u)] , u, v ∈ V , f 2 : V × V → F by f 2 (u, v) = 12 [ f (u, v) − f (v, u)] , u, v ∈ V . Then f 1 ( f 2 ) is a symmetric (alternating) bilinear form on V , and f = f 1 + f 2 . Moreover, this representation of f as a sum of a symmetric and an alternating bilinear form is unique. matrixand suppose that A is invertible. Then n is even and A 6. Let A ∈ F n×n be an alternating 0 In/2 is congruent to the matrix , so det(A) is a square in F . There exists a polynomial −In/2 0 in n(n − 1)/2 variables, called the Pfaffian, such that det(A) = a 2 , where a ∈ F is obtained by substituting into the Pfaffian the entries of A above the main diagonal for the indeterminates.
126
Handbook of Linear Algebra
7. Let f be an alternating nondegenerate bilinear form on V . Then dim V = 2m for some positive integer m. The group of all linear operators on V that preserve f is the symplectic group. Examples: 1. Consider Example 1 in section 12.1. The map f is alternating if and only if the matrix A is an alternating matrix. 2. Consider Example 2 in section 12.1. The map f is alternating if and only if C is an alternating matrix. 3. Let C ∈ F n×n . Define f : F n×n → F n×n by f (A, B) = tr(AC B − BC A). Then f is alternating.
12.4 ϕSesquilinear Forms This section generalizes Section 12.1, and is consequently very similar. This generalization is required by applications to matrix groups (see Chapter 67), but for most purposes such generality is not required, and the simpler discussion of bilinear forms in Section 12.1 is preferred. It is assumed throughout this section that V is a finite dimensional vector space over a field F and ϕ is an automorphism of F . Definitions: A ϕsesquilinear form on V is a map f : V × V → F , which is linear as a function in the first variable and ϕsemilinear in the second, i.e., f (au1 + bu2 , v) = a f (u1 , v) + b f (u2 , v),
u1 , u2 , v ∈ V, a, b ∈ F ,
and f (u, av1 + bv2 ) = ϕ(a) f (u, v1 ) + ϕ(b) f (u, v2 ),
u, v1 , v2 ∈ V, a, b ∈ F .
In the case F = C and ϕ is complex conjugation, a ϕsesquilinear form is called a sesquilinear form. The space of all ϕsesquilinear forms on V is denoted B(V, V, F , ϕ). Let B = (w1 , w2 , . . . , wn ) be an ordered basis of V and let f ∈ B(V, V, F , ϕ). The matrix representing f relative to B is the matrix A = [ai j ] ∈ F n×n such that ai j = f (wi , wj ). The rank of f ∈ B(V, V, F , ϕ), rank( f ), is rank(A), where A is a matrix representing f relative to an arbitrary ordered basis of V . f ∈ B(V, V, F , ϕ) is nondegenerate if its rank is equal to dim V , and degenerate if it is not nondegenerate. Let A = [ai j ] ∈ F n×n . ϕ(A) is the n × n matrix whose i, j entry is ϕ(ai j ). Let A, B ∈ F n×n . B is ϕcongruent to A if there exists an invertible P ∈ F n×n such that B = P T Aϕ(P ). Let f, g ∈ B(V, V, F , ϕ). g is ϕequivalent to f if there exists an ordered basis B of V such that the matrix of g relative to B is ϕcongruent to the matrix of f relative to B. Let T be a linear operator on V and let f ∈ B(V, V, F , ϕ). T preserves f if f (T u, T v) = f (u, v) for all u, v ∈ V . Facts: Let f ∈ B(V, V, F , ϕ). The following facts can be obtained by obvious generalizations of the proofs of the corresponding facts in section 12.1; see that section for references. 1. A bilinear form is a ϕsesquilinear form with the automorphism being the identity map. 2. Let B = (w1 , w2 , . . . , wn ) be an ordered basis of V and let u=
n i =1
a i wi ,
v=
n i =1
bi wi .
127
Quadratic, Bilinear, and Sesquilinear Forms
Then, f (u, v) =
n n
ai ϕ(b j ) f (wi , wj ).
i =1 j =1
3. Let A denote the matrix representing the ϕsesquilinear f relative to B, and let [u]B and [v]B be the vectors in F n , which are the coordinate vectors of u and v, respectively, with respect to B. Then f (u, v) = [u]BT Aϕ([v]B ). 4. Let B and B be ordered bases of V , and P be the matrix whose columns are the Bcoordinates of vectors in B . Let f ∈ B(V, V, F , ϕ). Let A and B denote the matrices representing f relative to B and B . Then B = P T Aϕ(P ). 5. The concept of rank of f , as given, is well defined. 6. The set L = {v ∈ V : f (u, v) = 0 for all u ∈ V } is a subspace of V and rank( f ) = dim V − dim L . In particular, f is nondegenerate if and only if L = {0}. 7. Suppose that dim V = n. The space B(V, V, F , ϕ) is a vector space over F under the obvious addition of two ϕsesquilinear forms and multiplication of a ϕsesquilinear form by a scalar. Moreover, B(V, V, F , ϕ) is isomorphic to F n×n . 8. ϕCongruence is an equivalence relation on F n×n . 9. Let f ∈ B(V, V, F , ϕ) be nondegenerate. Then the set of all linear operators on V which preserve f is a group under the operation of composition. Examples:
√ √ √ √ 1. Let F = Q( 5) = {a + b 5 : a, b ∈ Q} and√ =a −b √ 5. Define the ϕsesquilinear ϕ(a + b 5)√ √ √ 2 T T form f on F by f (u, v) = u ϕ(v). f ([1 + 5, 3] , [−2 5, −1 + 5]T ) = (1 + 5)(2 5) + √ √ 3(−1 − 5) = 7 − 5. The matrix of f with respect to the standard basis is the identity matrix, rank f = 2, and f is nondegenerate. 2. Let A ∈ F n×n . The map f : F n × F n → F defined by f (u, v) = uT Aϕ(v) =
n n
ai j ui ϕ(v j ),
u, v ∈ F n ,
i =1 j =1
is a ϕsesquilinear form. Since f (ei , ej ) = ai j , i, j = 1, 2, . . . , n, f is represented in the standard basis of F n by A. It follows that rank( f ) = rank(A), and f is nondegenerate if and only if A is invertible.
12.5
Hermitian Forms
This section closely resembles the results related to symmetric bilinear forms on real vector spaces. We assume here that V is a finite dimensional complex vector space. Definitions: A Hermitian form on V is a map f : V × V → C, which satisfies f (au1 + bu2 , v) = a f (u1 , v) + b f (u2 , v),
u, v ∈ V,
and f (v, u) = f (u, v),
u, v ∈ V.
a, b ∈ C,
128
Handbook of Linear Algebra
A Hermitian form f on V is positive semidefinite (positive definite) if f (v, v) 0 for all v ∈ V ( f (v, v) > 0 for all 0 = v ∈ V ). f is negative semidefinite (negative definite) if − f is positive semidefinite (positive definite). The signature of a Hermitian matrix A is the integer π − ν, where (π, ν, δ) is the inertia of A. (See Section 8.3.) The signature of a Hermitian form is the signature of a matrix representing the form. Let A, B ∈ Cn×n . B is ∗ congruent to A if there exists an invertible S ∈ Cn×n such that B = S ∗ AS (where S ∗ denotes the Hermitian adjoint of S). Let f, g be Hermitian forms on a finite dimensional complex vector space V . g is ∗ equivalent to f if there exists an ordered basis B of V such that the matrix of g relative to B is ∗ congruent to the matrix of f relative to B. Facts: Except where another reference is provided, the following facts can be found in [Coh89, Chap. 8], [HJ85, Chap. 4], or [Lan99, Chap. 15]. Let f be a Hermitian form on V . 1. A Hermitian form is sesquilinear. 2. A positive definite Hermitian form is nondegenerate. 3. f is a linear functional in the first variable and conjugate linear in the second variable, that is, f (u, av1 + bv2 ) = a¯ f (u, v1 ) + b¯ f (u, v2 ). 4. f (v, v) ∈ R for all v ∈ V . 5. An inner product on a complex vector space is a positive definite Hermitian form. Conversely, a positive definite Hermitian form on a complex vector space is an inner product. 6. (Polarization formula) 4 f (u, v) = f (u + v, u + v) − f (u − v, u − v) + + i f (u + i v, u + i v) − i f (u − i v, u − i v). 7. Let B = (w1 , w2 , . . . , wn ) be an ordered basis of V and let u=
n
a i wi ,
v=
i =1
n
bi wi .
i =1
Then f (u, v) =
n n
ai b¯ j f (wi , wj ).
i =1 j =1
8. Let A denote the matrix representing f relative to the basis B. Then f (u, v) = [u]BT A[¯v]B . 9. The matrix representing a Hermitian form f relative to any basis of V is a Hermitian matrix. 10. Let A, B be matrices that represent f relative to bases B and B of V , respectively. Then B is ∗ congruent to A. 11. (Sylvester’s law of inertia for Hermitian forms, cf. 12.2) There exists an ordered basis B of V such that the matrix representing f relative to it has the form Iπ ⊕ −Iν ⊕ 0δ . Moreover, π, ν, and δ depend only on f and not on the choice of B. 12. (Sylvester’s law of inertia for Hermitian matrices, cf. 12.2) If A ∈ Cn×n is a Hermitian matrix, then A is ∗ congruent to the diagonal matrix D = Iπ ⊕ −Iν ⊕ 0δ , where (π, ν, δ) = in(A).
Quadratic, Bilinear, and Sesquilinear Forms
129
13. There are exactly two invariants of n × n Hermitian matrices under ∗ congruence, namely the rank and the signature. 14. Two Hermitian n × n matrices are ∗ congruent if and only if they have the same rank and the same signature. 15. The signature of a Hermitian form is welldefined. 16. Two Hermitian forms are ∗ equivalent if and only if they have the same rank and the same signature. 17. [HJ91, Theorem 1.3.5] Let A, B ∈ Cn×n be Hermitian matrices. Suppose that x ∈ Cn , x∗ Ax = x∗ Bx = 0 ⇒ x = 0. Then ∃ a, b ∈ R such that aA + bB is positive definite. This fact can be obtained from [HJ91], where it is stated in a slightly different form, using the decomposition of every square, complex matrix as a sum of a Hermitian matrix and a skewHermitian matrix. 18. The group of linear operators preserving the Hermitian form f (u, v) = in=1 ui v¯ i on Cn is the ndimensional unitary group. Examples: 1. Let A ∈ Cn×n be a Hermitian matrix. The map f : Cn × Cn → C defined by f (u, v) = n n n i =1 j =1 a i j u i v¯ j is a Hermitian form on C . 2. Let ψ1 , ψ2 , . . . , ψk be linear functionals on V , and let a1 , a2 , . . . , ak ∈ R. Then the map f : V × V → C defined by f (u, v) = ik=1 ai ψi (u)ψi (v) is a Hermitian form on V . 3. Let H ∈ Cn×n be a Hermitian matrix. The map f : Cn×n × Cn×n → C defined by f (A, B) = tr(AH B ∗ ) is a Hermitian form.
References [Coh89] P. M. Cohn. Algebra, 2nd ed., Vol. 1, John Wiley & Sons, New York, 1989. [Hes68] M. R. Hestenes. Pairs of quadratic forms. Lin. Alg. Appl., 1:397–407, 1968. [HJ85] R. A. Horn and C. R. Johnson. Matrix Analysis, Cambridge, University Press, Cambridge, 1985. [HJ91] R. A. Horn and C. R. Johnson. Topics in Matrix Analysis, Cambridge University Press, Cambridge, New York 1991. [HK71] K. H. Hoffman and R. Kunze. Linear Algebra, 2nd ed., PrenticeHall, Upper Saddle River, NJ, 1971. [Lan99] S. Lang. Algebra, 3rd ed., AddisonWesley Publishing, Reading, MA, 1999.
13 Multilinear Algebra Multilinear Maps. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tensor Products . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Rank of a Tensor: Decomposable Tensors . . . . . . . . . . . Tensor Product of Linear Maps . . . . . . . . . . . . . . . . . . . . . Symmetric and Antisymmetric Maps . . . . . . . . . . . . . . . Symmetric and Grassmann Tensors . . . . . . . . . . . . . . . . . The Tensor Multiplication, the Alt Multiplication, and the Sym Multiplication . . . . . . . . . . . . . . . . . . . . . . . . . 13.8 Associated Maps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13.9 Tensor Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13.10 Tensor Product of Inner Product Spaces. . . . . . . . . . . . . 13.11 Orientation and Hodge Star Operator . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13.1 13.2 13.3 13.4 13.5 13.6 13.7
Jos´e A. Dias da Silva Universidade de Lisboa
Armando Machado Universidade de Lisboa
13.1
131 133 137 138 1310 1312 1317 1319 1320 1322 1324 1326
Multilinear Maps
Unless otherwise stated, within this section V, U, and W as well as these letters with subscripts, superscripts, or accents, are finite dimensional vector spaces over a field F of characteristic zero. Definitions: A map ϕ from V1 × · · · × Vm into U is a multilinear map (mlinear map) if it is linear on each coordinate, i.e., for every vi , vi ∈ Vi , i = 1, . . . , m and for every a ∈ F the following conditions hold: (a) ϕ(v1 , . . . , vi + v i , . . . , vm ) = ϕ(v1 , . . . , vi , . . . , vm ) + ϕ(v1 , . . . , v i , . . . , vm ); (b) ϕ(v1 , . . . , avi , . . . , vm ) = aϕ(v1 , . . . , vi , . . . , vm ). The 2linear maps and 3linear maps are also called bilinear and trilinear maps, respectively. If U = F then a multilinear map into U is called a multilinear form. The set of multilinear maps from V1 × · · · × Vm into U , together with the operations defined as follows, is denoted L (V1 , . . . , Vm ; U ). For mlinear maps ϕ, ψ, and a ∈ F , (ψ + ϕ)(v 1 , . . . , v m ) = ψ(v 1 , . . . , v m ) + ϕ(v 1 , . . . , v m ), (aϕ)(v 1 , . . . , v m ) = aϕ(v 1 , . . . , v m ). Let (bi 1 , . . . , bi ni ) be an ordered basis of Vi , i = 1, . . . , m. The set of sequences ( j1 , . . . , jm ), 1 ≤ ji ≤ ni , i = 1, . . . , m, will be identified with the set (n1 , . . . , nm ) of maps α from {1, . . . , m} into N satisfying 1 ≤ α(i ) ≤ ni , i = 1, . . . , m. For α ∈ (n1 , . . . , nm ), the mtuple of basis vectors (b1α(1) , . . . , bm,α(m) ) is denoted by bα . 131
132
Handbook of Linear Algebra
Unless otherwise stated (n1 , . . . , nm ) is considered ordered by the lexicographic order. When there is no risk of confusion, is used instead of (n1 , . . . , nm ). Let p, q be positive integers. If ϕ is an ( p + q )linear map from W1 × · · · × Wp × V1 × · · · × Vq into U , then for each choice of wi in Wi , i = 1, . . . , p, the map (v1 , . . . , vq ) −→ ϕ(w1 , . . . , w p , v1 , . . . , vq ), from V1 × · · · × Vq into U , is denoted ϕw1 ,...,w p , i.e. ϕw1 ,...,w p (v1 , . . . , vq ) = ϕ(w1 , . . . , w p , v1 , . . . , vq ). Let η be a linear map from U into U and θi a linear map from Vi into Vi , i = 1, . . . , m. If (v1 , . . . , vm ) → ϕ(v1 , . . . , vm ) is a multilinear map from V1 × · · · × Vm into U , L (θ1 , . . . , θm ; η)(ϕ) denotes the map from from V1 × · · · × Vm into U , defined by (v 1 , . . . , v m ) → η(ϕ(θ1 (v 1 ), . . . , θm (v m ))). Facts: The following facts can be found in [Mar73, Chap. 1] and in [Mer97, Chap. 5]. 1. If ϕ is a multilinear map, then ϕ(v1 , . . . , 0, . . . , vm ) = 0. 2. The set L (V1 , . . . , Vm ; U ) is a vector space over F . 3. If ϕ is an m−linear map from V1 × · · · × Vm into U , then for every integer p, 1 ≤ p < m, and vi ∈ Vi , 1 ≤ i ≤ p, the map ϕv1 ,...,v p is an (m − p)linear map. 4. Under the same assumptions than in (3.) the map (v1 , . . . , v p ) → ϕv1 ,...,v p from V1 × · · · × Vp into L (Vp+1 , . . . , Vm ; U ), is plinear. A linear isomorphism from L (V1 , . . . , Vp , Vp+1 , . . . , Vm ; U ) into L (V1 , . . . , Vp ; L (Vp+1 , . . . , Vm ; U )) arises through this construction. 5. Let η be a linear map from U into U and θi a linear map from Vi into Vi , i = 1, . . . , m. The map L (θ1 , . . . , θm ; η) from L (V1 , . . . , Vm ; U ) into L (V1 , . . . , Vm ; U ) is a linear map. When m = 1, and U = U = F , then L (θ1 , I ) is the dual or adjoint linear map θ1∗ from V1∗ into V1∗ . 6. (n1 , . . . , nm ) = im=1 ni where   denotes cardinality. 7. Let (yα )α∈ be a family of vectors of U . Then, there exists a unique mlinear map ϕ from V1 × · · · × Vm into U satisfying ϕ(bα ) = yα , for every α ∈ . 8. If (u1 , . . . , un ) is a basis of U , then (ϕi,α : α ∈ , i = 1, . . . , m) is a basis of L (V1 , . . . , Vm ; U ), where ϕi,α is characterized by the conditions ϕi,α (bβ ) = δα,β ui . Moreover, if ϕ is an mlinear map from V1 × · · · × Vm into U such that for each α ∈ , ϕ(bα ) =
n
ai,α ui ,
i =1
then ϕ=
ai,α ϕi,α .
α,i
Examples:
The map from F m into F , (a1 , . . . , am ) → im=1 ai , is an mlinear map. Let V be a vector space over F . The map (a, v) → av from F × V into V is a bilinear map. The map from F m × F m into F , ((a1 , . . . , am ), (b1 , . . . , bm )) −→ ai bi , is bilinear. Let U, V , and W be vector spaces over F . The map (θ, η) → θ η from L (V, W) × L (U, V ) into L (U, W), given by composition, is bilinear. 5. The multiplication of matrices, (A, B) → AB, from F m×n × F n× p into F m× p , is bilinear. Observe that this example is the matrix counterpart of the previous one. 1. 2. 3. 4.
133
Multilinear Algebra
6. Let V and W be vector spaces over F . The evaluation map, from L (V, W) × V into W, (θ, v) −→ θ(v), is bilinear. 7. The map ((a11 , a21 , . . . , am1 ), . . . , (a1m , a2m , . . . , amm )) → det([ai j ]) from the Cartesian product of m copies of F m into F is mlinear.
13.2
Tensor Products
Definitions: Let V1 , . . . , Vm , P be vector spaces over F . Let ν : V1 × · · · × Vm −→ P be a multilinear map. The pair (ν, P ) is called a tensor product of V1 , . . . , Vm , or P is said to be a tensor product of V1 , . . . , Vm with tensor multiplication ν, if the following condition is satisfied: Universal factorization property If ϕ is a multilinear map from V1 × · · · × Vm into the vector space U , then there exists a unique linear map, h, from P into U , that makes the following diagram commutative:
n
V1 × … × Vm
P h
j U i.e., hν = ϕ.
If P is a tensor product of V1 , . . . , Vm , with tensor multiplication ν, then P is denoted by V1 ⊗ · · · ⊗ Vm and ν(v1 , . . . , vm ) is denoted by v1 ⊗ · · · ⊗ vm and is called the tensor product of the vectors v1 , . . . , vm . The elements of V1 ⊗ · · · ⊗ Vm are called tensors. The tensors that are the tensor product of m vectors are called decomposable tensors. When V1 = · · · = Vm = V , the vector space V1 ⊗ · · · ⊗ Vm is called the mth tensor power of V and is denoted by m V . It is convenient to define 0 V = F and assume that 1 is the unique decomposable 0 V . When we consider simultaneously different models of tensor product, sometimes we use tensor of or ⊗ to emphasize these different choices. alternative forms to denote the tensor multiplication like ⊗ , ⊗, Within this section, V1 , . . . , Vm are finite dimensional vector spaces over F and (bi 1 , . . . , bi ni ) denotes a basis of Vi , i = 1, . . . , m. When V is a vector space and x1 , . . . , xk ∈ V , Span({x1 , . . . , xk }) denotes the subspace of V spanned by these vectors. Facts: The following facts can be found in [Mar73, Chap. 1] and in [Mer97, Chap. 5]. 1. If V1 ⊗ · · · ⊗ Vm and V1 ⊗ · · · ⊗ Vm are two tensor products of V1 , . . . , Vm , then the unique linear map h from V1 ⊗ · · · ⊗ Vm into V1 ⊗ · · · ⊗ Vm satisfying h(v1 ⊗ · · · ⊗ vm ) = v1 ⊗ · · · ⊗ vm is an isomorphism.
134
Handbook of Linear Algebra
2. If (ν(bα ))α∈(n1 ,...,nm ) is a basis of P , then the pair (ν, P ) is a tensor product of V1 , . . . , Vm . This is often the most effective way to identify a model for the tensor product of vector spaces. It also implies the existence of a tensor product. 3. If P is the tensor product of V1 , . . . , Vm with tensor multiplication ν, and h : P −→ Q is a linear isomorphism, then (hν, Q) is a tensor product of V1 , . . . , Vm . 4. When m = 1, it makes sense to speak of a tensor product of one vector space V and V itself is used as a model for that tensor product with the identity as tensor multiplication, i.e., 1 V = V . 5. Bilinear version of the universal property — Given a multilinear map from V1 × · · · × Vk × U1 × · · · × Um into W, (v1 , . . . , vk , u1 , . . . , um ) → ϕ(v1 , . . . , vk , u1 , . . . , um ), there exists a unique bilinear map χ from (V1 ⊗ · · · ⊗ Vk ) × (U1 ⊗ · · · ⊗ Um ) into W satisfying χ (v1 ⊗ · · · ⊗ vk , u1 ⊗ · · · ⊗ um ) = ϕ(v1 , . . . , vk , u1 , . . . , um ), vi ∈ Vi u j ∈ U j , i = 1, . . . , k, j = 1, . . . , m. 6. Let a ∈ F and vi , v i ∈ Vi , i = 1, . . . , m. As the consequence of the multilinearity of ⊗, the following equalities hold: (a) v1 ⊗ · · · ⊗ (vi + v i ) ⊗ · · · ⊗ vm = v1 ⊗ · · · ⊗ vi ⊗ · · · ⊗ vm + v1 ⊗ · · · ⊗ v i ⊗ · · · ⊗ vm , (b) a(v1 ⊗ · · · ⊗ vm ) = (av1 ) ⊗ · · · ⊗ vm = · · · = v1 ⊗ · · · ⊗ (avm ), (c) v1 ⊗ · · · ⊗ 0 ⊗ · · · ⊗ vm = 0. 7. If one of the vector spaces Vi is zero, then V1 ⊗ · · · ⊗ Vm = {0}. 8. Write b⊗ α to mean b⊗ α := b1α(1) ⊗ · · · ⊗ bmα(m) . Then (b⊗ α )α∈ is a basis of V1 ⊗ · · · ⊗ Vm . This basis is said to be induced by the bases (bi1 , . . . , bi ni ), i = 1, . . . , m. 9. The decomposable tensors span the tensor product V1 ⊗ · · · ⊗ Vm . Furthermore, if the set C i spans Vi , i = 1, . . . , m, then the set {v1 ⊗ · · · ⊗ vm : vi ∈ C i , i = 1, . . . , m} spans V1 ⊗ · · · ⊗ Vm . 10. dim(V1 ⊗ · · · ⊗ Vm ) = im=1 dim(Vi ). 11. The tensor product is commutative, V1 ⊗ V2 = V2 ⊗ V1 , meaning that if V1 ⊗ V2 is a tensor product of V1 and V2 , then V1 ⊗ V2 is also a tensor product of V2 and V1 with tensor multiplication (v2 , v1 ) → v1 ⊗ v2 . In general, with a similar meaning, for any σ ∈ Sm , V1 ⊗ · · · ⊗ Vm = Vσ (1) ⊗ · · · ⊗ Vσ (m) . 12. The tensor product is associative, (V1 ⊗ V2 ) ⊗ V3 = V1 ⊗ (V2 ⊗ V3 ) = V1 ⊗ V2 ⊗ V3 , meaning that:
135
Multilinear Algebra
(a) A tensor product V1 ⊗ V2 ⊗ V3 is also a tensor product of V1 ⊗ V2 and V3 (respectively of V1 and V2 ⊗ V3 ) with tensor multiplication defined (uniquely by Fact 5 above) for vi ∈ Vi , i = 1, 2, 3, by (v1 ⊗ v2 ) ⊗ v3 = v1 ⊗ v2 ⊗ v3 (respectively by v1 ⊗ (v2 ⊗ v3 ) = v1 ⊗ v2 ⊗ v3 ). (b) And, V1 ⊗ V2 ) ⊗ V3 (respectively V1 ⊗ (V2 ⊗ V3 ) is a tensor product of V1 , V2 , V3 with tensor multiplication defined by v1 ⊗ v2 ⊗ v3 = (v1 ⊗ v2 ) ⊗ v3 , vi ∈ Vi , i = 1, 2, 3 (respectively v1 ⊗ v2 ⊗ v3 = v1 ⊗ (v2 ⊗ v3 ), vi ∈ Vi , i = 1, 2, 3). In general, with an analogous meaning, (V1 ⊗ · · · ⊗ Vk ) ⊗ (Vk+1 ⊗ · · · ⊗ Vm ) = V1 ⊗ · · · ⊗ Vm , for any k, 1 ≤ k < m. 13. Let Wi be a subspace of Vi , i = 1, . . . , m. Then W1 ⊗ · · · ⊗ Wm is a subspace of V1 ⊗ · · · ⊗ Vm , meaning that the subspace of V1 ⊗ · · · ⊗ Vm spanned by the set of decomposable tensors of the form w 1 ⊗ · · · ⊗ wm ,
wi ∈ Wi , i = 1, . . . , m
is a tensor product of W1 , . . . , Wm with tensor multiplication equal to the restriction of ⊗ to W1 × · · · × Wm . From now on, the model for the tensor product described above is assumed when dealing with the tensor product of subspaces of Vi . 14. Let W1 , W1 be subspaces of V1 and W2 and W2 be subspaces of V2 . Then (a) (W1 ⊗ W2 ) ∩ (W1 ⊗ W2 ) = (W1 ∩ W1 ) ⊗ (W2 ∩ W2 ). (b) W1 ⊗ (W2 + W2 ) = (W1 ⊗ W2 ) + (W1 ⊗ W2 ), (W1 + W1 ) ⊗ W2 = (W1 ⊗ W2 ) + (W1 ⊗ W2 ). (c) Assuming W1 ∩ W1 = {0}, (W1 ⊕ W1 ) ⊗ W2 = (W1 ⊗ W2 ) ⊕ (W1 ⊗ W2 ). Assuming W2 ∩ W2 = {0}, W1 ⊗ (W2 ⊕ W2 ) = (W1 ⊗ W2 ) ⊕ (W1 ⊗ W2 ). 15. In a more general setting, if Wi j , j = 1, . . . , pi are subspaces of Vi , i ∈ {1, . . . , m}, then ⎛ ⎝
p1
⎞
⎛
W1 j ⎠ ⊗ · · · ⊗ ⎝
j =1
pm
⎞
W1 j ⎠ =
j =1
W1γ (1) ⊗ · · · ⊗ Wmγ (m) .
γ ∈( p1 ··· pm )
If the sums of subspaces in the lefthand side are direct, then ⎛ ⎝
p1 j =1
⎞
⎛
W1 j ⎠ ⊗ · · · ⊗ ⎝
pm j =1
⎞
W1 j ⎠ =
γ ∈( p1 ,..., pm )
W1γ (1) ⊗ · · · ⊗ Wm,γ (m) .
136
Handbook of Linear Algebra
Examples: 1. The vector space F m×n of the m × n matrices over F is a tensor product of F m and F n with tensor multiplication (the usual tensor multiplication for F m×n ) defined, for (a1 , . . . , am ) ∈ F m and (b1 , . . . , bn ) ∈ F n , by ⎡
⎤
a1 ⎢ . ⎥ ⎢ (a1 , . . . , am ) ⊗ (b1 , . . . , bn ) = ⎣ .. ⎥ ⎦ b1 am
bn .
···
With this definition, ei ⊗ ej = E i j where ei , ej , and E i j are standard basis vectors of F m , F n , and F m×n . 2. The field F , viewed as a vector space over F , is an mth tensor power of F with tensor multiplication defined by a1 ⊗ · · · ⊗ am =
m
ai ,
ai ∈ F ,
i = 1, . . . , m.
i =1
3. The vector space V is a tensor product of F and V with tensor multiplication defined by a ⊗ v = av,
a ∈ F,
v ∈ V.
4. Let U and V be vector spaces over F . Then L (V ; U ) is a tensor product U ⊗ V ∗ with tensor multiplication (the usual tensor multiplication for L (V ; U )) defined by the equality (u ⊗ f )(v) = f (v)u, u ∈ U, v ∈ V. 5. Let V1 , . . . , Vm be vector spaces over F . The vector space L (V1 , . . . , Vm ; U ) is a tensor product L (V1 , . . . , Vm ; F ) ⊗ U with tensor multiplication (ϕ ⊗ u)(v1 , . . . , vm ) = ϕ(v1 , . . . , vm )u. 6. Denote by F n1 ×···×nm the set of all families with elements indexed in {1, . . . , n1 }×· · ·×{1, . . . , nm } = (n1 , . . . , nm ). The set F n1 ×···×nm equipped with the sum and scalar product defined, for every ( j1 , . . . , jm ) ∈ (n1 , . . . , nm ), by the equalities (a j1 ,..., jm ) + (b j1 ,..., jm ) = (a j1 ,..., jm + b j1 ,..., jm ), α(a j1 ,..., jm ) = (αa j1 ,..., jm ),
α ∈ F,
is a vector space over F . This vector space is a tensor product of F n1 , . . . , F nm with tensor multiplication defined by
(a11 , . . . , a1n1 ) ⊗ · · · ⊗ (am1 , . . . , amnm ) =
m
.
a i ji
i =1
( j1 ,..., jm )∈
7. The vector space L (V1 , . . . , Vm ; F ) is a tensor product of V1∗ = L (V1 ; F ), . . . , Vm∗ = L (Vm ; F ) with tensor multiplication defined by g 1 ⊗ · · · ⊗ g m (v1 , . . . , vm ) =
m
g t (vt ).
t=1
Very often, for example in the context of geometry, the factors of the tensor product are vector space duals. In those situations, this is the model of tensor product implicitly assumed. 8. The vector space L (V1 , . . . , Vm ; F )∗
137
Multilinear Algebra
is a tensor product of V1 , . . . , Vm with tensor multiplication defined by v1 ⊗ · · · ⊗ vm (ψ) = ψ(v1 , . . . , vm ). 9. The vector space L (V1 , . . . , Vm ; F ) is a tensor product L (V1 , . . . , Vk ; F ) ⊗ L (Vk+1 , . . . , Vm ; F ) with tensor multiplication defined, for every vi ∈ Vi , i = 1, . . . , m, by the equalities (ϕ ⊗ ψ)(v1 , . . . , vm ) = ϕ(v1 , . . . , vk )ψ(vk+1 , . . . , vm ).
13.3
Rank of a Tensor: Decomposable Tensors
Definitions: Let z ∈ V1 ⊗ · · · ⊗ Vm . The tensor z has rank k if z is the sum of k decomposable tensors but it cannot be written as sum of l decomposable tensors, for any l less than k. Facts: The following facts can be found in [Bou89, Chap. II, §7.8]and [Mar73, Chap. 1]. 1. The tensor z = v1 ⊗ w1 + · · · + vt ⊗ wt ∈ V ⊗ W has rank t if and only if (v1 , . . . , vt ) and (w1 , . . . , wt ) are linearly independent. 2. If the model for the tensor product of F m and F n is the vector space of m × n matrices over F with the usual tensor multiplication, then the rank of a tensor is equal to the rank of the corresponding matrix. 3. If the model for the tensor product U ⊗ V ∗ is the vector space L (V ; U ) with the usual tensor multiplication, then the rank of a tensor is equal to the rank of the corresponding linear map. 4. x1 ⊗ · · · ⊗ xm = 0 if and only if xi = 0 for some i ∈ {1, . . . , m}. 5. If xi , yi are nonzero vectors of Vi , i = 1, . . . , m, then Span({x1 ⊗ · · · ⊗ xm }) = Span({y1 ⊗ · · · ⊗ ym }) if and only if Span({xi }) = Span({yi }), i = 1, . . . , m. Examples: 1. Consider as a model of F m ⊗ F n , the vector space of the m × n matrices over F with the usual tensor multiplication. Let A be a tensor of F m ⊗ F n . If rank A = k (using the matrix definition of rank), then
I A=M k 0
0 N, 0
where M = [x1 · · · xm ] is an invertible matrix with columns x1 , . . . , xm and ⎡ ⎤
y1
⎢y ⎥ ⎢ 2⎥ ⎥ N=⎢ ⎢ .. ⎥ ⎣.⎦
yn is an invertible matrix with rows y1 , . . . , yn . (See Chapter 2.) Then A = x1 ⊗ y1 + · · · + xk ⊗ yk has rank k as a tensor .
138
13.4
Handbook of Linear Algebra
Tensor Product of Linear Maps
Definitions: Let θi be a linear map from Vi into Ui , i = 1, . . . , m. The unique linear map h from V1 ⊗ · · · ⊗ Vm into U1 ⊗ · · · ⊗ Um satisfying, for all vi ∈ Vi , i = 1, . . . , m, h(v1 ⊗ · · · ⊗ vm ) = θ1 (v1 ) ⊗ · · · ⊗ θm (vm ) is called the tensor product of θ1 , . . . , θm and is denoted by θ1 ⊗ · · · ⊗ θm . matrix over F , t = 1, . . . , m. The Kronecker product of A1 , . . . , Am , Let At = (ai(t) j ) be an r t × s t m denoted A1 ⊗ · · · ⊗ Am , is the ( m t=1 r t ) × ( t=1 s t ) matrix whose (α, β)entry (α ∈ (r 1 , . . . , r m ) and m (t) β ∈ (s 1 , . . . , s m )) is t=1 aα(t)β(t) . (See also Section 10.4.) Facts: The following facts can be found in [Mar73, Chap. 2] and in [Mer97, Chap. 5]. Let θi be a linear map from Vi into Ui , i = 1, . . . , m. 1. If ηi is a linear map from Wi into Vi , i = 1, . . . , m, (θ1 ⊗ · · · ⊗ θm )(η1 ⊗ · · · ⊗ ηm ) = (θ1 η1 ) ⊗ · · · ⊗ (θm ηm ). 2. I V1 ⊗···⊗Vm = I V1 ⊗ · · · ⊗ I Vm . 3. Ker(θ1 ⊗ · · · ⊗ θm ) = Ker(θ1 ) ⊗ V2 ⊗ · · · ⊗ Vm + V1 ⊗ Ker(θ2 ) ⊗ · · · ⊗ Vm + · · · + V1 ⊗ · · · ⊗ Vm−1 ⊗ Ker(θm ). In particular, θ1 ⊗ · · · ⊗ θm is one to one if θi is one to one, i = 1, . . . , m, [Bou89, Chap. II, §3.5]. 4. θ1 ⊗ · · · ⊗ θm (V1 ⊗ · · · ⊗ Vm ) = θ1 (V1 ) ⊗ · · · ⊗ θm (Vm ). In particular θ1 ⊗ · · · ⊗ θm is onto if θi is onto, i = 1, . . . , m. In the next three facts, assume that θi is a linear operator on the ni dimensional vector space Vi , i = 1, . . . , m. 5. tr(θ1 ⊗ · · · ⊗ θm ) = im=1 tr(θi ). 6. If σ (θi ) = {ai 1 , . . . , ai ni }, i = 1, . . . , m, then
σ (θ1 ⊗ · · · ⊗ θm ) =
m
.
ai,α(i )
i =1
α∈(n1 ,...,nm )
7. det(θ1 ⊗ θ2 ⊗ · · · ⊗ θm ) = det(θ1 )n2 ···nm det(θ2 )n1 ·n3 ···nm · · · det(θm )n1 ·n2 ···nm−1 . 8. The map ν : (θ1 , . . . , θm ) → θ1 ⊗ · · · ⊗ θm is a multilinear map from L (V1 ; U1 ) × · · · × L (Vm ; Um ) into L (V1 ⊗ · · · ⊗ Vm ; U1 ⊗ · · · ⊗ Um ). 9. The vector space L (V1 ⊗ · · · ⊗ Vm ; U1 ⊗ · · · ⊗ Um )) is a tensor product of the vector spaces L (V1 ; U1 ), . . . , L (Vm ; Um ), with tensor multiplication (θ1 , . . . , θm ) → θ1 ⊗ · · · ⊗ θm : L (V1 ; U1 ) ⊗ · · · ⊗ L (Vm ; Um ) = L (V1 ⊗ · · · ⊗ Vm ; U1 ⊗ · · · ⊗ Um ). 10. As a consequence of (9.), choosing F as the model for multiplication,
m
F with the product in F as tensor
V1∗ ⊗ · · · ⊗ Vm∗ = (V1 ⊗ · · · ⊗ Vm )∗ .
139
Multilinear Algebra
11. Let (vi j ) j =1,...,ni be an ordered basis of Vi and (ui j ) j =1,...,qi an ordered basis of Ui , i = 1, . . . , m. Let Ai be the matrix of θi on the bases fixed in Vi and Ui . Then the matrix of θ1 ⊗ · · · ⊗ θm on ⊗ the bases (v⊗ α )α∈(n1 ,...,nm ) and (uα )α∈(q 1 ,...,qr ) (induced by the bases (vi j ) j =1,...,ni and (ui j ) j =1,...,q i , respectively) is the Kronecker product of A1 , . . . , Am , A1 ⊗ · · · ⊗ Am . 12. Let n1 , . . . , nm , r 1 , . . . , r m , t1 , . . . , tm be positive integers. Let Ai be an ni × r i matrix, and Bi be an r i × ti matrix, i = 1, . . . , m. Then the following holds: (a) (A1 ⊗ · · · ⊗ Am )(B1 ⊗ · · · ⊗ Bm ) = A1 B1 ⊗ · · · ⊗ Am Bm , (b) (A1 ⊗ · · · ⊗ Ak ) ⊗ (Ak+1 ⊗ · · · ⊗ Am ) = A1 ⊗ · · · ⊗ Am . Examples: 1. Consider as a model of U ⊗ V ∗ , the vector space L (V ; U ) with tensor multiplication defined by (u ⊗ f )(v) = f (v)u. Use a similar model for the tensor product of U and V ∗ . Let η ∈ L (U ; U ) and θ ∈ L (V ; V ). Then, for all ξ ∈ U ⊗ V ∗ = L (V ; U ), η ⊗ θ ∗ (ξ ) = ηξ θ. 2. Consider as a model of F m ⊗ F n , the vector space of the m × n matrices over F with the usual tensor multiplication. Use a similar model for the tensor product of F r and F s . Identify the set of column matrices, F m×1 , with F m and the set of row matrices, F 1×n , with F n . Let A be an r × m matrix over F . Let θ A be the linear map from F m into F r defined by ⎡
⎤
a1 ⎢a ⎥ ⎢ 2⎥ ⎥ θ A (a1 , . . . , am ) = A ⎢ ⎢ .. ⎥ . ⎣ . ⎦ am Let B be an s × n matrix. Then, for all C ∈ F m×n = F m ⊗ F n , θ A ⊗ θ B (C ) = AC B T . 3. For every i = 1, . . . , m consider the ordered basis (bi 1 , . . . , bi ni ) fixed in Vi , and the basis (bi 1 , . . . , bi s i ) fixed in Ui . Let θi be a linear map from Vi into Ui and let Ai = (a (ij k) ) be the s i × ni matrix of θi with respect to the bases (bi 1 , . . . , bi ni ), (bi 1 , . . . , bi s i ). For every z ∈ V1 ⊗ · · · ⊗ Vm ,
z=
n2 n1
···
j1 =1 j2 =1
=
nm
c j1 ,..., jm b1 j1 ⊗ · · · ⊗ bm, jm
jm =1
α∈(n1 ,...,nm )
c α b⊗ α.
Then, for β = (i 1 , . . . , i m ) ∈ (s 1 , . . . , s m ), the component c i1 ,...,i m of θ1 ⊗ · · · ⊗ θm (z) on the basis element b1i 1 ⊗ · · · ⊗ bmi m of U1 ⊗ · · · ⊗ Um is
c β = c i1 ,...,i m = =
n1
···
j1 =1
nm jm =1
γ ∈(n1 ,...,nm )
ai(1) · · · ai(m) c 1 , j1 m , jm j1 ,..., jm
m i =1
(i ) aβ(i )γ (i )
cγ .
1310
Handbook of Linear Algebra
4. If A = [ai j ] is an p × q matrix over F and B is an r × s matrix over F , then the Kronecker product of A and B is the matrix whose partition in r × s blocks is ⎡
a11 B ⎢a B ⎢ 21 A⊗ B =⎢ ⎢ .. ⎣ . a p1 B
13.5
··· ··· .. . ···
a12 B a22 B .. . a p2 B
⎤
a1q B a2q B ⎥ ⎥ .. ⎥ ⎥. . ⎦ a pq B
Symmetric and Antisymmetric Maps
Recall that we are assuming F to be of characteristic zero and that all vector spaces are finite dimensional over F . In particular, V and U denote finite dimensional vector spaces over F . Definitions: Let m be a positive integer. When V1 = V2 = · · · = Vm = V L m (V ; U ) denotes the vector space of the multilinear maps L (V1 , . . . , Vm ; U ). By convention L 0 (V ; U ) = U . An mlinear map ψ ∈ L m (V ; U ) is called antisymmetric or alternating if it satisfies ψ(vσ (1) , . . . , vσ (m) ) = sgn(σ )ψ(v1 , . . . , vm ),
σ ∈ Sm ,
where sgn(σ ) denotes the sign of the permutation σ . Similarly, an mlinear map ϕ ∈ L m (V ; U ) satisfying ϕ(vσ (1) , . . . , vσ (m) ) = ϕ(v1 , . . . , vm ) for all permutations σ ∈ Sm and for all v1 , . . . , vm in V is called symmetric. Let S m (V ; U ) and Am (V ; U ) denote the subsets of L m (V ; U ) whose elements are respectively the symmetric and the antisymmetric mlinear maps. The elements of Am (V ; F ) are called antisymmetric forms. The elements of S m (V ; F ) are called symmetric forms. Let m,n be the set of all maps from {1, . . . , m} into {1, . . . , n}, i.e, m,n = (n, . . . , n) .
m times The subset of m,n of the strictly increasing maps α (α(1) < · · · < α(m)) is denoted by Q m,n . The subset of the increasing maps α ∈ m,n (α(1) ≤ · · · ≤ α(m)) is denoted by G m,n . Let A = [ai j ] be an m × n matrix over F . Let α ∈ p,m and β ∈ q ,n . Then A[αβ] be the p × q matrix over F whose (i, j )entry is aα(i ),β( j ) , i.e., A[αβ] = [aα(i ),β( j ) ]. The mthtuple (1, 2, . . . , m) is denoted by ιm . If there is no risk of confusion ι is used instead of ιm .
1311
Multilinear Algebra
Facts: 1. If m > n, we have Q m,n = ∅. The cardinality of m,n is nm , the cardinality of Q m,n is cardinality of G m,n is m+n−1 . m 2. Am (V ; U ) and S m (V ; U ) are vector subspaces of L m (V ; U ). 3. Let ψ ∈ L m (V ; U ). The following conditions are equivalent:
n m
, and the
(a) ψ is an antisymmetric multilinear map. (b) For 1 ≤ i < j ≤ m and for all v1 , . . . , vm ∈ V , ψ(v1 , . . . , vi −1 , v j , vi +1 , . . . , v j −1 , vi , v j +1 , . . . , vm ) = −ψ(v1 , . . . , vi −1 , vi , vi +1 , . . . , v j −1 , v j , v j +1 , . . . , vm ). (c) For 1 ≤ i < m and for all v1 , . . . , vm ∈ V , ψ(v1 , . . . , vi +1 , vi , . . . , vm ) = −ψ(v1 , . . . , vi , vi +1 , . . . , vm ). 4. Let ψ ∈ L m (V ; U ). The following conditions are equivalent: (a) ψ is a symmetric multilinear map. (b) For 1 ≤ i < j ≤ m and for all v1 , . . . , vm ∈ V , ψ(v1 , . . . , vi −1 , v j , vi +1 , . . . , v j −1 , vi , v j +1 , . . . , vm ) = ψ(v1 , . . . , vi −1 , vi , vi +1 , . . . , v j −1 , v j , v j +1 , . . . , vm ). (c) For 1 ≤ i < m and for all v1 , . . . , vm ∈ V , ψ(v1 , . . . , vi +1 , vi , . . . , vm ) = ψ(v1 , . . . , vi , vi +1 , . . . , vm ). 5. When we consider L m (V ; U ) as the tensor product, L m (V ; F ) ⊗ U , with the tensor multiplication described in Example 5 in Section 13.2, we have Am (V ; U ) = Am (V ; F ) ⊗ U
and
S m (V ; U ) = S m (V ; F ) ⊗ U.
6. Polarization identity [Dol04] If ϕ is a symmetric multilinear map, then for every mtuple (v1 , . . . , vm ) of vectors of V , and for any vector w ∈ V , the following identity holds: ϕ(v1 , . . . , vm ) = =
1 2m m!
ε1 · · · εm ϕ(w + ε1 v1 + · · · + εm vm , . . . , w + ε1 v1 + · · · + εm vm ),
ε1 ···εm
where εi ∈ {−1, +1}, i = 1, . . . , m. Examples: 1. The map ((a11 , a21 , . . . , am1 ), . . . , (a1m , a2m , . . . , amm )) → det([ai j ]) from the Cartesian product of m copies of F m into F is mlinear and antisymmetric.
1312
Handbook of Linear Algebra
2. The map ((a11 , a21 , . . . , am1 ), . . . , (a1m , a2m , . . . , amm )) → per([ai j ]) from the Cartesian product of m copies of F m into F is mlinear and symmetric. 3. The map ((a1 , . . . , an ), (b1 , . . . , bn )) → (ai b j − bi a j ) from F n × F n into F n×n is bilinear antisymmetric. 4. The map ((a1 , . . . , an ), (b1 , . . . , bn )) → (ai b j +bi a j ) from F n ×F n into F n×n is bilinear symmetric. 5. The map χ from V m into Am (V ; F )∗ defined by χ (v1 , . . . , vm )(ψ) = ψ(v1 , . . . , vm ),
v1 , . . . , vm ∈ V,
is an antisymmetric multilinear map. 6. The map χ from V m into S m (V ; F )∗ defined by χ (v1 , . . . , vm )(ψ) = ψ(v1 , . . . , vm ),
v1 , . . . , vm ∈ V,
is a symmetric multilinear map.
13.6
Symmetric and Grassmann Tensors
Definitions: Let σ ∈ Sm be a permutation of {1, . . . , m}. The unique linear map, from ⊗m V into ⊗m V satisfying v1 ⊗ · · · ⊗ vm → vσ −1 (1) ⊗ · · · ⊗ vσ −1 (m) ,
v1 , . . . , vm ∈ V,
is denoted P (σ ). Let ψ be a multilinear form of L m (V ; F ) and σ an element of Sm . The multilinear form (v1 , . . . , vm ) → ψ(vσ (1) , . . . , vσ (m) ) is denoted ψσ . The linear operator Alt from ⊗m V into ⊗m V defined by Alt :=
1 sgn(σ )P (σ ) m! σ ∈S m
is called the alternator. In order to emphasize the degree of the domain of Alt , Alt m is often used for the operator having m V , as domain. Similarly, the linear operator Sym is defined as the following linear combination of the maps P (σ ): Sym =
1 P (σ ). m! σ ∈S m
As before, Sym m is often written to mean the Sym operator having !m
!m
m
m
V , as domain.
The range of Alt is denoted by V , i.e., V = Alt ( V ), and is called the Grassmann space of degree m associated with V or the mthexterior power of V . " " The range of Sym is denoted by m V , i.e., m V = Sym ( m V ), and is called the symmetric space of degree m associated with V or the mth symmetric power of V . By convention #0
V=
$0
V=
%0
V = F.
1313
Multilinear Algebra !
Assume m ≥ 1. The elements of m V that are the image under Alt of decomposable tensors of m V ! are called decomposable elements of m V . If x1 , . . . , xm ∈ V , x1 ∧ · · · ∧ xm denotes the decomposable !m V, element of x1 ∧ · · · ∧ xm = m!Alt (x1 ⊗ · · · ⊗ xm ), "
and x1 ∧ · · · ∧ xm is called the exterior product of x1 , . . . , xm . Similarly, the elements of m V that are " the image under Sym of decomposable tensors of m V are called decomposable elements of m V . If "m V, x1 , . . . , xm ∈ V , x1 ∨ · · · ∨ xm denotes the decomposable element of x1 ∨ · · · ∨ xm = m!Sym (x1 ⊗ · · · ⊗ xm ), and x1 ∨ · · · ∨ xm is called the symmetric product of x1 , . . . , xm . ∧ ∨ Let (b1 , . . . , bn ) be a basis of V . If α ∈ m,n , b⊗ α , bα , and bα denote respectively the tensors b⊗ α = bα(1) ⊗ · · · ⊗ bα(m) , b∧α = bα(1) ∧ · · · ∧ bα(m) ,
b∨α = bα(1) ∨ · · · ∨ bα(m) . Let n and m be positive integers. An ncomposition of m is a sequence µ = (µ1 , . . . , µn ) of nonnegative integers that sum to m. Let Cm,n be the set of ncompositions of m. Let λ = (λ1 , . . . , λn ) be an ncomposition of m. The integer λ1 ! · · · λn ! will be denoted by λ!. Let α ∈ m,n . The multiplicity composition of α is the ntuple of the cardinalities of the fibers of α, (α −1 (1), . . . , α −1 (n)), and is denoted by λα . Facts: The following facts can be found in [Mar73, Chap. 2], [Mer97, Chap. 5], and [Spi79, Chap. 7]. !
"
1. m V and m V are vector subspaces of m V . 2. The map σ → P (σ ) from the symmetric group of degree m into L (⊗m V ; ⊗m V ) is an F representation of Sm , i.e., P (σ τ ) = P (σ )P (τ ) for any σ, τ ∈ Sm and P (I ) = I⊗m V 3. Choosing L m (V ; F ), with the usual tensor multiplication, as the model for the tensor power, m ∗ V , the linear operator P (σ ) acts on L m (V ; F ) by the following transformation (P (σ )ψ) = ψσ . 4. The linear operators Alt and Sym are projections, i.e., Alt 2 = Alt and Sym 2 = Sym . 5. If m = 1, we have Sym = Alt = I1 V = I V . !
6. m V = {z ∈ m V : P (σ )(z) = sgn(σ )z, ∀σ ∈ Sm }. " 7. m V = {z ∈ m V : P (σ )(z) = z, ∀σ ∈ Sm }. 8. Choosing L m (V ; F ) as the model for the tensor power m V ∗ with the usual tensor multiplication, $m
V ∗ = Am (V ; F )
and
%m
V ∗ = S m (V ; F ).
1314
Handbook of Linear Algebra
9. #1
10.
2
V=
!2
V⊕
"2
V=
$1 2
V . Moreover for z ∈
V=
%1
V = V.
V,
z = Alt (z) + Sym (z).
11. 12. 13. 14. 15.
The corresponding equality is no more true in m V if m = 2. V = {0} if m > dim(V ). ! ! If m ≥ 1, any element of m V is a sum of decomposable elements of m V . "m " V is a sum of decomposable elements of m V . If m ≥ 1, any element of m V. Alt (P (σ )z) = sgn(σ )Alt (z) and Sym (P (σ )(z)) = Sym (z), z ∈ ! The map ∧ from V m into m V defined for v1 , . . . , vm ∈ V by !m
∧(v1 , . . . , vm ) = v1 ∧ · · · ∧ vm is an antisymmetric mlinear map. " 16. The map ∨ from V m into m V defined for v1 , . . . , vm ∈ V by ∨(v1 , . . . , vm ) = v1 ∨ · · · ∨ vm is a symmetric mlinear map. ! 17. (Universal property for m V ) Given an antisymmetric mlinear map ψ from V m into U , there ! exists a unique linear map h from m V into U such that ψ(v1 , . . . , vm ) = h(v1 ∧ · · · ∧ vm ),
v1 , . . . , vm ∈ V,
i.e., there exists a unique linear map h that makes the following diagram commutative:
∧
Vm
mV h
y U
" 18. (Universal property for m V ) Given a symmetric mlinear map ϕ from V m into U , there exists a "m
unique linear map h from
V into U such that
ϕ(v1 , . . . , vm ) = h(v1 ∨ · · · ∨ vm ),
v1 , . . . , vm ∈ V,
i.e., there exists a unique linear map h that makes the following diagram commutative:
∨
Vm
mV h
j U Let p and q be positive integers.
1315
Multilinear Algebra
19. (Universal property for m V bilinear version) If ψ is a ( p + q )linear map from V p+q into U , then there exists a unique bilinear map χ from p V × q V into U satisfying (recall Fact 5 in Section 13.2) χ (v1 ⊗ · · · ⊗ v p , v p+1 ⊗ · · · ⊗ v p+q ) = ψ(v1 , . . . , v p+q ). !
20. (Universal property for m V bilinear version) If ψ is a ( p + q )linear map from V p+q into U antisymmetric in the first p variables and antisymmetric in the last q variables, then there exists a ! ! unique bilinear map χ from p V × q V into U satisfying χ (v1 ∧ · · · ∧ v p , v p+1 ∧ · · · ∧ v p+q ) = ψ(v1 , . . . , v p+q ). "
21. (Universal property for m V bilinear version) If ϕ is a ( p + q )linear map from V p+q into U symmetric in the first p variables and symmetric in the last q variables, then there exists a unique " " bilinear map χ from p V × q V into U satisfying χ (v1 ∨ · · · ∨ v p , v p+1 ∨ · · · ∨ v p+q ) = ϕ(v1 , . . . , v p+q ). !
m m ∧ 22. If (b1 , . . . , bn ) is a basis of V , then (b⊗ V , and α )α∈m,n is a basis of ⊗ V , (bα )α∈Q m,n is a basis of "m ∨ V . These bases are said to be induced by the basis (b1 , . . . , bn ). (bα )α∈G m,n is a basis of 23. Assume L m (V ; F ) as the model for the tensor power of m V ∗ , with the usual tensor multiplication. Let ( f 1 , . . . , f n ) be the dual basis of the basis (b1 , . . . , bn ). Then:
(a) For every ϕ ∈ L m (V ; F ), ϕ=
α∈m,n
ϕ(bα ) f α⊗ .
(b) For every ϕ ∈ Am (V, F ), ϕ=
α∈Q m,n
ϕ(bα ) f α∧ .
(c) For every ϕ ∈ S m (V, F ), ϕ=
α∈G m,n
24. dim m V = nm , dim 25. The family
!m
V=
n m
, and dim
"m
1 ϕ(bα ) f α∨ . λα ! V=
n+m−1 m
.
((µ1 b1 + · · · + µn bn ) ∨ · · · ∨ (µ1 b1 + · · · + µn bn ))µ∈Cm,n "
is a basis of m V [Mar73, Chap. 3]. 26. Let x1 , . . . , xm be vectors of V and g 1 , . . . , g m forms of V ∗ . Let ai j = g i (x j ), i, j = 1, . . . , m. Then, choosing ( m V )∗ as the model for m V ∗ with tensor multiplication as described in Fact 10 in Section 13.4, g 1 ⊗ · · · ⊗ g m (x1 ∧ · · · ∧ xm ) = det[ai j ]. 27. Under the same conditions of the former fact, g 1 ⊗ · · · ⊗ g m (x1 ∨ · · · ∨ xm ) = per[ai j ].
1316
Handbook of Linear Algebra
28. Let ( f 1 , . . . , f n ) be the dual basis of the basis (b1 , . . . , bn ). Then, choosing ( for m V ∗ :
m
V )∗ as the model
(a)
f α⊗
α∈m,n
m is the dual basis of the basis (b⊗ α )α∈m,n of ⊗ V .
(b) &
f α⊗
is the dual basis of the basis (b∧α )α∈Q m,n of
!m

!m
' V
α∈Q m,n
V.
(c) (
1 ⊗ f λα ! α
is the dual basis of the basis (b∨α )α∈G m,n of
"m
) 
"m
V
α∈G m,n
V.
Let v1 , . . . , vm be vectors of V and (b1 , . . . , bn ) be a basis of V . 29. Let A = [ai j ] be the n × m matrix over F such that v j =
n
i =1
ai j bi , j = 1, . . . , m. Then:
(a)
v1 ⊗ · · · ⊗ vm =
α∈m,n
m
aα(t),t
b⊗ α;
t=1
(b) v1 ∧ · · · ∧ v m =
α∈Q m,n
det A[αι]b∧α ;
(c) v1 ∨ · · · ∨ vm =
α∈G m,n
1 perA[αι]b∨α . λα !
30. v1 ∧ · · · ∧ vm = 0 if and only if (v1 , . . . , vm ) is linearly dependent. 31. v1 ∨ · · · ∨ vm = 0 if and only if one of the vi s is equal to 0. 32. Let u1 , . . . , um be vectors of V . (a) If (v1 , . . . , vm ) and (u1 , . . . , um ) are linearly independent families, then Span({u1 ∧ · · · ∧ um }) = Span({v1 ∧ · · · ∧ vm }) if and only if Span({u1 , . . . , um }) = Span({v1 , . . . , vm }). (b) If (v1 , . . . , vm ) and (u1 , . . . , um ) are families of nonzero vectors of V , then Span({v1 ∨ · · · ∨ vm }) = Span({u1 ∨ · · · ∨ um })
1317
Multilinear Algebra
if and only if there exists a permutation σ of Sm satisfying Span({vi }) = Span({uσ (i ) }),
i = 1, . . . , m.
Examples: 1. If m = 1, we have Sym = Alt = I1 V = I V .
2. Consider as a model of 2 F n , the vector space of the n × n matrices with the usual tensor multi! " plication. Then 2 F n is the subspace of the n × n antisymmetric matrices over F and 2 F n is the subspace of the n × n symmetric matrices over F . Moreover, for (a1 , . . . , an ), (b1 , . . . , bn ) ∈ F n : (a) (a1 , . . . , an ) ∧ (b1 , . . . , bn ) = [ai b j − bi a j ]i, j =1,...,n . (b) (a1 , . . . , an ) ∨ (b1 , . . . , bn ) = [ai b j + bi a j ]i, j =1,...,n . With these definitions, ei ∧ e j = E i j − E j i and ei ∨ e j = E i j + E j i , where ei , e j , and E i j are standard basis vectors of F m , F n , and F m×n . 3. For x ∈ V , x ∨ · · · ∨ x = m!x ⊗ · · · ⊗ x.
13.7
The Tensor Multiplication, the Alt Multiplication, and the Sym Multiplication
Next we will introduce “external multiplications” for tensor powers, Grassmann spaces, and symmetric spaces, Let p, q be positive integers. Definitions: The ( p, q )tensor multiplication is the unique bilinear map, (z, z ) → z ⊗ z from ( into p+q V , satisfying
p
V) × (
q
V)
(v1 ⊗ · · · ⊗ v p ) ⊗ (v p+1 ⊗ · · · ⊗ v p+q ) = v1 ⊗ · · · ⊗ v p+q . The ( p, q )alt multiplication (briefly alt multiplication ) is the unique bilinear map (recall Fact 20 in ! ! ! section 13.6), (z, z ) → z ∧ z from ( p V ) × ( q V ) into p+q V , satisfying (v1 ∧ · · · ∧ v p ) ∧ (v p+1 ∧ · · · ∧ v p+q ) = v1 ∧ · · · ∧ v p+q . The ( p, q )sym multiplication (briefly sym multiplication ) is the unique bilinear map (recall Fact 21 " " " in section 13.6), (z, z ) → z ∨ z from ( p V ) × ( q V ) into p+q V , satisfying (v1 ∨ · · · ∨ v p ) ∨ (v p+1 ∨ · · · ∨ v p+q ) = v1 ∨ · · · ∨ v p+q . These definitions can be extended to include the cases where either p or q is zero, taking as multiplication the scalar product. Let m, n be positive integers satisfying 1 ≤ m < n. Let α ∈ Q m,n . We denote by α c the element of the permutation of Sn : Q n−m,n whose range is the complement in {1, . . . , n} of the range of α and by α = α
1 ··· α(1) · · ·
m α(m)
m + 1 ··· α c (1) · · ·
n . α c (n)
1318
Handbook of Linear Algebra
Facts: The following facts can be found in [Mar73, Chap. 2], [Mer97, Chap. 5], and in [Spi79, Chap. 7]. 1. The value of the alt multiplication for arbitrary elements z ∈
"p
V and z ∈
"q
V and z ∈
!q
V is given by
( p + q )! Alt p+q (z ⊗ z ). p!q !
z ∧ z = 2. The product of z ∈
!p
V by the sym multiplication is given by
z ∨ z =
( p + q )! Sym p+q (z ⊗ z ). p!q !
3. The altmultiplication z ∧ z and the symmultiplication z ∨ z are not, in general, decomposable elements of any Grassmann or symmetric space of degree 2. ! 4. Let 0 = z ∈ m V . Then z is decomposable if and only if there exists a linearly independent family of vectors v1 , . . . , vm satisfying z ∧ vi = 0, i = 1, . . . , m. ! 5. If dim(V ) = n, all elements of n−1 V are decomposable. 6. The multiplications defined in this subection are associative. Therefore, z ⊗ z ⊗ z , z ∈
#p
w ∧ w ∧ w , w ∈ y ∨ y ∨ y , y ∈
V,
$p
%p
V,
V,
z ∈
#q
w ∈ y ∈
V,
$q
%q
V,
V,
z ∈
#r
w ∈ y ∈
V;
$r
%r
V;
V
are meaningful as well as similar expressions with more than three factors. ! ! 7. If w ∈ p V , w ∈ q V , then w ∧ w = (−1) pq w ∧ w . 8. If y ∈
"p
V , y ∈
"q
V , then y ∨ y = y ∨ y.
Examples: 1. When the vector space is the dual V ∗ = L (V ; F ) of a vector space and we choose as the models of tensor powers of V ∗ the spaces of multilinear forms (with the usual tensor multiplication), then the image of the tensor multiplication ϕ ⊗ ψ (ϕ ∈ L p (V ; F ) and ψ ∈ L q (V ; F )) on (v1 , . . . , v p+q ) is given by the equality (ϕ ⊗ ψ)(v1 , . . . , v p+q ) = ϕ(v1 , . . . , v p )ψ(v p+1 , . . . , v p+q ). 2. When the vector space is the dual V ∗ = L (V ; F ) of a vector space and we choose as the models for the tensor powers of V ∗ the spaces of multilinear forms (with the usual tensor multiplication), the alt multiplication of ϕ ∈ A p (V ; F ) and ψ ∈ Aq (V ; F ) takes the form (ϕ ∧ ψ)(v1 , . . . , v p+q ) 1 sgn(σ )ϕ(vσ (1) , . . . , vσ ( p) )ψ(vσ ( p+1) , . . . , vσ ( p+q ) ). = p!q ! σ ∈S p+q
3. The equality in Example 2 has an alternative expression that can be seen as a “Laplace expansion” for antisymmetric forms
1319
Multilinear Algebra
(ϕ ∧ ψ)(v1 , . . . , v p+q )
=
)ϕ(vα(1) , . . . , vα( p) )ψ(vαc (1) , . . . , vαc (q ) ). sgn(α
α∈Q p, p+q
4. In the case p = 1, the equality in Example 3 has the form
(ϕ ∧ ψ)(v1 , . . . , vq +1 ) =
q +1
(−1) j +1 ϕ(v j )ψ(v1 , . . . , v j −1 , v j +1 , . . . , vq +1 ).
j =1
5. When the vector space is the dual V ∗ = L (V ; F ) of a vector space and we choose as the models of tensor powers of V ∗ the spaces of multilinear forms (with the usual tensor multiplication), the value of sym multiplication of ϕ ∈ S p (V ; F ) and ψ ∈ S q (V ; F ) on (v1 , . . . , v p+q ) is
(ϕ ∨ ψ)(v1 , . . . , v p+q ) 1 ϕ(vσ (1) , . . . , vσ ( p) )ψ(vσ ( p+1) , . . . , vσ ( p+q ) ). = p!q ! σ ∈S p+q
6. The equality in Example 5 has an alternative expression that can be seen as a “Laplace expansion” for symmetric forms
(ϕ ∨ ψ)(v1 , . . . , v p+q )
=
ϕ(vα(1) , . . . , vα( p) )ψ(vαc (1) , . . . , vαc (q ) ).
α∈Q p, p+q
7. In the case p = 1, the equality in Example 6 has the form
(ϕ ∨ ψ)(v1 , . . . , vq +1 ) =
q +1
ϕ(v j )ψ(v1 , . . . , v j −1 , v j +1 , . . . , vq +1 ).
j =1
13.8
Associated Maps
Definitions:
Let θ ∈ L (V ; U ). The linear map θ ⊗ · · · ⊗ θ from m V into m U (the tensor product of m copies of ! " ! " θ) will be denoted by m θ. The subspaces m V and m V are mapped by m θ into m U and m U , m !m "m !m "m θ to V and to V will be respectively denoted, θe θ. respectively. The restriction of Facts: The following facts can be found in [Mar73, Chap. 2].
1320
Handbook of Linear Algebra
1. Let v1 , . . . , vm ∈ V . The following properties hold: !m
(a)
θ(v1 ∧ · · · ∧ vm ) = θ(v1 ) ∧ · · · ∧ θ(vm ).
"m
(b)
θ(v1 ∨ · · · ∨ vm ) = θ(v1 ) ∨ · · · ∨ θ(vm ).
2. Let θ ∈ L (V ; U ) and η ∈ L (W, V ). The following equalities hold: !m
(a) (b)
"m
!m
(θ η) = (θ η) = I! m
!m "m
(θ) (θ)
!m "m
"m
(η). (η).
3. (I V ) = (I V ) = I"m V . V; 4. Let θ, η ∈ L (V ; U ) and assume that rank (θ) > m. Then $m
θ=
$m
η
if and only if θ = aη and a m = 1. " " 5. Let θ, η ∈ L (V ; U ). Then m θ = m η if and only if θ = aη and a m = 1. ! " 6. If θ is onetoone (respectively onto), then m θ and m θ are onetoone (respectively onto). From now on θ is a linear operator on the ndimensional vector space V . ! ! 7. Considering n θ as an operator in the onedimensional space n V , & $n '
θ (z) = det(θ)z, for all z ∈
$n
V.
8. If the characteristic polynomial of θ is pθ (x) = x n +
n
(−1)i ai x n−i ,
i =1
then ai = tr
& $i '
θ ,
i = 1, . . . , n.
9. If θ has spectrum σ (θ) = {λ1 , . . . , λn }, then σ
& $m '
θ =
m i =1
10. det
& $m '
λα(i )
,
σ
& %m '
θ =
n−1
m
λα(i )
i =1
α∈Q m,n
θ = det(θ)(m−1) ,
det
& %m '
θ = det(θ)(
. α∈G m,n
m+n−1 m−1
).
Examples: 1. Let A be the matrix of the linear operator θ ∈ L (V ; V ) in the basis (b1 , . . . , bn ). The linear operator ! ! on m V whose matrix in the basis (b∧α )α∈Q m,n is the mth compound of A is m θ.
13.9
Tensor Algebras
Definitions: Let A be an F algebra and (Ak )k∈N a family of vector subspaces of A. The algebra A is graded by (Ak )k∈N if the following conditions are satisfied: *
(a) A = k∈N Ak . (b) Ai A j ⊆ Ai + j for every i, j ∈ N.
1321
Multilinear Algebra +
The elements of Ak are known as homogeneous of degree k, and the elements of n∈N Ak are called homogeneous. By condition (a), every element of A can be written uniquely as a sum of (a finite number of nonzero) homogeneous elements, i.e., given u ∈ A there exist uniquely determined uk ∈ Ak , k ∈ N satisfying u=
uk .
k∈N
These elements are called homogeneous components of u. The summand of degree k in the former equation is denoted by [u]k . From now on V is a finite dimensional vector space over F of dimension n. As before k V denotes the kthtensor power of V . Denote by V the external direct sum of the vector spaces k V, k ∈ N. If z i ∈ i V , z i is identified V whose i th coordinate is z i and the remaining coordinates are 0. Therefore, with the sequence z ∈ after this identification, #
V=
#k
V.
k∈N
Consider in
V the multiplication (x, y) → x ⊗ y defined for x, y ∈
[x ⊗ y]k =
[x]r ⊗ [y]s ,
V by
k ∈ N,
r,s ∈N r +s =k
where [x]r ⊗[y]s is the (r, s )tensor multiplication of [x]r and [y]s introduced in the definitions of Section V equipped with this multiplication is called the tensor algebra on V . 13.7. The vector space ! ! ! Denote by V the external direct sum of the vector spaces k V, k ∈ N. If z i ∈ i V , z i is identified ! with the sequence z ∈ V whose i th coordinate is z i and the remaining coordinates are 0. Therefore, after this identification, $
V=
$k
V.
k∈N
Recall that
!k
V = {0} if k > n. Then $
V=
n $ k
V
k=0
and the elements of
!
V can be uniquely written in the form z0 + z1 + · · · + zn ,
Consider in
!
zi ∈
$i
V,
i = 0, . . . , n.
V the multiplication (x, y) → x ∧ y defined, for x, y ∈ [x ∧ y]k =
[x]r ∧ [y]s ,
!
V , by
k ∈ {0, . . . , n},
r,s ∈{0, ... ,n} r +s =k
where [x]r ∧ [y]s is the (r, s )alt multiplication of [x]r and [y]s referred in definitions of Section 13.7. ! The vector space V equipped with this multiplication is called the Grassmann algebra on V . " " Denote by V the external direct sum of the vector spaces k V, k ∈ N. "i " V , we identify z i with the sequence z ∈ V whose i th coordinate is z i and the remaining If z i ∈ coordinates are 0. Therefore, after this identification %
V=
%k k∈N
V.
1322
Handbook of Linear Algebra
Consider in
"
V the multiplication (x, y) → x ∨ y defined for x, y ∈ [x ∨ y]k =
[x]r ∨ [y]s ,
"
V by
k ∈ N,
r,s ∈N r +s =k
where [x]r ∨ [y]s is the (r, s )sym multiplication of [x]r and [y]s referred in definitions of Section 13.7. " The vector space V equipped with this multiplication is called the symmetric algebra on V . Facts: The following facts can be found in [Mar73, Chap. 3] and [Gre67, Chaps. II and III].
V with the multiplication (x, y) → x ⊗ y is an algebra over F graded by 1. The vector space ( k V )k∈N , whose identity is the identity of F = 0 V. ! 2. The vector space V with the multiplication (x, y) → x ∧ y is an algebra over F graded by ! ! ( k V )k∈N whose identity is the identity of F = 0 V . " 3. The vector space V with the multiplication (x, y) → x ∨ y is an algebra over F graded by " " ( k V )k∈N whose identity is the identity of F = 0 V . V does not have zero divisors. 4. The F algebra 5. Let B be an F algebra and θ a linear map from V into B satisfying θ(x)θ(y) = −θ(y)θ(x) for all x, y ∈ ! V . Then there exists a unique algebra homomorphism h from V into B satisfying hV = θ. 6. Let B be an F algebra and θ a linear map from V into B satisfying θ(x)θ(y) = θ(y)θ(x), for all x, y ∈ " V . Then there exists a unique algebra homomorphism h from V into B satisfying hV = θ. "m V is isomorphic to the algebra of 7. Let (b1 , . . . , bn ) be a basis of V . The symmetric algebra polynomials in n indeterminates, F [x1 , . . . , xn ], by the algebra isomorphism whose restriction to V is the linear map that maps bi into xi , i = 1, . . . , n. Examples: 1. Let x1 , . . . , xn be n distinct indeterminates. Let V be the vector space of the formal linear combinations with coefficients in F in the indeterminates x1 , . . . , xn . The tensor algebra on V is the algebra of the polynomials in the noncommuting indeterminates x1 , . . . , xn ([Coh03], [Jac64]). This algebra is denoted by F x1 , . . . , xn . The elements of this algebra are of the form f (x1 , . . . , xn ) =
c α xα(1) ⊗ · · · ⊗ xα(m) ,
m∈N α∈m,n
with all but a finite number of the coefficients c α equal to zero.
13.10 Tensor Product of Inner Product Spaces Unless otherwise stated, within this section V, U , and W, as well as these letters subscripts, superscripts, or accents, are finite dimensional vector spaces over R or over C, equipped with an inner product. The inner product of V is denoted by , V . When there is no risk of confusion , is used instead. In this section F means either the field R or the field C. Definitions: Let θ be a linear map from V into W. The notation θ ∗ will be used for the adjoint of θ (i.e., the linear map from W into V satisfying θ(x), y = x, θ ∗ (y) for all x ∈ V and y ∈ W).
1323
Multilinear Algebra
The unique inner product , on V1 ⊗ · · · ⊗ Vm satisfying, for every vi , ui ∈ Vi , i = 1, . . . , m, v1 ⊗ · · · ⊗ vm , u1 ⊗ · · · ⊗ um =
m
vi , ui Vi ,
i =1
is called induced inner product associated with the inner products , Vi , i = 1, . . . , m. For each v ∈ V , let f v ∈ V ∗ be defined by f v (u) = u, v. The inverse of the map v → f v is denoted by V (briefly ). The inner product on V ∗ , defined by f, g = (g ), ( f )V , is called the dual of , V . Let U, V be inner product spaces over F . We consider defined in L (V ; U ) the Hilbert–Schmidt inner product, i.e., the inner product defined, for θ, η ∈ L (V ; U ), by θ, η = tr(η∗ θ). From now on V1 ⊗ · · · ⊗ Vm is assumed to be equipped with the inner product induced by the inner products , Vi , i = 1, . . . , m. Facts: The following facts can be found in [Mar73, Chap. 2]. 1. The map v → f v is bijectivelinear if F = R and conjugatelinear (i.e., c v → c f v ) if F = C. 2. If (bi 1 , . . . , bi ni ) is an orthonormal basis of Vi , i = 1, . . . , m, then {b⊗ α : α ∈ (n 1 , . . . , n m )} is an orthonormal basis of V1 ⊗ · · · ⊗ Vm . 3. Let θi ∈ L (Vi ; Wi ), i = 1, . . . , m, with adjoint map θi∗ ∈ L (Wi , Vi ). Then, (θ1 ⊗ · · · ⊗ θm )∗ = θ1∗ ⊗ · · · ⊗ θm∗ . 4. If θi ∈ L (Vi ; Vi ) is Hermitian (normal, unitary), i = 1, . . . , m, then θ1 ⊗ · · · ⊗ θm is also Hermitian (normal, unitary). " 5. Let θ ∈ L (V ; V ). If m θ ( m θ) is normal, then θ is normal. ! 6. Let θ ∈ L (V ; V ). Assume that θ is a linear operator on V with rank greater than m. If m θ is normal, then θ is normal. 7. If u1 , . . . , um , v1 , . . . , vm ∈ V : u1 ∧ · · · ∧ um , v1 ∧ · · · ∧ vm = m! detui , v j , u1 ∨ · · · ∨ um , v1 ∨ · · · ∨ vm = m!perui , v j . 8. Let (b1 , . . . , bn ) be an orthonormal basis of V . Then the basis (b⊗ α )α∈m,n is an orthonormal basis of m
,
1 ∧ V , ( m! bα )α∈Q m,n is an orthonormal basis of "m V. basis of
!m
,
V , and (
1 b∨ ) m!λα ! α α∈G m,n
is an orthonormal
Examples: The field F (recall that F = R or F = C) has an inner product, (a, b) → a, b = ab. This inner product is called the standard inner product in F and it is the one assumed to equip F from now on. 1. When we choose F as the mth tensor power of F with the field multiplication as the tensor multiplication, then the canonical inner product is the inner product induced in m F by the canonical inner product. 2. When we assume V as the tensor product of F and V with the tensor multiplication a ⊗ v = av, the inner product induced by the canonical inner product of F and the inner product of V is the inner product of V .
1324
Handbook of Linear Algebra
3. Consider L (V ; U ) as the tensor product of U and V ∗ by the tensor multiplication (u ⊗ f )(v) = f (v)u. Assume in V ∗ the inner product dual of the inner product of V . Then, if (v1 , . . . , vn ) is an orthonormal basis of V and θ, η ∈ L (V ; U ), we have θ, η =
m
θ(v j ), η(v j ) = tr(η∗ θ),
j =1
i.e., the associated inner product of L (V ; U ) is the Hilbert–Schmidt one. 4. Consider F m×n as the tensor product of F m and F n by the tensor multiplication described in Example 1 in section 13.2. Then if we consider in F m and F n the usual inner product we get in F m×n as the induced inner product, the inner product T
(A, B) → tr(B A) =
ai j bi, j .
i, j
5. Assume that in Vi∗ is defined the inner product dual of , Vi , i = 1, . . . , m. Then choosing L (V1 , . . . , Vm ; F ) as the tensor product of V1∗ , . . . , Vm∗ , with the usual tensor multiplication, the inner product of L (V1 , . . . , Vm ; F ) induced by the duals of inner products on Vi∗ , i = 1, . . . , m is given by the equalities
ϕ, ψ =
ϕ(b1,α(1) , . . . , bm,α(m) )ψ(b1,α(1) , . . . , bm,α(m) ).
α∈
13.11 Orientation and Hodge Star Operator In this section, we assume that all vector spaces are real finite dimensional inner product spaces. Definitions: Let V be a onedimensional vector space. The equivalence classes of the equivalence relation ∼, defined by the condition v ∼ v if there exists a positive real number a > 0 such that v = av, partitions the set of nonzero vectors of V into two subsets. Each one of these subsets is known as an open halfline. An orientation of V is a choice of one of these subsets. The fixed open halfline is called the positive halfline and its vectors are known as positive. The other open halfline of V is called negative halfline, and its vectors are also called negative. The field R, regarded as onedimensional vector space, has a “natural” orientation that corresponds to choose as positive halfline the set of positive numbers. ! If V is an ndimensional vector space, n V is a onedimensional vector space (recall Fact 22 in section ! 13.6). An orientation of V is an orientation of n V . A basis (b1 , . . . , bn ) of V is said to be positively oriented if b1 ∧ · · · ∧ bn is positive and negatively oriented if b1 ∧ · · · ∧ bn is negative. ! Throughout this section m V will be equipped with the inner product , ∧ , a positive multiple of the induced the inner product, defined by z, w ∧ =
1 z, w , m!
where the inner product on the righthand side of the former equality is the inner product of m V induced by the inner product of V . This is also the inner product that is considered whenever the norm of antisymmetric tensors is referred.
1325
Multilinear Algebra !
The positive tensor of norm 1 of n V , uV , is called fundamental tensor of V or element of volume of V . Let V be a real oriented inner product space . Let 0 ≤ m ≤ n. ! ! The Hodge star operator is the linear operator m (denoted also by ) from m V into n−m V defined by the following condition: m (w ), w ∧ uV = w ∧ w , for all w ∈
$n−m
V.
Let n ≥ 1 and let V be an ndimensional oriented inner product space over R. The external product on V is the map (v1 , . . . , vn−1 ) → v1 × · · · × vn−1 = n−1 (v1 ∧ · · · ∧ vn−1 ), from V n−1 into V . Facts: The following facts can be found in [Mar75, Chap. 1] and [Sch75, Chap. 1]. 1. If (b1 , . . . , bn ) is a positively oriented orthonormal basis of V , then uV = b1 ∧ · · · ∧ bn . 2. If (b1 , . . . , bn ) is a positively oriented orthonormal basis of V , then )b∧ m b∧ α = sgn(α αc ,
α ∈ Q m,n ,
and α c are defined in Section 13.7. where α 3. Let (v1 , . . . , vn ) and (u1 , . . . , un ) be two bases of V and v j = ai j ui , j = 1, . . . , n. Let A = [ai j ]. Since (recall Fact 29 in Section 13.6)
v1 ∧ · · · ∧ vn = det(A)u1 ∧ · · · ∧ un , two bases have the same orientation if and only if their transition matrix has a positive determinant. 4. is an isometric isomorphism. 5. 0 is the linear isomorphism that maps 1 ∈ R onto the fundamental tensor. 6. m n−m = (−1)m(n−m) I!n−m V . Let V be an ndimensional oriented inner product space over R. 7. If m = 0 and m = n, the Hodge star operator maps the set of decomposable elements of ! onto the set of decomposable elements of n−m V . 8. Let (x1 , . . . , xm ) be a linearly independent family of vectors of V . Then y1 ∧ · · · ∧ yn−m = m (x1 ∧ · · · ∧ xm ) if and only if the following three conditions hold: (a) y1 , . . . , yn−m ∈ Span({x1 , . . . , xm })⊥ ; (b) y1 ∧ · · · ∧ yn−m = x1 ∧ · · · ∧ xm ; (c) (x1 , . . . , xm , y1 , . . . , yn−m ) is a positively oriented basis of V .
!m
V
1326
Handbook of Linear Algebra
9. If (v1 , . . . , vn−1 ) is linearly independent, v1 ×· · ·×vn−1 is completely characterized by the following three conditions: (a) v1 × · · · × vn−1 ∈ Span({v1 , . . . , vn−1 })⊥ . (b) v1 × · · · × vn−1 = v1 ∧ · · · ∧ vn−1 . (c) (v1 , . . . , vn−1 , v1 × · · · × vn−1 ) is a positively oriented basis of V . 10. Assume V ∗ = L (V ; F ), with dim(V ) ≥ 1, is equipped with the dual inner product. Consider L m (V ; F ) as a model for the mth tensor power of V ∗ with the usual tensor multiplication. Then !m ∗ V = Am (V ; F ). If λ is an antisymmetric form in Am (V ; F ), then m (λ) is the form whose value in (v1 , . . . , vn−m ) is the component in the fundamental tensor of λ∧−1 (v1 )∧· · ·∧−1 (vn−m ), where is defined in the definition of section 13.10. m (λ)(v1 , . . . , vn−m )uV ∗ = λ ∧ −1 (v1 ) ∧ · · · ∧ −1 (vn−m ).
11. Assuming the above setting for the Hodge star operator, the external product of v1 , . . . , vn−1 is the image by of the form (uV ∗ )v1 ,...,vn−1 (recall that (uV ∗ )v1 ,...,vn−1 (vn ) = uV ∗ (v1 , . . . , vn−1 , vn )), i.e., v1 × · · · × vn−1 = ((uV ∗ )v1 ,...,vn−1 ). The preceeding formula can be unfolded by stating that for each v ∈ V , v, v1 × · · · × vn−1 =
uV ∗ (v1 , . . . , vn−1 , v).
Examples:
!
!
1. If V has dimension 0, the isomorphism 0 from 0 V = R into 0 V = R is either the identity (in the case we choose the natural orientation of V ) or −I (in the case we fix the nonnatural orientation of V ). 2. When V has dimension 2, the isomorphism 1 is usually denoted by J. It has the property J 2 = −I and corresponds to the positively oriented rotation of π/2. 3. Assume that V has dimension 2. Then the external product is the isomorphism J. 4. If dim(V ) = 3, the external product is the wellknown cross product.
References [Bou89] N. Bourbaki, Algebra, SpringerVerlag, Berlin (1989). [Coh03] P. M. Cohn, Basic Algebra–Groups Rings and Fields, SpringerVerlag, London (2003). [Dol04] Igor V. Dolgachev, Lectures on Invarint Theory. Online publication, 2004. Cambridge University Press, CambridgeNew York (1982). [Gre67] W. H. Greub, Multilinear Algebra, SpringerVerlag, Berlin (1967). [Jac64] Nathan Jacobson, Structure of Rings, American Mathematical Society Publications, Volume XXXVII, Providence, RI (1964). [Mar73] Marvin Marcus, Finite Dimensional Multilinear Algebra, Part I, Marcel Dekker, New York (1973). [Mar75] Marvin Marcus, Finite Dimensional Multilinear Algebra, Part II, Marcel Dekker, New York (1975). [Mer97] Russell Merris, Multilinear Algebra, Gordon Breach, Amsterdam (1997). [Sch75] Laurent Schwartz, Les Tenseurs, Hermann, Paris (1975). [Spi79] Michael Spivak, A Comprehensive Introduction to Differential Geometry, Volume I, 2nd ed., Publish or Perish, Inc., Wilmington, DE (1979).
14 Matrix Equalities and Inequalities Eigenvalue Equalities and Inequalities . . . . . . . . . . . . . . . Spectrum Localization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Inequalities for the Singular Values and the Eigenvalues . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14.4 Basic Determinantal Relations . . . . . . . . . . . . . . . . . . . . . . 14.5 Rank and Nullity Equalities and Inequalities . . . . . . . . 14.6 Useful Identities for the Inverse . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14.1 14.2 14.3
Michael Tsatsomeros Washington State University
141 145 148 1410 1412 1415 1417
In this chapter, we have collected classical equalities and inequalities regarding the eigenvalues, the singular values, the determinant, and the dimensions of the fundamental subspaces of a matrix. Also included is a section on identities for matrix inverses. The majority of these results can be found in comprehensive books on linear algebra and matrix theory, although some are of specialized nature. The reader is encouraged to consult, e.g., [HJ85], [HJ91], [MM92], or [Mey00] for details, proofs, and further bibliography.
14.1
Eigenvalue Equalities and Inequalities
The majority of the facts in this section concern general matrices; however, some classical and frequently used results on eigenvalues of Hermitian and positive definite matrices are also included. For the latter, see also Chapter 8 and [HJ85, Chap. 4]. Many of the definitions and some of the facts in this section are also given in Section 4.3. Facts: 1. [HJ85, Chap. 1] Let A ∈ F n×n , where F = C or any algebraically closed field. Let p A (x) = det(x I − A) be the characteristic polynomial of A, and λ1 , λ2 , . . . , λn be the eigenvalues of A. Denote by Sk (λ1 , . . . , λn )(k = 1, 2, . . . , n) the kth elementary symmetric function of the eigenvalues (here abbreviated Sk (λ)), and by Sk (A) the sum of all k × k principal minors of A. Then r The characteristic polynomial satisfies
p A (x) = (x − λ1 )(x − λ2 ) · · · (x − λn ) = x n − S1 (λ)x n−1 + S2 (λ)x n−2 + · · · + (−1)n−1 Sn−1 (λ)x + (−1)n Sn (λ) = x n − S1 (A)x n−1 + S2 (A)x n−2 + · · · + (−1)n−1 Sn−1 x + (−1)n Sn (A). 141
142
Handbook of Linear Algebra r S (λ) = S (λ , . . . , λ ) = S (A)(k = 1, 2, . . . , n). k k 1 n k r trA = S (A) = n a = n λ and det A = Sn (A) = in=1 λi . 1 i =1 ii i =1 i
2. [HJ85, (1.2.13)] Let A(i ) be obtained from A ∈ Cn×n by deleting row and column i . Then n d p A (x) = p A(i ) (x). dx i =1
Facts 3 to 9 are collected, together with historical commentary, proofs, and further references, in [MM92, Chap. III]. 3. (Hirsch and Bendixson) Let A = [aij ] ∈ Cn×n and λ be an eigenvalue of A. Denote B = [bij ] = (A + A∗ )/2 and C = [c ij ] = (A − A∗ )/(2i ). Then the following inequalities hold: λ ≤ n max aij , i, j
Reλ ≤ n max bij , i, j
Imλ ≤ n max c ij . i, j
Moreover, if A + AT ∈ Rn×n , then
Imλ ≤ max c ij  i, j
n(n − 1) . 2
4. (Pick’s inequality) Let A = [aij ] ∈ Rn×n and λ be an eigenvalue of A. Denote C = [c ij ] = (A − AT )/2. Then
Imλ ≤ max c ij  cot i, j
π 2n
.
5. Let A = [aij ] ∈ Cn×n and λ be an eigenvalue of A. Denote B = [bij ] = (A + A∗ )/2 and C = [c ij ] = (A − A∗ )/(2i ). Then the following inequalities hold: min{µ : µ ∈ σ (B)} ≤ Reλ ≤ max{µ : µ ∈ σ (B)}, min{ν : ν ∈ σ (C )} ≤ Imλ ≤ max{ν : ν ∈ σ (C )}. 6. (Schur’s inequality) Let A = [aij ] ∈ Cn×n have eigenvalues λ j ( j = 1, 2, . . . , n). Then n
λ j 2 ≤
j =1
n
aij 2
i, j =1
with equality holding if and only if A is a normal matrix (i.e., A∗ A = AA∗ ). (See Section 7.2 for more information on normal matrices.) 7. (Browne’s Theorem) Let A = [aij ] ∈ Cn×n and λ j ( j = 1, 2, . . . , n) be the eigenvalues of A ordered so that λ1  ≥ λ2  ≥ · · · ≥ λn . Let also σ1 ≥ σ2 ≥ · · · ≥ σn be the singular values of A, which are real and nonnegative. (See Section 5.6 for the definition.) Then σn ≤ λ j  ≤ σ1
( j = 1, 2, . . . , n).
In fact, the following more general statement holds: k i =1
σn−i +1 ≤
k j =1
λt j  ≤
k
σi ,
i =1
for every k ∈ {1, 2, . . . , n} and every ktuple (t1 , t2 , . . . , tk ) of strictly increasing elements chosen from {1, 2, . . . , n} .
143
Matrix Equalities and Inequalities
8. Let A ∈ Cn×n and Ri , C i (i = 1, 2, . . . , n) denote the sums of the absolute values of the entries of A in row i and column i , respectively. Also denote R = max{Ri } i
and C = max{C i }. i
Let λ be an eigenvalue of A. Then the following inequalities hold: R+C Ri + C i ≤ , 2 2 √ √ λ ≤ maxi Ri C i ≤ RC ,
λ ≤ maxi
λ ≤ min{R, C }. 9. (Schneider’s Theorem) Let A = [aij ] ∈ Cn×n and λ j ( j = 1, 2, . . . , n) be the eigenvalues of A ordered so that λ1  ≥ λ2  ≥ · · · ≥ λn . Let x = [xi ] be any vector in Rn with positive entries and define the quantities ri =
n aij x j j =1
(i = 1, 2, . . . , n).
xi
Then k j =1
λ j  ≤
k
ri j
(k = 1, 2, . . . , n)
j =1
for all ntuples (i 1 , i 2 , . . . , i n ) of elements from {1, 2, . . . , n} such that r i1 ≥ r i2 ≥ · · · ≥ r in . 10. [HJ85, Theorem 8.1.18] For A = [aij ] ∈ Cn×n , let its entrywise absolute value be denoted by A = [aij ]. Let B ∈ Cn×n and assume that A ≤ B (entrywise). Then ρ(A) ≤ ρ(A) ≤ ρ(B). 11. [HJ85, Chap. 5, Sec. 6] Let A ∈ Cn×n and · denote any matrix norm on Cn×n . (See Chapter 37). Then ρ(A) ≤ A and lim Ak 1/k = ρ(A).
k−→∞
12. [HJ91, Corollary 1.5.5] Let A = [aij ] ∈ Cn×n . The numerical range of A ∈ Cn×n is W(A) = {v ∗ Av ∈ C : v ∈ Cn with v ∗ v = 1} and the numerical radius of A ∈ Cn×n is r (A) = max{z : z ∈ W(A)}. (See Chapter 18 for more information about the numerical range and numerical radius.) Then the following inequalities hold: r (Am ) ≤ [r (A)]m
(m = 1, 2, . . . ), A1 + A∞ , ρ(A) ≤ r (A) ≤ 2 A2 ≤ r (A) ≤ A2 , 2 A + AT (where A = [aij ]). r (A) ≤ r (A) = 2
144
Handbook of Linear Algebra
Moreover, the following statements are equivalent: (a) r (A) = A2 . (b) ρ(A) = A2 . (c) An 2 = An2 . (d) Ak 2 = Ak2
(k = 1, 2, . . . ).
Facts 13 to 15 below, along with proofs, can be found in [HJ85, Chap. 4]. 13. (Rayleigh–Ritz) Let A ∈ Cn×n be Hermitian (i.e., A = A∗ ) with eigenvalues λ1 ≥ λ2 ≥ · · · ≥ λn . Then (a) λn x ∗ x ≤ x ∗ Ax ≤ λ1 x ∗ x for all x ∈ Cn . x ∗ Ax (b) λ1 = max ∗ = max x ∗ Ax. x ∗ x=1 x =0 x x x ∗ Ax (c) λn = min ∗ = min x ∗ Ax. x ∗ x=1 x =0 x x 14. (Courant–Fischer) Let A ∈ Cn×n be Hermitian with eigenvalues λ1 ≥ λ2 ≥ · · · ≥ λn . Let k ∈ {1, 2, . . . , n}. Then λk = =
min
w 1 ,w 2 ,...,w k−1 ∈Cn
max
w 1 ,w 2 ,...,w n−k ∈C
n
maxn
x =0,x∈C
x⊥w 1 ,w 2 ,...,w k−1
minn
x =0,x∈C
x⊥w 1 ,w 2 ,...,w n−k
x ∗ Ax x∗x x ∗ Ax . x∗x
15. (Weyl) Let A, B ∈ Cn×n be Hermitian. Consider the eigenvalues of A, B, and A + B, denoted by λi (A), λi (B), λi (A + B), respectively, arranged in decreasing order. Then the following hold: (a) For each k ∈ {1, 2, . . . , n}, λk (A) + λn (A) ≤ λk (A + B) ≤ λk (A) + λ1 (B). (b) For every pair j, k ∈ {1, 2, . . . , n} such that j + k ≥ n + 1, λ j +k−n (A + B) ≥ λ j (A) + λk (B). (c) For every pair j, k ∈ {1, 2, . . . , n} such that j + k ≤ n + 1, λ j (A) + λk (B) ≥ λ j +k−1 (A + B). Examples: 1. To illustrate several of the facts in this section, consider ⎡
1 −1 ⎢ 1 ⎢ 3 A=⎢ 0 ⎣ 1 −1 2
0 −2 0 1
⎤
2 1⎥ ⎥ ⎥, −1⎦ 0
whose spectrum, σ (A), consists of λ1 = −0.7112 + 2.6718i, λ2 = −0.7112 − 2.6718i, λ3 = 2.5506, λ4 = 0.8719. Note that the eigenvalues are ordered decreasingly with respect to their moduli (absolute values): λ1  = λ2  = 2.7649 > λ3  = 2.5506 > λ4  = 0.8719.
145
Matrix Equalities and Inequalities
The maximum and minimum eigenvalues of ( A + A∗ )/2 are 2.8484 and −1.495. Note that, as required by Fact 5, for every λ ∈ σ (A), −1.495 ≤ λ ≤ 2.8484. To illustrate Fact 7, let (t1 , t2 ) = (1, 3) and compute the singular values of A: σ1 = 4.2418, σ2 = 2.5334, σ3 = 1.9890, σ4 = 0.7954. Then, indeed, σ4 σ3 = 1.5821 ≤ λ1 λ3  = 7.0522 ≤ σ1 σ2 = 10.7462. Referring to the notation in Fact 8, we have C = 6 and R = 7. The spectral radius of A is ρ(A) = 2.7649 and, thus, the modulus of every eigenvalue of A is indeed bounded above by the quantities √
13 R+C = = 6.5, 2 2
RC = 6.4807,
min{R, C } = 6.
Letting B denote the entrywise absolute value of A, Facts 10 and 11 state that and ρ(A) = 2.7649 ≤ A2 = 4.2418.
ρ(A) = 2.7649 ≤ ρ(B) = 4.4005
Examples related to Fact 12 and the numerical range are found in Chapter 18. See also Example 2 that associates the numerical range with the location of the eigenvalues. 2. Consider the matrix ⎡
1 ⎢ A = ⎣0 0
0 0 0
⎤
0 ⎥ 1⎦ 0
and note that for every integer m ≥ 2, Am consists of zero entries, except for its (1, 1) entry that is equal to 1. One may easily verify that A∞ = A1 = A2 = 1.
ρ(A) = 1,
By Fact 12, it follows that r (A) = 1 and all of the equivalent conditions (a) to (d) in that fact hold, despite A not being a normal matrix.
14.2
Spectrum Localization
This section presents results on classical inclusion regions for the eigenvalues of a matrix. The following facts, proofs, and details, as well as additional references, can be found in [MM92, Chap. III, Sec. 2], [HJ85, Chap. 6], and [Bru82]. Facts: 1. (Gerˇsgorin) Let A = [aij ] ∈ Cn×n and define the quantities Ri =
n
aij 
(i = 1, 2, . . . , n).
j =1 j =i
Consider the Gerˇsgorin discs (centered at aii with radii Ri ), Di = {z ∈ C : z − aii  ≤ Ri }
(i = 1, 2, . . . , n).
146
Handbook of Linear Algebra
Then all the eigenvalues of A lie in the union of the Gerˇsgorin discs; that is, σ (A) ⊂
n
Di .
i =1
Moreover, if the union of k Gerˇsgorin discs, G , forms a connected region disjoint from the remaining n − k discs, then G contains exactly k eigenvalues of A (counting algebraic multiplicities). 2. (L´evy–Desplanques) Let A = [aij ] ∈ Cn×n be a strictly diagonally dominant matrix, namely, aii  >
n
aij 
(i = 1, 2, . . . , n).
j =1 j =i
Then A is an invertible matrix. 3. (Brauer) Let A = [aij ] ∈ Cn×n and define the quantities Ri =
n
aij 
(i = 1, 2, . . . , n).
j =1 j =i
Consider the ovals of Cassini, which are defined by Vi, j = {z ∈ C : z − aii z − a j j  ≤ Ri R j }
(i, j = 1, 2, . . . , n, i = j ).
Then all the eigenvalues of A lie in the union of the ovals of Cassini; that is, n
σ (A) ⊂
Vi, j .
i, j =1 i = j
4. [VK99, Eq. 3.1] Denoting the union of the Gerˇsgorin discs of A ∈ Cn×n by (A) (see Fact 1) and the union of the ovals of Cassini of A by K (A) (see Fact 2), we have that σ (A) ⊂ K (A) ⊆ (A). That is, the ovals of Cassini provided at least as good a localization for the eigenvalues of A as do the Gerˇsgorin discs. 5. Let A = [aij ] ∈ Cn×n such that aii akk  >
n j =1 j =i
aij 
n
ak j 
(i, k = 1, 2, . . . , n, i = k).
j =1 j =k
Then A is an invertible matrix. 6. Facts 1 to 5 can also be stated in terms of column sums instead of row sums. 7. (Ostrowski) Let A = [aij ] ∈ Cn×n and α ∈ [0, 1]. Define the quantities Ri =
n j =1 j =i
aij ,
Ci =
n
a j i 
(i = 1, 2, . . . , n).
j =1 j =i
Then all the eigenvalues of A lie in the union of the discs
Di (α) = z ∈ C : z − aii  ≤ Riα C i1−α
(i = 1, 2, . . . , n);
147
Matrix Equalities and Inequalities
that is, σ (A) ⊂
n
Di (α).
i =1
8. Let A ∈ Cn×n and consider the spectrum of A, σ (A), as well as its numerical range, W(A). Then σ (A) ⊂ W(A). In particular, if A is a normal matrix (i.e., A∗ A = AA∗ ), then W(A) is exactly equal to the convex hull of the eigenvalues of A. Examples: 1. To illustrate Fact 1 (see also Facts 3 and 4) let ⎡
3i ⎢−1 ⎢ ⎢ A=⎢ 1 ⎢ ⎣ 0 1
1 2i 2 −1 0
⎤
0.5 −1 0 1.5 0 0⎥ ⎥ ⎥ −7 0 1⎥ ⎥ 0 10 i ⎦ 1 −1 1
and consider the Gerˇsgorin discs of A displayed in Figure 14.1. Note that there are three connected regions of discs that are disjoint of each other. Each region contains as many eigenvalues (marked with +’s) as the number of discs it comprises. The ovals of Cassini are contained in the union of the Gerˇsgorin discs. In general, although it is easy to verify whether a complex number belongs to an oval of Cassini or not, these ovals are generally difficult to draw. An interactive supplement to [VK99] (accessible at: www.emis.math.ca/EMIS/journals/ETNA/vol.8.1999/pp1520. dir/gershini.html) allows one to draw and compare the Gerˇsgorin discs and ovals of Cassini of 3 × 3 matrices. 2. To illustrate Fact 8, consider the matrices ⎡
⎤
1 −1 2 ⎢ ⎥ A = ⎣ 2 −1 0⎦ −1 0 1
⎡
2 + 2i ⎢ B = ⎣1 + 2i 2+i
and
−2 − i −1 − i −2 − i
⎤
−1 − 2i ⎥ −1 − 2i ⎦ . −1 − i
6 4 2 0 −2 −4 −6
−10
−5
0
5
FIGURE 14.1 The Gerˇsgorin disks of A.
10
148
Handbook of Linear Algebra 2.5 1
2
0.8
1.5
0.6
1
0.4
0.5
0.2
0
0
−0.5
−0.2 −0.4
−1
−0.6
−1.5
−0.8
−2
−1
−2.5 −1.5
−1
−0.5
0
0.5
1
1.5
−1 −0.8 −0.6 −0.4 −0.2 0 0.2 0.4 0.6 0.8 1
2
FIGURE 14.2 The numerical range of A and of the normal matrix B.
Note that B is a normal matrix with spectrum {1, i, −1 − i }. As indicated in Figure 14.2, the numerical ranges of A and B contain the eigenvalues of A and B, respectively, marked with +’s. The numerical range of B is indeed the convex hull of the eigenvalues.
14.3
Inequalities for the Singular Values and the Eigenvalues
The material in this section is a selection of classical inequalities about the singular values. Extensive details and proofs, as well as a host of additional results on singular values, can be found in [HJ91, Chap. 3]. Definitions of many of the terms in this section are given in Section 5.6, Chapter 17, and Chapter 45; additional facts and examples are also given there. Facts: 1. Let A ∈ Cm×n and σ1 be its largest singular value. Then σ1 = A2 . 2. Let A ∈ Cm×n , q = min{m, n}. Denote the singular values of A by σ1 ≥ σ2 ≥ · · · ≥ σq and let k ∈ {1, 2, . . . , q }. Then σk = = =
min
max
w 1 ,w 2 ,...,w k−1 ∈Cn
x2 =1,x∈Cn
max
min
w 1 ,w 2 ,...,w n−k ∈Cn
W⊆C
Ax2
x∈W
W⊆C
dim W=k
x2 =1,x∈Cn
x⊥w 1 ,w 2 ,...,w n−k
max Ax2
minn dim W=n−k+1
= maxn
Ax2
x⊥w 1 ,w 2 ,...,w k−1
x2 =1
min Ax2 , x∈W
x2 =1
where the optimizations take place over all subspaces W ⊆ Cn of the indicated dimensions. 3. (Weyl) Let A ∈ Cn×n have singular values σ1 ≥ σ2 ≥ · · · ≥ σn and eigenvalues λ j ( j = 1, 2, . . . , n) be ordered so that λ1  ≥ λ2  ≥ · · · ≥ λn . Then λ1 λ2 · · · λk  ≤ σ1 σ2 · · · σk Equality holds in (3) when k = n.
(k = 1, 2, . . . , n).
149
Matrix Equalities and Inequalities
4. (A. Horn) Let A ∈ Cm× p and B ∈ C p×n . Let also r = min{m, p}, s = min{ p, n}, and q = min{r, s }. Denote the singular values of A, B, and AB, respectively, by σ1 ≥ σ2 ≥ · · · ≥ σr , τ1 ≥ τ2 ≥ · · · ≥ τs , and χ1 ≥ χ2 ≥ · · · ≥ χq . Then k
χi ≤
i =1
k
σi τi
(k = 1, 2, . . . , q ).
i =1
Equality holds if k = n = p = m. Also for any t > 0, k
χit ≤
i =1
k
(σi τi )t
(k = 1, 2, . . . , q ).
i =1
5. Let A ∈ Cn×n have singular values σ1 ≥ σ2 ≥ · · · ≥ σn and eigenvalues λ j ( j = 1, 2, . . . , n) ordered so that λ1  ≥ λ2  ≥ · · · ≥ λn . Then for any t > 0, k
λi t ≤
i =1
k
σit
(k = 1, 2 . . . , n).
i =1
In particular, for t = 1 and k = n we obtain from the inequality above that trA ≤
n
σi .
i =1
6. Let A, B ∈ Cm×n and q = min{m, n}. Denote the singular values of A, B, and A + B, respectively, by σ1 ≥ σ2 ≥ · · · ≥ σq , τ1 ≥ τ2 ≥ · · · ≥ τq , and ψ1 ≥ ψ2 ≥ · · · ≥ ψq . Then the following inequalities hold: (a) ψi + j −1 ≤ σi + τ j (b) ρi − σi  ≤ τ1 (c)
k i =1
ψi ≤
k i =1
(1 ≤ i, j ≤ q ,
i + j ≤ q + 1).
(i = 1, 2, . . . , q ).
σi +
k
τi
(k = 1, 2, . . . , q ).
i =1
7. Let A ∈ Cn×n have eigenvalues λ j ( j = 1, 2, . . . , n) ordered so that λ1  ≥ λ2  ≥ · · · ≥ λn . Denote the singular values of Ak by σ1 (Ak ) ≥ σ2 (Ak ) ≥ · · · ≥ σn (Ak ). Then lim [σi (Ak )]1/k = λi 
k−→∞
(i = 1, 2, . . . , n).
Examples: 1. To illustrate Facts 1, 3, and 5, as well as gauge the bounds they provide, let ⎡
i 2 −1 ⎢ 1 ⎢ 2 1+i A=⎢ 1 1 ⎣2i 0 1−i 1
⎤
0 0⎥ ⎥ ⎥, 0⎦ 0
whose eigenvalues and singular values ordered as required in Fact 3 are, respectively, λ1 = 2.6775 + 1.0227i, λ2 = −2.0773 + 1.4685i, λ3 = 1.3998 − 0.4912i, λ4 = 0, and σ1 = 3.5278, σ2 = 2.5360, σ3 = 1.7673, σ4 = 0.
1410
Handbook of Linear Algebra
According to Fact 1, A2 = σ1 = 3.5278. The following inequalities hold according to Fact 3: 7.2914 = λ1 λ2  ≤ σ1 σ2 = 8.9465. 10.8167 = λ1 λ2 λ3  ≤ σ1 σ2 σ3 = 15.8114. Finally, applying Fact 5 with t = 3/2 and k = 2, we obtain the inequality 3/2
8.9099 = λ1 3/2 + λ2 3/2 ≤ σ1
3/2
+ σ2
= 10.6646.
For t = 1 and k = n, we get 2.8284 = 2 + 2i  = tr(A) ≤
4
σ j = 7.8311.
j =1
14.4
Basic Determinantal Relations
The purpose of this section is to review some basic equalities and inequalities regarding the determinant of a matrix. For most of the facts mentioned here, see [Mey00, Chap. 6] and [HJ85, Chap. 0]. Definitions of many of the terms in this section are given in Sections 4.1 and 4.2; additional facts and examples are given there as well. Note that this section concludes with a couple of classical determinantal inequalities for positive semidefinite matrices; see Section 8.4 or [HJ85, Chap. 7] for more on this subject. Following are some of the properties of determinants of n × n matrices, as well as classical formulas for the determinant of A and its submatrices. Facts: 1. Let A ∈ F n×n . The following are basic facts about the determinant. (See also Chapter 4.1.) r det A = det AT ; if F = C, then det A∗ = det A. r If B is obtained from A by multiplying one row (or column) by a scalar c , then det B = c det A. r det(cA) = c n det A for any scalar c . r det(AB) = det A det B. If A is invertible, then det A−1 = (det A)−1 . r If B is obtained from A by adding nonzero multiples of one row (respectively, column) to other
rows (respectively, columns), then det B = det A. sgn(σ )a1σ (1) a2σ (2) · · · anσ (n) , where the summation is taken over all permutations σ ∈Sn σ of n letters, and where sgn(σ ) denotes the sign of the permutation σ . r Let A denote the (n −1)×(n −1) matrix obtained from A ∈ F n×n (n ≥ 2) by deleting row i and ij column j . The following formula is known as the Laplace expansion of det A along column j : r det A =
det A =
n
(−1)i + j aij det Aij
( j = 1, 2, . . . , n).
i =1
2. (Cauchy–Binet) Let A ∈ F m,k , B ∈ F k×n and consider the matrix C = AB ∈ F m×n . Let also α ⊆ {1, 2, . . . , m} and β ⊆ {1, 2, . . . , n} have cardinality r , where 1 ≤ r ≤ min{m, k, n}. Then the submatrix of C whose rows are indexed by α and columns indexed by β satisfies det C [α, β] =
det A[α, γ ] det B[γ , β].
γ ⊆{1,2,...,k}
γ =r
3. [Mey00, Sec. 6.1, p. 471] Let A = [aij (x)] be an n × n matrix whose entries are complex differentiable functions of x. Let Di (i = 1, 2, . . . , n) denote the n × n matrix obtained from A when the entries in its i th row are replaced by their derivatives with respect to x. Then n d det Di . (det A) = dx i =1
1411
Matrix Equalities and Inequalities
4. Let A = [aij ] be an n × n matrix and consider its entries as independent variables. Then ∂(det A) = det A({i }, { j }) (i, j = 1, 2, . . . , n), ∂aij where A({i }, { j }) denotes the submatrix of A obtained from A by deleting row i and column j . 5. [Mey00, Sec. 6.2] Let A ∈ F n×n and α ⊆ {1, 2, . . . , n}. If the submatrix of A whose rows and columns are indexed by α, A[α], is invertible, then det A = det A[α] det( A/A[α]). In particular, if A is partitioned in blocks as
A=
A11 A21
A12 , A22
where A11 and A22 are square matrices, then
det A =
det A11 det(A22 − A21 (A11 )−1 A12 ) if A11 is invertible det A22 det(A11 − A12 (A22 )−1 A21 ) if A22 is invertible.
The following two facts for F = C can be found in [Mey00, Sec. 6.2, pp. 475, 483] and [Mey00, Exer. 6.2.15, p. 485], respectively. The proofs are valid for arbitrary fields. 6. Let A ∈ F n×n be invertible and c , d ∈ F n . Then det(A + c d T ) = det(A)(1 + d T A−1 c ). 7. Let A ∈ F n×n be invertible, x, y ∈ F n . Then
det
A yT
x = − det(A + xy T ). −1
8. [HJ85, Theorem 7.8.1 and Corollary 7.8.2] (Hadamard’s inequalities) Let A = [aij ] ∈ Cn×n be a positive semidefinite matrix. Then det A ≤
n
aii .
i =1
If A is positive definite, equality holds if and only if A is a diagonal matrix. For a general matrix B = [bij ] ∈ Cn×n , applying the above inequality to B ∗ B and B B ∗ , respectively, one obtains  det B ≤
n i =1
⎛ ⎝
n
⎞1/2 2⎠
bij 
and  det B ≤
j =1
n j =1
n
1/2
bij 
2
.
i =1
If B is nonsingular, equalities hold, respectively, if and only if the rows or the columns of B are orthogonal. 9. [HJ85, Theorem 7.8.3] (Fischer’s inequality) Consider a positive definite matrix
A=
X Y∗
Y , Z
partitioned so that X, Z are square and nonvacuous. Then det A ≤ det X det Z.
1412
Handbook of Linear Algebra
Examples: For examples relating to Facts 1, 2, and 5, see Chapter 4. 1. Let
⎡
1
3 1 2
⎢ A=⎣ 0
−1
⎤
−1 ⎥ 1⎦ and 2
⎡ ⎤
⎡
1
2
⎤
⎢ ⎥ ⎢ ⎥ x = ⎣ 1⎦ , y = ⎣ 1⎦ .
−1
1
Then, as noted by Fact 7,
det
A yT
⎡
1 3 ⎢ x ⎢ 0 1 =⎢ −1 ⎣−1 2 2 1
⎤
⎡ 1 3 ⎥ 1⎥ ⎢ ⎥ = − det(A + xy T ) = ⎣2 1⎦ 1 −1
−1 1 2 −1
4 2 3
⎤
−2 ⎥ 0⎦ = 10. 1
Next, letting c = [121]T and d = [0 − 1 − 1]T , by Fact 6, we have det(A + c d T ) = det(A)(1 + d T A−1 c ) = (−4) · (−1) = 4. 2. To illustrate Facts 8 and 9, let
⎡
⎤
1 1 X ⎥ 5 1⎦ = Y∗ 1 1 3
3
⎢ A = ⎣1
Y . Z
Note that A is positive definite and so Hadamard’s inequality says that det A ≤ 3 · 5 · 3 = 45; in fact, det A = 36. Fischer’s inequality gives a smaller upper bound for the determinant: det A ≤ det X det Z = 13 · 3 = 39. 3. Consider the matrix
⎡
⎤
1 2 −2 ⎢ ⎥ B = ⎣4 −1 1⎦ . 0 1 1 The first inequality about general matrices in Fact 8 applied to B gives √  det B ≤ 9 · 18 · 2 = 18. As the rows of B are mutually orthogonal, we have that  det B = 18; in fact, det B = −18.
14.5
Rank and Nullity Equalities and Inequalities
Let A be a matrix over a field F . Here we present relations among the fundamental subspaces of A and their dimensions. As general references consult, e.g., [HJ85] and [Mey00, Sec. 4.2, 4.4, 4.5] (even though the matrices discussed there are complex, most of the proofs remain valid for any field). Additional material on rank and nullity can also be found in Section 2.4. Facts: 1. Let A ∈ F m×n . Then rank(A) = dim rangeA = dim rangeAT . If F = C, then rank(A) = dim rangeA∗ = dim rangeA.
1413
Matrix Equalities and Inequalities
2. If A ∈ Cm×n , then rangeA = (kerA∗ )⊥ and rangeA∗ = (kerA)⊥ . 3. If A ∈ F m×n and rank(A) = k, then there exist X ∈ F m×k and Y ∈ F k×n such that A = XY. 4. Let A, B ∈ F m×n . Then rank(A) = rank(B) if and only if there exist invertible matrices X ∈ F m×m and Y ∈ F n×n such that B = XAY. 5. (Dimension Theorem) Let A ∈ F m×n . Then rank(A) + null(A) = n
rank(A) + null(AT ) = m.
and
If F = C, then rank(A) + null(A∗ ) = m. 6. Let A, B ∈ F m×n . Then rank(A) − rank(B) ≤ rank(A + B) ≤ rank(A) + rank(B). 7. Let A ∈ F m×n , B ∈ F m×k , and C = [AB] ∈ F m×(n+k) . Then r rank(C ) = rank(A) + rank(B) − dim(rangeA ∩ rangeB). r null(C ) = null(A) + null(B) + dim(rangeA ∩ rangeB).
8. Let A ∈ F m×n and B ∈ F n×k . Then r rank(AB) = rank(B) − dim(kerA ∩ rangeB). r If F = C, then rank(AB) = rank(A) − dim(kerB ∗ ∩ rangeA∗ ). r Multiplication of a matrix from the left or right by an invertible matrix leaves the rank unchanged. r null(AB) = null(B) + dim(kerA ∩ rangeB). r rank(AB) ≤ min{rank(A), rank(B)}. r rank(AB) ≥ rank(A) + rank(B) − n.
9. (Sylvester’s law of nullity) Let A, B ∈ Cn×n . Then max{null(A), null(B)} ≤ null(AB) ≤ null(A) + null(B). The above fact is valid only for square matrices. 10. (Frobenius inequality) Let A ∈ F m×n , B ∈ F n×k , and C ∈ F k× p . Then rank(AB) + rank(BC) ≤ rank(B) + rank(ABC). 11. Let A ∈ Cm×n . Then rank(A∗ A) = rank(A) = rank(AA∗ ). In fact, range(A∗ A) = rangeA∗
and rangeA = range(AA∗ ),
as well as ker(A∗ A) = kerA and
ker(AA∗ ) = kerA∗ .
12. Let A ∈ F m×n and B ∈ F k× p . The rank of their direct sum is
A rank(A ⊕ B) = rank 0
0 = rank(A) + rank(B). B
13. Let A = [aij ] ∈ F m×n and B ∈ F k× p . The rank of the Kronecker product A⊗ B = [aij B] ∈ F mk×np is rank(A ⊗ B) = rank(A)rank(B).
1414
Handbook of Linear Algebra
14. Let A = [aij ] ∈ F m×n and B = [bij ] ∈ F m×n . The rank of the Hadamard product A ◦ B = [aij bij ] ∈ F m×n satisfies rank(A ◦ B) ≤ rank(A)rank(B). Examples: 1. Consider the matrices ⎡
⎤
1 −1 1 ⎢ ⎥ A = ⎣2 −1 0⎦ , 3 −2 1
⎡
2 ⎢ B = ⎣0 2
3 0 1
⎤
⎡
4 1 ⎥ ⎢ −1⎦ , and C = ⎣1 2 2
2 2 4
−1 −1 −2
⎤
1 ⎥ 1⎦ . 2
We have that rank(A) = 2,
rank(B) = 3, rank(AB) = 2,
rank(C ) = 1, rank(BC) = 1,
rank(A + B) = 3, rank(ABC) = 1.
r As a consequence of Fact 5, we have
null(A) = 3 − 2 = 1,
null(B) = 3 − 3 = 0,
null(C ) = 4 − 1 = 3,
null(A + B) = 3 − 3 = 0,
null(AB) = 3 − 2 = 1,
null(BC) = 3 − 1 = 2,
null(ABC) = 4 − 1 = 3.
r Fact 6 states that
−1 = 2 − 3 = rank(A) − rank(B) ≤ rank(A + B) = 0 ≤ rank(A) + rank(B) = 5. r Since rangeA ∩ rangeB = rangeA, Fact 7 states that
rank([AB]) = rank(A) + rank(B) − dim(rangeA ∩ rangeB) = 2 + 3 − 2 = 3, null([AB]) = null(A) + null(B) + dim(rangeA ∩ rangeB) = 1 + 0 + 2 = 3. r Since ker A ∩ rangeB = kerA, Fact 8 states that
2 = rank(AB) = rank(B) − dim(kerA ∩ rangeB) = 3 − 1 = 2. 2 = rank(AB) ≤ min{rank(A), rank(B)} = 2. 2 = rank(AB) ≥ rank(A) + rank(B) − n = 2 + 3 − 3 = 2. r Fact 9 states that
1 = max{null(A), null(B)} ≤ null(AB) = 1 ≤ Null(A) + null(B) = 1. Fact 9 can fail for nonsquare matrices. For example, if D = [1
1],
then 1 = max{null(D), null(D T )} ≤ null(DDT ) = 0.
1415
Matrix Equalities and Inequalities r Fact 10 states that
3 = rank(AB) + rank(BC) ≤ rank(B) + rank(ABC) = 4.
14.6
Useful Identities for the Inverse
This section presents facts and formulas related to inversion of matrices. Facts: 1. [Oue81, (1.9)], [HJ85, p. 18] Recall that A/A[α] denotes the Schur complement of the principal submatrix A[α] in A. (See Section 4.2 and Section 10.3.) If A ∈ F n×n is partitioned in blocks as
A11 A= A21
A12 , A22
where A11 and A22 are square matrices, then, provided that A, A11 , and A22 are invertible, we have that the Schur complements A/A11 and A/A22 are invertible and
−1
A
−1 −A−1 11 A12 (A/A11 ) . −1 (A/A11 )
(A/A22 )−1 = −(A/A11 )−1 A21 A−1 11
More generally, given an invertible A ∈ F n×n and α ⊆ {1, 2, . . . , n} such that A[α] and A(α) are invertible, A−1 is obtained from A by replacing r A[α] by (A/A(α))−1 , r A[α, α c ] by −A[α]−1 A[α, α c ](A/A[α])−1 , r A[α c , α] by −(A/A[α])−1 A[α c , α]A[α]−1 , and r A(α) by (A/A[α])−1 .
2. [HJ85, pp. 18–19] Let A ∈ F n×n , X ∈ F n×r , R ∈ F r ×r , and Y ∈ F r ×n . Let B = A + X RY . Suppose that A, B, and R are invertible. Then B −1 = (A + X RY )−1 = A−1 − A−1 X(R −1 + Y A−1 X)−1 Y A−1 . 3. (Sherman–Morrison) Let A ∈ F n×n , x, y ∈ F n . Let B = A + xy T . Suppose that A and B are invertible. Then, if y T A−1 x = −1, B −1 = (A + xy T )−1 = A−1 −
1 A−1 xy T A−1 . 1 + y T A−1 x
In particular, if y T x = −1, then (I + xy T )−1 = I −
1 xy T . 1 + yT x
4. Let A ∈ F n×n . Then the adjugate of A (see Section 4.2) satisfies (adjA)A = A(adjA) = (det A)I. If A is invertible, then A−1 =
1 adjA. det A
1416
Handbook of Linear Algebra
5. Let A ∈ F n×n be invertible and let its characteristic polynomial be p A (x) = x n + an−1 x n−1 + an−2 x n−2 + · · · + a1 x + a0 . Then, A−1 =
(−1)n+1 n+1 (A + a1 An + a2 An−1 + · · · + an−1 A). det A
6. [Mey00, Sec. 7.10, p. 618] Let A ∈ Cn×n . The following statements are equivalent. r The Neumann series, I + A + A2 + . . . , converges. r (I − A)−1 exists and (I − A)−1 =
∞
Ak .
k=0
r ρ(A) < 1. r lim Ak = 0. k→∞
Examples: 1. Consider the partitioned matrix
A=
A11 A21
A12 A22
⎡
⎤
1 3 −1 ⎢ ⎥ 2 1⎦ . =⎣ 0 −1 −1 1
Since
−1
(A/A22 )
0 = 1
2 3
−1
−1.5 1 = 0.5 0
and
(A/A11 )−1 = (−1)−1 = −1,
by Fact 1, we have ⎡
A−1
(A/A22 )−1 = −(A/A11 )−1 A21 A−1 11
2. To illustrate Fact 3, consider the invertible matrix ⎡
1 i ⎢ A=⎣ 1 0 −2i 1
⎤
−1 ⎥ 1⎦ −2
and the vectors x = y = [1 1 1]T . We have that ⎡
A−1
⎤
−1.5 1 −2.5 −1 −A−1 ⎢ ⎥ 11 A12 (A/A11 ) 0.5⎦ . = ⎣ 0.5 0 −1 (A/A11 ) −1 1 −1
0.5i ⎢ = ⎣−1 − i −0.5i
1 + 0.5i −1 + i −0.5i
⎤
0.5 ⎥ i ⎦. −0.5
Adding xy T to A amounts to adding 1 to each entry of A; since 1 + y T A−1 x = i = 0,
1417
Matrix Equalities and Inequalities
the resulting matrix is invertible and its inverse is given by (A + xy T )−1 = A−1 − ⎡
1 −1 T −1 A xy A i
2.5 ⎢ = ⎣ −2 + 2i −1.5 − i 3. Consider the matrix
−0.5 − 0.5i 1 0.5 + 0.5i
⎡
⎤
−1 − i ⎥ 2 ⎦. i
⎤
−1 1 −1 ⎢ ⎥ A = ⎣ 1 −1 3⎦ . 1 −1 2 Since A3 = 0, A is a nilpotent matrix and, thus, all its eigenvalues equal 0. That is, ρ(A) = 0 < 1. As a consequence of Fact 6, I − A is invertible and ⎡
(I − A)−1
⎤
1 0 1 ⎢ ⎥ = I + A + A2 = ⎣2 −1 5⎦ . 1 −1 3
References [Bru82] R.A. Brualdi. Matrices, eigenvalues, and directed graphs. Lin. Multilin. Alg., 11:143–165, 1982. [HJ85] R.A. Horn and C.R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985. [HJ91] R.A. Horn and C.R. Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, 1991. [MM92] M. Marcus and H. Minc. A Survey of Matrix Theory and Matrix Inequalities. Dover Publications, New York, 1992. [Mey00] C. D. Meyer. Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia, 2000. [Oue81] D. Ouellette. Schur complements and statistics. Lin. Alg. Appl., 36:187–295, 1981. [VK99] R.S. Varga and A. Krautstengl. On Gerˇsgorintype problems and ovals of Cassini. Electron. Trans. Numer. Anal., 8:15–20, 1999.
15 Matrix Perturbation Theory Eigenvalue Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Singular Value Problems. . . . . . . . . . . . . . . . . . . . . . . . . . . . Polar Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Generalized Eigenvalue Problems . . . . . . . . . . . . . . . . . . . Generalized Singular Value Problems . . . . . . . . . . . . . . . Relative Perturbation Theory for Eigenvalue Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15.7 Relative Perturbation Theory for Singular Value Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15.1 15.2 15.3 15.4 15.5 15.6
RenCang Li University of Texas at Arlington
151 156 157 159 1512 1513 1515 1516
There is a vast amount of material in matrix (operator) perturbation theory. Related books that are worth mentioning are [SS90], [Par98], [Bha96], [Bau85], and [Kat70]. In this chapter, we attempt to include the most fundamental results up to date, except those for linear systems and least squares problems for which the reader is referred to Section 38.1 and Section 39.6. Throughout this chapter, · UI denotes a general unitarily invariant norm. Two commonly used ones are the spectral norm · 2 and the Frobenius norm · F .
15.1
Eigenvalue Problems
The reader is referred to Sections 4.3, 14.1, and 14.2 for more information on eigenvalues and their locations. Definitions: Let A ∈ Cn×n . A scalar–vector pair (λ, x) ∈ C × Cn is an eigenpair of A if x = 0 and Ax = λx. A vector–scalar–vector triplet (y, λ, x) ∈ Cn × C × Cn is an eigentriplet if x = 0, y = 0, and Ax = λx, y∗ A = λy∗ . The quantity cond(λ) =
x2 y2 y∗ x
is the individual condition number for λ, where (y, λ, x) ∈ Cn × C × Cn is an eigentriplet. Let σ (A) = {λ1 , λ2 , . . . , λn }, the multiset of A’s eigenvalues, and set = diag(λ1 , λ2 , . . . , λn ),
τ = diag(λτ (1) , λτ (2) , . . . , λτ (n) ), 151
152
Handbook of Linear Algebra
where τ is a permutation of {1, 2, . . . , n}. For real , i.e., all λ j ’s are real, ↑
↑
↑ = diag(λ1 , λ2 , . . . , λ↑n ). ↑
↑ is in fact a τ for which the permutation τ makes λτ ( j ) = λ j for all j . Given two square matrices A1 and A2 , the separation sep(A1 , A2 ) between A1 and A2 is defined as [SS90, p. 231] sep(A1 , A2 ) = inf X A1 − A2 X2 . X2 =1
= A + A. The same notation is adopted for A, except all symbols with tildes. A is perturbed to A
Let X, Y ∈ Cn×k with rank(X) = rank(Y ) = k. The canonical angles between their column spaces are θi = arc cos σi , where {σi }ik=1 are the singular values of (Y ∗ Y )−1/2 Y ∗ X(X ∗ X)−1/2 . Define the canonical angle matrix between X and Y as (X, Y ) = diag(θ1 , θ2 , . . . , θk ). For k = 1, i.e., x, y ∈ Cn (both nonzero), we use ∠(x, y), instead, to denote the canonical angle between the two vectors. Facts: 2 )1−1/n A . i − λ j  ≤ (A2 + A 1. [SS90, p. 168] (Elsner) max min λ 2 1/n
i
j
2. [SS90, p. 170] (Elsner) There exists a permutation τ of {1, 2, . . . , n} such that τ 2 ≤ 2 −
n 2 )1−1/n A1/n . (A2 + A 2 2
3. [SS90, p. 183] Let (y, µ, x) be an eigentriplet of A. A changes µ to µ + µ with µ =
y∗ (A)x + O(A22 ), y∗ x
and µ ≤ cond(µ)A2 + O(A22 ). 4. [SS90, p. 205] If A and A + A are Hermitian, then ↑ UI ≤ AUI . ↑ −
5. [Bha96, p. 165] (Hoffman–Wielandt) If A and A+A are normal, then there exists a permutation τ F ≤ AF . τ of {1, 2, . . . , n} such that − τ F ≤ 6. [Sun96] If A is normal, then there exists a permutation τ of {1, 2, . . . , n} such that − √ nAF . 7. [SS90, p. 192] (Bauer–Fike) If A is diagonalizable and A = XX −1 is its eigendecomposition, then i − λ j  ≤ X −1 (A)X p ≤ κ p (X)A p . max min λ i
j
are diagonalizable and have eigendecompositions A = XX −1 8. [BKL97] Suppose both A and A −1 and A = X X .
(a) There exists a permutation τ of {1, 2, . . . , n} such that τ F ≤ −
↑ UI ≤ (b) ↑ −
AF . κ2 (X)κ2 ( X)
κ2 (X)κ2 ( X)A UI for real and .
153
Matrix Perturbation Theory
9. [KPJ82] Let residuals r = A x−µ x and s∗ = y∗ A − µ y∗ , where x2 = y2 = 1, and let , y, µ x) is an exact ε = max {r2 , s2 }. The smallest error matrix A in the 2norm, for which ( = A + A, satisfies A2 = ε, and µ − µ ≤ cond(µ ) ε + O(ε 2 ) for some eigentriplet of A µ ∈ σ (A). x−µ x and 10. [KPJ82], [DK70],[Par98, pp. 73, 244] Suppose A is Hermitian, and let residual r = A x2 = 1. , (a) The smallest Hermitian error matrix A (in the 2norm), for which (µ x) is an exact eigenpair = A + A, satisfies A2 = r2 . of A − µ ≤ r2 for some eigenvalue µ of A. (b) µ and x be its associated eigenvector with x2 = 1, (c) Let µ be the closest eigenvalue in σ (A) to µ − λ. If η > 0, then and let η = min µ µ=λ∈σ (A)
− µ ≤ µ
r22 , η
sin ∠( x, x) ≤
r2 . η
11. Let A be Hermitian, X ∈ Cn×k have full column rank, and M ∈ Ck×k be Hermitian having eigenvalues µ1 ≤ µ2 ≤ · · · ≤ µk . Set R = AX − X M. There exist k eigenvalues λi 1 ≤ λi 2 ≤ · · · ≤ λi k of A such that the following inequalities hold. Note that subset {λi j }kj =1 may be different at different occurrences. (a) [Par98, pp. 253–260], [SS90, Remark 4.16, p. 207] (Kahan–Cao–Xie–Li)
1≤ j ≤k
R2 , σmin (X)
j =1
RF . σmin (X)
max µ j − λi j  ≤
k (µ j − λi )2 ≤ j
(b) [SS90, pp. 254–257], [Sun91] If X ∗ X = I and M = X ∗ AX, and if all but k of A’s eigenvalues differ from every one of M’s by at least η > 0 and εF = RF /η < 1, then k R2F (µk − λi )2 ≤ j
η 1 − εF2
j =1
.
(c) [SS90, pp. 254–257], [Sun91] If X ∗ X = I and M = X ∗ AX, and there is a number η > 0 such that either all but k of A’s eigenvalues lie outside the open interval (µ1 − η, µk + η) or all but k of A’s eigenvalues lie inside the closed interval [µ + η, µ+1 − η] for some 1 ≤ ≤ k − 1, and ε = R2 /η < 1, then R2 max µ j − λi j  ≤ √ 2 . 1≤ j ≤k η 1 − ε2 12. [DK70] Let A be Hermitian and have decomposition
X 1∗ X 2∗
A[X 1 X 2 ] =
A1 A2
,
154
Handbook of Linear Algebra
where [X 1 X 2 ] is unitary and X 1 ∈ Cn×k . Let Q ∈ Cn×k have orthonormal columns and for a k × k Hermitian matrix M set R = AQ − Q M. Let η = min µ − ν over all µ ∈ σ (M) and ν ∈ σ (A2 ). If η > 0, then sin (X 1 , Q)F ≤ 13. [LL05] Let
A=
M
E∗
E
H
= , A
RF . η
M
0
0
H
be Hermitian, and set η = min µ − ν over all µ ∈ σ (M) and ν ∈ σ (H). Then ↑
2E 22
↑
≤ max λ j − λ j
1≤ j ≤n
η+
η2 + 4E 22
.
14. [SS90, p. 230] Let [X 1 Y2 ] be unitary and X 1 ∈ Cn×k , and let
X 1∗
A[X 1 Y2 ] =
Y2∗
A1
G
E
A2
.
Assume that σ (A1 ) σ (A2 ) = ∅, and set η = sep(A1 , A2 ). If G 2 E 2 < η2 /4, then there is a unique W ∈ C(n−k)×k , satisfying W2 ≤ 2E 2 /η, such that [ X1 Y2 ] is unitary and
X∗1 Y2∗
A[ X1 Y2 ] =
1 A
G
0
2 A
,
where X1 = (X 1 + Y2 W)(I + W ∗ W)−1/2 , Y2 = (Y2 − X 1 W ∗ )(I + WW ∗ )−1/2 , 1 = (I + W ∗ W)1/2 (A1 + G W)(I + W ∗ W)−1/2 , A 2 = (I + WW ∗ )−1/2 (A2 − WG )(I + WW ∗ )1/2 . A
Thus, tan (X 1 , X1 )2 <
2E 2 . η
Examples: τ UI are, in fact, bounds on λ j − λτ ( j ) in disguise, only more convenient and 1. Bounds on − τ 2 = max j λ j − λτ ( j ) , and for concise. For example, for · UI = · 2 (spectral norm), − τ F = · UI = · F (Frobenius norm), − ∈ Cn×n as follows, where ε > 0. 2. Let A, A ⎡
⎢ ⎢ ⎢ ⎢ A=⎢ ⎢ ⎢ ⎣
µ
1 µ
..
.
..
.
⎤
n j =1
⎡
⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥, A = ⎢ ⎥ ⎢ ⎢ 1⎥ ⎦ ⎣
µ
λ j − λτ ( j ) 2
µ
ε
.
⎤
1 µ
1/2
..
.
..
.
⎥ ⎥ ⎥ ⎥ ⎥. ⎥ 1⎥ ⎦
µ
It can be seen that σ (A) = {µ, . . . , µ} (repeated n times) and the characteristic polynomial = (t − µ)n − ε, which gives σ ( A) = {µ + ε 1/n e 2i j π/n , 0 ≤ j ≤ n − 1}. Thus, det(t I − A)
155
Matrix Perturbation Theory − µ = ε 1/n = A . This shows that the fractional power A λ 2 2 be removed in general. 3. Consider 1/n
⎡
1/n
⎤
1
2
3
A=⎢ ⎣0
4
5 ⎥ ⎦
0
0
⎢
⎡
⎥
0
⎢
0 0
A = ⎢ ⎣ 0
is perturbed by
4.001
in Facts 1 and 2 cannot
0.001
⎤ ⎥
0 0⎥ ⎦. 0 0
A’s eigenvalues are easily read off, and λ1 = 1, x1 = [1, 0, 0]T , y1 = [0.8285, −0.5523, 0.0920]T , λ2 = 4, x2 = [0.5547, 0.8321, 0]T , y2 = [0, 0.0002, −1.0000]T , λ3 = 4.001, x3 = [0.5547, 0.8321, 0.0002]T , y3 = [0, 0, 1]T . eigenvalues computed by MATLAB’s eig are λ 1 = 1.0001, λ 2 = 3.9427, On the other hand, A’s 3 = 4.0582. The following table gives λ j − λ j  with upper bounds up to the 1st order by Fact 3. λ j 1 2 3
cond(λ j ) 1.2070 6.0 · 103 6.0 · 103
cond(λ j )A2 0.0012 6.0 6.0
 λj − λj 0.0001 0.057 0.057
We see that cond(λ j )A2 gives a fairly good error bound for j = 1, but dramatically worse for j = 2, 3. There are two reasons for this: One is in the choice of A and the other is that A’s order of magnitude is too big for the first order bound cond(λ j )A2 to be effective for j = 2, 3. Note that A has the same order of magnitude as the difference between λ2 and λ3 and that is too big usually. For better understanding of this first order error bound, the reader may play with this y j x∗ example with A = ε y j 2 xj ∗ 2 for various tiny parameters ε. j
4. Let = diag(c 1 , c 2 , . . . , c k ) and = diag(s 1 , s 2 , . . . , s k ), where c j , s j ≥ 0 and c 2j + s 2j = 1 for all j . The canonical angles between ⎡ ⎤
⎡ ⎤
⎢ ⎥ Y = Q ⎣ ⎦ U ∗ 0
Ik ⎢ ⎥ X = Q ⎣ 0 ⎦ V ∗, 0
are θ j = arccos c j , j = 1, 2, . . . , k, where Q, U, V are unitary. On the other hand, every pair of X, Y ∈ Cn×k with 2k ≤ n and X ∗ X = Y ∗ Y = Ik , having canonical angles arccos c j , can be represented this way [SS90, p. 40]. 5. Fact 13 is most useful when E 2 is tiny and the computation of A’s eigenvalues is then decoupled into two smaller ones. In eigenvalue computations, we often seek unitary [X 1 X 2 ] such that
X 1∗ X 2∗
A[X 1 X 2 ] =
M
E∗
E
H
,
X 1∗
X 2∗
1 X2] = A[X
M
0
0
H
,
and E 2 is tiny. Since a unitarily similarity transformation does not alter eigenvalues, Fact 13 still applies. 6. [LL05] Consider the 2 × 2 Hermitian matrix
α A= ε
ε , β
156
Handbook of Linear Algebra
where α > β and ε > 0. It has two eigenvalues λ± =
α+β ±
(α − β)2 + 4ε 2 , 2
and
0<
λ+ − α β − λ−
=
2ε2
(α − β) +
(α − β)2 + 4ε 2
.
The inequalities in Fact 13 become equalities for the example.
15.2
Singular Value Problems
The reader is referred to Section 5.6, Chapters 17 and 45 for more information on singular value decompositions. Definitions: B ∈ Cm×n has a (first standard form) SVD B = U V ∗ , where U ∈ Cm×m and V ∈ Cn×n are unitary, and = diag(σ1 , σ2 , . . . ) ∈ Rm×n is leading diagonal (σ j starts in the topleft corner) with all σ j ≥ 0. Let SV(B) = {σ1 , σ2 , . . . , σmin{m,n} }, the set of B’s singular values, and σ1 ≥ σ2 ≥ · · · ≥ 0, and let SVext (B) = SV(B) unless m > n for which SVext (B) = SV(B) {0, . . . , 0} (additional m − n zeros). A vector–scalar–vector triplet (u, σ, v) ∈ Cm × R × Cn is a singulartriplet if u = 0, v = 0, σ ≥ 0, and Bv = σ u, B ∗ u = σ v. except all symbols with tildes. B is perturbed to B = B + B. The same notation is adopted for B, Facts: UI ≤ BUI . 1. [SS90, p. 204] (Mirsky) − and s = B ∗ u −µ 2 = 1. u v−µ v, and v2 = u 2. Let residuals r = B , µ , (a) [Sun98] The smallest error matrix B (in the 2norm), for which (u v) is an exact singular {r triplet of B = B + B, satisfies B2 = ε, where ε = max 2 , s2 }. − µ ≤ ε for some singular value µ of B. (b) µ and (u, σ, v) be the associated singulartriplet (c) Let µ be the closest singular value in SVext (B) to µ − σ  over all σ ∈ SVext (B) and σ = µ. If η > 0, with u2 = v2 = 1, and let η = min µ − µ ≤ ε 2 /η, and [SS90, p. 260] then µ
, u) + sin ∠( sin ∠(u v, v) ≤ 2
2
r22 + s22 η
.
3. [LL05] Let
B=
B1
F
E
B2
∈ Cm×n ,
B =
where B1 ∈ Ck×k , and set η = min µ − ν over all µ ∈ max{E 2 , F 2 }. Then max σ j − σ j  ≤ j
0
0
B2
SV(B 1 )
2ε2
η+
B1
η2 + 4ε 2
.
,
and ν ∈
SVext (B 2 ),
and ε =
157
Matrix Perturbation Theory
4. [SS90, p. 260] (Wedin) Let B, B ∈ Cm×n (m ≥ n) have decompositions
U1∗
U2∗
B1 B[V1 V2 ] = 0
∗ U 1
0 , B2
B1 B[V1 V2 ] =
∗ U 2
0
0 , B2
1 U 2 ], and [V 1 V 2 ] are unitary, and U1 , U 1 ∈ Cm×k , V1 , V 1 ∈ Cn×k . Set where [U1 U2 ], [V1 V2 ], [U 1 − U 1 B1 , R = BV
If SV( B1 )
SVext (B 2 )
1 − V 1 B1 . S = B ∗U
= ∅, then
1 )2 + sin (V1 , V 1 )2 ≤ sin (U1 , U F F
R2F + S2F , η
− ν over all µ ∈ SV( B1 ) and ν ∈ SVext (B2 ). where η = min µ
Examples: 1. Let
3 · 10−3 B= 2
1 , B = 4 · 10−3 2
1
= [e2 e1 ]
2 1
e1T
e2T
.
Then σ1 = 2.000012, σ2 = 0.999988, and σ1 = 2, σ2 = 1. Fact 1 gives −3
max σ j − σ j  ≤ 4 · 10 ,
1≤ j ≤2
2 σ j − σ j 2 ≤ 5 · 10−3 . j =1
= e2 , µ = 3 · 10−3 e1 = 2. Then r = B u v = e1 , u v−µ 2. Let B be as in the previous example, and let ∗ −3 and s = B u − µ v = 4 · 10 e2 . Fact 2 applies. Note that, without calculating SV(B), one may bound η needed for Fact 2(c) from below as follows. Since B has two singular values that are near 1 = 2, respectively, with errors no bigger than 4·10−3 , then η ≥ 2−(1+4·10−3 ) = 1−4·10−3 . and µ 3. Let B and B be as in Example 1. Fact 3 gives max σ j − σ j  ≤ 1.6 · 10−5 , a much better bound 1≤ j ≤2
than by Fact 1. SVD there. Apply Fact 4 with k = 1 to give a similar 4. Let B and B be as in Example 1. Note B’s bound as by Fact 2(c). 5. Since unitary transformations do not change singular values, Fact 3 applies to B, B ∈ Cm×n having decompositions
U1∗ U2∗
B1 B[V1 V2 ] = E
F , B2
U1∗ U2∗
B1 B[V1 V2 ] =
0
0 , B2
where [U1 U2 ] and [V1 V2 ] are unitary and U1 ∈ Cm×k , V1 ∈ Cn×k .
15.3
Polar Decomposition
The reader is referred to Chapter 17.1 for definition and for more information on polar decompositions. Definitions: B ∈ Fm×n is perturbed to B = B + B, and their polar decompositions are B = Q H,
H = (Q + Q)(H + H), B = Q
where F = R or C. B is restricted to F for B ∈ F.
158
Handbook of Linear Algebra
Denote the singular values of B and B as σ1 ≥ σ2 ≥ · · · and σ1 ≥ σ2 ≥ · · · , respectively. The condition numbers for the polar factors in the Frobenius norm are defined as condF (X) = lim
sup
δ→0 BF ≤δ
XF , δ
for X = H or Q.
B is multiplicatively perturbed to B if B = DL∗ B DR for some DL ∈ Fm×m and DR ∈ Fn×n . B is said to be graded if it can be scaled as B = GS such that G is “wellbehaved” (i.e., κ2 (G ) is of modest magnitude), where S is a scaling matrix, often diagonal but not required so for the facts below. Interesting cases are when κ2 (G ) κ2 (B). Facts: 1. [CG00] The condition numbers condF (Q) and condF (H) are tabulated as follows, where κ2 (B) = σ1 /σn .
Factor Q
m=n
R 2/(σn−1 + σn )
m>n Factor H
C 1/σn
1/σn 1/σn 2(1 + κ2 (B)2 ) 1 + κ2 (B)
m≥n
√ 2. [Kit86] HF ≤ 2BF . 3. [Li95] If m = n and rank(B) = n, then QUI ≤
2 BUI . σn + σn
4. [Li95], [LS02] If rank(B) = n, then
2 1 + σn + σn max{σn , σn } 2 QF ≤ BF . σn + σn
QUI ≤
BUI ,
5. [Mat93] If B ∈ Rn×n , rank(B) = n, and B2 < σn , then
B2 2BUI ln 1 − QUI ≤ − B2 σn + σn−1
,
where  · 2 is the Ky Fan 2norm, i.e., the sum of the first two largest singular values. (See Chapter 17.3.) 6. [LS02] If B ∈ Rn×n , rank(B) = n, and B2 < σn + σn , then QF ≤
4 BF . σn−1 + σn + σn−1 + σn
7. [Li97] Let B and B = DL∗ B DR having full column rank. Then QF ≤
I − DL−1 2F + DL − I 2F +
I − DR−1 2F + DR − I 2F .
and assume that G and B have full column rank. If 8. [Li97], [Li05] Let B = GS and B = GS † G 2 G 2 < 1, then
159
Matrix Perturbation Theory
QF ≤ γ G † 2 G F ,
(H)S −1 F ≤ γ G † 2 G 2 + 1 G F , where γ =
1 + 1 − G † 2 G 2
−2
.
Examples: 1. Take both B and B to have orthonormal columns to see that some of the inequalities above on Q are attainable. 2. Let
1 2.01 B= √ 2 −1.99 and
1 1 502 = √ −498 2 1
B =
1.4213 −1.4071
1 −1
3.5497 · 102 −3.5214 · 102
10−2 2
2 5 · 102
obtained by rounding each entry of B to have five significant decimal digits. B = QH can be read H can be computed by Q = U V ∗ and H = V ∗ , where B’s SVD is V off above and B = Q ∗ . One has V U SV(B)
= {5.00 · 102 , 2.00 · 10−3 },
SV( B)
= {5.00 · 102 , 2.04 · 10−3 }
and
B2
BF
Q2
QF
H2
HF
3 · 10−3
3 · 10−3
2 · 10−6
3 · 10−6
2 · 10−3
2 · 10−3
Fact 2 gives HF ≤ 3 · 10−3 and Fact 6 gives QF ≤ 10−5 . 3. [Li97] and [Li05] have examples on the use of inequalities in Facts 7 and 8.
15.4
Generalized Eigenvalue Problems
The reader is referred to Section 43.1 for more information on generalized eigenvalue problems. Definitions: Let A, B ∈ Cm×n . A matrix pencil is a family of matrices A − λB, parameterized by a (complex) number λ. The associated generalized eigenvalue problem is to find the nontrivial solutions of the equations Ax = λBx
and/or y∗ A = λy∗ B,
where x ∈ Cn , y ∈ Cm , and λ ∈ C. A − λB is regular if m = n and det(A − λB) = 0 for some λ ∈ C. In what follows, all pencils in question are assumed regular. An eigenvalue λ is conveniently represented by a nonzero number pair, socalled a generalizedeigenvalue α, β , interpreted as λ = α/β. β = 0 corresponds to eigenvalue infinity.
1510
Handbook of Linear Algebra
A generalized eigenpair of A − λB refers to ( α, β , x) such that β Ax = α Bx, where x = 0 and α2 + β2 > 0. A generalized eigentriplet of A − λB refers to (y, α, β , x) such that β Ax = α Bx and βy∗ A = αy∗ B, where x = 0, y = 0, and α2 + β2 > 0. The quantity cond( α, β ) =
x2 y2 y∗ Ax2 + y∗ Bx2
is the individualconditionnumber for the generalized eigenvalue α, β , where (y, α, β , x) is a generalized eigentriplet of A − λB. − λ B = (A + A) − λ(B + B). A − λB is perturbed to A Let σ (A, B) = { α1 , β1 , α2 , β2 , . . . , αn , βn } be the set of the generalized eigenvalues of A − λB, and set Z = [A, B] ∈ C2n×n . A − λB is diagonalizable if it is equivalent to a diagonal pencil, i.e., there are nonsingular X, Y ∈ Cn×n such that Y ∗ AX = , Y ∗ BX = , where = diag(α1 , α2 , . . . , αn ) and = diag(β1 , β2 , . . . , βn ). A − λB is a definite pencil if both A and B are Hermitian and γ (A, B) =
min
x∈Cn ,x2 =1
x∗ Ax + i x∗ Bx > 0.
− λ B, except all symbols with tildes. The same notation is adopted for A is , β The chordal distance between two nonzero pairs α, β and α
−α β βα
= , β χ α, β , α
α2 + β2
2 2 + β α
.
Facts: 1. [SS90, p. 293] Let (y, α, β , x) be a generalized eigentriplet of A − λB. [A, B] changes α, β = y∗ Ax, y∗ Bx to = α, β + y∗ (A)x, y∗ (B)x + O(ε 2 ), , β α
≤ cond( α, β ) ε + O(ε 2 ). , β where ε = [A, B]2 , and χ α, β , α 2. [SS90, p. 301], [Li88] If A − λB is diagonalizable, then
j , β j ≤ κ2 (X) sin (Z ∗ , Z∗ )2 . max min χ αi , βi , α i
j
3. [Li94, Lemma 3.3] (Sun) sin (Z ∗ , Z∗ )UI ≤
UI Z − Z max{σmin (Z), σmin ( Z)}
,
where σmin (Z) is Z’s smallest singular value. 4. The quantity γ (A, B) is the minimum distance of the numerical range W(A + i B) to the origin for definite pencil A − λB. and B are Hermitian and [A, B]2 < 5. [SS90, p. 316] Suppose A − λB is a definite pencil. If A − λ B is also a definite pencil and there exists a permutation τ of {1, 2, . . . , n} such γ (A, B), then A that
τ ( j ) , βτ ( j ) ≤ max χ α j , β j , α
1≤ j ≤n
[A, B]2 . γ (A, B)
6. [SS90, p. 318] Definite pencil A − λB is always diagonalizable: X ∗ AX = and X ∗ B X = , and with real spectra. Facts 7 and 10 apply.
1511
Matrix Perturbation Theory − λ B are diagonalizable with real spectra, i.e., 7. [Li03] Suppose A − λB and A X = , ∗ B X = , Y Y ∗ A
Y ∗ AX = , Y ∗ B X = and
j , β j are real. Then the follow statements hold, where and all α j , β j and all α τ (1) , βτ (1) ), . . . , χ( αn , βn , α τ (n) , βτ (n) )) = diag(χ ( α1 , β1 , α
for some permutation τ of {1, 2, . . . , n} (possibly depending on the norm being used). In all cases, the constant factor π/2 can be replaced by 1 for the 2norm and the Frobenius norm. (a) UI ≤
π 2
sin (Z ∗ , Z∗ )UI . κ2 (X)κ2 ( X)
j 2 + β j 2 = 1 in their eigendecompositions, then (b) If all α j 2 + β 2 = α j
UI ≤
2 Y ∗ 2 [A, B]UI . X2 Y ∗ 2 X
π 2
B 8. Let residuals r = β A x−α x and s∗ = β y∗ A − α y∗ B, where x2 = y2 = 1. The smallest eigentriplet error matrix [A, B] in the 2norm, for which (y, α , β , x) is an exact generalized − λ B, satisfies [A, B]2 = ε, where ε = max {r2 , s2 }, and χ α, β , α ≤ , β of A ε + O(ε 2 ) for some α, β ∈ σ (A, B). , β ) cond( α 9. [BDD00, p. 128] Suppose A and B are Hermitian and B is positive definite, and let residual B r = A x−µ x and x2 = 1.
(a) For some eigenvalue µ of A − λB, − µ ≤ µ
where z M =
r B −1 ≤ B −1 2 r2 , x B
√ z∗ Mz.
among all eigenvalues of A − λB and x its associated (b) Let µ be the closest eigenvalue to µ − ν over all other eigenvalues ν = µ of eigenvector with x2 = 1, and let η = min µ A − λB. If η > 0, then
− µ ≤ µ
1 · η
r B −1 x B
sin ∠( x, x) ≤ B −1 2
2
≤ B −1 22
2κ2 (B)
r2 . η
r22 , η
− λ B are diagonalizable and have eigendecompositions 10. [Li94] Suppose A − λB and A
Y1∗ Y2∗
A[X 1 , X 2 ] =
1
2
,
Y1∗ Y2∗
B[X 1 , X 2 ] =
1
2
,
X −1 = [W1 , W2 ]∗ , − λ B except all symbols with tildes, where X 1 , Y1 , W1 ∈ Cn×k , 1 , 1 ∈ Ck×k . and the same for A 2 j 2 + β j 2 = 1 for 1 ≤ j ≤ n in the eigendecompositions, and set Suppose α j  + β j 2 = α ∈ σ ( 2, 2 ). If η > 0, , β η = min χ α, β , α , β taken over all α, β ∈ σ (1 , 1 ) and α then
† † X 1 2 W 2 2 X1 ∗ sin (X 1 , X 1 ) ≤ Y2 ( Z − Z) F η
. X1 F
1512
15.5
Handbook of Linear Algebra
Generalized Singular Value Problems
Definitions: Let A! ∈ " Cm×n and B ∈ C×n . A matrix pair {A, B} is an (m, , n)Grassmann matrix pair if A rank = n. B In what follows, all matrix pairs are (m, , n)Grassmann matrix pairs. A pair α, β is a generalized singular value of {A, B} if det(β 2 A∗ A − α 2 B ∗ B) = 0, α, β = 0, 0 , α, β ≥ 0, √ √ i.e., α, β = µ, ν for some generalized eigenvalue µ, ν of matrix pencil A∗ A − λB ∗ B. Generalized Singular Value Decomposition (GSVD) of {A, B}: U ∗ AX = A ,
V ∗ B X = B ,
where U ∈ Cm×m , V ∈ C× are unitary, X ∈ Cn×n is nonsingular, A = diag(α1 , α2 , · · · ) is leading diagonal (α j starts in the top left corner), and B = diag(· · · , βn−1 , βn ) is trailing diagonal (β j ends in the bottomright corner), α j , β j ≥ 0 and α 2j + β 2j = 1 for 1 ≤ j ≤ n. (Set some α j = 0 and/or some β j = 0, if necessary.) B} = {A + A, B + B}. {A, B} is perturbed to { A, Let SV(A, B)
= { α1 , β1 , α2 , β2 , . . . , αn , βn } be the set of the generalized singular values of {A, B}, A and set Z = ∈ C(m+)×n . B B}, except all symbols with tildes. The same notation is adopted for { A,
Facts: 1. If {A, B} is an (m, , n)Grassmann matrix pair, then A∗ A − λB ∗ B is a definite matrix pencil. 2. [Van76] The GSVD of an (m, , n)Grassmann matrix pair {A, B} exists. 3. [Li93] There exist permutations τ and ω of {1, 2, . . . , n} such that
2, τ (i ) , βτ (i ) ≤ sin (Z, Z) max χ αi , βi , α
1≤ j ≤n
n 2 F. ω(i ) , βω(i ) χ αi , βi , α ≤ sin (Z, Z) j =1
4. [Li94, Lemma 3.3] (Sun) UI ≤ sin (Z, Z)
UI Z − Z max{σmin (Z), σmin ( Z)}
,
where σmin (Z) is Z’s smallest singular value. i2 + βi2 = 1 for i = 1, 2, . . . , n, then there exists a permutation of 5. [Pai84] If αi2 + βi2 = α {1, 2, . . . , n} such that n ( j ) )2 + (β j − β ( j ) )2 ≤ min Z 0 − Z0 QF , (α j − α j =1
Z∗ Z) −1/2 . where Z 0 = Z(Z ∗ Z)−1/2 and Z0 = Z(
Q unitary
1513
Matrix Perturbation Theory
6. [Li93], [Sun83] Perturbation bounds on generalized singular subspaces (those spanned by one or a few columns of U , V , and X in GSVD) are also available, but it is quite complicated.
15.6
Relative Perturbation Theory for Eigenvalue Problems
Definitions: be an approximation to α, and 1 ≤ p ≤ ∞. Define relative distances between α and α as Let scalar α 2 = 0, follows. For α2 + α # #α
) = ## d(α, α
α
# #
− 1## =
− α α , α
(classical measure)
− α α ) = √ p (α, α , p  p α p + α − α α ) = √ ζ (α, α ,  α α ) =  ln(α /α), for α α > 0, ς(α, α
([Li98]) ([BD90], [DV92]) ([LM99a], [Li99b])
and d(0, 0) = p (0, 0) = ζ (0, 0) = ς(0, 0) = 0. if A = D ∗ ADR for some DL , DR ∈ Cn×n . A ∈ Cn×n is multiplicatively perturbed to A L 2 , . . . , λ n }. Denote σ (A) = {λ1 , λ2 , . . . , λn } and σ ( A) = {λ1 , λ n×n is said to be graded if it can be scaled as A = S ∗ H S such that H is “wellbehaved” A ∈ C (i.e., κ2 (H) is of modest magnitude), where S is a scaling matrix, often diagonal but not required so for the facts below. Interesting cases are when κ2 (H) κ2 (A). Facts: 1. [Bar00] p ( · , · ) is a metric on C for 1 ≤ p ≤ ∞. = D ∗ AD ∈ Cn×n be Hermitian, where D is nonsingular. 2. Let A, A (a) [HJ85, p. 224] (Ostrowski) There exists t j , satisfying λmin (D ∗ D) ≤ t j ≤ λmax (D ∗ D), ↑
↑
= t j λ for j = 1, 2, . . . , n and, thus, such that λ j j ↑
↑
) ≤ I − D ∗ D2 . max d(λ j , λ j
1≤ j ≤n
(b) [LM99], [Li98]
↑
↑
↑
↑
), . . . , ς(λ↑ , λ ↑ ) UI ≤ ln(D ∗ D)UI , diag ς(λ1 , λ 1 n n
), . . . , ζ (λ↑ , λ ↑ ) UI ≤ D ∗ − D −1 UI . diag ζ (λ1 , λ 1 n n
3. [Li98], [LM99] Let A = S ∗ H S be a positive semidefinite Hermitian matrix, perturbed to = S ∗ (H + H)S. Suppose H is positive definite and H −1/2 (H)H −1/2 2 < 1, and set A M = H 1/2 S S ∗ H 1/2 , $
% −1/2 1/2
M = D M D,
= σ ( M), and the = D ∗ . Then σ (A) = σ (M) and σ ( A) where D = I + H −1/2 (H)H inequalities in Fact 2 above hold with D here. Note that
1514
Handbook of Linear Algebra
D − D −1 UI ≤
H −1/2 (H)H −1/2 UI
1 − H −1/2 (H)H −1/2 2 H −1 2 ≤ HUI . 1 − H −1 2 H2
are Hermitian, and let A = (A2 )1/2 be the positive semidefinite 4. [BD90], [VS93] Suppose A and A square root of A2 . If there exists 0 ≤ δ < 1 such that
x∗ (A)x ≤ δx∗ Ax for all x ∈ Cn , ↑
↑
↑
↑
= λ = 0 or 1 − δ ≤ λ /λ ≤ 1 + δ. then either λ j j j j = D ∗ AD have decompositions 5. [Li99a] Let Hermitian A, A
X 1∗
X 2∗
A[X 1 X 2 ] =
A1 A2
,
X∗1 X∗2
X1 X2 ] = A[
where [X 1 X 2 ] and [ X1 X2 ] are unitary and X 1 , X1 ∈ Cn×k . If η2 =
1 A
2 A
,
min
2 ) ∈σ ( A µ∈σ (A1 ), µ
) > 0, 2 (µ, µ
then
sin (X 1 , X1 )F ≤
(I − D −1 )X 1 2F + (I − D ∗ )X 1 2F . η2
= S ∗(H + H)S, 6. [Li99a] Let A = S ∗ H S be a positive semidefinite Hermitian matrix, perturbed to A $ %1/2 −1/2 (H)H −1/2 . having decompositions, in notation, the same as in Fact 5. Let D = I + H ) > 0, min ζ (µ, µ Assume H is positive definite and H −1/2 (H)H −1/2 2 < 1. If ηζ = 2 ) ∈σ ( A µ∈σ (A1 ), µ
then sin (X 1 , X1 )F ≤
D − D −1 F . ηζ
Examples: 1. [DK90], [EI95] Let A be a real symmetric tridiagonal matrix with zero diagonal and offdiagonal is identical to A except for its offdiagonal entries which change entries b1 , b2 , . . . , bn−1 . Suppose A = D AD, to β1 b1 , β2 b2 , . . . , βn−1 bn−1 , where all βi are real and supposedly close to 1. Then A where D = diag(d1 , d2 , . . . , dn ) with d2k =
β1 β3 · · · β2k−1 , β2 β4 · · · β2k−2
d2k+1 =
β2 β4 · · · β2k . β1 β3 · · · β2k−1
&
−1 I ≤ D 2 ≤ βI , and Fact 2 and Fact 5 apply. Now if all Let β = n−1 j =1 max{β j , 1/β j }. Then β n−1 1 − ε ≤ β j ≤ 1 + ε, then (1 − ε) ≤ β −1 ≤ β ≤ (1 + ε)n−1 . 2. Let A = S H S with S = diag(1, 10, 102 , 103 ), and
⎡
1
⎢ ⎢1 A=⎢ ⎢ ⎣
⎤
1 102
102
102
104 10
4
⎥ ⎥ ⎥, 104 ⎥ ⎦
10
6
⎡
1
⎢ −1 ⎢10 H =⎢ ⎢ ⎣
⎤
10−1 1
10−1
10−1
1 10−1
⎥ ⎥ ⎥. 10−1 ⎥ ⎦
1
1515
Matrix Perturbation Theory
Suppose that each entry Ai j of A is perturbed to Ai j (1+δi j ) with δi j  ≤ ε. Then (H)i j  ≤ εHi j  and thus H2 ≤ 1.2ε. Since H −1 2 ≤ 10/8, Fact 3 implies √ ↑ ↑ ζ (λ j , λ j ) ≤ 1.5ε/ 1 − 1.5ε ≈ 1.5ε.
15.7
Relative Perturbation Theory for Singular Value Problems
Definitions: B ∈ Cm×n is multiplicatively perturbed to B if B = DL∗ B DR for some DL ∈ Cm×m and DR ∈ Cn×n .
Denote the singular values of B and B as
= {σ1 , σ2 , . . . , σmin{m,n} },
SV(B)
SV( B)
= {σ1 , σ2 , . . . , σmin{m,n} }.
B is said to be (highly) graded if it can be scaled as B = G S such that G is “wellbehaved” (i.e., κ2 (G ) is of modest magnitude), where S is a scaling matrix, often diagonal but not required so for the facts below. Interesting cases are when κ2 (G ) κ2 (B). Facts: 1. Let B, B = DL∗ BDR ∈ Cm×n , where DL and DR are nonsingular. σj (a) [EI95] For 1 ≤ j ≤ n, ≤ σ j ≤ σ j DL 2 DR 2 . DL−1 2 DR−1 2 (b) [Li98], [LM99] diag (ζ (σ1 , σ1 ), . . . , ζ (σn , σn )) UI 1 1 ≤ DL∗ − DL−1 UI + DR∗ − DR−1 UI . 2 2 2. [Li99a] Let B, B = DL∗ BDR ∈ Cm×n (m ≥ n) have decompositions
U1∗ U2∗
B1 B[V1 V2 ] = 0
0 , B2
∗ U 1 ∗ U 2
V 1 V 2 ] = B[
B1
0
0
B2
,
1 U 2 ], and [V 1 V 2 ] are unitary, and U1 , U 1 ∈ Cm×k , V1 , V 1 ∈ Cn×k . Set where [U1 U2 ], [V1 V2 ], [U U = (U1 , U1 ), V = (V1 , V1 ). If SV(B1 ) SVext ( B 2 ) = ∅, then
sin U 2F + sin V 2F
≤
1 $ (I − DL∗ )U1 2F + (I − DL−1 )U1 2F η2 +(I − DR∗ )V1 2F + (I − DR−1 )V1 2F
%1/2
,
) over all µ ∈ SV(B1 ) and µ ∈ SVext ( B2 ). where η2 = min 2 (µ, µ be two m × n matrices, where rank(G ) = n, 3. [Li98], [Li99a], [LM99] Let B = GS and B = GS and let G = G − G . Then B = D B, where D = I + (G )G ↑ . Fact 1 and Fact 2 apply with DL = D and DR = I . Note that
1 D − D UI ≤ 1 + 1 − (G )G ↑ 2 ∗
−1
(G )G ↑ UI . 2
1516
Handbook of Linear Algebra
Examples: 1. [BD90], [DK90], [EI95] B is a real bidiagonal matrix with diagonal entries a1 , a2 , . . . , an and offdiagonal (the one above the diagonal) entries are b1 , b2 , . . . , bn−1 . B is the same as B, except for its diagonal entries, which change to α1 a1 , α2 a2 , . . . , αn an , and its offdiagonal entries, which change to β1 b1 , β2 b2 , . . . , βn−1 bn−1 . Then B = DL∗ B DR with
α1 α2 α1 α2 α3 DL = diag α1 , , ,... β1 β1 β2 β1 β1 β2 DR = diag 1, , ,... . α1 α1 α2 Let α =
&n
j =1
max{α j , 1/α j } and β =
&n−1 j =1
,
max{β j , 1/β j }. Then
(αβ)−1 ≤ DL−1 2 DR−1 2
−1
≤ DL 2 DR 2 ≤ αβ,
and Fact 1 and Fact 2 apply. Now if all 1 − ε ≤ αi , β j ≤ 1 + ε, then (1 − ε)2n−1 ≤ (αβ)−1 ≤ (αβ) ≤ (1 + ε)2n−1 . 2. Consider block partitioned matrices
B=
B =
B11
B12
0
B22
B11
0
0
B22
,
=B
I
−1 −B11 B12
0
I
= BDR .
−1 −1 By Fact 2, ζ (σ j , σ j ) ≤ 12 B11 B12 2 . Interesting cases are when B11 B12 2 is tiny enough to be approximates SV(B) well. This situation occurs in computing the SVD treated as zero and so SV( B) of a bidiagonal matrix.
Author Note: Supported in part by the National Science Foundation under Grant No. DMS0510664.
References [BDD00] Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst (Eds). Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide. SIAM, Philadelphia, 2000. [BD90] J. Barlow and J. Demmel. Computing accurate eigensystems of scaled diagonally dominant matrices. SIAM J. Numer. Anal., 27:762–791, 1990. [Bar00] A. Barrlund. The prelative distance is a metric. SIAM J. Matrix Anal. Appl., 21(2):699–702, 2000. [Bau85] H. Baumg¨artel. Analytical Perturbation Theory for Matrices and Operators. Birkh¨auser, Basel, 1985. [Bha96] R. Bhatia. Matrix Analysis. Graduate Texts in Mathematics, Vol. 169. Springer, New York, 1996. [BKL97] R. Bhatia, F. Kittaneh, and R.C. Li. Some inequalities for commutators and an application to spectral variation. II. Lin. Multilin. Alg., 43(13):207–220, 1997. [CG00] F. Chatelin and S. Gratton. On the condition numbers associated with the polar factorization of a matrix. Numer. Lin. Alg. Appl., 7:337–354, 2000. [DK70] C. Davis and W. Kahan. The rotation of eigenvectors by a perturbation. III. SIAM J. Numer. Anal., 7:1–46, 1970. [DK90] J. Demmel and W. Kahan. Accurate singular values of bidiagonal matrices. SIAM J. Sci. Statist. Comput., 11:873–912, 1990. [DV92] J. Demmel and K. Veseli´c. Jacobi’s method is more accurate than QR. SIAM J. Matrix Anal. Appl., 13:1204–1245, 1992.
Matrix Perturbation Theory
1517
[EI95] S.C. Eisenstat and I.C.F. Ipsen. Relative perturbation techniques for singular value problems. SIAM J. Numer. Anal., 32:1972–1988, 1995. [HJ85] R.A. Horn and C.R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985. [KPJ82] W. Kahan, B.N. Parlett, and E. Jiang. Residual bounds on approximate eigensystems of nonnormal matrices. SIAM J. Numer. Anal., 19:470–484, 1982. [Kat70] T. Kato. Perturbation Theory for Linear Operators, 2nd ed., SpringerVerlag, Berlin, 1970. [Kit86] F. Kittaneh. Inequalities for the schatten pnorm. III. Commun. Math. Phys., 104:307–310, 1986. [LL05] ChiKwong Li and RenCang Li. A note on eigenvalues of perturbed Hermitian matrices. Lin. Alg. Appl., 395:183–190, 2005. [LM99] ChiKwong Li and R. Mathias. The Lidskii–Mirsky–Wielandt theorem — additive and multiplicative versions. Numer. Math., 81:377–413, 1999. [Li88] RenCang Li. A converse to the BauerFike type theorem. Lin. Alg. Appl., 109:167–178, 1988. [Li93] RenCang Li. Bounds on perturbations of generalized singular values and of associated subspaces. SIAM J. Matrix Anal. Appl., 14:195–234, 1993. [Li94] RenCang Li. On perturbations of matrix pencils with real spectra. Math. Comp., 62:231–265, 1994. [Li95] RenCang Li. New perturbation bounds for the unitary polar factor. SIAM J. Matrix Anal. Appl., 16:327–332, 1995. [Li97] RenCang Li. Relative perturbation bounds for the unitary polar factor. BIT, 37:67–75, 1997. [Li98] RenCang Li. Relative perturbation theory: I. Eigenvalue and singular value variations. SIAM J. Matrix Anal. Appl., 19:956–982, 1998. [Li99a] RenCang Li. Relative perturbation theory: II. Eigenspace and singular subspace variations. SIAM J. Matrix Anal. Appl., 20:471–492, 1999. [Li99b] RenCang Li. A bound on the solution to a structured Sylvester equation with an application to relative perturbation theory. SIAM J. Matrix Anal. Appl., 21:440–445, 1999. [Li03] RenCang Li. On perturbations of matrix pencils with real spectra, a revisit. Math. Comp., 72:715– 728, 2003. [Li05] RenCang Li. Relative perturbation bounds for positive polar factors of graded matrices. SIAM J. Matrix Anal. Appl., 27:424–433, 2005. [LS02] W. Li and W. Sun. Perturbation bounds for unitary and subunitary polar factors. SIAM J. Matrix Anal. Appl., 23:1183–1193, 2002. [Mat93] R. Mathias. Perturbation bounds for the polar decomposition. SIAM J. Matrix Anal. Appl., 14:588–597, 1993. [Pai84] C.C. Paige. A note on a result of Sun JiGuang: sensitivity of the CS and GSV decompositions. SIAM J. Numer. Anal., 21:186–191, 1984. [Par98] B.N. Parlett. The Symmetric Eigenvalue Problem. SIAM, Philadelphia, 1998. [SS90] G.W. Stewart and JiGuang Sun. Matrix Perturbation Theory. Academic Press, Boston, 1990. [Sun83] JiGuang Sun. Perturbation analysis for the generalized singular value decomposition. SIAM J. Numer. Anal., 20:611–625, 1983. [Sun91] JiGuang Sun. Eigenvalues of Rayleigh quotient matrices. Numer. Math., 59:603–614, 1991. [Sun96] JiGuang Sun. On the variation of the spectrum of a normal matrix. Lin. Alg. Appl., 246:215–223, 1996. [Sun98] JiGuang Sun. Stability and accuracy, perturbation analysis of algebraic eigenproblems. Technical Report UMINF 9807, Department of Computer Science, Ume˚a Univeristy, Sweden, 1998. [Van76] C.F. Van Loan. Generalizing the singular value decomposition. SIAM J. Numer. Anal., 13:76–83, 1976. [VS93] Kreˇsimir Veseli´c and Ivan Slapniˇcar. Floatingpoint perturbations of Hermitian matrices. Lin. Alg. Appl., 195:81–116, 1993.
16 Pseudospectra
Mark Embree Rice University
16.1 Fundamentals of Pseudospectra . . . . . . . . . . . . . . . . . . . . 16.2 Toeplitz Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16.3 Behavior of Functions of Matrices . . . . . . . . . . . . . . . . . . 16.4 Computation of Pseudospectra . . . . . . . . . . . . . . . . . . . . . 16.5 Extensions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
161 165 168 1611 1612 1615
Eigenvalues often provide great insight into the behavior of matrices, precisely explaining, for example, the asymptotic character of functions of matrices like Ak and e t A . Yet many important applications produce matrices whose behavior cannot be explained by eigenvalues alone. In such circumstances further information can be gleaned from broader sets in the complex plane, such as the numerical range (see Chapter 18), the polynomial numerical hull [Nev93], [Gre02], and the subject of this section, pseudospectra. The εpseudospectrum is a subset of the complex plane that always includes the spectrum, but can potentially contain points far from any eigenvalue. Unlike the spectrum, pseudospectra vary with choice of norm and, thus, for a given application one must take care to work in a physically appropriate norm. Unless otherwise noted, throughout this chapter we assume that A ∈ Cn×n is a square matrix with complex entries, and that · denotes a vector space norm and the matrix norm it induces. When speaking of a norm associated with an inner product, we presume that adjoints and normal and unitary matrices are defined with respect to that inner product. All computational examples given here use the 2norm. For further details about theoretical aspects of this subject and the application of pseudospectra to a variety of problems see [TE05]; for applications in control theory, see [HP05]; and for applications in perturbation theory see [CCF96].
16.1
Fundamentals of Pseudospectra
Definitions: The εpseudospectrum of a matrix A ∈ Cn×n , ε > 0, is the set σε (A) = {z ∈ C : z ∈ σ (A + E ) for some E ∈ Cn×n with E < ε}. (This definition is sometimes written with a weak inequality, E ≤ ε; for matrices the difference has little significance, but the strict inequality proves to be convenient for infinitedimensional operators.) If Av − zv < εv for some v = 0, then z is an εpseudoeigenvalue of A with corresponding εpseudoeigenvector v. The resolvent of the matrix A ∈ Cn×n at a point z ∈ σ (A) is the matrix (z I − A)−1 .
161
162
Handbook of Linear Algebra
Facts: [TE05] 1. Equivalent definitions. The set σε (A) can be equivalently defined as: (a) The subset of the complex plane bounded within the 1/ε level set of the norm of the resolvent: σε (A) = {z ∈ C : (z I − A)−1 > ε−1 },
(16.1)
with the convention that (z I − A)−1 = ∞ when z I − A is not invertible, i.e., when z ∈ σ (A). (b) The set of all εpseudoeigenvalues of A: σε (A) = {z ∈ C : Av − zv < ε for some unit vector v ∈ Cn }. 2. For finite ε > 0, σε (A) is a bounded open set in C containing no more than n connected components, and σ (A) ⊂ σε (A). Each connected component must contain at least one eigenvalue of A. 3. Pseudospectral mapping theorems. (a) For any α, γ ∈ C with γ = 0, σε (α I + γ A) = α + σε/γ (A). (b) [Lui03] Suppose f is a function analytic on σε (A) for some ε > 0, and define γ (ε) = supE ≤ε f (A + E ) − f (A). Then f (σε (A)) ⊆ σγ (ε) ( f (A)). See [Lui03] for several more inclusions of this type. 4. Stability of pseudospectra. For any ε > 0 and E such that E < ε, σε−E (A) ⊆ σε (A + E ) ⊆ σε+E (A). 5. Properties of pseudospectra as ε → 0. (a) If λ is a eigenvalue of A with index k, then there exist constants d and C such that (z I − A)−1 ≤ C z − λ−k for all z such that z − λ < d. (b) Any two matrices with the same εpseudospectra for all ε > 0 have the same minimal polynomial. 6. Suppose · is the natural norm in an inner product space. (a) The matrix A is normal (see Section 7.2) if and only if σε (A) equals the union of open εballs about each eigenvalue for all ε > 0. (b) For any A ∈ Cn×n , σε (A∗ ) = σε (A). 7. [BLO03] Suppose · is the natural norm in an inner product space. The point z = x + iy, x, y ∈ R, is on the boundary of σε (A) provided iy is an eigenvalue of the Hamiltonian matrix
x I − A∗
εI
−ε I
A − xI
.
This fact implies that the boundary of σε (A) cannot contain a segment of any vertical line or, substituting e i θ A for A, a segment of any straight line. 8. The following results provide lower and upper bounds on the εpseudospectrum; δ denotes the open unit ball of radius δ in C, and κ(X) = XX −1 . (a) For all ε > 0, σ (A) + ε ⊆ σε (A). (b) For any nonsingular S ∈ Cn×n and all ε > 0, σε/κ(S) (S AS −1 ) ⊆ σε (A) ⊆ σεκ(S) (S AS −1 ). (c) (Bauer–Fike Theorems [BF60], [Dem97]) Let · denote a monotone norm. If A is diagonalizable, A = V V −1 , then for all ε > 0, σε (A) ⊆ σ (A) + εκ(V ) .
163
Pseudospectra
If A ∈ Cn×n has n distinct eigenvalues λ1 , . . . , λn , then for all ε > 0, σε (A) ⊆ ∪ Nj=1 (λ j + εnκ(λ j ) ), v∗j v j , where where κ(λ j ) here denotes the eigenvalue condition number of λ j (i.e., κ(λ j ) = 1/ v j and v j are unitlength left and right eigenvectors of A corresponding to the eigenvalue λ j ). (d) If · is the natural norm in an inner product space, then for any ε > 0, σε (A) ⊆ W(A) + ε , where W(·) denotes the numerical range (Chapter 18). (e) If · is the natural norm in an inner product space and U is a unitary matrix, then σε (U ∗ AU ) = σε (A) for all ε > 0. (f) If · is unitarily invariant, then σε (A) ⊆ σ (A) + ε+dep(A) , where dep(·) denotes Henrici’s departure from normality (i.e., the norm of the offdiagonal part of the triangular factor in a Schur decomposition, minimized over all such decompositions). (g) (Gerˇsgorin Theorem for pseudospectra [ET01]) Using the induced matrix 2norm, for any ε > 0, σε (A) ⊆ ∪nj=1 (a j j + r j +ε√n ),
where r j = nk=1,k= j a j k . 9. The following results bound σε (A) by pseudospectra of smaller matrices. Here · is the natural norm in an inner product space. (a) [GL02] If A has the blocktriangular form
B A= D
C , E
then σε (A) ⊆ σδ (B) ∪ σδ (E ),
where δ = (ε + D) 1 + C /(ε + D). Provided ε > D, σγ (B) ∪ σγ (E ) ⊆ σε (A), where γ = ε − D. ∈ Cn×m is (b) If the columns of V ∈ Cn×m form a basis for an invariant subspace of A, and V ∗ V = I , then σε (V ∗ AV ) ⊆ σε (A). In particular, if the columns of U form an such that V orthonormal basis for an invariant subspace of A, then σε (U ∗ AU ) ⊆ σε (A).
(c) [ET01] If U ∈ Cn×m has orthonormal columns and AU = U H + R, then σ (H) ⊆ σε (A) for ε = R. (d) (Arnoldi factorization) If AU = [U u]H, where H ∈ C(m+1)×m is an upper Hessenberg matrix (h j k = 0 if j > k + 1) and the columns of [U u] ∈ Cn×(m+1) are orthonormal, then σε (H) ⊆ σε (A). (The εpseudospectrum of a rectangular matrix is defined in section 16.5 below.) Examples: The plots of pseudospectra that follow show the boundary of σε (A) for various values of ε, with the smallest values of ε corresponding to those boundaries closest to the eigenvalues. In all cases, · is the 2norm. 1. The following three matrices all have the same eigenvalues, σ (A) = {1, ± i}, yet their pseudospectra, shown in Figure 16.1, differ considerably: ⎡
⎤
0 −1 10 ⎢ ⎥ 0 5 ⎦, ⎣1 0 0 1
⎡
⎤
0 −1 10 ⎢ ⎥ 0 5 i⎦ , ⎣1 0 0 1
⎡
⎤
2 −5 10 ⎢ ⎥ ⎣1 −2 5 i ⎦ . 0 0 1
164
Handbook of Linear Algebra
2
2
2
1
1
1
0
0
0
−1
−1
−1
−2 −1
0
1
−2 −1
2
0
1
−2 −1
2
0
1
2
FIGURE 16.1 Spectra (solid dots) and εpseudospectra of the three matrices of Example 1, each with σ (A) = {1, i, −i}; ε = 10−1 , 10−1.5 , 10−2 .
2. [RT92] For any matrix that is zero everywhere except the first superdiagonal, σε (A) consists of an open disk centered at zero whose radius depends on ε for all ε > 0. Figure 16.2 shows pseudospectra for two such examples of dimension n = 50: ⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣
0
1 0
1 .. .
..
. 0
⎤
⎡
⎥ ⎥ ⎥ ⎥, ⎥ ⎥ 1⎦
⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣
0
3 0
⎤
3/2 .. .
0
..
. 0
⎥ ⎥ ⎥ ⎥. ⎥ ⎥ 3/(n − 1)⎦
0
Though these matrices have the same minimal polynomial, the pseudospectra differ considerably. 3. It is evident from Figure 16.1 that the components of σε (A) need not be convex. In fact, they need not be simply connected; that is, σε (A) can have “holes.” This is illustrated in Figure 16.3 for the following examples, a circulant (hence, normal) matrix and a defective matrix constructed
1
1
0
0
−1
−1 −1
FIGURE 16.2
0
1
−1
0
1
Spectra (solid dots) and εpseudospectra of the matrices in Example 2 for ε = 10−1 , 10−2 , . . . , 10−20 .
165
Pseudospectra 4
1 2
0
0
−2 −1
−1
0
−4
1
−4
−2
0
2
FIGURE 16.3 Spectra (solid dots) and εpseudospectra (gray regions) of the matrices in Example 3 for ε = .5 (left) and ε = 10−3 (right). Both plotted pseudospectra are doubly connected.
by Demmel [Dem87]: ⎡
0 ⎢0 ⎢ ⎢0 ⎢ ⎢ ⎢0 ⎢ ⎢0 ⎢ ⎣0 1
16.2
1 0 0 0 0 0 0
0 1 0 0 0 0 0
0 0 1 0 0 0 0
0 0 0 1 0 0 0
0 0 0 0 1 0 0
⎤
0 0⎥ ⎥ 0⎥ ⎥ ⎥ 0⎥ , ⎥ 0⎥ ⎥ 1⎦ 0
⎡
⎤
−1 −100 −10000 ⎢ ⎥ −1 −100⎦ . ⎣ 0 0 0 −1
Toeplitz Matrices
Given the rich variety of important applications in which Toeplitz matrices arise, we are fortunate that so much is now understood about their spectral properties. Nonnormal Toeplitz matrices are prominent examples of matrices whose eigenvalues provide only limited insight into system behavior. The spectra of infinitedimensional Toeplitz matrices are easily characterized, and one would hope to use these results to approximate the spectra of more recalcitrant large, finitedimensional examples. For generic problems, the spectra of finitedimensional Toeplitz matrices do not converge to the spectrum of the corresponding infinitedimensional Toeplitz operator. However, the εpseudospectra do converge in the n → ∞ limit for all ε > 0, and, moreover, for banded Toeplitz matrices this convergence is especially striking as the resolvent grows exponentially with n in certain regions. Comprehensive references addressing the pseudospectra of Toeplitz matrices include the books [BS99] and [BG05]. For a generalization of these results to “twisted Toeplitz matrices,” where the entries on each diagonal are samples of a smoothly varying function, see [TC04]. Definitions: A Toeplitz operator is a singly infinite matrix with constant entries on each diagonal: ⎡
a0
⎢ ⎢ ⎢a 1 ⎢ ⎢ T =⎢ ⎢a 2 ⎢ ⎢ ⎢a 3 ⎣.
..
for a0 , a±1 , a±2 , . . . ∈ C.
a−1
a−2
a−3
a0
a−1
a−2
a1
a0
a−1
a2 .. .
a1 .. .
a0 .. .
⎤
··· .. ⎥ .⎥ ⎥ ⎥ .. ⎥ .⎥ ⎥ .. ⎥ .⎥ ⎥ ⎦ .. .
166
Handbook of Linear Algebra
Provided it is well defined for all z on the unit circle T in the complex plane, the function k a(z) = ∞ k=−∞ a k z is called the symbol of T . The set a(T) ⊂ C is called the symbol curve. Given a symbol a, the corresponding ndimensional Toeplitz matrix takes the form ⎡ ⎢ ⎢ ⎢ ⎢ Tn = ⎢ ⎢ ⎢ ⎢ ⎣
a0
a−1
a−2
a1
a0
a−1
a2 .. . an−1
a1 .. . ···
a0 .. . a2
⎤
··· .. . .. . .. . a1
a1−n .. ⎥ . ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ a−1 ⎦
a−2 ⎥ ∈ C
n×n
.
a0
k For a symbol a(z) = ∞ k=−∞ a k z , the set {Tn }n≥1 is called a family of Toeplitz matrices. A family of Toeplitz matrices with symbol a is banded if there exists some m ≥ 0 such that a±k = 0 for all k ≥ m.
Facts: 1. [B¨ot94] (Convergence of pseudospectra) Let · denote any p norm. If the symbol a is a continuous function on T, then lim σε (Tn ) → σε (T )
n→∞
as n → ∞, where T is the infinitedimensional Toeplitz operator with symbol a acting on the space p , and its εpseudospectrum is a natural generalization of the first definition in section 16.1. The convergence of sets is understood in the Hausdorff sense [Hau91, p. 167], i.e., the distance between bounded sets 1 , 2 ⊆ C is given by
d( 1 , 2 ) = max
sup inf s 1 − s 2 , sup inf s 2 − s 1  .
s 1 ∈ 1 s 2 ∈ 2
s 2 ∈ 2 s 1 ∈ 1
2. [BS99] Provided the symbol a is a continuous function on T, the spectrum σ (T ) of the infinite dimensional Toeplitz operator T on p comprises a(T) together with all points z ∈ C \ a(T) that a(T) encloses with winding number 1 2π i
a(T)
1 dζ ζ −z
nonzero. From the previous fact, we deduce that (z I − Tn )−1 → ∞ as n → ∞ if z ∈ σ (T ) and that, for any fixed ε > 0, there exists some N ≥ 1 such that σ (T ) ⊆ σε (Tn ) for all n ≥ N. 3. [RT92] (Exponential growth of the resolvent) If the family of Toeplitz matrices Tn is banded, then for any fixed z ∈ C such that the winding number of a(T) with respect to z is nonzero, there exists some γ > 1 and N ≥ 1 such that (z I − Tn )−1 ≥ γ n for all n ≥ N. Examples: 1. Consider the family of Toeplitz matrices with symbol a(t) = t −
1 2
−
1 −1 t . 16
For any dimension n, the spectrum σ (Tn (a)) is contained in the line segment [− 12 − 12 i, − 12 + 12 i] in the complex plane. This symbol was selected so that σ (A) falls in both the left halfplane and the unit disk, while even for relatively small values of ε, σε (A) contains both points in the right halfplane and points outside the unit disk for all but the smallest values of n; see Figure 16.4 for n = 50.
167
Pseudospectra
1.5
1
0.5
0
−0.5
−1
−1.5 −2
−1.5
−1
−0.5
0
0.5
1
1.5
FIGURE 16.4 Spectrum (solid dots, so close they appear to be a thick line segment with real part −1/2) and εpseudospectra of the Toeplitz matrix T50 from Example 1; ε = 10−1 , 10−3 , . . . , 10−15 . The dashed lines show the unit circle and the imaginary axis.
2. Pseudospectra of matrices with the symbols a(t) = i t 4 + t 2 + 2t + 5t −2 + i t −5 and a(t) = 3it 4 + t + t −1 + 3it −4 are shown in Figure 16.5.
10
8
5
4
0
0
−5
−4
−10 −10
−5
0
5
10
−8
−4
0
4
8
FIGURE 16.5 Spectra (solid dots) and εpseudospectra of Toeplitz matrices from Example 2 with the first symbol on the left (n = 100) and the second symbol on the right (n = 200), both with ε = 100 , 10−2 , . . . , 10−8 . In each plot, the gray region is the spectrum of the underlying infinite dimensional Toeplitz operator.
168
Handbook of Linear Algebra
50
50
50
0
0
0
n = 40
−50 −100
−50
n = 80
−50 0
−100
−50
n = 160
−50 0
−100
−50
0
FIGURE 16.6 Spectra (solid dots) and εpseudospectra of Toeplitz matrices for the discretization of a convection– diffusion operator described in Application 1 with ν = 1/50 and three values of n; ε = 10−1 , 10−2 , . . . , 10−6 . The gray dots and lines in each plot show eigenvalues and pseudospectra of the differential operator to which the matrix spectra and pseudospectra converge.
Applications: 1. [RT94] Discretization of the onedimensional convectiondiffusion equation νu
(x) + u (x) = f (x),
u(0) = u(1) = 0
for x ∈ [0, 1] with secondorder centered finite differences on a uniform grid with spacing h = 1/(n + 1) between grid points results in an n × n Toeplitz matrix with symbol
a(t) =
1 ν + t− h2 2h
2ν h2
+
1 −1 ν − t . h2 2h
On the rightmost part of the spectrum, both the eigenvalues and pseudospectra of the discretization matrix converge to those of the underlying differential operator Lu = νu
+ u whose domain is the space of functions that are squareintegrable over [0, 1] and satisfy the boundary conditions u(0) = u(1) = 0; see Figure 16.6.
16.3
Behavior of Functions of Matrices
In practice, pseudospectra are most often used to investigate the behavior of a function of a matrix. Does the solution x(t) = e t A x(0) or xk = Ak x0 of the linear dynamical system x (t) = Ax(t) or xk+1 = Axk grow or decay as t, k → ∞? Eigenvalues provide an answer: If σ (A) lies in the open unit disk or left halfplane, the solution must eventually decay. However, the results described in this section show that if εpseudoeigenvalues of A extend well beyond the unit disk or left halfplane for small values of ε, then the system must exhibit transient growth for some initial states. While such growth is notable even for purely linear problems, it should spark special caution when observed for a dynamical system that arises from the linearization of a nonlinear system about a steady state based on the assumption that disturbances from that state are small in magnitude. This reasoning has been applied extensively in recent years in fluid dynamics; see, e.g., [TTRD93]. Definitions: The εpseudospectral abscissa of A measures the rightmost extent of σε (A): αε (A) = supz∈σε (A) Re z. The εpseudospectral radius of A measures the maximum magnitude in σε (A): ρε (A) = supz∈σε (A) z.
169
Pseudospectra
Facts: [TE05, §§14–19] 1. For ε > 0, supt∈R,t≥0 e t A ≥ αε (A)/ε. 2. For ε > 0, supk∈N,k≥0 Ak ≥ (ρε (A) − 1)/ε. 3. For any function f that is analytic on the spectrum of A, f (A) ≥ max  f (λ). λ∈σ (A)
Equality holds when · is the natural norm in an inner product space in which A is normal. 4. In the special case of matrix exponentials e t A and matrix powers Ak , this last fact implies that e t A ≥ e tα(A) ,
Ak ≥ ρ(A)k
for all t ≥ 0 and integers k ≥ 0, where α(A) = maxλ∈σ (A) Re λ is the spectral abscissa and ρ(A) = maxλ∈σ (A) λ is the spectral radius. 5. Let ε be a finite union of Jordan curves containing σε (A) in their collective interior for some ε > 0, and suppose f is a function analytic on ε and its interior. Then f (A) ≤
Lε max  f (z), 2π ε z∈ε
where L ε denotes the arclength of ε . 6. In the special case of matrix exponentials e t A and matrix powers Ak , this last fact implies that for all t ≥ 0 and integers k ≥ 0, e t A ≤
L ε tαε (A) e , 2π ε
Ak ≤ ρε (A)k+1 /ε.
In typical cases, larger values of ε give superior bounds for small t and k, while smaller values of ε yield more descriptive bounds for larger t and k; see Figure 16.7. 7. Suppose z ∈ C \ σ (A) with a ≡ Re z and ε ≡ 1/(z I − A)−1 . Provided a > ε, then for any fixed τ > 0, sup e t A ≥
0
ae τ a . a + ε(e τ a − 1)
8. Suppose z ∈ C \ σ (A) with a ≡ Re z and ε ≡ 1/(z I − A)−1 , and that e τ A ≤ M for all τ > 0 with M ≥ a/ε. Then for any t > 0, e t A ≥ e ta (1 − εM/a) + εM/a. 9. Suppose z ∈ C \ σ (A) with r ≡ z and ε ≡ 1/(z I − A)−1 . Provided r > 1 + ε, then for any fixed integer κ ≥ 1, sup Ak ≥ 0
r κ (r − 1 − ε) + εr κ−1 . (r − 1 − ε) + εr κ−1
10. Suppose z ∈ C \ σ (A) with r ≡ z and ε ≡ 1/(z I − A)−1 , and that Aκ ≤ M for all integers κ ≥ 0 with M ≥ (r − 1)/ε. Then for any integer k ≥ 0, Ak ≥ r k (r − 1 − εM) + εM. 11. For any A ∈ Cn×n , Ak < e (k + 1) sup ε>0
ρε (A) − 1 . ε
1610
Handbook of Linear Algebra
12. (Kreiss Matrix Theorem) For any A ∈ Cn×n , sup ε>0
ρε (A) − 1 ρε (A) − 1 ≤ sup Ak ≤ e n sup . ε ε ε>0 k≥0
13. [GT93] There exist matrices A and B such that, in the induced 2norm, σε (A) = σε (B) for all ε > 0, yet f (A)2 = f (B)2 for some polynomial f ; see Example 2. That is, even if the 2norm of the resolvents of A and B are identical for all z ∈ C, the norms of other matrix functions in A and B need not agree. (Curiously, if the Frobenius norm of the resolvents of A and B agree for all z ∈ C, then f (A) F = f (B) F for all polynomials f .)
15
10 15
Ak
10
etA 10 10
10
10
5
5
10
−5
−15
0
50
100
150
t
10
200
−5
−15
0
50
100
150
200
k
FIGURE 16.7 The functions e t A and Ak exhibit transient growth before exponential decay for the Toeplitz matrix of dimension n = 50, whose pseudospectra were illustrated in Figure 16.4. The horizontal dashed lines show the lower bounds on maximal growth given in Facts 1 and 2, while the lower dashed lines show the lower bounds of Fact 4. The gray lines show the upper bounds in Fact 6 for ε = 10−1 , 10−2 , . . . , 10−28 (ordered by decreasing slope).
Examples: 1. Consider the tridiagonal Toeplitz matrix of dimension n = 50 from Example 1 of the last section, whose pseudospectra were illustrated in Figure 16.4. Since all the eigenvalues of this matrix are contained in both the left halfplane and the unit disk, e t A → 0 as t → ∞ and Ak → 0 as k → ∞. However, σε (A) extends far into the right halfplane and beyond the unit disk even for ε as small as 10−7 . Consequently, the lower bounds in Facts 1 and 2 guarantee that e t A and Ak exhibit transient growth before their eventual decay; results such as Fact 6 limit the extent of the transient growth. These bounds are illustrated in Figure 16.7. (For a similar example involving a different matrix, see the “Transient” demonstration in [Wri02b].) 2. [GT93] The matrices ⎡
0
⎢ ⎢0 ⎢ ⎢ A = ⎢0 ⎢ ⎢0 ⎣
⎤
1
0
0
0
0
1
0
0 ⎥ ⎥
0
0
0
0
0
⎥ ⎥
0 ⎥, √ ⎥ 2⎥ 0 ⎦
⎡
0
⎢ ⎢0 ⎢ ⎢ B = ⎢0 ⎢ ⎢0 ⎣
0
0
0
0
1
0
0⎥ ⎥
0
0
0
0
0
0
0
0
0
⎥
⎥ ⎥ 0⎥ ⎦
0⎥ ,
0 √ have the same 2norm εpseudospectra for all ε > 0. However, A2 = 2 > 1 = B2 . 0
0
0
0
0
0
⎤
1
1611
Pseudospectra
Applications: 1. Fact 5 leads to a convergence result for the GMRES algorithm (Chapter 41), which constructs estimates xk to the solution x of the linear system Ax = b. The kth residual rk = b − Axk is bounded by rk 2 Lε ≤ min max  p(z), r0 2 2π ε p∈C[z;k] z∈ε p(0)=1
where C[z; k] denotes the set of polynomials of degree k or less, ε is a finite union of Jordan curves containing σε (A) in their collective interior for some ε > 0, and L ε is the arclength of ε . 2. For further examples of the use of pseudospectra to analyze matrix iterations and the stability of discretizations of differential equations, see [TE05, §§24–34].
16.4
Computation of Pseudospectra
This section describes techniques for computing and approximating pseudospectra, focusing primarily on the induced matrix 2norm, the case most studied in the literature and for which very satisfactory algorithms exist. For further details, see [Tre99], [TE05, §§39–44], or [Wri02a]. Facts: [TE05] 1. There are two general approaches to computing pseudospectra, both based on the expression for σε (A) in Fact 1(a) of Section 16.1. The most widelyused method computes the resolvent norm, (z I − A)−1 2 , on a grid of points in the complex plane and submits the results to a contourplotting program; the second approach uses a curvetracing algorithm to track the ε −1 level curve of the resolvent norm ([Br¨u96]). Both approaches exploit the fact that the 2norm of the resolvent is the reciprocal of the minimum singular value of z I − A. A third approach, based on the characterization of σε (A) as the set of all εpseudoeigenvalues, approximates σε (A) by the union of the eigenvalues of A + E for randomly generated E ∈ Cn×n with E < ε. 2. For dense matrices A, the computation of the minimum singular value of z I − A requires O(n3 ) floating point operations for each distinct value of z. Hence, the contourplotting approach to computing pseudospectra based on a grid of m × m points in the complex plane, implemented via the most naive method, requires O(m2 n3 ) operations. 3. [Lui97] Improved efficiency is obtained through the use of iterative methods for computing the minimum singular value of the resolvent. The most effective methods (inverse iteration or the inverse Lanczos method) require matrixvector products of the form (z I − A)−1 x at each iteration. For dense A, this approach requires O(n3 ) operations per grid point. One can decrease this labor to O(n2 ) by first reducing A to Schur form, A = U TU ∗ , and then noting that (z I − A)−1 2 = (z I − T )−1 2 . Vectors of the form (z I − T )−1 x can be computed in O(n2 ) operations since T is triangular. As the inverse iteration and inverse Lanczos methods typically converge to the minimum singular value in a small number of iterations at each grid point, the total complexity of the contourplotting approach is O(n3 + m2 n2 ). 4. For largescale problems (say, n > 1000), the cost of preliminary triangularization can be prohibitive. Several alternatives are available: Use sparse direct or iterative methods to compute (z I − A)−1 x at each grid point, or reduce the dimension of the problem by replacing A with a smaller matrix, such as the (m + 1) × m upper Hessenberg matrix in an Arnoldi decomposition, or U ∗ AU , where the columns of U ∈ Cn×m form an orthonormal basis for an invariant subspace corresponding to physically relevant eigenvalues, with m n. As per results stated in Fact 9 of Section 16.1, the pseudospectra of these smaller matrices provide a lower bounds on the pseudospectra of A.
1612
Handbook of Linear Algebra
5. [Wri02b] EigTool is a freely available MATLAB package based on a highlyefficient, robust implementation of the gridbased method with preliminary triangularization and inverse Lanczos iteration. For largescale problems, EigTool uses ARPACK (Chapter 76), to compute a subspace that includes an invariant subspace associated with eigenvalues in a given region of the complex plane. The EigTool software, which was used to compute the pseudospectra shown throughout this section, can be downloaded from http://www.comlab.ox.ac.uk/pseudospectra/eigtool. 6. Curvetracing algorithms can also benefit from iterative computation of the resolvent norm, though the standard implementation requires both left and right singular vectors associated with the minimal singular value ([Br¨u96]). Robust implementations require measures to ensure that all components of σε (A) have been located and to handle cusps in the boundary; see, e.g., [BG01]. 7. Software for computing 2norm pseudospectra can be used to compute pseudospectra in any norm induced by an inner product. Suppose the inner product of x and y is given by (x, y)W = (Wx, y), where (·, ·) denotes the Euclidean inner product and W = L L ∗ , where L ∗ denotes the conjugate transpose of L . Then the Wnorm pseudospectra of A are equal to the 2norm pseudospectra of L ∗ AL −∗ . 8. For norms not associated with inner products, all known gridbased algorithms require O(n3 ) operations per grid point, typically involving the construction of the resolvent (z I − A)−1 . Higham and Tisseur ([HT00]) have proposed an efficient approach for approximating 1norm pseudospectra using a norm estimator. 9. [BLO03],[MO05] There exist efficient algorithms, based on Fact 7 of section 16.1, for computing the 2norm pseudospectral radius and abscissa without first determining the entire pseudospectrum.
16.5
Extensions
The previous sections address the standard formulation of the εpseudospectrum, the union of all eigenvalues of A + E for a square matrix A and general complex perturbations E , with E < ε. Natural modifications restrict the structure of E or adapt the definition to more general eigenvalue problems. The former topic has attracted considerable attention in the control theory literature and is presented in detail in [HP05]. Definitions: The spectral value set, or structured εpseudospectrum, of the matrix triplet ( A, B, C ), A ∈ Cn×n , B ∈ Cn×m , C ∈ C p×n , for ε > 0 is the set σε (A; B, C ) = {z ∈ C : z ∈ σ (A + B E C ) for some E ∈ C m× p with E < ε}. The real structured εpseudospectrum of A ∈ Rn×n is the set σεR (A) = {z ∈ σ (A + E ) : E ∈ Rn×n , E < ε}. The εpseudospectrum of a rectangular matrix A ∈ Cn×m (n ≥ m) for ε > 0 is the set σε (A) = {z ∈ C : (A + E )x = zx for some x = 0 and E < ε}. [Ruh95] For A ∈ Cn×n and invertible B ∈ Cn×n , the εpseudospectrum of the matrix pencil A − λB (or generalized eigenvalue problem Ax = λBx) for ε > 0 is the set σε (A, B) = σε (B −1 A).
1613
Pseudospectra
[TH01] The εpseudospectrum of the matrix polynomial P (λ) (or polynomial eigenvalue problem P (λ)x = 0), where P (λ) = λ p A p + λ p−1 A p−1 + · · · + A0 and ε > 0, is the set σε (P ) = {z ∈ C : z ∈ σ (P + E ) for some E (λ) = λ p E p + · · · + E 0 , E j ≤ εα j ,
j = 0, . . . , p},
for values α0 , . . . , α p . For most applications, one would either take α j = 1 for all j , or α j = A j . (This definition differs considerably from the one given for the pseudospectrum of a matrix pencil. In particular, when p = 1 the present definition does not reduce to the above definition for the pencil; see Fact 6 below.) Facts: 1. [HP92, HK93] The above definition of the spectral value set σε (A; B, C ) is equivalent to σε (A; B, C ) = {z ∈ C : C (z I − A)−1 B > ε−1 }. 2. [Kar03] The above definition of the real structured εpseudospectrum σεR (A) is equivalent to σεR (A) = {z ∈ C : r (A, z) < ε}, where
−1
r (A, z)
= inf σ2 γ ∈(0,1)
Re (z I − A)−1 −1 γ Im (z I − A)−1
−γ Im (z I − A)−1 Re (z I − A)−1
and σ2 (·) denotes the second largest singular value. From this formulation, one can derive algorithms for computing σεR (A) akin to those used for computing σε (A). 3. The definition of σεR (A) suggests similar formulations that impose different restrictions upon E , such as a sparsity pattern, Toeplitz structure, nonnegativity or stochasticity of A + E , etc. Such structured pseudospectra are often difficult to compute or approximate. 4. [WT02] The above definition of the εpseudospectrum σε (A) of a rectangular matrix A ∈ Cn×m , n ≥ m, is equivalent to σε (A) = {z ∈ C : (z I − A)† > ε−1 }, where (·)† denotes the Moore–Penrose pseudoinverse and I denotes the n × m matrix that has the m × m identity in the first m rows and is zero elsewhere. 5. The following facts apply to the εpseudospectrum of a rectangular matrix A ∈ Cm×n , m ≥ n. (a) [WT02] It is possible that σε (A) = ∅. (b) [BLO04] For A ∈ Cm×n , m ≥ n, and any ε > 0, the set σε (A) contains no more than 2n2 −n+1 connected components. 6. [TE05] Alternative definitions have been proposed for the pseudospectrum of the matrix pencil A − λB. The definition presented above has the advantage that the pseudospectrum is invariant to premultiplication of the pencil by a nonsingular matrix, which is consistent with the fact that premultiplication of the differential equation Bx = Ax does not affect the solution x. Here are two alternative definitions, neither of which are equivalent to the previous definition. (a) [Rie94] If B is Hermitian positive definite with Cholesky factorization B = L L ∗ , then the pseudospectrum of the pencil can be defined in terms of the standard pseudospectrum of a transformed problem: σε (A, B) = σε (L −1 AL −∗ ).
1614
Handbook of Linear Algebra 4
4
2
2
0
0
−2
−2
−4 −6
−4
−2
0
−4 −6
2
−4
−2
0
2
FIGURE 16.8 Spectrum (solid dot) and real structured εpseudospectra σεR (A) (left) and unstructured εpseudospectra σε (A) of the second matrix of Example 3 in section 16.1 for ε = 10−3 , 10−4 .
(b) [FGNT96, TH01] The following definition is more appropriate for the study of eigenvalue perturbations:
σε (A, B) = {z ∈ C : (A + E 0 )x = z(B + E 1 )x for some x = 0 and E 0 , E 1 with E 0 < εα0 , E 1 < εα1 }, where generally either α j = 1 for j = 0, 1, or α0 = A and α1 = B. This is a special case of the definition given above for the pseudospectrum of a matrix polynomial. 7. [TH01] The above definition of the εpseudospectrum of a matrix polynomial, σε (P ), is equivalent to σε (P ) = {z ∈ C : P (z)−1 > 1/(εφ(z))}, where φ(z) =
p
j =0
αk z k for the same values of α0 , . . . , α p used in the earlier definition.
2
2
2
1
1
1
0
0
0
−1
−1
−1
−2 −1
0
1
2
−2 −1
0
1
2
−2 −1
0
1
2
FIGURE 16.9 εpseudospectra of the rectangular matrix in Example 2 with δ = 0.02 (left), δ = 0.01 (middle), δ = 0.005 (right), and ε = 10−1 , 10−1.5 , and 10−2 . Note that in the first two plots, σε (A) = ∅ for ε = 10−2 .
1615
Pseudospectra
Examples: 1. Figure 16.8 compares real structured εpseudospectra σεR (A) to the (unstructured) pseudospectra σε (A) for the second matrix in Example 3 of Section 16.1; cf. [TE05, Fig. 50.3]. 2. Figure 16.9 shows pseudospectra of the rectangular matrix ⎡
2
⎢ ⎢1 A=⎢ ⎢0 ⎣
δ
⎤
−5
10
−2
5i ⎥
0
⎥ ⎥, 1⎥ ⎦
δ
δ
which is the third matrix in Example 1 of Section 16.1, but with an extra row appended.
References [BF60] F.L. Bauer and C.T. Fike. Norms and exclusion theorems. Numer. Math., 2:137–141, 1960. [BG01] C. Bekas and E. Gallopoulos. Cobra: Parallel path following for computing the matrix pseudospectrum. Parallel Comp., 27:1879–1896, 2001. [BG05] A. B¨ottcher and S.M. Grudsky. Spectral Properties of Banded Toeplitz Matrices. SIAM, Philadelphia, 2005. [BLO03] J.V. Burke, A.S. Lewis, and M.L. Overton. Robust stability and a crisscross algorithm for pseudospectra. IMA J. Numer. Anal., 23:359–375, 2003. [BLO04] J.V. Burke, A.S. Lewis, and M.L. Overton. Pseudospectral components and the distance to uncontrollability. SIAM J. Matrix Anal. Appl., 26:350–361, 2004. [Bot94] Albrecht B¨ottcher. Pseudospectra and singular values of large convolution operators. J. Int. Eqs. Appl., 6:267–301, 1994. [Bru96] Martin Br¨uhl. A curve tracing algorithm for computing the pseudospectrum. BIT, 36:441–454, 1996. [BS99] Albrecht B¨ottcher and Bernd Silbermann. Introduction to Large Truncated Toeplitz Matrices. SpringerVerlag, New York, 1999. [CCF96] Franc¸oise ChaitinChatelin and Val´erie Frayss´e. Lectures on Finite Precision Computations. SIAM, Philadelphia, 1996. [Dem87] James W. Demmel. A counterexample for two conjectures about stability. IEEE Trans. Auto. Control, AC32:340–343, 1987. [Dem97] James W. Demmel. Applied Numerical Linear Algebra. SIAM, Philadelphia, 1997. [ET01] Mark Embree and Lloyd N. Trefethen. Generalizing eigenvalue theorems to pseudospectra theorems. SIAM J. Sci. Comp., 23:583–590, 2001. [FGNT96] Val´erie Frayss´e, Michel Gueury, Frank Nicoud, and Vincent Toumazou. Spectral portraits for matrix pencils. Technical Report TR/PA/96/19, CERFACS, Toulouse, August 1996. [GL02] Laurence Grammont and Alain Largillier. On εspectra and stability radii. J. Comp. Appl. Math., 147:453–469, 2002. [Gre02] Anne Greenbaum. Generalizations of the field of values useful in the study of polynomial functions of a matrix. Lin. Alg. Appl., 347:233–249, 2002. [GT93] Anne Greenbaum and Lloyd N. Trefethen. Do the pseudospectra of a matrix determine its behavior? Technical Report TR 931371, Computer Science Department, Cornell University, Ithaca, NY, August 1993. [Hau91] Felix Hausdorff. Set Theory 4th ed. Chelsea, New York, 1991. [HK93] D. Hinrichsen and B. Kelb. Spectral value sets: A graphical tool for robustness analysis. Sys. Control Lett., 21:127–136, 1993. [HP92] D. Hinrichsen and A.J. Pritchard. On spectral variations under bounded real matrix perturbations. Numer. Math., 60:509–524, 1992.
1616
Handbook of Linear Algebra
[HP05] Diederich Hinrichsen and Anthony J. Pritchard. Mathematical Systems Theory I. SpringerVerlag, Berlin, 2005. [HT00] Nicholas J. Higham and Franc¸oise Tisseur. A block algorithm for matrix 1norm estimation, with an application to 1norm pseudospectra. SIAM J. Matrix Anal. Appl., 21:1185–1201, 2000. [Kar03] Michael Karow. Geometry of Spectral Value Sets. Ph.D. thesis, Universit¨at Bremen, Germany, 2003. [Lui97] S.H. Lui. Computation of pseudospectra by continuation. SIAM J. Sci. Comp., 18:565–573, 1997. [Lui03] S.H. Lui. A pseudospectral mapping theorem. Math. Comp., 72:1841–1854, 2003. [MO05] Emre Mengi and Michael L. Overton. Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix. IMA J. Numer. Anal., 25:648–669, 2005. [Nev93] Olavi Nevanlinna. Convergence of Iterations for Linear Equations. Birkh¨auser, Basel, Germany, 1993. [Rie94] Kurt S. Riedel. Generalized epsilonpseudospectra. SIAM J. Num. Anal., 31:1219–1225, 1994. [RT92] Lothar Reichel and Lloyd N. Trefethen. Eigenvalues and pseudoeigenvalues of Toeplitz matrices. Lin. Alg. Appl., 162–164:153–185, 1992. [RT94] Satish C. Reddy and Lloyd N. Trefethen. Pseudospectra of the convectiondiffusion operator. SIAM J. Appl. Math., 54:1634–1649, 1994. [Ruh95] Axel Ruhe. The rational Krylov algorithm for large nonsymmetric eigenvalues — mapping the resolvent norms (pseudospectrum). Unpublished manuscript, March 1995. [TC04] Lloyd N. Trefethen and S.J. Chapman. Wave packet pseudomodes of twisted Toeplitz matrices. Comm. Pure Appl. Math., 57:1233–1264, 2004. [TE05] Lloyd N. Trefethen and Mark Embree. Spectra and Pseudospectra: The Behavior of Nonnormal Matrices and Operators. Princeton University Press, Princeton, NJ, 2005. [TH01] Franc¸oise Tisseur and Nicholas J. Higham. Structured pseudospectra for polynomial eigenvalue problems, with applications. SIAM J. Matrix Anal. Appl., 23:187–208, 2001. [Tre99] Lloyd N. Trefethen. Computation of pseudospectra. Acta Numerica, 8:247–295, 1999. [TTRD93] Lloyd N. Trefethen, Anne E. Trefethen, Satish C. Reddy, and Tobin A. Driscoll. Hydrodynamic stability without eigenvalues. Science, 261:578–584, 1993. [Wri02a] Thomas G. Wright. Algorithms and Software for Pseudospectra. D.Phil. thesis, Oxford University, U.K., 2002. [Wri02b] Thomas G. Wright. EigTool, 2002. Software available at: http://www.comlab.ox.ac.uk/ pseudospectra/eigtool. [WT02] Thomas G. Wright and Lloyd N. Trefethen. Pseudospectra of rectangular matrices. IMA J. Num. Anal., 22:501–519, 2002.
17 Singular Values and Singular Value Inequalities Definitions and Characterizations . . . . . . . . . . . . . . . . . . Singular Values of Special Matrices. . . . . . . . . . . . . . . . . . Unitarily Invariant Norms . . . . . . . . . . . . . . . . . . . . . . . . . . Inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Matrix Approximation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Characterization of the Eigenvalues of Sums of Hermitian Matrices and Singular Values of Sums and Products of General Matrices . . . . . . . . . . 17.7 Miscellaneous Results and Generalizations . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17.1 17.2 17.3 17.4 17.5 17.6
Roy Mathias University of Birmingham
17.1
171 173 175 177 1712
1713 1714 1715
Definitions and Characterizations
Singular values and the singular value decomposition are defined in Chapter 5.6. Additional information on computation of the singular value decomposition can be found in Chapter 45. A brief history of the singular value decomposition and early references can be found in [HJ91, Chap. 3]. Throughout this chapter, q = min{m, n}, and if A ∈ Cn×n has real eigenvalues, then they are ordered λ1 (A) ≥ · · · ≥ λn (A). Definitions: For A ∈ Cm×n , define the singular value vector sv(A) = (σ1 (A), . . . , σq (A)). For A ∈ Cm×n , define r 1 (A) ≥ · · · ≥ r m (A) and c 1 (A) ≥ · · · ≥ c n (A) to be the ordered Euclidean row and column lengths of A, that is, the square roots of the ordered diagonal entries of AA∗ and A∗ A. For A ∈ Cm×n define A pd = (A∗ A)1/2 . This is called the spectral absolute value of A. (This is also called the absolute value, but the latter term will not be used in this chapter due to potential confusion with the entrywise absolute value of A, denoted A.) A polar decomposition or polar form of the matrix A ∈ Cm×n with m ≥ n is a factorization A = U P , where P ∈ Cn×n is positive semidefinite and U ∈ Cm×n satisfies U ∗ U = In .
171
172
Handbook of Linear Algebra
Facts: The following facts can be found in most books on matrix theory, for example [HJ91, Chap. 3] or [Bha97]. 1. Take A ∈ Cm×n , and set
B=
A 0 0
0
.
Then σi (A) = σi (B) for i = 1, . . . , q and σi (B) = 0 for i > q . We may choose the zero blocks in B to ensure that B is square. In this way we can often generalize results on the singular values of square matrices to rectangular matrices. For simplicity of exposition, in this chapter we will sometimes state a result for square matrices rather than the more general result for rectangular matrices. 2. (Unitary invariance) Take A ∈ Cm×n . Then for any unitary U ∈ Cm×m and V ∈ Cn×n , σi (A) = σi (U AV ),
i = 1, 2, . . . , q .
3. Take A, B ∈ Cm×n . There are unitary matrices U ∈ Cm×m and V ∈ Cn×n such that A = U B V if and only if σi (A) = σi (B), i = 1, 2, . . . , q . 4. Let A ∈ Cm×n . Then σi2 (A) = λi (AA∗ ) = λi (A∗ A) for i = 1, 2, . . . , q . 5. Let A ∈ Cm×n . Let Si denote the set of subspaces of Cn of dimension i . Then for i = 1, 2, . . . , q , σi (A) = min
X ∈Sn−i +1
σi (A) = max X ∈Si
max
x∈X ,x2 =1
min
x∈X ,x2 =1
Ax2 = min
Y∈Si −1
Ax2 = max
Y∈Sn−i
6. Let A ∈ Cm×n and define the Hermitian matrix
J =
max
x⊥Y,x2 =1
min
x⊥Y,x2 =1
Ax2 ,
Ax2 .
0
A
A∗
0
∈ Cm+n,m+n .
The eigenvalues of J are ±σ1 (A), . . . , ±σq (A) together with m − n zeros. The matrix J is called the Jordan–Wielandt matrix. Its use allows one to deduce singular value results from results for eigenvalues of Hermitian matrices. 7. Take m ≥ n and A ∈ Cm×n . Let A = U P be a polar decomposition of A. Then σi (A) = λi (P ), i = 1, 2, . . . , q . 8. Let A ∈ Cm×n and 1 ≤ k ≤ q . Then k
σi (A) = max{Re tr U ∗ AV : U ∈ Cm×k , V ∈ Cn×k, U ∗ U = V ∗ V = Ik },
i =1 k
σi (A) = max{detU ∗ AV  : U ∈ Cm×k , V ∈ Cn×k , U ∗ U = V ∗ V = Ik }.
i =1
If m = n, then n i =1
σi (A) = max
n
∗
(U AU )ii  : U ∈ C
i =1
We cannot replace the n by a general k ∈ {1, . . . , n}.
n×n
∗
, U U = In
.
173
Singular Values and Singular Value Inequalities
9. Let A ∈ Cm×n . A yields ¯ = σi (A), for i = 1, 2, . . . , q . (a) σi (AT ) = σi (A∗ ) = σi ( A) −1 † (b) Let k = rank(A). Then σi (A† ) = σk−i +1 (A) for i = 1, . . . , k, and σi (A ) = 0 for i = k + 1, . . . , q . In particular, if m = n and A is invertible, then −1 σi (A−1 ) = σn−i +1 (A),
i = 1, . . . , n.
σi ((A∗ A) j ) = σi (A),
i = 1, . . . , q ;
(c) For any j ∈ N 2j
2 j +1
σi ((A∗ A) j A∗ ) = σi (A(A∗ A) j ) = σi
(A) i = 1, . . . , q .
10. Let U P be a polar decomposition of A ∈ Cm×n (m ≥ n). The positive semidefinite factor P is uniquely determined and is equal to A pd . The factor U is uniquely determined if A has rank n. If A has singular value decomposition A = U1 U2∗ (U1 ∈ Cm×n , U2 ∈ Cn×n ), then P = U2 U2∗ , and U may be taken to be U1 U2∗ . 11. Take A, U ∈ Cn×n with U unitary. Then A = U A pd if and only if A = A∗  pd U . Examples: 1. Take ⎡ ⎢
11 −3
⎤
−5
1
⎥
⎢ 1 −5 −3 11⎥ ⎥. A=⎢ ⎢−5 1 11 −3⎥ ⎣ ⎦
−3
11
1
−5
The singular value decomposition of A is A = U V ∗ , where = diag(20, 12, 8, 4), and ⎡
−1
1
−1
−1 −1 1⎢ ⎢ ⎢ 2 ⎣ 1 −1
1
⎢
U=
1
1
−1 1
⎤
⎡
−1
1
−1
1 1⎢ ⎢ ⎢ 2⎣ 1
1
1
−1
−1
−1
−1
1
1
⎥ ⎥ 1⎥ ⎦
1⎥
⎢
and
V=
1
⎤
1
⎥ ⎥. 1⎥ ⎦
1⎥ 1
The singular values of A are 20, 12, 8, 4. Let Q denote the permutation matrix that takes (x1 , x2 , x3 , x4 ) to (x1 , x4 , x3 , x2 ). Let P = A pd = Q A. The polar decomposition of A is A = Q P . (To see this, note that a permutation matrix is unitary and that P is positive definite by Gerˇschgorin’s theorem.) Note also that A pd = A∗  pd = AQ.
17.2
Singular Values of Special Matrices
In this section, we present some matrices where the singular values (or some of the singular values) are known, and facts about the singular values of certain structured matrices. Facts: The following results can be obtained by straightforward computations if no specific reference is given. 1. Let D = diag(α1 , . . . , αn ), where the αi are integers, and let H1 and H2 be Hadamard matrices. (See Chapter 32.2.) Then the matrix H1 D H2 has integer entries and has integer singular values nα1 , . . . , nαn .
174
Handbook of Linear Algebra
2. (2 × 2 matrix) Take A ∈ C2×2 . Set D =  det(A)2 , N = A2F . The singular values of A are
N±
√
N 2 − 4D . 2
3. Let X ∈ Cm×n have singular values σ1 ≥ · · · ≥ σq (q = min{m, n}). Set
A=
I
2X
0
I
∈ Cm+n,m+n .
The m + n singular values of A are σ1 +
σ12 + 1, . . . , σq +
σq2 + 1, 1, . . . , 1,
σq2 + 1 − σq , . . . ,
σ12 + 1 − σ1 .
4. [HJ91, Theorem 4.2.15] Let A ∈ Cm1 ×n1 and B ∈ Cm2 ×n2 have rank m and n. The nonzero singular values of A ⊗ B are σi (A)σ j (B), i = 1, . . . , m, j = 1, . . . , n. 5. Let A ∈ Cn×n be normal with eigenvalues λ1 , . . . , λn , and let p be a polynomial. Then the singular values of p(A) are  p(λk ), k = 1, . . . , n. In particular, if A is a circulant with first row a0 , . . . , an−1 , then A has singular values n−1 −2πi j k/n , a e i j =0
k = 1, . . . , n.
6. Take A ∈ Cn×n and nonzero x ∈ Cn . If Ax = λx and x∗ A = λx∗ , then λ is a singular value of A. In particular, if A is doubly stochastic, then σ1 (A) = 1. 7. [Kit95] Let A be the companion matrix corresponding to the monic polynomial p(t) = t n + 2 an−1 t n−1 + · · · + a1 t + a0 . Set N = 1 + in−1 =0 a i  . The n singular values of A are
N+
N 2 − 4a0 2 , 1, . . . , 1, 2
N−
N 2 − 4a0 2 . 2
8. [Hig96, p. 167] Take s , c ∈ R such that s 2 + c 2 = 1. The matrix ⎡
1
⎢ ⎢ ⎢ ⎢ n−1 ⎢ A = diag(1, s , . . . , s ) ⎢ ⎢ ⎢ ⎢ ⎣
⎤
−c
−c
···
−c
1
−c
···
..
..
.
−c ⎥ ⎥ ..⎥ ⎥ .⎥
..
.
.
⎥
⎥ ⎥ ⎥ −c ⎦
1 √ n−2
is called a Kahan matrix. If c and s are positive, then σn−1 (A) = s 1 + c. 9. [GE95, Lemma 3.1] Take 0 = d1 < d2 < · · · < dn and 0 = z i ∈ C. Let ⎡
⎤
z1
⎢ ⎢ z2 ⎢ A = ⎢. ⎢. ⎣.
⎥ ⎥ ⎥ ⎥. ⎥ ⎦
d2 ..
.
zn
dn
The singular values of A satisfy the equation f (t) = 1 +
n z i 2 i =1
di2 − t 2
=0
175
Singular Values and Singular Value Inequalities
and exactly one lies in each of the intervals (d1 , d2 ), . . . , (dn−1 , dn ), (dn , dn + z2 ). Let σi = σi (A). The left and right i th singular vectors of A are u/u2 and v/v2 respectively, where
u=
zn z1 2 2,··· , 2 d1 − σi dn − σi2
T
and v = −1,
dn z n d2 z 2 2 2,··· , 2 d2 − σi dn − σi2
T
.
10. (Bidiagonal) Take ⎡
α1
⎤
β1
⎢ ⎢ ⎢ ⎢ B =⎢ ⎢ ⎢ ⎣
α2
..
.
..
.
⎥ ⎥ ⎥ ⎥ ⎥ ∈ Cn×n . ⎥ βn−1⎥ ⎦
αn If all the αi and βi are nonzero, then B is called an unreduced bidiagonal matrix and (a) The singular values of B are distinct. (b) The singular values of B depend only on the moduli of α1 , . . . , αn , β1 , . . . , βn−1 . (c) The largest singular value of B is a strictly increasing function of the modulus of each of the αi and βi . (d) The smallest singular value of B is a strictly increasing function of the modulus of each of the αi and a strictly decreasing function of the modulus of each of the βi . ˆ Then (e) (High relative accuracy) Take τ > 1 and multiply one of the entries of B by τ to give B. −1 ˆ τ σi (B) ≤ σi ( B) ≤ τ σi (B). 11. [HJ85, Sec. 4.4, prob. 26] Let A ∈ Cn×n be skewsymmetric (and possibly complex). The nonzero singular values of A occur in pairs.
17.3
Unitarily Invariant Norms
Throughout this section, q = min{m, n}. Definitions: A vector norm · on Cm×n is unitarily invariant (u.i.) if A = U AV for any unitary U ∈ Cm×m and V ∈ Cn×n and any A ∈ Cm×n . · U I is used to denote a general unitarily invariant norm. A function g : Rn → R+ 0 is a permutation invariant absolute norm if it is a norm, and in addition g (x1 , . . . , xn ) = g (x1 , . . . , xn ) and g (x) = g (P x) for all x ∈ Rn and all permutation matrices P ∈ Rn×n . (Many authors call a permutation invariant absolute norm a symmetric gauge function.) The Ky Fan k norms of A ∈ Cm×n are A K ,k =
k
σi (A),
k = 1, 2, . . . , q .
i =1
The Schattenp norms of A ∈ Cm×n are
A S, p =
q
1/ p p
σi (A)
i =1
A S,∞ = σ1 (A).
p
= tr A pd
1/ p
0≤ p<∞
176
Handbook of Linear Algebra
The trace norm of A ∈ Cm×n is Atr =
q
σi (A) = A K ,q = A S,1 = tr A pd .
i =1 2 Other norms discussed in this section, such as the spectral norm · 2 (A2 = σ1 (A) = maxx=0 Ax ) x2 q m n 2 1/2 2 1/2 = ( i =1 j =1 ai j  ) ), are defined in and the Frobenius norm · F (A F = ( i =1 σi (A)) Section 7.1. and discussed extensively in Chapter 37.
Warning: There is potential for considerable confusion. For example, A2 = A K ,1 = A S,∞ , while · ∞ = · S,∞ ( unless m = 1), and generally A2 , A S,2 and A K ,2 are all different, as are A1 , A S,1 and A K ,1 . Nevertheless, many authors use · k for · K ,k and · p for · S, p . Facts: The following standard facts can be found in many texts, e.g., [HJ91, §3.5] and [Bha97, Chap. IV]. 1. Let · be a norm on Cm×n . It is unitarily invariant if and only if there is a permutation invariant absolute norm g on Rq such that A = g (σ1 (A), . . . , σq (A)) for all A ∈ Cm×n . 2. Let · be a unitarily invariant norm on Cm×n , and let g be the corresponding permutation invariant absolute norm g . Then the dual norms (see Chapter 37) satisfy A D = g D (σ1 (A), . . . , σq (A)). 3. [HJ91, Prob. 3.5.18] The spectral norm and trace norm are duals, while the Frobenius norm is self dual. The dual of · S, p is · S, p˜ , where 1/ p + 1/ p˜ = 1 and
A KD ,k = max A2 ,
Atr k
,
k = 1, . . . , q .
4. For any A ∈ Cm×n , q −1/2 A F ≤ A2 ≤ A F . 5. If · is a u.i. norm on Cm×n , then N(A) = A∗ A1/2 is a u.i. norm on Cn×n . A norm that arises in this way is called a Qnorm. 6. Let A, B ∈ Cm×n be given. The following are equivalent (a) AU I ≤ BU I for all unitarily invariant norms · U I . (b) A K ,k ≤ B K ,k for k = 1, 2, . . . , q . (c) (σ1 (A), . . . , σq (A)) w (σ1 (B), . . . , σq (B)). ( w is defined in Preliminaries) The equivalence of the first two conditions is Fan’s Dominance Theorem. 7. The Ky–Fank norms can be represented in terms of an extremal problem involving the spectral norm and the trace norm. Take A ∈ Cm×n . Then A K ,k = min{Xtr + kY 2 : X + Y = A}
k = 1, . . . , q .
8. [HJ91, Theorem 3.3.14] Take A, B ∈ Cm×n . Then trAB ∗  ≤
q
σi (A)σi (B).
i =1
This is an important result in developing the theory of unitarily invariant norms.
177
Singular Values and Singular Value Inequalities
Examples: 1. The matrix A in Example 1 of Section 17.1 has singular values 20, 12, 8, and 4. So √ A2 = 20, A F = 624, Atr = 44; A S,1
17.4
A K ,1 = 20, A K ,2 = 32, A K ,3 = 40, A K ,4 = 44; √ √ = 44, A S,2 = 624, A S,3 = 3 10304 = 21.7605, A S,∞ = 20.
Inequalities
Throughout this section, q = min{m, n} and if A ∈ Cm×n has real eigenvalues, then they are ordered λ1 (A) ≥ · · · ≥ λn (A). Definitions: Pinching is defined recursively. If
A=
A11
A12
A21
A22
∈C
m×n
,
B=
A11
0
0
A22
∈ Cm×n ,
then B is a pinching of A. (Note that we do not require the Aii to be square.) Furthermore, any pinching of B is a pinching of A. √ √ For positive α, β, define the measure of relative separation χ(α, β) =  α/β − β/α. Facts: The following facts can be found in standard references, for example [HJ91, Chap. 3], unless another reference is given. 1. (Submatrices) Take A ∈ Cm×n and let B denote A with one of its rows or columns deleted. Then σi +1 (A) ≤ σi (B) ≤ σi (A), i = 1, . . . , q − 1. 2. Take A ∈ Cm×n and let B be A with a row and a column deleted. Then σi +2 (A) ≤ σi (B) ≤ σi (A),
i = 1, . . . , q − 2.
The i + 2 cannot be replaced by i + 1. (Example 2) 3. Take A ∈ Cm×n and let B be an (m − k) × (n − l ) submatrix of A. Then σi +k+l (A) ≤ σi (B) ≤ σi (A),
i = 1, . . . , q − (k + l ).
4. Take A ∈ Cm×n and let B be A with some of its rows and/or columns set to zero. Then σi (B) ≤ σi (A), i = 1, . . . , q . 5. Let B be a pinching of A. Then sv(B) w sv(A). The inequalities ik=1 σi (B) ≤ ik=1 σi (A) and σk (B) ≤ σk (A) are not necessarily true for k > 1. (Example 1) 6. (Singular values of A + B) Let A, B ∈ Cm×n . (a) sv(A + B) w sv(A) + sv(B), or equivalently k i =1
σi (A + B) ≤
k i =1
σi (A) +
k
σi (B),
i = 1, . . . , q .
i =1
(b) If i + j − 1 ≤ q and i, j ∈ N, then σi + j −1 (A + B) ≤ σi (A) + σ j (B).
178
Handbook of Linear Algebra
(c) We have the weak majorization sv(A + B) − sv(A) w sv(B) or, equivalently, if 1 ≤ i 1 < · · · < i k ≤ q , then k
σi j (A + B) − σi j (A) ≤
k
j =1 k i =1
σi j (A) −
k
σ j (B),
j =1
σ j (B) ≤
j =1
k
σi j (A + B) ≤
k
j =1
σi j (A) +
k
i =1
σ j (B).
j =1
(d) [Tho75] (Thompson’s Standard Additive Inequalities) If 1 ≤ i 1 < · · · < i k ≤ q , 1 ≤ i 1 < · · · < i k ≤ q and i k + jk ≤ q + k, then k
σi s + js −s (A + B) ≤
s =1
k
σi s (A) +
k
s =1
σ js (B).
s =1
7. (Singular values of AB) Take A, B ∈ Cn×n . (a) For all k = 1, 2, . . . , n and all p > 0, we have i =n−k+1
σi (A)σi (B) ≤
i =n−k+1
i =n
σi (AB),
i =n k
σi (AB) ≤
i =1 k
k
σi (A)σi (B),
i =1 p
σi (AB) ≤
i =1
k
p
p
σi (A)σi (B).
i =1
(b) If i, j ∈ N and i + j − 1 ≤ n, then σi + j −1 (AB) ≤ σi (A)σ j (B). (c) σn (A)σi (B) ≤ σi (AB) ≤ σ1 (A)σi (B), i = 1, 2, . . . , n. (d) [LM99] Take 1 ≤ j1 < · · · < jk ≤ n. If A is invertible and σ ji (B) > 0, then σ ji (AB) > 0 and n
σi (A) ≤
i =n−k+1
k
max
i =1
σ ji (AB) σ ji (B) , σ ji (B) σ ji (AB)
≤
k
σi (A).
i =1
(e) [LM99] Take invertible S, T ∈ Cn×n . Set A˜ = S AT . Let the singular values of A and A˜ be σ1 ≥ · · · ≥ σn and σ˜1 ≥ · · · ≥ σ˜n . Then 1 ∗ S − S −1 U I + T ∗ − T −1 U I . diag(χ (σ1 , σ˜1 ), , . . . , χ(σn , σ˜n ))U I ≤ 2 (f) [TT73] (Thompson’s Standard Multiplicative Inequalities) Take 1 ≤ i 1 < · · · < i m ≤ n and 1 ≤ j1 < · · · < jm ≤ n. If i m + jm ≤ m + n, then m
σi s + js −s (AB) ≤
s =1
m
σi s (A)
s =1
m
σ js (B).
s =1
8. [Bha97, §IX.1] Take A, B ∈ Cn×n . (a) If AB is normal, then k i =1
σi (AB) ≤
k
σi (B A),
k = 1, . . . , q ,
i =1
and, consequently, sv( AB) w sv(B A), and ABU I ≤ B AU I .
179
Singular Values and Singular Value Inequalities
(b) If AB is Hermitian, then sv( AB) w sv(H(B A)) and ABU I ≤ H(B A)U I , where H(X) = (X + X ∗ )/2. 9. (Termwise singular value inequalities) [Zha02, p. 28] Take A, B ∈ Cm×n . Then 2σi (AB ∗ ) ≤ σi (A∗ A + B ∗ B),
i = 1, . . . , q
and, more generally, if p, p˜ > 0 and 1/ p + 1/ p˜ = 1, then ∗
σi (AB ) ≤ σi
˜ (B ∗ B) p/2 (A∗ A) p/2 + p p˜
= σi
p
A pd p
p˜
B pd + p˜
.
The inequalities 2σ1 (A∗ B) ≤ σ1 (A∗ A + B ∗ B) and σ1 (A + B) ≤ σ1 (A pd + B pd ) are not true in general (Example 3), but we do have A∗ BU2 I ≤ A∗ AU I B ∗ BU I . ∗ 10. [Bha97, Prop. III.5.1] Take A ∈ Cn×n . Then λ⎡ i (A + A ⎤ ) ≤ 2σi (A), i = 1, 2, . . . , n. R 0 ⎦ ∈ Cn×n (R ∈ C p× p ) have singular values 11. [LM02] (Block triangular matrices) Let A = ⎣ S T
α1 ≥ · · · ≥ αn . Let k = min{ p, n − p}. Then (a) If σmin (R) ≥ σmax (T ), then σi (R) ≤ αi ,
i = 1, . . . , p
αi ≤ σi − p (T ),
i = p + 1, . . . , n.
(b) (σ1 (S), . . . , σk (S)) w (α1 − αn , · · · , αk − αn−k+1 ). (c) If A is invertible, then
−1 (σ1 (T −1 S R −1 , . . . , σk (T −1 S R −1 ) w αn−1 − α1−1 , · · · , αn−k+1 − αk−1 ,
1 2
(σ1 (T −1 S), . . . , σk (T −1 S)) w
αn αk αn−k+1 α1 − ,··· , − αn α1 αn−k+1 αk ⎡
12. [LM02] (Block positive semidefinite matrices) Let A = ⎣
A11
A12
A∗12
A22
.
⎤ ⎦ ∈ Cn×n be positive definite
with eigenvalues λ1 ≥ · · · ≥ λn . Assume A11 ∈ C p× p . Set k = min{ p, n − p}. Then j
σi2 (A12 ) ≤
i =1
−1/2
σ1 A11
σi (A11 )σi (A22 ),
i =1
−1/2
A12 , . . . , σk A11
j
A12
−1 σ1 A−1 11 A12 , . . . , σk A11 A12
w
w
λ1 −
j = 1, . . . , k,
λn , . . . ,
λk −
λn−k+1 ,
1 (χ(λ1 , λn ), . . . , χ (λk , λn−k+1 )) . 2
If k = n/2, then A12 U2 I ≤ A11 U I A22 U I . 13. (Singular values and eigenvalues) Let A ∈ Cn×n . Assume λ1 (A) ≥ · · · ≥ λn (A). Then (a)
k
i =1
λi (A) ≤
k
i =k
σi (A),
k = 1, . . . , n, with equality for k = n.
1710
Handbook of Linear Algebra
(b) Fix p > 0. Then for k = 1, 2, . . . , n, k
p
λi (A) ≤
k
i =1
p
σi (A).
i =1
Equality holds with k = n if and only if equality holds for all k = 1, 2, . . . , n, if and only if A is normal. (c) [HJ91, p. 180] (Yamamoto’s theorem) limk→∞ (σi (Ak ))1/k = λi (A),
i = 1, . . . , n.
R+ 0,
i = 1, . . . , n be ordered in nonincreasing absolute value. There 14. [LM01] Let λi ∈ C and σi ∈ is a matrix A with eigenvalues λ1 , . . . , λn and singular values σ1 , . . . , σn if and only if k
λi  ≤
i =1
k
σi , k = 1, . . . , n, with equality for k = n.
i =1
In addition: (a) The matrix A can be taken to be upper triangular with the eigenvalues on the diagonal in any order. (b) If the complex entries in λ1 , . . . , λn occur in conjugate pairs, then A may be taken to be in real Schur form, with the 1 × 1 and 2 × 2 blocks on the diagonal in any order. (c) There is a finite construction of the upper triangular matrix in cases (a) and (b). (d) If n > 2, then A cannot always be taken to be bidiagonal. (Example 5) 15. [Zha02, Chap. 2] (Singular values of A ◦ B) Take A, B ∈ Cn×n . (a) σi (A ◦ B) ≤ min{r i (A), c i (B)} · σ1 (B), i = 1, 2, . . . , n. (b) We have the following weak majorizations: k
σi (A ◦ B) ≤
i =1
min{r i (A), c i (A)}σi (B),
k = 1, . . . , n,
i =1
k
σi (A ◦ B) ≤
i =1 k
k
k
σi (A)σi (B),
k = 1, . . . , n,
i =1
σi2 (A ◦ B) ≤
i =1
k
σi ((A∗ A) ◦ (B ∗ B)),
k = 1, . . . , n.
i =1
(c) Take X, Y ∈ Cn×n . If A = X ∗ Y , then we have the weak majorization k
σi (A ◦ B) ≤
i =1
k
c i (X)c i (Y )σi (B),
k = 1, . . . , n.
i =1
(d) If B is positive semidefinite with diagonal entries b11 ≥ · · · ≥ bnn , then k
σi (A ◦ B) ≤
i =1
k
bii σi (A),
k = 1, . . . , n.
i =1
(e) If both A and B are positive definite, then so is A ◦ B (Schur product theorem). In this case the singular values of A, B and A ◦ B are their eigenvalues and B A has positive eigenvalues and we have the weak multiplicative majorizations n i =k
λi (B)λi (A) ≤
n i =k
bii λi (A) ≤
n i =k
λi (B A) ≤
n
λi (A ◦ B),
k = 1, 2, . . . , n.
i =k
The inequalities are still valid if we replace A ◦ B by A ◦ B T . (Note B T is not necessarily the same as B ∗ = B.)
1711
Singular Values and Singular Value Inequalities
16. Let A ∈ Cm×n . The following are equivalent: (a) σ1 (A ◦ B) ≤ σ1 (B) for all B ∈ Cm×n . (b)
k
i =1
σi (A ◦ B) ≤
k
i =1
σi (B) for all B ∈ Cm×n and all k = 1, . . . , q .
(c) There are positive semidefinite P ∈ Cn×n and Q ∈ Cm×m such that
P
A
A∗
Q
is positive semidefinite, and has diagonal entries at most 1. 17. (Singular values and matrix entries) Take A ∈ Cm×n . Then
a11 2 , a12 2 , . . . , amn 2 σ12 (A), . . . , σq2 (A), 0, . . . , 0 , q
n m
p
σi (A) ≤
i =1 m n
ai j  p ,
0 ≤ p ≤ 2,
i =1 j =1 q
ai j  p ≤
i =1 j =1
p
σi (A),
2 ≤ p < ∞.
i =1
If σ1 (A) = ai j , then all the other entries in row i and column j of A are 0. 18. Take σ1 ≥ · · · ≥ σn ≥ 0 and α1 ≥ · · · ≥ αn ≥ 0. Then ∃A ∈ Rn×n s.t. σi (A) = σi
and c i (A) = αi ⇔
α12 , . . . , αn2 σ12 , . . . , σn2 .
This statement is still true if we replace Rn×n by Cn×n and/or c i ( · ) by r i ( · ). 19. Take A ∈ Cn×n . Then n
σi (A) ≤
i =k
n
c i (A),
k = 1, 2, . . . , n.
i =k
The case k = 1 is Hadamard’s Inequality:  det(A) ≤ in=1 c i (A). 20. [Tho77] Take F = C or R and d1 , . . . , dn ∈ F such that d1  ≥ · · · ≥ dn , and σ1 ≥ · · · ≥ σn ≥ 0. There is a matrix A ∈ F n×n with diagonal entries d1 , . . . , dn and singular values σ1 , . . . , σn if and only if (d1 , . . . , dn ) w (σ1 (A), . . . , σn (A))
and
n−1 j =1
d j  − dn  ≤
n−1
σ j (A) − σn (A).
j =1
21. (Nonnegative matrices) Take A = [ai j ] ∈ Cm×n . (a) If B = [ai j ], then σ1 (A) ≤ σ1 (B). (b) If A and B are real and 0 ≤ ai j ≤ bi j ∀ i, j , then σ1 (A) ≤ σ1 (B). The condition 0 ≤ ai j is essential. (Example 4) (c) The condition 0 ≤ bi j ≤ 1 ∀ i, j does not imply σ1 (A ◦ B) ≤ σ1 (A). (Example 4) √ 22. (Bound on σ1 ) Let A ∈ Cm×n . Then A2 = σ1 (A) ≤ A1 A∞ . 23. [Zha99] (Cartesian decomposition) Let C = A + i B ∈ Cn×n , where A and B are Hermitian. Let A, B, C have singular values α j , β j , γi , j = 1, . . . , n. Then √ (γ1 , . . . , γn ) w 2(α1 + iβ1 , . . . , αn + iβn ) w 2(γ1 , . . . , γn ).
1712
Handbook of Linear Algebra
Examples: 1. Take
⎡
⎤
⎡
1
1
1
A=⎢ ⎣1
1
1⎥ ⎦,
1
1
1
⎢
⎥
⎤
1
0
0
B =⎢ ⎣0 0
1
1⎥ ⎦,
1
1
⎢
⎡
⎥
⎤
1
0
0
C =⎢ ⎣0 0
1
0⎥ ⎦.
0
1
⎢
⎥
Then B is a pinching of A, and C is a pinching of both A and B. The matrices A, B, C have singular values α = (3, 0, 0), β = (2, 1, 0), and γ = (1, 1, 1). As stated in Fact 5, γ w β w α. In fact, since the matrices are all positive semidefinite, we may replace w by . However, it is not true that γi ≤ αi except for i = 1. Nor is it true that  det(C ) ≤  det(A). 2. The matrices ⎡
11
⎢ ⎢ 1 A=⎢ ⎢−5 ⎣
−3
−3
−5
−5
−3
1
11
11
⎤
⎡
1
⎥ 11⎥ ⎥, −3⎥ ⎦
⎢
11
B =⎢ ⎣ 1
−3 1
⎡
1
⎥
−3
11
⎤
11
−3
−5
C =⎢ ⎣ 1
−5
−3⎥ ⎦
⎢
11⎥ ⎦,
−5 −3
−5
1 −5
⎤
−5
−5
1
⎥
11
have singular values α = (20, 12, 8, 4), β = (17.9, 10.5, 6.0), and γ = (16.7, 6.2, 4.5) (to 1 decimal place). The singular values of B interlace those of A (α4 ≤ β3 ≤ α3 ≤ β2 ≤ α2 ≤ β1 ≤ α1 ), but those of C do not. In particular, α3 ≤ γ2 . It is true that αi +2 ≤ γi ≤ αi (i = 1, 2). 3. Take
A=
1
0
1
0 √
and
B=
0
1
0
1
.
Then A + B2 = σ1 (A + B) = 2 ≤ 2 = σ1 (A pd + B pd ) = A pd + B pd 2 . Also, 2σ1 (A∗ B) = 4 ≤ 2 = σ1 (A∗ A + B ∗ B). 4. Setting entries of a matrix to zero can increase the largest singular value. Take
A=
1
1
−1
1
,
and
B=
1
1
0
1
.
√ √ Then σ1 (A) = 2 < (1 + 5)/2 = σ1 (B). 5. A bidiagonal matrix B cannot have eigenvalues 1, 1, 1 and singular values 1/2, 1/2, 4. If B is unreduced bidiagonal, then it cannot have repeated singular values. (See Fact 10, section 17.2.) However, if B were reduced, then it would have a singular value equal to 1.
17.5
Matrix Approximation
Recall that · U I denotes a general unitarily invariant norm, and that q = min{m, n}. Facts: The following facts can be found in standard references, for example, [HJ91, Chap. 3], unless another reference is given. 1. (Best rank k approximation.) Let A ∈ Cm×n and 1 ≤ k ≤ q − 1. Let A = U V ∗ be a singular value ˜ ∗ . Then ˜ be equal to except that ˜ ii = 0 for i > k, and let A˜ = U V decomposition of A. Let ˜ rank( A) ≤ k, and ˜ U I = min{A − BU I : rank(B) ≤ k}. ˜ U I = A − A −
1713
Singular Values and Singular Value Inequalities
In particular, for the spectral norm and the Frobenius norm, we have σk+1 (A) = min{A − B2 : rank(B) ≤ k},
1/2
q
2 σk+1 (A)
= min{A − B F : rank(B) ≤ k}.
i =k+1
2. [Bha97, p. 276] (Best unitary approximation) Take A, W ∈ Cn×n with W unitary. Let A = UP be a polar decomposition of A. Then A − U U I ≤ A − WU I ≤ A + U U I . 3. [GV96, §12.4.1] [HJ85, Ex. 7.4.8] (Orthogonal Procrustes problem) Let A, B ∈ Cm×n . Let B ∗ A have a polar decomposition B ∗ A = U P . Then A − BU F = min{A − B W F : W ∈ Cn×n , W ∗ W = I }. This result is not true if · F is replaced by · U I ([Mat93, §4]). 4. [Hig89] (Best PSD approximation) Take A ∈ Cn×n . Set A H = (A + A∗ )/2, B = (A H + A H )/2). Then B is positive semidefinite and is the unique solution to min{A − X F : X ∈ Cn×n , X ∈ PSD}. There is also a formula for the best PSD approximation in the spectral norm. 5. Let A, B ∈ Cm×n have singular value decompositions A = U A A VA∗ and B = U B B VB∗ . Let U ∈ Cm×m and V ∈ Cn×n be any unitary matrices. Then A − B U I ≤ A − UBV ∗ U I .
17.6
Characterization of the Eigenvalues of Sums of Hermitian Matrices and Singular Values of Sums and Products of General Matrices
There are necessary and sufficient conditions for three sets of numbers to be the eigenvalues of Hermitian A, B, C = A + B ∈ Cn×n , or the singular values of A, B, C = A + B ∈ Cm×n , or the singular values of nonsingular A, B, C = AB ∈ Cn×n . The key results in this section were first proved by Klyachko ([Kly98]) and Knutson and Tao ([KT99]). The results presented here are from a survey by Fulton [Ful00]. Bhatia has written an expository paper on the subject ([Bha01]). Definitions: The inequalities are in terms of the sets Trn of triples (I, J , K ) of subsets of {1, . . . , n} of the same cardinality r , defined by the following inductive procedure. Set
Urn
=
(I, J , K ) i+ j = k + r (r + 1)/2 . i ∈I
j ∈J
k∈K
When r = 1, set T1n = U1n . In general,
Trn
=
(I, J , K ) ∈ Urn  for all p < r and all (F , G, H) in Trp ,
f∈F
if +
g∈G
jg ≤
kh + p(p + 1)/2 .
h∈H
In this section, the vectors α, β, γ will have real entries ordered in nonincreasing order.
1714
Handbook of Linear Algebra
Facts: The following facts are in [Ful00]: 1. A triple (α, β, γ ) of real nvectors occurs as eigenvalues of Hermitian A, B, C = A + B ∈ Cn×n if and only if γi = αi + βi and the inequalities
γk ≤
αi +
i ∈I
k∈K
βj
j ∈J
hold for every (I, J , K ) in Trn , for all r < n. Furthermore, the statement is true if Cn×n is replaced by Rn×n . 2. Take Hermitian A, B ∈ Cn×n (not necessarily PSD). Let the vectors of eigenvalues of A, B, C = A + B be α, β, and γ . Then we have the (nonlinear) inequality minπ ∈Sn
n
(αi + βπ(i ) ) ≤
i =1
n
γi ≤ maxπ∈Sn
i =1
n
(αi + βπ(i ) ).
i =1
3. Fix m, n and set q = min{m, n}. For any subset X of {1, . . . , m + n}, define X q = {i : i ∈ X, i ≤ q } and X q = {i : i ≤ q , m + n + 1 − i ∈ X}. A triple (α, β, γ ) occurs as the singular values of A, B, C = A + B ∈ Cm×n , if and only if the inequalities
k∈K q
γk −
γk
≤
k∈K q
αi −
αi +
i ∈Iq
i ∈I
βj −
j ∈J q
βj
j ∈J q
are satisfied for all (I, J , K ) in Trm+n , for all r < m+n. This statement is not true if Cm×n is replaced by Rm×n . (See Example 1.) 4. A triple of positive real nvectors (α, β, γ ) occurs as the singular values of n by n matrices A,B, C = AB ∈ Cn×n if and only if γ1 · · · γn = α1 · · · αn β1 · · · βn and k∈K
γk ≤
αi ·
i ∈I
βj
j ∈J
for all (I, J , K ) in Trn , and all r < n. This statement is still true if Cn×n is replaced by Rn×n . Example: 1. There are A, B, C = A + B ∈ C2×2 with singular values (1, 1), (1, 0), and (1, 1), but there are no A, B, C = A + B ∈ R2×2 with these singular values. √ In the complex case, take A = diag(1, 1/2 + ( 3/2)i ), B = diag(0, −1). Now suppose that A and B are real 2 × 2 matrices such that A and C = A + B both have singular values (1, 1). Then A and C are orthogonal. Consider BC T = AC T − C C T = AC T − I . Because AC T is real, it has eigenvalues α, α¯ and so BC T has eigenvalues α − 1, α¯ − 1. Because AC T is orthogonal, it is normal and, hence, so is BC T , and so its singular values are α − 1 and ¯a − 1, which are equal and, in particular, cannot be (1, 0).
17.7
Miscellaneous Results and Generalizations
Throughout this section F can be taken to be either R or C. Definitions: Let X , Y be subspaces of Cr of dimension m and n. The principal angles 0 ≤ θ1 ≤ · · · ≤ θq ≤ π/2 between X and Y and principal vectors u1 , . . . , uq and v1 , . . . , vq are defined inductively: cos(θ1 ) = max{x∗ y : x ∈ X , max, x2 = y2 = 1}. y∈Y
1715
Singular Values and Singular Value Inequalities
Let u1 and v1 be a pair of maximizing vectors. For k = 2, . . . , q , cos(θk ) = max{x∗ y : x ∈ X , y ∈ Y, x2 = y2 = 1,
x∗ ui = y∗ vi = 0,
i = 1, . . . , k − 1}.
Let uk and vk be a pair of maximizing vectors. (Principal angles are also called canonical angles, and the cosines of the principal angles are called canonical correlations.) Facts: 1. (Principal Angles) Let X , Y be subspaces of Cr of dimension m and n. (a) [BG73] The principal vectors obtained by the process above are not necessarily unique, but the principal angles are unique (and, hence, independent of the chosen principal vectors). (b) Let m = n ≤ r/2 and X, Y be matrices whose columns form orthonormal bases for the subspaces X and Y, respectively. i. The singular values of X ∗ Y are the cosines of the principal angles between the subspaces X and Y. ii. There are unitary matrices U ∈ Cr ×r and VX and VY ∈ Cn×n such that ⎡ ⎢
In
⎤ ⎥
⎥ U X VX = ⎢ ⎣ 0n ⎦ , 0r −n,n
⎡ ⎢
⎤ ⎥
⎥ U Y VY = ⎢ ⎣ ⎦, 0r −n,n
where and are nonnegative diagonal matrices. Their diagonal entries are the cosines and sines respectively of the principal angles between X and Y. (c) [QZL05] Take m = n. For any permutation invariant absolute norm g on Rm , g (sin(θ1 ), . . . , sin(θm )), g (2 sin(θ1 /2), . . . , 2 sin(θm /2)), and g (θ1 , . . . , θm ) are metrics on the set of subspaces of dimension n of Cr ×r . 2. [GV96, Theorem 2.6.2] (CS decomposition) Let W ∈ F n×n be unitary. Take a positive integer l such that 2l ≤ n. Then there are unitary matrices U11 , V11 ∈ F l ×l and U22 , V22 ∈ F (n−l )×(n−l ) such that
U11
0
0
U22
W
V11
0
0
V22
⎡ ⎢
−
=⎢ ⎣
0
0
0
⎤ ⎥
0 ⎥ ⎦, In−2l
where = diag(γ1 , . . . , γl ) and = diag(σ1 , . . . , σl ) are nonnegative and 2 + 2 = I . 3. [GV96, Theorem 8.7.4] (Generalized singular value decomposition) Take A ∈ F p×n and B ∈ F m×n with p ≥ n. Then there is an invertible X ∈ F n×n , unitary U ∈ F p× p and V ∈ F m×m , and nonnegative diagonal matrices A ∈ Rn×n and B ∈ Rq ×q (q = min{m, n}) such that A = U A X and B = V B X.
References [And94] T. Ando. Majorization and inequalitites in matrix theory. Lin. Alg. Appl., 199:17–67, 1994. [Bha97] R. Bhatia. Matrix Analysis. SpringerVerlag, New York, 1997. [Bha01] R. Bhatia. Linear algebra to quantum cohomology: the story of Alfred Horn’s inequalities. Amer. Math. Monthly, 108(4):289–318, 2001. [BG73] A. Bj¨ork and G. Golub. Numerical methods for computing angles between linear subspaces. Math. Comp., 27:579–594, 1973.
1716
Handbook of Linear Algebra
[Ful00] W. Fulton. Eigenvalues, invariant factors, highest weights, and Schurbert calculus. Bull. Am. Math. Soc., 37:255–269, 2000. [GV96] G.H. Golub and C.F. Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, 3rd ed., 1996. [GE95] Ming Gu and Stanley Eisenstat. A divideandconquer algorithm for the bidiagonal SVD. SIAM J. Matrix Anal. Appl., 16:72–92, 1995. [Hig96] N.J. Higham. Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia, 1996. [Hig89] N.J. Higham. Matrix nearness problems and applications. In M.J.C. Gover and S. Barnett, Eds., Applications of Matrix Theory, pp. 1–27. Oxford University Press, U.K. 1989. [HJ85] R.A. Horn and C.R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985. [HJ91] R.A. Horn and C.R. Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, 1991. [Kit95] F. Kittaneh. Singular values of companion matrices and bounds on zeros of polynomials. SIAM. J. Matrix Anal. Appl., 16(1):330–340, 1995. [Kly98] A. A. Klyachko. Stable bundles, representation theory and Hermitian operators. Selecta Math., 4(3):419–445, 1998. [KT99] A. Knutson and T. Tao. The honeycomb model of G L n (C ) tensor products i: proof of the saturation conjecture. J. Am. Math. Soc., 12(4):1055–1090, 1999. [LM99] C.K. Li and R. Mathias. The Lidskii–Mirsky–Wielandt theorem — additive and multiplicative versions. Numerische Math., 81:377–413, 1999. [LM01] C.K. Li and R. Mathias. Construction of matrices with prescribed singular values and eigenvalues. BIT, 41(1):115–126, 2001. [LM02] C.K. Li and R. Mathias. Inequalities on singular values of block triangular matrices. SIAM J. Matrix Anal. Appl., 24:126–131, 2002. [MO79] A.W. Marshall and I. Olkin. Inequalities: Theory of Majorization and Its Applications. Academic Press, London, 1979. [Mat93] R. Mathias. Perturbation bounds for the polar decomposition. SIAM J. Matrix Anal. Appl., 14(2):588–597, 1993. [QZL05] Li Qiu, Yanxia Zhang, and ChiKwong Li. Unitarily invariant metrics on the Grassmann space. SIAM J. Matrix Anal. Appl., 27(2):507–531, 2006. [Tho75] R.C. Thompson. Singular value inequalities for matrix sums and minors. Lin. Alg. Appl., 11(3):251–269, 1975. [Tho77] R.C. Thompson. Singular values, diagonal elements, and convexity. SIAM J. Appl. Math., 32(1):39–63, 1977. [TT73] R.C. Thompson and S. Therianos. On the singular values of a matrix productI, II, III. Scripta Math., 29:99–123, 1973. [Zha99] X. Zhan. Norm inequalities for Cartesian decompositions. Lin. Alg. Appl., 286(1–3):297–301, 1999. [Zha02] X. Zhan. Matrix Inequalities. SpringerVerlag, Berlin, Heidelberg, 2002. (Lecture Notes in Mathematics 1790.)
18 Numerical Range
ChiKwong Li College of William and Mary
18.1 Basic Properties and Examples . . . . . . . . . . . . . . . . . . . . . . 18.2 The Spectrum and Special Boundary Points . . . . . . . . . 18.3 Location of the Numerical Range . . . . . . . . . . . . . . . . . . . 18.4 Numerical Radius . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18.5 Products of Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18.6 Dilations and Norm Estimation . . . . . . . . . . . . . . . . . . . . 18.7 Mappings on Matrices. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
181 183 184 186 188 189 1811 1811
The numerical range W(A) of an n × n complex matrix A is the collection of complex numbers of the form x∗ Ax, where x ∈ Cn is a unit vector. It can be viewed as a “picture” of A containing useful information of A. Even if the matrix A is not known explicitly, the “picture” W(A) would allow one to “see” many properties of the matrix. For example, the numerical range can be used to locate eigenvalues, deduce algebraic and analytic properties, obtain norm bounds, help find dilations with simple structure, etc. Related to the numerical range are the numerical radius of A defined by w (A) = maxµ∈W(A) µ and the distance of (A) = minµ∈W(A) µ. The quantities w (A) and w (A) are useful in W(A) to the origin denoted by w studying perturbation, convergence, stability, and approximation problems. Note that the spectrum σ (A) can be viewed as another useful “picture” of the matrix A ∈ Mn . There are interesting relations between σ (A) and W(A).
18.1
Basic Properties and Examples
Definitions and Notation: Let A ∈ Cn×n . The numerical range (also known as the field of values) of A is defined by W(A) = {x∗ Ax : x ∈ Cn , x∗ x = 1}. The numerical radius of A and the distance of W(A) to the origin are the quantities w (A) = max{µ : µ ∈ W(A)}
and
(A) = min{µ : µ ∈ W(A)}. w
Furthermore, let W(A) = {a : a ∈ W(A)}. 181
182
Handbook of Linear Algebra
Facts: The following basic facts can be found in most references on numerical ranges such as [GR96], [Hal82], and [HJ91]. 1. Let A ∈ Cn×n , a, b ∈ C. Then W(a A + b I ) = aW(A) + b. 2. Let A ∈ Cn×n . Then W(U ∗ AU) = W(A) for any unitary U ∈ Cn×n . 3. Let A ∈ Cn×n . Suppose k ∈ {1, . . . , n − 1} and X ∈ Cn×k satisfies X ∗ X = Ik . Then W(X ∗ AX) ⊆ W(A). 4. 5. 6. 7.
In particular, for any k × k principal submatrix B of A, we have W(B) ⊆ W(A). Let A ∈ Cn×n . Then W(A) is a compact convex set in C. If A1 ⊕ A2 ∈ Mn , then W(A) = conv {W(A1 ) ∪ W(A2 )}. Let A ∈ Mn . Then W(A) = W(AT ) and W(A∗ ) = W(A). If A ∈ C2×2 has eigenvalues λ1 , λ2 , then W(A) is an elliptical disk with foci λ1 , λ2 , and minor axis
∗
with length {tr (A A) − λ1  − λ2  } 2
2 1/2
λ . Consequently, if A = 1 0
b , then the minor axis of λ2
the elliptical disk W(A) has length b. 8. Let A ∈ Cn×n . Then W(A) is a subset of a straight line if and only if there are a, b ∈ C with a = 0 such that a A + b I is Hermitian. In particular, we have the following: (a) A = a I if and only if W(A) = {a}. (b) A = A∗ if and only if W(A) ⊆ R. (c) A = A∗ is positive definite if and only if W(A) ⊆ (0, ∞). (d) A = A∗ is positive semidefinite if and only if W(A) ⊆ [0, ∞). 9. If A ∈ Cn×n is normal, then W(A) = conv σ (A) is a convex polygon. The converse is true if n ≤ 4. 10. Let A ∈ Cn×n . The following conditions are equivalent. (a) W(A) = conv σ (A). (b) W(A) is a convex polygon with vertices µ1 , . . . , µk . (c) A is unitarily similar to diag (µ1 , . . . , µk ) ⊕ B such that W(B) ⊆ conv {µ1 , . . . , µk }. 11. Let A ∈ Cn×n . Then A is unitary if and only if all eigenvalues of A have modulus one and W(A) = conv σ (A). 12. Suppose A = (Aij )1≤i, j ≤m ∈ Mn is a block matrix such that A11 , . . . , Amm are square matrices and / {(1, 2), . . . , (m − 1, m), (m, 1)}. Then W(A) = c W(A) for any c ∈ C Aij = 0 whenever (i, j ) ∈ satisfying c m = 1. If Am,1 is also zero, then W(A) is a circular disk centered at 0 with the radius equal to the largest eigenvalue of (A + A∗ )/2. Examples: 1. Let A = diag (1, 0). Then W(A) = [0, 1].
0 2. Let A = 0
2 . Then W(A) is the closed unit disk D = {a ∈ C : a ≤ 1}. 0
2 3. Let A = 0
2 . Then by Fact 7 above, W(A) is the convex set whose boundary is the ellipse with 1
foci 1 and 2 and minor axis 2, as shown in Figure 18.1.
0 4. Let A = diag (1, i, −1, −i ) ⊕ 0 vertices 1, i, −1, −i .
1 . By Facts 5 and 7, the boundary of W(A) is the square with 0
183
Numerical Range 1
0.5
0.5
1
1.5
2
–0.5
–1
FIGURE 18.1 Numerical range of the matrix A in Example 3.
Applications: 1. By Fact 6, if A is real, then W(A) is symmetric about the real axis, i.e., W(A) = W(A). 2. Suppose A ∈ Cn×n , and there are a, b ∈ C such that (A − a I )(A − b I ) = 0n . Then A is unitarily similar to a matrix of the form
a a Ir ⊕ b Is ⊕ 0
d1 a ⊕ ··· ⊕ b 0
dt b
with d1 ≥ · · · ≥ dt > 0, where r + s + 2t = n. By Facts 1, 5, and 7, the set W(A) is the elliptical disk with foci a, b and minor axis of length d, where d = d1 =
A 22 − a2 A 22 − b2
1/2
/ A 2
if t ≥ 1, and d = 0 otherwise. 3. By Fact 12, if A ∈ Cn×n is the basic circulant matrix E 12 + E 23 + · · · + E n−1,n + E n1 , then W(A) = conv {c ∈ C : c n = 1}; if A ∈ Mn is the Jordan block of zero J n (0), then W(A) = {c ∈ C : c  ≤ cos(π/(n + 1))}. 4. Suppose A ∈ Cn×n is a primitive nonnegative matrix. Then A is permutationally similar to a block matrix (Aij ) as described in Fact 12 and, thus, W(A) = c W(A) for any c ∈ C satisfying c m = 1.
18.2
The Spectrum and Special Boundary Points
Definitions and Notation: Let ∂S and int (S) be the boundary and the interior of a convex compact subset S of C. A support line of S is a line that intersects ∂S such that S lies entirely within one of the closed halfplanes determined by . A boundary point µ of S is nondifferentiable if there is more than one support line of S passing through µ. An eigenvalue λ of A ∈ Cn×n is a reducing eigenvalue if A is unitarily similar to [λ] ⊕ A2 . Facts: The following facts can be found in [GR96],[Hal82], and [HJ91]. 1. Let A ∈ Cn×n . Then σ (A) ⊆ W(A) ⊆ {a ∈ C : a ≤ A 2 }.
184
Handbook of Linear Algebra
2. Let A, E ∈ Cn×n . We have σ (A + E ) ⊆ W(A + E ) ⊆ W(A) + W(E ) ⊆ {a + b ∈ C : a ∈ W(A),
b ∈ C with
b ≤ E 2 }.
3. Let A ∈ Cn×n and a ∈ C. Then a ∈ σ (A) ∩ ∂ W(A) if and only if A is unitarily similar to a Ik ⊕ B such that a ∈ / σ (B) ∪ int (W(B)). 4. Let A ∈ Cn×n and a ∈ C. Then a is a nondifferentiable boundary point of W(A) if and only if A / W(B). In particular, a is a reducing eigenvalue of A. is unitarily similar to a Ik ⊕ B such that a ∈ 5. Let A ∈ Cn×n . If W(A) has at least n − 1 nondifferentiable boundary points or if at least n − 1 eigenvalues of A (counting multiplicities) lie in ∂ W(A), then A is normal. Examples:
0 1. Let A = [1] ⊕ 0
2 . Then W(A) is the unit disk centered at the origin, and 1 is a reducing 0
eigenvalue of A lying on the boundary of W(A).
0 2. Let A = [2] ⊕ 0
2 . Then W(A) is the convex hull of unit disk centered at the origin of the 0
number 2, and 2 is a nondifferentiable boundary point of W(A). Applications: 1. By Fact 1, if A ∈ Cn×n and 0 ∈ / W(A), then 0 ∈ / σ (A) and, thus, A is invertible. 2. By Fact 4, if A ∈ Cn×n , then W(A) has at most n nondifferentiable boundary points. 3. While W(A) does not give a very tight containment region for σ (A) as shown in the examples in the last section. Fact 2 shows that the numerical range can be used to estimated the spectrum of the resulting matrix when A is under a perturbation E . In contrast, σ (A) and σ (E ) usually
0 do not carry much information about σ (A + E ) in general. For example, let A = 0
M and 0
√ 0 . Then σ (A) = σ (E ) = {0}, σ (A + E ) = {± Mε} ⊆ W(A + E ), which is the 0 √ elliptical disk with foci ± Mε and length of minor axis equal to  M − ε . 0 E = ε
18.3
Location of the Numerical Range
Facts: The following facts can be found in [HJ91]. 1. Let A ∈ Cn×n and t ∈ [0, 2π). Suppose xt ∈ Cn is a unit eigenvector corresponding to the largest eigenvalue λ1 (t) of e i t A + e −i t A∗ , and Pt = {a ∈ C : e it a + e −it a¯ ≤ λ1 (t)}. Then e it W(A) ⊆ Pt ,
λt = x∗t Axt ∈ ∂ W(A) ∩ ∂Pt
185
Numerical Range
and W(A) = ∩r ∈[0,2π) e −ir Pr = conv {λr : r ∈ [0, 2π )}. If T = {t1 , . . . , tk } with 0 ≤ t1 < · · · < tk < 2π and k > 2 such that tk − t1 > π, then PTO (A) = ∩r ∈T e −ir Pr
and
PTI (A) = conv {λr : r ∈ T }
are two polygons in C such that PTI (A) ⊆ W(A) ⊆ PTO (A). Moreover, both the area W(A)\ PTI (A) and the area of PTO (A)\W(A) converge to 0 as max{t j −t j −1 : 1 ≤ j ≤ k + 1} converges to 0, where t0 = 0, tk+1 = 2π. 2. Let A = (aij ) ∈ Cn×n . For each j = 1, . . . , n, let gj =
(aij  + a j i )/2
and
G j (A) = {a ∈ C : a − a j j  ≤ g j }.
i = j
Then W(A) ⊆ conv ∪nj=1 G j (A). Examples:
2 2 1. Let A = . Then W(A) is the circular disk centered at 2 with radius 1 In Figure 18.2, W(A) 0 2 is approximated by PTO (A) with T = {2kπ/100 : 0 ≤ k ≤ 99}. If T = {0, π/2, π, 3π/2}, then the polygon PTO (A) in Fact 1 is bounded by the four lines {3 + bi : b ∈ R}, {a + i : a ∈ R}, {1 + bi : b ∈ R}, {a −i : a ∈ R}, and the polygon PTI (A) equals the convex hull of {2, 1 +i, 0, 1 −i }. ⎡
5i ⎢ 2. Let A = ⎣ 4 1
2 −3i 3
⎤
3 ⎥ −2⎦. In Figure 18.3, W(A) is approximated by PTO (A) with T = {2kπ/100 : 9
0 ≤ k ≤ 99}. By Fact 2, W(A) lies in the convex hull of the circles G 1 = {a ∈ C : a − 5i  ≤ 5}, G 2 = {a ∈ C : a + 3i  ≤ 5.5}, G 3 = {a ∈ C : a − 9 ≤ 4.5}.
1.5
imaginary axis
1 0.5 0 −0.5 −1 −1.5 0.5
1
1.5
2 real axis
2.5
3
3.5
FIGURE 18.2 Numerical range of the matrix A in Example 1.
186
Handbook of Linear Algebra
10 8 6 imaginary axis
4 2 0 −2 −4 −6 −8 −6
−4
−2
0
2 4 real axis
6
8
10
12
FIGURE 18.3 Numerical range of the matrix A in Example 2.
Applications: 1. Let A = H + i G , where H, G ∈ Cn×n are Hermitian. Then W(A) ⊆ W(H) + i W(G ) = {a + i b : a ∈ W(H), b ∈ W(G )}, which is PTO (A) for T = {0, π/2, π, 3π/2}. 2. Let A = H + i G , where H, G ∈ Cn×n are Hermitian. Denote by λ1 (X) ≥ · · · ≥ λn (X) for a Hermitian matrix X ∈ Cn×n . By Fact 1, w (A) = max{λ1 (cos t H + sin tG ) : t ∈ [0, 2π )}. If 0 ∈ / W(A), then (A) = max{{λn (cos t H + sin tG ) : t ∈ [0, 2π)} ∪ {0}}. w
3. By Fact 2, if A = (aij ) ∈ Cn×n , then w (A) ≤ max{a j j  + g j : 1 ≤ j ≤ n}. In particular, if A is nonnegative, then w (A) = λ1 (A + AT )/2.
18.4
Numerical Radius
Definitions: Let N be a vector norm on Cn×n . It is submultiplicative if N(AB) ≤ N(A)N(B)
for all
A, B ∈ Cn×n .
It is unitarily invariant if N(UAV) = N(A)
for all
A ∈ Cn×n and unitary U, V ∈ Cn×n .
It is unitary similarity invariant (also known as weakly unitarily invariant) if N(U ∗ AU) = N(A)
for all
A ∈ Cn×n and unitary U ∈ Cn×n .
187
Numerical Range
Facts: The following facts can be found in [GR96] and [HJ91]. 1. The numerical radius w (·) is a unitary similarity invariant vector norm on Cn×n , and it is not unitarily invariant. 2. For any A ∈ Cn×n , we have ρ(A) ≤ w (A) ≤ A 2 ≤ 2w (A). 3. Suppose A ∈ Cn×n is nonzero and the minimal polynomial of A has degree m. The following conditions are equivalent. (a) ρ(A) = w (A). (b) There exists k ≥ 1 such that A is unitarily similar to γ U ⊕ B for a unitary U ∈ Ck×k and B ∈ C(n−k)×(n−k) with w (B) ≤ w (A) = γ . (c) There exists s ≥ m such that w (As ) = w (A)s . 4. Suppose A ∈ Cn×n is nonzero and the minimal polynomial of A has degree m. The following conditions are equivalent. (a) ρ(A) = A 2 . (b) w (A) = A 2 . (c) There exists k ≥ 1 such that A is unitarily similar to γ U ⊕ B for a unitary U ∈ Ck×k and a B ∈ C(n−k)×(n−k) with B 2 ≤ A 2 = γ . (d) There exists s ≥ m such that As 2 = A s2 . 5. Suppose A ∈ Cn×n is nonzero. The following conditions are equivalent. (a) A 2 = 2w (A). (b) W(A) is a circular disk centered at origin with radius A 2 /2.
0 (c) A/ A 2 is unitarily similar to A1 ⊕ A2 such that A1 = 0
2 and w (A2 ) ≤ 1. 0
6. The vector norm 4w on Cn×n is submultiplicative, i.e., 4w (AB) ≤ (4w (A))(4w (B)) for all
A, B ∈ Cn×n .
The equality holds if
0 X=Y = 0 T
2 . 0
7. Let A ∈ Cn×n and k be a positive integer. Then w (Ak ) ≤ w (A)k . 8. Let N be a unitary similarity invariant vector norm on Cn×n such that N(Ak ) ≤ N(A)k for any A ∈ Cn×n and positive integer k. Then w (A) ≤ N(A)
for all
A ∈ Cn×n .
9. Suppose N is a unitarily invariant vector norm on Cn×n . Let
D=
2Ik ⊕ 0k 2Ik ⊕ I1 ⊕ 0k
if n = 2k, if n = 2k + 1.
188
Handbook of Linear Algebra
Then a = N(E 11 ) and b = N(D) are the best (largest and smallest) constants such that aw (A) ≤ N(A) ≤ bw (A)
A ∈ Cn×n .
for all
10. Let A ∈ Cn×n . The following are equivalent: (a) w (A) ≤ 1. (b) λ1 (e i t A + e −i t A∗ )/2 ≤ 1 for all t ∈ [0, 2π).
(c) There is Z ∈ C
n×n
I +Z such that n ∗ A
A is positive semidefinite. In − Z
(d) There exists X ∈ C2n×n satisfying X ∗ X = In and
A=X
18.5
∗
0n
2In
0n
0n
X.
Products of Matrices
Facts: The following facts can be found in [GR96] and [HJ91]. (A) > 0. Then 1. Let A, B ∈ Cn×n be such that w
σ (A−1 B) ⊆ {b/a : a ∈ W(A), b ∈ W(B)}. 2. Let 0 ≤ t1 < t2 < t1 + π and S = {rei t : r > 0, t ∈ [t1 , t2 ]}. Then σ (A) ⊆ S if and only if there is a positive definite B ∈ Cn×n such that W(AB) ⊆ S. 3. Let A, B ∈ Cn×n . (a) (b) (c) (d)
If AB = BA, then w (AB) ≤ 2w (A)w (B). If A or B is normal such that AB = BA, then w (AB) ≤ w (A)w (B). If A2 = a I and AB = B A, then w (AB) ≤ A 2 w (B). If AB = BA and AB∗ = B ∗ A, then w (AB) ≤ min{w (A) B 2 , A 2 w (B)}.
4. Let A and B be square matrices such that A or B is normal. Then W(A ◦ B) ⊆ W(A ⊗ B) = conv {W(A)W(B)}. Consequently, w (A ◦ B) ≤ w (A ⊗ B) = w (A)w (B). (See Chapter 8.5 and 10.4 for the definitions of t A ◦ B and A ⊗ B.) 5. Let A and B be square matrices. Then w (A ◦ B) ≤ w (A ⊗ B) ≤ min{w (A) B 2 , A 2 w (B)} ≤ 2w (A)w (B). 6. Let A ∈ Cn×n . Then w (A ◦ X) ≤ w (X)
for all
X ∈ Cn×n
if and only if A = B ∗ WB such that W satisfies W ≤ 1 and all diagonal entries of B ∗ B are bounded by 1.
189
Numerical Range
Examples: 1. Let A ∈ C9×9 be the Jordan block of zero J 9 (0), and B = A3 + A7 . Then w (A) = w (B) = cos(π/10) < 1 and w (AB) = 1 > A 2 w (B). So, even if AB = BA, we may not have w (AB) ≤ min{w (A) B 2 , A 2 w (B)}.
1 2. Let A = 0
1 . Then W(A) = {a ∈ C : a − 1 ≤ 1/2} 1
and
W(A2 ) = {a ∈ C : a − 1 ≤ 1}, whereas conv W(A)2 ⊆ {sei t ∈ C : s ∈ [0.25, 2.25], t ∈ [−π/3, π/3]}. So, W(A2 ) ⊆ conv W(A)2 .
1 3. Let A = 0
0 −1
and
0 B= 1
1 . Then σ (AB) = {i, −i }, W(AB) = i [−1, 1], and W(A) = 0
W(B) = W(A)W(B) = [−1, 1]. So, σ (AB) ⊆ conv W(A)W(B). Applications: 1. If C ∈ Cn×n is positive definite, then W(C −1 ) = W(C )−1 = {c −1 : c ∈ W(C )}. Applying Fact 1 with A = C −1 , σ (CB) ⊆ W(C )W(B). (C ) > 0, then for every unit vector x ∈ Cn x∗ C −1 x = y∗ C ∗ C −1 C y with 2. If C ∈ Cn×n satisfies w −1 y = C x and, hence,
W(C −1 ) ⊆ {r b : r ≥ 0,
b ∈ W(C ∗ )} = {r b : r ≥ 0,
b ∈ W(C )}.
Applying this observation and Fact 1 with A = C −1 , we have σ (AB) ⊆ {r ab : r ≥ 0,
18.6
a ∈ W(A),
b ∈ W(B)}.
Dilations and Norm Estimation
Definitions: A matrix A ∈ Cn×n has a dilation B ∈ Cm×m if there is X ∈ Cm×n such that X ∗ X = In and X ∗ B X = A. A matrix A ∈ Cn×n is a contraction if A 2 ≤ 1. Facts: The following facts can be found in [CL00],[CL01] and their references. 1. A has a dilation B if and only if B is unitarily similar to a matrix of the form
A ∗ . ∗ ∗
2. Suppose B ∈ C3×3 has a reducing eigenvalue, or B ∈ C2×2 . If W(A) ⊆ W(B), then A has a dilation of the form B ⊗ Im .
1810
Handbook of Linear Algebra
3. Let r ∈ [−1, 1]. Suppose A ∈ Cn×n is a contraction with W(A) ⊆ S = {a ∈ C : a + a¯ ≤ 2r }. Then A has a unitary dilation U ∈ C2n×2n such that W(U ) ⊆ S. 4. Let A ∈ Cn×n . Then W(A) = ∩{W(B) : B ∈ C2n×2n is a normal dilation of A}. If A is a contraction, then W(A) = ∩{W(U ) : U ∈ C2n×2n is a unitary dilation of A}. 5. Let A ∈ Cn×n . (a) If W(A) lies in an triangle with vertices z 1 , z 2 , z 3 , then
A 2 ≤ max{z 1 , z 2 , z 3 }. (b) If W(A) lies in an ellipse E with foci λ1 , λ2 , and minor axis of length b, then
A 2 ≤ { (λ1  + λ2 )2 + b 2 +
(λ1  − λ2 )2 + b 2 }/2.
More generally, if W(A) lies in the convex hull of the ellipse E and the point z 0 , then
A 2 ≤ max z 0 , { (λ1  + λ2 )2 + b 2 +
(λ1  − λ2 )2 + b 2 }/2 .
6. Let A ∈ Cn×n . Suppose there is t ∈ [0, 2π) such that e i t W(A) lies in a rectangle R centered at z 0 ∈ C with vertices z 0 ± α ± iβ and z 0 ± α ∓ iβ, where α, β > 0, so that z 1 = z 0 + α + iβ has the largest magnitude. Then
A 2 ≤
z 1  α+β
if R ⊆ conv {z 1 , z¯ 1 , −¯z 1 }, otherwise.
The bound in each case is attainable. Examples:
0 1. Let A = 0
√ 2 . Suppose 0 ⎡
1
0
B =⎢ ⎣0 0
0
1⎥ ⎦
0
0
⎢
⎡
⎤
0
⎥
0
0
⎢0 i B =⎢ ⎢0 0 ⎣
0
⎢
or
1
0
0
−1 0
0
⎤
⎥ ⎥. 0⎥ ⎦
0⎥ −i
Then W(A) ⊆ W(B). However, A does not have a dilation of the form B ⊗ Im for either of the matrices because √
A 2 = 2 > 1 = B 2 = B ⊗ Im 2 . So, there is no hope to further extend Fact 1 in this section to arbitrary B ∈ C3×3 or normal matrix B ∈ C4×4 .
1811
Numerical Range
18.7
Mappings on Matrices
Definitions: Let φ : Cn×n → Cm×m be a linear map. It is unital if φ(In ) = Im ; it is positive if φ(A) is positive semidefinite whenever A is positive semidefinite. Facts: The following facts can be found in [GR96] unless another reference is given. 1. [HJ91] Let P(C) be the set of subsets of C. Suppose a function F : Cn×n → P(C) satisfies the following three conditions. (a) F (A) is compact and convex for every A ∈ Cn×n . (b) F (a A + b I ) = a F (A) + b for any a, b ∈ C and A ∈ Cn×n . (c) F (A) ⊆ {a ∈ C : a + a¯ ≥ 0} if and only if A + A∗ is positive semidefinite. Then F (A) = W(A) for all A ∈ Cn×n . 2. Use the usual topology on Cn×n and the Hausdorff metric on two compact sets A, B of C defined by
d(A, B) = max max a∈A
min a − b, max b∈B
b∈B
min a − b a∈A
The mapping A → W(A) is continuous. 3. Suppose f (x + i y) = (ax + by + c ) + i (d x + e y + f ) for some real numbers a, b, c , d, e, f . Define f (H + i G ) = (a H + bG + c I ) + i (d H + eG + f I ) for any two Hermitian matrices H, G ∈ Cn×n . We have W( f (H + i G )) = f (W(A)) = { f (x + i y) : x + i y ∈ W(A)}. 4. Let D = {a ∈ C : a ≤ 1}. Suppose f : D → C is analytic in the interior of D and continuous on the boundary of D. (a) If f (D) ⊆ D and f (0) = 0, then W( f (A)) ⊆ D whenever W(A) ⊆ D. (b) If f (D) ⊆ C+ = {a ∈ C : a + a¯ ≥ 0}, then W( f (A)) ⊆ C+ \ {( f (0) + f (0))/2} whenever W(A) ⊆ D. 5. Suppose φ : Cn×n → Cn×n is a unital positive linear map. Then W(φ(A)) ⊆ W(A) for all A ∈ Cn×n . 6. [Pel75] Let φ : Cn×n → Cn×n be linear. Then W(A) = W(φ(A))
for all
A ∈ Cn×n
if and only if there is a unitary U ∈ Cn×n such that φ has the form X → U ∗ XU
or
X → U ∗ X T U.
7. [Li87] Let φ : Cn×n → Cn×n be linear. Then w (A) = w (φ(A)) for all A ∈ Cn×n if and only if there exist a unitary U ∈ Cn×n and a complex unit µ such that φ has the form X → µU ∗ XU
or
X → µU ∗ X T U.
References [CL00] M.D. Choi and C.K. Li, Numerical ranges and dilations, Lin. Multilin. Alg. 47 (2000), 35–48. [CL01] M.D. Choi and C.K. Li, Constrained unitary dilations and numerical ranges, J. Oper. Theory 46 (2001), 435–447.
1812
Handbook of Linear Algebra
[GR96] K.E. Gustafson and D.K.M. Rao, Numerical Range: the Field of Values of Linear Operators and Matrices, Springer, New York, 1996. [Hal82] P.R. Halmos, A Hilbert Space Problem Book, 2nd ed., SpringerVerlag, New York, 1982. [HJ91]R.A. Horn and C.R. Johnson, Topics in Matrix Analysis, Cambridge University Press, New York, 1991. [Li87]C.K. Li, Linear operators preserving the numerical radius of matrices, Proc. Amer. Math. Soc. 99 (1987), 105–118. [Pel75] V. Pellegrini, Numerical range preserving operators on matrix algebras, Studia Math. 54 (1975), 143–147.
19 Matrix Stability and Inertia
Daniel Hershkowitz Technion  Israel Institute of Technology
19.1 Inertia . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19.2 Stability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19.3 Multiplicative DStability . . . . . . . . . . . . . . . . . . . . . . . . . . 19.4 Additive DStability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19.5 Lyapunov Diagonal Stability . . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
192 193 195 197 199 1910
Much is known about spectral properties of square (complex) matrices. There are extensive studies of eigenvalues of matrices in certain classes. Some of the studies concentrate on the inertia of the matrices, that is, distribution of the eigenvalues in halfplanes. A special inertia case is of stable matrices, that is, matrices whose spectrum lies in the open left or right halfplane. These, and other related types of matrix stability, play an important role in various applications. For this reason, matrix stability has been intensively investigated in the past two centuries. A. M. Lyapunov, called by F. R. Gantmacher “the founder of the modern theory of stability,” studied the asymptotic stability of solutions of differential systems. In 1892, he proved a theorem that was restated (first, apparently, by Gantmacher in 1953) as a necessary and sufficient condition for stability of a matrix. In 1875, E. J. Routh introduced an algorithm that provides a criterion for stability. An independent solution was given by A. Hurwitz. This solution is known nowadays as the Routh–Hurwitz criterion for stability. Another criterion for stability, which has a computational advantage over the Routh–Hurwitz criterion, was proved in 1914 by Li´enard and Chipart. The equivalent of the Routh–Hurwitz and Li´enard–Chipart criteria was observed by M. Fujiwara. The related problem of requiring the eigenvalues to be within the unit circle was solved separately in the early 1900s by I. Schur and Cohn. The abovementioned studies have motivated an intensive search for conditions for matrix stability. An interesting question, related to stability, is the following one: Given a square matrix A, can we find a diagonal matrix D such that the matrix D A is stable? This question can be asked in full generality, as suggested above, or with some restrictions on the matrix D, such as positivity of the diagonal elements. A related problem is characterizing matrices A such that for every positive diagonal matrix D, the matrix D A is stable. Such matrices are called multiplicative Dstable matrices. This type of matrix stability, as well as two other related types, namely additive Dstability and Lyapunov diagonal (semi)stability, have important applications in many disciplines. Thus, they are very important to characterize. While regular stability is a spectral property (it is always possible to check whether a given matrix is stable or not by evaluating its eigenvalues), none of the other three types of matrix stability can be characterized by the spectrum of the matrix. This problem has been solved for certain classes of matrices. For example, for Zmatrices all the stability types are equivalent. Another case in which these characterization problems have been solved is the case of acyclic matrices. 191
192
Handbook of Linear Algebra
Several surveys handle the abovementioned types of matrix stability, e.g., the books [HJ91] and [KB00], and the articles [Her92], [Her98], and [BH85]. Finally, the mathematical literature has studies of other types of matrix stability, e.g., the abovementioned Schur–Cohn stability (where all the eigenvalues lie within the unit circle), e.g., [Sch17] and [Zah92]; Hstability, e.g., [OS62], [Car68], and [HM98]; L 2 stability and strict Hstability, e.g., [Tad81]; and scalar stability, e.g., [HM98].
19.1
Inertia
Much is known about spectral properties of square matrices. In this chapter, we concentrate on the distribution of the eigenvalues in halfplanes. In particular, we refer to results that involve the expression AH + H A∗ , where A is a square complex matrix and H is a Hermitian matrix. Definitions: For a square complex matrix A, we denote by π (A) the number of eigenvalues of A with positive real part, by δ(A) the number of eigenvalues of A on the imaginary axis, and by ν(A) the number of eigenvalues of A with negative real part. The inertia of A is defined as the triple in( A) = (π(A), ν(A), δ(A)). Facts: All the facts are proven in [OS62]. 1. Let A be a complex square matrix. There exists a Hermitian matrix H such that the matrix AH + H A∗ is positive definite if and only if δ(A) = 0. Furthermore, in such a case the inertias of A and H are the same. 2. Let {λ1 , . . . , λn } be the eigenvalues of an n × n matrix A. If i,n j =1 (λi + λ j ) = 0, then for any positive definite matrix P there exists a unique Hermitian matrix H such that AH + H A∗ = P . Furthermore, the inertias of A and H are the same. 3. Let A be a complex square matrix. We have δ(A) = π(A) = 0 if and only if there exists an n × n positive definite Hermitian matrix such that the matrix −(AH + H A∗ ) is positive definite. Examples: 1. It follows from Fact 1 above that a complex square matrix A has all of its eigenvalues in the right halfplane if and only if there exists a positive definite matrix H such that the matrix AH + H A∗ is positive definite. This fact, associating us with the discussion of the next section, is due to Lyapunov, originally proven in [L1892] for systems of differential equations. The matrix formulation is due to [Gan60]. 2. In order to demonstrate that both the existence and uniqueness claims of Fact 2 may be false without the condition on the eigenvalues, consider the matrix
1 A= 0
0 , −1
for which the condition of Fact 2 is not satisfied. One can check that the only positive definite solutions are matrices of the matrices P for whichthe equation AH + H A∗ = P has Hermitian p11 0 2 0 type P = , p11 , p22 > 0. Furthermore, for P = it is easy to verify that the 0 p22 0 4 Hermitian solutions of AH + H A∗ = P are all matrices H of the type
1 c¯
c , −2
c ∈ C.
193
Matrix Stability and Inertia
If we now choose
1 A= 0
0 , −2
a then here the condition of Fact 2 is satisfied. Indeed, for H = c¯
2a AH + H A = −¯c ∗
c we have b
−c , −4b
which can clearly be solved uniquely for any Hermitian matrix P ; specifically, for P =
the unique Hermitian solution H of AH + H A∗ = P is
19.2
1 0
2 0
0 , 4
0 . −1
Stability
Definitions: A complex polynomial is negative stable [positive stable] if its roots lie in the open left [right] halfplane. A complex square matrix A is negative stable [positive stable] if its characteristic polynomial is negative stable [positive stable]. We shall use the term stable matrix for positive stable matrix. For an n × n matrix A and for an integer k, 1 ≤ k ≤ n, we denote by Sk (A) the sum of all principal minors of A of order k. The Routh–Hurwitz matrix associated with A is defined to be the matrix ⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣
S1 (A) 1 0 0 0 · · · 0
S3 (A) S2 (A) S1 (A) 1 0 · · · 0
S5 (A) S4 (A) S3 (A) S2 (A) S1 (A) · · · 0
·
·
· · ·
· · ·
·
·
·
· · · ·
·
· · · ·
0 · · · · 0 Sn (A) Sn−1 (A) Sn−2 (A)
⎤
0 · ⎥ ⎥ ⎥ · ⎥ ⎥ · ⎥ ⎥ · ⎥ ⎥. 0 ⎥ ⎥ ⎥ 0 ⎥ ⎥ 0 ⎦ Sn (A)
A square complex matrix is a P matrix if it has positive principal minors. A square complex matrix is a P0+ matrix if it has nonnegative principal minors and at least one principal minor of each order is positive. A principal minor of a square matrix is a leading principal minor if it is based on consecutive rows and columns, starting with the first row and column of the matrix. An n × n real matrix A is sign symmetric if it satisfies det A[α, β] det A[β, α] ≥ 0,
∀α, β ⊆ {1, . . . , n} , α = β.
An n × n real matrix A is weakly sign symmetric if it satisfies det A[α, β] det A[β, α] ≥ 0,
∀α, β ⊆ {1, . . . , n} , α = β = α ∩ β + 1.
A square real matrix is a Zmatrix if it has nonpositive offdiagonal elements.
194
Handbook of Linear Algebra
A Zmatrix with positive principal minors is an Mmatrix. (See Section 24.5 for more information and an equivalent definition.) Facts: Lyapunov studied the asymptotic stability of solutions of differential systems. In 1892 he proved in his paper [L1892] a theorem which yields a necessary and sufficient condition for stability of a complex matrix. The matrix formulation of Lyapunov’s Theorem is apparently due to Gantmacher [Gan60], and is given as Fact 1 below. The theorem in [Gan60] was proven for real matrices; however, as was also remarked in [Gan60], the generalization to the complex case is immediate. 1. The Lyapunov Stability Criterion: A complex square matrix A is stable if and only if there exists a positive definite Hermitian matrix H such that the matrix AH + H A∗ is positive definite. 2. [OS62] A complex square matrix A is stable if and only if for every positive definite matrix G there exists a positive definite matrix H such that the matrix AH + H A∗ = G . 3. [R1877], [H1895] The Routh–Hurwitz Stability Criterion: An n × n complex matrix A with a real characteristic polynomial is stable if and only if the leading principal minors of the Routh–Hurwitz matrix associated with A are all positive. 4. [LC14] (see also [Fuj26]) The Li´enard–Chipart Stability Criterion: Let A be an n × n complex matrix with a real characteristic polynomial. The following are equivalent: (a) A is stable. (b) Sn (A), Sn−2 (A), . . . > 0 and the odd order leading principal minors of the Routh–Hurwitz matrix associated with A are positive. (c) Sn (A), Sn−2 (A), . . . > 0 and the even order leading principal minors of the Routh–Hurwitz matrix associated with A are positive. (d) Sn (A), Sn−1 (A), Sn−3 (A), . . . > 0 and the odd order leading principal minors of the Routh– Hurwitz matrix associated with A are positive. (e) Sn (A), Sn−1 (A), Sn−3 (A), . . . > 0 and the even order leading principal minors of the Routh– Hurwitz matrix associated with A are positive. 5. [Car74] Sign symmetric P matrices are stable. 6. [HK2003] Sign symmetric stable matrices are P matrices. 7. [Hol99] Weakly sign symmetric P matrices of order less than 6 are stable. Nevertheless, in general, weakly sign symetric P matrices need not be stable. 8. (For example, [BVW78]) A Zmatrix is stable if and only if it is a P matrix (that is, it is an Mmatrix). 9. [FHR05] Let A be a stable real square matrix. Then either all the diagonal elements of A are positive or A has at least one positive diagonal element and one positive offdiagonal element. 10. [FHR05] Let ζ be an ntuple of complex numbers, n > 1, consisting of real numbers and conjugate pairs. There exists a real stable n × n matrix A with exactly two positive entries such that ζ is the spectrum of A. Examples: 1. Let
⎡
2 ⎢ A = ⎣2 3
2 5 4
The Routh–Hurwitz matrix associated with A is ⎡
12 ⎢ ⎣1 0
⎤
3 ⎥ 4⎦ . 5 ⎤
1 0 ⎥ 16 0⎦. 12 1
195
Matrix Stability and Inertia
It is immediate to check that the latter matrix has positive leading principal minors. It, thus, follows that A is stable. Indeed, the eigenvalues of A are 1.4515, 0.0657, and 10.4828. 2. Stable matrices do not form a convex set, as is easily demonstrated by the stable matrices
1 0
1 , 1
1 9
0 , 1
2 1 has eigenvalues −1 and 5. Clearly, convex sets of stable matrices do exist. An whose sum 9 2 example of such a set is the set of upper (or lower) triangular matrices with diagonal elements in the open right halfplane. Nevertheless, there is no obvious link between matrix stability and convexity or conic structure. Some interesting results on stable convex hulls can be found in [Bia85], [FB87], [FB88], [CL97], and [HS90]. See also the survey in [Her98]. 3. In view of Facts 5 and 7 above, it would be natural to ask whether stability of a matrix implies that the matrix is a P matrix or a weakly sign symmetric matrix. The answer to this question is negative as is demonstrated by the matrix
−1 A= −5
1 . 3
The eigenvalues of A are 1 ± i , and so A is stable. Nevertheless, A is neither a P matrix nor a weakly sign symmetric matrix. 4. Sign symmetric P0+ matrices are not necessarily stable, as is demonstrated by the sign symmetric P0+ matrix ⎡
1 ⎢0 ⎢ ⎢ A = ⎢0 ⎢ ⎣0 0
0 1 0 0 0
0 0 0 0 1
0 0 1 0 0
⎤
0 0⎥ ⎥ ⎥ 0⎥ . ⎥ 1⎦ 0
The matrix A is not stable, having the eigenvalues e ± 3 , 1, 1, 1 . 5. A P matrix is not necessarily stable as is demonstrated by the matrix ⎡
1 ⎢ ⎣3 0
0 1 3
2πi
⎤
3 ⎥ 0⎦ . 1
For extensive study of spectra of P matrices look at [HB83], [Her83], [HJ86], [HS93], and [HK2003].
19.3
Multiplicative DStability
Multiplicative Dstability appears in various econometric models, for example, in the study of stability of multiple markets [Met45]. Definitions: A real square matrix A is multiplicative Dstable if D A is stable for every positive diagonal matrix D. In the literature, multiplicative Dstable matrices are usually referred to as just Dstable matrices. A real square matrix A is inertia preserving if the inertia of AD is equal to the inertia of D for every nonsingular real diagonal matrix D.
196
Handbook of Linear Algebra
The graph G (A) of an n × n matrix A is the simple graph whose vertex set is {1, . . . , n}, and where there is an edge between two vertices i and j (i = j ) if and only if ai j = 0 or a j i = 0. (See Chapter 28 more information on graphs.) The matrix A is said to be acyclic if G (A) is a forest. Facts: The problem of characterizing multiplicative Dstabity for certain classes and for matrices of order less than 5 is dealt with in several publications (e.g., [Cai76], [CDJ82], [Cro78], and [Joh74b]). However, in general, this problem is still open. Multiplicative Dstability is characterized in [BH84] for acyclic matrices. That result generalizes the handling of tridiagonal matrices in [CDJ82]. Characterization of multiplicative Dstability using cones is given in [HSh88]. See also the survey in [Her98]. 1. Tridiagonal matrices are acyclic, since their graphs are paths or unions of disjoint paths. 2. [FF58] For a real square matrix A with positive leading principal minors there exists a positive diagonal matrix D such that D A is stable. 3. [Her92] For a complex square matrix A with positive leading principal minors there exists a positive diagonal matrix D such that D A is stable. 4. [Cro78] Multiplicative Dstable matrices are P0+ matrices. 5. [Cro78] A 2 × 2 real matrix is multiplicative Dstable if and only if it is a P0+ matrix. 6. [Cai76] A 3 × 3 real matrix A is multiplicative Dstable if and only if A + D is multiplicative Dstable for every nonnegative diagonal matrix D. 7. [Joh75] A real square matrix A is multiplicative Dstable if and only if A ± i D is nonsingular for every positive diagonal matrix D. 8. (For example, [BVW78]) A Zmatrix is multiplicative Dstable if and only if it is a P matrix (that is, it is an Mmatrix). 9. [BS91] Inertia preserving matrices are multiplicative Dstable. 10. [BS91] An irreducible acyclic matrix is multiplicative Dstable if and only if it is inertia preserving. 11. [HK2003] Let A be a sign symmetric square matrix. The following are equivalent: (a) The matrix A is stable. (b) The matrix A has positive leading principal minors. (c) The matrix A is a P matrix. (d) The matrix A is multiplicative Dstable. (e) There exists a positive diagonal matrix D such that the matrix D A is stable. Examples: 1. In order to illustrate Fact 2, let ⎡
1 ⎢ A = ⎣0 4
1 1 1
⎤
1 ⎥ 1⎦. 2
The matrix A is not stable, having the eigenvalues 4.0606 and −0.0303 ± 0.4953i . Nevertheless, since A has positive leading minors, by Fact 2 there exists a positive diagonal matrix D such that the matrix D A is stable. Indeed, the eigenvalues of ⎡
1
⎢ ⎣0
0 are 1.7071, 0.2929, and 0.2.
0 1 0
⎤⎡
0 1 ⎥⎢ 0 ⎦ ⎣0 0.1 4
1 1 1
⎤
⎡
1 1 ⎥ ⎢ 1⎦ = ⎣ 0 2 0.4
1 1 0.1
⎤
1 ⎥ 1⎦ 0.2
197
Matrix Stability and Inertia
2. In order to illustrate Fact 4, let
⎡
1 ⎢ A = ⎣−1 0
1 0 1
⎤
0 ⎥ 1⎦. 2
The matrix A is stable, having the eigenvalues 0.3376 ± 0.5623i and 2.3247. Yet, we have det A[{2, 3}] < 0, and so A is not a P0+ matrix. Indeed, observe that the matrix ⎡
0.1 ⎢ ⎣0 0
⎤⎡
0 0 1 ⎥⎢ 1 0⎦ ⎣−1 0 1 0
⎤
1 0 1
⎡
0 0.1 0.1 ⎥ ⎢ 1⎦ = ⎣−1 0 2 0 1
⎤
0 ⎥ 1⎦ 2
is not stable, having the eigenvalues −0.1540 ± 0.1335i and 2.408. 3. While stability is a spectral property, and so it is always possible to check whether a given matrix is stable or not by evaluating its eigenvalues, multiplicative Dstability cannot be characterized by the spectrum of the matrix, as is demonstrated by the following two matrices
1 A= 0
0 , 2
−1 B= −3
2 . 4
The matrices A and B have the same spectrum. Nevertheless, while A is multiplicative Dstable, B is not, since it is not a P0+ matrix. Indeed, the matrix
5 0
0 1
−1 −3
2 −5 = 4 −3
10 4
has eigenvalues −0.5 ± 3.1225i . 4. It is shown in [BS91] that the converse of Fact 9 is not true, using the following example from [Har80]: ⎡
1 ⎢ A = ⎣1 1
0 1 1
⎤
−50 ⎥ 0 ⎦. 1
The matrix A is multiplicative Dstable (by the characterization of 3 × 3 multiplicative Dstable matrices, proven in [Cai76]). However, for D = diag (−1, 3, −1) the matrix AD is stable and, hence, A is not inertia preserving. In fact, it is shown in [BS91] that even P matrices that are both Dstable and Lyapunov diagonally semistable (see section 19.5) are not necessarily inertia preserving.
19.4
Additive DStability
Applications of additive Dstability may be found in linearized biological systems, e.g., [Had76]. Definitions: A real square matrix A is said to be additive Dstable if A + D is stable for every nonnegative diagonal matrix D. In some references additive Dstable matrices are referred to as strongly stable matrices. Facts: The problem of characterizing additive Dstability for certain classes and for matrices of order less than 5 is dealt with in several publications (e.g., [Cai76], [CDJ82], [Cro78], and [Joh74b]). However, in general,
198
Handbook of Linear Algebra
this problem is still open. Additive Dstability is characterized in [Her86] for acyclic matrices. That result generalizes the handling of tridiagonal matrices in [Car84]. [Cro78] Additive Dstable matrices are P0+ matrices. [Cro78] A 2 × 2 real matrix is additive Dstable if and only if it is a P0+ matrix. [Cro78] A 3 × 3 real matrix A is additive Dstable if and only if it is a P0+ matrix and stable. (For example, [BVW78]) A Zmatrix is additive Dstable if and only if it is a P matrix (that is, it is an Mmatrix). 5. An additive Dstable matrix need not be multiplicative Dstable (cf. Example 3). 6. [Tog80] A multiplicative Dstable matrix need not be additive Dstable.
1. 2. 3. 4.
Examples: 1. In order to illustrate Fact 1, let
⎡
1 ⎢ A = ⎣−1 0
⎤
1 0 1
0 ⎥ 1⎦. 2
The matrix A is stable, having the eigenvalues 0.3376 ± 0.5623i and 2.3247. Yet, we have det A[2, 32, 3] < 0, and so A is not a P0+ matrix. Indeed, observe that the matrix ⎡
1 ⎢ ⎣−1 0
1 0 1
⎤
⎡
0 2 ⎥ ⎢ 1⎦ + ⎣0 2 0
⎤
0 0 0
⎡
0 3 ⎥ ⎢ 0⎦ = ⎣−1 0 0
1 0 1
⎤
0 ⎥ 1⎦ 2
is not stable, having the eigenvalues 2.5739 ± 0.3690i and −0.1479. 2. While stability is a spectral property, and so it is always possible to check whether a given matrix is stable or not by evaluating its eigenvalues, additive Dstability cannot be characterized by the spectrum of the matrix, as is demonstrated by the following two matrices:
1 0
A=
0 , 2
B=
−1 −3
2 . 4
The matrices A and B have the same spectrum. Nevertheless, while A is additive Dstable, B is not, since it is not a P0+ matrix. Indeed, the matrix
−1 −3
2 0 + 4 0
0 −1 = 3 −3
has eigenvalues −0.1623 and 6.1623. 3. In order to demonstrate Fact 5, consider the matrix ⎡
2 7
⎤
0.25 1 0 ⎢ ⎥ A = ⎣ −1 0.5 1⎦ , 2.1 1 2 which is a P0+ matrix and is stable, having the eigenvalues 0.0205709 ± 1.23009i and 2.70886. Thus, A is additively Dstable by Fact 3. Nevertheless, A is not multiplicative Dstable, as the eigenvalues of ⎡
1 ⎢ ⎣0 0
0 5 0
⎤⎡
0 0.25 1 ⎥⎢ 0⎦ ⎣ −1 0.5 4 2.1 1
are −0.000126834 ± 2.76183i and 10.7503.
⎤
⎡
⎤
0 0.25 1 0 ⎥ ⎢ ⎥ 1⎦ = ⎣ −5 2.5 5⎦ 2 8.4 4 8
199
Matrix Stability and Inertia
19.5
Lyapunov Diagonal Stability
Lyapunov diagonally stable matrices play an important role in various applications, for example, predator– prey systems in ecology, e.g., [Goh76], [Goh77], and [RZ82]; dynamical systems, e.g., [Ara75]; and economic models, e.g., [Joh74a] and the references in [BBP78]. Definitions: A real square matrix A is said to be Lyapunov diagonally stable [semistable] if there exists a positive diagonal matrix D such that AD + D AT is positive definite [semidefinite]. In this case, the matrix D is called a Lyapunov scaling factor of A. In some references Lyapunov diagonally stable matrices are referred to as just diagonally stable matrices or as Volterra–Lyapunov stable. An n × n matrix A is said to be an Hmatrix if the comparison matrix M(A) defined by
M(A)i j =
aii , i= j j −ai j , i =
is an Mmatrix. A real square matrix A is said to be strongly inertia preserving if the inertia of AD is equal to the inertia of D for every (not necessarily nonsingular) real diagonal matrix D. Facts: The problem of characterizing Lyapunov diagonal stability is, in general, an open problem. It is solved in [BH83] for acyclic matrices. Lyapunov diagonal semistability of acyclic matrices is characterized in [Her88]. Characterization of Lyapunov diagonal stability and semistability using cones is given in [HSh88]; see also the survey in [Her98]. For a book combining theoretical results, applications, and examples, look at [KB00]. 1. [BBP78], [Ple77] Lyapunov diagonally stable matrices are P matrices. 2. [Goh76] A 2 × 2 real matrix is Lyapunov diagonally stable if and only if it is a P matrix. 3. [BVW78] A real square matrix A is Lyapunov diagonally stable if and only if for every nonzero real symmetric positive semidefinite matrix H, the matrix H A has at least one positive diagonal element. 4. [QR65] Lyapunov diagonally stable matrices are multiplicative Dstable. 5. [Cro78] Lyapunov diagonally stable matrices are additive Dstable. 6. [AK72], [Tar71] A Zmatrix is Lyapunov diagonally stable if and only if it is a P matrix (that is, it is an Mmatrix). 7. [HS85a] An Hmatrix A is Lyapunov diagonally stable if and only if A is nonsingular and the diagonal elements of A are nonnegative. 8. [BS91] Lyapunov diagonally stable matrices are strongly inertia preserving. 9. [BH83] Acyclic matrices are Lyapunov diagonally stable if and only if they are P matrices. 10. [BS91] Acyclic matrices are Lyapunov diagonally stable if and only if they are strongly inertia preserving. Examples: 1. Multiplicative Dstable and additive Dstable matrices are not necessarily diagonally stable, as is demonstrated by the matrix
1 −1 . 1 0
1910
Handbook of Linear Algebra
2. Another example, given in [BH85] is the matrix ⎡
0 ⎢ ⎢−1 ⎢ ⎣ 0 0
1 1 1 0
⎤
0 1 a −b
0 0⎥ ⎥ ⎥, b⎦ 0
a ≥ 1, b = 0,
which is not Lyapunov diagonally stable, but is multiplicative Dstable if and only if a > 1, and is additive Dstable whenever a = 1 and b = 1. 3. Stability is a spectral property, and so it is always possible to check whether a given matrix is stable or not by evaluating its eigenvalues; Lyapunov diagonal stability cannot be characterized by the spectrum of the matrix, as is demonstrated by the following two matrices:
1 A= 0
0 , 2
−1 B= −3
2 . 4
The matrices A and B have the same spectrum. Nevertheless, while A is Lyapunov diagonal stable, B is not, since it is not a Pmatrix. Indeed, for every positive diagonal matrix D, the element of AD + D AT in the (1, 1) position is negative and, hence, AD + D AT cannot be positive definite. 4. Let A be a Lyapunov diagonally stable matrix and let D be a Lyapunov scaling factor of A. Using continuity arguments, it follows that every positive diagonal matrix that is close enough to D is a Lyapunov scaling factor of A. Hence, a Lyapunov scaling factor of a Lyapunov diagonally stable matrix is not unique (up to a positive scalar multiplication). The Lyapunov scaling factor is not necessarily unique even in cases of Lyapunov diagonally semistable matrices, as is demonstrated by the zero matrix and the following more interesting example. Let ⎡
2 ⎢ A = ⎣2 1
2 2 1
⎤
3 ⎥ 3⎦. 2
One can check that D = diag (1, 1, d) is a scaling factor of A whenever 19 ≤ d ≤ 1. On the other hand, it is shown in [HS85b] that the identity matrix is the unique Lyapunov scaling factor of the matrix ⎡
1 ⎢ ⎢1 ⎢ ⎣0 2
1 1 2 2
2 0 1 0
⎤
0 0⎥ ⎥ ⎥. 2⎦ 1
Further study of Lyapunov scaling factors can be found in [HS85b], [HS85c], [SB87], [HS88], [SH88], [SB88], and [CHS92].
References [Ara75] M. Araki. Applications of Mmatrices to the stability problems of composite dynamical systems. Journal of Mathematical Analysis and Applications 52 (1975), 309–321. [AK72] M. Araki and B. Kondo. Stability and transient behaviour of composite nonlinear systems. IEEE Transactions on Automatic Control AC17 (1972), 537–541. [BBP78] G.P. Barker, A. Berman, and R.J. Plemmons. Positive diagonal solutions to the Lyapunov equations. Linear and Multilinear Algebra 5 (1978), 249–256. [BH83] A. Berman and D. Hershkowitz. Matrix diagonal stability and its implications. SIAM Journal on Algebraic and Discrete Methods 4 (1983), 377–382. [BH84] A. Berman and D. Hershkowitz. Characterization of acyclic Dstable matrices. Linear Algebra and Its Applications 58 (1984), 17–31.
Matrix Stability and Inertia
1911
[BH85] A. Berman and D. Hershkowitz. Graph theoretical methods in studying stability. Contemporary Mathematics 47 (1985), 1–6. [BS91] A. Berman and D. Shasha. Inertia preserving matrices. SIAM Journal on Matrix Analysis and Applications 12 (1991), 209–219. [BVW78] A. Berman, R.S. Varga, and R.C. Ward. ALPS: Matrices with nonpositive offdiagonal entries. Linear Algebra and Its Applications 21 (1978), 233–244. [Bia85] S. Bialas. A necessary and sufficient condition for the stability of convex combinations of stable polynomials or matrices. Bulletin of the Polish Academy of Sciences. Technical Sciences 33 (1985), 473–480. [Cai76] B.E. Cain. Real 3 × 3 stable matrices. Journal of Research of the National Bureau of Standards Section B 8O (1976), 75–77. [Car68] D. Carlson. A new criterion for Hstability of complex matrices. Linear Algebra and Its Applications 1 (1968), 59–64. [Car74] D. Carlson. A class of positive stable matrices. Journal of Research of the National Bureau of Standards Section B 78 (1974), 1–2. [Car84] D. Carlson. Controllability, inertia, and stability for tridiagonal matrices. Linear Algebra and Its Applications 56 (1984), 207–220. [CDJ82] D. Carlson, B.N. Datta, and C.R. Johnson. A semidefinite Lyapunov theorem and the characterization of tridiagonal Dstable matrices. SIAM Journal of Algebraic Discrete Methods 3 (1982), 293–304. [CHS92] D.H. Carlson, D. Hershkowitz, and D. Shasha. Block diagonal semistability factors and Lyapunov semistability of block triangular matrices. Linear Algebra and Its Applications 172 (1992), 1–25. [CL97] N. Cohen and I. Lewkowicz. Convex invertible cones and the Lyapunov equation. Linear Algebra and Its Applications 250 (1997), 105–131. [Cro78] G.W. Cross. Three types of matrix stability. Linear Algebra and Its Applications 20 (1978), 253–263. [FF58] M.E. Fisher and A.T. Fuller. On the stabilization of matrices and the convergence of linear iterative processes. Proceedings of the Cambridge Philosophical Society 54 (1958), 417–425. [FHR05] S. Friedland, D. Hershkowitz, and S.M. Rump. Positive entries of stable matrices. Electronic Journal of Linear Algebra 12 (2004/2005), 17–24. [FB87] M. Fu and B.R. Barmish. A generalization of Kharitonov’s polynomial framework to handle linearly independent uncertainty. Technical Report ECE879, Department of Electrical and Computer Engineering, University of Wisconsin, Madison, 1987. [FB88] M. Fu and B.R. Barmish. Maximal undirectional perturbation bounds for stability of polynomials and matrices. Systems and Control Letters 11 (1988), 173–178. [Fuj26] M. Fujiwara. On algebraic equations whose roots lie in a circle or in a halfplane. Mathematische Zeitschrift 24 (1926), 161–169. [Gan60] F.R. Gantmacher. The Theory of Matrices. Chelsea, New York, 1960. [Goh76] B.S. Goh. Global stability in two species interactions. Journal of Mathematical Biology 3 (1976), 313–318. [Goh77] B.S. Goh. Global stability in many species systems. American Naturalist 111 (1977), 135–143. [Had76] K.P. Hadeler. Nonlinear diffusion equations in biology. In Proceedings of the Conference on Differential Equations, Dundee, 1976, Springer Lecture Notes. [Har80] D.J. Hartfiel. Concerning the interior of the Dstable matrices. Linear Algebra and Its Applications 30 (1980), 201–207. [Her83] D. Hershkowitz. On the spectra of matrices having nonnegative sums of principal minors. Linear Algebra and Its Applications 55 (1983), 81–86. [Her86] D. Hershkowitz. Stability of acyclic matrices. Linear Algebra and Its Applications 73 (1986), 157–169. [Her88] D. Hershkowitz. Lyapunov diagonal semistability of acyclic matrices. Linear and Multilinear Algebra 22 (1988), 267–283.
1912
Handbook of Linear Algebra
[Her92] D. Hershkowitz. Recent directions in matrix stability. Linear Algebra and Its Applications 171 (1992), 161–186. [Her98] D. Hershkowitz. On cones and stability. Linear Algebra and Its Applications 275/276 (1998), 249–259. [HB83] D. Hershkowitz and A. Berman. Localization of the spectra of P  and P0 matrices. Linear Algebra and Its Applications 52/53 (1983), 383–397. [HJ86] D. Hershkowitz and C.R. Johnson. Spectra of matrices with P matrix powers. Linear Algebra and Its Applications 80 (1986), 159–171. [HK2003] D. Hershkowitz and N. Keller. Positivity of principal minors, sign symmetry and stability. Linear Algebra and Its Applications 364 (2003) 105–124. [HM98] D. Hershkowitz and N. Mashal. P α matrices and Lyapunov scalar stability. Electronic Journal of Linear Algebra 4 (1998), 39–47. [HS85a] D. Hershkowitz and H. Schneider. Lyapunov diagonal semistability of real Hmatrices. Linear Algebra and Its Applications 71 (1985), 119–149. [HS85b] D. Hershkowitz and H. Schneider. Scalings of vector spaces and the uniqueness of Lyapunov scaling factors. Linear and Multilinear Algebra 17 (1985), 203–226. [HS85c] D. Hershkowitz and H. Schneider. Semistability factors and semifactors. Contemporary Mathematics 47 (1985), 203–216. [HS88] D. Hershkowitz and H. Schneider. On Lyapunov scaling factors for real symmetric matrices. Linear and Multilinear Algebra 22 (1988), 373–384. [HS90] D. Hershkowitz and H. Schneider. On the inertia of intervals of matrices. SIAM Journal on Matrix Analysis and Applications 11 (1990), 565–574. [HSh88] D. Hershkowitz and D. Shasha. Cones of real positive semidefinite matrices associated with matrix stability. Linear and Multilinear Algebra 23 (1988), 165–181. [HS93] D. Hershkowitz and F. Shmidel. On a conjecture on the eigenvalues of P matrices. Linear and Multilinear Algebra 36 (1993), 103–110. [Hol99] O. Holtz. Not all GKK τ matrices are stable, Linear Algebra and Its Applications 291 (1999), 235–244. [HJ91] R.A. Horn and C.R.Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, 1991. ¨ H1895 A. Hurwitz. Uber die Bedingungen, unter welchen eine Gleichung nur Wurzeln mit negativen reellen Teilen besitzt. Mathematische Annalen 46 (1895), 273–284. [Joh74a] C.R. Johnson. Sufficient conditions for Dstability. Journal of Economic Theory 9 (1974), 53–62. [Joh74b] C.R. Johnson. Second, third and fourth order Dstability. Journal of Research of the National Bureau of Standards Section B 78 (1974), 11–13. [Joh75] C.R. Johnson. A characterization of the nonlinearity of Dstability. Journal of Mathematical Economics 2 (1975), 87–91. [KB00] Eugenius Kaszkurewicz and Amit Bhaya. Matrix Diagonal Stability in Systems and Computation. Birkh¨auser, Boston, 2000. [LC14] Li´enard and Chipart. Sur la signe de la partie r´eelle des racines d’une equation alg´ebrique. Journal de Math´ematiques Pures et Appliqu´ees (6) 10 (1914), 291–346. [L1892] A.M. Lyapunov. Le Probl`eme G´en´eral de la Stabilit´e du Mouvement. Annals of Mathematics Studies 17, Princeton University Press, NJ, 1949. [Met45] L. Metzler. Stability of multiple markets: the Hick conditions. Econometrica 13 (1945), 277–292. [OS62] A. Ostrowski and H. Schneider. Some theorems on the inertia of general matrices. Journal of Mathematical Analysis and Applications 4 (1962), 72–84. [Ple77] R.J. Plemmons. Mmatrix characterizations, I–nonsingular Mmatrices. Linear Algebra and Its Applications 18 (1977), 175–188. [QR65] J. Quirk and R. Ruppert. Qualitative economics and the stability of equilibrium. Review of Economic Studies 32 (1965), 311–325.
Matrix Stability and Inertia
1913
[RZ82] R. Redheffer and Z. Zhiming. A class of matrices connected with Volterra prey–predator equations. SIAM Journal on Algebraic and Discrete Methods 3 (1982), 122–134. [R1877] E.J. Routh. A Treatise on the Stability of a Given State of Motion. Macmillan, London, 1877. ¨ [Sch17] I. Schur. Uber Potenzreihen, die im Innern des Einheitskreises beschrankt sind. Journal f¨ur reine und angewandte Mathematik 147 (1917), 205–232. [SB87] D. Shasha and A. Berman. On the uniqueness of the Lyapunov scaling factors. Linear Algebra and Its Applications 91 (1987) 53–63. [SB88] D. Shasha and A. Berman. More on the uniqueness of the Lyapunov scaling factors. Linear Algebra and Its Applications 107 (1988) 253–273. [SH88] D. Shasha and D. Hershkowitz. Maximal Lyapunov scaling factors and their applications in the study of Lyapunov diagonal semistability of block triangular matrices. Linear Algebra and Its Applications 103 (1988), 21–39. [Tad81] E. Tadmor. The equivalence of L 2 stability, the resolvent condition, and strict Hstability. Linear Algebra and Its Applications 41 (1981), 151–159. [Tar71] L. Tartar. Une nouvelle characterization des matrices. Revue Fran¸caise d’Informatique et de Recherche Op´erationnelle 5 (1971), 127–128. [Tog80] Y. Togawa. A geometric study of the Dstability problem. Linear Algebra and Its Applications 33(1980), 133–151. [Zah92] Z. Zahreddine. Explicit relationships between Routh–Hurwitz and Schur–Cohn types of stability. Irish Mathematical Society Bulletin 29 (1992), 49–54.
Topics in Advanced Linear Algebra Alberto Borobia . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201
20 Inverse Eigenvalue Problems
IEPs with Prescribed Entries • PEIEPs of 2 × 2 Block Type • Nonnegative IEP (NIEP) • Spectra of Nonnegative Matrices • Nonzero Spectra of Nonnegative Matrices • Some Merging Results for Spectra of Nonnegative Matrices • Sufficient Conditions for Spectra of Nonnegative Matrices • Affine Parameterized IEPs (PIEPs) • Relevant PIEPs Which Are Solvable Everywhere • Numerical Methods for PIEPs
21 Totally Positive and Totally Nonnegative Matrices Basic Properties • Factorizations Properties • Deeper Properties
22 Linear Preserver Problems
•
Recognition and Testing
Shaun M. Fallat . . . . . . . . . . . . 211 •
Spectral
ˇ Peter Semrl. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221
Basic Concepts • Standard Forms • Standard Linear Preserver Problems Multiplicative, and Nonlinear Preservers
23 Matrices over Integral Domains
•
Linear Equations over Bezout
Shmuel Friedland . . . . . . . . . . . . . . . . . . . . . . . . . . . 241
Similarity of Matrices • Simultaneous Similarity of Matrices • Property L Similarity Classification I • Simultaneous Similarity Classification II
25 MaxPlus Algebra
Additive,
Shmuel Friedland . . . . . . . . . . . . . . . . . . . . . . . . . . . . 231
Certain Integral Domains • Equivalence of Matrices Domains • Strict Equivalence of Pencils
24 Similarity of Families of Matrices
•
•
Simultaneous
Marianne Akian, Ravindra Bapat, and St´ephane Gaubert . . . . . 251
Preliminaries • The Maximal Cycle Mean • The MaxPlus Eigenproblem of Matrix Powers • The MaxPlus Permanent • Linear Inequalities and Projections • MaxPlus Linear Independence and Rank
26 Matrices Leaving a Cone Invariant
•
Asymptotics
Hans Schneider and BitShun Tam . . . . . . . . . . 261
Perron–Frobenius Theorem for Cones • Collatz–Wielandt Sets and Distinguished Eigenvalues • The Peripheral Spectrum, the Core, and the Perron–Schaefer Condition • Spectral Theory of K Reducible Matrices • Linear Equations over Cones • Elementary Analytic Results • Splitting Theorems and Stability
20 Inverse Eigenvalue Problems IEPs with Prescribed Entries . . . . . . . . . . . . . . . . . . . . . . . PEIEPs of 2 × 2 Block Type. . . . . . . . . . . . . . . . . . . . . . . . Nonnegative IEP (NIEP) . . . . . . . . . . . . . . . . . . . . . . . . . . Spectra of Nonnegative Matrices . . . . . . . . . . . . . . . . . . . Nonzero Spectra of Nonnegative Matrices . . . . . . . . . . Some Merging Results for Spectra of Nonnegative Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20.7 Sufficient Conditions for Spectra of Nonnegative Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20.8 Affine Parameterized IEPs (PIEPs) . . . . . . . . . . . . . . . . . 20.9 Relevant PIEPs Which Are Solvable Everywhere . . . . 20.10 Numerical Methods for PIEPs . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20.1 20.2 20.3 20.4 20.5 20.6
Alberto Borobia UNED
201 203 205 206 207 208 208 2010 2010 2011 2012
In general, an inverse eigenvalue problem (IEP) consists of the construction of a matrix with prescribed structural and spectral constraints. This is a twolevel problem: (1) on a theoretical level the target is to determine if the IEP is solvable, that is, to find necessary and sufficient conditions for the existence of at least one solution matrix (a matrix with the given constraints); and (2) on a practical level, the target is the effective construction of a solution matrix when the IEP is solvable. IEPs are classified into different types according to the specific constraints. We will consider three topics: IEPs with prescribed entries, nonnegative IEPs, and affine parameterized IEPs. Other important topics include pole assignment problems, Jacobi IEPs, inverse singular value problems, etc. For interested readers, we refer to the survey [CG02] where an account of IEPs with applications and extensive bibliography can be found.
20.1
IEPs with Prescribed Entries
The underlying question for an IEP with prescribed entries (PEIEPs) is to understand how the prescription of some entries of a matrix can have repercussions on its spectral properties. A classical result on this subject is the Schur–Horn Theorem allowing the construction of a real symmetric matrix with prescribed diagonal, prescribed eigenvalues, and subject to some restrictions (see Fact 1 below). Here we consider PEIEPs that require finding a matrix with some prescribed entries and with prescribed eigenvalues or characteristic polynomial; no structural constraints are imposed on the solution matrices. Most of the facts of Sections 20.1 and 20.2 appear in [IC00], an excellent survey that describes finite step procedures for constructing solution matrices.
201
202
Handbook of Linear Algebra
Definitions: An IEP with prescribed entries (PEIEP) has the following standard formulation: Given: (a) (b) (c) (d)
A field F . n elements λ1 , . . . , λn of F (respectively, a monic polynomial f ∈ F [x] of degree n). t elements p1 , . . . , pt of F . A set Q = {(i 1 , j1 ), . . . , (i t , jt )} of t positions of an n × n matrix.
Find: A matrix A = [ai j ] ∈ F n×n with ai k jk = pk for 1 ≤ k ≤ t and such that σ (A) = {λ1 , . . . , λn } (respectively, such that p A (x) = f ). Facts: [IC00] 1. (Schur–Horn Theorem) Given any real numbers λ1 ≥ · · · ≥ λn and d1 ≥ · · · ≥ dn satisfying k
λi ≥
i =1
k
di
for k = 1, . . . , n − 1
and
i =1
n i =1
λi =
n
di ,
i =1
there exists a real symmetric n × n matrix with diagonal (d1 , . . . , dn ) and eigenvalues λ1 , . . . , λn ; and any Hermitian matrix satisfies these conditions on its eigenvalues and diagonal entries. 2. A finite step algorithm is provided in [CL83] for the construction of a solution matrix for the Schur–Horn Theorem. 3. Consider the following classes of PEIEPs: (1.1) (1.2) (2.1) (2.2) (3.1)
F F F F F
λ1 , . . . , λn f = x n + c 1 x n−1 + · · · + c n λ1 , . . . , λn f = x n + c 1 x n−1 + · · · + c n λ1 , . . . , λ n
p1 , . . . , pn−1 p1 , . . . , pn−1 p1 , . . . , pn p1 , . . . , pn p1 , . . . , p2n−3
Q = n − 1 Q = n − 1 Q = n Q = n Q = 2n − 3
r [dO73a] Each PEIEP of class (1.1) is solvable. r [Dds74] Each PEIEP of class (1.2) is solvable except if all offdiagonal entries in one row or
column are prescribed to be zero and f has no root on F . r [dO73b] Each PEIEP of class (2.1) is solvable with the following exceptions: (1) all entries in
the diagonal are prescribed and their sum is different from λ1 + · · · + λn ; (2) all entries in one row or column are prescribed, with zero offdiagonal entries and diagonal entry different from λ1 , . . . , λn ; and (3) n = 2, Q = {(1, 2), (2, 1)}, and x 2 − (λ1 + λ2 )x + p1 p2 + λ1 λ2 ∈ F [x] is irreducible over F . r [Zab86] For n > 4, each PEIEP of class (2.2) is solvable with the following exceptions: (1) all
entries in the diagonal are prescribed and their sum is different fromc 1 ; (2) all entries in a row or column are prescribed, with zero offdiagonal entries and diagonal entry which is not a root of f ; and (3) all offdiagonal entries in one row or column are prescribed to be zero and f has no root on F . The case n ≤ 4 is solved but there are more exceptions. r [Her83] Each PEIEP of class (3.1) is solvable with the following exceptions: (1) all entries in the
diagonal are prescribed and their sum is different from λ1 + · · · + λn ; and (2) all entries in one row or column are prescribed, with zero offdiagonal entries and diagonal entry different from λ1 , . . . , λn . r [Her83] The result for PEIEPs of class (3.1) cannot be improved to Q > 2n − 3 since a lot of
specific nonsolvable situations appear, and, therefore, a closed result seems to be quite inaccessible. r A gradient flow approach is proposed in [CDS04] to explore the existence of solution matrices
when the set of prescribed entries has arbitrary cardinality.
203
Inverse Eigenvalue Problems
4. The important case Q = {(i, j ) : i = j } is discussed in section 20.9. 2 5. Let { pi j : 1 ≤ i ≤ j ≤ n} be a set of n 2+n elements of a field F . Define the set {r 1 , . . . , r s } of all those integers r such that pi j = 0 whenever 1 ≤ i ≤ r < j ≤ n. Assume that 0 = r 0 < r 1 < · · · < r s < r s +1 = n and define βt = r t−1 < k ≤ r t pkk for t = 1, . . . , s + 1. The following PEIEPs have been solved: r [BGRS90] Let λ , . . . , λ be n elements of F . Then there exists A = [a ] ∈ F n×n with a = p 1 n ij ij ij
for 1 ≤ i ≤ j ≤ n and σ (A) = {λ1 , . . . , λn } if and only if {1, . . . , n} has a partition N1 ∪ · · · ∪ Ns +1 such that Nt  = r t − r t−1 and k∈Nt λk = βt for each t = 1, . . . , s + 1.
r [Sil93] Let f ∈ F [x] be a monic polynomial of degree n. Then there exists A = [a ] ∈ F n×n ij
with ai j = pi j for 1 ≤ i ≤ j ≤ n and p A (x) = f if and only if f = f 1 · · · f s +1 , where f t = x r t −r t−1 − βt x r t −r t−1 −1 + · · · ∈ F [x] for t = 1, . . . , s + 1.
6. [Fil69] Let d1 , . . . , dn be elements of a field F , and let A ∈ F n×n with A = λIn for all λ ∈ F and tr(A) = in=1 di . Then A is similar to a matrix with diagonal (d1 , . . . , dn ). Examples: 1. [dO73b] Given: (a) A field F . (b) λ1 , . . . , λn ∈ F . (c) p1 , . . . , pn ∈ F . (d) Q = {(1, 1), . . . , (n, n)}. If
n
i =1
λi =
n
i =1
pi , then A = [ai j ] ∈ F n×n with
aii = pi , ai,i +1 =
i
λk −
k=1
i
ai j = 0 pk ,
if i ≤ j − 2 ,
ai j = p j − λ j +1
if i > j ,
k=1
has diagonal ( p1 , . . . , pn ) and its spectrum is σ (A) = {λ1 , . . . , λn }.
20.2
PEIEPs of 2 × 2 Block Type
In the 1970s, de Oliveira posed the problem of determining all possible spectra of a 2 × 2 block matrix A or all possible characteristic polynomials of A or all possible invariant polynomials of A when some of the blocks are prescribed and the rest vary (invariant polynomial is a synonym for invariant factor, cf. Section 6.6). Definitions: Let F be a field and let A be the 2 × 2 block matrix
A11 A= A21
A12 ∈ F n×n A22
with
A11 ∈ F l ×l
Notation: r deg( f ): degree of f ∈ F [x]. r g  f : polynomial g divides the polynomial f . r i p(B): invariant polynomials of the square matrix B.
and
A22 ∈ F m×m .
204
Handbook of Linear Algebra
Facts: [IC00] 1. [dO71] Let A11 and a monic polynomial f ∈ F [x] of degree n be given. Let i p(A11 ) = g 1  · · · g l . Then p A (x) = f is possible except if l > m and g 1 · · · g l −m is not a divisor of f . 2. [dS79], [Tho79] Let A11 and n monic polynomials f 1 , . . . , f n ∈ F [x] with f 1  · · ·  f n and n i =1 deg( f i ) = n be given. Let i p(A11 ) = g 1  · · · g l . Then i p(A) = f 1  · · ·  f n is possible if and only if f i  g i  f i +2m for each i = 1, . . . , l where f k = 0 for k > n. 3. [dO75] Let A12 and a monic polynomial f ∈ F [x] of degree n be given. Then p A (x) = f is possible except if A12 = 0 and f has no divisor of degree l . 4. [Zab89], [Sil90] Let A12 and n monic polynomials f 1 , . . . , f n ∈ F [x] with f 1  · · ·  f n and in=1 deg ( f i ) = n be given. Let r = rank(A12 ) and s the number of polynomials in f 1 , . . . , f n which are different from 1. Then i p(A) = f 1  · · ·  f n is possible if and only if r ≤ n − s with the following exceptions: (a) r = 0 and in=1 f i has no divisor of degree l . (b) r ≥ 1, l − r odd and f n−s +1 = · · · = f n with f n irreducible of degree 2. (c) r = 1 and f n−s +1 = · · · = f n with f n irreducible of degree k ≥ 3 and kl . 5. [Wim74] Let A11 , A12 , and a monic polynomial f ∈ F [x] of degree n be given. Let h 1  · · · h l be the invariant factors of x Il − A11  − A12 . Then p A (x) = f is possible if and only if h 1 · · · h l  f . 6. All possible invariant polynomials of A are characterized in [Zab87] when A11 and A12 are given. The statement of this result contains a majorization inequality involving the controllability indices of the pair (A11 , A12 ). 7. [Sil87b] Let A11 , A22 , and n elements λ1 , . . . , λn of F be given. Assume that l ≥ m and let i p(A11 ) = g 1  · · · g l . Then σ (A) = {λ1 , . . . , λn } is possible if and only if all the following conditions are satisfied: (a) tr(A11 ) + tr(A22 ) = λ1 + · · · + λn . (b) If l > m, then g 1 · · · g l −m (x − λ1 ) · · · (x − λn ). (c) If A11 = a Il and A22 = d Im , then there exists a permutation τ of {1, . . . , n} such that λτ (2i −1) + λτ (2i ) = a + d for 1 ≤ i ≤ m and λτ ( j ) = a for 2m + 1 ≤ j ≤ n. 8. [Sil87a] Let A12 , A21 , and n elements λ1 , . . . , λn of F be given. Then σ (A) = {λ1 , . . . , λn } is possible except if, simultaneously, l = m = 1, A12 = [ b ], A21 = [ c ] and the polynomial x 2 − (λ1 + λ2 )x + bc + λ1 λ2 ∈ F [x] is irreducible over F . 9. Let A12 , A21 , and a monic polynomial f ∈ F [x] of degree n be given: r [Fri77] If F is algebraically closed then p (x) = f is always possible. A r [MS00] If F = R and n ≥ 3 then p (x) = f is possible if and only if either min{rank(A ), A 12
rank(A21 )} > 0 or f has a divisor of degree l .
r If F =
R, A12 = [ b ], A21 = [ c ] and f = x 2 + c 1 x + c 2 ∈ R[x] then p A (x) = f is possible if and only if x 2 + c 1 x + c 2 + bc has a root in R.
10. [Sil91] Let A11 , A12 , A22 , and n elements λ1 , . . . , λn of F be given. Let k1  · · · kl be the in
12 , and variant factors of x Il − A11  − A12 , h 1  · · · h m the invariant factors of x I −A m − A22 g = k1 · · · kl h 1 · · · h m . Then σ (A) = {λ1 , . . . , λn } is possible if and only if all the following conditions hold: (a) tr(A11 ) + tr(A22 ) = λ1 + · · · + λn .
(b) g (x − λ1 ) · · · (x − λn ). (c) If A11 A12 + A12 A22 = η A12 for some η ∈ F , then there exists a permutation τ of {1, . . . , n} such that λτ (2i −1) + λτ (2i ) = η for 1 ≤ i ≤ t where t = rank(A12 ) and λτ (2t+1) , . . . , λτ (n) are the roots of g . 11. If a problem of block type is solved for prescribed characteristic polynomial then the solution for prescribed spectrum easily follows.
205
Inverse Eigenvalue Problems
12. The book [GKvS95] deals with PEIEPs of block type from an operator point of view. 13. A description is given in [FS98] of all the possible characteristic polynomials of a square matrix with an arbitrary prescribed submatrix.
20.3
Nonnegative IEP (NIEP)
Nonnegative matrices appear naturally in many different mathematical areas, both pure and applied, such as numerical analysis, statistics, economics, social sciences, etc. One of the most intriguing problems in this field is the socalled nonnegative IEP (NIEP). Its origin goes back to A.N. Kolgomorov, who in 1938 posed the problem of determining which individual complex numbers belong to the spectrum of some n × n nonnegative matrix with its spectral radius normalized to be 1. Kolgomorov’s problem was generalized in 1949 by H. R. Suleˇimanova, who posed the NIEP: To determine which ntuples of complex numbers are spectra of n × n nonnegative matrices. For definitions and additional facts about nonnegative matrices, see Chapter 9. Definitions: Let n denote the compact subset of C bounded by the regular nsided polygon inscribed in the unit circle of C and with one vertex at 1 ∈ C. Let n denote the subset of C composed of those complex numbers λ such that λ is an eigenvalue of some n × n row stochastic matrix. A circulant matrix is a matrix in which every row is obtained by a single cyclic shift of the previous row. Facts: All the following facts appear in [Min88]. 1. A complex nonzero number λ is an eigenvalue of a nonnegative n × n matrix with positive spectral radius ρ if and only if λ/ρ ∈ n . 2. [DD45], [DD46] 3 = 2 ∪ 3 . 3. [Mir63] Each point in 2 ∪ 3 ∪ · · · ∪ n is an eigenvalue of a doubly stochastic n × n matrix. 4. [Kar51] The set n is symmetric relative to the real axis and is contained within the circle z ≤ 1. 2πi a It intersects z = 1 at the points e b where a and b run over all integers satisfying 0 ≤ a < b ≤ n. The boundary of n consists of the curvilinear arcs connecting these points in circular order. For n ≥ 4, each arc is given by one of the following parametric equations: z q (z p − t)r = (1 − t)r , (z c − t)d = (1 − t)d z q ,
where the real parameter t runs over the interval 0 ≤ t ≤ 1, and c , d, p, q , r are natural numbers defined by certain rules (explicitly stated in [Min88]). Examples: 1. [LL78] The circulant matrix ⎡
1 + 2r cos θ
1⎢ π ⎣ 1 − 2r cos( 3 − θ) 3 π 1 − 2r cos( 3 + θ)
1 − 2r cos( π3 + θ) 1 + 2r cos θ 1 − 2r cos( π3 − θ)
1 − 2r cos( π3 − θ)
⎤
⎥ 1 − 2r cos( π3 + θ)⎦ 1 + 2r cos θ
has spectrum {1, r e i θ , r e −i θ }, and it is doubly stochastic if and only if r e i θ ∈ 3 .
206
20.4
Handbook of Linear Algebra
Spectra of Nonnegative Matrices
Definitions: Nn ≡ {σ = {λ1 , . . . , λn } ⊂ C : ∃A ≥ 0 with spectrum σ }. Rn ≡ {σ = {λ1 , . . . , λn } ⊂ R : ∃A ≥ 0 with spectrum σ }. Sn ≡ {σ = {λ1 , . . . , λn } ⊂ R : ∃A ≥ 0 symmetric with spectrum σ }. R∗n ≡ {(1, λ2 , . . . , λn ) ∈ Rn : {1, λ2 , . . . , λn } ∈ Rn ; 1 ≥ λ2 ≥ · · · ≥ λn }. Sn∗ ≡ {(1, λ2 , . . . , λn ) ∈ Rn : {1, λ2 , . . . , λn } ∈ Sn ; 1 ≥ λ2 ≥ · · · ≥ λn }. For any set σ = {λ1 , . . . , λn } ⊂ C, let ρ(σ ) = max λi  1≤i ≤n
sk =
and
n
for each k ∈ N.
λik
i =1
A set S ⊂ Rn is starshaped from p ∈ S if every line segment drawn from p to another point in S lies entirely in S. Facts: Most of the following facts appear in [ELN04]. 1. [Joh81] If σ = {λ1 , . . . , λn } ∈ Nn , then σ is the spectrum of a n × n nonnegative matrix with all row sums equal to ρ(σ ). 2. If σ = {λ1 , . . . , λn } ∈ Nn , then the following conditions hold: (a) ρ(σ ) ∈ σ . (b) σ = σ . (c) si ≥ 0 for i ≥ 1. m−1 (d) [LL78], [Joh81] sm skm for k, m ≥ 1. k ≤n
3. Nn is known for n ≤ 3, Rn and Sn are known for n ≤ 4: r N = R = S = {σ = {λ , λ } ⊂ R : s ≥ 0}. 2 2 2 1 2 1 r R = S = {σ = {λ , λ , λ } ⊂ R : ρ(σ ) ∈ σ ; s ≥ 0}. 3 3 1 2 3 1 r [LL78] N = {σ = {λ , λ , λ } ⊂ C : σ = σ ; ρ(σ ) ∈ σ ; s ≥ 0; s2 ≤ 3s }. 3 1 2 3 1 2 1 r R = S = {σ = {λ , λ , λ , λ } ⊂ R : ρ(σ ) ∈ σ ; s ≥ 0}. 4
4
1
2
3
4
1
4. (a) [JLL96] Rn and Sn are not always equal sets. (b) [ELN04] σ = {97, 71, −44, −54, −70} ∈ R5 but σ ∈ S5 . (c) [ELN04] provides symmetric matrices for all known elements of S5 . 5. [Rea96] Let σ = {λ1 , λ2 , λ3 , λ4 } ⊂ C with s1 = 0. Then σ ∈ N4 if and only if s2 ≥ 0, s3 ≥ 0 and 4s4 ≥ s22 . Moreover, σ is the spectrum of ⎡ ⎢ ⎢ ⎢ ⎢ ⎣
0
⎤
0
1
0
s2 4 s3 4 4s4 −s22 16
0
1
0
0
1⎥ ⎦
s3 12
s2 4
0
0⎥ ⎥
⎥.
6. [LM99] Let σ = {λ1 , λ2 , λ3 , λ4 , λ5 } ⊂ C with s1 = 0. Then σ ∈ N5 if and only if the following conditions are satisfied: (a) si ≥ 0 for i = 2, 3, 4, 5. (b) 4s4 ≥ s22 .
(c) 12s5 − 5s2 s3 + 5s3 4s4 − s22 ≥ 0. The proof of the sufficient part is constructive.
207
Inverse Eigenvalue Problems
7.
(a) R∗n and Sn∗ are starshaped from (1, . . . , 1). (b) [BM97] R∗n is starshaped from (1, 0, . . . , 0). (c) [KM01], [Mou03] R∗n and Sn∗ are not convex sets for n ≥ 5.
Examples: 1. We show that σ = {5, 5, −3, −3, −3} ∈ N5 . Suppose A is a nonnegative matrix with spectrum σ . By the Perron–Frobenius Theorem, A is reducible and σ can be partitioned into two nonempty subsets, each one being the spectrum of a nonnegative matrix with Perron root equal to 5. This is not possible since one of the subsets must contain numbers with negative sum. 2. {6, 1, 1, −4, −4} ∈ N5 by Fact 6.
20.5
Nonzero Spectra of Nonnegative Matrices
For the definitions and additional facts about primitive matrices see Section 29.6 and Chapter 9. Definitions: The M¨obius function µ : N → {−1, 0, 1} is defined by µ(1) = 1, µ(m) = (−1)e if m is a product of e distinct primes, and µ(m) = 0 otherwise. The k th net trace of σ = {λ1 , . . . , λn } ⊂ C is trk (σ ) = dk µ( dk )sd . The set σ = {λ1 , . . . , λn } ⊂ C with 0 ∈ σ is the nonzero spectrum of a matrix if there exists a t × t matrix, t ≥ n, whose spectrum is {λ1 , . . . , λn , 0, . . . , 0} with t − n zeros. The set σ = {λ1 , . . . , λn } ⊂ C has a Perron value if ρ(σ ) ∈ σ and there exists a unique index i with λi = ρ(σ ). Facts: 1. [BH91] Spectral Conjecture: Let S be a unital subring of R. The set σ = {λ1 , . . . , λn } ⊂ C with 0 ∈ σ is the nonzero spectrum of some primitive matrix over S if and only if the following conditions hold: (a) σ has a Perron value. (b) All the coefficients of the polynomial
n
i =1 (x
− λi ) lie in S.
(c) If S = Z, then trk (σ ) ≥ 0 for all positive integers k. (d) If S = Z, then sk ≥ 0 for all k ∈ N and sm > 0 implies smp > 0 for all m, p ∈ N. 2. [BH91] Subtuple Theorem: Let S be a unital subring of R. Suppose that σ = {λ1 , . . . , λn } ⊂ C with 0 ∈ σ has ρ(σ ) = λ1 and satisfies conditions (a) to (d) of the spectral conjecture. If for some j ≤ n the set {λ1 , . . . , λ j } is the nonzero spectrum of a nonnegative matrix over S, then σ is the nonzero spectrum of a primitive matrix over S. 3. The spectral conjecture is true for S = R by the subtuple theorem. 4. [KOR00] The spectral conjecture is true for S = Z and S = Q. 5. [BH91] The set σ = {λ1 , . . . , λn } ⊂ C with 0 ∈ σ is the nonzero spectrum of a positive matrix if and only if the following conditions hold: (a) σ has a Perron value. (b) All coefficients of
n
i =1 (x
(c) sk > 0 for all k ∈ N.
− λi ) are real.
208
Handbook of Linear Algebra
Examples: 1. Let σ = {5, 4 + , −3, −3, −3}. Then: (a) σ for < 0 is not the nonzero spectrum of a nonnegative matrix since s1 < 0. (b) σ0 is the nonzero spectrum of a nonnegative matrix by Fact 2. (c) σ1 is not the nonzero spectrum of a nonnegative matrix by arguing as in Example 1 of Section 20.4. (d) σ for > 0, = 1, is the nonzero spectrum of a positive matrix by Fact 5.
20.6
Some Merging Results for Spectra of Nonnegative Matrices
Facts: 1. If {λ1 , . . . , λn } ∈ Nn and {µ1 , . . . , µm } ∈ Nm , then {λ1 , . . . , λn , µ1 , . . . , µm } ∈ Nn+m . 2. [Fie74] Let σ = {λ1 , . . . , λn } ∈ Sn with ρ(σ ) = λ1 and τ = {µ1 , . . . , µm } ∈ Sm with ρ(τ ) = µ1 . Then {λ1 + , λ2 , . . . , λn , µ1 − , µ2 , . . . , µm } ∈ Sn+m for any ≥ 0 if λ1 ≥ µ1 . The proof is constructive. ˇ 3. [Smi04] Let A be a nonnegative matrix with spectrum {λ1 , . . . , λn } and maximal diagonal element d, and let τ = {µ1 , . . . , µm } ∈ Nm with ρ(τ ) = µ1 . If d ≥ µ1 , then {λ1 , . . . , λn , µ2 , . . . , µm } ∈ Nn+m−1 . The proof is constructive. 4. Let σ = {λ1 , . . . , λn } ∈ Nn with ρ(σ ) = λ1 and let ≥ 0. Then: (a) [Wuw97] {λ1 + , λ2 , . . . , λn } ∈ Nn . (b) If λ2 ∈ R, then not always {λ1 , λ2 + , λ3 , . . . , λn } ∈ Nn (see the previous example). (c) [Wuw97] If λ2 ∈ R, then {λ1 + , λ2 ± , λ3 , . . . , λn } ∈ Nn (the proof is not constructive). Examples: 1. Let σ = {λ1 , . . . , λn } ∈ Nn with ρ(σ ) = λ1 , and τ = {µ1 , . . . , µm } ∈ Nm with ρ(τ ) = µ1 . By Fact 1 of section 20.4 there exists A ≥ 0 with spectrum σ and row sums λ1 , and B ≥ 0 with spectrum τ and row sums µ1 . [BMS04] If λ1 ≥ µ1 and ≥ 0, then the nonnegative matrix
A ee1T T (λ1 − µ1 + ) ee1 B
≥ 0
has row sums λ1 + and spectrum {λ1 + , λ2 , . . . , λn , µ1 − , µ2 , . . . , µm }.
20.7
Sufficient Conditions for Spectra of Nonnegative Matrices
Definitions: The set {λ1 , . . . , λi −1 , α, β, λi +1 , . . . , λn } is a negative subdivision of {λ1 , . . . , λn } if α + β = λi with α, β, λi < 0.
Facts: Most of the following facts appear in [ELN04] and [SBM05]. 1. [Sul49] Let σ = {λ1 , . . . , λn } ⊂ R with λ1 ≥ · · · ≥ λn . Then σ ∈ Rn if
(Su)
• λ1 ≥ 0 ≥ λ2 ≥ · · · ≥ λn • λ1 + · · · + λn ≥ 0
.
209
Inverse Eigenvalue Problems
2. [BMS04] Complex version of (Su). Let σ = {λ1 , . . . , λn } ⊂ C be a set that satisfies: (a) σ = σ . (b) ρ(σ ) = λ1 . (c) λ1 + · · · + λn ≥ 0. (d) {λ2 , . . . , λn } ⊂ {z ∈ C : Rez ≤ 0, Rez ≥ Imz}. Then σ ∈ Nn and the proof is constructive. 3. [Sou83] Let σ = {λ1 , . . . , λn } ⊂ R with λ1 ≥ · · · ≥ λn . Then there exists a symmetric doubly stochastic matrix D such that λ1 D has spectrum σ if
(Sou)
m n−m−1 1 λn−2k+2 λ1 + λ2 + ≥0 n n(m + 1) (k + 1)k k=1
where m =
n−1 2
and the proof is constructive. 4. [Kel71] Let σ = {λ1 , . . . , λn } ⊂ R with λ1 ≥ · · · ≥ λn . Let r be the greatest index for which λr ≥ 0 and let δi = λn+2−i for 2 ≤ i ≤ n−r +1. Define K = {i : 2 ≤ i ≤ min{r, n−r +1} and λi +δi < 0}. Then σ ∈ Rn if
(Ke)
• λ1 + • λ1 +
i ∈K , i
+ δi ) + δk ≥ 0 for all k ∈ K
i ∈K (λi + δi ) +
n−r +1 j =r +1
δj ≥ 0
.
5. [Bor95] Let σ = {λ1 , . . . , λn } ⊂ R with λ1 ≥ · · · ≥ λn . Then σ ∈ Rn if
(Bo)
• ∃ τ = {β1 , . . . , βd } ⊂ R with d ≤ n that satisfies conditions (Ke) • σ is obtained from τ after n − d negative subdivisions
.
6. [Sot03] Let σ = {λ1 , . . . , λn } ⊂ R. For any partition σ = σ (1) ∪ · · · ∪ σ (t) where σ (k) = (k) (k) (k) {λ(k) 1 , . . . , λnk } with λ1 ≥ · · · ≥ λnk define (k) (k) R (k) j = λ j + λnk − j +1 for 2 ≤ j ≤ (k) T (k) = λ(k) R (k) (k) 1 + λn k + j . R <0
nk 2
(k) and R (k) nk +1 = λ nk +1 2
if nk odd;
2
j
Then σ ∈ Rn if ⎧ (1) (t) ⎪ ⎨there existst a partition σ = σ ∪ · · · ∪ σ such that (Sot) (1) (k) (1) T (k) ≥ max λ(1) ⎪ 1 − T , max {λ1 } ⎩ λ1 + 2≤k≤t T (k) <0,k=2
7. 8. 9. 10.
and the proof is constructive. [SBM05] (Su) ⇒ (Ke) ⇒ (Bo) ⇒ (Sot) and no opposite implication is true. [Rad96] (Sou) and (Ke) are not comparable (see Example 2 below). [Rad96] If σ satisfies (Bo), then σ ∈ Sn . n [RS03] Let σ = {λ1 , . . . , λn } ⊂ C with σ = σ and d = − i =2 λi > 0. Let c 1 , . . . , c n be defined n c n by (x − d) i =2 (x − λi ) = x n + k=1 c k x n−k . If λ1 ≥ d 1 + c k >0 dkk , then σ ∈ Nn . The proof is constructive.
Examples: 1. If σ = {λ1 , . . . , λn } ⊂ R satisfies (Su), then the companion matrix of the polynomial is nonnegative with spectrum σ .
n
i =1 (x − λi )
2010
Handbook of Linear Algebra
2. {5, 3, −2, −2, −4} satisfies (Ke), but not (Sou), and {5, 3, −2, −2, −2, −2} satisfies (Sou), but not (Ke). 3. σ = {8, 4, −3, −3, −3, −3} does not satisfies (Ke), but it satisfies (Bo) since σ is obtained from τ = {8, 4, −6, −6} after two negative subdivisions and τ satisfies (Ke). 4. σ = {9, 7, 2, 2, −5, −5, −5, −5} does not satisfy (Bo), but it satisfies (Sot) with σ (1) = {9, 2, −5, −5} and σ (2) = {7, 2, −5, −5}. 5. σ = {6, 1, 1, −4, −4} does not satisfy (Sot), but σ ∈ R5 (Example 2 of section 20.4).
20.8
Affine Parameterized IEPs (PIEPs) 2
The set F n×n of n × n matrices over the field F is naturally identified with the vector space F n . An affine parameterized IEP requires finding within a given affine subspace of F n×n a matrix with prescribed spectrum. Here we will consider that the given affine subspace is ndimensional and F = R or F = C. Especially interesting is the case where the affine subspace contains only real symmetric matrices. Some important motivating applications, including the Sturn–Liouville problem, inverse vibration problems, and nuclear spectroscopy are discussed in [FNO87]. Most of the facts of Sections 20.8, 20.9, and 20.10 appear in [Dai98]. Definitions: An affine parameterized IEP (PIEP) has the following standard formulation: Given: A field F ; n + 1 matrices A, A1 , . . . , An ∈ F n×n ; and n elements λ1 , . . . , λn ∈ F . Find: c = (c 1 , . . . , c n )T ∈ F n such that {λ1 , . . . , λn } is the spectrum of the matrix A(c) = A + c 1 A1 + · · · + c n An . In particular, a PIEP(C) is a PIEP with F = C, a PIEP(R) is a PIEP with F = R, and a PIEP(RS) is a PIEP with F = R and with all given matrices symmetric. Facts: [Dai98] 1. [Xu92] Almost all PIEP(C) are solvable. 2. [SY86] Almost all PIEP(R) and almost all PIEP(RS) are unsolvable in the presence of multiple eigenvalues. 3. All known sufficient conditions for the solvability of a PIEP(R) or a PIEP(RS) require that the eigenvalues should be sufficiently pairwise separated. An account of necessary and of sufficient conditions can be found in [Dai98].
20.9
Relevant PIEPs Which are Solvable Everywhere
Definitions: Additive IEP (AIEP): Given A ∈ Cn×n and λ1 , . . . , λn ∈ C, find a diagonal matrix D ∈ Cn×n such that σ (A + D) = {λ1 , . . . , λn }. Multiplicative IEP (MIEP): Given B ∈ Cn×n and λ1 , . . . , λn ∈ C, find a diagonal matrix D ∈ Cn×n such that σ (B D) = {λ1 , . . . , λn }. n Toeplitz IEP (ToIEP): Given λ1 , . . . , λn ∈ R, find c = [c 1 , . . . , c n ]T ∈ Rn such that ti j i, j =1 with ti j = c i − j +1 has spectrum {λ1 , . . . , λn }.
2011
Inverse Eigenvalue Problems
Facts: [Dai98] 1. Each AIEP is a PIEP(C) with Ak = ek ekT for k = 1, . . . , n. Each AIEP is also an IEP with prescribed (offdiagonal) entries. 2. [Fri77] For any A ∈ Cn×n and any λ1 , . . . , λn ∈ C, the corresponding AIEP is solvable, with the number of solutions not exceeding n!. Moreover, for almost all λ1 , . . . , λn there are exactly n! solutions. 3. Each MIEP is a PIEP(C) with A = 0 and Ak = vk ekT for k = 1, . . . , n, where v1 , . . . , vn ∈ Cn and B = [ v1 · · · vn ] ∈ Cn×n . 4. [Fri75] Assume that all principal minors of B ∈ Cn×n are nonzero. For any λ1 , . . . , λn ∈ C, the corresponding MIEP is solvable, with the number of solutions not exceeding n!. Moreover, for almost all λ1 , . . . , λn there are exactly n! solutions. (k) n 5. Each ToIEP is a PIEP(RS) with A = 0 and Ak = [ ai(k) j ]i, j =1 , where a i j = 1 if i − j  + 1 = k and (k) ai j = 0 otherwise. 6. [Lan94] For any λ1 , . . . , λn ∈ R the corresponding ToIEP is solvable.
20.10 Numerical Methods for PIEPs Facts: [Dai98] 1. For a given PIEP(RS), it is possible to order both the eigenvalues λ1 ≤ · · · ≤ λn and the eigenvalues λ1 (c) ≤ · · · ≤ λn (c) of A(c). Then solving the PIEP(RS) is equivalent to solving the nonlinear system f (c) = (λ1 (c) − λ1 , . . . , λn (c) − λn )T = 0. Assume that a solution c∗ exists and that the given eigenvalues are distinct: r Method 1a. Newton’s method provides a locally quadratically convergent (l.q.c.) algorithm, and
it is usually l.q.c. even in the presence of multiple eigenvalues ([FNO87]). Each iteration in Newton’s method involves the solution of an eigenvalue–eigenvector problem. r Method 1b. A Newtonlike method is given in [FNO87] . Newton’s method is modified by using
the inverse power method to find approximate eigenvectors in each iteration. The new algorithm maintains l.q.c. (see [CXZ99]). r Method 1c. An inexact Newtonlike method is given in [CCX03] . The last iterations of the inverse
power method are truncated avoiding oversolving. The algorithm converges superlinearly, but the overall cost is reduced. In particular, for ToIEPs, this improved algorithm has better performance than specific known algorithms. 2. For a given PIEP(R) or PIEP(C), complex eigenvalues can appear. Assume that for the corresponding PIEP a solution c∗ exists: r Method 2. In [BK81], Newton’s method is applied to solve
f (c) = (det(A(c) − λ1 In ), . . . , det(A(c) − λn In ))T = 0. The algorithm is l.q.c. and is suitable for the case of distinct eigenvalues. r Method 3. Newton’s method is applied in [Xu96] to solve
f (c) = (σmi n (A(c) − λ1 In ), . . . , σmi n (A(c) − λn In ))T = 0, where σmi n denotes the smallest singular value. The algorithm is l.q.c. under mild conditions even when multiple eigenvalues are present.
2012
Handbook of Linear Algebra r Method 4a. An l.q.c. algorithm based on the Q R decomposition theory is given in [Li92] that is
suitable for the case of distinct eigenvalues. r Method4b. Method 4a is extended in [Dai99] to the case of multiple eigenvalues for any PIEP(RS).
The new algorithm is l.q.c. and is based on Q Rlike decomposition theory and least square techniques. Methods 4a and 4b are given in a more general context. 3. All previous methods require starting from an initial point close to a solution in order to guarantee convergence. r Method 5. A homotopy approach has been considered for complex symmetric matrices
(see [Chu90], [Xu93]), which in theory provides a globally convergent algorithm by which all solutions can be found.
References [BGRS90] J.A. Ball, I. Gohberg, L. Rodman, and T. Shalom. On the eigenvalues of matrices with given upper triangular part. Integ. Eq. Oper. Theory, 13(4):488–497, 1990. [BH91] M. Boyle and D. Handelman. The spectra of nonnegative matrices via symbolic dynamics. Ann. of Math. (2), 133(2):249–316, 1991. [BK81] F.W. BieglerK¨onig. A Newton iteration process for inverse eigenvalue problems. Numer. Math., 37(3):349–354, 1981. [BM97] A. Borobia and J. Moro. On nonnegative matrices similar to positive matrices. Lin. Alg. Appl., 266:365–379, 1997. [BMS04] A. Borobia, J. Moro, and R. Soto. Negativity compensation in the nonnegative inverse eigenvalue problem. Lin. Alg. Appl., 393:73–89, 2004. [Bor95] A. Borobia. On the nonnegative eigenvalue problem. Lin. Alg. Appl., 223/224:131–140, 1995. [CCX03] R.H. Chan, H.L. Chung, and S.F. Xu. The inexact Newtonlike method for inverse eigenvalue problem. BIT, 43(1):7–20, 2003. [CDS04] M.T. Chu, F. Diele, and I. Sgura. Gradient flow methods for matrix completion with prescribed eigenvalues. Lin. Alg. Appl., 379:85–112, 2004. [CG02] M.T. Chu and G.H. Golub. Structured inverse eigenvalue problems. Acta Numer., 11:1–71, 2002. [Chu90] M.T. Chu. Solving additive inverse eigenvalue problems for symmetric matrices by the homotopy method. IMA J. Numer. Anal., 10(3):331–342, 1990. [CL83] N.N. Chan and K.H. Li. Diagonal elements and eigenvalues of a real symmetric matrix. J. Math. Anal. Appl., 91(2):562–566, 1983. [CXZ99] R.H. Chan, S.F. Xu, and H.M. Zhou. On the convergence of a quasiNewton method for inverse eigenvalue problems. SIAM J. Numer. Anal., 36(2):436–441 (electronic), 1999. [Dai98] H. Dai. Some developments on parameterized inverse eigenvalue problems. CERFACS Tech. Report TR/PA/98/34,1998. [Dai99] H. Dai. An algorithm for symmetric generalized inverse eigenvalue problems. Lin. Alg. Appl., 296(13):79–98, 1999. [DD45] N. Dmitriev and E. Dynkin. On the characteristic numbers of a stochastic matrix. C.R. (Doklady) Acad. Sci. URSS, 49:159–162, 1945. [DD46] N. Dmitriev and E. Dynkin. On characteristic roots of stochastic matrix. Izv. Akad. Nauk SSSR, Ser. Mat., 10:167–184, 1946. [Dds74] J.A. Dias da Silva. Matrices with prescribed entries and characteristic polynomial. Proc. Amer. Math. Soc., 45:31–37, 1974. [dO71] G.N. de Oliveira. Matrices with prescribed characteristic polynomial and a prescribed submatrix. III. Monatsh. Math., 75:441–446, 1971. [dO73a] G.N. de Oliveira. Matrices with prescribed entries and eigenvalues. I. Proc. Amer. Math. Soc., 37:380–386, 1973.
Inverse Eigenvalue Problems
2013
[dO73b] G.N. de Oliveira. Matrices with prescribed entries and eigenvalues. II. SIAM J. Appl. Math., 24:414–417, 1973. [dO75] G.N. de Oliveira. Matrices with prescribed characteristic polynomial and several prescribed submatrices. Lin. Multilin. Alg., 2:357–364, 1975. [dS79] E.M. de S´a. Imbedding conditions for λmatrices. Lin. Alg. Appl., 24:33–50, 1979. [ELN04] P.D. Egleston, T.D. Lenker, and S.K. Narayan. The nonnegative inverse eigenvalue problem. Lin. Alg. Appl., 379:475–490, 2004. [Fie74] M. Fiedler. Eigenvalues of nonnegative symmetric matrices. Lin. Alg. Appl., 9:119–142, 1974. [Fil69] P.A. Fillmore. On similarity and the diagonal of a matrix. Amer. Math. Monthly, 76:167–169, 1969. [FNO87] S. Friedland, J. Nocedal, and M.L. Overton. The formulation and analysis of numerical methods for inverse eigenvalue problems. SIAM J. Numer. Anal., 24(3):634–667, 1987. [Fri75] S. Friedland. On inverse multiplicative eigenvalue problems for matrices. Lin. Alg. Appl., 12(2):127– 137, 1975. [Fri77] S. Friedland. Inverse eigenvalue problems. Lin. Alg. Appl., 17(1):15–51, 1977. [FS98] S. Furtado and F.C. Silva. On the characteristic polynomial of matrices with prescribed columns and the stabilization and observability of linear systems. Electron. J. Lin. Alg., 4:19–31, 1998. [GKvS95] I. Gohberg, M.A. Kaashoek, and F. van Schagen. Partially Specified Matrices and Operators: Classification, Completion, Applications, Vol. 79 of Operator Theory: Advances and Applications. Birkh¨auser Verlag, Basel, Germany, 1995. [Her83] D. Hershkowitz. Existence of matrices with prescribed eigenvalues and entries. Lin. Multilin. Alg., 14(4):315–342, 1983. [IC00] Kh.D. Ikramov and V.N. Chugunov. Inverse matrix eigenvalue problems. J. Math. Sci. (New York), 98(1):51–136, 2000. [JLL96] C.R. Johnson, T.J. Laffey, and R. Loewy. The real and the symmetric nonnegative inverse eigenvalue problems are different. Proc. Amer. Math. Soc., 124(12):3647–3651, 1996. [Joh81] C.R. Johnson. Row stochastic matrices similar to doubly stochastic matrices. Lin. Multilin. Alg., 10(2):113–130, 1981. [Kar51] F. Karpelevich. On the eigenvalues of a matrix with nonnegative elements (in russian). Izv. Akad. Nauk SSR Ser. Mat., 14:361–383, 1951. [Kel71] R.B. Kellogg. Matrices similar to a positive or essentially positive matrix. Lin. Alg. Appl., 4:191–204, 1971. [KOR00] K.H. Kim, N.S. Ormes, and F.W. Roush. The spectra of nonnegative integer matrices via formal power series. J. Amer. Math. Soc., 13(4):773–806, 2000. [KM01] J. Knudsen and J. McDonald. A note on the convexity of the realizable set of eigenvalues for nonnegative symmetryc matrices. Electron. J. Lin. Alg., 8:110–114, 2001. [Lan94] H.J. Landau. The inverse eigenvalue problem for real symmetric Toeplitz matrices. J. Amer. Math. Soc., 7(3):749–767, 1994. [Li92] R.C. Li. Algorithms for inverse eigenvalue problems. J. Comput. Math., 10(2):97–111, 1992. [LL78] R. Loewy and D. London. A note on an inverse problem for nonnegative matrices. Lin. Multilin. Alg., 6(1):83–90, 1978. [LM99] T.J. Laffey and E. Meehan. A characterization of trace zero nonnegative 5 × 5 matrices. Lin. Alg. Appl., 302/303:295–302, 1999. [Min88] H. Minc. Nonnegative matrices. WileyInterscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, New York, 1988. [Mir63] L. Mirsky. Results and problems in the theory of doublystochastic matrices. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, 1:319–334, 1962/1963. [Mou03] B. Mourad. An inverse problem for symmetric doubly stochastic matrices. Inverse Problems, 19(4):821–831, 2003. [MS00] I.T. Matos and F.C. Silva. A completion problem over the field of real numbers. Lin. Alg. Appl., 320(13):63–77, 2000.
2014
Handbook of Linear Algebra
[Rad96] N. Radwan. An inverse eigenvalue problem for symmetric and normal matrices. Lin. Alg. Appl., 248:101–109, 1996. [Rea96] R. Reams. An inequality for nonnegative matrices and the inverse eigenvalue problem. Lin. Multilin. Alg., 41(4):367–375, 1996. [RS03] O. Rojo and R.L. Soto. Existence and construction of nonnegative matrices with complex spectrum. Lin. Alg. Appl., 368:53–69, 2003. [Sil87a] F.C. Silva. Matrices with prescribed characteristic polynomial and submatrices. Portugal. Math., 44(3):261–264, 1987. [Sil87b] F.C. Silva. Matrices with prescribed eigenvalues and principal submatrices. Lin. Alg. Appl., 92:241– 250, 1987. [Sil90] F.C. Silva. Matrices with prescribed similarity class and a prescribed nonprincipal submatrix. Portugal. Math., 47(1):103–113, 1990. [Sil91] F.C. Silva. Matrices with prescribed eigenvalues and blocks. Lin. Alg. Appl., 148:59–73, 1991. [Sil93] F.C. Silva. Matrices with prescribed lower triangular part. Lin. Alg. Appl., 182:27–34, 1993. ˇ ˇ [Smi04] H. Smigoc. The inverse eigenvalue problem for nonnegative matrices. Lin. Alg. Appl., 393:365–374, 2004. [SBM05] R.L. Soto, A. Borobia, and J. Moro. On the comparison of some realizability criteria for the real nonnegative inverse eigenvalue problem. Lin. Alg. Appl., 396:223–241, 2005. [Sot03] R.L. Soto. Existence and construction of nonnegative matrices with prescribed spectrum. Lin. Alg. Appl., 369:169–184, 2003. [Sou83] G.W. Soules. Constructing symmetric nonnegative matrices. Lin. Multilin. Alg., 13(3):241–251, 1983. [Sul49] H.R. Sule˘ımanova. Stochastic matrices with real characteristic numbers. Doklady Akad. Nauk SSSR (N.S.), 66:343–345, 1949. [SY86] J.G. Sun and Q. Ye. The unsolvability of inverse algebraic eigenvalue problems almost everywhere. J. Comput. Math., 4(3):212–226, 1986. [Tho79] R.C. Thompson. Interlacing inequalities for invariant factors. Lin. Alg. Appl., 24:1–31, 1979. [Wim74] H.K. Wimmer. Existenzs¨atze in der Theorie der Matrizen und lineare Kontrolltheorie. Monatsh. Math., 78:256–263, 1974. [Wuw97] G. Wuwen. Eigenvalues of nonnegative matrices. Lin. Alg. Appl., 266:261–270, 1997. [Xu92] S.F. Xu. The solvability of algebraic inverse eigenvalue problems almost everywhere. J. Comput. Math., 10(Supplementary Issue):152–157, 1992. [Xu93] S.F. Xu. A homotopy algorithm for solving the inverse eigenvalue problem for complex symmetric matrices. J. Comput. Math., 11(1):7–19, 1993. [Xu96] S.F. Xu. A smallest singular value method for solving inverse eigenvalue problems. J. Comput. Math., 14(1):23–31, 1996. [Zab86] I. Zaballa. Existence of matrices with prescribed entries. Lin. Alg. Appl., 73:227–280, 1986. [Zab87] I. Zaballa. Matrices with prescribed rows and invariant factors. Lin. Alg. Appl., 87:113–146, 1987. [Zab89] I. Zaballa. Matrices with prescribed invariant factors and offdiagonal submatrices. Lin. Multilin. Alg., 25(1):39–54, 1989.
21 Totally Positive and Totally Nonnegative Matrices
Shaun M. Fallat University of Regina
21.1 Basic Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 212 21.2 Factorizations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215 21.3 Recognition and Testing . . . . . . . . . . . . . . . . . . . . . . . . . . . . 216 21.4 Spectral Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 218 21.5 Deeper Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 219 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2112
Total positivity has been a recurring theme in linear algebra and other aspects of mathematics for the past 80 years. Totally positive matrices, in fact, originated from studying small oscillations in mechanical systems [GK60], and from investigating relationships between the number of sign changes of the vectors x and Ax for fixed A [Sch30]. Since then this class (and the related class of signregular matrices) has arisen in such a wide range of applications (see [GM96] for an incredible compilation of interesting articles dealing with a long list of relevant applications of totally positive matrices) that over the years many convenient points of view for total positivity have been offered and later defended by many prominent mathematicians. After F.R. Gantmacher and M.G. Krein [GK60], totally positive matrices were seen and further developed in connection with spline functions, collocation matrices, and generating totally positive sequences (Polya frequency sequences). Then in 1968 came one of the most important and influential references in this area, namely the book Total Positivity by S. Karlin [Kar68]. Karlin approached total positivity by considering the analytic properties of totally positive functions. Along these lines, he studied totally positive kernels, signregular functions, and Polya frequency functions. Karlin also notes the importance of total positivity in the field of statistics. The next significant view point can be seen in T. Ando’s survey paper [And87]. Ando’s contribution was to consider a multilinear approach to this subject, namely making use of skewsymmetric products and Schur complements as his underlying tools. More recently, it has become clear that factorizations of totally positive matrices are a fruitful avenue for research on this class. Coupled with matrix factorizations, totally positive matrices have taken on a new combinatorial form known as Planar networks. Karlin and G. McGregor [KM59] were some of the pioneers of this view point on total positivity (see also [Bre95][Lin73]), and there has since been a revolution of sorts with many new and exciting advances and additional applications (e.g., positive elements in reductive Lie groups, computeraided geometric design, shapepreserving designs). This area is not only a historically significant one in linear algebra, but it will continue to produce many important advances and spawn many more worthwhile applications. 211
212
21.1
Handbook of Linear Algebra
Basic Properties
In this section, we present many basic, yet fundamental, properties associated with the important class of totally positive and totally nonnegative matrices. Definitions: An m × n real matrix A is totally nonnegative (TN) if the determinant of every square submatrix (i.e., minor) is nonnegative. An m × n real matrix A is totally positive (TP) if every minor of A is positive. An n × n matrix A is oscillatory if A is totally nonnegative and Ak is totally positive for some integer k ≥ 1. An m × n real matrix is in double echelon form if (a) Each row of A has one of the following forms (∗ indicates a nonzero entry): 1. (∗, ∗, · · · , ∗), 2. (∗, · · · , ∗, 0, · · · , 0), 3. (0, · · · , 0, ∗, · · · , ∗), or 4. (0, · · · , 0, ∗, · · · , ∗, 0, · · · , 0). (b) The first and last nonzero entries in row i + 1 are not to the left of the first and last nonzero entries in row i , respectively (i = 1, 2, . . . , n − 1). Facts: 1. Every totally positive matrix is a totally nonnegative matrix. 2. Suppose A is a totally nonnegative (positive) rectangular matrix. Then (a) AT , the transpose of A, is totally nonnegative (positive), (b) A[α, β] is totally nonnegative (positive) for any row index set α and column index set β. 3. (Section 4.2) Cauchy–Binet Identity: Since any k × k minor of the product AB is a sum of products of k × k minors of A and B, it follows that if all the k × k minors of two n × n matrices are positive, then all the k × k minors of their product are positive. 4. [GK02, p .74], [And87] The set of all totally nonnegative (positive) matrices is closed under multiplication. 5. Let A be TP (TN) and D1 and D2 be positive diagonal matrices. Then D1 AD2 is TP (TN). 6. [GK02, p .75] If A is a square invertible totally nonnegative (or is totally positive) matrix, then S A−1 S is totally nonnegative (positive) for S = diag(1, −1, · · · , ±1). Hence, if A is a square invertible totally nonnegative matrix (or is totally positive), then the unsigned adjugate matrix of A (or the (n − 1)st compound of A) is totally nonnegative (positive). 7. [And87], [Fal99] If A is a square totally nonnegative (positive) matrix, then, assuming A[α c ] is invertible, A/A[α c ] = A[α] − A[α, α c ](A[α c ])−1 A[α c , α], the Schur complement of A[α c ] in A, is totally nonnegative (positive), for all index sets α based on consecutive indices. Recall that α c denotes the complement of the set α. 8. [And87], [Fal01], [Whi52], [Kar68, p. 98] The closure of the totally positive matrices (in the usual topology on Rm×n ) is the totally nonnegative matrices. 9. [Fal99], [JS00] Let A = [a1 , a2 , . . . , an ] be an m × n totally nonnegative (positive) matrix whose i th column is ai (i = 1, 2, . . . , n). Suppose C denotes the set of all column vectors b for which
213
Totally Positive and Totally Nonnegative Matrices
10.
11.
12. 13. 14.
the m × (n + 1) matrix Aˆ = [a1 , . . . , ak , b, ak+1 , . . . , an ] is a totally nonnegative (positive) matrix (here k is fixed but arbitrary). Then C is a nonempty convex cone. [Fal99] If A is an m × n totally nonnegative (positive) matrix, then increasing the (1,1) or the (m, n) entries of A results in a totally nonnegative (positive) matrix. In general these are the only two entries in a TN matrix with this property (see [FJS00]). [And87] Let P denote the n × n permutation matrix induced by the permutation i → n − i + 1, (1 ≤ i ≤ n), and suppose A is an n × n totally nonnegative (positive) matrix. Then PAP is a totally nonnegative (positive) matrix. Any irreducible tridiagonal matrix with nonzero main diagonal is in double echelon form. [Fal99] Let A be an m × n totally nonnegative matrix with no zero rows or columns. Then A is in double echelon form. [Rad68], [Fal99] An n×n totally nonnegative matrix A = [ai j ] is irreducible if and only if ai,i +1 > 0 and ai +1,i > 0, for i = 1, 2, . . . , n − 1.
Examples: ⎡
⎤
1 1 1 ⎢ ⎥ 1. Consider the following 3 × 3 matrix: A = ⎣1 2 4⎦ . It is not difficult to check that all minors 1 3 9 of A are positive. 2. (Inverse tridiagonal matrix) From Fact 6 above, the inverse of a TN tridiagonal matrix is signature similar to a TN matrix. Such matrices are referred to as “singlepair” matrices in [GK02, pp. 78–80], are very much related to “Green’s matrices” (see [Kar68, pp. 110–112]), and are similar to matrices of type D found in [Mar70a]. 3. (Vandermonde matrix) Vandermonde matrices arise in the problem of determining a polynomial of degree at most n − 1 that interpolates n data points. Suppose that n data points (xi , yi )in=1 are given. The goal is to construct a polynomial p(x) = a0 + a1 x + · · · + an−1 x n−1 that satisfies p(xi ) = yi for i = 1, 2, . . . , n, which can be expressed as ⎡
1
⎢1 ⎢ ⎢. ⎢. ⎣.
1
x1 x2 xn
x12 x22 .. . xn2
··· ··· ···
⎤⎡
⎤
⎡ ⎤
x1n−1 a0 y1 ⎢ a ⎥ ⎢y ⎥ x2n−1 ⎥ ⎥ ⎢ 1 ⎥ ⎢ 2⎥ ⎥ ⎢ ⎥ ⎢ .. ⎥ ⎥⎢ . ⎥ = ⎢ . ⎥. . ⎦ ⎣ .. ⎦ ⎣ .. ⎦ xnn−1 an−1 yn
(21.1)
The n × n coefficient matrix in (21.1) is called a Vandermonde matrix, and we denote it by V(x , . . . , xn ). The determinant of the n × n Vandermonde matrix in (21.1) is given by the formula 1 i > j (xi − x j ); see [MM64, pp. 15–16]. Thus, if 0 < x1 < x2 < · · · < xn , then V(x1 , . . . , xn ) has positive entries, positive leading principal minors, and positive determinant. More generally, it is known [GK02, p. 111] that if 0 < x1 < x2 < · · · < xn , then V(x1 , . . . , xn ) is TP. Example 1 above is a Vandermonde matrix. 4. Let f (x) = in=0 ai x i be an nth degree polynomial in x. The Routh–Hurwitz matrix is the n × n matrix given by ⎡
a1 ⎢a 0 ⎢ ⎢0 ⎢ ⎢0 A=⎢ ⎢. ⎢. ⎢. ⎢ ⎣0 0
a3 a2 a1 a0 .. . 0 0
a5 a4 a3 a2 .. . 0 0
a7 a6 a5 a4 .. . 0 0
··· ··· ··· ··· ··· ··· ···
0 0 0 0 .. . an−1 an−2
⎤
0 0⎥ ⎥ 0⎥ ⎥ 0⎥ ⎥. .. ⎥ ⎥ .⎥ ⎥ 0⎦ an
214
Handbook of Linear Algebra
A specific example of a Routh–Hurwitz matrix for an arbitrary polynomial of degree six, f (x) = 6 i i =0 a i x , is given by ⎡
a1 ⎢a ⎢ 0 ⎢ ⎢0 A=⎢ ⎢0 ⎢ ⎣0 0
a3 a2 a1 a0 0 0
a5 a4 a3 a2 a1 a0
0 a6 a5 a4 a3 a2
0 0 0 a6 a5 a4
⎤
0 0 0 0 0 a6
⎥ ⎥ ⎥ ⎥ ⎥. ⎥ ⎥ ⎦
A polynomial f (x) is stable if all the zeros of f (x) have negative real parts. It is proved in [Asn70] that f (x) is stable if and only if the Routh–Hurwitz matrix formed from f is totally nonnegative. 5. (Cauchy matrix) An n × n matrix C = [c i j ] is called a Cauchy matrix if the entries of C are given by ci j =
1 , xi + y j
where x1 , x2 , . . . , xn and y1 , y2 , . . . , yn are two sequences of numbers (chosen so that c i j is welldefined). A Cauchy matrix is totally positive if and only if 0 < x1 < x2 < · · · < xn and 0 < y1 < y2 < · · · < yn ([GK02, pp. 77–78]). ⎡ ⎤ 1 1 1 1 ⎢ 4⎥ ⎢1 2 3 ⎥ 6. (Pascal matrix) Consider the 4 × 4 matrix P4 = ⎢ ⎥ . The matrix P4 is called the ⎣1 3 6 10⎦ 1 4 10 20 symmetric 4 × 4 Pascal matrix because of its connection with Pascal’s triangle (see Example 4 of section 21.2 for a definition of Pn for general n). Then P4 is TP, and the inverse of P4 is given by ⎡
P4−1
4 ⎢−6 ⎢ =⎢ ⎣ 4 −1
−6 4 14 −11 −11 10 3 −3
⎤
−1 3⎥ ⎥ ⎥. −3⎦ 1
Notice that the inverse of the 4 × 4 Pascal matrix is integral. Moreover, deleting the signs by forming ⎡
4
⎢ ⎢6 S P4−1 S, where S = diag(1, −1, 1, −1), results in the TP matrix ⎢ ⎣4
1
6 14 11 3
4 11 10 3
⎤
1 3⎥ ⎥ ⎥. 3⎦ 1
Applications: 1. (Tridiagonal matrices) When Gantmacher and Krein were studying the oscillatory properties of an elastic segmental continuum (no supports between the endpoints a and b) under small transverse oscillations, they were able to generate a system of linear equations that define the frequency of the oscillation (see [GK60]). The system of equations thus found can be represented in what is known as the influencecoefficient matrix, whose properties are analogous to those governing the segmental continuum. This process of obtaining the properties of the segmental continuum from the influencecoefficient matrix was only possible due to the inception of the theory of oscillatory matrices. A special case involves tridiagonal matrices (or Jacobi matrices as they were called in [GK02]). Tridiagonal matrices are not only interesting in their own right as a model example of oscillatory matrices, but they also naturally arise in studying small oscillations in certain mechanical systems, such as torsional oscillations of a system of disks fastened to a shaft. In [GK02, pp. 81–82] they prove that an irreducible tridiagonal matrix is totally nonnegative if and only if its entries are nonnegative and its leading principal minors are nonnegative.
215
Totally Positive and Totally Nonnegative Matrices
21.2
Factorizations
Recently, there has been renewed interest in total positivity partly motivated by the socalled “bidiagonal factorization,” namely, the fact that any totally positive matrix can be factored into entrywise nonnegative bidiagonal matrices. This result has proven to be a very useful and tremendously powerful property for this class. (See Section 1.6 for basic information on LU factorizations.) Definitions: An elementary bidiagonal matrix is an n × n matrix whose main diagonal entries are all equal to one, and there is, at most, one nonzero offdiagonal entry and this entry must occur on the super or subdiagonal. The lower elementary bidiagonal matrix whose elements are given by ci j =
⎧ ⎪ ⎨1,
if i = j, µ, if i = k, j = k − 1, ⎪ ⎩0, otherwise
is denoted by E k (µ) = [c i j ] (2 ≤ k ≤ n). A triangular matrix is TP if all of its nontrivial minors are positive. (Here a trivial minor is one which is zero only because of the zero pattern of a triangular matrix.) Facts: 1. (E k (µ))−1 = E k (−µ). 2. [Cry73] Let A be an n × n matrix. Then A is totally positive if and only if A has an LU factorization such that both L and U are n × n TP matrices. 3. [And87], [Cry76] Let A be an n × n matrix. Then A is totally nonnegative if and only if A has an LU factorization such that both L and U are n × n totally nonnegative matrices. 4. [Whi52] Suppose A = [ai j ] is an n ×n matrix with a j 1 , a j +1,1 > 0, and ak1 = 0 for k > j +1. Let B be the n×n matrix obtained from A by using row j to eliminate a j +1,1 . Then A is TN if and only if B is TN. Note that B is equal to E j +1 (−a j +1,1 /a j 1 )A j and, hence, A = (E j +1 (−a j +1,1 /a j 1 ))−1 B = E j +1 (a j +1,1 /a j 1 )B. 5. [Loe55], [GP96], [BFZ96], [FZ00], [Fal01] Let A be an n × n nonsingular totally nonnegative matrix. Then A can be written as A = (E 2 (l k ))(E 3 (l k−1 )E 2 (l k−2 )) · · · (E n (l n−1 ) · · · E 3 (l 2 )E 2 (l 1 ))D (E 2T (u1 )E 3T (u2 ) · · · E nT (un−1 )) · · · (E 2T (uk−2 )E 3T (uk−1 ))(E 2T (uk )),
(21.2)
n
where k = 2 ; l i , u j ≥ 0 for all i, j ∈ {1, 2, . . . , k}; and D is a positive diagonal matrix. 6. [Cry76] Any n × n totally nonnegative matrix A can be written as A=
M i =1
L (i )
N
U ( j ),
(21.3)
j =1
where the matrices L (i ) and U ( j ) are, respectively, lower and upper bidiagonal totally nonnegative matrices with at most one nonzero entry off the main diagonal. 7. [Cry76], [RH72] If A is an n × n totally nonnegative matrix, then there exists a totally nonnegative matrix S and a tridiagonal totally nonnegative matrix T such that (a) T S = S A. (b) The matrices A and T have the same eigenvalues. Moreover, if A is nonsingular, then S is nonsingular.
216
Handbook of Linear Algebra
Examples: 1. Let P4 be the matrix given in Example 6 of section 21.1. Then P4 is TP, and a (unique up to a positive diagonal scaling) LU factorization of P4 is given by ⎡
1
⎢ ⎢1 P4 = LU = ⎢ ⎣1
1
0 1 2 3
⎤⎡
0 0 1 3
0 1 ⎢ 0⎥ ⎥ ⎢0 ⎥⎢ 0⎦ ⎣ 0 1 0
1 1 0 0
⎤
1 2 1 0
1 3⎥ ⎥ ⎥. 3⎦ 1
Observe that the rows of L , or the columns of U , come from the rows of Pascal’s triangle (ignoring the zeros); hence, the name Pascal matrix (see Example 4 for a definition of Pn ). 2. The 3 × 3 Vandermonde matrix A in Example 1 of Section 21.1 can be factored as ⎡
1 ⎢ A = ⎣0 0
0 1 1
⎤⎡
0 1 ⎥⎢ 0⎦ ⎣ 1 1 0 ⎡
1 ⎢ ⎣0 0
0 1 0 0 1 0
⎤⎡
0 1 ⎥⎢ 0⎦ ⎣ 0 1 0 ⎤⎡
0 1 ⎥⎢ 2⎦ ⎣ 0 1 0
⎤⎡
0 1 1 1 1 0
0 1 ⎥⎢ 0⎦ ⎣ 0 1 0 ⎤⎡
0 1 ⎥⎢ 0⎦ ⎣ 0 1 0
⎤
0 1 0
0 ⎥ 0⎦ 2 ⎤
0 1 0
0 ⎥ 1⎦ . 1
(21.4)
3. In fact, we can write V (x1 , x2 , x3 ) as ⎡
⎡
1 ⎢ ⎣0 0
1 ⎢ V(x1 , x2 , x3 ) = ⎣0 0 0 x2 − x1 0
0 0
0 1 1
⎤⎡
0 1 ⎥⎢ 0⎦ ⎣ 1 1 0
⎤⎡
1 ⎥⎢ ⎦ ⎣0 (x3 − x2 )(x3 − x1 ) 0
⎤⎡
0 1 ⎥⎢ 0⎦ ⎣ 0 1 0
0 1 0 0 1 0
0 1
⎤
(x3 −x2 ) (x2 −x1 )
⎤⎡
0 1 ⎥⎢ x 2 ⎦ ⎣0 1 0
x1 1 0
0 0⎥ ⎦ 1
⎤⎡
0 1 ⎥⎢ 0⎦ ⎣ 0 1 0
0 1 0
⎤
0 ⎥ x1 ⎦ . 1
4. Consider the factorization (21.2) from Fact 5 of a 4 × 4 matrix in which all of the variables are equal to one. The resulting matrix is P4 , which is necessarily TP. On the other hand, consider the n × n matrix Pn = [ pi j ] whose first row and column entries are all ones, and for 2 ≤ i, j ≤ n let pi j = pi −1, j + pi, j −1 . In fact, the relation pi j = pi −1, j + pi, j −1 implies [Fal01] that Pn can be written as
Pn = E n (1) · · · E 2 (1)
1 0
0 Pn−1
E 2T (1) · · · E nT (1).
Hence, by induction, Pn has the factorization (21.2) in which the variables involved are all equal to one. Consequently, the symmetric Pascal matrix Pn is TP for all n ≥ 1. Furthermore, since in general (E k (µ))−1 = E k (−µ) (Fact 1), it follows that Pn−1 is not only signature similar to a TP matrix, but it is also integral.
21.3
Recognition and Testing
In practice, how can one determine if a given n × n matrix is TN or TP? One could calculate every minor,
2 √ but that would involve evaluating nk=1 nk ∼ 4n / πn determinants. Is there a smaller collection of minors whose nonnegativity or positivity implies the nonnegativity or positivity of all minors?
Totally Positive and Totally Nonnegative Matrices
217
Definitions: For α = {i 1 , i 2 , . . . , i k } ⊆ N = {1, 2, . . . , n}, with i 1 < i 2 < · · · < i k , the dispersion of α, denoted by d(α), is defined to be k−1 j =1 (i j +1 − i j − 1) = i k − i 1 − (k − 1), with the convention that d(α) = 0, when α is a singleton. If α and β are two contiguous index sets with α = β = k, then the minor det A[α, β] is called initial if α or β is {1, 2, . . . , k}. A minor is called a leading principal minor if it is an initial minor with both α = β = {1, 2, . . . , k}. An upper right (lower left) corner minor of A is one of the form det A[α, β] in which α consists of the first k (last k) and β consists of the last k (first k) indices, k = 1, 2, . . . , n. Facts: 1. The dispersion of a set α represents a measure of the “gaps” in the set α. In particular, observe that d(α) = 0 if and only if α is a contiguous subset of N. 2. [Fek13] (Fekete’s Criterion) An m × n matrix A is totally positive if and only if det A[α, β] > 0, for all α ⊆ {1, 2, . . . , m} and β ⊆ {1, 2, . . . , n}, with α = β and d(α) = d(β) = 0. (Reduces the number of minors to be checked for total positivity to roughly n3 .) 3. [GP96], [FZ00] If all initial minors of A are positive, then A is TP. (Reduces the number of minors to be checked for total positivity to n2 .) 4. [SS95], [Fal04] Suppose that A is TN. Then A is TP if and only if all corner minors of A are positive. 5. [GP96] Let A ∈ Rn×n be nonsingular. (a) A is TN if and only if for each k = 1, 2, . . . , n, i. det A[{1, 2, . . . , k}] > 0. ii. det A[α, {1, 2, . . . , k}] ≥ 0, for every α ⊆ {1, 2, . . . , n}, α = k. iii. det A[{1, 2, . . . , k}, β] ≥ 0, for every β ⊆ {1, 2, . . . , n}, β = k. (b) A is TP if and only if for each k = 1, 2 . . . , n, i. det A[α, {1, 2, . . . , k}] > 0, for every α ⊆ {1, 2, . . . , n} with α = k, d(α) = 0. ii. det A[{1, 2, . . . , k}, β] > 0, for every β ⊆ {1, 2, . . . , n} with β = k, d(β) = 0. 6. [GK02, p. 100] An n × n totally nonnegative matrix A = [ai j ] is oscillatory if and only if (a) A is nonsingular. (b) ai,i +1 > 0 and ai +1,i > 0, for i = 1, 2, . . . , n − 1. 7. [Fal04] Suppose A is an n × n invertible totally nonnegative matrix. Then A is oscillatory if and only if a parameter from at least one of the bidiagonal factors E k and E kT is positive, for each k = 2, 3, . . . , n in the elementary bidiagonal factorization of A given in Fact 5 of section 21.2.
Examples: 1. Unfortunately, Fekete’s Criterion, Fact 2, does not hold in general if “totally positive” is replaced with “totally nonnegative” and “> 0” is replaced with “≥ 0.” Consider the following simple example: ⎡
1 ⎢ A = ⎣1 2
0 0 0
⎤
2 ⎥ 1⎦ . It is not difficult to verify that every minor of A based on contiguous row and 1
column sets is nonnegative, but detA[{1, 3}] = −3. For an invertible and irreducible example ⎡
0 ⎢ consider A = ⎣0 1
1 0 0
⎤
0 ⎥ 1⎦ . 0
218
21.4
Handbook of Linear Algebra
Spectral Properties
Approximately 60 years ago, Gantmacher and Krein [GK60], who were originally interested in oscillation dynamics, undertook a careful study into the theory of totally nonnegative matrices. Of the many topics they considered, one was the properties of the eigenvalues of totally nonnegative matrices. Facts: 1. [GK02, pp. 86–91] Let A be an n × n oscillatory matrix. Then the eigenvalues of A are positive, real, and distinct. Moreover, an eigenvector xk corresponding to the k th largest eigenvalue has exactly k − 1 variations in sign for k = 1, 2, . . . , n. Furthermore, assuming we choose the first entry of each eigenvector to be positive, the positions of the sign change in each successive eigenvector interlace. (See Preliminaries for the definition of interlace.) 2. [And87] Let A be an n × n totally nonnegative matrix. Then the eigenvalues of A are real and nonnegative. 3. [FGJ00] Let A be an n × n irreducible totally nonnegative matrix. Then the positive eigenvalues of A are distinct. 4. [GK02, pp. 107–108] If A is an n × n oscillatory matrix, then the eigenvalues of A are distinct and strictly interlace the eigenvalues of the two principal submatrices of order n − 1 obtained from A by deleting the first row and column or the last row and column. If A is an n × n TN matrix, then nonstrict interlacing holds between the eigenvalues of A and the two principal submatrices of order n − 1 obtained from A by deleting the first row and column or the last row and column. 5. [Pin98] If A is an n × n totally positive matrix with eigenvalues λ1 > λ2 > · · · > λn and A(k) is the (n − 1) × (n − 1) principal submatrix obtained from A by deleting the kth row and column with eigenvalues µ1 > µ2 > · · · > µn−1 , then for j = 1, 2, . . . , n − 1, λ j −1 > µ j > λ j +1 , where λ0 = λ1 . In the usual Cauchy interlacing inequalities [MM64, p. 119] for positive semidefinite matrices, λ j −1 is replaced by λ j . The nonstrict inequalities need not hold for TN matrices. The extreme cases ( j = 1, n − 1) of this interlacing result were previously proved in [Fri85]. 6. [Gar82] Let n ≥ 2 and A = [ai j ] be an oscillatory matrix. Then the main diagonal entries of A are majorized by the eigenvalues of A. (See Preliminaries for the definition of majorization.) Examples: ⎡
1 1 1 ⎢ 3 ⎢1 2 1. Consider the 4 × 4 TP matrix P4 = ⎢ 6 ⎣1 3 1 4 10 2.203, .454, and .038, with respective eigenvectors ⎡
⎤ ⎡
⎤ ⎡
⎤
1 4⎥ ⎥ ⎥ . Then the eigenvalues of P4 are 26.305, 10⎦ 20 ⎤ ⎡
⎤
.06 .53 .787 .309 ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ .201 .64 −.163 −.723 ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥,⎢ ⎥,⎢ ⎥,⎢ ⎥. ⎣.458⎦ ⎣ .392⎦ ⎣−.532⎦ ⎣ .595⎦ .864 −.394 .265 −.168 ⎡
⎤
1 1 0 0 ⎢ ⎥ ⎢1 1 1 0⎥ 2. The irreducible, singular TN (Hessenberg) matrix given by H = ⎢ ⎥ has eigenvalues ⎣1 1 1 1⎦ 1 1 1 1 equal to 3, 1, 0, 0. Notice the positive eigenvalues of H are distinct. 3. Using the TP matrix P4 in Example 1, the eigenvalues of P4 ({1}) are 26.213, 1.697, and .09. Observe that the usual Cauchy interlacing inequalities are satisfied in this case.
219
Totally Positive and Totally Nonnegative Matrices
21.5
Deeper Properties
In this section, we explore more advanced topics that are not only interesting in their own right, but continue to demonstrate the delicate structure of these matrices. Definitions: For a given vector c = (c 1 , c 2 , . . . , c n )T ∈ Rn we define two quantities associated with the number of sign changes of the vector c. These are: V − (c) — the number of sign changes in the sequence c 1 , c 2 , . . . , c n with the zero elements discarded; and V + (c) — the maximum number of sign changes in the sequence c 1 , c 2 , . . . , c n , where the zero elements are arbitrarily assigned the values +1 and −1. For example, V − ((1, 0, 1, −1, 0, 1)T ) = 2 and V + ((1, 0, 1, −1, 0, 1)T ) = 4. We use <, ≤ to denote the usual entrywise partial order on matrices; i.e., for A = [ai j ], B = [bi j ] ∈ Rm×n , A ≤ (<) B means ai j ≤ (<) bi j , for all i, j . Let S be the signature matrix whose diagonal entries alternate in sign beginning with +. For A, B ∈ ∗
∗
Rm×n , we write A ≤ B if and only if S AS ≤ S B S and A < B if and only if S AS < S B S, and we call this
the “checkerboard” partial order on real matrices. Facts: 1. [Sch30] Let A be an m × n real matrix with m ≥ n. If A is totally positive, then V + (Ax) ≤ V − (x), for all nonzero x ∈ Rn . 2. Let A = [ai j ] be an n × n totally nonnegative matrix. Then: r Hadamard: [GK02, pp. 91–97], [Kot53]
detA ≤
n
i =1
aii ,
r Fischer: [GK02, pp. 91–97], [Kot53] Let S ⊆ N = {1, 2, . . . , n},
detA ≤ detA[S] · detA[N \ S],
r Koteljanskii: [Kot53] Let S, T ⊆ N,
detA[S ∪ T ] · detA[S ∩ T ] ≤ detA[S] · detA[T ].
The above three determinantal inequalities also hold for positive semidefinite matrices. (See Chapter 8.5.) 3. [FGJ03] Let α1 , α2 , β1 , and β2 be subsets of {1, 2, . . . , n}, and let A be any TN matrix. Then det A[α1 ] det A[α2 ] ≤ det A[β1 ] det A[β2 ] if and only if each index i has the same multiplicity in the multiset α1 ∪ α2 and the multiset β1 ∪ β2 , and max(α1 ∩ L , α2 ∩ L ) ≥ max(β1 ∩ L , β2 ∩ L ), for every contiguous (i.e., d(L ) = 0) L ⊆ {1, 2, . . . , n} (see [FGJ03] for other classes of principalminor inequalities). 4. [FJS00] Let A be an n × n totally nonnegative matrix with det A({1}) = 0. Then A − x E 11 is totally detA ]. nonnegative for all x ∈ [0, detA({1}) 5. [FJ98] Let A be an n × n TN matrix partitioned as follows
A11 A= cT
b , d
where A11 is (n − 1) × (n − 1). Suppose that rank(A11 ) = p. Then either rank([ A11 , b]) = p or T , c]T = p. See [FJ98] for other types of row and column inclusion results for TN matrices. rank[A11 6. [CFJ01] Let T be an n × n totally nonnegative tridiagonal matrix. Then the Hadamard product of T with any other TN matrix is again TN.
2110
Handbook of Linear Algebra
7. [CFJ01][Mar70b] The Hadamard product of any two n ×n tridiagonal totally nonnegative matrices is again totally nonnegative. ⎡
a ⎢ 8. [CFJ01] Let A = ⎣d g
b e h
⎤
c ⎥ f ⎦ be a 3 × 3 totally nonnegative matrix. Then A has the property that i
A ◦ B is TN for all B TN if and only if aei + g b f ≥ a f h + dbi, aei + dc h ≥ a f h + dbi. 9. [CFJ01] Let A be an n × n totally nonnegative matrix with the property that A ◦ B is TN for all B TN, and suppose B is any n × n totally nonnegative matrix. Then det(A ◦ B) ≥ detB
n
aii .
i =1
10. [Ste91] Let A = [ai j ] ∈ Rn×n , and let Sn denote the symmetric group on n symbols. If χ is an irreducible character of Sn , then the corresponding matrix function [ai j ] →
χ(ω)
ω∈Sn
n
ai,ω(i )
i =1
is called an immanant. For example, if χ is the trivial character χ(w ) = 1, then the corresponding immanant is the permanent and, if χ is sgn(ω), then the immanant is the determinant. Then every immanant of a totally nonnegative matrix is nonnegative. ∗
∗
11. [Gar96] If A, B, C ∈ Rn×n , A ≤ C ≤ B, and A and B are TP, then det C > 0. ∗ ∗ 12. [Gar96] If A, B, C ∈ Rn×n , A ≤ C ≤ B, and A and B are TP, then C is TP.
Examples: 1. Let ⎡
1 1 1 ⎢ ⎢1 2 3 P4 = ⎢ ⎣1 3 6 1 4 10
⎤
1 4⎥ ⎥ ⎥ 10⎦ 20
⎡
⎤
1 ⎢ ⎥ ⎢−2⎥ and let x = ⎢ ⎥ . ⎣−5⎦ 4
Then V − (x) = 2 and P4 x = [−2, −2, 5, 23]T , so V + (P4 x) = 1. Hence, Schoenberg’s variation diminishing property (Fact 1 of section 21.5) holds in this case. 2. Let ⎡
1 ⎢ ⎢1 H =⎢ ⎣1 1
1 1 1 1
0 1 1 1
⎤
0 0⎥ ⎥ ⎥ 1⎦ 1
⎡
⎤
1 ⎢ ⎥ −1 ⎢ ⎥ and let x = ⎢ ⎥ . ⎣−1⎦ 1
Then V − (x) = 2 and Hx = [0, −1, 0, 0]T , so V + (Hx) = 3. Hence, Schoenberg’s variation diminishing property (Fact 1 of section 21.5) does not hold in general for TN matrices.
2111
Totally Positive and Totally Nonnegative Matrices
3. If 0 < A < B and A, B ∈ Rn×n are TP, then not all matrices in the interval between A and B need be TP. Let
2 A= 1
1 , 1
4 B= 5
5 . 7
Then A, B are TP and
3 C= 4
4 5
satisfies A < C < B, and C is not TP. 4. If TP is replaced by TN, then Fact 12 no longer holds. For example, ⎡
2 ⎢ ⎣0 1
0 0 0
⎤
⎡
1 3 ⎥ ∗ ⎢ 0⎦ ≤ ⎣ 0 1 4
0 0 0
⎤
⎡
4 4 ⎥ ∗ ⎢ 0⎦ ≤ ⎣ 0 5 5
0 0 0
⎤
5 ⎥ 0⎦ ; 7
however, both end matrices are TN while the middle matrix is not. 5. A polynomial f (x) is stable if all the zeros of f (x) have negative real parts, which is equivalent to the the Routh–Hurwitz matrix (Example 4 of Section 21.1) formed from f being totally nonnegative [Asn70]. Suppose f (x) = in=0 ai x i and g (x) = im=0 bi x i are two polynomials of degree n and m, respectively. Then the Hadamard product of f and g is the polynomial ( f ◦ g )(x) = ik=0 ai bi x i , where k = min(m, n). In [GW96a], it is proved that the Hadamard product of stable polynomials is stable. Hence, the Hadamard product of two totally nonnegative Routh–Hurwitz matrices is in turn a totally nonnegative matrix ([GW96a]). See also [GW96b] for a list of other subclasses of TN matrices that are closed under Hadamard multiplication. ⎡
1 ⎢ 6. Let A = ⎣1 1
1 1 1
⎤
⎡
0 1 ⎥ ⎢ 1⎦ and let B = AT . Then A and B are TN, A ◦ B = ⎣1 1 0
1 1 1
⎤
0 ⎥ 1⎦, and 1
det(A ◦ B) = −1 < 0. Thus, A ◦ B is not TN. 7. (Polya matrix) Let q ∈ (0, 1). The n × n Polya matrix Q has its (i, j )th entry equal to q −2i j . Then Q is totally positive for all n (see [Whi52]). In fact, Q is diagonally equivalent to a TP Vandermonde matrix. Suppose Q represents the 3 × 3 Polya matrix. Then Q satisfies that Q ◦ A is TN for all A √ √ TN whenever q ∈ (0, 1/µ), where µ = 1+2 5 (the golden mean). 8. The bidiagonal factorization (21.2) from Fact 5 of section 21.2 for TN matrices was used in [Loe55] to show that for each nonsingular n × n TN matrix A there is a piecewise continuous family of matrices (t) of a special form such that the unique solution of the initial value problem d A(t) = (t)A(t), A(0) = I dt
(21.5)
has A(1) = A. Let A(t) = [ai j (t)] be a differentiable matrixvalued function of t such that A(t) is nonsingular and TN for all t ∈ [0, 1], and A(0) = I . Then
≡
d A(t) dt
(21.6) t=0
is called an infinitesimal element of the semigroup of nonsingular TN matrices. By (21.2) every nonsingular TN matrix can be obtained from the solution of the initial value problem (21.5) in which all (t) are infinitesimal elements. 9. If the main diagonal entries of a TP matrix are all ones, then it is not difficult to observe that as you move away from the diagonal there is a “drop off ” effect in the entries of this matrix. Craven and
2112
Handbook of Linear Algebra
Csordas [CC98] have worked out an enticing sufficient “drop off ” condition for a matrix to be TP. If A = [ai j ] is an n × n matrix with positive entries and satisfies ai j ai +1, j +1 ≥ c 0 ai, j +1 ai +1, j , where c 0 = 4.07959562349..., then A is TP. This condition is particularly appealing for both Hankel and Toeplitz matrices. Recall that a Hankel matrix is an (n + 1) × (n + 1) matrix of the form ⎡
a0 ⎢a ⎢ 1 ⎢. ⎢. ⎣. an
··· ···
a1 a2 .. . an+1
··· ···
⎤
an an+1 ⎥ ⎥ .. ⎥ ⎥. . ⎦ a2n
So, if the positive sequence {ai } satisfies ak−1 ak+1 ≥ c 0 ak2 , then the corresponding Hankel matrix is TP. An (n + 1) × (n + 1) Toeplitz matrix is of the form ⎡
a0 ⎢a ⎢ −1 ⎢a ⎢ −2 ⎢ . ⎢ . ⎣ . a−n
a1 a0 a−1 .. .
a2 a1 a0 .. .
a−(n−1)
a−(n−2)
··· ··· ··· ··· ···
⎤
an an−1 ⎥ ⎥ an−2 ⎥ ⎥. .. ⎥ ⎥ . ⎦ a0
Hence, if the positive sequence {ai } satisfies ak2 ≥ c 0 ak−1 ak+1 , then the corresponding Toeplitz matrix is TP. 10. A sequence a0 , a1 , . . . of real numbers is called totally positive if the twoway infinite matrix given by ⎡
a0 ⎢a ⎢ 1 ⎢ ⎢a 2 ⎣ .. .
0 a0 a1 .. .
0 0 a0 .. .
⎤
··· · · ·⎥ ⎥ ⎥ · · ·⎥ ⎦
is TP. As usual, an infinite matrix is TP all of its minors are positive. Notice that the above matrix is a Toeplitz matrix. Studying the functions that generate totally positive sequences was a difficult and important step in the area of totally positive matrices; f (x) generates the sequence a0 , a1 , . . . if f (x) = a0 + a1 x + a2 x 2 + · · · . In Aissen et al. [ASW52] (see also [Edr52]), it was shown that the above twoway infinite Toeplitz matrix is TP (i.e., the corresponding sequence is totally positive) if and only if the generating function f (x) for the sequence a0 , a1 , . . . has the form ∞
(1 + αv x) , ν=1 (1 − βv x)
f (x) = e γ x ν=1 ∞ where γ , αv , βv ≥ 0, and
αv and
βv are convergent.
References [ASW52] M. Aissen, I.J. Schoenberg, and A. Whitney. On generating functions of totally positive sequences, I. J. Analyse Math., 2:93–103, 1952. [And87] T. Ando. Totally positive matrices. Lin. Alg. Appl., 90:165–219, 1987. [Asn70] B.A. Asner. On the total nonnegativity of the Hurwitz matrix. SIAM J. Appl. Math., 18:407–414, 1970.
Totally Positive and Totally Nonnegative Matrices
2113
[BFZ96] A. Berenstein, S. Fomin, and A. Zelevinsky. Parameterizations of canonical bases and totally positive matrices. Adv. Math., 122:49–149, 1996. [Bre95] F. Brenti. Combinatorics and total positivity. J. Comb. Theory, Series A, 71:175–218, 1995. [CFJ01] A.S. Crans, S.M. Fallat, and C.R. Johnson. The Hadamard core of the totally nonnegative matrices. Lin. Alg. Appl., 328:203–222, 2001. [CC98] T. Craven and G. Csordas. A sufficient condition for strict total positivity of a matrix. Lin. Multilin. Alg., 45:19–34, 1998. [Cry73] C.W. Cryer. The LU factorization of totally positive matrices. Lin. Alg. Appl., 7:83–92, 1973. [Cry76] C.W. Cryer. Some properties of totally positive matrices. Lin. Alg. Appl., 15:1–25, 1976. [Edr52] A. Edrei. On the generating functions of totally positive sequences, II. J. Analyse Math., 2:104–109, 1952. [Fal99] S.M. Fallat. Totally Nonnegative Matrices. Ph.D. dissertation, Department of Mathematics, College of William and Mary, Williamsburg, VA, 1999. [Fal01] S.M. Fallat. Bidiagonal factorizations of totally nonnegative matrices. Am. Math. Monthly, 109:697–712, 2001. [Fal04] S.M. Fallat. A remark on oscillatory matrices. Lin. Alg. Appl., 393:139–147, 2004. [FGJ00] S.M. Fallat, M.I. Gekhtman, and C.R. Johnson. Spectral structures of irreducible totally nonnegative matrices. SIAM J. Matrix Anal. Appl., 22:627–645, 2000. [FGJ03] S.M. Fallat, M.I. Gekhtman, and C.R. Johnson. Multiplicative principalminor inequalities for totally nonnegative matrices. Adv. App. Math., 30:442–470, 2003. [FJ98] S.M. Fallat and C.R. Johnson. Olga, matrix theory and the Taussky unification problem. Lin. Alg. Appl., 280:243–247, 1998. [FJS00] S.M. Fallat, C.R. Johnson, and R.L. Smith. The general totally positive matrix completion problem with few unspecified entries. Elect. J. Lin. Alg., 7:1–20, 2000. ¨ [Fek13] M. Fekete. Uber ein problem von Laguerre. Rend. Circ. Mat. Palermo, 34:89–100, 110–120, 1913. [FZ00] S. Fomin and A. Zelevinsky. Total positivity: Tests and parameterizations. Math. Intell., 22:23–33, 2000. [Fri85] S. Friedland. Weak interlacing properties of totally positive matrices. Lin. Alg. Appl., 71:247–266, 1985. [GK60] F.R. Gantmacher and M.G. Krein. Oszillationsmatrizen, Oszillationskerne und kleine Schwingungen Mechanischer Systeme. AkademieVerlag, Berlin, 1960. [GK02] F.R. Gantmacher and M.G. Krein. Oscillation Matrices and Kernels and Small Vibrations of Mechanical Systems. AMS Chelsea Publishing, Providence, RI, revised edition, 2002. (Translation based on the 1941 Russian original, edited and with a preface by A. Eremenko.) [Gar82] J. Garloff. Majorization between the diagonal elements and the eigenvalues of an oscillating matrix. Lin. Alg. Appl., 47:181–184, 1982. [Gar96] J. Garloff. Vertex implications for totally nonnegative matrices. Total Positivity and Its Applications. Mathematics and Its Applications, Vol. 359 (M. Gasca and C.A. Micchelli, Eds.), Kluwer Academic, Dordrecht, The Netherlands, 103–107, 1996. [GW96a] J. Garloff and D.G. Wagner. Hadamard products of stable polynomials are stable. J. Math. Anal. Appl., 202:797–809, 1996. [GW96b] J. Garloff and D.G. Wagner. Preservation of total nonnegativity under Hadamard products and related topics. Total Positivity and Its Applications. Mathematics and Its Applications, Vol. 359 (M. Gasca and C.A. Micchelli, Eds.), Kluwer Academic, Dordrecht, The Netherlands, 97–102, 1996. [GM96] M. Gasca and C.A. Micchelli. Total Positivity and Its Applications. Mathematics and Its Applications, Vol. 359, Kluwer Academic, Dordrecht, The Netherlands 1996. [GP96] M. Gasca and J.M. Pe˜na. On factorizations of totally positive matrices. Total Positivity and Its Applications. Mathematics and Its Applications, Vol. 359 (M. Gasca and C.A. Micchelli, Eds.), Kluwer Academic, Dordrecht, The Netherlands 109–130, 1996. [JS00] C.R. Johnson and R.L. Smith. Line insertions in totally positive matrices. J. Approx. Theory, 105:305–312, 2000.
2114
Handbook of Linear Algebra
[Kar68] S. Karlin. Total Positivity. Vol. I, Stanford University Press, Stanford, CA, 1968. [KM59] S. Karlin and G. McGregor. Coincidence probabilities. Pacific J. Math., 9:1141–1164, 1959. [Kot53] D.M. Koteljanskii. A property of signsymmetric matrices (Russian). Mat. Nauk (N.S.), 8:163–167, 1953; English transl.: Translations of the AMS, Series 2, 27:19–24, 1963. [Lin73] B. Lindstrom. On the vector representations of induced matroids. Bull. London Math. Soc., 5:85–90, 1973. [Loe55] C. Loewner. On totally positive matrices. Math. Z., 63:338–340, 1955. [MM64] M. Marcus and H. Minc. A Survey of Matrix Theory and Matrix Inequalities. Dover Publications, New York, 1964. [Mar70a] T.L. Markham. On oscillatory matrices. Lin. Alg. Appl., 3:143–156, 1970. [Mar70b] T.L. Markham. A semigroup of totally nonnegative matrices. Lin. Alg. Appl., 3:157–164, 1970. [Pin98] A. Pinkus. An interlacing property of eigenvalues of strictly totally positive matrices. Lin. Alg. Appl., 279:201–206, 1998. [Rad68] C.E. Radke. Classes of matrices with distinct, real characteristic values. SIAM J. Appl. Math., 16:1192–1207, 1968. [RH72] J.W. Rainey and G.J. Halbetler. Tridiagonalization of completely nonnegative matrices. Math. Comp., 26:121–128, 1972. [Sch30] I.J. Schoenberg. Uber variationsvermindernde lineare transformationen. Math. Z., 32:321–328, 1930. [SS95] B.Z. Shapiro and M.Z. Shapiro. On the boundary of totally positive upper triangular matrices. Lin. Alg. Appl., 231:105–109, 1995. [Ste91] J.R. Stembridge. Immanants of totally positive matrices are nonnegative. Bull. London Math. Soc., 23:422–428, 1991. [Whi52] A. Whitney. A reduction theorem for totally positive matrices. J. Analyse Math., 2:88–92, 1952.
22 Linear Preserver Problems
ˇ Peter Semrl University of Ljubljana
22.1 Basic Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221 22.2 Standard Forms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 222 22.3 Standard Linear Preserver Problems . . . . . . . . . . . . . . . . . . 224 22.4 Additive, Multiplicative, and Nonlinear Preservers . . . . . 227 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
Linear preservers are linear maps on linear spaces of matrices that leave certain subsets, properties, relations, functions, etc., invariant. Linear preserver problems ask what is the general form of such maps. Describing the structure of such maps often gives a deeper understanding of the matrix sets, functions, or relations under the consideration. Some of the linear preserver problems are motivated by applications (system theory, quantum mechanics, etc.).
22.1
Basic Concepts
Definitions: Let V be a linear subspace of F m×n . Let f be a (scalarvalued, vectorvalued, or setvalued) function on V, M a subset of V, and ∼ a relation defined on V. A linear map φ : V → V is called a linear preserver of function f if f (φ(A)) = f (A) for every A ∈ V. A linear map φ : V → V preserves M if φ(M) ⊆ M. The map φ strongly preserves M if φ(M) = M. A linear map φ : V → V preserves the relation ∼ if φ(A) ∼ φ(B) whenever A ∼ B, A, B ∈ V. If for every pair A, B ∈ V we have φ(A) ∼ φ(B) if and only if A ∼ B, then φ strongly preserves the relation ∼.
Facts: 1. If linear maps φ : V → V and ψ : V → V both preserve M, then φψ : V → V preserves M. Consequently, the set of all linear transformations on V preserving M is a multiplicative semigroup. 2. The set of all bijective linear transformations strongly preserving M is a multiplicative group. 3. [BLL92, p. 41] Let M ⊆ V be an algebraic subset and φ : V → V a bijective linear map satisfying φ(M) ⊆ M. Then φ strongly preserves M. 221
222
Handbook of Linear Algebra
Examples: 1. Let R ∈ F m×m and S ∈ F n×n . The linear map φ : F m×n → F m×n defined by φ(A) = R AS, A ∈ F m×n , preserves the set of all matrices of rank at most one. In general, such a map does not preserve this set strongly. 2. If R and S in the previous example are invertible, then φ is a bijective linear map strongly preserving matrices of rank one. In fact, such a map φ strongly preserves matrices of rank k, k = 1, . . . , min{m, n}. 3. If m = n and R, S ∈ F n×n , then the linear map A → R AT S, A ∈ F n×n , preserves matrices of rank at most one. If both R and S are invertible, then φ strongly preserves the set of all matrices of rank k, 1 ≤ k ≤ n. 4. Assume that m = n. Let R ∈ F n×n be an invertible matrix, c a nonzero scalar, and f : F n×n → F a linear functional. Then both maps A → c R AR −1 + f (A)I , A ∈ F n×n , and A → c R AT R −1 + f (A)I , A ∈ F n×n , strongly preserve commutativity; that is, if φ : F n×n → F n×n is any of these two maps, then for every pair A, B ∈ F n×n we have φ(A)φ(B) = φ(B)φ(A) if and only if AB = B A. 5. Let · be any norm on Cm×n . A linear map φ : Cm×n → Cm×n is called an isometry if φ(A) = A, A ∈ Cm×n . Thus, isometries are linear preservers of norm functions. 6. Let 1 ≤ k < min{m, n}. A matrix A ∈ F m×n is of rank at most k if the determinant of every (k + 1) × (k + 1) submatrix of A is zero. Thus, the set of all m × n matrices of rank at most k is an algebraic subset of F m×n . 7. The set of all nilpotent n × n matrices is an algebraic subset of F n×n . More generally, given a polynomial p ∈ F [X], the set of all matrices A ∈ F n×n satisfying p(A) = 0 is an algebraic set. Hence, bijective linear maps on F n×n preserving idempotent matrices, nilpotents, involutions, etc. preserve these sets strongly.
22.2
Standard Forms
Definitions: Let V be a linear subspace of F m×n and let P be a preserving property which makes sense for linear maps acting on V (P may be the property of preserving a certain subset of V or the property of preserving a certain relation on V or the property of preserving a certain function defined on V). A linear preserver problem corresponding to the property P is the problem of characterizing all linear (bijective) maps on V satisfying this property. Very often, linear preservers have the standard forms (see the next section). Occasionally, there are interesting exceptional cases especially in low dimensions (see later examples). Let R ∈ F m×m and S ∈ F n×n be invertible matrices. A map φ : F m×n → F m×n is called an (R, S)standard map if either φ(A) = R AS, A ∈ F m×n , or m = n and φ(A) = R AT S, A ∈ F n×n . In many cases we assume that R and S satisfy some additional assumptions. Let R ∈ F n×n be an invertible matrix, c a nonzero scalar, and f : F n×n → F a linear functional. A map φ : F n×n → F n×n is called an (R, c , f )standard map if either φ(A) = c R AR −1 + f (A)I , A ∈ F n×n , or φ(A) = c R AT R −1 + f (A)I , A ∈ F n×n . When we consider linear preservers on proper subspaces V ⊂ F m×n , we usually have to modify the notion of standard maps. Let us consider the case when V = Tn ⊂ F n×n is the subalgebra of all upper triangular matrices. The flip map A → A f , A ∈ Tn , is defined as the transposition over the antidiagonal; that is, A f = G AT G , where G = E 1n + E 2,n−1 + . . . + E n1 (see Example 1). Standard maps on Tn are maps of the form A → R AS, A → R A S, f
A ∈ Tn , A ∈ Tn ,
A → c R AR −1 + f (A)I,
A ∈ Tn ,
223
Linear Preserver Problems
and A → c R A f R −1 + f (A)I,
A ∈ Tn ,
where R and S are invertible upper triangular matrices, c is a nonzero scalar, and f is a linear functional on Tn . Facts: 1. Every (R, S)standard map is bijective. It strongly preserves matrices of rank k, k = 1, . . . , min{m, n}. Every (R, c , f )standard map is either bijective, or its kernel is the onedimensional subspace consisting of all scalar matrices. 2. Let U ∈ Cm×m and V ∈ Cn×n be unitary matrices. Then a (U, V )standard map preserves singular values and, hence, all functions of singular values including unitarily invariant norms. 3. Let R ∈ Cn×n be an invertible matrix. Then an (R, R −1 )standard map on Cn×n preserves spectrum, idempotents, nilpotents, similarity, zero products, etc. 4. If U ∈ Cn×n is a unitary matrix, then a (U, U ∗ )standard map defined on Cn×n strongly preserves the set of all orthogonal idempotents, the set of all normal matrices, numerical range, etc. 5. If A, B ∈ Tn , then (AB) f = B f A f . Examples: 1. ⎡
a
⎢ ⎢0 ⎢ ⎢0 ⎣
0
⎤f
⎡
b
c
d
e
f
g⎥
0
h
⎥ ⎢ ⎢0 ⎥ =⎢ ⎥ ⎢0 i⎦ ⎣
0
0
j
2. A map φ : C2×2 → C2×2 given by
φ
j
0
a
b
c
d
g
d
h
f
c⎥
0
e
⎥ ⎥. b⎥ ⎦
0
0
a
−b d
a c
=
⎤
i
is a bijective linear map that strongly preserves commutativity but is not of a standard form. More generally, any bijective linear map φ : C2×2 → C2×2 satisfying φ(I ) = I strongly preserves commutativity [Kun99]. In higher dimensions there are no nonstandard bijective linear maps preserving commutativity [BLL92, p. 76]. 3. Let W ⊂ Cn×n be any linear subspace of matrices with the property that AB = BA for every pair A, B ∈ W. Assume that φ : Cn×n → Cn×n is a linear map whose range is contained in W. Then φ is a nonstandard map preserving commutativity. If n > 1, then it does not preserve commutativity strongly. A map φ : C2×2 → C2×2 defined by
a c
φ
b d
=
a
b
−b
a
a
b
c
is a concrete example of such map. 4. A map φ : R4×4 → R4×4 given by ⎛⎡
a
⎜⎢ ⎜ ⎢∗ ⎢ φ⎜ ⎜⎢ ⎝ ⎣∗
∗
b
c
d
⎤⎞
⎡
d
⎤
a
−d
∗ ∗
⎥⎟ ⎢ ⎢ −b ⎥⎟ = ⎢ ⎥⎟ ⎢ −c ∗ ⎦⎠ ⎣
d
a
⎥ ⎥ −b ⎥ ⎦
∗ ∗
∗
−d
−c
b
a
∗ ∗
∗ ⎥⎟
c⎥
224
Handbook of Linear Algebra
preserves the real orthogonal group, that is, φ(O) is an orthogonal matrix for every orthogonal matrix O ∈ R4×4 . Note that the righthand side of the above equation is the standard matrix representation of the quaternion a +bi +c j +dk. Similar constructions with matrix representations of complex and Cayley numbers give nonstandard linear preservers of real orthogonal group on R2×2 and R8×8 . If φ : Rn×n → Rn×n is a linear preserver of orthogonal group and n ∈ {2, 4, 8}, then φ is a (U, V )standard map with U and V being orthogonal matrices [LP01, p. 601]. 5. A linear map φ acting on 4 × 4 upper triangular matrices given by ⎡
a
⎢ ⎢0 ⎢ ⎢0 ⎣
0
⎤
b
c
d
e
f
g⎥
0 0
⎡
e
f
g
b
⎤
j
i
h
⎥ ⎢ ⎢0 ⎥ → ⎢ ⎥ ⎢0 i⎦ ⎣
0
h
⎥ ⎥ d⎥ ⎦
0
j
0
0
a
0
c⎥
is a nonstandard bijective linear map strongly preserving the set of invertible matrices. All that is important in this example is that A and φ(A) have the same diagonal entries up to a permutation.
22.3
Standard Linear Preserver Problems
Definitions: Linear preserver problems ask what is the general form of (bijective) linear maps on matrix spaces having a certain preserving property. When the general form of linear preservers under the consideration is one of the standard forms, we speak of a standard linear preserver problem. The following list of some most important standard linear preserver results is far from being complete. Many more results can be found in the survey [BLL92]. Facts: 1. [BLL92, Theorem 2.2], [LT92, Prop. 3] Let m, n be positive integers and φ : Cm×n → Cm×n a linear map. Assume that one of the following two conditions is satisfied: r Let k be a positive integer, k ≤ min{m, n}, and assume that rank φ(A) = k whenever rank A = k. r φ is invertible and rank φ(A) = rank φ(B) whenever rank A = rank B.
Then φ is an (R, S)standard map for some invertible matrices R ∈ Cm×m and S ∈ Cn×n . 2. [BLL92, p. 9] Let F be a field with more than three elements, k a positive integer, k ≤ min{m, n}, and φ : F m×n → F m×n an invertible linear map such that rank φ(A) = k whenever rank A = k. Then φ is an (R, S)standard map for some invertible matrices R ∈ F m×m and S ∈ F n×n . 3. [BLL92, Theorem 2.6] Let φ : F m×n → F p×q be a linear map such that rank φ(A) ≤ 1 whenever rank A = 1. Then either (a) φ(A) = R AS for some R ∈ F p×m and some S ∈ F n×q or (b) φ(A) = R AT S for some R ∈ F p×n and some S ∈ F m×q or (c) The range of φ is contained in the set of all matrices of rank at most one. 4. [BLL92, p. 10] Let F be an infinite field with characteristic = 2, Sn the space of all n × n symmetric matrices over F , and let k be an integer, 1 ≤ k ≤ n. If φ : Sn → Sn is an invertible linear rank k preserver, then φ(A) = c R AR T for every A ∈ S. Here, c is a nonzero scalar and R an invertible n × n matrix. 5. [BLL92, Theorem 2.9] Let F be a field with characteristic = 2. Assume that F has more than three elements. Let φ : Sn → Sm be a linear map such that rank φ(A) ≤ 1 whenever rank A = 1. Then either
Linear Preserver Problems
225
(a) There exist an m × n matrix R and a scalar c such that φ(A) = c R AR T or (b) The range of φ is contained in a linear span of some rank one m × m symmetric matrix. 6. [BLL92, Theorem 2.7, Theorem 2.8, p. 25] Let φ be a real linear map acting on the real linear space Hn of all n × n Hermitian complex matrices. Let π, ν, δ be nonnegative integers with π + ν + δ = n and denote by G (π, ν, δ) the set of all A ∈ Hn with inertia in(A) = (π, ν, δ). Assume that one of the following is satisfied: r n ≥ 3, k < n, φ is invertible, and rank φ(A) ≤ k whenever rank A = k. r n ≥ 2, the range of φ is not onedimensional, and rank φ(A) = 1 whenever rank A = 1. r The triple (π, ν, δ) does not belong to the set {(n, 0, 0), (0, n, 0), (0, 0, n)}, φ is bijective, and
φ(G (π, ν, δ)) ⊆ G (π, ν, δ).
Then there exist an invertible n × n complex matrix R and a constant c ∈ {−1, 1} such that either (a) φ(A) = c R AR ∗ for every A ∈ Hn or (b) φ(A) = c R AT R ∗ for every A ∈ Hn . Of course, if the third of the above conditions is satisfied, then the possibility c = −1 can occur only when π = ν. 7. [BLL92, p. 76] Let n ≥ 3 and let φ : F n×n → F n×n be an invertible linear map such that φ(A)φ(B) = φ(B)φ(A) whenever A and B commute. Then φ is an (R, c , f )standard map for some invertible R ∈ F n×n , some nonzero scalar c , and some linear functional f : F n×n → F . 8. [LP01, Theorem 2.3] Let φ : Cn×n → Cn×n be a linear similarity preserving map. Then either (a) φ is an (R, c , f )standard map or (b) φ(A) = (tr A)B, A ∈ Cn×n . Here, B, R ∈ Cn×n and R is invertible, c is a nonzero complex number, and f : Cn×n → C is a functional of the form f (A) = btr A, A ∈ Cn×n , for some b ∈ C. 9. [BLL92, p. 77] Let φ be a reallinear unitary similarity preserving map on Hn . Then either (a) φ(A) = (tr A)B, A ∈ Hn or (b) φ(A) = cU AU ∗ + b(tr A)I , A ∈ Hn or (c) φ(A) = cU AT U ∗ + b(tr A)I , A ∈ Hn . Here, B is a Hermitian matrix, U is a unitary matrix, and b, c are real constants. 10. [BLL92, Theorem 4.7.6] Let n > 2 and let F be an algebraically closed field of characteristic zero. Let p be a polynomial of degree n with at least two distinct roots. Let us write p as p(x) = x k q (x) with k ≥ 0 and q (0) = 0. Assume that φ : F n×n → F n×n is an invertible linear map preserving the set of all matrices annihilated by p. Then either (a) φ(A) = c R AR −1 , A ∈ F n×n or (b) φ(A) = c R AT R −1 , A ∈ F n×n . Here, R is an invertible matrix and c is a constant permuting the roots of q ; that is, q (c λ) = 0 for each λ ∈ F satisfying q (λ) = 0. 11. [BLL92, p. 48] Let s l n ⊂ F n×n be the linear space of all trace zero matrices and φ : s l n → s l n an invertible linear map preserving the set of all nilpotent matrices. Then there exist an invertible matrix R ∈ F n×n and a nonzero scalar c such that either (a) φ(A) = c R AR −1 , A ∈ s l n or (b) φ(A) = c R AT R −1 , A ∈ s l n . When considering linear preservers of nilpotent matrices one should observe first that the linear span of all nilpotent matrices is s l n and, therefore, it is natural to confine maps under consideration to this subspace of codimension one.
226
Handbook of Linear Algebra
12. [GLS00, pp. 76, 78] Let F be an algebraically closed field of characteristic 0, m, n positive integers, and φ : F n×n → F m×m a linear transformation. If φ is nonzero and maps idempotent matrices to idempotent matrices, then m ≥ n and there exist an invertible matrix R ∈ F m×m and nonnegative integers k1 , k2 such that 1 ≤ k1 + k2 , (k1 + k2 )n ≤ m and φ(A) = R(A ⊕ . . . ⊕ A ⊕ AT ⊕ . . . ⊕ AT ⊕ 0)R −1 for every A ∈ F n×n . In the above block diagonal direct sum the matrix A appears k1 times, AT appears k2 times, and 0 is the zero matrix of the appropriate size (possibly absent). If p ∈ F [X] is a polynomial of degree > 1 with simple zeros (each zero has multiplicity one), φ is unital and maps every A ∈ F n×n satisfying p(A) = 0 into some m × m matrix annihilated by p, then φ is of the above described form with (k1 + k2 )n = m. 13. [BLL92, Theorem 4.6.2] Let φ : Cn×n → Cn×n be a linear map preserving the unitary group. Then φ is a (U, V )standard map for some unitary matrices U, V ∈ Cn×n . 14. [KH92] Let φ : Cn×n → Cn×n be a linear map preserving normal matrices. Then either (a) φ(A) = cU AU ∗ + f (A)I , A ∈ Cn×n or (b) φ(A) = cU At U ∗ + f (A)I , A ∈ Cn×n or (c) the range of φ is contained in the set of normal matrices. Here, U is a unitary matrix, c is a nonzero scalar, and f is a linear functional on Cn×n . 15. [LP01, p. 595] Let · be a√unitarily invariant norm on Cm×n that is not a multiple of the Frobenius norm defined by A = tr (AA∗ ). The group of linear preservers of · on Cm×n is the group of all (U, V )standard maps, where U ∈ Cm×m and V ∈ Cn×n are unitary matrices. Of course, if · is a mulitple of the Frobenious norm, then the group of linear preservers of · on Cm×n is the group of all unitary operators, i.e., those linear operators φ : Cm×n → Cm×n that preserve the usual inner product A, B = tr (AB ∗ ) on Cm×n . 16. [BLL92, p. 63–64] Let φ : Cn×n → Cn×n be a linear map preserving the numerical radius. Then either (a) φ(A) = cU AU ∗ , A ∈ Cn×n or (b) φ(A) = cU AT U ∗ , A ∈ Cn×n . Here, U is a unitary matrix and c a complex constant with c  = 1. 17. [BLL92, Theorem 4.3.1] Let n > 2 and let φ : F n×n → F n×n be a linear map preserving the permanent. Then φ is an (R, S)standard map, where R and S are each a product of a diagonal and a permutation matrix, and the product of the two diagonal matrices has determinant one. 18. [CL98] Let φ : Tn → Tn be a linear rank one preserver. Then either (a) The range of φ is the space of all matrices of the form ⎡
∗
⎢ ⎢0 ⎢ ⎢. ⎢. ⎣.
0
⎤
∗
...
∗
0 .. .
...
0⎥ ⎥ .. ⎥ ⎥ .⎦
0
...
..
⎥
.
0
or (b) The range of φ is the space of all matrices of the form ⎡
0
⎢ ⎢0 ⎢ ⎢. ⎢. ⎣.
0 or
⎤
0
...
0
∗
0 .. .
... .
0 .. .
∗⎥ ⎥ .. ⎥ ⎥ .⎦
0
...
0
∗
..
⎥
227
Linear Preserver Problems
(c) φ(A) = R AS for some invertible R, S ∈ Tn or (d) φ(A) = R A f S for some invertible R, S ∈ Tn . Examples: 1. Let n ≥ 2. Then the linear map φ : Tn → Tn defined by ⎛⎡
a12
...
a1n
0 .. .
a22 .. .
...
a2n ⎥⎟ ⎥⎟ ⎟ .. ⎥ ⎥⎟ . ⎦⎠
0
0
...
⎜⎢ ⎜⎢ ⎜⎢ φ ⎜⎢ ⎜⎢ ⎝⎣ ⎡
⎤⎞
a11
..
.
⎥⎟
ann
a11 + a22 + . . . + ann
a12 + a23 + . . . + an−1,n
...
a1n
0 .. .
0 .. .
... .
0 .. .
0
0
...
0
⎢ ⎢ ⎢ =⎢ ⎢ ⎣
..
⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦
is an example of a singular preserver of rank one. 2. The most important example of a nonstandard linear preserver problem is the problem of characterizing linear maps on n × n real or complex matrices preserving the set of positive semidefinite matrices. Let R1 , . . . , Rr , S1 , . . . , Sk be n × n matrices. Then the linear map φ given by φ(A) = R1 AR1∗ + · · · + Rr ARr∗ + S1 AT S1∗ + · · · + Sk AT Sk∗ is a linear preserver of positive semidefinite matrices. Such a map is called decomposable. In general it cannot be reduced to a single congruence or a single congruence composed with the transposition. Moreover, there exist linear maps on the space of n × n matrices preserving positive semidefinite matrices that are not decomposable. There is no general structural result for such maps.
22.4
Additive, Multiplicative, and Nonlinear Preservers
Definitions: A map φ : F m×n → F m×n is additive if φ(A + B) = φ(A) + φ(B), A, B ∈ F m×n . An additive map φ : F m×n → F m×n having a certain preserving property is called an additive preserver. A map φ : F n×n → F n×n is multiplicative if φ(AB) = φ(A)φ(B), A, B ∈ F n×n . A multiplicative map φ : F n×n → F n×n having a certain preserving property is called a multiplicative preserver. Two matrices A, B ∈ F m×n are said to be adjacent if rank (A − B) = 1. A map φ : F n×n → F n×n is called a local similarity if for every A ∈ F n×n there exists an invertible R A ∈ F n×n such that φ(A) = R A AR −1 A . Let f : F → F be an automorphism of the field F . A map φ : F n×n → F n×n defined by φ([ai j ]) = [ f (ai j )] is called a ring automorphism of F n×n induced by f . Facts: 1. [BS00] Let n ≥ 2 and assume that φ : F n×n → F n×n is a surjective additive map preserving rank one matrices. Then there exist a pair of invertible matrices R, S ∈ F n×n and an automorphism f of the field F such that φ is a composition of an (R, S)standard map and a ring automorphism of F n×n induced by f . 2. [GLR03] Let S L (n, C) denote the group of all n × n complex matrices A such that det A = 1. A multiplicative map φ : S L (n, C) → Cn×n satisfies ρ(φ(A)) = ρ(A) for every A ∈ S L (n, C) if and only if there exists S ∈ S L (n, C) such that either
228
Handbook of Linear Algebra
(a) φ(A) = S AS −1 , A ∈ S L (n, C) or (b) φ(A) = S AS −1 , A ∈ S L (n, C). Here, A denotes the matrix obtained from A by applying the complex conjugation entrywise. 3. [PS98] Let n ≥ 3 and let φ : Cn×n → Cn×n be a continuous mapping. Then φ preserves spectrum, commutativity, and rank one matrices (no linearity, additivity, or multiplicativity is assumed) if and only if there exists an invertible matrix R ∈ Cn×n such that φ is an (R, R −1 )standard map. 4. [BR00] Let φ : Cn×n → Cn×n be a spectrum preserving C 1 diffeomorphism (again, we do not assume that φ is additive or multiplicative). Then φ is a local similarity. 5. [HHW04] Let n ≥ 2. Then φ : Hn → Hn is a bijective map such that φ(A) and φ(B) are adjacent for every adjacent pair A, B ∈ Hn if and only if there exist a nonzero real number c , an invertible R ∈ Cn×n , and S ∈ Hn such that either (a) φ(A) = c R AR ∗ + S, A ∈ Hn or (b) φ(A) = c R AR ∗ + S, A ∈ Hn . 6. [Mol01] Let n ≥ 2 be an integer and φ : Hn → Hn a bijective map such that φ(A) ≤ φ(B) if and only if A ≤ B, A, B ∈ Hn (here, A ≤ B if and only if B − A is a positive semidefinite matrix). Then there exist an invertible R ∈ Cn×n and S ∈ Hn such that either (a) φ(A) = R AR ∗ + S, A ∈ Hn or (b) φ(A) = R AR ∗ + S, A ∈ Hn . This result has an infinitedimensional analog important in quantum mechanics. In the language of quantum mechanics, the relation A ≤ B means that the expected value of the bounded observable A in any state is less than or equal to the expected value of B in the same state. Examples: 1. We define a mapping φ : Cn×n → Cn×n in the following way. For a diagonal matrix A with distinct diagonal entries, we define φ(A) to be the diagonal matrix obtained from A by interchanging the first two diagonal elements. Otherwise, let φ(A) be equal to A. Clearly, φ is a bijective mapping preserving spectrum, rank, and commutativity in both directions. This shows that the continuity assumption is indispensable in Fact 3 above. 2. Let φ : Cn×n → Cn×n be a map defined by φ(0) = E 12 , φ(E 12 ) = 0, and φ(A) = A for all A ∈ Cn×n \ {0, E 12 }. Then φ is a bijective spectrum preserving map that is not a local similarity. More generally, we can decompose Cn×n into the disjoint union of the classes of matrices having the same spectrum and then any bijection leaving each of this classes invariant preserves spectrum. Thus, the assumption on differentiability is essential in Fact 4 above.
References [BR00] L. Baribeau and T. Ransford. Nonlinear spectrumpreserving maps. Bull. London Math. Soc., 32:8–14, 2000. [BLL92] L. Beasley, C.K. Li, M.H. Lim, R. Loewy, B. McDonald, S. Pierce (Ed.), and N.K. Tsing. A survey of linear preserver problems. Lin. Multlin. Alg., 33:1–129, 1992. [BS00] J. Bell and A.R. Sourour. Additive rankone preserving mappings on triangular matrix algebras. Lin. Alg. Appl., 312:13–33, 2000. [CL98] W.L. Chooi and M.H. Lim. Linear preservers on triangular matrices. Lin. Alg. Appl., 269:241–255, 1998. [GLR03] R.M. Guralnick, C.K. Li, and L. Rodman. Multiplicative maps on invertible matrices that preserve matricial properties. Electron. J. Lin. Alg., 10:291–319, 2003. ˇ [GLS00] A. Guterman, C.K. Li, and P. Semrl. Some general techniques on linear preserver problems. Lin. Alg. Appl., 315:61–81, 2000.
Linear Preserver Problems
229
[HHW04] W.L. Huang, R. H¨ofer, and Z.X. Wan. Adjacency preserving mappings of symmetric and hermitian matrices. Aequationes Math., 67:132–139, 2004. [Kun99] C.M. Kunicki. Commutativity and normal preserving linear transformations on M2 . Lin. Multilin. Alg., 45:341–347, 1999. [KH92] C.M. Kunicki and R.D. Hill. Normalpreserving linear transformations. Lin. Alg. Appl., 170:107– 115, 1992. [LP01] C.K. Li and S. Pierce. Linear preserver problems. Amer. Math. Monthly, 108:591–605, 2001. [LT92] C.K. Li and N.K. Tsing. Linear preserver problems: a brief introduction and some special techniques. Lin. Alg. Appl., 162–164:217–235, 1992. [Mol01] L. Moln´ar. Orderautomorphisms of the set of bounded observables. J. Math. Phys., 42:5904–5909, 2001. ˇ [PS98] T. Petek and P. Semrl. Characterization of Jordan homomorphisms on Mn using preserving properties. Lin. Alg. Appl., 269:33–46, 1998.
23 Matrices over Integral Domains
Shmuel Friedland University of Illinois at Chicago
23.1 Certain Integral Domains . . . . . . . . . . . . . . . . . . . . . . . . . . 23.2 Equivalence of Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23.3 Linear Equations over Bezout Domains . . . . . . . . . . . . . 23.4 Strict Equivalence of Pencils . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
231 234 238 239 2310
In this chapter, we present some results on matrices over integral domains, which extend the wellknown results for matrices over the fields discussed in Chapter 1 of this book. The general theory of linear algebra over commutative rings is extensively studied in the book [McD84]. It is mostly intended for readers with a thorough training in ring theory. The aim of this chapter is to give a brief survey of notions and facts about matrices over classical domains that come up in applications. Namely over the ring of integers, the ring of polynomials over the field, the ring of analytic functions in one variable on an open connected set, and germs of analytic functions in one variable at the origin. The last section of this chapter is devoted to the notion of strict equivalence of pencils. Most of the results in this chapter are well known to the experts. A few new results are taken from the book in progress [Frixx], which are mostly contained in the preprint [Fri81].
23.1
Certain Integral Domains
Definitions: A commutative ring without zero divisors and containing identity 1 is an integral domain and denoted by D. The quotient field F of a given integral domain D is formed by the set of equivalence classes of all quotients ab , b = 0, where ab ≡ dc if and only if ad = bc , such that c ad + bc a + = , b d bd
ac ac = , bd bd
b, d = 0.
For x = [x1 , . . . , xn ]T ∈ Dn , α = [α1 , . . . , αn ]T ∈ Zn+ we define xα = x1α1 · · · xnαn and α = in=1 αi . D[x] = D[x1 , . . . , xn ] is the ring of all polynomials p(x) = p(x1 , . . . , xn ) in n variables with coefficients in D : p(x) =
aα x α .
α≤m
231
232
Handbook of Linear Algebra
The total degree, or simply the degree of p(x) = 0, denoted by deg p, is the maximum m ∈ Z+ such that there exists aα = 0 such that α = m. (deg 0 = −∞.) A polynomial p is homogeneous if aα = 0 for all α < deg p. A polynomial p(x) = in=0 ai x i ∈ D[x] is monic if an = 1. F (x) denotes the quotient field of F [x], and is the field of rational functions over F in n variables. Let ⊂ Cn be a nonempty pathconnected set. Then H() denotes the ring of analytic functions f (z), such that for each ζ ∈ there exists an open neighborhood O(ζ, f ) of ζ such that f is analytic on O( f, ζ ). The addition and the product of functions are given by the standard identities: ( f + g )(ζ ) = f (ζ ) + g (ζ ), ( f g )(ζ ) = f (ζ )g (ζ ). If is an open set, we assume that f is defined only on . If consists of one point ζ , then Hζ stands for H({ζ }). Denote by M(), Mζ the quotient fields of H(), Hζ respectively. For a, d ∈ D, d divides a (or d is a divisor of a), denoted by da, if a = db for some b ∈ D. a ∈ D is unit if a1. a, b ∈ D are associates, denoted by a ≡ b, if ab and ba. Denote {{a}} = {b ∈ D : b ≡ a}. The associates of a ∈ D and the units are called improper divisors of a. a ∈ D is irreducible if it is not a unit and every divisor of a is improper. A nonzero, nonunit element p ∈ D is prime if for any a, b ∈ D, pab implies pa or pb. Let a1 , . . . , an ∈ D. Assume first that not all of a1 , . . . , an are equal to zero. An element d ∈ D is a greatest common divisor (g.c.d) of a1 , . . . , an if dai for i = 1, . . . , n, and for any d such that d ai , i = 1, . . . , n, d d. Denote by (a1 , . . . , an ) any g.c.d. of a1 , . . . , an . Then {{(a1 , . . . , an )}} is the equivalence class of all g.c.d. of a1 , . . . , an . For a1 = . . . = an = 0, we define 0 to be the g.c.d. of a1 , . . . , an , i.e. (a1 , . . . , an ) = 0. a1 , . . . , an ∈ D are coprime if {{(a1 , . . . , an )}} = {{1}}. I ⊆ D is an ideal if for any a, b ∈ I and p, q ∈ D the element pa + q b belongs to I . An ideal I = D is prime if ab ∈ I implies that either a or b is in I . An ideal I = D is maximal if the only ideals that contain I are I and D. An ideal I is finitely generated if there exists k elements (generators) p1 , . . . , pk ∈ I such that any i ∈ I is of the form i = a1 p1 + · · · + ak pk for some a1 , . . . , ak ∈ D. An ideal is principal ideal if it is generated by one element p. D is a greatest common divisor domain (GCDD), denoted by Dg , if any two elements in D have a g.c.d. D is a unique factorization domain (UFD), denoted by Du , if any nonzero, nonunit element a can be factored as a product of irreducible elements a = p1 · · · pr , and this factorization is unique within order and unit factors. D is a principal ideal domain (PID), denoted D p , if any ideal of D is principal. D is a Euclidean domain (ED), denoted De , if there exists a function d : D\{0} → Z+ such that: for all a, b ∈ D, ab = 0,
d(a) ≤ d(ab);
for any a, b ∈ D, ab = 0, there exists t, r ∈ D such that a = tb + r, where either r = 0 or d(r ) < d(b). It is convenient to define d(0) = ∞. Let a1 , a2 ∈ De and assume that ∞ > d(a1 ) ≥ d(a2 ). Euclid’s algorithm consists of a sequence a1 , . . . , ak+1 , where (a1 . . . ak ) = 0, which is defined recursively as follows: ai = ti ai +1 + ai +2 ,
ai +2 = 0 or d(ai +2 ) < d(ai +1 ) for i = 1, . . . k − 1.
[Hel43], [Kap49] A GCDD D is an elementary divisor domain (EDD), denoted by Ded , if for any three elements a, b, c ∈ D there exists p, q , x, y ∈ D such that (a, b, c ) = ( px)a + ( py)b + (q y)c . A GCDD D is a Bezout domain (BD), denoted by Db , if for any two elements a, b ∈ D (a, b) = pa + q b, for some p, q ∈ D. p(x) = im=0 ai x m−i ∈ Z[x], a0 = 0, m ≥ 1 is primitive if 1 is a g.c.d. of a0 , . . . , am . For m ∈ N, the set of integers modulo m is denoted by Zm .
Matrices over Integral Domains
233
Facts: Most of the facts about domains can be found in [ZS58] and [DF04]. More special results and references on the elementary divisor domains and rings are in [McD84]. The standard results on the domains of analytic functions can be found in [GR65]. More special results on analytic functions in one complex variable are in [Rud74]. 1. Any integral domain satisfies cancellation laws: if ab = ac or ba = c a and a = 0, then b = c . 2. An integral domain such that any nonzero element is unit is a field F , and any field is an integral domain in which any nonzero element is unit. 3. A finite integral domain is a field. 4. D[x] is an integral domain. 5. H() is an integral domain. 6. Any prime element in D is irreducible. 7. In a UFD, any irreducible element is prime. This is not true in all integral domains. 8. Let D be a UFD. Then D[x] is a UFD. Hence, D[x] is a UFD. 9. Let a1 , a2 ∈ De and assume that ∞ > d(a1 ) ≥ d(a2 ). Then Euclid’s algorithm terminates in a finite number of steps, i.e., there exists k ≥ 3 such that a1 = 0, . . . , ak = 0 and ak+1 = 0. Hence, ak = (a1 , a2 ). 10. An ED is a PID. 11. A PID is an EDD. 12. A PID is a UFD. 13. An EDD is a BD. 14. A BD is a GCDD. 15. A UFD is a GCDD. 16. The converses of Facts 10, 11, 12, 14, 15 are false (see Facts 28, 27, 21, 22). 17. [DF04, Chap. 8] An integral domain that is both a BD and a UFD is a PID. 18. An integral domain is a Bezout domain if and only if any finitely generated ideal is principal. 19. Z is an ED with d(a) = a. 20. Let p, q ∈ Z[x] be primitive polynomials. Then pq is primitive. 21. F [x] is an ED with d( p) = the degree of a nonzero polynomial. Hence, F [x1 , . . . , xn ] is a UFD. But F [x1 , . . . , xn ] is not a PID for n ≥ 2. 22. Z[x1 , . . . , xm ], F [x1 , . . . , xn ], and H() (for a connected set ⊂ Cn ) are GCDDs, but for m ≥ 1 and n ≥ 2 these domains are not B Ds. 23. [Frixx] (See Example 17 below.) Let ⊂ C be an open connected set. Then for a, b ∈ H() there exists p ∈ H() such that (a, b) = pa + b. 24. Hζ , ζ ∈ C, is a UFD. 25. If ⊂ Cn is a connected open set, then H() is not a UFD. (For n = 1 there is no prime factorization of an analytic function f ∈ H() with an infinite countable number of zeros.) 26. Let ⊂ C be a compact connected set. Then H() is an ED. Here, d(a) is the number of zeros of a nonzero function a ∈ H() counted with their multiplicities. 27. [Frixx] If ⊂ C is an open connected set, then H() is an EDD. (See Example 17.) As H() is not a UFD, it follows that H() is not a PID. (Contrary to [McD84, Exc. II.E.10 (b), p. 144].) √ 28. [DF04, Chap. 8] Z[(1 + −19)/2] is a PID that is not an ED. Examples: 1. {1, −1} is the set of units in Z. A g.c.d. of a1 , . . . , ak ∈ Z is uniquely normalized by the condition (a1 , . . . , ak ) ≥ 0. 2. A positive integer p ∈ Z is irreducible if and only if p is prime. 3. Zm is an integral domain and, hence, a field with m elements if and only if p is a prime. 4. Z ⊃ I is a prime ideal if and only if all elements of I are divisible by some prime p.
234
Handbook of Linear Algebra
5. {1, −1} is the set of units in Z[x]. A g.c.d. of p1 , . . . , pk ∈ Z[x], is uniquely normalized by the condition ( p1 , . . . , pk ) = im=0 ai x m−i and a0 > 0. 6. Any prime element in p(x) ∈ Z[x], deg p ≥ 1, is a primitive polynomial. 7. Let p(x) = 2x+3, q (x) = 5x−3 ∈ Z[x]. Clearly p, q are primitive polynomials and ( p(x), q (x)) = 1. However, 1 cannot be expressed as 1 = a(x) p(x) + b(x)q (x), where a(x), b(x) ∈ Z[x]. Indeed, if this was possible, then 1 = a(0) p(0) + b(0)q (0) = 3(a(0) − b(0)), which is impossible for a(0), b(0) ∈ Z. Hence, Z[x] is not BD. 8. The field of quotients of Z is the field of rational numbers Q. 9. Let p(x), q (x) ∈ Z[x] be two nonzero polynomials. Let ( p(x), q (x)) be the g.c.d of p, q in Z[x]. Use the fact that p(x), q (x) ∈ Q[x] to deduce that there exists a positive integer m and a(x), b(x) ∈ Z[x] such that a(x) p(x) + b(x)q (x) = m( p(x), q (x)). Furthermore, if c (x) p(x) + d(x)q (x) = l ( p(x), q (x)) for some c (x), d(x) ∈ Z[x] and 0 = l ∈ Z, then ml . 10. The set of real numbers R and the set of complex numbers C are fields. 11. A g.c.d. of a1 , . . . , ak ∈ F [x] is uniquely normalized by the condition ( p1 , . . . , pk ) is a monic polynomial. 12. A linear polynomial in D[x] is irreducible. 13. Let ⊂ C be a connected set. Then each irreducible element of H() is an associate of z − ζ for some ζ ∈ . 14. For ζ ∈ C Hζ , every irreducible element is of the form a(z − ζ ) for some 0 = a ∈ C. A g.c.d. of a1 , . . . , ak ∈ Hζ is uniquely normalized by the condition (a1 , . . . , ak ) = (z − ζ )m for some nonnegative integer m. 15. In H(), the set of functions which vanishes on a prescribed set U ⊆ , i.e., I (U ) := { f ∈ H() : f (ζ ) = 0, ζ ∈ U }, is an ideal. 16. Let be an open connected set in C. [Rud74, Theorems 15.11, 15.13] implies the following: r I (U ) = {0} if and only if U is a countable set, with no accumulations points in . r Let U be a countable subset of with no accumulation points in . Assume that for each ζ ∈ U one is given a nonnegative integer m(ζ ) and m(ζ ) + 1 complex numbers w 0,ζ , . . . , w m(ζ ),ζ . Then there exists f ∈ H() such that f (n) (ζ ) = n!w n,ζ , n = 0, . . . , m(ζ ), for all ζ ∈ U . Furthermore, if all w n,ζ = 0, then there exists g ∈ H() such that all zeros of g are in U and g has a zero of order m(ζ ) + 1 at each ζ ∈ U . r Let a, b ∈ H(), ab = 0. Then there exists f ∈ H() such that a = c f, b = d f , where c , d ∈ H() and c , d do not have a common zero in . r Let c , d ∈ H() and assume that c , d do not have a common zero in . Let U be the zero set of c in , and denote by m(ζ ) ≥ 1 the multiplicity of the zero ζ ∈ U of c . Then there exists g ∈ H() g such that (e g )(n) (ζ ) = d (n) (ζ ) for n = 0, . . . , m(ζ ), for all ζ ∈ U . Hence, p = e c−d ∈ H() and e g = pc + d is a unit in H(). r For a, b ∈ H() there exists p ∈ H() such (a, b) = pa + b. r For a, b, c ∈ H() one has (a, b, c ) = p(a, b) + c = p(xa + b) + c . Hence, H() is EDD. 17. Let I ⊂ C[x, y] be the ideal given by given by the condition p(0, 0) = 0. Then I is generated by x and y, and (x, y) = 1. I is not principal and C[x, y] is not BD. 18. D[x, √ y] is not BD. √ and 6 have no greatest common 19. Z[ −5] is an integral domain that is not a GCDD, since √ 2 + 2 −5 divisor. This can be seen by using the norm N(a + b −5) = a 2 + 5b 2 .
23.2
Equivalence of Matrices
In this section, we introduce matrices over an integral domain. Since any domain D can be viewed as a subset of its quotient field F , the notion of determinant, minor, rank, and adjugate in Chapters 1, 2, and 4 can be applied to these matrices. It is an interesting problem to determine whether one given matrix can
235
Matrices over Integral Domains
be transformed to another by left multiplication, right multiplication, or multiplication on both sides, using only matrices invertible with the domain. These are equivalence relations and the problem is to characterize left (row) equivalence classes, right (columns) equivalence classes, and equivalence classes in Dm×n . For BD, the left equivalence classes are characterized by their Hermite normal form, which are attributed to Hermite. For EDD, the equivalence classes are characterized by their Smith normal form. Definitions: i =m, j =n
For a set S, denote by S m×n the set of all m × n matrices A = [ai j ]i = j =1 , where each ai j ∈ S. For positive integers p ≤ q , denote by Q p,q the set of all subsets {i 1 , . . . , i p } ⊂ {1, 2, . . . q } of cardinality p, where we assume that 1 ≤ i 1 < . . . < i p ≤ q . U ∈ Dn×n is Dinvertible (unimodular), if there exists V ∈ Dn×n such that U V = VU = In . GL(n, D) denotes the group of Dinvertible matrices in Dn×n . Let A, B ∈ Dm×n . Then A and B are column equivalent, row equivalent, and equivalent if the following conditions hold respectively: B = AP
for some P ∈ GL(n, D) (A ∼c B),
B = Q A for some Q ∈ GL(m, D) B = Q AP
(A ∼r B),
for some P ∈ GL(n, D), Q ∈ GL(m, D) (A ∼ B).
, let For A ∈ Dm×n g µ(α, A) = g.c.d. {det A[α, θ], θ ∈ Q k,n },
α ∈ Q k,m ,
ν(β, A) = g.c.d. {det A[φ, β], φ ∈ Q k,m },
β ∈ Q k,n ,
δk (A) = g.c.d. {det A[φ, θ], φ ∈ Q k,m , θ ∈ Q k,n }. δk (A) is the kth determinant invariant of A. , For A ∈ Dm×n g i j (A) =
δ j (A) , δ j −1 (A)
j = 1, . . . , rank A,
(δ0 (A) = 1),
i j (A) = 0 for rank A < j ≤ min(m, n), are called the invariant factors of A. i j (A) is a trivial factor if i j (A) is unit in Dg . We adopt the normalization i j (A) = 1 for any trivial factor of A. For D = Z, Z[x], F [x], we adopt the normalizations given in the previous section in the Examples 1, 6, and 12, respectively. Assume that D[x] is a GCDD. Then the invariant factors of A ∈ D[x]m×n are also called invariant polynomials. D = [di j ] ∈ Dm×n is a diagonal matrix if di j = 0 for all i = j . The entries d11 , . . . , d , = min(m, n), are called the diagonal entries of D. D is denoted as D = diag (d11 , . . . , d ) ∈ Dm×n . Denote by n ⊂ GL(n, D) the group of n × n permutation matrices. V 0 An Dinvertible matrix U ∈ GL(n, D) is simple if there exists P , Q ∈ n such that U = P Q, 0 In−2
α where V = γ
β ∈ GL(2, D), i.e., αδ − βγ is Dinvertible. δ
α 0 ∈ GL(2, D), i.e., α, δ are invertible. U is elementary if U is of the above form and V = γ δ For A ∈ Dm×n , the following row (column) operations are elementary row operations: (a) Interchange any two rows (columns) of A. (b) Multiply row (column) i by an invertible element a. (c) Add to row (column) j b times row (column) i (i = j ).
236
Handbook of Linear Algebra
For A ∈ Dm×n , the following row (column) operations are simple row operations: (d) Replace row (column) i by a times row (column) i plus b times row (column) j , and row (column) j by c times row (column) i plus d times row (column) j , where i = j and ad − bc is invertible in D. B = [bi j ] ∈ Dm×n is in Hermite normal form if the following conditions hold. Let r = rank B. First, the i th row of B is a nonzero row if and only if i ≤ r . Second, let bi ni be the first nonzero entry in the i th row for i = 1, . . . , r . Then 1 ≤ n1 < n2 < · · · < nr ≤ n. is in Smith normal form if B is a diagonal matrix B = diag (b1 , . . . , br , 0, . . . , 0), bi = 0, B ∈ Dm×n g for i = 1, . . . , r and bi −1 bi for i = 2, . . . , r . Facts: Most of the results of this section can be found in [McD84]. Some special results of this section are given in [Fri81] and [Frixx]. For information about equivalence over fields, see Chapter 1 and Chapter 2.
1. The cardinality of Q p,q is qp . 2. If U is Dinvertible then det U is a unit in D. Conversely, if det U is a unit then U is Dinvertible, and its inverse U −1 is given by U −1 = (det U )−1 adj U . 3. For A ∈ Dm×n , the rank of A is the maximal size of the nonvanishing minor. (The rank of zero matrix is 0.) 4. Column equivalence, row equivalence, and equivalence of matrices are equivalence relations in Dm×n . 5. For any A, B ∈ Dm×n , one has A ∼r B ⇐⇒ AT ∼c B T . Hence, it is enough to consider the row equivalence relation. , the Cauchy–Binet formula (Chapter 4) yields 6. For A, B ∈ Dm×n g
7. 8. 9. 10.
µ(α, A) ≡ µ(α, B)
for all α ∈ Q k,m
ν(β, A) ≡ ν(β, B)
for all β ∈ Qk,n
if A ∼c B, if A ∼r B,
δk (A) ≡ δk (B) if A ∼ B, for k = 1, . . . , min(m, n). Any elementary matrix is a simple matrix, but not conversely. The elementary row and column operations can be carried out by multiplications by A by suitable elementary matrices from the left and the right, respectively. The simple row and column operations are carried out by multiplications by A by suitable simple matrices U from the left and right, respectively. , rank A = r . Then A is row equivalent to B = [bi j ] ∈ Dm×n , Let Db be a Bezout domain, A ∈ Dm×n b b in a Hermite normal form, which satisfies the following conditions. Let bi ni be the first nonzero entry in the i th row for i = 1, . . . , r . Then 1 ≤ n1 < n2 < · · · < nr ≤ n are uniquely determined and the elements bi ni , i = 1, . . . , r are uniquely determined, up to units, by the conditions ν((n1 , . . . , ni ), A) = b1n1 · · · bi ni , ν(α, A) = 0, α ∈ Q i,ni −1 ,
i = 1, . . . , r,
i = 1, . . . , r.
The elements b j ni , j = 1, . . . , i − 1 are then successively uniquely determined up to the addition of arbitrary multiples of bi ni . The remaining elements bi k are now uniquely determined. The Dinvertible matrix Q, such that B = Q A, can be given by a finite product of simple matrices. If bi ni in the Hermite normal form is invertible, we assume the normalization conditions bi ni = 1 and b j ni = 0 for i < j . 11. For Euclidean domains, we assume normalization conditions either b j ni = 0 or d(b j ni ) < d(bi ni ) , in a Hermite normal form B = Q A, Q ∈ GLm (De ) Q is a for j < i . Then for any A ∈ Dm×n e product of a finite elementary matrices.
237
Matrices over Integral Domains
12. U ∈ GL(n, De ) is a finite product of elementary Dinvertible matrices. 13. For Z, we assume the normalization bi ni ≥ 1 and 0 ≤ b j ni < bi ni for j < i . For F [x], we assume that bi ni is a monic polynomial and deg b j ni < deg bi ni for j < i . Then for De = Z, F [x], any has a unique Hermite normal form. A ∈ Dm×n e 14. A, B ∈ Db are row equivalent if and only if A and B are row equivalent to the same Hermite normal form. 15. A ∈ F m×n can be brought to its unique Hermite normal form, called the reduced row echelon form (RREF), bi ni = 1,
16. 17. 18. 19.
b j ni = 0,
j = 1, . . . , i − 1,
i = 1, . . . , r = rank A,
by a finite number of elementary row operations. Hence, A, B ∈ F m×n are row equivalent if and only if r = rank A = rank B and they have the same RREF. (See Chapter 1.) and 1 ≤ p < q ≤ min(m, n), δ p (A)δq (A). For A ∈ Dm×n g , i j −1 (A)i j (A) for j = 2, . . . , rank A. For A ∈ Dm×n g is equivalent to its Smith normal form B = diag (i 1 (A), . . . , i r (A), 0, . . . , 0), Any 0 = A ∈ Dm×n ed where r = rank A and i 1 (A), . . . , i r (A) are the invariants factors of A. are equivalent if and only if A and B have the same rank and the same invariant A, B ∈ Dm×n ed factors.
Examples:
1 a 1 b ,B = ∈ D2×2 be two Hermite normal forms. It is straightforward to 0 0 0 0 show that A ∼r B if and only if a = b. Assume that D is a BD and let a = 0. Then rank A = 1, ν((1), A) = 1, {{ν((2), A)}} = {{a}}, ν((1, 2), A) = 0. If D has other units than 1, it follows that ν(β, A) for all β ∈ Q k,2 , k = 1, 2 do not determine the row equivalence class of A. a c ∈ D2×2 2. Let A = b . Then there exists u, v ∈ Db such that ua + vb = (a, b) = ν((1), A). b d If (a, b) = 0, then 1 = (u, v). If a = b= 0, choose u = 1, v = 0. Hence, there exists x, y ∈ Db u v (a, b) c such that yu − xv = 1. Thus V = ∈ GL(2, Db ) and V A = . Clearly b d x y
1. Let A =
1 0 (a, b) c VA = is a Hermite normal form of A. b = xa + yb = (a, b)e. Hence, 0 f −e 1 This construction is easily extended to obtain a Hermite normal form for any A ∈ Dm×n , using b simple row operations. as in the previous example. Assume that ab = 0. Change the two rows of A if 3. Let A ∈ D2×2 e needed to assume that d(a) ≤ d(b). Let a1 = b, a2 = a and do thefirst step of Euclid’s algorithm: 1 0 a1 = t1 a2 + a3 , where a3 = 0 or d(a3 ) < d(a2 ). Let V = ∈ GL(2, De ) be an elementary −t1 1
a ∗ . If a3 = 0, then A1 has a Hermite normal form. If a3 = 0, matrix. Then A1 = V A = 2 a3 ∗ continue as above. Since Euclid’s algorithm terminates after a finite number of steps, it follows that A can be put into Hermite normal form by a finite number of elementary row operations. This statement holds similarly in the case ab = 0. This construction is easily extended to obtain a m×n using elementary row operations. Hermite normal form for any A ∈ D e a b 4. Assume that D is a BD and let A = ∈ D2×2 . Note that δ1 (A) = (a, b, c ). If A is equivalent 0 c
to a Smith normal form then there exists V, U ∈ GL(2, D) such that V AU =
(a, b, c ) ∗
∗ . ∗
238
Handbook of Linear Algebra
p q x y˜ Assume that V = ,U = . Then there exist p, q , x, y ∈ D such that ( px)a + q˜ p˜ y x˜ ( py)b + (q y)c = (a, b, c ). Thus, if each A ∈ D2×2 is equivalent to Smith normal form in D2×2 , then it follows that D is an EDD. Conversely, suppose that D is an EDD. Then D is also a BD. Let A ∈ D2×2 . First, bring A to an a b upper triangular Hermite normal form using simple row operations: A1 = W A = ,W ∈ 0 c GL(2, D). Note that δ1 (A) = δ1 (A1 ) = (a, b, c ). Since D is an EDD, there exist p, q , x, y ∈ D such that ( px)a + ( py)b + (q y)c = (a, b, c ). If (a, b, c ) = (0, 0, 0), then ( p, q ) = (x, y) = 1. Otherwise Hence, there exist p˜ , q˜ , x˜, y˜ such that p p˜ − q q˜ = x x˜ − y y˜ = 1. A = A1 = 0 and we are done. p q x y˜ δ (A) g 12 Let V = ,U = . Thus, G = V A1 U = 1 . Since δ1 (G ) = δ1 (A), we g 21 g 22 q˜ p˜ y x˜ deduce that δ1 (A) divides g 12 and g 21 . Apply appropriate elementary row and column operations to deduce that A is equivalent to a diagonal matrix C = diag (i 1 (A), d2 ). As δ2 (C ) = i 1 (A)d2 = δ2 (A), we see that C is has Smith normal form. These arguments are easily extended to obtain a Smith normal form for any A ∈ Dm×n ed , using simple row and column operations. 5. The converse of Fact6 is false, as can be seen by considering 2 2 1 1 ,B = ∈ Z[x]2×2 . µ({1}, A) = µ({1}, B) = 1, µ({2}, A) = µ({2}, B) = 1, A= x x 0 0 µ({1, 2}, A) = µ({1, 2}, B) = 0, but there does not exist a Dinvertible P such that P A = B. 6. Let D be an integral domain and assume that p(x) = x m + im=1 ai x m−i ∈ D[x] is a monic polynomial of degree m ≥ 2. Let C ( p) ∈ Dm×m be the companion matrix (see Chapter 4). Then det (x Im − C ( p)) = p(x). Assume that D[x] is a GCDD. Let C ( p)(x) = x Im − C ( p) ∈ D[x]m×m . By deleting the last column and first row, we obtain a triangular (m − 1) × (m − 1) submatrix with −1s on the diagonal, so it follows that δi (C ( p)(x)) = 1 for i = 1, . . . , m − 1. Hence, the invariant factors of C ( p)(x) are i 1 (C ( p)(x)) = . . . = i m−1 (C ( p)(x)) = 1 and i m (C ( p)(x)) = p(x). If D is a field, then C ( p)(x) is equivalent over D[x] to diag (1, . . . , 1, p(x)).
23.3
Linear Equations over Bezout Domains
Definitions: M is a Dmodule if M is an additive group with respect to the operation + and M admits a multiplication by a scalar a ∈ D, i.e., there exists a mapping D × M → M which satisfies the standard distribution properties and 1v = v for all v ∈ M (the latter requirement sometimes results in the module being called unital). (For a field F , a module M is a vector space over F .) M is finitely generated if there exist v1 , . . . , vn ∈ M so that every v ∈ M is a linear combination of v1 , . . . , vn , over D, i.e., v = a1 v1 + . . . + an vn for some a1 , . . . , an ∈ D. v1 , . . . , vn is a basis of M if every v can be written as a unique linear combination of v1 , . . . , vn . dim M = n means that M has a basis of n elements. N ⊆ M is a Dsubmodule of M if N is closed under the addition and multiplication by scalars. Dn (= Dn×1 ) is a Dmodule. It has a standard basis ei for i = 1, . . . , n, where ei is the i th column of the identity matrix In . For any A ∈ Dm×n , the range of A, denoted by range(A), is the set of all linear combinations of the columns of A. The kernel of A, denoted by ker(A), is the set of all solutions to the homogeneous equation Ax = 0. Consider a system of m linear equations in n unknowns:
Matrices over Integral Domains
239
n
i = 1, . . . , m, where ai j , bi ∈ D for i = 1, . . . , m, j = 1, . . . , n. In matrix j =1 a i j x j = b j , notation this system is Ax = b, where A = [ai j ] ∈ Dm×n , x = [x1 , . . . , xn ]T ∈ Dn , b = [b1 , . . . , bm ]T ∈ Dm . A and [A, b] ∈ Dm×(n+1) are called the coefficient matrix and the augmented matrix, respectively. . Then A = A(z) = [ai j (z)]im,n Let A ∈ Hm×n 0 = j =1 and A(z) has the McLaurin expansion A(z) = ∞ k m×n C A z , where A ∈ , k = 0, . . . . Here, each ai j (z) has convergent McLaurin series for z < k k k=0 R(A) for some R(A) > 0. The invariant factors of A are called the local invariant polynomials of A, which are normalized to be of the form i k (A) = z i k for 0 ≤ i 1 ≤ i 2 ≤ . . . ≤ i r , where r = rank A. The integer i r is the index of A and is denoted by η = η(A). For a nonnegative integer p, denote by K p = K p (A) the number of local invariant polynomials of A whose degree is equal to p. Facts: For modules, see [ZS58], [DF04], and [McD84]. The solvability of linear systems over EDD can be traced to [Hel43] and [Kap49]. The results for BD can be found in [Fri81] and [Frixx]. The results for H0 are given in [Fri80]. The general theory of solvability of the systems of equations over commutative rings is discussed in [McD84, Exc. I.G.7–I.G.8]. (See Chapter 1 for information about solvability over fields.) 1. The system Ax = b is solvable over a Bezout domain Db if and only if r = rank A = rank [A, b] and δr (A) = δr ([A, b]), which is equivalent to the statement that A and [A, b] have the same set of invariant factors, up to invertible elements. For a field F , this result reduces to the equality rank A = rank [A, b]. n , range A and ker A are modules in Dm 2. For A ∈ Dm×n b and Db having finite bases with rank A and b null A elements, respectively. Moreover, the basis of ker A can be completed to a basis of Dnb . , let C (z) = A(z) + z k+1 B(z), where k is a nonnegative integer. Then A and C 3. For A, B ∈ Hm×n 0 have the same local invariant polynomials up to degree k. Moreover, if k is equal to the index of A, and A and C have the same rank, then A is equivalent to C . and b(z) = 4. Consider a system of linear equations over H0 A(z)u(z) = b(z), where A(z) ∈ Hm×n 0 ∞ ∞ k m m k b z ∈ H , b ∈ C , k = 0, . . . . Look for the power series solution u(z) = k k k=0 k=0 uk z , 0 k n where uk ∈ C , k = 0, . . . . Then j =0 Ak− j u j = bk , for k = 0, . . . . This system is solvable for k = 0, . . . , q ∈ Z+ if and only if A(z) and [A(z), b(z)] have the same local invariant polynomials up to degree q . 5. Suppose that A(z)u(z) = b(z) is solvable over H0 . Let q = η(A) and suppose that u0 , . . . , uq satisfies the system of equations, given in the previous fact, for k = 0, . . . , q . Then there exists a solution u(z) ∈ Hn0 satisfying u(0) = u0 . 6. Let q ∈ Z+ and Wq ⊂ Cn be the subspace of all vectors w0 such that w0 , . . . , wq is a solution to q the homogenous system kj =0 Ak− j w j = 0, for k = 0, . . . , q . Then dim Wq = n − j =0 K j (A). In particular, for η = η(A) and any w0 ∈ Wη there exists w(z) ∈ Hn0 such that A(z)w(z) = 0, w(0) = w0 .
23.4
Strict Equivalence of Pencils
Definitions: A matrix A(x) ∈ D[x]m×n is a pencil if A(x) = A0 + x A1 , A0 , A1 ∈ Dm×n . A pencil A(x) is regular if m = n and det A(x) is not the zero polynomial. Otherwise A(x) is a singular pencil. Associate with a pencil A(x) = A0 + x A1 ∈ D[x]m×n the homogeneous pencil A(x0 , x1 ) = x0 A0 + x1 A1 ∈ D[x0 , x1 ]m×n . s Two pencils A(x), B(x) ∈ D[x]m×n are strictly equivalent, denoted by A(x)∼B(x), if B(x) = Q A(x)P for some P ∈ GLn (D), Q ∈ GLm (D). Similarly, two homogeneous pencils A(x0 , x1 ), B(x0 , x1 )
2310
Handbook of Linear Algebra s
∈ D[x0 , x1 ]m×n are strictly equivalent, denoted by A(x0 , x1 )∼B(x0 , x1 ), if B(x0 , x1 ) = Q A(x0 , x1 )P for some P ∈ GLn (D), Q ∈ GLm (D). For a UFD Du let δk (x0 , x1 ), i k (x0 , x1 ) be the invariant determinants and factors of A(x0 , x1 ), respectively, for k = 1, . . . , rank A(x0 , x1 ). They are called homogeneous determinants and the invariant homogeneous polynomials (factors), respectively, of A(x0 , x1 ). (Sometimes, δk (x0 , x1 ), i k (x0 , x1 ), k = 1, . . . , rank A(x0 , x1 ) are called the homogeneous determinants and the invariant homogeneous polynomials A(x).) Let A(x) ∈ F [x]m×n and consider the module M ⊂ F [x]n of all solutions of A(x)w(x) = 0. The set of all solutions w(x) is an F [x]module M with a finite basis w1 (x), . . . , ws (x), where s = n − rank A(x). Choose a basis w1 (x), . . . , ws (x) in M such that wk (x) ∈ M has the lowest degree among all w(x) ∈ M, which are linearly independent over F [x] of w1 , . . . , wk−1 (x) for k = 1, . . . , s . Then the column indices α1 ≤ α2 ≤ . . . ≤ αs of A(x) are given as αk = deg wk (x), k = 1, . . . , s . The row indices 0 ≤ β1 ≤ β2 ≤ . . . ≤ βt , t = m − rank A(x), of A(x), are the column indices of A(x)T . Facts: The notion of strict equivalence of n × n regular pencils over the fields goes back to K. Weierstrass [Wei67]. The notion of strict similarity of m × n matrices over the fields is due to L. Kronecker [Kro90]. Most of the details can be found in [Gan59]. Some special results are proven in [Frixx]. For information about matrix pencils over fields see Section 43.1. s
s
1. Let A0 , A1 , B0 , B1 ∈ Dm×n . Then A0 + x A1 ∼B0 + x B0 ⇐⇒ x0 A0 + x1 A1 ∼B0 x0 + B1 x1 . 2. Let A0 , A1 ∈ Du . Then the invariant determinants and the invariant polynomials δk (x0 , x1 ), i k (x0 , x1 ), k = 1, . . . , rank x0 A0 + x1 A1 , of x0 A0 + x1 A1 are homogeneous polynomials. Moreover, if δk (x) and i k (x) are the invariant determinants and factors of the pencil A0 + x A1 for k = 1, . . . , rank A0 +x A1 , then δk (x) = δk (1, x), i k (x) = i k (1, x), for k = 1, . . . , rank A0 +x A1 . 3. [Wei67] Let A0 + x A1 ∈ F [x]n×n be a regular pencil. Then a pencil B0 + x B1 ∈ F [x]n×n is strictly equivalent to A0 + x A1 if and only if A0 + x A1 and B0 + x B1 have the same invariant polynomials over F [x]. s 4. [Frixx] Let A0 + x A1 , B0 + x B1 ∈ D[x]n×n . Assume that A1 , B1 ∈ GLn (D). Then A0 + x A1 ∼B0 + x B1 ⇐⇒ A0 + x A1 ∼ B0 + x B1 . 5. [Gan59] The column (row) indices are independent of a particular allowed choice of a basis w1 (x), . . . , ws (x). 6. For singular pencils the invariant homogeneous polynomials alone do not determine the class of strictly equivalent pencils. 7. [Kro90], [Gan59] The pencils A(x), B(x) ∈ F [x]m×n are strictly equivalent if and only if they have the same invariant homogeneous polynomials and the same row and column indices.
References [DF04] D.S. Dummit and R.M. Foote, Abstract Algebra, 3rd ed., John Wiley & Sons, New York, 2004. [Fri80] S. Friedland, Analytic similarity of matrices, Lectures in Applied Math., Amer. Math. Soc. 18 (1980), 43–85 (edited by C.I. Byrnes and C.F. Martin). [Fri81] S. Friedland, Spectral Theory of Matrices: I. General Matrices, MRC Report, Madison, WI, 1981. [Frixx] S. Friedland, Matrices, (a book in preparation). [Gan59] F.R. Gantmacher, The Theory of Matrices, Vol. I and II, Chelsea Publications, New York, 1959. (Vol. I reprinted by AMS Chelsea Publishing, Providence 1998.) [GR65] R. Gunning and H. Rossi, Analytic Functions of Several Complex Variables, PrenticeHall, Upper Saddle Rever, NJ, 1965. [Hel43] O. Helmer, The elementary divisor theorems for certain rings without chain conditions, Bull. Amer. Math. Soc. 49 (1943), 225–236. [Kap49] I. Kaplansky, Elementary divisors and modules, Trans. Amer. Math. Soc. 66 (1949), 464–491.
Matrices over Integral Domains
2311
[Kro90] L. Kronecker, Algebraische reduction der schaaren bilinear formen, SB Akad. Berlin, 1890, 763–778. [McD84] B.R. McDonald, Linear Agebra over Commutative Rings, Marcel Dekker, New York, 1984. [Rud74] W. Rudin, Real and Complex Analysis, McGraw Hill, New York, 1974. [Wei67] K. Weierstrass, Zur theorie der bilinearen un quadratischen formen, Monatsch. Akad. Wiss. Berlin, 310–338, 1867. [ZS58] O. Zariski and P. Samuel, Commutative Algebra I, Van Nostrand, Princeton, 1958 (reprinted by SpringerVerlag, 1975).
24 Similarity of Families of Matrices
Shmuel Friedland University of Illinois at Chicago
24.1 Similarity of Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24.2 Simultaneous Similarity of Matrices . . . . . . . . . . . . . . . . 24.3 Property L . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24.4 Simultaneous Similarity Classification I . . . . . . . . . . . . . 24.5 Simultaneous Similarity Classification II . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
241 245 246 247 2410 2412
This chapter uses the notations, definitions, and facts given in Chapter 23. The aim of this chapter is to acquaint the reader with two difficult problems in matrix theory: 1. Similarity of matrices over integral domains, which are not fields. 2. Simultaneous similarity of tuples of matrices over C. Problem 1 is notoriously difficult. We show that for the local ring H0 this problem reduces to a Problem 2 for certain kind of matrices. We then discuss certain special cases of Problem 2 as simultaneous similarity of tuples of matrices to upper triangular and diagonal matrices. The L property of pairs of matrices, which is discussed next, is closely related to simultaneous similarity of pair of matrices to a diagonal pair. The rest of the chapter is devoted to a “solution” of the Problem 2, by the author, in terms of basic notions of algebraic geometry.
24.1
Similarity of Matrices
The classical result of K. Weierstrass [Wei67] states that the similarity class of A ∈ F n×n is determined by the invariant factors of −A + x In over F [x]. (See Chapter 6 and Chapter 23.) For a given A, B ∈ F n×n , one can easily determine if A and B are similar, by considering only the ranks of three specific matrices associated with A, B [GB77]. It is well known that it is a difficult problem to determine if A, B ∈ Dn×n are Dsimilar for most integral domains that are not fields. The emphasis of this chapter is the similarity over the local field H0 . The subject of similarity of matrices over H0 arises naturally in theory linear differential equations having singularity with respect to a parameter. It was studied by Wasow in [Was63], [Was77], and [Was78]. Definitions: For E ∈ Dm×n , G ∈ D p×q extend the definition of the tensor or Kronecker product E ⊗ G ∈ Dmp×nq of E with G to the domain D in the obvious way. (See Section 10.4.) A, B ∈ Dm×m are called similar, denoted by A ≈ B if B = Q AQ −1 , for some Q ∈ GLm (D). 241
242
Handbook of Linear Algebra a
Let A, B ∈ H()n×n . Then A and B are called analytically similar, denoted as A≈B, if A and B are similar over H(). A and B are called locally similar if for any ζ ∈ , the restrictions Aζ , Bζ of A, B to the local rings Hζ , respectively, are similar over Hζ . A, B are called pointwise similar if A(ζ ), B(ζ ) are similar matrices in Cn×n for each ζ ∈ . r A, B are called rationally similar, denoted as A≈B, if A, B are similar over the quotient field M() of H(). Let A, B ∈ Hn×n 0 : A(x) =
∞
Ak x k ,
x < R(A),
B(x) =
k=0
∞
Bk x k ,
x < R(B).
k=0
Then η(A, B) and K p (A, B) are the index and the number of local invariant polynomials of degree p of the matrix In ⊗ A(x) − B(x)T ⊗ In , respectively, for p = 0, 1, . . . . λ(x) is called an algebraic function if there exists a monic polynomial p(λ, x) = λn + in=1 q i (x)λn−i ∈ (C[x])[λ] of λdegree n ≥ 1 such that p(λ(x), x) = 0 identically. Then λ(x) is a multivalued function on C, which has n branches. At each point ζ ∈ C each branch λ j (x) of λ(x) has Puiseaux expansion: i λ j (x) = i∞=0 b j i (ζ )(x − ζ ) m , which converges for x − ζ  < R(ζ ), and some integer m depending m i on p(x). i =0 b j i (ζ )(x − ζ ) m is called the linear part of λ j (x) at ζ . Two distinct branches λ j (x) and λk (x) are called tangent at ζ ∈ C if the linear parts of λ j (x) and λk (x) coincide at ζ . Each branch λ j (x) i has Puiseaux expansion around ∞: λ j (x) = x l i∞=0 c j i x − m , which converges for x > R. Here, l is i the smallest nonnegative integer such that c j 0 = 0 at least for some branch λ j . x l im=0 c j i x − m is called the principal part of λ j (x) at ∞. Two distinct branches λ j (x) and λk (x) are called tangent at ∞ if the principal parts of λ j (x) and λk (x) coincide at ∞. Facts: The standard results on the tensor products can be found in Chapter 10 or Chapter 13 or in [MM64]. Most of the results of this section related to the analytic similarity over H0 are taken from [Fri80]. 1. The similarity relation is an equivalence relation on Dm×m . s 2. A ≈ B ⇐⇒ A(x) = −A + x I ∼B(x) = −B + x I . 3. Let A, B ∈ F n×n . Then A and B are similar if and only if the pencils −A + x I and −B + x I have the same invariant polynomials over F [x]. 4. If E = [e i j ] ∈ Dm×n , G ∈ D p×q , then E ⊗ G can be viewed as the m × n block matrix [e i j G ]i,m,n j =1 . Alternatively, E ⊗ G can be identified with the linear transformation L (E , G ) : Dq ×n → D p×m ,
X → G X E T.
5. (E ⊗ G )(U ⊗ V ) = E U ⊗ G V whenever the products E U and G V are defined. Also (E ⊗ G )T = E T ⊗ G T (cf. §2.5.4)). 6. For A, B ∈ Dn×n , if A is similar to B, then In ⊗ A − AT ⊗ In ∼ In ⊗ A − B T ⊗ In ∼ In ⊗ B − B T ⊗ In . 7. [Gur80] There are examples over Euclidean domains for which the reverse of the implication in Fact 6 does not hold. 8. [GB77] For D = F , the reverse of the implication in Fact 6 holds. 9. [Fri80] Let A ∈ F m×m , B ∈ F n×n . Then null (In ⊗ A − B T ⊗ Im ) ≤
1 (null (Im ⊗ A − AT ⊗ Im ) + null (In ⊗ B − B T ⊗ In )). 2
Equality holds if and only if m = n and A and B are similar.
243
Similarity of Families of Matrices
10. Let A ∈ F n×n and assume that p1 (x), . . . , pk (x) ∈ F [x] are the nontrivial normalized invariant polynomials of −A+ x I , where p1 (x) p2 (x) . . .  pk (x) and p1 (x) p2 (x) . . . pk (x) = det (x I − A). Then A ≈ C ( p1 ) ⊕ C ( p2 ) ⊕ . . . ⊕ C ( pk ) and C ( p1 ) ⊕ C ( p2 ) ⊕ . . . ⊕ C ( pk ) is called the rational canonical form of A (cf. Chapter 6.6). 11. For A, B ∈ H()n×n , analytic similarity implies local similarity, local similarity implies pointwise similarity, and pointwise similarity implies rational similarity. 12. For n = 1, all the four concepts in Fact 11 are equivalent. For n ≥ 2, local similarity, pointwise similarity, and rational similarity, are distinct (see Example 2). 13. The equivalence of the three matrices in Fact 6 over H() implies the pointwise similarity of A and B. 14. Let A, B ∈ Hn×n 0 . Then A and B are analytically similar over H0 if and only if A and B are rationally similar over H0 and there exists η(A, A) + 1 matrices T0 , . . . , Tη ∈ Cn×n (η = η(A, A)), such that det T0 = 0 and k
Ai Tk−i − Tk−i Bi = 0,
k = 0, . . . , η(A, A).
i =0
15. Suppose that the characteristic polynomial of A(x) splits over H0 : det (λI − A(x)) =
n
(λ − λi (x)),
λi (x) ∈ H0 , i = 1, . . . , n.
i =1
Then A(x) is analytically similar to C (x) = ⊕i=1 C i (x),
C i (x) ∈ Hn0 i ×ni ,
(αi Ini − C i (0))ni = 0, αi = λni (0), αi = α j
for i = j, i, j = 1, . . . , .
16. Assume that the characteristic polynomial of A(x) ∈ H0 splits in H0 .Then A(x) is analytically similar to a block diagonal matrix C (x) of the form Fact 15 such that each C i (x) is an upper triangular matrix whose offdiagonal entries are polynomials in x. Moreover, the degree of each polynomial entry above the diagonal in the matrix C i (x) does not exceed η(C i , C i ) for i = 1, . . . , . 17. Let P (x) and Q(x) be matrices of the form i ×mi , P (x) = ⊕i =1 Pi (x), Pi (x) ∈ Hm 0
p
(αi Imi − Pi (0))mi = 0, αi = α j q Q(x) = ⊕ j =1 Q j (x), (β j In j − Q j (0))n j =
Q j (x) ∈
for i = j, i, j = 1, . . . , p,
n ×n H0 j j ,
0, βi = β j
for i = j, i, j = 1, . . . , q .
Assume furthermore that αi = βi , i = 1, . . . , t, α j = β j , i = t + 1, . . . , p, j = t + 1, . . . , q , 0 ≤ t ≤ min( p, q ). Then the nonconstant local invariant polynomials of I ⊗ P (x) − Q(x)T ⊗ I are the nonconstant local invariant polynomials of I ⊗ Pi (x) − Q i (x)T ⊗ I for i = 1, . . . , t: K p (P , Q) =
t
K p (Pi , Q i ),
p = 1, . . . , .
i =1
In particular, if C (x) is of the form in Fact 15, then η(C, C ) = max η(C i , C i ). 1≤i ≤
244
Handbook of Linear Algebra a
a
18. A(x)≈B(x) ⇐⇒ A(y m )≈B(y m ) for any 2 ≤ m ∈ N. 19. [GR65] (Weierstrass preparation theorem) For any monic polynomial p(λ, x) = λn + in=1 ai (x)λn−i ∈ H0 [λ] there exists m ∈ N such that p(λ, y m ) splits over H0 . there are at most a countable number of analytic 20. For a given rational canonical form A(x) ∈ H2×2 0 similarity classes. (See Example 3.) 21. For a given rational canonical form A(x) ∈ Hn×n 0 , where n ≥ 3, there may exist a family of distinct similarity classes corresponding to a finite dimensional variety. (See Example 4.) 22. Let A(x) ∈ H0n×n and assume that the characteristic polynomial of A(x) splits in H0 as in Fact 15. Let B(x) = diag (λ1 (x), . . . , λn (x)). Then A(x) and B(x) are not analytically similar if and only if there exists a nonnegative integer p such that K p (A, A) + K p (B, B) < 2K p (A, B), K j (A, A) + K j (B, B) = 2K j (A, B), j = 0, . . . , p − 1,
if p ≥ 1.
a
In particular, A(x)≈B(x) if and only if the three matrices given in Fact 6 are equivalent over H0 . 23. [Fri78] Let A(x) ∈ C[x]n×n . Then each eigenvalue λ(x) of A(x) is an algebraic function. Assume that A(ζ ) is diagonalizable for some ζ ∈ C. Then the linear part of each branch of λ j (x) is linear at ζ , i.e., is of the form α + βx for some α, β ∈ C. 24. Let A(x) ∈ C[x]n×n be of the form A(x) = k=0 Ak x k , where Ak ∈ Cn×n for k = 0, . . . , and ≥ 1, A = 0. Then one of the following conditions imply that A(x) = S(x)B(x)S −1 (x), where S(x) ∈ GL(n, C[x]) and B(x) ∈ C[x]n×n is a diagonal matrix of the form ⊕im=1 λi (x)Iki , where k1 , . . . , km ≥ 1. Furthermore, λ1 (x), . . . , λm (x) are m distinct polynomials satisfying the following conditions: (a) deg λ1 = ≥ deg λi (x), i = 2, . . . , m − 1. (b) The polynomial λi (x)−λ j (x) has only simple roots in C for i = j . (λi (ζ ) = λ j (ζ ) ⇒ λi (ζ ) = λ j (ζ )). i. The characteristic polynomial of A(x) splits in C[x], i.e., all the eigenvalues of A(x) are polynomials. A(x) is pointwise diagonalizable in C and no two distinct eigenvalues are tangent at any ζ ∈ C . ii. A(x) is pointwise diagonalizable in C and A is diagonalizable. No two distinct eigenvalues are tangent at any point ζ ∈ C ∪ {∞}. Then A(x) is strictly similar to B(x), i.e., S(x) can be chosen in GL(n, C). Furthermore, λ1 (x), . . . , λm (x) satisfy the additional condition: (c) For i = j , either
d λi d x
(0) =
dλ j d x
d λi d x
(0) or
(0) =
dλ j d x
(0)
d −1 λi d =1 x
and
(0) =
d −1 λ j d −1 x
(0).
Examples: 1. Let
A=
1
0
0
5
, B=
1
1
0
5
∈ Z2×2 .
Then A(x) and B(x) have the same invariant polynomials over Z[x] and A and B are not similar over Z. 2. Let
A(z) =
0
1
0
0
,
D(z) =
z
0
0
1
.
Then z A(z) = D(z)A(z)D(z)−1 , i.e., A(z), z A(z) are rationally similar. Clearly A(z) and z A(z) are not pointwise similar for any containing 0. Now z A(z), z 2 A(z) are pointwise similar in C, but they are not locally similar on H0 .
245
Similarity of Families of Matrices
3. Let A(x) ∈ H2×2 and assume that det (λI − A(x)) = (λ − λ1 (x))(λ − λ2 (x)). Then A(x) is 0 analytically similar either to a diagonal matrix or to
B(x) =
λ1 (x)
xk
0
λ2 (x)
,
k = 0, . . . , p ( p ≥ 0).
a
Furthermore, if A(x)≈B(x), then η(A, A) = k. 4. Let A(x) ∈ H3×3 0 . Assume that r
A(x)≈C ( p),
p(λ, x) = λ(λ − x 2m )(λ − x 4m ),
m ≥ 1.
Then A(x) is analytically similar to a matrix ⎡
0
x k1
B(x, a) = ⎢ ⎣0
x 2m
⎢
0
0
a(x)
⎤ ⎥
x k2 ⎥ ⎦,
0 ≤ k1 , k2 ≤ ∞ (x ∞ = 0),
x 4m a
where a(x) is a polynomial of degree 4m − 1 at most. Furthermore, B(x, a)≈B(x, b) if and only if (a) If a(0) = 1, then b − a is divisible by x m . i k (b) If a(0) = 1 and dd xai = 0, i = 1, . . . , k − 1, dd xak = 0 for 1 ≤ k < m, then b − a is divisible by x m+k . (c) If a(0) = 1 and
di a d xi
= 0, i = 1, . . . , m, then b − a is divisible by x 2m .
Then for k1 = k2 = m and a(0) ∈ C\{1}, we can assume that a(x) is a polynomial of degree less than m. Furthermore, the similarity classes of A(x) are uniquely determined by such a(x). These similarity classes are parameterized by C\{1} × Cm−1 (the Taylor coefficients of a(x)).
24.2
Simultaneous Similarity of Matrices
In this section, we introduce the notion of simultaneous similarity of matrices over a domain D. The problem of simultaneous similarity of matrices over a field F , i.e., to describe the similarity class of a given m (≥ 2) tuple of matrices or to decide when a given two tuples of matrices are simultaneously similar, is in general a hard problem, which will be discussed in the next sections. There are some cases where this problem has a relatively simple solution. As shown below, the problem of analytic similarity of reduces to the problem of simultaneously similarity of certain 2tuples of matrices. A(x), B(x) ∈ Hn×n 0 Definitions: For A0 , . . . , Al ∈ Dn×n denote by A(A0 , . . . , Al ) ⊂ Dn×n the minimal algebra in Dn×n containing In and A0 , . . . , Al . Thus, every matrix G ∈ A(A0 , . . . , Al ) is a noncommutative polynomial in A0 , . . . , Al . For l ≥ 1, (A0 , A1 , . . . , A ), (B0 , . . . , B ) ∈ (Dn×n )+1 are called simultaneously similar, denoted by (A0 , A1 , . . . , A ) ≈ (B0 , . . . , B ), if there exists P ∈ GL(n, D) such that Bi = P Ai P −1 , i = 0, . . . , , i.e., (B0 , B1 , . . . , B ) = P (A0 , A1 , . . . , A )P −1 . Associate with (A0 , A1 , . . . , A ), (B0 , . . . , B ) ∈ (Dn×n )+1 the matrix polynomials A(x) = i=0 Ai x i ,
s
B(x) = i=0 Bi x i ∈ D[x]n×n . A(x) and B(x) are called strictly similar (A≈B) if there exists P ∈ GL(n, D) such that B(x) = P A(x)P −1 . Facts: s
1. A≈B ⇐⇒ (A0 , A1 , . . . , A ) ≈ (B0 , . . . , B ). 2. (A0 , . . . , A ) ∈ (Cn×n )+1 is simultaneously similar to a diagonal tuple (B0 , . . . , B ) ∈ (Cn×n )+1 , i.e., each Bi is a diagonal matrix if and only if A0 , . . . , A are + 1 commuting diagonalizable matrices: Ai A j = A j Ai for i, j = 0, . . . , .
246
Handbook of Linear Algebra
3. If A0 , . . . , A ∈ Cn×n commute, then ( A0 , . . . , A ) is simultaneously similar to an upper triangular tuple (B0 , . . . , B ). l +1 4. Let l ∈ N, (A0 , . . . , Al ), (B0 , . . . , Bl ) ∈ (Cn×n )l +1 , and U = [Ui j ]li,+1 j =1 , V = [Vi j ]i, j =1 , W = l +1 n(l +1)×n(l +1) n×n [Wi j ]i, j =1 ∈ C , Ui j , Vi j , Wi j ∈ C , i, j = 1, . . . , l + 1 be block upper triangular matrices with the following block entries: Ui j = A j −i , Vi j = B j −i , Wi j = δ(i +1) j In ,
i = 1, . . . , l + 1, j = i, . . . , l + 1.
Then the system in Fact 14 of section 24.1 is solvable with T0 ∈ GL(n, C) if and only for l = κ(A, A) the pairs (U, W) and (V, W) are simultaneously similar. 5. For A0 , . . . , A ∈ (Cn×n )+1 TFAE: r (A , . . . , A ) is simultaneously similar to an upper triangular tuple (B , . . . , B ) ∈ (Cn×n )+1 . 0 0 r For any 0 ≤ i < j ≤ and M ∈ A(A , . . . , A ), the matrix
0
(Ai A j − A j Ai )M is nilpotent.
6. Let X0 = A(A0 , . . . , A ) ⊆ F n×n and define recursively
Xk =
(Ai A j − A j Ai )Xk−1 ⊆ F n×n ,
k = 1, . . . .
0≤i < j ≤
Then ( A0 , . . . , A ) is simultaneously similar to an upper triangular tuple if and only if the following two conditions hold: r A X ⊆ X , i = 0, . . . , , k = 0, . . . . i k k r There exists q ≥ 1 such that X = {0} and X is a strict subspace of X q k k−1 for k = 1, . . . , q .
Examples: 1. This example illustrates the construction of the matrices U and W in Fact 4. Let A0 =
A1 =
5 7
2 , 4
6 1 −1 , and A2 = . Then 8 −1 1 ⎡
1 ⎢3 ⎢ ⎢ ⎢0 U =⎢ ⎢0 ⎢ ⎣0 0
24.3
1 3
2 4 0 0 0 0
5 7 1 3 0 0
⎤
6 1 −1 8 −1 1⎥ ⎥ 2 5 6⎥ ⎥ ⎥ 4 7 8⎥ ⎥ 0 1 2⎦ 0 3 4
⎡
and
0 ⎢0 ⎢ ⎢ ⎢0 W=⎢ ⎢0 ⎢ ⎣0 0
0 0 0 0 0 0
1 0 0 0 0 0
0 1 0 0 0 0
0 0 1 0 0 0
⎤
0 0⎥ ⎥ 0⎥ ⎥ ⎥. 1⎥ ⎥ 0⎦ 0
Property L
Property L was introduced and studied in [MT52] and [MT55]. In this section, we consider only square pencils A(x) = A0 + A1 x ∈ C[x]n×n , A(x0 , x1 ) ∈ C[x0 , x1 ]n×n , where A1 = 0. Definitions: A pencil A(x) ∈ C[x]n×n has property L if all the eigenvalues of A(x0 , x1 ) are linear functions. That is, λi (x0 , x1 ) = αi x0 + βi x1 is an eigenvalue of A(x0 , x1 ) of multiplicity ni for i = 1, . . . , m, where n=
m
ni ,
(αi , βi ) = (α j , β j ),
for
1 ≤ i < j ≤ m.
i =1
A pencil A(x) = A0 + A1 x is Hermitian if A0 , A1 are Hermitian.
247
Similarity of Families of Matrices
Facts: Most of the results of this section can be found in [MF80], [Fri81], and [Frixx]. 1. For a pencil A(x) = A0 + x A1 ∈ C[x]n×n TFAE: r A(x) has property L . r The eigenvalues of A(x) are polynomials of degree 1 at most. r The characteristic polynomial of A(x) splits into linear factors over C[x]. r There is an ordering of the eigenvalues of A and A , α , . . . , α and β , . . . , β , respectively, 0 1 1 n 1 n
such that the eigenvalues of A0 x0 + A1 x1 are α1 x0 + β1 x1 , . . . , αn x0 + βn x1 .
2. A pencil in A(x) has property L if one of the following conditions hold: r A(x) is similar over C(x) to an upper triangular matrix U (x) ∈ C(x)n×n . r A(x) is strictly similar to an upper triangular pencil U (x) = U + U x. 0 1 r A(x) is similar over C[x] to a diagonal matrix B(x) ∈ C[x]n×n . r A(x) is strictly similar to diagonal pencil.
3. If a pencil A(x0 , x1 ) has property L , then any two distinct eigenvalues are not tangent at any point of C ∪ ∞. 4. Assume that A(x) is pointwise diagonalizable on C. Then A(x) has property L . Furthermore, A(x) is similar over C[x] to a diagonal pencil B(x) = B0 + B1 x. Suppose furthermore that A1 is diagonalizable, i.e., A(x0 , x1 ) is pointwise diagonalizable on C2 . Then A(x) is strictly similar to a diagonal pencil B(x), i.e., A0 and A1 are commuting diagonalizable matrices. 5. Let A(x) = A0 + A1 x ∈ C[x]n×n such that A1 and A2 are diagonalizable and A0 A1 = A1 A0 . Then exactly one of the following conditions hold: r A(x) is not diagonalizable exactly at the points ζ , . . . , ζ , where 1 ≤ p ≤ n(n − 1). 1 p r For n ≥ 3, A(x) ∈ C[x]n×n is diagonalizable exactly at the points ζ = 0, . . . , ζ for some q ≥ 1. 1 q
(We do not know if this condition is satisfied for some pencil.) 6. Let A(x) = A0 + A1 x be a Hermitian pencil satisfying A0 A1 = A1 A0 . Then there exists 2q distinct such that A(x) is not diagonalizable if complex points ζ1 , ζ 1 . . . , ζq , ζ q ∈ C\R, 1 ≤ q ≤ n(n−1) 2 and only if x ∈ {ζ1 , ζ 1 , . . . , ζq , ζ q }. Examples: 1. This example illustrates the case n = 2 of Fact 5. Let
1 A0 = 3
2 4
and
1 A1 = −3
3 , 1
so
x +1 A(x) = −3x
3x . x +2
) has repeatedeigenvalues. For ζ ∈ C, the only possible way A(ζ ) can fail to be diagonalizable is if A(ζ
The eigenvalues of A(ζ ) are 12 2ζ − 1 − 36ζ 2 + 3 and 12 2ζ + 1 − 36ζ 2 + 3 , so the only values of ζ at which it is possible that A(ζ ) is not diagonalizeable are ζ = ± 16 , and in fact A(± 16 ) is not diagonalizable.
24.4
Simultaneous Similarity Classification I
This section outlines the setting for the classification of conjugacy classes of l +1 tuples ( A0 , A1 , . . . , Al ) ∈ (Cn×n )l +1 under the simultaneous similarity. This classification depends on certain standard notions in algebraic geometry that are explained briefly in this section. A detailed solution to the classification of conjugacy classes of l + 1 tuples is outlined in the next section.
248
Handbook of Linear Algebra
Definitions: X ⊂ C N is called an affine algebraic variety (called here a variety) if it is the zero set of a finite number of polynomial equations in C N . X is irreducible if X does not decompose in a nontrivial way to a union of two varieties. If X is a finite nontrivial union of irreducible varieties, these irreducible varieties are called the irreducible components of X . x ∈ X is called a regular (smooth) point of irreducible X if in the neighborhood of this point X is a complex manifold of a fixed dimension d, which is called the dimension of X and is denoted by dim X . ∅ is an irreducible variety of dimension −1. For a reducible variety Y ⊂ C N , the dimension of Y, denoted by dim Y, is the maximum dimension of its irreducible components. The set of singular (nonsmooth) points of X is denoted by Xs . A set Z is a quasiirreducible variety if there exists a nonempty irreducible variety X and a strict subvariety Y ⊂ X such that Z = X \Y. The dimension of Z, denoted by dim Z, is defined to be equal to the dimension of X . A quasiirreducible variety Z is regular if Z ⊂ X \Xs . A stratification of C N is a decomposition of C N to a finite disjoint union of X1 , . . . , X p of regular quasiirreducible varieties such that Cl (Xi )\Xi = ∪ j ∈Ai X j for some Ai ⊂ {1, . . . , p} for i = 1, . . . , p. (Cl (Xi ) = Xi ⇐⇒ Ai = ∅.) Denote by C[C N ] the ring of polynomial in N variables with coefficients in C. Denote by Wn,l +1,r +1 the finite dimensional vector space of multilinear polynomials in (l +1)n2 variables of degree at most r + 1. That is, the degree of each variable in any polynomial is at most 1. N(n, l , r ) := dim Wn,l +1,r +1 . Wn,l +1,r +1 has a standard basis e1 , . . . , e N(n,l ,r ) in Wn,l +1,r +1 consisting of monomials in (l + 1)n2 variables of degree r + 1 at most, arranged in a lexicographical order. Let X ⊂ C N be a quasiirreducible variety. Denote by C[X ] the restriction of all polynomials f (x) ∈ C[C N ] to X , where f, g ∈ C[C N ] are identified if f − g vanishes on X . Let C(X ) denote the quotient field of C[X ]. A rational function h ∈ C(X ) is regular if h is defined everywhere in X . A regular rational function on X is an analytic function. Denote by A the l + 1 tuple (A0 , . . . , Al ) ∈ (Cn×n )l +1 . The group GL(n, C) acts by conjugation on (Cn×n )l +1 : T AT −1 = (T A0 T −1 , . . . T Al T −1 ) for any A ∈ (Cn×n )l +1 and T ∈ GL(n, C). Let orb (A) := {T AT −1 : T ∈ GL(n, C)} be the orbit of A (under the action of GL(n, C)). Let X ⊂ (Cn×n )l +1 be a quasiirreducible variety. X is called invariant (under the action of GL(n, C)) if T X T −1 = X for all T ∈ GL(n, C). Assume that X is an invariant quasiirreducible variety. A rational function h ∈ C(X ) is called invariant if h is the same value on any two points of a given orbit in X , where h is defined. Denote by C[X ]inv ⊆ C[X ] and C(X )inv ⊆ C(X ) the subdomain of invariant polynomials and subfield of invariant functions, respectively. Facts: For general background, consult for example [Sha77]. More specific details are given in [Fri83], [Fri85], and [Fri86]. 1. 2. 3. 4. 5. 6. 7.
An intersection of a finite or infinite number of varieties is a variety, which can be an empty set. A finite union of varieties in C N is a variety. Every variety X is a finite nontrivial union of irreducible varieties. Let X ⊂ C N be an irreducible variety. Then X is pathwise connected. Xs is a proper subvariety of the variety X and dim Xs < dim X . dim C N = N and (C N )s = ∅. For any z ∈ C N , the set {z} is an irreducible variety of dimension 0. A quasiirreducible variety Z = X \Y is pathwise connected and its closure, denoted by Cl (Z), is equal to X . Cl (Z)\Z is a variety of dimension strictly less than the dimension of Z.
Similarity of Families of Matrices
249
8. The set of all regular points of an irreducible variety X , denoted by Xr := X \Xs , is a quasiirreducible variety. Moreover, Xr is a pathwise connected complex manifold of complex dimension dim X . +1 (l +1)n2 . 9. N(n, l , r ) := dim Wn,l +1,r +1 = ri =0 i 10. For an irreducible X , C[X ] is an integral domain. 11. For a quasiirreducible X , C[X ], C(X ) can be identified with C[Cl (X )], C(Cl (X )), respectively. 12. For A ∈ (Cn×n )l +1 , orb (A) is a quasiirreducible variety in (Cn×n )l +1 . 13. Let X ⊂ (Cn×n )l +1 be a quasiirreducible variety. X is invariant if A ∈ X ⇐⇒ orb (A) ⊆ X . 14. Let X be an invariant quasiirreducible variety. The quotient field of C[X ]inv is a subfield of C(X )inv , and in some interesting cases the quotient field of C[X ]inv is a strict subfield of C(X )inv . 15. Assume that X ⊂ (Cn×n )l +1 is an invariant quasiirreducible variety. Then C[X ]inv and C(X )inv are finitely invariant generated. That is, there exists f 1 , . . . , f i ∈ C[X ]inv and g 1 , . . . , g j ∈ C(X )inv such that any polynomial in C[X ]inv is a polynomial in f 1 , . . . , f i , and any rational function in C(X )inv is a rational function in g 1 , . . . , g j . 16. (Classification Theorem) Let n ≥ 2 and l ≥ 0 be fixed integers. Then there exists a stratification p ∪i =1 Xi of (Cn×n )l +1 with the following properties. For each Xi there exist mi regular rational functions g 1,i , . . . , g mi ,i ∈ C(Xi )inv such that the values of g j,i for j = 1, . . . , mi on any orbit in Xi determines this orbit uniquely. The rational functions g 1,i , . . . , g mi ,i are the generators of C(Xi )inv for i = 1, . . . , p. Examples: 1. Let S be an irreducible variety of scalar matrices S := {A ∈ C2×2 : A = tr2 A I2 } and X := C2×2 \S be a quasiirreducible variety. Then dim X = 4, dim S = 1, and C2×2 = X ∪ S is a stratification of C2×2 . 2. Let U ⊂ (C2×2 )2 be the set of all pairs (A, B) ∈ (C2×2 )2 , which are simultaneously similar to a pair of upper triangular matrices. Then U is a variety given by the zero of the following polynomial: U := {(A, B) ∈ (C2×2 )2 : (2 tr A2 − (tr A)2 )(2 tr B 2 − (tr B)2 ) − (2 tr AB − tr A tr B)2 = 0}. Let C ⊂ U be the variety of commuting matrices: C := {(A, B) ∈ (C2×2 )2 : AB − B A = 0}. Let V be the variety given by the zeros of the following three polynomials: V := {(A, B) ∈ (C2×2 )2 : 2 tr A2 − (tr A)2 = 2 tr B 2 − (tr B)2 = 2 tr AB − tr A tr B = 0}. Then V is the variety of all pairs (A, B), which are simultaneously similar to a pair of the form
λ α µ β , . Hence, V ⊂ C. Let W := {A ∈ (C2×2 ) : 2 tr A2 − (tr A)2 = 0} and 0 λ 0 µ S ⊂ W be defined as in the previous example. Define the following quasiirreducible varieties in (C2×2 )2 : X1 := (C2×2 )2 \U, X2 := U\C, X3 = C\V, X4 := V\(S × W ∪ W × S), X5 := S × (W\S), X6 := (W\S) × S, X7 = S × S.
Then dim X1 = 8, dim X2 = 7, dim X3 = 6, dim X4 = 5, dim X5 = dim X6 = 4, dim X7 = 2, and ∪i7=1 Xi is a stratification of (C2×2 )2 . 3. In the classical case of similarity classes in Cn×n , i.e., l = 0, it is possible to choose a fixed set of polynomial invariant functions as g j (A) = tr (A j ) for j = 1, . . . , n. However, we still have to p stratify Cn×n to ∪i =1 Xi , where each A ∈ Xi has some specific Jordan structures.
2410
Handbook of Linear Algebra
4. Consider the stratification C2×2 = X ∪ S as in Example 1. Clearly X and S are invariant under the action of GL(2, C). The invariant functions tr A, tr A2 determine uniquely orb ( A) on X . The Jordan canonical for of any A in X is either consists of two distinct Jordan blocks of order 1 or one Jordan block of order 2. The invariant function tr A determines orb (A) for any A ∈ S. It is possible to refine the stratification of C2×2 to three invariant components C2×2 \W, W\S, S, where W is defined in Example 2. Each component contains only matrices with one kind of Jordan block. On the first component, tr A, tr A2 determine the orbit, and on the second and third component, tr A determines the orbit. 5. To see the fundamental difference between similarity (l = 0) and simultaneous similarity l ≥ 1, it is suffice to consider Example 2. Observe first that the stratification of (C2×2 )2 = ∪i7=1 Xi is invariant under the action of GL(2, C). On X1 the five invariant polynomials tr A, tr A2 , tr B, tr B 2 , tr AB, which are algebraically independent, determine uniquely any orbit in X1 . Let (A = [ai j ], B = [bi j ]) ∈ X2 . Then A and B have a unique onedimensional common eigenspace corresponding to the eigenvalues λ1 , µ1 of A, B, respectively. Assume that a12 b21 − a21 b12 = 0. Define λ1 = α(A, B) := µ1 = α(B, A).
(b11 − b22 )a12 a21 + a22 a12 b21 − a11 a21 b12 , a12 b21 − a21 b12
Then tr A, tr B, α(A, B), α(B, A) are regular, algebraically independent, rational invariant functions on X2 , whose values determine orb ( A, B). Cl (orb (A, B)) contains an orbit generated by two diagonal matrices diag (λ1 , λ2 ) and diag (µ1 , µ2 ). Hence, C[X2 ]inv is generated by the five invariant polynomials tr A, tr A2 , tr B, tr B 2 , tr AB, which are algebraically dependent. Their values coincide exactly on two distinct orbits in X2 . On X3 the above invariant polynomials separate the orbits. λ 1 µ t Any (A = [ai j ], B = [bi j ]) ∈ X4 is simultaneously similar a unique pair of the form , . 0 λ 0 µ Then t = γ (A, B) := ab1212 . Thus, tr A, tr B, γ (A, B) are three algebraically independent regular rational invariant functions on X4 , whose values determine a unique orbit in X4 . Clearly (λI2 , µI2 ) ∈ Cl (X 4 ). Then C[X4 ]inv is generated by tr A, tr B. The values of tr A = 2λ, tr B = 2µ correspond to a complex line of orbits in X4 . Hence, the classification problem of simultaneous similarity classes in X4 or V is a wild problem. On X5 , X6 , X7 , the algebraically independent functions tr A, tr B determine the orbit in each of the stratum.
24.5
Simultaneous Similarity Classification II
In this section, we give an invariant stratification of (Cn×n )l +1 , for l ≥ 1, under the action of GL(n, C) and describe a set of invariant regular rational functions on each stratum, which separate the orbits up to a finite number. We assume the nontrivial case n > 1. It is conjectured that the continuous invariants of the given orbit determine uniquely the orbit on each stratum given in the Classification Theorem. Classification of simultaneous similarity classes of matrices is a known wild problem [GP69]. For another approach to classification of simultaneous similarity classes of matrices using Belitskii reduction see [Ser00]. See other applications of these techniques to classifications of linear systems [Fri85] and to canonical forms [Fri86]. Definitions: For A = (A0 , . . . , Al ), B = (B0 , . . . , Bl ) ∈ (Cn×n )l +1 let L (B, A) : Cn×n → (Cn×n )l +1 be the linear operator given by U → (B0 U − U A0 , . . . , Bl U − U Al ). Then L (B, A) is represented by the (l + 1)n2 × n2 matrix (In ⊗ B0T − A0 ⊗ In , . . . , In ⊗ BlT − Al ⊗ In )T , where U → (In ⊗ B0T − A0 ⊗ In , . . . , In ⊗ BlT − Al ⊗ In )T U . Let L (A) := L (A, A). The dimension of orb (A) is denoted by dim orb (A).
2411
Similarity of Families of Matrices
Let Sn := {A ∈ Cn×n : A =
tr A I } n n
be the variety of scalar matrices. Let
Mn,l +1,r := {A ∈ (Cn×n )l +1 : rank L (A) = r },
r = 0, 1, . . . , n2 − 1.
Facts: Most of the results in this section are given in [Fri83]. 1. For A = (A0 , . . . , Al ), ∈ (Cn×n )l +1 , dim orb (A) is equal to the rank of L (A). 2. Since any U ∈ Sn commutes with any B ∈ Cn×n it follows that ker L (A) ⊃ Sn . Hence, rank L (A) ≤ n2 − 1. 3. Mn,l +1,n2 −1 is a invariant quasiirreducible variety of dimension (l + 1)n2 , i.e., Cl (Mn,l +1,n2 −1 ) = (Cn×n )l +1 . The sets Mn,l +1,r , r = n2 − 2, . . . , 0 have the decomposition to invariant quasiirreducible varieties, each of dimension strictly less than (l + 1)n2 . 4. Let r ∈ [0, n2 − 1], A ∈ Mn,l +1,r , and B = T AT −1 . Then L (B, A) = diag (In ⊗ T, . . . , In ⊗ T )L (A)(In ⊗ T −1 ), rank L (B, A) = r and det L (B, A)[α, β] = 0 for any α ∈ Qr +1,(l +1)n2 , β ∈ Qr +1,n2 . (See Chapter 23.2) 5. Let X = (X 0 , . . . , X l ) ∈ (Cn×n )l +1 with the indeterminate entries X k = [xk,i j ] for k = 0, . . . , l . Each det L (X, A)[α, β], α ∈ Qr +1,(l +1)n2 , β ∈ Qr +1,n2 is a vector in Wn,l +1,r +1 , i.e., it is a multilinear polynomial in (l + 1)n2 variables of degree r + 1 at most. We identify det L (X, A)[α, β], α ∈ Qr +1,(l +1)n2 , β ∈ Qr +1,n2 with the row vector a(A, α, β) ∈ C N(n,l ,r ) given by its coefficients in the 2 2 n . Let R(A) ∈ basis e1 , . . . , e N(n,l ,r ) . The number of these vectors is M(n, l , r ) := (l +1)n r +1 r +1 C M(n,l ,r )N(n,l ,r )×M(n,l ,r )N(n,l ,r ) be the matrix with the rows a(A, α, β), where the pairs (α, β) ∈ Qr +1,(l +1)n2 × Qr +1,n2 are listed in a lexicographical order. 6. All points on the orb (A) satisfy the following polynomial equations in C[(Cn×n )l +1 ]: det L (X, A)[α, β] = 0, for all α ∈ Qr +1,(l +1)n2 , β ∈ Qr +1,n2 .
(24.1)
Thus, the matrix R(A) determines the above variety. 7. If B = T AT −1 , then R(A) is row equivalent to R(B). To each orb (A) we can associate a unique reduced row echelon form F (A) ∈ C M(n,l ,r )N(n,l ,r )×M(n,l ,r )N(n,l ,r ) of R(A). (A) := rank R(A) is the number of linearly independent polynomials given in (24.1). Let I(A) = {(1, j1 ), . . . , ((A), j(A) )} ⊂ {1, . . . , (A)} × {1, . . . , N(n, l , r )} be the location of the pivots in the M(n, l , r ) × N(n, l , r ) matrix F (A) = [ f i j (A)]. That is, 1 ≤ j1 < . . . < j(A) ≤ N(n, l , r ), f i ji (A) = 1 for i = 1, . . . , (A) and f i j = 0 unless j ≥ i and i ∈ [1, (A)]. The nontrivial entries f i j (A) for j > i are rational functions in the entries of the l + 1 tuple A. Thus, F (B) = F (A) for B ∈ orb (A). The numbers r (A) := rank L (A), (A) and the set I(A) are called the discrete invariants of orb (A). The rational functions f i j (A), i = 1, . . . , (A), j = i + 1, . . . , N(n, l , r ) are called the continuous invariants of orb (A). 8. (Classification Theorem for Simultaneous Similarity) Let l ≥ 1, n ≥ 2 be integers. Fix an integer r ∈ [0, n2 − 1] and let M(n, l , r ), N(n, l , r ) be the integers defined as above. Let 0 ≤ ≤ min(M(n, l , r ), N(n, l , r )) and the set I = {(1, j1 ), . . . , (, j ) ⊂ {1, . . . , } × {1, . . . , N(n, l , r )}, 1 ≤ j1 < . . . < j ≤ N(n, l , r ) be given. Let Mn,l +1.r (, I) be the set of all A ∈ (Cn×n )l +1 such that rank L (A) = r , (A) = , and I(A) = I. Then Mn,l +1.r (, I) is invariant quasiirreducible variety under the action of GL(n, C). Suppose that Mn,l +1.r (, I) = ∅. Recall that for each A ∈ Mn,l +1.r (, I) the continuous invariants of A, which correspond to the entries f i j (A), i = 1, . . . , , j = i + 1, . . . , N(n, l , r ) of the reduced row echelon form of R(A), are regular rational invariant functions on Mn,l +1.r (, I). Then the values of the continuous invariants determine a finite number of orbits in Mn,l +1.r (, I). The quasiirreducible variety Mn,l +1.r (, I) decomposes uniquely as a finite union of invariant regular quasiirreducible varieties. The union of all these decompositions of Mn,l +1.r (, I) for all possible values r, , and the sets I gives rise to an invariant stratification of (Cn×n )l +1 .
2412
Handbook of Linear Algebra
References [Fri78] S. Friedland, Extremal eigenvalue problems, Bull. Brazilian Math. Soc. 9 (1978), 13–40. [Fri80] S. Friedland, Analytic similarities of matrices, Lectures in Applied Math., Amer. Math. Soc. 18 (1980), 43–85 (edited by C.I. Byrnes and C.F. Martin). [Fri81] S. Friedland, A generalization of the Motzkin–Taussky theorem, Lin. Alg. Appl. 36 (1981), 103–109. [Fri83] S. Friedland, Simultaneous similarity of matrices, Adv. Math., 50 (1983), 189–265. [Fri85] S. Friedland, Classification of linear systems, Proc. of A.M.S. Conf. on Linear Algebra and Its Role in Systems Theory, Contemp. Math. 47 (1985), 131–147. [Fri86] S. Friedland, Canonical forms, Frequency Domain and State Space Methods for Linear Systems, 115–121, edited by C.I. Byrnes and A. Lindquist, North Holland, Amsterdam, 1986. [Frixx] S. Friedland, Matrices, a book in preparation. [GB77] M.A. Gauger and C.I. Byrnes, Characteristic free, improved decidability criteria for the similarity problem, Lin. Multilin. Alg. 5 (1977), 153–158. [GP69] I.M. Gelfand and V.A. Ponomarev, Remarks on classification of a pair of commuting linear transformation in a finite dimensional vector space, Func. Anal. Appl. 3 (1969), 325–326. [GR65] R. Gunning and H. Rossi, Analytic Functions of Several Complex Variables, PrenticeHall, Upper Saddle River, NJ, 1965. [Gur80] R.M. Guralnick, A note on the localglobal principle for similarity of matrices, Lin. Alg. Appl. 30 (1980), 651–654. [MM64] M. Marcus and H. Minc, A Survey of Matrix Theory and Matrix Inequalities, Prindle, Weber & Schmidt, Boston, 1964. [MF80] N. Moiseyev and S. Friedland, The association of resonance states with incomplete spectrum of finite complex scaled Hamiltonian matrices, Phys. Rev. A 22 (1980), 619–624. [MT52] T.S. Motzkin and O. Taussky, Pairs of matrices with property L, Trans. Amer. Math. Soc. 73 (1952), 108–114. [MT55] T.S. Motzkin and O. Taussky, Pairs of matrices with property L, II, Trans. Amer. Math. Soc. 80 (1955), 387–401. [Sha77] I.R. Shafarevich, Basic Algebraic Geometry, SpringerVerlag, BerlinNew York, 1977. [Ser00] V.V. Sergeichuk, Canonical matrices for linear matrix problems, Lin. Alg. Appl. 317 (2000), 53–102. [Was63] W. Wasow, On holomorphically similar matrices, J. Math. Anal. Appl. 4 (1963), 202–206. [Was77] W. Wasow, Arnold’s canonical matrices and asymptotic simplification of ordinary differential equations, Lin. Alg. Appl. 18 (1977), 163–170. [Was78] W. Wasow, Topics in Theory of Linear Differential Equations Having Singularities with Respect to a Parameter, IRMA, Univ. L. Pasteur, Strasbourg, 1978. [Wei67] K. Weierstrass, Zur theorie der bilinearen un quadratischen formen, Monatsch. Akad. Wiss. Berlin, 310–338, 1867.
25 MaxPlus Algebra Marianne Akian INRIA, France
Ravindra Bapat Indian Statistical Institute
´ Stephane Gaubert INRIA, France
25.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25.2 The Maximal Cycle Mean . . . . . . . . . . . . . . . . . . . . . . . . . . 25.3 The MaxPlus Eigenproblem . . . . . . . . . . . . . . . . . . . . . . . 25.4 Asymptotics of Matrix Powers . . . . . . . . . . . . . . . . . . . . . . 25.5 The MaxPlus Permanent . . . . . . . . . . . . . . . . . . . . . . . . . . 25.6 Linear Inequalities and Projections . . . . . . . . . . . . . . . . . 25.7 MaxPlus Linear Independence and Rank . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
251 254 256 258 259 2510 2512 2514
Maxplus algebra has been discovered more or less independently by several schools, in relation with various mathematical fields. This chapter is limited to finite dimensional linear algebra. For more information, the reader may consult the books [CG79], [Zim81], [CKR84], [BCOQ92], [KM97], [GM02], and [HOvdW06]. The collections of articles [MS92], [Gun98], and [LM05] give a good idea of current developments.
25.1
Preliminaries
Definitions: The maxplus semiring Rmax is the set R ∪ {−∞}, equipped with the addition (a, b) → max(a, b) and the multiplication (a, b) → a + b. The identity element for the addition, zero, is −∞, and the identity element for the multiplication, unit, is 0. To illuminate the linear algebraic nature of the results, the generic × (or concatenation), O 0 and 11 are used for the addition, the sum, the multiplication, the notations + +, Σ, × + b will mean max(a, b), a × ×b zero, and the unit of Rmax , respectively, so that when a, b belong to Rmax , a + or ab will mean the usual sum a + b. We use blackboard (double struck) fonts to denote the maxplus operations (compare “+ +” with “+”). The minplus semiring Rmin is the set R ∪ {+∞} equipped with the addition (a, b) → min(a, b) and the multiplication (a, b) → a + b. The zero is +∞, the unit 0. The name tropical is now also used essentially as a synonym of minplus. Properly speaking, it refers to the tropical semiring, which is the subsemiring of Rmin consisting of the elements in N ∪ {+∞}. The completed maxplus semiring Rmax is the set R ∪ {±∞} equipped with the addition (a, b) → max(a, b) and the multiplication (a, b) → a +b, with the convention that −∞+(+∞) = +∞+(−∞) = −∞. The completed minplus semiring, Rmin , is defined in a dual way. Many classical algebraic definitions have maxplus analogues. For instance, Rnmax is the set of nn× p is the set of n × p matrices with entries in Rmax . They are equipped dimensional vectors and Rmax with the vector and matrix operations, defined and denoted in the usual way. The n × p zero matrix, 0np or 0, has all its entries equal to O 0. The n × n identity matrix, In or I , has diagonal entries equal to 11, and 251
252
Handbook of Linear Algebra
n× p nondiagonal entries equal to O 0. Given a matrix A = (Ai j ) ∈ Rmax , we denote by Ai · and A· j the i th row p → Rnmax sending a vector x to Ax. and the j th column of A. We also denote by A the linear map Rmax Semimodules and subsemimodules over the semiring Rmax are defined as the analogues of modules and submodules over rings. A subset F of a semimodule M over Rmax spans M, or is a spanning family of M, if every element x of M can be expressed as a finite linear combination of the elements of F , meaning that 0 for all but finitely many x = Σf∈F λf .f, where (λf )f∈F is a family of elements of Rmax such that λf = O f ∈ F . A semimodule is finitely generated if it has a finite spanning family. The sets Rmax and Rmax are ordered by the usual order of R ∪ {±∞}. Vectors and matrices over Rmax are ordered with the product ordering. The supremum and the infimum operations are denoted by ∨ and ∧, respectively. Moreover, the sum of the elements of an arbitrary set X of scalars, vectors, or matrices with entries in Rmax is by definition the supremum of X. n×n + A+ + A2 + +···. If A ∈ Rmax , the Kleene star of A is the matrix A = I + The digraph (A) associated to an n × n matrix A with entries in Rmax consists of the vertices 1, . . . , n, 0. The weight of a walk W given by (i 1 , i 2 ), . . . , (i k−1 , i k ) with an arc from vertex i to vertex j when Ai j = O is W A := Ai 1 i 2 · · · Ai k−1 i k , and its length is W := k − 1. The matrix A is irreducible if (A) is strongly connected.
Facts: n×n
1. When A ∈ Rmax , the weight of a walk W = ((i 1 , i 2 ), . . . , (i k−1 , i k )) in (A) is given by the usual sum W A = Ai 1 i 2 + · · · + Ai k−1 i k , and Aij gives the maximal weight W A of a walk from vertex i n×n
2. 3. 4. 5.
to vertex j . One can also define the matrix A when A ∈ Rmin . Then, Aij is the minimal weight of a walk from vertex i to vertex j . Computing A is the same as the all pairs’ shortest path problem. n×n [CG79], [BCOQ92, Th. 3.20] If A ∈ Rmax and the weights of the cycles of (A) do not exceed 11, n−1 + A+ +···+ +A . then A = I + n×n n n [BCOQ92, Th. 4.75 and Rk. 80] If A ∈ Rmax and b ∈ Rmax , then the smallest x ∈ Rmax such that n + b, and it is given by A b. x = Ax + + b coincides with the smallest x ∈ Rmax such that x ≥ Ax + n×n n [BCOQ92, Th. 3.17] When A ∈ Rmax , b ∈ Rmax , and when all the cycles of (A) have a weight + b. strictly less than 11, then A b is the unique solution x ∈ Rnmax of x = Ax + n Let A ∈ Rn×n max and b ∈ Rmax . Construct the sequence: x0 = b, x1 = Ax0 + + b, x2 = Ax1 + + b, . . . .
The sequence xk is nondecreasing. If all the cycles of (A) have a weight less than or equal to 11, then, xn−1 = xn = · · · = A b. Otherwise, xn−1 = xn . Computing the sequence xk to determine A b is a special instance of label correcting shortest path algorithm [GP88]. n×n n× p p×n p× p 6. [BCOQ92, Lemma 4.101] For all a ∈ Rmax , b ∈ Rmax , c ∈ Rmax , and d ∈ Rmax , we have
a
b
c
d
=
a + + a b(c a b + + d) c a
a b(c a b + + d)
(c a b + + d) c a
(c a b + + d)
.
This fact and the next one are special instances of wellknown results of language theory [Eil74], concerning unambiguous rational identities. Both are valid in more general semirings. n×n 7. [MY60] Let A ∈ Rmax . Construct the sequence of matrices A(0) , . . . , A(n) such that A(0) = A and (k−1) (k−1) (k−1) Ai(k) + + Ai(k−1) (Akk ) Ak j , j = Ai j k
for i, j = 1, . . . , n and k = 1, . . . , n. Then, A(n) = A + + A2 + +···.
253
MaxPlus Algebra
Example: 1. Consider the matrix
A=
4
3
7
−∞
.
The digraph (A) is 3 1
4
2
7
We have
A = 2
10
7
11
10
.
For instance, A211 = A1· A·1 = [4 3][4 7]T = max(4 + 4, 3 + 7) = 10. This gives the maximal weight of a walk of length 2 from vertex 1 to vertex 1, which is attained by the walk (1, 2), (2, 1). Since there is one cycle with positive weight in (A) (for instance, the cycle (1, 1) has weight 4), and since A is irreducible, the matrix A has all its entries equal to +∞. To get a Kleene star with finite entries, consider the matrix
C = (−5)A =
−1
−2
2
−∞
.
The only cycles in (A) are (1, 1) and (1, 2), (2, 1) (up to a cyclic conjugacy). They have weights −1 and 0. Applying Fact 2, we get
C =I+ +C =
0
−2
2
0
.
Applications: 1. Dynamic programming. Consider a deterministic Markov decision process with a set of states {1, . . . , n} in which one player can move from state i to state j , receiving a payoff of Ai j ∈ R ∪{−∞}. To every state i , associate an initial payoff ci ∈ R ∪ {−∞} and a terminal payoff bi ∈ R ∪ {−∞}. The value in horizon k is by definition the maximum of the sums of the payoffs (including the initial and terminal payoffs) corresponding to all the trajectories consisting exactly of k moves. It is given by cAk b, where the product and the power are understood in the maxplus sense. The special case where the initial state is equal to some given m ∈ {1, . . . , n} (and where there is no initial payoff) can be modeled by taking c := em , the mth maxplus basis vector (whose entries are all equal to O 0, except the mth entry, which is equal to 11). The case where the final state is fixed can be represented in a dual way. Deterministic Markov decision problems (which are the same as shortest path problems) are ubiquitous in operations research, mathematical economics, and optimal control. 2. [BCOQ92] Discrete event systems. Consider a system in which certain repetitive events, denoted by 1, . . . , n, occur. To every event i is associated a dater function xi : Z → R, where xi (k) represents the date of the kth occurrence of event i . Precedence constraints between the repetitive events are given by a set of arcs E ⊂ {1, . . . , n}2 , equipped with two valuations ν : E → N and τ : E → R. If (i, j ) ∈ E , the kth execution of event i cannot occur earlier than τi j time units before the (k − νi j )th execution of event j , so that xi (k) ≥ max j : (i, j )∈E τi j + x j (k − νi j ). This can be rewritten, using the maxplus notation, as +···+ + Aν¯ x(k − ν¯ ), x(k) ≥ A0 x(k) +
254
Handbook of Linear Algebra
where ν¯ := max(i, j )∈E νi j and x(k) ∈ Rnmax is the vector with entries xi (k). Often, the dates xi (k) are only defined for positive k, then appropriate initial conditions must be incorporated in the model. One is particularly interested in the earliest dynamics, which, by Fact 3, is given by +···+ + A0 Aν¯ x(k− ν¯ ). The class of systems following dynamics of these forms x(k) = A0 A1 x(k−1) + is known in the Petri net literature as timed event graphs. It is used to model certain manufacturing systems [CDQV85], or transportation or communication networks [BCOQ92], [HOvdW06]. 3. N. Baca¨er [Bac03] observed that maxplus algebra appears in a familiar problem, crop rotation. Suppose n different crops can be cultivated every year. Assume for simplicity that the income of the year is a deterministic function, (i, j ) → Ai j , depending only on the crop i of the preceding year, and of the crop j of the current year (a slightly more complex model in which the income of the year depends on the crops of the two preceding years is needed to explain the historical variations of crop rotations [Bac03]). The income of a sequence i 1 , . . . , i k of crops can be written as ci 1 Ai 1 i 2 · · · Ai k−1 i k , where ci 1 is the income of the first year. The maximal income in k years is given 1, . . . , 11). We next show an example. by cAk−1 b, where b = (1 ⎡
−∞ 11
8
1
⎤
⎢ A=⎢ ⎣ 2
5
⎥ 7⎥ ⎦
2
6
4
8
2 11 5
2
2 7 6
3
4
Here, vertices 1, 2, and 3 represent fallow (no crop), wheat, and oats, respectively. (We put no arc from 1 to 1, setting A11 = −∞, to disallow two successive years of fallow.) The numerical values have no pretension to realism; however, the income of a year of wheat is 11 after a year of fallow, this is greater than after a year of cereal (5 or 6, depending on whether wheat or oats was cultivated). An initial vector coherent with these data may be c = [−∞ 11 8], meaning that the income of the first year is the same as the income after a year of fallow. We have cAb = 18, meaning that the optimal income in 2 years is 18. This corresponds to the optimal walk (2, 3), indicating that wheat and oats should be successively cultivated during these 2 years.
25.2
The Maximal Cycle Mean
Definitions: 1. The maximal cycle mean, ρmax (A), of a matrix A ∈ Rn×n max , is the maximum of the weighttolength ratio over all cycles c of (A), that is, ρmax (A) =
max
c cycle of (A)
c  A Ai i + · · · + Ai k i 1 = max max 1 2 . k≥1 i 1 ,... ,i k c  k
(25.1)
n×n 2. Denote by Rn×n + the set of real n × n matrices with nonnegative entries. For A ∈ R+ and p > 0, ( p) ( p) p A is by definition the matrix such that (A )i j = (Ai j ) , and
ρ p (A) := (ρ(A( p) ))1/ p , where ρ denotes the (usual) spectral radius. We also define ρ∞ (A) = lim p→+∞ ρ p (A). Facts: 1. [CG79], [Gau92, Ch. IV], [BSvdD95] Maxplus Collatz–Wielandt formula, I. Let A ∈ Rn×n max and λ ∈ R. The following assertions are equivalent: (i) There exists u ∈ Rn such that Au ≤ λu; (ii) ρmax (A) ≤ λ. It follows that ρmax (A) = infn max (Au)i / ui u∈R 1≤i ≤n
255
MaxPlus Algebra
(the product Au and the division by ui should be understood in the maxplus sense). If ρmax (A) > O 0, then this infimum is attained by some u ∈ Rn . If in addition A is irreducible, then Assertion (i) is equivalent to the following: (i’) there exists u ∈ Rnmax \ {0} such that Au ≤ λu. 2. [Gau92, Ch. IV], [BSvdD95] Maxplus Collatz–Wielandt formula, II. Let λ ∈ Rmax . The following assertions are equivalent: (i) There exists u ∈ Rnmax \ {0} such that Au ≥ λu; (ii) ρmax (A) ≥ λ. It follows that ρmax (A) =
max
min (Au)i / ui .
u∈Rnmax \{0} 1≤i ≤n ui =O0
3. [Fri86] For A ∈ Rn×n + , we have ρ∞ (A) = exp(ρmax (log(A))), where log is interpreted entrywise. 4. [KO85] For all A ∈ Rn×n + , and 1 ≤ q ≤ p ≤ ∞, we have ρ p (A) ≤ ρq (A). , we have 5. For all A, B ∈ Rn×n + ρ(A ◦ B) ≤ ρ p (A)ρq (B)
p, q ∈ [1, ∞]
for all
such that
1 1 + = 1. p q
This follows from the classical Kingman’s inequality [Kin61], which states that the map log ◦ρ ◦ exp is convex (exp is interpreted entrywise). We have in particular ρ(A ◦ B) ≤ ρ∞ (A)ρ(B). 6. [Fri86] For all A ∈ Rn×n + , we have ˆ ≤ ρ∞ (A)n, ρ∞ (A) ≤ ρ(A) ≤ ρ∞ (A)ρ( A) ˆ is the pattern matrix of A, that is, A ˆ i j = 1 if Ai j = 0 and Aˆ i j = 0 if Ai j = 0. where A n×n 7. [Bap98], [EvdD99] For all A ∈ R+ , we have limk→∞ (ρ∞ (Ak ))1/k = ρ(A). 8. [CG79] Computing ρmax (A) by linear programming. For A ∈ Rn×n max , ρmax (A) is the value of the linear program inf λ s.t. ∃u ∈ Rn ,
∀(i, j ) ∈ E ,
Ai j + u j ≤ λ + ui ,
where E = {(i, j )  1 ≤ i, j ≤ n, Ai j = O 0} is the set of arcs of (A). 9. Dual linear program to compute ρmax (A). Let C denote the set of nonnegative vectors x = (xi j )(i, j )∈E such that ∀1 ≤ i ≤ n,
xki =
1≤k≤n, (k,i )∈E
xi j ,
and
1≤ j ≤n,(i, j )∈E
xi j = 1.
(i, j )∈E
To every cycle c of (A) corresponds bijectively the extreme point of the polytope C that is given by
xi j = 1/c  if (i, j ) belongs to c , and xi j = 0 otherwise. Moreover, ρmax (A) = sup{ (i, j )∈E Ai j xi j  x ∈ C}. 10. [Kar78] Karp’s formula. If A ∈ Rn×n max is irreducible, then, for all 1 ≤ i ≤ n, ρmax (A) = max min
1≤ j ≤n 1≤k≤n Ainj =O0
(An )i j − (An−k )i j . k
(25.2)
To evaluate the righthand side expression, compute the sequence u0 = ei , u1 = u0 A, un = un−1 A, so that uk = Aik· for all 0 ≤ k ≤ n. This takes a time O(nm), where m is the number of arcs of (A). One can avoid storing the vectors u0 , . . . , un , at the price of recomputing the sequence u0 , . . . , un−1 once un is known. The time and space complexity of Karp’s algorithm are O(nm) and O(n), respectively. The policy iteration algorithm of [CTCG+ 98] seems experimentally more efficient than Karp’s algorithm. Other algorithms are given in particular in [CGL96], [BO93], and [EvdD99]. A comparison of maximal cycle mea