Recent researches in the development of metric space to V-fuzzy metric spaces encouraged us to write this paper. In this paper, we have defined a new contraction called V-ψ-fuzzy contraction in a V-fuzzy metric space (V, M, *) endowed with a graph. Here, we have extended the Banach Contraction Principle on V-fuzzy metric spaces in association with graph. Also, we have explained the characteristic of Graph as of partial ordering, which provides a way to find fixed point for n-tuples of a V-fuzzy metric space and an important application in the field of computer science.
A sequence of results in metric spaces make the fixed point theory very special and basic area of the researches in mathematics. Zadeh [8] was the first to introduce the fuzzy sets. Kramosil and Michlek [5] employed this concept in the metric spaces to introduce fuzzy metric spaces. George and Veeramani [1] modified the concept of fuzzy metric spaces given by [5]. Gregori and Sapna [9] extended the Banach fixed point theorem to fuzzy contractive mappings on complete fuzzy metric spaces. Jachymski [7] introduced the language of graph theory in replacement of partial orderings of metric spaces in terms of graph in a united way. Recently, Shukla [15] introduced the idea of G-fuzzy contraction in fuzzy metric spaces, which is a generalization of results of Jachymski [7] and Gregori and Sapena [9]. The fixed point results endowed with graph has been extended by many authors in literature [3, 16–20]. Graph theory is also applicable for cyclic mapping [10] in different spaces.
In this paper, we have introduced a new contraction as V-ψ-fuzzy contraction using the concept of altering distance function, and we have generalized the result of Shukla [15] in V-fuzzy metric spaces. Some basic definitions and results are given below:
Definition 1.1. (Gregori and Sapena [9]). Let (K, M, *) be a fuzzy metric space. A mapping S : K → K is called t-uniformly continuous if for each r ∈ (0, 1) there exists s ∈ (0, 1) such that for each x, y ∈ K and t > 0,
Remark 1.1. The t-uniform continuity of S implies S is continuous for the topology deduced from M. For uniform structure in a fuzzy metric space, refer to [9].
Definition 1.2. (Gregori and Sapena [9]). Let (K, M, *) be a fuzzy metric space. A mapping S : K → K is called a fuzzy contractive mapping if there exists λ ∈ (0, 1) such that
(λ is called the contractive constant of S.)
Definition 1.3. ([4]) A binary operation * : [0.1] × [0, 1] → [0, 1] is called continuous t-norms if * satisfies following conditions:
* is commutative and associative;
* is continuous;
a * 1 = a, ∀ a ∈ [0, 1];
a * b ≤ c * d whenever a ≤ c and b ≤ d, for all a, b, c, d ∈ [0, 1].
Recently, Gupta and Kanwar [11] stamped the move of different generalizations to n-tuples as defined below:
Definition 1.4. ([11]) Let X be a non-empty set. A 3-tuple (X, V, *) is said to be a V-fuzzy metric space (denoted by VF-space), where * is a continuous t-norm and V is a fuzzy set on Xn × (0, ∞) satisfying the following conditions for each t, s > 0,
V (x, x, x, …, x, y, t) >0, for all x, y ∈ X with x ≠ y;
V (x1, x1, x1, …, x1, x2, t) ≥ V (x1, x2, x3, …, xn, t) ,
for all x1, x2, x3, …, xn ∈ X with x2 ≠ x3 ≠ ⋯ ≠ xn;
V (x1, x2, x3, …, xn, t) =1 if x1 = x2 = x3 = … = xn;
V (x1, x2, x3, …, xn, t) = V (p (x1, x2, x3, … xn) , t), where p is a permutation function;
V (x1, x2, x3, …, xn-1, t + s) ≥ V (x1, x2, x3, …, xn-1, l, t) * V (l, l, l, …, l, xn, s);
;
V (x1, x2, x3, …, xn) : (0, ∞) → [0, 1] is continuous.
Basic concepts about the graph are similar to those in [7].
Let (K, V, *) be a V-fuzzy metric space. Let Δ denote the diagonal of the cartesian product K × K. Consider a directed graph G such that the set V (G) of its vertices coincides with K, and the set E (G) of its edges contains all loops, i.e., E (G) ⊆ Δ. We assume that G has no parallel edges and the pair (V (G) , E (G)) is representing the graph G.
By G-1 we denote the conversion of a graph G, i.e., the graph obtained from G by reversing the direction of edges. Thus we have
The letter denotes the undirected graph obtained from G by ignoring the direction of edges. Actually, it will be more convenient for us to treat G as a directed graph for which the set of its edges is symmetric. Under this convention,
If x and y are vertices in a graph G, then a path in G from x to y of length l is a sequence of l + 1 vertices such that x0 = x, xl = y and (xi-1, xi) ∈ E (G) for i = 1, …, l. A graph G is called connected if there is a path between any two vertices of G. A graph G is weakly connected if is connected. For a graph G such that E (G) is symmetric and x is a vertex in G, the subgraph Gx consisting of all edges and vertices which are contained in some path beginning at x is called the component of G containing x. In this case V (Gx) = [x] G, where [x] G is the equivalence class of a relation R defined on V (G) by the rule yRz if there is a path in G from y to z. Clearly, Gx is connected. We recall here the result of Shukla [15], which gave us the idea to construct the problem in a V-fuzzy metric space.
Definition 1.5. ([15]). Let (K, M, *) be a fuzzy metric space and G be a graph. Two, sequences (xn) n∈N and (yn) n∈N in K are said to be Cauchy equivalent if each of them is a Cauchy sequence and for all t > 0.
Definition 1.6. ([15]). Let (K, M, *) be a fuzzy metric space and G be a graph. The mapping S : K → K is said to be a G-fuzzy contraction if the following conditions hold:
(GF1) ((x, y) ∈ E (G) ⇒ (Sx, Sy) ∈ E (G)), for all x, y ∈ K i.e, S is edge-preserving;
(GF2) for all x, y ∈ K and t > 0, there exists λ ∈ (0, 1) such that
where λ is called the contractive constant of S.
An obvious consequence for the symmetry of M (· , · , t) and (1.2) is the following remark.
Remark 1.2. ([15]) If S is a G-fuzzy contraction then it is both a G-1-fuzzy contraction and a -fuzzy contraction.
Theorem 1.1. [[15]] Let (K, M, *) be a complete fuzzy metric space and G be a directed graph and let the 4-tuple (K, M, * , G) have the property (PS). Let S : K → K be a G-fuzzy contraction and KS = {x ∈ K : (x, Sx) ∈ E (G)}, then the following statements hold:
if x ∈ XT, then is a Picard operator;
if XT≠ ∅ and G is weakly connected, then T is a Picard operator;
FixT≠ ∅ if and only if XT≠ ∅;
If T ⊆ E (G), then T is a weakly Picard operator.
Main results
Now, we are ready to present our main result. First, we introduce the following definitions and lemma.
Definition 2.1. Let (K, V, *) be a V-fuzzy metric space and G be a graph. Two sequences (xn) n∈N and (yn) n∈N in K are said to be Cauchy equivalent if each of them is a Cauchy sequence and for all t > 0.
Definition 2.2. Let (K, V, *) be a V-fuzzy metric space and G be a graph. The mapping S : K → K is said to be V-ψ-fuzzy contraction if the following conditions hold:
For all x, y ∈ K
(GF1) (x, y) ∈ E (G) ⇒ (Sx, Sy) ∈ E (G), i.e., S is edge-preserving.
(GF2) For all t > 0,
where ψ : [0, 1] → [0, 1] is such that ψ is continuous, ψ (0) =0 and ψn (an) →0, whenever an → 0 as n→ ∞.
Now we start with lemma below:
Lemma 2.1.Let S : K → K be a V-ψ-fuzzy contraction, then given x ∈ K and,
for all t > 0 .
Proof. Let x ∈ K and . Then there exists a path in from x to y, where x = x0, y = xm and (xi, xi-1) ∈ E (G) for i = 1, 2, …, m.
By Remark 1.2, S is a -ψ-fuzzy contraction.
Therefore by (GF1) we have,
and by (GF2), for i = 1, 2, …, m and t > 0, we have
Again, V (Sx, Sy, Sy, …, Sy, φ (t)) >0 implies V (Sx, Sy, Sy, …, Sy, φ (t/c)) >0,
therefore
this implies,
Continuing like this, we have
Now we can find a strictly decreasing sequence (an) n∈N of positive number such that and then using (2.1), we have
Letting n→ ∞, φ (t/cn)→ ∞ and by the definition, ψn (ri) →0 as ri → 0, gives
It proves Snx and Sny are equivalent.□
Next we prove the convergence towards fixed point for iterative sequences in a V-fuzzy metric space with connected graph.
Theorem 2.1.The following statements are equivalent:
G is weakly connected.
For any -ψ-fuzzy contraction S : K → K and for given x, y ∈ K, the sequences (Snx) n∈N and (Sny) n∈N are Cauchy equivalent.
For any -ψ-contraction S : K → K, card(FixS) ≤1.
Proof. (i)⇒(ii).
Let G is weakly connected and S be a V-ψ-fuzzy contraction.
Also, we render for weakly connected graph that and therefore for all p ∈ N.
By Lemma 2.1, (Snx) n∈N is a Cauchy sequence. Therefore, , for all t > 0.
Also, y ∈ K implies . As (Snx) n∈N is a Cauchy sequence, therefore (Sny) n∈N is also a Cauchy sequence.
Hence the sequences (Snx) n∈N and (Sny) n∈N are Cauchy equivalent.
(ii)⇒(iii)
Let x, y ∈ FixS, where S is V-ψ-fuzzy contraction. Since x, y ∈ Fix (Sn), V (x, y, …, y, t) = V (Snx, Sny, …, Sny, t). So as from (ii) (Snx) n∈N and (Sny) n∈N are Cauchy equivalent.
Therefore x = y.
(iii)⇒(i) Suppose (iii) holds, but G is not weakly connected.
i.e. is disconnected. Let u ∈ K, then the sets and are non-empty.
Let and define a mapping S : K → K by
Clearly, FixS = {u, v}.
Now, we will prove that S is a V-ψ-fuzzy contraction.
If (x, y) ∈ E (G) then , so either or .
In both the cases, we have Sx = Sy and so (Sx, Sy) ∈ E (G) (since E (G) ⊇ Δ) and GF1 is satisfied. Also, V (Sx, Sy, …, Sy, φ (t)) =1 for all t > 0, so GF2 is satisfied.
Hence S is V-ψ-fuzzy contraction and card(FixS) =2 > 1.
A contradiction prove that V is weakly connected.
Corollary 2.1.Let (K, V, *) be a complete V-fuzzy metric space. Then the following statements are equivalent
V is weakly connected;
for any V-fuzzy contraction S : K → K, there exists x* ∈ K such that for all x ∈ K.
Proposition 2.1. [[15]] Assume that S : K → K is V-ψ-fuzzy contraction such that for some x0 ∈ K, . Let be the component of containing x0. Then is S-invariant and is a -ψ-fuzzy contraction. Moreover, it if , then the sequences (Snx) n∈N and (Sny) n∈N are Cauchy equivalent.
Theorem 2.2.Let (K, V, *) be a complete V-fuzzy metric space and G be a directed graph and let the 4-tuple (K, V, * , G) have the property (PS). Let S : K → K be a V-ψ-fuzzy contraction and KS = {x ∈ K : (x, Sx) ∈ E (G)}, then the following statements hold:
If x ∈ KS, then S|[x]G is a Picard operator;
If KS ≠ φ and G is weakly connected, then S is a Picard operator;
FixS ≠ φ If and only if KS ≠ φ;
If S ⊆ E (G), then S is a weakly Picard operator.
Proof. Let x ∈ KS. By definition of KS, (x, Sx) ∈ E (G) and so we have .□
By Proposition 2.1, we have and also S is V-ψ-fuzzy contraction.
Consider then (Snx) n∈N and (Sny) n∈N are Cauchy equivalent and so (Snx) n∈N is a Cauchy sequence. By completeness of K, sequence (Snx) must be convergent. So, there exists x* ∈ K such that
Since (x, Sx) ∈ E (G) implies and so by (GF1) we have,
Now, by property (PS), there exists a subsequence (Smnx) n∈N such that (Smnx, x*) ∈ E (G) for all n ∈ N.
Hence (x, Sx, Sx2, …, Smnx, x*) is a path in G and so in . Therefore, . Using (GF2) we have,
for all t > 0. Let ϵ > 0 be given, then by virtue of property of φ, we can find t > 0 such that φ (ct) < ϵ and using above inequality we have,
Letting n→ ∞ and using (2.2), we have
Thus, Sx* = x*, i.e. is a fixed point of S. Hence by Theorem 2.1 and definition of Picard operator, is a Picard operator.
To prove part (B), let us assume that KS ≠ φ and G is weakly connected then for all x ∈ K. Hence by the proof of part (A), S is a Picard operator.
To prove part (C), it is given that FixS ≠ φ then there must be some x ∈ FixS implies Sx = x. Also E (G) ⊇ Δ, so we have (x, Su) ∈ E (G). So x ∈ KS and FixS ⊂ KS ≠ φ. Then by part (A), is a Picard operator and therefore FixS ≠ φ.
To prove part (D), consider S ⊆ E (G), then (x, Sx) ∈ E (G) for all x ∈ K and so K = KS. From (A) it is obvious that S is a Picard operator and every Picard operator is a weakly Picard operator. Hence (D) is proved.
Corollary 2.2.Let (K, V, *) be a complete V-fuzzy metric space and ⪯ be a partial order defined an K. Let S : K → K be a non-decreasing mapping (i.e. x ⪯ y ⇒ Sx ⪯ Sy) such thatAssume that the following conditions holds:
If there is a non-decreasing sequence (xn) n∈N in K which converges to point x ∈ K and xn+1 ≼ xn for all n ∈ N, then xn ≼ x or xn ⪯ xn for all n ∈ N. If there exists x0 ∈ K such that x0 ≼ Sx0 or Sx0 ≼ x0, then S has a fixed point in K.
Proof. Let G be the graph defined by V (G) = K and
Since S is nondecreasing, therefore (GF1) holds, and by using the given contractive condition, (GF2) also holds. Thus, S is a V-ψ-fuzzy contraction. Also, xn ≼ x or x ≼ xn for all n ∈ N implies property (PS) is satisfied and the assumption (x0, Sx0) ∈ E (G) gives x0 ∈ KS. Therefore by statement(A) of Theorem 2.2, is a Picard operator and so has a fixed point in S|[x0].□
Now, we apply our result on Kirk’s [10] for cyclic contractions. Let X be a nonempty set, m be a positive integer, Ci, i = 1, 2, . . . . m are nonempty subsets of X and be a mapping then is said to be cyclic representation of B with respect to T if T (C1) ⊂ C2, T (C2) ⊂ C3, …, T (Cm) ⊂ C1 and then T is called a cyclic operator.
Corollary 2.3.Let (K, V, *) be a complete V-fuzzy metric space, m be a positive integer, Ci, i = 1, 2, . . . . m be closed subsets of X and be a cyclic representation of B with respect to S. Suppose Cm+i = Ci for all i ∈ N, x ∈ Ci, y ∈ Ci+1 and following contractive conditions satisfied:then S has unique fixed point in .
References
1.
A.George and P.Veeramani, On some results in fuzzy metric spaces, Fuzzy Sets and Systems64 (1994), 395–399.
2.
A.George and P.Veeramani, On some results of analysis for fuzzy metric spaces, Fuzzy Sets Systems90 (1997), 365–368.
3.
A.Petrusel and I.A.Rus, Fixed point theorems in orderede L-spaces, Proc Amer Math Soc134 (2006), 411–418. MR2176009(2006g:47097)
I.Kramosil and J.Michalek, Fuzzy metrics and statistical metric spaces, Kybernetika11 (1975), 336–344.
6.
J.J.Nieto and R.Redrigues-Lopez, Existence and uniqueness of fixed point in partially ordered sets and application to ordinary differential equations, Order22 (2005), 223–239.
7.
J.Jachymski, The contraction principal for mapping on a metric space with a graph, Proc Amer Math Soc136 (2008), 1359–1373.
8.
L.A.Zadeh, Fuzzy sets, Information and Control89 (1965), 338–353.
9.
V.Gregori and A.Sapena, On fixed-point theorems in fuzzy metric spaces, Fuzzy Sets and Systems125 (2002), 245–252.
10.
W.A.Kirk, P.S.Srinavasan and P.Veeramani, Fixed points for mappings satisfying cyclical contractive conditions, Fixed Point Theory4 (2003), 79–89.
11.
V.Gupta and A.Kanwar, V-Fuzzy metric spaces and related fixed point theorems, Fixed Point Theory and Applications51 (2016), 17. doi 10.1186/s13663-016-0536-1
12.
V.Gupta and A.Kanwar, Unified fixed point theorems on ∈-chainable fuzzy metric space and modified intuitionistic fuzzy metric space, Applied Mathematics and Information Sciences10(6) (2016), 2283–2291.
13.
V.Gupta, M.Verma and N.Gulati, Unique fixed point results for sequence of self mappings in generalized fuzzy metric spaces, Journal of Uncertain Systems10 (2016), 108–113.
14.
V.Gupta, R.K.Saini and A.Kanwar, Some common coupled fixed point results on modified intuitionistic fuzzy metric spaces, Procedia Computer Science79 (2016), 32–40.
15.
S.Shukla, Fixed point theorems of G-fuzzy contractions in fuzzy metric spaces endowed with a graph, Communication in Mathematics22 (2014), 1–12.
16.
S.Chauhan, W.Shatanawi, S.Kumar and S.Radennovic, Existence and uniqueness of fixed points in modified intuitionistic fuzzy metric spaces, The Journal of Nonlinear Science and Applications: JNSA7 (2014), 28–41.
17.
W.Shatanawi, Fixed and common fixed point theorems in frame of quasi metric spaces under contraction condition based on ultra distance functions, Nonlinear Analysis: Modelling and Control23(5) (2018), 724–748.
18.
W.Shatanawi, K.Abodayeh and A.Mukheimer, Some fixed point theorems in extended b-metric spaces, UPB Sci Bull, Series A80(4) (2018), 71–78.
19.
W.Shatanawi, Common fixed points for mappings under contractive conditions of (α, β, ψ)–admissibility type, Mathematics6 (2018), 261. doi: 10.3390/math6110261
20.
V.Gupta, W.Shatanawi and M.Verma, Existence of fixed points for J-ψ-fuzzy contractions in fuzzy metric spaces endowed with graph, Journal of Analysis (2018). https://doi.org/10.1007/s41478-018-0084-7