1 Introduction

In recent years, many research works have been interested in fractional differential equations. This is due, first, to their widespread applications in diverse fields of engineering and natural sciences, and secondly to the intensive development of the theory of fractional calculus (see [112]). Furthermore, fractional differential equations with delays have proven more realistic in the description of natural phenomena than those without delays. Therefore, the study of these equations has drawn much attention (see e.g., [1317]).

El-Sayed and Gaafar [16] established sufficient conditions for the existence and uniqueness of a solution to some nonlinear Riemann-Liouville fractional differential systems with constant delays. Also, they proved the stability of the solution. Recently, this study has been extended to another class of nonlinear fractional differential equations with delay in [17].

In the current paper, motivated and inspired by the works of [16, 17], we treat the same questions, but with time-dependent delays. Thus, we consider a system of nonlinear fractional differential equations with variable delays of the form

D α c x i (t)= j = 1 n f i j ( t , x i ( t ) , x j ( t τ j ( t ) ) ) ,i=1,2,,n,t>0,
(1.1)
x(t)=Φ(t),t[τ,0],
(1.2)

where D α c is the Caputo fractional derivative of order α(0,1), x(t)= ( x 1 ( t ) , , x n ( t ) ) , where ′ denotes the transpose of the vector, and f i j : R + × R 2 R are continuous functions for i,j=1,2,,n, τ j are continuous real-valued functions defined on R + , such that τ=max{ sup t R + τ j (t):j=1,2,,n}>0, and Φ(t)= ( ϕ 1 ( t ) , , ϕ n ( t ) ) is a given vector function defined on [τ,0] with values in R n .

Our purpose is to establish sufficient conditions for the existence and uniqueness of a solution to the problem (1.1)-(1.2), by applying the Banach contraction principle. Furthermore, we prove the uniform stability of the solution.

While most existing research focuses on constant delays, the considered equations (1.1) contain variable delays. Moreover, it is important to note that our results are valid even in the case where the equations are of mixed type. Namely, equations of mixed type are those that have both retarded and advanced arguments. This makes a net difference with the previous works (see Remark 3.3). Thus, the present work generalizes the results obtained in [16, 17].

This paper is organized as follows. In Section 2, we introduce some basic definitions and notations, which are used in the sequel of the paper. In Section 3 and Section 4, we present our main results. Finally, in Section 5, two examples are given, as applications to illustrate our results.

2 Definitions and notations

Let us start by giving the definition of Riemann-Liouville fractional integral, and Caputo fractional derivatives. Further details of related basic properties used in the text can be found in [3, 5, 8].

Definition 2.1 Let αR. The Riemann-Liouville fractional integral operator I α is defined on L 1 [0,T] by

I α f(t):= 1 Γ ( α ) 0 t ( t s ) α 1 f(s)ds,t[0,T],

where Γ() is the gamma function.

For α=0, we set I 0 :=Id, the identity operator. The operator I α has the semigroup property, that is, for α,β R + and f L 1 [0,T], the identity

I α I β f(t)= I α + β f(t)

holds almost everywhere on [0,T]. Moreover, if fC[0,T] or α+β1, then the identity holds everywhere on [0,T].

If n N , and D n f (or f ( n ) ) means the n th derivative of a function f, then we have the following definition.

Definition 2.2 Let n=[α], and assume D n f L 1 [0,T]. The Caputo fractional derivative of order a real number α0 is defined by

D α c f(t)= I n α D n f(t)= 1 Γ ( n α ) 0 t ( t s ) n α 1 f ( n ) (s)ds,t0.

3 Existence and uniqueness

In this section we prove the existence and uniqueness of the solution of the problem (1.1)-(1.2).

Lemma 3.1 The vector function x(t):=( x 1 (t),, x n (t)) is a solution of the problem (1.1)-(1.2) if and only if

x i (t)= { ϕ i ( 0 ) + j = 1 n I α f i j ( t , x i ( t ) , x j ( t τ j ( t ) ) ) , t > 0 , ϕ i ( t ) , t [ τ , 0 ] , i = 1 , 2 , , n .
(3.1)

Proof For t>0 and i=1,2,,n, (1.1) can be written as

I 1 α D x i (t)= j = 1 n f i j ( t , x i ( t ) , x j ( t τ j ( t ) ) ) .

Applying the operator I α on both sides of the last equality, we obtain

I D x i ( t ) = j = 1 n I α f i j ( t , x i ( t ) , x j ( t τ j ( t ) ) ) , x i ( t ) x i ( 0 ) = j = 1 n I α f i j ( t , x i ( t ) , x j ( t τ j ( t ) ) ) .

Then

x i (t)= ϕ i (0)+ j = 1 n I α f i j ( t , x i ( t ) , x j ( t τ j ( t ) ) ) .

 □

Let us denote by E the class of all continuous column vector-valued functions C( R + , R n ) equipped with the norm given by

x N = i = 1 n sup t R + { e N t | x i ( t ) | } ,xE,

where N R + will be chosen later. We define the integral operator F:EE by

F x i (t)= { ϕ i ( 0 ) + j = 1 n I α f i j ( t , x i ( t ) , x j ( t τ j ( t ) ) ) , t > 0 , ϕ i ( t ) , t [ τ , 0 ] .

Theorem 3.2 Assume that the following hypotheses are satisfied:

(H1) Let f i j : R + × R 2 R be a continuous function, satisfying the Lipschitz condition

| f i j (t, x i , y j ) f i j (t, u i , v j )| k i | x i u i |+ h j | y j v j |,

where k i , h j >0, i,j= 1 , n ¯ .

(H2) For j=1,2,,n, τ j C( R + ,R) and

τ j (t)>τ,t>0.

(H3) For j=1,2,,n, t j >0 such that

{ τ j ( t ) t , t [ 0 , t j ] , τ j ( t ) < t , t ] t j , + [ .

(H4)

n τ α [ i = 1 n k i + j = 1 n h j e ] <1.

Then the problem (1.1)-(1.2) has a unique solution.

Proof Let x,yE, then for i=1,2,,n and t>0 we have

| F x i ( t ) F y i ( t ) | = | j = 1 n 0 t ( t s ) α 1 Γ ( α ) { f i j ( s , x i ( s ) , x j ( s τ j ( s ) ) ) f i j ( s , y i ( s ) , y j ( s τ j ( s ) ) ) } d s | j = 1 n 0 t ( t s ) α 1 Γ ( α ) | f i j ( s , x i ( s ) , x j ( s τ j ( s ) ) ) f i j ( s , y i ( s ) , y j ( s τ j ( s ) ) ) | d s j = 1 n k i 0 t ( t s ) α 1 Γ ( α ) | x i ( s ) y i ( s ) | d s + j = 1 n h j 0 t j ( t s ) α 1 Γ ( α ) | ϕ j ( r j ( s ) ) ϕ j ( r j ( s ) ) | d s + j = 1 n h j t j t ( t s ) α 1 Γ ( α ) | x j ( r j ( s ) ) y j ( r j ( s ) ) | d s n k i 0 t ( t s ) α 1 Γ ( α ) | x i ( s ) y i ( s ) | d s + j = 1 n h j t j t ( t s ) α 1 Γ ( α ) | x j ( r j ( s ) ) y j ( r j ( s ) ) | d s ,

where r j (s)=s τ j (s), thus

e N t | F x i ( t ) F y i ( t ) | n k i 0 t ( t s ) α 1 Γ ( α ) e N ( t s ) e N s | x i ( s ) y i ( s ) | d s + j = 1 n h j t j t ( t s ) α 1 Γ ( α ) e N ( t r j ( s ) ) e N r j ( s ) | x j ( r j ( s ) ) y j ( r j ( s ) ) | d s n k i sup ξ R + { e N ξ | x i ( ξ ) y i ( ξ ) | } 0 t ( t s ) α 1 Γ ( α ) e N ( t s ) d s + j = 1 n h j sup ξ R + { e N r j ( ξ ) | x j ( r j ( ξ ) ) y j ( r j ( ξ ) ) | } t j t ( t s ) α 1 Γ ( α ) e N ( t r j ( s ) ) d s n k i sup ξ R + { e N ξ | x i ( ξ ) y i ( ξ ) | } 1 N α 0 N t u α 1 e u Γ ( α ) d u + j = 1 n h j sup ξ R + { e N ξ | x j ( ξ ) y j ( ξ ) | } 1 N α 0 N ( t t j ) u α 1 Γ ( α ) e u e N τ j ( t u N ) d u n k i sup ξ R + { e N ξ | x j ( ξ ) y j ( ξ ) | } 1 N α 0 N t u α 1 e u Γ ( α ) d u + j = 1 n h j sup ξ R + { e N ξ | x j ( ξ ) y j ( ξ ) | } 1 N α 0 N ( t t j ) u α 1 Γ ( α ) e u e N τ d u n k i N α sup ξ R + { e N ξ | x j ( ξ ) y j ( ξ ) | } + j = 1 n h j e N τ N α sup ξ R + { e N ξ | x j ( ξ ) y j ( ξ ) | } n k i N α x y N + j = 1 n h j e N τ N α x y N .

Therefore,

i = 1 n sup t R + { e N t | F x i ( t ) F y i ( t ) | } [ i = 1 n n k i N α + i = 1 n j = 1 n h j e N τ N α ] x y N n N α [ i = 1 n k i + j = 1 n h j e N τ ] x y N .

Let us choose N= 1 τ . So, we have

i = 1 n sup t R + { e N t | F x i ( t ) F y i ( t ) | } n τ α [ i = 1 n k i + j = 1 n h j e ] x y N .

From hypothesis (H4) we have n τ α [ i = 1 n k i + j = 1 n h j e]<1. So, F:EE is a contraction. Hence, it has a unique fixed point x=Fx which is precisely the unique solution of our problem (1.1)-(1.2). □

Remark 3.3 Note that, if for some j the delay function τ j (t) takes negative values, which is possible under the assumptions (H2) and (H3), then (1.1) are with advanced arguments. Thus, the sign of the delay functions being arbitrary, the equations of the considered system (1.1) may contain both types of deviation of argument i.e. both delay and advance. As far as we know, there are no published studies addressing these issues for such systems of equations. However, concerning boundary value problems of fractional order, some results on the existence of solutions are obtained in [18]. But in [18], the authors considered problems involving only an advanced argument, and they do not address the question about the uniqueness (and the stability) of the solution.

4 Stability

In this section we study the stability of the solution of the problem (1.1)-(1.2).

Definition 4.1 The solution of the problem (1.1)-(1.2) is stable if for any ϵ>0, there exists δ>0 such that for any two solutions x(t)= ( x 1 ( t ) , , x n ( t ) ) and x ˜ (t)= ( x ˜ 1 ( t ) , , x ˜ n ( t ) ) with the initial condition (1.2) and x ˜ (t)= Φ ˜ (t) for t[τ,0], respectively, one has Φ Φ ˜ δ, implies x x ˜ N ϵ, where denotes the supremum norm defined by Ψ= i = 1 n max t [ τ , 0 ] | ψ i (t)|, for all bounded vector function Ψ from [τ,0] to R n .

Theorem 4.2 Assume that hypotheses (H1)-(H4) in Theorem 3.2 are satisfied, then the solution of the problem (1.1)-(1.2) is uniformly stable.

Proof Let x(t) and x ˜ (t) be the solutions of the system (1.1) under the conditions (1.2) and { x ˜ (t)= Φ ˜ (t) for t[τ,0]}, respectively. Then for t>0, from (3.1), we have

x i ( t ) x ˜ i ( t ) = ϕ i ( 0 ) ϕ ˜ i ( 0 ) + j = 1 n I α { f i j ( t , x i ( t ) , x j ( t τ j ( t ) ) ) f i j ( t , x ˜ i ( t ) , x ˜ j ( t τ j ( t ) ) ) } .

Therefore,

| x i ( t ) x ˜ i ( t ) | | ϕ i ( 0 ) ϕ ˜ i ( 0 ) | + j = 1 n 0 t ( t s ) α 1 Γ ( α ) | f i j ( s , x i ( s ) , x j ( s τ j ( s ) ) ) f i j ( s , x ˜ i ( s ) , x ˜ j ( s τ j ( s ) ) ) | d s | ϕ i ( 0 ) ϕ ˜ i ( 0 ) | + j = 1 n k i 0 t ( t s ) α 1 Γ ( α ) | x i ( s ) x ˜ i ( s ) | d s + j = 1 n h j 0 t j ( t s ) α 1 Γ ( α ) | ϕ j ( s τ j ( s ) ) ϕ ˜ j ( s τ j ( s ) ) | d s + j = 1 n h j t j t ( t s ) α 1 Γ ( α ) | x j ( s τ j ( s ) ) x ˜ j ( s τ j ( s ) ) | d s max s [ τ , 0 ] | ϕ i ( s ) ϕ ˜ i ( s ) | + n k i 0 t ( t s ) α 1 Γ ( α ) | x i ( s ) x ˜ i ( s ) | d s + j = 1 n max s [ τ , 0 ] | ϕ j ( s ) ϕ ˜ j ( s ) | h j 0 t j ( t s ) α 1 Γ ( α ) d s + j = 1 n h j t j t ( t s ) α 1 Γ ( α ) | x j ( s τ j ( s ) ) x ˜ j ( s τ j ( s ) ) | d s .

Hence,

e N t | x i ( t ) x ˜ i ( t ) | e N t max s [ τ , 0 ] | ϕ i ( s ) ϕ ˜ i ( s ) | + n k i 0 t ( t s ) α 1 Γ ( α ) e N ( t s ) e N s | x i ( s ) x ˜ i ( s ) | d s + e N t j = 1 n max s [ τ , 0 ] | ϕ j ( s ) ϕ ˜ j ( s ) | h j Γ ( α + 1 ) [ t α ( t t j ) α ] + j = 1 n h j t j t ( t s ) α 1 Γ ( α ) e N ( t r j ( s ) ) e N r j ( s ) | x j ( r j ( s ) ) x ˜ j ( r j ( s ) ) | d s max s [ τ , 0 ] | ϕ i ( s ) ϕ ˜ i ( s ) | + j = 1 n max s [ τ , 0 ] | ϕ j ( s ) ϕ ˜ j ( s ) | h j t j α Γ ( α + 1 ) + n k i sup ξ R + { e N ξ | x i ( ξ ) x ˜ i ( ξ ) | } 0 t ( t s ) α 1 Γ ( α ) e N ( t s ) d s + j = 1 n h j sup ξ R + { e N r j ( ξ ) | x j ( r j ( ξ ) ) x ˜ j ( r j ( ξ ) ) | } t j t ( t s ) α 1 Γ ( α ) e N ( t r j ( s ) ) d s max s [ τ , 0 ] | ϕ i ( s ) ϕ ˜ i ( s ) | + j = 1 n max s [ τ , 0 ] | ϕ j ( s ) ϕ ˜ j ( s ) | h j t j α Γ ( α + 1 ) + n k i sup ξ R + { e N ξ | x i ( ξ ) x ˜ i ( ξ ) | } 1 N α 0 N t u α 1 Γ ( α ) e u d u + j = 1 n h j sup ξ R + { e N ξ | x j ( ξ ) x ˜ j ( ξ ) | } 1 N α 0 N ( t t j ) u α 1 Γ ( α ) e u e N τ j ( t u N ) d u max s [ τ , 0 ] | ϕ i ( s ) ϕ ˜ i ( s ) | + j = 1 n Φ Φ ˜ h j t j α Γ ( α + 1 ) + n k i N α sup ξ R + { e N ξ | x i ( ξ ) x ˜ i ( ξ ) | } + j = 1 n h j e N τ N α sup ξ R + { e N ξ | x j ( ξ ) x ˜ j ( ξ ) | } max s [ τ , 0 ] | ϕ i ( s ) ϕ ˜ i ( s ) | + j = 1 n Φ Φ ˜ h j t j α Γ ( α + 1 ) + n k i N α x x ˜ N + j = 1 n h j e N τ N α x x ˜ N .

Then

i = 1 n sup t R + { e N t | x i ( t ) x ˜ i ( t ) | } i = 1 n max s [ τ , 0 ] | ϕ i ( s ) ϕ ˜ i ( s ) | + i = 1 n j = 1 n Φ Φ ˜ h j t j α Γ ( α + 1 ) + i = 1 n n k i N α x x ˜ N + i = 1 n j = 1 n h j e N τ N α x x ˜ N Φ Φ ˜ + n j = 1 n h j t j α Γ ( α + 1 ) Φ Φ ˜ + n i = 1 n k i N α x x ˜ N + n j = 1 n h j e N τ N α x x ˜ N [ 1 + n j = 1 n h j t j α Γ ( α + 1 ) ] Φ Φ ˜ + n [ i = 1 n k i + j = 1 n h j e N τ ] N α x x ˜ N .

It follows that

[ 1 n [ i = 1 n k i + j = 1 n h j e N τ ] N α ] x x ˜ N [ 1 + n j = 1 n h j t j α Γ ( α + 1 ) ] Φ Φ ˜ .

We choose N= 1 τ , and we have

[ 1 n τ α [ i = 1 n k i + j = 1 n h j e ] ] x x ˜ N [ 1 + n j = 1 n h j t j α Γ ( α + 1 ) ] Φ Φ ˜ .

Therefore, given any ϵ>0, there exists

δ= [ 1 n τ α [ i = 1 n k i + j = 1 n h j e ] ] [ 1 + n j = 1 n h j t j α Γ ( α + 1 ) ] 1 ϵ>0,

such that if Φ Φ ˜ <δ, then x x ˜ N ϵ, which shows that the solution of the problem (1.1)-(1.2) is uniformly stable. □

5 Applications

Example 5.1 Consider the problem

{ D α c x 1 ( t ) = 10 3 x 1 2 ( t ) + 1 + 10 2 x 2 2 ( t τ 2 ( t ) ) + 1 , D α c x 2 ( t ) = 10 1 x 2 2 ( t ) x 2 ( t ) + 1 + 10 2 x 3 2 ( t τ 3 ( t ) ) x 3 ( t τ 3 ( t ) ) + 1 , D α c x 3 ( t ) = 10 3 x 3 2 ( t ) + 1 + 10 2 x 1 2 ( t τ 1 ( t ) ) + 1 , t>0,

and

x(t)=Φ(t),t[τ,0],

where α=0.8, τ j (t)= 4 3 1 j + t for j=1,2,3. τ= max t R + τ j (t)= 4 3 .

It is easy to see that the conditions (H1) and (H2) of Theorem 3.2 hold. Also, t j = 4 3 j + 9 j 2 + 24 j 20 6 such that

{ τ j ( t ) t , t [ 0 , t j ] , τ j ( t ) < t , t ] t j , + [ ,

and

3 τ α [ i = 1 3 k i + j = 1 3 h j e ] =0.9523063402<1,

where k 1 = k 3 = 10 3 , k 2 = 10 1 8 3 9 , h 1 = h 2 = 10 2 and h 3 = 10 2 8 3 9 .

Hence, all hypotheses of Theorem 3.2 are fulfilled. Thus, the problem has a unique solution, and by Theorem 4.2 the solution is uniformly stable. Therefore, as a conclusion, the problem has a unique uniform stable solution.

Example 5.2 Consider the problem

{ D α c x 1 ( t ) = 10 1 { x 1 2 ( t ) + 1 + x 2 2 ( t τ 2 ( t ) ) + 1 } , D α c x 2 ( t ) = 10 2 { x 2 ( t ) + x 1 ( t τ 1 ( t ) ) } , t>0,

and

x(t)=Φ(t),t[τ,0],

where α=0.4, τ j (t)= 5 4 1 j + t for j=1,2. τ= max t R + τ j (t)= 5 4 .

It is easy to see that the conditions (H1) and (H2) of Theorem 3.2 hold. Also, t j = 4 j + 16 j 2 + 8 8 such that

{ τ j ( t ) t , t [ 0 , t j ] , τ j ( t ) < t , t ] t j , + [

and

2 τ α [ i = 1 2 k i + j = 1 2 h j e ] =0.8943942329<1,

where k 1 = h 2 = 10 1 and k 2 = h 1 = 10 2 .

Hence, all hypotheses of Theorem 3.2 are satisfied. Thus, the problem has a unique solution. Moreover, by Theorem 4.2 the solution is uniformly stable. Therefore, as a conclusion, the problem has a unique uniform stable solution.