Relation-Theoretic Fixed Point Theorems for Generalized Weakly Contractive Mappings

: In recent times there have been two prominent trends in metric ﬁxed point theory. One is the use of weak contractive inequalities and the other is the use of binary relations. Combining the two trends, in this paper we establish a relation-theoretic ﬁxed point result for a mapping which is deﬁned on a metric space with an arbitrary binary relation and satisﬁes a weak contractive inequality for any pair of points whenever the pair of points is related by a given relation. The uniqueness is obtained by assuming some extra conditions. The metric space is assumed to be R -complete. We use R -continuity of functions. The property of local T-transitivity of the relation R is used in the main theorem. There is an illustrative example. An existing ﬁxed point result is generalized through the present work. We use a method in the proof of our main theorem which is a blending of relation-theoretic and analytic approaches.


Introduction and Preliminaries
The present paper is a relation-theoretic fixed point result of a self-mapping on a metric space which is assumed to satisfy a weak contraction inequality. It is a combination of two recent trends of metric fixed point theory. One is the use of weak contractive inequalities to establish fixed point results while the other is to relax the set of pairs of points for which the contraction inequality is defined for the purpose of obtaining a fixed point result of the corresponding mapping. In the following we briefly dwell upon these two trends.
Weak contractions are intermediate concepts between a contraction mapping and a non-expansive mapping. They were first introduced by Alber et al. [1] in the context of Hilbert spaces and was subsequently defined in metric spaces by Rhoades [2]. In the same work, a weak contraction mapping principle was established. Afterwards, the idea was generalized and extended in several ways by which a large amount of literature on the fixed point theory of weakly contractive mappings was produced. Some instance of these works are [3][4][5][6][7][8][9][10][11][12][13].
On the other hand, it was realized that in several proofs of many important results of fixed point theory, it is not necessary to assume the contraction condition for arbitrary pairs of points chosen from the space itself. There can be suitable restrictions on the choice of such pairs. This perception had its expression in the fixed point theory on partially ordered metric space [14][15][16][17][18][19]. Also, there are several recent papers in fixed point theory on metric spaces with a graph, [20][21][22] for instance, where the contractive conditions are generally assumed for pairs of points which are adjacent vertices of the graph. Viewing graphs and partial orders as relations, attempts have been recently made to define weaker relations on metric spaces which will serve the same purpose. Focus on this line of research has been on binary relations on metric spaces which are weaker than graphs, etc.. Some works in this line are [23][24][25][26][27].
In the present context we prove a fixed point result for a self-mapping satisfying a weak contraction inequality for choices of points which are related by some relation having specific properties both in relation to the metric spaces and the function defined on it. We illustrate our result with an example. Our result is an extension of previous results existing in literature [4,28].
In the extension, the following definitions will be utilized. We denote N as the set of natural numbers. R as the set of real numbers. Definition 1. [25] Let X be any nonempty set and R ⊆ X × X be some binary relation defined on X. Then two elements u and v, of X, are R− comparative if either (u, v) ∈ R or (v, u) ∈ R. This is denoted as [u, v] ∈ R. Definition 2. [29,30] A binary relation R defined on any nonempty set X is said to be equivalence if R is reflexive, symmetric and transitive.

Definition 3.
[29] Let X be any nonempty set with a binary relation R on X.
(1) The inverse or dual relation of R, denoted by R −1 , is defined by (2) The reflexive closure of R, denoted by R # , is defined as R # := R u , where u = {(u, u) : u ∈ X}.
(3) The symmetric closure of R, denoted by R s , is defined to be R s := R R −1 .
Remark 1. R # is the smallest relation on X, containing R, which is reflexive. R s is the smallest symmetric relation on X containing R.
Definition 4. R-preserving sequence: [31] Let X be any nonempty set with a binary relation R on it. We call the sequence {u n } ⊂ X to be R-preserving if (u n , u n+1 ) ∈ R for all n ∈ N 0 . Definition 5. d-self closed relation: [25] Let (X, d) be a metric space with a binary relation R on it. R is d-self closed if for any R-preserving sequence {u n } with u n −→ u, there exists a subsequence {u n k } of {u n } with [u n k , u] ∈ R for every k ∈ N 0 . Definition 6. T-closed relation: [25] Let X be any nonempty set with the self-map T : X → X. A binary relation R on X is called T-closed if for any u, v ∈ X, (u, v) ∈ R =⇒ (Tu, Tv) ∈ R.
Definition 7. R-directed set: [32] Let X be a nonempty set with a binary relation R on it. The set E ⊆ X is called R-directed if for each u, v ∈ E, there exists w ∈ X such that (u, w) ∈ R and (v, w) ∈ R. Definition 8. Path of length k: [33] Let X be a nonempty set with a binary relation R on it. For u, v ∈ X, a path of length k ( where k is a natural number) in R from u to v is a finite sequence {z 0 , z 1 , z 2 , ..., z k } ⊂ X with the following conditions: (i) z 0 = u and z k = v, A path of length k contains k + 1 elements of X which may be repeated.
Definition 9. Transitive relation: [26] A nonempty subset R of X × X is transitive if (u, w) ∈ R for all u, v, w ∈ X such that (u, v), (v, w) ∈ R.
Definition 10. T-Transitive relation: [26] Given a map T : X → X, we say a relation R on X to be T -transitive if (Tu, Tw) ∈ R for all u, v, w ∈ X such that (Tu, Tv), (Tv, Tw) ∈ R.
Definition 11. Locally Transitive relation: [26] A binary relation R on a nonempty set X is said to be locally transitive if for every (effectively) R-preserving sequence {u n } ⊆ X (with range E := {u n : n ∈ N}), the relation R| E is transitive.

Definition 12.
Locally T-Transitive relation: [26] Let X be a nonempty set with a self-mapping T on it.
A binary relation R on X is said to be locally T-transitive if for every (effectively) R-preserving sequence {u n } ⊆ T(X) (with range E := {u n : n ∈ N}), the binary relation R| E is transitive.
Definition 13. T-symmetric relation: Given a self mapping T : X → X, we say that a binary relation R on X is T -symmetrie if (Tu, Tv) ∈ R for all u, v ∈ X such that (Tv, Tu) ∈ R.
Definition 14. R-complete: [24] Let (X, d) be a metric space with a binary relation R on it. We say that (X, d) is R-complete if every R-preserving Cauchy sequence in X is convergent.
Definition 15. R-closed: [24] Let (X, d) be a metric space and R a binary relation on it. The set E ⊆ X is said to be R-closed if every R-preserving convergent sequence in E is convergent to a point of E.
Definition 16. R-continuous function: [24] Let (X, d) be a metric space with a binary relation R on it and u ∈ X. A mapping f : X → X is called R-continuous at the point u if for every R-preserving sequence {u n }, Definition 17. R-connected set: [26] Let X be a non empty set with a binary relation In this paper if T : X → X is a self-mapping and R is a binary relation on it, we use the notations:

Main Results
Theorem 1. Let (X, d) be a metric space with some binary relation R on it and T : X → X be a self map, with the following conditions satisfied.
, d(y, Ty)}, then T has a fixed point.
From the contractive condition in Equation (1) we have, for all n ∈ N 0 where

Case-I :
If ρ n 0 < ρ n 0 +1 , for some n 0 ∈ N, then from Equation (3) we have In this case x n 0 +1 is a fixed point of T and we arrive at the conclusion of the theorem.

Case-II :
If ρ n ≥ ρ n+1 ∀n ∈ N, then {ρ n } is a sequence of non-negative real numbers which is monotone decreasing.
The sequence {ρ n } is bounded below by 0 and, as it is monotone decreasing, it must be convergent. Let lim n→∞ ρ n = ρ (say). In this case, from (3) Taking limit n → ∞ and using continuity of the functions φ and ψ, Then, by a property of φ,we have ρ = 0, that is, lim We will now establish that {x n } is a Cauchy sequence. Otherwise, there exists some > 0 for which we can find two sequences of positive integers {m k } and {n k } such that for every positive integer k, Taking the limit as k −→ ∞ in the above and using the result proved above that lim Taking the limit k −→ ∞ in the above, Taking the limit k −→ ∞ in the above inequalities, we obtain ≤ lim k→∞ d(x m k , x n k +1 ) + 0.
Thus lim Also Taking the limit as k −→ ∞ in the above inequalities, we obtain Taking the limit as k −→ ∞ in the above inequalities , we have Again, Taking the limit as k −→ ∞ in the above inequalities and using (6), we have Taking the limit as k −→ ∞ in the above inequalities and using (7), we have Thus lim k→∞ d(x m k +1 , x n k +1 ) = .
Now, as {x n } is R preserving sequence and by the local T-transitivity of R, we have (x i , x j ) ∈ R ∀ i < j. Thus we can say that [x m k , x n k ] ∈ R for any k ∈ N. Therefore, from (1) ψ(d(x m k +1 , x n k +1 )) ≤ ψ(m 1 (x m k , x n k )) − φ(m 2 (x m k , x n k )).
Hence {x n } is R-preserving Cauchy sequence in X. Thus {x n } −→ x for some x ∈ X, as X is R-complete.

Subcase-II(A):
If T is R-continuous, then using the fact {x n } −→ x in both sides of x n+1 = Tx n , we have x = Tx.
Thus x is a fixed point.

Subcase-II(B):
If T is not R-continuous, then by a condition of the theorem, R is d-sel f closed.
Then for the R-preserving sequence {x n }, where lim n→∞ x n = x, ∃ a subsequence {x n k } of {x n } such that [x n k , x] ∈ R for all k ∈ N.
Taking limit as k → ∞ in both sides of (9) we have, or, Thus also in this subcase x is a fixed point.

Note:
(i) In Theorem 1, the generalized weak contraction appearing through inequality (1) has been considered in [4] for the case of complete metric spaces without any ordering. Here we prove the existence of fixed points of these contractions with some variations in a metric space, having a binary relation R. Later in the last section we describe an example which shows that the result of [4], is effectively generalized here.
(ii) In Subcase II-B of the proof we use Definition 11 of d-self closed relation given by Alam et al.
in [25]. This is actually weaker than that given by Turinici [31] for the partial order case. If we consider the definition of Turinici [31], then there is no need to consider subsequences.

Remark 2.
Fixed point results for weakly contractive mappings have more scopes of applications than the corresponding results for contractive mappings in a natural way. In the above theorem, results are obtained under a further relaxation by correlating the weak contraction condition with a binary relation. This widens the scope of applications to a large extent.
For uniqueness of the fixed point we need some further conditions.

Theorem 2.
In addition to the conditions stated in Theorem 1, if any of the following conditions hold (vii.a) T(X) is R-connected and if x 0 is a fixed point of T, then x 0 ∈ X(T, R).
Then the fixed point is unique.
Proof. Let (vii.a) hold. Let x, y be two fixed points of T.
We construct a sequence x n as follows Since y is a fixed point of T, y ∈ X(T, R) or (y, Ty) = (y, y) ∈ R.
This proves the uniqueness of the fixed point.

Now let (vii.b) hold.
Let us assume there be two fixed points x, y of T.
Thus the fixed point is unique in this case also. Now let (vii.c) hold. Let x, y be two fixed points of T.
Thus in this case also, we find that the fixed point would be unique.
Hence our result is proved.

Remark 3.
In Theorem 2 some additional conditions ensure the uniqueness of the fixed point. This creates the additional feature that whatever be the admissible initial choice of x 0 , the algorithm developed here converges to unique fixed point. This creates an operational advantage in possible applications of the theorem.
Further we note that the above theorems combine two trends of research in metric fixed point theory, one in which contractive conditions are weakened in a particular way by using weak inequalities and the other in which restricting the relevant pairs of points with respect to which contractive conditions are to be satisfied through the introduction of appropriate relations. In both cases, the aim is to retain the fixed point property of the relevant function under relaxed conditions. Some instances of works in the former line are [3][4][5][9][10][11] while references [23][24][25][26] are some works obtained in the latter line of research. Particularly, the present work directly extends the result of [4].
Also, the given relation R is Transitive and hence locally T-transitive.
Next we note that if {u n } is a R-preserving sequence converging to u, then it is eventually constant sequence. So, for a R-preserving sequence, {u n }, if u n −→ u as n −→ ∞, then ∃ k ∈ N such that u n = u, ∀ n ≥ k. Thus, as n −→ ∞ , Tu n = u n − 1 −→ u − 1, if u = 0, and Tu n −→ 0, if u = 0. Thus for any R-preserving sequence,{u n }, u n −→ u ⇒ Tu n −→ Tu. Hence T is R-continuous.
Let ψ : [0, ∞) −→ [0, ∞) be as follows: , according to v = Tu or v = Tu respectively ) and (ii) If u = 0 and v > u, then , according to u = Tv or u = Tv respectively) and Case-II: u = v. Then condition(vi) of Theorem 1 is trivially satisfied. Therefore, from the above two cases, we have Here we see that 0 is a fixed point of T.
Further we see that T(X) is R-connected and R is T-transitive . Hence the condition (vii.b) of Theorem 2 holds in this case.
This shows that the inequality in Equation (1) does not hold for an arbitrary pair of points. Thus the result of [4] is not applicable to the present example.

Conclusions
The present work is in line with research exploring fixed point properties of various types of contractions under restrictions imposed by relations introduced in the original space on which the function is defined. We consider a type of weakly contractive mapping for our purpose which belongs to a class of mappings meant for weakening the corresponding contraction condition. Due to their less restrictive nature, the fixed point theorems obtained in metric space using relations have more scopes of applications. More precisely, they fit better for modeling the practical real world situations by the less requirements they have in their statements. Some applications are in works like [32,34]. Applications and real-world illustrations on similar lines can be explored for our present result and also for similar other results in future works. Applications may be attempted in areas of differential equations, integral equations, global optimizations, equilibrium problems, etc.. Higher dimensional illustrations of the present theorem can also be attempted.
We have already noted that the main result is an actual generalization of a previous result in [4]. The methodology here is comparable with several other similar results dealing with contractive inequalities noted in [3][4][5][6][7][8][9][10]. There are possibilities of applying relation-theoretic methods to other weakly contractive mappings. These problems can be taken up for future research.