Theorem: For any vectors u,v in an inner product space:
∣⟨u,v⟩∣≤∥u∥∥v∥
with equality if and only if u and v are linearly dependent.
Proof: We consider two cases.
Case 1: If v=0, both sides equal zero, so equality holds.
Case 2: Assume v=0. For any scalar t, consider the vector u−tv. By positivity of the norm:
∥u−tv∥2≥0
Expanding using inner product properties:
⟨u−tv,u−tv⟩≥0
⟨u,u⟩−t⟨u,v⟩−t⟨v,u⟩+t2⟨v,v⟩≥0
By symmetry, ⟨u,v⟩=⟨v,u⟩:
∥u∥2−2t⟨u,v⟩+t2∥v∥2≥0
This is a quadratic in t that is non-negative for all t. Choose the special value:
t=∥v∥2⟨u,v⟩
This choice minimizes the quadratic. Substituting:
∥u∥2−2∥v∥2⟨u,v⟩⋅⟨u,v⟩+∥v∥4[⟨u,v⟩]2⋅∥v∥2≥0
Simplifying:
∥u∥2−2∥v∥2[⟨u,v⟩]2+∥v∥2[⟨u,v⟩]2≥0
∥u∥2−∥v∥2[⟨u,v⟩]2≥0
Multiplying both sides by ∥v∥2>0:
∥u∥2∥v∥2−[⟨u,v⟩]2≥0
[⟨u,v⟩]2≤∥u∥2∥v∥2
Taking square roots:
∣⟨u,v⟩∣≤∥u∥∥v∥
Equality condition: Equality holds if and only if the minimum of the quadratic is zero, which occurs when:
∥u−tv∥2=0for t=∥v∥2⟨u,v⟩
By definiteness, this means:
u−tv=0⟹u=tv
So u and v are linearly dependent.
Conversely, if u=cv for some scalar c, then:
∣⟨u,v⟩∣=∣⟨cv,v⟩∣=∣c∣∥v∥2
∥u∥∥v∥=∥cv∥∥v∥=∣c∣∥v∥2
So equality holds. ∎