Next Article in Journal
Applications of q-Bessel-Struve Functions on Univalent Functions
Previous Article in Journal
Bifurcation and Optimal Control Analysis of an HIV/AIDS Model with Saturated Incidence Rate
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Microbial Food Web Dynamics Under the Influence of Leachate Recirculation

by
Fatema Ahmed Al Najim
1,†,
Miled El Hajji
2,3,*,† and
Bader Saad Alshammari
4,†
1
Department of Mathematics and Statistics, College of Science, King Faisal University, P.O. Box 400, Al-Ahsa 31982, Saudi Arabia
2
Department of Mathematics and Statistics, Faculty of Science, University of Jeddah, P.O. Box 80327, Jeddah 21589, Saudi Arabia
3
ENIT-LAMSIN, BP. 37, 1002 Tunis-Belvédère, Tunis El Manar University, Tunis 1068, Tunisia
4
Department of Mathematics, College of Science, Northern Border University, Arar 91431, Saudi Arabia
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2025, 13(13), 2146; https://doi.org/10.3390/math13132146
Submission received: 27 May 2025 / Revised: 27 June 2025 / Accepted: 29 June 2025 / Published: 30 June 2025

Abstract

The three-tiered microbial food chain without maintenance under leachate recirculation is the subject of a mathematical seven-dimensional dynamical system that is proposed in this work. This model captures the complex interactions between chlorophenol degraders, phenol degraders, and methanogens in the presence of hydrogen inhibition. The implementation allows for investigation of how hydrogen levels affect the overall system dynamics and phenol production. There is a thorough qualitative analysis provided. A stability analysis of equilibrium points is performed. It is demonstrated that the persistence of the three bacteria is correlated with the existence of the positive equilibrium point, assuming some monotonicity properties on the growth rates. Asymptotic coexistence is satisfied, although periodic orbit possibilities are not ruled out. In order to decrease the amount of organic materials within the reactor, we suggest an optimal strategy on the rate of leachate recirculation in the second stage. Lastly, we offer a few numerical investigations that support and strengthen the theoretical conclusions.
MSC:
34K20; 34D23; 37B25; 37N25; 49J15; 92D25; 93A30

1. Introduction

A set of biological activities known as anaerobic digestion occurs when bacteria break down biodegradable materials without the presence of oxygen. Biogas, liquid digestate, and solid digestate are the end products of this process. Swamp gas is created by a similar natural process that takes place in wetlands and marshes. Landfill gas is also produced by the mostly anaerobic breakdown of the organic fraction in landfills. Methane, carbon dioxide, and hydrogen sulfide are present in landfill gas, biogas, and swamp gas, though in different proportions. There are four steps in this biological process: hydrolysis, acetogenesis, acidogenesis, and methanogenesis. The initial stage of turning organic material into biogas is hydrolysis. In order for the following group of bacteria to continue processing the material, some bacteria in this stage convert organic polymers, such as polysaccharides, into simple sugars. The second stage of turning organic material into biogas is called acidogenesis. Simple sugars and amino acids are transformed into carbon dioxide, hydrogen, ammonia, and organic acids at this step by specific bacteria known as acidogenic bacteria. The third stage in turning organic materials into biogas is called acetogenesis. At this point, the organic acids are changed into acetic acid, carbon dioxide, and hydrogen by specific bacteria known as acetogenic bacteria. The last stage of turning organic resources into biogas is called methanogenesis. The intermediate products created in the previous stages are transformed into biogas (mostly carbon dioxide and methane) in this stage by specific single-celled organisms known as methanogens. Digestate, the solid and liquid residue left over from this process, includes dead bacteria and materials that the microorganisms cannot consume. Anaerobic digestion can use a variety of feedstocks, including manure, industrial wastewater, municipal solid waste (MSW), municipal wastewater, fats, oils, and greases, food scraps, sludges, etc. Municipal solid waste (MSW) can be valorized through anaerobic digestion to produce digestate and biogas, which are organic soil amendments and renewable energy sources, respectively. When phenols, which are persistent pollutants found in MSW, are added to soil together with digestate, they can harm microbiota and prevent the anaerobic digestion process. Determining the anaerobic digestion operating parameters that permit the full breakdown of phenol is then crucial. Oil refineries, coking plants, chemical companies, and the production of polymeric resins all frequently release phenol as a pollutant. The US Environmental Protection Agency (EPA) designated phenol as a priority contaminant. Due to the presence of a big hydrocarbon group, phenol is somewhat soluble in water. We may therefore draw the conclusion that phenol is somewhat soluble in water and that this solubility results from an intermolecular hydrogen bond that forms between the water and the hydrogen atom in the hydroxyl group. Anaerobic wastewater treatment is hampered by phenol’s inhibitory effects. Several works studied the dynamic modeling of syntrophic interactions in anaerobic digestion [1,2,3,4]. Leachate is created when water seeps through solid waste, releasing soluble substances and waste breakdown products. Pollutants from solid waste are leached into the water when it flows through a landfill. Leaching of naturally soluble materials, leaching of soluble chemical products or biological reactions, fine washout, and colloids are some of the mechanisms used to remove contaminants [5]. In addition to substituted and chlorinated phenols, phenol and cresols are among the phenolic chemicals identified in the leachate [6]. Solvents and heat treatment have an impact on the antioxidant activity and soluble and insoluble phenolic components of immature calamondin [7]. The paper presents a comprehensive mathematical model to study the dynamics of a three-tiered microbial food web in a chemostat under leachate recirculation. The model captures interactions between chlorophenol degraders, phenol degraders, and methanogens, incorporating hydrogen inhibition effects. This work can make a valuable contribution to the mathematical modeling of microbial food webs in bioreactors. Its theoretical depth and innovative optimal control approach are valuable elements. Addressing the noted weaknesses, particularly by linking the model to experimental data and discussing practical implementation, would further enhance its impact. A seven-dimensional mathematical dynamical system for the three-tiered microbial food web under leachate recirculation is proposed in this research. The intricate relationships between methanogens, phenol degraders, and chlorophenol degraders in the presence of hydrogen inhibition are captured by this model.
This research paper is structured as follows: We introduce a seven-dimensional dynamical system that describes the three-tiered microbial food chain under the leachate recirculation in Section 2. The various hypotheses regarding the rates of bacterial growth, the proof of the solution’s positivity and boundedness and the definition of the steady states are all included in this section. Several preliminary results are introduced in Section 3. The seven-dimensional dynamical system is effectively reduced to a three-dimensional system in Section 4, simplifying analysis while retaining biological relevance. We discuss the existence and the local and global stability of the reduced dynamics’ equilibria in relation to the bacterial growth rates and the operating parameters (dilution rate and input concentrations). The persistence of the main seven dimensions dynamics is covered in Section 5. By reducing the amount of organic matter within the reactor and maintaining an optimal leachate recirculation rate, we suggest an optimal control technique in Section 6. For both the direct and optimum control problems, we present a number of numerical tests in Section 7 that confirm the key theoretical findings. In Section 8, we conclude the paper with a brief statement.

2. Mathematical Model

Anaerobic digestion Model No. 1 (ADM1) [8] serves as the foundation for the model created here. Three substrate and three biomass variables make up the basic model here, from which a sub-model characterizing phenol degradation and an extension of the entire model to include the extraneous substrates are produced and explained in the pertinent sections. The chlorophenol degrader produces phenol as a byproduct by using hydrogen and chlorophenol for growth. The phenol degrader grows on phenol to generate hydrogen, which also prevents it from growing. This hydrogen is scavenged by the methanogen, which serves as the main syntroph. Consider a chemostat (bioreactor, Figure 1) to which limiting substrates are continuously added ( N 0 i n , N 1 i n , N 2 i n and N 3 i n ) where one of them is available in two forms (soluble and insoluble substrate; N 0 i n and N 1 i n ), while the culture liquid ( N 0 , N 1 , N 2 , N 3 , B 1 , B 2 , B 3 ) is continuously mixed [9]. Both hydrogen ( N 3 ) and chlorophenol ( N 1 ) are used by the chlorophenol degrader ( B 1 ) to grow, yielding phenol ( N 2 ) as a byproduct. The hydrogen inhibits the phenol degrader ( B 2 ), which consumes phenol ( N 2 ). The methanogen ( B 3 ) grows on the hydrogen (See Figure 2). The model that was suggested by Wade et al. [10] and examined by Sari and Wade [11] is revisited in the actual paper, taking into account two significant modifications that are pertinent from an applied standpoint. First, we solely consider the dilution rate and ignore all species-specific mortality (maintenance) rates. We disregard the portion of hydrogen generated by the phenol degrader in the second model update. Chlorophenol, phenol, and hydrogen are added to the chemostat at concentrations N i i n , i = 0 , 1 , 2 , 3 , respectively, and a constant dilution rate D.
Three biomass variables, four substrate variables, and seven components (Figure 2) make up the model created here, which is based on Anaerobic Digestion Model No. 1 (ADM1) (Batstone et al. [8]). Using hydrogen ( N 3 ) and chlorophenol ( N 1 ) for growth, the chlorophenol degrader ( B 1 ) yields phenol in two forms: soluble ( N 2 ) and insoluble ( N 0 ). The hydrogen inhibits the phenol degrader ( B 2 ), which consumes phenol ( N 2 ). The methanogen ( B 3 ) grows on the hydrogen. The model suggested in [14] is revisited in the actual paper to take leachate recycling into account. The reactor is filled with leachate, chlorophenol, phenol, and hydrogen at a constant dilution rate D, leachate recirculation rate l r , and input concentrations N i i n , i = 0 , 1 , 2 , 3 , respectively. More details on the significance of the variables and parameters of the dynamics (1) and (2) are given in Table 1.
The following seven-dimensional dynamical system of ODEs is then used to represent the concentrations of species and substrates, providing a comprehensive framework for studying the complex interactions in a three-tiered microbial food web with leachate recirculation:
N ˙ 0 = D ( N 0 i n N 0 ) h ( l r ) N 0 , B ˙ 1 = φ 1 ( N 1 , N 3 ) D B 1 , N ˙ 1 = D ( N 1 i n N 1 ) φ 1 ( N 1 , N 3 ) B 1 Y 1 , B ˙ 2 = φ 2 ( N 2 , N 3 ) D B 2 , N ˙ 2 = D ( N 2 i n N 2 ) + h ( l r ) N 0 + φ 1 ( N 1 , N 3 ) B 1 Y 4 φ 2 ( N 2 , N 3 ) B 2 Y 2 , B ˙ 3 = φ 3 ( N 3 ) D B 3 , N ˙ 3 = D ( N 3 i n N 3 ) φ 1 ( N 1 , N 3 ) B 1 Y 5 φ 3 ( N 3 ) B 3 Y 3 .
with initial value N 0 ( 0 ) , N 1 ( 0 ) , N 2 ( 0 ) , N 3 ( 0 ) , B 1 ( 0 ) , B 2 ( 0 ) , B 3 ( 0 ) R + 7 and yield parameters Y i , i = 1 , , 5 .
The three-tiered microbial food chain described by this suggested seven-dimensional dynamical model ignores maintenance in relation to the dilution rate. A complete stability study was undertaken both locally and globally in earlier investigations of two-tier ecological models [4,14,15].
To scale the system (2), the following adjustments to the parameters and variables are taken into account: n 0 = Y 4 Y 1 N 0 , n 1 = N 1 , n 2 = Y 4 Y 1 N 2 , n 3 = Y 5 Y 1 N 3 , b 1 = B 1 Y 1 , b 2 = Y 4 Y 1 Y 2 B 2 , b 3 = Y 5 Y 1 Y 3 B 3 , n 0 i n = Y 4 Y 1 N 0 i n , n 1 i n = N 1 i n , n 2 i n = Y 4 Y 1 N 2 i n , n 3 i n = Y 5 Y 1 N 3 i n . The dimensionless equations thus obtained are as follows:
n ˙ 0 = D ( n 0 i n n 0 ) h ( l r ) n 0 , b ˙ 1 = υ 1 ( n 1 , n 3 ) D b 1 , n ˙ 1 = D ( n 1 i n n 1 ) υ 1 ( n 1 , n 3 ) b 1 , b ˙ 2 = υ 2 ( n 2 , n 3 ) D b 2 , n ˙ 2 = D ( n 2 i n n 2 ) + h ( l r ) n 0 + υ 1 ( n 1 , n 3 ) b 1 υ 2 ( n 2 , n 3 ) b 2 , b ˙ 3 = υ 3 ( n 3 ) D b 3 , n ˙ 3 = D ( n 3 i n n 3 ) υ 1 ( n 1 , n 3 ) b 1 υ 3 ( n 3 ) b 3 .
Here, functions υ 1 , υ 2 : R + 2 R + and υ 3 , h : R + R + are given by
υ 1 ( n 1 , n 3 ) = φ 1 n 1 , Y 1 Y 5 n 3 , υ 2 ( n 2 , n 3 ) = φ 2 Y 1 Y 4 n 2 , Y 1 Y 5 n 3 ,   and υ 3 ( n 3 ) = φ 3 Y 1 Y 5 n 3 .
Assume that the functional response of each species υ 1 , υ 2 : R + 2 R + and υ 3 , h : R + R + satisfies:
Assumption 1. 
H1: 
υ 1 , υ 2 : R + 2 R + and υ 3 , h : R + R + are of class C 1 ,
H2: 
υ 1 ( n 1 , 0 ) = υ 1 ( 0 , n 3 ) = υ 2 ( 0 , n 3 ) = υ 3 ( 0 ) = h ( 0 ) = 0 , n 1 , n 3 R + ,
H3: 
υ 1 n 1 ( n 1 , n 3 ) > 0 , υ 1 n 3 ( n 1 , n 3 ) > 0 , n 1 , n 3 R + ,
H4: 
υ 2 n 2 ( n 2 , n 3 ) > 0 , υ 2 n 3 ( n 2 , n 3 ) < 0 , n 2 , n 3 R + .
H5: 
υ 3 and h are increasing functions.
Assumption H2 means that species B 1 cannot grow without substrates N 1 and N 3 and that the substrate N 2 is obligate for the growth of the biomass B 2 and that the nutriment N 3 is obligate for the growth of species B 3 . Hypothesis H3 expresses that the growth of species B 1 increases with the substrate N 1 and the substrate N 3 . Hypothesis H4 expresses that the species B 2 growth increases with the intermediate product N 2 produced by species B 1 . In contrast, the substrate N 3 inhibits B 2 . The growth of species B 3 rises with the substrate N 3 , according to hypothesis H5.

3. Preliminary Results

The steady states of the system (2), an appealing set, and some technical results will be presented in this section. These results will be used hereafter.
Lemma 1. 
n 0 * = D n 0 i n D + h ( l r ) ( 0 , n 0 i n ) is the unique solution of
h ( l r ) n 0 = D ( n 0 i n n 0 ) .
Lemma 2. 
If the function υ 1 : R + R + satisfies Hypotheses H1, H2 and H3 and D < D 1 = υ 1 ( n 1 i n , n 3 i n ) , then there exists a unique b ¯ 1 ( 0 , min ( n 1 i n , n 3 i n ) ) satisfying
υ 1 ( n 1 i n b ¯ 1 , n 3 i n b ¯ 1 ) = D .
Proof. 
Let ψ 1 ( b ) = υ 1 ( n 1 i n b , n 3 i n b ) D . It is easy to see that ψ 1 is a decreasing continuous function with ψ 1 ( 0 ) = D 1 D > 0 and ψ 1 ( n 1 i n ) = ψ 1 ( n 3 i n ) = D < 0 . Therefore, there exists a unique b ¯ 1 ( 0 , min ( n 1 i n , n 3 i n ) ) satisfying (4).    □
Lemma 3. 
If the function υ 2 : R + R + satisfies Hypotheses H1, H2 and H4 and D < D 2 = υ 2 ( n 0 i n + n 2 i n n 0 * , n 3 i n ) ; then, there exists a unique b ¯ 2 ( 0 , n 0 i n + n 2 i n n 0 * ) satisfying
υ 2 ( n 0 i n + n 2 i n n 0 * b ¯ 2 , n 3 i n ) = D .
Proof. 
Let ψ 2 ( b ) = υ 2 ( n 0 i n + n 2 i n n 0 * b , n 3 i n ) D . It is easy to see that ψ 2 is a decreasing continuous function with ψ 2 ( 0 ) = D 2 D > 0 and ψ 2 ( n 0 i n + n 2 i n n 0 * ) = D < 0 . Therefore, there exists a unique b ¯ 2 ( 0 , n 0 i n + n 2 i n n 0 * ) satisfying (5).    □
Lemma 4. 
If the function υ 3 : R + R + satisfies Hypotheses H1, H2 and H5 and D < D 3 = υ 3 ( n 3 i n ) , then there exists a unique n 3 * ( 0 , n 3 i n ) satisfying
υ 3 ( n 3 * ) = D .
Proof. 
It is evident since υ 3 ( 0 ) = 0 , D < D 3 = υ 3 ( n 3 i n ) and υ 3 is a continuous increasing function.    □
Lemma 5. 
If the function υ 1 : R + R + satisfies Hypotheses H1, H2 and H3 and D < D 4 = υ 1 ( n 1 i n , n 3 * ) , then there exists a unique b 1 * ( 0 , n 1 i n ) satisfying
υ 1 ( n 1 i n b 1 * , n 3 * ) = D .
Proof. 
Let ψ 3 ( b ) = υ 1 ( n 1 i n b 1 , n 3 * ) D . It is easy to see that ψ 3 is a decreasing continuous function with ψ 3 ( 0 ) = D 4 D > 0 and ψ 3 ( n 1 i n ) = D < 0 . Therefore, there exists a unique b 1 * ( 0 , n 1 i n ) satisfying (7).    □
Lemma 6. 
If the function υ 2 : R + R + satisfies Hypotheses H1, H2 and H4 and D < D 5 = υ 2 ( n 0 i n + n 2 i n n 0 * , n 3 * ) , then there exists a unique b ¯ ¯ 2 ( 0 , n 0 i n + n 2 i n n 0 * ) satisfying
υ 2 ( n 0 i n + n 2 i n n 0 * b ¯ ¯ 2 , n 3 * ) = D .
Proof. 
Let ψ 4 ( b ) = υ 2 ( n 0 i n + n 2 i n n 0 * b , n 3 * ) D . It is easy to see that ψ 4 is a decreasing continuous function with ψ 4 ( 0 ) = D 5 D > 0 and ψ 4 ( n 0 i n + n 2 i n n 0 * ) = D < 0 . Therefore, there exists a unique b ¯ ¯ 2 ( 0 , n 0 i n + n 2 i n n 0 * ) satisfying (8).    □
Lemma 7. 
If the function υ 2 : R + R + satisfies Hypotheses H1, H2 and H4 and D < D 6 = υ 2 ( n 0 i n + n 2 i n n 0 * + b 1 * , n 3 * ) , then there exists a unique b 2 * ( 0 , n 0 i n + n 2 i n n 0 * + b 1 * ) satisfying
υ 2 ( n 0 i n + n 2 i n n 0 * + b 1 * b 2 * , n 3 * ) = D .
Proof. 
Let ψ 5 ( b ) = υ 2 ( n 0 i n + n 2 i n n 0 * + b 1 * b , n 3 * ) D . It is easy to see that ψ 5 is a decreasing continuous function with ψ 5 ( 0 ) = D 6 D > 0 and ψ 5 ( n 0 i n + n 2 i n n 0 * + b 1 * ) = D < 0 . Therefore, there exists a unique b 2 * ( 0 , n 0 i n + n 2 i n n 0 * + b 1 * ) satisfying (9).    □
Lemma 8. 
If the function υ 2 : R + R + satisfies Hypotheses H1, H2  and H4 and D < D 7 = υ 2 ( n 0 i n + n 2 i n n 0 * + b ¯ 1 , n 3 * b ¯ 1 ) , then there exists a unique b ¯ ¯ ¯ 2 ( 0 , n 0 i n + n 2 i n n 0 * + b ¯ 1 ) satisfying
υ 2 ( n 0 i n + n 2 i n n 0 * + b ¯ 1 b ¯ ¯ ¯ 2 , n 3 i n b ¯ 1 ) = D .
Proof. 
Let ψ 6 ( b ) = υ 2 ( n 0 i n + n 2 i n n 0 * + b ¯ 1 b , n 3 i n b ¯ 1 ) D . It is easy to see that ψ 6 is a decreasing continuous function with ψ 6 ( 0 ) = D 7 D > 0 and ψ 6 ( n 0 i n + n 2 i n n 0 * + b ¯ 1 ) = D < 0 . Therefore, there exists a unique b ¯ ¯ ¯ 2 ( 0 , n 0 i n + n 2 i n n 0 * + b ¯ 1 ) satisfying (10).    □
Remark 1. 
Let D 8 = υ 3 ( n 3 i n b ¯ 1 ) . By Hypotheses H1H5, one can easily verify that:
D 2 < D 5 < D 6 , D 2 < D 7 , D 4 < D 1 , D 8 < D 3 .
We recall some basic features of the system (2) described on the non-negative cone (see, for example, [16]).
Proposition 1. 
1. 
System (2) admits a unique solution that is positive and bounded for all t 0 given initial conditions in R + 7 .
2. 
An invariant attractor set of every trajectory provided by Ω = { ( n 0 , b 1 , n 1 , b 2 , n 2 , b 3 , n 3 ) R + 7 / n 1 + b 1 = n 1 i n , b 1 + n 3 + b 3 = n 3 i n , n 0 + n 2 + b 2 + n 3 + b 3 = n 0 i n + n 2 i n + n 3 i n } is admitted by the system (2).
Proof. 
1.
To prove that the system (2) admits a unique solution, we apply the Cauchy–Lipschitz (Picard–Lindelöf) Theorem [17], which guarantees the existence and uniqueness of solutions to ordinary differential equations (ODEs) under Lipschitz continuity conditions. Let X = ( n 0 , b 1 , n 1 , b 2 , n 2 , b 3 , n 3 ) and express the system as:
X ˙ = F ( X ) ,
where F ( X ) is the vector field defined by the right-hand side of (2). By Assumption H1, the functions υ 1 , υ 2 , υ 3 , and h are C 1 . Since F ( X ) consists of sums, products, and compositions of C 1 functions, it follows that F ( X ) is also C 1 . A C 1 function on an open domain is locally Lipschitz continuous (by the mean value theorem). Because R + 7 is open, F ( X ) is locally Lipschitz in X . The fact that demonstrates the solution’s positive is:
If n i = 0 then n ˙ i = D n i i n > 0 for i = 0 , 1 , 3 and if b i = 0 then b ˙ i = 0 for i = 1 , 2 , 3 .
Now, if n 2 = 0 then n ˙ 2 = D n 2 i n + υ 1 ( n 1 , n 3 ) b 1 > 0 .
The next step is to demonstrate that the trajectories of (2) are bounded. Combining the system’s second and third equations yields, for ω 1 = n 1 + b 1 n 1 i n , to a single equation:
ω ˙ 1 = D ω 1
then
n 1 ( t ) + b 1 ( t ) = n 1 i n + n 1 ( 0 ) + b 1 ( 0 ) n 1 i n e D t
Similarly, combining the system’s second and two last equations yields, for ω 2 = b 1 + n 3 + b 3 n 3 i n , to a single equation:
ω ˙ 2 = D ω 2
then
b 1 ( t ) + n 3 ( t ) + b 3 ( t ) = n 3 i n + b 1 ( 0 ) + n 3 ( 0 ) + b 3 ( 0 ) n 3 i n e D t
Finally, combining the system’s first and the last four equations yields, for ω 3 = n 0 + n 2 + n 3 + b 2 + b 3 n 0 i n n 2 i n n 3 i n , to a single equation:
ω ˙ 3 = D ω 3
then
n 0 ( t ) + n 2 ( t ) + b 2 ( t ) + n 3 ( t ) + b 3 ( t ) = n 0 i n + n 2 i n + n 3 i n + ω 3 ( 0 ) e D t
where ω 3 ( 0 ) = n 0 ( 0 ) + n 2 ( 0 ) + n 3 ( 0 ) + b 2 ( 0 ) + b 3 ( 0 ) n 0 i n n 2 i n n 3 i n . The trajectory is bounded since every term in the three sums is positive. Thus, solutions remain bounded, and no finite-time blow-up occurs. By the Cauchy–Lipschitz Theorem, system (2) has a unique solution for all t 0 given initial conditions in R + 7 .
2.
The second point is simply a direct consequence of equalities (11)-(12)-(13).
   □

4. Reduction to a Third Dimensional Dynamics

Lemma 9. 
Consider a solution ( n 0 , b 1 , n 1 , b 2 , n 2 , b 3 , n 3 ) of dynamics (2). Let ω 0 = n 0 n 0 * . Therefore, n 0 = n 0 * + ω 0 , n 1 = n 1 i n b 1 + ω 1 , n 3 = n 3 i n b 1 b 3 + ω 2 and n 2 = n 0 i n + n 2 i n + n 3 i n n 0 b 2 n 3 b 3 + ω 3 = n 0 i n + n 2 i n + b 1 n 0 * b 2 ω 0 ω 2 + ω 3 . Then, the dynamics (2) is equivalent to the following sub-systems:
ω ˙ 0 = ( D + h ( l r ) ) ω 0 , ω ˙ 1 = D ω 1 , ω ˙ 2 = D ω 2 , ω ˙ 3 = D ω 3 ,
 and
b ˙ 1 = ( υ 1 ( n 1 i n b 1 + ω 1 , n 3 i n b 1 b 3 + ω 3 ) D ) b 1 , b ˙ 2 = ( υ 2 ( n 0 i n + n 2 i n + b 1 n 0 * b 2 ω 0 ω 2 + ω 3 , n 3 i n b 1 b 3 + ω 3 ) D ) b 2 , b ˙ 3 = ( υ 3 ( n 3 i n b 1 b 3 + ω 3 ) D ) b 3 .
Proof. 
The prove of Lemma 9 is evident and it is omitted.    □
Our goal is to investigate the asymptotic behavior of the seven-dimensional dynamics (14)–(15) trajectories, which converge exponentially inside the set Ω . The goal is to limit the analysis of the system (14)–(15)’s asymptotic behavior to the attractive set Ω . As a result, the reduced system’s asymptotic behavior will provide information about the full system (14)–(15). Keep in mind that periodic orbits are not disregarded in our situation.
The following reduced system provides the projection of the limitation of system (14)–(15) on Ω in the space ( b 1 , b 2 , b 3 ) .
b ˙ 1 = ( υ 1 ( n 1 i n b 1 , n 3 i n b 1 b 3 ) D ) b 1 , b ˙ 2 = ( υ 2 ( n 0 i n + n 2 i n + b 1 n 0 * b 2 , n 3 i n b 1 b 3 ) D ) b 2 , b ˙ 3 = ( υ 3 ( n 3 i n b 1 b 3 ) D ) b 3 .
Since we proved previously that n 1 , n 2 , n 3 , b 1 , b 2 , b 3 0 , then the projection of the system (14)-(15) on Ω in the space ( b 1 , b 2 , b 3 ) leads to n 1 = n 1 i n b 1 0 , n 2 = n 0 i n + n 2 i n + b 1 n 0 * b 2 0 and n 3 = n 3 i n b 1 b 3 0 . Thus, for (16) the solution ( b 1 , b 2 , b 3 ) lies in the set S given by:
S = ( b 1 , b 2 , b 3 ) R + 3 : 0 b 1 n 1 i n , 0 n 0 * + b 2 b 1 + n 0 i n + n 2 i n , 0 b 1 + b 3 n 3 i n .
Observe that the system (16) is obtained by coupling the systems (14)–(15) with ω 0 = 0 , ω 1 = 0 , ω 2 = 0 , and ω 3 = 0 .

4.1. Local Analysis

4.1.1. Steady States

The dynamics (16) admits the following possible eight steady states.
  • Trivial steady state F 0 = ( 0 , 0 , 0 ) .
  • Boundary steady states: F 1 = ( b ¯ 1 , 0 , 0 ) , F 2 = ( 0 , b ¯ 2 , 0 ) , F 3 = ( 0 , 0 , n 3 i n n 3 * ) , F 13 = ( b 1 * , 0 , n 3 i n n 3 * b 1 * ) , F 23 = ( 0 , b ¯ ¯ 2 , n 3 i n n 3 * ) and F 12 = ( b ¯ 1 , b ¯ ¯ ¯ 2 , 0 ) .
  • Positive steady state F * = ( b 1 * , b 2 * , n 3 i n n 3 * b 1 * ) = ( b 1 * , b 2 * , b 3 * ) .

4.1.2. Existence and Uniqueness

The existence and uniqueness conditions for each of the equilibrium points F 0 , F 1 , F 2 , F 3 , F 12 , F 13 , F 23 and F * , are given in the following theorem according to Lemmas 1–7.
Theorem 1. 
  • The existence and uniqueness of the steady state F 0 = ( 0 , 0 , 0 ) is always satisfied.
  • The existence and uniqueness of the steady state F 1 is satisfied if and only if D < D 1 .
  • The existence and uniqueness of the steady state F 2 is satisfied if and only if D < D 2
  • The existence and uniqueness of the steady state F 3 is satisfied if and only if D < D 3 .
  • The existence and uniqueness of the steady state F 13 is satisfied if and only if D < min ( D 3 , D 4 ) .
  • The existence and uniqueness of the steady state F 23 is satisfied if and only if D < min ( D 3 , D 5 ) .
  • The existence and uniqueness of the steady state F 12 is satisfied if and only if D < min ( D 1 , D 7 ) .
  • The existence and uniqueness of the steady state F * is satisfied if and only if D < min ( D 3 , D 4 , D 6 ) .
Proof. 
  • F 0 = ( 0 , 0 , 0 ) exists always.
  • The mapping b 1 υ 1 ( n 3 i n b 1 , n 1 i n b 1 ) is decreasing. Therefore, the existence and uniqueness of b ¯ 1 such that υ 1 ( n 3 i n b ¯ 1 , n 1 i n b ¯ 1 ) = D if and only if D < D 1 = υ 1 ( n 3 i n , n 1 i n ) according to Lemma 2. Therefore, the existence and uniqueness of F 1 if and only if D < D 1 .
  • The mapping b 2 υ 2 ( n 0 i n + n 2 i n n 0 * b 2 , n 3 i n ) is decreasing. Therefore, the existence and uniqueness of b ¯ 2 such that υ 2 ( n 0 i n + n 2 i n n 0 * b ¯ 2 , n 3 i n ) = D if and only if D < D 2 = υ 2 ( n 0 i n + n 2 i n n 0 * , n 3 i n ) according to Lemma 3. Therefore, the existence and uniqueness of F 2 if and only if D < D 2
  • The mapping n 3 υ 3 ( n 3 ) is increasing. Therefore, the existence and uniqueness of n 3 * such that υ 3 ( n 3 * ) = D if and only if D < D 3 = υ 3 ( n 3 i n ) according to Lemma 4. Therefore, the existence and uniqueness of F 3 if and only if D < D 3 .
  • n 3 * exists if and only if D < D 3 . The mapping b 1 υ 1 ( n 1 i n b 1 , n 3 * ) is decreasing. Therefore, the existence and uniqueness of b 1 * such that υ 1 ( n 1 i n b 1 * , n 3 * ) = D if and only if D < D 4 = υ 1 ( n 1 i n , n 3 * ) according to Lemma 5. Therefore, the existence and uniqueness of F 13 if and only if D < min ( D 3 , D 4 ) .
  • Similarly, the mapping b 2 υ 2 ( n 0 i n + n 2 i n n 0 * b 2 , n 3 * ) is decreasing. Therefore, the existence and uniqueness of b ¯ ¯ 2 such that υ 2 ( n 0 i n + n 2 i n n 0 * b ¯ ¯ 2 , n 3 * ) = D if and only if D < D 5 = υ 2 ( n 0 i n + n 2 i n n 0 * , n 3 * ) according to Lemma 6. Therefore, the existence and uniqueness of F 23 if and only if D < min ( D 3 , D 5 ) .
  • b ¯ 1 exists and is unique if and only if D < D 1 according to Lemma 2. For D < D 1 , the mapping b 2 υ 2 ( n 0 i n + n 2 i n n 0 * + b ¯ 1 b 2 , n 3 i n b ¯ 1 ) is decreasing. Therefore, the existence and uniqueness of b ¯ ¯ ¯ 2 such that υ 2 ( n 0 i n + n 2 i n n 0 * + b ¯ 1 b ¯ ¯ ¯ 2 , n 3 i n b ¯ 1 ) = D if and only if D < D 7 = υ 2 ( n 0 i n + n 2 i n n 0 * + b ¯ 1 , n 3 i n b ¯ 1 ) according to Lemma 8. Therefore, the existence and uniqueness of F 12 if and only if D < min ( D 1 , D 7 ) .
  • n 3 * = υ 3 1 ( D ) exists and is unique if and only if D < D 3 according to Lemma 4. b 1 * exists and is unique if and only if D < D 4 according to Lemma 5. For D < min ( D 3 , D 4 ) , the mapping b 2 υ 2 ( n 0 i n + n 2 i n n 0 * + b 1 * b 2 , n 3 * ) is decreasing. Therefore, the existence and uniqueness of b 2 * such that υ 2 ( n 0 i n + n 2 i n n 0 * + b 1 * b 2 * , n 3 * ) = D if and only if D < D 6 = υ 2 ( n 0 i n + n 2 i n n 0 * + b 1 * , n 3 * ) according to Lemma 7. Therefore, the existence and uniqueness of F * if and only if D < min ( D 3 , D 4 , D 6 ) .
   □

4.1.3. Local Stability

The Jacobian matrix J of (16), at a point ( b 1 , b 2 , b 3 ) , is given by:
J = υ 1 D υ 1 n 3 b 1 υ 1 n 1 b 1 0 υ 1 n 3 b 1 υ 2 n 3 b 2 + υ 2 n 2 b 2 υ 2 D υ 2 n 2 b 2 υ 2 n 3 b 2 υ 3 b 3 0 υ 3 D υ 3 b 3 .
where the function υ 1 is evaluated at n 3 i n b 1 b 3 , n 1 i n b 1 , υ 2 is evaluated at n 3 i n b 1 b 3 , n 0 i n + n 2 i n n 0 * + b 1 b 2 and υ 3 is evaluated at n 3 i n b 1 b 3 . In the following lemma, the nature of the equilibrium point F 0 is given.
Lemma 10. 
If D > max ( D 1 , D 2 , D 3 ) then F 0 is a stable node. If D < max ( D 1 , D 2 , D 3 ) then F 0 is an unstable node.
Proof. 
The Jacobian matrix at F 0 is given by:
J 0 = D 1 D 0 0 0 D 2 D 0 0 0 D 3 D
The eigenvalues are given by D 1 D , D 2 D and D 3 D . Thus, if D > max ( D 1 , D 2 , D 3 ) then F 0 is stable. If D < max ( D 1 , D 2 , D 3 ) , then F 0 is an unstable node.    □
The nature of the boundary steady states F 1 , F 2 , F 3 , F 12 , F 13 , and F 23 is provided in the following lemmas.
Lemma 11. 
F 1 is stable if D > max ( D 7 , D 8 ) . F 1 is an unstable node if D < max ( D 7 , D 8 ) .
Proof. 
The Jacobian matrix at F 1 is given by:
J 1 = υ 1 n 3 b ¯ 1 υ 1 n 1 b ¯ 1 0 υ 1 n 3 b ¯ 1 0 D 7 D 0 0 0 D 8 D .
where υ 1 is evaluated at ( n 3 i n b ¯ 1 , n 3 i n b ¯ 1 ) . The eigenvalues are given by
υ 1 n 3 b ¯ 1 υ 1 n 1 b ¯ 1 < 0 , D 7 D a n d D 8 D .
Thus, F 1 is stable if D > max ( D 7 , D 8 ) and it is unstable if D < max ( D 7 , D 8 ) .    □
Lemma 12. 
F 2 is stable if D > max ( D 1 , D 3 ) . It is unstable if D < max ( D 1 , D 3 ) .
Proof. 
The Jacobian matrix at F 2 is given by:
J 2 = D 1 D 0 0 υ 2 n 3 b ¯ 2 + υ 2 n 2 b ¯ 2 υ 2 n 2 b ¯ 2 υ 2 n 3 b ¯ 2 0 0 D 3 D .
where the function υ 2 is evaluated at ( n 3 i n , n 0 i n + n 2 i n n 0 * b ¯ 2 ) . The eigenvalues are
υ 2 n 2 b ¯ 2 < 0 , D 1 D , and   D 3 D .
Thus, F 2 is stable if D > max ( D 1 , D 3 ) . It is unstable if D < max ( D 1 , D 3 ) .    □
Lemma 13. 
F 3 is stable if D > max ( D 4 , D 5 ) . F 3 is unstable if D < max ( D 4 , D 5 ) .
Proof. 
The Jacobian matrix at F 3 is given by:
J 3 = D 4 D 0 0 0 D 5 D 0 υ 3 ( n 3 * ) ( n 3 i n n 3 * ) 0 υ 3 ( n 3 * ) ( n 3 i n n 3 * ) .
The eigenvalues are
υ 3 ( n 3 * ) ( n 3 i n n 3 * ) < 0 , D 4 D , and D 5 D .
Thus, F 3 is stable if D > max ( D 4 , D 5 ) . F 3 is unstable if D < max ( D 4 , D 5 ) .    □
Lemma 14. 
F 12 is stable if D > D 8 . F 12 is unstable if D < D 8 .
Proof. 
The Jacobian matrix at F 12 is given by:
J 12 = υ 1 n 3 b ¯ 1 υ 1 n 1 b ¯ 1 0 υ 1 n 3 b ¯ 1 ( υ 2 n 3 + υ 2 n 2 ) b ¯ ¯ ¯ 2 υ 2 n 2 b ¯ ¯ ¯ 2 υ 2 n 3 b ¯ ¯ ¯ 2 0 0 D 8 D .
where the function υ 1 is evaluated at ( n 3 i n b ¯ 1 , n 1 i n b ¯ 1 ) , υ 2 is evaluated at ( n 3 i n b ¯ 1 , n 0 i n + n 2 i n n 0 * + b ¯ 1 b ¯ ¯ ¯ 2 ) . Then, the eigenvalues are given by λ 1 = ( υ 1 n 3 b ¯ 1 + υ 1 n 1 b ¯ 1 ) < 0 , λ 2 = υ 2 n 2 b ¯ ¯ ¯ 2 < 0 and λ 3 = D 8 D . Thus, F 12 is stable if D > D 8 . F 12 is unstable if D < D 8    □
Lemma 15. 
The equilibrium point F 13 is stable if D > D 6 . F 13 is unstable if D < D 6 .
Proof. 
The Jacobian matrix at F 13 is:
J 13 = υ 1 n 3 b 1 * υ 1 n 1 b 1 * 0 υ 1 n 3 b 1 * 0 D 6 D 0 ( n 3 i n n 3 * b 1 * ) υ 3 ( n 3 * ) 0 ( n 3 i n n 3 * b 1 * ) υ 3 ( n 3 * ) .
where the function υ 1 is evaluated at ( n 3 * , n 1 i n b 1 * ) and υ 2 is evaluated at ( n 3 * , n 0 i n + n 2 i n n 0 * + b 1 * ) .
The characteristic polynomial is given by:
P 13 ( λ ) = ( D 6 D λ ) [ λ 2 + λ ( υ 1 n 3 b 1 * + υ 1 n 1 b 1 * + ( n 3 i n n 3 * b 1 * ) υ 3 ( n 3 * ) ) + υ 1 n 1 υ 3 ( n 3 * ) ( n 3 i n n 3 * b 1 * ) b 1 * ] .
The eigenvalues are then given by λ 1 = D 6 D as well as, according to Routh’s Stability Criterion, two additional negative eigenvalues. Therefore, the steady state F 13 is stable if D > D 6 ; however, it is unstable if D < D 6 .    □
Lemma 16. 
The steady state F 23 is stable if D > D 4 and it is unstable if D < D 4 .
Proof. 
The Jacobian at F 23 is:
J 23 = D 4 D 0 0 υ 2 n 3 b ¯ ¯ 2 + υ 2 n 3 b ¯ ¯ 2 υ 2 n 2 b ¯ ¯ 2 υ 2 n 3 b ¯ ¯ 2 ( n 3 i n n 3 * ) υ 3 ( n 3 * ) 0 ( n 3 i n n 3 * ) υ 3 ( n 3 * ) .
where the function υ 2 is evaluated at ( n 3 * , n 0 i n + n 2 i n n 0 * b ¯ ¯ 2 ) .
The eigenvalues are given by
D 4 D , υ 2 n 2 b ¯ ¯ 2 < 0 , and ( n 3 i n n 3 * ) υ 3 ( n 3 * ) < 0 .
Therefore, the steady state F 23 is stable if D > D 4 and it is unstable if D < D 4 .    □
Now, let us talk about the positive equilibria’s local stability.
Lemma 17. 
The positive steady state F * = ( b 1 * , b 2 * , b 3 * ) is always stable.
Proof. 
The Jacobian at F * is:
J * = υ 1 n 3 b 1 * υ 1 n 1 b 1 * 0 υ 1 n 3 b 1 * ( υ 2 n 3 + υ 2 n 2 ) b 2 * υ 2 n 2 b 2 * υ 2 n 3 b 2 * υ 3 ( n 3 * ) b 3 * 0 υ 3 ( n 3 * ) b 3 * .
where the function υ 1 is evaluated at ( n 3 * , n 1 i n b 1 * ) and υ 2 is evaluated at ( n 3 * , n 0 i n + n 2 i n n 0 * + b 1 * b 2 * ) .
The Jacobian J * admits an eigenvalue given by υ 2 n 2 b 2 * < 0 and two other eigenvalues of the sub-matrix
S * = υ 1 n 3 b 1 * υ 1 n 1 b 1 * υ 1 n 3 b 1 * υ 3 ( n 3 * ) b 3 * υ 3 ( n 3 * ) b 3 * .
It is clear that trace ( S * ) = υ 1 n 3 b 1 * υ 1 n 1 b 1 * υ 3 ( n 3 * ) b 3 * < 0 and det ( S * ) = υ 1 n 1 υ 3 ( n 3 * ) b 3 * b 1 * > 0 . Therefore, the positive steady state F * = ( b 1 * , b 2 * , b 3 * ) is always stable.    □
The Table 2 provides a summary of the condition of existence, uniqueness, and nature of the steady states.

4.2. Global Analysis

In the following, we solely take into account the interesting situation where
H6: 
D < min ( D 2 , D 4 , D 8 )
Hypothesis H6 guarantees that D < min ( D 1 , D 2 , D 3 , D 4 , D 5 , D 6 , D 7 , D 8 ) ; therefore, F * is the only stable steady state for the dynamics (16). F 0 , F 1 , F 2 , F 3 , F 12 , F 13 and F 23 are unstable steady states.
Remark 2. 
Consider the dynamics (16) solution that is a part of S . Let us examine how the variables σ i = ln ( b i ) , i = 1 , 2 , 3 change to transform the system (16). The new dynamics that follows is thus obtained:
σ ˙ 1 = ϕ 1 ( σ 1 , σ 2 , σ 3 ) : = υ 1 ( n 3 i n e σ 1 e σ 3 , n 1 i n e σ 1 ) D , σ ˙ 2 = ϕ 2 ( σ 1 , σ 2 , σ 3 ) : = υ 2 ( n 3 i n e σ 1 e σ 3 , n 0 i n + n 2 i n n 0 * + e σ 1 e σ 2 ) D , σ ˙ 3 = ϕ 3 ( σ 1 , σ 2 , σ 3 ) : = υ 3 ( n 3 i n e σ 1 e σ 3 ) D .
We have
ϕ 1 σ 1 + ϕ 2 σ 2 + ϕ 3 σ 3 = υ 1 n 3 e σ 1 + υ 1 n 1 e σ 1 + υ 2 n 2 e σ 2 + υ 3 e σ 3 < 0 .
The dynamics (17) has no invariant sets (including tori) with no-zero volume that are entirely in Ω, according to the Dulac criterion [16]. It must be a fractal set with zero volume if there is an odd attractor. Note that periodic orbits (of zeros volume) are not excluded.
  • ϕ 1 σ 1 + ϕ 2 σ 2 = υ 1 n 3 e σ 1 + υ 1 n 1 e σ 1 + υ 2 n 2 e σ 2 < 0 . According to the Dulac criterion [16], the dynamics (16) has no periodic solution inside the face b 1 b 2 ( b 3 = 0 ).
  • ϕ 1 σ 1 + ϕ 3 σ 3 = υ 1 n 3 e σ 1 + υ 1 n 1 e σ 1 + υ 3 e σ 3 < 0 . According to the Dulac criterion [16], the dynamics (16) has no periodic solution inside the face b 1 b 3 ( b 2 = 0 ).
  • ϕ 2 σ 2 + ϕ 3 σ 3 = υ 2 n 2 e σ 2 + υ 3 e σ 3 < 0 . According to the Dulac criterion [16], the dynamics (16) has no periodic solution inside the face b 2 b 3 ( b 1 = 0 ).
Lemma 18. 
(Butler–McGehee Lemma [16]) Consider h : R n R n to be a continuously differentiable function. Let θ * to be a hyperbolic equilibrium of the dynamics θ ˙ = h ( θ ) with θ ( 0 ) = θ 0 R n . Let γ + ( θ 0 ) to be the positive semi-orbit through θ 0 and ω ( θ 0 ) to be the omega limit set of γ + ( θ 0 ) . Assume that θ * is in ω ( θ 0 ) , but is not the entire omega limit set. Then, ω ( θ 0 ) admits a non-trivial intersection with both stable and unstable manifolds of θ * .
Theorem 2. 
For every initial conditions b 1 ( 0 ) > 0 , b 2 ( 0 ) > 0 , b 3 ( 0 ) > 0 in S , the three bacteria persist, i.e.,
lim t + b 1 ( t ) > 0 , lim t + b 2 ( t ) > 0 a n d lim t + b 3 ( t ) > 0 .
Proof. 
The goal of this proof is to demonstrate the three species’ cohabitation using the model’s uniform persistence (16). The system’s boundary equilibria (16) are all unstable in our scenario. Let b 1 ( 0 ) > 0 , b 2 ( 0 ) > 0 , b 3 ( 0 ) > 0 and ω the omega limit set of ( b 1 ( 0 ) , b 2 ( 0 ) , b 3 ( 0 ) ) , which is compact and invariant such that ω S ¯ . The stable and unstable manifolds of the border equilibria are known and displayed in Figure 3 to simplify the argument because the faces b 1 b 2 , b 1 p , and b 2 p are invariant. Assume that a point Z on the edge of the positive cone R + 3 is contained in ω and let γ ( Z ) be the positive semi-orbit through Z. Therefore,
  • Because F 0 is unstable F 0 could not be a part of the omega limit set of ( b 1 ( 0 ) , b 2 ( 0 ) , b 3 ( 0 ) ) , and thus Z cannot be F 0 .
  • If Z ] b ¯ 1 , n 1 i n ] × { 0 } × { 0 } (similarly, Z { 0 } × ] b ¯ 2 , n 0 i n + n 2 i n n 0 * ] × { 0 } or Z { 0 } × { 0 } × ] n 3 i n n 3 * , n 3 i n ] ). Since ω is invariant, thus γ ( Z ) will be a subset of ω and this is not possible because ω is bounded and γ ( Z ) = ] b ¯ 1 , + [ × { 0 } × { 0 } (similarly, γ ( Z ) = { 0 } × ] b ¯ 2 , + [ × { 0 } or γ ( Z ) = { 0 } × { 0 } × ] n 3 i n n 3 * , + [ ).
  • If Z ] 0 , b ¯ 1 [ × { 0 } × { 0 } (similarly, Z { 0 } × ] 0 , b ¯ 2 [ × { 0 } or Z { 0 } × { 0 } × ] 0 , n 3 i n n 3 * [ ). ω contains γ ( Z ) = ] 0 , b ¯ 1 [ × { 0 } × { 0 } (similarly, γ ( Z ) = { 0 } × ] 0 , b ¯ 2 [ × { 0 } or γ ( Z ) = { 0 } × { 0 } × ] 0 , n 3 i n n 3 * [ ). Since ω is a compact, then it includes [ 0 , b ¯ 1 ] × { 0 } × { 0 } (similarly, { 0 } × [ 0 , b ¯ 2 ] × { 0 } or { 0 } × { 0 } × [ 0 , n 3 i n n 3 * ] ). In particular, ω contains F 0 , which is not possible.
  • If Z = F 1 (similarly, Z = F 2 or Z = F 3 ). ω is not reduced to F 1 (similarly to F 2 or to F 3 ). According to the Theorem of Butler–McGehee, ω includes a point Q of ( 0 , + ) × { 0 } × { 0 } different than F 1 (similarly, of { 0 } × ( 0 , + ) × { 0 } different than F 2 or { 0 } × { 0 } × ( 0 , + ) different than F 3 ) and this is impossible.
  • If Z ] b ¯ 1 , n 1 i n ] × { 0 } × ] n 3 i n n 3 * , n 3 i n ] (similarly, Z { 0 } × ] b ¯ 2 , n 0 i n + n 2 i n n 0 * ] × ] n 3 i n n 3 * , n 3 i n ] or Z ] b ¯ 1 , n 1 i n ] × ] b ¯ 2 , n 0 i n + n 2 i n n 0 * ] × { 0 } ). Since ω is invariant then γ ( Z ) ω and this is not possible as ω is bounded and γ ( Z ) = ] b ¯ 1 , + [ × { 0 } × ] n 3 i n n 3 * , + [ (similarly, γ ( Z ) = { 0 } × ] b ¯ 2 , + [ × ] n 3 i n n 3 * , + [ or γ ( Z ) = ] b ¯ 1 , + [ × ] b ¯ 2 , + [ × { 0 } ).
  • If Z ] b ¯ 1 , n 1 i n ] × { 0 } × ] 0 , n 3 i n n 3 * [ (similarly, Z ] 0 , b ¯ 1 [ × { 0 } × ] n 3 i n n 3 * , n 3 i n ] or Z { 0 } × ] b ¯ 2 , n 0 i n + n 2 i n n 0 * ] × ] 0 , n 3 i n n 3 * [ or Z { 0 } × ] 0 , b ¯ 2 [ × ] n 3 i n n 3 * , n 3 i n ] or Z ] b ¯ 1 , n 1 i n ] × ] 0 , b ¯ 2 [ × { 0 } or Z ] 0 , b ¯ 1 [ × ] b ¯ 2 , n 0 i n + n 2 i n n 0 * ] × { 0 } ). Since ω is invariant then γ ( Z ) ω and this is not possible as ω is bounded and γ ( Z ) = ] b ¯ 1 , + [ × { 0 } × ] 0 , n 3 i n n 3 * [ (similarly, γ ( Z ) = ] 0 , b ¯ 1 [ × { 0 } × ] n 3 i n n 3 * , + [ or γ ( Z ) = { 0 } × ] b ¯ 2 , + [ × ] 0 , n 3 i n n 3 * [ or γ ( Z ) = { 0 } × ] 0 , b ¯ 2 [ × ] n 3 i n n 3 * , + [ or γ ( Z ) = ] b ¯ 1 , + [ × ] 0 , b ¯ 2 [ × { 0 } or γ ( Z ) = ] 0 , b ¯ 1 [ × ] b ¯ 2 , + [ × { 0 } ).
  • If Z ] 0 , b ¯ 1 [ × { 0 } × ] 0 , n 3 i n n 3 * [ (similarly, Z { 0 } × ] 0 , b ¯ 2 [ × ] 0 , n 3 i n n 3 * [ or Z ] 0 , b ¯ 1 [ × ] 0 , b ¯ 2 [ × { 0 } ). ω contains γ ( Z ) = ] 0 , b ¯ 1 [ × { 0 } × ] 0 , n 3 i n n 3 * [ (similarly, γ ( Z ) = { 0 } × ] 0 , b ¯ 2 [ × ] 0 , n 3 i n n 3 * [ or γ ( Z ) = ] 0 , b ¯ 1 [ × ] 0 , b ¯ 2 [ × { 0 } ). As ω is a compact, then it contains the adherence of γ ( Z ) , [ 0 , b ¯ 1 ] × { 0 } × [ 0 , n 3 i n n 3 * ] (similarly, { 0 } × [ 0 , b ¯ 2 ] × [ 0 , n 3 i n n 3 * ] or [ 0 , b ¯ 1 ] × [ 0 , b ¯ 2 ] × { 0 } ). In particular, ω contains F 0 and this is impossible.
  • If Z = F 13 (similarly, Z = F 23 or Z = F 12 ). ω is not reduced to F 13 (similarly to F 23 or to F 12 ). According to the Theorem of Butler–McGehee, ω includes a point Q of ( 0 , + ) × { 0 } × ( 0 , + ) other that F 13 (similarly, of { 0 } × ( 0 , + ) × ( 0 , + ) other that F 23 or ( 0 , + ) × ( 0 , + ) × { 0 } other that F 12 ) and this is impossible.
The omega limit set cannot contain any points on the positive cone R + 3 ’s border. The ”positive” periodic orbit of system (16) may exist inside S . The solution of the system (16) converges asymptotically to either the unique stable node F * or to a “positive” periodic orbit (if one exists) according to the Poincaré–Bendixon Theorem [16]. Therefore,
lim t + b 1 ( t ) > 0 , lim t + b 2 ( t ) > 0 and lim t + b 3 ( t ) > 0 .
   □

5. Back to R + 7

Theorem 3. 
Assume that the dynamics (2) satisfies Assumptions H1 to H6 such that n 0 ( 0 ) > 0 , n 1 ( 0 ) > 0 , n 2 ( 0 ) > 0 , n 3 ( 0 ) > 0 , b 1 ( 0 ) > 0 , b 2 ( 0 ) > 0 , b 3 ( 0 ) > 0 in R + 6 , then the three bacteria persist which means that lim t + b 1 ( t ) > 0 , lim t + b 2 ( t ) > 0 and lim t + b 3 ( t ) > 0 .
Proof. 
Let ( n 0 ( t ) , n 1 ( t ) , b 1 ( t ) , n 2 ( t ) , b 2 ( t ) , n 3 ( t ) , b 3 ( t ) ) be a solution of (2). From (11), (12) and (13) we deduce that n 1 ( t ) = n 1 i n b 1 ( t ) + β 1 e D t , n 3 ( t ) = n 3 i n b 1 ( t ) b 3 ( t ) + β 2 e D t , n 2 ( t ) = n 0 i n + n 2 i n n 0 ( t ) + b 1 ( t ) b 2 ( t ) β 2 e D t + β 3 e D t where β 1 = n 1 ( 0 ) + b 1 ( 0 ) n 1 i n , β 2 = b 1 ( 0 ) + n 3 ( 0 ) + b 3 ( 0 ) n 3 i n and β 3 = n 0 ( 0 ) + n 2 ( 0 ) + n 3 ( 0 ) + b 2 ( 0 ) + b 3 ( 0 ) n 0 i n n 2 i n n 3 i n .
Hence, ( b 1 ( t ) , b 2 ( t ) , b 3 ( t ) ) is a solution of the non-autonomous dynamics given hereafter:
b ˙ 1 = υ 1 ( n 1 i n b 1 + β 1 e D t , n 3 i n b 1 b 3 + β 2 e D t ) D b 1 , b ˙ 2 = υ 2 ( n 0 i n + n 2 i n n 0 + b 1 b 2 + β 3 e D t , n 3 i n b 1 b 3 + β 2 e D t ) D b 2 , b ˙ 3 = υ 3 ( n 3 i n b 1 b 3 + β 2 e D t ) D b 3 .
Asymptotically, the dynamics (18) converges to the autonomous dynamics (16). The phase portrait of the reduced (to Ω ) dynamics (16) shows just one locally stable node, and the other are unstable steady states, and a potential ”positive” periodic trajectory. Furthermore, Ω is an attractor of all solutions in R + 6 . According to Thiemes’s findings [18], it can be concluded that the asymptotic behavior of the trajectory of the dynamics (18) is identical to that of the reduced dynamics (16). After that, the outcome is inferred.    □
We make the assumption for the remainder of the study that h ( l r ) = h ¯ l r with h ¯ > 0 is a constant.

6. Optimal Strategy

Leachate recirculation in a chemostat can be optimally controlled by dynamically modifying the recirculation rate to optimize bioreactor performance (e.g., waste degradation, biogas production) while reducing environmental impacts and operating costs. An organized method for defining and resolving this issue is provided below. Suppose that the leachate is continually fed to the chemostat at a rate l r that differs from the D dilution rate. The primary objective of the optimal strategy is to apply the initial control action and solve a finite-time optimal control problem at each stage in order to minimize the organic matter ( n 0 ( t ) , n 2 ( t ) ) inside the reactor through a minimal rate of leachate recirculation. The rate l r ( t ) (recirculation costs) will, therefore, be assumed to be variable on the interval [ 0 , T ] , with T > 0 . Suppose that υ 1 , υ 2 , and υ 3 are globally Lipschitz functions with Lipschitz parameters, L 1 , L 2 , and L 3 , respectively, and maximums υ 1 u = sup n 1 , n 3 > 0 υ 1 ( n 1 , n 3 ) , υ 2 u = sup n 2 , n 3 > 0 υ 2 ( n 2 , n 3 ) and υ 3 u = sup n 3 > 0 υ 3 ( n 3 ) . Thus, we aim to find the optimal control function l r = l r ( t ) in the admissible set
P ad = { l r ( t ) : 0 l r min l r ( t ) l r max , 0 t T , l r ( t ) is Lebesgue measurable } .
that minimizes the following functional
J ( l r ) = κ 1 2 0 T n 0 2 ( t ) d t + κ 2 2 0 T n 2 2 ( t ) d t + κ 3 2 0 T l r 2 ( t ) d t .
For suitable constants κ 1 > 0 , κ 2 > 0 and κ 3 > 0 , our goal is to keep the control costs as low as possible while minimizing the amount of organic matter in its two forms. The existence of the optimal control and the associated state can be readily demonstrated by applying the theory in [19].
For φ = n 0 , b 1 , n 1 , b 2 , n 2 , b 3 , n 3 t , the following is one way to write the dynamics (2):
φ ˙ = B φ + H 1 ( φ ) = H 2 ( φ )
with
B = D h ¯ l r 0 0 0 0 0 0 0 D 0 0 0 0 0 0 0 D 0 0 0 0 0 0 0 D 0 0 0 h ¯ l r 0 0 0 D 0 0 0 0 0 0 0 D 0 0 0 0 0 0 0 D
and
H 1 ( φ ) = D n 0 i n υ 1 ( n 1 , n 3 ) b 1 D n 1 i n υ 1 ( n 1 , n 3 ) b 1 υ 2 ( n 2 , n 3 ) b 2 D n 2 i n + υ 1 ( n 1 , n 3 ) b 1 υ 2 ( n 2 , n 3 ) b 2 υ 3 ( n 3 ) b 3 D n 3 i n υ 1 ( n 1 , n 3 ) b 1 υ 3 ( n 3 ) b 3 .
Theorem 4. 
H 2 is uniformly Lipschitz.
Proof. 
It is evident that H 1 , the continuous function, is uniformly Lipschitz since we have
H 1 ( φ ) H 1 ( φ ) 1 4 | υ 1 ( n 1 , n 3 ) b 1 υ 1 ( n 1 , n 3 ) b 1 | + 2 | υ 2 ( n 2 , n 3 ) b 2 υ 2 ( n 2 , n 3 ) b 2 | + 2 | υ 3 ( n 3 ) b 3 υ 3 ( n 3 ) b 3 | 4 | υ 1 ( n 1 , n 3 ) b 1 υ 1 ( n 1 , n 3 ) b 1 | + 4 | υ 1 ( n 1 , n 3 ) b 1 υ 1 ( n 1 , n 3 ) b 1 | + 2 | υ 2 ( n 2 , n 3 ) b 2 υ 2 ( n 2 , n 3 ) b 2 | + 2 | υ 2 ( n 2 , n 3 ) b 2 υ 2 ( n 2 , n 3 ) b 2 | + 2 | υ 3 ( n 3 ) b 3 υ 3 ( n 3 ) b 3 | + 2 | υ 3 ( n 3 ) b 3 υ 3 ( n 3 ) b 3 | 4 L 1 n 1 i n | ( n 1 , n 3 ) ( n 1 , n 3 ) | + 4 υ 1 u | b 1 b 1 | + 2 L 2 ( n 0 i n + n 2 i n + n 3 i n ) | ( n 2 , n 2 ) ( n 2 , n 3 ) | + 2 υ 2 u | b 2 b 2 | + 2 L 3 n 3 i n | n 3 n 3 | + 2 υ 3 u | b 3 b 3 | L | | φ 1 φ 2 | | 1
where L = max ( 4 υ 1 u , 2 υ 2 u , 2 υ 3 u , 4 L 1 n 1 i n , 2 L 2 ( n 0 i n + n 2 i n + n 3 i n ) , 2 L 3 n 3 i n ) . The matrix B satisfies B φ 1 B φ 2 1 ( D + h ( l r ) ) φ 1 φ 2 1 , ; thus, H 2 ( φ 1 ) H 2 ( φ 2 ) 1 δ φ 1 φ 2 1 with δ = max ( L , D + h ¯ l r ) and thus, the continuous function, H 2 is uniformly Lipschitz.    □
Therefore, there is only one solution to the dynamics (19). The control problem can be examined through the Hamiltonian function in the following way by applying Pontryagin’s Maximum principle [19,20,21]:
H = κ 1 2 n 0 2 + κ 2 2 n 2 2 + κ 3 2 l r 2 + λ 1 n ˙ 0 + λ 2 b ˙ 1 + λ 3 n ˙ 1 + λ 4 b ˙ 2 + λ 5 n ˙ 2 + λ 6 b ˙ 3 + λ 7 n ˙ 3 = κ 1 2 n 0 2 + κ 2 2 n 2 2 + κ 3 2 l r 2 + λ 1 D ( n 0 i n n 0 ) h ¯ l r n 0 + λ 2 υ 1 ( n 1 , n 3 ) D b 1 + λ 3 D ( n 1 i n n 1 ) υ 1 ( n 1 , n 3 ) b 1 + λ 4 υ 2 ( n 2 , n 3 ) D b 2 + λ 5 D ( n 2 i n n 2 ) + h ¯ l r n 0 + υ 1 ( n 1 , n 3 ) b 1 υ 2 ( n 2 , n 3 ) b 2 + λ 6 υ 3 ( n 3 ) D b 3 + λ 7 D ( n 3 i n n 3 ) υ 1 ( n 1 , n 3 ) b 1 υ 3 ( n 3 ) b 3 .
The adjoint unknowns λ 1 , λ 2 , λ 3 , λ 4 , λ 5 , λ 6 , and λ 4 are solutions of the following adjoint system
λ ˙ 1 = H n 0 = κ 1 n 0 + λ 1 ( D + h ¯ l r ) λ 5 h ¯ l r λ ˙ 2 = H b 1 = λ 2 υ 1 ( n 1 , n 3 ) D + λ 3 υ 1 ( n 1 , n 3 ) λ 5 υ 1 ( n 1 , n 3 ) + λ 7 υ 1 ( n 1 , n 3 ) λ ˙ 3 = H n 1 = λ 2 υ 1 n 1 ( n 1 , n 3 ) b 1 + λ 3 D + υ 1 n 1 ( n 1 , n 3 ) b 1 λ 5 υ 1 n 1 ( n 1 , n 3 ) b 1 + λ 7 υ 1 n 1 ( n 1 , n 3 ) b 1 λ ˙ 4 = H b 2 = λ 4 υ 2 ( n 2 , n 3 ) D + λ 5 υ 2 ( n 2 , n 3 ) λ ˙ 5 = H n 2 = κ 2 n 2 λ 4 υ 2 n 2 ( n 2 , n 3 ) b 2 + λ 5 D + υ 2 n 2 ( n 2 , n 3 ) b 2 λ ˙ 6 = H b 3 = λ 6 υ 3 ( n 3 ) D + λ 7 υ 3 ( n 3 ) λ ˙ 7 = H n 3 = λ 2 υ 1 n 3 ( n 1 , n 3 ) b 1 + λ 3 υ 1 n 3 ( n 1 , n 3 ) b 1 λ 4 υ 2 n 3 ( n 2 , n 3 ) b 2 λ 5 υ 1 n 3 ( n 1 , n 3 ) b 1 υ 2 n 3 ( n 2 , n 3 ) b 2 λ 6 υ 3 ( n 3 ) b 3 + λ 7 D + υ 1 n 3 ( n 1 , n 3 ) b 1 + υ 3 ( n 3 ) b 3
satisfying λ 1 ( T ) = 0 , λ 2 ( T ) = 0 , λ 3 ( T ) = 0 , λ 4 ( T ) = 0 , λ 5 ( T ) = 0 , λ 6 ( T ) = 0 , and λ 7 ( T ) = 0 . The Hamiltonian’s derivatives are provided by
H l r = κ 3 l r + ( λ 5 λ 1 ) h ¯ n 0 .
Therefore, H l r = 0 admits a unique solution provided by
l r * ( t ) = h ¯ κ 3 ( λ 1 λ 5 ) n 0 ( t )
provided that κ 3 0 and 0 < l r min h ¯ κ 3 ( λ 1 λ 5 ) n 0 ( t ) l r max . Therefore, the control is characterized as follows:
if H l r < 0 at t l r ( t ) = l r max , if H l r > 0 at t l r ( t ) = l r min , if H l r = 0 at t l r ( t ) = l r ( t ) = h ¯ κ 3 ( λ 1 λ 5 ) n 0 ( t ) .

7. Numerical Investigations

To demonstrate the accuracy of the theory derived above, a few examples are given below. The following functions are proposed to express the growth rates and the leachate re-circulation rate:
υ 1 ( n 1 , n 3 ) = a 1 n 1 n 3 , υ 2 ( n 2 , n 3 ) = a 2 n 2 c 2 + n 3 , υ 3 ( n 3 ) = a 3 n 3   and   h ( l r ) = h ¯ l r
where a 1 , a 2 , c 2 , and a 3 are positive constants.
It is easy to see that the functions υ 1 , υ 2 , υ 3 , and h satisfy Hypotheses H1–H5 where the parameters values are chosen as in Table 3.

7.1. Numerical Investigation for the Dynamics (2)

We start by solving the direct problem (2) numerically by choosing the leachate recirculation rate as l r = 0.8 . The first test satisfies H1 to H6 ensuring the global stability of the unique positive steady state E * . The persistence of competing bacteria can be seen in Figure 4. In Figure 5, the solution of (2) converges to the equilibrium E 12 , and only the two bacteria b 1 and b 2 persist. In Figure 6, the solution of (2) converges to the equilibrium E 13 , and only the two bacteria b 1 and b 3 persist. In Figure 7, the solution of (2) converges to the equilibrium E 23 , and only the two bacteria b 2 and b 3 persist. In Figure 8, the solution of (2) converges to the equilibrium E 1 , and only bacteria 1 persists. In Figure 9, the solution of (2) converges to the equilibrium E 2 , and only bacteria 2 persists. In Figure 10, the solution of (2) converges to the equilibrium E 3 , and only bacteria 3 persists. Finally, in Figure 11, the solution of (2) converges to the equilibrium E 0 , and all bacteria go extinct.

7.2. Numerical Investigation for the Optimal Control Problem

We suppose that the control, l r , in the following examples is a time-varying function, l r ( t ) , an initial value of l r ( 0 ) = 0.8 , and bounds are provided by l r min = 0.01 and l r max = 5 . With a final time of T = 10 , we take into consideration an initial state of x 0 = ( 0.01 , 0.01 , 12 , 16 , 0.01 , 1216 ) . Appendix A contains the used numerical scheme to approximate the control problem. The optimal solution is extremely smooth, as shown in Figure 12, Figure 13 and Figure 14. By increasing the κ 3 -values, the l r ( t ) -values fall; however, by increasing the κ 1 -values, the l r ( t ) -values increase. Note that varying the values of κ 1 , κ 2 , and κ 3 does not significantly impact the end values for the biomass and organic matter. The optimal strategy approach makes it possible to optimize the control values (costs) and reduce the organic matter.

8. Conclusions

This study presents a detailed mathematical model to analyze the dynamics of a three-tiered microbial food web in a chemostat under leachate recirculation. The model captures the complex interactions between chlorophenol degraders, phenol degraders, and methanogens, incorporating the inhibitory effects of hydrogen on microbial growth. Through rigorous qualitative analysis, we established the existence and stability conditions for various equilibrium states, demonstrating that the persistence of all three bacterial species is ensured under biologically reasonable assumptions.
The reduction of the seven-dimensional system to a three-dimensional one simplified the analysis while retaining essential biological insights. Analysis of the equilibria’s local and global stability is performed. This study concludes that the asymptotic persistence of the three bacteria is ensured given general assumptions of monotonicity on the growth rates. Furthermore, the introduction of an optimal control strategy for leachate recirculation provides a practical framework for minimizing organic matter accumulation while optimizing reactor performance. Numerical simulations validated the theoretical findings, illustrating the model’s applicability in predicting microbial dynamics under different conditions.
Future research could extend this work by incorporating experimental validation to confirm model predictions, exploring additional inhibitory factors, or refining the optimal control approach for industrial-scale applications. Such advancements would further bridge the gap between theoretical modeling and real-world bioreactor management, enhancing the efficiency of anaerobic digestion processes in waste treatment and biogas production.
In summary, this study contributes a robust theoretical foundation for understanding microbial interactions in engineered ecosystems and offers actionable insights for optimizing leachate recirculation strategies in bioreactors.

Author Contributions

Conceptualization, F.A.A.N., M.E.H. and B.S.A.; methodology, F.A.A.N., M.E.H. and B.S.A.; software, F.A.A.N., M.E.H. and B.S.A.; investigation, F.A.A.N., M.E.H. and B.S.A.; visualization, F.A.A.N., M.E.H. and B.S.A.; writing—original draft, F.A.A.N., M.E.H. and B.S.A.; writing—review and editing, F.A.A.N., M.E.H. and B.S.A. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Deanship of Scientific Research, Vice Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia [Grant No. KFU252345].

Data Availability Statement

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

Acknowledgments

The authors thank King Faisal University for its technical and financial support. The authors are also grateful to the anonymous reviewers for their many constructive suggestions, which helped to improve the presentation of the paper.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Suitable Numerical Scheme

Let [ 0 , T ] = i = 0 N 1 [ t i , t i + 1 ] , t i = i d t , d t = T N . Let n 0 i , b 1 i , n 1 i , b 2 i , n 2 , b 3 , n 3 , λ 1 i , λ 2 i , λ 3 i , λ 4 i , λ 5 i , λ 6 i , λ 7 i and l r i approaching n 0 ( t ) , b 1 ( t ) , n 1 ( t ) , b 2 ( t ) , n 2 ( t ) , b 3 ( t ) , n 3 ( t ) , λ 1 ( t ) , λ 2 ( t ) , λ 3 ( t ) , λ 4 ( t ) , λ 5 ( t ) , λ 6 ( t ) , λ 7 ( t ) and l r ( t ) at t = t i . A first-order backward-difference scheme will be used for the adjoint variables estimation, and an improvement of the Gauss–Seidel-like implicit finite-difference scheme will be used for the state variables estimation.
n 0 i + 1 n 0 i d t = D ( n 0 i n n 0 i + 1 ) h ¯ l r i n 0 i + 1 , b 1 i + 1 b 1 i d t = a 1 n 1 i n 3 i D b 1 i + 1 , n 1 i + 1 n 1 i d t = D ( n 1 i n n 1 i + 1 ) a 1 n 1 i + 1 n 3 i b 1 i + 1 , b 2 i + 1 b 2 i d t = a 2 n 2 i c 2 + n 3 i D b 2 i + 1 , n 2 i + 1 n 2 i d t = D ( n 2 i n n 2 i + 1 ) + h ¯ l r i n 0 i + 1 + a 1 n 1 i + 1 n 3 i b 1 i + 1 a 2 n 2 i + 1 c 2 + n 3 i b 2 i + 1 , b 3 i + 1 b 3 i d t = a 3 n 3 i D b 3 i + 1 , n 3 i + 1 n 3 i d t = D ( n 3 i n n 3 i + 1 ) a 1 n 1 i + 1 n 3 i + 1 b 1 i + 1 a 3 n 3 i + 1 b 3 i + 1 λ 1 N i λ 1 N i 1 d t = κ 1 n 0 i + 1 + λ 1 N i 1 ( D + h ¯ l r i ) λ 5 N i h ¯ l r i λ 2 N i λ 2 N i 1 d t = λ 2 N i 1 a 1 n 1 i + 1 n 3 i + 1 D + λ 3 N i a 1 n 1 i + 1 n 3 i + 1 λ 3 N i λ 3 N i 1 d t = λ 2 N i 1 a 1 n 3 i + 1 b 1 i + 1 + λ 3 N i 1 D + a 1 n 3 i + 1 b 1 i + 1 λ 5 N i a 1 n 1 i + 1 n 3 i + 1 + λ 7 N i a 1 n 1 i + 1 n 3 i + 1 λ 4 N i λ 4 N i 1 d t = λ 4 N i 1 a 2 n 2 i + 1 c 2 + n 3 i + 1 D + λ 5 N i a 2 n 2 i + 1 c 2 + n 3 i + 1 λ 5 N i λ 5 N i 1 d t = κ 2 n 2 i + 1 λ 4 N i 1 a 2 b 2 i + 1 c 2 + n 3 i + 1 + λ 5 N i 1 D + a 2 b 2 i + 1 c 2 + n 3 i + 1 λ 6 N i λ 6 N i 1 d t = λ 6 N i 1 a 3 n 3 i + 1 D + λ 7 N i a 3 n 3 i + 1 λ 7 N i λ 7 N i 1 d t = λ 2 N i 1 a 1 n 1 i + 1 b 1 i + 1 + λ 3 N i 1 a 1 n 1 i + 1 b 1 i + 1 + λ 4 N i 1 a 2 n 2 i + 1 b 2 i + 1 ( c 2 + n 3 i + 1 ) 2 λ 5 N i 1 a 1 n 1 i + 1 b 1 i + 1 + a 2 n 2 i + 1 b 2 i + 1 ( c 2 + n 3 i + 1 ) 2 λ 6 N i 1 a 3 b 3 i + 1 + λ 7 N i 1 D + a 1 n 1 i + 1 b 1 i + 1 + a 3 b 3 i + 1
Hence, l r i + 1 will be calculated as follows: l r i + 1 = h ¯ κ 3 ( λ 1 N i 1 λ 5 N i 1 ) n 0 i + 1 provided that κ 3 0 and 0 < l r min l r i + 1 l r max . Thus, we will use the Algorithm A1 given hereafter.
Algorithm A1 Optimal leachate recirculation strategy procedure
n 0 0 n 0 ( 0 ) , b 1 0 b 1 ( 0 ) , n 1 0 n 1 ( 0 ) , b 2 0 b 2 ( 0 ) , n 2 0 n 2 ( 0 ) , b 3 0 b 3 ( 0 ) , n 3 0 n 3 ( 0 ) , λ 1 N 0 , λ 2 N 0 , λ 3 N 0 , λ 4 N 0 , λ 5 N 0 , λ 6 N 0 , λ 7 N 0 , l r 0 l r ( 0 ) ,
for  i = 0 to N 1  do
n 0 i + 1 n 0 i + d t D n 0 i n 1 + d t D + h ¯ l r i , b 1 i + 1 b 1 i 1 d t a 1 n 1 i n 3 i D , n 1 i + 1 n 1 i + d t D n 1 i n 1 + d t D + a 1 n 3 i b 1 i + 1 , b 2 i + 1 b 2 i 1 d t a 2 n 2 i c 2 + n 3 i D , n 2 i + 1 n 2 i + d t D n 2 i n + h ¯ l r i n 0 i + 1 + a 1 n 1 i + 1 n 3 i b 1 i + 1 1 + d t D + a 2 b 2 i + 1 c 2 + n 3 i , b 3 i + 1 b 3 i 1 d t a 3 n 3 i D , n 3 i + 1 n 3 i + d t D n 3 i n 1 + d t D + a 1 n 1 i + 1 b 1 i + 1 + a 3 b 3 i + 1 , λ 1 N i 1 λ 1 N i + d t κ 1 n 0 i + 1 + λ 5 N i h ¯ l r i 1 + d t D + h ¯ l r i , λ 2 N i 1 λ 2 N i d t λ 3 N i a 1 n 1 i + 1 n 3 i + 1 λ 5 N i a 1 n 1 i + 1 n 3 i + 1 + λ 7 N i a 1 n 1 i + 1 n 3 i + 1 1 d t a 1 n 1 i + 1 n 3 i + 1 D , λ 3 N i 1 λ 3 N i + d t λ 2 N i 1 a 1 n 3 i + 1 b 1 i + 1 + λ 5 N i a 1 n 3 i + 1 b 1 i + 1 λ 7 N i a 1 n 3 i + 1 b 1 i + 1 1 + d t D + a 1 n 3 i + 1 b 1 i + 1 , λ 4 N i 1 λ 4 N i d t λ 5 N i a 2 n 2 i + 1 c 2 + n 3 i + 1 1 d t a 2 n 2 i + 1 c 2 + n 3 i + 1 D , λ 5 N i 1 λ 5 N i + d t κ 2 n 2 i + 1 + λ 4 N i 1 a 2 b 2 i + 1 c 2 + n 3 i + 1 1 + d t D + a 2 b 2 i + 1 c 2 + n 3 i + 1 , λ 6 N i 1 λ 6 N i d t λ 7 N i a 3 n 3 i + 1 1 d t a 3 n 3 i + 1 D , λ 7 N i 1 λ 7 N i d t λ 2 N i 1 a 1 n 1 i + 1 b 1 i + 1 + λ 3 N i 1 a 1 n 1 i + 1 b 1 i + 1 + λ 4 N i 1 a 2 n 2 i + 1 b 2 i + 1 ( c 2 + n 3 ) 2 1 + d t D + a 1 n 1 i + 1 b 1 i + 1 + a 3 b 3 i + 1 + d t λ 5 N i 1 a 1 n 1 i + 1 b 1 i + 1 + a 2 n 2 i + 1 b 2 i + 1 ( c 2 + n 3 i + 1 ) 2 + λ 6 N i 1 a 3 b 3 i + 1 1 + d t D + a 1 n 1 i + 1 b 1 i + 1 + a 3 b 3 i + 1 l r i + 1 max ( min ( h ¯ κ 3 ( λ 1 N i 1 λ 5 N i 1 ) n 0 i + 1 , l r max ) , l r min ) .
end

References

  1. Zhao, X.; Li, L.; Wu, D.; Xiao, T.; Ma, Y.; Peng, X. Modified Anaerobic Digestion Model No. 1 for modeling methane production from food waste in batch and semi-continuous anaerobic digestions. Bioresour. Technol. 2019, 271, 109–117. [Google Scholar] [CrossRef] [PubMed]
  2. Daoud, Y.; Abdellatif, N.; Sari, T.; Harmand, J. Steady state analysis of a syntrophic model: The effect of a new input substrate concentration. Math. Model. Nat. Phenom. 2018, 13, 31. [Google Scholar] [CrossRef]
  3. Fekih-Salem, R.; Daoud, Y.; Abdellatif, N.; Sari, T. A mathematical model of anaerobic digestion with syntrophic relationship, substrate inhibition and distinct removal rates. SIAM J. Appl. Dyn. Syst. 2020, 20, 1621–1654. [Google Scholar] [CrossRef]
  4. Sari, T.; Harmand, J. A model of a syntrophic relationship between two microbial species in a chemostat including maintenance. Math. Biosci. 2016, 275, 1–9. [Google Scholar] [CrossRef] [PubMed]
  5. Reinhart, D.R. A Review Of Recent Studies On The Sources Of Hazardous Compounds Emitted From Solid Waste Landfills: A U.S. Experience. Waste Manag. Res. 1993, 11, 257–268. [Google Scholar] [CrossRef]
  6. Paxéus, N. Organic compounds in municipal landfill leachates. Water Sci. Technol. 2000, 42, 323–333. [Google Scholar] [CrossRef]
  7. Lou, S.N.; Lin, Y.S.; Hsu, Y.S.; Chiu, E.M.; Ho, C.T. Soluble and insoluble phenolic compounds and antioxidant activity of immature calamondin affected by solvents and heat treatment. Food Chem. 2014, 161, 246–253. [Google Scholar] [CrossRef] [PubMed]
  8. Batstone, D.; Keller, J.; Angelidaki, I.; Kalyuzhnyi, S.; Pavlostathis, S.; Rozzi, A.; Sanders, W.; Siegrist, H.; Vavilin, V. The IWA Anaerobic Digestion Model No 1 (ADM1). Water Sci. Technol. 2002, 45, 65–73. [Google Scholar] [CrossRef] [PubMed]
  9. El Hajji, M. Influence of the presence of a pathogen and leachate recirculation on a bacterial competition. Int. J. Biomath. 2024. [Google Scholar] [CrossRef]
  10. Wade, M.J.; Pattinson, R.; Parker, N.; Dolfing, J. Emergent behaviour in a chlorophenol35 mineralising three-tiered microbial ‘food web’. J. Theor. Biol. 2016, 389, 171–186. [Google Scholar] [CrossRef] [PubMed]
  11. Sari, T.; Wade, M. Generalised approach to modelling a three-tiered microbial food-web. Math. Biosci. 2017, 291, 21–37. [Google Scholar] [CrossRef] [PubMed]
  12. Almuashi, H.H.; Almuallem, N.A.; El Hajji, M. The Effect of Leachate Recycling on the Dynamics of Two Competing Bacteria with an Obligate One-Way Beneficial Relationship in a Chemostat. Mathematics 2024, 12, 3819. [Google Scholar] [CrossRef]
  13. Almuallem, N.A.; El Hajji, M. How Can Viruses Affect the Growth of Zooplankton on Phytoplankton in a Chemostat? Mathematics 2025, 13, 1192. [Google Scholar] [CrossRef]
  14. El Hajji, M.; Chorfi, N.; Jleli, M. Mathematical modelling and analysis for a three-tiered microbial food web in a chemostat. Electron. J. Diff. Eqns. 2017, 2017, 1–13. [Google Scholar]
  15. Weedermann, M.; Seo, G.; Wolkowicz, G.S.K. Mathematical model of anaerobic digestion in a chemostat: Effects of syntrophy and inhibition. J. Biol. Dyn. 2013, 7, 59–85. [Google Scholar] [CrossRef] [PubMed]
  16. Smith, H.L.; Waltman, P. The Theory of the Chemostat. In Dynamics of Microbial Competition; Cambridge Studies in Mathematical Biology; Cambridge University Press: Cambridge, UK, 1995; Volume 13. [Google Scholar] [CrossRef]
  17. Teschl, G. Graduate Studies in Mathematics. InOrdinary Differential Equations and Dynamical Systems; American Mathematical Society: Washington, DC, USA, 2012; Volume 140. [Google Scholar]
  18. Thieme, H.R. Convergence results and a Poincaré-Bendixson trichotomy for asymptotically autonomous differential equations. J. Math. Biol. 1992, 30, 755–763. [Google Scholar] [CrossRef]
  19. Fleming, W.; Rishel, R. Deterministic and Stochastic Optimal Control; Springer: New York, NY, USA, 1975. [Google Scholar] [CrossRef]
  20. Lenhart, S.; Workman, J.T. Optimal Control Applied to Biological Models; Chapman and Hall: Boca Raton, FL, USA, 2007. [Google Scholar] [CrossRef]
  21. Pontryagin, L.S.; Boltyanskii, V.G.; Gamkrelidze, R.V.; Mishchenko, E.F.; Trirogoff, K.N.; Neustadt, L.W. The Mathematical Theory of Optimal Processes; CRC Press: Boca Raton, FL, USA, 1987. [Google Scholar] [CrossRef]
Figure 1. A continuous stirring reactor (chemostat) to which three limiting nutriments, where the first one of them is present in two forms (soluble and insoluble substrate; N 0 i n and N 1 i n ), are continuously added, while the culture liquid ( N 0 , N 1 , N 2 , N 3 , B 1 , B 2 , B 3 ) is continuously mixed.
Figure 1. A continuous stirring reactor (chemostat) to which three limiting nutriments, where the first one of them is present in two forms (soluble and insoluble substrate; N 0 i n and N 1 i n ), are continuously added, while the culture liquid ( N 0 , N 1 , N 2 , N 3 , B 1 , B 2 , B 3 ) is continuously mixed.
Mathematics 13 02146 g001
Figure 2. Dynamics of three bacteria in a chemostat under the impact of the leachate recycling. Circles describe the compartments N 0 , N 1 , N 2 , N 3 , B 1 , B 2 and B 3 [12,13].
Figure 2. Dynamics of three bacteria in a chemostat under the impact of the leachate recycling. Circles describe the compartments N 0 , N 1 , N 2 , N 3 , B 1 , B 2 and B 3 [12,13].
Mathematics 13 02146 g002
Figure 3. Equilibria configuration. F 0 , F 1 , F 2 , F 3 , F 12 , F 13 , and F 23 are unstable steady states, and F * is the only stable one.
Figure 3. Equilibria configuration. F 0 , F 1 , F 2 , F 3 , F 12 , F 13 , and F 23 are unstable steady states, and F * is the only stable one.
Mathematics 13 02146 g003
Figure 4. For n 1 i n = 10 , n 2 i n = 5 , n 3 i n = 12 , and D = 3 , the trajectory of dynamics (2) converges to E * , and all bacteria persist.
Figure 4. For n 1 i n = 10 , n 2 i n = 5 , n 3 i n = 12 , and D = 3 , the trajectory of dynamics (2) converges to E * , and all bacteria persist.
Mathematics 13 02146 g004
Figure 5. For n 1 i n = 28 , n 2 i n = 25 , n 3 i n = 2 , and D = 6 , the solution of (2) converges to E 12 , and only bacteria b 1 and b 2 persist.
Figure 5. For n 1 i n = 28 , n 2 i n = 25 , n 3 i n = 2 , and D = 6 , the solution of (2) converges to E 12 , and only bacteria b 1 and b 2 persist.
Mathematics 13 02146 g005
Figure 6. For n 1 i n = 10 , n 2 i n = 5 , n 3 i n = 12 , and D = 4 , the solution of (2) converges to E 13 , and only bacteria b 1 and b 3 persist.
Figure 6. For n 1 i n = 10 , n 2 i n = 5 , n 3 i n = 12 , and D = 4 , the solution of (2) converges to E 13 , and only bacteria b 1 and b 3 persist.
Mathematics 13 02146 g006
Figure 7. For n 1 i n = 1 , n 2 i n = 25 , n 3 i n = 12 , and D = 5 , the solution of (2) converges to E 23 , and only bacteria b 2 and b 3 persist.
Figure 7. For n 1 i n = 1 , n 2 i n = 25 , n 3 i n = 12 , and D = 5 , the solution of (2) converges to E 23 , and only bacteria b 2 and b 3 persist.
Mathematics 13 02146 g007
Figure 8. For n 1 i n = 10 , n 2 i n = 5 , n 3 i n = 12 , and D = 7 , the solution of (2) converges to E 1 , and only bacteria b 1 persists.
Figure 8. For n 1 i n = 10 , n 2 i n = 5 , n 3 i n = 12 , and D = 7 , the solution of (2) converges to E 1 , and only bacteria b 1 persists.
Mathematics 13 02146 g008
Figure 9. For n 1 i n = 1 , n 2 i n = 25 , n 3 i n = 2 , and D = 4 , the solution of (2) converges to E 2 , and only bacteria b 2 persists.
Figure 9. For n 1 i n = 1 , n 2 i n = 25 , n 3 i n = 2 , and D = 4 , the solution of (2) converges to E 2 , and only bacteria b 2 persists.
Mathematics 13 02146 g009
Figure 10. For n 1 i n = 2 , n 2 i n = 3 , n 3 i n = 15 , and D = 15 , the solution of (2) converges to E 3 , and only bacteria b 3 persists.
Figure 10. For n 1 i n = 2 , n 2 i n = 3 , n 3 i n = 15 , and D = 15 , the solution of (2) converges to E 3 , and only bacteria b 3 persists.
Mathematics 13 02146 g010
Figure 11. For n 1 i n = 10 , n 2 i n = 5 , n 3 i n = 12 , and D = 100 , the solution of (2) converges to E 0 , and all bacteria go to extinction.
Figure 11. For n 1 i n = 10 , n 2 i n = 5 , n 3 i n = 12 , and D = 100 , the solution of (2) converges to E 0 , and all bacteria go to extinction.
Mathematics 13 02146 g011
Figure 12. The optimal strategy’s impact for κ 1 = 10 , κ 2 = 1 , κ 3 = 1 .
Figure 12. The optimal strategy’s impact for κ 1 = 10 , κ 2 = 1 , κ 3 = 1 .
Mathematics 13 02146 g012
Figure 13. The optimal strategy’s impact for κ 1 = 10 , κ 2 = 1 , κ 3 = 10 .
Figure 13. The optimal strategy’s impact for κ 1 = 10 , κ 2 = 1 , κ 3 = 10 .
Mathematics 13 02146 g013
Figure 14. The optimal strategy’s impact for κ 1 = 5 , κ 2 = 1 , κ 3 = 1 .
Figure 14. The optimal strategy’s impact for κ 1 = 5 , κ 2 = 1 , κ 3 = 1 .
Mathematics 13 02146 g014
Table 1. Variables, functions, and parameters of the dynamics (1) and (2).
Table 1. Variables, functions, and parameters of the dynamics (1) and (2).
NotationNotationSignificance
System (1)System (2)
N 0 n 0 Insoluble phenol concentration
N 1 n 1 Chlorophenol concentration
N 2 n 2 Soluble phenol concentration
N 3 n 3 Hydrogen concentration
B 1 b 1 Chlorophenol degrader concentration
B 2 b 2 Phenol degrader concentration
B 3 b 3 Methanogen concentration
φ 1 ( · , · ) υ 1 ( · , · ) Growth rate of bacteria 1
φ 2 ( · , · ) υ 2 ( · , · ) Growth rate of bacteria 2
φ 3 ( · ) υ 3 ( · ) Growth rate of bacteria 3
h ( · ) h ( · ) Hydrolysis rate
l r l r Leachate recirculation rate
N 0 i n n 0 i n Insoluble phenol input concentration
N 1 i n n 1 i n Chlorophenol input concentration
N 2 i n n 2 i n Soluble phenol input concentration
N 3 i n n 3 i n Hydrogen input concentration
DDDilution rate
Y i , i = 1 , , 5 Yield coefficients
Table 2. Existence, uniqueness, and steady states’ nature.
Table 2. Existence, uniqueness, and steady states’ nature.
EquilibriaExistence/UniquenessStableUnstable
F 0 always D > max ( D 1 , D 2 , D 3 ) D < max ( D 1 , D 2 , D 3 )
F 1 D < D 1 D > max ( D 7 , D 8 ) D < max ( D 7 , D 8 )
F 2 D < D 2 D > max ( D 1 , D 3 ) D < max ( D 1 , D 3 )
F 3 D < D 3 D > max ( D 4 , D 5 ) D < max ( D 4 , D 5 )
F 13 D < min ( D 3 , D 4 ) D > D 6 D < D 6
F 23 D < min ( D 3 , D 5 ) D > D 4 D < D 4
F 12 D < min ( D 1 , D 7 ) D > D 8 D < D 8
F * D < min ( D 3 , D 4 , D 6 ) always
Table 3. The numerical simulations’ selected parameters have no biologically significant practical implications; they are merely intended to illustrate the findings.
Table 3. The numerical simulations’ selected parameters have no biologically significant practical implications; they are merely intended to illustrate the findings.
Parameter a 1 a 2 a 3 h ¯ l r c 2 n 0 in
Value 0.8 2 1.6 1.2 0.8 6 7.5
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

Al Najim, F.A.; El Hajji, M.; Alshammari, B.S. A Microbial Food Web Dynamics Under the Influence of Leachate Recirculation. Mathematics 2025, 13, 2146. https://doi.org/10.3390/math13132146

AMA Style

Al Najim FA, El Hajji M, Alshammari BS. A Microbial Food Web Dynamics Under the Influence of Leachate Recirculation. Mathematics. 2025; 13(13):2146. https://doi.org/10.3390/math13132146

Chicago/Turabian Style

Al Najim, Fatema Ahmed, Miled El Hajji, and Bader Saad Alshammari. 2025. "A Microbial Food Web Dynamics Under the Influence of Leachate Recirculation" Mathematics 13, no. 13: 2146. https://doi.org/10.3390/math13132146

APA Style

Al Najim, F. A., El Hajji, M., & Alshammari, B. S. (2025). A Microbial Food Web Dynamics Under the Influence of Leachate Recirculation. Mathematics, 13(13), 2146. https://doi.org/10.3390/math13132146

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop