Sufficiency of Signed Principal Minors for Semidefiniteness: A Relatively Easy Proof
|
|
- Chester McBride
- 5 years ago
- Views:
Transcription
1 Sufficiency of Signed Principal Minors for Semidefiniteness: A Relatively Easy Proof David M. Mandy Department of Economics University of Missouri 118 Professional Building Columbia, MO USA mandyd@missouri.edu September 23, 2016 Abstract. Extant proofs that signed principal minors is sufficient for semidefiniteness of a Hermitian matrix are relatively inaccessible to economics audiences. The paper presents a new proof that relies only on facts familiar to economics graduate students. Keywords. Semidefinite, Hermitian, Matrix, Principal Minors. EL Code. C02. 1
2 1 Introduction Characterizing semidefiniteness of a matrix is a frequent need in econometrics and economic theory. Sometimes the matrix is definite and this is established with relative ease by studying the signs of leading principal minors. However some contexts require that the semidefinite case be considered explicitly. For example, duality for price-taking economic actors requires that profit (cost/expenditure) be a linear homogeneous and convex (concave) function of prices. Linear homogeneity implies the Hessian is singular (when it exists), whence the matrix under study in these settings cannot be definite. Another example is necessary second order conditions for an extremum. The necessary, but not sufficient, conditions are implied by maximizing behavior so semidefiniteness is all that can be inferred from the postulated behavior. Although it is well-known that all principal minors must be signed to establish semidefiniteness, proofs in the economics literature are scarce. Standard mathematical economics books including Chiang [2, pp ], de la Fuente [4, p. 270], Lancaster [8, pp ], Simon and Blume [9, Theorem 16.2], Sydsæter et al. [10, Theorem 1.7.1] and Takayama [11, Theorem 1.E.11] do not prove the semidefinite case. Extant proofs typically work directly with the quadratic form or characteristic equation and use a limit argument [3] [1, p. 223] [5, p. 307], making them relatively inaccessible to many economists. This short note provides an alternate proof that signing all of the principal minors is sufficient for semidefiniteness of a Hermitian matrix. The method of proof enables relatively easy consideration of many situations with a singular matrix. The proof relies on six facts about matrices which, for clarity of the background needed to understand the proof, are listed at the outset. These six facts have long been familiar to economics graduate students. For example, they are all succinctly proven in Chapter 4 of ohnston [7]. 1 With these six facts in hand, the proof herein uses nothing more than simple observations about the entries in the matrix. 2 Notation and Reminders x s = y means the real numbers x and y have the same sign. ᾱ denotes the complex conjugate of α C 1. ᾱα is real and nonnegative, and is zero if and only if α = 0. Given a matrix A with complex entries a ij, A denotes the conjugate transpose of A (the (j, i) entry of A is ā ij ). If A C n (a vector) then A A is real and nonnegative, and is zero if and only if A = 0. Given an n n complex matrix A, let {1,..., n} denote an index set of the rows and columns of A ( ). A denotes the principal submatrix of A consisting of the rows 1 ohnston works only with real matrices. Everything herein is stated for complex matrices because doing so adds little complication. 2
3 and columns in, and # denotes the number of elements in (the order of the principal submatrix). For the special cases = {1,..., i} for i = 1,..., n, A is denoted A i (i.e., A i is the i i leading principal submatrix of A, and A n = A). A 0 1 for notational convenience. The determinant A is a principal minor of order #. Enumerating the elements of in ascending order as = {j 1,..., j # } yields a permutation matrix P with entries p ij = 0 for i, j = 1,..., n except p iji = 1 for i = 1,..., # and p ii = 1 for i = # + 1,..., n. When symmetrically applied to A, P makes A a leading principal submatrix. As with all permutation matrices, P P = I n. A is Hermitian (symmetric, in the real case) if A = A. A Hermitian matrix is square and has real diagonal entries. An n n matrix A is positive (negative) definite if x Ax > (<) 0 for every nonzero vector x C n. If the defining inequality is weak then A is positive (negative) semidefinite. Implicit in this definition is that the product x Ax is real for every nonzero x C n. 2 3 Six Familiar Facts about Complex Matrices 1. (AB) = B A for conformable matrices A and B. 2. αa = α n A for α C 1 and an n n matrix A. 3. If a square matrix A is partitioned as: [ ] A11 A A = 12, A 21 A 22 where A 11 is square (i.e., a leading principal submatrix) and nonsingular, then: A = A 11 A 22 A 21 A 1 11 A Every positive (semi) definite (Hermitian) matrix has a unique positive (semi) definite (Hermitian) square root matrix. 5. (The definite case; necessity) Every principal minor of a positive definite (Hermitian) matrix is positive. 6. (The definite case; sufficiency) If every leading principal minor of a Hermitian matrix is positive then the matrix is positive definite. 2 A is Hermitian if and only if x Ax is real for every x C n [6, Theorem 4.1.4]. We do not use this fact directly but it shows that semidefinite matrices are always Hermitian. 3
4 4 Main Theorem Theorem 1. If the n n Hermitian matrix A has a principal submatrix A satisfying: 1. A is positive (negative) definite, 2. No higher order principal submatrix of A is positive (negative) definite, and 3. A K 0 (has sign ( 1) #K or is zero) for every K satisfying K {1,..., n}; then A is positive (negative) semidefinite. Proof. Begin with the positive semidefinite case. If A = A then A is trivially positive semidefinite, so assume A excludes some rows and (the same) columns. Then: [ ] P AP A B = B C for some matrices B and C (C is Hermitian). Consider an arbitrary column b i from B and the corresponding diagonal entry c ii from C. Using A > 0 from item 1 (Fact 5) and Fact 3 yields: A b i = A c ii b i A 1 b i = s c ii b i A 1 b i. b i c ii This is nonnegative due to item 3. If it is positive then the principal submatrix under consideration is positive definite (Facts 5 and 6), contradicting item 2, so c ii b i A 1 b i = 0. Now consider any two columns from B and the corresponding 2 2 submatrix from C: A b i b j [ ] [ ] b i c ii c ij b j c ij c jj = A cii c ij b c i ij c jj b A 1 [ ] bi b j j s = 0 c ij b i A 1 b j c ij b j A 1 b i 0 = (c ij b i A 1 b j)(c ij b ja 1 b i) = (c ij b i A 1 b j)(c ij b i A 1 b j). The last equality uses Fact 1. This is again nonnegative due to item 3, which implies c ij b i A 1 b j = 0 [ for every i, j ] (including i = j). Therefore C = B A 1 B. Now use Fact 4 to define F = A 1/2 B and using Fact 1 note that: A 1/2 [ ] F A 1/2 [ ] [ ] [ ] F = B A 1/2 A 1/2 A 1/2 A B A B B = B B A 1 B = B. C 4
5 For any nonzero x C n, let y(x) = F P x. Then, again using Fact 1: x Ax = x P F F P x = y(x) y(x) 0. Hence A is positive semidefinite. For the negative semidefinite case, replace A in the above argument by A and A by A, noting that (1) A is positive definite, (2) no higher order principal submatrix of A is positive definite, and (3) A K = ( 1) #K A K 0 for every K satisfying K {1,..., n} (Fact 2). The conclusion is A is positive semidefinite, or A is negative semidefinite. 5 Applications Theorem 1 readily gives the sufficient condition for semidefiniteness. Corollary 1. If every principal minor of a Hermitian matrix A is nonnegative (of order # has sign ( 1) # or is zero) then A is positive (negative) semidefinite. Proof. If every diagonal entry of A is zero then: 0 a ii a ij = a ijā ij for every i, j = 1,..., n. ā ij a jj This implies a ij = 0 for every i, j. That is, A is a matrix of zeros, and is therefore trivially positive (negative) semidefinite. So assume there is a nonzero diagonal entry. That entry is a positive (negative) definite principal submatrix, so A has a highest order positive (negative) definite principal submatrix A satisfying the assumptions of Theorem 1. In most duality applications even though the matrix under consideration is singular there is an (n 1) dimensional submatrix that is definite. That definiteness is verified by checking only (n 1) leading principal minors, and is therefore much easier than attempting to verify semidefiniteness directly with Corollary 1. Theorem 1 shows that doing so suffices to establish semidefiniteness of the original matrix. Corollary 2. Assume A is an n n singular Hermitian matrix. If A has an (n 1) st order positive (negative) definite principal submatrix A then A is positive (negative) semidefinite. Proof. The only principal submatrix of higher order than A is A, and A = 0. Apply Theorem 1. Acknowledgements. I am grateful to onathan Hamilton and. Isaac Miller for helpful discussions. 5
6 References [1] Abadir, KM and R Magnus. Matrix Algebra. Cambridge University Press, Cambridge (2005). [2] Chiang, A. Fundamental Methods of Mathematical Economics (third ed.). Mcgraw-Hill, New York (1984). [3] Debreu, G. Definite and Semidefinite Quadratic Forms. Econometrica 20 (1952) pp [4] de la Fuente, A. Mathematical Methods and Models for Economists. Cambridge University Press, Cambridge (2000). [5] Gantmacher, FR. The Theory of Matrices, Vol. 1. Chelsea, New York (1959). [6] Horn, RA and CR ohnson. Matrix Analysis (second ed.). Cambridge University Press, Cambridge (2013). [7] ohnston,. Econometric Methods (third ed.). McGraw-Hill, New York (1984). [8] Lancaster, K. Mathematical Economics. Macmillian, London (1970). [9] Simon, CP and L. Blume. Mathematics for Economists. Norton, New York (1994). [10] Sydæeter, K, P Hammond, A Seierstad and A Strøm. Further Mathematics for Economic Analysis (second ed.). Prentice-Hall, London (2008). [11] Takayama, A. Mathematical Economics (second ed.). Cambridge University Press, Cambridge (1985). 6
QUADRATIC FORMS AND DEFINITE MATRICES. a 11 a 1n. a n1 a nn a 1i x i
QUADRATIC FORMS AND DEFINITE MATRICES 1 DEFINITION AND CLASSIFICATION OF QUADRATIC FORMS 11Definitionofaquadraticform LetAdenoteannxnsymmetricmatrixwithrealentriesand letxdenoteanncolumnvectorthenq=x AxissaidtobeaquadraticformNotethat
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 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 informationGraduate Mathematical Economics Lecture 1
Graduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 23, 2012 Outline 1 2 Course Outline ematical techniques used in graduate level economics courses Mathematics for Economists
More informationSign Patterns with a Nest of Positive Principal Minors
Sign Patterns with a Nest of Positive Principal Minors D. D. Olesky 1 M. J. Tsatsomeros 2 P. van den Driessche 3 March 11, 2011 Abstract A matrix A M n (R) has a nest of positive principal minors if P
More informationSCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE
SCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE BABHRU JOSHI AND M. SEETHARAMA GOWDA Abstract. We consider the semidefinite cone K n consisting of all n n real symmetric positive semidefinite matrices.
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 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 informationMatrix Completion Problems for Pairs of Related Classes of Matrices
Matrix Completion Problems for Pairs of Related Classes of Matrices Leslie Hogben Department of Mathematics Iowa State University Ames, IA 50011 lhogben@iastate.edu Abstract For a class X of real matrices,
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 informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko
More informationMath (P)refresher Lecture 8: Unconstrained Optimization
Math (P)refresher Lecture 8: Unconstrained Optimization September 2006 Today s Topics : Quadratic Forms Definiteness of Quadratic Forms Maxima and Minima in R n First Order Conditions Second Order Conditions
More informationHere each term has degree 2 (the sum of exponents is 2 for all summands). A quadratic form of three variables looks as
Reading [SB], Ch. 16.1-16.3, p. 375-393 1 Quadratic Forms A quadratic function f : R R has the form f(x) = a x. Generalization of this notion to two variables is the quadratic form Q(x 1, x ) = a 11 x
More information3 (Maths) Linear Algebra
3 (Maths) Linear Algebra References: Simon and Blume, chapters 6 to 11, 16 and 23; Pemberton and Rau, chapters 11 to 13 and 25; Sundaram, sections 1.3 and 1.5. The methods and concepts of linear algebra
More information(Received: )
The Mathematics Student, Special Centenary Volume (2007), 123-130 SYLVESTER S MINORANT CRITERION, LAGRANGE-BELTRAMI IDENTITY, AND NONNEGATIVE DEFINITENESS SUDHIR R. GHORPADE AND BALMOHAN V. LIMAYE (Received:
More informationMassachusetts Institute of Technology Department of Economics Statistics. Lecture Notes on Matrix Algebra
Massachusetts Institute of Technology Department of Economics 14.381 Statistics Guido Kuersteiner Lecture Notes on Matrix Algebra These lecture notes summarize some basic results on matrix algebra used
More informationLecture 2 INF-MAT : , LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky
Lecture 2 INF-MAT 4350 2009: 7.1-7.6, LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky Tom Lyche and Michael Floater Centre of Mathematics for Applications, Department of Informatics,
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 informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 3: Positive-Definite Systems; Cholesky Factorization Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical Analysis I 1 / 11 Symmetric
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 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 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 informationSymmetric Matrices and Eigendecomposition
Symmetric Matrices and Eigendecomposition Robert M. Freund January, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 Symmetric Matrices and Convexity of Quadratic Functions
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationLinear Algebra Solutions 1
Math Camp 1 Do the following: Linear Algebra Solutions 1 1. Let A = and B = 3 8 5 A B = 3 5 9 A + B = 9 11 14 4 AB = 69 3 16 BA = 1 4 ( 1 3. Let v = and u = 5 uv = 13 u v = 13 v u = 13 Math Camp 1 ( 7
More informationELA ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES
ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES ZHONGPENG YANG AND XIAOXIA FENG Abstract. Under the entrywise dominance partial ordering, T.L. Markham
More informationLinear Algebra: Characteristic Value Problem
Linear Algebra: Characteristic Value Problem . The Characteristic Value Problem Let < be the set of real numbers and { be the set of complex numbers. Given an n n real matrix A; does there exist a number
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 informationDelta Theorem in the Age of High Dimensions
Delta Theorem in the Age of High Dimensions Mehmet Caner Department of Economics Ohio State University December 15, 2016 Abstract We provide a new version of delta theorem, that takes into account of high
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 informationBackground on Linear Algebra - Lecture 2
Background on Linear Algebra - Lecture September 6, 01 1 Introduction Recall from your math classes the notion of vector spaces and fields of scalars. We shall be interested in finite dimensional vector
More informationNotes on Row Reduction
Notes on Row Reduction Francis J. Narcowich Department of Mathematics Texas A&M University September The Row-Reduction Algorithm The row-reduced form of a matrix contains a great deal of information, both
More informationZ-Pencils. November 20, Abstract
Z-Pencils J. J. McDonald D. D. Olesky H. Schneider M. J. Tsatsomeros P. van den Driessche November 20, 2006 Abstract The matrix pencil (A, B) = {tb A t C} is considered under the assumptions that A is
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 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 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 informationCopositive Plus Matrices
Copositive Plus Matrices Willemieke van Vliet Master Thesis in Applied Mathematics October 2011 Copositive Plus Matrices Summary In this report we discuss the set of copositive plus matrices and their
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - (Alberto Bressan, Spring 7) sec: Orthogonal diagonalization of symmetric matrices When we seek to diagonalize a general n n matrix A, two difficulties may arise:
More informationThe following two problems were posed by de Caen [4] (see also [6]):
BINARY RANKS AND BINARY FACTORIZATIONS OF NONNEGATIVE INTEGER MATRICES JIN ZHONG Abstract A matrix is binary if each of its entries is either or The binary rank of a nonnegative integer matrix A is the
More informationIntroduction to Quantitative Techniques for MSc Programmes SCHOOL OF ECONOMICS, MATHEMATICS AND STATISTICS MALET STREET LONDON WC1E 7HX
Introduction to Quantitative Techniques for MSc Programmes SCHOOL OF ECONOMICS, MATHEMATICS AND STATISTICS MALET STREET LONDON WC1E 7HX September 2007 MSc Sep Intro QT 1 Who are these course for? The September
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationc c c c c c c c c c a 3x3 matrix C= has a determinant determined by
Linear Algebra Determinants and Eigenvalues Introduction: Many important geometric and algebraic properties of square matrices are associated with a single real number revealed by what s known as the determinant.
More information5 More on Linear Algebra
14.102, Math for Economists Fall 2004 Lecture Notes, 9/23/2004 These notes are primarily based on those written by George Marios Angeletos for the Harvard Math Camp in 1999 and 2000, and updated by Stavros
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 informationARE211, Fall 2005 CONTENTS. 5. Characteristics of Functions Surjective, Injective and Bijective functions. 5.2.
ARE211, Fall 2005 LECTURE #18: THU, NOV 3, 2005 PRINT DATE: NOVEMBER 22, 2005 (COMPSTAT2) CONTENTS 5. Characteristics of Functions. 1 5.1. Surjective, Injective and Bijective functions 1 5.2. Homotheticity
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 informationA Note on Eigenvalues of Perturbed Hermitian Matrices
A Note on Eigenvalues of Perturbed Hermitian Matrices Chi-Kwong Li Ren-Cang Li July 2004 Let ( H1 E A = E H 2 Abstract and à = ( H1 H 2 be Hermitian matrices with eigenvalues λ 1 λ k and λ 1 λ k, respectively.
More informationWeek 4: Calculus and Optimization (Jehle and Reny, Chapter A2)
Week 4: Calculus and Optimization (Jehle and Reny, Chapter A2) Tsun-Feng Chiang *School of Economics, Henan University, Kaifeng, China September 27, 2015 Microeconomic Theory Week 4: Calculus and Optimization
More informationLinear System with Hidden Z-Matrix and Complementary Condition arxiv: v1 [math.oc] 12 Jul 2018
Linear System with Hidden Z-Matrix and Complementary Condition arxiv:1807.04536v1 math.oc 12 Jul 2018 R. Jana a, A. Dutta a,1, A. K. Das b a Jadavpur University, Kolkata, 700 032, India. b Indian Statistical
More informationChap 3. Linear Algebra
Chap 3. Linear Algebra Outlines 1. Introduction 2. Basis, Representation, and Orthonormalization 3. Linear Algebraic Equations 4. Similarity Transformation 5. Diagonal Form and Jordan Form 6. Functions
More informationVector Spaces. Addition : R n R n R n Scalar multiplication : R R n R n.
Vector Spaces Definition: The usual addition and scalar multiplication of n-tuples x = (x 1,..., x n ) R n (also called vectors) are the addition and scalar multiplication operations defined component-wise:
More informationA property concerning the Hadamard powers of inverse M-matrices
Linear Algebra and its Applications 381 (2004 53 60 www.elsevier.com/locate/laa A property concerning the Hadamard powers of inverse M-matrices Shencan Chen Department of Mathematics, Fuzhou University,
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 informationOn the Schur Complement of Diagonally Dominant Matrices
On the Schur Complement of Diagonally Dominant Matrices T.-G. Lei, C.-W. Woo,J.-Z.Liu, and F. Zhang 1 Introduction In 1979, Carlson and Markham proved that the Schur complements of strictly diagonally
More informationSign Patterns that Allow Diagonalizability
Georgia State University ScholarWorks @ Georgia State University Mathematics Dissertations Department of Mathematics and Statistics 12-10-2018 Sign Patterns that Allow Diagonalizability Christopher Michael
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 information2.3 Elementary Matrices; Finding A Equivalent Matrices. 25 September 2007
2.3 Elementary Matrices; Finding A 1 2.4 Equivalent Matrices 25 September 2007 ELEMENTARY MATRICES Definition: An n n matrix is row-elementary if it can be obtained from the n n identity matrix I n by
More informationECON2285: Mathematical Economics
ECON2285: Mathematical Economics Yulei Luo FBE, HKU September 2, 2018 Luo, Y. (FBE, HKU) ME September 2, 2018 1 / 35 Course Outline Economics: The study of the choices people (consumers, firm managers,
More informationSome New Results on Lyapunov-Type Diagonal Stability
Some New Results on Lyapunov-Type Diagonal Stability Mehmet Gumus (Joint work with Dr. Jianhong Xu) Department of Mathematics Southern Illinois University Carbondale 12/01/2016 mgumus@siu.edu (SIUC) Lyapunov-Type
More informationRelation of Pure Minimum Cost Flow Model to Linear Programming
Appendix A Page 1 Relation of Pure Minimum Cost Flow Model to Linear Programming The Network Model The network pure minimum cost flow model has m nodes. The external flows given by the vector b with m
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 informationMATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018
MATH 57: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 18 1 Global and Local Optima Let a function f : S R be defined on a set S R n Definition 1 (minimizers and maximizers) (i) x S
More informationPositive entries of stable matrices
Positive entries of stable matrices Shmuel Friedland Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago Chicago, Illinois 60607-7045, USA Daniel Hershkowitz,
More informationLecture Notes DRE 7007 Mathematics, PhD
Eivind Eriksen Lecture Notes DRE 7007 Mathematics, PhD August 21, 2012 BI Norwegian Business School Contents 1 Basic Notions.................................................. 1 1.1 Sets......................................................
More informationRITZ VALUE BOUNDS THAT EXPLOIT QUASI-SPARSITY
RITZ VALUE BOUNDS THAT EXPLOIT QUASI-SPARSITY ILSE C.F. IPSEN Abstract. Absolute and relative perturbation bounds for Ritz values of complex square matrices are presented. The bounds exploit quasi-sparsity
More informationIntroduction to Determinants
Introduction to Determinants For any square matrix of order 2, we have found a necessary and sufficient condition for invertibility. Indeed, consider the matrix The matrix A is invertible if and only if.
More informationDetailed Proof of The PerronFrobenius Theorem
Detailed Proof of The PerronFrobenius Theorem Arseny M Shur Ural Federal University October 30, 2016 1 Introduction This famous theorem has numerous applications, but to apply it you should understand
More informationb jσ(j), Keywords: Decomposable numerical range, principal character AMS Subject Classification: 15A60
On the Hu-Hurley-Tam Conjecture Concerning The Generalized Numerical Range Che-Man Cheng Faculty of Science and Technology, University of Macau, Macau. E-mail: fstcmc@umac.mo and Chi-Kwong Li Department
More information1 Convexity, concavity and quasi-concavity. (SB )
UNIVERSITY OF MARYLAND ECON 600 Summer 2010 Lecture Two: Unconstrained Optimization 1 Convexity, concavity and quasi-concavity. (SB 21.1-21.3.) For any two points, x, y R n, we can trace out the line of
More informationCHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.
1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function
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 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 informationPROFIT FUNCTIONS. 1. REPRESENTATION OF TECHNOLOGY 1.1. Technology Sets. The technology set for a given production process is defined as
PROFIT FUNCTIONS 1. REPRESENTATION OF TECHNOLOGY 1.1. Technology Sets. The technology set for a given production process is defined as T {x, y : x ɛ R n, y ɛ R m : x can produce y} where x is a vector
More informationMathematical Economics (ECON 471) Lecture 3 Calculus of Several Variables & Implicit Functions
Mathematical Economics (ECON 471) Lecture 3 Calculus of Several Variables & Implicit Functions Teng Wah Leo 1 Calculus of Several Variables 11 Functions Mapping between Euclidean Spaces Where as in univariate
More informationSparsity of Matrix Canonical Forms. Xingzhi Zhan East China Normal University
Sparsity of Matrix Canonical Forms Xingzhi Zhan zhan@math.ecnu.edu.cn East China Normal University I. Extremal sparsity of the companion matrix of a polynomial Joint work with Chao Ma The companion matrix
More information12. Perturbed Matrices
MAT334 : Applied Linear Algebra Mike Newman, winter 208 2. Perturbed Matrices motivation We want to solve a system Ax = b in a context where A and b are not known exactly. There might be experimental errors,
More information~ g-inverses are indeed an integral part of linear algebra and should be treated as such even at an elementary level.
Existence of Generalized Inverse: Ten Proofs and Some Remarks R B Bapat Introduction The theory of g-inverses has seen a substantial growth over the past few decades. It is an area of great theoretical
More informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
More informationDedicated to the late Professors David Hawkins and Hukukane Nikaido
TWO CHARACTERIZATIONS OF INVERSE-POSITIVE MATRICES: THE HAWKINS-SIMON CONDITION AND THE LE CHATELIER-BRAUN PRINCIPLE TAKAO FUJIMOTO AND RAVINDRA R RANADE Dedicated to the late Professors David Hawkins
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 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 informationThe Singular Value Decomposition
The Singular Value Decomposition Philippe B. Laval KSU Fall 2015 Philippe B. Laval (KSU) SVD Fall 2015 1 / 13 Review of Key Concepts We review some key definitions and results about matrices that will
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 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 informationA Characterization of the Hurwitz Stability of Metzler Matrices
29 American Control Conference Hyatt Regency Riverfront, St Louis, MO, USA June -2, 29 WeC52 A Characterization of the Hurwitz Stability of Metzler Matrices Kumpati S Narendra and Robert Shorten 2 Abstract
More informationSpectral Theorem for Self-adjoint Linear Operators
Notes for the undergraduate lecture by David Adams. (These are the notes I would write if I was teaching a course on this topic. I have included more material than I will cover in the 45 minute lecture;
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
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 informationOn the Hermitian solutions of the
Journal of Applied Mathematics & Bioinformatics vol.1 no.2 2011 109-129 ISSN: 1792-7625 (print) 1792-8850 (online) International Scientific Press 2011 On the Hermitian solutions of the matrix equation
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 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 informationSeptember Math Course: First Order Derivative
September Math Course: First Order Derivative Arina Nikandrova Functions Function y = f (x), where x is either be a scalar or a vector of several variables (x,..., x n ), can be thought of as a rule which
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 informationarxiv:math/ v2 [math.oa] 8 Oct 2006
arxiv:math/0507166v2 math.oa] 8 Oct 2006 ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE CHRISTOPHER J. HILLAR Abstract. A long-standing conjecture asserts that the polynomial p(t = Tr(A + tb m
More informationDivision of the Humanities and Social Sciences. Sums of sets, etc.
Division of the Humanities and Social Sciences Sums of sets, etc. KC Border September 2002 Rev. November 2012 Rev. September 2013 If E and F are subsets of R m, define the sum E + F = {x + y : x E; y F
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 informationMaximizing the numerical radii of matrices by permuting their entries
Maximizing the numerical radii of matrices by permuting their entries Wai-Shun Cheung and Chi-Kwong Li Dedicated to Professor Pei Yuan Wu. Abstract Let A be an n n complex matrix such that every row and
More informationA Simple Computational Approach to the Fundamental Theorem of Asset Pricing
Applied Mathematical Sciences, Vol. 6, 2012, no. 72, 3555-3562 A Simple Computational Approach to the Fundamental Theorem of Asset Pricing Cherng-tiao Perng Department of Mathematics Norfolk State University
More informationLinear Algebra Primer
Linear Algebra Primer D.S. Stutts November 8, 995 Introduction This primer was written to provide a brief overview of the main concepts and methods in elementary linear algebra. It was not intended to
More informationChapter 1: Linear Programming
Chapter 1: Linear Programming Math 368 c Copyright 2013 R Clark Robinson May 22, 2013 Chapter 1: Linear Programming 1 Max and Min For f : D R n R, f (D) = {f (x) : x D } is set of attainable values of
More information