prove Hadamard's inequality for any matrix [ani]\left[ { a }_{ n }^{ i } \right] [ani]
det[ani]≤∏n=1k(∑i=1k[ani]){ det }\left[ { a }_{ n }^{ i } \right] \le\displaystyle\prod _{ n=1 }^{ k }{ (\displaystyle\sum _{ i=1 }^{ k }{ \left[ { a }_{ n }^{ i } \right] ) } } det[ani]≤n=1∏k(i=1∑k[ani])
Hint:Differential calculus
Note:all the entries in the matrix are non-negative
Note by Hamza A 5 years, 3 months ago
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
_italics_
**bold**
__bold__
- bulleted- list
1. numbered2. list
paragraph 1paragraph 2
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
This is a quote
# I indented these lines # 4 spaces, and now they show # up as a code block. print "hello world"
\(
\)
\[
\]
2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
For 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 AAA by the permanent of the matrix AAA to obtain det(A)≤(a)per(A)=∑σ∈π∏n=1kanσ(n)≤(b)∏n=1k(∑i=1kai,n),\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}),det(A)≤(a)per(A)=σ∈π∑n=1∏kanσ(n)≤(b)n=1∏k(i=1∑kai,n), where π\piπ is the set of all permutations on nnn 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
Also, the LHS should be det(A)\text{det(A)}det(A) as I proved, instead of det(A)2\text{det(A)}^2det(A)2. As a counter-example, take A=(1102)A=\begin{pmatrix} 1 & 1 \\ 0 & 2 \end{pmatrix} A=(1012)
@Abhishek Sinha – you're right
i don't know why i thought it was the square of it
i'll edit the note
Problem Loading...
Note Loading...
Set Loading...
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
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
For 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 det(A)≤(a)per(A)=σ∈π∑n=1∏kanσ(n)≤(b)n=1∏k(i=1∑kai,n), where π 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 det(A) as I proved, instead of det(A)2. As a counter-example, take A=(1012)
Log in to reply
i don't know why i thought it was the square of it
i'll edit the note