Next Article in Journal
Stability Analysis of Fractional-Order Nonlinear Alcohol Consumption Model and Numerical Simulation
Next Article in Special Issue
On a Preloaded Compliance System of Fractional Order: Numerical Integration
Previous Article in Journal
On Product Neutrosophic Fractal Spaces and α-Density Theory with Arbitrarily Small and Controlled Error
Previous Article in Special Issue
Positive Solutions and Their Existence of a Nonlinear Hadamard Fractional-Order Differential Equation with a Singular Source Item Using Spectral Analysis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Well-Posedness of the Mild Solutions for Incommensurate Systems of Delay Fractional Differential Equations

Data Recovery Key Laboratory of Sichuan Province, College of Mathematics and Information Science, Neijiang Normal University, Neijiang 641100, China
Fractal Fract. 2025, 9(2), 60; https://doi.org/10.3390/fractalfract9020060
Submission received: 29 December 2024 / Revised: 11 January 2025 / Accepted: 19 January 2025 / Published: 21 January 2025

Abstract

:
Systems of incommensurate delay fractional differential equations (DFDEs) with non-vanishing constant delay of retarded type are investigated. It is shown that the mild solutions are well-posed in Hadamard sense on the space of continuous functions. The analysis is local and carried out for finite intervals. The strong results are obtained with weak conditions by using state-of-the-art new methods. No condition on the Lipschitz parameter is added for well-posedness results. Application of this theorem for the Hopfield neural network is carried out.

1. Introduction

Fractional differential equations (FDEs) have found extensive use in the modeling of complex systems, primarily due to their ability to represent memory in systems dynamics [1,2]. Fortunately, there are various fractional derivatives, each having different memory kernels. This diversity, provide us with a rich set of operators capable of capturing the intricate dynamics of complex natural systems [3].
Similar to FDEs, delay differentiate equations (DDEs) have been widely applied in mathematical models, especially in biological phenomena [4]. However, DDEs are rarely studied and well-analyzed in connection to FDEs. The analysis of the linear delay fractional differential equation (DFDE),
D ψ y ( t ) = a y ( θ ( t ) ) + b y ( t ) + f ( t ) , t > 0 , ψ ( 0 , 1 ) , a , b R , f C [ 0 , T ] ,
has been explored in [5]. In their paper, the lag term is defined by θ ( t ) : = t τ with a constant time delay τ > 0 . This study covers the uniqueness of the mild solution and the dependency of the mild solution on its parameters. The stability of the problem (1) has also been studied [6].
We note that such DFDEs are known as retarded ones since the lag term does not involve fractional derivatives. If the equation involves terms like D ψ y ( θ ( t ) ) , the equation becomes a neutral type, which we do not study here. The existence result of fractional-order neutral time-delay systems can be found in [7].
Most applied problems can not be modeled by a simple one-D equations like (1). A state of natural systems involves more than one component that are connected to each other to achieve an aim. In mathematics, a system is described by more than one equation. If the dynamics of each state depend on other states, it is called a coupled system. FDEs and DFDEs are utilized in diverse modeling. Currently, there is abundant work in biology, mechanics, electronics, and other branch of science that use systems of FDEs in their modeling. However, they usually use a common order for all equations. But there is no need for all states to have the same memory and thus the same order of derivatives [8,9]. Therefore, the systems that may have different orders for each equation must be important for modeling. Such systems are known as incommensurate systems [10,11]. Incommensurate FDEs have been used in the structure of fractional Hopfield neural networks (FHNNs) [11,12,13].
A linear incommensurate system of DFDEs with multiple delays (multi-delay) can be described by
C D ψ 1 y 1 ( t ) = a 11 y 1 ( t ) + + a 1 ν y ν ( t ) + b 11 y 1 ( θ 1 ( t ) ) + + b 1 ν y ν ( θ ν ( t ) ) + f 1 ( t ) ,      ⋮ C D ψ ν y ν ( t ) = a ν 1 y 1 ( t ) + + a ν ν y ν ( t ) + b ν 1 y 1 ( θ 1 ( t ) ) + + b ν ν y ν ( θ ν ( t ) ) + f ν ( t ) ,
where ψ i ( 0 , 1 ) , a i j , b i , j R and f i : [ 0 , T ] R C [ 0 , T ] , y i : [ 0 , T ] R C [ 0 , T ] , for i , j = 1 , ,   ν . This system can be expressed in shorthand as
D Ψ Y ( t ) = A Y ( t ) + B Y ( Θ ( t ) ) + F ( t )
where Ψ = [ ψ 1 , , ψ ν ] T ( 0 , 1 ) ν , Y = [ y 1 , , y ν ] T ( C [ 0 , T ] ) ν , F = [ f 1 , , f ν ] T ( C [ 0 , T ] ) ν , Θ = [ θ 1 , , θ ν ] T , θ i ( t ) = t τ i , τ i R , A = ( a i j ) and B = ( b i j ) . The meaning of such vector operators later will be recalled. Problem (2) has been studied subject to delay condition
y i ( t ) = g i ( t ) , t ( τ i , 0 ] .
If we assume that all delays are equal (i.e., τ i = τ where τ > 0 is a positive constant), then the initial condition and prehistoric conditions (4) can be expressed as
Y ( t ) = G ( t ) , t ( τ , 0 ] .
Such delays are also referred to as a single/constant delay. In this case, the lag term is a single function, and we simply use θ to represent it, where θ ( t ) : = t τ .
The nonlinear DFDE with a constant delay can be described by
C D ψ 1 y 1 ( t ) = u 1 t , y 1 ( t ) ,   ,   y ν ( t ) , y 1 ( θ ( t ) ) ,   ,   y ν ( θ ( t ) ) ,      ⋮ C D ψ ν y ν ( t ) = u ν t , y 1 ( t ) ,   ,   y ν ( t ) , y 1 ( θ ( t ) ) ,   ,   y ν ( θ ( t ) ) ,
subject to condition (5). It can be written in a compact form as
D Ψ Y ( t ) = U ( t , Y ( t ) , Y ( Θ ( t ) ) ) .
where Θ ( t ) = [ θ ,   ,   θ ] T . We note that the related operations of Y ( Θ ( t ) ) are explained for the algebra of the vector-valued function in the next sections, and they are not composite functions.
There are studies on systems with various delays for each state [14]. Specifically, ref. [14] addresses the stability of a class of incommensurate DFDEs with multiple delays. A numerical method for nonlinear systems of DFDE with a single/constant delay τ i = τ and commensurate order ψ i = ψ has been studied in [15]. The stability of a class of commensurate systems (3) with a constant delay, where A is a zero matrix, is studied in [16].
The objective of this paper is to study System (6) with constant delay. Such systems may appear in research papers, but fundamental questions regarding these systems, such as the existence of a unique solution and well-posedness are still unstudied. Existence results for systems of fractional equations typically utilize fixed-point theorems like the Banach fixed-point or Schauder fixed-point theorems. However, as discussed in [17] and other relative works, these types of theorems impose additional conditions on U or even T . Therefore, we apply the state-of-the-art method used in [17] to obtain strong results under weaker conditions. In the main theorems, we will find that continuity of the functions U and G and Lipschitz continuity of the function U with respect to Y is sufficient to guaranty the existence of the unique mild solution. Moreover, we show it is sufficient to ensure the continuous dependency of the mild solution to G, if we assume U is also Lipschitz continuous with respect to W.
Remark 1.
The fractional derivative and integral operators have two parameters. For example, in RL integral
I ψ y ( t ) ( s ) = 1 Γ ( ψ ) 0 s ( s t ) 1 ψ y ( t ) d t .
the variable t is the dummy variable, and s is the active variable. Usually, in the literature, the active variable is deleted. However, in this paper, for clarity, we may add the second variable to separate the dummy variable and active variable.

2. Vector-Valued Operational Algebra

Here, we clarify the algebra of vector-valued functions and their related operations through exact definitions. Suppose Y is a space of functions, and
F = [ f 1 , , f ν ] T : [ 0 , T ] R ν Y ν
is a vector-valued function. For operators o i : Y Y , we define the vector-operator
O = [ o 1 , , o ν ] T : Y ν Y ν
by
O ( F ) = [ o 1 ( f 1 ) , , o ν ( f ν ) ] T = Diag ( [ o 1 , , o ν ] ) F .
Such an O can be D Ψ C = [ D Ψ 1 C , , D Ψ ν C ] T or I Ψ = [ I ψ 1 , , I ψ ν ] T .
The elementary operations such as addition, difference, product, division, and power operations of vector-valued functions are performed element-wise. For example, if G = [ g 1 , , g ν ] : [ 0 , T ] R ν is another vector-valued function
F ± G = [ f 1 ± g 1 , , f ν ± g ν ] T .
Let Θ = [ θ 1 , , θ ν ] T : [ 0 , T ] R ν be a vector-lag term. Clearly, F ( Θ ) is not well-defined as a composite function. However, we define it as vector-wise composite functional,
F ( Θ ) = [ f 1 ( θ 1 ) , , f ν ( θ ν ) ] T .
We note that, in our study Θ = [ θ , , θ ] T can be substituted by θ and serve as a composite function! Consequently, in our study, F ( Θ ) = F ( θ ) . However, in multi-delay cases, the use of element-wise composition is indispensable.
The operation of one-dimensional functions and operators with a scalar is inherited by all elements of the vector. For example, if f : [ 0 , T ] R is a scalar function, as well as Ψ = [ ψ 1 , , ψ ν ] , then G = f Ψ is defined by
G = [ f ψ 1 , , f ψ ν ] T .
Example 1.
For Ψ = [ ψ 1 , , ψ ν ] T and P = [ p 1 , , p ν ] T , we have
I Ψ t P = Γ ( P + 1 ) Γ ( P + Ψ + 1 ) t Ψ + P .
We note that this equation is exactly similar to the computation of the non-vector case of I α t β . However, we should note that the notation here has a different meaning. To be more clear, the right-hand side of Equation (9) is
[ Γ ( p 1 + 1 ) Γ ( p 1 + ψ 1 + 1 ) t p 1 + ψ 1 , , Γ ( p ν + 1 ) Γ ( p ν + ψ ν + 1 ) t p ν + ψ ν ] T !
Theorem 1.
Let 0 < ψ i 1 , i = 1 , , ν and Y ( AC [ 0 , T ] ) ν . Then,
I Ψ D Ψ C Y = Y ( t ) Y ( 0 )
and
D Ψ C I Ψ Y ( t ) = Y ( t ) .
Theorem 2
(Generalized Gronwall inequality [18,19]). Suppose q , T > 0 , c 0 and y : [ 0 , T ] R is a locally integrable and no-negative function satisfying
y ( t ) c + M 0 t ( t a ) ψ 1 y ( s ) d s
Then, y ( t ) c E ψ ( M Γ ( ψ ) t ψ ) .

3. Existence of a Unique Continuous Mild Solution with Single Delay

Applying the RL integral I Ψ to both sides of (3), we obtain
Y ( t ) = Y ( 0 ) + I Ψ A Y ( t ) + I Ψ B Y ( Θ ( t ) ) .
It is well-known that the solution to (13) may not be differentiated, or may not be in AC (see, for example, [20]). So, the solution of (13) may not satisfies the original Equation (3). But, in most applied mathematics, we need a solution of the model based on (3). Therefore, we use the adjective “mild” before the word solution to emphasize that the solution of associate integral may not be the solution of the original Equation (3).
We should note that interchanging the place of the fractional integral and constant matrix in System (13) can be problematic. While this interchange is valid for commensurate systems, it is incorrect for incommensurate systems. In particular, we have
I Ψ A Y A I Ψ Y .
This leads to additional complexities for incommensurate FDEs compared to commensurate FDEs.
Similarly, and in general, from (7), we can infer that the mild solution satisfies
Y ( t ) = Y ( 0 ) + I Ψ U ( t , Y ( t ) , Y ( Θ ( t ) ) ) .
Definition 1.
We define Y as a mild solution of (7) under Condition (5) if it fulfills System (15).
Remark 2.
A solution to (15) might not be differentiable and, therefore, might not satisfy the original Problem (7) under Condition (5). However, the solution to the original problem satisfies (15).
The existence of a mild solution of incommensurate systems of FDEs has been established in [17]. Based on the discussion in that paper, the existence of a mild solution based on the Banach fixed-point theorem and the Schauder fixed-point theorem require stronger conditions. To obtain the weaker condition, the authors of [17] proposed a direct method using Cauchy sequences. They first established the result on the interval [ 0 , 1 ] and then extended the global existence using the tail part of the RL integral.
Now, consider a single delay, τ . Let t ( 0 , τ ] , which implies that t τ ( τ , 0 ] . Then, Y ( Θ ( t ) ) = G ( Θ ( t ) ) , and Equation (15) becomes equivalent to
Y ( t ) = G ( 0 ) + I Ψ U ( t , Y ( t ) , G ( Θ ( t ) ) ) , t [ 0 , τ ] .
We note that G ( Θ ( 0 ) ) = G ( τ ) is not defined. We assume G ( Θ ( 0 + ) ) = G ( τ + ) < , and extend G on [ τ , 0 ] by G ( τ ) = G ( τ + ) to use compactness of interval. It follows immediately that G C [ τ , 0 ] . Also, it is clear the value of I Ψ at t = 0 is zero for any continuous function.
We use the absolute value notation as a norm in R ν , defined by
| Y | = max i = 1 , , ν | y i | .
However, we use the norm notation for spaces of functions, especially for F ( C [ 0 , T ] ) ν
F = sup t [ 0 , T ] | F ( t ) | = sup t [ 0 , T ] max i = 1 , , ν | f i ( t ) | .
Now, consider the following hypotheses:
(H1)
U is globally Lipschitz continuous with respect to Y, i.e., L i R , such that
| u i ( t , Y , W ) u i ( t , Z , W ) | L i | Y Z |
for all t [ 0 , T ] , and for all Z , Y , W R ν .
(H2)
U : [ 0 , T ] × R ν × R ν R ν is continuous with respect to its domain.
(H3)
G is a continuous function on ( τ , 0 ] and lim t τ g i ( t ) < .
Remark 3.
Letting L = max i = 1 , , ν | L i | , it follows from (H1) that
| U ( t , Y , W ) U ( t , Z , W ) | L | Y Z | , t [ 0 , T ] , Z , Y , W R ν .
Remark 4.
More precisely, (H3) states that if we extend G to [ τ , 0 ] by G ( τ ) = lim t τ G ( t ) , then it is continuous on [ τ , 0 ] . Thus, the condition (H3) can be expressed as “G is continuous on [ τ , 0 ] ”.
Theorem 3.
Let Hypotheses (H1)–(H3) hold. Then, System (7) subject to Condition (5) processes a mild continuous solution on [ 0 , τ ] .
Proof. 
The proof is similar to Theorem 7 of [17], so we provide a proof sketch here. First, we assume τ 1 , introduce a Picard operator P by
P Y = G ( 0 ) + I Ψ U ( t , Y ( t ) , G ( Θ ( t ) ) )
and we show that the functions
Y n + 1 = P Y n , Y 0 = G 0 , n = 0 , 1 ,
are Cauchy sequences in ( C [ 0 , τ ] ) ν . Consequently, they have a uniform limit, say Y. By the uniform convergence theorem for fractional integrals, we have
lim N Y n + 1 = lim N P Y n = G ( 0 ) + I Ψ U ( t , Y N ( t ) , G ( Θ ( t ) ) ) = G ( 0 ) + I Ψ lim N U ( t , Y N ( t ) , G ( Θ ( t ) ) ) .
Since U is continuous, we can rewrite the above as
lim N Y n + 1 = G ( 0 ) + I Ψ U ( t , lim N Y N ( t ) , G ( Θ ( t ) ) ) .
Thus, Y satisfies Equation (16). Now, assume that 1 < τ 2 . Given that a solution exists on [ 0 , 1 ] , w can decompose the I Ψ into two operators: the Fredholm operator F Ψ and the Volterra operator V Ψ . The Fredholm operator is defined as
F Ψ Y ( t ) = 1 Γ ( Ψ ) 0 1 ( t z ) Ψ 1 Y ( z ) d z
and the Volterra operator is defined as
V Ψ Y ( t ) = 1 Γ ( Ψ ) 1 t ( t z ) Ψ 1 Y ( z ) d z .
We know that I Ψ = F Ψ + V Ψ . Therefore, Equation (16) can be written as
Y ( t ) = G ( 0 ) + F Ψ U ( . , Y ( . ) , G ( Θ ( . ) ) ) ( t ) + V Ψ U ( . , Y ( . ) , G ( Θ ( . ) ) ) ( t ) , t [ 0 , τ ] .
We have already established the existence of a solution of (16) on [ 0 , 1 ] . For convenience, we rename Y on [ 0 , 1 ] by Y 1 . Then, the tail of Equation (22) is known function say Z, i.e.,
Z ( t ) : = G ( 0 ) + F Ψ U ( . , Y 1 ( . ) , G ( Θ ( . ) ) ) ( t ) .
Thus,
Y ( t ) = Z ( t ) + V Ψ U ( . , Y ( . ) , G ( Θ ( . ) ) ) ( t ) , t [ 1 , τ ] .
Substituting t = s + 1 gives
Y ( s + 1 ) = Z ( s + 1 ) + 1 Γ ( Ψ ) 1 s + 1 ( s + 1 z ) Ψ 1 U ( z , Y ( z ) , G ( Θ ( z ) ) ) d z ,
where s [ 0 , τ 1 ] . If we substitute z = r + 1 , we obtain
Y ( s + 1 ) = Z ( s + 1 ) + 1 Γ ( Ψ ) 0 s ( s r ) Ψ 1 U ( r + 1 , Y ( r + 1 ) , G ( Θ ( r + 1 ) ) ) d r .
It is interesting to note that when considering the Volterra operator at the peak of dynamical System (25), it becomes an RL integral operate, and by renaming Y 2 ( s ) = Y ( s + 1 ) , we obtain
Y 2 ( s ) = Z ( s + 1 ) + J Ψ U ( r + 1 , Y 2 ( r ) , G ( Θ ( r + 1 ) ) ) ( s ) , s [ 0 , τ 1 ] .
Equation (26) is of the same form as (16). Consequently, the existence of a unique Y 2 ( C [ 0 , τ 1 ] ) ν is guaranteed in the same way. Conclusively,
Y ( t ) = Y 1 ( t ) , t [ 0 , 1 ] , Y 2 ( t 1 ) , t [ 1 , τ ] .
Clearly, Y 2 ( 1 1 ) = Y 2 ( 0 ) = Z ( 1 ) = Y 1 ( 1 ) and Y is a continuous solution to (16) on [ 0 , τ ] . By induction, (16) has a unique continuous solution for any τ > 0 . □
The uniqueness of the solution follows from the generalized Gronwall inequality.
Theorem 4.
Let Hypotheses (H1)–(H3) hold. Then, System (7) subject to condition (5) has a unique mild continuous solution on [ 0 , τ ] .
Proof. 
The proof is similar to Theorem 10 of [17]. First, we show the uniqueness for τ 1 . Let X and Y be two solutions. Then,
| x i ( t ) y i ( t ) | | I ψ i u i ( t , x i ( t ) , g i ( θ i ( t ) ) ) I ψ i u i ( t , y i ( t ) , g i ( θ i ( t ) ) ) | , t [ 0 , τ ] [ 0 , 1 ] .
Since t 1 , it follows from Hypotheses (H1) that
| x i ( t ) y i ( t ) | L i Γ ( α i ) 0 t ( t z ) ψ i 1 | X ( z ) Y ( z ) | d z        M 0 t ( t z ) ψ 1 | X ( z ) Y ( z ) | d z
where M = max i = 1 , , ν L i Γ ( α i ) and ψ = min i = 1 , , ν ψ i . We note that Inequality (28) is independent of i. Thus,
| X ( t ) Y ( t ) | M 0 t ( t z ) ψ 1 | X ( z ) Y ( z ) | d z .
Immediately, it follows from the generalized Gronwall inequity that | X ( t ) Y ( t ) | = 0 , and X ( t ) = Y ( t ) for all t [ 0 , 1 ] . Now, let τ [ 0 , 2 ] . From a previous argument, we already know that X ( t ) = Y ( t ) for t [ 0 , 1 ] . From an argument similar to the proof of Theorem (3), Y and X satisfies Equation (25) while the definition of Z only uses the information of Y ( t ) on [ 0 , 1 ] . Since Y is unique on [ 0 , 1 ] , the tail function Z is unique for all t [ 0 , τ ] . It follows from (25) that
| X ( s + 1 ) Y ( s + 1 ) | M 0 s ( s z ) ψ 1 | X ( r + 1 ) Y ( r + 1 ) | d r ,
for s [ 0 , τ 1 ] [ 0 , 1 ] . Therefore, from the generalized Gronwall inequality,
X ( s + 1 ) = Y ( s + 1 ) , s [ 0 , τ 1 ]
or, equivalently, X ( t ) = Y ( t ) on [ 1 , τ ] and, thus, on [ 0 , τ ] . Similar induction can be used to prove that X ( t ) = Y ( t ) for any delay τ > 0 . □
Up to this point, we have determined that System (1) has a unique mild solution within the interval [ 0 , τ ] , and this solution is continuous. Now, we establish the existence of a unique continuous solution for any arbitrary interval [ 0 , T ] .
Theorem 5.
Let Hypotheses (H1)–(H3) hold. Then, System (7) subject to Condition (5) processes a unique mild continuous solution on [ 0 , T ] .
Proof. 
If T < τ , the claim follows from Theorem 4. Suppose τ < T 2 τ . We already know that there exists a solution on [ 0 , τ ] . Denote this solution as Y 1 . Then, System (15) is equivalent to
Y ( t ) = G ( 0 ) + F τ Ψ U ( z , Y 1 ( z ) , G ( z τ ) ) ( t ) + V τ Ψ U ( z , Y ( z ) , Y 1 ( z τ ) ) ( t )
for t [ τ , T ] , where
F τ Ψ Y ( t ) = 1 Γ ( Ψ ) 0 τ ( t z ) Ψ 1 Y ( z ) d z
is a Fredholm operator, and
V τ Ψ Y ( t ) = 1 Γ ( Ψ ) τ t ( t z ) Ψ 1 Y ( z ) d z
is a Volterra operator. For the tail of System (31) Z ( t ) = G ( 0 ) + F τ Ψ U ( s , Y 1 ( s ) , G ( s τ ) ) ( t ) the Fredholm operator only depends on the values of Y 1 ( s ) and G 1 ( s τ ) on s [ 0 , τ ] . Since Y 1 is known to be a unique, Z is well-defined unique function. Conclusively, by substituting t = r + τ , we have (31),
Y ( r + τ ) = Z ( r + τ ) + V τ Ψ U ( s , Y ( s ) , Y 1 ( s τ ) ) ( r + τ ) .
Regarding the peak operator, by substituting z = s + τ , we obtain
V τ Ψ U ( s , Y ( s ) , Y 1 ( s τ ) ) ( r + τ ) = 1 Γ ( Ψ ) τ r + τ ( r + τ z ) Ψ 1 U ( z , Y ( z ) , Y 1 ( z τ ) ) d z                  = 1 Γ ( Ψ ) 0 r ( t z ) Ψ 1 U ( s + τ , Y ( s + τ ) , Y 1 ( s ) ) d s                  = J Ψ U ( s + τ , Y ( s + τ ) , Y 1 ( s ) ) ( r ) .
If we rename Y 2 ( t ) : = Y ( t + τ ) and consider Equation (35), then Equation (34) can be written as
Y 2 ( r ) = Z ( r + τ ) + J Ψ U ( s + τ , Y 2 ( s ) , Y 1 ( s ) ) ( r ) , r [ 0 , T τ ] .
Noticeably, we convert an equation on [ τ , T ] into a similar type of equation on the interval [ 0 , T τ ] [ 0 , τ ] . Therefore, we can use the same reasoning as in Theorems 3 and 4 to show that System (36) has a unique continuous solution on [ 0 , T τ ] .
We note that the only difference between Equations (16) and (36) is that G ( 0 ) is replaced by Z ( r + τ ) , which does not effect the proof. Thus, System (15) has a unique solution, given by
y ( t ) = G ( t ) , t ( τ , 0 ] , Y 1 ( t ) , t ( 0 , τ ] , Y 2 ( t τ ) , t ( τ , T ] .
It is clear that Y ( τ + ) = Y 2 ( 0 + ) = Z ( τ + ) = Z ( τ ) = Y 1 ( τ ) , indicating that Y is continuous at τ . Moreover, Y ( 0 + ) = Y 1 ( 0 + ) = Y 1 ( 0 ) = G ( 0 ) = Y ( 0 ) , showing that Y is also continuous at 0. Conclusively, Y ( C [ 0 , T ] ) ν . This completes the proof for this case. The same recursive argument can be applied to prove the cases when T belongs to [ 2 τ , 3 τ ] , [ 3 τ , 4 τ ] and so on, thereby completing the proof. □

4. Transforming DFDEs into Fractional Integral Equations Without Delays

The existence analysis above presents a constructive approach to study DFDEs. Let n = Ciel T τ , meaning that n 1 < T τ n . Let Y j represent the solution on the interval [ ( j 1 ) τ , j τ ] for j = 1 , , n . As stated previously, for j < n , we can define the Fredholem operators related to the system’s memory on [ ( j 1 ) τ , j τ ] as follows:
F j τ Ψ Y ( t ) = 1 Γ ( Ψ ) ( j 1 ) τ j τ ( t z ) Ψ 1 Y j ( z ) d z .
It should be noted that while this operator utilizes the information of Y at [ ( j 1 ) τ , j τ ] , the variable t can take on arbitrary values. In particular, this operator is well-defined for [ 0 , ) . Consequently, the contribution of Y within the jth interval regarded to the memory of the Fredholm operator (38) is distributed over future time.
Theorem 6.
The memory associated with the fixed interval j is fading as t increases.
Proof. 
From Theorem (5), Y j is continuous. Assume t 2 > t 1 1 + j τ . Then, t 2 z > t 1 z > 1 and ( t 2 z ) 1 ψ i > ( t 1 z ) 1 ψ i 1 for z [ ( j 1 ) τ , j τ ] . Therefore,
( t 2 z ) Ψ 1 | Y ( z ) | < ( t 1 z ) Ψ 1 | Y ( z ) | 1
where the inequities are component-wise. Thus,
F j τ Ψ | Y | ( t 2 ) F j τ Ψ | Y | ( t 1 ) .
Therefore, F j τ Ψ | Y | is decreasing component-wise for t > 1 + j τ . Since Y is continuous, and ( t z ) Ψ 1 Y ( z ) [ 0 , , 0 ] T uniformly as t , we conclude that
F j τ Ψ Y ( t ) [ 0 , , 0 ] T
as t . This indicates that the memory of jth interval fades to zero. □
Finally, we can define the peak information of J Ψ by Volterra operator,
V j τ Ψ Y ( t ) = 1 Γ ( Ψ ) j τ t ( t z ) Ψ 1 Y ( z ) d z
where t [ j τ , ( j + 1 ) τ ] , for j = 0 , , n 2 , and t [ ( n 1 ) τ , T ] when j = n 1 . We show that the translation of the peak operator is precisely the RL operator of a translation of Y.
Theorem 7.
For j = 0 , , n 1 , we have
V j τ Ψ Y ( t + j τ ) = J Ψ Y ( s + j τ ) ( t ) .
Proof. 
Substitute s = z j τ into (39). This gives
V j τ Ψ Y ( t ) = 1 Γ ( Ψ ) 0 t j τ ( t s j τ ) Ψ 1 Y ( s + j τ ) d s .
Now, consider the value of this operator when t is replaced by t + j τ ,
V j τ Ψ Y ( t + j τ ) = 1 Γ ( Ψ ) 0 t ( t s ) Ψ 1 Y ( s + j τ ) d s = J Ψ Y ( s + j τ ) ( t )
where t [ 0 , τ ] for j < n 1 and t [ 0 , T ( n 1 ) τ ] if j = n 1 . □
For convenience, we define Y 0 ( t ) = G ( t ) on the interval ( τ , 0 ] . Then, we have the following series of equations: For t ( 0 , τ ] , Y 1 is given by
Y 1 ( t ) = G ( 0 ) + J Ψ U ( s , Y 1 ( s ) , Y 0 ( Θ ( s ) ) ) ( t ) ,
for t ( τ , 2 τ ] , Y 2 is expressed as
Y 2 ( t ) = G ( 0 ) + F τ Ψ U ( s , Y 1 ( s ) , Y 0 ( Θ ( s ) ) ) ( t ) + V τ Ψ U ( s , Y 2 ( s ) , Y 1 ( Θ ( s ) ) ) ( t ) ,
and for j < n , and t ( ( j 1 ) τ , j τ ] , Y j is obtained by
Y j ( t ) = G ( 0 ) + i = 1 j 1 F i τ Ψ U ( s , Y i ( s ) , Y i 1 ( Θ ( s ) ) ) ( t ) + V ( j 1 ) τ Ψ U ( s , Y j ( s ) , Y j 1 ( Θ ( s ) ) ) ( t ) ,
For final interval t ( ( n 1 ) τ , T ] , where j = n , we have
Y n ( t ) = G ( 0 ) + i = 1 n 1 F i τ Ψ U ( s , Y i ( s ) , Y i 1 ( Θ ( s ) ) ) ( t ) + V ( n 1 ) τ Ψ U ( s , Y n ( s ) , Y n 1 ( Θ ( s ) ) ) ( t ) .
We define the tail function as
Z j ( t ) = G ( 0 ) + i = 1 j 1 F i τ Ψ U ( s , Y i ( s ) , Y i 1 ( Θ ( s ) ) ) ( t ) .
By using Theorem 7, we obtain integral equations
Y j ( t + j τ ) = Z j ( t + j τ ) + J Ψ U ( s + j τ , Y j ( s + j τ ) , Y j 1 ( Θ ( s + j τ ) ) ) ( t )
for j = 1 , , n 1 , t ( 0 , τ ] , and j = n , t ( 0 , T ( n 1 ) τ ] ( 0 , τ ] . It is clear that Equation (46) is an integral equation with respect to Y j ( t + j τ ) .

5. Well-Posedness

The well-posedness of a mathematical problem in the Hadamard sense requires three conditions: existence, uniqueness, and stability. Until now, we have provided the first two conditions. In this section, we investigated the third condition. The stability for the well-posedness of a problem implies that the solution depends continuously to the data. In particular, for initial value problems, the data consists of initial conditions. Here, the given data are a function G which is well-defined at ( τ , 0 ] . To ensure the stability, let emphasize the dependence of Y to G through Y ( t , G ) . Let Y ˜ ( t , G ˜ ) be a solution to (46) corresponding with G ˜ . This implies Y ˜ 0 ( t ) = G ˜ ( t ) for t ( 0 , τ ] and Y ˜ j satisfies the systems described by (46). To establish well-posedness we need a slightly stronger assumption than (H1). This assumption involves adding Lipschitz continuity for the third parameter of U.
(H4)
U is globally Lipschitz continuous with respect to Y and W, i.e., L i R , such that
| u i ( t , Y , W ) u i ( t , Y ^ , W ^ ) | L i max { | Y Y ^ | , | W W ^ | }
for all t [ 0 , T ] and for all Y , W , Y ^ , W ^ R ν .
Theorem 8.
Let Hypotheses (H2)-(H4) hold. Then, the mild solution of System (7) subject to Condition (5) is Lipschitz continuous with respect to G on the finite interval [ 0 , T ] .
Proof. 
Let M = max L i Γ ( α i ) . Then,
| Y 1 ( t ) Y ˜ 1 ( t ) | | G ( 0 ) G ˜ ( 0 ) |         + M 0 t ( t z ) ψ 1 max { | Y 1 ( z ) Y ^ 1 ( z ) | , | G ( z ) G ^ ( z ) | }
for t 1 , where ψ = min ψ i . Therefore,
| Y 1 ( t ) Y ˜ 1 ( t ) | | G ( 0 ) G ˜ ( 0 ) |         + M 0 t ( t z ) ψ 1 | Y 1 ( z ) Y ^ 1 ( z ) | d z         + M 0 t ( t τ ) ψ 1 | G ( z ) G ^ ( z ) | d z
for t 1 . Thus,
| Y 1 ( t ) Y ˜ 1 ( t ) | | G ( 0 ) G ˜ ( 0 ) | + M 0 t ( t z ) ψ 1 | Y 1 ( z ) Y ^ 1 ( z ) | d z + M 0 t ( t τ ) ψ 1 | G ( z ) G ^ ( z ) | d z .
It follows that
| Y 1 ( t ) Y ˜ 1 ( t ) | 1 + M t ψ ψ G G ˜ + M 0 t ( t z ) ψ 1 | Y 1 ( z ) Y ^ 1 ( z ) | d z
and, thus,
| Y 1 ( t ) Y ˜ 1 ( t ) | 1 + M t ψ ψ E ψ ( M Γ ( ψ ) t ψ ) G G ˜ .
Consequently,
| Y 1 ( t ) Y ˜ 1 ( t ) | = C 1 G G ˜ , t [ 0 , 1 ] ,
where C 1 : = max t [ 0 , 1 ] 1 + M t ψ ψ E ψ ( M Γ ( ψ ) t ψ ) . This completes the proof on [ 0 , τ ] when τ 1 . Now, consider τ [ 0 , 2 ] . For t > 1 , we have
| Y 1 ( t ) Y ˜ 1 ( t ) | | G ( 0 ) G ˜ ( 0 ) | + M 0 t | ( t z ) Ψ 1 | | Y 1 ( z ) Y ^ 1 ( z ) | d z         + M 0 t | ( t z ) Ψ 1 | | G ( z ) G ^ ( z ) | d z        | G ( 0 ) G ˜ ( 0 ) | + M 0 1 | ( t z ) Ψ 1 | | Y 1 ( z ) Y ^ 1 ( z ) | d z         + M 1 t | ( t z ) Ψ 1 | | Y 1 ( z ) Y ^ 1 ( z ) | d z + M 0 t | ( t z ) Ψ 1 | | G ( z ) G ^ ( z ) | d z        G G ˜ + M max z [ 0 , 1 ] | Y 1 ( z ) Y ^ 1 ( z ) | Ω + M 1 t | ( t z ) Ψ 1 | | Y 1 ( z ) Y ^ 1 ( z ) | d z         + M G G ^ Ω       ≤ ( 1 + M C 1 Ω + M Ω ) G G ^ + M 1 t | ( t z ) Ψ 1 | | Y 1 ( z ) Y ^ 1 ( z ) | d z
where
Ω : = max t [ 0 , 2 ] 0 t | ( t z ) Ψ 1 | d z
and, clearly, Ω < . It immediately follows that
| Y 1 ( t + 1 ) Y ˜ 1 ( t + 1 ) | C 2 G G ^ + M 0 t ( t s ) ψ 1 | Y 1 ( s + 1 ) Y ^ 1 ( s + 1 ) | d s
for t [ 0 , 1 ] where C 2 = 1 + M C 1 Ω + M Ω . By applying the generalized Gronwall inequality, we obtain
| Y 1 ( t + 1 ) Y ˜ 1 ( t + 1 ) | C 2 E ψ ( M Γ ( ψ ) t ψ ) G G ^ , t [ 0 , 1 ]
and, thus,
| Y 1 ( t ) Y ˜ 1 ( t ) | C 2 E ψ ( M Γ ( ψ ) ( t 1 ) ψ ) G G ^ , t [ 1 , 2 ] .
Particularly, by defining C 3 = max { C 1 , max t [ 0 , 1 ] C 2 E ψ ( M Γ ( ψ ) ( t 1 ) ψ ) } , we have
| Y 1 ( t ) Y ˜ 1 ( t ) | C 3 G G ^ , t [ 0 , τ ] .
Using the same induction, Equation (55) holds for any τ < . Now we consider the dynamics of the system for t > τ . Suppose that
| Y ( t ) Y ˜ ( t ) | C G G ^ , t [ 0 , ( j 1 ) τ ] , j 1
for some constant C. We provide the same result on [ ( j 1 ) τ , j τ ] . We note that, by definition of Z j ,
Z j ( t ) = G ( 0 ) + 1 Γ ( Ψ ) i = 1 j 1 ( i 1 ) τ i τ ( t s ) Ψ 1 U ( s , Y i ( s ) , Y i 1 ( Θ ( s ) ) ) d s .
Thus,
| Z j ( t ) Z ˜ j ( t ) | | G ( 0 ) G ˜ ( 0 ) |         + M i = 1 j 1 ( i 1 ) τ i τ | ( t s ) Ψ 1 | max { | Y i ( s ) Y ˜ i | , | Y i 1 ( Θ ( s ) ) Y ˜ i 1 ( Θ ( s ) ) | } d s
For i j 1 , based on the assumption, | Y i ( s ) Y ˜ i | C G G ^ and | Y i 1 ( Θ ( s ) ) Y i 1 ( Θ ( s ) ) | C G G ^ . Therefore, for t [ ( j 1 ) τ , j τ ] ,
| Z j ( t ) Z ˜ j ( t ) | | G ( 0 ) G ˜ ( 0 ) | + M C G G ^ i = 1 j 1 ( i 1 ) τ i τ | ( t s ) Ψ 1 | d s    ≤ G G ˜ + M C G G ^ 0 ( j 1 ) τ | ( t s ) Ψ 1 | d s ,        ≤ ( 1 + M C Ω j ) G G ˜
where
Ω j : = max t [ ( j 1 ) τ , j τ ] 0 t | ( t z ) Ψ 1 | d z .
Using (46), we obtain
| Y j ( j τ + t ) Y ˜ j ( j τ + t ) | | Z j ( j τ + t ) Z ˜ j ( j τ + t ) |    + M 0 t | ( t s ) Ψ 1 | max { | Y i ( j τ + s ) Y ˜ i ( j τ + s ) | , | Y i 1 ( Θ ( s ) ) Y ˜ i 1 ( Θ ( j τ + s ) ) | } d s  ≤ ( 1 + M C Ω j ) G G ˜    + M 0 t | ( t s ) Ψ 1 | max { | Y i ( j τ + s ) Y ˜ i ( j τ + s ) | , | Y i 1 ( Θ ( j τ + s ) ) Y ˜ i 1 ( Θ ( j τ + s ) ) | } d s
This equation is similar to (47). A similar analysis shows that | Y j ( j τ + t ) Y ˜ j ( j τ + t ) | is proportional to G G ˜ . We need prove this separately for τ in [ 0 , 1 ] , [ 1 , 2 ] , and so on. We briefly carry the proof for the case τ [ 0 , 1 ] , while it is also similar to previous discussions. From (60), we have
| Y j ( j τ + t ) Y ˜ j ( j τ + t ) | ( 1 + M C Ω j ) G G ˜            + M 0 t | ( t s ) ψ 1 | | Y i ( j τ + s ) Y ˜ i ( j τ + s ) | d s            + M 0 t | ( t s ) ψ 1 | | Y i 1 ( Θ ( j τ + s ) ) Y ˜ i 1 ( Θ ( j τ + s ) ) | } d s           ≤ ( 1 + M C Ω j + M C t ψ ψ ) G G ˜            + M 0 t | ( t s ) ψ 1 | | Y i ( j τ + s ) Y ˜ i ( j τ + s ) | d s
By applying the generalized Gronwall inequality, we obtain
| Y j ( j τ + t ) Y ˜ j ( j τ + t ) | ( 1 + M C Ω j + M C t ψ ψ ) E ψ ( M Γ ( ψ ) t ψ ) G G ˜ .
This shows that
| Y j ( t ) Y ˜ j ( t ) | C 4 G G ˜ , t j τ + [ 0 , τ ] = [ j τ , ( j + 1 ) τ ] , τ 1 ,
where C 4 is a finite constant, defined by
C 4 = max t [ 0 , 1 ] ( 1 + M C Ω j + M C t ψ ψ ) E ψ ( M Γ ( ψ ) t ψ ) .

6. Examples and Applications

6.1. Applications in Hopfield Neural Network

An interesting incommensurate system of DFDEs is used in [11] to describe a Hopfield neural network (HNN). HNNs, a form of recurrent artificial neural network, are particularly known for their ability to store and retrieve memory patterns efficiently, making them suitable for numerous practical uses.
In this section, we aim to study the well-posedness of a class of such HNNs. In terms of our notation, such HNNs can be described by the incommensurate System (6), with
u 1 ( t , Y , W ) = 0.1 y 1 + 1.5 tanh ( w 3 ) + 0.8 tanh ( w 4 ) + 1.9 tanh ( w 5 ) , u 2 ( t , Y , W ) = 0.6 y 2 0.6 tanh ( w 3 ) 0.5 tanh ( w 4 ) + 2.2 tanh ( w 5 ) , u 3 ( t , Y , W ) = 0.1 y 3 1.5 tanh ( y 1 ) + 2.5 tanh ( y 2 ) , u 4 ( t , Y , W ) = 0.8 y 4 + 0.5 tanh ( y 1 ) 0.8 tanh ( y 2 ) , u 5 ( t , Y , W ) = 1.3 y 5 + tanh ( y 1 ) 2 tanh ( y 2 ) .
The stability of such systems has been studied in [11]. The hyperbolic tangent function tanh is a Lipschitz continuous function with Lipschitz constant 1. Therefore, the functions u i for i = 1 , , 5 are also Lipschitz continuous with respect to Y and W. Thus, Hypotheses (H1) and (H4) automatically hold. Particularly, L 1 = max { 0.1 , 1.5 , 0.8 , 1.9 } = 1.9 , L 2 = max { 0.6 , 0.5 , 2.2 } = 2.2 , L 3 = max { 0.1 , 1.5 , 2.5 } = 2.5 , L 4 = max { 0.8 , 0.5 } = 0.8 , and L 5 = max { 1.3 , 1 , 2 } = 2 . Also, each u i is continuous with respect to its variable, thus (H2) holds. Assuming that G satisfies (H3), according to Theorem 5, the Hopfield neural network (64) has a unique mild solution. According to Theorem 8, the solution is Lipschitz continuous with respect to G, indicating that the Hopfield neural network (64) is well-posed.

6.2. A General Linear Case

Equation (3) represents a linear incommensurate systems of DFDEs with constant coefficients. However, this equation can be generalized to the form with variable coefficients as follows:
D Ψ Y ( t ) = A ( t ) Y ( t ) + B ( t ) Y ( Θ ( t ) ) + F ( t )
where A C [ 0 , T ] ν × ν and B C [ 0 , T ] ν × ν .
In terms of presentations (7), we have
U ( t , Y , W ) = A ( t ) Y + B ( t ) W + F ( t ) .
Since a i j and b i j are assumed to be continuous, they are bounded on the compact interval [ 0 , T ] . Therefore,
L i = max j = 1 , , ν { max t [ a , b ] | a i j ( t ) | , max t [ a , b ] | b i j ( t ) | }
is a well-defined real number, and Hypothesis (H4) holds with this L i for all i = 1 , , ν . Consequently, according to Theorems 5 and 8, it has a unique continuous mild solution, and the solution is Lipschitz continuous with respect to any continuous G. For instance, a complex system described by
D 0.5 y 1 ( t ) = sin ( t ) y 1 ( t ) exp ( t ) y 2 ( t 0.5 ) + cos ( t ) , D 0.5 y 2 ( t ) = cos ( t ) y 1 ( t ) t 2 ( t ) y 2 ( t 0.5 ) + | t | ,
with prehistoric conditions
y 1 ( t ) = t sin ( t ) , t ( 0.5 , 0 ] , y 2 ( t ) = t 2 + t + 1 , t ( 0.5 , 0 ] ,
has a unique solution. This example demonstrates the strength of Theorems 5–8, which imposes no further requirements for well-posedness of such systems. Due to the significance of this example, we add the following corollary for reference in future research.
Corollary 1.
Assume A , B , F C [ 0 , T ] ν × ν , G C [ τ , 0 ] ν × ν , τ , T > 0 and Ψ ( 0 , 1 ) ν . Then, System (65) has a unique mild solution, and is Lipschitz continuous with respect to G on [ 0 , T ] .
Proof. 
The proof is a straightforward conclusion of Theorems 5–8. □

7. Conclusions and Remaining Works on This Topic

We have demonstrated that the mild solutions of incommensurate systems for DFDEs satisfy delay RL integral equations. To ensure well-posedness, we divided the interval into [ 0 , τ ] , [ τ , 2 τ ] , . . . , [ ( n 1 ) τ , T ] , and transformed studied integral equations into RL integral equations without delays as described by (46). This decomposition has been utilized throughout the analysis. Then, we proceed by assuming τ [ 0 , 1 ] , and extended it for τ < in any interval [ n , n + 1 ] , through induction. To obtain the existence result, we used Picard iterations to obtain a sequence of Cauchy continuous functions. We employed the completeness of the space of continuous functions to establish uniform convergence of such Cauchy sequences. Subsequently, we showed that the limit of the Cauchy sequence satisfies the original RL integral equation. Thus, we have established the existence of a solution. For uniqueness and stability with respect to G, we applied generalized Gronwall inequality. The results of this paper can be summarized as follows.
Theorem 9.
Assume ψ i ( 0 , 1 ) , G is continuous function on ( τ , 0 ] , lim t τ G ( t ) < , and 0 τ < . Additionally, assume that U is a continuous vector-valued function and each component of U is Lipschitz continuous with respect to both the second and third variables. Then, the incommensurate system of DFDEs (6) with prehistoric condition (5) has a unique solution. Furthermore, this solution is continuously dependent on G.
While we provided a well-posedness of the problem on the spaces of continuous functions, there are fundamental questions regarding the need to investigated in dynamic of the solution. One key question is related to the regularity of the solutions. In terms of the classical analysis, regularity speaks about the existence and behavior of derivatives of the solution. Knowledge of the differentiability of the solution is crucial for constructing efficient numerical solutions. In the context of wider analysis, regularity speaks about the existence of a solution within a specific space. Studies by Liang and Stynes [21] have investigated the regularity of a wide class of singular Volterra integral equations of the second kind in weighted space C m , α . It is an ongoing area of research related to unified theories for weakly singular integrals (including logarithm singularity and singularity with power function), mainly performed in the past three decades by Vainikko and Pedas [22,23,24]. Recently, in a book published by Brunner [19], the regularity of the solution of a weakly singular integral equation is studied in detail. Among the related books, this book devotes a chapter to this topic. We hope to investigate the regularity of DFDEs in future studies.

Funding

This research is supported by the Neijiang Normal University school-level science and technology project (key project, No. XJ2024008301).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The author declares no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
FDEsFractional differential equations
DFDEsdelay fractional differential equations
DDEsdelay differentiate equations
HNNsHopfield Neural Network

References

  1. Diethelm, K.; Ford, N.J. The Analysis of Fractional Differential Equations; Lecture Notes in Mathematics; Springer: New York, NY, USA, 2010. [Google Scholar]
  2. Kilbas, A.A.; Srivastava, H.M.; Trujillo, J.J. Theory and Applications of Fractional Differential Equations; Elsevier: Amsterdam, The Netherlands, 2006; Volume 204, pp. 1–523. [Google Scholar]
  3. Shiri, B.; Baleanu, D. All linear fractional derivatives with power functions’ convolution kernel and interpolation properties. Chaos Solit. Fractals 2023, 2023, 113399. [Google Scholar] [CrossRef]
  4. Smith, H.L. An Introduction to Delay Differential Equations with Applications to the Life Sciences; Springer: New York, NY, USA, 2011. [Google Scholar]
  5. Morgado, M.L.; Ford, N.J.; Lima, P.M. Analysis and numerical methods for fractional differential equations with delay. J. Comput. Appl. Math. 2013, 252, 159–168. [Google Scholar] [CrossRef]
  6. Čermák, J.; Došlá, Z.; Kisela, T. Fractional differential equations with a constant delay: Stability and asymptotics of solutions. Appl. Math. Comput. 2017, 1, 336–350. [Google Scholar] [CrossRef]
  7. Huseynov, I.T.; Mahmudov, N.I. Analysis of positive fractional-order neutral time-delay systems. J. Franklin Inst. 2022, 359, 294–330. [Google Scholar] [CrossRef]
  8. Shiri, B.; Baleanu, D. Numerical solution of some fractional dynamical systems in medicine involving non-singular kernel with vector order. Res. Nonlinear Anal. 2019, 2, 160–168. [Google Scholar]
  9. Das, S.; Gupta, P.K. A mathematical model on fractional Lotka–Volterra equations. J. Theor. Biol. 2011, 277, 1–6. [Google Scholar] [CrossRef] [PubMed]
  10. Tavazoei, M.; Asemani, M.H. On robust stability of incommensurate fractional-order systems. Commun. Nonlinear Sci. Numer. Simul. 2020, 90, 105–344. [Google Scholar] [CrossRef]
  11. Zhang, Y.; Li, L.; Huang, J.; Gorbachev, S.; Aravind, R.V. Exploration on bifurcation for an incommensurate five-neuron fractional-order BAM neural network involving multiple delays. Phys. D Nonlinear Phenom. 2024, 460, 134047. [Google Scholar] [CrossRef]
  12. Kaslik, E.; Sivasundaram, S. Nonlinear dynamics and chaos in fractional-order neural networks. Neural Netw. 2012, 32, 245–256. [Google Scholar] [CrossRef] [PubMed]
  13. Karoun, R.C.; Ouannas, A.; Horani, M.A.; Grassi, G. The effect of Caputo fractional variable difference operator on a discrete-time hopfield neural network with non-commensurate order. Fractal. Fract. 2022, 6, 575. [Google Scholar] [CrossRef]
  14. Deng, W.; Li, C.; Lu, J. Stability analysis of linear fractional differential system with multiple time delays. Nonlinear Dyn. 2007, 48, 409–416. [Google Scholar] [CrossRef]
  15. Nouri, K.; Nazari, M.; Torkzadeh, L. Numerical approximation of the system of fractional differential equations with delay and its applications. Eur. Phys. J. Plus. 2020, 135, 1–4. [Google Scholar] [CrossRef]
  16. Čermák, J.; Horníček, J.; Kisela, T. Stability regions for fractional differential systems with a time delay. Commun. Nonliner Sci. Numer. Simul. 2016, 31, 108–123. [Google Scholar] [CrossRef]
  17. Shiri, B.; Shi, Y.G.; Baleanu, D. The Well-Posedness of Incommensurate FDEs in the space of continuous functions. Symmetry 2024, 16, 1058. [Google Scholar] [CrossRef]
  18. Ye, H.; Gao, J.; Ding, Y. A generalized Gronwall inequality and its application to a fractional differential equation. J. Math. Anal. Appl. 2007, 328, 1075–1081. [Google Scholar] [CrossRef]
  19. Brunner, H. Volterra Integral Equations: An Introduction to Theory and Applications; Cambridge University Press: Cambridge, UK, 2017. [Google Scholar]
  20. Lan, K.; Webb, J.R. A new Bihari inequality and initial value problems of first order fractional differential equations. Fract. Calc. Appl. Anal. 2023, 26, 962–988. [Google Scholar] [CrossRef] [PubMed]
  21. Liange, H.; Stynes, M. Regularity of the solution of a nonlinear Volterra integral equation of the second kind. Discret. Contin. Dyn.-Syst.-Ser. B 2023, 28, 2211. [Google Scholar] [CrossRef]
  22. Gennadi, V. Multidimensional Weakly Singular Integral Equations; Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany, 1993; p. 1549. [Google Scholar]
  23. Pedas, A.; Vainikko, G. The smoothness of solutions to nonlinear weakly singular integral equations. Z. Anal. Anwendungen 1994, 13, 463–476. [Google Scholar] [CrossRef]
  24. Hermann, B.; Arvet, P.; Gennadi, V. The piecewise polynomial collocation method for nonlinear weakly singular Volterra equations. Math. Comp. 1999, 68, 1079–1095. [Google Scholar]
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

Shiri, B. Well-Posedness of the Mild Solutions for Incommensurate Systems of Delay Fractional Differential Equations. Fractal Fract. 2025, 9, 60. https://doi.org/10.3390/fractalfract9020060

AMA Style

Shiri B. Well-Posedness of the Mild Solutions for Incommensurate Systems of Delay Fractional Differential Equations. Fractal and Fractional. 2025; 9(2):60. https://doi.org/10.3390/fractalfract9020060

Chicago/Turabian Style

Shiri, Babak. 2025. "Well-Posedness of the Mild Solutions for Incommensurate Systems of Delay Fractional Differential Equations" Fractal and Fractional 9, no. 2: 60. https://doi.org/10.3390/fractalfract9020060

APA Style

Shiri, B. (2025). Well-Posedness of the Mild Solutions for Incommensurate Systems of Delay Fractional Differential Equations. Fractal and Fractional, 9(2), 60. https://doi.org/10.3390/fractalfract9020060

Article Metrics

Back to TopTop