SPACES OF MATRICES WITH SEVERAL ZERO EIGENVALUES
|
|
- Phyllis Neal
- 5 years ago
- Views:
Transcription
1 SPACES OF MATRICES WITH SEVERAL ZERO EIGENVALUES M. D. ATKINSON Let V be an w-dimensional vector space over some field F, \F\ ^ n, and let SC be a space of linear mappings from V into itself {SC ^ Horn (V, V)) with the property that every mapping has at least r zero eigenvalues. If r = 0 this condition is vacuous but if r = 1 it states that SC is a space of singular mappings; in this case Flanders [1] has shown that dim#"^n(n 1) and that if dim #" = n(n 1) then either SC = Hom(K, U) for some (n l)-dimensional subspace U of V or there exists vev,v ^0 such that SC - {X e Horn {V, V): vx = 0}. At the other extreme r = n, the case of nilpotent mappings, a theorem of Gerstenhaber [2] states that dim SC ^ n(n -1) and that if dim SC = $n(n -1) then SC is the full algebra of strictly lower triangular matrices (with respect to some suitable basis of V). In this paper we intend to derive similar results for a general value of r thereby providing some common ground for the above theorems. The condition on the cardinal of F plays an important role in our proofs although we do not know whether it is essential to the theorems. Flanders required also the constraint char F ^ 2 at one point in his proof; we do not require this and in fact our type of argument allows thefieldin Flanders' theorem to have arbitrary characteristic. THEOREM 1. Let V be an n-dimensional vector space over somefieldf, \F\ ^ n, and let SC be a subspace o/hom (V, V). Suppose that every mapping in SC has at least r zero eigenvalues. Then dim^t ^ %r(r Proof. Gerstenhaber's theorem proves our result in the case n r = 0 and pro vides the first step of an induction on M r. Assume now that n > r > 0 and that the theorem holds for spaces whose transformations all have more than r zero eigenvalues. Since \r(r+l) + n{n r 1) < \r{r l) + n(n r) we can suppose that SC contains a transformation with precisely r zero eigenvalues. By an appropriate choice of basis for V we may take this to be (represented by) A " A = 0 with Ay an rxr nilpotent matrix and A 2 non-singular. By taking A x in rational canonical form we may take it to be strictly lower triangular. From now on we shall ( J K\ I partitioned so that J is an r x r matrix. M NJ Consider any matrix BeSC of the form [ n 1. For all a e F [ n mt A J 3 \0 NJ \ 0 N + aa 2 J has at least r zero eigenvalues and, except for at most n r eigenvalues of A2~ l N,N + %A 2 is non-singular. Hence for all but at most n r values of a, J + <xa, is Received 24 May, [BULL. LONDON MATH. SOC, 12 (1980), 89-95]
2 90 M. D. ATKINSON nilpotent. However the coefficients of the characteristic polynomial of J + cnay are polynomials in a which, since A x is singular, are of degree at most r 1. The nonleading coefficients of the characteristic polynomial all vanish for at least r values of a (since F ^ n) and so are identically zero i.e. J + CLA^ is nilpotent for all a and in particular J is nilpotent. Let / be the space of nilpotent rxr matrices which arise in this way; then dim / < %r(r 1). Let J,,..., J, be a basis for / and consider the r 2 1-vectors l pq whosefc-th component is (J k ) pq. Since t ^ %r{r 1) we may choose a set L of %r{r 1) index pairs (p, q) such that {l P q ' (P> <l) e L] spans the space generated by all the l pq. Let U be the complementary set of 2 r (>* + l) index pairs. Then every rxr matrix J may be written uniquely as J = J L + J V where {Ji) pq = 0if{p,q)eU and {J v ) pq = 0 if (p, q) e L. By the choice of L we have the condition J e J and J L = 0 implies J = 0, or equivalently $C and J L = 0 implies J v = 0. (*) By expressing each matrix of 9C in the form I L^, u.. I we may define a linear \ M NJ map $ on 9C by + Jy K\ 0 fj L 0 Then, by (*), -{( " " ) e SC \v& the kernel of 0. Let Clearly dim SC = dim range (0) + dim kernel {(/>) ^ dim $ + dim ^ + dim Jf + dim X < ir(r -1)+ («-r) 2 +dim ^T +dim Jf and the proof will be completed when we have shown that dim M + dim X ^ r{n r). To do this we shall construct a non-singular bilinear form 6: j/ rn _ r x s/ n. rr -> F where ^>n _ r, ^n- r, r denote the full spaces of r x (n r), {n r)xr matrices over F and show that 6 vanishes on X x Ji. This will prove that ^# is contained in the annihilator of X which has dimension r(n r) dim X, giving dim Ji ^ r{n r) dim X as required. '0 Consider any matrices KeX,M ejf. Then there exist Y = I I = 0> i; ) e 5" ( J H\ = (x.j) e 9C. Since A" + a/1 + /5Y has at least r zero eigenvalues for all
3 SPACES OF MATRICES WITH SEVERAL ZERO EIGENVALUES 91 a, j3 the coefficient of a"" r " l pa r " l in det {X + aa + p Y- XI) is zero (see [2] p. 615). The total coefficient of A*"" 1 in this determinant is (apart from a sign) the sum of all (w-r + l)-rowed principal minors of X + aa + fiyand we require the coefficient of a"" 1 "" 1 /? in this sum. Consider a typical one of these minors If N'+uA'j where J' + OLA\ is the principal submatrix of X + a.a + /? Ywhose rows are indexed by the set S {1, 2,..., r) and N' + aa' 2 is the principal submatrix whose rows are indexed by the set T {r + l,...,n} and where \S u T\ = n r + 1. By direct calculation the coefficient of a"" 1 " 1 /? in this minor is, to within a sign, Z ij e S s,re T c ij D styitx sj where (C y ) is the matrix of cofactors of A^ and (D st ) is the matrix of cofactors of A' 2. We shall express such a coefficient as where x = (x xx x x x ) and Z is an r{n r)x r(n r) matrix whose entries depend upon (C, v ) and (D st ). If \S\ > 1 then, since A\ is strictly lower triangular, C y = Ofor i,j e S,i ^ j and the matrix Z then has the form /0 with zeros above the diagonal and where each diagonal 0 represents an (n r) x (n r) matrix of zeros. If \S\ = \, say S = {i}, then \T\ = n-r, C n = 1 and {D st ) = E is the matrix of cofactors of A 2. In this case the matrix Z has the form 0 0
4 92 M. D. ATKINSON where each diagonal block is an (n r) x (n r) matrix, E is the i-th diagonal block and there are zeros elsewhere. Summing over all appropriate S, T we obtain the coefficient of a n ~ r ~ x flx r ~ l in the form yzx 1 where Z = and has zeros above the diagonal. Since A 2 is non-singular so also is E and thus Z is non-singular. This matrix Z defines our non-singular bilinear form vanishing on Jf x M and so completes the proof of the theorem. In the next theorem we consider the case where dim SC is maximal and determine the possibilities for SC. We first prove LEMMA. Let V be an n-dimensional vector space over somefieldf, \F\ ^ n, and let SCbea subspace of'horn (V', V). Suppose that W t and W 2 are ^-invariant subspaces ofv such that. (i) dim W i = s lt dim V/W 2 = s 2, dim W l r\w 2 = t, (ii) SC induces spaces ofnilpotent mappings in each of W t and V/W 2i (iii) every transformation in SC has at least r zero eigenvalues. Then dim 3C < \r{r -1) + n(n - r) - {s x - t){n -s 2-1). Proof W t + W 2 has dimension dim W x + dim W 2 dim Wj n W 2 = s l +n s 2 t and we may choose a basis of it having the form e lv> e t> fl>""> fsi-t> Q\i " 9n-n-t such that e lt..., e t is a basis for W x r\ W 2, e x,..., e t, f lt..., f S]. t is a basis for W ly and e lt... t e ti g lt... i g n _ n _ t is a basis for W 2. We complete this to a basis of V with hi,-.., h S2 _ sl+t. With respect to this basis each transformation of SC has matrix N, ) A x N A 2 0 B 0 N, and N 2 are nilpotent t x t and (s x t) x (s t -^ t) matrices since SC restricted to W x is a space of nilpotent mappings. JV 3 is a nilpotent (s 2 s t +t)x {s 2 s l +1) matrix since SC induces nilpotent transformations on V/{W i + W 2 ). Since the whole matrix has at least r zero eigenvalues the (n s 2 t)x(n-s 2 -t) matrix B has at least r s 2 t zero
5 SPACES OF MATRICES WITH SEVERAL ZERO EIGENVALUES 93 eigenvalues. Now, by Theorem 1, the space of all I * I has dimension at most \Ai N 2 J 1), the space of all matrices N 3 has dimension at most and the space of all matrices B has dimension at most Hr-s 2 -t){r-s 2 -t-l) + (n-s 2 -t)(n-r). A routine calculation now shows that dim SC < \r(r -1) + n(n - r) - (s x - t){n -s 2 -t). THEOREM 2. Let V be an n-dimensional vector space over some field F, \F\ ^ n, and let SC be a subspace of Horn (V, V). Suppose that every mapping in 9C has at least r zero eigenvalues and that SC has dimension precisely \r(r l) + n(n r). Then V contains SEinvariant subspaces V lt V 2 with V^ ^ V 2 and dim V x +dim V/V 2 = r and such that S operates on each of V^ and V/V 2 as the full algebra of strictly lower triangular matrices (with respect to suitable bases). Moreover the subspaces V l, V 2 are uniquely determined by 3C unless r = n. Proof. We continue to use the machinery and notation A, L, U, (j), f, M, Jf, tf, 6 introduced in the proof of Theorem 1. From n-r) = dim 3C < dim J^ + dim JT + dim Ji + dimjt we obtain dimj^ = ^r(r-l), dim^k = (n-r) 2, dim Jl + dim X = r{n-r) and M, Jf are the full annihilators of each other with respect to the bilinear form 9. Moreover, identifying S with < I I: L e if > etc., we have range(0) = 2 e Jt e jr. l\ / J In particular range(0) contains a matrix ( I and so SC contains a matrix. This latter matrix is similar to I J and so we could have taken this matrix as our matrix A to begin with. Let us suppose that this had been done. With this choice of A the bilinear form ( 0(1/, V) is easily seen to be tr(uv). H J\»,»r) be any matrix in SC and consider the characteristic M NJ polynomial det (X + aa-xl). In this polynomial the coefficients of
6 94 M. D. ATKINSON cc"~ r, OL n ~ r k,...,<x n ~ r k r ~ l are all zero and are plainly equal to the coefficients of X, X,..., k r ~ l in det (H-XI). Thus H is nilpotent. Let Jf be the space of matrices H arising in this way. Then %r(r 1) = dim S ^ dim 2tf ^ \r{j 1) by Gerstenhaber's theorem and so dim Jf = /-(r-l). By Gerstenhaber's theorem again M may be reduced to the full algebra of strictly lower triangular matrices with a similarity matrix (T 0\ 7. Therefore by transforming SC by the similarity matrix I I we can take Jf to be the full algebra of strictly lower triangular matrices. Having done this we may compute the coefficient of a"~ r ~ 1 A r ~ 1 in det (X + aa-xi). This yields tr (JM) = 0. (H K\ Consider any matrix Y=[ I in SC. Then for all MtM there exists N 0 A 1 e 9C and we have tr (JM) = 0 and, since Y+Ze%, tr ((K + J)M) = 0. Hence tr (KM) = 0 and K is in the annihilator of Jt with respect to 6 i.e. K e X. Hence contains ( ) for all strictly lower triangular H and all N. Now we show that either every matrix in SC has first row zero or that every matrix in X has r-th column zero. Suppose that this is not so, in which case we may find some matrix X = (x u ) which has neither first row nor r-th column zero, say x ly x,- r ^ 0 for some i,7 > r. As shown above #" contains also the matrix I I where H has ones in the (t + l,t) position, t 1, 2,..., r, and zeros elsewhere and N is any matrix with a single one in every row and column except for the i-th row and j-th column and zeros elsewhere. But then x^x,,. is the coefficient of a"" 2 in det (X + aw) and so is zero since r ^ 1, a contradiction. In terms of matrices the existence part of the theorem asserts that the matrices of SC are simultaneously similar to matrices where L y, L 2 are strictly lower triangular matrices of degrees r {, r 2 with r t + r 2 = r. We can now prove this statement by induction taking as an inductive hypothesis that the statement is true for smaller values of n and all appropriate values ofr. In the case where the matrices of SC have zero first row we consider the space of (n 1) x (n 1) matrices SC obtained by deleting the first row and first column. It is clear that each matrix of SC has at least r 1 zero eigenvalues and hence ^ %r-\){r-2) + {n-\){n-r). On the other hand from the definition of SC, $* dim^-(n-l) = Hr-l){r-2) + {n-l)(n-r). Thus equality holds and the inductive hypothesis can be applied to St. Hence, for some non-singular (n -1) x (n -1) matrix T the matrices of T~ X SCT have the form
7 SPACES OF MATRICES WITH SEVERAL ZERO EIGENVALUES 95 with L\, L 2 strictly lower triangular of degree r x 1, r 2 and r x 1 + r 2 = r 1. But then taking S = I I the matrices of S~ 1 %'S have the required form. In the case where the matrices of 9C have zero r-th column we use a similar argument taking St to be the space obtained by deleting the r-th row and r-th column from the matrices of SC. Finally, returning to the language of vector spaces and linear mappings, suppose that U x, U 2 are two subspaces of V which have all the stated properties of V X,V 2. Let W x = U x + V x, W 2 = U 2 n F 2,dim W x = s Xi dim V/W 2 = s 2,dim W x n W 2 = t. Then SC induces nilpotent mappings in both W x and V/W 2 and therefore 2C, W x, W 2 satisfy all the conditions of the lemma. It follows that ir(r -1) + n{n - r) ^ \r(r -1) + n{n - r) - (s x - t)(n -s 2-1). But (s 1 t)(n s 2 t) is non-negative and so is zero. Hence s x = tor n = s 2 + t. From s x = t it follows that W x < W 2 i.e. U x + V x ^ U 2 n V 2 and hence U x = V x, U 2 = V 2 since otherwise all transformations in 9 would have more than r zero eigenvalues, contradicting Theorem 1. From n = s 2 + tit follows that W 2 ^ W x and SC is a space of nilpotent matrices i.e. r = n. References 1. H. Flanders, "On spaces of linear transformations with bounded rank", J. London Math. Soc, 37 (1962), M. Gerstenhaber, "On nilalgebras and linear varieties of nilp&tent matrices I", Amer. J. Math., 80 (1958), Department of Computing Mathematics, University College, Cardiff.
The Maximum Dimension of a Subspace of Nilpotent Matrices of Index 2
The Maximum Dimension of a Subspace of Nilpotent Matrices of Index L G Sweet Department of Mathematics and Statistics, University of Prince Edward Island Charlottetown, PEI C1A4P, Canada sweet@upeica J
More informationPRIMITIVE SPACES OF MATRICES OF BOUNDED RANK.II
/. Austral. Math. Soc. (Series A) 34 (1983), 306-315 PRIMITIVE SPACES OF MATRICES OF BOUNDED RANK.II M. D. ATKINSON (Received 18 December 1981) Communicated by D. E. Taylor Abstract The classification
More informationThe Jordan Canonical Form
The Jordan Canonical Form The Jordan canonical form describes the structure of an arbitrary linear transformation on a finite-dimensional vector space over an algebraically closed field. Here we develop
More informationSolution. That ϕ W is a linear map W W follows from the definition of subspace. The map ϕ is ϕ(v + W ) = ϕ(v) + W, which is well-defined since
MAS 5312 Section 2779 Introduction to Algebra 2 Solutions to Selected Problems, Chapters 11 13 11.2.9 Given a linear ϕ : V V such that ϕ(w ) W, show ϕ induces linear ϕ W : W W and ϕ : V/W V/W : Solution.
More informationSpectral inequalities and equalities involving products of matrices
Spectral inequalities and equalities involving products of matrices Chi-Kwong Li 1 Department of Mathematics, College of William & Mary, Williamsburg, Virginia 23187 (ckli@math.wm.edu) Yiu-Tung Poon Department
More informationDeterminants Chapter 3 of Lay
Determinants Chapter of Lay Dr. Doreen De Leon Math 152, Fall 201 1 Introduction to Determinants Section.1 of Lay Given a square matrix A = [a ij, the determinant of A is denoted by det A or a 11 a 1j
More informationKernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman
Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu
More informationMATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS
MATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS There will be eight problems on the final. The following are sample problems. Problem 1. Let F be the vector space of all real valued functions on
More informationCommuting nilpotent matrices and pairs of partitions
Commuting nilpotent matrices and pairs of partitions Roberta Basili Algebraic Combinatorics Meets Inverse Systems Montréal, January 19-21, 2007 We will explain some results on commuting n n matrices and
More informationLinear Operators Preserving the Numerical Range (Radius) on Triangular Matrices
Linear Operators Preserving the Numerical Range (Radius) on Triangular Matrices Chi-Kwong Li Department of Mathematics, College of William & Mary, P.O. Box 8795, Williamsburg, VA 23187-8795, USA. E-mail:
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
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 informationChapter 4. Matrices and Matrix Rings
Chapter 4 Matrices and Matrix Rings We first consider matrices in full generality, i.e., over an arbitrary ring R. However, after the first few pages, it will be assumed that R is commutative. The topics,
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
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 informationRing Theory Problems. A σ
Ring Theory Problems 1. Given the commutative diagram α A σ B β A σ B show that α: ker σ ker σ and that β : coker σ coker σ. Here coker σ = B/σ(A). 2. Let K be a field, let V be an infinite dimensional
More informationInfinite-Dimensional Triangularization
Infinite-Dimensional Triangularization Zachary Mesyan March 11, 2018 Abstract The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector
More informationBare-bones outline of eigenvalue theory and the Jordan canonical form
Bare-bones outline of eigenvalue theory and the Jordan canonical form April 3, 2007 N.B.: You should also consult the text/class notes for worked examples. Let F be a field, let V be a finite-dimensional
More informationJORDAN NORMAL FORM. Contents Introduction 1 Jordan Normal Form 1 Conclusion 5 References 5
JORDAN NORMAL FORM KATAYUN KAMDIN Abstract. This paper outlines a proof of the Jordan Normal Form Theorem. First we show that a complex, finite dimensional vector space can be decomposed into a direct
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 informationNONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction
NONCOMMUTATIVE POLYNOMIAL EQUATIONS Edward S Letzter Introduction My aim in these notes is twofold: First, to briefly review some linear algebra Second, to provide you with some new tools and techniques
More informationarxiv: v1 [math.rt] 7 Oct 2014
A direct approach to the rational normal form arxiv:1410.1683v1 [math.rt] 7 Oct 2014 Klaus Bongartz 8. Oktober 2014 In courses on linear algebra the rational normal form of a matrix is usually derived
More informationBare minimum on matrix algebra. Psychology 588: Covariance structure and factor models
Bare minimum on matrix algebra Psychology 588: Covariance structure and factor models Matrix multiplication 2 Consider three notations for linear combinations y11 y1 m x11 x 1p b11 b 1m y y x x b b n1
More informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More informationMATHEMATICS 217 NOTES
MATHEMATICS 27 NOTES PART I THE JORDAN CANONICAL FORM The characteristic polynomial of an n n matrix A is the polynomial χ A (λ) = det(λi A), a monic polynomial of degree n; a monic polynomial in the variable
More informationG1110 & 852G1 Numerical Linear Algebra
The University of Sussex Department of Mathematics G & 85G Numerical Linear Algebra Lecture Notes Autumn Term Kerstin Hesse (w aw S w a w w (w aw H(wa = (w aw + w Figure : Geometric explanation of the
More informationChapter Two Elements of Linear Algebra
Chapter Two Elements of Linear Algebra Previously, in chapter one, we have considered single first order differential equations involving a single unknown function. In the next chapter we will begin to
More informationA proof of the Jordan normal form theorem
A proof of the Jordan normal form theorem Jordan normal form theorem states that any matrix is similar to a blockdiagonal matrix with Jordan blocks on the diagonal. To prove it, we first reformulate it
More informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More informationLINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD. To Professor Wolfgang Schmidt on his 75th birthday
LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD JAN-HENDRIK EVERTSE AND UMBERTO ZANNIER To Professor Wolfgang Schmidt on his 75th birthday 1. Introduction Let K be a field
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 informationThe Cayley-Hamilton Theorem and the Jordan Decomposition
LECTURE 19 The Cayley-Hamilton Theorem and the Jordan Decomposition Let me begin by summarizing the main results of the last lecture Suppose T is a endomorphism of a vector space V Then T has a minimal
More information1.10 Matrix Representation of Graphs
42 Basic Concepts of Graphs 1.10 Matrix Representation of Graphs Definitions: In this section, we introduce two kinds of matrix representations of a graph, that is, the adjacency matrix and incidence matrix
More informationMATH 2030: EIGENVALUES AND EIGENVECTORS
MATH 2030: EIGENVALUES AND EIGENVECTORS Determinants Although we are introducing determinants in the context of matrices, the theory of determinants predates matrices by at least two hundred years Their
More informationCOMMUTATIVE/NONCOMMUTATIVE RANK OF LINEAR MATRICES AND SUBSPACES OF MATRICES OF LOW RANK
Séminaire Lotharingien de Combinatoire 52 (2004), Article B52f COMMUTATIVE/NONCOMMUTATIVE RANK OF LINEAR MATRICES AND SUBSPACES OF MATRICES OF LOW RANK MARC FORTIN AND CHRISTOPHE REUTENAUER Dédié à notre
More informationFirst we introduce the sets that are going to serve as the generalizations of the scalars.
Contents 1 Fields...................................... 2 2 Vector spaces.................................. 4 3 Matrices..................................... 7 4 Linear systems and matrices..........................
More informationOn Euclidean distance matrices
On Euclidean distance matrices R. Balaji and R. B. Bapat Indian Statistical Institute, New Delhi, 110016 November 19, 2006 Abstract If A is a real symmetric matrix and P is an orthogonal projection onto
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 informationSums of diagonalizable matrices
Linear Algebra and its Applications 315 (2000) 1 23 www.elsevier.com/locate/laa Sums of diagonalizable matrices J.D. Botha Department of Mathematics University of South Africa P.O. Box 392 Pretoria 0003
More informationSOME REMARKS ON LINEAR SPACES OF NILPOTENT MATRICES
LE MATEMATICHE Vol. LIII (1998) Supplemento, pp. 2332 SOME REMARKS ON LINEAR SPACES OF NILPOTENT MATRICES ANTONIO CAUSA - RICCARDO RE - TITUS TEODORESCU Introduction. In this paper we study linear spaces
More informationDeterminants of Partition Matrices
journal of number theory 56, 283297 (1996) article no. 0018 Determinants of Partition Matrices Georg Martin Reinhart Wellesley College Communicated by A. Hildebrand Received February 14, 1994; revised
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 informationLinear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.
Linear Algebra M1 - FIB Contents: 5 Matrices, systems of linear equations and determinants 6 Vector space 7 Linear maps 8 Diagonalization Anna de Mier Montserrat Maureso Dept Matemàtica Aplicada II Translation:
More informationControl Systems. Linear Algebra topics. L. Lanari
Control Systems Linear Algebra topics L Lanari outline basic facts about matrices eigenvalues - eigenvectors - characteristic polynomial - algebraic multiplicity eigenvalues invariance under similarity
More information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More informationSOLOMON'S DESCENT ALGEBRA REVISITED M. D. ATKINSON
SOLOMON'S DESCENT ALGEBRA REVISITED M. D. ATKINSON ABSTRACT Starting from a non-standard definition, the descent algebra of the symmetric group is investigated. Homomorphisms into the tensor product of
More informationENGR-1100 Introduction to Engineering Analysis. Lecture 21
ENGR-1100 Introduction to Engineering Analysis Lecture 21 Lecture outline Procedure (algorithm) for finding the inverse of invertible matrix. Investigate the system of linear equation and invertibility
More informationMath 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008
Math 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008 Exam 2 will be held on Tuesday, April 8, 7-8pm in 117 MacMillan What will be covered The exam will cover material from the lectures
More informationMatrices and Linear Algebra
Contents Quantitative methods for Economics and Business University of Ferrara Academic year 2017-2018 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationRANK-WIDTH AND WELL-QUASI-ORDERING OF SKEW-SYMMETRIC OR SYMMETRIC MATRICES
RANK-WIDTH AND WELL-QUASI-ORDERING OF SKEW-SYMMETRIC OR SYMMETRIC MATRICES SANG-IL OUM Abstract. We prove that every infinite sequence of skew-symmetric or symmetric matrices M, M 2,... over a fixed finite
More information1 Determinants. 1.1 Determinant
1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to
More informationMatrix Algebra Determinant, Inverse matrix. Matrices. A. Fabretti. Mathematics 2 A.Y. 2015/2016. A. Fabretti Matrices
Matrices A. Fabretti Mathematics 2 A.Y. 2015/2016 Table of contents Matrix Algebra Determinant Inverse Matrix Introduction A matrix is a rectangular array of numbers. The size of a matrix is indicated
More informationProblems in Linear Algebra and Representation Theory
Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific
More informationLinear Algebra 1. M.T.Nair Department of Mathematics, IIT Madras. and in that case x is called an eigenvector of T corresponding to the eigenvalue λ.
Linear Algebra 1 M.T.Nair Department of Mathematics, IIT Madras 1 Eigenvalues and Eigenvectors 1.1 Definition and Examples Definition 1.1. Let V be a vector space (over a field F) and T : V V be a linear
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 information1182 L. B. Beasley, S. Z. Song, ands. G. Lee matrix all of whose entries are 1 and =fe ij j1 i m 1 j ng denote the set of cells. The zero-term rank [5
J. Korean Math. Soc. 36 (1999), No. 6, pp. 1181{1190 LINEAR OPERATORS THAT PRESERVE ZERO-TERM RANK OF BOOLEAN MATRICES LeRoy. B. Beasley, Seok-Zun Song, and Sang-Gu Lee Abstract. Zero-term rank of a matrix
More informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
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 information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More information642:550, Summer 2004, Supplement 6 The Perron-Frobenius Theorem. Summer 2004
642:550, Summer 2004, Supplement 6 The Perron-Frobenius Theorem. Summer 2004 Introduction Square matrices whose entries are all nonnegative have special properties. This was mentioned briefly in Section
More informationThe Cyclic Decomposition of a Nilpotent Operator
The Cyclic Decomposition of a Nilpotent Operator 1 Introduction. J.H. Shapiro Suppose T is a linear transformation on a vector space V. Recall Exercise #3 of Chapter 8 of our text, which we restate here
More informationMath 554 Qualifying Exam. You may use any theorems from the textbook. Any other claims must be proved in details.
Math 554 Qualifying Exam January, 2019 You may use any theorems from the textbook. Any other claims must be proved in details. 1. Let F be a field and m and n be positive integers. Prove the following.
More informationLinear and Bilinear Algebra (2WF04) Jan Draisma
Linear and Bilinear Algebra (2WF04) Jan Draisma CHAPTER 3 The minimal polynomial and nilpotent maps 3.1. Minimal polynomial Throughout this chapter, V is a finite-dimensional vector space of dimension
More informationPOLYNOMIAL EQUATIONS OVER MATRICES. Robert Lee Wilson. Here are two well-known facts about polynomial equations over the complex numbers
POLYNOMIAL EQUATIONS OVER MATRICES Robert Lee Wilson Here are two well-known facts about polynomial equations over the complex numbers (C): (I) (Vieta Theorem) For any complex numbers x,..., x n (not necessarily
More informationARITHMETICALLY COHEN-MACAULAY BUNDLES ON THREE DIMENSIONAL HYPERSURFACES
ARITHMETICALLY COHEN-MACAULAY BUNDLES ON THREE DIMENSIONAL HYPERSURFACES N. MOHAN KUMAR, A. P. RAO, AND G. V. RAVINDRA Abstract. We prove that any rank two arithmetically Cohen- Macaulay vector bundle
More informationNOTES ON BILINEAR FORMS
NOTES ON BILINEAR FORMS PARAMESWARAN SANKARAN These notes are intended as a supplement to the talk given by the author at the IMSc Outreach Programme Enriching Collegiate Education-2015. Symmetric bilinear
More informationTwo-boundary lattice paths and parking functions
Two-boundary lattice paths and parking functions Joseph PS Kung 1, Xinyu Sun 2, and Catherine Yan 3,4 1 Department of Mathematics, University of North Texas, Denton, TX 76203 2,3 Department of Mathematics
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
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 informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
More informationMTH 309 Supplemental Lecture Notes Based on Robert Messer, Linear Algebra Gateway to Mathematics
MTH 309 Supplemental Lecture Notes Based on Robert Messer, Linear Algebra Gateway to Mathematics Ulrich Meierfrankenfeld Department of Mathematics Michigan State University East Lansing MI 48824 meier@math.msu.edu
More informationIntegral Similarity and Commutators of Integral Matrices Thomas J. Laffey and Robert Reams (University College Dublin, Ireland) Abstract
Integral Similarity and Commutators of Integral Matrices Thomas J. Laffey and Robert Reams (University College Dublin, Ireland) Abstract Let F be a field, M n (F ) the algebra of n n matrices over F and
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More informationMATH SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER Given vector spaces V and W, V W is the vector space given by
MATH 110 - SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER 2009 GSI: SANTIAGO CAÑEZ 1. Given vector spaces V and W, V W is the vector space given by V W = {(v, w) v V and w W }, with addition and scalar
More informationNotes on the matrix exponential
Notes on the matrix exponential Erik Wahlén erik.wahlen@math.lu.se February 14, 212 1 Introduction The purpose of these notes is to describe how one can compute the matrix exponential e A when A is not
More informationHomework 6 Solutions. Solution. Note {e t, te t, t 2 e t, e 2t } is linearly independent. If β = {e t, te t, t 2 e t, e 2t }, then
Homework 6 Solutions 1 Let V be the real vector space spanned by the functions e t, te t, t 2 e t, e 2t Find a Jordan canonical basis and a Jordan canonical form of T on V dened by T (f) = f Solution Note
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationimplies that if we fix a basis v of V and let M and M be the associated invertible symmetric matrices computing, and, then M = (L L)M and the
Math 395. Geometric approach to signature For the amusement of the reader who knows a tiny bit about groups (enough to know the meaning of a transitive group action on a set), we now provide an alternative
More informationMatrix Theory. A.Holst, V.Ufnarovski
Matrix Theory AHolst, VUfnarovski 55 HINTS AND ANSWERS 9 55 Hints and answers There are two different approaches In the first one write A as a block of rows and note that in B = E ij A all rows different
More informationA NOTE ON THE JORDAN CANONICAL FORM
A NOTE ON THE JORDAN CANONICAL FORM H. Azad Department of Mathematics and Statistics King Fahd University of Petroleum & Minerals Dhahran, Saudi Arabia hassanaz@kfupm.edu.sa Abstract A proof of the Jordan
More informationFORBIDDEN MINORS FOR THE CLASS OF GRAPHS G WITH ξ(g) 2. July 25, 2006
FORBIDDEN MINORS FOR THE CLASS OF GRAPHS G WITH ξ(g) 2 LESLIE HOGBEN AND HEIN VAN DER HOLST July 25, 2006 Abstract. For a given simple graph G, S(G) is defined to be the set of real symmetric matrices
More informationM.6. Rational canonical form
book 2005/3/26 16:06 page 383 #397 M.6. RATIONAL CANONICAL FORM 383 M.6. Rational canonical form In this section we apply the theory of finitely generated modules of a principal ideal domain to study the
More informationOn families of anticommuting matrices
On families of anticommuting matrices Pavel Hrubeš December 18, 214 Abstract Let e 1,..., e k be complex n n matrices such that e ie j = e je i whenever i j. We conjecture that rk(e 2 1) + rk(e 2 2) +
More informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
More informationARCS IN FINITE PROJECTIVE SPACES. Basic objects and definitions
ARCS IN FINITE PROJECTIVE SPACES SIMEON BALL Abstract. These notes are an outline of a course on arcs given at the Finite Geometry Summer School, University of Sussex, June 26-30, 2017. Let K denote an
More information1.4 Solvable Lie algebras
1.4. SOLVABLE LIE ALGEBRAS 17 1.4 Solvable Lie algebras 1.4.1 Derived series and solvable Lie algebras The derived series of a Lie algebra L is given by: L (0) = L, L (1) = [L, L],, L (2) = [L (1), L (1)
More informationNEW CONSTRUCTION OF THE EAGON-NORTHCOTT COMPLEX. Oh-Jin Kang and Joohyung Kim
Korean J Math 20 (2012) No 2 pp 161 176 NEW CONSTRUCTION OF THE EAGON-NORTHCOTT COMPLEX Oh-Jin Kang and Joohyung Kim Abstract The authors [6 introduced the concept of a complete matrix of grade g > 3 to
More informationSelected exercises from Abstract Algebra by Dummit and Foote (3rd edition).
Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Bryan Félix Abril 12, 217 Section 11.1 Exercise 6. Let V be a vector space of finite dimension. If ϕ is any linear transformation
More informationInterlacing Inequalities for Totally Nonnegative Matrices
Interlacing Inequalities for Totally Nonnegative Matrices Chi-Kwong Li and Roy Mathias October 26, 2004 Dedicated to Professor T. Ando on the occasion of his 70th birthday. Abstract Suppose λ 1 λ n 0 are
More informationMATRICES ARE SIMILAR TO TRIANGULAR MATRICES
MATRICES ARE SIMILAR TO TRIANGULAR MATRICES 1 Complex matrices Recall that the complex numbers are given by a + ib where a and b are real and i is the imaginary unity, ie, i 2 = 1 In what we describe below,
More informationDeterminants. Beifang Chen
Determinants Beifang Chen 1 Motivation Determinant is a function that each square real matrix A is assigned a real number, denoted det A, satisfying certain properties If A is a 3 3 matrix, writing A [u,
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
More informationTHE MINIMAL POLYNOMIAL AND SOME APPLICATIONS
THE MINIMAL POLYNOMIAL AND SOME APPLICATIONS KEITH CONRAD. Introduction The easiest matrices to compute with are the diagonal ones. The sum and product of diagonal matrices can be computed componentwise
More informationDeterminants: Introduction and existence
Math 5327 Spring 2018 Determinants: Introduction and existence In this set of notes I try to give the general theory of determinants in a fairly abstract setting. I will start with the statement of the
More informationMath 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
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 information18.S34 linear algebra problems (2007)
18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction
More informationANOTHER CLASS OF INVERTIBLE OPERATORS WITHOUT SQUARE ROOTS
ANTHER CLASS F INVERTIBLE PERATRS WITHUT SQUARE RTS DN DECKARD AND CARL PEARCY 1. Introduction. In [2], Halmos, Lumer, and Schäffer exhibited a class of invertible operators on Hubert space possessing
More information