Complementary bases in symplectic matrices and a proof that their determinant is one
|
|
- Giles Harmon
- 6 years ago
- Views:
Transcription
1 Linear Algebra and its Applications 419 (2006) Complementary bases in symplectic matrices and a proof that their determinant is one Froilán M. Dopico a,, Charles R. Johnson b a Departamento de Matemáticas, Universidad Carlos III de Madrid, Avda. de la Universidad, 30, Leganés, Madrid, pain b Department of Mathematics, The College of William and Mary, Williamsburg, VA , UA Received 27 July 2004; accepted 13 June 2006 Available online 4 August 2006 ubmitted by V. Mehrmann Abstract New results on the patterns of linearly independent rows and columns among the blocks of a symplectic matrix are presented. These results are combined with the block structure of the inverse of a symplectic matrix, together with some properties of chur complements, to give a new and elementary proof that the determinant of any symplectic matrix is +1. The new proof is valid for any field. Information on the zero patterns compatible with the symplectic structure is also presented Elsevier Inc. All rights reserved. AM classification: 15A15; 15A03; 15A09; 15A57 Keywords: Complementary bases; Determinant; Patterns of linearly independent rows and columns; Patterns of zeros; chur complements; ymplectic The research of F.M. Dopico was partially supported by the Ministerio de Educación y Ciencia of pain through grant BFM , and by the PRICIT Program of the Comunidad de Madrid through IMUMAT Project (Grant -0505/EP/0158). The research of C.R. Johnson was partially carried out during a visit to the Universidad Carlos III de Madrid in November 2003, supported by the Ph.D. Program of Ingeniería Matemática. Corresponding author. addresses: dopico@math.uc3m.es (F.M. Dopico), crjohnso@math.wm.edu (C.R. Johnson) /$ - see front matter ( 2006 Elsevier Inc. All rights reserved. doi: /j.laa
2 1. Introduction F.M. Dopico, C.R. Johnson / Linear Algebra and its Applications 419 (2006) Let I n denote the n-by-n identity matrix and J the 2n-by-2n matrix 0 In J :=. I n 0 J is an orthogonal, skew-symmetric matrix, so that J 1 = J T = J. Definition 1.1. A2n-by-2n matrix with entries in the field K is called symplectic, or J -orthogonal, if T J = J. The group of the symplectic matrices is a relevant class of matrices both from a pure mathematical point of view [9], and from the point of view of applications. For instance, the symplectic matrices play an important role in classical mechanics and Hamiltonian dynamical systems [1,2]. Moreover, the symplectic matrices appear in the linear control theory for discrete-time systems [4,10]. Notice that the symplectic matrices represent the isometries of the skew-symmetric bilinear form defined by J, i.e., x,y =x T Jy, where x and y are 2n-by-1 column vectors. If the field K is C, one can also consider the sesquilinear form x,y =x Jy, where x is the conjugate transpose of x. In this case, the isometries correspond to those matrices such that J = J. These matrices are called conjugate symplectic matrices 1 in the literature [3,7]. We will not deal explicitly with conjugate symplectic matrices, however we will remark in the proper places that some of the presented results remain also valid for these matrices. The following properties are very easily proved from Definition 1.1: the product of two symplectic matrices is also symplectic; if is symplectic then 1 and T are symplectic; and λ K is an eigenvalue of if and only if λ 1 K is an eigenvalue of. Definition 1.1 and the multiplicativity of the determinant imply directly that det =±1. However, the determinant of a symplectic matrix is, actually, always +1, for any field K. If the elements of the field K can be considered complex numbers (for instance if K is the field of real numbers or the field of rational numbers), the property det =+1 is equivalent to the fact that if 1isan eigenvalue of a symplectic matrix then its algebraic multiplicity is even. Also, it is equivalent to the fact that if +1 is an eigenvalue of a symplectic matrix then its algebraic multiplicity is also even. These two properties can be seen as follows: notice that = J 1 T J. This means that if λ/= λ 1 is an eigenvalue of, then λ 1 is also an eigenvalue of with the same algebraic multiplicity as λ. Taking into account that the dimension of is even, the sum of the algebraic multiplicities of +1 and 1 (if some of them is an eigenvalue) is even. Moreover det() = ( 1) a, where a is the algebraic multiplicity of 1. It has long been known that the determinant of any symplectic matrix is +1, but no proof seems entirely elementary. This has been recognized by several authors. Let us quote, for instance, the following paragraph from [9]: It is somewhat nontrivial to prove that the determinant itself is +1, and we will accomplish this by expressing the condition for a matrix to be symplectic in terms of a differential form Another proof may be found in Arnold [2]. 1 The matrices satisfying J = J and having complex entries are also frequently called in the literature complex symplectic matrices [6]. We do not use this name, because it may produce confusion when compared with Definition 1.1 in the case K = C.
3 774 F.M. Dopico, C.R. Johnson / Linear Algebra and its Applications 419 (2006) Or from the very recent work [8]: The aim of this essay is to shine some light on this unexpected result (det() =+1) from various angles, hoping to demystify it to some degree. Our purpose here is to give a straightforward matrix theoretical proof that det =+1 when is symplectic, but in the process, we give new information about the patterns of linearly independent rows and columns among the blocks of a symplectic matrix. We refer to these relationships as the complementary bases theorem. The essential ingredients of our work are very simple: basic properties of chur complements and the special block structure of the inverse of a symplectic matrix. One essential difference between the proof we present for det =+1 and those presented in [2,8,9], is that the new proof looks at the elements of the matrix, while the others pay attention to factorization properties of the symplectic group, or to other more abstract properties of symplectic matrices. 2. Preliminary results In this section, we summarize some well-known basic results that will be used later on. Moreover, an extremely elementary proof of the determinant of certain symplectic matrices being one is presented. Unfortunately, this proof is not valid for an arbitrary symplectic matrix, but it is one of the fundamental ideas in our work. Recall [5, ection 0.7.3, p. 18] that if an m-by-m invertible matrix A is partitioned as A11 A A =, A 21 A 22 in which A 11 is nonsingular, and if A 1 B11 B = B 21 B 22 is partitioned conformally, we then have that B 22 is nonsingular, and B 1 22 = A 22 A 21 A 1 11 A, i.e., B 1 22 is the chur complement of A 11 in A. Therefore deta = deta 11 det[a 22 A 21 A 1 11 A ] = det A 11. (1) det B 22 On the other hand, any 2n-by-2n matrix is naturally thought of in partitioned form 11 =, (2) in which 11 is n-by-n and we shall fix and refer to this partition throughout. A matrix so partitioned is symplectic if and only if [ T 1 = 22 T ] 21 T 11 T. (3) This is easily proven: Definition 1.1 implies that is symplectic if and only if 1 = J 1 T J = J T J. Then some trivial block manipulations lead to the result above.
4 F.M. Dopico, C.R. Johnson / Linear Algebra and its Applications 419 (2006) Applying the determinantal formula (1), we quickly obtain that if a symplectic matrix has the block 11 nonsingular then det = det 11 det11 T = det 11 = 1. det 11 The fact that det =+1 may also be easily obtained whenever at least one of the four blocks in (2) is nonsingular: simply perform some row and/or column interchanges in (2) tomove the nonsingular block to the (1, 1)-position, and follow the track of these interchanges in the block expression of the inverse (3). Finally, (1) is applied to the resulting matrix. Let us explain with more detail this process in the specific case of being nonsingular and 11 being singular. Let P be the permutation matrix that interchanges in the jth column of 11 with the jth column of for all j {1,...,n}. Thus P has as its (1, 1)-block, and (P ) 1 = P T 1 has T as its (2, 2)-block, because P T interchanges the corresponding rows of 1. Eq. (1) implies that det(p ) = det /det( ) = ( 1) n. Our claim follows from the fact that det(p ) = ( 1) n det. The case 21 being nonsingular can be dealt with in the same way, interchanging rows of instead of columns. Finally, if one wants to move 22 to the (1, 1)-block position, both rows and columns have to be interchanged. This is the simplest case because no sign changes appear. Unfortunately, the following example shows that there exist symplectic matrices having the four blocks singular: In the next section, the notion of complementary bases is introduced. This idea allows us to relax the restriction of at least one of the blocks being nonsingular in the above proof, making it entirely general. To finish this section, let us comment that for conjugate symplectic matrices, i.e., those fulfilling J = J, the inverse of has the structure appearing in (3), but replacing transpose by conjugate transpose matrices. Thus, in this case, (1) leads to det = det 11 det 11, which is not necessarily +1, but necessarily on the unit circle. 3. The complementary bases theorem The main new result in this work is easily described in partitioned form in the next theorem. In this theorem, α denotes the cardinality of a set α. Moreover the binary variables p and q can take as values 1 or 2, and p and q denote, respectively, the complementary variables of p and q. Theorem 3.1. Let be a 2n-by-2n symplectic matrix partitioned as in (2). uppose that rank ( pq ) = k, p, q {1, 2}, and that the rows (columns) of pq indexed( by α, ) α {1,...,n} and α =k, are linearly independent. Then the rows (columns) of p q pq indexed by α, the complement of α, together with the rows (columns) αof pq constitute a basis of K n, i.e., they constitute a nonsingular n-by-n matrix. The fact that certain rows (columns) from one block, together with complementary rows (columns) from another constitute a basis is the motivation for the name we have chosen. In fact,
5 776 F.M. Dopico, C.R. Johnson / Linear Algebra and its Applications 419 (2006) Theorem 3.1 gathers eight different results: one for rows and the other for columns for each of the four blocks. As an specific illustration of the complementary bases result, let us consider a symplectic matrix with rank 11 = 2, 11 =[a 1,a 2,a 3,a 4,a 5 ], and =[b 1,b 2,b 3,b 4,b 5 ], where a i and b j denote columns. Assume that {a 1,a 4 } is a linearly independent set of columns, then the complementary bases result states that the 5 5 matrix [a 1,b 2,b 3,a 4,b 5 ] is nonsingular. It should be noticed that is nonsingular. Therefore, the n-by-2n matrix [ 11 ] has rank equal to n, and also has n linearly independent columns. The complementary bases theorem specifies, for symplectic matrices, a very particular set of n independent columns by using complementarity. This phenomenon need not occur within a general 2n-by-2n partitioned nonsingular matrix, as the reader can easily check by devising some examples. Proof of Theorem 3.1. We only need to prove the theorem in the column case p = 1 and q = 1. This result applied on the symplectic matrix J proves the column case p = 1 and q = 2. Once these two cases are proved, the other six cases follow from (2) and (3), and the fact that 1, T, and T are, all of them, symplectic matrices. We begin by selecting an n-by-n permutation matrix P to move the maximal linearly independent set of columns of 11 indexed by α to the first k positions. This is accomplished by multiplying on the right by the symplectic matrix P P to get the symplectic matrix : [ P 0 := = 11 ] 0 P (4) Let Y be the n-by-n nonsingular matrix such that Y 11 is a row reduced echelon matrix, and let us multiply on the left by the symplectic matrix Y Y T to get the symplectic matrix : [ Y 0 := 0 Y T 11 ] [ 11 ] = 21 22, where 11 = Ik Z and 0 0 = X11 X (5) X 21 X 22 are partitioned conformally. Obviously, the multiplication above does not change the relationships of linear independence among the columns of [ 11 ], therefore to prove the complementary bases theorem is equivalent to prove that the (n k)-by-(n k) matrix X 22 is nonsingular. Bearing in mind that is symplectic, its inverse has the block structure appearing in (3), then 0 = ( 1 ) = 11 T + T 11, and substituting (5), we get [ X11 X11 T + X Z T ZX T (X21 T + ZXT 22 ) ] X 21 + X 22 Z T = 0. 0 This implies X 21 = X 22 Z T. Any subset of rows of is linearly independent because is nonsingular. In particular all the rows of the submatrix [0 0X 21 X 22 ] are linearly independent, thus n k = rank[x 21 X 22 ]=rankx 22 [ Z T I]=rankX 22.
6 F.M. Dopico, C.R. Johnson / Linear Algebra and its Applications 419 (2006) An immediate corollary of the complementary bases theorem gives information on the patterns of zeros compatible with the symplectic structure: Corollary 3.2. Let be a 2n-by-2n symplectic matrix partitioned as in (2). uppose that the rows (columns) ( of) pq,p,q {1, 2}, indexed by β, β {1,...,n}, are zero. Then the rows (columns) of p q pq indexed by β are linearly independent. Proof. Every set of indices α considered in Theorem 3.1 is included in β. Then β is included in α. It should be noticed that Theorem 3.1 and Corollary 3.2 are valid for conjugate symplectic matrices. The statement of Theorem 3.1 suggests the following natural question: may the complementary ( ) bases theorem be extended to rows (columns) of pq and rows (columns) of pq p q? Notice, that this would mean eight additional results. However, the following example shows that this extension is not true. Let us consider the symplectic matrix The rank of the (1, 1)-block is obviously 1 and its second row constitutes a maximal linearly independent set of rows. However, the second row of the (1, 1)-block together with the first row of the (1, 2)-block do not constitute a nonsingular matrix. 4. A proof that the determinant of a symplectic matrix is one In this last section we prove, as a corollary of Theorem 3.1, the classical result which has motivated our work: Theorem 4.1. Let be a 2n-by-2n symplectic matrix with entries in any field K. Then det =+1. Proof. Let us consider again the partition (2) and assume that rank( 11 ) = k. Let us select as in (4) ann-by-n permutation matrix P to move a maximal linearly independent set of columns of 11 to the first k positions. Notice that = (P P) is symplectic and that det = det, because det(p P) = (detp) 2 = 1. From now on, we will focus on the matrix. Let us consider the following partition of the two upper blocks of : [ 11 ] =[E1 E 2 F 1 F 2 ], where E 1 and F 1 are n-by-k matrices, and E 2 and F 2 are n-by-(n k) matrices. Then, Theorem 3.1 implies that the n-by-n matrix [E 1 F 2 ] is nonsingular. Let Π j be the 2n-by-2n matrix that multiply by 1 the column j of 11, and then interchanges this column with the column j of. Therefore, Π j has determinant +1 and has the following block structure [ Q1 Q Π j = 2 Q 2 Q 1 ],
7 778 F.M. Dopico, C.R. Johnson / Linear Algebra and its Applications 419 (2006) where Q 1 is an n-by-n diagonal matrix with ones on the diagonal, except for a zero in the (j, j) position; and Q 2 has all the entries zero, except +1 in the (j, j) position. It can be trivially checked that Π j is symplectic. Then E1 F Π k+1 Π n = 2 is also symplectic, and, taking into account the structure of the inverse of a symplectic matrix (3), ( Π k+1 Π n ) 1 = E1 T. F T 2 Now, the determinantal formula (1) is applied to the matrix Π k+1 Π n : det Π k+1 Π n = det[e 1F 2 = det[e 1F 2 ] E T det 1 det[e 1 F 2 ] T = 1. F T 2 Finally, det Π k+1 Π n = det = det. Then det = 1. Acknowledgments The authors thank Prof. Alberto Ibort for many illuminating discussions on classical and not so classical proofs of the result det =+1. We also thank David Martínez for his careful explanation of a fully algebraic proof, without differential forms, using exterior algebra. Prof. Volker Mehrmann informed us of Ref. [8] after this work was presented in the GAMM Workshop on Applied and Numerical Linear Algebra (Hagen, July 2004), and we thank him for many enthusiastic and interesting discussions on the topics of Hamiltonian and symplectic matrices during the last two years. Finally, we sincerely thank the referees for their careful reading of the manuscript and for many helpful suggestions that have improved significantly the paper. References [1] R. Abraham, J. Marsden, Foundations of Mechanics, second ed., Addison-Wesley, Reading, [2] V.I. Arnold, Mathematical Methods in Classical Mechanics, pringer-verlag, Berlin, [3] A. Bunse-Gerstner, R. Byers, V. Mehrmann, A chart of numerical methods for structured eigenvalue problems, IAM J. Matrix Anal. Appl. 13 (2) (1992) [4] H. Fassbender, ymplectic Methods for the ymplectic Eigenproblem, Kluwer, New York, [5] R.A. Horn, C.R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, [6] W.-W. Lin, V. Mehrmann, H. Xu, Canonical forms for Hamiltonian and symplectic matrices and pencils, Linear Algebra Appl (1999) [7] D.. Mackey, N. Mackey, F. Tisseur, tructured tools for structured matrices, Electron. J. Linear Algebra 10 (2003) [8] D.. Mackey, N. Mackey, On the determinant of symplectic matrices, Numerical Analysis Report No. 422, Manchester Centre for Computational Mathematics, Manchester, England, [9] D. McDuff, D. alamon, Introduction to ymplectic Topology, Clarendon Press, Oxford, [10] V. Mehrmann, The Autonomous Linear Quadratic Control Problem Theory and Numerical olution, Lecture Notes in Control and Information ciences, vol. 163, pringer-verlag, Berlin, 1991.
Linear Algebra and its Applications
Linear Algebra and its Applications 430 (2009) 579 586 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Low rank perturbation
More information1. Introduction. Throughout this work we consider n n matrix polynomials with degree k of the form
LINEARIZATIONS OF SINGULAR MATRIX POLYNOMIALS AND THE RECOVERY OF MINIMAL INDICES FERNANDO DE TERÁN, FROILÁN M. DOPICO, AND D. STEVEN MACKEY Abstract. A standard way of dealing with a regular matrix polynomial
More informationELA
SHARP LOWER BOUNDS FOR THE DIMENSION OF LINEARIZATIONS OF MATRIX POLYNOMIALS FERNANDO DE TERÁN AND FROILÁN M. DOPICO Abstract. A standard way of dealing with matrixpolynomial eigenvalue problems is to
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationOn the Determinant of Symplectic Matrices
On the Determinant of Symplectic Matrices D. Steven Mackey Niloufer Mackey February 22, 2003 Abstract A collection of new and old proofs showing that the determinant of any symplectic matrix is +1 is presented.
More informationSpectrally arbitrary star sign patterns
Linear Algebra and its Applications 400 (2005) 99 119 wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics,
More informationMAPPING AND PRESERVER PROPERTIES OF THE PRINCIPAL PIVOT TRANSFORM
MAPPING AND PRESERVER PROPERTIES OF THE PRINCIPAL PIVOT TRANSFORM OLGA SLYUSAREVA AND MICHAEL TSATSOMEROS Abstract. The principal pivot transform (PPT) is a transformation of a matrix A tantamount to exchanging
More informationRow Space and Column Space of a Matrix
Row Space and Column Space of a Matrix 1/18 Summary: To a m n matrix A = (a ij ), we can naturally associate subspaces of K n and of K m, called the row space of A and the column space of A, respectively.
More informationChapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in
Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column
More informationPROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS
PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix
More informationSection 3.3. Matrix Rank and the Inverse of a Full Rank Matrix
3.3. Matrix Rank and the Inverse of a Full Rank Matrix 1 Section 3.3. Matrix Rank and the Inverse of a Full Rank Matrix Note. The lengthy section (21 pages in the text) gives a thorough study of the rank
More informationThe minimum rank of matrices and the equivalence class graph
Linear Algebra and its Applications 427 (2007) 161 170 wwwelseviercom/locate/laa The minimum rank of matrices and the equivalence class graph Rosário Fernandes, Cecília Perdigão Departamento de Matemática,
More informationNecessary And Sufficient Conditions For Existence of the LU Factorization of an Arbitrary Matrix.
arxiv:math/0506382v1 [math.na] 19 Jun 2005 Necessary And Sufficient Conditions For Existence of the LU Factorization of an Arbitrary Matrix. Adviser: Charles R. Johnson Department of Mathematics College
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
More informationFiedler Companion Linearizations and the Recovery of Minimal Indices. De Teran, Fernando and Dopico, Froilan M. and Mackey, D.
Fiedler Companion Linearizations and the Recovery of Minimal Indices De Teran, Fernando and Dopico, Froilan M and Mackey, D Steven 2009 MIMS EPrint: 200977 Manchester Institute for Mathematical Sciences
More informationChapter 2:Determinants. Section 2.1: Determinants by cofactor expansion
Chapter 2:Determinants Section 2.1: Determinants by cofactor expansion [ ] a b Recall: The 2 2 matrix is invertible if ad bc 0. The c d ([ ]) a b function f = ad bc is called the determinant and it associates
More information22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationLecture Notes in Linear Algebra
Lecture Notes in Linear Algebra Dr. Abdullah Al-Azemi Mathematics Department Kuwait University February 4, 2017 Contents 1 Linear Equations and Matrices 1 1.2 Matrices............................................
More informationSection 5.6. LU and LDU Factorizations
5.6. LU and LDU Factorizations Section 5.6. LU and LDU Factorizations Note. We largely follow Fraleigh and Beauregard s approach to this topic from Linear Algebra, 3rd Edition, Addison-Wesley (995). See
More informationk In particular, the largest dimension of the subspaces of block-symmetric pencils we introduce is n 4
LARGE VECTOR SPACES OF BLOCK-SYMMETRIC STRONG LINEARIZATIONS OF MATRIX POLYNOMIALS M. I. BUENO, F. M. DOPICO, S. FURTADO, AND M. RYCHNOVSKY Abstract. Given a matrix polynomial P (λ) = P k i=0 λi A i of
More informationABSOLUTELY FLAT IDEMPOTENTS
ABSOLUTELY FLAT IDEMPOTENTS JONATHAN M GROVES, YONATAN HAREL, CHRISTOPHER J HILLAR, CHARLES R JOHNSON, AND PATRICK X RAULT Abstract A real n-by-n idempotent matrix A with all entries having the same absolute
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationChapter 3. Determinants and Eigenvalues
Chapter 3. Determinants and Eigenvalues 3.1. Determinants With each square matrix we can associate a real number called the determinant of the matrix. Determinants have important applications to the theory
More informationSPECTRALLY ARBITRARY FACTORIZATION: THE NONDEROGATORY CASE. 1. Introduction
SPECTRALLY ARBITRARY FACTORIZATION: THE NONDEROGATORY CASE CHARLES R. JOHNSON AND YULIN ZHANG Dedicated to E.M.Sá Abstract. It is known that a nonsingular, nonscalar, n-by-n complex matrix A may be factored
More informationMatrix Inequalities by Means of Block Matrices 1
Mathematical Inequalities & Applications, Vol. 4, No. 4, 200, pp. 48-490. Matrix Inequalities by Means of Block Matrices Fuzhen Zhang 2 Department of Math, Science and Technology Nova Southeastern University,
More informationSection 3.2. Multiplication of Matrices and Multiplication of Vectors and Matrices
3.2. Multiplication of Matrices and Multiplication of Vectors and Matrices 1 Section 3.2. Multiplication of Matrices and Multiplication of Vectors and Matrices Note. In this section, we define the product
More informationOHSx XM511 Linear Algebra: Solutions to Online True/False Exercises
This document gives the solutions to all of the online exercises for OHSx XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Answers are in square brackets [. Lecture 02 ( 1.1)
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationRow and Column Distributions of Letter Matrices
College of William and Mary W&M ScholarWorks Undergraduate Honors Theses Theses, Dissertations, & Master Projects 5-2016 Row and Column Distributions of Letter Matrices Xiaonan Hu College of William and
More informationMatrix Algebra. Matrix Algebra. Chapter 8 - S&B
Chapter 8 - S&B Algebraic operations Matrix: The size of a matrix is indicated by the number of its rows and the number of its columns. A matrix with k rows and n columns is called a k n matrix. The number
More informationRepeated Eigenvalues and Symmetric Matrices
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationGeneralized Principal Pivot Transform
Generalized Principal Pivot Transform M. Rajesh Kannan and R. B. Bapat Indian Statistical Institute New Delhi, 110016, India Abstract The generalized principal pivot transform is a generalization of the
More informationChapter 2 Notes, Linear Algebra 5e Lay
Contents.1 Operations with Matrices..................................1.1 Addition and Subtraction.............................1. Multiplication by a scalar............................ 3.1.3 Multiplication
More informationQueens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.
Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 2018 8 Lecture 8 8.1 Matrices July 22, 2018 We shall study
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More informationCospectral graphs and the generalized adjacency matrix
Linear Algebra and its Applications 42 2007) 41 www.elsevier.com/locate/laa Cospectral graphs and the generalized adjacency matrix E.R. van Dam a,1, W.H. Haemers a,, J.H. Koolen b,2 a Tilburg University,
More informationACI-matrices all of whose completions have the same rank
ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices
More informationMATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam. Topics
MATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam This study sheet will not be allowed during the test Books and notes will not be allowed during the test Calculators and cell phones
More informationLinear Algebra: Lecture notes from Kolman and Hill 9th edition.
Linear Algebra: Lecture notes from Kolman and Hill 9th edition Taylan Şengül March 20, 2019 Please let me know of any mistakes in these notes Contents Week 1 1 11 Systems of Linear Equations 1 12 Matrices
More informationLinear Algebra. The analysis of many models in the social sciences reduces to the study of systems of equations.
POLI 7 - Mathematical and Statistical Foundations Prof S Saiegh Fall Lecture Notes - Class 4 October 4, Linear Algebra The analysis of many models in the social sciences reduces to the study of systems
More informationEE731 Lecture Notes: Matrix Computations for Signal Processing
EE731 Lecture Notes: Matrix Computations for Signal Processing James P. Reilly c Department of Electrical and Computer Engineering McMaster University September 22, 2005 0 Preface This collection of ten
More informationSolving Homogeneous Systems with Sub-matrices
Pure Mathematical Sciences, Vol 7, 218, no 1, 11-18 HIKARI Ltd, wwwm-hikaricom https://doiorg/112988/pms218843 Solving Homogeneous Systems with Sub-matrices Massoud Malek Mathematics, California State
More informationLinear Algebra. Linear Equations and Matrices. Copyright 2005, W.R. Winfrey
Copyright 2005, W.R. Winfrey Topics Preliminaries Systems of Linear Equations Matrices Algebraic Properties of Matrix Operations Special Types of Matrices and Partitioned Matrices Matrix Transformations
More information1. Introduction. Throughout this work we consider n n matrix polynomials with degree k 2 of the form
FIEDLER COMPANION LINEARIZATIONS AND THE RECOVERY OF MINIMAL INDICES FERNANDO DE TERÁN, FROILÁN M DOPICO, AND D STEVEN MACKEY Abstract A standard way of dealing with a matrix polynomial P (λ) is to convert
More informationSystems of Linear Equations
Systems of Linear Equations Math 108A: August 21, 2008 John Douglas Moore Our goal in these notes is to explain a few facts regarding linear systems of equations not included in the first few chapters
More informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University March 2, 2018 Linear Algebra (MTH 464)
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationAbsolute value equations
Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West
More informationReview of Linear Algebra
Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=
More informationMoore Penrose inverses and commuting elements of C -algebras
Moore Penrose inverses and commuting elements of C -algebras Julio Benítez Abstract Let a be an element of a C -algebra A satisfying aa = a a, where a is the Moore Penrose inverse of a and let b A. We
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More informationWhere is matrix multiplication locally open?
Linear Algebra and its Applications 517 (2017) 167 176 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Where is matrix multiplication locally open?
More informationThe skew-symmetric orthogonal solutions of the matrix equation AX = B
Linear Algebra and its Applications 402 (2005) 303 318 www.elsevier.com/locate/laa The skew-symmetric orthogonal solutions of the matrix equation AX = B Chunjun Meng, Xiyan Hu, Lei Zhang College of Mathematics
More informationGlossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB
Glossary of Linear Algebra Terms Basis (for a subspace) A linearly independent set of vectors that spans the space Basic Variable A variable in a linear system that corresponds to a pivot column in the
More informationChapter 2. Square matrices
Chapter 2. Square matrices Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/18 Invertible matrices Definition 2.1 Invertible matrices An n n matrix A is said to be invertible, if there is a
More informationarxiv:math/ v5 [math.ac] 17 Sep 2009
On the elementary symmetric functions of a sum of matrices R. S. Costas-Santos arxiv:math/0612464v5 [math.ac] 17 Sep 2009 September 17, 2009 Abstract Often in mathematics it is useful to summarize a multivariate
More informationOrthogonal similarity of a real matrix and its transpose
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 382 392 www.elsevier.com/locate/laa Orthogonal similarity of a real matrix and its transpose J. Vermeer Delft University
More informationUNDERSTANDING THE DIAGONALIZATION PROBLEM. Roy Skjelnes. 1.- Linear Maps 1.1. Linear maps. A map T : R n R m is a linear map if
UNDERSTANDING THE DIAGONALIZATION PROBLEM Roy Skjelnes Abstract These notes are additional material to the course B107, given fall 200 The style may appear a bit coarse and consequently the student is
More informationMAT Linear Algebra Collection of sample exams
MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More informationA SHORT SUMMARY OF VECTOR SPACES AND MATRICES
A SHORT SUMMARY OF VECTOR SPACES AND MATRICES This is a little summary of some of the essential points of linear algebra we have covered so far. If you have followed the course so far you should have no
More informationOnline Exercises for Linear Algebra XM511
This document lists the online exercises for XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Lecture 02 ( 1.1) Online Exercises for Linear Algebra XM511 1) The matrix [3 2
More informationTrades in complex Hadamard matrices
Trades in complex Hadamard matrices Padraig Ó Catháin Ian M. Wanless School of Mathematical Sciences, Monash University, VIC 3800, Australia. February 9, 2015 Abstract A trade in a complex Hadamard matrix
More informationMAT 2037 LINEAR ALGEBRA I web:
MAT 237 LINEAR ALGEBRA I 2625 Dokuz Eylül University, Faculty of Science, Department of Mathematics web: Instructor: Engin Mermut http://kisideuedutr/enginmermut/ HOMEWORK 2 MATRIX ALGEBRA Textbook: Linear
More informationFrame Diagonalization of Matrices
Frame Diagonalization of Matrices Fumiko Futamura Mathematics and Computer Science Department Southwestern University 00 E University Ave Georgetown, Texas 78626 U.S.A. Phone: + (52) 863-98 Fax: + (52)
More informationLectures on Linear Algebra for IT
Lectures on Linear Algebra for IT by Mgr. Tereza Kovářová, Ph.D. following content of lectures by Ing. Petr Beremlijski, Ph.D. Department of Applied Mathematics, VSB - TU Ostrava Czech Republic 11. Determinants
More informationHierarchical open Leontief models
Available online at wwwsciencedirectcom Linear Algebra and its Applications 428 (2008) 2549 2559 wwwelseviercom/locate/laa Hierarchical open Leontief models JM Peña Departamento de Matemática Aplicada,
More informationChapter 1: Systems of Linear Equations
Chapter : Systems of Linear Equations February, 9 Systems of linear equations Linear systems Lecture A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where
More informationComputationally, diagonal matrices are the easiest to work with. With this idea in mind, we introduce similarity:
Diagonalization We have seen that diagonal and triangular matrices are much easier to work with than are most matrices For example, determinants and eigenvalues are easy to compute, and multiplication
More informationIntroduction to Matrices
POLS 704 Introduction to Matrices Introduction to Matrices. The Cast of Characters A matrix is a rectangular array (i.e., a table) of numbers. For example, 2 3 X 4 5 6 (4 3) 7 8 9 0 0 0 Thismatrix,with4rowsand3columns,isoforder
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More informationELA
CONSTRUCTING COPOSITIVE MATRICES FROM INTERIOR MATRICES CHARLES R. JOHNSON AND ROBERT REAMS Abstract. Let A be an n by n symmetric matrix with real entries. Using the l -norm for vectors and letting S
More informationGENERALIZED MATRIX MULTIPLICATION AND ITS SOME APPLICATION. 1. Introduction
FACTA UNIVERSITATIS (NIŠ) Ser Math Inform Vol, No 5 (7), 789 798 https://doiorg/9/fumi75789k GENERALIZED MATRIX MULTIPLICATION AND ITS SOME APPLICATION Osman Keçilioğlu and Halit Gündoğan Abstract In this
More informationMATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product.
MATH 311-504 Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product. Determinant is a scalar assigned to each square matrix. Notation. The determinant of a matrix A = (a ij
More information2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian
FE661 - Statistical Methods for Financial Engineering 2. Linear algebra Jitkomut Songsiri matrices and vectors linear equations range and nullspace of matrices function of vectors, gradient and Hessian
More informationMATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.
MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. Elementary matrices Theorem 1 Any elementary row operation σ on matrices with n rows can be simulated as left multiplication
More informationNOTES on LINEAR ALGEBRA 1
School of Economics, Management and Statistics University of Bologna Academic Year 207/8 NOTES on LINEAR ALGEBRA for the students of Stats and Maths This is a modified version of the notes by Prof Laura
More informationEp Matrices and Its Weighted Generalized Inverse
Vol.2, Issue.5, Sep-Oct. 2012 pp-3850-3856 ISSN: 2249-6645 ABSTRACT: If A is a con s S.Krishnamoorthy 1 and B.K.N.MuthugobaI 2 Research Scholar Ramanujan Research Centre, Department of Mathematics, Govt.
More informationChapter 7. Linear Algebra: Matrices, Vectors,
Chapter 7. Linear Algebra: Matrices, Vectors, Determinants. Linear Systems Linear algebra includes the theory and application of linear systems of equations, linear transformations, and eigenvalue problems.
More informationMH1200 Final 2014/2015
MH200 Final 204/205 November 22, 204 QUESTION. (20 marks) Let where a R. A = 2 3 4, B = 2 3 4, 3 6 a 3 6 0. For what values of a is A singular? 2. What is the minimum value of the rank of A over all a
More informationEigenvalues and Eigenvectors: An Introduction
Eigenvalues and Eigenvectors: An Introduction The eigenvalue problem is a problem of considerable theoretical interest and wide-ranging application. For example, this problem is crucial in solving systems
More informationTwo applications of the theory of primary matrix functions
Linear Algebra and its Applications 361 (2003) 99 106 wwwelseviercom/locate/laa Two applications of the theory of primary matrix functions Roger A Horn, Gregory G Piepmeyer Department of Mathematics, University
More informationLinear Algebra Primer
Introduction Linear Algebra Primer Daniel S. Stutts, Ph.D. Original Edition: 2/99 Current Edition: 4//4 This primer was written to provide a brief overview of the main concepts and methods in elementary
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationMA 265 FINAL EXAM Fall 2012
MA 265 FINAL EXAM Fall 22 NAME: INSTRUCTOR S NAME:. There are a total of 25 problems. You should show work on the exam sheet, and pencil in the correct answer on the scantron. 2. No books, notes, or calculators
More informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
More informationReview of Matrices and Block Structures
CHAPTER 2 Review of Matrices and Block Structures Numerical linear algebra lies at the heart of modern scientific computing and computational science. Today it is not uncommon to perform numerical computations
More informationUniqueness of the Solutions of Some Completion Problems
Uniqueness of the Solutions of Some Completion Problems Chi-Kwong Li and Tom Milligan Abstract We determine the conditions for uniqueness of the solutions of several completion problems including the positive
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationStat 159/259: Linear Algebra Notes
Stat 159/259: Linear Algebra Notes Jarrod Millman November 16, 2015 Abstract These notes assume you ve taken a semester of undergraduate linear algebra. In particular, I assume you are familiar with the
More informationLinear Algebra. Solving Linear Systems. Copyright 2005, W.R. Winfrey
Copyright 2005, W.R. Winfrey Topics Preliminaries Echelon Form of a Matrix Elementary Matrices; Finding A -1 Equivalent Matrices LU-Factorization Topics Preliminaries Echelon Form of a Matrix Elementary
More information1. Let m 1 and n 1 be two natural numbers such that m > n. Which of the following is/are true?
. Let m and n be two natural numbers such that m > n. Which of the following is/are true? (i) A linear system of m equations in n variables is always consistent. (ii) A linear system of n equations in
More informationMath113: Linear Algebra. Beifang Chen
Math3: Linear Algebra Beifang Chen Spring 26 Contents Systems of Linear Equations 3 Systems of Linear Equations 3 Linear Systems 3 2 Geometric Interpretation 3 3 Matrices of Linear Systems 4 4 Elementary
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationUndergraduate Mathematical Economics Lecture 1
Undergraduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 15, 2014 Outline 1 Courses Description and Requirement 2 Course Outline ematical techniques used in economics courses
More informationLesson U2.1 Study Guide
Lesson U2.1 Study Guide Sunday, June 3, 2018 2:05 PM Matrix operations, The Inverse of a Matrix and Matrix Factorization Reading: Lay, Sections 2.1, 2.2, 2.3 and 2.5 (about 24 pages). MyMathLab: Lesson
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationEquality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.
Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read
More informationc i r i i=1 r 1 = [1, 2] r 2 = [0, 1] r 3 = [3, 4].
Lecture Notes: Rank of a Matrix Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk 1 Linear Independence Definition 1. Let r 1, r 2,..., r m
More information