Abstract
The rationale of this work is to introduce the notion of graphical symmetric spaces and some fixed-point results are proved for --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 , without parallel edges, such that the set of its vertices coincides with and the set of its edges . Then, we say that is endowed with the graph The conversion of the graph is denoted by , and it is defined by:
By , we denote the undirected graph obtained from by including all the edges of . More precisely, we define If ♭ and are vertices in a graph then a path in from ♭ to of length is a sequence of vertices such that and for A graph 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 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, is weakly connected if is connected.
For a subgraph of , we define a set by:
Consider the relation Then, P is called the relation of connectedness, and by the definition of a path in , it is clear that this relation is a transitive relation. A sequence in is said to be -termwise-connected if for all A vertex is called an isolated point of graph if neither nor is in for all . For a subset A of , we denote .
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 and be a function satisfying the following conditions: for all with
- (GS1)
- (GS2)
- implies ;
- (GS3)
- .
Then, the mapping is called a graphical symmetry on , and the pair 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 such that is a graphical metric space (see, [6]), then is a graphical symmetric space with the same graph , where for all . Hence, every graphical metric space (thus every metric space) is also a graphical symmetric space.
- Every b-metric space (see, [3]) is a graphical symmetric space with the graph such that , where 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 with the graph such that , where for all . Hence, every partial metric space (see, [4]) is a graphical symmetric space.
- Every symmetric space (see, [5,7]) is a graphical symmetric space with the graph such that , where for all .
Example 1.
Let be endowed with the graph , where . Then, the function is a graphical symmetry on , where for all Hence, is a graphical symmetric space. Note that does not fall under any class of spaces mentioned above.
Example 2.
Let , and . Let be endowed with the graph , where . Then, the function is a graphical symmetry on , where
for all Hence, is a graphical symmetric space. Note that 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 be a graphical symmetric space. For and , denote by the right ball with center ♭ and radius r, where
Similarly, a left ball with center ♭ and radius r is denoted by , and
Remark 2.
It is obvious that if , then and .
Consider the following two collections of subsets of :
Remark 3.
We notice that a right ball (left ball) may be empty. In particular, if is an isolated point of , then we have for all In this case, the inclusion of any ball in a set becomes a trivial case. On the other hand, if , then one can see that a right ball (left ball) is nonempty. In particular, if , then each right ball (left ball) contains its center. Also, by using Remark 2, one can easily verify that the collections and are two topologies on induced by and called R-topology and L-topology, respectively. The members of and are called R-open and L-open sets, respectively. A subset is called R-closed (respectively L-closed) if 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 (), 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 be a one-to-one function and . Let be endowed with the graph , where (the universal graph). Define by:
Then, it is easy to see that is a graphical symmetric space. Now, consider the right ball with center and radius , that is, . Then, since and , . But note that for every , we have and . Hence, for all . This shows that is not an R-open set. Similarly, it can be shown that is not an L-open set.
Remark 5.
In general, the topologies and are not . For instance, let be endowed with the graph , where . Define by:
Then, it is easy to see that is a graphical symmetric space. Note that the singleton is neither R-closed nor L-closed, because and () for all .
Theorem 1.
Suppose at least one of the following conditions is satisfied:
- (A)
- for all ;
- (B)
- for all with .
Then, the topologies and are .
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 such that , that is, . We consider the following cases:
- (I)
- If , we have for all .
- (II)
- If , by (GS1) and (GS2) we have (since ). Let ; then, since at least one of the conditions (A) and (B) is satisfied, we must have and .
Therefore, in each case, we can find such that ; 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 (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 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 be a graphical symmetric space and be a sequence in . Then, the sequence is called -convergent to , and ♭ is called a -limit of if The sequence is called -convergent to (or convergent to ♭ with respect to , or simply R-convergent) if for every given , there exists such that for all . The -convergence (or convergence with respect to , 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 -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 -converge (-converge) to more than one limit. A similar conclusion holds for L-convergence as well.
Example 3.
Consider the graphical symmetric space , where is endowed with the graph with , and is given by:
for all , where , . Consider the sequence in , where for all . Then, it is clear that for all ; hence, the sequence is -convergent to each . On the other hand, if , then is -convergent to ♭, but note that for every , we have for all and for all . Hence, we conclude that the sequence is not R-convergent to for all . Also, if , then it is easy to see that is R-convergent to . Thus, a sequence in graphical symmetric spaces may be -convergent (R-convergent) to more than one limit.
Definition 3.
Let be a graphical symmetric space and be a sequence in . Then, the sequence is called -Cauchy if 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 be a graphical symmetric space and be a sequence in . Then, is called -complete if every -Cauchy sequence in is -convergent to such that The space is called R-complete (respectively, L-complete) if every -Cauchy sequence in is R-convergent (respectively, L-convergent) to such that
Remark 8.
From the above definition and Remark 7 it is clear that R-completeness and L-completeness implies -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 -completeness.
Example 4.
Consider the graphical symmetric space , where is endowed with the graph with , and is given by for all . Then, it is easy to see that is -complete. Consider the sequence in , where for all . Then, it is easy to see that this sequence is a -Cauchy sequence in , but there exists no for which we can find such that for all or for all . Therefore, 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 be a graphical symmetric space and be a sequence in . Then, the sequence is called 0--Cauchy if . The space is called 0--complete if every 0--Cauchy sequence in is -convergent to some such that If is a graph such that , then the space is called --complete if every -termwise-connected -Cauchy sequence in is -convergent to such that While is called 0---complete if every -termwise-connected 0--Cauchy sequence in is -convergent to some such that
It is not hard to see that every -complete space is 0--complete and every 0--complete space is 0---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 -completeness, and the notion of 0---completeness is the most general among the other notions mentioned above.
Example 5.
- (A)
- Consider endowed with the graph , where . Then, the function is a graphical symmetry on , where for all , and is 0--complete but not -complete.
- (B)
- Consider endowed with graph and , where . Then, the function is a graphical symmetry on , whereNote that is 0---complete but not 0--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 be a function and be a graphical symmetric space. In all subsequent discussions, we assume that is a subgraph of with , where . A subset A of is called -bounded with respect to , if for all with , where is a fixed number.
By , we denote the class of the functions such that for every sequence of nonnegative numbers , we have if and only if
Definition 6.
Let be a graphical symmetric space, a mapping and be a subgraph of . Then, the mapping ⊤ is called a graphical --contraction if there exist such that:
If , the iterative sequence , where for all , is called the ⊤-Picard sequence with initial value The mapping ⊤ is called -edge-preserving if implies for all .
Theorem 2.
Let be a 0---complete graphical symmetric space and be an -edge-preserving graphical --contraction. Suppose that the following conditions hold:
- (A)
- There exists such that the orbit of ⊤ with initial value , that is, , is -bounded with respect to both ϑ and φ, and
- (B)
- If an -termwise-connected ⊤-Picard sequence is -convergent to some point in , then there exist a -limit of and such that for all or for all .
Then, there exists such that the ⊤-Picard sequence with initial value is -termwise-connected and -convergent to with for all .
Proof.
Let be such that is -bounded with respect to both and , and . We first show that the ⊤-Picard sequence with initial value is a 0--Cauchy sequence.
Since , we have . As ⊤ is -edge-preserving, we have , that is, . A repetition of this argument leads us to the conclusion: for all . Since the relation of connectedness is a transitive relation, we have for all with . As ⊤ is a graphical --contraction, for every , we have
This gives
Since the condition (A) is satisfied, for each , two sets of nonnegative numbers: and are bounded. Hence, for each , the following numbers must exist:
As , taking the supremum over in (1), we obtain
Hence, by definitions of and we obtain:
Since , we have ; so, by (2), the sequence is a nonincreasing sequence of real numbers which is bounded below as well. Hence, it must be convergent to some nonnegative number that is,
By (2), we have
which, with the fact that , gives
As for all , the above equality yields
As , the above equality implies that
Thus, we have showed that the ⊤-Picard sequence with initial value is an -termwise-connected 0--Cauchy sequence.
By the 0---completeness of , the sequence is -convergent to some point in , and by condition (B), there exist a -limit of and such that
and for all or for all .
By mathematical induction, we show that is -convergent to with for all . Suppose that for all (the proof for the second case is same). Then, as ⊤ is a graphical --contraction, we have
Since u is a -limit of the sequence , we have , and since , the real sequences and of nonnegative real numbers must converge to zero. Therefore, the above inequality yields
As for all and ⊤ is -edge-preserving, we have for all , so . Also, as and ⊤ is a graphical --contraction, we have:
and as , the above inequality implies that
As an induction hypothesis, suppose that is -convergent to and for some . Since for all and ⊤ is -edge-preserving, we must have for all Hence, for we have
Since is a -limit of the sequence , we have , and using arguments similar to the previous case, the above inequality yields
As for all and ⊤ is -edge-preserving, . Also, as and ⊤ is a graphical --contraction, we have:
and as , the above inequality implies that This completes the induction.
Thus, the ⊤-Picard sequence with initial value is -termwise-connected and -convergent to with for all . □
Example 6.
Consider the set equipped with the graphs , where , and consider the function defined by:
Then, is a graphical symmetry on , and is a 0---complete graphical symmetric space. Let be a mapping defined by for all , , and let be two functions defined by for all and
Then, it is easy to see that ⊤ is a graphical --contraction. Since ⊤ is an increasing function on , ⊤ is -edge-preserving. For any the orbit is -bounded with respect to both ϑ and φ and . Also, if an -termwise-connected ⊤-Picard sequence is -convergent to some point in , then there exist a limit of and such that for all (for example, with ). 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 -termwise-connected ⊤-Picard sequence, where ⊤ is an -edge-preserving graphical --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 be a graphical symmetric space and be a mapping. Then, the quadruple possesses the property (S) if:
Remark 10.
Note that in Example 6, all the conditions of Theorem 2 are satisfied, but the quadruple does not possess the property (S), for example, consider the -termwise-connected ⊤-Picard sequence , where ; then, this sequence has two -limits and , but . This fact shows the significance of the property (S).
Theorem 3.
Let be a 0---complete graphical symmetric space and be an -edge-preserving graphical --contraction. Suppose that all the conditions of Theorem 2 are satisfied and the quadruple possesses the property (S), then ⊤ has a fixed point in .
Proof.
Theorem 2 shows that the ⊤-Picard sequence with initial value is -convergent to for all . Also, by the proof of Theorem 2, it is clear that this ⊤-Picard sequence is -termwise-connected. As , and the quadruple possesses the property (S), we must have , that is, u is the fixed point of ⊤. □
Example 7.
Consider the set equipped with the graphs , where , and consider the function defined by:
Then, is a graphical symmetry on , and is a 0---complete graphical symmetric space. Let be a mapping defined by for all and if . Consider the functions defined by for all . Then, it is easy to see that ⊤ is a graphical --contraction which is -edge-preserving. For the orbit is -bounded with respect to both ϑ and φ, and . Also, if an -termwise-connected ⊤-Picard sequence is -convergent to some point , then and for all . Hence, all the conditions of Theorem 2 are satisfied. Note that an -termwise-connected ⊤-Picard sequence in must be a constant sequence with every term of it equal to zero, and if it has a -limit , then we must have . Hence, the quadruple possesses the property (S). Hence, by Theorem 2, the mapping ⊤ must have a fixed point in . Note that all the points of the set 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 -edge-preserving graphical --contraction, but not the uniqueness of the fixed point.
By , we denote the set of all fixed points of a mapping . For any subgraph of and for a fixed number , the set is denoted by , and is called the corresponding edge of . A subset A of is said to be -connected if for every distinct , we have or .
Theorem 4.
Let be a 0---complete graphical symmetric space and be an -edge-preserving graphical --contraction. Suppose that all the conditions of Theorem 3 are satisfied, then ⊤ has a fixed point. In addition, if is -connected and the diagonal 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 of ⊤ and Hence, we have for all . Since, , we have ; also, is -connected; hence, suppose that (the proof for the case is same), then, as ⊤ is a graphical --contraction, we have
The above inequality shows that , and since , we must have that is, This contradiction shows that is the unique fixed point of ⊤. □
Remark 11.
In the above theorem, for the uniqueness of the fixed point of ⊤, we assumed the -connectedness of and the inclusion of diagonal in the set . We point out that in Example 7, although the condition of the -connectedness of is satisfied, the inclusion does not hold, so the fixed point of ⊤ is not unique.
Remark 12.
Let be a graphical symmetric space. Then, consider the following property:
- (GS4)
- and 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 equipped with the graphs , where , and consider the function defined by
Then, is a graphical symmetry on , and is a 0---complete graphical symmetric space. Let be a mapping defined by for all and let be two functions defined by for all and
Since ⊤ is an increasing function on , ⊤ is -preserving. For any , the orbit is bounded with respect to both ϑ and φ, and . Also, if an -termwise-connected ⊤-Picard sequence is -convergent to , then we must have and for all . Also, if an -termwise-connected ⊤-Picard sequence has two limits u and v where , then . Hence, all the conditions of Theorem 2 are satisfied, and the quadruple possesses the property (S). Thus, the fixed point of ⊤ exists. Here, ; hence, is -connected, and . Thus, all the conditions of Theorem 4 are satisfied, hence, by Theorem 4, ⊤ has a unique fixed point. Indeed,
A graphical metric space is called -complete (for details, see Shukla et al. [6]) if every -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 , we obtain the following corollary of Theorem 4.
Corollary 1.
Let be a nonempty set endowed with a graph such that is an -complete graphical metric space, and let be an -edge-preserving mapping. Suppose that the following conditions hold:
- (A)
- There exist such that
- (B)
- There exists such that for all with , where is a fixed number and
- (C)
- If an -termwise-connected ⊤-Picard sequence converges in , then there exist a limit of and such that for all or for all .
Then, there exists such that the ⊤-Picard sequence with initial value is -termwise-connected and convergent to for all . In addition, if the quadruple possesses the property (S) (in the sense of Shukla et al. [6]), then ⊤ has a fixed point in . Also, if is -connected, then the fixed point of ⊤ is unique.
Corollary 2.
Let be a nonempty set endowed with a graph such that is an -complete graphical metric space, and let be an -edge-preserving mapping. Suppose that the following conditions hold:
- (A)
- There exist such that
- (B)
- There exists such that
- (C)
- If an -termwise-connected ⊤-Picard sequence converges in , then there exist a limit of and such that for all or for all .
Then, there exists such that the ⊤-Picard sequence with initial value is -termwise-connected and converges to for all . In addition, if the quadruple has the property (S) (in the sense of Shukla et al. [6]), then ⊤ has a fixed point in . Also, if is -connected, then the fixed point of ⊤ is unique.
Proof.
Consider the graphical symmetric space , where for all Define by , for all . 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 , . Hence, there exists such that , and
for all with . 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 be a complete b-metric space (see, Czerwik [3]) and a mapping such that the following condition is satisfied: for some
If there exists such that for all , where is a fixed number, then ⊤ has a unique fixed point in .
Proof.
Consider the graphical symmetric space , where for all and the universal graph where , . If we assume , 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
If there exists such that for all , where is a fixed number, then ⊤ has a unique fixed point in .
Proof.
Consider the graphical symmetric space , where for all and the universal graph where , . If we assume , then it is easy to see that all the conditions of Theorem 2 are satisfied, hence, by Theorem 2, the ⊤ Picard sequence with initial value is convergent to and for all . Hence, by Remark 1 of Shukla et al. [11], we obtain for all ; thus, ⊤ has a fixed point in . The uniqueness of the fixed point follows from the fact that the graph is universal. □
Let 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:
We derive the following corollary in symmetric spaces.
Corollary 5.
Let be a symmetric space (see Alshehri et al. [5] and references therein) such that for every d-Cauchy sequence in , there exists such that . Suppose is a mapping such that the following condition is satisfied: for some
If there exists such that for all , where is a fixed number, and suppose property (W3) is satisfied, then ⊤ has a unique fixed point in .
Proof.
Consider the graphical symmetric space , where for all and the universal graph where , . Define the subgraph of by: . 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 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 is universal. □
A point is called a periodic point of order of a mapping if If is a graphical symmetric space, then each edge of the graph can be considered weighted, where the weight of edge is given by the quantity . We prove the following periodic-point theorem:
Theorem 5.
Let be a graphical symmetric space, be an -edge-preserving graphical --contraction and ϑ be nondecreasing. If there exists a point in such that its corresponding edge is with minimum weight in , then ⊤ has a periodic point of order k. In addition, if is -connected and the diagonal then the periodic point of ⊤ is unique.
Proof.
Suppose is such that its corresponding edge is with minimum weight in , that is,
where is fixed. We show that u is a periodic point of ⊤ of order k. Then, as , we have and since ⊤ is -edge-preserving, we have , hence . Let for all and suppose that (otherwise, implies and we are done) then the inequality (5) shows that for all .
Since , ⊤ is a graphical --contraction and , we have
As is nondecreasing, the above inequality shows that , that is, . This is a contradiction because . Hence, we must have , that is, . Thus, .
For the uniqueness of the periodic point, on the contrary, suppose that there is a periodic point of ⊤ of order k, and Hence, we have . Since , and ⊤ is -edge-preserving, we have for all and ; also, is -connected; hence, suppose that (proof for the case is same). As ⊤ is a graphical --contraction, we have
A repetition of this process gives
This shows that , and since , we must have that is, This contradiction shows that is the unique periodic point of ⊤ of order k. □
Corollary 6.
Let be a graphical symmetric space, be an -edge-preserving graphical --contraction and ϑ be nondecreasing. If there exists a point in such that its corresponding edge is with minimum weight in , then ⊤ has a fixed point in . In addition, if is -connected and the diagonal 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:
where represents the Caputo derivatives of fractional order , and and 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 of order is given by
Definition 9
(Podlubny [15]). Caputo’s derivative of a function of order is given by
where , and denotes the integer part of
Remark 14.
It is obvious that if , , then .
Definition 10.
Let be the cone in defined by
Then, a function is called a positive solution of (6) and (7) if and and .
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 ; then, the fractional differential equation has a solution where , and
Lemma 2
(Zhang [16]). Let ; then,
where , , .
Lemma 3.
Let , and let be a continuous function. Then, is a solution of (6) and (7) if and only if it is a solution of the following fractional integral equation
Proof.
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 is a fixed number, (where a is the constant considered in (7)), , and the set is given by
Theorem 6.
Assume that the following conditions are satisfied:
- (i)
- There exist a nondecreasing continuous function such that for all andfor all ;
- (ii)
- for all and .
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
Then, it is clear that is a solution of (6) and (7) if and only if it is a fixed point of ⊤.
Consider the graphs and defined by , and the function defined by
Then, is a graphical symmetry on , and the pair is a 0---complete graphical symmetric space. Let be defined by
Since , we have
We show that ⊤ is an -edge-preserving graphical --contraction.
It is easy to see that . Consider . Since (ii) holds, we have
for all Also,
for all Hence, This shows that ⊤ is -edge-preserving.
Suppose ; then, by definition , and by (ii), we have
Using (i) in the above inequality, we obtain
for all . Suppose that . Then, the above inequality shows that . As , , we have
If then the above conditions follows trivially.
Note that for any , we have ; hence, . Also, if and , then , that is, for all . Hence,
Therefore, is -bounded with respect to both and . It is easy to see that if an -termwise-connected ⊤-Picard sequence is -convergent to some , then we must have , so by the definition, we have for all . Finally, one can see that the quadruple 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 -termwise-connected ⊤-Picard sequence, so ; 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 -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 -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
- Fréchet, M. La notion d’écart et le calcul fonctionnel. C. R. Acad. Sci. Paris 1905, 140, 772–774. [Google Scholar]
- Amini-Harandi, A. Metric-like spaces, partial metric spaces and fixed points. Fixed Point Theory Appl. 2012, 2012, 204. [Google Scholar] [CrossRef]
- Czerwik, S. Nonlinear set-valued contraction mappings in b-metric spaces. Atti Semin. Mat. Fis. Univ. Modena 1998, 46, 263–276. [Google Scholar]
- Matthews, S. Partial metric topology. Ann. N. Y. Acad. Sci. 1994, 728, 183–197. [Google Scholar] [CrossRef]
- Alshehri, S.; Aranđelović, I.; Shahzad, N. Symmetric spaces and fixed points of generalized contractions. Abstr. Appl. Anal. 2014, 2014, 8. [Google Scholar] [CrossRef]
- 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]
- Wilson, W.A. On semi-metric spaces. Am. J. Math. 1931, 53, 361–373. [Google Scholar] [CrossRef]
- 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]
- 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]
- Jleli, M.; Samet, B. On a new generalization of metric spaces. J. Fixed Point Theory Appl. 2018, 20, 1–20. [Google Scholar] [CrossRef]
- 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]
- 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]
- Edelstein, M. An extension of Banachs contraction principle. Proc. Am. Math. Soc. 1961, 12, 7–10. [Google Scholar]
- Samko, S.; Kilbas, A.; Marichev, O. Fractional integral and derivatives. In Theory and Applications; Gordon and Breach: Yverdon, Switzerland, 1993. [Google Scholar]
- 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]
- Zhang, S. Positive solutions for boundary-value problems of nonlinear fractional differential equations. Electron. J. Differ. Equ. 2006, 2006, 1–12. [Google Scholar] [CrossRef]
- Ö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. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).