Definition (normed space

Let X be a vector space over a field I and

11 11.
: X-
> IR be a function .
(X ,
11 .

11) is called

a normed space if
(i) Il all 30 for all xeX
.
(ii) 1IxI = 0 it and only of x = 0
.

(iii) 11x1l =
111Ix1) for xEX and &ElK .

(iv) 11x-yll = /Ix-zll + llz-yll for X.

J ,
zEX
.

Example
Write a
sequence
of numbers as a function X: 91 ,
2
, ...

-1
(a) lo : =
(x() : Xi) Elk ,
sup(si <
03 and

11 xllc : =
surpixis
(i) For xEto
any ,
11 XII =
suplxis) 0

(ii) /l XII 0E)

sup(xcill
=
= 0

# Will = 0 for all i =

1 2
, , ...

#) xi) = 0 for all i= 1 ,

2
, ...

#) X= 10 0
,,
...
/
 (iii) For
any
XEls and &+1K
,

112x110 =

suplaxis
sup()(x(i)
=

=
191 supixis
i

= K/11/lo

(iv) For X,
y zElo
any ,
,

1 x -y/lc =
Sup(x() y(il
-

-
Sup((xci) -

z(is) + 1 z() -

y(i)))
Tsuplai
~
+ bi) -
Supaitspbi >
-

Sup(X(i) z(i))
-
+
sup(z(x) y(i)
-

MATH 2050 definition :

11x -z0 112 - yllo

,
=
+
is the
supremum
teast upper
bound !

Hence ,
190 ,
11 110)
.

is a normed space
.
(b) For 12420 , put (p :=
((x(i)) : xiltlk
, /> ]
and 11x1p :=
<xp)
(i) For
any xetp .
11XIp :=
(c) 0
(ii) (lxllp =
0 E) /xis) = 0

=>Exit
>
# Ixill = 0 for all i =
1 ,
2
, ...

=> X(i) = 0
for all i = 1, 2
, .
.

E) x = 10 0
)
.
.... .

*
/x )
*
(iii)
11xIlp = 1

=
I (x)(P)
=
(1 / (x(ip)
=
(k/p/ )(i)
=
12/11 x1lp
(iv) Minkowski Inequality :

For
any
x,
yelp ,
11 x +
yllp-11x1p + Iyllp.
For
any X,
y zElp write xi = X- z and y = z
y.
-
,
,

Then
11x-yllp =
11 x +
y'llp
>
- 11 xIlp +
11 y'llp by Minkowski

1(x
zllp + 11z
yllp
= -
-

Therefore it suffices to prove Minkowski

,
inequality.

Proof of Minkowski
Inequality :

When
P = 1 ,
it follows immediately from triangle
inequality on IK =
1 or K
.

set q : /or
When 1pSc , + =
1) Recall
.

Holder Inequality
xcislycis)())
Pick
any
x,
Yelp
Put Xsi) =
Xx(i) and (i) = Ix(i) + y(i))Pt . Then

& ksis((x(i) + y(i)P

i =
1
+ xi) Excis + ysis
-

19)
= xi)) is

Similarly,
(i)((xi) +y(is)xis y(i)(4) +

Combine these two

inequalities ,
we get

xitysil = x(i) + y(is)/x(i) + y(z))P

-

& ((xcl + (y(a)) (xsis + y(i)P-1

= xill(xi) + ys- 1y()(xity()+

>
/x() y()(p) +
*

(1) (1xcis y(i)(4)

+
*
+

(11 x1|p 11y((p)(Excis y()(4)

=
+ +
 *
> 11 x+
yllp =

( xcistysis(P)
=
(xi) +
y()
-11 XIIp +
11y1lp .

Proof of Holder's Inequality :

Recall

Young's Inequality
IfI = 1
,
a
,
630 then
, ab>0
You check it calculus
can
by basic

We first assume
11xIp //yllq
= =
1

Exilly
= xis + lysis

=
11x1) + lyl =
1
 general t
In case put =
Y' =

la
, ,
p

Then , y -x(x1(py