Example:2 Let C(0,1) denotes the collection of all real valued

bounded continuous function defined on [0,1], we define the norm

of f \in c[0, 1] by ||f|| = sup\{|f(x)| / x \in [0, 1]\} let d be defined by
d(f, g) = ||f - g|| =Sup\ | overline f (x)-g(x)|:x in[0,1]\ show that d is a
metric for C(0,1)

proof: Let f, g, h \in C(0,1) Then

[m 1]: Since |f(x) - g(x)| >= 0 Rightarrow su p x in c |f(x)-g(x)|>=0

Rightarrow ||f - g|| >= 0 Rightarrow d(f, g) >= 0

[m 2]: Since

|f(x) - g(x)| =0 iff f(x)=g(x)

Rightarrow sup|f(x) - g(x)| =0 iff f(x)=g(x)

Rightarrow| |f - g| =0 iff f=g Rightarrow d(f, g) =0 iff f=g [m3]: Since

|f(x) - g(x)| =|g(x)-f(x) Rightarrow sup|f(x) - g(x)| = sup|g(x) - f(x)|
Rightarrow ||f - g|| =||g^ - || Rightarrow d(f, g) = d(g, f)
In this project, I am going to discuss on concept of metric (distance
function), metric spaces & Some examples.

We shall also discuss types of metric spaces their some examples and
some important theorems of metric spaces

Metric spaces,as well as being able to understand the terms and

definitions, and use the results introduced, you should also find that
skills and confidence in reading, understanding and writing
mathematical arguments are improving.

[m 4]: [f(x)-g(x)=f(x)-h(x)+h(x)-g(x)l →lf(x)-g(x)|s|f(x)-h(x)\+\h(x)-

g(x)| sup|f(x)-g(x)|<sup|f(x)-h(x)|+sup|h(x)-g(x)l →llf-g|ls||f-
h||+||h-f|| →d(f,g)≤d(f,h)+d(h,g) Hence,d is metric on C[0,1]
Example:3

Let X=R\& d(x, y) = |x ^ 2 - y ^ 2| , then show that d is not metric on

R.

Proof: [m1]: |x ^ 2 - y ^ 2| >= 0 Rightarrow d(x, y) >= 0 [m2]: x=1\& y

= (- 1) then d(x, y) = |(1) ^ 2 - (- 1) ^ 2| = 0 but x≠y Hence given d(x, y)
= |x ^ 2 - y ^ 2| is not metric on R.

Example:1

Let X = R and d(x, y) = |x ^ 2 - y ^ 2| then show that d is pseudo

Proof:

[m1]: d(x, y) >= 0 |x ^ 2 - y ^ 2| >= 0

[m 2]: If x = y then d(x, y) = 0 but if d(x, y) = 0 then x & y need not be

equal let x = 1 & y = - 1 then d(x, y) = 0

[m3]: d(x, y) = |x ^ 2 - y ^ 2| = |y ^ 2 - x ^ 2| d(x, y) = d(y, x)

[m:4]: |x ^ 2 - y ^ 2| = |x ^ 2 - z ^ 2 + z ^ 2 - y ^ 2| <= |x ^ 2 - z ^ 2| +
|z ^ 2 - y ^ 2| d(x, y) <= d(x, z) + d(z, y)

Example:1

Let X = R and d(x, y) = |x - y| then show that (X,d) is metric space.

proof: We have to show that 'd' metric on R Given that d:RxR-R s.t.
d(x, y) = |x - y|

[m 1]: we know that |x| >= 0 for all XER Rightarrow |x - y| >= 0
Rightarrow d(x, y) >= 0

[m2]: d(x, y) = 0 |x - y| =0 iff x=y

[m3]: d (x, y) = |x - y| = |- (y - x)| = |(y - x)| d(x, y) = d(y, x)

[m 4]: We know that |x + y| <= |x| + |y| so, d(x, y) = |x - y| |x - z + z

- y| <= |x - z| + |z - y| Rightarrow d(x, y) <= d(x, z) + d(z, y)

Hence (R,d) is metric space. This metric is known as usual metric

Pseudo metric (semi metric)

Let X be a non empty set. A mapping d:XxX-R(the set of real number)

is said to be a semi metric if it satisfies the following condition.

[m 1]: d(x, y) >=0 forall x,y in X

[m2]: x=y Rightarrow d(x, y) = 0 but not conversely i.e. d(x, x) = 0

[m3]: d(x, y) =d(y,x) forall x,y in X

[m 4]: d(x, y) <= d(x, z) + d(z, y)

Note: Every metric is a semi-metric but a semi metric is not

necessarily a metric.

Semi-metric space (pseudo metric space)

A non empty set X equipped with a semi metric d is called a semi-
metric space.

This is to certify that research project titled "METRIC SPACES" is an

original work done by CHANCHAL SINGH(2203300041031) as a
partial fulfillment for bachelor of science 6 th semester in
mathematics (S.B.L.M. COLLEGE, MATHURA) affiliated to Dr. B.R.
AMBEDKAR UNIVERSITY, AGRA. The research has been prepared
under my guidance and is a record of the BONAFIDE work carried out
successfully

She has completed her research project work under my guidance. I

wish him bright future

Professor

HOD (department of mathematics) S.B.L.M. COLLEGE, MATHURA

Uttar Pradesh-281502
[1]. Metric spaces (definition and examples)-BYJU'S. http://byjus.
com.

[2]. Metric spaces -Wikipedia http:// en. Wikipedia.org

[3]. (PDF) introduction to metric spaces - Research Gate.

https://www, researchgate.net.

[4]. Metric space | Brilliant math & science wiki:

https://brilliant.org.

samples Let the mapping d*:RxRR defined by d^ * (x, y) =\ 0 if x = y

and called discrete metric {1 if xxy then d ^ * is a metric for R.

Proof:

[m 1]: d^ * (x, y) >=0 forall x,y in R. [Either d^ * (x, y) = 0 or d^ * (x, y)

=1]
[m2]: If x = y then by definition of d ^ * d^ * (x, y) = 0 and if d^ * (x, y)
= 0 then x = y if x²y, d^ * (x, y) = 1 which is contradiction. Hence d^ *
(x, y) = 0 iff x = y .

[m3]: If x = y then d^ * (x, y) = 0 =d^ * (y,x) and x ne y then d^ * (x, y)

= 1 =d^ * (y,x) Hence, d^ * (x, y) =d^ * (y,x) forall x,y in R

[m 4]: Let x,y,z be any three elements of R. x = y then d^ * (x, y) = 0

Also d^ * (x, z) >= 0 and d^ * (z, y) >= 0 Hence, d^ * (x, z) <= d^ *
(x,z)+d^ * (z,y) forall x,y,z in R If x ne y then d^ * (x, y) = 1 1.Then z is
different from atleast one of x and y and hence at least one of d^ *
(x, z) and d^ * (z, y) must be equal to 1.If follow that d^ * (x, y) <= d^
* (x,z)+d^ * (z,y) forall x,y,z in R Hence, d is metric on R

Theorem 2

Let (X,d) be a metric space and let x, x' y, y' \in X Then |d(x, y) - d(x',
y')| <= d(x, x') + d(y, y')

Proof: We have d(x, y) <= d(x, x') + d(x', y) by [m 4] <= d(x, x') + d(x',
y') + d(y', y) by[m 4] = d(x, x') + d(x', y') + d(y, y') d(x, y) - d(x', y') <=
d(x, x') + d(y, y') Again, d(x', y') <= d(x', x) + d(x, y') <= d(x', x) + d(x, y)
+ d(y, y') by [m3] .....(1) by[m 4] by[m 4] = d(x, x') + d(x, y) + d(y, y')
by[m3] d(x', y') - d(x, y) <= d(x, x') + d(y, y') from (1)&(2), we have
|d(x, y) - d(x', y')| <= d(x, x') + d(y, y') .....(2)
[m2]: d^ * (x, y) = 0 iff M * d(x, y) / 1 + d(x, y) = 0 iff d(x, y) = 0 iff x =
y

[m3]: d^ * (x, y) = M * d(x, y) / 1 + d(x, y) d^ * (x, y) = M * d(y, x) / 1 +

d(y, x) longrightarrow d^ * (x, y) =d^ * (y,x)

[m 4]: Let x, y, z \in X Then d^ * (x, y) = M * d(x, y) / 1 + d(x, y) d^ * (x,

y) <= M[d(x, z) + d(z, y)] / 1 + d(x, z) + d(z, y) d^ * (x, y) <= M * d(x, z) /
1 + d(x, z) + d(z, y) M * d(z, y) / 1 + d(x, z) + d(z, y) d^ * (x, y) <= M *
d(x, z) / 1 + d(x, z) M * d(z, y) / 1 + d(z, y) d^ * (x, y) <= d^ * (x,z)+d^ *
(z,y) Hence, ( X ,d^ * ) is a bounded metric space

Definition:

Let (X,d) be a metric space. Wesay that X is bounded if there exists a

positive number M such that d(x,y)≤M for every pair of points x and y
of X. A metric space which is not bounded is said to be unbounded

Theorem:
Let (X,d) be any metric space and let M be a positive number, then 3
a metric d* on X such that metric space (X,d*) is bounded with
δ(X)≤M

Proof: Let (X,d) be a metric space and let d* is defined by d^ * (x, y) =

M * d(x, y) / 1 + d(x, y) Then d* is a metric as [m 1]: d(x, y) >= 0
Rightarrow M * d(x, y) > 0 Rightarrow M * d(x, y) / 1 + d(x, y) >= 0
→d*(x,y)≥0 ∀x,y,zEX

Theorem 1

Let (X,d) be a metric space and let x,y,z be any three point of X. Then
d(x, y) >= |d(x, z) - d(z, y)|

d(x, z) <= d(x, y) + d(y, z) by[m 4]

d(x, z) = d(x, y) + d(z, y) by[m3]

That is, d(x, z) - d(z, y) <= d(x, y) ...... (1)

Again d(z, y) <= d(z, x) + d(x, y) by[m 4]

Proofs :
We have = d(x, z) + d(x, y) by[m 3] That is, d(z, y) - d(x, z) <= d(x, y) It
follows from(1)&(2) that d(x, y) >= |d(x, z) - d(z, y)| .....(2) .....(3)
speaking figuratively, the inequality (3) states that the difference of
the length of any two sides of a triangle is less than or equal to the
third sides, the sign of equality occuring when the three points are in
a straight line.

The French mathematician Maurice Fréchet initiated the study of

metric spaces in 1905. The usual distance function on the real
number line is a metric, as is the usual distance function in Euclidean
n-dimensional space. There are also more exotic examples of interest
to mathematicians

A metric space is made up of a nonempty set and a metric on the set.

The term "metric space" is frequently denoted (X, d). The triangle
inequality for the metric is defined by property (iv). The set R of all
real numbers with d(x, y) = | x - y | is the classic example of a metric
space.
Types of Metric Spaces Here are several examples of metric spaces
pseudo metric: let X be a non empty set. A mapping d of XxX into R is
called a pseudo metric X iff d sat…

1. ABSTRACT

2. INTRODUCTION

3. REVIEW OF LITERATURE

4. MAIN CONTENT

4.1 Concept of metric spaces

4.2 Types of metric spaces

4.3 Examples

4.4 Some important theorems

5. CONCLUSION

6. REFRENCES

7. BIBLIOGRAPHY

[1]. Nasheem khan, Rajesh Johari,S.S.yadav; Metric spaces - Krishna

prakashan media pvt.Ltd, meerut-250001(UP)

[2]. Bryant, victor (1985). Metric spaces: Iteration and application.

Cambridge University press ISBNO-521-31897-1

(2) Usual Metric

Example: Let the mapping d:RxR.R be defined by d(x,y)=lx-yl ∀x,yeR d
is metric for R is called usual metric

Proofs We have

[m1]: [x-yl≥0 ∀x,yER, show that d(x,y)≥0

[m 2]: [x-yl=0 iff x=y, show that d(x,y)=0 iff x=y

[m3]: [x-yl=ly-x| ∀x,yER, show that d(x,y)=d(y,x)

[m 4]: [x-yls |x-z+z-yl |x-yl≤ |x-z+lz-y Vx,y,zeR Thus

d(x,y)≤d(x,z)+d(z,y) Hence, d is metric on R

I would like to express my deepest sense of gratitude to my learned

supervisor professor DR SHIFALI BHARGAVA, HOD, department of
mathematics (B.S.A. College, Mathura) for his able guidance,
painstaking efforts and encouragement made available to me
throughout the progress of this work without his inspiration and
expert guidance, this would not have reached this stage of
completion.

Our special thanks of gratitude to department of mathematics (B.S.A

COLLEGE, MATHURA) for provide me the facilities in the department
to do this project.

I am also grateful and highly indebted to my parents, friends and

honourable teachers of the department of the mathematics for their
kind co-operation and encouragement.

CHANCHAL SINGH (2203300041031)

A metric space is a way of measuring the distance between points in
a mathematical space. It's a set of point and a way to measure the
distance between any two of those points. This distance is called a
"metric", and it has to follow a few rules, it can't be negative, the
distance between any two points can't be zero unless the points are
the same, and the distance between two points has to be the same
wheather you go from point A to point B or from B to point A.

A metric space is a set together with a measure of distance between

pairs of points in that set. A basic example in the set of real numbers
with the usual notation of distance, where the distance between x
and y is |x-yl.

In the general definition of metric spaces, some basic properties of

absolute value are used as the defining axiom. the triangle inequality
plays a prominent role in metric space.