ABSTRACT
The fixed point theory is a very important tool for research. Since, the last century fixed point
theory has generalized many spaces, including partial metric spaces, partial b-metric spaces,
metric spaces, b-metric spaces etc. For proving this, researchers have many useful mapping
contraction, contractive, expansive, Non – expansive etc. In this paper, we introduce almost
¿ ¿
generalized (ὰ − β̀−γ́ −ψ 1−φ1−υ)-contractive type mappings and we prove the existence and
uniqueness of a fixed point theorem in the context of partial metric spaces. Our results expand
upon various known findings in this area.
CHAPTER- 1
INTRODUCTION
1.1 OVERVIEW
In 1992, Matthews introduced a concept, and basic properties of partial metric (pmetric)
functions. The partial metric space is a generalization of the usual metric space in which the self-
distance is no longer necessarily zero. The failure of a metric function in computer studies was
the 4primary motivation behind the introductory of the partial metrics. After introducing the
partial metric functions, Matthews also proved the partial metric version of the Banach fixed
point theorem; this makes the partial metric function relevant in fixed point theory. The
topological properties of partial metric space studied. In 1999, Heckmann established some
results using a generalization of the partial metric function called a weak partial metric function.
In 2004, Oltra and Valero also generalized the Matthews’s fixed point theorem in a complete
partial metric space, in the sense of O’Neill. In 2013, Shukla et al. introduced the notion of
asymptotically regular mappings in a partial metric space, and established some fixed point
results. Recently, Onsod et al. established some fixed point results in a complete partial metric
space endowed with a graph. Very recently, Batsari and Kumam established the existence, and
uniqueness of globally stable fixed points of an asymptotically contractive mappings. Also
Dhanorkar proved some results using some of the properties of a partial metric function.
1.2 HISTORICAL BACKGROUND
The idea of an abstract space with metric properties was addressed in 1906 by René Maurice
Fréchet and the term metric space was coined by Felix Hausdorff in [Link]échet’s work laid the
foundation for understanding convergence, continuity, and other key concepts in non-geometric
spaces. This allowed mathematicians to study functions and sequences in a broader and more
flexible way. This was important for the growing field of functional analysis. Mathematicians
like Hausdorff and Stefan Banach further refined and expanded the framework of metric spaces.
Hausdorff introduced topological spaces as a generalization of metric spaces. Banach’s work in
functional analysis heavily relied on the metric structure. Over time, metric spaces became a
central part of modern mathematics. They have influenced various fields including topology,
geometry, and applied mathematics. Metric spaces continue to play a crucial role in the study of
abstract mathematical concepts.
1.2 METRIC
Definition.1.2.1:- Let S is nonempty set. A function d: S × S → R called metric if
it satisfies the following four properties:
• d(x,y) ≥ 0, for all x,y ϵ S
• d(x,y) = 0, if and only if x = y
• d(x,y) = d(y, x) for all x,y ϵ S
• d(x,y) ≤ d(x, z) + d(z, y) for all x,y,z ϵ S
If d is metric on nonempty set S, then S called metric space, as described in the
following definition:
1.3 METRIC SPACE
Definition.1.3:-Metric space is a set of pairs (S,d), where S is nonempty set and d is
a metric on S. ( Maurice Fréchet ,1906)
1.4 CONE
Definition.1.4:- Let E be a real Banach space. A subset P of E is called a cone if the following
conditions are satisfied:-
(i) P is closed nonempty and P ≠0;
(ii) a,b ϵ R, a,b ≥ 0 and x, y ϵ P imply that ax+byϵ P ;
(iii) P∩(−P) = {0}.
A cone P is called normal if there is a number K> 0 such that for all x, y ∈ E, 0 ≤ x ≤ y implies
||x|| ≤ K ||y||. The least positive number satisfying the above inequality is called the normal
constant of P.
1.5 CONE METRIC SPACE
Cone metric spaces were introduced in 2007 by Huang and Zhang[21] as a generalization of
metric spaces.
Definition.1.5[21]:- Let X be a nonempty set and d : X ×X → E be a mapping such that the
following
conditions hold:
(i) 0 ≤ d(x, y) for all x, y ϵ X and d(x, y) = 0 if and only if x = y ;
(ii) d(x, y) = d(y, x) for all x, y ϵ X ;
(iii) d(x, y) ≤ d(x,z) +d(z, y) for all x, y,z ϵ X.
Then d is called a cone metric on X and (X,d) is called a cone metric space.
Example: Let X = R, E = R2, P = {(x, y) ϵ E : x, y ≥ 0} ⊂ R2 and d : X ×X → E
such that d(x, y) = (| x−y |,δ | x−y |), where δ ≥ 0 is a constant. Then (X,d) is a
cone metric space.
1.6: D- METRIC SPACE:
The notation of D- metric space was originally introduced by Dhage. Dhage introduced new
notation of new structure D- metric space which is higher dimensional metric space of ordinary
metric space. The concept of convergence of sequences in a D- metric space was introduced by
him.
d satisfies, ∀ x,y,,z ϵ X
Definition 1.6.1[14]:- Let X is a non-empty set. Let D: X ×X×X →[0,∞) is called a D- metric if
[D1]: D(x,y,z,) ≥ 0, ∀ x, y, z ϵ X (Non – negativity )
[D2]: D(x,y,z) = 0 iff x = y = z (coincidence)
[D3]: D(x,y,z) = D(p(x,y,z)) for every x, y, z ϵ X were p is permutation of x,y,z. (symmetry)
[D4]: D(x,y,z) = D(x,y,u)+D(x,u,z)+ D(u,y,z),∀ x,y,z,u ϵ X.( Tetrahedral inequality).
The non-empty set X together with D-Metric “D” is called D-Metric space and it is denoted by
(X,D). Geometrically, D-Metric D(x,y,z) is per diameter of a triangle whose vertices are ,x,y,z.
1.7 RECTANGULAR METRIC SPACE
Branciari introduced the concept of rectangular metric space by replacing the sum
on the right hand side of the inequality in the definition of a metric space by a three
term expression and proved an analogue to the Banach contraction principle in
such space.
Definition1.7[11]:- Let X be a nonempty set and suppose that the mapping d:
X×X→ R+ satisfies:
[R1]: d(x,y) > 0, ∀ x,y ϵ X;
[R2]: d(x,y) = 0 ⇒ x = y, ∀ x,y, ϵ X
[R3]: d(x,y) = d(y,x), ∀ x,y ϵ X
[R4]: d(x,y) ≤ d(x,u) + d(u,v) + d(v,y) x,y,u,v ϵ X
Then d is called a rectangular metric on X and (X,d) is called a rectangular metric
space.
1.8 FIXED POINT:
A fixed point of a function is a fundamental concept in mathematics and its applications. In
simple terms, a fixed point is a value that does not change when a specific function is applied to
it. Formally, let be a function defined on a set . A point is called a fixed point of if . This means
that applying the function to returns the same value , leaving it “fixed.”
The idea of fixed points appears in various areas of mathematics such as calculus, algebra,
topology, and analysis. One of the most important applications of fixed points is in solving
equations. For example, finding a solution to the equation is the same as finding a fixed point of
the function. Fixed points are not only mathematical curiosities but also have real-world
applications. In computer science, fixed points help define recursive functions and play a role in
programming language semantics. In economics, fixed point theorems are used to prove the
existence of equilibria, such as in Nash equilibrium in game theory. In physics and biology, fixed
points represent steady states of dynamic systems.
In generalized metric spaces, such as partial metric spaces, the concept of fixed points has been
extended. In these spaces, self-distances need not be zero, and fixed point results have been
adapted to handle this more general structure. These generalizations are useful in theoretical
computer science and analysis, especially in contexts where data or states may be incomplete or
partially defined.
In 1886 Poincare [24] introduced a new concept in non known linear functional analysis is
known as fixed point.
Definition 1.8:- Let X is a non empty set. Let f be A self mapping on X. A point z ϵ X is called a
fixed point if f(z) = z.
1.9 TOPOLOGICAL FIXED POINT THEORY
Topology term is a combination of two words topo that mean surface and logy that mean study;
i.e., Study of surface is called topology and a space which has been selected for study of surface
is known as topological space.
Definition 1.9:- Let 𝑋 be a non empty set and let 𝑇 be the collection of all
possible open subset of 𝑋 then order pair (𝑋, 𝑇) is said to be topological space if
𝑇1: 𝑋 &𝜑 both exist in 𝑇 i.e., 𝑋𝑇, 𝜑 ϵ 𝑇
𝑇2: Finite intersection of open subset of 𝑋 must be exists in 𝑇 i.e., if 𝐺1 & 𝐺2
are any two open subset of 𝑋 then 𝐺1 ∩ 𝐺2 ∈ 𝑇.
𝑇3: Union of arbitrary collection of open subsets of 𝑋 me belongs to 𝑇 i.e., if
{𝐺⋋:⋋ϵ ∧} be the collection of arbitrary open subsets of 𝑋 then ∩ {𝐺⋋:⋋ϵ ∧} ∈
𝑇.
Example- Let 𝑋 = {1,2,3}𝑇 = {𝜑, {1}, {2,3}} then clearly 𝑇 is topology on 𝑋
because 𝑇 satisfies all condition.
1.10 MAPPING
1.10.1 CONTRACTION MAPPING
Contraction theory can be systematically and simply extended to address classical questions in
hybrid non linear system. The key idea is to view the formal definition of a virtual displacement,
a concept central to the theory, as describing the state transition of a differential system. This
yields in turn a compositional contraction analysis of switching and resetting.
Definition 1.10:- Contraction mapping or contraction or contractor on a metric space (𝑀, 𝑑) is
a function f from m to itself with the property that there is a sum non negative real number 0 ≤
k<1 for all X and y in, 𝑑(𝑓(𝑥), 𝑓(𝑦)) ≤ 𝑘𝑑(𝑥, 𝑦), for all 𝑥, 𝑦 ∈ 𝑋, contraction is always
continuous. The smallest such value of 𝑘 called the lipshitz constant of 𝑓. Contractive maps are
sometimes called Lipschitzian maps.
Example - 𝑋 = [0,1], with the user metric, define 𝑓: 𝑥 → 𝑋 such that F(x)= 1/2 + 𝑋
1.10.2 CONTRACTIVE MAPPING
The first important result on fixed points for contractive type mapping was the Banach’s
contraction principle appeared in explicit forms in Banach’s contraction principle appeared in
explicit form in Banach’s thesis in 1922, where it was used to establish the a solution for an
integral equation.
Definition 1.10.2:- Let (𝑋, 𝑑) be a metric space. Then the mapping 𝑇: 𝑥 → 𝑥 is said to be
contractive, if the following condition holds:
𝑑(𝑇𝑥, 𝑇𝑦) ≤ 𝑑(𝑥, 𝑦) for some 𝑥, 𝑦 ϵ 𝑋, 𝑥 does not belongs to 𝑦 .
We note that a contractive mapping on a complete metric space doesn’t necessarily imply the
existence of fixed point. The following example illustrates this
Example – Let 𝑇: [1, ∞) → [1, ∞) be defined by 𝑇(𝑥) = 𝑥 + 1𝑥 , where [1, ∞) is equipped with
the usual metric. Thus 𝑑(𝑇𝑋, 𝑇𝑌).
1.11 PARTIAL METRIC SPACE
Definition 1.11.1[27] Let X be a non-empty set. Suppose the mapping p: X × X →
E → [0, ∞) is said to be a partial metric on X if for any x, y, z ∈ X the following
conditions hold:
[P1]: p(x, y) = p(y, x) (symmetry),
[P2]: If p(x, x) = p(x, y) = p(y, y) then x = y (equality),
[P3]: p(x, x) ≤ p(x, y) (small self distances),
[P4]: p(x, z) ≤ p(x, y) + p(y, z) – p(y, y) (triangular inequality)
Then (X,p) is called a partial metric Space .
Notice that For a given partial metric p on X, the function d p: X × X → E → [0, ∞) given by
dp(x, y) = 2p(x, y) – p(x, x) – p(y, y) is a metric on X.
Observe that each partial metric p on X generates a T 0 topology Tp on X with a base of the
family of open p-balls {Bp(x, ϵ)/x ∈ X, ϵ > 0}, Where Bp(x, ϵ) = {y ∈ X/p(x, y) < p(x, x) + ϵ} for
all x ∈ X and ϵ > 0. Similarly, closed p-ball is defined as Bp(x, ϵ) = {y ∈ X/p(x, y) ≤ p(x, x) + ϵ}
Definition 1.11.2[27] (1) A sequence {xn} in a partial metric space (X, p) converge to x ∈ X if
and only if p(x, x) = limn→∞p(x, xn).
(2) A sequence {xn} in a partial metric space (X, p) is called Cauchy if and only if x ∈ X if and
only if p(x, x) = limn,m→∞p(xn, xm) is finite,
(3) A partial metric space (X, p) is said to be complete if every Cauchy sequence {xn} in X
converges, with respect to Tp, to a point x ∈ X such that p(x, x) = limn,m→∞p(xn, xm)
(4) A mapping f: X → X is said to be continuous at x 0 ∈ X if for every ϵ > 0, there exist Δ > 0
such that f(B((x0), δ)) ⊂ B(fx0, ϵ)
Definition 1.11.3:- A sequence {xn} is Cauchy in a partial metric space (X, p) if and only
if {xn} is Cauchy in a metric space (X, dp),
(ii) A partial metric space (X, p) is complete if and only if a metric space (X, dp) is
complete.
Moreover limn→∞ dp(x, xn) = 0 ⇒ p(x, x) = limn→∞ dp(x, xn) = limn,m→∞ dp(xn, xm)
Lemma 1. A partial metric space (𝑋, 𝑝) is first countable.
Proof;-. For each rational r (> 0) ,let 𝐵𝑟(x0) = {𝑥 ∈ 𝑋: 𝑝(𝑥, x0) < 𝑝(x0, x0) + 𝑟}. Then the
family
{𝐵𝑟(x0)}, 𝑟 > 0 forms a neighborhood base at x0. So, (𝑋, 𝑝) is first countable.
Lemma 2. Assume that xn → z as n → ∞ in a PMS (X, p) such that p(z, z) = 0. Then limn→∞ p(xn,
y) = p(z, y) For every y ∈ X.
Proof. First note that limn→∞ p(xn, z) = p(z, z) = 0
. By the triangle inequality we have P(xn, y) ≤ p(xn, z) + p(z, y) – p(z, z) = p(xn, z) + p(z, y)
And P(z, y) ≤ p(z, xn) + p(xn, y) – p(xn, xn) ≤ p(xn, z) + p(xn, y).
Hence, 0 ≤ |p(xn, y) – p(z, y)| ≤ p(xn, z).
Letting n → ∞ we conclude our claim.
1.12 PARTIAL HAUSDORFF SPACE
Let (X, p) be a partial metric space. Let CB p(X) be the family of all nonempty, closed and
bounded subsets of the partial metric space (X, p), induced by the partial metric p. Note that
Closedness is take from (X, τp) (τp is the topology induced by p) and boundedness is given as
follows: A is a bounded subset in (X, p) if there exist x 0 ∈ X and M ≥ 0 such that for all a ∈ A,
we have a ∈ Bp(x0, M), that is, p(x0,a) < p(a,a) + M.
1.13 B- Metric Spaces
The concept of b-metric spaces was introduced by Bakhtin and used by Czerwik in
connection with problems concerning the convergence of measurable function with
respect to measure. They proved b-metric spaces as the generalization of usual
metric spaces.
Definition 1.13[18]:- Let X be a nonempty set and let s be a real number that is greater than or
equal to 1. When all x, y, and z ∈ X satisfy the following criteria, a function is referred to as a b-
metric:
(1) d(x,y) = 0 if and only if x = y
(2) d(x,y) = d(y,x)
(3) d(x,y) ≤ d(x,z)+ d(z,y)
Then the pair (X,d) ID called B- metric space.
1.14 M-Metric Spaces
Definition 1.14 Let X be a nonempty set. A function m:X×X→[0,∞] is called an if for all the
following conditions are satisfied
(1) m(x,x) = m(y,y) = m(x,y) if and only if x=y
(2) m(x,x) ≤ m(x,y) + m(z,y) - m(z,y)
(3) m(x,y)= m(y,x)
(4) m(x,y)- m(y,x) ≤ [m(x,z)-m(x,z)]+[m(y,z)-m(y,z)]
The pair (X,m) is called M-Metric Space.
Example- Let X= {1,2,3} m:X×X→[0,∞] be defined by m(1,1) = 1, m(2,2) = 9, m(3,3) = 4,
m(1,2) = m(2,1) = 10, m(1,3) = m(3,1) = 7, m(2,3) = m(3,2) = 7. Then the given m is M- Metric
Space, it is not a partial metric because m(2,2) > m(3,2).
1.5 α −¿ Admissible Mapping
Definition 1.5:- Let (X,d) be a metric space and α : X×X→[0,∞) be an auxiliary function. A
mapping T: X→X is said to be alpha admissible if
α ( x , y ) ≥ 1 ⇒ ( Tx , Ty ) ≥ 1 for every x , y ϵ X
1.6 β− Admissible Mapping
Definition1.6:- Let (X,d) be a metric space and a mapping T:X→X is said to be β admissible if
there exist a function : β : X×X→[0,∞) such that
For all x,y X (x,y) ≥ 1⇒ β (Tx,Type) ≥ 1.
In simple terms if a pair (x,y) is admissible according to β ¿i.e. β (x,y) ≥ 1) then the image pair
(Tx,Ty) must also be admissible.
1.7 γ −¿ Admissible Mapping
Definition1.7:- A mapping T is said to be γ admissible if for all x,y ϵ X γ (x,y) ≥ 1
⇒ γ (Tx,Ty) ≥ [Link] other words if a pair (x,y) is admissible according to γ i.e.( γ (x,y) ≥ 1) then
their images under T must also be admissible .
CHAPTER - 02
REVIEW OF LITERATURE