Next Article in Journal
Coefficient Bounds for Two Subclasses of Analytic Functions Involving a Limacon-Shaped Domain
Previous Article in Journal
MxPL: A Programming Language for Matrix-Related Operations
Previous Article in Special Issue
Fixed Point Theory in Extended Parametric Sb-Metric Spaces and Its Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Graphical Symmetric Spaces, Fixed-Point Theorems and the Existence of Positive Solution of Fractional Periodic Boundary Value Problems †

1
Department of Mathematics, Shri Vaishnav Institute of Science, Shri Vaishnav Vidyapeeth Vishwavidyalaya, Gram Baroli Sanwer Road, Indore 453111, India
2
Department of Mathematical Sciences and Computing, Walter Sisulu University, Mthatha 5117, South Africa
*
Author to whom correspondence should be addressed.
Dedicatedto the memory of Professor Hans-Peter A. Künzi. Professor Hans-Peter A. Künzi passed away in August 2020. Some of the ideas of this paper were discussed with him.
Symmetry 2024, 16(2), 182; https://doi.org/10.3390/sym16020182
Submission received: 6 December 2023 / Revised: 19 December 2023 / Accepted: 25 December 2023 / Published: 3 February 2024
(This article belongs to the Special Issue Symmetry in Fixed Point Theory and Applications)

Abstract

:
The rationale of this work is to introduce the notion of graphical symmetric spaces and some fixed-point results are proved for H - ( ϑ , φ ) -contractions in this setting. The idea of graphical symmetric spaces generalizes various spaces equipped with a function which characterizes the distance between two points of the space. Some topological properties of graphical symmetric spaces are discussed. Some fixed-point results for the mappings defined on graphical symmetric spaces are proved. The fixed-point results of this paper generalize and extend several fixed-point results in this new setting. The main results of this paper are applied to obtain the positive solutions of fractional periodic boundary value problems.

1. Introduction

In 1905, Fréchet [1] introduced the study of spaces equipped with a distance function by assigning a nonnegative value to each pair of arbitrary objects of a nonempty set. Hausdorff later named these spaces as metric spaces. In such spaces, the distance between two objects is characterized by a distance function or metric function which, apart from nonnegativity, also possess the identity of indiscernibles, the properties of symmetry and the triangular inequality. There are several generalizations of metric spaces and most of it are obtained by weakening or extending the above properties (see, for example, [2,3,4,5,6,7] and the references therein). In view of fixed-point theorems, the triangular inequality associated with metric function plays a crucial role when proving an iterative sequence to be convergent; thus, several authors have tried to find spaces in which the triangular inequality was introduced in a weaker or extended form in such a way that the existence of a fixed point still remained demonstrable. In symmetric spaces (see [5,7]) the triangular inequality of a metric function is dropped and to establish various properties and existence of a fixed point of contractive type mappings, various replacements of the triangular inequality are used.
Inspired by Shukla and Künzi [8] and Shukla et al. [6], in this paper we introduce a graphical structure on the set associated with the space and introduce the notion of graphical symmetric spaces. This notion extends, generalizes and improves several known generalized forms of metric spaces. Some fixed-point results in this new setting are also proved which generalize and extend several fixed-point results. For illustration and justification of concepts and claims, several examples are provided. An application of our main results in finding the positive solution of fractional periodic boundary value problems involving Caputo’s fractional derivatives is presented.

2. Graphical Symmetric Spaces

Some basic notions and concepts are stated which are needed throughout the paper, some of them were initiated by Jachmyski [9], Shukla et al. [6] and Shukla and Künzi [8].
Let Υ be a nonempty set and consider a directed graph Q , without parallel edges, such that the set V ( Q ) of its vertices coincides with Υ , and the set of its edges E ( Q ) Υ × Υ . Then, we say that Υ is endowed with the graph Q = ( V ( Q ) , E ( Q ) ) . The conversion of the graph Q is denoted by Q 1 , and it is defined by:
V ( Q 1 ) = V ( Q )   and   E ( Q 1 ) = { ( , υ ) Υ × Υ :   ( υ , ) E ( Q ) } .
By Q ˜ , we denote the undirected graph obtained from Q by including all the edges of Q 1 . More precisely, we define V ( Q ˜ ) = V ( Q )   and   E ( Q ˜ ) = E ( Q ) E ( Q 1 ) . If ♭ and υ are vertices in a graph Q , then a path in Q from ♭ to υ of length l N is a sequence { i } i = 0 l of l + 1 vertices such that 0 = , l = υ and ( i 1 , i ) E ( Q ) for i = 1 , 2 , , l . A graph Q is called connected if there is a path between any two vertices. Moreover, two vertices ♭ and υ of a directed graph are connected if there is a path from ♭ to υ and a path from υ to .   Q is weakly connected if, when treating all of its edges as being undirected, there is a path from every vertex to every other vertex. More precisely, Q is weakly connected if Q ˜ is connected.
For a subgraph H of Q , we define a set C H by:
C H = { ( , υ ) Υ × Υ :   there   is   a   directed   path   from   to   υ   in   H } .
Consider the relation P = { ( , υ ) Υ × Υ :   ( , υ ) C H } . Then, P is called the relation of connectedness, and by the definition of a path in H , it is clear that this relation is a transitive relation. A sequence { n } in Υ is said to be H -termwise-connected if ( n , n + 1 ) C H for all n N . A vertex Υ is called an isolated point of graph H if neither ( , υ ) nor ( υ , ) is in C H for all υ Υ . For a subset A of Υ , we denote Δ A = { ( a , a ) :   a A } .
Throughout this paper, we assume that the graphs under consideration are directed, with nonempty sets of vertices and edges.
Definition 1. 
Let Υ be a nonempty set endowed with a graph Q and σ Q : Υ × Υ R be a function satisfying the following conditions: for all , υ Υ with ( , υ ) C Q
(GS1) 
σ Q ( , υ ) 0 ;
(GS2) 
σ Q ( , υ ) = 0 implies = υ ;
(GS3) 
σ Q ( , υ ) = σ Q ( υ , ) .
Then, the mapping σ Q is called a graphical symmetry on Υ , and the pair ( Υ , σ Q ) is called a graphical symmetric space.
Remark 1. 
The following are examples of some standard spaces which are a particular type of graphical symmetric spaces:
  • If Υ is a nonempty set endowed with a graph Q such that ( Υ , d Q ) is a graphical metric space (see, [6]), then ( Υ , σ Q ) is a graphical symmetric space with the same graph Q , where σ Q ( , υ ) = d Q ( , υ ) for all , υ Υ . Hence, every graphical metric space (thus every metric space) is also a graphical symmetric space.
  • Every b-metric space (see, [3]) ( Υ , b ) is a graphical symmetric space ( Υ , σ Q ) with the graph Q such that E ( Q ) = Υ × Υ , where σ Q ( , υ ) = b ( , υ ) for all , υ Υ . Similarly, one can see that every functional weighted metric space (see, [10]) is a graphical symmetric space.
  • Every metriclike space ( Υ , σ ) (see, [2]) is a graphical symmetric space ( Υ , σ Q ) with the graph Q such that E ( Q ) = Υ × Υ , where σ Q ( , υ ) = σ ( , υ ) for all , υ Υ . Hence, every partial metric space (see, [4]) is a graphical symmetric space.
  • Every symmetric space ( Υ , d ) (see, [5,7]) is a graphical symmetric space ( Υ , σ Q ) with the graph Q such that E ( Q ) = Υ × Υ , where σ Q ( , υ ) = d ( , υ ) for all , υ Υ .
Example 1. 
Let Υ = R be endowed with the graph Q , where E ( Q ) = { ( , υ ) Υ × Υ :   = n π + υ , n Z } . Then, the function σ Q :   Υ × Υ R is a graphical symmetry on Υ , where σ Q ( , υ ) = e υ + sin ( υ ) for all , υ Υ . Hence, ( Υ , σ Q ) is a graphical symmetric space. Note that ( Υ , σ Q ) does not fall under any class of spaces mentioned above.
Example 2. 
Let Υ = [ 0 , ) , Q > 0 = Q ( 0 , ) and Q > 0 c = Υ Q > 0 { 0 } . Let Υ be endowed with the graph Q , where E ( Q ) = { ( , υ ) Υ × Υ :   ( , υ ) Q > 0 × Q > 0 c Q > 0 c × Q > 0 } . Then, the function σ Q :   Υ × Υ R is a graphical symmetry on Υ , where
σ Q ( , υ ) = υ , i f ( , υ ) Q > 0 × Q > 0 c Q > 0 c × Q > 0 ; 2 + υ , otherwise
for all , υ Υ . Hence, ( Υ , σ Q ) is a graphical symmetric space. Note that ( Υ , σ Q ) does not fall under any class of spaces mentioned above.
We next define some topological concepts in graphical symmetric spaces. As the graphs associated with the space are not necessarily undirected, we define the topology and concerned concepts in two ways.
Let ( Υ , σ Q ) be a graphical symmetric space. For Υ and r > 0 , denote by B Q R ( , r ) the right ball with center ♭ and radius r, where
B Q R ( , r ) = { υ Υ :   σ Q ( , υ ) σ Q ( , ) < r , ( , υ ) C Q } .
Similarly, a left ball with center ♭ and radius r is denoted by B Q L ( , r ) , and
B Q L ( , r ) = { υ Υ :   σ Q ( , υ ) σ Q ( , ) < r , ( υ , ) C Q } .
Remark 2. 
It is obvious that if r 1 r 2 , then B Q R ( , r 1 ) B Q R ( , r 2 ) and B Q L ( , r 1 ) B Q L ( , r 2 ) .
Consider the following two collections of subsets of Υ :
τ R = U Υ :   for   all   U   there   exists   r > 0   such   that   B Q R ( , r ) U ;   and  
τ L = U Υ :   for   all   U   there   exists   r > 0   such   that   B Q L ( , r ) U .
Remark 3. 
We notice that a right ball (left ball) may be empty. In particular, if Υ is an isolated point of Q , then we have B Q R ( , r ) = B Q L ( , r ) = for all r > 0 . In this case, the inclusion of any ball in a set becomes a trivial case. On the other hand, if Δ Υ = { ( , ) :   Υ } E ( Q ) , then one can see that a right ball (left ball) is nonempty. In particular, if Δ Υ E ( Q ) , then each right ball (left ball) contains its center. Also, by using Remark 2, one can easily verify that the collections τ R and τ L are two topologies on Υ induced by σ Q and called R-topology and L-topology, respectively. The members of τ R and τ L are called R-open and L-open sets, respectively. A subset A Υ is called R-closed (respectively L-closed) if Υ A is R-open (respectively L-open).
Remark 4. 
In a graphical symmetric space, a right ball (left ball) is not necessarily an open set in the topology τ R ( τ L ), and this fact is independent of the graphical structure associated with the space, that is, it is true even if we take the associated graph as the universal graph. For instance, let f :   ( 0 , ) ( 0 , ) be a one-to-one function and Υ = { 1 , 0 , f ( r ) :   r ( 0 , ) } . Let Υ be endowed with the graph Q , where E ( Q ) = Υ × Υ (the universal graph). Define σ Q :   Υ × Υ R by:
σ Q ( , ) = 0 , σ Q ( , υ ) = σ Q ( υ , )   f o r   a l l   , υ Υ ; σ Q ( 1 , 0 ) = 1 2 , σ Q ( 0 , f ( r ) ) = r 2 ; σ Q ( 1 , f ( r ) ) = 1   f o r   a l l   r ( 0 , ) .
Then, it is easy to see that ( Υ , σ Q ) is a graphical symmetric space. Now, consider the right ball with center 1 and radius 1 , that is, B Q R ( 1 , 1 ) . Then, since | σ Q ( 1 , 0 ) σ Q ( 1 , 1 ) | = 1 2 < 1 and ( 1 , 0 ) C Q , 0 B Q R ( 1 , 1 ) . But note that for every r > 0 , we have f ( r ) B Q R ( 0 , r ) and f ( r ) B Q R ( 1 , 1 ) . Hence, B Q R ( 0 , r ) B Q R ( 1 , 1 ) for all r > 0 . This shows that B Q R ( 1 , 1 ) is not an R-open set. Similarly, it can be shown that B Q L ( 1 , 1 ) is not an L-open set.
Remark 5. 
In general, the topologies τ R and τ L are not 1 . For instance, let Υ = R be endowed with the graph Q , where E ( Q ) = Υ × Υ . Define σ Q :   Υ × Υ R by:
σ Q ( , υ ) = σ Q ( υ , )   for   all   , υ Υ ; σ Q ( 1 , 2 ) = σ Q ( 1 , 1 ) = 1 ; σ Q ( , υ ) = 2   in   all   other   cases .
Then, it is easy to see that ( Υ , σ Q ) is a graphical symmetric space. Note that the singleton { 2 } is neither R-closed nor L-closed, because 1 Υ { 2 } and 2 B Q R ( 1 , r ) ( 2 B Q L ( 1 , r ) ) for all r > 0 .
Theorem 1. 
Suppose at least one of the following conditions is satisfied:
(A) 
σ Q ( , ) = 0 for all Υ ;
(B) 
σ Q ( , υ ) σ Q ( υ , υ ) for all , υ Υ with υ .
Then, the topologies τ R and τ L are 1 .
Proof. 
Let Υ . We show that the singleton { } is R-closed, that is, the set Υ { } is an R-open set. If Υ { } = , we are done. If υ Υ { } , we show that there exists r > 0 such that B Q R ( υ , r ) , that is, B Q R ( υ , r ) Υ { } . We consider the following cases:
(I)
If ( υ , ) C Q , we have B Q R ( υ , r ) for all r > 0 .
(II)
If ( υ , ) C Q , by (GS1) and (GS2) we have σ Q ( υ , ) = σ Q ( , υ ) > 0 (since υ ). Let r = | σ Q ( , υ ) σ Q ( υ , υ ) | ; then, since at least one of the conditions (A) and (B) is satisfied, we must have r > 0 and B Q R ( υ , r ) Υ { } .
Therefore, in each case, we can find r > 0 such that B Q R ( υ , r ) Υ { } ; thus, Υ { } is R-open. Similarly, one can show that Υ { } is L-open. □
Remark 6. 
It is well known that the R-topology and L-topology induced by a graphical metric are not necessarily 2 (Hausdorff) (see, Theorem 3.4 of [8]). Also, every graphical metric space is a graphical symmetric space (with the same graph) and it is easy to see that the R-topology (L-topology) induced by a graphical metric is the same as the R-topology (L-topology) induced by the corresponding graphical symmetry. Hence, we can say that the topologies induced by a graphical symmetry are not necessarily 2 . Similarly, in a graphical symmetric space, the R-open and L-open balls with the same center and radius are not necessarily the same, as shown by Example 3.1 of [8].
Definition 2. 
Let ( Υ , σ Q ) be a graphical symmetric space and { n } be a sequence in Υ . Then, the sequence { n } is called σ Q -convergent to Υ , andis called a σ Q -limit of { n } if lim n σ Q ( n , ) = σ Q ( , ) . The sequence { n } is called τ R -convergent to Υ (or convergent towith respect to τ R , or simply R-convergent) if for every given ε > 0 , there exists n 0 N such that n B Q R ( , ε ) for all n > n 0 . The τ L -convergence (or convergence with respect to τ L , or L-convergence) is defined in a similar manner.
Remark 7. 
It is clear from the above definition that if a sequence is R-convergent to some point, then it is σ Q -convergent to the same point. The next example shows that the converse of this fact is not true; also, this example shows that a sequence in a graphical symmetric space may σ Q -converge ( τ R -converge) to more than one limit. A similar conclusion holds for L-convergence as well.
Example 3. 
Consider the graphical symmetric space ( Υ , σ Q ) , where Υ = R is endowed with the graph Q with E ( Q ) = { ( , υ ) Υ × Υ :   , υ Q 0 , υ } , and σ Q :   Υ × Υ R is given by:
σ Q ( , υ ) = 0 if = υ ; | υ | , if , υ Q 0 or Q 0 , υ Q 0 c ; 2 + υ , otherwise
for all , υ Υ , where Q 0 = Q R { 0 } , Q 0 c = R Q 0 { 0 } . Consider the sequence { n } in Υ , where n = 1 n for all n N . Then, it is clear that lim n σ Q ( n , ) = 0 for all R ; hence, the sequence { n } is σ Q -convergent to each R . On the other hand, if Q 0 c , then { n } is σ Q -convergent to ♭, but note that for every Q 0 c , we have n B Q R ( , ε ) for all ε > 0 and for all n N . Hence, we conclude that the sequence { n } is not R-convergent to for all Q 0 c . Also, if Q 0 , then it is easy to see that { n } is R-convergent to . Thus, a sequence in graphical symmetric spaces may be σ Q -convergent (R-convergent) to more than one limit.
Definition 3. 
Let ( Υ , σ Q ) be a graphical symmetric space and { n } be a sequence in Υ . Then, the sequence { n } is called σ Q -Cauchy if lim n σ Q ( n , m ) exists.
As there are three ways to define convergence in graphical symmetric spaces, we introduce three types of completeness of symmetric spaces:
Definition 4. 
Let ( Υ , σ Q ) be a graphical symmetric space and { n } be a sequence in Υ . Then, ( Υ , σ Q ) is called σ Q -complete if every σ Q -Cauchy sequence { n } in Υ is σ Q -convergent to Υ such that lim n σ Q ( n , m ) = lim n σ Q ( n , ) = σ Q ( , ) . The space ( Υ , σ Q ) is called R-complete (respectively, L-complete) if every σ Q -Cauchy sequence { n } in Υ is R-convergent (respectively, L-convergent) to Υ such that lim n σ Q ( n , m ) = σ Q ( , ) .
Remark 8. 
From the above definition and Remark 7 it is clear that R-completeness and L-completeness implies σ Q -completeness, but the converse of this fact is not necessarily true (see the next example). Hence, R-completeness and L-completeness are stronger notions than the notion of σ Q -completeness.
Example 4. 
Consider the graphical symmetric space ( Υ , σ Q ) , where Υ = [ 0 , ) is endowed with the graph Q with E ( Q ) = Δ Υ { ( , υ ) Υ × Υ :   0 < < υ } , and σ Q :   Υ × Υ R is given by σ Q ( , υ ) = + υ for all , υ Υ . Then, it is easy to see that ( Υ , σ Q ) is σ Q -complete. Consider the sequence { n } in Υ , where n = 1 n for all n N . Then, it is easy to see that this sequence is a σ Q -Cauchy sequence in Υ , but there exists no Υ for which we can find n 0 N such that n B Q R ( , ε ) for all n > n 0 or n B Q L ( , ε ) for all n > n 0 . Therefore, ( Υ , σ Q ) is neither R-complete nor L-complete.
Inspired by Shukla and Künzi [8] and Shukla et al. [11], we introduce the following versions of Cauchy sequences and completeness of graphical symmetric spaces.
Definition 5. 
Let ( Υ , σ Q ) be a graphical symmetric space and { n } be a sequence in Υ . Then, the sequence { n } is called 0- σ Q -Cauchy if lim n σ Q ( n , m ) = 0 . The space ( Υ , σ Q ) is called 0- σ Q -complete if every 0- σ Q -Cauchy sequence in Υ is σ Q -convergent to some Υ such that σ Q ( , ) = 0 . If H is a graph such that V ( H ) = Υ , then the space ( Υ , σ Q ) is called H - σ Q -complete if every H -termwise-connected σ Q -Cauchy sequence { n } in Υ is σ Q -convergent to Υ such that lim n σ Q ( n , m ) = lim n σ Q ( n , ) = σ Q ( , ) . While ( Υ , σ Q ) is called 0- H - σ Q -complete if every H -termwise-connected 0- σ Q -Cauchy sequence in Υ is σ Q -convergent to some Υ such that σ Q ( , ) = 0 .
It is not hard to see that every σ Q -complete space is 0- σ Q -complete and every 0- σ Q -complete space is 0- H - σ Q -complete. The following example shows that the converse assertions of these facts do not hold, so the above notions of completeness are even weaker than σ Q -completeness, and the notion of 0- H - σ Q -completeness is the most general among the other notions mentioned above.
Example 5.
(A) 
Consider Υ = [ 0 , ) Q endowed with the graph Q , where E ( Q ) = Υ × Υ . Then, the function σ Q :   Υ × Υ R is a graphical symmetry on Υ , where σ Q ( , υ ) = max { , υ } for all , υ Υ , and ( Υ , σ Q ) is 0- σ Q -complete but not σ Q -complete.
(B) 
Consider Υ = R endowed with graph Q and H , where E ( Q ) = E ( H ) = { ( , υ ) Q × Q :   0 υ < 1 } . Then, the function σ Q :   Υ × Υ R is a graphical symmetry on Υ , where
σ Q ( , υ ) = 1 + υ 2 , if υ and , υ Q ; max { , υ } , otherwise .
Note that ( Υ , σ Q ) is 0- H - σ Q -complete but not 0- σ Q -complete.
In the next section, we prove some fixed-point results for a class of mappings defined on graphical symmetric spaces.

3. Fixed Point Theorems

We first state some definitions which are needed in the sequel.
Let ϑ :   [ 0 , ) [ 0 , ) be a function and ( Υ , σ Q ) be a graphical symmetric space. In all subsequent discussions, we assume that H is a subgraph of Q with Δ D H C H , where D H = Υ :   ( , υ ) C H ˜   for   some   υ Υ . A subset A of Υ is called H -bounded with respect to ϑ , if ϑ ( σ Q ( , υ ) ) K for all , υ A with ( , υ ) C H , where K [ 0 , ) is a fixed number.
By Ψ , we denote the class of the functions ϑ :   [ 0 , ) [ 0 , ) such that for every sequence of nonnegative numbers { a n , m } n , m N , we have lim n , m ϑ ( a n , m ) = 0 if and only if lim n , m a n , m = 0 .
Definition 6. 
Let ( Υ , σ Q ) be a graphical symmetric space, :   Υ Υ a mapping and H be a subgraph of Q . Then, the mappingis called a graphical H - ( ϑ , φ ) -contraction if there exist ϑ , φ Ψ such that:
ϑ ( σ Q ( , υ ) ) ϑ ( σ Q ( , υ ) ) φ ( σ Q ( , υ ) ) ,   for   all   , υ Υ   with   ( , υ ) C H .
If 0 Υ , the iterative sequence { n } , where n = n 0 for all n N , is called the -Picard sequence with initial value 0 . The mapping is called H -edge-preserving if ( , υ ) E ( H ) implies ( , υ ) E ( H ) for all , υ Υ .
Theorem 2. 
Let ( Υ , σ Q ) be a 0- H - σ Q -complete graphical symmetric space and :   Υ Υ be an H -edge-preserving graphical H - ( ϑ , φ ) -contraction. Suppose that the following conditions hold:
(A) 
There exists 0 Υ such that the orbit of with initial value 0 , that is, O ( , 0 ) = { r 0 :   r = 0 , 1 , } , is H -bounded with respect to both ϑ and φ, and ( 0 , 0 ) C H ;
(B) 
If an H -termwise-connected -Picard sequence { z n } is σ Q -convergent to some point in Υ , then there exist a σ Q -limit z Υ of { z n } and n 0 N such that ( z n , z ) C H for all n > n 0 or ( z , z n ) C H for all n > n 0 .
Then, there exists u Υ such that the -Picard sequence { n } with initial value 0 Υ is H -termwise-connected and σ Q -convergent to r u with σ Q ( r u , r u ) = 0 for all r N { 0 } .
Proof. 
Let 0 Υ be such that O ( , 0 ) is H -bounded with respect to both ϑ and φ , and ( 0 , 0 ) C H . We first show that the ⊤-Picard sequence { n } with initial value 0 is a 0- σ Q -Cauchy sequence.
Since ( 0 , 0 ) C H , we have ( 0 , 1 ) C H . As ⊤ is H -edge-preserving, we have ( 0 , 1 ) C H , that is, ( 1 , 2 ) C H . A repetition of this argument leads us to the conclusion: ( n 1 , n ) C H for all n N . Since the relation of connectedness is a transitive relation, we have ( n , m ) C H for all n , m N with m > n . As ⊤ is a graphical H - ( ϑ , φ ) -contraction, for every m > n , we have
ϑ ( σ Q ( n + 1 , m + 1 ) ) = ϑ ( σ Q ( n , m ) ) ϑ ( σ Q ( n , m ) ) φ ( σ Q ( n , m ) ) .
This gives
ϑ ( σ Q ( n + 1 , m + 1 ) ) + φ ( σ Q ( n , m ) ) ϑ ( σ Q ( n , m ) ) .
Since the condition (A) is satisfied, for each n N , two sets of nonnegative numbers: { ϑ ( σ Q ( n 1 , m 1 ) ) :   n , m N , m > n } and { φ ( σ Q ( n 1 , m 1 ) ) :   n , m N , m > n } are bounded. Hence, for each n N , the following numbers must exist:
s n = sup m > n ϑ ( σ Q ( n , m ) ) ;   and   p n = sup m > n φ ( σ Q ( n , m ) ) .
As sup m > n ϑ ( σ Q ( n + 1 , m + 1 ) ) = sup m > n + 1 ϑ ( σ Q ( n + 1 , m ) ) , taking the supremum over m ( > n ) in (1), we obtain
sup m > n + 1 ϑ ( σ Q ( n + 1 , m ) ) + sup m > n φ ( σ Q ( n , m ) ) sup m > n ϑ ( σ Q ( n , m ) ) .
Hence, by definitions of s n and p n we obtain:
s n + 1 + p n s n   for   all   n N .
Since ϑ , φ Ψ , we have 0 s n , p n ; so, by (2), the sequence { s n } is a nonincreasing sequence of real numbers which is bounded below as well. Hence, it must be convergent to some nonnegative number s , that is,
lim n s n = s .
By (2), we have
0 p n s n s n + 1   for   all   n N ,
which, with the fact that lim n s n = s , gives
lim n p n = lim n sup m > n φ ( σ Q ( n , m ) ) = 0 .
As 0 φ ( σ Q ( n , m ) ) sup m > n φ ( σ Q ( n , m ) ) for all m > n , the above equality yields
lim n , m φ ( σ Q ( n , m ) ) = 0 .
As φ Ψ , the above equality implies that
lim n , m σ Q ( n , m ) = 0 .
Thus, we have showed that the ⊤-Picard sequence { n } with initial value 0 is an H -termwise-connected 0- σ Q -Cauchy sequence.
By the 0- H - σ Q -completeness of Υ , the sequence { n } is σ Q -convergent to some point in Υ , and by condition (B), there exist a σ Q -limit u Υ of { n } and n 0 N such that
lim n , m σ Q ( n , m ) = lim n σ Q ( n , u ) = σ Q ( u , u ) = 0
and ( n , u ) C H for all n > n 0 or ( u , n ) C H for all n > n 0 .
By mathematical induction, we show that { n } is σ Q -convergent to r u with σ Q ( r u , r u ) = 0 for all r N . Suppose that ( n , u ) C H for all n > n 0 (the proof for the second case is same). Then, as ⊤ is a graphical H - ( ϑ , φ ) -contraction, we have
ϑ ( σ Q ( n + 1 , u ) ) = ϑ ( σ Q ( n , u ) ) ϑ ( σ Q ( n , u ) ) φ ( σ Q ( n , u ) ) .
Since u is a σ Q -limit of the sequence { n } , we have lim n σ Q ( n , u ) = σ Q ( u , u ) = 0 , and since ϑ , φ Ψ , the real sequences { ϑ ( σ Q ( n , u ) ) } and { φ ( σ Q ( n , u ) ) } of nonnegative real numbers must converge to zero. Therefore, the above inequality yields
lim n σ Q ( n + 1 , u ) = 0 .
As ( n , u ) C H for all n > n 0 and ⊤ is H -edge-preserving, we have ( n + 1 , u ) = ( n , u ) C H for all n > n 0 , so u D H . Also, as Δ D H C H and ⊤ is a graphical H - ( ϑ , φ ) -contraction, we have:
ϑ ( σ Q ( u , u ) ) ϑ ( σ Q ( u , u ) ) φ ( σ Q ( u , u ) ) = ϑ ( 0 ) φ ( 0 ) = 0
and as ϑ Ψ , the above inequality implies that σ Q ( u , u ) = 0 .
As an induction hypothesis, suppose that { n } is σ Q -convergent to k u and σ Q ( k u , k u ) = 0 for some k N . Since ( n , u ) C H for all n > n 0 and ⊤ is H -edge-preserving, we must have ( n , k u ) C H for all n > n 0 + k . Hence, for n > n 0 + k , we have
ϑ ( σ Q ( n + 1 , k + 1 u ) ) = ϑ ( σ Q ( n , k u ) ) ϑ ( σ Q ( n , k u ) ) φ ( σ Q ( n , k u ) ) .
Since k u is a σ Q -limit of the sequence { n } , we have lim n σ Q ( n , k u ) = σ Q ( k u , k u ) = 0 , and using arguments similar to the previous case, the above inequality yields
lim n σ Q ( n + 1 , k + 1 u ) = 0 .
As ( n , k u ) C H for all n > n 0 + k and ⊤ is H -edge-preserving, k + 1 u D H . Also, as Δ D H C H and ⊤ is a graphical H - ( ϑ , φ ) -contraction, we have:
ϑ ( σ Q ( k + 1 u , k + 1 u ) ) ϑ ( σ Q ( k u , k u ) ) φ ( σ Q ( k u , k u ) ) = ϑ ( 0 ) φ ( 0 ) = 0
and as ϑ Ψ , the above inequality implies that σ Q ( k + 1 u , k + 1 u ) = 0 . This completes the induction.
Thus, the ⊤-Picard sequence { n } with initial value 0 Υ is H -termwise-connected and σ Q -convergent to r u with σ Q ( r u , r u ) = 0 for all r N { 0 } . □
Example 6. 
Consider the set Υ = R equipped with the graphs Q , H , where E ( Q ) = E ( H ) = { ( , υ ) Υ × Υ :   0 < υ 1 } , and consider the function σ Q :   Υ × Υ R defined by:
σ Q ( , υ ) = 0 , if = υ ; sin 1 ( υ ) , if υ ;
Then, σ Q is a graphical symmetry on Υ , and ( Υ , σ Q ) is a 0- H - σ Q -complete graphical symmetric space. Let :   Υ Υ be a mapping defined by = sin for all Υ { 0 } , 0 = 1 , and let ϑ , φ :   [ 0 , ) [ 0 , ) be two functions defined by ϑ ( t ) = t for all t [ 0 , ) and
φ ( t ) = t sin ( t ) , if t [ 0 , π / 2 ] ; t 2 , otherwise .
Then, it is easy to see that is a graphical H - ( ϑ , φ ) -contraction. Since is an increasing function on ( 0 , 1 ] , is H -edge-preserving. For any 0 ( 0 , 1 ] the orbit O ( , 0 ) is H -bounded with respect to both ϑ and φ and ( 0 , 0 ) C H . Also, if an H -termwise-connected -Picard sequence { n } is σ Q -convergent to some point in Υ , then there exist a limit z Υ of { n } and n 0 N such that ( z , n ) C H for all n > n 0 (for example, z = 1 with n 0 = 1 ). Hence, all the conditions of Theorem 2 are satisfied, but has no fixed point.
Remark 9. 
The above example shows that the conditions used in Theorem 2 are sufficient to ensure the convergence of a particular H -termwise-connected -Picard sequence, where is an H -edge-preserving graphical H - ( ϑ , φ ) -contraction. But the conditions of the above theorem are insufficient to ensure the existence of a fixed point of ⊤, so we introduce the following property:
Definition 7 
(Property (S)).  Let ( Υ , σ Q ) be a graphical symmetric space and :   Υ Υ be a mapping. Then, the quadruple ( Υ , σ Q , H , ) possesses the property (S) if:
whenever   an   H - termwise - connected   - Picard   sequence   { n }   has   two   σ Q - limits   u   and   v , where   u Υ , v ( Υ ) , then   u = v .
Remark 10. 
Note that in Example 6, all the conditions of Theorem 2 are satisfied, but the quadruple ( Υ , σ Q , H , ) does not possess the property (S), for example, consider the H -termwise-connected -Picard sequence { n } , where 0 = 1 ; then, this sequence has two σ Q -limits ( = 1 ) Υ and υ ( = sin 1 ) ( Υ ) , but sin 1 1 . This fact shows the significance of the property (S).
Theorem 3. 
Let ( Υ , σ Q ) be a 0- H - σ Q -complete graphical symmetric space and :   Υ Υ be an H -edge-preserving graphical H - ( ϑ , φ ) -contraction. Suppose that all the conditions of Theorem 2 are satisfied and the quadruple ( Υ , σ Q , H , ) possesses the property (S), then has a fixed point in Υ .
Proof. 
Theorem 2 shows that the ⊤-Picard sequence { n } with initial value 0 is σ Q -convergent to k u for all k N { 0 } . Also, by the proof of Theorem 2, it is clear that this ⊤-Picard sequence is H -termwise-connected. As 0 u = u Υ , u ( Υ ) and the quadruple ( Υ , σ Q , H , ) possesses the property (S), we must have u = u , that is, u is the fixed point of . □
Example 7. 
Consider the set Υ = R equipped with the graphs Q , H , where E ( Q ) = E ( H ) = [ 0 , 1 ] × [ 0 , 1 ] , and consider the function σ Q :   Υ × Υ R defined by:
σ Q ( , υ ) = 0 , if = υ [ 0 , 1 ] ; max { , υ } , if , υ [ 0 , 1 ] , υ ; υ , otherwise .
Then, σ Q is a graphical symmetry on Υ , and ( Υ , σ Q ) is a 0- H - σ Q -complete graphical symmetric space. Let :   Υ Υ be a mapping defined by = 0 for all [ 0 , 1 ] and = if R [ 0 , 1 ] . Consider the functions ϑ , φ :   [ 0 , ) [ 0 , ) defined by ϑ ( t ) = φ ( t ) = t for all t [ 0 , ) . Then, it is easy to see that is a graphical H - ( ϑ , φ ) -contraction which is H -edge-preserving. For 0 = 0 the orbit O ( , 0 ) is H -bounded with respect to both ϑ and φ, and ( 0 , 0 ) = ( 0 , 0 ) C H . Also, if an H -termwise-connected -Picard sequence { n } is σ Q -convergent to some point z Υ , then z = 0 and ( 0 , n ) C H for all n 1 . Hence, all the conditions of Theorem 2 are satisfied. Note that an H -termwise-connected -Picard sequence in Υ must be a constant sequence with every term of it equal to zero, and if it has a σ Q -limit u Υ , then we must have u = 0 . Hence, the quadruple ( Υ , σ Q , H , ) possesses the property (S). Hence, by Theorem 2, the mapping must have a fixed point in Υ . Note that all the points of the set ( , 0 ] ( 1 , ) are the fixed points of ⊤.
The above example shows that the conditions used in Theorem 3 can only ensure the existence of the fixed point of an H -edge-preserving graphical H - ( ϑ , φ ) -contraction, but not the uniqueness of the fixed point.
By F ( ) , we denote the set of all fixed points of a mapping :   Υ Υ . For any subgraph H of Q and for a fixed number k N , the set { z Υ :   ( z , k z ) C H } is denoted by k Υ H , and ( z , k z ) is called the corresponding edge of z k Υ H . A subset A of Υ is said to be H -connected if for every distinct , υ A , we have ( , υ ) C H or ( υ , ) C H .
Theorem 4. 
Let ( Υ , σ Q ) be a 0- H - σ Q -complete graphical symmetric space and :   Υ Υ be an H -edge-preserving graphical H - ( ϑ , φ ) -contraction. Suppose that all the conditions of Theorem 3 are satisfied, then has a fixed point. In addition, if k Υ H is H -connected and the diagonal Δ Υ = { ( , ) :   Υ } C H , then the fixed point of is unique.
Proof. 
The existence of the fixed point u of ⊤ follows from Theorem 3. For the uniqueness of the fixed point, on the contrary, suppose that there is a fixed point v Υ of ⊤ and u v . Hence, we have n u = u , n v = v for all n N . Since, ( u , k u ) = ( u , u ) , ( v , k v ) = ( v , v ) Δ Υ = { ( , ) :   Υ } C H , we have u , v k Υ H ; also, k Υ H is H -connected; hence, suppose that ( u , v ) C H (the proof for the case ( v , u ) C H is same), then, as ⊤ is a graphical H - ( ϑ , φ ) -contraction, we have
ϑ ( σ Q ( u , v ) ) = ϑ ( σ Q ( u , v ) ) ϑ ( σ Q ( u , v ) ) φ ( σ Q ( u , v ) ) .
The above inequality shows that φ ( σ Q ( u , v ) ) = 0 , and since φ Ψ , we must have σ Q ( u , v ) = 0 , that is, u = v . This contradiction shows that u Υ is the unique fixed point of ⊤. □
Remark 11. 
In the above theorem, for the uniqueness of the fixed point of , we assumed the H -connectedness of k Υ H and the inclusion of diagonal Δ Υ in the set C H . We point out that in Example 7, although the condition of the H -connectedness of k Υ H = [ 0 , 1 ] is satisfied, the inclusion Δ Υ C H does not hold, so the fixed point of is not unique.
Remark 12. 
Let ( Υ , σ Q ) be a graphical symmetric space. Then, consider the following property:
(GS4) 
lim n σ Q ( n , ) = σ Q ( , ) = 0 and lim n σ Q ( n , υ ) = σ Q ( υ , υ ) = 0 implies = υ .
Note that property (GS4) implies property (S); hence, if we replace condition (S) by (GS4), the conclusion of Theorem 3 and Theorem 4 remains true.
Example 8. 
Consider the set Υ = R equipped with the graphs Q , H , where E ( Q ) = E ( H ) = Δ Υ { ( , υ ) Υ × Υ :   0 υ < 1 } , and consider the function σ Q :   Υ × Υ R defined by
σ Q ( , υ ) = 0 , if = υ ; sin 1 ( max { , υ } ) , if υ ;
Then, σ Q is a graphical symmetry on Υ , and ( Υ , σ Q ) is a 0- H - σ Q -complete graphical symmetric space. Let :   Υ Υ be a mapping defined by = sin for all Υ and let ϑ , φ :   [ 0 , ) [ 0 , ) be two functions defined by ϑ ( t ) = t for all t R and
φ ( t ) = t sin ( t ) , if t [ 0 , π / 2 ] ; t 2 , otherwise .
Since is an increasing function on [ 0 , 1 ] , is H -preserving. For any 0 [ 0 , 1 ] , the orbit O ( , 0 ) is bounded with respect to both ϑ and φ, and ( 0 , 0 ) E ( H ) . Also, if an H -termwise-connected -Picard sequence { n } is σ Q -convergent to z Υ , then we must have z = 0 and ( n , z ) C H for all n 1 . Also, if an H -termwise-connected -Picard sequence { n } has two limits u and v where u Υ , v ( Υ ) , then u = v = 0 . Hence, all the conditions of Theorem 2 are satisfied, and the quadruple ( Υ , σ Q , H , ) possesses the property (S). Thus, the fixed point of exists. Here, k Υ H = [ 0 , 1 ] ; hence, k Υ H is H -connected, and Δ Υ C H . Thus, all the conditions of Theorem 4 are satisfied, hence, by Theorem 4, has a unique fixed point. Indeed, F ( ) = { 0 } .
A graphical metric space ( Υ , d Q ) is called H -complete (for details, see Shukla et al. [6]) if every H -termwise-connected sequence in Υ converges in Υ . In view of Remark 1 and the fact that Shukla et al. [6] assumed that Δ Υ was always contained in E ( H ) , we obtain the following corollary of Theorem 4.
Corollary 1. 
Let Υ be a nonempty set endowed with a graph Q such that ( Υ , d Q ) is an H -complete graphical metric space, and let :   Υ Υ be an H -edge-preserving mapping. Suppose that the following conditions hold:
(A) 
There exist ϑ , φ Ψ such that
ϑ ( d Q ( , υ ) ) ϑ ( d Q ( , υ ) ) φ ( d Q ( , υ ) ) ,   for   all   , υ Υ   with   ( , υ ) C H ;
(B) 
There exists 0 Υ such that max { ϑ ( d Q ( , υ ) ) , φ ( d Q ( , υ ) ) } K for all , υ O ( , 0 ) with ( , υ ) C H , where K [ 0 , ) is a fixed number and ( 0 , 0 ) C H ;
(C) 
If an H -termwise-connected -Picard sequence { z n } converges in Υ , then there exist a limit z Υ of { z n } and n 0 N such that ( z n , z ) C H for all n > n 0 or ( z , z n ) C H for all n > n 0 .
Then, there exists u Υ such that the -Picard sequence { n } with initial value 0 Υ is H -termwise-connected and convergent to r u for all r N { 0 } . In addition, if the quadruple ( Υ , σ Q , H , ) possesses the property (S) (in the sense of Shukla et al. [6]), then has a fixed point in Υ . Also, if k Υ H is H -connected, then the fixed point of is unique.
Corollary 2. 
Let Υ be a nonempty set endowed with a graph Q such that ( Υ , d Q ) is an H -complete graphical metric space, and let :   Υ Υ be an H -edge-preserving mapping. Suppose that the following conditions hold:
(A) 
There exist λ ( 0 , 1 ) such that
d Q ( , υ ) λ d Q ( , υ ) ,   for   all   , υ Υ   with   ( , υ ) C H .
(B) 
There exists 0 Υ such that ( 0 , 0 ) C H ;
(C) 
If an H -termwise-connected -Picard sequence { z n } converges in Υ , then there exist a limit z Υ of { z n } and n 0 N such that ( z n , z ) C H for all n > n 0 or ( z , z n ) C H for all n > n 0 .
Then, there exists u Υ such that the -Picard sequence { n } with initial value 0 Υ is H -termwise-connected and converges to r u for all r N { 0 } . In addition, if the quadruple ( Υ , σ Q , H , ) has the property (S) (in the sense of Shukla et al. [6]), then has a fixed point in Υ . Also, if k Υ H is H -connected, then the fixed point of is unique.
Proof. 
Consider the graphical symmetric space ( Υ , σ Q ) , where σ Q ( , υ ) = d Q ( , υ ) for all , υ Υ . Define ϑ , φ :   R [ 0 , ) by ϑ ( t ) = t , φ ( t ) = ( 1 λ ) t for all t [ 0 , ) . Then, the mapping ⊤ satisfies condition (A) of Theorem 1. Also, by following the process used by Shukla et al. [6], one can easily verify that for m > n , d Q ( n 0 , m 0 ) λ n 1 λ d Q ( 0 , 0 ) < 1 1 λ d Q ( 0 , 0 ) . Hence, there exists 0 Υ such that ( 0 , 0 ) C H , and
max { ϑ ( d Q ( , υ ) ) , φ ( d Q ( , υ ) ) } K = 1 1 λ d Q ( 0 , 0 )
for all , υ O ( , 0 ) with ( , υ ) C H . All other conditions of Corollary 1 are satisfied; hence, ⊤ has a unique fixed point in Υ . □
Remark 13. 
By following similar arguments as those used by Shukla et al. [6], one can easily derive the corresponding versions of the results of Ran and Reurings [12] and Edelstein [13] in graphical symmetric spaces. Here, we omit the proofs.
Corollary 3. 
Let ( Υ , b ) be a complete b-metric space (see, Czerwik [3]) and :   Υ Υ a mapping such that the following condition is satisfied: for some ϑ , φ Ψ
ϑ ( b ( , υ ) ) ϑ ( b ( , υ ) ) φ ( b ( , υ ) ) ,   for   all   , υ Υ .
If there exists 0 Υ such that max { ϑ ( b ( , υ ) ) , φ ( b ( , υ ) ) } K for all , υ O ( , 0 ) , where K [ 0 , ) is a fixed number, then has a unique fixed point in Υ .
Proof. 
Consider the graphical symmetric space ( Υ , σ Q ) , where σ Q ( , υ ) = b ( , υ ) for all , υ Υ and the universal graph Q where V ( Q ) = Υ , E ( Q ) = Υ × Υ . If we assume E ( H ) = E ( Q ) , then it is easy to see that all the conditions of Theorem 4 are satisfied, hence, by Theorem 4, ⊤ has a unique fixed point. □
Corollary 4. 
Let ( Υ , σ ) be a 0-σ-complete metric-like space (see, Shukla et al. [11]) and :   Υ Υ a mapping such that the following condition is satisfied: for some ϑ , φ Ψ
ϑ ( σ ( , υ ) ) ϑ ( σ ( , υ ) ) φ ( σ ( , υ ) ) ,   for   all   , υ Υ .
If there exists 0 Υ such that max { ϑ ( σ ( , υ ) ) , φ ( σ ( , υ ) ) } K for all , υ O ( , 0 ) , where K [ 0 , ) is a fixed number, then has a unique fixed point in Υ .
Proof. 
Consider the graphical symmetric space ( Υ , σ Q ) , where σ Q ( , υ ) = σ ( , υ ) for all , υ Υ and the universal graph Q where V ( Q ) = Υ , E ( Q ) = Υ × Υ . If we assume E ( H ) = E ( Q ) , then it is easy to see that all the conditions of Theorem 2 are satisfied, hence, by Theorem 2, the ⊤ Picard sequence { n } with initial value 0 Υ is convergent to r u and σ ( r u , r u ) = 0 for all r N { 0 } . Hence, by Remark 1 of Shukla et al. [11], we obtain r u = u for all r N ; thus, ⊤ has a fixed point in Υ . The uniqueness of the fixed point follows from the fact that the graph H is universal. □
Let ( Υ , d ) be a symmetric space (see Wilson [7], Alshehri et al. [5] and references therein). Since in symmetric spaces, the triangular inequality does not hold, as a replacement, the following property called (W3) is used at several places:
lim n d ( n , ) = 0   and   lim n d ( n , υ ) = 0   imply   = υ
We derive the following corollary in symmetric spaces.
Corollary 5. 
Let ( Υ , d ) be a symmetric space (see Alshehri et al. [5] and references therein) such that for every d-Cauchy sequence { n } in Υ , there exists υ Υ such that lim n d ( n , υ ) = 0 . Suppose :   Υ Υ is a mapping such that the following condition is satisfied: for some ϑ , φ Ψ
ϑ ( d ( , υ ) ) ϑ ( d ( , υ ) ) φ ( d ( , υ ) ) ,   for   all   , υ Υ .
If there exists 0 Υ such that max { ϑ ( d ( , υ ) ) , φ ( d ( , υ ) ) } K for all , υ O ( , 0 ) , where K [ 0 , ) is a fixed number, and suppose property (W3) is satisfied, then has a unique fixed point in Υ .
Proof. 
Consider the graphical symmetric space ( Υ , σ Q ) , where σ Q ( , υ ) = d ( , υ ) for all , υ Υ and the universal graph Q where V ( Q ) = Υ , E ( Q ) = Υ × Υ . Define the subgraph H of Q by: E ( H ) = Υ × Υ . Then, it is easy to see that conditions (A) and (B) of Theorem 2 are satisfied. Note that condition (W3) implies that condition (GS4) holds; hence, by Remark 12, the quadruple ( Υ , σ Q , H , ) possesses the property (S). Hence, by Theorem 3, the mapping ⊤ has a fixed point in Υ . The uniqueness of the fixed point follows from the fact that the graph H is universal. □
A point u Υ is called a periodic point of order k N of a mapping :   Υ Υ if k u = u . If ( Υ , σ Q ) is a graphical symmetric space, then each edge of the graph can be considered weighted, where the weight of edge ( , υ ) E ( Q ) is given by the quantity σ Q ( , υ ) . We prove the following periodic-point theorem:
Theorem 5. 
Let ( Υ , σ Q ) be a graphical symmetric space, :   Υ Υ be an H -edge-preserving graphical H - ( ϑ , φ ) -contraction and ϑ be nondecreasing. If there exists a point in k Υ H such that its corresponding edge is with minimum weight in k Υ H , then has a periodic point of order k. In addition, if k Υ H is H -connected and the diagonal Δ Υ = { ( , ) :   Υ } C H , then the periodic point of is unique.
Proof. 
Suppose u k Υ H is such that its corresponding edge is with minimum weight in k Υ H , that is,
σ Q ( u , k u ) σ Q ( v , k v )   for   all   v k Υ H
where k N is fixed. We show that u is a periodic point of ⊤ of order k. Then, as u k Υ H , we have ( u , k u ) C H and since ⊤ is H -edge-preserving, we have ( u , k u ) C H , hence u k Υ H . Let W k ( v ) = σ Q ( v , k v ) for all v Υ and suppose that W k ( u ) > 0 (otherwise, σ Q ( u , k u ) = 0 implies k u = u and we are done) then the inequality (5) shows that 0 < W k ( u ) W k ( v ) for all v k Υ H .
Since ( u , k u ) C H , ⊤ is a graphical H - ( ϑ , φ ) -contraction and W k ( u ) = σ Q ( u , k u ) > 0 , we have
ϑ ( σ Q ( u , k u ) ) ϑ ( σ Q ( u , k u ) ) φ ( σ Q ( u , k u ) ) < ϑ ( σ Q ( u , k u ) ) .
As ϑ is nondecreasing, the above inequality shows that σ Q ( u , k u ) < σ Q ( u , k u ) , that is, W k ( u ) < W k ( u ) . This is a contradiction because u k Υ H . Hence, we must have W k ( u ) = 0 , that is, σ Q ( u , k u ) = 0 . Thus, k u = u .
For the uniqueness of the periodic point, on the contrary, suppose that there is a periodic point v Υ of ⊤ of order k, and u v . Hence, we have k u = u , k v = v . Since ( u , k u ) = ( u , u ) , ( v , k v ) = ( v , v ) Δ Υ = { ( , ) :   Υ } C H and ⊤ is H -edge-preserving, we have ( n u , n v ) C H for all n N and u , v k Υ H ; also, k Υ H is H -connected; hence, suppose that ( u , v ) C H (proof for the case ( v , u ) C H is same). As ⊤ is a graphical H - ( ϑ , φ ) -contraction, we have
ϑ ( σ Q ( u , v ) ) = ϑ ( σ Q ( k u , k v ) ) ϑ ( σ Q ( k 1 u , k 1 v ) ) φ ( σ Q ( k 1 u , k 1 v ) ) ϑ ( σ Q ( k 1 u , k 1 v ) ) .
A repetition of this process gives
ϑ ( σ Q ( u , v ) ) ϑ ( σ Q ( u , v ) ) ϑ ( σ Q ( u , v ) ) φ ( σ Q ( u , v ) ) < ϑ ( σ Q ( u , v ) ) .
This shows that φ ( σ Q ( u , v ) ) = 0 , and since φ Ψ , we must have σ Q ( u , v ) = 0 , that is, u = v . This contradiction shows that u Υ is the unique periodic point of ⊤ of order k. □
Corollary 6. 
Let ( Υ , σ Q ) be a graphical symmetric space, :   Υ Υ be an H -edge-preserving graphical H - ( ϑ , φ ) -contraction and ϑ be nondecreasing. If there exists a point in 1 Υ H such that its corresponding edge is with minimum weight in 1 Υ H , then has a fixed point in Υ . In addition, if k Υ H is H -connected and the diagonal Δ Υ = { ( , ) :   Υ } C H , then the fixed point of is unique.
Proof. 
Since a fixed point of mapping ⊤ is a periodic point of ⊤ of order one, hence the existence and uniqueness of the fixed point of ⊤ follows from Theorem 5. □

4. Positive Solution of Fractional Periodic Boundary Value Problems

In this section, we apply the results of the previous section to the problem of the existence of positive solutions of a fractional periodic boundary value problem involving Caputo’s derivatives of fractional order. We consider the following fractional periodic boundary value problem for positive solutions:
D t α 0 C ( t ) = h ( t , ( t ) ) , t [ 0 , 1 ]
( 0 ) = ( 1 ) = a , a 0
where D t α 0 C represents the Caputo derivatives of fractional order α , and :   [ 0 , 1 ] R and h :   [ 0 , 1 ] × R R are some functions. We first state some definitions and facts about the Riemann–Liouville fractional integral and Caputo’s derivatives of fractional order.
Definition 8 
(Samko et al. [14], Podlubny [15]). The Riemann–Liouville fractional integral of a function C R [ b , c ] of order α ( 0 , ) is given by
I t α b [ ( t ) ] = 1 Γ ( α ) b t ( t s ) α 1 ( s ) d s .
Definition 9 
(Podlubny [15]). Caputo’s derivative of a function :   [ 0 , ) R of order α ( 0 , ) is given by
D t α b C ( t ) = I t n α b d n d t n ( t ) = 1 Γ ( n α ) b t ( t s ) n α 1 ( n ) ( s ) d s
where n = [ α ] + 1 , and [ α ] denotes the integer part of α .
Remark 14. 
It is obvious that if ( t ) = t n 1 , n N , then D t α b C ( t ) = 0 .
Definition 10. 
Let P be the cone in C R [ 0 , 1 ] defined by
P = { ( t ) C R [ 0 , 1 ] :   ( t ) 0   for   all   t [ 0 , 1 ] } .
Then, a function C R [ 0 , 1 ] is called a positive solution of (6) and (7) if P and D t α C 0 ( t ) = h ( t , ( t ) ) , t [ 0 , 1 ] and ( 0 ) = ( 1 ) = a .
The following lemmas play an important role in establishing the existence results for the periodic boundary value problem (6) and (7).
Lemma 1 
(Zhang [16]). Let α > 0 ; then, the fractional differential equation D t α b C ( t ) = 0 has a solution u ( t ) = c 0 + c 1 t + c 2 t 2 + + c n 1 t n 1 , where c i R , i = 0 , 1 , , n 1 and n = [ α ] + 1 .
Lemma 2 
(Zhang [16]). Let α > 0 ; then,
I t α b D t α b C ( t ) = ( t ) + c 0 + c 1 t + c 2 t 2 + + c n 1 t n 1
where n = [ α ] + 1 , c i R , i = 0 , 1 , , n 1 .
Lemma 3. 
Let 1 α < 2 , and let h :   [ 0 , 1 ] × R R be a continuous function. Then, C R [ 0 , 1 ] is a solution of (6) and (7) if and only if it is a solution of the following fractional integral equation
( t ) = a t Γ ( α ) 0 1 ( 1 s ) α 1 h ( s , ( s ) ) d s + 1 Γ ( α ) 0 t ( t s ) α 1 h ( s , ( s ) ) d s .
Proof. 
Suppose ( t ) is a solution of (6) and (7); then, by Lemma 2, we have for some a 0 , a 1 R :
( t ) = a 0 + a 1 t + I t α 0 D t α 0 C ( t ) = a 0 + a 1 t + I t α 0 h ( t , ( t ) ) = a 0 + a 1 t + 1 Γ ( α ) 0 t ( t s ) α 1 h ( s , ( s ) ) d s .
Therefore,
( t ) = a 0 + a 1 t + 1 Γ ( α ) 0 t ( t s ) α 1 h ( s , ( s ) ) d s .
Applying boundary condition (7) in the above equation, we obtain
a = ( 0 ) = a 0 ; a = ( 1 ) = a 0 + a 1 + 1 Γ ( α ) 0 1 ( 1 s ) α 1 h ( s , ( s ) ) d s
that is, a 0 = a and a 1 = 1 Γ ( α ) 0 1 ( 1 s ) α 1 h ( s , ( s ) ) d s . These values with (8) proves the desired result. □
We next prove that under some particular conditions, the fractional boundary value problem (6) and (7) has a positive solution.
In the rest of the discussion, we assume that p > 0 is a fixed number, r = 2 a (where a is the constant considered in (7)), Υ = C R [ 0 , 1 ] , and the set B P ( r ) is given by
B P ( r ) = { P :   ( t ) r   for   all   t [ 0 , 1 ] } .
Theorem 6. 
Assume that the following conditions are satisfied:
(i) 
There exist a nondecreasing continuous function χ :   [ 0 , ) [ 0 , ) such that χ ( t ) < t for all t > 0 and
h ( t , ( t ) ) h ( t , υ ( t ) ) Γ ( 1 + α ) 4 χ ( | ( t ) υ ( t ) | p ) 1 / p
for all , υ B P ( r ) ;
(ii) 
0 h ( t , ( t ) ) a Γ ( 1 + α ) for all t [ 0 , 1 ] and B P ( r ) .
Then, the fractional boundary value problem (6) and (7) has a positive solution.
Proof. 
We convert the fractional boundary value problem (6) and (7) into the equivalent fixed-point problem as follows: define :   Υ Υ by
= a t Γ ( α ) 0 1 ( 1 s ) α 1 h ( s , ( s ) ) d s + 1 Γ ( α ) 0 t ( t s ) α 1 h ( s , ( s ) ) d s .
Then, it is clear that ( t ) is a solution of (6) and (7) if and only if it is a fixed point of ⊤.
Consider the graphs Q and H defined by V ( Q ) = V ( H ) = Υ , E ( Q ) = E ( H ) = B P ( r ) × B P ( r ) and the function σ Q :   Υ × Υ R defined by
σ Q ( , υ ) = sup t [ 0 , 1 ] ( t ) υ ( t ) p   for   all   , υ Υ .
Then, σ Q is a graphical symmetry on Υ , and the pair ( Υ , σ Q ) is a 0- H - σ Q -complete graphical symmetric space. Let ϑ , φ :   [ 0 , ) [ 0 , ) be defined by
ϑ ( t ) = t   and   φ ( t ) = 1 1 2 p t   for   all   t [ 0 , ) .
Since p > 0 , we have ϑ , φ Ψ .
We show that ⊤ is an H -edge-preserving graphical H - ( ϑ , φ ) -contraction.
It is easy to see that B P ( r ) . Consider B P ( r ) . Since (ii) holds, we have
= a t Γ ( α ) 0 1 ( 1 s ) α 1 h ( s , ( s ) ) d s + 1 Γ ( α ) 0 t ( t s ) α 1 h ( s , ( s ) ) d s a t Γ ( α ) 0 1 ( 1 s ) α 1 · a Γ ( 1 + α ) d s = a t a Γ ( 1 + α ) α Γ ( α ) 0
for all t [ 0 , 1 ] . Also,
= a t Γ ( α ) 0 1 ( 1 s ) α 1 h ( s , ( s ) ) d s + 1 Γ ( α ) 0 t ( t s ) α 1 h ( s , ( s ) ) d s a + 1 Γ ( α ) 0 t ( t s ) α 1 · a Γ ( 1 + α ) d s = a + t α a Γ ( 1 + α ) α Γ ( α ) 2 a = r .
for all t [ 0 , 1 ] . Hence, B P ( r ) B P ( r ) . This shows that ⊤ is H -edge-preserving.
Suppose ( , υ ) C H ; then, by definition , υ B P ( r ) , and by (ii), we have
υ = t Γ ( α ) 0 1 ( 1 s ) α 1 h ( s , ( s ) ) d s + 1 Γ ( α ) 0 t ( t s ) α 1 h ( s , ( s ) ) d s + t Γ ( α ) 0 1 ( 1 s ) α 1 h ( s , υ ( s ) ) d s 1 Γ ( α ) 0 t ( t s ) α 1 h ( s , υ ( s ) ) d s t Γ ( α ) 0 1 ( 1 s ) α 1 h ( s , ( s ) ) h ( s , υ ( s ) ) d s + 1 Γ ( α ) 0 t ( t s ) α 1 h ( s , ( s ) ) h ( s , υ ( s ) ) d s .
Using (i) in the above inequality, we obtain
υ Γ ( 1 + α ) 4 Γ ( α ) χ ( σ Q ( , υ ) ) 1 / p t 0 1 ( 1 s ) α 1 d s + 0 t ( t s ) α 1 d s = Γ ( 1 + α ) 4 Γ ( α ) χ ( σ Q ( , υ ) ) 1 / p t α + t α α 1 2 χ ( σ Q ( , υ ) ) 1 / p .
for all t [ 0 , 1 ] . Suppose that σ Q ( , υ ) > 0 . Then, the above inequality shows that σ Q , υ 1 2 p χ ( σ Q ( , υ ) ) < 1 2 p σ Q ( , υ ) . As ϑ ( t ) = t , φ ( t ) = 1 1 2 p t , we have
ϑ σ Q , υ ϑ σ Q , υ φ σ Q , υ .
If σ Q ( , υ ) = 0 , then the above conditions follows trivially.
Note that for any 0 B P ( r ) , we have 0 B P ( r ) ; hence, 0 , 0 C H . Also, if 0 B P ( r ) and , υ O ( , 0 ) , then , υ B P ( r ) , that is, 0 ( t ) , υ ( t ) r for all t [ 0 , 1 ] . Hence,
σ Q ( , υ ) = sup t [ 0 , 1 ] ( t ) υ ( t ) p ( 2 r ) p .
Therefore, O ( , 0 ) is H -bounded with respect to both ϑ and φ . It is easy to see that if an H -termwise-connected ⊤-Picard sequence { z n } is σ Q -convergent to some z Υ , then we must have z n , z B P ( r ) , so by the definition, we have ( z n , z ) C H for all n N . Finally, one can see that the quadruple ( Υ , σ Q , H , ) possesses property (S).
Thus, all the conditions of Theorem 3 are satisfied; hence, ⊤ has a fixed point u which is also a solution of (6) and (7). From the proof of Theorem 3, it is clear that this fixed point u is a limit of an H -termwise-connected ⊤-Picard sequence, so u B P ( r ) ; therefore, u is a positive solution of (6) and (7). □

5. Conclusions

In this work, we presented a new idea of graphical symmetric spaces and proved some fixed-point results for H -edge-preserving mappings. The class of these spaces is broad and includes various known classes of distance spaces. The fixed-point results in graphical symmetric spaces are more general than the existing results for such mappings in the terms of both the broader domain of graphical symmetric spaces and the contractive condition applied on the mappings under consideration. In particular, we generalized the concepts of spaces given in [2,3,5,6,7] and extended the fixed-point results proved by Shukla et al. [6], Ran and Reurings [12] and Edelstein [13]. We showed that the H -edge-preserving mappings and fixed-point results for such mappings in graphical symmetric spaces could be applied to find the positive solutions of fractional periodic boundary value problems. A further investigation of applications of these results (or generalized versions of these results) can be conducted to ensure the solutions of fractional integral inclusion systems, fractional difference equations, etc. Another possible extension of the results of this paper is to establish the fixed figure or fixed circle problem (see, [17]) and to apply it to the related geometric problems.

Author Contributions

Conceptualization, N.D. and S.S.; methodology, S.S. and R.S.; validation, N.D., S.S. and R.S.; formal analysis, N.D. and S.S.; writing—original draft preparation, N.D. and R.S.; writing—review and editing, R.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data used to support the findings of this study are included within the article.

Acknowledgments

All the authors are thankful to the reviewers and editors for their valuable suggestions on the first draft of this paper. The second author is thankful to Science and Engineering Research Board (SERB) (TAR/2022/000131), New Delhi, India for their support.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References

  1. Fréchet, M. La notion d’écart et le calcul fonctionnel. C. R. Acad. Sci. Paris 1905, 140, 772–774. [Google Scholar]
  2. Amini-Harandi, A. Metric-like spaces, partial metric spaces and fixed points. Fixed Point Theory Appl. 2012, 2012, 204. [Google Scholar] [CrossRef]
  3. Czerwik, S. Nonlinear set-valued contraction mappings in b-metric spaces. Atti Semin. Mat. Fis. Univ. Modena 1998, 46, 263–276. [Google Scholar]
  4. Matthews, S. Partial metric topology. Ann. N. Y. Acad. Sci. 1994, 728, 183–197. [Google Scholar] [CrossRef]
  5. Alshehri, S.; Aranđelović, I.; Shahzad, N. Symmetric spaces and fixed points of generalized contractions. Abstr. Appl. Anal. 2014, 2014, 8. [Google Scholar] [CrossRef]
  6. Shukla, S.; Radenović, S.; Vetro, C. Graphical metric space: A generalized setting in fixed point theory. Rev. Real Acad. Cienc. Exactas Físicas Nat. Ser. Mat. 2016, 111, 641–655. [Google Scholar] [CrossRef]
  7. Wilson, W.A. On semi-metric spaces. Am. J. Math. 1931, 53, 361–373. [Google Scholar] [CrossRef]
  8. Shukla, S.; Künzi, H.P.A. Some fixed point theorems for multi-valued mappings in graphical metric spaces. Math. Slovaca 2020, 70, 719–732. [Google Scholar] [CrossRef]
  9. Jachymski, J. The contraction principle for mappings on a metric space with a graph. Proc. Am. Math. Soc. 2008, 136, 1359–1373. [Google Scholar] [CrossRef]
  10. Jleli, M.; Samet, B. On a new generalization of metric spaces. J. Fixed Point Theory Appl. 2018, 20, 1–20. [Google Scholar] [CrossRef]
  11. Shukla, S.; Radenović, S.; Rajic, V. Some common fixed point theorems in 0-σ-complete metric-like spaces. Viet. J. Math. 2013, 41, 341–352. [Google Scholar] [CrossRef]
  12. Ran, A.C.M.; Reurings, M.C.B. A fixed point theorem in partially ordered sets and some application to matrix equations. Proc. Amer. Math. Sco. 2004, 132, 1435–1443. [Google Scholar] [CrossRef]
  13. Edelstein, M. An extension of Banachs contraction principle. Proc. Am. Math. Soc. 1961, 12, 7–10. [Google Scholar]
  14. Samko, S.; Kilbas, A.; Marichev, O. Fractional integral and derivatives. In Theory and Applications; Gordon and Breach: Yverdon, Switzerland, 1993. [Google Scholar]
  15. Podlubny, I. Fractional differential equations. In Mathematics in Scince and Engineering; Academic Press: New York, NY, USA; London, UK; Toronto, ON, Canada, 1999; Volume 198. [Google Scholar]
  16. Zhang, S. Positive solutions for boundary-value problems of nonlinear fractional differential equations. Electron. J. Differ. Equ. 2006, 2006, 1–12. [Google Scholar] [CrossRef]
  17. Özgür, N.; Taş, N. Geometric Properties of Fixed Points and Simulation Functions. arXiv 2021, arXiv:2102.05417. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Dubey, N.; Shukla, S.; Shukla, R. On Graphical Symmetric Spaces, Fixed-Point Theorems and the Existence of Positive Solution of Fractional Periodic Boundary Value Problems. Symmetry 2024, 16, 182. https://doi.org/10.3390/sym16020182

AMA Style

Dubey N, Shukla S, Shukla R. On Graphical Symmetric Spaces, Fixed-Point Theorems and the Existence of Positive Solution of Fractional Periodic Boundary Value Problems. Symmetry. 2024; 16(2):182. https://doi.org/10.3390/sym16020182

Chicago/Turabian Style

Dubey, Nikita, Satish Shukla, and Rahul Shukla. 2024. "On Graphical Symmetric Spaces, Fixed-Point Theorems and the Existence of Positive Solution of Fractional Periodic Boundary Value Problems" Symmetry 16, no. 2: 182. https://doi.org/10.3390/sym16020182

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop