An expert system is a computer program that uses the knowledge of an expert to solve problems in a specific domain. Expert systems are used in a wide variety of fields, such as medicine, financial diagnosis and engineering. The attributes of an expert system are the characteristics of the problems that the system can solve. In traditional expert systems, attributes typically have a finite number of possible values. However, in scenarios where an attribute can assume a value from an infinite (or significantly large finite) set, the expert system cannot be represented using propositional logic. Until now, no method had been identified to implement such a system on a Computer Algebra System. Here, we break new ground by presenting a model that not only addresses this gap but also provides a fresh perspective on previous results. In fact, these prior results can be viewed as specific instances within the broader framework of our proposed solution. In this paper, we put forth an algebraic approach for the development of expert systems capable of handling attributes with infinite values, thereby expanding the problem-solving capacity of these systems.
Citation: Antonio Hernando, José Luis Galán-García, Gabriel Aguilera-Venegas. A novel way to build expert systems with infinite-valued attributes[J]. AIMS Mathematics, 2024, 9(2): 2938-2963. doi: 10.3934/math.2024145
[1] | Aziz Belmiloudi . Time-varying delays in electrophysiological wave propagation along cardiac tissue and minimax control problems associated with uncertain bidomain type models. AIMS Mathematics, 2019, 4(3): 928-983. doi: 10.3934/math.2019.3.928 |
[2] | Zuliang Lu, Xiankui Wu, Fei Huang, Fei Cai, Chunjuan Hou, Yin Yang . Convergence and quasi-optimality based on an adaptive finite element method for the bilinear optimal control problem. AIMS Mathematics, 2021, 6(9): 9510-9535. doi: 10.3934/math.2021553 |
[3] | Zahra Pirouzeh, Mohammad Hadi Noori Skandari, Kamele Nassiri Pirbazari, Stanford Shateyi . A pseudo-spectral approach for optimal control problems of variable-order fractional integro-differential equations. AIMS Mathematics, 2024, 9(9): 23692-23710. doi: 10.3934/math.20241151 |
[4] | Xin Yi, Rong Liu . An age-dependent hybrid system for optimal contraception control of vermin. AIMS Mathematics, 2025, 10(2): 2619-2633. doi: 10.3934/math.2025122 |
[5] | Yuanyuan Cheng, Yuan Li . A novel event-triggered constrained control for nonlinear discrete-time systems. AIMS Mathematics, 2023, 8(9): 20530-20545. doi: 10.3934/math.20231046 |
[6] | Woocheol Choi, Young-Pil Choi . A sharp error analysis for the DG method of optimal control problems. AIMS Mathematics, 2022, 7(5): 9117-9155. doi: 10.3934/math.2022506 |
[7] | Xiang Wu, Yuzhou Hou, Kanjian Zhang . Optimal feedback control for a class of fed-batch fermentation processes using switched dynamical system approach. AIMS Mathematics, 2022, 7(5): 9206-9231. doi: 10.3934/math.2022510 |
[8] | Tainian Zhang, Zhixue Luo . Optimal harvesting for a periodic competing system with size structure in a polluted environment. AIMS Mathematics, 2022, 7(8): 14696-14717. doi: 10.3934/math.2022808 |
[9] | Qian Li, Zhenghong Jin, Linyan Qiao, Aichun Du, Gang Liu . Distributed optimization of nonlinear singularly perturbed multi-agent systems via a small-gain approach and sliding mode control. AIMS Mathematics, 2024, 9(8): 20865-20886. doi: 10.3934/math.20241015 |
[10] | Asaf Khan, Gul Zaman, Roman Ullah, Nawazish Naveed . Optimal control strategies for a heroin epidemic model with age-dependent susceptibility and recovery-age. AIMS Mathematics, 2021, 6(2): 1377-1394. doi: 10.3934/math.2021086 |
An expert system is a computer program that uses the knowledge of an expert to solve problems in a specific domain. Expert systems are used in a wide variety of fields, such as medicine, financial diagnosis and engineering. The attributes of an expert system are the characteristics of the problems that the system can solve. In traditional expert systems, attributes typically have a finite number of possible values. However, in scenarios where an attribute can assume a value from an infinite (or significantly large finite) set, the expert system cannot be represented using propositional logic. Until now, no method had been identified to implement such a system on a Computer Algebra System. Here, we break new ground by presenting a model that not only addresses this gap but also provides a fresh perspective on previous results. In fact, these prior results can be viewed as specific instances within the broader framework of our proposed solution. In this paper, we put forth an algebraic approach for the development of expert systems capable of handling attributes with infinite values, thereby expanding the problem-solving capacity of these systems.
A century ago, the first metric fixed-point theorem was published by Banach [1]. In fact, before Banach, some famous mathematicians such as Picard and Liouville had used the fixed point approach to solve certain differential equations, more precisely, initial value problems. Inspired by their results, Banach considered it as a separated and independent result in the framework of the nonlinear functional analysis and point-set topology. The statement and the proof of an outstanding work of Banach, also known as contraction mapping principle, can be considered as an art piece: Each contraction, in the setting of a complete metric space, possesses a unique fixed point. Metric fixed point theory has been appreciated and investigated by several researchers. These researchers have different reasons and motivations to study this theory. The most important reason why the researchers find worthful to work and investigate metric fixed point theory is the natural and strong connection of the theoretical result in nonlinear functional analysis with applied sciences. If we look at it with the chronological aspect, we note that the fixed point theory was born as a tool to solve certain differential equations. Banach liberated the theory from being a tool in applied mathematics to an independent work of nonlinear functional analysis. On Picard and Liouville's side, it is a tool to solve the initial value problem. On the other side, from Banach's point of view, the fixed point theory is an independent research topic that has enormous application potential on almost all qualitative sciences, including applied mathematics. Secondly, Banach fixed point theorem not only guarantee the solution (the existence of a fixed point) but also indicate how we reach the mentioned solution (how to find the fixed point). Finally, we need to underline that almost all real world problems can be transferred to a fixed point problem, easily.
With this motivation, several generalizations and extensions of Banach's fixed point theory have been released by introducing new contractions or by changing the structure of the studied abstract space. Among, we shall mention only a few of them that set up the skeleton of the contraction dealt with it. Historically, the first contraction we shall focus on it is the Meir-Keeler contraction [2]. Roughly speaking, the Meir-Keeler contraction can be considered as a uniform contraction. The second contraction that we dealt with is Jaggi contraction [3]. The interesting part of Jaggi's contraction is the following: Jaggi's contraction is one of the first of its kind that involves some rational expression. The last one is called as an interpolative contraction [4]. In the interpolative contraction the terms are used exponentially instead of standard usage of them.
In this paper, we shall introduce a new contraction, hybrid Jaggi-Meir-Keeler type contraction, as a unification and generalization of the Meir-Keeler's contraction, the Jaggi's contraction and interpolative contraction in the setting of a complete metric space. We propose certain assumptions to guarantee the existence of a fixed point for such mappings. In addition, we express some example to indicate the validity of the derived results.
Before going into details, we would like to reach a consensus by explaining the concepts and notations: Throughout the paper, we presume the sets, we deal with, are non-empty. The letter N presents the set of positive integers. Further, we assume that the pair (X,d) is a complete metric space. This notation is required in each of the following theorems, definitions, lemma and so on. We shall use the pair (X,d) everywhere without repeating that it is a complete metric space.
In what follows we recall the notion of the uniform contraction which is also known as Meir-Keeler contraction:
Definition 1.1. [2] A mapping f:(X,d)→(X,d) is said to be a Meir-Keeler contraction on X, if for every E>0, there exists δ>0 such that
E≤d(x,y)<E+δimpliesd(fx,fy)<E, | (1.1) |
for every x,y∈X.
Theorem 1.1. [2] Any Meir-Keeler contraction f:(X,d)→(X,d) possesses a unique fixed point.
Very recently, Bisht and Rakočević [5] suggested the following extension of the uniform contraction:
Theorem 1.2. [5] Suppose a mapping f:(X,d)→(X,d) fulfills the following statements:
(1) for a given E>0 there exists a δ(E)>0 such that
E<M(x,y)<E+δ(E)impliesd(fx,fy)≤E; |
(2) d(fx,fy)<M(x,y), whenever M(x,y)>0;
for any x,y∈X, where
M(x,y)=max{d(x,y),αd(x,fx)+(1−α)d(y,fy),(1−α)d(x,fx)+αd(y,fy),β[d(x,fy)+d(y,fx)]2}, |
with 0<α<1,0≤β<1.Then, f has a unique fixed point u∈X and fnx→u for each x∈X.
On the other hand, in 2018, the idea of interpolative contraction was consider to revisit the well-known Kannan's fixed point theorem [6]:
Definition 1.2. [4] A mapping f:(X,d)→(X,d) is said to be an interpolative Kannan type contraction on X if there exist κ∈[0,1) and γ∈(0,1) such that
d(fx,fy)≤κ[d(x,fx)]γ[d(y,fy)]1−γ, | (1.2) |
for every x,y∈X∖Fix(f), where Fix(f)={x∈X|fx=x}.
Theorem 1.3. [4] Any interpolative Kannan-contraction mapping f:(X,d)→(X,d) possesses a fixed point.
For more interpolative contractions results, we refer to [7,8,9,10,11] and related references therein.
Definition 1.3. A mapping f:(X,d)→(X,d) is called a Jaggi type hybrid contraction if there is ψ∈Ψ so that
d(fx,fy)≤ψ(Jsf(x,y)), | (1.3) |
for all distinct x,y∈X where p≥0 and σi≥0,i=1,2,3,4, such that σ1+σ2=1 and
Jsf(x,y)={[σ1(d(x,fx)⋅d(y,fy)d(x,y))s+σ2(d(x,y))s]1/p,ifp>0,x,y∈X,x≠y(d(x,fx))σ1(d(y,fy))σ2,ifp=0,x,y∈X∖Ff(X), | (1.4) |
where Ff(X)={z∈X:fz=z}.
Theorem 1.4. A continuous mapping f:(X,d)→(X,d) possesses a fixed point x if it forms a Jaggi-type hybrid contraction.In particular, for any x0∈X, the sequence {fnx0} converges to x.
Definition 1.4. [12] Let α:X×X→[0,+∞) be a mapping, where X≠∅. A self-mapping f:(X,d)→(X,d) is called triangular α-orbital admissible and denote as f∈TαX if
α(x,fx)≥1impliesα(fx,f2x)≥1, |
and
α(x,y)≥1,andα(y,fy)≥1,impliesα(x,fy)≥1 |
for all x,y∈X.
This concept, was used by many authors, in order to prove variant fixed point results (see, for instance [13,14,15,16,17,18,19] and the corresponding references therein).
Lemma 1.1. [12] Assume that f∈TαX. If there exists x0∈X such that α(x0,fx0)≥1, then α(xm,xk)≥1, for all m,n∈N, where the sequence {xk} is defined by xk+1=xk.
The following condition is frequently considered to avoid the continuity of the mappings involved.
(R) if the sequence {xn} in X is such that for each n∈N,
α(xn,xn+1)≥1andlimn→+∞xn=x∈x, |
then there exists a subsequence {xn(j)} of {xn} such that
α(xn(j),x)≥1, for each j∈N. |
We start this section by introducing the new contraction, namely, hybrid Jaggi-Meir-Keeler type contraction.
Consider the mapping f:(X,d)→(X,d) and the set of fixed point, Ff(X)={z∈X:fz=z}. We define the crucial expression Rsf as follows:
Rsf(x,y)={[β1(d(x,fx)⋅d(y,fy)d(x,y))s+β2(d(x,y))s+β3(d(x,fy)+d(y,fx)4)s]1/s,fors>0,x,y∈X,x≠y(d(x,fx))β1(d(y,fy))β2(d(x,fy)+d(y,fx)4)β3,fors=0,x,y∈X, | (2.1) |
where p≥1 and βi≥0, i=1,2,3 are such that β1+β2+β3=1.
Definition 2.1. Assume that f∈TαX. We say that f:(X,d)→(X,d) is an α-hybrid Jaggi-Meir-Keeler type contraction on X, if for all distinct x,y∈X we have:
(a1) for given E>0, there exists δ>0 such that
E<max{d(x,y),Rsf(x,y)}<E+δ⟹α(x,y)d(fx,fy)≤E; | (2.2) |
(a2)
α(x,y)d(fx,fy)<max{d(x,y),Rsf(x,y)}. | (2.3) |
Theorem 2.1. Any continuous α-hybrid Jaggi-Meir-Keeler type contraction f:(X,d)→(X,d) provide a fixed point if there exists x0∈X, such that α(x0,fx0)≥1 and α(x0,f2x0)≥1.
Proof. Let x0∈X be an arbitrary, but fixed point. We form the sequence {xm}, as follows:
xm=fxm−1=fmx0, |
for all m∈N and assume that d(xm,xm+1)>0, for all n∈N∪{0}. Indeed, if for some l0∈N∪{0} we have d(xl0,xl0+1)=0, it follows that xl0=xl0+1=fxl0. Therefore, xl0 is a fixed point of the mapping f and the proof is closed.
Since, by assumption, the mapping f is triangular α-orbital admissible, it follows that
α(x0,fx0)≥1⇒α(x1,x2)=α(fx0,f2x0)≥1⇒...⇒ |
α(xn,xn+1)≥1, | (2.4) |
for every n∈N.
We shall study two cases; these are s>0 and s=0.
Case (A). For the case s>0, letting x=xn−1 and y=xn=fxn−1 in (a2), we get
d(xn,xn+1)≤α(xn−1,xn)d(fxn−1,fxn)<max{d(xn−1,xn),Rsf(xn−1,xn)}, | (2.5) |
where
Rsf(xn−1,xn)=[β1(d(xn−1,fxn−1)⋅d(xn,fxn)d(xn−1,xn))s+β2(d(xn−1,xn))s++β3(d(xn−1,fxn)+d(xn,fxn−1)4)s]1/s=[β1(d(xn−1,xn)⋅d(xn,xn+1)d(xn−1,xn))s+β2(d(xn−1,xn))s++β3(d(xn−1,xn+1)+d(xn,xn)4)s]1/s≤[β1(d(xn,xn+1))s+β2(d(xn−1,xn))s++β3(d(xn−1,xn)+d(xn,xn+1)4)s]1/s. |
If we can find n0∈N such that d(xn0,xn0+1)≥d(xn0−1,xn0), we have
Rsf(xn0−1,xn0)≤[β1(d(xn0,xn0+1))s+β2(d(xn0,xn0+1))s++β3(d(xn0,xn0+1))s]1/s=d(xn0,xn0+1)(β1+β2+β3)1/s=d(xn0,xn0+1). |
Then, max{d(xn0,xn0+1),Rsf(xn0−1,xn0)}=d(xn0,xn0+1), and using (2.4), respectively (2.5) we get
d(xn0,xn0+1)≤α(xn0−1,xn0)d(fxn+0−1,fxn0)<max{d(xn0,xn0+1),Rsf(xn0−1,xn0)}≤d(xn0,xn0+1), |
which is a contradiction. Therefore, d(xn,xn+1)<d(xn−1,xn) for all n∈N and (2.5) becomes
d(xn,xn+1)<d(xn−1,xn), |
for all n∈N. Consequently, there exists b≥0 such that limn→+∞d(xn−1,xn)=b. If b>0, we have
d(xm,xm+1)≥b>0, |
for any m∈N. On the one hand, since (2.2) holds for every given E>0, it is possible to choose E=b and let δ>0 be such that (2.2) is satisfied. On the other hand, since, also, limn→+∞max{d(xn−1,xn),Rsf(xn−1,xn)}=b, there exists m0∈N such that
b<max{d(xm0−1,xm0),Rsf(xm0−1,xm0)}<b+δ. |
Thus, by (2.2), together with (2.4) we obtain
d(xm0,xm0+1)≤α(xm0,xm0+1)d(fxm0−1,fxm0)<b, |
which is a contradiction. Therefore,
limn→+∞d(xn,xn+1)=b=0. | (2.6) |
We claim now that {xn} is a Cauchy sequence. Let E>0 be fixed and we can choose that δ′=min{δ(E),E,1}. Thus, from (2.6) it follows that there exists j0∈N such that
d(xn,xn+1)<δ′2, | (2.7) |
for all n≥j0. Now, we consider the set
A={xl|l≥j0,d(xl,xj0)<E+δ′2}. | (2.8) |
We claim that fy∈A whenever y=xl∈A. Indeed, in case of l=j0, we have fxl=fxj0=xj0+1, and taking (2.7) into account, we get
d(xj0,xj0+1)<δ′2<E+δ′2. | (2.9) |
Thus, we will assume that l>j0, and we distinguish two cases, namely:
Case 1. Suppose that
E<d(xl,xj0)<E+δ′2. | (2.10) |
We have
Rsf(xl,xj0)=[β1(d(xl,fxl)d(xj0,fxj0)d(xl,xj0))s+β2(d(xl,xj0))s+β3(d(xl,fxj0)+d(xj0,fxl)4)s]1/s=[β1(d(xl,xl+1)d(xj0,xj0+1)d(xl,xj0))s+β2(d(xl,xj0))s++β3(d(xl,xj0+1)+d(xj0,xl+1)4)s]1/s≤[β1(d(xl,xl+1)d(xj0,xj0+1)d(xl,xj0))s+β2(d(xl,xj0))s++β3(d(xl,xj0)+d(xj0,xj0+1)+d(xl,xj0)+d(xl,xl+1)4)s]1/s<[β1(d(xl,xl+1))s+β2(d(xl,xj0))s+β3(2d(xl,xj0)+d(xj0,xj0+1)+d(xl,xl+1)4)s]1/s<[β1(δ′2)s+β2(E+δ′2)s+β3(E2+δ′4+δ′4)s]1/s≤(β1+β2+β3)1/s(E+δ′2)≤E+δ′. |
In this case,
E<d(xl,xj0)≤max{d(xl,xj0),Rsf(xl,xj0)}<max{(E+δ′2),(E+δ′)}=(E+δ′), |
which implies by (a1) that
α(xl,xj0)d(fxl,fxj0)≤E. | (2.11) |
But, taking into account that the mapping f is triangular α-orbital admissible, together with (2.4) we have
α(xn,xn+1)≥1 and α(xn+1,fxn+1)≥1 implies α(xn,xn+2)≥1, |
and recursively we get that
α(xn,xl)≥1, | (2.12) |
for all n,l∈N. Therefore, from (2.11) and (2.12), we have
d(xl+1,xj0+1)=d(fxl,fxj0)≤E. | (2.13) |
Now, by the triangle inequality together with (2.7)and (2.13) we get
d(xl+1,xj0)≤d(xl+1,xj0+1)+d(xj0+1,xj0)<(E+δ′2), |
which means that, indeed fxl=xl+1∈A.
Case 2. Suppose that
d(xl,xj0)≤E. | (2.14) |
Thus,
d(fxl,xj0)≤d(fxl,fxj0)+d(fxj0,xj0)≤α(xl,xj0)d(fxl,fxj0)+d(xj0+1,xj0)<max{d(xl,xj0),Rsf(xl,xj0)}+d(xj0+1,xj0), | (2.15) |
where
Rsf(xl,xj0)=[β1(d(xl,xl+1)d(xj0,xj0+1)d(xl,xj0))s+β2(d(xl,xj0))s++β3(d(xl,xj0)+d(xj0,xj0+1)+d(xl,xj0)+d(xl,xl+1)4)s]1/s. |
We must consider two subcases
(2a). d(xl,xj0)≥d(xj0,xj0+1). Then,
Rsf(xl,xj0)≤[β1(d(xl,xl+1))s+β2(d(xl,xj0))s++β3(2d(xl,xj0)+d(xj0,xj0+1)+d(xl,xl+1)4)s]1/s<[β1(δ′2)s+β2(E))s+β3(2E+2δ′24))s]1/s<[β1+β2+β3]1/s(E2+δ′4). |
But, since δ′=min{δ,E,1}, we get
Rsf(xl,xj0)<3E4, |
and then
d(fxl,xj0)<max{d(xl,xj0),Rsf(xl,xj0)}+d(xj0+1,xj0)<max{E,3E4}+δ′2=(E+δ′2), |
which shows that fxl∈A.
(2b). d(xl,xj0)<d(xj0,xj0+1). Then,
d(fxl,xj0)≤xl+1,xl)+d(xl,xj0)<δ′2+δ′2<E+δ′2. |
Consequently, choosing some m,n∈N such that m>n>j0, we can write
d(xm,xn)≤d(xm,xj0)+d(xj0,xn)<2(E+δ′2)<4E, |
which leads us to
limm,n→+∞d(xm,xn)=0. |
Therefore, {xm} is a Cauchy sequence in a complete metric space. Thus, we can find a point u∈X such that limm→+∞xm=u. Moreover, since the mapping f is continuous we have
u=limm→+∞fm+1x0=limm→+∞f(fmx0)=f(limm→+∞fmx0)=fu, |
that is, u is a fixed point of f.
Case (B). For the case s=0, letting x=xn−1 and y=xn=fxn−1 in (2.2), we get
d(xn,xn+1)≤α(xn−1,xn)d(fxn−1,fxn)<max{d(xn−1,xn),Rf(xn−1,xn)}, | (2.16) |
where
Rf(xn−1,xn)=[d(xn−1,fxn−1)]β1[d(xn,fxn)]β2[d(xn−1,fxn)+d(xn,fxn−14]β3=[d(xn−1,xn)]β1[d(xn,xn+1)]β2[d(xn−1,xn+1)+d(xn,xn4]β3=[d(xn−1,xn)]β1[d(xn,xn+1)]β2[d(xn−1,xn+1)+d(xn,xn4]β3≤[d(xn−1,xn)]β1[d(xn,xn+1)]β2[d(xn−1,xn)+d(xn,xn+1)4]β3=[d(xn−1,xn)]β1[d(xn,xn+1)]β2[d(xn−1,xn)+d(xn,xn+1)4]β3 |
Thus, by (2.3) and taking (2.4) into account we have
d(xn,xn+1)≤α(xn−1,xn)d(fxn−1,fxn)<max{d(xn−1,xn),Rf(xn−1,xn)}. |
Now, if there exists n0∈N such that d(xn0,xn0+1)≥d(xn0−1,xn0), we get
d(xn0,xn0+1)<max{d(xn0−1,xn0),Rf(xn0−1,xn0)}≤max{d(xn0−1,xn0),d(xn0,xn0+1)}<d(xn0,xn0+1), |
which is a contradiction. Therefore, d(xn,xn+1)<d(xn−1,xn) for all n∈N, that is, the sequence {xn} decreasing and moreover, converges to some b≥0. Moreover, since
Rf(xn−1,xn)=[d(xn−1,xn)]β1[d(xn,xn+1)]β2[d(xn−1,xn+1)4]β3, |
we get that
limn→+∞max{d(xn−1,xn),Rf(xn−1,xn)}=b. |
If we suppose that b>0, then, 0<b<d(xn−1,xn) and we can find δ>0 such that
b<max{d(xn−1,xn),Rf(xn−1,xn)}<b+δ. |
In this way, taking E=b, we get
b=E<max{d(xn−1,xn),Rf(xn−1,xn)}<E+δ, |
which implies (by (a1)) that
d(xn−1,xn)≤α(xn−1,xn)d(fxn−1,fxn))≤E=b, |
which is a contradiction. We thus proved that
limm→d(xn−1,xn)=0. | (2.17) |
We claim now, that the sequence {xn} is Cauchy. Firstly, we remark that, since d(xn−1,xn)=0, there exists j0∈N, such that
d(xn−1,xn)<δ′2, | (2.18) |
for any n≥j0, where δ′=min{δ,E,1}. Reasoning by induction, we will prove that the following relation
d(xj0,xj0+m)<E+δ′2 | (2.19) |
holds, for any m∈N. Indeed, in case of m=1,
d(xj0,xj0+1)<δ′2<E+δ′2, |
so, (2.19) is true. Now, supposing that (2.19) holds for some l, we shall show that it holds for l+1. We have
Rf(xj0,xj0+l)=(d(xj0,fxj0))β1(xj0+l,fxj0+l)s(d(xj0,fxj0+l)+d(xj0+l,fxj0)4)β3=(d(xj0,xj0+1))β1(xj0+l,xj0+l+1)s(d(xj0,xj0+l+1)+d(xj0+l,xj0+1)4)β3≤(d(xj0,xj0+1))β1(d(xj0+l,xj0+l+1))s(d(xj0,xj0+l)+d(xj0+l,xj0+l+1)+d(xj0+l,xj0)+d(xj0,xj0+1)4)β3<(δ′2)β1+β2((E2+δ′4)+δ′4)β3≤(E+δ′2). | (2.20) |
As in the Case (A), if d(xj0,xj0+l)>E, by (a2), and keeping in mind the above inequalities, we get
E<d(xj0,xj0+l)≤max{d(xj0,xj0+l),Rf(xj0,xj0+l)}<max{δ′2,(E+δ′2)}=E+δ′ implies α(xj0,xj0+l)d(fxj0,fxj0+l)≤E. |
But, since using (2.12), it follows that
d(xj0+1,xj0+l+1)=d(fxj0,fxj0+l)≤E, |
and then, by (b3) we get
d(xj0,xj0+l+1)≤d(xj0,xj0+1)+d(xj0+1,xj0+l+1)<δ′2+E<E+δ′2. |
Therefore, (2.19) holds for (l+1). In the opposite situation, if d(xj0,xj0+l)≤E, again by the triangle inequality, we obtain
d(xj0,xj0+l+1)≤d(xj0,xj0+1)+d(xj0+1,xj0+l+1)≤d(xj0,xj0+1)+α(xj0,xj0+l)d(fxj0,fxj0+l)<δ′2+max{d(xj0,xj0+l),Rf(xj0,xl)}<δ′2+max{E,E2+δ′4}=δ′2+E. |
Consequently, the induction is completed. Therefore, {xm} is a Cauchy sequence in a complete metric space. Thus, there exists u∈X such that fu=u.
In the above Theorem, the continuity condition of the mapping f can be replace by the continuity of f2.
Theorem 2.2. Suppose that f:(X,d)→(X,d) forms an α-hybrid Jaggi-Meir-Keeler type contraction such that f2 is continuous.Then, f has a fixed point, provided that there exists x0∈X, such that α(x0,fx0)≥1.
Proof. Let x0∈X such that α(x0,fx0)≥1 and the sequence {xn}, where xn=fxn−1, for any n∈N. Thus, from Theorem 2.3 we know that this is a convergent sequence. Letting u=limn→+∞xn, we claim that u=fu.
Since the mapping f2 is supposed to be continuous,
f2u=limn→+∞f2xn=u. |
Assuming on the contrary, that u≠fu, we have
Rsf(u,fu)={[β1(d(u,fu)⋅d(fu,f2u)d(u,fu))s+β2(d(u,fu))s+β3(d(u,f2u)+d(fu,fu)4)s]1/s,fors>0(d(u,fu))β1(d(fu,f2u))β2(d(u,f2u)+d(fu,fu)4)β3,fors=0[16pt]={[β1(d(u,fu)⋅d(fu,u)d(u,fu))s+β2(d(u,fu))s+β3(d(u,u)+d(fu,fu)4)s]1/s,fors>0(d(u,fu))β1(d(fu,u))β2(d(u,u)+d(fu,fu)4)β3,fors=0[16pt]={[β1(d(fu,u))s+β2(d(u,fu))s]1/s,fors>00,fors=0={[β1+β2]1/sd(u,fu)),fors>00,fors=0 |
Example 2.1. Let X=[0,+∞), d:X×X→[0,+∞), d(x,y)=|x−y|, and the mapping f:X→X, where
f={12,ifx∈[0,1]16,ifx>1. |
We can easily observe that f is discontinuous at the point x=1, but f2 is a continuous mapping. Let also the function α:X×X→[0,+∞),
α(x,y)={x2+y2+1,ifx,y∈[0,1]ln(x+y)+1,ifx,y∈(1,+∞)1,ifx=56,y=760, otherwise , |
and we choose β1=14,β2=12,β1=14 and s=2. The mapping f is triangular α-orbital admissible and satisfies (a2) in Definition 2.1 for any x,y∈[0,1], respectively for x,y∈(1,+∞). Taking into account the definition of the function α, we have more to check the case x=56, y=76. We have
Rf(56,76)=[14(d(56,f56)d(76,f76)d(56,76))2+12(d(56,76))2+14(d(56,f76)+d(76,f56)4)2]1/2=√14+12⋅19+19⋅=√13. |
Therefore,
α(56,76)d(f56,f76)=d(f56,f76)=d(12,16)=13<1√3=max{d(56,76),Rf(56,76)}. |
Moreover, since the mapping f satisfies condition (a1) for
δ(E)={1−E,forE<11,forE≥1, |
it follows that the assumptions of Theorem 2.3 are satisfied, and u=12 ia a fixed point of the mapping f.
Theorem 2.3. If to the hypotheses of Theorem we add the following assumption
α(u,v)≥1for anyu,v∈Ff(X), |
then the mapping f admits an unique fixed point.
Proof. Let u∈X be a fixed point of f. Supposing on the contrary, that we can find v∈X such that fu=u≠v=fv, we have
(i) For s>0,
Rsf=[β1(d(u,fu)d(v,fv)d(u,v))s+β2(d(u,v))s+β3(d(u,fv)+d(v,fu)4)s]1/s=[β2(d(u,v))s+β3(d(u,v)2)s]1/s≤(β2+β3)1/sd(u,v)≤d(u,v). |
Thus, taking x=u and y=v in (2.3) we get
d(u,v)≤α(u,v)d(fu,fv)<max{d(u,v),Rf(u,v)}=d(u,v), |
which is a contradiction.
(ii) For s=0,
d(u,v)≤α(u,v)d(fu,fv)<max{d(u,v),Rf(u,v)}=max{d(u,v),(d(u,fu))β1(d(v,fv))β2(d(u,fv)+d(v,fu)4)β3}=d(u,v), |
which is a contradiction.
Consequently, if there exists a fixed point of the mapping f, under the assumptions of the theorem, this is unique.
Example 2.2. Let the set X=[−1,+∞), d:X×X→[0,+∞), d(x,y)=|x−y|, and the mapping f:X→X, where
fx={x2+1,ifx∈[−1,0)1,ifx∈[0,1]1x,ifx>1. |
Let also α:X×X→[0,+∞) defined as follows
α(x,y)={34,ifx,y∈[−1,0)x2+y2+1,ifx,y∈[0,1]1,ifx∈[−1,0),y∈[0,1]0, otherwise . |
It is easy to check that, with these chooses, f is a continuous triangular α-orbital admissible mapping and also, it follows that the mapping f satisfies the conditions (a2) from Definition (2.1). Moreover, f satisfies the condition (a1), considering δ(E)=1−E in case of E<1 and δ(E)=1 for E≥1. Consequently, f satisfies the conditions of Theorem 2.3 and has a unique fixed point, u=0.
In particular, for the case s=0, the continuity assumption of the mapping f can be replace by the condition (R).
Theorem 2.4. We presume thatf:(X,d)→(X,d)∈TαX and fulfills
(ai) for given E>0, there exists δ>0 such that
E<O(x,y)<E+δimpliesα(x,y)d(fx,fy)≤E, | (2.21) |
with
O(x,y)=max{d(x,y),(d(x,fx))β1(d(y,fy))β2(d(x,fy)+d(y,fx)4)β3}, |
for all x,y∈X, where βi≥0, i=1,2,3 so that β1+β2+β3=1;
(aii)
α(x,y)d(fx,fy)<O(x,y). | (2.22) |
The mapping f has a unique fixed point provided that:
(α1) there exists x0∈X such that α(x0,fx0)≥1;
(α3) α(u,v)≥1 for any u,v∈Ff(X);
(α2) if the sequence {xn} in X is such that for each n∈N
α(xn,xn+1)≥1andlimn→+∞xn=x∈X, |
then there exists a subsequence {xn(j)} of {xn} such that
α(xn(j),x)≥1,for eachj∈N. |
Proof. Let x0∈X such that α(x0,fx0)≥1. Then, we know (following the proof of Theorem 2.3) that the sequence {xn}, with xn=fnx0 is convergent; let u=limn→+∞xn. On the other hand, from (α2), we can find a subsequence {xn(j)} of {xn} such that
α(xn(j),u)≥1, for each j∈N. |
Since we can suppose that d(xn(j)+1,fu)>0, from (aii) we have
d((xn(j)+1,fu))≤α(xn(j),u)d(fxn(j),fu)<O(x,y)=max{d(xn(j),u),(d(xn(j),fxn(j)))β1(d(u,fu))β2(d(xn(j),fu)+d(u,fxn(j))4)β3}=max{d(xn(j),u),(d(xn(j),xn(j)+1))β1(d(u,fu))β2(d(xn(j),fu)+d(u,xn(j)+1)4)β3}. |
Letting n→+∞ in the above inequality, we get d(u,fu)=0. Thus, fu=u.
To proof the uniqueness, we consider that we can find another fixed point of f. From (aii), we have
d(u,v)=d(fu,fv)≤α(u,v)d(fu,fv)<O(u,v)=d(u,v)<d(u,v), |
which is a contradiction. Therefore, u=v.
Considering α(x,y)=1 in the above theorems, we can easily obtain the following result.
Definition 2.2. A mapping f:(X,d)→(X,d) is called hybrid Jaggi-Meir-Keeler type contraction on X if for all distinct x,y∈X we have:
(a1) for given E>0, there exists δ>0 such that
E<max{d(x,y),Rsf(x,y)}<E+δ⟹d(fx,fy)≤E; | (2.23) |
(a2) whenever Rf(x,y)>0,
d(fx,fy)<max{d(x,y),Rsf(x,y)}. | (2.24) |
Corollary 2.1. Any hybrid Jaggi-Meir-Keeler type contraction f:(X,d)→(X,d) possesses a unique fixed point provided that f is continuous or f2 is continuous.
The authors declare that they have no conflicts of interest.
[1] |
A. Hernando, E. Roanes-Lozano, L. M. Laita, A polynomial model for logics with a prime power number of truth values, J. Autom. Reasoning, 46 (2011), 205–221. https://doi.org/10.1007/s10817-010-9191-0 doi: 10.1007/s10817-010-9191-0
![]() |
[2] | J. Hsiang, Refutational Theorem Proving using Term-Rewriting Systems, Artif. Intell., 25 (1985), 255–300. |
[3] | D. Kapur, P. Narendran, An Equational Approach to Theorem Proving in First-Order Predicate Calculus, In: Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI-85), 2 (1985), 1146–1153. |
[4] |
J. Chazarain, A. Riscos, J. A. Alonso, E. Briales, Multivalued logic and Gröbner Bases with applications to modal logic, J. Symb. Comput., 11 (1991), 181–194. https://doi.org/10.1016/S0747-7171(08)80043-0 doi: 10.1016/S0747-7171(08)80043-0
![]() |
[5] | J. A. Alonso, E. Briales, Lógicas Polivalentes y Bases de Gröbner, In: C. Martin, ed., Actas del V Congreso de Lenguajes Naturales y Lenguajes Formales, University of Seville, Seville, 1995,307–315. |
[6] | E. Roanes-Lozano, L. M. Laita, E. Roanes-Macías, A polynomial model for multivalued logics with a touch of algebraic geometry and computer algebra, Math. Comput. Simul., 45 (1998), 83–99. |
[7] |
B. Buchberger, Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elementals of the residue class ring of a zero dimensional polynomial ideal, J. Symbol. Comput., 41 (2006), 475–511. https://doi.org/10.1016/j.jsc.2005.09.007 doi: 10.1016/j.jsc.2005.09.007
![]() |
[8] | B. Buchberger, Applications of Gröbner Bases in Non-Linear Computational Geometry, In: J. R. Rice, ed., Mathematical Aspects of Scientific Software. Springer-Verlag, IMA Vol. 14, New York, (1988), 60–88. |
[9] | J. Abbott, A. M. Bigatti, CoCoALib: a C++ library for doing Computations in Commutative Algebra, 2019. Available from: {http://cocoa.dima.unige.it/cocoalib} |
[10] | L. M. Laita, E. Roanes-Lozano, V. Maojo, L. de Ledesma, L. Laita, An Expert System for Managing Medical Appropriateness Criteria Based on Computer Algebra Techniques, Comput. Math. Appl., 51 (2000), 473–481. |
[11] | C. Pérez-Carretero, L. M. Laita, E. Roanes-Lozano, L. Lázaro, J. González-Cajal, L. Laita, A logic and computer algebra-based Expert System for diagnosis of anorexia, Math. Comput. Simul., 58 (2002), 183–202. |
[12] | C. Rodríguez-Solano, L. M. Laita, E. Roanes Lozano, L. López Corral, L. Laita, A computational system for diagnosis of depressive situations, expert system with applications, 31 (2006), 47–55. https://doi.org/10.1016/j.eswa.2005.09.011 |
[13] |
M. Lourdes Jimenez, J. M. Santamaría, R. Barchino, L. Laita, L. M. Laita, L. A. González, et al., Knowledge representation for diagnosis of care problems through an expert system: Model of the auto-care deficit situations, Expert Syst. Appl., 34 (2008), 2847–2857. https://doi.org/10.1016/j.eswa.2007.05.039 doi: 10.1016/j.eswa.2007.05.039
![]() |
[14] |
E. Roanes-Lozano, J. L. Galán-García, G. Aguilera-Venegas, A prototype of a RBES for personalized menus generation, Appl. Math. Comput., 315 (2017), 615–624. https://doi.org/10.1016/j.amc.2016.12.023 doi: 10.1016/j.amc.2016.12.023
![]() |
[15] |
G. Aguilera-Venegas, E. Roanes-Lozano, E. Rojo-Martínez, J. L. Galán-García, A proposal of a mixed diagnostic system based on decision trees and probabilistic experts rules, J. Comput. Appl. Math., 427 (2023). https://doi.org/10.1016/j.cam.2023.115130 doi: 10.1016/j.cam.2023.115130
![]() |
[16] |
G. Aguilera-Venegas, A. López-Molina, G. Rojo-Martínez, J. L. Galán-García, Comparing and tuning machine learning algorithms to predict type 2 diabetes mellitus, J. Comput. Appl. Math., 427 (2023). https://doi.org/10.1016/j.cam.2023.115115 doi: 10.1016/j.cam.2023.115115
![]() |
[17] |
E. Roanes-Lozano, E. A. Casella, F. Sánchez, A. Hernando, Diagnosis in Tennis Serving Technique, Algorithms, 13 (2020). https://doi.org/10.3390/a13050106 doi: 10.3390/a13050106
![]() |
[18] | A. Roanes-Lozano, J. L. Galán-García, G. Aguilera-Venegas, A prototype of a functional approach to personalized menus generation using set operations, Adv. Comput. Math., 13 (2019), 1881–1895. |
[19] |
M. Villalba-Orero, E. Roanes-Lozano, A prototype of a decision support system for equine cardiovascular diseases diagnosis and management, Mathematics, 20 (2021). https://doi.org/10.3390/math9202580 doi: 10.3390/math9202580
![]() |
[20] |
A. Hernando, A new algebraic model for implementing expert systems represented under the 'Concept-Attribute-Value' paradigm, Math. Comput. Simul., 82 (2011), 29–43. https://doi.org/10.1016/j.matcom.2010.06.020 doi: 10.1016/j.matcom.2010.06.020
![]() |
[21] |
A. Hernando, R. Maestre-Martínez, E. Roanes-Lozano, A natural language for implementing algebracially expert systems, Math. Comput. Simul., 129 (2016), 31–49. https://doi.org/10.1016/j.matcom.2016.04.006 doi: 10.1016/j.matcom.2016.04.006
![]() |
[22] |
M. Brickenstein, A. DreyerPolyBoRi: Polybori: A framework for Gröbner-basis computations with Boolean polynomials, Journal of Symbolic Computation, 44 (2009), 1326–1345. https://doi.org/10.1016/j.jsc.2008.02.017 doi: 10.1016/j.jsc.2008.02.017
![]() |
[23] |
E. Roanes-Lozano, L. M. Laita, An applicable topology-independent model for railway interlocking systems, Math. Comput. Simul., 45 (1998), 175–183. https://doi.org/10.1016/S0378-4754(97)00093-1 doi: 10.1016/S0378-4754(97)00093-1
![]() |
[24] | E. Roanes-Lozano, L. M. Laita, E. Roanes-Macías, An application of an AI methodology to railway interlocking systems using computer algebra, in Tasks and Methods in Applied Artificial Intelligence, (1998), 687–696. https://doi.org/10.1007/3-540-64574-8_455 |
[25] |
E. Roanes-Lozano, E. Roanes-Macías, L. Laita, Railway interlocking systems and Gröbner bases, Math. Comput. Simul., 51 (2000), 473–481. https://doi.org/10.1016/S0378-4754(99)00137-8 doi: 10.1016/S0378-4754(99)00137-8
![]() |
[26] |
E. Roanes-Lozano, A. Hernando, J. A. Alonso, L. M. Laita, A logic approach to decision taking in a railway interlocking system using Maple, Math. Comput. Simul., 82 (2011), 15–28. https://doi.org/10.1016/j.matcom.2010.05.024 doi: 10.1016/j.matcom.2010.05.024
![]() |
[27] |
A. Hernando, E. Roanes-Lozano, R. Maestre-Martínez, J. Tejedor, A logic-algebraic approach to decision taking in a railway interlocking system, Ann. Math. Artif. Intell., 65 (2012), 317–328. https://doi.org/10.1007/s10472-012-9321-y doi: 10.1007/s10472-012-9321-y
![]() |
[28] |
A. Hernando, R. Maestre, E. Roanes-Lozano, A new algebraic approach to decision making in a railway interlocking system based on preprocess, Math. Probl. Eng., 2018 (2018), 4982974. https://doi.org/10.1155/2018/4982974 doi: 10.1155/2018/4982974
![]() |
[29] |
A. Hernando, E. Roanes-Lozano, J. L. Galán-García, G. Aguilera-Venegas, Decision making in railway interlocking systems based on calculating the remainder of dividing a polynomial by a set of polynomials, Electron. Res. Arch., 31 (2023), 6160–6196. https://doi.org/10.3934/era.2023313 doi: 10.3934/era.2023313
![]() |
1. | Sana Hadj Amor, Ameni Remadi, Self similarity sets via fixed point theory with lack of convexity, 2023, 37, 0354-5180, 10055, 10.2298/FIL2329055A | |
2. | Vo Tri, Continuous dependence on parameters of differential inclusion using new techniques of fixed point theory, 2023, 37, 0354-5180, 5469, 10.2298/FIL2316469T | |
3. | Mohammed Shehu Shagari, Manzuma Mustapha, Hala H. Taha, Sarah Aljohani, Nabil Mlaiki, On Combinational Contractions with Applications, 2025, 24058440, e41905, 10.1016/j.heliyon.2025.e41905 | |
4. | Mohammed Shehu Shagari, Faryad Ali, Monairah Alansari, Akbar Azam, New views on RLC-electric circuit models via combinational contractions, 2025, 2025, 1687-2770, 10.1186/s13661-025-02068-w | |
5. | Sirajo Yahaya, Mohammed Shagari, Ibrahim Fulatan, Fixed points of bilateral multivalued contractions, 2024, 38, 0354-5180, 2835, 10.2298/FIL2408835Y |