On Nonsingularity of Saddle Point Matrices. with Vectors of Ones
|
|
- Scot Thomas
- 6 years ago
- Views:
Transcription
1 Iteratioal Joural of Algebra, Vol. 2, 2008, o. 4, O Nosigularity of Saddle Poit Matrices with Vectors of Oes Tadeusz Ostrowski Istitute of Maagemet The State Vocatioal Uiversity -400 Gorzów, Polad Tadostr@Iteria.pl Abstract This paper describes ad aalyzes osigularity coditios of saddle poit matrices with two vector blocks of oes. These kid of matrices occur i stadard quadratic program (whe the left-up block is a symmetric matrix) ad i game theory (whe the leftup block is ay square matrix) or i special liear systems called equilibrium systems. Necessary ad sufficiet coditios for the osigularity are ivestigated. We review some kow coditios i the literature as well. Mathematics Subject Classificatios: 15A03, 15A15 Keywords: Saddle Poit Matrix, Nosigularity Coditio 1. Itroductio The paper deals with saddle poit matrices with two vector of oes, i.e. the block matrices i which the top-left submatrix is a real square matrix, the top-right block is the colum vector e (the vector with all compoets 1), the bottom-left block is e trasposed, ad the bottom-right block has the sigle etry 0. If the top-left submatrix is symmetric, the the saddle poit matrix may be iterpreted as the bordered Hessia of a stadard quadratic program over the stadard simplex ad it is usually called the Karush-Kuh-Tucker matrix of the program which is kow to have a very large spectrum of applicatios (for a review, see Bomze [2]). It is well kow that it is ot ecessary for the left-up submatrix to be defiite or eve osigular for the saddle poit matrix to be osigular.
2 198 T. Ostrowski 2. Notatio Deote by e R the colum vector with all oes, ad let E R, stads for the matrix with all etries equal to oe. Hece E = ee T. For a give matrix A R, deote by (A, e) the matrix, ofte called the saddle poit matrix, havig the structure (A, e) = A T e 0. (1) Let Z R, 1 deotes a matrix give as follows Z = O ( 1) ( 1) ( 1) ( 1) ( 1) ( 1)... ( 1). (2) Etries of colums of Z sum up to zero ad its orthoormal colums are a basis of the ull space of e T. It ca be writte shortly e T Z = 0, Z T Z = I. A B Block matrices are ofte deoted as the ordered quadruple (A, B, C, D). C D I this paper, sice always we cosider the case B = C T = e, ad D = 0, the the shorteed otatio (A, e) is used. By (A k, e), (A k, e); k = 1,, is deoted the matrix obtaied from (A, e) by replacig i A the k-th row (k-th colum, respectively) with the vector e T (e, respectively). The stadard otatio M/A is used for the Schur complemet of the osigular matrix A i the partitioed matrix M. Recall that two square matrices A ad B are called cogruet, which is writte as A B, if there exists a osigular matrix P such that B = P T AP. 3. Properties of (A, e) I this sectio we preset a few basic properties of the saddle poit matrices with the structure (1). More the properties ca be foud i Ostrowski [5]. Let start from the followig: Theorem 1. If A, E = ee T R, the for ay real umbers α, β the followig holds:
3 Nosigularity of saddle poit matrices 199 det(αa + βe, e) = α 1 det(a, e) (3) det(αα + βe) = α 1 [α deta β det(a, e)] (4) Proof. Obviously if α = 0, the (3) holds trivially. Assumig that α 0, subtractig the last colum multiplied by β from each of the other colums i the matrix (αa+βe, e) ad the usig multiliearity of the determiat, gives αa + βe e αa e det(αa+βe, e) = det T = det e 0 = T 0 = a 1 A e α det T = a 1 det A e 0 = α 1 det(a, e). T 0 To prove (4) we show first that for ay B R, the particular equality is true, amely det(b + βe) = detb β det(b, e), (5) which trivially holds for β = 0. The derivative of det(b + βe) with respect to β gives d[det( B + βe)] = det (B + βe) i = det B i = det(b, e). dβ i = 1 i = 1 Sice the, we have det(b + βe) = det (B, e)dβ = βdet(b, e) + C. Substitute β = 0, we get C = detb, which gives (5). The geeral case of (4) is obtaied from (5) by replacig B with αa: det(αb + βe) = det(αa) β det(αa, e) = α deta βα 1 det(a, e) = = α 1 [α deta β det(a, e)]. Theorem 2. Let A = (a ij ) R,. If all etries of every row A sum up to the same costat c R, the det(a k, e) = 1 det(a, e). () If all etries of every colum of A sum up to the same costat c R, the det(a k, e) = 1 det(a, e). (7) I each cases det(a, e) = deta, c 0 c det( A βe), c = 0, β 0 β (8)
4 200 T. Ostrowski I particular if c = 0 the det(a βe) = βdet(a, e) for all β. Proof. We start from the equatio () for c = 0. By assumptio, i the cosiderable case the followig equality holds a kj = i k a. ij Deote by M ij (i, j = 1,, ) miors of the matrix A. It ca be cocluded that the miors with respect to the k-th row are equal ad they differ oly i sig, i.e. M kj + M k,j+1 = 0 The equality above meas that all cofactors of A are equal. Therefore det(a k, e) = det(a k+1, e), k = 1,, 1. Hece it implies () for c = 0. The proof of (7) for c = 0 rus similarly. The equality (8) for c = 0 follows from Laplace evaluatio ad (4), if we put α = 1, β 0. Assume ow that the etries of all rows of the give matrix A sum up to c 0 ad deote by à = (ã ij ) a matrix with etries defied as follows ã ij = a ij c for all i, j = 1,,. Therefore the matrix à has the form give as follows à = A c E ad obviously etries of à sum up zero. Sice the det à = 0. O the other had, by (4), we have det à = det(a c E) = deta + c det(a, e), ad this meas that the equality (8) holds for ay c R. We ca show ow () for ay c R. Sice () is true for c = 0, we have a kj j = 1 ~ = 0 => det(ã k, e) = 1 det(ã, e). (9) e It is obvious that by property of the determiat, if we add last colum multiplied by to each colum except the k-th oe, we get c det(ã k, e) = det(a k, e). Therefore the right side of (9) ca be ow rewritte as follows det(a k, e) = 1 det(a c E, e). Settig α = 1, β = c i (3), we get (). Aalogically we prove (7). Theorem 3. If A is osigular, the the followig holds
5 Nosigularity of saddle poit matrices 201 raka, if e T A 1 e = 0, rak(a, e) = (10) 1 + raka, if e T A 1 e 0. Proof. By Schur determiat formula we obtai det(a, e) = e T A 1 e det A. O the other had, Guttma rak additivity formula, Zhag [7], states that for a matrix (A, e), if A is osigular, the rak(a, e) = raka + rak(e T A 1 e), which eds the proof. Corollaries. If (A, e) is osigular ad rak(a, e) = + 1, the the raka is either or 1. The coverse, of course, is ot true. However, if the matrix A is both symmetric ad positive defiite, the det(a, e) 0 (see also [1]). Moreover, if A is positive defiite, the (A, e) has oe egative eigevalue ad positive oes. The reaso is that if A is symmetric, the (A, e), beig a Hessia of appropriate Lagragea, is also symmetric but ievitably idefiite. If A is symmetric ad osigular, the (A, e) A 0 s, where s = (A, e)/a = e T A 1 e, ad both cogruet matrices have equal determiat (see also []). Really, for P = I 1 A e 1 we have (A, e) = P T A 0 s P. The cogruece above implies that if A is positive defiite, the the uique egative eigevalue of (A, e) is equal to s. 4. Characterizatio of Nosigularity Various differet coditios for osigularity of matrices with the structure (1) have bee formulated at several places i the literature. Gasterer, Scheid ad Ueberhuber, [3] state that the followig properties are equivalet for give (A, e) R +1, +1 : (i) rak(a, e) = + 1,
6 202 T. Ostrowski (ii) det[az e] 0, (iii) det(z T AZ) 0, (iv) A T A + E 1 A T EA is positive defiite. Recall also ecessary coditio for osigularity of (A, e). It is give as follows (see for istace, Bezi, Golub ad Liese [1]): A det(a, e) 0 => rak T =. Theorem 4. Let A R,. For the followig statemets (i) rak(a, e) = + 1, (v) det(a + βe) 0 for some β R, (vi) e T x = 0 = > x T Ax 0 (x 0), the followig equivaleces hold: (1) <=> (2) for ay matrix A, (1) <=> (3) for symmetric positive semidefiite matrices, Proof. (i) => (v): From equality (4), settig α = 1, we have det(a + βe) = deta βdet(a, e). Therefore, sice det(a, e) 0, holds det(a + βe) 0 for β R {0}, if deta = 0, for β det A, if deta 0. det( A, e) (v) => (i): Let β be a ozero real umber such that det(a + βe) deta + det(βe) = deta. Applyig (4) for α = 1, we get βdet(a, e) = deta det(a + βe) 0, which eds the proof. (i) => (vi) Proof by cotradictio. Suppose that for some ozero vector x R holds e T x = 0 ad x T Ax = 0. The suppositio that A is positive semidefiite implies that Ax = 0 (see for i-
7 Nosigularity of saddle poit matrices 203 x stace Hor ad Johso [4]). Sice the, settig v = 0, we have A e x (A, e)v = T 0 = 0. Therefore rak(a, e) < +1 (cotradictio). (vi) => (i). We have to show that (A, e)v = 0 => v = 0. x Let set v = ; x R, α R. The equality (A, e)v = 0 meas that the followig α equivalece holds A e x 0 T 0 = α <=> (e T x = 0 i Ax + αe = 0). From above multiplyig the equality Ax + αe = 0 by vector x T, we get x T Ax + αx T e = x T Ax + α(e T x) T = x T Ax + α0 = x T Ax = 0. It implies by suppositio that x = 0. Therefore we obtai that αe = 0, ad cosequetly α = 0, ad fially v = 0. Note that (A, e) with A symmetric semidefiite, without coditio (vi), is ot 1 1 ecessarily osigular. For example, if A =, the det(a, e) = Note also that i geeral A eed ot be osigular for (A, e) to be osigular, but if A is osigular (Theorem 3), the rak(a, e) = raka, if e T A 1 e = 0, 1 + raka, if e T A 1 e 0. Refereces [1] M. Bezi, G. H. Golub ad J. Liese. (2005). Numerical solutio of saddle poit problems, Acta Numerica, Cambridge Uiversity Press, pp [2] I. M. Bomze. (1998). O stadard quadratic optimizatio problems, Joural of Global Optimizatio 13, pp [3] W. Gasterer, J. Scheid ad C. Ueberhuber. (2003). Mathematical Properties of Equilibrium Systems, Techical Report AURORA TR
8 204 T. Ostrowski [4] R, A. Hor ad C. R. Johso. (1985). Matrix Aalysis. Cambridge Uiversity Press, Cambridge. [5] T. Ostrowski. (2007). O Some Properties of Saddle Poit Matrices with Vector Blocks, Iteratioal Joural of Algebra, Vol.1, o.3, pp [] Y. Tia ad Y. Takae. (2005). Schur complemets ad Baachiewicz-Schur forms. Electroic Joural of Liear Algebra, 13, pp [7] F. Zhag. (2005), Editor. The Schur Complemet Ad Its Applicatios. Numerical Methods ad Algorithms, Vol. 4, Spriger-Verlag, New York Ic. Received: September 1, 2007
Stochastic Matrices in a Finite Field
Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices
More informationDeterminants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)
5. Determiats 5.. Itroductio 5.2. Motivatio for the Choice of Axioms for a Determiat Fuctios 5.3. A Set of Axioms for a Determiat Fuctio 5.4. The Determiat of a Diagoal Matrix 5.5. The Determiat of a Upper
More informationA Hadamard-type lower bound for symmetric diagonally dominant positive matrices
A Hadamard-type lower boud for symmetric diagoally domiat positive matrices Christopher J. Hillar, Adre Wibisoo Uiversity of Califoria, Berkeley Jauary 7, 205 Abstract We prove a ew lower-boud form of
More informationPROBLEM SET I (Suggested Solutions)
Eco3-Fall3 PROBLE SET I (Suggested Solutios). a) Cosider the followig: x x = x The quadratic form = T x x is the required oe i matrix form. Similarly, for the followig parts: x 5 b) x = = x c) x x x x
More informationThe inverse eigenvalue problem for symmetric doubly stochastic matrices
Liear Algebra ad its Applicatios 379 (004) 77 83 www.elsevier.com/locate/laa The iverse eigevalue problem for symmetric doubly stochastic matrices Suk-Geu Hwag a,,, Sug-Soo Pyo b, a Departmet of Mathematics
More informationMatrix Algebra 2.2 THE INVERSE OF A MATRIX Pearson Education, Inc.
2 Matrix Algebra 2.2 THE INVERSE OF A MATRIX MATRIX OPERATIONS A matrix A is said to be ivertible if there is a matrix C such that CA = I ad AC = I where, the idetity matrix. I = I I this case, C is a
More informationInverse Matrix. A meaning that matrix B is an inverse of matrix A.
Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix
More informationOn the distribution of coefficients of powers of positive polynomials
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 49 (2011), Pages 239 243 O the distributio of coefficiets of powers of positive polyomials László Major Istitute of Mathematics Tampere Uiversity of Techology
More informationChapter 2. Periodic points of toral. automorphisms. 2.1 General introduction
Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad
More informationPAijpam.eu ON TENSOR PRODUCT DECOMPOSITION
Iteratioal Joural of Pure ad Applied Mathematics Volume 103 No 3 2015, 537-545 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://wwwijpameu doi: http://dxdoiorg/1012732/ijpamv103i314
More information(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:
Math 50-004 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig
More informationChapter Vectors
Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it
More informationTheorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e.
Theorem: Let A be a square matrix The A has a iverse matrix if ad oly if its reduced row echelo form is the idetity I this case the algorithm illustrated o the previous page will always yield the iverse
More informationBounds for the Extreme Eigenvalues Using the Trace and Determinant
ISSN 746-7659, Eglad, UK Joural of Iformatio ad Computig Sciece Vol 4, No, 9, pp 49-55 Bouds for the Etreme Eigevalues Usig the Trace ad Determiat Qi Zhog, +, Tig-Zhu Huag School of pplied Mathematics,
More informationMatrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc.
2 Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES 2012 Pearso Educatio, Ic. Theorem 8: Let A be a square matrix. The the followig statemets are equivalet. That is, for a give A, the statemets
More informationLECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK)
LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) Everythig marked by is ot required by the course syllabus I this lecture, all vector spaces is over the real umber R. All vectors i R is viewed as a colum
More information(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:
Math 5-4 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig facts,
More informationThe Method of Least Squares. To understand least squares fitting of data.
The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve
More informationMATH10212 Linear Algebra B Proof Problems
MATH22 Liear Algebra Proof Problems 5 Jue 26 Each problem requests a proof of a simple statemet Problems placed lower i the list may use the results of previous oes Matrices ermiats If a b R the matrix
More informationChapter Unary Matrix Operations
Chapter 04.04 Uary atrix Operatios After readig this chapter, you should be able to:. kow what uary operatios meas, 2. fid the traspose of a square matrix ad it s relatioship to symmetric matrices,. fid
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationDisjoint unions of complete graphs characterized by their Laplacian spectrum
Electroic Joural of Liear Algebra Volume 18 Volume 18 (009) Article 56 009 Disjoit uios of complete graphs characterized by their Laplacia spectrum Romai Boulet boulet@uiv-tlse.fr Follow this ad additioal
More informationCMSE 820: Math. Foundations of Data Sci.
Lecture 17 8.4 Weighted path graphs Take from [10, Lecture 3] As alluded to at the ed of the previous sectio, we ow aalyze weighted path graphs. To that ed, we prove the followig: Theorem 6 (Fiedler).
More informationApplications in Linear Algebra and Uses of Technology
1 TI-89: Let A 1 4 5 6 7 8 10 Applicatios i Liear Algebra ad Uses of Techology,adB 4 1 1 4 type i: [1,,;4,5,6;7,8,10] press: STO type i: A type i: [4,-1;-1,4] press: STO (1) Row Echelo Form: MATH/matrix
More informationc 2006 Society for Industrial and Applied Mathematics
SIAM J. MATRIX ANAL. APPL. Vol. 7, No. 3, pp. 851 860 c 006 Society for Idustrial ad Applied Mathematics EXTREMAL EIGENVALUES OF REAL SYMMETRIC MATRICES WITH ENTRIES IN AN INTERVAL XINGZHI ZHAN Abstract.
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationChapter 6: Determinants and the Inverse Matrix 1
Chapter 6: Determiats ad the Iverse Matrix SECTION E pplicatios of Determiat By the ed of this sectio you will e ale to apply Cramer s rule to solve liear equatios ermie the umer of solutios of a give
More informationMatrices and vectors
Oe Matrices ad vectors This book takes for grated that readers have some previous kowledge of the calculus of real fuctios of oe real variable It would be helpful to also have some kowledge of liear algebra
More informationSupplemental Material: Proofs
Proof to Theorem Supplemetal Material: Proofs Proof. Let be the miimal umber of traiig items to esure a uique solutio θ. First cosider the case. It happes if ad oly if θ ad Rak(A) d, which is a special
More informationProof of Fermat s Last Theorem by Algebra Identities and Linear Algebra
Proof of Fermat s Last Theorem by Algebra Idetities ad Liear Algebra Javad Babaee Ragai Youg Researchers ad Elite Club, Qaemshahr Brach, Islamic Azad Uiversity, Qaemshahr, Ira Departmet of Civil Egieerig,
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationDecoupling Zeros of Positive Discrete-Time Linear Systems*
Circuits ad Systems,,, 4-48 doi:.436/cs..7 Published Olie October (http://www.scirp.org/oural/cs) Decouplig Zeros of Positive Discrete-Time Liear Systems* bstract Tadeusz Kaczorek Faculty of Electrical
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More informationFor a 3 3 diagonal matrix we find. Thus e 1 is a eigenvector corresponding to eigenvalue λ = a 11. Thus matrix A has eigenvalues 2 and 3.
Closed Leotief Model Chapter 6 Eigevalues I a closed Leotief iput-output-model cosumptio ad productio coicide, i.e. V x = x = x Is this possible for the give techology matrix V? This is a special case
More informationA Note On The Exponential Of A Matrix Whose Elements Are All 1
Applied Mathematics E-Notes, 8(208), 92-99 c ISSN 607-250 Available free at mirror sites of http://wwwmaththuedutw/ ame/ A Note O The Expoetial Of A Matrix Whose Elemets Are All Reza Farhadia Received
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationBrief Review of Functions of Several Variables
Brief Review of Fuctios of Several Variables Differetiatio Differetiatio Recall, a fuctio f : R R is differetiable at x R if ( ) ( ) lim f x f x 0 exists df ( x) Whe this limit exists we call it or f(
More informationON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS
ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary
More information1 Last time: similar and diagonalizable matrices
Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero
More informationRiesz-Fischer Sequences and Lower Frame Bounds
Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.
More informationTopics in Eigen-analysis
Topics i Eige-aalysis Li Zajiag 28 July 2014 Cotets 1 Termiology... 2 2 Some Basic Properties ad Results... 2 3 Eige-properties of Hermitia Matrices... 5 3.1 Basic Theorems... 5 3.2 Quadratic Forms & Noegative
More informationA note on the Frobenius conditional number with positive definite matrices
Li et al. Joural of Iequalities ad Applicatios 011, 011:10 http://www.jouralofiequalitiesadapplicatios.com/cotet/011/1/10 RESEARCH Ope Access A ote o the Frobeius coditioal umber with positive defiite
More informationStability of fractional positive nonlinear systems
Archives of Cotrol Scieces Volume 5(LXI), 15 No. 4, pages 491 496 Stability of fractioal positive oliear systems TADEUSZ KACZOREK The coditios for positivity ad stability of a class of fractioal oliear
More information8. Applications To Linear Differential Equations
8. Applicatios To Liear Differetial Equatios 8.. Itroductio 8.. Review Of Results Cocerig Liear Differetial Equatios Of First Ad Secod Orders 8.3. Eercises 8.4. Liear Differetial Equatios Of Order N 8.5.
More informationThe Structure of Z p when p is Prime
LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationEstimation of Backward Perturbation Bounds For Linear Least Squares Problem
dvaced Sciece ad Techology Letters Vol.53 (ITS 4), pp.47-476 http://dx.doi.org/.457/astl.4.53.96 Estimatio of Bacward Perturbatio Bouds For Liear Least Squares Problem Xixiu Li School of Natural Scieces,
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationTRACES OF HADAMARD AND KRONECKER PRODUCTS OF MATRICES. 1. Introduction
Math Appl 6 2017, 143 150 DOI: 1013164/ma201709 TRACES OF HADAMARD AND KRONECKER PRODUCTS OF MATRICES PANKAJ KUMAR DAS ad LALIT K VASHISHT Abstract We preset some iequality/equality for traces of Hadamard
More informationMath 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions
Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationIterative Techniques for Solving Ax b -(3.8). Assume that the system has a unique solution. Let x be the solution. Then x A 1 b.
Iterative Techiques for Solvig Ax b -(8) Cosider solvig liear systems of them form: Ax b where A a ij, x x i, b b i Assume that the system has a uique solutio Let x be the solutio The x A b Jacobi ad Gauss-Seidel
More informationOptimization Methods MIT 2.098/6.255/ Final exam
Optimizatio Methods MIT 2.098/6.255/15.093 Fial exam Date Give: December 19th, 2006 P1. [30 pts] Classify the followig statemets as true or false. All aswers must be well-justified, either through a short
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationEigenvalues and Eigenvectors
5 Eigevalues ad Eigevectors 5.3 DIAGONALIZATION DIAGONALIZATION Example 1: Let. Fid a formula for A k, give that P 1 1 = 1 2 ad, where Solutio: The stadard formula for the iverse of a 2 2 matrix yields
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationLinear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d
Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More informationMAT 271 Project: Partial Fractions for certain rational functions
MAT 7 Project: Partial Fractios for certai ratioal fuctios Prerequisite kowledge: partial fractios from MAT 7, a very good commad of factorig ad complex umbers from Precalculus. To complete this project,
More informationLinear Regression Demystified
Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to
More informationSYMMETRIC POSITIVE SEMI-DEFINITE SOLUTIONS OF AX = B AND XC = D
Joural of Pure ad Alied Mathematics: Advaces ad Alicatios olume, Number, 009, Pages 99-07 SYMMERIC POSIIE SEMI-DEFINIE SOLUIONS OF AX B AND XC D School of Mathematics ad Physics Jiagsu Uiversity of Sciece
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More informationMatrix Algebra from a Statistician s Perspective BIOS 524/ Scalar multiple: ka
Matrix Algebra from a Statisticia s Perspective BIOS 524/546. Matrices... Basic Termiology a a A = ( aij ) deotes a m matrix of values. Whe =, this is a am a m colum vector. Whe m= this is a row vector..2.
More informationa for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a
Math S-b Lecture # Notes This wee is all about determiats We ll discuss how to defie them, how to calculate them, lear the allimportat property ow as multiliearity, ad show that a square matrix A is ivertible
More informationHomework Set #3 - Solutions
EE 15 - Applicatios of Covex Optimizatio i Sigal Processig ad Commuicatios Dr. Adre Tkaceko JPL Third Term 11-1 Homework Set #3 - Solutios 1. a) Note that x is closer to x tha to x l i the Euclidea orm
More informationON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS
Joural of Algebra, Number Theory: Advaces ad Applicatios Volume, Number, 00, Pages 7-89 ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS OLCAY KARAATLI ad REFİK KESKİN Departmet
More informationSome Basic Diophantine Equations
Some Basic iophatie Equatios R.Maikada, epartmet of Mathematics, M.I.E.T. Egieerig College, Tiruchirappalli-7. Email: maimaths78@gmail.com bstract- - I this paper we preset a method for solvig the iophatie
More informationOn Some Properties of Digital Roots
Advaces i Pure Mathematics, 04, 4, 95-30 Published Olie Jue 04 i SciRes. http://www.scirp.org/joural/apm http://dx.doi.org/0.436/apm.04.46039 O Some Properties of Digital Roots Ilha M. Izmirli Departmet
More informationResistance matrix and q-laplacian of a unicyclic graph
Resistace matrix ad q-laplacia of a uicyclic graph R. B. Bapat Idia Statistical Istitute New Delhi, 110016, Idia e-mail: rbb@isid.ac.i Abstract: The resistace distace betwee two vertices of a graph ca
More informationLainiotis filter implementation. via Chandrasekhar type algorithm
Joural of Computatios & Modellig, vol.1, o.1, 2011, 115-130 ISSN: 1792-7625 prit, 1792-8850 olie Iteratioal Scietific Press, 2011 Laiiotis filter implemetatio via Chadrasehar type algorithm Nicholas Assimais
More informationLinear combinations of graph eigenvalues
Electroic Joural of Liear Algebra Volume 5 Volume 5 2006 Article 27 2006 Liear combiatios of graph eigevalues Vladimir ikiforov vikifrv@memphis.edu Follow this ad additioal works at: http://repository.uwyo.edu/ela
More informationAssignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.
PHYSICS 34 QUANTUM PHYSICS II (25) Assigmet 2 Solutios 1. With respect to a pair of orthoormal vectors ϕ 1 ad ϕ 2 that spa the Hilbert space H of a certai system, the operator  is defied by its actio
More informationProbability, Expectation Value and Uncertainty
Chapter 1 Probability, Expectatio Value ad Ucertaity We have see that the physically observable properties of a quatum system are represeted by Hermitea operators (also referred to as observables ) such
More informationOn forward improvement iteration for stopping problems
O forward improvemet iteratio for stoppig problems Mathematical Istitute, Uiversity of Kiel, Ludewig-Mey-Str. 4, D-24098 Kiel, Germay irle@math.ui-iel.de Albrecht Irle Abstract. We cosider the optimal
More informationLecture 8: October 20, Applications of SVD: least squares approximation
Mathematical Toolkit Autum 2016 Lecturer: Madhur Tulsiai Lecture 8: October 20, 2016 1 Applicatios of SVD: least squares approximatio We discuss aother applicatio of sigular value decompositio (SVD) of
More informationFibonacci numbers and orthogonal polynomials
Fiboacci umbers ad orthogoal polyomials Christia Berg April 10, 2006 Abstract We prove that the sequece (1/F +2 0 of reciprocals of the Fiboacci umbers is a momet sequece of a certai discrete probability,
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationA Note on the Symmetric Powers of the Standard Representation of S n
A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,
More informationSummary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function
Summary: Cogrueces j whe divided by, ad determiig the additive order of a iteger mod. As described i the Prelab sectio, cogrueces ca be thought of i terms of coutig with rows, ad for some questios this
More informationChapter IV Integration Theory
Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where
More informationPolynomials with Rational Roots that Differ by a Non-zero Constant. Generalities
Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationON MEAN ERGODIC CONVERGENCE IN THE CALKIN ALGEBRAS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX0000-0 ON MEAN ERGODIC CONVERGENCE IN THE CALKIN ALGEBRAS MARCH T. BOEDIHARDJO AND WILLIAM B. JOHNSON 2
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationPhysics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001.
Physics 324, Fall 2002 Dirac Notatio These otes were produced by David Kapla for Phys. 324 i Autum 2001. 1 Vectors 1.1 Ier product Recall from liear algebra: we ca represet a vector V as a colum vector;
More information6. Kalman filter implementation for linear algebraic equations. Karhunen-Loeve decomposition
6. Kalma filter implemetatio for liear algebraic equatios. Karhue-Loeve decompositio 6.1. Solvable liear algebraic systems. Probabilistic iterpretatio. Let A be a quadratic matrix (ot obligatory osigular.
More informationCourse : Algebraic Combinatorics
Course 18.312: Algebraic Combiatorics Lecture Notes # 18-19 Addedum by Gregg Musier March 18th - 20th, 2009 The followig material ca be foud i a umber of sources, icludig Sectios 7.3 7.5, 7.7, 7.10 7.11,
More informationa for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a
Math E-2b Lecture #8 Notes This week is all about determiats. We ll discuss how to defie them, how to calculate them, lear the allimportat property kow as multiliearity, ad show that a square matrix A
More informationSome remarks on a generalized vector product
Revista Itegració Escuela de Matemáticas Uiversidad Idustrial de Satader Vol. 9, No., 011, pág. 151 16 Some remarks o a geeralized vector product Primitivo Acosta-Humáez a, Moisés Arada b, Reialdo Núñez
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationCHAPTER 10. Majorization and Matrix Inequalities. 10.1/1 Find two vectors x, y R 3 such that neither x y nor x y holds.
CHAPTER 10 Majorizatio ad Matrix Iequalities 10.1/1 Fid two vectors x, y R 3 such that either x y or x y holds. Solutio: Take x = (1, 1 ad y = (2, 3. 10.1/2 Let y = (2, 1 R 2. Sketch the followig sets
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationSummary and Discussion on Simultaneous Analysis of Lasso and Dantzig Selector
Summary ad Discussio o Simultaeous Aalysis of Lasso ad Datzig Selector STAT732, Sprig 28 Duzhe Wag May 4, 28 Abstract This is a discussio o the work i Bickel, Ritov ad Tsybakov (29). We begi with a short
More information( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let.
Joh Riley 8 Jue 03 ANSWERS TO EXERCISES IN APPENDIX B Sectio B VECTORS AND SETS Exercise B-: Covex sets (a) Let 0 x, x X, X, hece 0 x, x X ad 0 x, x X Sice X ad X are covex, x X ad x X The x X X, which
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationCHAPTER 5 SOME MINIMAX AND SADDLE POINT THEOREMS
CHAPTR 5 SOM MINIMA AND SADDL POINT THORMS 5. INTRODUCTION Fied poit theorems provide importat tools i game theory which are used to prove the equilibrium ad eistece theorems. For istace, the fied poit
More information