FIXED POINT THEOREMS OF FUZZY SET-VALUED MAPS WITH APPLICATIONS

68 Probl. Anal. Issues Anal. Vol. 9 (27), No 2, 2020, pp. 68-86

DOI: 10.15393/j3.art.2020.6750

UDC 517.98

Mohammed Shehu Shagari, Akbar Azam

FIXED POINT THEOREMS OF FUZZY SET-VALUED MAPS WITH APPLICATIONS

Abstract. In this paper, we introduce the notion of Suzuki-type (a, ft)-weak contractions in the setting of fuzzy set-valued maps, thereby establishing some fuzzy fixed point theorems. Moreover, one of our theorems is applied to study a homotopy result.

© Petrozavodsk State University, 2020

problem, a generalization of the BFT was given by Suzuki [19]. Later on, an interesting improvement of the Suzuki fixed-point theorem in the setting of multivalued mappings was presented by Djoric and Lazovic [9].

Along the lane, the area of applied mathematics witnessed tremendous developments as a result of the introduction of fuzzy sets by Zadeh [21]. Classically, fuzzy set is characterized by a membership function that assigns to each element a grade of membership between zero and one. Later, Weiss [20] and Butnairu [6] initiated the study of fixed points of fuzzy mappings. Whereas fixed point theorems for fuzzy set-valued mappings have been investigated by Heilpern [11], who originated the idea of fuzzy contractions and proved a fixed-point theorem parallel to the Banach-Cacciopoli principle in the frame of fuzzy sets. Thereafter, several authors have studied and applied fuzzy fixed-point results in different directions; see, for example, [1-3], [12], [14-18], and the references therein.

In this work, motivated by the ideas of Suzuki [19], Djoric and Lazovic [9], we define the notion of Suzuki-type (a, ^)-weak contractions in the setting of fuzzy set-valued maps. As a result, fuzzy fixed-point theorem of Suzuki-type is proved and some consequences are obtained thereafter. In addition, an application in homotopy result is established to highlight the usability of one of our results.

H(A, B) = max < sup d(a, B), sup d(A, b) >,

^ aeA beB &

for A,B E CB(X), where d(x, A) = inf[d(x, a) : a E A}. A point u in X is a fixed point of a multi-valued mapping T : X —> CB(X) if u E Tu. Recall that an ordinary subset A of X is determined by its characteristic function xa, defined by Xa : A ^ {0,1}:

.1, if x E A xa(x) = & n -f a a

The value Xa(x) specifies whether an element belongs to A or not. This idea is used to define fuzzy sets by allowing an element x E A to assume

any possible value of the interval [0,1]. Thus, a fuzzy set A in X is a set of ordered pairs given as

A = {(x,^a(%)) : x E X},

where ^a : X ^ [0,1] = I and is called the membership function

of x, or the degree to which x E X belongs to the fuzzy set A.

Throughout this paper, we shall let (0,1] = I+1 and (0,1) = I-1. An important notion in fuzzy set theory is that of an a-level set. If A is a fuzzy set in X, the (crisp) set of elements in X belonging to A at least of degree a E I+1 is called the a-level set, denoted by [A]a. That is,

[A]a = {x E X : ^A(x) > a}.

On the other hand,

[A]*a = {x E X : pA(x) > a}

is called the strong a-level set or strong a-level cut. Denote by Ix the family of all fuzzy sets in X. Let X be an arbitrary set and Y be a metric space. A mapping T : X ^ IY is called fuzzy mapping. A fuzzy mapping T is a fuzzy subset of X x Y. The function T(x)(y) is the membership value of y in T(x). An element u in X is said to be a fuzzy fixed point of T if there exists an a E I+1 such that u E [Tu]a. Denote the set of all fixed points of T by Tix(T). Example 1.

Let X = [—5, 5] and Y = [—5, 5]. Define T : X ^ IY by

T(x)(y) = cos2 x cos2 y

for all x E X and y E Y. Then T is a fuzzy mapping. Graphical representation of the fuzzy mapping in Example 1 showing all possible membership values of y in T(x) is in Figure 1.

Throughout this paper, the function r : I-1 —> , 1] is defined by

, s ,1, if 0 < a < 2

r(a) = < 2

& 1 — a, if 1 < a < 1.

For x,y E X and a E I+1, define

Figure 1: Graphical representation of the fuzzy mapping in Example 1

y(x,y) = max jd(x,y),d(x, [Tx]a),d(y, [Ty]a),

d(x, [Ty]a) + d(y, [Tx]a) d(x, [Tx]a)d(y, [Ty]a) 2 & 1 + d(x,y)

a, \\ . i » [T i ,,,, n d{X& [Tx]a)d{y& [Ty]a)\\ /\\{X&y) = min jd{X& [Tx]a)&d{y& \\ Tx]a)& -1 + -1 .

Definition 1. A fuzzy mapping T : X ^ Ix is called a Suzuki-type (a, ft)-weak contraction, if for all x^y G X with x = y there exist some a G I_1 and ft > 0, such that

r(o)d(X& [Tx]a) < d(X& y)

H([TxU [Ty]a) < a y(X& y)+ ft /\\(X& y).

Theorem 1. Let (X,d) be a complete metric space and T : X ^ Ix be a Suzuki-type (a, ft)-weak contraction. Assume that for each x E X there exists a E I-i, such that [Tx]a is a non-empty closed and bounded subset of X. Then TiX(T) =

Proof. Let ai E I-i be such that 0 < a < ai < 1, x\\ E X and p = —^. Then, by the assumption, [Tx\\]a is nonempty. Therefore, we can find x2 E X such that x2 E [Tx\\]a. Since p > 1, choose x3 E [Tx2]a, such that

d(x2,X3) < pH([Txi]a, [Tx2]a).

If xl = x2, then xl E [Tx\\]a for some a E I-1, and the theorem is proved. Assume that xl = x2. Since r(a) < 1,

r(a)d(xi, [Txi]a) < d(xi, [Txi]a) < d(xi,x2)

< \\fa. max |d(xi,x2), d(xi, [Tx\\]a), d(x2, [Tx2]«), d(xi, [Tx2]o) + d(x2, [Txi]a) d(xi, [Txi]a)d(x2, [TX2]o)

d(x2,x3) < pH([Txi]a, [Tx2]a](a ^(x,y) + ft /\\(x,y)^ <

, ft ■ fw rrp ! \\rp ] N d{xu [TXl]a)d{X2, [TX2}q) ,

+ d(xu \\Txi\\a),d{x2, [Tx^),-1^—)- } <

_ r d(xi,x3)+d(x2,X2) d(xi,x2)d(x2,x3) !

max \\d(xi ,X2),d(x2 ,X3),-2-, ^Td^r J

ft . f d(xi,x2)d(x2,x3)}

+—min ^ d(xi,x2),d(x2,x2), —--t,-r— > <

I 1 + d(xi,x2) J

/ ^ fM X ,/ X d(Xi,X2) + d(x2,X3)\\ . < y a ma^j d(xi,x2), d(x2, x3 ),---> <

< ^/a max {d(xi,x2),d(x2,x3)} If d(xi,x2) < d(x2,x3), then from (1) we have

d(x2,x3) < y/ad(x2,x3) < d(x2,x3) a contradiction. Hence, d(xi,x2) > d(x2,x3) and (1) becomes d(x2,x3) < \\/ad(xi,x2) < yfœid(xi,x2).

Continuing in this way, we generate a sequence |xra}raeN in X, such that G [TXJq, and

d(xn,xn+i) < y/aid(xn-i,xn),

from which we have

^2d(xn,xn+i) (/ol)n-1 d(xi,x2) < to.

By standard argument, we conclude that |xra}raeN is a Cauchy sequence in X. The completeness of X implies that there exists u G X, such that xn — u as n —y to.

Claim: for all u = z, we have

d(u, [Tz]a) < a max [d(u, z), d(z, [Tz]a)} . (2)

Since xn — u as n — to, there exists a positive integer m, such that

d(xn,u) < -d(u,z), for all n > m.

Given that xn+l G [Txn]a, we get r(a)d(xn, [Txn]a) < d(xn, [Txn]a) < d(xn,xn+i) <

< d(xn, u) + d(u, xn+i) < -d(u, z).

Thus, for n > m we have

< d(u, z) — d(u, xn) < d(xn, z). (3)

r(a)d(xn, [Txn]a) < d(xn, z) (4)

d(xn+i, [Tz]a) < H([Txn]a, [Tz]a) <

< a max < d(xn,z),d(xn, [Txn]a),d(z, [Tz]a),

d(xn, [Tz]q) + d(z, [Txn]q) d(xn, [Txn]a)d(z, [Tz]a) 2 & 1 + d(xn, z)

, O ■ 1/ rrp 1 N !( \\rri 1 N d[Xn, [i Xn]a)a[Z, [i Z]a) I , ,

+ ft min\\d(xn, [Txn]a), d(z, [Txn]a),- ---} . (5)

[ 1 + d(xn, z) J

From (5), we have

d(xn+i, [Tz]a) < a max^d(xn, z), d(xn,xn+i), d(z, [Tz]a),

d(xn[Tz]a) + d(z, xn+i) d(xn, [Txn]a)d(z, [Tz]a) ^ +

. p ■ i 1/ \\ Jf \\ d{xn,xn+i)d{z, [Tz]a)\\

+ ft min<^ d(xn,xn+i),d(z, xn+i),- ---> . (6)

[ 1 + d(xn, z) J

As n ^ <x> in (6), we obtain

d(u, [T z]a) < a max i^d(u, z), d(z, [T z]a), i , ^—+—+

+ ft min{0, d(u, z)} < a max {d(u, z), d(z, [Tz]a)}.

Now, to show that u E [Tu]a for some a E I-i, we consider the following two possible cases:

Case(i): 0 < a < i. Suppose that for all a E I-i, u = p, u E [Tu]a and p E [Tu]a such that d(p,u) < d(u, [Tu]a). Setting z = p in (2), we have

d(u, [Tp]a) < a max {d(u,p),d(p, [Tp]a)} . (7)

r(a)d(u, [Tu]a) < d(u, [Tu]a) < d(u,p)

d(p, [Tp]a) < H ([Tu]a, [Tp]a) < a max^d(u, p), d(u, [Tu]a),d(p, [Tp]a), d(u, [Tp]a) + dip, [Tu]a) d(u, [Tu]a)d(p, [Tp]a)

, a ¡Ai № 1 ^ M diu, [TuU)d(P, [TP]o) \\ s + ft min < d(u, [Tu]a),d(p, [Tu]a),- -:-} <

I 1 + d(u, p) J

^ \\u s ,, \\rTi i ^ d(u, [TP]») P)d(P, [TP\\<*) \\ ,

< a mаx<^d(u,p),d(p, [Tp\\a),-^-,-1 + d(u p)-J +

, o ■ f A! \\ n d(U, P)d(P, [Tp]a) 1 ^

/ iM \\ j( ] \\ P)+d(P, [TP]a) \\ . < amax< d(u,p),d(p, [1 p\\a),-^-f <

< a max {d(u,p),d(p, [Tp\\a)}. (8)

Assume that d(u,p) < d(p, [Tp\\a); then from (8) we have

d(p, [Tp]a) < ad(p, [Tp]a) < d(p, [Tp\\a) :

a contradiction. Hence, d(u,p) > d(p, [Tp\\a), and

d(p, [Tp\\a) < ad(u,p) < d(u,p). (9)

Therefore, (7) becomes d(u, [Tp\\a) < ad(u,p). Consequently,

d(u, [Tu]a) < d(u, [Tp\\a) + H([Tp\\a, [Tu]a) < < d(u, [Tp]a) +amax{d(u,p),d(p, [Tp]a)} < ad(u,p) + ad(u,p) = = 2ad(u,p) < d(u,p) < d(u, [Tu]a), (in view of assumption)

yields a contradiction. Therefore, u E [Tu]a for some a E I_1.

Case(ii): \\ < a < 1. For this, we shall prove that

H ([T z\\a, [Tu]a) < a max^d(u, z), d(z, [T z]a), d(u, [Tu]a), d(z, [Tu]a) + d(u, [Tz]a) d(z, [Tz]a)d(u, [Tu\\a)

a ) , +

+ B min!d(;, {T;U d(,.,„ pr*W, d{U-[1- f&H , (10)

[ - + d(u, z) J

holds for allz G X with z = u. Now, for each m G N, there exists vm G [Tz]a, such that

d(u, vm) < d(u, [Tz]a) + -—d(u, z).

Thus, we have

d(z, [Tz]a) < d(z, vm) < d(z, u) + d(u, vm) <

< d(z, u) + d(u, [Tz]a) +--d(z, u)

Using (2), we have

d(z, [Tz]a) < d(u, z) + a max {d(u, z), d(z, [Tz]a)} + -—. (11)

If d(z,u) > d(z, [Tz]a), then from (11) we get

d(z, [Tz]a) < d(u, z) + ad(u, z) +--d(u, z) = (1 + a) +--d(u, z),

from which we have 1

L1 + aJ Using r(a) = 1 — a, we get

d(z, [Tz]a) <

r(a)d(z, [Tz]a) = (1 — a)d(z, [Tz]a) <

z, [Tz]a) <

As m ^ <x> in (12), we have

r(a)d(z, [Tz]a) < d(u, z). On the other hand, if d(u, z) < d(z, [Tz]a), then (11) gives

d(z, [Tz]a) < d(u, z) + ad(z, [Tz]a) +--d(u, z),

which yields

(1 — a)d(z, [Tz]a) < (1 + m)d(u, z). (13)

As m ^ <x> in (13), we have

(1 — a)d(z, [Tz]a) < d(u, z).

This shows that r(a)d(z, [Tz]a) < d(u, z), which, by Definition 1, implies (10). Moreover, since xn+i = xn for all n E N, then u = xn+i. Therefore, setting xn = z in (10), we have

d(xn+i, [Tu]a) < H ([Txn]a, [Tu]a) <

< amaxi^d(xn,u),d(xn, [Txn]a),d(u, [Tu]a), d(xn, [Tu]a) + d(u, [Txn]a) d(xn, [Txn]a)d(u, [Tu]a)

a) , +

.,.),/ Vrri -I \\ 7/ rrn 1 N d[Xn, [i xn]a)d(u, [i u]a) I

+ k min d(xn, [Txn]a), d(u, [Txn]a),- -r-} <

{ 1 + d(xn,u) J

< a max u), d(xn, xn+i), d(u, [Tu]a),

d(xn, [Tu]a) + d(u, xn+i) d(xn, xn+i)d(u, [Tu]a)

, %n+i)l

I a ■ ) it \\ it \\ d(Xn ,Xn+l)d(U, [Tu]a) |

+ B min < d(xn,xn+i), d(u,xn+i),- ---} . (14)

[ 1 + d(xn,u) J

As n — <x> in (14), we have

d(u, [Tu]a) < a max i^d(u, [Tu]a), ( , ^——, 0^ < ad(u, [Tu]a). (15)

Since 1 — a > 0, (15) implies that d(u, [Tu]a) = 0, and, consequently, u G [Tu]a for some a G I-i. □

Example 2. Let X = {1, 2, 3}, {1}, {2}, {3} be crisp sets. Define d : X x X —> R as follows:

&0, if x = y

j8, if x = y and x,y G X \\ {2}

, if if x = yandx,y gX \\ {1}.

Define a fuzzy mapping T : X —y Ix as follows:

rift = 1,

T(1)(t) = T(3)(t)= r i, ift = 2,

(0, ift = 3,

Then, for a = 7, we have

& {1}, ifx = 2

[Tx]a = {tEX : T(x)(t) >a}

{3}, if x = 2.

Consider the following cases: Case I: For x EX \\ {2},

d(x, [Tx]a) = inf{d(x, y) : yE [Tx]a} = 0.

Hence, for x = y we have

r(a)d(x, [Tx]a) < d(x, y).

Case II: For x EX \\{1, 3},

d(x, [Tx]a) = inf {d(x, y) : yE [Tx]a} = —.

Therefore, for x = y we get

r(a)d(x, [Tx]a) = — < d(x, y).

Thus, from the two cases, it follows that for any ft > 0 there exists a = 7 E I-i, such that

r(a)d(x, [Tx]a) < d(x, y)

H([Tx]a, [Ty]a) < a y(x, y)+ft /\\(x, y).

Consequently, all the hypotheses of Theorem 1 are satisfied to obtain

Next, we present a local fuzzy fixed point theorem for Suzuki-type (a, ^)-weak contractions. First, recall that an open ball with radius r > 0, centered at x0 in a metric space X, is given by

Br(x0) = {x E X : d(x,x0) < r}.

Theorem 2. Let (X, d) be a complete metric space, T : Br (xo) ^ Ix be a Suzuki-type (a, ft)-weak contraction. Assume that for each x E X

there exists a E I-i such that [Tx]a is a nonempty closed and bounded subset of X and

d(xo, [Txo]a) < (l - a)r.

Then Fix(T) =

Proof. Let 0<r]<r be such that 0< (l—a)(l+—a) < , B*(x0) cBr(x0), and d(x0, [Tx0]a) < (l — a)rq. Then (l — a)rj — d(x0, [Tx0]a) > 0. Choose ^f = (l — a)rj — d(x0, [Tx0]a) > 0; then there exists xi E [Tx0]a, such that d(x0,xi) < d(x0, [Tx0]a) +7. Thus, d(x0,xi) < (l — a)rq. Now, for p = —j and xi E [Tx0]a, there exists x2 E [Txi]a, such that d(xi,x2) < < pH([Tx0]a, [Txi]a). Note that

r(a)d(x0, [Tx0]«) < r(a)d(x0,xi) < d(x0,xi),

d(xi,x2) < pH([Tx0]«, [Txi]a) = —=H ([Tx0]«, [Txi]a) <

< —a Y(x0,xi) + —a f\\(x0,xi) <

< —a max |<i(x0, xi),d(x0, [Tx0]a),d(xi, [Txi]a),

d(x0, [Txi]a) + d(xi, [Tx0]a) d(x0, [Tx0]a)d(xi, [Txi]a) 2 & l + d(x0,xi)

, P ■ [u № t W/ № 1 ^ d(x0, [Tx0]a[Txi]a) \\

+ — mm! d(x0, [Tx0]a),d(xi, [Tx0]a),-r~i~T/-\\-f <

y/a { l + d(x0 ,xi) J

< \\famax |d(x0, x\\), d(x0, xi),d(xi,x2) d(x0,x2) + d(xi,xi) d(x0, xi)d(xi,x2)

, P . fM , M , d(x0,xi)d(xi,x2) , ,

+—min < d(x0, xi), d(xi,xi),----— > <

a l + ( x0, xi )

. ^ fM , M , d(x0,xi) + d(xi,x2)! , < \\/ama^j d(x0, xi), d(xi,x2),---> +

+ —P= min {d(x0, xi), 0, d(xi,x2)} < —a max {d(x0,xi), d(xi,x2)} . (16) a

If d(x0,xi) < d(xi,x2), then (16) gives

d(xi,x2) < \\/oLd(xi,x2) < d(xi,x2) : a contradiction. Hence, d(x0,xi) > d(xi,x2) and

d(xi,x2) < \\[old(x0,xi) < ^fа(1 — a)rq. Note that by the assumption and the triangle inequality, we have

d(x0,x2) < d(x0,xi) + d(xi,x2) < (1 — a)ri + ^/a(1 — a)rj < -< rj.

Hence, X2 G Bv(x0). Continuing this process recursively, we generate a sequence {xra}raeN, such that

(a) xn G Bv(x0) for all n G N;

(b) xn G [Txn]a for each n G N;

(c) d(xn,xn+i) < (/a)n(1 — a)r] for all n G N.

From (c), it follows, by usual arguments, that {xra}raeN is a Cauchy sequence and converges to some u G Br(x0). From here, following the steps in the proof of Theorem 1, we conclude that Fix(T) = 0. □

Corollary 1. Let (X, d) be a complete metric space and T :X — CB (X) be a multi-valued mapping. Assume that there exists an a G I-i and some constants B > 0, such that for all x,y G X,

r(o)d(x,Tx) < d(x, y)

H (Tx,Ty) < a ^(x, y)+B /\\(x, y), where the mapping r : I-i — I+i is defined by

. , (1, if 0 < a < i

r(a) = < n 2

[1 — a, if i < a < 1.

Then Fix(T) = 0.

Proof. Let I-i = (0,1) and a G I-i be arbitrary. Consider a mapping w : X — I-i and a fuzzy mapping F : X — Ix defined by

^(x), if t G Tx

y 10, if t G Tx.

[Fx]a = {tGX : F(x)(t) > w(x)} = Tx.

Therefore,

d(x, y) > r(a)d(x,Tx) = r(a)d(x, [Fx]a).

Thus, Theorem 1 can be applied to finding u G X, such that u G Tu. □

In the following, we provide an example to highlight the generality of

Corollary 1.

Example 3. Let X = {a, b, c,p, q} and d : X x X — [0, to) be defined by

d(a, b) = d(a, c) = 9,

d(b, q) = d(c, p) = d(c, q) = d(b, c) = 14, d(a, p) = d(a, q) = 18, d(b,p) = 16,d(p, q) = 10, d(u,u) = 0 and d(u, v) = d(v ,u) for all u,v G X.

Define T : X — CB(X) by

{{c}, if u gX \\{a,b,c,p} {a, b}, if u GX \\{a,b,c, q} {a}, if u G X \\{p, q}.

Now, it is easy to verify that all the assumptions of Corollary 1 are

satisfied with a = -8 and B = 6. In fact,

r(a)d(p,Tp) = 9.85 < d(p, q)

H(Tp, Tq) = H ({a, b}, {c}) = 14 <a ^(p, q) + B f\\(p, q) <

< — max{10,14,14,14,18} + 6min{14,14,18} < 95. 13

Further, we see that there exists u = a G X, such that u G Tu. On the other hand, observe that if we set u = p and v = q, then

\\J(p, Q) = max <^d(p, q), d(p, Tp), d(q, T q),

d(p, Tq) + d(q, Tp) d(p, Tp)d(q, Tq) 1 2 , l + d(p, q) J

= max{l0, l4, l4, l4, l8} = l8,

H(Tp, Tq) = l4 > ll.08 = a ^(p, q).

Therefore, the main results in [8,9] cannot be applied in this case to find a fixed point of T.

Definition 2. A relation < is a total order on a set U if for all s,t,u E U, the following conditions hold:

(i) Reflexivity: s < s;

(ii) Antisymmetry: if s < t and t < s, then s = t;

(iii) Transitivity: if < and < u, then < u;

(iv) Comparability: for every s,t E U, either s <t or t < s.

Recall that if the set U satisfies only the axioms (z) — (Hi), then it is said to be partially ordered. In what follows, we shall call a totally ordered set a chain.

Lemma 1. (Kuratowski-Zorn&s Lemma ) If U is any nonempty partially ordered set in which every chain has an upper bound, U has a maximal element.

Definition 3. Let Xi and X2 be any two topological spaces and : Xi ^ X2 be continuous functions. A function H : Xi x [0, l] ^ X2, such that for any u E Xi H(u, 0) = n(u) and H(u, l) = u(u), is called a homotopy between n and u.

We shall denote the boundary of a set U by Bd(U).

Theorem 3. Let (X, d) be a complete metric space and U be an open subset of X. If M : U x [0, l] ^ Ix satisfies the following conditions:

(hi) uE M(u, t) for every u E Bd(U) and t E [0, l];

(h2) M(■, t) : U —> Ix is a Suzuki-type (a, ft)-weak contraction for all tG [0, 1];

(h3) there exist a nondecreasing function f : [0,1] — R, such that H (M(u, t),M (u, s)) < \\ f(t) — f(s)\\ for all s,t G [0,1] and each u G U;

(h4) M :U x [0,1] — Ix is closed and bounded; then M(■, 0) has a fixed point.

Proof. Assume that p is a fixed point of M(■, 0). Then, by condition (h1),

p G U. Consider the set /\\*, given by

/\\ = {(t ,u) G [0,1] xU : u G M (u, t)} .

Note that (0,p) G A*; hence f\\* = 0. Let a G I-i = (0,1) and define a partial order < on /\\* as follows:

(t ,u) < (s, v) if and only if t < s and d(u, v) < -[f(s) — f(t)].

Suppose n is a chain of [\\* and t* := sup{i : (t,u) G H}. Assume that {tn,un} is a sequence in H, such that (tn,un) < (tn+i,un+i) and tn — t* as n — to. Then, for all positive integers m, n(m > n),

d(um,un) -|f(tm) — f(tn)\\. (17)

As m, n — to in (17), we get d(um,un) — 0. Hence, {«ra}raeN is a Cauchy sequence and converges to some u* G X. Since M is closed and un G M(un, tn), therefore, u* G M(u*, t*). From condition (h1), u* G U. Thus, (t*,u*) G A*. Since H is a chain, hence (t,u) < (t*,u*) for all (t,u) G H. In other words, (t*,u*) is an upper bound of H. Thus, by Kuratowski-Zorn Lemma^* has a maximal element (t0,u0). Next, we show that t0 = 1. Suppose on the contrary: that t0 < 1. Let r = i-b \\ f(f) — f(f0)\\ > 0 with t G (t0,1], such that Br(u0) C U. Note that by condition (h3)

d(u0, M(u0, t)) < d(u0, M(u0, t0)) + H(M(u0, t0),M(u0, t)) <

<\\f(t) — f(to)\\ = < (1 — a)r.

Therefore, M(■,t) : Br(u0) ^ Ix satisfies all the assumptions of Theorem 2 for every t E [0,1]. Consequently, there exists u E Br(u0), such that u E M (u, t), which implies that (t ,u) E /\\ * for all t E [0,1]. Now,

d(uo,u) < |f(t) — f(to)|,

yields (t0,u0) < (t,u), which is a contradiction to the fact that (t0,u0) is maximal. Conversely, assume that M(■, 1) has a fixed point; then, using similar steps as above, one can show that M(■, 0) has a fixed point. □

Competing Interests. The authors declare that they have no competing interests.

Acknowledgments. The authors thank the editors and the anonymous reviewers for their valuable suggestions and comments, which greatly helped us in improving this paper.

References

[1] Azam, A., Arshad, M., and Vetro, P. On a pair of fuzzy ^-contractive mappings. Mathematical and Computer Modelling, 2010, vol. 52, no. 1-2, pp. 207-214.

[2] Azam, A., and Beg, I. Common fixed points of fuzzy maps. Mathematical and computer modelling, 2009, vol. 49, no. 7, pp. 1331-1336.

[3] Azam, A., Arshad, M., and Beg, I. Fixed points of fuzzy contractive and fuzzy locally contractive maps. Chaos, Solitons and Fractals, 2009, vol. 42, no. 5, pp. 2836-2841.

[4] Banach, S. Sur les operations dans les ensembles abstraits et leur application aux equations integrales. Fund. math, 1922, vol. 3, no. 1, pp. 133-181.

[5] Berinde, V. Approximating fixed points of weak contractions using the Picard iteration. In Nonlinear Analysis Forum, 2004, vol. 9, pp. 43-54.

[6] Butnariu, D. Fixed points for fuzzy mappings. Fuzzy sets and Systems, 1982, vol. 7, no. 2, pp. 191-207.

[7] Chatterjea, S.K. Fixed point theorems. C.R. Acad. Bulgare Sci., 1972, vol. 25, pp. 727-730.

[8] Ciric, L. B. Fixed points for generalized multi-valued contractions. Math. Vesnik, 1972, vol. 9, no. 24, pp. 265-272.

[9] Doric, D., Lazovic, R. Some Suzuki-type fixed point theorems for generalized multivalued mappings and applications. Fixed Point Theory and Applications, 2011, vol. 40, no. 1.

DOI: https://doi.org/10.1186/1687-1812-2011-40.

[10] Edelstein, M. On fixed and periodic points under contractive mappings. Journal of the London Mathematical Society, 1962, vol. 1, no. 1, pp. 74-79.

[11] Heilpern, S. Fuzzy mappings and fixed point theorem. Journal of Mathematical Analysis and Applications, 1981, vol. 83, no. 2, pp. 566-569.

[12] Humaira, M. S., and Tunc, C. Fuzzy fixed point results via rational type contractions involving control functions in complex-valued metric spaces. Appl. Math, 2018, vol. 12, no. 4, pp. 861-875.

[13] Kannan, R. Some results on fixed points II. The American Mathematical Monthly, 1969, vol. 76, no. 4, pp. 405-408.

[14] Rome, B. E., Sarwar, M., and Kumam, P. Fixed point theorems via a — q—fuzzy contraction. Axioms, 2019, 8(2), 69.

DOI: https://doi .org/10.3390/axioms8020069.

[15] Mohammed, S. S. On bilateral fuzzy contractions. Functional Analysis, Approximation and Computation, 2020, vol. 12, no. 1, pp. 1-13.

[16] Sarwar, M., and Kishore, G. N. V. Fuzzy fixed point results for contractive mapping with applications. Complexity, 2018.

[17] Sarwar, M., and Kumam, P. Common fixed point results for fuzzy mappings on complex-valued metric spaces with homotopy results. Symmetry, 2019, 11(1), 61. DOI: https://doi.org/10.3390/sym11010061.

[18] Sarwar, M., and Li, T. Fuzzy fixed point results and applications to ordinary fuzzy differential equations in complex valued metric spaces. Hacettepe Journal of Mathematics and Statistics, 2019, vol. 48, no. 6, pp. 1712-1728.

[19] Suzuki, T. A generalized Banach contraction principle that characterizes metric completeness. Proceedings of the American Mathematical Society, 2008, vol. 136, no. 5, pp. 1861-1869.

[20] Weiss, M. D. Fixed points, separation, and induced topologies for fuzzy sets. Journal of Mathematical Analysis and Applications, 1975, vol. 50, no. 1, pp. 142-150.

[21] Zadeh, L. A. Fuzzy sets. Information and control, 1965, vol. 8(3), pp. 338-353.

[22] Zamfirescu, T. Fixed point theorems in metric spaces. Archiv der Mathematik, 1972, vol. 23(1), pp. 292-298.

Received July 19, 2019.

In revised form,, February 16, 2020.

Accepted February 19, 2020.

Published online April 14, 2020.

Mohammed Shehu Shagari

Department of Mathematics, COMSATS University Chak Shahzad, Islamabad, 44000, Pakistan; Department of Mathematics, Faculty of Physical Sciences Ahmadu Bello University, Nigeria E-mail: ssmohammed@abu.edu.ng

Akbar Azam

Department of Mathematics, COMSATS University Chak Shahzad, Islamabad, 44000, Pakistan E-mail: akbarazam@yahoo.com