Cauchy-Schwarz Inequality
Also known as: Cauchy-Bunyakovsky-Schwarz inequality · Schwarz inequality
The overlap of two vectors can never exceed the product of their lengths — geometrically because ⟨u,v⟩ = ‖u‖‖v‖cosθ and cosθ ≤ 1. Equality happens only when the vectors are parallel. This humble bound is secretly everywhere: it guarantees correlation coefficients stay within ±1, it underlies the triangle inequality, and in quantum mechanics it's the step that turns operator commutators into the Heisenberg uncertainty principle.
Two vectors and their inner product ‖u‖‖v‖cosθ; the overlap peaks when they align and vanishes at right angles.
Equivalent forms
A one-line inequality that silently powers the triangle inequality, correlation bounds, and the derivation of the uncertainty principle.
Where it holds
Dimensional analysis
Cauchy proved the sum version in 1821; Bunyakovsky extended it to integrals in 1859; Schwarz gave the modern inner-product-space form in 1888. The triple name honors all three, though usage varies by country — 'Cauchy–Schwarz' in the West, 'Cauchy–Bunyakovsky–Schwarz' in Russia.
- Bounding statistical correlation coefficients to ,1]
- Deriving the Heisenberg uncertainty relation
- Convergence proofs and error bounds in numerical analysis
- Equality holds only for parallel (linearly dependent) vectors, not merely orthogonal ones
- It applies to functions and quantum states, not just arrows in space
- The complex form needs the modulus |⟨u,v⟩|, since the inner product can be complex
What if…
and the inequality becomes an equality — the overlap saturates its maximum.
⟨u,v⟩ , the weakest possible overlap — the inequality is satisfied with a huge margin.
Uncertainty principle step
- Apply |⟨f,g⟩| ≤ ‖f‖‖g‖ with Â, ̂
- ‖f‖‖g‖ , |⟨f,g⟩| ⟨f,g⟩| = |⟨[Â,B̂]⟩|/2
- ≥ |⟨[Â,B̂]⟩|/2