Generated by GPT-5-mini| Hadamard's inequality | |
|---|---|
| Name | Hadamard's inequality |
| Field | Linear algebra |
| Introduced | 1893 |
| Introducedby | Jacques Hadamard |
Hadamard's inequality is a classical bound in matrix theory that relates the determinant of a matrix to the lengths of its row vectors. It asserts that for an n×n matrix with rows viewed as vectors in Euclidean n-space, the absolute value of the determinant is at most the product of the Euclidean norms of the rows. The inequality plays a central role in the study of volume, orthogonality, and lattice packing, and it connects to problems studied by leading figures and institutions in analysis, number theory, and geometry.
Let A be an n×n real matrix with rows r1, r2, ..., rn regarded as vectors in R^n. The inequality states |det(A)| ≤ ∏_{i=1}^n ||ri||, where ||·|| denotes the Euclidean norm. An elementary proof uses the Gram–Schmidt process to replace the row system by an orthogonal system without decreasing the product of norms, then identifies the determinant with the product of orthogonal vector lengths. This argument intersects techniques associated with Jacques Hadamard, Émile Picard, Camille Jordan, David Hilbert, and classical expositions from École Normale Supérieure and University of Göttingen; it also invokes constructions familiar to scholars at École Polytechnique, Imperial College London, and Princeton University who study matrix decompositions such as the QR factorization and the Gram matrix approach linked to Carl Friedrich Gauss and Joseph-Louis Lagrange.
Several proofs use the Cauchy–Binet formula, linking to work at Cambridge University by analysts influenced by Augustin-Louis Cauchy and Arthur Cayley. Alternative approaches exploit multilinear forms and Hadamard's determinant bound as presented in texts from University of Paris, Brown University, and Massachusetts Institute of Technology where instructors compare determinant estimates to orthonormalization methods developed by Erhard Schmidt and John von Neumann.
Equality holds precisely when the row vectors are mutually orthogonal (up to null rows), which characterizes extremal configurations in Euclidean space. The classification of equality instances relates to orthonormal bases studied at institutions such as King's College London and University of Cambridge, and to extremal problems considered by Pafnuty Chebyshev and Sofia Kovalevskaya in analytic contexts. For complex matrices, equality requires that rows be pairwise orthogonal with respect to the Hermitian inner product; this condition appears in works by Hermann Weyl and John von Neumann on unitary diagonalization and spectral theory, and in treatments at Harvard University and Yale University addressing unitary matrices and orthonormal systems.
Refinements characterize nearly extremal matrices, drawing on stability analysis from researchers at ETH Zurich and University of Bonn, and on convexity principles appearing in seminars at Institut des Hautes Études Scientifiques and Columbia University. These characterizations connect to optimal packing and design problems researched by scholars affiliated with Princeton University and Bell Labs.
Hadamard's inequality admits numerous extensions and relatives. The inequality for positive semidefinite matrices reads det(A) ≤ ∏_{i=1}^n a_{ii} for Hermitian matrices, a statement related to Schur complement techniques developed by Issai Schur and popularized at St. Petersburg University and University of Berlin. The inequality ties to the Hadamard product and to bounds in matrix analysis cataloged in treatises by Roger Horn and Charles R. Johnson at University of Utah and University of Wisconsin–Madison. Connections include the Hadamard three-circle theorem historically linked to Émile Picard and Élie Cartan, the Minkowski determinant theorem associated with Hermann Minkowski and Moscow State University, and the Brunn–Minkowski inequality studied at University of Göttingen and University of Vienna.
Other extensions encompass Bunyakovsky–Cauchy–Schwarz inequalities named for Vladimir Bunyakovsky and Augustin-Louis Cauchy, generalized singular value inequalities stemming from work by Eugene Wigner and Marcel Riesz, and inequalities for permanents compared in research from University of California, Berkeley and University of Chicago. Operator-norm versions and noncommutative adaptations appear in operator algebras literature at University of Pennsylvania and Yale University, while probabilistic versions resonate with investigations at Microsoft Research and Bell Labs into random matrices pioneered by Freeman Dyson and Eugene Wigner.
In linear algebra, Hadamard's inequality provides bounds for condition numbers, volume estimates for parallelepipeds, and constraints in algorithms for determinant approximation used at IBM Research and Google DeepMind. It underpins analysis of orthogonality and stability for QR decomposition exercises taught at Massachusetts Institute of Technology and Stanford University, and appears in complexity estimates in computational linear algebra courses at Carnegie Mellon University.
In number theory and geometry of numbers, the inequality bounds determinants of lattices, influencing Minkowski-type theorems investigated at Moscow State University and École Normale Supérieure, and is instrumental in establishing bounds for regulators and discriminants studied by David Hilbert, Helmut Hasse, and researchers at Max Planck Institute for Mathematics. It also aids in proofs concerning integer matrices, Diophantine approximation, and bounds on heights in arithmetic geometry as treated by scholars at Institute for Advanced Study, Princeton University, and University of Oxford.
The inequality is attributed to Jacques Hadamard in an 1893 work, reflecting analysis and geometric interests cultivated at Collège de France and École Normale Supérieure. Hadamard's contemporaries such as Émile Picard and Camille Jordan influenced the mathematical milieu that framed the result, and later expositions by Hermann Weyl, John von Neumann, and authors at University of Göttingen helped integrate the inequality into modern matrix theory. The result has been referenced in classical texts from Cambridge University Press and in lecture notes originating from University of Paris and Princeton University, and it continues to appear in contemporary research across institutions including ETH Zurich, Harvard University, and Stanford University.