1.1 Distance

Linear space Rm={x=(x1,...,xm)T|x1,...,xm∈R}. Define the addition and number multiplication on the linear space, x+y=(x1+y1,...,xm+ym)Tλx=(λx1,...,λxm)T

Why should it be written as a column vector? Let z=2x+3y=f(x,y)=(23)(xy)

The former row vector is called a function, the latter column vector is called a vector (or point).

Definition 1.1.1 The distance on Rm is a function d:Rm×Rm→R such that

1.

For any x,y, d(x,y)=d(y,x)≥0.

2.

d(x,y)=0⇔x=y.

3.

For any x,y,z, d(x,y)≤d(x,z)+d(z,y).

Moreover, if for any x,y,z, d(x,y)=d(x+z,y+z), then d is translational invariant.

Definition 1.1.2 The norm on Rm is a function ∥⋅∥:Rm→R such that

1.

For any x, ∥x∥≥0 and ∥x∥=0⇔x=0.

2.

∥λx∥=|λ|∥x∥.

3.

∥x+y∥≤∥x∥+∥y∥.

Corollary 1.1.3 If ∥⋅∥ is the norm on Rm, then let d(x,y)=∥x−y∥, here d is a translational invariant distance.

Definition 1.1.4 The inner product on Rm is a binary function ⟨⋅,⋅⟩:Rm×Rm→R such that

1.

⟨x,y⟩=⟨y,x⟩.

2.

⟨x,x⟩≥0, ⟨x,x⟩=0⇔x=0.

3.

Binary linear. ⟨αx+βy,z⟩=α⟨x,z⟩+β⟨y,z⟩。

Corollary 1.1.5 If ⟨⋅,⋅⟩ is the inner product on Rm, then let ∥x∥=⟨x,x⟩, here ⟨⋅,⋅⟩ is a norm which subjects to the Cauchy-Schwartz inequality ⟨x,y⟩≤∥x∥∥y∥=⟨x,x⟩⟨y,y⟩.

Example 1.1.1 Standard inner product on Rm is defined as ⟨x,y⟩=∑i=1mxiyi. e1,...,em are called the identity orthogonal bases. Define the norm ∥x∥=∑i=1mxi2 and the distance d(x,y)=∑i=1m(xi−yi)2. They compose a Euclid space. Generally, for any given p≥1, define the distane dp(x,y)=(∑i=1m|xi−yi|p)1p and the norm ∥x∥p=(∑i=1m|xi|p)1p. ∥⋅∥p is consistent with a inner product if and only if p=2.

When p→+∞, ∥x∥∞=max1≤i≤m|xi| and d(x,y)∞=max1≤i≤m|xi−yi|.