Example 19: Cauchy-Schwarz inequality
For any two vectors and , we always have (Cauchy-Schwartz inequality).
Case 1. If or , then and , so and the result holds.
Case 2. Let and , and let be the angle between them. Then
since and .
for any two vectors. Hence proved.
Want the reason behind every step, the basics and the checks?
The scalar product is , and a cosine is never bigger than 1 in size. So the scalar product can never exceed the product of the lengths:
In pictures: is the length of the shadow of on the line of , and a shadow is never longer than the stick.
- Given
- Any two vectors and .
- To show
- .
- Plan
- (1) Deal with a zero vector separately (no angle is defined). (2) For nonzero vectors, write and take absolute values. (3) Use . (4) See when equality holds.
Basics you need
For nonzero vectors, , ; if or , the angle is not defined and (Section 10.6.1, Definition 2). Lesson: the dot product
, that is , with only for or in . Basics: cos θ is a shadow
for real numbers, and when . Lesson: Examples 13–21
Solution
The case of a zero vector
If or , then by definition, and one of the lengths is 0, so . Hence , and the inequality holds (with equality).
This case must be handled first because the angle between and another vector is not defined, so the formula with cannot be used. The book calls this case "trivial"."If either or , then is not defined, and in this case, we define " (Section 10.6.1, Definition 2). Lesson: the dot productNonzero vectors: take absolute values
Now let and , with angle between them. Then , and so
The absolute value of a product is the product of the absolute values, and , are already non-negative, so only needs the bars. The book writes the same fact divided through: , which needs , true in this case.Use
Together with Step 1, for any two vectors.
Drawn to scale for a sample pair, one scale on both axes: , , . The shadow of on the line of falls behind O and has length , shorter than . So , less than . Multiplying the inequality by the positive number keeps its direction. The bars around matter: when is obtuse, is negative, and the inequality is about its size.When does equality hold?
For nonzero vectors, exactly when , that is or : the vectors point the same way or opposite ways, so they are collinear. With Step 1, equality holds exactly when and are collinear (a zero vector counts as collinear with every vector).
In every other case , so and the inequality is strict. In the shadow picture: the shadow is as long as the stick only when the stick lies along the line.or gives (Section 10.6.1, Observations 3 and 4); collinear vectors (Section 10.5). Lesson: the dot product
For any two vectors, , with equality exactly when and are collinear.
(Textbook answer: the inequality holds trivially when or ; otherwise , therefore . The book spells the name "Cauchy-Schwartz"; the mathematician is Hermann Amandus Schwarz, so it is usually written Cauchy-Schwarz.)
, : and . So , a close call because the angle is small (about ).
, (collinear, opposite): , and . Equality, , as Step 4 predicts.
- Skipping the zero-vector case. For there is no angle, so the argument does not apply; the case needs its own line.
- Dividing by without saying it is nonzero. The book's form is only allowed once both vectors are nonzero.
- Dropping the absolute value. is true but weaker; the statement bounds the size , so a large negative scalar product is ruled out too.
- : a shadow is never longer than the stick.
- Handle the zero vector first, since no angle is defined for it.
- Equality holds exactly for collinear vectors.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| ; if a vector is zero | Steps 1, 2 | Section 10.6.1, Definition 2 (Lesson: the dot product) |
| , equal to 1 only at and | Steps 3, 4 | Trigonometry (Basics: cos θ is a shadow) |
| or gives | Step 4 | Section 10.6.1, Observations 3 and 4 |
| Collinear vectors | Step 4 | Section 10.5 |
| The book's working and answer | Result | Example 19, Section 10.6.2 (Lesson: Examples 13–21) |
Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →