ON THE CHARACTERISTIC POLYNOMIAL OF THE PRODUCT OF SEVERAL MATRICES

Similar documents
PAIRS OF MATRICES WITH PROPERTY L(0

Finite Mathematics Chapter 2. where a, b, c, d, h, and k are real numbers and neither a and b nor c and d are both zero.

The matrix will only be consistent if the last entry of row three is 0, meaning 2b 3 + b 2 b 1 = 0.

Matrix Arithmetic. j=1

Construction of latin squares of prime order

ON CONSTRUCTING NEARLY DECOMPOSABLE MATRICES D. J. HARTFIEL

EXERCISES. a b = a + b l aq b = ab - (a + b) + 2. a b = a + b + 1 n0i) = oii + ii + fi. A. Examples of Rings. C. Ring of 2 x 2 Matrices

Review of Basic Concepts in Linear Algebra

Chapter 3. Determinants and Eigenvalues

MATRICES AND MATRIX OPERATIONS

ON DIVISION ALGEBRAS*

Math 1314 Week #14 Notes

Prepared by: M. S. KumarSwamy, TGT(Maths) Page

Appendix C Vector and matrix algebra

a11 a A = : a 21 a 22

Basic Concepts in Linear Algebra

A matrix over a field F is a rectangular array of elements from F. The symbol

ON A PARTITION PROBLEM OF CANFIELD AND WILF. Departamento de Matemáticas, Universidad de los Andes, Bogotá, Colombia

Lemma 8: Suppose the N by N matrix A has the following block upper triangular form:

Matrix Algebra. Matrix Algebra. Chapter 8 - S&B

A CHARACTERIZATION OF INNER PRODUCT SPACES

THE GROUP OF UNITS OF SOME FINITE LOCAL RINGS I

NEW CONSTRUCTION OF THE EAGON-NORTHCOTT COMPLEX. Oh-Jin Kang and Joohyung Kim

0.1 Rational Canonical Forms

1 Matrices and Systems of Linear Equations. a 1n a 2n

Linear Algebra March 16, 2019

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 1982 NOTES ON MATRIX METHODS

Elementary maths for GMT

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

Chapter 1. Matrix Algebra

Rings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.

STABILIZATION BY A DIAGONAL MATRIX

10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections )

Subrings and Ideals 2.1 INTRODUCTION 2.2 SUBRING

Inverses and Elementary Matrices

TIGHT CLOSURE IN NON EQUIDIMENSIONAL RINGS ANURAG K. SINGH

Introduction to Matrices

3 Matrix Algebra. 3.1 Operations on matrices

Chapter 4. Matrices and Matrix Rings

Systems of Linear Equations and Matrices

ORIE 6300 Mathematical Programming I August 25, Recitation 1

An Extrapolated Gauss-Seidel Iteration

Topic 1: Matrix diagonalization

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations

Systems of Linear Equations and Matrices

THE LARGE CONDITION FOR RINGS WITH KRULL DIMENSION

Conjugacy classes of torsion in GL_n(Z)

MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.

Math113: Linear Algebra. Beifang Chen

The Maximum Dimension of a Subspace of Nilpotent Matrices of Index 2

ON THE EQUATION Xa=7X+/3 OVER AN ALGEBRAIC DIVISION RING

MAT 2037 LINEAR ALGEBRA I web:

Linear Systems and Matrices

Linear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.

Bounds for the Representations of Integers by Positive Quadratic Forms

6.1 Matrices. Definition: A Matrix A is a rectangular array of the form. A 11 A 12 A 1n A 21. A 2n. A m1 A m2 A mn A 22.

LINEAR SYSTEMS AND MATRICES

THREE LECTURES ON QUASIDETERMINANTS

Computer Investigation of Difference Sets

Eighth Homework Solutions

ON RESTRICTED SYSTEMS OF HIGHER INDETERMINATE EQUATIONS * E. T. BELL

F. T. HOWARD AND CURTIS COOPER

On Systems of Diagonal Forms II

Matrices. Chapter What is a Matrix? We review the basic matrix operations. An array of numbers a a 1n A = a m1...

Section 9.2: Matrices. Definition: A matrix A consists of a rectangular array of numbers, or elements, arranged in m rows and n columns.

This paper was published in Connections in Discrete Mathematics, S. Butler, J. Cooper, and G. Hurlbert, editors, Cambridge University Press,

Section 19 Integral domains

RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA

A COMPARISON THEOREM FOR ELLIPTIC DIFFERENTIAL EQUATIONS

MODULES OVER RINGS OF WORDS

Basic Linear Algebra in MATLAB

The Infinity Norm of a Certain Type of Symmetric Circulant Matrix

Matrix Algebra: Introduction

Strongly Nil -Clean Rings

Applied Matrix Algebra Lecture Notes Section 2.2. Gerald Höhn Department of Mathematics, Kansas State University

ISOMORPHIC POLYNOMIAL RINGS

REGULAR P.I.-RINGS E. P. ARMENDARIZ AND JOE W. FISHER

Introduction to Matrix Algebra

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

ON DIRECT PRODUCT MATRICESf

A NEW GENERAL SERIES OF BALANCED INCOMPLETE BLOCK DESIGNS

Numerical Analysis Lecture Notes

1 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 )

CS100: DISCRETE STRUCTURES. Lecture 3 Matrices Ch 3 Pages:

RINGS WITH RESTRICTED MINIMUM CONDITION

Ma 227 Review for Systems of DEs

Review of Vectors and Matrices

Introduction to Matrices

arxiv: v1 [math.ra] 22 Apr 2014

Throughout these notes we assume V, W are finite dimensional inner product spaces over C.

Chapter 1 Vector Spaces

Linear Algebra and Matrix Inversion

Lecture 7: Vectors and Matrices II Introduction to Matrices (See Sections, 3.3, 3.6, 3.7 and 3.9 in Boas)

A CHANGE OF RINGS THEOREM

McCoy Rings Relative to a Monoid

MATHEMATICS. IMPORTANT FORMULAE AND CONCEPTS for. Final Revision CLASS XII CHAPTER WISE CONCEPTS, FORMULAS FOR QUICK REVISION.

A primer on matrices

ELEMENTARY LINEAR ALGEBRA

Matrix Algebra Determinant, Inverse matrix. Matrices. A. Fabretti. Mathematics 2 A.Y. 2015/2016. A. Fabretti Matrices

Lecture 3 Linear Algebra Background

Transcription:

ON THE CHARACTERISTIC POLYNOMIAL OF THE PRODUCT OF SEVERAL MATRICES We shall prove two theorems. WILLIAM E. ROTH Theorem I. If A is an nxn matrix with elements in the field F, if R and 5<, * = 1, 2,, r, are IX«matrices with elements in F, and Di==RTSi, where RT is the transpose of R, and if the characteristic polynomial of Ai = A-\-Diis \xl Ai\ = mi + max + mi2x2 + + mi,r-ixr~1, where w.-,y_i, i, j=\, 2,, r, are polynomials in xr with coefficients in F, then the characteristic polynomial of the product P=AiA2 AT is given by { l){r~1)n\a{x)\, where '»»lo, Wi,r_iXr-1, OTi,r_2Xr~2,,»»llX (1) A(x') =»»2lX,»»2,»»2,r-lXr~1,,»»22X2»»32X2,»»3lX,»»3,, W33X3 (»»r,r_lxr-1,»»rir_2xr 2,»»r,r_3Xr 3,,»»r,o j This proposition has been proved by the writer [l] for the case r = 2. Recently Parker [2] generalized that result and Goddard [3] gave an alternate proof of it and extended his method to the product of three matrices. This latter result does not come under the theorem above. Schneider [5] proved the theorem for the case AiA =, i<j, i,j=l, 2,, r. Capital letters and expressions in bold faced parentheses will indicate matrices with elements in the field F or in F(w), the extension of F by the adjunction of «a primitive rth root of unity to it, and in F{x) the polynomial domain of F{u). The direct product of B and C is {bijc)=b(c). The product indicated by LI will run from 1 to r. If R is not zero a nonsingular matrix Q with elements in F exists such that QRT = {1,,, )r; as a result QDiQ' = (1,,, OySiQ1 = Ei, where Q1 is the inverse of Q and, has nonzero elements in only the first row. Now let Presented to the Society, April 23, 1955; received by the editors April 4, 1955 and, in revised form, August 26, 1955. 578

PRODUCT OF SEVERAL MATRICES 579 (2) QAkQ> = Mk = Q(A + Dk)Q' = M + Ek, where Q is the matrix defined above and QAQ1 = M=(mn). Consequently Mk = (m\f), where mf =mij-\-ef] and m\f =ma for *>1. That is, the matrices Mk differ only in the elements of their first rows. As a result the elements of the first columns of the adjoints [xi Mk]A and [xi M]A of xi Mk and xi M respectively are identical for k = 1, 2,, r, since all these matrices agree in the elements of their last n 1 rows and for the same reason (3) Nk(x) [xi - Mk][xl - M]A, mk(x) * * m(x) m(x) m(x)j k = \, 2,, r, where asterisks indicate nonzero elements in F(x) and \xl M\ =m(x). Let W = («,,) - («<«-»<'-»), i,j= 1,2, r; then (4) W(h) = W where Ik is the identity matrix of order k. The determinantal equation holds because W(Ik) can be transformed by the interchange of rows and corresponding columns to the direct sum W-j-W-j- -\-W of k summands. We shall operate in F(x) on the matrix M(x) = (dijxl 5i+i,jMi) xi - Mi xi - M2 («r+1,1 = 1) Mr Mr-l xi If we multiply this matrix on the right by one whose first row is /, Mix~l, MiM2x~2,, MiM2 MT-ix~r+1, whose second row is, /, M2x~l,, MiMz Mr-iX~r+2, and whose last row is

58 W. E. ROTH [August,,,, i", we find that the determinant of the product is \xri MTMiM2 MT-i\ and is therefore equal to \xr P\. The proof of Theorem I will consist in showing that (5) M{x)\ = (-i)(-«- A(. We now proceed to establish this equation. M{x)W{I) = {taxi - ôi+i,kmi){^-^-'h), = («Cí-»a-%j _ uhi-fími), = (^-'{wiiiw'-ixl - Mi]}). The number co1-' is a common multiplier of the nxn matrices in the 7th column of the nr Xnr matrix in right member above. Consequently the determinant of this matrix has the factor 7rtu(1-*)n=ûr"r(r~1)"'î =wr(r-i)n/2 = (_i)(r-i)n Tne determinantal equation obtained from the matric equation above is as a result: (6) M{x) W " = (-l)c^y» Uijiu'-ixl - Mi]. According to (3) the product (7) {wiklco^xl - Mi\){hjW-lxI - M]A) ={uijni{ui-1x)). The nrxnr matrix of the right member of this equation can be transformed by the interchange of corresponding rows and columns to a similar one having the form Xuijmiia*-1«)), *,, *, (uima'^x)),, l o, o,, ( tumft~1*)) J where asterisks represent rxr matrices with elements in F{x) and the zeros are rxr zero matrices. The determinant of this matrix is (8) \W I""1 [Hm^'-'x)Y'11 (wyiäicy-1*)) I for each of the matrices (wij»w(coi_1x)) has»w(a>i-1x) as a divisor of all elements in the jth column. The determinant of the direct sum {8ij[w'~1xl M]A) in equation (7) is [ [Jw(co/_1x)]n_1; consequently the determinantal equation which follows from (7) and (8) is or uijiu'^xl - Mi] [ n»»(«f'"1ï)]""1 = i w i«-1 [ n«(«hï) ]n_i i (coijwio''-1*)) i, (9) œalco'-'xl - Mi] = \W I"-11 (ttywifw*-1*)),

1956] PRODUCT OF SEVERAL MATRICES 581 where the determinant of the left member is that of an nrxnr matrix and those in the right members are of order r. From (6) and (9) we have \M(x)\=(-l)^-l)n\(uijMi(u'-1x))\/\W\. It remains to be shown that the right member here is ( l)(r-1)" A(xr) ; this is easily accomplished by multiplying A(xr) in (1) on the right by W. Herewith equation (5) is established and the proof of Theorem I is completed. Corollary. Under the hypotheses of Theorem I and if B is an nxn matrix with elements in F and if Bi = B-\-SjR and \ xi Bi\ = «o + nnx + ni2x2 + + «,r-i r_1; then the characteristic polynomial of BiB2 ( l)(r-»» A'(a;) where BT is given by A'(* = Mr-1,1*, Mr_i,o,, Mr-1,2*2 [Ml,,-!*'" Ml,r-2*r', Mi, This case can be made to come under Theorem I for Bf = BT+RTSi, where Bf now satisfies the conditions imposed upon A{. Moreover \xi-bi\ =\xi-bf\. Since (B,B, Br)T = BfB?_1 Bf, it follows that in A(xr) of (1) we must replace the elements ím,y_ixí_1 by Mr-i+i.y-ix'-1 in forming the matrix A'(*r) above. This proves the corollary. Theorem II. If Dit i = i, 2,, r, arenxn matrices with elements in F, each of which is nilpotent and commutative with the others and with A, which also has elements in F, then the characteristic polynomials of Ai = A-\-Di, i = l, 2,, r, are given by (1) xi A\ = trio + mix + m2x2 + + ntr-ix*-1, where wt-_i, * = 1, 2,, r, are polynomials in xr with coefficients in F, and the characteristic polynomial of the product P=AiA2 Ar is (_l)(r-i)n Â"(x), where A(xr) = mix, m2x2, mr-ixr' Wo, m,\x, Mr-iX"-2, mt-ixr~x, mo,, mix, m2x2, m3x3 \mr^ixt l, mr-2xr 2, mr-3xr~i,,mo J According to a theorem by Frobenius [4], the determinant of the

582 W. E. ROTH matrix B-\-C is equal to that of B if B and C are commutative matrices and C is nilpotent. This establishes equation (1) as giving the characteristic polynomial of Ai, * = 1, 2,, r. By Theorem I the determinant xl - A*\ = (-l)fr-»» ÄO). We shall proceed by induction. Let Pi=AiA2 -Ai, then xl - PiA'-11 = xl - {A + Di)Ar-11 = xl - Ar - DiA*-1 \. Now the matrix D Ar~l is nilpotent and commutative with xi AT consequently the determinants above are equal to \xl AT\. We assume that then xl PiA'-'l = xl - Ar\ ; xl - Pi+iA'-i-11 = xl - PiA^-i - PiDi+iAr-i-11. Here PiZ>i+i^4r_i_1 is commutative with xi PiA'^ and is nilpotent because Di+i is nilpotent and commutative with both P, and A ; hence by Frobenius' theorem Consequently and the theorem xl - Pi+iA'-i-11 = xl - PiAr-i = xl - A'. \xl - P\ = xl - A' = (-l)c-d» A{x), is proved. References 1. W. E. Roth, On the characteristic polynomial of the product of two matrices, Proc. Amer. Math. Soc. vol. 5 (1954) pp. 1-3. 2. W. V. Parker, A note on a theorem of Roth, Proc. Amer. Math. Soc. vol. 6 (1955) pp. 299-3. 3. L. S. Goddard, On the characteristic function of a matrix product, Proc. Amer. Math. Soc. vol. 6 (1955) pp. 296-298. 4. Frobenius, Preuss. Akad. Wiss. Sitzungsber. (1896) I pp. 61-614. 5. Schneider, A pair of matrices having the property P, Amer. Math. Monthly vol. 62 (1955) pp. 247-249. Mississippi City, Miss.