*Notes to a video lecture on http://www.unizor.com*

__Vectors+ 06__

Cauchy-Schwarz-Bunyakovsky Inequality

Cauchy-Schwarz-Bunyakovsky Inequality

This inequality is also known as Cauchy-Bunyakovsky or Cauchy-Schwarz inequality.

We will consider this inequality only for a case of

*N*-dimensional real vectors, where it states that scalar product of two vectors is less or equal to a product of their magnitudes

**R·S ≤ ||R||·||S||**In terms of components,

*(*

**R***R*)

_{1},R_{2},...,R_{N}*(*

**S***S*)

_{1},S_{2},...,S_{N}

**R·S =**R_{1}·S_{1}+R_{2}·S_{2}+...+R_{N}·S_{N}

**||R|| = √**R_{1}²+R_{2}²+...+R_{N}²

**||S|| = √**S_{1}²+S_{2}²+...+S_{N}²To prove the above inequality, it is sufficient to prove it for squares of both left and right parts, since the right part is always positive, while the left (smaller or equal) can take negative values as well. This allows to get rid of the square roots.

Let's prove that

**(R·S)² ≤ (||R||·||S||)²**In coordinate form we have to prove that

*(R*

(R

_{1}·S_{1}+R_{2}·S_{2}+...+R_{N}·S_{N})² ≤(R

_{1}²+R_{2}²+...+R_{N}²)·(S_{1}²+S_{2}²+...+S_{N}²)*Proof*

Consider a quadratic polynomial for an unknown variable

**x***P(*

...+(R

**x**) = (R_{1}·**x**+S_{1})²+(R_{2}·**x**+S_{2})²+......+(R

_{N}·**x**+S_{N})²This quadratic polynomial is, obviously, non-negative, as it contains only non-negative components added together.

This same polynomial can be regrouped by opening parenthesis and presented as

*P(*

+ 2·(R

+ (S

= A

**x**) = (R_{1}²+R_{2}²+...+R_{N}²)·**x²**++ 2·(R

_{1}·S_{1}+R_{2}·S_{2}+...+R_{N}·S_{N})·**x**++ (S

_{1}²+S_{2}²+...+S_{N}²) == A

**x²**+ B**x**+ Cwhere

*A = ||*

**R**||²*B = 2*

**·R·S***C = ||*

**S**||²In order to have a non-negative polynomial, its necessary and sufficient to have its discriminant to be non-positive.

Therefore,

*B²−4·A·C ≤ 0*

**(2·R·S)² − 4·||R||²·||S||² ≤ 0**

**(R·S)² ≤ ||R||²·||S||²**End of Proof.

*Consequences*

1. Triangle inequality

Triangle inequality deals with a magnitude of three vectors

*,*

**R***and their sum*

**S***that completes a triangle in*

**R+S***N*-dimensional space.

In particular, the Triangle inequality states that in any triangle sum of two sides as greater or equal than the third one.

As we know,

*[applying the Cauchy-Schwartz inequality to the third term]*

**||R+S||² = (R+S)·(R+S) =**

= R·R + S·S + 2·R·S ≤

= R·R + S·S + 2·R·S ≤

≤ ||R||² + ||S||² +2·||R||·||S|| =

= (||R||+||S||)²≤ ||R||² + ||S||² +2·||R||·||S|| =

= (||R||+||S||)²

Therefore,

*which is the Triangle inequality.*

**||R+S|| ≤ ||R||+||S||**2. The

*cosine*between vectors

We have defined a cosine of the angle between vectors

*and*

**R***in*

**S***N*-dimensional space as

*cos(φ) =*.

**R·S/(||R||·||S||)**Because of the Cauchy-Schwartz inequality the above expression is always between

*−1*and

*1*and, therefore, can be a cosine of some angle. So, our definition of an angle in

*N*-dimensional space makes total sense.

## No comments:

Post a Comment