On The Fixed Points Of Large-Kannan Contraction Mappings And Applications
Abdelkader Dehici
y, Mouataz Billah Mesmouli
z, Erdal Karapinar
xReceived 10 August 2018
Abstract
In this paper, we establish some …xed point results for large-Kannan mappings in complete metric spaces. Our results are applied to solve some implicit integral equations.
1 Introduction and Preliminaries
It is well known that Banach’s contraction principle (1922) is a powerful tool in analy- sis, that most mathematicians applying about to solve many of their problems. It is remarkable by its simplicity; this comes from the fact that the contractive condition on the mapping is easy to check and it requires only a complete metric space for its framework. Banach’s contraction principle appeared in explicit form in Banach’s thesis [2], where it was used to obtain the solution of an integral equation in the functional space C([0;1]). One of the other application of the Banach contraction principle is for example, the study of existence and uniqueness of solutions of the Itô stochastic equation with deviating argument. Indeed, it was proved (see [5]) that if the stochas- tic parameters satisfy Lipschitz condition in the second variable, then the associated integral operator turns out to be a contraction and the solution is obtained by using the method of successive approximations. In Banach spaces setting, recall that Kras- noselskii’s …xed point result is a combination of Banach and Schauder’s …xed point theorems, this result can be seen as a consequence of the fact that the measure of noncompactness is invariant by compact perturbations. The sum of two operators is a powerful tool used to solve delay integral equations, neutral functional equations, Cauchy problems for ordinary di¤erential equations and partial di¤erential equations modeled by Hammerstein integral operators in Lp-spaces. For more details, see [1, 3, 4].
In this work, we establish existence and uniqueness results for large-Kannan map- pings extending those in [8, 9, 12]. In particular, we distinguish the continuous and
Mathematics Sub ject Classi…cations: 47H10.
yLaboratory of Informatics and Mathematics, University of Souk-Ahras, P.O.Box 1553, Souk-Ahras 41000, Algeria
zMathematics Department, Faculty of Science, University of Hail, Kingdom of Saudi Arabia
xDepartment of Medical Research, China Medical University Hospital, China Medical University, 40402, Taichung, Taiwan
535
non-continuous cases. Finally, our results are explored to solve an implicit functional equation.
The classical statement of Banach …xed point theorem is the following:
THEOREM 1. Let (X; d) be a complete metric space and T : X ! X be a contraction mapping, i.e.,
d(T x; T y) d(x; y);
for all x; y2X, where0< <1. ThenT has a unique …xed pointy0 inX. Moreover for each x02X, the sequence of iteratesfTnx0gn converges toy0.
In 1968, R. Kannan [8, 9] obtained the following …xed point result.
THEOREM 2. Let (X; d) be a complete metric space and T : X ! X be a selfmapping on X. Assume that there exists 2 0;12 such that
d(T x; T y) [d(x; T x) +d(y; T y)];
for allx; y2X. ThenT has a unique …xed pointz0in X. Moreover for eachx02X, the sequence of iteratesfTnx0gn converges toz0.
It has be seen that contraction mappings are continuous which is not in general the case of Kannan mappings as shown in the following examples.
EXAMPLE 1. Let(X; d) = (R;j j)andT :R!Rbe de…ned by T x= 0 ifx 2;
1
4 ifx >2:
For allx; y2R, we prove easily that jT x T yj 1
4(jx T xj+jy T yj):
EXAMPLE 2. Let(X; d) = ([0;1];j j)andT : [0;1]![0;1]be given by T x=
x
16 ifx2[0;1[;
1
18 ifx= 1:
Letx; y2[0;1[. Thus
jT x T yj= x 16
y 16 = 1
16jx yj; and
jx T xj= 15x
16 ; jy T yj= 15y 16;
which implies that
jT x T yj= 1
16jx yj 1
14(jx T xj+jy T yj): Now, ifx2[0;1[andy= 1, we get
jT x T yj= x 16
1 18 ; and
jx T xj=15x
16 ; jT1 1j=17 18: Consequently, for all x; y2[0;1], we have
jT x T yj x 16+ 1
18 1
14(jx T xj+jy T yj):
EXAMPLE 3. Let(X; d) = ([0;1];j j)and T : [0;1]![0;1]be de…ned by T x=
x
6 if0 x < 12;
x
4 if 12 x 1:
Ifx; y2 0;12 , we get
jT x T yj 1
6(x+y) =1
5(jx T xj+jy T yj): On the other hand, ifx; y2 12;1 , we get
jT x T yj 1
4(x+y) =1
3(jx T xj+jy T yj): Now, if0 x < 12 y, then
jT x T yj= 1 6x 1
4y 1
4(x+y) 1
3(jx T xj+jy T yj): Consequently, for all x; y2[0;1], we obtain that
jT x T yj 1
3(jx T xj+jy T yj):
There is a large literature dealing with Kannan mappings and their generalizations, we can quote for examples [6, 7, 8, 9, 10] and [12]. In [3], Burton observed that Theorem 1 is more interesting in applications through some modi…cation and formulated it as follows:
DEFINITION 1. Let(X; d)be a metric space and letT :X!X be a selfmapping on X. T is said to be a large contraction, if for x; y 2 X, with x 6= y, we have d(T x; T y)< d(x; y), and if for all >0, there exists <1 such that
[x; y2X; d(x; y) ] =)d(T x; T y) d(x; y):
REMARK 1. We observe that every contraction mapping is a large contraction.
The converse does not hold in general, as the following example shows [3].
EXAMPLE 4. Let(X; d) = (R;j:j)and letT :R !Rbe de…ned byT x=x x3. Then forx; y2R, by applying the Mean Value Theorem, we get
jT x T yj= x x3 y+y3 1 3c2 jx yj; where c2]minfx; yg;maxfx; yg[.
Afterwards, from the inequality given above, it is easy to observe that there exists su¢ ciently small such that for allx; y2[ ; ](x6=y), we havejT x T yj<jx yj. Additionally, it was proved in [3] that for a given >0, ifjx yj , then
jT x T yj 1
2
4 jx yj;
moreover, since T0 = 0andlimx!0 x xx3 = 1, we deduce thatT is not a contraction selfmapping on [ ; ].
EXAMPLE 5. Letf : [0;1]![0;1]be given byf(x) =x x44. Then jf(x) f(y)j = x x4
4 y y4
4 = (x y) 1
4 x2 2 y2 2
= (x y) 1
4 x2 y2 x2+y2
= (x y) 1
4(x y) (x+y) x2+y2
= (x y) 1 1
4(x+y) x2+y2 :
Sincejx yj jx+yjandjx yj2=x2+y2 2xy 2 x2+y2 , it follows that jf(x) f(y)j = (x y) 1 1
4(x+y) x2+y2 jx yj 1 jx yj3
8
! :
Next, if jx yj , we infer that
jf(x) f(y)j jx yj 1
3
8 :
Hence, to deduce thatf is a large contraction, it su¢ ces to take ( ) = 1 83 . Now, to show thatf is not a contraction mapping, it su¢ ces to see that
xlim!0
x x44
x = 1:
Thus, there is nok2(0;1)such that x x4
4 y y4
4 kjx yj; 8x; y2(0;1):
THEOREM 3 ([3]). Let(X; d)be a complete metric space and letT :X!X be a large contraction selfmapping. Assume that there exist x0 2X andL >0, such that d(x0; Tnx0) Lfor alln 1. ThenT has a unique …xed point in X.
REMARK 2. Notice that, if(X; d)is a compact metric space, then the assumption that there exist x0 2X and L > 0, such that d(x0; Tnx0) L for alln 1 can be dropped. Indeed, in this case, the existence and uniqueness of the …xed point is ensured by Edelstein’s theorem.
REMARK 3. If(X; d)is a bounded complete metric space, then for allx02X and for all integern 1, we haved(x0; Tnx0) (X), where (X)is the diameter ofX. So the boundedness assumption given above is trivially satis…ed in this setting.
2 Main Results
We start this section by the following lemma which asserts that the set of contraction mappings has an in…nite subset of Kannan mappings.
LEMMA 1. Let(X; d)be a metric space. Assume thatT :X !Xbe a selfmapping onX satisfying that
d(T x; T y) d(x; y)for allx; y2X;
where 2 0;13 . ThenT is a Kannan mapping with a constant of contraction equals to 1 .
PROOF. Letx; y2X. Then by assumption, we have d(T x; T y) d(x; y);
where 2 0;13 . On the other hand, by using the triangle inequality, we get d(x; y) d(x; T x) +d(T x; T y) +d(T y; y):
Multiplying the previous inequality by , it follows that
d(T x; T y) d(x; y) (d(x; T x) +d(T x; T y) +d(T y; y));
therefore,
d(T x; T y)
1 (d(x; T x) +d(y; T y)):
Since 2 0;13 , then 1 2 0;12 . Consequently,T is a Kannan mapping.
2.1 Large-Kannan Contractions in the Continuous Sense
Now, we give the following de…nition of a large-Kannan contraction (in the continuous sense) as an extension of the classical ones.
DEFINITION 2. Let(X; d)be a metric space and letT :X!X be a selfmapping on X. T is said to be a large-Kannan contraction (in the continuous sense), if for x; y 2X, withx6=y, we haved(T x; T y)< d(x; y), and if for all >0, there exists
<12 such that
[x; y2X; d(x; y) ] =)d(T x; T y) [d(x; T x) +d(y; T y)]:
REMARK 4. Large-Kannan contractions (in the continuous sense) are continuous.
This is an immediate consequence of the inequality d(T x; T y)< d(x; y)forx6=y.
REMARK 5. Let(X; d)be a metric space and letT :X !Xbe a large contraction on X. Assume that 2 [0;13[, then by Lemma 1, it is easy to conclude that T is a large-Kannan contraction mapping.
Now, we give the following …xed point result for large-Kannan contractions.
THEOREM 4. Let(X; d)be a complete metric space and T :X !X be a large- Kannan contraction mapping (in the continuous sense). Then T has a unique …xed point in X.
PROOF. Let x0 2 X, if there exists an integer m 1 such that Tm(x0) = Tm+1(x0), thenT(Tmx0) =Tmx0 andTmx0is a …xed point ofT.
Now, assume thatTnx06=Tn+1x0for every integern 1. SinceT is large-Kannan contraction (in the continuous sense), then
d Tn+1x0; Tnx0 < d Tnx0; Tn 1x0 < ::: < d(T x0; x0):
This proves that the sequence n = d Tn+1x0; Tnx0 is strictly decreasing, hence
n lim!+1 n= 0. If >0, then for alln 1, we get
d Tn+1x0; Tnx0 :
Consequently, there exists <12 such that
d Tn+1x0; Tn+2x0 = d T(Tnx0); T Tn+1x0
d Tnx0; Tn+1x0 +d Tn+1x0; Tn+2x0 : This implies that
(1 )d Tn+1x0; Tn+2x0 d Tnx0; Tn+1x0 : Thus, we have
d Tn+1x0; Tn+2x0
1 d Tnx0; Tn+1x0
1
2
d Tn 1x0; Tnx0
...
1
n
d T x0; T2x0
1
n+1
d(x0; T x0): (1) Since <12, we see thatk= 1 <1. So, by using (1), it follows that
n!1lim d Tnx0; Tn+1x0 = 0; (2) which is a contradiction. Hence = 0 and achieves the proof of this step.
Now, we shall prove that fxngn given by xn = Tnx0 is a Cauchy sequence in X. Suppose, to the contrary thatfxngnis not a Cauchy sequence. Thus, there exist >0 and subsequences of integers(Nk),(nk),(mk)such that
Nk! 1,mk> nk> Nk; and
d(xmk; xnk): (3)
SinceT is large-Kannan mapping, by using (3), there exists <12 such that d(xmk; xnk) =d(T xmk 1; T xnk 1) [d(xmk 1; xmk) +d(xnk 1; xnk)]: Lettingk! 1, from (2), follows that
klim!1d(xmk 1; xmk) = lim
k!1d(xnk 1; xnk) = 0:
Hence lim
k!1d(xmk; xnk) = 0, which is a contradiction. Thus fxngn is a Cauchy sequence in X. Finally, since X is complete, then there exists l 2 X such that
nlim!1xn= lim
n!1Tnx0=l. The continuity ofT implies thatT(l) =l, which proves that l is a …xed point ofT.
Now, suppose thatl0is another …xed point forT such thatl6=l0. Thusd(l; l0) 0
for some 0>0. SinceT is Kannan-large mapping, there exists 0<12 such that d(l; l0) =d(T(l); T(l0)) 0[d(l; T(l)) +d(l0; T(l0))]:
Hence, we get d(l; l0) = 0, which is a contradiction. Thus, we must havel=l0. REMARK 6. For the case of large-Kannan mappings (in the continuous sense), the existence of …xed points is proved without any assumption on the boundedness of the set fd(x0; Tnx0)g for somex02X.
COROLLARY 1. Let (X; d) be a complete metric space and T : X ! X be a selfmapping onX such thatTm0 is a large-Kannan mapping (in the continuous sense) for some integerm0 1. ThenT has a unique …xed point inX.
PROOF. From Theorem 4, there existsz02X such thatTm0z0=z0, then T(Tm0z0) =Tm0+1z0=T z0:
This gives Tm0(T z0) = T z0 and implies that T z0 is a …xed point for Tm0z0. The uniqueness of the …xed point for the mapping Tm0 (given by Theorem 4) shows that T z0 =z0. Now, if z1 is another …xed point for T, thenz1 is a …xed point for Tm0. Hence z0=z1, which achieves the proof.
EXAMPLE 6. Let f : R! R, de…ned by f(x) = x3: If x 0, we have jxj = x x+x3 = x x3 = jx f(x)j. If x 0, we have jxj = x x x3 = x+ x3 = jx f(x)j. Let us prove that f is not a Kannan mapping. For all x; y2R, we have
jf(x) f(y)j= x3 y3 : Thus
jx f(x)j+jy f(y)j= x+x3 + y+y3 : By takingy= 0and letting x!+1, we get
x!lim+1
jf(x) f0j
jx f(x)j+j0 f0j = lim
x!+1
jf(x)j
jx+x3j = lim
x!+1
jx3j
jx+x3j = 1> 1 2: Consequently, f need not be a Kannan mapping.
Now, set
= (x; y)2[ 1;1]2: x2+y2+xy +1
2jx yj2 1 2 :
Ifx; y2 , then
jf(x) f(y)j = x3 y3
= jx yj x2+y2+xy (jxj+jyj) x2+y2+xy
(jx f(x)j+jy f(y)j) x2+y2+xy (jx f(x)j+jy f(y)j) 1 jx yj2
2
! :
So, for a given (su¢ ciently small) >0, ifx; y2 satisfying thatjx yj , we have jf(x) f(y)j (jx f(x)j+jy f(y)j) 1 2
2 :
Finally, to conclude that f is a large-Kannan mapping, it su¢ ces to take ( ) = 122 which achieves the proof.
By Rakotch [11], let denote the class of real-valued control functions (not neces- sarily continuous) which satisfy the condition
= f : (0;1)! 0;1
2 ; f(tn)7! 1
2 )tn!0 (n! 1) :
Now, we are in position to prove a general version of Theorem 4 given as follows:
THEOREM 5. Let (X; d) be a complete metric space and T : X ! X be a selfmapping such that, for x; y2X, withx6=y, we haved(T x; T y)< d(x; y)and for all >0, there existsf 2 such that
[x; y2X; d(x; y) ] =)d(T x; T y) f (d(x; y)) [d(x; T x) +d(y; T y)]: ThenT has a unique …xed pointz0 inX.
PROOF. Let x0 2 X, if there exists an integer m0 1 such that Tm0(x0) = Tm0+1(x0), thenT(Tm0x0) =Tm0x0andTm0x0 is a …xed point ofT.
Now, assume that Tnx0 6=Tn+1x0 for every integer n 1. De…ne the sequence fxngn byxn =Tnx0. Hence
d(xn; xn+1) =d Tnx0; Tn+1x0 < d Tnx0; Tn 1x0 =d(xn 1; xn);
this implies that the sequence n = d(xn; xn+1) is strictly decreasing, consequently
n lim!+1 n= 0. If >0, by assumption, there existsf 2 such that
d(xn; xn+1) =d Tnx0; Tn+1x0 f (d(xn 1; xn)) [d(xn; xn+1) +d(xn 1; xn)]: Therefore
d(xn; xn+1)
d(xn; xn+1) +d(xn 1; xn) f (d(xn 1; xn))<1 2:
Letting n! 1, it follows that
nlim!1
d(xn; xn+1)
d(xn; xn+1) +d(xn 1; xn)=
2 = 1 2 lim
n!1f (d(xn 1; xn))<1 2; (4) which is a contradiction, then we must have = 0.
Now, we shall prove thatfxngn given byxn=Tnx0 is a Cauchy sequence inX. Suppose, to the contrary, thatfxngn is not a Cauchy sequence inX. Thus, there exist 0>0, subsequences of positive integers(Nk),(nk)and(mk)such that
Nk! 1,mk> nk> Nk; and
0 d(xmk; xnk) =d(T xnk 1; T xmk 1): (5) This last inequality shows that xmk 1 6=xnk 1. Now, by assumptions and using the relation 5, there existsf 2 such that
0 d(xnk; xmk) =d(T xnk 1; T xmk 1)
f (d(xnk 1; xmk 1)) [d(xnk 1; xnk) +d(xmk 1; xmk)]
< 1
2[d(xnk 1; xnk) +d(xmk 1; xmk)]: Lettingk! 1, it follows that
0 lim
k!1d(xnk; xmk) = 0;
which is a contradiction. Thusfxngnis a Cauchy sequence inX. SinceX is a complete metric space, there existsz02X such that lim
n !+1xn=z0. To prove thatz0is a …xed point forT, we argue as follows:
Select an arbitrary integern 1. By using the triangle inequality, we get d(z0; T z0) d(z0; xn+1) +d(T z0; xn+1)
=d(z0; xn+1) +d(T z0; T xn):
Without loss of generality, we assume that xn 6=z0. Hence d(z0; T z0) d(z0; xn+1) +d(T z0; xn+1) d(z0; xn+1) +12(d(xn; xn+1) +d(z0; T z0)):
Similarly
0 12d(z0; T z0) d(z0; xn+1) +12d(xn; xn+1):
Lettingn !+1, it follows that 0 12d(z0; T z0) lim
n !+1d(z0; xn+1) +1 2 lim
n !+1d(xn; xn+1) = 0:
Consequently,z0 is a …xed point forT.
If T has two …xed points z0; z1 2 X; z0 6= z1, thus, by our assumption and putting
=d(z0; z1), there existsf
2 (taking its values in the interval[0;12[) such that 0 <
2 < d(z0; z1) =d(T z0; T z1) f2(d(z0; z1)) (d(z0; T z0) +d(z1; T z1))
< 1
2(d(z0; T z0) +d(z1; T z1)) = 0:
This is a contradiction. Consequently, we must havez0=z1which achieves the proof.
REMARK 7. It is worth noting that the condition d(T x; T y) < d(x; y); (x6=y) does not imply the existence of the …xed point. To see this, it su¢ ces to take(X; d) = (R;j j)andT x=p
x2+ 1.
DEFINITION 3. Let(X; d)be a metric space andT be a selfmapping onX. T is said to be asymptotically regular if for eachx2X we have lim
n!1d Tnx; Tn+1x = 0.
De…ne now the class of functions 0 by
0 =ff : (0;1)![0;1[; f(tn)7!1)tn!0 (n! 1)g
In the following …xed point theorem, we drop the condition d(T x; T y)< d(x; y), (x6=y)and we replace it by T continuous and asymptotically regular.
THEOREM 6. Let(X; d)be a metric space and letT be a continuous selfmapping onX which is asymptotically regular. Assume that for every >0, there existf 2 0 such that
[x; y2X; d(x; y) ] =)d(T x; T y) f (d(x; y)) [d(x; T x) +d(y; T y)]: Then T has a unique …xed pointz0 inX. Moreover for eachx02X, the sequence of iterates fTnx0gn converges toz0.
PROOF. Letx02X and de…ne the sequence fxngn byxn =Tnx0 for all integer n 1. If there exists m0 1 such that Tm0(x0) = Tm0+1(x0), thenT(Tm0x0) = Tm0x0 andTm0x0 is a …xed point ofT.
Now, suppose that Tnx0 6= Tn+1x0 for all n 1. We shall prove that fxngn is a Cauchy sequence inX.
If it’s not the case, there exist 0>0and subsequences of positive integers(Nk),(nk) and (mk) such that lim
k !+1Nk = +1, mk > nk > Nk and d(xmk; xnk) 0. Thus, by using our assumptions and the triangle inequality, we get
d(xmk; xnk) d(xmk; xmk+1) +d(xmk+1; xnk+1) +d(xnk+1; xnk)
d(xmk; xmk+1) +f0(d(xnk; xmk)) [d(xnk; xnk+1) +d(xmk; xmk+1)]
+d(xnk+1; xnk);
for some f0 2 0. Then,
[1 f 0(d(xnk; xmk))]d(xnk; xmk) d(xnk; xmk)
[1 +f 0(d(xnk; xmk))]
(d(xnk; xnk+1) +d(xmk; xmk+1)): (6) Dividing each right side in (6) by
[1 f0(d(xnk; xmk))] (d(xnk; xnk+1) +d(xmk; xmk+1)); and using the fact thatd(xmk; xnk) 0, we conclude
0
d(xnk; xnk+1) +d(xmk; xmk+1)
d(xnk; xmk)
d(xnk; xnk+1) +d(xmk; xmk+1) 1 +f 0(d(xnk; xmk))
1 f 0(d(xnk; xmk)): Lettingk! 1, thus
k!lim+1
1 +f 0(d(xnk; xmk))
1 f 0(d(xnk; xmk))= +1: Consequently,
lim sup
n;m!1
f 0(d(xn; xm)) = 1: (7)
Sincef 02 0, we obtain
n;mlim!1d(xn; xm) = 0;
which is a contradiction. Hence fxngn must be a Cauchy sequence.
Therefore, sinceXis a complete metric space, there existsz002Xsuch thatlimxn= z00. The continuity ofT implies thatT z00=z00.
Ifz10 is another …xed point forT such that z006=z01. Setd(z00; z10) = 1> 21. Then by assumption there exists f 1
2 2 0 such that h
x; y2X; d(x; y) 1 2 i
=)d(T x; T y) f 1
2 (d(x; y)) [d(x; T x) +d(y; T y)]: It follows that
d(z00; z10) f1(d(z00; z10)) [d(z00; T z00) +d(z10; T z10)] = 0;
which is a contradiction. Hence z00=z10 which achieves the proof.
2.2 Large-Kannan Contractions in the Non (Necessarily) Con- tinuous Sense
In this section, we focus our study on …xed point results for Kannan-large mappings which are not necessarily continuous. First of all, we start by following de…nition
DEFINITION 4. Let(X; d)be a metric space and letT :X !X be a selfmapping.
T is said to be a large-Kannan contraction (in the non-necessarily-continuous sense), if for x; y2X, withx6=y, we haved(T x; T y)< 12(d(x; T x) +d(y; T y)), and if for all
>0, there exists <12 such that
[x; y2X; d(x; y) ] =)d(T x; T y) [d(x; T x) +d(y; T y)]:
REMARK 8. The following example given in [7] shows that mappings satisfying that d(T x; T y)< 12(d(x; T x) +d(y; T y))may fail to have …xed points.
EXAMPLE 7. LetX =f1 +1n; n= 1;2; :::gandd0:X X ![0;+1[de…ned by
d0(x; y) = 0 ifx=y;
x+y ifx6=y:
Thus(X; d0)is a complete metric space. On the other hand, letT : (X; d0) !(X; d0) de…ned by T(1 + 1n) = 1 + n+11 . In [7], it was proved thatT satis…es the inequality d0(T x; T y)<12(d0(x; T x) +d0(y; T y))forx6=y butT has no …xed points.
THEOREM 7. Let(X; d)be a complete metric space and let T : (X; d) !(X; d) be a large-Kannan mapping (in the non-necessarily continuous sense). Then T has a unique …xed point.
PROOF.The uniqueness: IfT has two …xed pointsx0; x12X; x06=x1. Thus 0 d(x0; x1) =d(T x0; T x1)<1
2(d(x0; T x0) +d(x1; T x1)) = 0;
which is a contradiction.
The existence: Step 1: Letx02X and de…ne the Picard sequence fxngn by xn = Tnx0 for all integer n 1. If there exists an integer m0 1 such that Tm0x0 = Tm0+1x0, thus Tm0x0 is a …xed point point for T and the proof is achieved. Now, assume that xn = Tnx0 6= Tn+1x0 = xn+1 for all n 1. We shall prove that the sequence n =d(xn; xn+1)is strictly decreasing.
We have
d(xn; xn+1) =d(T Tn 1x0; T Tnx0))<12(d(Tn 1x0; Tnx0) +d(Tnx0; Tn+1x0))
=12(d(xn 1; xn) +d(xn; xn+1)):
So, we conclude that d(xn; xn+1)< d(xn 1; xn), which proves that n =d((xn 1; xn) is strictly decreasing. Hence, there exists 0 0 such that lim
n !+1d(xn; xn+1) = 0. Step 2: 0= 0 :Suppose that 0>0, since the sequence n=d(xn; xn+1)is decreasing, we get 0 < d(xn; xn+1) for all integer n 1. Thus, by assumption there exists 0< 0<12 such that
d(xn; xn+1) =d(T Tn 1x0; T Tnx0)) 0(d(Tn 1x0; Tnx0) +d(Tnx0; Tn+1x0))
= 0(d(xn 1; xn) +d(xn; xn+1));
which gives
d(xn; xn+1) 1 0
0d(xn 1; xn):
By induction, it follows that
d(xn; xn+1) (1 00)nd(x0; x1):
Afterwards, since 0< 0 < 12, then 1 0
0 <1. This proves that lim
n !+1( 0
1 0
)n = 0 and implies lim
n !+1d(xn; xn+1) = 0which is a contradiction. Consequently 0= 0.
Step 3: fxngn is a Cauchy sequence inX:
If it is not the case, then there exists 0 and subsequences of integersfNkg;fnkg and fmkg with mk > nk > Nk such that 0 d(xnk; xmk) =d(T xnk 1; T xmk 1), which leads to deduce thatxmk 16=xnk 1.
Thus, by assumption and using the fact that the sequence n=d(xn; xn+1)is decreas- ing, we get
0 d(xmk; xnk) =d(T xnk 1; T xmk 1)
1
2(d(xnk 1; xnk) +d(xmk 1; xmk)) d(xnk 1; xnk):
Lettingk !+1, it follows that
0 lim
k!+1d(xmk; xnk) lim
k!+1d(xnk; xnk 1) = 0;
which is a contradiction. Hence fxngn is a Cauchy sequence.
SinceX is a complete metric space, there existsz02X such that lim
n !+1xn=z0. Step 4: z0 is a …xed point forT:
Select an arbitrary integern 1 and using the triangle inequality, we obtain d(z0; T z0) d(z0; xn+1) +d(T z0; xn+1):
=d(z0; xn+1) +d(T z0; T xn):
Without loss of generality, we assume that xn 6=z0. Thus d(z0; T z0) d(z0; xn+1) +d(T z0; xn+1):
d(z0; xn+1) +12(d(xn; xn+1) +d(z0; T z0)):
Similarly
0 12d(z0; T z0) d(z0; xn+1) +12d(xn; xn+1):
Lettingn !+1, we deduce 0 12d(z0; T z0) lim
n !+1d(z0; xn+1) +1 2 lim
n !+1d(xn; xn+1) = 0:
Henced(z0; T z0) = 0. Consequently,z0is a …xed point forT which achieves the proof.
REMARK 9. Following the same way given in Theorem 7, we can establish a variants of Corollary 1 and Theorem 6 for the case of large-Kannan mappings (in the non-necessarily continuous sense).
3 Applications
In this last section, we prove that our results established in the previous section enable us to solve some implicit functional integral equations.
Let (8) be the integral equation formulated as a …xed point problem of the following nonlinear mapping
T x(t) = x(t) + Z t
1
(t; s; x(s); T x(s))dswhere0< <1
3; (8)
in Banach spaceE=C([ 1;1];R)of scalar continuous functions where the investiga- tion is essentially based on the properties of the kernel (; ; ; ).
Under the following assumptions:
1. (t; s; x(s); T x(s)) 0fort; s2[ 1;1]such that (; ;0; )6= 0andT(M) M whereM =fz2E: 1 z(t) 1g.
2. The mappingGde…ned byGx(t) = Z t
1
(t; s; x(s); T x(s))dssatis…esGx2M for allx2M and
kGx Gyk<(1 )kx yk; 8x; y2M; (x6=y):
3. For a given >0, there exists < 1 32 such that ifx; y2M and kx yk , we have for allt2[ 1;1]
jGx(t) Gy(t)j (jx(t) T x(t)j+jy(t) T y(t)j):
ThenT has unique …xed point inM. PROOF. We have
x(t) T x(t) = (1 )x(t) Z t
1
(t; s; x(s); T x(s))ds:
Letx; y2M withkx yk . Then, by using our assumptions, we get jT x(t) T y(t)j
= (x(t) y(t)) + Z t
1
(t; s; x(s); T x(s))ds Z t
1
(t; s; y(s); T y(s))ds jx(t) +T x(t) T x(t) +T y(t) T y(t) y(t)j
+ Z t
1
[ (t; s; x(s); T x(s)) (t; s; y(s); T y(s))]ds (kx T xk+ky T yk+kT x T yk)
+ (kx T xk+ky T yk); which gives that
kT x T yk kT x T yk+ ( + ) (kx T xk+ky T yk): Hence
kT x T yk +
1 (kx T xk+ky T yk):
Now, since0< < 1 32 , then 1+ < 12 and the result is an immediate consequence of Theorem 4.
REMARK 10. In equation (8), if T is a large-Kannan mapping (in the non- necessarily continuous sense) which is satis…ed under assumptions (1) and (3) and if(2)is replaced by the following;
(20)The mappingGde…ned byGx(t) = Z t
1
(t; s; x(s); T x(s))dssatis…es thatGx2 M for allx2M and for allx; y2M withx6=y, we have
kGx Gyk<1 32 (kx Gxk+ky Gyk):
Thus, by the same reasoning given above and using Theorem 7, we prove that the equation (8) has a unique solution.
REMARK 11. IfGis continuous andG(M)is a compact set inM, then the …xed point of T can be deduced as an immediate consequence of Krasnoselskii’s theorem since the mappingA:M !M de…ned byA = is a contraction and satis…es that A(M) M.
4 Conclusion
In applications, the implicit functional equation (8) is related to a large class of inter- esting problems. Several authors have studied important properties of their solutions (stability, controlability, ....). A major problem appears when the inversion of a per- turbed di¤erential operator does not yield a contraction and a compact mapping or
when it is hard to check this fact, since in this situation the classical Krasnoselskii’s
…xed point result or analog does not apply. To overcome this constrainst, we solve this equation by treating the continuous and non-continuous cases provided that the kernel or its associated mapping satis…es large-Kannan assumptions which is the main motivation of this work.
Acknowledgment. The authors would like to thank the anonymous referees for their valuable remarks and suggestions which help us to improve the paper.
References
[1] R. R. Akhmerov, M. I. Kamenskii, A. S. Potapov, A. E. Rodkina and B. N.
Sadovskii, Measure of Noncompactness and Condensing Operators, Birkhäuser Basel, 1992.
[2] S. Banach, Sur les opérations dans les ensembles abstraits et leur applications aux équations intégrales, Fundam. Math., 3(1922), 133–181.
[3] T. A. Burton, Integral equations, implicit relations and …xed points, Proc. Amer.
Math. Soc., 124(1996), 2383–2390.
[4] T. A. Burton, Krasnoselskii’s inversion principle and …xed points, Nonlinear Anal., 30(1997), 3975–3986.
[5] I. I. Gikhman and A. V. Skorohod, The theory of stochastic processes, Vols I and III, "Nauka", Moscou, 1971 and 1975.
[6] J. Górnicki, Fixed point theorems for Kannan maps type mappings, J. Fixed.
Point. Theor. Appl., 19(2017), 2145–2152.
[7] J. Górnicki, Various extensions of Kannan’s …xed point theorem, J. Fixed. Point.
Theor. Appl., 20(2018), 1–12.
[8] R. Kannan, Some results on …xed points, Bull. Calcutta Math. Soc., 60(1968), 71–76.
[9] R. Kannan, Some results on …xed points, II. Amer. Math. Mon., 76(1969), 405–
408.
[10] L. Nova, Fixed point theorems for some discontinuous operators, Paci…c. J. Math., 123(1986), 189–196.
[11] E. Racotch, A note of contractive mappings, Proc. Amer. Math. Soc., 13(1962), 459–465.
[12] S. Reich, Kannan’s …xed point theorem, Boll. Un. Mat. Ital., 4(1971), 1–11.