Proving Cauchy-Schwarz Inequality Using Completing the Square

  • Thread starter Thread starter courtrigrad
  • Start date Start date
  • Tags Tags
    Cauchy Inequality
Click For Summary

Homework Help Overview

The discussion revolves around proving the Cauchy-Schwarz inequality using the method of completing the square. Participants are examining the algebraic manipulation of expressions involving sums of products and squares of variables.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants discuss the implications of completing the square in the context of a quadratic expression and its discriminant. There are questions about the conditions under which the inequality holds and the significance of the discriminant being non-positive.

Discussion Status

The conversation is active, with participants exploring different aspects of the proof and questioning the steps involved. Some guidance is offered regarding the discriminant and its relationship to the roots of the quadratic equation, but no consensus has been reached on the approach.

Contextual Notes

There is mention of a reference to Courant's book, indicating that the discussion may be influenced by specific pedagogical approaches or examples presented there. Participants are also considering the implications of algebraic identities and potential typographical errors in the original text.

courtrigrad
Messages
1,236
Reaction score
2
Lets say we have: [tex](a_{1}b_{1} + a_{2}b_{2} + ... + a_{n}b_{n})^{2} \leq (a_{1}^{2} + a_{2}^{2} + ... + a_{n}^{2})(b_{1}^{2} + b_{2}^{2} + ... + b_{n}^{2})[/tex].

Let [tex]A = a_{1}^{2} + a_{2}^{2} + ... + a_{n}^{2} , B = a_{1}b_{1} + a_{2}b_{2} + ... + a_{n}b_{n}, C = b_{1}^{2} + b_{2}^{2} + ... + b_{n}^{2}[/tex]. Thus we have [tex]AC \geq B^{2}[/tex]. From [tex]0\leq (a_{1} + tb_{1})^{2} + (a_{2} + tb_{2})^{2} + ... + (a_{n} + tb_{n})^{2}[/tex] where [tex]t[/tex] is any real number, we obtain [tex]0 \leq A + 2Bt + Ct^{2}[/tex]. Completing the square, we obtain [tex]Ct^{2} + 2Bt + A = C(t + \frac{B}{C})^{2} + (A - \frac{B^{2}}{C})[/tex]. From this step, how do we obtain [tex]0 \leq A - \frac{2B^{2}}{C} + \frac{B^{2}}{C} = \frac{AC-B^{2}}{C}[/tex], implying that [tex]AC - B^{2} \geq 0[/tex]?

Thanks
 
Last edited:
Physics news on Phys.org
you need to show that for the minimal value of t the inequality still holds.
from algebra we know that for C>=0 t=-B/C.
 
Hi courtrigrad,

Why complete the square? The graph of [itex]Ct^2 + 2Bt + A[/itex] is that of a porabola opening upwards. Since this quadratic equation is greater than or equal to zero for all values of t there can either be a single root of multiplicity 2, or none at all. What does this tell you about the discriminant of the equation?
 
Last edited:
yeah, but I am referring this out of Courant's book. Just trying to see how he approached it. [tex]B^{2} - 4AC \leq 0[/tex]

Thanks
 
Last edited:
Probably a typographical error, but the discriminant should be 4B^2 - 4AC.

Perhaps Courant is implying you plug in the value t = -B/C, in which case you would get [tex]A - \frac{B^2}{C} \geq 0[/tex]
or if you plug it into the original quadratic you would get the equvalent [tex]0 \leq A - \frac{-2B^2}{C} + \frac{B^2}{C}[/tex] as he did.

He probably completes the square to motivate this choice of t.
 
Last edited:

Similar threads

  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
11
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K