ON THE CHARACTERISTIC POLYNOMIAL OF THE PRODUCT OF SEVERAL MATRICES
|
|
- Anthony Wheeler
- 5 years ago
- Views:
Transcription
1 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,
2 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
3 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*)),
4 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
5 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 W. V. Parker, A note on a theorem of Roth, Proc. Amer. Math. Soc. vol. 6 (1955) pp L. S. Goddard, On the characteristic function of a matrix product, Proc. Amer. Math. Soc. vol. 6 (1955) pp Frobenius, Preuss. Akad. Wiss. Sitzungsber. (1896) I pp Schneider, A pair of matrices having the property P, Amer. Math. Monthly vol. 62 (1955) pp Mississippi City, Miss.
PAIRS OF MATRICES WITH PROPERTY L(0
PAIRS OF MATRICES WITH PROPERTY L( BY T. S. MOTZKIN AND OLGA TAUSSKY 1. It was proved by Frobenius [l] that any function f(a, B) of two commutative «X«square matrices A, B has as characteristic roots the
More informationFinite 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.
Finite Mathematics Chapter 2 Section 2.1 Systems of Linear Equations: An Introduction Systems of Equations Recall that a system of two linear equations in two variables may be written in the general form
More informationThe matrix will only be consistent if the last entry of row three is 0, meaning 2b 3 + b 2 b 1 = 0.
) Find all solutions of the linear system. Express the answer in vector form. x + 2x + x + x 5 = 2 2x 2 + 2x + 2x + x 5 = 8 x + 2x + x + 9x 5 = 2 2 Solution: Reduce the augmented matrix [ 2 2 2 8 ] to
More informationMatrix Arithmetic. j=1
An m n matrix is an array A = Matrix Arithmetic a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn of real numbers a ij An m n matrix has m rows and n columns a ij is the entry in the i-th row and j-th column
More informationConstruction of latin squares of prime order
Construction of latin squares of prime order Theorem. If p is prime, then there exist p 1 MOLS of order p. Construction: The elements in the latin square will be the elements of Z p, the integers modulo
More informationON CONSTRUCTING NEARLY DECOMPOSABLE MATRICES D. J. HARTFIEL
proceedings of the american mathematical society Volume 27, No. 2, February 1971 ON CONSTRUCTING NEARLY DECOMPOSABLE MATRICES D. J. HARTFIEL Abstract. In this paper we consider the construction of nearly
More informationEXERCISES. 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
/ rings definitions and elementary properties 171 EXERCISES A. Examples of Rings In each of the following, a set A with operations of addition and multiplication is given. Prove that A satisfies all the
More informationReview of Basic Concepts in Linear Algebra
Review of Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University September 7, 2017 Math 565 Linear Algebra Review September 7, 2017 1 / 40 Numerical Linear Algebra
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 informationMATRICES AND MATRIX OPERATIONS
SIZE OF THE MATRIX is defined by number of rows and columns in the matrix. For the matrix that have m rows and n columns we say the size of the matrix is m x n. If matrix have the same number of rows (n)
More informationON DIVISION ALGEBRAS*
ON DIVISION ALGEBRAS* BY J. H. M. WEDDERBURN 1. The object of this paper is to develop some of the simpler properties of division algebras, that is to say, linear associative algebras in which division
More informationMath 1314 Week #14 Notes
Math 3 Week # Notes Section 5.: A system of equations consists of two or more equations. A solution to a system of equations is a point that satisfies all the equations in the system. In this chapter,
More informationPrepared by: M. S. KumarSwamy, TGT(Maths) Page
Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 50 - CHAPTER 3: MATRICES QUICK REVISION (Important Concepts & Formulae) MARKS WEIGHTAGE 03 marks Matrix A matrix is an ordered rectangular array of numbers
More informationAppendix C Vector and matrix algebra
Appendix C Vector and matrix algebra Concepts Scalars Vectors, rows and columns, matrices Adding and subtracting vectors and matrices Multiplying them by scalars Products of vectors and matrices, scalar
More informationa11 a A = : a 21 a 22
Matrices The study of linear systems is facilitated by introducing matrices. Matrix theory provides a convenient language and notation to express many of the ideas concisely, and complicated formulas are
More informationBasic Concepts in Linear Algebra
Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University February 2, 2015 Grady B Wright Linear Algebra Basics February 2, 2015 1 / 39 Numerical Linear Algebra Linear
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationON A PARTITION PROBLEM OF CANFIELD AND WILF. Departamento de Matemáticas, Universidad de los Andes, Bogotá, Colombia
#A11 INTEGERS 12A (2012): John Selfridge Memorial Issue ON A PARTITION PROBLEM OF CANFIELD AND WILF Željka Ljujić Departamento de Matemáticas, Universidad de los Andes, Bogotá, Colombia z.ljujic20@uniandes.edu.co
More informationLemma 8: Suppose the N by N matrix A has the following block upper triangular form:
17 4 Determinants and the Inverse of a Square Matrix In this section, we are going to use our knowledge of determinants and their properties to derive an explicit formula for the inverse of a square matrix
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 informationA CHARACTERIZATION OF INNER PRODUCT SPACES
A CHARACTERIZATION OF INNER PRODUCT SPACES DAVID ALBERT SENECHALLE The well-known parallelogram law of Jordan and von Neumann [l] has been generalized in two different ways by M. M. Day [2] and E. R. Lorch
More informationTHE GROUP OF UNITS OF SOME FINITE LOCAL RINGS I
J Korean Math Soc 46 (009), No, pp 95 311 THE GROUP OF UNITS OF SOME FINITE LOCAL RINGS I Sung Sik Woo Abstract The purpose of this paper is to identify the group of units of finite local rings of the
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 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 information1 Matrices and Systems of Linear Equations. a 1n a 2n
March 31, 2013 16-1 16. Systems of Linear Equations 1 Matrices and Systems of Linear Equations An m n matrix is an array A = (a ij ) of the form a 11 a 21 a m1 a 1n a 2n... a mn where each a ij is a real
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 1982 NOTES ON MATRIX METHODS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 198 NOTES ON MATRIX METHODS 1. Matrix Algebra Margenau and Murphy, The Mathematics of Physics and Chemistry, Chapter 10, give almost
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 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 informationChapter 1. Matrix Algebra
ST4233, Linear Models, Semester 1 2008-2009 Chapter 1. Matrix Algebra 1 Matrix and vector notation Definition 1.1 A matrix is a rectangular or square array of numbers of variables. We use uppercase boldface
More informationRings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.
Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over
More informationSTABILIZATION BY A DIAGONAL MATRIX
STABILIZATION BY A DIAGONAL MATRIX C. S. BALLANTINE Abstract. In this paper it is shown that, given a complex square matrix A all of whose leading principal minors are nonzero, there is a diagonal matrix
More information10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections )
c Dr. Igor Zelenko, Fall 2017 1 10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections 7.2-7.4) 1. When each of the functions F 1, F 2,..., F n in right-hand side
More informationSubrings and Ideals 2.1 INTRODUCTION 2.2 SUBRING
Subrings and Ideals Chapter 2 2.1 INTRODUCTION In this chapter, we discuss, subrings, sub fields. Ideals and quotient ring. We begin our study by defining a subring. If (R, +, ) is a ring and S is a non-empty
More informationInverses and Elementary Matrices
Inverses and Elementary Matrices 1-12-2013 Matrix inversion gives a method for solving some systems of equations Suppose 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 a n1 x
More informationTIGHT CLOSURE IN NON EQUIDIMENSIONAL RINGS ANURAG K. SINGH
TIGHT CLOSURE IN NON EQUIDIMENSIONAL RINGS ANURAG K. SINGH 1. Introduction Throughout our discussion, all rings are commutative, Noetherian and have an identity element. The notion of the tight closure
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 information3 Matrix Algebra. 3.1 Operations on matrices
3 Matrix Algebra A matrix is a rectangular array of numbers; it is of size m n if it has m rows and n columns. A 1 n matrix is a row vector; an m 1 matrix is a column vector. For example: 1 5 3 5 3 5 8
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 informationSystems of Linear Equations and Matrices
Chapter 1 Systems of Linear Equations and Matrices System of linear algebraic equations and their solution constitute one of the major topics studied in the course known as linear algebra. In the first
More informationORIE 6300 Mathematical Programming I August 25, Recitation 1
ORIE 6300 Mathematical Programming I August 25, 2016 Lecturer: Calvin Wylie Recitation 1 Scribe: Mateo Díaz 1 Linear Algebra Review 1 1.1 Independence, Spanning, and Dimension Definition 1 A (usually infinite)
More informationAn Extrapolated Gauss-Seidel Iteration
mathematics of computation, volume 27, number 124, October 1973 An Extrapolated Gauss-Seidel Iteration for Hessenberg Matrices By L. J. Lardy Abstract. We show that for certain systems of linear equations
More informationTopic 1: Matrix diagonalization
Topic : Matrix diagonalization Review of Matrices and Determinants Definition A matrix is a rectangular array of real numbers a a a m a A = a a m a n a n a nm The matrix is said to be of order n m if it
More informationChapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations
Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2
More informationSystems of Linear Equations and Matrices
Chapter 1 Systems of Linear Equations and Matrices System of linear algebraic equations and their solution constitute one of the major topics studied in the course known as linear algebra. In the first
More informationTHE LARGE CONDITION FOR RINGS WITH KRULL DIMENSION
proceedings of the american mathematical society Volume 72, Number 1, October 1978 THE LARGE CONDITION FOR RINGS WITH KRULL DIMENSION ANN K. BOYLE1 Abstract. A module M with Krull dimension is said to
More informationConjugacy classes of torsion in GL_n(Z)
Electronic Journal of Linear Algebra Volume 30 Volume 30 (2015) Article 32 2015 Conjugacy classes of torsion in GL_n(Z) Qingjie Yang Renmin University of China yangqj@ruceducn Follow this and additional
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 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 informationThe 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 informationON THE EQUATION Xa=7X+/3 OVER AN ALGEBRAIC DIVISION RING
ON THE EQUATION Xa=7X+/3 OVER AN ALGEBRAIC DIVISION RING R. E. JOHNSON 1. Introduction and notation. The main purpose of this paper is to give necessary and sufficient conditions in order that the equation
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 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 informationLinear 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.
Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the
More informationBounds for the Representations of Integers by Positive Quadratic Forms
22 MATHEMATICS MAGAZINE Bounds for the Representations of Integers by Positive Quadratic Forms KENNETH S. WILLIAMS Carleton University Ottawa, ON, Canada kennethwilliams@cunet.carleton.ca The fact that
More information6.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.
61 Matrices Definition: A Matrix A is a rectangular array of the form A 11 A 12 A 1n A 21 A 22 A 2n A m1 A m2 A mn The size of A is m n, where m is the number of rows and n is the number of columns The
More informationLINEAR SYSTEMS AND MATRICES
CHAPTER 3 LINEAR SYSTEMS AND MATRICES SECTION 3. INTRODUCTION TO LINEAR SYSTEMS This initial section takes account of the fact that some students remember only hazily the method of elimination for and
More informationTHREE LECTURES ON QUASIDETERMINANTS
THREE LECTURES ON QUASIDETERMINANTS Robert Lee Wilson Department of Mathematics Rutgers University The determinant of a matrix with entries in a commutative ring is a main organizing tool in commutative
More informationComputer Investigation of Difference Sets
Computer Investigation of Difference Sets By Harry S. Hayashi 1. Introduction. By a difference set of order k and multiplicity X is meant a set of k distinct residues n,r2,,rk (mod v) such that the congruence
More informationEighth Homework Solutions
Math 4124 Wednesday, April 20 Eighth Homework Solutions 1. Exercise 5.2.1(e). Determine the number of nonisomorphic abelian groups of order 2704. First we write 2704 as a product of prime powers, namely
More informationON RESTRICTED SYSTEMS OF HIGHER INDETERMINATE EQUATIONS * E. T. BELL
ON RESTRICTED SYSTEMS OF HIGHER INDETERMINATE EQUATIONS * BY E. T. BELL By two examples we shall illustrate a means for deriving arithmetical properties of certain restricted forms. So little being known
More informationF. T. HOWARD AND CURTIS COOPER
SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 0, if 0 n < r 1; G n = 1, if n = r 1; G
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationMatrices. Chapter What is a Matrix? We review the basic matrix operations. An array of numbers a a 1n A = a m1...
Chapter Matrices We review the basic matrix operations What is a Matrix? An array of numbers a a n A = a m a mn with m rows and n columns is a m n matrix Element a ij in located in position (i, j The elements
More informationSection 9.2: Matrices. Definition: A matrix A consists of a rectangular array of numbers, or elements, arranged in m rows and n columns.
Section 9.2: Matrices Definition: A matrix A consists of a rectangular array of numbers, or elements, arranged in m rows and n columns. That is, a 11 a 12 a 1n a 21 a 22 a 2n A =...... a m1 a m2 a mn A
More informationThis paper was published in Connections in Discrete Mathematics, S. Butler, J. Cooper, and G. Hurlbert, editors, Cambridge University Press,
This paper was published in Connections in Discrete Mathematics, S Butler, J Cooper, and G Hurlbert, editors, Cambridge University Press, Cambridge, 2018, 200-213 To the best of my knowledge, this is the
More informationSection 19 Integral domains
Section 19 Integral domains Instructor: Yifan Yang Spring 2007 Observation and motivation There are rings in which ab = 0 implies a = 0 or b = 0 For examples, Z, Q, R, C, and Z[x] are all such rings There
More informationRANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA
Discussiones Mathematicae General Algebra and Applications 23 (2003 ) 125 137 RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Seok-Zun Song and Kyung-Tae Kang Department of Mathematics,
More informationA COMPARISON THEOREM FOR ELLIPTIC DIFFERENTIAL EQUATIONS
A COMPARISON THEOREM FOR ELLIPTIC DIFFERENTIAL EQUATIONS C. A. SWANSON1 Clark and the author [2] recently obtained a generalization of the Hartman-Wintner comparison theorem [4] for a pair of self-adjoint
More informationMODULES OVER RINGS OF WORDS
MODULES OVER RINGS OF WORDS WILLIAM G. LEAVITT Introduction. A right module M over a ring K with unit is called a free module if it is finitely based. If the basis number of such a module is not invariant
More informationBasic Linear Algebra in MATLAB
Basic Linear Algebra in MATLAB 9.29 Optional Lecture 2 In the last optional lecture we learned the the basic type in MATLAB is a matrix of double precision floating point numbers. You learned a number
More informationThe Infinity Norm of a Certain Type of Symmetric Circulant Matrix
MATHEMATICS OF COMPUTATION, VOLUME 31, NUMBER 139 JULY 1977, PAGES 733-737 The Infinity Norm of a Certain Type of Symmetric Circulant Matrix By W. D. Hoskins and D. S. Meek Abstract. An attainable bound
More informationMatrix Algebra: Introduction
Matrix Algebra: Introduction Matrices and Determinants were discovered and developed in the eighteenth and nineteenth centuries. Initially, their development dealt with transformation of geometric objects
More informationStrongly Nil -Clean Rings
Strongly Nil -Clean Rings Abdullah HARMANCI Huanyin CHEN and A. Çiğdem ÖZCAN Abstract A -ring R is called strongly nil -clean if every element of R is the sum of a projection and a nilpotent element that
More informationApplied Matrix Algebra Lecture Notes Section 2.2. Gerald Höhn Department of Mathematics, Kansas State University
Applied Matrix Algebra Lecture Notes Section 22 Gerald Höhn Department of Mathematics, Kansas State University September, 216 Chapter 2 Matrices 22 Inverses Let (S) a 11 x 1 + a 12 x 2 + +a 1n x n = b
More informationISOMORPHIC POLYNOMIAL RINGS
PROCEEDINGS of the AMERICAN MATHEMATICAL SOCIETY Volume 27, No. 2, February 1971 ISOMORPHIC POLYNOMIAL RINGS D. B. COLEMAN AND E. E. ENOCHS Abstract. A ring is called invariant if whenever B is a ring
More informationREGULAR P.I.-RINGS E. P. ARMENDARIZ AND JOE W. FISHER
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 39, Number 2, July 1973 REGULAR P.I.-RINGS E. P. ARMENDARIZ AND JOE W. FISHER Abstract. For a ring R which satisfies a polynomial identity we show
More informationIntroduction to Matrix Algebra
Introduction to Matrix Algebra August 18, 2010 1 Vectors 1.1 Notations A p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the line. When p
More informationa 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.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationON DIRECT PRODUCT MATRICESf
1934-1 DIRECT PRODUCT MATRICES 461 ON DIRECT PRODUCT MATRICESf BY W. E. ROTH 1. Introduction. If A = (a»/), (i = 1, 2,, m;j= 1, 2,,»), is an mxn matrix and B is a, pxq matrix, then the matrix, P = (a i3
More informationA NEW GENERAL SERIES OF BALANCED INCOMPLETE BLOCK DESIGNS
A NEW GENERAL SERIES OF BALANCED INCOMPLETE BLOCK DESIGNS C. RAMANUJACHARYULU 0. Summary. Let v be any integer with si the least prime power factor, the other prime power factors being s2,, sm. Assume
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J Olver 3 Review of Matrix Algebra Vectors and matrices are essential for modern analysis of systems of equations algebrai, differential, functional, etc In this
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 informationCS100: DISCRETE STRUCTURES. Lecture 3 Matrices Ch 3 Pages:
CS100: DISCRETE STRUCTURES Lecture 3 Matrices Ch 3 Pages: 246-262 Matrices 2 Introduction DEFINITION 1: A matrix is a rectangular array of numbers. A matrix with m rows and n columns is called an m x n
More informationRINGS WITH RESTRICTED MINIMUM CONDITION
RINGS WITH RESTRICTED MINIMUM CONDITION AVRAHAM J. ORNSTEIN1 In what follows, a ring will always mean an associative ring with unit element. Definition. A ring R is said to satisfy the restricted minimum
More informationMa 227 Review for Systems of DEs
Ma 7 Review for Systems of DEs Matrices Basic Properties Addition and subtraction: Let A a ij mn and B b ij mn.then A B a ij b ij mn 3 A 6 B 6 4 7 6 A B 6 4 3 7 6 6 7 3 Scaler Multiplication: Let k be
More informationReview of Vectors and Matrices
A P P E N D I X D Review of Vectors and Matrices D. VECTORS D.. Definition of a Vector Let p, p, Á, p n be any n real numbers and P an ordered set of these real numbers that is, P = p, p, Á, p n Then P
More informationIntroduction to Matrices
214 Analysis and Design of Feedback Control Systems Introduction to Matrices Derek Rowell October 2002 Modern system dynamics is based upon a matrix representation of the dynamic equations governing the
More informationarxiv: v1 [math.ra] 22 Apr 2014
FINITELY GENERATED NIL BUT NOT NILPOTENT EVOLUTION ALGEBRAS arxiv:1404.5523v1 [math.ra] 22 Apr 2014 JIANJUN PAUL TIAN AND YI MING ZOU Abstract. To use evolution algebras to model population dynamics that
More informationThroughout these notes we assume V, W are finite dimensional inner product spaces over C.
Math 342 - Linear Algebra II Notes Throughout these notes we assume V, W are finite dimensional inner product spaces over C 1 Upper Triangular Representation Proposition: Let T L(V ) There exists an orthonormal
More informationChapter 1 Vector Spaces
Chapter 1 Vector Spaces Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 110 Linear Algebra Vector Spaces Definition A vector space V over a field
More informationLinear Algebra and Matrix Inversion
Jim Lambers MAT 46/56 Spring Semester 29- Lecture 2 Notes These notes correspond to Section 63 in the text Linear Algebra and Matrix Inversion Vector Spaces and Linear Transformations Matrices are much
More informationLecture 7: Vectors and Matrices II Introduction to Matrices (See Sections, 3.3, 3.6, 3.7 and 3.9 in Boas)
Lecture 7: Vectors and Matrices II Introduction to Matrices (See Sections 3.3 3.6 3.7 and 3.9 in Boas) Here we will continue our discussion of vectors and their transformations. In Lecture 6 we gained
More informationA CHANGE OF RINGS THEOREM
A CHANGE OF RINGS THEOREM LANCE W. SMALL1 1. Introduction. Except under special hypotheses it is not possible to relate the global dimension of a ring to that of a factor ring. In this note we shall give
More informationMcCoy Rings Relative to a Monoid
International Journal of Algebra, Vol. 4, 2010, no. 10, 469-476 McCoy Rings Relative to a Monoid M. Khoramdel Department of Azad University, Boushehr, Iran M khoramdel@sina.kntu.ac.ir Mehdikhoramdel@gmail.com
More informationMATHEMATICS. IMPORTANT FORMULAE AND CONCEPTS for. Final Revision CLASS XII CHAPTER WISE CONCEPTS, FORMULAS FOR QUICK REVISION.
MATHEMATICS IMPORTANT FORMULAE AND CONCEPTS for Final Revision CLASS XII 2016 17 CHAPTER WISE CONCEPTS, FORMULAS FOR QUICK REVISION Prepared by M. S. KUMARSWAMY, TGT(MATHS) M. Sc. Gold Medallist (Elect.),
More informationA primer on matrices
A primer on matrices Stephen Boyd August 4, 2007 These notes describe the notation of matrices, the mechanics of matrix manipulation, and how to use matrices to formulate and solve sets of simultaneous
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
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 informationLecture 3 Linear Algebra Background
Lecture 3 Linear Algebra Background Dan Sheldon September 17, 2012 Motivation Preview of next class: y (1) w 0 + w 1 x (1) 1 + w 2 x (1) 2 +... + w d x (1) d y (2) w 0 + w 1 x (2) 1 + w 2 x (2) 2 +...
More information