Application of Digital Imaging for Cytopathology under Conditions of Georgia

Abbreviations: FFIDDCs: fuzzy fractional implicit delay differential coupled systems; TFFs: triangular fuzzy functions; MDs: membership degrees; IVP: initial value problem; FDDEs: fuzzy delay differential equations; FDEs: fractional differential equations; DFDEs: fractional differential equations with time delay; FFDEs: fuzzy fractional differential equations; FCFDIVP: fuzzy coupled fractional initial value problem with delays; MF: membership function; TFN: triangular fuzzy number

1.   Introduction

In an ecosystem, there exist universally competitions between two species, which is very important. And they tend to interact with each other so that there are some relationships such as predation or symbiosis among them (i.e. coupled systems) (see ^[9,39]). In addition, the delay and ambiguity may appear because of different reasons such as physical properties of equipment used in the system, signal transmission or measurement of system variables (see ^[14]), so we need to take them into account. Thus, in this paper, motivated by the work of Dong et al. ^[13] and Fatullayev et al. ^[14], we come up with the following problem of fuzzy fractional implicit delay differential coupled systems (FFIDDCs):

and explore existence and uniqueness result of solution for the FFIDDC (1.1), where $ ^{c}D^{\alpha}f(t) $ denotes $ \alpha $-order Caputo fractional derivative of function $ f(t)\in C_\alpha^1 $ for $ 0 < \alpha < 1 $ (see ^[22]), $ \tau $ is the value of time delay, $ \widetilde{\Phi_{1}}(t) $ and $ \widetilde{\Phi_{2}}(t) $ are triangular fuzzy functions (TFFs) defined on $ [-\tau, 0] $, $ \widetilde{F_{1}}(t, y(t), ^{c}D^{\alpha}x(t)) $ and $ \widetilde{F_{2}}(t, x(t), ^{c}D^{\beta}y(t)) $ are also TFFs defined on $ (0, \infty)\times {\mathbb R} \times {\mathbb R} $, and $ m_{1}(t) $ and $ m_{2}(t) $ are continuous crisp functions. The concept of TFFs used in this paper was first proposed by Gasilov et al. ^[17], then it has been widely employed ^[7,16,27]. Unlike in the past, Gasilov et al. ^[17] thought that a fuzzy function is a fuzzy bunch of real functions rather than a fuzzy number-valued function. Each of these real functions has a certain membership degree. The new concept of TFFs broadened the way (see ^[14]), and so we deal with fuzzy functions and fuzzy problems.

Remark 1.1. In this paper, we consider the problem with Caputo fractional derivative, which is based on Riemann-Liouville fractional derivative ^[22]. We note that for temporal variable, the Caputo fractional derivative has been widely recognized in real application. For example, the Caputo fractional derivative of a constant is $ 0 $, but in the case of finite number at the lower limit of the interval, the Riemann-Liouville fractional derivative of a constant is not equal to $ 0 $. And the initial conditions given by Riemann-Liouville method cannot be explained physically. For more related work, see ^[28,34]. However, can one discuss the existence and uniqueness results for the solutions of the FFIDDC (1.1) with Riemann-Liouville fractional derivative or Hadamard fractional derivative? These are usually presented as important and significative problems in future research.

Some special cases of the FFIDDC (1.1) are listed as follows:

(i) If $ \tau = 0, 0\leq t\leq 1 $ and $ \alpha_{j} = 1 $, where $ \alpha_{j} $ is the membership degrees (MDs) of $ \widetilde{F_{j}} $ for $ j = 1, 2 $, the FFIDDC (1.1) can be rewritten as the problem investigated by Dong et al. ^[13]:

Making full use of fixed point theorem and the vector form of Gronwall inequality, Dong et al. ^[13] gained existence and uniqueness of solution to the initial value problem (IVP), and discussed the estimation of the solution.

(ii) If $ \alpha = \beta = 1 $, the FFIDDC (1.1) reduces to the following fuzzy implicit delay differential coupled systems:

which is brand new and is worth studying in the future.

We note that the system (1.2) is an extension of the linear inhomogeneous fuzzy delay differential equations (FDDEs) considered by Fatullayev et al. ^[14]:

The authors presented a method to represent the solution of FDDE as a fuzzy set of real functions, and proved existence and uniqueness of solution for FDDE involving TFFs. Furthermore, Fatullayev et al. ^[14] showed clearly that the proposed method can be extended to the system of FDDEs by using the research results of Gasilov and Amrahov ^[15]. The purpose of this paper is to discuss existence and uniqueness of solution for the FFIDDC (1.1).

Comparing with the simpler integer-order differential equations, fractional differential equations (FDEs) have more wide applications and play an important role in engineering, physics, finance and other fields. Nowadays, FDEs have been used to more accurately describe the dynamics of many systems when several complex phenomena in numerous seemingly diverse and widespread fields of science and engineering is modeled and investigated. See, for example, ^{[3,6,22,28,34]} and references therein. In addition, to study ecosystem problems in biology, one often discovers that an ecosystem does not have only a single species. That is to say, there must be multiple species, so there exists competition among them and coupling is taken into account (see ^[9,39]). Coupling relationship refers to the interaction and mutual influence between two or more objects. In fact, the coupled systems of FDEs have been studied by multitudinous researchers. See, for example, ^[2,38] and the references cited therein. Recently, by applying standard fixed point theorems for multivalued maps, existence of solutions for coupled systems of fractional differential inclusions with coupled boundary conditions was obtained by Ahmad et al. ^[5].

In science and engineering and other practical applications, time delay usually occurs on account of manual measurement, signal transmission, aging of equipments and so on (see ^[30]). Thereby, in recent years, the scholars have been interested in solving the fractional differential equations with time delay (DFDEs) (see, for instance, ^[30,35] and the references therein). Brzdek and Eghbali ^[10] considered the Ulam's stability of DFDEs and also proved that under some appropriate assumptions, each approximate solution of DFDEs is close to its only exact solution. In order to acquire existence of solutions for a time dependent delay differential equation with constant delay, Tabassum et al. ^[33] extended the previous approaches about fuzzy weakly contraction mapping principle. Of course, there are not just one type of FDEs, whether they are linear or nonlinear. And the common ones are Caputo type, Riemann-Liouville type and Hadamard type (see ^[11,21,36]). Moreover, the delay is not necessarily finite, it can be also infinite. Some researchers dedicated themselves to the study of FDEs with infinite delay. Banach fixed point theorem and the nonlinear alternative of Leray-Schauder type initiated by Granas and Dugundji ^[18], had been utilized by Benchohra et al. ^[8] to investigate existence results of FDEs with infinite delay.

Certainly, in actual application, there are not only time delay, but also exists the possibility of ambiguity. Thus, one needs to take the fuzzy into account, and then the fuzzy fractional differential equations (FFDEs) are proposed. Agarwal et al. ^[1] put forward a notion of fuzzy Riemann-Liouville differentiability based on Hukuhara differentiability, which can be employed to solve the IVPs of FFDEs. After that, many investigators have extended the concepts and expression forms of FFDEs, and bent themselves to obtain existence and uniqueness of solution for FFDEs. These theories are also well applied in real life. See, for example, ^[24,25,29] and the references therein. As Fatullayev et al. ^[14] pointed out, "the types of fuzzy items are more important than their numbers when a fuzzy problem needs to be solved". In fact, we can easily deal with $ n $-th order homogeneous linear differential equations with fuzzy initial values (i.e. the problem with $ n $ fuzzy inputs) by using Zadeh's extension principle. But if a fuzzy forcing function appears in the problem, even for the delay differential equation of first order (i.e. with 2 fuzzy inputs), it will be indistinct how to use the principle.

It is well know that explicit equations are special cases of implicit equations, and the implicit equations are more general (see ^[12]). Cubiotti and Yao ^[12] introduced and studied a class of implicit second-order ordinary differential equations with known endpoint values. They also proved existence results under two conditions. However, as Hoa and Vu ^[21] stated briefly, "to the best of our knowledge, there exists no literature devoted to the uncertain fractional implicit differential equation in the fuzzy setting with the concepts of Riemann-Liouville, Caputo, Hadamard fractional derivatives". And then, Hoa and Vu ^[21] proposed some existence results for solutions of the fuzzy fractional implicit differential equations associated with the fuzzy Caputo-type, fuzzy Riemann-Liouville-type and fuzzy Hadamard-type concepts of fractional derivative, respectively. Very recently, Son and Dong ^[31] proposed global existence and some properties of solutions for the nonlocal problem of implicit fuzzy fractional differential systems. For more work on various forms of implicit FDE models, one can refer to ^[26,19,20] and the references therein.

The major methods of this paper are as follows:

(i) We generalize TFF (Definition 2.1 of ^[17]) to a group of TFFs (see Example 2.1).

(ii) To solve the FFIDDC (1.1), we use the method of steps proposed by Fatullayev et al. ^[14]. Firstly, we figure out the solution of the FFIDDC (1.1) on interval $ [0, \tau] $. Afterwards, we similarly find the solution on interval $ [\tau, 2\tau] $. And as we go along, eventually, the solution on interval $ [0, +\infty) $ can be obtained.

(iii) Because of the fuzzy coupled fractional initial value problem with delays (FCFDIVP) (3.1), which is the identical transformation of the FFIDDC (1.1), is linear, the superposition principle can be used to work out it. As a consequence, we can decompose the FCFDIVP (3.1) into three subproblems (3.4)-(3.6) and solve them separately.

The remainder of this paper is organized as follows. The necessary preliminaries about the fuzzy theory that we are going to use are listed in Section 2. In Section 3, we introduce the concept of solution for the FFIDDC (1.1) and describe how to get it. Ultimately, a solution algorithm is proposed. In Section 4, we present an example to show that the hypotheses in all theorems can be met. Finally, in Section 5, we summarize the research results of this paper, and provide the content that one can study in the future.

2.   Preliminaries

Based on the work of Zadeh ^[37], we define a fuzzy set $ \widetilde{A} $ as a pair of the universal set $ U $ and the membership function (MF) $ \mu:U\rightarrow[0, 1] $. The MF of a fuzzy set $ \widetilde{A} $ can be denoted as $ \mu_{\widetilde{A}} $. For each $ x\in U $, the numerical value $ \mu_{\widetilde{A}}(x) $ is called the MD of $ x $ in $ \widetilde{A} $. The crisp set $ supp(\widetilde{A}) = \{x\in U\mid\mu_{\widetilde{A}}(x) > 0\} $ is called the support of $ \widetilde{A} $.

After that, let $ U $ be the set of real numbers $ {\mathbb R} $, and $ a, c $ and $ b $ be real numbers which meet $ a\leq c\leq b $. Then the set $ \widetilde{u} $ with MF

is called a triangular fuzzy number (TFN) and we denote it as $ \widetilde{u} = (a, c, b) $. On the grounds of the geometric interpretation, the number $ c $ is called the vertex of $ \widetilde{u} $, we denote $ \underline{u} = a $ and $ \overline{u} = b $ to represent the left and the right end-points of $ \widetilde{u} $, respectively. Frequently, we express $ \widetilde{u} = (a, c, b) $ as $ \widetilde{u} = u_{cr}+\widetilde{u}_{un} $. Here, $ u_{cr} = c $ is the crisp part and $ \widetilde{u}_{un} = (a-c, 0, b-c) $ is the uncertain part of $ \widetilde{u} $.

It is also useful to represent the fuzzy sets though their $ \alpha $-$ cuts $. For each $ \alpha\in(0, 1] $, the crisp set $ A_{\alpha} = \{x\in U\mid \mu_{\widetilde{A}}(x)\geq \alpha\} $ is called the $ \alpha $-$ cut $ of $ \widetilde{A} $. For $ \alpha = 0 $, the $ A_{0} = closure(supp(\widetilde{A})) $.

For the TFN $ \widetilde{u} = (a, c, b) $, the $ \alpha $-$ cuts $ are intervals $ u_{\alpha} = [\underline{u_{\alpha}}, \overline{u_{\alpha}}] $, where $ \underline{u_{\alpha}} = a+\alpha(c-a) $ and $ \overline{u_{\alpha}} = b+\alpha(c-b) $. These formulas can be rewritten as $ \underline{u_{\alpha}} = c+(1-\alpha)(a-c) $ and $ \overline{u_{\alpha}} = c+(1-\alpha)(b-c) $. Therefore, $ u_{\alpha} = [\underline{u_{\alpha}}, \overline{u_{\alpha}}] = c+(1-\alpha)[a-c, b-c] $. From here we can see that an $ \alpha $-$ cut $ is homothetic to $ [a, b] $ (which is the $ 0 $-$ cut $) with center $ c $ and with ratio $ (1-\alpha) $.

There are different notions about the fuzzy functions. In this study, we use the concept of the fuzzy function which was brought forward by Gasilov et al. ^[17], namely, fuzzy function is a bunch of fuzzy real functions. As a value $ \widetilde{F}(t) $ of a fuzzy bunch $ \widetilde{F} $ at time $ t $, we understand the fuzzy set, which elements are the values of the real functions at $ t $, with the higher MD of the corresponding functions. Mathematically,

where "$ \wedge $" and "$ \rightarrow $" are the logical conjunction and implication symbols, respectively.

Definition 2.1. (^[17]) Let U be set of continuous functions defined on an interval I, and $ F_{a}(\cdot), F_{c}(\cdot), F_{b}(\cdot)\in U $. We call the fuzzy subset $ \widetilde{F} $ of U, determined by the MF as follows:

as TFF and denote it as $ \widetilde{F} = \langle F_{a}, F_{c}, F_{b}\rangle $.

According to this definition, a TFF is a fuzzy set (or, fuzzy bunch) of real functions. Among them only two functions have the MD $ \alpha $: the functions $ y_{1} = F_{a}+\alpha(F_{c}-F_{a}) $ and $ y_{2} = F_{b}+\alpha(F_{c}-F_{b}) $.

Referring to the example of TFF given by Gasilov et al. ^[16], we give the following example of a group of TFFs.

Example 2.1. In Figure 1, we depict a group of TFFs as

where

$ F_{1a}(t) = -t^{2}+5\, t-4 $ $($MD is $ 0 $, the black curve that is at bottom on $ [0, 1] $ and at upper on $ [1,2] )$;

$ F_{1c}(t) = 0.5\, t^{2}-1.5\, t+1 $ $($MD is $ 1 $, the black dashed line);

$ F_{1b}(t) = t^{2}-5\, t+4 $ $($MD is $ 0 $, the black curve that is at upper on $ [0, 1] $ and at bottom on $ [1,2]) $;

$ F_{2a}(t) = -2\, t^{2}+4\, t-2 $ $($MD is $ 0 $, the blue curve that is at bottom on $ [0, 2]) $;

$ F_{2c}(t) = t^{2}-2\, t+1 $ $($MD is $ 1 $, the blue dashed line$)$;

$ F_{2b}(t) = 2\, t^{2}-4\, t+2 $ $($MD is $ 0 $, the blue curve that is at upper on $ [0, 2]) $.

The TFF $ \widetilde{F_{1}} $ with MDs $ 0.7 $ and $ 0.3 $ are depicted by red dotted and dashed-dotted lines, respectively. And the TFF $ \widetilde{F_{2}} $ with MDs $ 0.7 $ and $ 0.3 $ are described by cyan dotted and dashed-dotted lines which are marked, respectively.

The value of a TFF at a time $ t\in I $ can be expressed by the following formula:

We can easily find out that this value is a TFN, and a TFF $ \widetilde{F} = \langle F_{a}, F_{b}, F_{c}\rangle $ is not a fuzzy number-valued function. Actually, it is a fuzzy subset of the universe of continuous functions. Each element of this fuzzy subset is a real function with a certain MD.

If $ F_{a}(t)\leq F_{c}(t)\leq F_{b}(t) $ for all $ t\in I $, then the TFF $ \widetilde{F} = \langle F_{a}, F_{c}, F_{b}\rangle $ is regular TFF on $ I $, and we have $ \widetilde{F}(t) = (F_{a}(t), F_{c}(t), F_{b}(t)) $. Further, when a TFF $ \widetilde{F} $ is not regular, we call it as non-regular TFF. It means that for a non-regular TFF, in general, $ \widetilde{F}(t)\neq (F_{a}(t), F_{c}(t), F_{b}(t)) $. And the graphs of functions $ F_{a}, F_{c} $ and $ F_{b} $ can interchanged as $ t $ goes. In Figure 1, the TFFs $ \widetilde{F_{1}} $ and $ \widetilde{F_{2}} $ are non-regular and regular on $ [0, 2] $, respectively. Without loss of generality, no matter regular TFFs or non-regular TFFs, main results and the algorithm in this paper are all valid. In the sequel, we assume that TTFs are regular.

3.   Main results and an algorithm

Now, we will consider the FFIDDC (1.1) in this section. With respect to the FFIDDC (1.1), we can solve it by using the method of steps introduced by Fatullayev et al. ^[14].

First of all, we deal with the FFIDDC (1.1) on interval $ [0, \tau] $. Because $ x(t-\tau) = \widetilde{\Phi_{1}}(t-\tau), y(t-\tau) = \widetilde{\Phi_{2}}(t-\tau) $ for $ t\in[0, \tau] $, the FFIDDC (1.1) is equivalent to FCFDIVP as follows:

where

Thus, we transform the FCFDIVP (3.1) in matrix form:

Here, $ Z(t) = \left(

$$\begin{array}{c} x(t)\\ y(t)\\ \end{array}$$ \right) $, $ D = \left( $$\begin{array}{cc} ^{c}D^{\alpha} & 0\\ 0 & ^{c}D^{\beta}\\ \end{array}$$ \right) $, $ \widetilde{G}(\cdot) = \left( $$\begin{array}{c} \widetilde{G_{1}}(t, y(t), ^{c}D^{\alpha}x(t))\\ \widetilde{G_{2}}(t, x(t), ^{c}D^{\beta}y(t))\\ \end{array}$$ \right) $ and $ \widetilde{\Phi}(0) = \left( $$\begin{array}{c} \widetilde{\Phi_{1}}(0)\\ \widetilde{\Phi_{2}}(0)\\ \end{array}$$ \right). $

Definition 3.1. For the problem $(3.2)$, the fuzzy set $ \widetilde{Z} $ with MF

is called to be a solution of the problem $(3.2)$, which is also a solution to the FCFDIVP $(3.1)$, where $ \phi(0) = Z(0) $.

As for the formula (3.3), let $ Z(t) $ be a functional matrix. We determine $ \phi(0) = Z(0) $ for $ t\in[0, \tau] $ and calculate $ \mu_{1}\triangleq \mu_{\widetilde{\Phi}}(\phi(0)) $. After that, we compute $ g(\cdot) = D\cdot Z(t) $ on interval $ [0, \tau] $ and determine $ \mu_{2}\triangleq \mu_{\widetilde{G}}(g(\cdot)) $. Finally, we calculate the MD $ \mu $ as $ \mu = \min\{\mu_{1}, \mu_{2}\} $. We assign the number $ \mu $ as the MD of $ Z(t) $. We define the set of all functional matrices such as $ Z(t) $ with their MDs $ \mu $ as the fuzzy solution $ \widetilde{Z} $.

According to Definition 3.1., the solution $ \widetilde{Z} $ is a fuzzy bunch of real functional matrices, which consists of functional matrices such as $ Z(t) $. If a functional matrix $ Z(t) $ satisfies

for some functional matrices $ g\in supp(\widetilde{G}) $ and $ \phi(0)\in supp(\widetilde{\Phi}(0)) $, then it has a positive MD.

Let us represent $ \widetilde{G_{1}} = g_{1cr}+\widetilde{g_{1}} $ (crisp part + uncertainty), where $ g_{1cr} = G_{1c} $ and $ \widetilde{g_{1}} = \langle g_{1a}, 0, g_{1b}\rangle = \langle G_{1a}-G_{1c}, 0, G_{1b}-G_{1c}\rangle $. Similarly, $ \widetilde{G_{2}} = g_{2cr}+\widetilde{g_{2}} $, here $ g_{2cr} = G_{2c} $ and $ \widetilde{g_{2}} = \langle g_{2a}, 0, g_{2b}\rangle $.

Assume that $ \widetilde{\Phi_{1}} $ and $ \widetilde{\Phi_{2}} $ are regular TFFs. Then $ \widetilde{\Phi_{1}}(0) $ and $ \widetilde{\Phi_{2}}(0) $ are TFNs. Further, $ \widetilde{\Phi_{1}}(0) = \phi_{1cr}(0)+\widetilde{\phi_{1}}(0) $, here $ \phi_{1cr}(0) = \Phi_{1c}(0) $ and $ \widetilde{\phi_{1}}(0) = (\phi_{1a}(0), 0, \phi_{1b}(0)) = (\Phi_{1a}(0)-\Phi_{1c}(0), 0, \Phi_{1b}(0)-\Phi_{1c}(0)) $. In the same way, $ \widetilde{\Phi_{2}}(0) = \phi_{2cr}(0)+\widetilde{\phi_{2}}(0) $, here $ \phi_{2cr}(0) = \Phi_{2c}(0) $ and $ \widetilde{\phi_{2}}(0) = (\phi_{2a}(0), 0, \phi_{2b}(0)) $.

Since the FCFDIVP (3.1) is linear, we can solve it using the superposition principle. This follows that in order to find the solution of the FCFDIVP (3.1), we can separately consider the following subproblems:

(1) The associated crisp problem:

(2) The problem with initial TFFs:

(3) The problem with fuzzy source functions and zero initial functions:

By solving the above three subproblems (3.4)-(3.6), the solution of the FFIDDC (1.1) on interval $ [0, \tau] $ can be obtained. Similarly, at the next step, we can find the solution on interval $ [\tau, 2\tau] $. Hence, we can conclude that the solution of the FFIDDC (1.1) exists for $ t\in[0, \infty) $ using the method of steps ^[14].

In the sequel, we make clear how to solve each of these three subproblems (3.4)-(3.6).

3.1.   The associated crisp problem

To solve the problem (3.4), we provide the following theorem.

Theorem 3.1. For the problem $(3.4)$, we can get a unique solution to it, which is denoted as $ Z_{cr}(t) = \left(

$$\begin{array}{c} x_{cr}(t)\\ y_{cr}(t)\\ \end{array}$$ \right) $, when the following conditions fulfill:

$ (H_{1}) $ $ g_{1cr}, g_{2cr}: [0, \tau]\times {\mathbb R}\times {\mathbb R}\rightarrow {\mathbb R} $ are continuous.

$ (H_{2}) $ There exist constants $ K_{i}, L_{i}\in (0, 1) $ for $ i = 1, 2 $ such that

and for each $ x_{1}, x_{2}, y_{1}, y_{2}\in {\mathbb R} $,

Proof. The proof is similar to Theorem 3.1 of Dong et al. ^[13] and it is omitted.

3.2.   The problem with initial TFFs

In this subsection, we will give solvability of the problem (3.5) as follows.

Theorem 3.2. Consider the problem $(3.5)$, where $ \widetilde{\phi_{1}}(0) = (\phi_{1a}(0), 0, \phi_{1b}(0)), \widetilde{\phi_{2}}(0) = (\phi_{2a}(0), 0, \phi_{2b}(0)) $. If $ Z_{a}(t) = \left(

$$\begin{array}{c} x_{a}(t)\\ y_{a}(t)\\ \end{array}$$ \right) $ and $ Z_{b}(t) = \left( $$\begin{array}{c} x_{b}(t)\\ y_{b}(t)\\ \end{array}$$ \right) $ are solutions of the problem

for $ \left(

$$\begin{array}{c} \phi_{1}(0)\\ \phi_{2}(0)\\ \end{array}$$ \right) = \left( $$\begin{array}{c} \phi_{1a}(0)\\ \phi_{2a}(0)\\ \end{array}$$ \right) $ and $ \left( $$\begin{array}{c} \phi_{1}(0)\\ \phi_{2}(0)\\ \end{array}$$ \right) = \left( $$\begin{array}{c} \phi_{1b}(0)\\ \phi_{2b}(0)\\ \end{array}$$ \right) $, respectively, then the problem $(3.5)$ has a unique solution $ \widetilde{Z_{\phi}} $, which is a TFF matrix given by

Proof. On the one hand, according to Definition 3.1., it is easy for us to know that each $ Z(t) $ with non-zero MD from the bunch $ \widetilde{Z_{\phi}} $ is a solution of the problem (3.7) for some $ \left(

$$\begin{array}{c} \phi_{1}(0)\\ \phi_{2}(0)\\ \end{array}$$ \right) $ from $ \left( $$\begin{array}{c} \widetilde{\phi_{1}}(0)\\ \widetilde{\phi_{2}}(0)\\ \end{array}$$ \right) $.

On the other hand, in terms of Definition 2.1, the bunch $ \widetilde{\phi_{1}} = \langle \phi_{1a}, 0, \phi_{1b}\rangle $ consists of functions $ k\phi_{1a} $ and $ k\phi_{1b} $ $ \left([0, 1]\ni k = 1-\alpha\right) $ owing to $ \phi_{1c} = 0 $. And the bunch $ \widetilde{\phi_{2}} = \langle\phi_{2a}, 0, \phi_{2b}\rangle $ is similar to the former.

Moreover, if a Z(t) is a solution of the problem (3.7), then $ kZ(t) $ is a solution of the same equation with $ \left(

$$\begin{array}{c} k\phi_{1}(0)\\ k\phi_{2}(0)\\ \end{array}$$ \right) $ taken instead of $ \left( $$\begin{array}{c} \phi_{1}(0)\\ \phi_{2}(0)\\ \end{array}$$ \right) $.

From the above reasoning we can get the conclusion that the bunch $ \widetilde{Z_{\phi}} $ consists of $ kZ_{a} $ and $ kZ_{b} $. Therefore, the bunch $ \widetilde{Z_{\phi}} $ is a TFF matrix determined to be $ \widetilde{Z_{\phi}} = \langle Z_{a}, 0, Z_{b}\rangle $.

Actually, we can get the solutions $ Z_{a}(t) = \left(

$$\begin{array}{c} \phi_{1a}(0)\\ \phi_{2a}(0)\\ \end{array}$$ \right) $ and $ Z_{b}(t) = \left( $$\begin{array}{c} \phi_{1b}(0)\\ \phi_{2b}(0)\\ \end{array}$$ \right) $.

We can express the value of the TFF matrix $ \widetilde{Z_{\phi}} $ (3.8) at a time $ t $ by the formula $ \widetilde{Z_{\phi}}(t) = (\min\{Z_{a}(t), 0, Z_{b}(t)\}, 0, \max\{Z_{a}(t), 0, Z_{b}(t)\}) $. Note that this value is a matrix of TFNs.

3.3.   The problem with fuzzy source functions and zero initial functions

As for the solution of the problem (3.6), we give the theorem as follows.

Theorem 3.3. In the problem $(3.6)$, assume $ \widetilde{g_{1}} = \langle g_{1a}, 0, g_{1b}\rangle, \widetilde{g_{2}} = \langle g_{2a}, 0, g_{2b}\rangle $, where $ \left(

$$\begin{array}{c} g_{1a}\\ g_{2a}\\ \end{array}$$ \right) $ and $ \left( $$\begin{array}{c} g_{1b}\\ g_{2b}\\ \end{array}$$ \right) $ separately satisfy the conditions $ (H_{1}) $ and $ (H_{2}) $ of Theorem 3.1. If $ Z_{u}(t) = \left( $$\begin{array}{c} x_{u}(t)\\ y_{u}(t)\\ \end{array}$$ \right) $ and $ Z_{v}(t) = \left( $$\begin{array}{c} x_{v}(t)\\ y_{v}(t)\\ \end{array}$$ \right) $ are solutions of the following problem:

for $ \left(

$$\begin{array}{c} g_{1}\\ g_{2}\\ \end{array}$$ \right) = \left( $$\begin{array}{c} g_{1a}\\ g_{2a}\\ \end{array}$$ \right) $ and $ \left( $$\begin{array}{c} g_{1}\\ g_{2}\\ \end{array}$$ \right) = \left( $$\begin{array}{c} g_{1b}\\ g_{2b}\\ \end{array}$$ \right) $ in several, then the problem $(3.6)$ has a unique solution $ \widetilde{Z_{g}} $, which is a TFF matrix given by

Proof. Since $ g_{1a} $ and $ g_{2a} $ satisfy $ (H_{1}) $ and $ (H_{2}) $, it follows from Theorem 3.1 that there will be a unique solution when $ \left(

$$\begin{array}{c} g_{1}\\ g_{2}\\ \end{array}$$ \right) = \left( $$\begin{array}{c} g_{1a}\\ g_{2a}\\ \end{array}$$ \right) $ in (3.9). By the same token, from the assumption for $ \left( $$\begin{array}{c} g_{1}\\ g_{2}\\ \end{array}$$ \right) = \left( $$\begin{array}{c} g_{1b}\\ g_{2b}\\ \end{array}$$ \right) $ in the problem (3.9), only one solution will exist in this case. Thus, the proof can be done by the same way as in Theorem 3.2.

Thus, we can also express the value of the TFF matrix $ \widetilde{Z_{g}} $ (3.10) at a time $ t $ by $ \widetilde{Z_{g}}(t) = (\min\{Z_{u}(t), 0, Z_{v}(t)\}, 0, \max\{Z_{u}(t), 0, Z_{v}(t)\}) $, which is a matrix of TFNs.

3.4.   A solution algorithm

By integrating Theorems 3.1-3.3 above, we can obtain the following solution algorithm for solving the FFIDDC (1.1).

Algorithm 3.1. Step 1. Using the method of steps and dealing with the FFIDDC $(1.1)$ on interval $ [0, \tau] $, transform the FFIDDC $(1.1)$ into the FCFDIVP $(3.1)$.

Step 2. Represent the initial values and source functions as

Step 3. Find the solution $ Z_{cr}(t) $ of the problem $(3.4)$.

Step 4. Seek the solutions $ Z_{a}(t) $ and $ Z_{b}(t) $ of the problem $(3.7)$ in regard to $ \left(

$$\begin{array}{c} \phi_{1}(0)\\ \phi_{2}(0)\\ \end{array}$$ \right) = \left( $$\begin{array}{c} \phi_{1a}(0)\\ \phi_{2a}(0)\\ \end{array}$$ \right) $ and $ \left( $$\begin{array}{c} \phi_{1}(0)\\ \phi_{2}(0)\\ \end{array}$$ \right) = \left( $$\begin{array}{c} \phi_{1b}(0)\\ \phi_{2b}(0)\\ \end{array}$$ \right) $, respectively, and define

Step 5. Solve the problem $(3.9)$ and denote the solutions by $ Z_{u}(t) $ and $ Z_{v}(t) $, corresponding to $ \left(

$$\begin{array}{c} g_{1}\\ g_{2}\\ \end{array}$$ \right) = \left( $$\begin{array}{c} g_{1a}\\ g_{2a}\\ \end{array}$$ \right) $ and $ \left( $$\begin{array}{c} g_{1}\\ g_{2}\\ \end{array}$$ \right) = \left( $$\begin{array}{c} g_{1b}\\ g_{2b}\\ \end{array}$$ \right) $, respectively, and let

Step 6. Construct the unique solution of the FFIDDC $(1.1)$ on interval $ [0, \tau] $ as follows:

Similarly, we can find the unique solution on interval $ [\tau, 2\tau] $, $ \cdots $. In consequence, we obtain a unique solution of the FFIDDC (1.1) which exists at $ t\geq 0 $.

4.   An example

In this section, referring to Example 1 in Fatullayev et al. ^[14], we take an example to clarify that the hypotheses in Theorems 3.1-3.3 can be satisfied, which can be also employed to verify the main results presented in Dong et al. ^[13].

Example 4.1. Let us solve the problem

where

with

In the sequel, we only deal with the problem (4.1) on interval $ \left[0, \dfrac{\pi}{2}\right] $. The unique solution on interval $ [\tau, 2\tau] $, $ \cdots $ can be likewise found.

Firstly, the problem (4.1) can be transformed as the problem

where

Then, after performing some arithmetics, one can get

where

Next, we respectively solve the three subproblems of the problem (4.2) on $ \left[0, \dfrac{\pi}{2}\right] $ one by one.

(i) With respect to $ g_{1cr} $ and $ g_{2cr} $, we can rewrite them in another forms:

where

We can easily see that $ g_{1cr}, g_{2cr}:[0, \dfrac{\pi}{2}]\times {\mathbb R}\times {\mathbb R}\rightarrow {\mathbb R} $ are continuous and satisfy $ (H_{1}) $.

Moreover, taking $ K_{1} = 0.5 $, $ K_{2} = 10^{-3} $, $ L_{1} = 0.7 $ and $ L_{2} = 10^{-3} $, then we have

and

for $ i = 1, 2 $ and any $ u_{i} $, $ v_{i} $, $ m_{i} $, $ n_{i}\in {\mathbb R} $. Hence, it is easy to see that $ (H_{2}) $ holds.

To sum up, all the hypotheses $ (H_{1}) $ and $ (H_{2}) $ in Theorem 3.1 are satisfied and we can obtain a unique solution $ Z_{cr}(t) $, which is illustrated in Figure 2 to the following associated crisp subproblem via using the "L1 method" due to Li and Zeng ^[23]:

which is the first subproblem of the problem (4.2).

From Figure 2, one can easily see that the order of magnitude of the ordinate value in Figure 2 is $ 10^8 $, and $ x_{cr} $ and $ y_{cr} $ established by relying on the "L1 method" discretization ^[23] of the Caputo fractional derivatives in (4.3), are growing very fast, and after iterating 43 times ($ t\approx 0.66 $), the values of $ x_{cr} $ and $ y_{cr} $ approach $ 1 $ and $ 27.88 $, respectively. Since the ordinate value of Figure 2 is too large to observe between $ t = 0.6 $ and $ t = 0.7 $, we give the local graph Figure 3 for the crisp discretized solutions to the problem (4.3) on the ordinate value interval $ \left[0, 100\right] $, which right endpoint is far less than that of the ordinate value interval $ [0, 4\times 10^8] $ in Figure 2. We note that Figure 3 locally shows the unique solution $ Z_{cr}(t) = \left(

$$\begin{array}{c} x_{cr}(t)\\ y_{cr}(t)\\ \end{array}$$ \right) = \left( $$\begin{array}{c} 1\\ 27.88\\ \end{array}$$ \right) $ of the problem (4.3) at $ t\approx 0.66\in \left[0, \dfrac{\pi}{2}\right] $.

(ii) Solve the following crisp problem:

for $ \left(

$$\begin{array}{c} \phi_{1}(0)\\ \phi_{2}(0)\\ \end{array}$$ \right) = \left( $$\begin{array}{c} -0.25\\ -0.15\\ \end{array}$$ \right) $ and $ \left( $$\begin{array}{c} \phi_{1}(0)\\ \phi_{2}(0)\\ \end{array}$$ \right) = \left( $$\begin{array}{c} 0.25\\ 0.15\\ \end{array}$$ \right) $, and find the solutions $ Z_{a}(t) = \left( $$\begin{array}{c} -0.25\\ -0.15\\ \end{array}$$ \right) $ and $ Z_{b}(t) = \left( $$\begin{array}{c} 0.25\\ 0.15\\ \end{array}$$ \right) $, respectively.

Letting $ \widetilde{\phi_{1}}(0) = (-0.25, 0, 0.25) $ and $ \widetilde{\phi_{2}}(0) = (-0.15, 0, 0.15) $, then it follows that the solution to the second subproblem of the problem (4.2) as hereunder mentioned:

is the TFF matrix $ \widetilde{Z_{\phi}} = \langle Z_{a}, 0, Z_{b}\rangle $, which is graphed in Figure 4, and one knows that

Hence, Theorem 3.2 holds and there is one and only solution to the problem (4.4). Indeed, since the solutions $ Z_{a}(t) $ and $ Z_{b}(t) $ are all constant matrices in Figure 4, it is easy to see that the values of $ \widetilde{x_{\phi_{1}}} $ and $ \widetilde{y_{\phi_{2}}} $ are all constants when MD $ \alpha\in [0, 1] $ is determined. That is, the values of $ \widetilde{x_{\phi_{1}}} $ and $ \widetilde{y_{\phi_{2}}} $ remain constant as $ t $ increases. For example, $ \widetilde{x_{\phi_{1a}}} = 0.25 $, $ \widetilde{x_{\phi_{1b}}} = -0.25 $, $ \widetilde{y_{\phi_{2a}}} = 0.15 $ and $ \widetilde{y_{\phi_{2b}}} = -0.15 $ when $ \alpha = 0 $.

(iii) Consider the following crisp problem:

for $ \left(

$$\begin{array}{c} g_{1}\\ g_{2}\\ \end{array}$$ \right) = \left( $$\begin{array}{c} g_{1a}\\ g_{2a}\\ \end{array}$$ \right) $ and $ \left( $$\begin{array}{c} g_{1}\\ g_{2}\\ \end{array}$$ \right) = \left( $$\begin{array}{c} g_{1b}\\ g_{2b}\\ \end{array}$$ \right) $, and find the solutions $ Z_{u}(t) = \left( $$\begin{array}{c} x_{u}(t)\\ y_{u}(t)\\ \end{array}$$ \right) $ and $ Z_{v}(t) = \left( $$\begin{array}{c} x_{v}(t)\\ y_{v}(t)\\ \end{array}$$ \right) $, respectively. That is, one solves the following crisp problems:

and

As for the problem (4.5), $ g_{1a} $ and $ g_{2a} $ can be written in following forms:

where

It is clear to find that $ g_{1a}, g_{2a}:[0, \dfrac{\pi}{2}]\times {\mathbb R}\times {\mathbb R}\rightarrow {\mathbb R} $ are continuous.

On the other hand, let $ K_{1} = 0.4 $, $ K_{2} = 0.1 $, $ L_{1} = 0.6 $ and $ L_{2} = 0.2 $. Then

and for each $ u_{1} $, $ u_{2} $, $ v_{1} $, $ v_{2} $, $ m_{1} $, $ m_{2} $, $ n_{1} $, $ n_{2}\in {\mathbb R} $,

According to the above, all the hypotheses $ (H_{1}) $ and $ (H_{2}) $ hold. And that on the basis of Theorem 3.1, we can obtain the unique solution $ Z_{u}(t) $ to the last subproblem of the problem (4.2) involving fuzzy source functions and zero initial functions as follows:

Similarly, we can conclude that the problem (4.6) also has a unique solution $ Z_{v}(t) $. It follows that the solution to the problem (4.7) is the TFF matrix $ \widetilde{Z_{g}} = \langle Z_{u}, 0, Z_{v}\rangle $, which is depicted in Figure 5, and we have

As a consequence, Theorem 3.3 holds and there is a unique solution to the problem (4.7). Moreover, it can be seen that, in Figure 5, the images of $ \widetilde{x_{g_{1}}} $ and $ \widetilde{y_{g_{2}}} $ are respectively symmetric when the corresponding MDs are chosen. For MD $ \alpha\in [0, 1) $, as $ t $ increases, the upper branch of $ \widetilde{x_{g_{1}}} $ firstly increases and then decreases ($ t\approx 0.69 $ is the turning point), and the upper branch of $ \widetilde{y_{g_{2}}} $ gets bigger and bigger. Especially, the values of $ \widetilde{x_{g_{1}}} $ and $ \widetilde{y_{g_{2}}} $ are constant $ 0 $ when the MD $ \alpha = 1 $. However, the ordinate value of Figure 5 is of order of magnitude $ 10^{-1} $ and very small compared with that in Figure 2, so it has little effect on the final solution $ \widetilde{Z}(t) $.

In conclusion, by solving the problems (4.3), (4.4) and (4.7), it follows from Algorithm 3.1 that we can find the unique solution of the problem (4.1) on interval $ \left[0, \dfrac{\pi}{2}\right] $ as

which can be found from Figure 6. It is easy to note that the image of fuzzy solution $ \widetilde{Z}(t) $ in Figure 6 has a similar trend to that of the crisp solution $ Z_{cr}(t) $ in Figure 2. That is because when MD is fixed, the unique solution $ \widetilde{Z}(t) $ of the problem (4.1) is composed of three parts and the value of the crisp solution $ Z_{cr}(t) $ for the problem (4.3) is too large (order of magnitude $ 10^8 $ of the ordinate value for Figure 2). Further, since the ordinate value of Figure 6 is very big (order of magnitude $ 10^8 $) and the curves of $ \widetilde{x}, \widetilde{y} $ can not be distinguished obviously, a local graph Figure 7 of Figure 6 is given for the fuzzy solutions of the problem (4.1) when the ordinate value interval is restricted to $ \left[0, 30\right] $. Choosing specially MD $ \alpha = 0 $, we have $ \widetilde{x_{\phi_{1a}}} = 0.93 $, $ \widetilde{x_{\phi_{1b}}} = 1.07 $, $ \widetilde{y_{\phi_{2a}}} = 27.68 $ and $ \widetilde{y_{\phi_{2b}}} = 28.08 $.

Before the end of this section, we remark that the unique solution of the problem (4.1) on interval $ \left[\dfrac{\pi}{2}, \pi\right] $, $ \cdots $ can be found in the same way. Therefore, one can find the unique solution of the problem (4.1) for $ t > 0 $ via Algorithm (3.1).

5.   Concluding remarks

In this paper, inspired by Fatullayev et al. ^[14] and Dong et al. ^[13], by using the methods of steps and separating fuzzy items, we solved the implicit coupled systems of fuzzy fractional delay differential equations with fuzzy initial values and source functions (FFIDDC) (1.1). Under the conditions $ (H_1) $ and $ (H_2) $, and based on the concept of TFFs and examples in ^[16,17], we obtained existence and uniqueness of solution for the FFIDDC (1.1). We note that the solution is a triangular fuzzy function matrix which is composed of real functional matrices. Furthermore, an algorithm for solution procedure and an example for graphical confirmation of explicit solution were given.

As Remark 1.1 mentioned, except for considering the problem (1.1) with Caputo fractional derivative, we will explore the problem of form (1.1) with fractional derivatives of Riemann-Liouville or Hadamard in the future. Recently, there are more and more researchers to explore the relevant (fractional) differentiable set-value problems and impulsive problems, such as Amrahov et al. ^[4] and Sun et al. ^[32]. Therefore, for further study, we can introduce the set-valued delay and the impulse into the FFIDDC (1.1), and extend the methods proposed in this paper to solve the new problems associated with set-values or impulsive elements.

Acknowledgments

We are grateful to the anonymous referees and editors for their valuable comments and helpful suggestions to improve the quality of this paper.

This work was partially supported by the Sichuan Science and Technology Program (2019YJ0541) the Opening Project of Sichuan Province University Key Laboratory of Bridge Non-destruction Detecting and Engineering Computing (2019QZJ03) and the Innovation Fund of Postgraduate, Sichuan University of Science & Engineering (y2020080).

Conflict of interest

All authors declare no conflicts of interest in this paper.