A Relation-Theoretic Matkowski-Type Theorem in Symmetric Spaces

: In this paper, we present a ﬁxed-point theorem in R -complete regular symmetric spaces endowed with a locally T -transitive binary relation R using comparison functions that generalizes several relevant existing results. In addition, we adopt an example to substantiate the genuineness of our newly proved result. Finally, as an application of our main result, we establish the existence and uniqueness of a solution of a periodic boundary value problem.


Introduction
In 1922, one of the most pivotal results in analysis was proved by Banach [1] in his doctoral thesis, which asserts that every contraction mapping on a complete metric space admits a unique fixed point. This principle continues to inspire generations of researchers in metric fixed-point theory. Thus far, this classical result has been generalized and improved in various ways, and by now, there exists an extensive literature on and around this premier result. Over the last several decades, there have been many interesting generalizations of this classical result in various directions.
There exist several extensions of the Banach contraction principle to various spaces obtained by lightening the underlying involved metric conditions. In doing so, we are in receipt of several spaces, namely: rectangular metric spaces, generalized metric spaces, partial metric spaces, b-metric spaces, partial b-metric spaces, symmetric spaces, quasimetric spaces, quasi-partial metric spaces, and many more. In 1976, Cicchese [2] established the first ever fixed-point theorem in the framework of symmetric spaces. The idea of such spaces was coined by Wilson [3] by relaxing the triangle inequality from metric conditions. By now, there exists a considerable literature on fixed-point theory in symmetric spaces. For work of this kind, one can be referred to [4][5][6][7][8][9][10][11].
On the other hand, there have been various generalizations that were obtained by varying the class of contractions (e.g., see [12][13][14]). In 2004, Ran and Reurings [15] obtained a very useful generalization of the Banach fixed-point theorem in a partially ordered metric space by taking a relatively weaker contraction condition that is required to hold only on those elements that were comparable in the underlying ordering. In doing so, they were essentially motivated by Turinici [16]. This result was further generalized by Nieto and Rodríguez-López in [17,18] in 2005 and 2007, respectively. Subsequently, in 2015, Alam and Imdad [19] furnished a natural extension of the Banach contraction principle in a complete metric space endowed with a binary relation that generalizes all of the above-mentioned results [15,17,18].
The existing literature contains several results on nonlinear contractions, which were initiated by Browder [13] and were followed by similar works by Boyd and Wong [14] and Matkowski [20]. In 2014, Bessenyei and Páles [21] extended Matkowski's result in symmetric spaces, which required an additional regularity condition.
The intent of this paper is to prove a relation-theoretic version of a theorem due to Bessenyei and Páles [21]. In doing so, we are essentially motivated by [15,[17][18][19].

Preliminaries
In this section, we recall some definitions, propositions, and lemmas that will be utilized in our subsequent discussions. The following are taken from Wilson's paper [3] on symmetric space. Throughout the paper, R, R + , N, N 0 , and Q denote the sets of reals, nonnegative reals, natural numbers, whole numbers, and rational numbers respectively. Definition 1. Let X be a nonempty set and let d : X × X → R + be a mapping satisfying the following axioms: for each a, b ∈ X, Then, d is called symmetric on X and the pair (X, d) is a symmetric space.
In such spaces, the notions of convergent and Cauchy sequences are as usual.
The space is said to be complete if every Cauchy sequence converges. For an open ball centered at p with radius r, the notation B(p, r) is used. The diameter of B(p, r) is the supremum of distances taken over the pairs of points of the ball. The topology of such spaces is the topology induced by the open balls.
Because of the unavailability of the triangle inequality, the following problems are obvious:

•
There is nothing to assure that limits are unique (thus, the space need not be Hausdorff); • A convergent sequence need not be a Cauchy sequence; • The mapping d(a, .) : X → R need not be continuous.

Definition 2.
Consider a symmetric space (X, d). A function ψ : R 2 + → R + is a triangle function [21] for d if the following hold: It has been shown in [21] that every symmetric space (X, d) admits a unique triangle function Φ d , which has the property that if ψ is any other triangle function for d, then Φ d ≤ ψ. Such a triangle function Φ d is called the basic triangle function.

Definition 3.
A symmetric space (X, d) is called a regular space if the basic triangle function with respect to the symmetric d is continuous at (0, 0).
Throughout this paper, we shall restrict our attention to regular spaces only. The utility of such spaces is enlightened by the next important result. Lemma 1 ([21]). The topology of a regular symmetric space is Hausdorff. A convergent sequence in a regular symmetric space has a unique limit and it has the Cauchy property. Moreover, a symmetric space (X, d) is regular if and only if lim r→0 sup p∈X diam B(p, r) = 0.

Definition 4. A monotone increasing function
These concepts are due to Matkowski [20]. The following is the main result of [21].
is a complete regular symmetric space and ϕ is a comparison function, then every ϕ-contraction on X has a unique fixed point.

Relation-Theoretic Notions and Related Results
Definition 5 ([22]). Let X be a nonempty set. A subset R of X × X is called a binary relation on X. For x, y ∈ X when (x, y) ∈ R, we say that x is related to y, or in other words, x relates to y under R. Sometimes, we write xRy instead of (x, y) ∈ R. If (x, y) / ∈ R, we say x is not related to y. Definition 6. Let R be a binary relation on a nonempty set X and x, y ∈ X. We say that x and y are R-comparative if either (x, y) ∈ R or (y, x) ∈ R. When x and y are R-comparative, we write it as [x, y] ∈ R. Proposition 1 ([19]). If (X, d) is a symmetric space, R is a binary relation on X, T is a selfmapping on X, and ϕ : R + → R + is a comparison function, then the following conditions are equivalent: The proof is simple and follows from symmetry of d.

Definition 7.
A binary relation R defined on a nonempty set X is called Definition 8 ([19]). Let X be a nonempty set endowed with a binary relation R. A sequence x n ⊂ X is called R-preserving if (x n , x n+1 ) ∈ R ∀n ∈ N.
. Let X be a nonempty set and let T be a self-mapping on X. A binary relation R on X is called T-closed if, for any x, y ∈ X, . Let X be a nonempty set and let T be a self-mapping on X. A binary relation R on X is said to be T-transitive if, for any x, y, z ∈ X, (Tx, Ty), (Ty, Tz) ∈ R ⇒ (Tx, Tz) ∈ R.
Definition 11 ([22]). Let X be a nonempty set endowed with a binary relation R and E ⊂ X. The restriction of R to E, denoted as R| E , is the set R ∩ E 2 . Indeed, R| E is a relation on E induced by R.

Definition 12 ([23]).
A binary relation R on a nonempty set X is called locally transitive if, for each R-preserving sequence x n ⊂ X with range E = {x n } n∈N 0 , the binary relation R| E is transitive.

Definition 13 ([23]
). Let X be a nonempty set and let T be a self-mapping on X. A binary relation R on X is called locally T-transitive if, for each (effectively) R-preserving sequence x n ⊂ T(X) with range E = {x n } n∈N 0 , the binary relation R| E is transitive.

Definition 14 ([24]
). Let X be a nonempty set and let R be a binary relation on X. For x, y ∈ X, a path of length k (where k is a natural number) in R from x to y is a finite sequence {x 0 , x 1 , x 2 , . . . , x k } ⊂ X satisfying the following conditions:

Definition 15 ([23]
). Let X be a nonempty set and let R be a binary relation on X. A subset E of X is called R-connected if, for each pair x, y ∈ X, there exists a path (in R) from x to y.
Definition 16 ([23]). Let X be a nonempty set and let R be a binary relation on X. A subset E of X is called R S -connected if, for each pair x, y ∈ X, there is a finite sequence {x 0 , x 1 , x 2 , . . . , x k } ⊂ X satisfying the following conditions: Now, we define the analogue of the notion of d-self-closedness in metric space due to [23] in the framework of symmetric spaces. Definition 17. Let (X, d) be a symmetric space. A binary relation R defined on X is called d-self-closed if, for any R-preserving sequence x n converging to x, there exists a subsequence x n k of x n with (x n k , x) ∈ R.
We will use the following notations in this paper:

Main Result
In an attempt to prove a relation-theoretic version of Matkowski's theorem [20] in symmetric spaces, we prove the following. Theorem 2. Let (X, d) be a regular symmetric space, R a binary relation on X, and T a selfmapping on X. Suppose that the following conditions hold: Then, T has a fixed point.
Moreover, if (f) F(T) is R S -connected, then T has a unique fixed point.
Proof. As X(T, R) is nonempty, let x 0 be such that (x 0 , Tx 0 ) ∈ R. If Tx 0 = x 0 , then we are done. Suppose that Tx 0 = x 0 . Since (x 0 , Tx 0 ) ∈ R and R is T-closed, we obtain by induction that (T n x 0 , T n+1 x 0 ) ∈ R ∀n ∈ N.
Construct the sequence x n of Picard iterates with initial point x 0 , i.e., x n = T n (x 0 ). So, (x n , x n+1 ) ∈ R ∀n ∈ N 0 , i.e., the sequence is R-preserving. As R is locally T-transitive, we have (x n , x m ) ∈ R ∀m > n. Observe that the sequence d(x n , x n+k ) tends to zero for all fixed k ∈ N; Now, we are going to prove that {x n } is a Cauchy sequence. Let > 0 be any positive number. As (X, d) is regular, the basic triangle function Φ d is continuous at (0,0). So, there exists a neighborhood U of the origin such that Φ d (u, v) < ∀(u, v) ∈ U. In other words, ∃δ > 0 such that Φ d (u, v) < ∀u, v : 0 ≤ u, v ≤ δ. We take δ < . As ϕ is a comparison function, ϕ n (t) → 0 ∀t > 0; so there exists N ∈ N such that ϕ N ( ) < δ. Set S = T N . We can see that Define n k : d(x n , T k Sx n ) < δ ∀n ≥ n k and set M= max{n 0 , n 1 , . . . , n N }. Thus we see that T k S maps V ∩ B(x M , ) into itself. In particular, each iteration of S maps V ∩ B(x M , ) into itself. Now, if n > M is any arbitrarily given natural number, i.e., n = Nk + p where k ∈ N 0 and 0 ≤ p < N, then T n S = T Nk+p S = T p S k+1 , and hence, Therefore, T n S(x M ) ∈ B(x M , ) ∀n > M, i.e., x M+N+k ∈ B(x M , ) ∀k ∈ N. As the space is regular, diam(x M , ) → 0 when → 0, and from this, we conclude that the sequence {x n } is a Cauchy sequence. The completeness of the space (X, d) gives some element x ∈ X such that x n → x. Now, if T is R-continuous, then T(x n ) → T(x), i.e., x n+1 → T(x). As the space is regular, we conclude that T(x) = x, as the limit is unique in regular spaces. So, the limit of the sequence constructed above is a fixed point. If R is d-self-closed, then there is a subsequence x n k of x n such that [x n k , x] ∈ R ∀k ∈ N 0 . So, x is a fixed point. To show that T has a unique fixed point, let y be any other fixed point of T. Now, F(T) is R S -connected and x, y ∈ F(T); so, there is a finite sequence of elements {z 0 , z 1 , z 2 , . . . , z k } ⊂ X satisfying the following conditions: Therefore, d(T n x, T n y) = d(x, y) = 0, i.e., x = y. Hence, the fixed point of T is unique. Now, we consider some special cases, where our result deduces some well-known results from the existing literature.
(1) Under the universal relation R = X 2 , our theorem deduces the result by M. Bessenyei and Z. Pàles [21]. Clearly, under the universal relation, the hypotheses of our result hold trivially. (2) As every metric space is a symmetric space, the result of Alam and Imdad [19], which is a generalization of the classical Banach contraction principle, is yielded immediately.
In this case, we take ϕ(t) = ct as the comparison function, where c ∈ [0, 1) is such that d(Tx, Ty) ≤ c d(x, y) ∀xRy. (3) The fixed-point result of Ran and Reurings [15] can be obtained from our result, as every partially ordered complete metric space is automatically a symmetric space, and the associated relation to the partial order satisfies all the hypotheses of our result if we take the comparison function ϕ as the same as the earlier case (2), i.e., ϕ(t) = ct.
(4) The result of Neito and Rodríguez-López becomes a corollary of our result because of the same reasons as the earlier one. Notice that the d-self-closedness property is a generalization of the ICU (increasing-convergence upper bound) property.
Finally, we produce an illustrative example to substantiate the utility of our result, which does not satisfy the hypotheses of the existing results [1,15,[17][18][19]21,23], but satisfies the hypotheses of our result, and hence has a fixed point. Example 1. Let X = R and d(x, y) = (x − y) 2 ; then, (X, d) is a complete regular symmetric space. Consider the binary relation We define a mapping T : X → X as follows: We see that the self-mapping T on X is not a ϕ-contraction on the whole space X for any comparison function ϕ. So, the result of Bessenyei and Páles [21] does not apply here. However, when we consider the elements x, y such that (x, y) ∈ R, then T is a ϕ-contraction on R for ϕ(t) = t 2 , and all the other hypotheses of our result hold. In addition, we see that the fixed-point results of [1,15,[17][18][19]23] do not apply here, as the space is not a metric space.

Application to Ordinary Differential Equations
In this section, we study the existence and uniqueness of a first-order periodic boundary value problem as an application of our main fixed-point theorem.
Consider the first-order periodic boundary value problem x(t) − y(t) 2 .
We define a relation R on X as Now, we give the following definition, which will be useful in the subsequent theorem.

Definition 18.
A function z is said to be a lower solution of (1) if Theorem 3. Consider problem (1) with g : I × R → R, a continuous function, and suppose that there exists some k > 0 such that for s 1 , s 2 in R with s 1 ≥ s 2 , where ϕ is a comparison function. Then, the existence of a lower solution for (1) guarantees the existence of a unique solution of (1). (1) can be rewritten as

Proof. Problem
This problem is equivalent to the integral equation Here, it is apparent that a fixed point of T is, in fact, a solution of the above problem (1). Now, we will show that the hypotheses in Theorem 2 are satisfied. To prove that the relation R is T-closed, take x, y ∈ X such that xRy, i.e., As y(t) ≥ x(t), from the hypothesis, we obtain g t, x(t) + kx(t) ≤ g t, y(t) + ky(t) ∀t ∈ [0, λ].
Using the above inequality (2), we get x 0 (t)e kt ≤ Hence, x 0 (t) ≤ Thus, the existence of some element x 0 ∈ X such that x 0 RTx 0 is ensured. To show that R is d-self-closed, let x n be an R-preserving Cauchy sequence converging to x ∈ X. As x n is R-preserving, we have x 0 (t) ≤ x 1 (t) ≤ x 2 (t) ≤ · · · ≤ x n (t) ≤ x n+1 (t) ≤ · · · ≤ x(t) ∀t ∈ [0, λ], thereby yielding x n Rx ∀n ∈ N. Therefore, R is d-self-closed.
The remaining hypotheses of Theorem 2 also hold and are easy to check. Hence, T possesses a fixed point in X.