Scalar Product and Norm

One important consequence of Figure 1.8, which we will use extensively later, is, that the scalar product allows us to compute the projection of one vector in the direction of another vector. More precisely,

🔗

\begin{matrix} (1.4) & p = ‖ y ‖ \cos (θ) \frac{x}{‖ x ‖} = \frac{x \cdot y}{‖ x ‖^{2}} x \end{matrix}

is the projection of

y

into the direction of

x

as shown in Figure 1.10). We call

‖ p ‖

the component of

y

in the direction of

x

🔗

Figure 1.10. Projection of $y$ in the direction of $x .$
🔗

It is tempting to define the angle between two vectors in

R^{N}

(

N > 3

) by

🔗

\cos (θ) = \frac{x \cdot y}{‖ x ‖ ‖ y ‖} .

🔗

Note however that

\cos (θ)

needs to be between

- 1

and

1 .

If we can show that

| x \cdot y | \leq ‖ x ‖ ‖ y ‖

in general then we can indeed define angles between

N

-vectors. The above inequality turns out to be true always and is often called the Cauchy-Schwarz inequality.

🔗

Theorem 1.11. Cauchy-Schwarz inequality.

For all

x, y \in R^{N}

we have

🔗

\begin{matrix} (1.5) & | x \cdot y | \leq ‖ x ‖ ‖ y ‖ . \end{matrix}

🔗

Moreover, equality holds if and only if

x

and

y

are linearly dependent, that is, scalar multiples of each other.

🔗

Proof.

x = 0

y = 0

the inequality is obvious and

x

and

y

are linearly dependent. Hence assume that

x \neq 0

and

y \neq 0 .

We can then define

n = y - \frac{x \cdot y}{‖ x ‖^{2}} x .

A geometric interpretation of

n

is shown in Figure 1.12.

Figure 1.12. Geometric interpretation of $n .$

Using the algebraic rules Note 1.5 of the scalar product and the definition of the norm we get

\begin{aligned} 0 & \leq ‖ n ‖^{2} \\ = y \cdot y - 2 \frac{x \cdot y}{‖ x ‖^{2}} x \cdot y + \frac{(x \cdot y)^{2}}{‖ x ‖^{4}} x \cdot x \\ = ‖ y ‖^{2} - 2 \frac{(x \cdot y)^{2}}{‖ x ‖^{2}} + \frac{(x \cdot y)^{2}}{‖ x ‖^{4}} ‖ x ‖^{2} \\ = ‖ y ‖^{2} - \frac{(x \cdot y)^{2}}{‖ x ‖^{2}} . \end{aligned}

Therefore

(x \cdot y)^{2} \leq ‖ x ‖^{2} ‖ y ‖^{2},

and by taking square roots we find (1.5). Clearly

‖ n ‖ = 0

if and only if

y = \frac{x \cdot y}{‖ x ‖^{2}} x,

that is,

y = α x

for some

α \in R,

that is,

x

and

y

are linearly independent. This completes the proof of the theorem.

It is common practice in mathematics to make a fact in some particular situation a definition in a more general situation. Here we proved that in the plane or in space the cosine of the angle between two vectors is given by (1.2). For higher dimension no angles are defined, so we take (1.2) as a definition of the angle.

🔗

Definition 1.13. Angles, orthogonal vectors.

x

and

y

are two (non-zero) vectors in

R^{N}

(

N

arbitrary) we define the angle,

θ,

between

x

and

y

🔗

\cos (θ) := \frac{x \cdot y}{‖ x ‖ ‖ y ‖} .

🔗

(By the Cauchy-Schwarz inequality the above is always in the interval

[- 1, 1],

so the definition makes sense.)

🔗

We say

x

and

y

are orthogonal or perpendicular if

x \cdot y = 0 .

🔗

We next summarise the main properties of the norm.

🔗

Proposition 1.14. Norm properties.

Let

x,

y \in R^{N}

and

α \in R .

Then

🔗

$‖ x ‖ \geq 0,$ and $‖ x ‖ = 0$ if and only if $x = 0 .$
$‖ α x ‖ = | α | ‖ x ‖ .$
$‖ x + y ‖ \leq ‖ x ‖ + ‖ y ‖$ (Triangle Inequality).

🔗

Proof.

The first two properties follow easily from the definition of the norm. To prove the last one we use Note 1.5, the definition of the norm and the Cauchy-Schwarz inequality (1.5) to see that

\begin{aligned} ‖ x + y ‖^{2} & = (x + y) \cdot (x + y) \\ = ‖ x ‖^{2} + ‖ y ‖^{2} + 2 x \cdot y \\ \leq ‖ x ‖^{2} + ‖ y ‖^{2} + 2 ‖ x ‖ ‖ y ‖ \\ = (‖ x ‖ + ‖ y ‖)^{2} . \end{aligned}

Taking the square root, the inequality follows.

The last of the above properties reflects the fact that the total length of two edges in a triangle is bigger than the length of the third edge. For this reason it is called the triangle inequality.

🔗

Prev Top Next