prove Hadamard's inequality for any matrix \(\left[ { a }_{ n }^{ i } \right] \)

\({ det }\left[ { a }_{ n }^{ i } \right] \le\displaystyle\prod _{ n=1 }^{ k }{ (\displaystyle\sum _{ i=1 }^{ k }{ \left[ { a }_{ n }^{ i } \right] ) } } \)

Hint:Differential calculus

**Note**:all the entries in the matrix are non-negative

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestFor the above inequality to be true, it is required that the all entries of the matrix are non-negative. Assuming that to be the case, we can upper-bound the determinant of the matrix \(A\) by the permanent of the matrix \(A\) to obtain \[\text{det}(A) \stackrel{(a)}{\leq} \text{per}(A) = \sum_{\sigma \in \pi} \prod_{n=1}^{k}a_{n \sigma({n})}\stackrel{(b)}{\leq} \prod_{n=1}^{k}(\sum_{i=1}^{k}a_{i,n}),\] where \(\pi\) is the set of all permutations on \(n\) elements and the inequalities (a) and (b) follows from the non-negativity of the elements.

Log in to reply

nice short proof!

and yes i think that the entries should all be non-negative

i'll mention that in the note

Log in to reply

Also, the LHS should be \(\text{det(A)}\) as I proved, instead of \(\text{det(A)}^2\). As a counter-example, take \[A=\begin{pmatrix} 1 & 1 \\ 0 & 2 \end{pmatrix} \]

Log in to reply

i don't know why i thought it was the square of it

i'll edit the note

Log in to reply