Prove it!

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

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] ) } }

Hint:Differential calculus

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

#Calculus

Note by Hamza A
5 years, 3 months ago

No vote yet
1 vote

  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:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> 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"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \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 AA by the permanent of the matrix AA 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}), where π\pi is the set of all permutations on nn elements and the inequalities (a) and (b) follows from the non-negativity of the elements.

Abhishek Sinha - 5 years, 3 months ago

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

Hamza A - 5 years, 3 months ago

Log in to reply

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

Abhishek Sinha - 5 years, 3 months ago

Log in to reply

@Abhishek Sinha you're right

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

i'll edit the note

Hamza A - 5 years, 3 months ago
×

Problem Loading...

Note Loading...

Set Loading...