1. Introduction
Fixed point (
) theory is a powerful mathematical tool with numerous applications in various domains. It has played a crucial role in creating vital concepts and approaches, and is an active field of study and development. It is commonly used in pure and applied mathematics as a bridge between topology and analysis.
theory is a burgeoning scientific field with significant applications in various sectors. It is concerned with research demonstrating that, under certain conditions, a self-map on a non-empty set, M, admits one or more
s.
theorems prove the existence and uniqueness of
s. Because of its application in both pure and applied mathematics, the metric
theorem has a considerable effect on academia. Banach made an unexpected discovery in 1922 that became known as the Banach contraction principle. One of the most adaptive conclusions in
theory and approximation theory is the Banach contraction principle. It changed and generalized in a variety of ways over time. The Banach contraction concept is frequently used in the literature on
theory. Numerous authors have generalized this conclusion by employing other contraction mappings in other metric spaces. The classical principle of contraction mapping states if
is a complete metric space and
such that
for all
, where
, then
ℶ admits a unique
. Banach’s [
1]
hypothesis helps compute mathematics for examining the existence of solutions to nonlinear integral equations, systems of linear equations, and nonlinear differential equations, as well as manifesting algorithms related to convergence. Many variations on Banach’s
theorem have been proposed; see [
2].
In 1971, Ćirić [
3], Reich [
4], and Rus [
5] established a
theorem for mappings
, which has been around for decades, meets the following requirement:
where
, and
. If
, Condition
1 reduces to Banach contraction.
where
, whereas for
Condition
1 reduces to Kannan’s contraction.
where
. Kannan mappings are essential in mathematics and its applications because they provide a flexible framework for establishing the existence and uniqueness of
s in metric spaces. They are an important instrument in the study of nonlinear analysis, numerical techniques, and various scientific and technical domains. Their significance stems from their capacity to determine the convergence of iterative algorithms and solve a wide range of mathematical and practical problems.
In fact, Kannan’s fixed-point theorem is a noteworthy finding in mathematics, especially regarding complete metric spaces. The theorem gives circumstances in which it is possible to derive a unique in such spaces without continuous mapping. This is important because continuity of the mapping is a necessary assumption in many traditional fixed-point theorems.
Kannan’s theorem has several applications.
Eliminating the continuity requirement: Kannan’s theorem is applicable in a wider range of scenarios, encompassing non-continuous maps, in contrast to several previous fixed-point theorems that need continuous mapping. It may, therefore, be used to solve an enormous variety of mathematical and real-world issues.
Metric completeness characterization: Kannan’s theorem is remarkable since it describes a space’s metric completeness in terms of the presence of a . That is to say, a metric space is complete if and only if there is only one for a certain kind of mapping. This offers a profound relationship between the existence of s and the notion of metric completeness.
Valuable and interesting mappings: Since it illuminates the characteristics of full metric spaces and their topological structure, studying mappings that meet Kannan’s theorem requirements is important. There are several practical applications for comprehending these mappings and the corresponding
s in mathematics and its applications, such as functional analysis and engineering mathematics, see, e.g., [
6,
7]. In conclusion, Kannan’s fixed-point theorem is a key finding in mathematics that sheds light on the relationship between metric completeness and the presence of
s, and provides a fresh viewpoint on fixed-point theory in complete metric spaces. It is extensively researched and used in many different mathematical fields, and it has had a long-lasting influence on mathematical study. Therefore, the
results established in [
3,
4], under slightly different forms, are true generalizations of Banach’s contraction principle [
1] and Kannan’s [
8]
theorem.
On the other side, a significant expansion of classical metric spaces, the notion of fuzzy metric spaces (developed by Kramosil and Michalek [
9]) for a more adaptable and comprehensive treatment of distances and continuity. There are uses for fuzzy metric spaces in many domains, such as fixed-point theory and topology. The concepts of fuzzy metric spaces and Hausdorff topology on fuzzy metric spaces were proposed by George and Veeramani [
10]. It was demonstrated that this topology is metrizable when applied to specific fuzzy metric spaces, offering a more reliable framework for researching topological characteristics. It is observed that related fuzzy metric spaces may be generated from any classical metric space. This connection demonstrates how flexible fuzzy metric spaces represent various notions of distance.
theorems in various mathematical spaces are now better understood because of the introduction of graphical structures and graph theory to
theory. These advancements have applications in engineering sciences, functional analysis, and optimization. Fixed-point solutions for set-valued graphical contraction mappings were recently provided by Chen et al. [
11,
12]. This work extends the study of convexity to the context of graphical structures by introducing the idea of a graphical convex metric space. Younis et al. (2022) [
13] discussed the graphical structure of extended
b-metric spaces. Studying the graphic structure of such generalized graphical metric spaces might provide insights into fixed-point theory and allow for greater flexibility in the definition of distances. Applications for fuzzy graph
s are found in many technical disciplines, where imprecision and uncertainty are typical. They make it possible to make the best decisions in situations like network design with erratic connections, environmental management with fluctuating parameters like weather and pollution levels, and transportation route optimization in the face of changing traffic circumstances. They also impact production scheduling in unpredictable events, power grid control in the face of variable renewable energy sources, and robotics motion planning in intricate, dynamic situations. They support the development and management of cities in the face of changing demographic and economic forces in urban planning and smart cities. Engineers may use fuzzy graph
s as a flexible tool to address real-world issues with ambiguous data and make defensible choices in changing environments.
Motivated by the recent results discovered by Jabeen et al. [
14], this article’s primary goal is to highlight and study many engineering applications of the current
theory. To do this, the study offers a set of innovative fuzzy contraction mappings and uses them to construct fixed-point outcomes. Notably, in the setting of fuzzy metric spaces, these discoveries are the first of their kind. This study advances the practical use of advanced fixed-point theory in engineering applications and emphasizes its potential to handle complicated real-world challenges in various scientific domains.
This paper has two parts. Using Kannan-type contractions, we first derive
and common
theorems for single-valued mappings in the domain of fuzzy metric spaces. Conversely, we offer the
£-Kannan-contractions as an extension of fuzzy
£-contraction to show
s. Our results include a generalization of well-known results of Gregori and Sapna [
15] and an extension of Jachymski’s notable results [
16] in fuzzy metric spaces. Our primary objective is to generate several applications of the defined fuzzy contractions to different nonlinear models originating from engineering science and technology.
2. Preliminary Concepts
To facilitate the reader, we will now review key concepts and properties that are relevant to this study. Throughout the paper, we will write fuzzy metric spaces as spaces, and the sets of natural numbers be denoted by . The set of integers i.e., , and . The symbols denotes the set of non-negative real numbers. Throughout the paper, all sets are assumed to be nonempty.
Definition 1 ([
17]).
The binary function is a continuous ⋄-norm if is topological monoid with unit and satisfies the condition whenever , , and Examples of ⋄-norm.- (i)
Minimum ⋄-norm
- (ii)
Product ⋄-norm
- (iii)
Lukasiewicz ⋄-norm .
Definition 2 ([
10]).
The 3-tuple is termed space if ∁ is an arbitrary set, * is a continuous ⋄-norm, and is fuzzy set on satisfies the following conditions: for all , and
⇔
is continuous,
for all and
Definition 3 ([
10]).
Let is a space. The sequence is called convergent in ∁⇔, whenever . Lemma 1 ([
18]).
A sequence in a space is called a Cauchy-sequence if for all . For further synthesis and basic concepts like the convergence of the Cauchy sequence and completeness, and equivalent definitions of Cauchy sequences in fuzzy setup, we refer the readers to [
10,
18].
Definition 4 ([
10]).
Let be a metric space. The triplet is called standard fuzzy metric generated by metric d, where It is worth noting that the topologies generated by the standard fuzzy metric and its corresponding measure are similar to one another.
Lemma 2 ([
10]).
Let is a space. Then, is continuous function on Lemma 3 ([
19]).
Let is a space. Then, is nondecreasing for all . Definition 5 ([
15]).
A self-mapping within the context of a space is called ℶ-uniformly continuous if ∀ , ∃ , such thatfor all . Definition 6 ([
15]).
A self-mapping defined on is called fuzzy contractive mapping, if there exists such thatfor every . Proposition 1 ([
15]).
Let is a space. If is fuzzy contractive mapping then ℶ is uniformly continuous. Let £ be a directed graph with vertices and . In this context, a path in £ is a sequence of vertices , where there are vertices, and it satisfies the conditions: the first vertex is , the last vertex is , and for every j from 1 to , there is a directed edge from to in the graph.
A graph
£ is considered linked or connected when a path exists connecting any pair of its vertices. This definition of connectivity applies to directed graphs. When the graph
£ is undirected, we refer to it as weakly connected, meaning there is a path connecting every pair of vertices, and the direction of the edges is not considered in determining connectivity. Shukla et al. [
20] are to be credited with the following annotations [
20]:
- a.
= In the graph £, there is a directed path with length l that connects and .
- b.
If there is a path leading from to in £, and , then is on the path.
Unless otherwise stated, we consider all the graphs to be direct.
To review different fundamental ideas related to graph-
s, we recommend the reader consult [
7,
13].
In a graph £, a path of length from vertex directing to another vertex is represented by the sequence of vertices such that , and , .
Definition 7 ([
21]).
A mapping is called a £-fuzzy contraction in the context of space if the following assertions are contented:(GF1) ℶ is edge-preserving, i.e., ;
(GF2)
Example 1 ([
20]).
Any constant function , that is , where fixed is a £-fuzzy contraction with arbitrary value of . Definition 8 ([
20]).
Let is a space, and be a self mapping. We denote the iterate of ℶ on by , and for all with The mapping ℶ is called Picard operator, if ℶ has a unique u, and for all The mapping ℶ is called a weak Picard operator, if for all ∃ a (which may depend on ϖ) of ℶ such that for all . It is worth noting that each Picard operator is also a weak Picard operator. The of a weak Picard operator cannot be truly unique.
Definition 9 ([
20]).
A subset A is called ℶ-invariant if The next lemma will help with what comes next.
Lemma 4 ([
21]).
Let is a £-fuzzy contraction, then given , and , we have for all . The component of £ that contains is made up of edges, vertices, and a path that starts at . In this instance, the relation R is defined on by the following rule:
if there is a path in £ from to . In this scenario, , where, the equivalence class of this relation is . Thus, the relationship between is self-evident.
We will now talk about different sorts of mapping continuity. The first is well-known in metric theory and is frequently employed.
Definition 10. A mapping is called orbitally continuous if for all , the sequence of positive integers, implies as
Definition 11. A mapping is called orbitally £-continuous if given , and the sequence , Recent findings provide the necessary conditions for mapping to a Picard Operator (PO) when the space
has a graph structure. This discovery, first revealed by Jachymski [
16], expands on its relationship with the Kelisky–Rivlin theorem about iterates of the Bernstein operators in the space
.
Definition 12 ([
16]).
A self map is called a Banach £-contraction (£-contraction), if f preserves edges, i.e.,and edge weights decrease as follows in £: The notion of £-Kannan operators is proposed in this study to evaluate the s for Kannan operators in spaces given a graph £. We assume that is a metric space and that £ is a directed graph with the criteria that and that £ has no parallel edges. An instance of is a collection of all s for a mapping ℶ.
The ensuing notion forms the basis for the recommended results throughout the course of the work.
Definition 13 ([
22]).
A mapping in the framework of metric space is called £-Kannan operator if the following assumptions hold true:- (1)
;
- (2)
For each , we have: where .
Lemma 5. Let £ is a graph endowing metric space , and is a £-Kannan operator. If the assertion is satisfied by , then we havefor all Proof. Let
with
. An easy induction shows
for all
,
which implies
where,
.
A repetition of the above will result in the following
□
3. Common for Fuzzy-Kannan Contractions
In the context of spaces, we generate fixed-point and common fixed solutions for single-valued fuzzy-Kannan-type contractions.
Definition 14. Let is complete space. A self-mapping is called a fuzzy-Kannan-contraction of type-I, ifwith , for all . The primary outcome about common for two single-valued mappings within the context of spaces is as follows.
Theorem 1. Suppose is a complete space. Let ∁ be self-mappings such that;for for all . Then, , and ℶ have at most one common in ∁. Proof. Suppose
is an arbitrary point, and define the sequence
by
Using (10), and (5), we can write
This implies
where
since
.
Continuing in this manner, we obtain
Repeating the above procedure, we infer
Taking (
6) into account, we deduce
Since
, we must have
This amounts to saying that
which yields that
is a Cauchy sequence in
Since
is complete, there exists
such that
For proving
v is a
of
S, Assume
Then
Noting that
,
, i.e.,
In the same way, we suppose
, we have
This can be put as follows
Noticing that , i.e.,
Let
is any
of
ℶ and
in ∁, i.e.,
. Then
This proves that , and . That is ℶ yields a unique . □
The following provides the convergence result for fuzzy-Kannan-contraction of type-I for a single-valued mapping ℶ.
Corollary 1. Suppose be a complete space. Let is a self-mapping such that;for all and . Then, there is only one in ∁ for the map ℶ. The fuzzy-Kannan-contraction of type-II within the fuzzy-metric setup for two mappings forms the basis of the common result that follows.
Corollary 2. Suppose is complete space. Let be self-mappings. Suppose that for such thatfor all . Then, and ℶ have at most one common in ∁. Proof. Assuming that
is an arbitrary point, define the sequence
as follows:
Using (10), and (5), we can write
This implies
where
Similarly,
The procedure is the same as in Theorem 1 to derive the common of the maps and ℶ. □
The convergence result of a single mapping ℶ for fuzzy-Kannan-contraction of type-II is as follows.
Theorem 2. Suppose is a complete space. Let be self-mapping. Suppose that for such thatfor all . Then, mapping ℶ has at most one common in ∁. 4. Convergence Results for Fuzzy-Graph-Kannan Contractions
Definition 15. Let is a space endowed with graph £, and the operator is called fuzzy-graph-£-Kannan operator, if:
- (1)
;
- (2)
The values are positive (), and for every pair , we have:
Remark 1. Any Kannan contraction is a Kannan -contraction, with is defined by .
Theorem 3. Let is a complete metric space endowed with a directed graph £, and is a £-Kannan contraction. Under the assumption that:
- (1)
For any sequence in ∁, if and for all , then there is a subsequence of , such that for all .
- (2)
If £ is ℶ-connected,
then ℶ is a .
Specifically, we consider as a -space with a graph indicated by £. In this case, £ represents a directed graph, with its vertex set being ∁ and . We ensure that there are no parallel edges in £. Each edge corresponds to a different element from . The following findings are essential in demonstrating the upcoming theorems.
Definition 16. Let is a space endowed with a graph £, and is a mapping. We say that the graph £ is ℶ-connected if for all vertices of £ with , there exists a path in from ϖ to ς such that and for all . A graph £ is weak ℶ-connected, if is ℶ-connected.
Lemma 6. Let is a space endowed with a graph £, and is a fuzzy-graph-£-Kannan operator such that the graph £ is ℶ-connected. For all the sequence is a Cauchy sequence.
Proof. For a fixed value , two cases arise:
If
then by Lemma 5, we have
for all
, where,
. Because
we obtain
demonstrating that the Cauchy sequences have the form
.
If
. There is a path from
to
in
, where
with
all
, and
for all
. As a result of employing the inequality of the fuzzy metric, we obtain
We can put the above inequality as
By elementary calculations, we have
for all
. Since
, we find that
thereby showing that
is a Cauchy sequence.
The primary outcome of this section is expressed in the subsequent theorem. □
Theorem 4. Let be a complete space endowed with a graph £, and be a fuzzy-graph-£-Kannan operator. We assume that:
- (i)
£ is ℶ-connected;
- (ii)
For any in ∁, if , and for then a subsequence with for . Then, ℶ is a PO.
Proof. By Lemma 6, is a Cauchy sequence for all , and from hypothesis, we have is convergent. Let then , and , as .
- (a)
If
, we have
for all
, then
for all
. Letting
we obtain
because
we attain
.
- (b)
If
, there is path in
from
to
such that
with
for all
, and
for all
. Then,
for all
, and
, and by the triangle inequality we obtain
By Lemma 6 and by the given hypothesis, the series
is convergent, as does the continuity, which states that the sequence
is convergent. Let
for all
. Let
obtain
for all
that is
, hence
. Therefore, for all
there exists a unique
such that
Now, we will prove that
. Because the graph
£ is
ℶ-connected, there is at least
such that
so
for all
. But
, then there is a subsequence
with
for all
, we have the following
Now, letting , we obtain that is, . Furthermore, if we have, for some , then from above, we must have , so that , and therefore, ℶ is a PO. □
Example 2. Let us consider a set ∁, which is defined as the union of two subsets of the real numbers, : Q and . is a fuzzy metric that is defined as follows: . It can be expressed as follows: , where d denotes the standard metric on ∁. Now, we define a transformation by the following Let , for all , and if , then and Also,when . Then, and . In this case, we have If and or , and , then and or and . For , we acquire Figure 1 authenticates validating the fuzzy-graph-Kannan contraction introduced in Definition 15. Note that . As a result, Theorem 4 meets all of the specified requirements.
Theorem 5. Let is a complete space, and is a mapping satisfying the followingwhereandfor all , and . Then, ℶ has a unique . Proof. By taking , and applying Theorem 4, we obtain the result. □
5. Fractional-Differential Equations and Fixed-Point Solution
Fractional differential equations are practical tools for modeling and analyzing physical systems with continuous distributions or interactions. In engineering research, they are frequently used to derive correlations between numbers or to describe phenomena in greater detail than differential equations alone can. They offer a framework for comprehending complicated behaviors and interactions in various engineering systems. Differential equations of the implicit kind, particularly s, have a wide range of applications in engineering research. In this section, we prove the existence of a unique solution of the . These kinds of differential equations are frequently employed in engineering. Digital circuit evaluation, mechanical design strain and fluid circulation simulation, structural evaluation, control mechanisms, data processing operations, material scientific research, heat exchange, and magnetic field assessment for radars all depend on them. They also help with inverse problems associated with ophthalmology and acoustically for wave propagation and diffraction studies, as well as in geophysics, non-destructive testing, and medical imaging. These formulas offer an adaptable framework for comprehending and evaluating continuous distributions and interactions across a range of engineering specialties.
s are essential in modeling real-world scientific, engineering, and decision-making events. They provide a nuanced viewpoint by including linearity, nonlinearity, determinism, and stochasticity in mathematical models. Khan et al. [
23] investigated the presence, stability, and computational characteristics of
s in aquatic illness models. They used fractal-fractional derivatives and a modified Atangana–Baleanu derivative to prove the solution’s existence, demonstrating convergence approaches. Notably, their work demonstrated the power of fractal fractional operators, providing new insights into system dynamics. More synthesis on how
s have also been the center of research for the fixed point theorists; we recommend [
24].
Let us start by going over the basic terminology of fractional calculus.
The Riemann–Liouville-fractional derivative of order for a function is written as follows:
If the right side is point-wise defined on the interval , then this is true. In this case, the Euler-gamma function is denoted by , while the integer portion of p is represented as .
Let us now consider the following
where
f is a continuous function on
, and
is the Caputo-fractional-derivative having order
, defined by
Denote by
, the space
of all continuous functions taken on the interval [0,1]. Define a metric
d on
by
Then, is a complete metric-space. The binary operation * is defined by product ⋄-norm
A standard fuzzy metric
is given as
Then, one can easily verify that is triangular and is a complete fuzzy metric space.
Theorem 6. Consider the nonlinear (9). If the underlying conditions are met: - (i)
For and , the following is true - (ii)
there exists with
Then, the (9) has necessarily at most one solution in . Proof. The equivalent
for
(
9) is the following
for all
and
, where
If for the map
defined by
is a
, then
is a solution of the problem (
9).
Taking into account the given conditions, for
, we infer
Put
, we can write
The above expression can be written as
for all
. This leads to the conclusion that
ℶ satisfies the Fuzzy-contraction of Theorem 2. As a result,
ℶ concedes a unique fixed-point in
, implying that the
(
9) has a unique solution. □
6. An Application to the Equation of Motion
The equations of motion provide the mathematical foundation for comprehending the complex dynamics of particles and systems impacted by forces. These equations are crucial in kinematics, correctly portraying position, velocity, acceleration, and displacement connections. Furthermore, they lead to the development of differential equations, allowing for modeling and predicting system behaviors across time. This mathematical basis lies at the heart of numerical analytic techniques, enabling the creation of algorithms that imitate real-world dynamics.
These equations are common and vital in engineering across many fields. They are essential in mechanical engineering for assessing and optimizing the performance of machinery, engines, and vehicles. Civil engineers use these equations to examine the structural integrity and behavior of buildings, bridges, and infrastructure under various loads and environmental circumstances. They are critical in aeronautical engineering for forecasting trajectories, assuring stability, and building airplanes and spacecraft.
The applications also include control systems, where equations of motion are used to help develop strategies that govern how robots, automation, and manufacturing equipment behave. Electrical engineering also uses these equations to explain how electrical systems and parts, including motors and generators, behave. These formulas are fundamental to comprehending, assessing, and forecasting the behavior of physical systems and are used in a wide range of scientific and technical contexts.
Problem statement: A particle of mass m is at rest at
,
. A force
starts activity on it in a particular direction such that its velocity immediately jumps from 0 to 1 after
. Find the position of the particle at time ⋏. The corresponding motion of the particle is governed by the following second-order differential equation.
for all
and
, is a continuous function. We are interested in finding the solution of Equation (
11), which tells us the nature of the particle’s motion, i.e., how the particle moves.
The Green function of the problem defined in (
11) is equivalent to
We now prove the existence of a solution to the second-order differential Equation (
11).
Theorem 7. Suppose for the mappings the following holds: Then, the second order differential Equation (11) governing the equation of motion of a particle has a solution in . Proof. We note that the solution of (
11) is equivalent to finding the solution of the following integral equation
Integral Equation (
12) is equivalent to the second order IVP (
11), which is constructed with the help of Green’s function
.
If
is a
of the map
defined by
then
is a solution of the problem (
11).
Taking the same metric defined in
Section 5 with
, the space
of all continuous functions taken on the interval [0,1], and following the same procedure as processed in Theorem 6, we can easily see that
concedes a fixed point, endorsing that the second order differential Equation (
11) governing the equation of motion has a solution. □
7. Conclusions and Future Scope
In the situation of spaces, we developed novel and suitable extensions of Kannan-contraction and discovered their applicability to the solution of integral equations. This is the first attempt to solve £-graph-Kannan contraction in spaces that we are aware of. A few non-trivial examples and an application confirm the solution’s uniqueness. Finally, we used the manuscript’s significant contents to offer a novel application in which we derived the existence of solutions of two nonlinear problems, namely s and the differential equations corresponding to particle motion in very generic conditions.
On the one hand, additional research is needed into how to reformulate the contractivity condition so that theory can be developed in more general abstract metric spaces. Kannan mappings are essential in FP theory because of the “Metric Completeness Characterization” described in the introduction. An intriguing question arises: can the results established in this paper be used to acquire Fuzzy-metric completeness, and can the results be proven within the fuzzy-graphical metic setup?