- #1
Benny
- 584
- 0
Hi, I need to use the Cauchy-Schwartz inequality to prove the following inequality.
[tex]
\left( {a_1 + ... + a_n } \right)^2 \le n\left( {a_1 ^2 + ... + a_n ^2 } \right),\forall a_i \in R
[/tex]
When does equality hold?
The Cauchy-Schwartz inequality is [tex]\left| {\left\langle {\mathop u\limits^ \to ,\mathop v\limits^ \to } \right\rangle } \right| \le \left\| {\mathop u\limits^ \to } \right\|\left\| {\mathop v\limits^ \to } \right\|[/tex].
The Cauchy-Schwartz inequality holds for all inner products. Since the dot product is the only 'standard' inner product then the dot product is probably going to be needed here which hopefully means that the calculations won't be too involved.
At the moment I'm lost for ideas. Seeing the n on the RHS suggests that the two vectors have components which are multiples of n and reciprocals of n. Also, seeing that only a_i appears on both sides of the equation. I think I can take u = v in the Cauchy Schwartz inequality. So I'm dealing with a single vector. I can't think of a way to start this. Does anyone have any suggestions? Any help would be great thanks.
[tex]
\left( {a_1 + ... + a_n } \right)^2 \le n\left( {a_1 ^2 + ... + a_n ^2 } \right),\forall a_i \in R
[/tex]
When does equality hold?
The Cauchy-Schwartz inequality is [tex]\left| {\left\langle {\mathop u\limits^ \to ,\mathop v\limits^ \to } \right\rangle } \right| \le \left\| {\mathop u\limits^ \to } \right\|\left\| {\mathop v\limits^ \to } \right\|[/tex].
The Cauchy-Schwartz inequality holds for all inner products. Since the dot product is the only 'standard' inner product then the dot product is probably going to be needed here which hopefully means that the calculations won't be too involved.
At the moment I'm lost for ideas. Seeing the n on the RHS suggests that the two vectors have components which are multiples of n and reciprocals of n. Also, seeing that only a_i appears on both sides of the equation. I think I can take u = v in the Cauchy Schwartz inequality. So I'm dealing with a single vector. I can't think of a way to start this. Does anyone have any suggestions? Any help would be great thanks.