Skip to content

Cauchy-Schwarz Inequality

Theorem

For vectors x\boldsymbol{x} and y\boldsymbol{y} in an inner product space, the Cauchy-Schwarz inequality states ∣⟨x,y⟩∣≤∥x∥∥y∥|\langle\boldsymbol{x},\boldsymbol{y}\rangle|\leq\|\boldsymbol{x}\|\|\boldsymbol{y}\|; in Rn\mathbb{R}^n with the dot product this reads ∣x⋅y∣≤∥x∥∥y∥|\boldsymbol{x}\cdot \boldsymbol{y}|\leq\|\boldsymbol{x}\|\|\boldsymbol{y}\|.


Interpretation

The inner product of two vectors can never exceed the product of their lengths in absolute value. Equivalently, for nonzero vectors the quotient x⋅y∥x∥ ∥y∥\dfrac{\boldsymbol{x}\cdot \boldsymbol{y}}{\|\boldsymbol{x}\|\,\|\boldsymbol{y}\|} always lies between −1-1 and 11.

Two vectors x and y from the origin, with the projection of y onto x and an arc of radius equal to the length of y, showing that the projection is never longer than y.

The figure drops a perpendicular from the tip of y\boldsymbol{y} onto the line of the nonzero vector x\boldsymbol{x}. The green segment from the origin to its foot has length ∣x⋅y∣∥x∥\dfrac{|\boldsymbol{x}\cdot \boldsymbol{y}|}{\|\boldsymbol{x}\|}, and as a side of a right triangle with hypotenuse y\boldsymbol{y} it ends inside the arc of radius ∥y∥\|\boldsymbol{y}\|. Multiplying ∣x⋅y∣∥x∥≤∥y∥\dfrac{|\boldsymbol{x}\cdot \boldsymbol{y}|}{\|\boldsymbol{x}\|}\le\|\boldsymbol{y}\| by ∥x∥\|\boldsymbol{x}\| gives the inequality; equality holds when y\boldsymbol{y} already lies on the line of x\boldsymbol{x}, so that the segment reaches the arc.

Drag x\boldsymbol{x} and y\boldsymbol{y}: ∣x⋅y∣|\boldsymbol{x}\cdot \boldsymbol{y}| never exceeds ∥x∥∥y∥\|\boldsymbol{x}\|\|\boldsymbol{y}\|, because the shadow of x\boldsymbol{x} on the line of y\boldsymbol{y} is never longer than x\boldsymbol{x}. Equality holds exactly when the vectors lie on one line.

The inequality holds for all vectors, including 0\boldsymbol{0}, where both sides are 00. Equality holds if and only if one vector is a multiple of the other, that is, when both lie on one line through the origin. The absolute value matters: x⋅(−x)=−∥x∥2\boldsymbol{x}\cdot(-\boldsymbol{x})=-\|\boldsymbol{x}\|^2 is very negative for long x\boldsymbol{x}; only the size of the inner product is bounded.

The inequality is what makes the angle between vectors well defined in Rn\mathbb{R}^n, since a cosine must lie in [−1,1][-1,1], and it is the key step in proving the triangle inequality ∥x+y∥≤∥x∥+∥y∥\|\boldsymbol{x}+\boldsymbol{y}\|\le\|\boldsymbol{x}\|+\|\boldsymbol{y}\|. Its proof uses only the defining properties of an inner product, so it holds for every inner product with ∥x∥=⟨x,x⟩\|\boldsymbol{x}\|=\sqrt{\langle\boldsymbol{x},\boldsymbol{x}\rangle}. It returns later in a version for random variables.


Key Results


Examples

  • For orthogonal vectors, the left side is 00.
  • For x=y\boldsymbol{x}=\boldsymbol{y}, equality holds.

Prerequisites

Sources

Aliases: Cauchy-Bunyakovsky-Schwarz inequality, Schwarz inequality, Cauchy's inequality, CBS inequality, Cauchy-Schwarz Symbols: real numbers, square root

Last updated: 20 October 2026 03:02