1. Introduction
The fundamental Banach fixed-point result [
1], introduced in 1922 in Banach’s thesis, remains a cornerstone in the theory of metric fixed points. According to this result, any Banach contraction mapping
on a complete metric space
, possesses a unique fixed point
, i.e.,
. Specifically, a mapping
is known as a Banach contraction if for all
, the distance between
and
satisfies the condition
for
. This principle, known for its reliability and implementation, has become an indispensable tool for proving the presence of solutions to a wide variety of problems in mathematics and the applied sciences, including integral and differential equations across fields such as physics, engineering, biology, social sciences, etc.
In the years following its introduction, Banach’s contraction theorem inspired numerous extensions and generalizations. Prominent contributions from Edelstein [
2], Rakotch [
3], Boyd and Wong [
4], Meir and Keeler [
5], Reich [
6], Matkowski [
7], and others have expanded the scope of the theorem, exploring different types of contractions, the role of completeness, and various related fixed point results. Notably, the theorem’s applicability has been broadened with new contractive conditions and extensions to broader domains, as discussed in the works of Nadler [
8] and others. For further developments on metric fixed point theory and its applications, the recent research by Joshi and Bose [
9], Almezel et al. [
10], and Hammad and Manuel [
11,
12] offers valuable insights. These extensions not only retain the original power of the Banach contraction principle but also explore its use in solving more complex problems across diverse scientific areas.
Various modifications of the Lipschitz condition have been proposed, based on different distance measures. These include six specific distances, as follows: , , , , , and for all . In its classical form, the Lipschitz condition typically involves an inequality between two of these distances: and , which ensures that an operator is continuous or uniformly continuous. However, several authors have explored alternative inequalities that involve some or all of these six distances. While these alternative conditions offer insight, they do not always guarantee the continuity of the mapping in question.
In addition, Kannan [
13] and Chatterjea [
14] contractions have been studied extensively due to their importance in proving the presence of fixed points. An operator
is classified as a Kannan contraction if we find a constant
such that
Similarly, an operator
is referred to as a Chatterjea contraction if we find a constant
for which
Alam and Imdad [
15] gave a weaker form of the Banach contraction condition, applying it only to point pairs connected by a specific binary relation, rather than throughout the whole space. This viewpoint inspired substantial research on fixed point theory in the framework of binary relations, commonly known as relational metric spaces. In particular, Din and his collaborators (see [
16,
17]) explored extensions of Perov’s classical fixed point theorems within this context.
Goebel and Pineda [
18] and Goebel and Sims [
19] introduced a new class of mappings termed
-Lipschitz mappings. Consider
, where each
, with the conditions
and
for all
, and
. We then refer to
as a multi-index, and the number
k is called the length of the multi-index
. For further information on
-Lipschitz mappings, see the works of Goebel and Japon-Pineda [
18], where they introduce a new type of nonexpansiveness that generalizes traditional Lipschitz conditions, offering a broader framework for studying fixed-point theory. Their approach is further expanded by Goebel and Sims [
19], who explore mean Lipschitzian mappings, which offer insights into the behavior of mappings under more relaxed Lipschitz conditions. Additionally, the work of Asem et al. [
20] on
-cyclic contractions delves into the relationships between such mappings and the existence of fixed points, contributing to a deeper understanding of cyclic iterations and their convergence properties. These contributions collectively highlight the versatility and applicability of
-Lipschitz mappings in modern fixed point theory.
Motivated by the concept of
-Lipschitz mappings,
-nonexpansive mappings with multi-indices [
18,
19], and utilizing the technique introduced by Alam and Imdad [
15], we initiated the development of
-type symmetric nonexpansive mappings with multi-indices. We also define the concept of
-type symmetric Kannan contractions and
-type symmetric Chatterjea contractions with some multi-indices, and establish related fixed point results. Finally, we provide several detailed examples to verify our findings and present an existence condition to show the presence of a solution for an integral equation. We also study the existence and uniqueness of solutions for economic growth models with fractional differential equations using generalized fixed-point techniques.
3. Main Results
In this section, we introduced the concept of -type symmetric nonexpansive mappings with multi-indices. We also defined the notions of -type symmetric Kannan contractions and -type symmetric Chatterjea contractions for certain multi-indices, and established corresponding fixed point results. Lastly, we presented several detailed examples to illustrate and validate our findings.
Definition 4. A mapping is referred to as a -type symmetric Lipschitzian if, for some multi-index τ of length k and , there exists a constant such thatfor all with . The smallest
satisfying the
-type symmetric Lipschitz condition is termed the corresponding Lipschitz constant. The mapping
is called a
-type contraction if
, and non-expansive if
. When
and
is unspecified,
is referred to as a mean-theoretic order
-contraction if
or an
-non-expansive mapping if
. If
, then a
-type contraction reduces to a
-contraction. Moreover, if
in (
6), the mapping
is referred to as a
-type contraction.
Definition 5. A mapping is said to be a -type symmetric Kannan contraction if, for some multi-index τ of length k and , there exists a constant such thatfor all with . Definition 6. A mapping is termed a -type symmetric Chatterjea contraction if, for some multi-index τ of length k and , there exists a constant such thatfor all with . For simplicity, we focus on the multi-index of length in this section. This simplification aids in better illustrating the concepts, although the method can be generalized to indices of higher dimensions.
Example 3. Consider equipped with the standard metric . Define the binary relation and self-mapping as given below:andAdditionally, for all . Then for all , we haveAlso, we have the following:So, for any , we getfor all . It is evident that constitutes a -type symmetric nonexpansive mapping, where the multi-index τ has a length of . For additional examples of -type symmetric contraction mappings, as well as -type symmetric Kannan contractions and -type symmetric Chatterjea contractions, we direct the reader to Examples 4, 5, and 7 for further clarification and detailed illustrations.
Theorem 2. Consider as a metric space, equipped with a binary relation and a self-mapping on . Suppose that the following assumptions are fulfilled:
- 1.
is -complete;
- 2.
is -closed;
- 3.
either is -continuous or is d-self-closed;
- 4.
is non-empty;
- 5.
is a -type symmetric contraction with constant .
Then, has a fixed point.
Proof. In lieu of assumption (4), there exists a
, that is,
. Define a Picard sequence
at the initial guess
, that is,
, for all
. As
, using assumption (2), we obtain
which further implies that
This indicates that the Picard sequence
maintains the relation
throughout its iterations, making it a
-preserving sequence. If there exists some
such that
, then
, i.e.,
. From this point onward in the proof, we proceed under the assumption that
, for all
. Setting
, we have
and
.
Now, we discuss the following cases.
Case (i): When
and setting
. Taking
and
in (4), we obtain the following:
It follows that:
Again, taking
and
in (4), we obtain the following:
Therefore,
. And from (4), we obtain the following:
Therefore,
. Additionally, we have the following:
Similarly, we obtain the following:
Hence, we have
as
. We now aim to demonstrate that the sequence
forms a Cauchy sequence in the space
. To this end, consider any
, and let
,
; then we get
Taking limit as
, we obtain
, which means that
is a
-preserving Cauchy sequence in
.
Case (ii): When
and setting
. Taking
and
in (4), we have the following:
Therefore, we obtain the following:
Again, taking
and
in (4), we obtain the following:
And
Additionally, we have the following:
Moreover, we obtain the following:
Further, we obtain the following:
Proceeding with the same steps as previously outlined, we arrive at the following:
whenever
or
, it shows that
as
. To demonstrate that the sequence
is Cauchy in
, consider the two possible subcases by selecting positive integers
m and
n such that
.
Subcase (a): For
, where
, we have
Subcase (b): Similarly, for
with
, we obtain the following:
Letting
in all sub-cases and noting that
, it follows that
Therefore,
forms a
-preserving Cauchy sequence in
. Consequently, in all cases considered, the sequence retains the
-preserving property. Given that
is
-complete, there exists a point
such that
as
.
Finally, to establish that is a fixed point of , assumption (3) is employed. Assuming is -continuous, and given that the sequence is -preserving with , the -continuity of ensures that . By the uniqueness of the limit, we conclude that . Thus, is a fixed point of .
Alternatively, suppose that
is
d-self-closed. Since the sequence
is preserved under
and converges to
, ∃
from
for which, for all
, the pair
lies within
. By invoking assumption (5) and Definition 1(1), we deduce that
and
, which leads to the following conclusion:
Taking the limit as
, we obtain
This implies that
and
. Therefore,
, and hence,
. □
To ensure that the fixed point is unique, we impose stronger conditions on the contraction mapping as well as the associated relation. These supplementary constraints prevent the existence of multiple distinct fixed points, thereby guaranteeing that the fixed point set contains exactly one element, that is, it is a singleton.
Theorem 3. If all the hypotheses outlined in Theorem 2 hold, and in addition, for any pair of elements , there exists at least one path connecting them within the relation , that is,then the self-mapping possesses exactly one fixed point. Proof. The existence part of the result follows directly from Theorem 2. We now proceed to prove the uniqueness part. Suppose, for contradiction, that the operator
has two distinct fixed points, denoted by
and
. Then, there exists a finite sequence (or path)
such that
Since
is
-closed, so by Definition 1(4), we obtain
Utilizing the triangle inequality in conjunction with the contraction-type condition for all
, we get
Thus, we conclude that
, which leads to a contradiction. Therefore, the set
must be a singleton set. □
The following example is presented to illustrate the above result.
Example 4. Let and define a metric d on by for all . Then is a complete metric space. Consider the binary relationand define the mapping by for all Then, we obtain for all For all , we haveandWe consider the multi-index , where . Then, for all , we getwhereMoreover, there exists such that , is -closed and T is continuous. Hence, all the assumptions of Theorem 2 are satisfied, and therefore Furthermore, for any , we have Consequently, by Theorem 3, which is a singleton set.
By considering the binary relation
on
as
, we can deduce the main result of Khan et al. [
29] as follows.
Corollary 1 ([
29])
. Consider as a complete metric space, and let be a self-mapping on that satisfies the conditions of a -type contraction, where τ is a multi-index of length and . In this case, the set of fixed points contains exactly one element. Proof. Consider a multi-index
of length
, where
. Therefore, we can express
as
. The condition
implies that
From this, we deduce that
, where
. Furthermore, all the other conditions of Theorem 3 are met, and thus,
contains exactly one element. □
Next, we state and prove the fixed point result for a -type Kannan contraction mapping, which is as follows:
Theorem 4. Consider as a metric space, where represents a binary relation on , and is a self-mapping of . Assume that the following conditions hold:
- 1.
is -complete;
- 2.
is -closed;
- 3.
either is -continuous or is d-self-closed;
- 4.
is non-empty;
- 5.
is a -type symmetric Kannan contraction with constant .
Then, has a fixed point.
Proof. Using the same steps as in Theorem 2, we can define a Picard sequence
such that
and
for all
. Next, assume
, then we have
and
. Now, we show that the sequence
is a monotone decreasing sequence of positive real numbers. As
Therefore, we obtain
If for some
, we have
, then
This leads to a contradiction, and hence we have
for all
. Thus,
is a monotone decreasing sequence of positive real numbers. Setting:
Now, as in Theorem 2, the following cases arise:
Case (i): If
and then define
. Taking
and
in (
7), we obtain the following:
Again, taking
and
in (
7), we get
Additionally, from (
7), we have
Similarly, we obtain the following:
In general, we obtain the following:
Therefore,
as
.
Case (ii): When
and setting
. Taking
and
in (
7), we have the following:
Therefore, we obtain the following:
Again, taking
and
in (5), we obtain
and also
Additionally, we get
Further, we obtain the following:
and
Thus, in general, it follows that
whenever
or
. Therefore,
as
.
Following the same reasoning as in Theorem 2, it can be established that, in all cases, the sequence is a -preserving Cauchy sequence in . Given that is -complete, there exists a point such that converges to as .
Using assumption (3), we show that is a fixed point of . Assume that is -continuous. Since the sequence is an -preserving sequence and converges to , the -continuity of implies that converges to . Due to the uniqueness of the limit, it follows that , which confirms that is a fixed point of .
Alternatively, assume that
is a
d-self-closed binary relation. Given that the sequence
is preserved by
and converges to
, there exists a subsequence
from
such that, for every
, the pair
is contained within
. By invoking assumption (5) and Definition 1(1), we deduce that
and
, which leads to the following conclusion:
Taking the limit as
, we obtain
This implies that
, and consequently,
. Therefore,
. □
To establish the uniqueness of the fixed point for a -type Kannan contraction mapping, we additionally assume the following condition:
Theorem 5. If all the conditions specified in Theorem 4 are satisfied, and for every pair of elements , they are comparable with respect to the binary relation , then must be a singleton.
Proof. Let
. Then
and so using Definition 1(1) and inequality (5), we get
This leads to the conclusion that
, which is a contradiction. Therefore,
must be a singleton. □
Example 5. Let with the usual metric and is defined byand construct a binary relation . Notice that there exists such that , also whenever , then showing that the binary relation is -closed. Now for any and taking , , and , we getas well asTherefore, we further obtainHence, the following inequality holdsfor all with , , and . This shows that is a -type symmetric Kannan contraction mapping of multi-index τ of length with . Therefore, all the conditions of Theorem 4 are satisfied, which leads to the conclusion that . In the following example, we modify the binary relation, and its impact can be clearly observed. This change leads to a different structure in the mapping behavior and fixed-point analysis.
Example 6. Let with the usual metric and be given asWe construct a binary relation , where . Notice that there exists such that , also whenever , then either or which implies , and it shows that the binary relation is -closed. Now, for , we have two cases, either or When , we discuss more subcases:
Subcase (1): If and , then and . So by taking , , we getIt can also be noticed thatTherefore, we havefor all and , where . Subcase (2): If and , then the above inequality holds trivially due to the constant function.
Similarly, due to the symmetric property of metric d, above inequality, that is, (5) also holds when
Hence, for all , we getwhere and . This demonstrates that is a -type symmetric Kannan contraction mapping with a multi-index τ of length , where . Therefore, all the conditions of Theorem 4 are satisfied, and thus, . Furthermore, it is evident that every pair of elements in is comparable. Therefore, by Theorem 5, the set contains exactly one element.
By taking the binary relation on as in Theorem 5, we can derive the following result.
Corollary 2. Let be a complete metric space, and be a -type Kannan contraction with constant . Then, has a unique fixed point.
Theorem 6. Consider as a metric space, where is a binary relation defined on , and is a self-mapping on . Assume that the following conditions are met:
- 1.
is -complete;
- 2.
is -closed;
- 3.
either is -continuous or is d-self-closed;
- 4.
is non-empty;
- 5.
is a -type symmetric Chatterjea contraction with constant .
Then, has a fixed point.
Proof. Using the same steps as in Theorem 2, we can define a Picard sequence
such that
and
for all
. Next, assume
, then we have
and
. We now demonstrate that
forms a monotone decreasing sequence of positive real numbers. From inequality (
8), we get
We obtain
If for some
, we have
, then
This leads to a contradiction, and therefore, we have
for all
. Consequently,
is a monotone decreasing sequence of positive real numbers. By setting
Proceeding as in Theorem 2, we consider the following distinct cases.
Case (i): If
and then by setting
. Taking
and
in (
8), we get
Again, taking
and
in (
8), we obtain
Similarly, we obtain the following:
In general, we can conclude that
Therefore,
as
. By following the same approach as in Theorem 2, we can establish that
forms a
-preserving Cauchy sequence.
Case (ii): When
and setting
. Taking
and
in (
8), we have the following:
Again, taking
and
in (
8), we obtain the following:
and also, we get
Similarly, we can get
Therefore, in general, we can conclude that
whenever
or
, it follows that
as
.
By applying the same method as in Theorem 2, it can be proven that, in all scenarios, the sequence forms a -preserving Cauchy sequence within . Given that is -complete, there exists a point such that as .
In conclusion, using assumption (3), we show that is a fixed point of . Assume that is -continuous. Since the sequence is -preserving and converges to , the -continuity of ensures that converges to . Due to the uniqueness of the limit, we deduce that , which means that is a fixed point of .
One the other hand, let us assume that
is
d-self-closed. Since the sequence
is preserved under
and converges to
, there exists a subsequence
from
such that for every
, the pair
lies within
. By invoking assumption (5) and Definition 1(1), we deduce that
and
, which leads to the following conclusion:
Taking the limit as
, we obtain
This leads to
, and consequently,
. Therefore,
. □
To establish the uniqueness of the fixed point for a -type Chatterjea contraction mapping, we additionally assume the following condition:
Theorem 7. If all the conditions of Theorem 6 are satisfied with , and every pair of elements is comparable under the relation , then the set of fixed points of , contains exactly one element.
Proof. Let
. Then
and so using Definition 1(1) and inequality (6), we get
This implies that
. Consequently,
must consist of a single point. □
By considering the binary relation on as in Theorem 7, we can deduce the following result.
Corollary 3. Let be a complete metric space, and be a -type Chatterjea contraction mapping with constant . Then, has a unique fixed point.
Example 7. Let with the usual metric and binary relation . Define as , for all . Then, we obtain .
Note that there exists such that . Moreover, whenever , it follows that as and . This demonstrates that the binary relation is -closed.
Next, for every , we haveandIt can be also seen that for , that is and , we have withBy taking and , we getHence, for all , we conclude that inequality (8) holds with . This demonstrates that is a -type symmetric Chatterjea contraction mapping with a multi-index τ of length . Therefore, all the conditions of Theorem 6 are satisfied, and thus, . Furthermore, it is evident that every pair of elements in is comparable. Therefore, by Theorem 7, the set contains exactly one element.