Length-Norm inequality to root-n times Length (using 2|uv| <= |u|^2 + |v|^2)

  • Thread starter Thread starter Sravoff
  • Start date Start date
  • Tags Tags
    Inequality Length
Sravoff
Messages
15
Reaction score
0
I've been reading "The Qualitative Theory of Ordinary Differential Equations, An Introduction" and am now stuck on an inequality I am supposed to be able to prove. I am pretty sure the inequality comes from linear algebra, I remember seeing something about it in my intro class but I let a friend borrow my book. I have been unable to find an explanation of the 2|uv| inequality, which may be all I need.

Definitions where bold indicates vectors.
\text{Euclidean Length: }||\textbf{y}|| = \left(\Sigma_{i=1}^n |y_i|^2\right)^{1/2}, \text{Norm: } |\textbf{y}| = \Sigma_{i=1}^n|y_i|

<br /> \text{To Prove:} \\<br /> \text{If } \textbf{y} \in E_n, \text{ show that} \\<br /> ||\textbf{y}|| \leq |\textbf{y}| \leq \sqrt{n}||\textbf{y}|| \\<br /> \text{Hint, use } 2|uv| \leq |u|^2 + |v|^2 \text{ and show that } ||\textbf{y}||^2 \leq |\textbf{y}|^2 \leq n||\textbf{y}||^2

I was thinking that generalizing the 2|uv| inequality to

n|u_1 u_2 \cdots u_n| \leq |u_1|^2 + |u_2|^2 + \cdots + |u_n|^2

may lead me in a helpful direction, but couldn't see where to go with it, or where that inequality came from to generalize it.

That may not even be the right way to be thinking about the proof, but any direction you could give me in this direction would be greatly appreciated. Thank you!
-Sravoff
 
Physics news on Phys.org
Hint for the 2|uv| thing: What is ##(|u|-|v|)^2##?
 
For the first inequality, square both sides of ##\Vert x\Vert\leq \vert x\vert##.

For the second, square both sides of ##\vert x\vert\leq \sqrt{n}\Vert x\Vert## and use the inequality from the hint on the cross terms that appear in ##\vert x\vert^2##.
 
Hey Fredrik, thanks for the hint that worked great! I can see the 2|uv| identity now, but that didn't get me closer to a generalized form. I played with a couple of other forms that didn't wind up looking too promising.

Hey platetheduke, is here an justification for where those come from in the first place? If I start with just the definitions above, how do I claim that ||x|| <= |x|?
 
The inequalities ##\|x\|\leq|x| \leq\sqrt{n}\|x\|## are equivalent to ##\|x\|^2\leq |x|^2\leq n\|x\|^2##. The latter pair of inequalities can be obtained in a fairly straightforward way starting with the definition of ##|x|##. The result ##2|u||v|\leq|u|^2+|v|^2## is used in the proof of the second inequality, but not in the proof of the first.

Would you like to give it a try and show us where you get stuck?

Both proofs start like this:
$$|x|^2=\left(\sum_{i=1}^n|x_i|\right)^2 =$$
 
Last edited:
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top