Scribd
Upload
61 views11 pages

Metric Space 1

The document defines a metric space as a non-empty set X along with a metric or distance function d that satisfies four axioms: (1) d(x,y) ≥ 0 for all x,y in X (non-negativity) (2) d(x,y) = 0 if and only if x = y (identity) (3) d(x,y) = d(y,x) (symmetry) (4) d(x,z) ≤ d(x,y) + d(y,z) (triangle inequality) It then provides examples of metric spaces including the real numbers under the usual metric, Euclidean n

Uploaded by

Aman Dubey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
61 views11 pages

Metric Space 1

The document defines a metric space as a non-empty set X along with a metric or distance function d that satisfies four axioms: (1) d(x,y) ≥ 0 for all x,y in X (non-negativity) (2) d(x,y) = 0 if and only if x = y (identity) (3) d(x,y) = d(y,x) (symmetry) (4) d(x,z) ≤ d(x,y) + d(y,z) (triangle inequality) It then provides examples of metric spaces including the real numbers under the usual metric, Euclidean n

Uploaded by

Aman Dubey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Date o/o8/22

Chapte-L
Basic teams o Metyic Sparas

Desinition
X _ be anon-empty seandR be th
set o all h eal numbts. Amabping d
XxXinto R is said to be a metuic0 distac
unction d satisies heolboing axiorns

d dla 20 x,y E X_Lnon-negatiue conditionn


) dla,=0 i =q LNull condition
( ) dla, =d )¥a,y eX LSummetry Conditionl
(iv) d xsd z)tdlz4) t i, z |Tiàngle
Cmddton
Then dis said to be mdxic on X_and oxde
baix X,d) is callud a metic spacand dl,s is
calladthe distanc betuAeen aind y
#heoxem ht_ X_be a non-Cmty Se. lhan o
mappinqq d o X xXinto R is a metric i
olin Cordtions a sadised
Ia) d{a, y=0 = ,y eX
b) d (%,Y) <d(*) +dly,z) ¥ a,y,z eX
Pxoo Ld he corditions (1)to liu au hold hin
A
hove,
dlx,)d laz) td (2.y) * x, y,z ex-
Also by lii dlz,y)=dlyz)
Hena om O and 2,we have
dlay)s d(n,z) t dly,z) y.z EX
uhich is Condion (b)and Ca) is sama as ) .
Conuexgly,
Nou Suppose bat h Condlions (a) and (b)
hold. I ,y anyany tuo boints oX,than by
(b) ox xx and gd,
dla,a) sdl,y idlx,y)
d (x,y) 2d , x )
But dlx,n) =0 bs lal. Hena qives dla.y) 20 uhich
is o deetndi and G) is Sam as as (a)
a)
Aqain dpplying6) to points n,y,, we obtain
d x.y) sd(x,n)
td(y,u) =0 tdl 4,a)lbylal:
hus d l)dly,u). D
Simila-ly aphluing b) t6fke picdsy weqeX

d, dy

rom and we baue


dl,)dly - axiomlii))
Noud
Ltn,y,z EX,we have,
dlx,y) adx,z td y,z) Lhy (b)]
day)= dlx,z) +d },9) Lb 6
Lwhichis axiom liv).
V
V
222 222 9
Then ldlu.A)-dly.A) =d(n, A) -dly.A)
A)
sd(x,a) - d ,
d(n,a) -d (,a)+E
d y ) tdly.d)-d y.altE
By txiangle ineq,uuility)
e XNe x_, aeA)1
= dla,y)tE
Sinu E is aubitrany,ue have

Idl,A)-d(A)|Sdla,y.
N

#_Pseudo - Metic
X_be a norn-empty_Set and R be th
t
d X xX
set o all thxcal numbeus A mabbinq
R (or SCmi-mtic)
is said. to be a pseudo -meticaxioms
X i d SatisiesH -llowinq

Li)dla)=o tx x ix=y>dly)=0but
condeHsly not ruej.

(i) dlx,y)=dy.
4d2y)x,yzE
) dlx.)sd (k,z)+d(2y)* x, y,z EX
is callud tuples
nate: o8/a3/22
# Example t the maping d: xX R be dejincd
d is
by_dlh,y) =lx-yl a y eR to show hat
mctic on R is calhd usual mtric.

-y20 KyR
d l y 20tx ER
i)-l0
d y=o*i d

y ¬R
dla.y y,n)
iv) -yl=lx-ztz-ys lx-ztlz-y . 4 , z
ER
d y <d ln,z)Hd (zyl*xy,z ER.Y
Euclidean Metic Shaces
LtX-R_denste he sct ol all OYdeud ntuples
eal numbes ox aixed nEN

ER

Detin th mapbings d, dp ard d of R xRinto R by


)d,lnd,l.y) ;=yl

Show that d,,dp and d_a metxics on R"

S () Cleady d, lx,yl y2o ¥ny eR


i l l:0 Jov i1,2, n
jsY; ox i=1,2 , D

tyain. d.x.gl

d , y ) ¥ a y ¬R

To
lopove th txlangle incauilty ord,we Suppse that

Z2,Z Z n ¬ R,hn.

CX da,y)s d,laz) d, l2y.


Hentu d i s a metsic On R

la) Cleaky dln,y l


Plso dpl=o i -

i 0 o i1.2
i axi12
opove Aviangle incqualiy Jor dp we
use ta.
MinKowski incqüility
la,th,1
is la 1
Luht p L ard ai,b; i= L;2,n ) a u keal
hea numbeis

Now t z=,z, Then


a) ER"lhen

Nos putting a; -7b=Zi-iand aphlinga


above MinkbwsKi incq.uility, we q<

dplau.s 2 +22-
ie
dply6dalau2)+d,lz.yl
Hena dp is a melric on R"
3) Cleady aa maX
6 sn xl} zo tuyR

Rlso d(x.y)0i a ll=o


i =0 ov i,2.
xil,2,
Again d (au.y sisn
max
u-yl}mailyj-nilf
1si<n

lo pxove h hionqle inequiliy we Suppose dHat


n)e R

Sina - tz;-y r i,2,


IMi-d* (a,z)+d*z.y) pr il, 2,-
heuovemaxi=ylj sd*(,2)td*(z,)
0 d y) sdla,z) td(z,
Henu d* is a matic on R

Example- t s denote ihe set o al bossible seautnces


ceal oY Complex numbens i ,
Den
dlu.g)=
n=

Show that d is a metric o n S


SelTrue triangle ineoualiy axioms i), (in)
and liii)
t z <Zn? ,un.
do.y n=

nZntZon
1+xnZntZnynl)
h=
An-Zn ||
1+|-Znl) Zn
n=l
t|Znyn1)
dlay-dla,z)4dlz,
Henu d is a mdric on S his is calld fechet
metiiCon S

h e Eunction Shaces
t C'a,b) denote h colection s all xcal
Nalued CotinuouS ox bounded uncdions dalinnd on
La,b. De in he norm oeCLa,bJ bs-
= sup4)l:aELa,blj
d d be detined by,-

dltg)lll=supl1l-gls:e[a,b]j,
Show thot d is a mric ox CLa,b.
9eClob]
So-Sinc th axioms Ci), Li) and (ii_ axu chaious.
we need ony doprove th 0xicmi), tha iangle
incqualidy,.
in
Lt . h ecla,b]
hen oY all E la,bl,we have
la)-ga)I )-hla)+ hla)-qlal
1 )thla) +|ho))
sup1w)-qlEsuplu)-kbilt supklo- gl))-
- l l ||hl |h-g
Henc d.g)dlf.h)td(h.g)
d is a mdrid on CLa,bJ
O% ve oy.
means cngth o cjuen onákion
he shac
ht Ap be tha setoall pences = <An?.
oealo x Comblex numbens suth hot '~
n
n,n o
he p is a Positive constart

Defint

Shou thot d and d*a both merices on p

Sol Checking triangle inequality in_each case,


(a) t x=<hny=y27n. han or p>

dlay)- I
dlay Zt7nl

(la-2nltlz=yn

by MinKouski intqualrty
duydlna)tdlz,
b)tox 0<p<, we use h inequality
la,-sla-Z,lt|z,-y1)

a,-znltz-n
h

dly)d (xz)+ d*l.y).


Hentu d and d a merics On p.

2 # h e shau =

You might also like