We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 9
Metric Spaces
1. Definition of Distance and Metric Space
ferut 2002, 03, 04, 06, 09, 11, 13, 14; Gorakhpur, 2013)
(Mes
n 1: Let X beanon-emply set. A mapping dof X x X into (theset ofreals) such
tric (or distance function) iff d satisfies the
(Defnitio
thot dX xX — Ris said to be a me
following axioms :
fm I] :d(x, y)2 OV x, ye X.
[m 2}: d(x, y) = Oiffx =.
[m 3} :dlx, y) = dly, x)V x, ye X.
[m 4] :d(x, y)< d(x, z) + d(z, y)V x,y. 2€ Xo?
pair (X, d)is calleda metric space and dix, y)
(Symmetry)
(Triangle inequality)
is called the
Itdisa metric for X, then order
distance between x and y.)
Note :
1. Sometimes metric space (x, d) is denoted by (X).
2 dix, y) acomplex, which are made into metric spaces in a natuy t!
sequences considered it
es in the following examples are Sequences of comp,
1
B28. Some Importa
int InequalitiesDa
aie (te (18 JOM
ea,
Neh ts gg 89.
i HP am to a cw) +) = 0 + ie + Bw KD
oe Prot | wl? = to + ie + ia) = oF * ‘
he ee a fat 9 rte (ny + Jol
pal? 4 2h ofl?
apaf? + 2h alto et
fat bah = Ltt
“Just the,
halon at af + 2)etlwl +10?
ean Nore = (jal+ lw)?
~~ Je +wlslal+lwh
| alization of this inequality, we have
Asa gene a reeubeas|slaiiraatt ole (eCf1, 2,00)
cece) a2 Beebe i tate nonsunend 2007, 10, 13)
is,
"Pesta proof : Let fl) = t0.+ 7, for > — 1. Then
to abstr} r=a+9?
tance of | So that f increases. Hence from [A], we have
re" Of the| fllz + w))S f(z] +|w]), thatis
jz+ul , _tel+|ul_
| T+]z+u) 1+l2l +l)
pies) saa (wll 2 el
| “Tslatlwl 1+l2l+twl 1+
|
ments 1 121,20, b20.Then
he norm! ae (Meerut 2013)
Ppa
| ce,
| P qa
| with equality tand only if a? = b?
a
wea Proof: Letf()=1-2 +21~ f where’ = and t2 0. Thenitiseasyto evriythat fé)< 0
|
We for 0 O for t> 1. Hence f()> f(l)= 0 with equality if and only if t= 1.
| Thus, we have
ersets eae ty 20)
1 i
atural thatis, Bs(l-A)+ at oath)
nplet
| oe
maunenals Os It 0, we put t= a? b~7 in (1) and we get
(aPb-4)" < ( s 4) shop [2 = 1
p) p B
Use relaton + 1 =1andsimplisng, we get
pi ee SS poeconverges ve
E 6, ee ae
bo. 8n<£ and dit)
Som 2 Ht. ta) = § for alm 2m,
af therane aE Jaleo, 10)~ dis.
af =lAl0 0) ~ dsp. fo) +
ence in x, 2) side a cre, eee
SN Zlib) de hdr et
mo S dlso. 89) + dlp.)
is Accum 5
= 9 iy oy 272 wan
Post RNP yee seavence< dem o> converges oso to)
2)
uch that
converge
jumbers
0, there
te nettle Sb
wpe
(101 Dox,
Take m = maxiem. mg)
4. Cauchy Sequences
#(X, d) be ametie space and lets =< s, >beasequence in X The
fence in X Then sisad
pefinition =
ea auchy SequenceinXifforeverye> O.theteexitsapos
5 dats apositve integer n(esuchthat
m,n2nle)=> dsm s9)beacorvergent sequence in amettic space(X, dandletsobe think
ofa Then for every €> 0, there exits a postive integer me) such that
n2nle) => dls. 5,)< 22
m2nle)=> dlsp, 5,)< #2
dsp, Sp) > Also, Sm)
m2n(e) andn2nfe) then
Hence if
Also, 5p_)< 22 and dlso, s,) where sp= Un isa
the point 0 to which wants to converge is
as shown below.
/ ¢. lfm, nare any integers greater ‘than
1 The convers
X =J0, I] with the usual metric d(x, v)
sequence in X which is not convergent since
nota point of X. But s is a Cauchy sequence
Foragiven e > 0, we choose an integer n(é) > 2
ne), then
n>2le and m>2/eie.
Yn converge 10 fo, $0 that
pe anal nea
Spy fo) S Als) + Aly
lem ls fo) ina fo) + ir dt
But Ads AS 5 tS slim * =0. a oO
It follows from (1), (2) and (3) that fe
“im dlsy to) 80+ 0=0
iin dls, fo)= 0
12510 to. Similarly, ifs, to then ty —> to
‘his implies that
Hence < 89> aso converd
s Examples
5. Complete Metric Space and
space (X, dis said to be complete if every cauchy sequence in X
Definition
reo a vont in X
‘Then metric space which
[Bigmpla 2: The realline ea complete metric space.
re ct oe covey seasons real ine R forgiven e>
msuch that
is not complete is said to be incomplete.
(03a positive integer
[5p Sml is bounded sequence of eal numbers.
Then pS 5n4¥
Let x= lim inf< 5,>
Lety-x=
therefore, there exist a
lim sup < Xn?
then s> 0
Suppose if possible, x # ¥
positive integer N st.
Since < x,> is cauchy sequence,
Since x is the unit inferior of therefore
s
xX<5) is a Cauchy sequence. For, let m,n be any postive integers such that
claim that 0M>0 such g.) M2 Nother
Proof : Since M and — aoa
Ste.) M, Stee] N peter
ifr = min (ry, r2) then
rc Six.n)oM
Six, rhe She, VE Ee
= SkreMON
Ske, C Sx, 19) N From (1) a
= Mo Nisanbdofx.
No Me Nex) It follows
| ; Th
Example 25 : Consider the usual metric d\x, »)=|x ~ y\forR and find whether ornotte)
‘following subsets of R are nhds of 1. number o
(10.21; (i 0,2} (i (1, 2; i
(i) 1,2}; (o) 1,23; (v) 0, 2; (i) (0, 2) — 1 i (vil) (0, 2) 5 (vii) | iSalsoan
Solution : (i) Yes, since J0, 2 is also at
: ; 21s an open set containing 1. Here (0, Qis an hd of
a (i) Yes, since 0, 2[is an open set such tha : opennhdoll| Solutio
: that
Now
=
Also
=>the
Set But Gis open, being the union of a collection of open sets. Its follows that A is open.
Remark. Theorem similar to theorers|,IlIlcan be proved forneighbourhoods of apotnt x
inition og instead of the neighbourhoods ofthe et A. Thus the theorem correspondingto theorem can
Point of be stated and proved as follows
Let(X, d)bea metric space and let x € X.I{N, i=1, 2... karefinite number ofnhds of,
then 0 (N;:i=1, 2,..., k} is also a nhd of x.
ay proof. Since Nii = 1, 2... klisanhdofx,thereexistopensetsG; (i= 1,2,..., K)suchthat
KEG) CN I=L 20k
This implies that KE ALG =D, Zeek} COAN THI Zone RY
(2) But 9 {G; :i= 1, 2,..., k} is an open set, being the intersection of a finite number of open
sets. It follows that > {N;:i=1,2, k} is also nhd of x.
veh f= 8. Accumulation Points : Adherent Points
) (1) 8.1 Accumulation Point or Limit Point
st Abe asubset of X.Apointx € Xis called an accumulation.
an
yen,
EA
(Guixe ay
ut
Ae ail show that G= ALI ee A, then by definition
ME tGxe Al of Ge, xaG, ond 0
AcG
ay
goin fre G,then ye G, for some x A.But G, < A, and hence yA
Gea
@
(2), we have
From (1) and
A=G
Let(X, d)be a metric space andlet
for a limit point) if every neighbourhood of x contains a point
‘of A distinct from x
point (
8.2 Derived Set of a Set
The set of all limits point of A is
tion point of A iff every neighbourhood of x intersects
called the derived set of A and shall be denoted by D(A)
Ainapoint
Thus x will be an accumulat
different from x.
Observe that x will nt be an accumuiation point of A if th
ere exists a neighbourhood N of x
such that
NoA=2
Na A={xh.
\densation of A if every neighbourhood of x
every point of condensation is alimit point
Aneed not be a point of A
or
A point x € X is said to be a point of con
contains uncountably many points of A. Note that
but not conversely. Also note that a limit point ofopen anes
5 charac
canver
orem 1:
point ot Ai
A
proof Let
‘pen sphere
sel
catied an adherent
* point of A (not Poin
et Aot Xif
fasubset ie A
read to be perfect, Sy
n isolated pe
int
or
a
tis ener
conver
infinitely ™
only a finite
ct fro}
distinc
since the |
sphere Sb
thisisa c+
of A.
mit point and itis O- 8.6 Anc
Apoint
has exactly two limi orig
it pogy]_ Theore'
adherer
Proof :
anithey are +1 and 1
iv) The open inten 1,2 has infinite number of limit points. Each point of
of t
the clos
interval (1, 2}sits limit point.
nell sae every point of which is ifs limit p
cin To sho
Beads Diz, 5))=2, 5}
28:4!
st 6) a.
il) A’cA (i) A=A’
(v) AcA’ + | If follo
Conv
point.
definiti
Now