Bounds on determinants of perturbed diagonal matrices
Abstract
We give upper and lower bounds on the determinant of a perturbation of the identity matrix or, more generally, a perturbation of a nonsingular diagonal matrix. The matrices considered are, in general, diagonally dominant. The lower bounds are best possible, and in several cases they are stronger than well-known bounds due to Ostrowski and other authors. If A = I-E is an n × n matrix and the elements of E are bounded in absolute value by 1/n, then a lower bound of Ostrowski (1938) is (A) 1-n. We show that if, in addition, the diagonal elements of E are zero, then a best-possible lower bound is \[(A) (1-(n-1))\,(1+)n-1.\] Corresponding upper bounds are respectively \[(A) (1 + 2 + n2)n/2\] and \[(A) (1 + (n-1)2)n/2.\] The first upper bound is stronger than Ostrowski's bound (for < 1/n) (A) (1 - n)-1. The second upper bound generalises Hadamard's inequality, which is the case = 1. A necessary and sufficient condition for our upper bounds to be best possible for matrices of order n and all positive is the existence of a skew-Hadamard matrix of order n.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.