A determinantal inequality and its permanental counterpart (Q4366164)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1089479
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A determinantal inequality and its permanental counterpart |
scientific article; zbMATH DE number 1089479 |
Statements
A determinantal inequality and its permanental counterpart (English)
0 references
10 March 1998
0 references
determinant inequality
0 references
permanent
0 references
inequality
0 references
positive semidefinite
0 references
Grassmann product
0 references
symmetric product
0 references
compound matrices
0 references
elementary symmetric
0 references
row sum
0 references
column sum
0 references
0.7979273796081543
0 references
0.7968465089797974
0 references
0.7960324287414551
0 references
Let \(A,B\) \(n\times \ell\) and \(C,D\) \(n\times m\) complex matrices. Then (1): \(|\det(CA^*+DB^*)|^2\leq \det(AA^*+BB^*) \det(CC^*+DD^*)\). The proof exploits equivalence of (1) with the positivity of the determinant of a certain \(2\times 2\) principal submatrix of the \(n-\)th compound of a certain \(2n\times 2n\) positive definite matrix \(M=M(A,B,C,D)\). A somewhat analogous argument using induced matrices permits to show (1) after replacing the determinant everywhere by the permanent. Cases of equality are elaborated using multilinear algebra. Finally, using earlier work, \textit{D. London} [Linear Multilinear Algebra 1, 231-240 (1973; Zbl 0289.15005)] an inequality using elementary symmetric functions, the line sum vectors, and the sum of the permanents of \(k\times k\) submatrices of an \(n\times n\) matrix \(A\) as ingredients is proven.
0 references