1. Introduction
The aim of this paper is the study of the comparison principle (CP) for weakly coupled quasi-linear cooperative systems with delays. The novelty of this research lies in the application of time delays in the principal part of the system. The validity of the CP is proven in Theorem 1,
Section 3. As a consequence of the validity of the CP, results are derived in Theorem 3 on the existence and in Theorem 2 on the uniqueness of weak solutions for the studied systems. The results remain valid with reasonable modifications if the delays are in the other terms of the system.
Let
be a bounded domain in
and
T be a finite number. Let us consider in
a strictly parabolic system
in
Q, where
are constants, with the boundary conditions
on
.
Let us recall that since system (1) is a strictly parabolic one, for every
and
,
holds
Here,
and
are monotonous and continuous functions,
is decreasing, and
is increasing.
The coefficients
,
,
, and
are measurable functions with respect to
x and
t. In addition,
and
are locally Lipchitz continuous with respect to
,
u, and
p, i.e.,
for every
,
and
. Furthermore, in
,
for
and
. Without loss of generality, one may presume that
,
for every
,
,
and
Furthermore, suppose that system (1) is cooperative. Cooperativeness means that in
the functions
are non-increasing ones with respect to
for
.
The interest in the qualitative properties of weakly coupled quasi-linear cooperative systems with delays lies in their useful applications, for instance, in the spatial SEIR models with delays described in
Section 2. In these models, the time shift in the spatial propagation of the different compartments is incorporated into the model through the implementation of delays in the principal part of the system.
2. The Model Example
The interest in weakly coupled cooperative parabolic systems with delays is conditioned by some of their applications as spatial SEIR models in epidemiology.
SEIR models have been described in classical monographs on the subject such as [
1,
2]. For the sake of completeness, we recall the essentials of SEIR models.
An epidemic SEIR model is a compartmental one. In this kind of model, the population is assigned into a number of sets, or compartments—in this case, susceptible (S), exposed (E), infectious (I), and recovered (R).
Migration between compartments is strictly defined. When an infectious person (from compartment I) transfers the pathogen to a susceptible person (from compartment S), the latter contracts the disease and moves to the exposed compartment E. During the latency, or incubation, period of the disease , individuals from E are infected but not yet contagious.
Members of E transfer into the infectious compartment I after the latency period . I contains people who are contagious to the susceptible individuals from S.
Members of I transfer into the removed compartment R in the recovery period . It is presumed that members of R develop immunity. R contains recovered people and deceased individuals.
The following illustrates the process:
Let us denote with , , , and measures of the corresponding set S, E, I, and R. is the number of susceptible people, is the number of exposed people, is the number of infected individuals, is the number of the recovered or deceased, and is the total number of the population.
In the classical epidemic SEIR model, the dynamics of disease spread is described by the following system of ordinary differential equations; see [
2,
3]:
where
,
,
, and
are the parameters. Here,
is the transmission coefficient;
is the removal coefficient;
is a constant and the latency period
is medically determined; and
is the mortality rate
, which is considered to be equal to the birth rate.
The main advantage of SEIR models is their ability to predict how a disease spreads over time, for instance, in terms of the total number of infected people at time t and the duration period of the epidemic. SEIR models can illustrate the effects of public health interventions on epidemic dynamics, such as vaccination, social distancing restrictions, etc. Furthermore, they provide a simple direct approximation of the Basic Reproduction Number and estimations of other epidemiological parameters.
The main disadvantage of the classic SEIR model is that it is described by a system of ordinary differential equations. The solution gives values for , and at time t in the entire area of study but not the spatial distribution of members of the corresponding compartment.
In order to take into account the spatial distribution of the members of the different compartments, one uses spatial SEIR epidemic models; see [
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14] and others.
The intuitive approach in spatial models is that the process of disease spreading is similar to a chemical reaction, and one may use reaction–diffusion systems (1) and (2).
In contrast to chemical reactions, in spatial epidemic models, one has to take into account the incubation and recovery periods. This is why in a spatial SEIR model, we use a reaction–diffusion system with delays that mark the “shift” in time due to the recovery and incubation periods.
When the epidemic is in full swing, the spatial SEIR model is described by
where
is the incubation period, and
is the recovery period. The above system is similar to that studied in [
4], but the latter does not use delays to include the incubation and recovery periods.
The dynamics of disease spreading at the beginning of an epidemic is different. Since the volume of
I is small, the use of the Michaelis–Menten equation on the right-hand side is reasonable. The analogue to chemical reactions is Michaelis–Menten-type modeling of catalyst or enzyme reactions, where the quantity of enzymes is small. This is why a spatial SEIR epidemic model with a low rate of infection is
where
is the incubation period, and
is the recovery period. System (8) is similar to that for enzyme reaction–diffusion—the low rate of infection corresponds to a low quantity of an enzyme.
In order to describe an epidemic from the beginning to the end, it is reasonable to employ full-range spatial SEIR epidemic models of the type
where
is the incubation period, and
is the recovery period. Function
F is smooth, and
when
and
when
. The constants
and
depend on the pathogen and transmission coefficient, and determination of these constants is a major obstacle in problem (9). Another obstacle is the collection of high-quality data.
Unlike classic SEIR models, the spatial ones require initial and boundary conditions. If there is no disease at the beginning of our study, the initial conditions are
. If the pathogen is imported, then we have Neumann boundary conditions
where
is entrance point. If the disease starts within the region, we have the right-hand side
f of system (1).
3. The Comparison Principle for Cooperative Parabolic Systems with Delays
The following theorem states that the comparison principle holds for cooperative weakly coupled parabolic systems with delays. For more detailed proofs, see [
15].
Theorem 1. Let be weak sub- and super-solutions to system (1) and (2). If (3)–(5) hold and on Γ, then in Q.
Proof. Let
,
. Suppose
is non-equivalent to 0 in
Q. Then,
, and it is a weak sub-solution of
in
Q with non-positive boundary data on
. Here,
and
. Then,
satisfies the following integral inequality:
for every non-negative test function
and every
.
Consider the test function
for some constant
, where
and
is the constant from (4). Then,
because
, and according to the initial conditions, we have
.
Therefore, (16) can be written as
Taking into account that
for
and
, according to (16), we obtain
where
,
,
.
is an
diagonal matrix, and all of its elements are 0, but
for
,
(every
-th element of the diagonal equals 1).
is a symmetrized
matrix, where
for
and
.
For a sufficiently large constant
L, the matrix
B defines the positive-defined quadratic form. Therefore, from
, it follows that
in
, i.e.,
Then, according to (3), we have
where
c is a constant such that
for every
, and
is defined in (3).
Furthermore, according to the Cauchy inequality, we have
where
. Therefore, (17) becomes
where
for every
and
is the constant form (18).
Hence,
or
and for
, we obtain
The constant
depends only on
n,
N,
,
, and
.
Thus, the inequality
holds for every
.
Integrating the above inequality into
and taking into account that
on
, we obtain
which is impossible for
. □
A direct consequence of the validity of the CP is the uniqueness of the solution of (1) and (2).
Theorem 2. If (3)–(5) hold for system (1) and (2), then the solution is unique.
The proof for Theorem 2 is trivial. If u and v are solutions of (1) and (2), then one may consider u a sub-solution and v a super-solution for (1) and (2). Since on , according to the CP, in . On the other hand, v is a sub-solution and u is a super-solution for (1) and (2) as well, and according to the CP, in .
For sake of simplicity, we present the existence theorem for a simpler case that covers the model example; in particular, suppose
for every
. Then, system (1) becomes
for
, with the initial data
and null boundary data.
Nevertheless, some additional conditions are required. First of all,
f is supposed to be a bounded function, i.e., a positive constant
C exists such that
in
for every
.
The coefficients
are
smooth with respect to
t.
,
, and
are Holder continuous in
with the Holder constant
and
for
. In addition,
.
Then, the following theorem holds:
Theorem 3. Suppose (3)–(5) hold for system (20). Let be a smooth super-solution, and be a smooth sub-solution of (20), on Γ. Then, there is a solution for (20) with null boundary data.
Proof. 1. The function is non-decreasing with respect to for a sufficiently large constant . Indeed, according to condition (5), the functions are non-decreasing with respect to for , . Since are independent on , for , then according to (4), in Q for , where is the constant from (4). depends only on the constant M such that .
Hence, the functions are non-decreasing with respect to for .
2. We construct through induction a sequence of vector-functions
. The first term is
. The term
defines through induction
as the solution of the problem
in Q
in
for every
.
Let the left-hand side of (21) be and the right-hand side be for .
System (21) is decomposable into
N independent equations that are solvable in
using Theorem 5 from [
16], p. 127.
3. Since
B is an increasing function with respect to
u, according to the CP, the sequence
satisfies
4. The equation holds for every k.
5. The sequence is bounded in Q and monotonously increasing. Thus, a function exists such that pointwise in Q. Moreover, is uniformly bounded and equicontinuous in since is Holder continuous and for every . Then, according to the Arzelà—Ascoli theorem, there is a sub-sequence that converges uniformly with . Without loss of generality, we denote as .
Since and every satisfies boundary conditions (22), then u satisfies (22) as well.
The functions
are monotonous, and
is continuous; therefore,
in
Q. Then, according to Theorem 5 in [
17], p. 648, it follows that
in
.
6. Analogously to 5, is uniformly bounded and equicontinuous in , and according to the Arzelà—Ascoli theorem, one obtains .
7. The function is a solution of (20) and (22).
For every
,
holds, and for
,
Therefore, is a weak solution of (20) and (22). □
It is easy to check that systems (8)–(10) are cooperative ones. Therefore, the CP holds for them, and they are unique weak solutions. What is more, it is not hard to prove that the solutions are smooth.