Professional Documents
Culture Documents
The_beamer_Minimal_Theme__black_and_white___1_
The_beamer_Minimal_Theme__black_and_white___1_
metric space
Anil Singh
5 Main Results
6 Bibliography
Introduction
Definition
[1] Let X be a non-empty set. Then a function d : X × X → R is said to
be a metric on X if it satisfies the following conditions:
N d(x, y ) ≥ 0 ∀ x, y ∈ X
N d(x, y ) = 0 if and only if x = y .
N d(x, y ) = d(y , x) ∀x, y ∈ X .
N d(x, y ) ≤ d(x, z) + d(z, y ), ∀x, y , z ∈ X (Triangle inequality).
If d is a metric on X, then the ordered pair (X , d) is called metric space.
Example
1. Let X = R, the set of all real numbers. For any x, y ∈ X , define
d(x, y ) = |x − y |.
lim d(xn , x) = 0.
n→∞
Example
N [6] A set X with the discrete metric forms a complete metric space.
N [5] R is complete.
N [5] Euclidean space Rn is a complete metric space.
N [5] The space l p , 1 ≤ p ≤ ∞ is a complete metric space.
• Incomplete metric space
Definition
[6] A metric space (X , d) is said to be incomplete if there exists at least
one Cauchy sequence in X that does not converge to a point in X . In other
words, there exists a Cauchy sequence {xn } in X such that for any x ∈ X ,
lim d(xn , x) 6= 0.
n→∞
Example
N [5] The space of rational number with the usual metric is incomplete.
N [5] The space of all natural numbers N with the metric
1 1
d(x, y ) = x − y for all x, y ∈ N is not complete.
Definition
[5] Let X be a non-empty set, and T : X → X be a mapping. A point
x̄ ∈ X is said to be a fixed point of T if T (x̄) = x̄.
Example
N Let X = R be a non-empty set, and T : X → X be a mapping defined
by T (x) = x + a for some fixed number a 6= 0. Then T has no fixed point.
N Let X = R, and T : X → X be a mapping defined by T (x) = 12 x. Then
x = 0 is the only fixed point of T .
N Let X = R, and T : X → X be a mapping defined by T (x) = x. Then
T has infinitely many fixed points. In fact, every point of X is a fixed
point of T .
Definition
[5] Let X = (X , d) be a metric space. A mapping T : X → X is called a
contraction on X if there exists a positive real number α < 1 such that
for all x, y ∈ X :
d(Tx, Ty ) ≤ αd(x, y ). (α < 1)
Example
[5] Consider the usual metric d for R2 and the mapping
1
f : R2 → R2 as f (x) = x, ∀ x ∈ R2 where x = (x1 , x2 ). Then f is a
2
contraction on R2 .
Theorem
[5] Banach Contraction Principle
Every contraction mapping on a complete metric space has a unique fixed
point.
OR
then it has a unique fixed point x̃ ∈ X and {T n (x)} converges to x̃ for all
x ∈ X.
Definition
[1] Let X be a metric space. A function ϕ : X → R is called
• Lower semicontinuous at xo ∈ X if:
2Ln
S(F n (x), F n (x), u) ≤ S(x, x, F (x)).
1−L
Example
N [8] Let X = R, then S(x, y , z) = |x − z| + |y − z| is an S-metric on X .
Define a self-map F on X by: F (x) = 21 sin x. We have
1 1
S(Fx, Fx, Fy ) = | (sin x − sin y )| + | (sin x − sin y )|
2 2
1 1
≤ (|x − y | + |x − y |) = S(x, x, y )
2 2
for every x, y ∈ X . Furthermore, for any x ∈ X , we have
limn→∞ F n (x) = 0 with
2Ln 1
S(F n (x), F n (x), 0) ≤ S(x, x, F (x)), L = .
1−L 2
It follows that all conditions of above theorem hold, and there exists
u = 0 ∈ X such that u = Fu.
Next, we present a local version of Banach’s contraction principle.
Theorem
[8] Let (X , S) be a complete S-metric space and let
r2
S(F (x0 ), F (x0 ), x0 ) < (1 − L) .
2
Then F has a unique fixed point in Bs (x0 , r ).
Key Assumptions
N The set X must be closed and bounded. In one dimension, this could be
an interval [a, b], while in higher dimensions, it could be a closed ball,
closed sphere, or a closed and bounded region.
N The function f defined on X must be continuous, meaning that small
changes in the input should lead to small changes in the output.
Intuitive Example
Consider a sheet of rubber with some ink dots on it. You can stretch and
deform the sheet, atleast one dot will end up exactly where it started, even
though the distance between the dots may have changed.
Significance
Brouwer’s Fixed Point Theorem has broad implications and applications in
mathematics, economics, and the sciences. It forms the foundation of
various mathematical theories and algorithms in game theory and the
topology. Additionally, it has applications in fields like economics, physics,
and computer science.
Theorem
[9] Brouwer’s fixed point theorem for [0, 1]:
If f : [0, 1] → [0, 1] is a continuous function, then there exists x ∈ [0, 1]
such that f (x) = x, i.e., x is a fixed point of f (x).
Theorem
[9] Brouwer’s fixed point theorem (for unit disc B 2 ):
If f : B 2 → B 2 is a continuous map, then there exists a point x ∈ B 2 such
that f (x) = x.
Theorem
[9] (Brouwer): Let f : Dn → Dn be a continuous function. Then f has a
fixed point x̄ ∈ Dn .
• Applications of the Brouwer fixed point
A fundamental result that underpins a great deal of mathematics is the
Intermediate Value Theorem (IVT), we have already encountered it in
one-dimension. In the n-dimensional case, the IVT is the following:
Theorem
[2] (Intermediate Value Theorem) Suppose that f : Dn → Rn is continuous
and suppose that when |x| = 1 (x ∈ ∂Dn ), we have
hf (x), xi < 0.
f (x) = 0.
• Topological Invariance of Domain and dimension
Theorem
[3] (Invariance of Domain ): Let U be an open subset of Rn and let
f : U → Rn be continuous, injective function. Then f (U) is open.
Theorem
[3] (Invariance of Dimension): If U is an open subset of Rm and V is an
open subset of Rn , and f is a homeomorphism from U to V , then m = n.
Example
The theorem has several real-world illustrations. Here are some examples:
N Given two similar maps of a country of different sizes resting on top of
each other, there always exists a point that represents the same place on
both maps.
N Consider a map of a country. If that map is placed anywhere in that
country, there will always be a point on the map that represents the exact
point in that country.
N Recently, Browder provided an alternative proof using Brouwer’s
fixed-point theorem for his own theorem, which states that for every
continuous mapping f : [0, 1] × X → X , where X is a nonempty, compact,
and convex set in Euclidean space, the set of fixed points of f , namely the
set {(t, x) ∈ [0, 1] × X : f (t, x) = x}, has a connected component whose
projection onto the first coordinate is [0, 1].
[1] Q. Ansari, Metric Spaces Including Fixed Point Theory and Set-valued
Maps, Alpha Science, 2010.
[2] N. M. Eagles, Point Set Topology, the Brouwer Fixed Point Theorem
and Applications, Summer Vacation Project, 2019.
[3] A. F. Schirru, A Topological Proof of the Invariance of Dimension
Theorem, 2015.
[4] A. H. Siddiqi and S. Nanda, Functional analysis and applications,
Springer, 2018.
[5] E. Kreyszig, Introductory functional analysis with applications, John
Wiley and Sons, 17 1991.
[6] G. F. Simmons, Introduction to topology and modern analysis, Tokyo,
44 1963.
[7] P. K. Jain, K. Ahmad and O. P. Ahuja, Functional analysis, New Age
International, 1995.
[8] S. Sedghi, Shaban , Shobe, N. , Aliouche, Abdelkrim,A generalization
of fixed point theorems in S-metric spaces, Matematicki Vesnik. 2012.
[9] V. Pata, Fixed Point Theorems and Applications, Springer, 2019.