Common fixed point theorems for auxiliary functions with applications in fractional differential equation

In this work, we investigate h-ϕ contraction mappings with two metrics endowed with a directed graph which involve auxiliary functions. The achievement allows us to obtain applications for the existence of the solutions for Caputo fractional boundary value problems with the integral boundary condition type. In addition, we also give examples and numerical experiments supporting our main results.


Introduction and preliminaries
The topic of fractional differential equations has been of great interest among mathematicians during the past few decades due to its various applications in science. It is evidenced that fixed point theory has played an important role in improving the understanding of fractional differential equations as this can be seen, for instance, in [1][2][3][4][5][6][7][8][9][10][11][12].
As being investigated in [11], E. Karapınar considered fixed point theorem using auxiliary functions, and this shed the light on application for fractional differential equations, which has motivated this recent work.
Additionally, in 2008, the notion of fixed point theorem for metric spaces endowed with graphs was introduced by J. Jachymski in [13]. Thenceforth, many researchers have paid their attention to the study of fixed points for mappings on various spaces endowed with graphs, for example, see [14][15][16][17][18][19]. One of the most important consequences of this generalization is that the famous Banach contraction principle can also be extended into the case of metric spaces endowed with graphs, see [14,18].
Before we move to the next part, there are important definitions and concepts delivered in [13] that should be recalled here, which will be as follows.
On the other hand, interesting results regarding common fixed point theorems for Geraghty type contraction mappings employing the monotone property with two metrics were proved by Martínez-Moreno et al. in 2015 using d-compatibility and g-uniform continuity, see [29]. This also inspires us to examine metric spaces equipped with two metrics in this work. Before we prove our main results in the next section, let us recall other important definitions as follows.
Definition 5 ([30]) Let (X, d) be a metric space, and let f , g : X → X be functions. Then f and g are said to be d-compatible whenever lim n→∞ d(gfx n , fgx n ) = 0 for all sequence {x n } in X with lim n→∞ fx n = lim n→∞ gx n . Definition 6 ( [28]) Let G = (V (G), E(G)) be a directed graph, and let f , g : X → X be functions. We say that f is g-edge preserving with respect to G whenever, for each x ∈ X, if (gx, gy) ∈ E(G), then (fx, fy) ∈ E(G). Definition 7 ([28]) Let (X, d) and (Y , d ) be metric spaces, and let f : X → Y and g : X → X be functions. We say that f is g-Cauchy on X whenever, for any sequence {x n } in X with {gx n } being Cauchy in (X, d), the sequence {fx n } is Cauchy in (Y , d ).
In the next section, we enhance the results in [28] by replacing θ -φ contraction mappings with auxiliary functions. This allows us to obtain existence criteria of common fixed points for auxiliary functions with two metrics endowed with a directed graph. Finally, application for nonlinear differential equations and numerical experiments will be provided in the next two parts of this work.

Main results
In this section, we present new results on existence of common fixed points for auxiliary functions with two metrics endowed with a directed graph. To begin with, let us establish classes of functions which will be considered throughout this work.
From now on, we will denote the set of all such functions φ satisfying all the above conditions by . Inspired by [11], the next important class of functions that we shall consider is the class A(X), where (X, d) is a metric space. This is the class of all auxiliary functions h : for all sequences {x n } and {y n } in X.
As a result, we are now in a position to consider a new type of contractions, which is defined as follows.
Definition 8 Let (X, d) be a metric space endowed with a directed graph G = (V (G), E(G)), and let f , g : X → X be functions. The pair (f , g) will be called an h-φ-contraction with respect to d whenever the following conditions hold: (1) f is g-edge preserving with respect to G; (2) There exist two functions h ∈ A(X) and φ ∈ such that, for all x, y ∈ X with (gx, gy) ∈ E(G), we have The above definition allows us to generalize the result in [28] to the case of auxiliary functions. In fact, we are now ready to present and prove our main results. The following theorem involves two metrics as being motivated by [31].

Theorem 9
Let (X, d ) be a complete metric space endowed with a directed graph G = (V (G), E(G)), let d be another metric on X, and let f , g : X → X be functions. Suppose that (f , g) is an h-φ-contraction with respect to d, and assume further that the following conditions hold: is G-continuous, and f and g are d -compatible. As a consequence, we get that Proof (⇐) This follows from Lemma 3.
(⇒) Suppose that X(f , g) = ∅ and x 0 ∈ X with (gx 0 , fx 0 ) ∈ E(G). By the assumption that f (X) ⊆ g(X) and f (x 0 ) ∈ X, we may construct a sequence {x n } in X such that gx n = fx n-1 for each number n ∈ N. If it is the case that gx n 0 = gx n 0 -1 for some n 0 ∈ N, then x n 0 -1 must be a coincidence point of f and g. As a result, we may assume now that, for every n ∈ N, gx n = gx n-1 .
If R(gx n , gx n+1 ) = d(gx n , gx n+1 ), then by similar argument as in the previous case we receive So, we get that {φ(d(gx n , gx n+1 ))} is a nonincreasing sequence, which implies that the sequence {d(gx n , gx n+1 )} must be nonincreasing by the definition of φ. Since the later sequence is bounded below, it becomes a convergent sequence. Suppose on the contrary that lim n→∞ d(gx n , gx n+1 ) > 0. Thus, lim n→∞ φ(d(gx n , gx n+1 )) > 0 by the property of φ. By (2), it is true that Therefore, lim n→∞ h(gx n , gx n+1 ) = 1. By the definition of auxiliary functions, lim n→∞ d(gx n , gx n+1 ) = 0, which contradicts the assumption. So, the equation lim n→∞ h(gx n , gx n+1 ) = 0 must be true. Next, we will show that the sequence {gx n } must be Cauchy. Suppose on the contrary that {gx n } is not Cauchy. Therefore, there is > 0 such that, for all k ∈ N, there are n(k), m(k) ∈ N such that n(k) > m(k) ≥ k with the property that n(k) being the smallest number satisfies the properties as follows: and d(gx n(k)-1 , gx m(k) ) < .
Because E(G) has the transitivity property, we obtain that (gx m(k) , gx n(k) ) ∈ E(G) for every k ∈ N. As a consequence, where Since lim n→∞ d(gx n , gx n+1 ) = 0, letting k → ∞ in the above inequality implies that By inequality (4) and the above fact, we get As a result, lim k→∞ h(gx m(k) , gx n(k) ) = 1. Thus, lim k→∞ d(gx m(k) , gx n(k) ) = 0, which contradicts (3). So, it must be true that {gx n } is Cauchy in the metric space (X, d).
In the next part, we prove that {gx n } is also Cauchy in the metric space (X, d ).
When d ≥ d , the proof is trivial. Therefore, we consider the case d d . Let ε > 0. Because {gx n } is Cauchy in (X, d) and the function f is g-Cauchy on X, we obtain that {fx n } is Cauchy in the metric space (X, d ). So, there is a number N 0 ∈ N such that Next, the fact that g(X) is a d -closed subset of (X, d ), which is complete, implies the existence of u = gx ∈ g(X), which satisfies In addition, using the fact that f : (X, d ) → (X, d ) is a G-continuous function such that f and g are d -compatible, we arrive at the conclusion that Finally, consider Taking n → ∞, we obtain that d (gu, fu) = 0 because of (5), the continuity of g, and the fact that f is G-continuous. Therefore, gu = fu, which implies that u is a coincidence point of f and g.
In our next theorem, we consider the case when the two metrics d and d coincide.
Theorem 10 Let (X, d) be a complete metric space endowed with a directed graph G = (V (G), E(G)), and let f , g : X → X be functions such that (f , g) is an h-φ-contraction with respect to d. Assume further that the following conditions hold: (1) g is a continuous function such that g(X) is closed; (2) f (X) ⊆ g(X); (3) E(G) attains the transitivity property; (4) At least one of the following conditions is true: (a) f is G-continuous, and f and g are d-compatible; (b) (X, d, G) has the property A. As a consequence, we get that Proof From the proof of Theorem 9, it suffices to consider the only if case together with the assumption that (b) of condition (4) above is true. We will adopt all the notations from the proof of Theorem 9. By the fact that the sequence {gx n } is Cauchy and g(X) is a closed subset of X, there is an element u ∈ X with lim n→∞ gx n = gu = lim n→∞ fx n .
We claim that u must be a coincidence point of f and g. Suppose on the contrary that u is not a coincidence point of f and g. Therefore, fu = gu and hence d(fu, gu) > 0.
Then (gx n , gu) ∈ E(G) for every n ∈ N because the triple (X, d, G) has the property A. Also, As a result, In fact, the definition of φ implies that where Letting k → ∞ in the above equation and using (6), we get Then, taking k → ∞ in (7) gives us that lim k→∞ h(gx n(k) , gu) = 1. This implies d(gu, fu) = lim k→∞ d(gx n(k) , gu) = 0, which is a contradiction. Hence, fu = gu and we can deduce that f and g have u as one of their coincidence points.
We may obtain a stronger result about the existence of a common fixed point by assuming an extra condition as in the theorem below.

Theorem 11
Let us adopt all the notations and conditions that appeared in Theorem 9. Furthermore, assume in addition that (6) For any x, y ∈ C(f , g) with gx = gy, it is true that (gx, gy) ∈ E(G). As a consequence, we get that Proof From the proof of Theorem 9, it suffices to consider the only if case together with the assumption that condition (6) above is true. By Theorem 9, there is an element x ∈ X such that gx = fx.
To begin with, suppose that y ∈ X is also a coincidence point, i.e., gy = fy. We will show that gx = gy. To see this, suppose on the contrary that gx = gy. By condition (6) above, (gx, gy) ∈ E(G), which implies Thus, h(gx, gy) = 1 by the property of φ. As a result, gx = gy.
Next, set x 0 = x and use condition (2) in Theorem 9 to construct a sequence {x n } such that gx n = fx n-1 for any n ∈ N. In particular, since x is a coincidence point, we may assume it is the case that x n = x so gx n = fx for every n ∈ N.
Then, let z = gx so that gz = ggx = gfx. Note also that gx n = fx = fx n-1 for each n ∈ N. Therefore, In the last part of this section, we give an example supporting our main results. ∞) is a constant. It can be easily checked that d and d are metrics. Furthermore, by the way we define our metrics, we clearly get that d < d .
Next, suppose In addition, let f : X → X and g : X → X be given by gx = x 2 and fx = ln 1 + x 2 4 for each x ∈ X. We will prove that requirements (1) and (2) for the pair (f , g) to be an h-φ-contraction with respect to d are true.
In the last part of this example, we will prove that conditions (1)-(5) of Theorem 9 are satisfied.
(1) g : (X, d ) → (X, d ) is clearly a continuous function such that g(X) = [0, ∞) is also d -closed; (2) It is not hard to see that f (X) = g(X) = X; (3) E(G) has the transitivity property; (4) From the fact that d < d , we will show that f : (X, d) → (X, d ) is g-Cauchy. Given > 0 and a sequence {x n } in X with {gx n } being Cauchy in (X, d), there is N ∈ N such that d(gx n , gx m ) < L for all n, m ≥ N . Therefore, This amounts to saying that f : (X, d) → (X, d ) is g-Cauchy; ( Finally, observe that (g0, f 0) = (0, 0) ∈ E(G) so X(f , g) is nonempty. By Theorem 9, C(f , g) = ∅. In fact, it can be easily seen that 0 ∈ C(f , g).

Application to nonlinear fractional differential equations with nonlocal boundary conditions
In this section, we discuss the application of our results to study the existence of the solutions for Caputo fractional boundary value problems of order α ∈ (n -1, n], where n ≥ 2 is an integer, with the integral boundary condition type. Before going through the existence results, we need to recall the definition of the Caputo fractional derivative and related concepts. Let α be a positive real number. For a continuous function u(t), the Caputo derivative of fractional order α is defined as where α is the smallest integer which is greater than or equal to α, and I α is the Riemann-Liouville integral operator of order α ≥ 0 defined by Note that, in the case of α = 0, the operator I 0 is referred to as the identity operator. Moreover, the gamma function is defined by (α) = ∞ 0 t α-1 e -t dt. Now, we are in a position to consider the nonlinear fractional differential equation in the following form: with the boundary conditions y(0) = y (0) = · · · = y (n-2) (0) = 0 and y(1) = η 0 y(s) ds, where η ∈ [0, 1] and f : [0, 1] × R → R. Next, we consider some auxiliary results that will be used to prove our main theorems. It is well known that the initial value problem (BVP) (8)-(9) is equivalent to the Volterra integral equation in specific type. In order to obtain the particular Volterra integral equation corresponding to BVP (8)-(9), we observe that the solution y ∈ C[0, 1] of equation (8) is where a 0 , a 1 , . . . , a n-1 ∈ R. By using the boundary conditions y(0) = y (0) = · · · = y (n-2) (0) = 0, we have a 0 = a 1 = · · · = a n-2 = 0. Therefore, the solution is reduced to y(t) = a n-1 t n-1 + I α f (t, y(t)). To possess the coefficient a n-1 , we apply the boundary condition y(1) = η 0 y(s) ds. This yields which is equivalent to a n-1 = (1s) α-1 f s, y(s) ds = η n n a n-1 Hence, Substituting a n-1 in y(t), we obtain the solution of BVP (8)- (9) as the solution of the Volterra integral equation in the following form: As a common technique, we introduce the integral operator in order to find a suitable fixed point problem with T : Here, we note that the solution of BVP (8)-(9) is given by Ty = y. To achieve the existence of a solution, let the metric space (C[0, 1], · ∞ ) be endowed with a directed graph G = (V (G), E(G)). In addition, let us consider the following conditions, which will be assumed later.
where the constant K 1 satisfies (H 2 ) There exists u 0 ∈ C[0, 1] such that (u 0 , Tu 0 ) ∈ E(G); It is worth mentioning that the term K 1 in condition (H 1 ) is well defined due to the positivity of each term. Next, we prove the following result. Proof It is not hard to see that (H 3 ) implies T is g-edge preserving with respect to G, where g : C[0, 1] → C[0, 1] is the identity map. Thenceforth, we will omit g in our proof.
In addition, (H 4 ) implies that (C[0, 1], · ∞ , G) has the property A, and (H 5 ) implies that E(G) has the transitivity property. Now, we will focus on the actual contraction property of the operator T. To this end, observe that by (H 1 ), for all t ∈ [0, 1] and for all u, v ∈ C[0, 1] such that (u, v) ∈ E(G), we have That is, Simple calculations give By (H 1 ), we have K 1 ≤ 1 c 0 . We then arrive at Using the fact that φ(r) < r for all r ∈ (0, 1], we may define h : At this point, all the conditions of Theorem 10 are satisfied. Therefore, there exists u * ∈ C[0, 1] such that Tu * = u * as required.
Note that in the case n = 2, simple calculation gives .
We end this section with the following example.

Numerical experiments
In the last part, we note that the iterative approach can be used to study numerical solutions for the fractional BVP. This is the well-known Picard iterative method y k+1 = Ty k , k = 0, 1, 2, 3, . . . , which can be considered as f ≡ I and g ≡ T in our main results. Here, we apply the iterative method to solve and compare the approximate solutions with their exact solutions. In order to identify the method, we first establish the correctional function for BVP (8) as Starting from the initial point y 0 , the successive approximate solutions can be obtained by calculating the integral appeared in equation (11). Occasionally, it might be difficult to calculate the integral directly due to the nonlinearity of f (t, ·).
According to [32], we shall present an explicit algorithm for solving an approximate solution of the integral via the operator T defined above. For the numerical computations, the interval [0, 1] is partitioned into N subintervals. Let Z 0 be the uniform partition scale of the interval [0, 1] by the length t = 1 N and t i = (i -1) t. For convenience, we let t * i = t i+1 +t i 2 , for i = 0, 1, 2, . . . , N . Then we obtain that Moreover, for t j ∈ Z 0 , we see that For the first term in the right-hand side of equation (11), we let η = t p + , where 0 ≤ < t p+1 . Consider In the succeeding part, we present several numerical experiments to support the capability of the proposed algorithm. The computer programs are written in MATLAB. Through the simulations, the accuracy goal is set to be 10 -16 and maximum iteration T max = 100. The purpose of the first example is to provide a numerical study of the solution in the special case α = 2.5 of Example 2. Additionally, the numerical solutions are compared with an analytic solution in order to examine the efficiency of the present algorithm. We also estimate the rate of convergence by using two numerical solutions with different length of discretization N 1 and N 1 /2, corresponding to the formula Rate = log 2 Error 1 ∞ / Error 2 ∞ , which has been widely used (see, for example, [33][34][35][36][37]).
Here, we note that g(t) = -t 3 + t 2 + 48 and L = 1 4 (0.5) ≈ 0.14104 < (4.5) 4 (3.5) ≈ 0.8308 := K 1 in Example 2. In this situation, we immediately obtain that the BVP has at least one solution in C[0, 1]. In fact, it is not difficult to see that y(t) = t 3t 2 is a solution to the problem, which is helpful for checking the accuracy of the proposed numerical schemes. With u 0 (t) = t and N = 1250, 2500, 5000, 10,000, and 20,000, we apply the numerical schemes for solving this problem. Table 1 shows the errors in various values of iteration k = 2, 4, 6, 8, and 10 with different N . The results suggest that the accuracy is slightly improved as N increases. The error obtained drops significantly after the two-round iteration; however, the iteration number does not significantly impact the accuracy of the schemes after the four-round iteration. The numerical solutions for k = 1, 2, 5, and 10 with N = 2500 are plotted in Fig. 1(a), and the maximum errors are presented in Fig. 1(b). Additionally, Table 2 presents the number of iteration which reaches the accuracy goal = 10 -16 and the rate of convergence. From the table it can be observed that the convergence rate of the numerical algorithm seems to be approximately 1.5, which is illustrated in Fig. 2.   Observe that α = 3.5, η = 1, and f (t, y(t)) = L(arctan y(t) + sin t). In order to obtain the existence result, we compute where φ(t) = t 2 . By direct computations, we see that condition (H * 1 ) holds when 2L < 4.4233. Therefore, the conclusion of Corollary 14 applies and, consequently, BVP (13) has at least one solution in C[0, 1] for all L < 2.2117. Here, we provide numerical simulations when L = 1 and 2. It is worth mentioning that our simulations are carried out under the setting N = 5000 with u 0 (t) = t. The numerical solutions for k = 1, 2, 5, and 10 are plotted in Fig. 3, where the cases L = 1 and L = 2 are given in (a) and (b), respectively.

Conclusions
In this paper, we have studied h-φ contraction mappings with two metrics endowed with a directed graph and proved some existence criteria of common fixed points. By applying our main results, the existence of the solution for Caputo fractional boundary value problems of order α ∈ (n -1, n] with the integral boundary condition type, where n ≥ 2 is an integer, is obtained. Besides, we have successfully constructed a Picard-based iterative strategy for solving certain types of Caputo fractional boundary value problems of order α ∈ (n -1, n]. The present iterative algorithm is based on numerical integration, which produces a computationally cost-effective solver. The numerical experiments confirm that the proposed algorithm is robust and reliable. Moreover, the results suggest that the order of convergence is approximately 1.5 in the case of α = 2.5 as shown in Example 3. Based on these findings, there is still a lot of space for future works, especially the details of the error analysis, rate of convergence, theoretical investigation, and the limitations of the present algorithm. However, it is worth noting that numerical results give a new aspect to study the solution behavior for other types of Caputo fractional boundary value problems.