5
$\begingroup$

The well-known Oppenheim inequality says that for two positive definite matrices $A,B$ it holds that $\det(A \circ B) \geq (\prod{a_{ii}})\det(B)$.

There has been a lot of beautiful work done extending it to cases when $A$ or $B$ or both of them are $M$-matrices or their inverses, or totally nonnegative.

My question is: do you know of other extensions, in which $A$ is non-symmetric in an "interesting" way?

$\endgroup$
2
  • 1
    $\begingroup$ what is the notation $A \circ B$? $\endgroup$
    – JHM
    Commented Aug 30, 2012 at 3:13
  • 1
    $\begingroup$ Entrywise product of matrices. $\endgroup$ Commented Aug 31, 2012 at 15:01

2 Answers 2

5
$\begingroup$

This is not a generalization to other matrix classes, but replacing determinant by permanent. Actually, it is a conjecture made by Bapat and Sunder: Under the same conditions $per(A \circ B) \leq (\prod{a_{ii}})per(B)$.

...but the following result due to Jiao [On a conjecture of H. Minc, Linear and Multilinear Algebra 32 (1992) 103–105.] couldn't surprise me more $$per(A \circ B)+per (A) per (B) \geq (\prod{a_{ii}})per(B)+(\prod{b_{ii}})per(A).$$

$\endgroup$
2
  • 1
    $\begingroup$ After this inequality, and that of Fallat & Johnson (see my answer below), could it be that for every immanent $I$ and every positive definite symmetric matrices $A,B$, we have $$I(A\circ B)+I(A)I(B)\ge(\prod a_{ii})I(B)+(\prod b_{ii})I(A)\qquad ?$$ $\endgroup$ Commented Feb 5, 2013 at 23:14
  • 1
    $\begingroup$ This would be a big conjecture. I don't know the answer. Would you post it as a new problem. $\endgroup$
    – Betrand
    Commented Feb 6, 2013 at 20:27
4
$\begingroup$

This is not a generalization to other matrix classes, but a generalization of the inequality, within the same class of Hermitian positive definite (or semi-definite) matrices. The flaw of Oppenheim's inequality is that the right-hand side is not symmetric in $A$ and $B$, unlike the left-hand side. Instead, S. Fallat & C. Johnson proved a symmetric form of OI: $$\det(A \circ B)+\det A\det B \geq (\prod{a_{ii}})\det(B)+(\prod{b_{ii}})\det(A).$$ See Exercise 285 in my List of exercises on Matrices.

$\endgroup$
7
  • $\begingroup$ Thanks, Dennis, that's a really beautiful one. (Looks a bit like a modular formula to me, but probably it's just my weird mathsight). Do you know perhaps of a useful way to reduce the non-Hermitian case the Hermitian that might help out here? $\endgroup$ Commented Aug 29, 2012 at 9:22
  • $\begingroup$ @Felix. I am not rich enough to afford two n's in my first name. $\endgroup$ Commented Aug 29, 2012 at 14:41
  • $\begingroup$ Sorry <blush>.... $\endgroup$ Commented Aug 31, 2012 at 15:01
  • 1
    $\begingroup$ Shall we pass around a hat to buy Denis another n? $\endgroup$ Commented Feb 5, 2013 at 23:54
  • 1
    $\begingroup$ That inequality is not due to S. Fallat & C. Johnson. It is called the Oppenheim-Schur inequality; see page 509 of [R. A. Horn, C. R. Johnson, Matrix Analysis, Cambridge University Press, 2nd ed., 2013.] $\endgroup$
    – Russel
    Commented Apr 26, 2014 at 19:07

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .