Plan
Comptes Rendus

Biological modelling / Biomodélisation
On conservativity and shattering for an equation of phytoplankton dynamics
[Sur la conservativité et l'éclatement d'une équation de dynamique du phytoplancton.]
Comptes Rendus. Biologies, Volume 327 (2004) no. 11, pp. 1025-1036.

Résumés

A model of phytoplankton dynamics introduced by Arino describes the evolution of aggregates of phytoplankton by a kinetic-type equation composed of terms describing the growth of the aggregates and their splitting, where the latter is modelled by a singular integral operator of the same form as in the classical fragmentation theory. In this paper we shall show that despite the presence of the growth term, the model displays the typical properties of the fragmentation models; in particular, if the fragmentation rate is unbounded as the size of aggregates tends to zero, then there occurs an unaccounted for loss of the phytoplankton though formally nothing is taken out of the system.

Un modèle de dynamique du phytoplancton introduit par Arino et Rudnicki décrit l'évolution d'agrégats de phytoplancton au moyen d'une équation de type cinétique composée de termes décrivant la croissance d'agrégats et leur éclatement, où ce dernier phénomène est modélisé par un opérateur intégral singulier de la même forme que dans la théorie classique de la fragmentation. Nous montrerons dans cet article que, malgré la présence du terme de croissance, le modèle présente les propriétés typiques des modèles de fragmentation ; en particulier, si le taux de fragmentation est illimité alors que la taille des agrégats tend vers zéro, alors il y a un terme non pris en compte traduisant une disparition de phytoplancton, quoique rien n'ait formellement quitté le système.

Métadonnées
Reçu le :
Accepté le :
Publié le :
DOI : 10.1016/j.crvi.2004.07.017
Keywords: substochastic semigroups, fragmentation, shattering
Mot clés : semi-groupes stochastiques, fragmentation, éclatement

Jacek Banasiak 1

1 School of Mathematical and Statistical Sciences, University of Natal, Durban 4041, South Africa
@article{CRBIOL_2004__327_11_1025_0,
     author = {Jacek Banasiak},
     title = {On conservativity and shattering for an equation of phytoplankton dynamics},
     journal = {Comptes Rendus. Biologies},
     pages = {1025--1036},
     publisher = {Elsevier},
     volume = {327},
     number = {11},
     year = {2004},
     doi = {10.1016/j.crvi.2004.07.017},
     language = {en},
}
TY  - JOUR
AU  - Jacek Banasiak
TI  - On conservativity and shattering for an equation of phytoplankton dynamics
JO  - Comptes Rendus. Biologies
PY  - 2004
SP  - 1025
EP  - 1036
VL  - 327
IS  - 11
PB  - Elsevier
DO  - 10.1016/j.crvi.2004.07.017
LA  - en
ID  - CRBIOL_2004__327_11_1025_0
ER  - 
%0 Journal Article
%A Jacek Banasiak
%T On conservativity and shattering for an equation of phytoplankton dynamics
%J Comptes Rendus. Biologies
%D 2004
%P 1025-1036
%V 327
%N 11
%I Elsevier
%R 10.1016/j.crvi.2004.07.017
%G en
%F CRBIOL_2004__327_11_1025_0
Jacek Banasiak. On conservativity and shattering for an equation of phytoplankton dynamics. Comptes Rendus. Biologies, Volume 327 (2004) no. 11, pp. 1025-1036. doi : 10.1016/j.crvi.2004.07.017. https://comptes-rendus.academie-sciences.fr/biologies/articles/10.1016/j.crvi.2004.07.017/

Version originale du texte intégral

1 Introduction

In their recent paper [1], O. Arino and R. Rudnicki considered a model of phytoplankton at the level of aggregates of cells. The aggregates are structured by their size and the phytoplankton system consists of aggregates of all possible sizes. The aggregate size can change due to the usual birth and death of individual cells, but also there are two other mechanisms acting at the level of aggregate: splitting of an aggregate into several parts and combining of two or more aggregates into a bigger one. The latter two are known in physics and chemical engineering as fragmentation–coagulation processes and describe a variety of phenomena ranging from polymerization/polymer degradation, droplets break-up and build-up, through rock crushing and grinding, solid drugs break-up in organisms, to blood cell aggregation and fragmentation. In phytoplankton, the major role in fragmentation and coagulation processes is played by the substance called TEP (Transparent Exopolymer Particles) that is a by-product of the growth of phytoplankton, and its stickiness causes the cells to remain together [2–5]. On the contrary, a low level of concentration of TEP results in fragmentation of the aggregate due to external causes, like currents or turbulence on one hand, and internal unspecified forces of biotic nature on the other.

In [1], the authors considered a relatively simple model of binary fragmentation and coagulation with bounded fragmentation and coagulation rates, as their aim was to investigate the long-time behaviour of the solution, and they succeeded in proving the existence of a time-invariant distribution to which the population of aggregates converges as time tends to infinity, whatever the initial population might be.

Our aim in this paper is to analyze more closely the inter-relation between the growth and fragmentation of aggregates so that we shall disregard the coagulation part. By the very nature of the model, the fragmentation process itself should be conservative, that is, the total amount (mass, the number of particles or cells) of the described quantity, say Q, contained in all the aggregates before and after a fragmentation event should be the same. Thus, if in some system the fragmentation occurs alongside another process of growth or decay determined by a certain law, then the evolution of the total amount of Q should follow this law due to the conservativity of the fragmentation process. If this is the case, then such a process is said to be honest. However, for pure fragmentation models and models combining fragmentation of clusters with their dissolution in the surrounding solute, it has been known for some time [6–9], that if the fragmentation rate of small clusters is large enough, then there appears an unexpected leakage of Q from the system, that is, the amount of Q in the system is strictly smaller than predicted by the laws of nature used to build the model.

In the existing physical literature, op. cit., this unaccounted for loss of Q (in this case, mass-loss), termed shattering fragmentation, is attributed to a phase transition and formation of a ‘dust’ of particles with zero size and non-zero mass (a similar but in some sense opposite process of forming an ‘infinitely large’ particle is known in coagulation as a gelation). For some relatively simple models, shattering fragmentation was analyzed in [4,7] by probabilistic methods. In a series of recent papers [10–14], the shattering and non-shattering fragmentation was fully characterized by the properties of the generator of the semigroup describing the evolution and the theory was applied to a wide range of processes providing a comprehensive classification of fragmentation models.

In particular, in [10], a model where fragmentation occurs together with a continuous mass loss due to dissolving of the substance has been analyzed and conditions ensuring conservativity and shattering have been provided. A crucial rôle in the analysis is played by the theory of substochastic, that is, positivity preserving and contractive semigroups. In this paper, we shall show that the model introduced by Arino and Rudnicki, though obviously not substochastic due to the appearance of the growth term, can be nevertheless transformed into one, and treated by a generalization of the theory developed in [10] yielding similar results, that is, the process is honest for rates of fragmentation bounded at 0, otherwise shattering fragmentation occurs irrespective of the growth rate (within the limits of the model).

It is, however, fair to admit that shattering fragmentation, as related to the creation of infinitesimally small aggregates, is not really a biological (or physical) phenomenon as in the real world there is always a lowest size of objects beyond which we cannot reach without encountering quantum effects. If one adopts such a point of view, then our results can be restated as saying that the models with fragmentation rates that are unbounded at 0 are non-biological.

2 The model

Following [1], we consider the following fragmentation model with mass loss:

tu(x,t)=x[b(x)u(x,t)]d(x)u(x,t)p(x)u(x,t)+xp(y)k(x,y)u(y,t)dy(2.1)
where u is the distribution function of all the aggregates according to their size x, which, depending on the model, can be the number of cells, the total mass of the cells, or the total length of cells forming the aggregate. By the total size of the system, we understand the sum of sizes of all the aggregates the system consists of, that is, 0u(x)xdx. Thus a natural requirement is that the total size of the system is finite at all finite times, which leads to the natural setting for (2.1), which is:
X=L1(R+,xdx)={u;u:=0|u(x)|xdx<}
Further, the growth rate b is a sufficiently smooth function on [0,), satisfying:
0<b(x)b˜x,x>0(2.2)
for some constant b˜>0. From (2.2) we have b(0)=0 and we assume also that:
b(0)>0(2.3)
The function d is the death rate, which we assume to be continuous and bounded.

The fragmentation is characterized by two functions: p and k. The function p is the fragmentation rate, that is, the number of fragmentation events of aggregates of size x per unit time. We assume that pL,loc(R+) and p0 a.e. Further, k is a non-negative measurable function that describes the distribution of particle masses x spawned by the fragmentation of a particle of mass y. Formal balance of mass in fragmentation requires:

0yxk(x,y)dx=y(2.4)
that expresses the fact that the sizes of all daughter aggregates after fragmentation must add up to the size of the parent. The integral:
0yk(x,y)dx=My(2.5)
gives the expected number of daughter aggregates resulting from the fragmentation of a parent of size y; in general, My may be infinite. Note that in [1] the authors considered only binary fragmentation, that is, My=2, and the normalized function K(x,y)=k(x,y)/2.

The typical choices for k used in the literature are: the power law (ν+2)xν/yν+1 with 2<ν0, and its generalization

k(x,y)=1yh(xy)(2.6)
which describes the situation when the fragmentation depends on the daughter size/parent size ratio and not on their sizes separately.

Integrating (2.1) multiplied by x, we obtain the formal equation governing the evolution of the total size of the system:

ddt0u(x,t)xdx=0d(x)u(x,t)xdx+0b(x)u(x,t)dx(2.7)
where we used (2.4) and integration by parts. It is to be stressed that (2.7) is far from obvious – apart from the validity of the integration by parts, each term of (2.1) should be an integrable function so that we can use Fubini's theorem and (2.4). In fact, in this paper we determine classes of coefficients for which (2.7) is valid and for which it is not.

3 Transport semigroup

In this section we consider the differential part of Eq. (2.1), that is, the Cauchy problem:

tu(x,t)=x[b(x)u(x,t)]d(x)u(x,t)p(x)u(x,t),x>0,t>0u(x,0)=g(x)(3.1)
The solution of this problem can be written down explicitly. However, for the purpose of this paper, we shall need a precise characterization of the domain of the generator of the semigroup solving (3.1) and this is not obvious due to possible singularities of the fragmentation rate p and degeneracy of b at x=0. It turns out that direct estimates of the resolvent of the right-hand side of the equation in (3.1) are not easy, thus we shall simplify the problem even further and as the first step we shall deal with the Cauchy problem:
tu(x,t)=x[b(x)u(x,t)],x>0,t>0u(x,0)=g(x)(3.2)
Define the operator
[TBu](x)=(b(x)u(x))x
on the domain
D(TB)={uX;buis a.a.c. and(bu)xX}
where the abbreviation ‘a.a.c.’ stands for almost absolutely continuous, that is, absolutely continuous on each compact interval of (0,).

Denoting by B a fixed antiderivative of 1/b, say, B(x)=1xdsb(s), we see, due to 0<b(x)<b˜x for x>0, that:

limxB(x)=+,limx0B(x)=(3.3)
thus B is globally invertible on R. Hence, defining Y(t,x):=B−1(B(x)t), x>0, 0t<, we can prove as in [1] that:
[STB(t)g()](x)=b(Y(t,x))g(Y(t,x))b(x)
is a C0-semigroup generated by (TB,D(TB)), that satisfies:
STB(t)ueb˜tu(3.4)
In particular, by the Hille–Yosida theorem, we obtain for gX and λ>b˜:
R(λ,TB)g1λb˜g(3.5)

Using the above we can prove the following result for the the semigroup solving (3.1).

Proposition 3.1

The operator T defined by the formal expression:

[ T u ] ( x ) = ( b ( x ) u ( x ) ) x a ( x ) u ( x )
on the domain:
D ( T ) = { u X , a u X , b u is a.a.c. and ( b u ) x X }
where a ( x ) = p ( x ) + d ( x ) , generates a positive semigroup, say ( S T ( t ) ) t 0 , satisfying for any u X :
S T ( t ) u e b ˜ t u (3.6)
where b ˜ is defined in (2.2) .

Proof

Let us consider the resolvent equation of (3.1):

(b(x)u(x))x+a(x)u(x)+λu(x)=f(x)
Solving the above equation, we see that a good candidate for the resolvent is:
[R(λ)g](x)=eλB(x)A(x)b(x)0xeλB(y)+A(y)g(y)dy
where A(x) is a fixed antiderivative of a(x)/b(x). Direct integration gives:
R(λ)g0(eλB(x)A(x)b(x)0xeλB(y)+A(y)|g(y)|dy)xdx1λb˜g
where we used the fact that eA(x) is non-increasing, and (3.5). Further, we have:
a(x)b(x)eλB(x)A(x)=λb(x)eλB(x)A(x)ddxeλB(x)A(x)(3.7)
so that
aR(λ)g0(eλB(y)+A(y)yyxa(x)eλB(x)A(x)b(x)dx)|g(y)|ydy0(1+eλB(y)+A(y)yyeλB(x)A(x)dx)×y|g(y)|dy(1+(λb˜)−1)g
where we again used monotonicity of eA(x) and (3.5).

Next we observe that for fX,

b(x)u(x)=eλB(x)A(x)0xeλB(y)+A(y)f(y)dy
and both eλB(x)A(x) and the integral (as a function of its upper limit) are almost absolutely continuous and bounded over any fixed interval [α,β]]0,[. Therefore, it follows that the product is absolutely continuous on [α,β] and therefore bu is almost absolutely continuous. Moreover,
(b(x)u(x))x=(λ+a(x))eλB(x)A(x)b(x)0xeλB(y)+A(y)f(y)dyf(x)=(λ+a(x))u(x)f(x)X
so that R(λ)XD(T). Since clearly (λT)D(T)X, we have (λIT)R(λ)f=f for any fX. To show that R(λ) is the resolvent for T, it is enough to show that λIT is injective on D(T). We see that the only solution (up to a multiplicative constant) to
(b(x)u(x))x+a(x)u(x)+λu(x)=0
is uλ(x)=eλB(x)A(x)/b(x). Firstly, we observe that since eA(x) is positive and decreasing, eA(x)c>0 in some interval [0,α]. Moreover, since b(x)b˜x, we have for x1:
eλB(x)=eλ1xdsb(s)=eλx1dsb(s)eλb˜lnx=xλb˜
Therefore, for α<1:
uλ=0eλB(x)A(x)b(x)xdxc0αeλB(x)b(x)xdxcb˜0αxλb˜dx=(3.8)
as λ>b˜. Hence, λIT is injective for λ>b˜ (even on its maximal domain) and R(λ)=R(λ,T). The resolvent is clearly a positive operator so that, by the Hille–Yosida theorem, (T,D(T)) generates a positive semigroup satisfying (3.6).

From this proposition it follows that the operator

(T˜,D(T))=(Tb˜I,D(T))(3.9)
generates a positive semigroup of contractions given by
ST˜(t)u=eb˜tST(t)u(3.10)
This shows that to prove the existence of a semigroup solving (a realization of) (2.1), characterize its generator and thus analyze the dynamics of the process, we can use the substochastic semigroup theory developed recently in a series of papers [10,11,13,15–17]. Below we shall recall the basic results of this theory.

4 Substochastic semigroups

In this section we shall summarize relevant facts from substochastic semigroup theory as developed in [10]. To avoid confusion, we shall use the same notation for the abstract operators as for the particular application discussed in this paper, however the theory is fairly general and requires only that the assumptions (A1)–(A3) be satisfied.

Let (Ω,μ) be a measure space and let X=L1(Ω,μ). If ZX is a subspace, then Z+ denotes the cone of nonnegative elements of Z and for fX the symbols f± denote the positive and negative part of f, that is, f+=max{f,0} and f=min{f,0}. Let (S(t))t0 be a strongly continuous semigroup on X. We say that (S(t))t0 is a substochastic semigroup if for any t0, S(t)0 and S(t)1, and a stochastic semigroup if additionally S(t)f=f for fX+.

Accordingly, we consider linear operators in X: T˜TB+A˜ with D(T˜)D(TB)D(A˜), and K, that have the following properties:

  • (A1) (T˜,D(T˜)) generates a substochastic semigroup (ST˜(t))t0;
  • (A2) D(K)D(T˜) and Ku0 for uD(T˜)+;
  • (A3) for all uD(T˜)+
    Ω(T˜u+Kf)dμ0(4.1)

Theorem 4.1 [11,17]

Under the above assumptions, there exists a smallest substochastic semigroup(SG˜(t))t0generated by an extensionG˜of the operatorT˜+K. This semigroup, for arbitraryuD(G˜)andt>0, satisfies:

ddtSG˜(t)u=G˜SG˜(t)u(4.2)
(SG˜(t))t0can be obtained as a strong limit in X of semigroups(Sr(t))t0generated by(T˜+rK,D(T˜))asr1; iffX+, then the limit is monotonic.

The generator G ˜ of ( S G ˜ ( t ) ) t 0 is characterized by:

( λ I G ˜ ) −1 f = n = 0 ( λ I T ˜ ) −1 [ K ( λ I T ˜ ) −1 ] n f f X (4.3)

Formula (4.3) does not provide any explicit information as to how large an extension of T˜+K the generator G˜ is and this problem is closely related to the behaviour of (SG˜(t))t0. To make this remark precise, we adapt the concept of honesty and dishonesty from the theory of Markov processes [18].

Firstly, note that (4.1) can be written as:

Ω(T˜+K)udμ=c(u),uD(T˜)+(4.4)
where c is a nonnegative (possibly zero) functional defined on D(T˜). In this paper, we shall consider only the situation when c can be written as an integral functional, that is:
c(u)=Ως(x)u(x)dμx(4.5)
for some positive measurable function ς. We do not assume that c is bounded or closed.

Definition 4.1

We say that a substochastic semigroup (SG˜(t))t0 (generated by an extension G˜ of the operator T˜+K) is honest if c is finite on D(G˜), and, for any 0uD(G˜), the solution u(t)=SG˜(t)u of (4.2) satisfies:

ddtΩu(t)dμ=ddtu(t)=c(u(t))(4.6)

Remark 4.1

The definition of honesty is not restricted to contractive semigroups and is valid even if c in (4.4) is of undetermined sign. In fact, for the original model (2.1) we shall be using this definition with a positive right-hand side in (4.6). However, for a general c, the existence part of the theory is usually not a trivial matter and this is why we prefer to present a complete theory for substochastic semigroups, and then apply it to a wider class of models that can be transformed to a substochastic case.

It can be proved that the honesty of (SG˜(t))t0, (4.6) is equivalent to its integral version: (SG˜(t))t0 is honest if and only if for any fX+ and t0:

SG˜(t)f=fc(0tSG˜(s)fds)(4.7)
Dishonesty of a semigroup is manifested both in the time domain for semigroups, and at the level of resolvents. In the time domain, we introduce the defect function: for fX+ and t0 we define it by:
ηf(t)=SG˜(t)ff+0tc(SG˜(s)f)ds(4.8)
For resolvents, we have the following important result:

Theorem 4.2

For any fixedλ>0, there is0βλX*withβλ1such that:

λR(λ,G˜)f=fβλ,fc(R(λ,G˜)f)(4.9)
Moreover, c extends to a nonnegative continuous linear functional onD(G˜), given again by (4.5).

The properties of ηf and its relation to βλ are summarized in the proposition below.

Proposition 4.1

The following holds:

  • (i) for any f X + , η f is a non-positive and a non-increasing function for t 0 ;
  • (ii)
    0eλtηf(t)dt=1λβλ,f
    hence(SG˜(t))t0is honest if and only ifβλ0for any (some) λ>0;
  • (iii) if(SG˜(t))t0is dishonest, then for somefX+and anyt>0:
    SG˜(t)f<f+0tc(SG˜(s)f)ds

An important characterization of honesty is given in the following theorem.

Theorem 4.3

The following are equivalent:

  • (a) The semigroup ( S G ˜ ( t ) ) t 0 is honest;
  • (b) G ˜ = T ˜ + K ¯ ;
  • (c) For any u R ( λ , G ˜ ) X + , where λ > 0 is arbitrary, we have:
    Ω G ˜ u d μ c ( u ) (4.10)

The problem with the characterization results given above is that they require the knowledge of the generator itself and therefore they are not immediately useful. To circumvent this problem, we shall be using certain extensions of the involved operators, that are defined below.

Define by E the set of measurable functions that are defined on Ω and take values in the extended set of real numbers and by Ef the subspace of E consisting of functions that are finite almost everywhere. E is a vector lattice with respect to the usual relation: ⩽ almost everywhere, XEfE with X and Ef being sublattices of E.

In what follows, we shall denote by T˜,K,G˜ and L˜λ extensions of the operators T˜, K, G˜ and R(λ,T˜), respectively. By L we abbreviate L1. At this moment, we shall require only that all the extensions have domains and ranges in Ef, that K,L˜ and L˜λ are positive operators on their domains and that G˜T˜+K.

We shall present here a theorem giving a sufficient condition for dishonesty in terms of these extensions.

Theorem 4.4

Assume that there exists u D ( G ˜ ) + such that

  • (i) [ L ˜ λ ( λ I T ˜ ) u ] ( x ) = u ( x ) , a.e., for some λ > 0 ,
  • (ii) for some λ > 0 , λ u ( x ) [ G ˜ u ] ( x ) = g ( x ) X + ,
  • (iii) c ( u ) is finite and
    Ω G ˜ u d μ < c ( u ) (4.11)
Then the semigroup ( S G ˜ ( t ) ) t 0 is dishonest.

5 Back to the growth–fragmentation equation

Let us look at the problem (2.1) from the point of view of the developed theory. Let us recall that we consider the operator K defined by the expression:

[Ku](x)=xp(y)k(x,y)u(y,t)dy
on the domain D(T˜). Firstly, by standard calculations, see [13 (Lemma 4.1)] we obtain that for any uD(T˜)+:
0(T˜u+Ku)xdx=0(b˜xb(x))u(x)dx0d(x)u(x)xdx(5.1)
which, due to (2.2), shows that the assumptions (A1)–(A3) of Section 4 are satisfied. Hence, there is an extension G˜ of the operator T˜+K that generates a substochastic semigroup (SG˜(t))t0. The relation of (SG˜(t))t0 and the solution to (2.1) is given in the next proposition.

Proposition 5.1

There is an extension G of T + K given by ( G , D ( G ) ) = ( G ˜ + b ˜ I , D ( G ˜ ) ) that generates a positive semigroup ( S G ( t ) ) t 0 = ( e b ˜ t S G ˜ ( t ) ) t 0 . Moreover, the generator G is characterized by:

( λ I G ) −1 f = n = 0 ( λ I T ) −1 [ K ( λ I T ) −1 ] n f (5.2)
for f X and λ > b ˜ .

Proof

The operator T˜ was constructed from T by subtracting the bounded operator b˜I. Let us consider the approximating semigroups (Sr(t))t0, mentioned in Theorem 4.1. They are generated by (Tb˜I+rK,D(T)), 0<r<1 and

limr1Sr(t)f=SG˜(t)f(5.3)
in X, uniformly in t on bounded intervals. Define semigroups (Sr(t))t0=(eb˜tSr(t))t0 generated by T+rK. As multiplication by eb˜t does not affect convergence, we see in (5.3) that (Sr(t))t0 converges strongly to the semigroup (SG(t))t0=(eb˜tSG˜(t))t0 which is generated by G=G˜+b˜I and thus is an extension of T+K, defined on the same domain as G˜, D(G)=D(G˜).

Formula (5.2) follows immediately from (4.3) by noting that since λIG=(λb˜)IG˜, we have (λIG)−1=(λIG˜)−1 for λ>b˜ and the same holds for the resolvent of T. □

Formula (5.1) for T+K takes the form:

0(Tu+Ku)xdx=0b(x)u(x)dx0d(x)u(x)xdx=:C(u)(5.4)
and, as mentioned in Remark 4.1, we shall say that (SG(t))t0 is honest if and only if:
ddt0u(t)xdx=ddtu(t)=C(u(t))(5.5)
Thus, all the results characterizing honesty and dishonesty can be applied to (SG(t))t0 with c(u) replaced by C(u). In particular, (SG(t))t0 is honest if and only if G=T+K¯, which in turn is equivalent to:
0GuxdxC(u)(5.6)
for any uR(λ,G)X+, with λ>b˜.

To proceed, we have to specify the extensions of the operators which we will be working with. Possibly the most general choice is as follows. For uD(T):={uL1([0,),xdx);bua.a.c.} we denote:

[Tu](x)=(b(x)u(x))xa(x)u(x)(5.7)
where, as before a(x)=d(x)+p(x); thus T:D(T)Ef. By K we denote the operator defined by the expression:
[Ku](x)=xp(y)k(x,y)u(y)dy(5.8)
defined on D(K)={uL1([0,),xdx);x[Ku](x)is finitea.e.}. Using these two concepts, we can define an operator that can be thought of as the maximal extension of T+K in X:
[Gu](x):=[Tu](x)+[Ku](x)(5.9)
defined on the domain D(G)={uD(T)D(K);x[Gu](x)L1([0,),xdx)}. In a similar way, we consider the operator Lλ extending R(λ,T), λ>b˜ defined by the expression:
[Lλf](x):=eλB(x)A(x)b(x)0xeλB(y)+A(y)f(y)dy(5.10)
that is considered on D(Lλ)={fE;x[Lλf](x)is finitea.e.}. Since the kernels of both K and L are nonnegative, the existence of the respective integrals is equivalent to the existence of the integrals of both the positive and negative parts of the integrands. It can be proved as in [10 (Lemma 4.1)] that GG, so that the extensions are defined correctly.

We illustrate the usefulness of the concept of extensions in the following observation.

Proposition 5.2

Any functionuD(G)is continuous on(0,).

Proof

Let first fX+ and λ>b˜. Since λIT extends to a positive integral operator Lλ on E, by (5.2) the element u¯+=(λIG)−1f=Lλg, where g=n=0[K(λIT)−1]nf, is a well-defined element of E as the series is increasing. However, as u¯+D(G)X, it must be finite almost everywhere. From (5.10) we have:

u(x)=eλB(x)A(x)b(x)0xeλB(y)+A(y)g(y)dy
and as the functions B, A and b can have zeroes or singularities only at 0 and infinity, we see that eλB(y)+A(y)g(y) is integrable over [0,N] for any N<+ and therefore u is continuous with a possible exception at x=0. If we take now arbitrary u, we see that u=u¯+u¯=(λIG)−1f+(λIG)−1f, where f+,f are the positive and negative parts of f. For f±, the corresponding g± are also positive and hence u¯± are continuous on (0,N), which yields continuity of u.  □

The following technical result can be proved as in [10 (Lemma 4.2)]

Lemma 5.1

Let K and L λ be the extensions introduced above. If for some g D ( L ) + , both g and KL λ g belong to L 1 ( [ α , N ] , x d x ) , where 0 α < N , then:

α N ( g ( x ) + [ KL λ g ] ( x ) + λ [ L λ g ] ( x ) ) x d x = α b ( α ) [ L λ g ] ( α ) α N p ( y ) [ L λ g ] ( y ) ( 0 α k ( x , y ) x d x ) d y N b ( N ) [ L λ g ] ( N ) + N p ( y ) [ L λ g ] ( y ) ( α N k ( x , y ) x d x ) d y + α N b ( x ) [ L λ g ] ( x ) d x α N d ( x ) [ L λ g ] ( x ) x d x (5.11)

A crucial rôle in the following considerations is played by the next theorem.

Theorem 5.1

If u D ( G ) , then there are sequences α k 0 + and N k as k such that:

0 [ G u ] ( x ) x d x = lim k ( α k N k p ( y ) u ( y ) ( 0 α k k ( x , y ) x d x ) d y + N k p ( y ) u ( y ) ( α k N k k ( x , y ) x d x ) d y ) + 0 b ( x ) u ( x ) d x 0 d ( x ) u ( x ) x d x (5.12)

Proof

Using a similar argument to Proposition 5.2 we see that if gE+ is such that LλgX, then gL1([α,N],xdx) for any 0<α<N<. Following [10 (Corollary 4.1)], we observe that if u=R(λ,G)f, fX+ there is gEf,+, constructed as in the proof of Proposition 5.2, such that u=Lλg and:

Gu=λLλgg+KLλg
and, as gL1([α,N],xdx), we have KLλgL1([α,N],xdx) and, by Lemma 5.1,
0[Gu](x)xdx=limk(αkb(αk)u(αk)αkNkp(y)u(y)×(0αkk(x,y)xdx)dyNkb(Nk)u(Nk)+Nkp(y)u(y)(αkNkk(x,y)xdx)dy)+0b(x)u(x)dx0xd(x)u(x)dx
for any sequences (αk)kN and (Nk)kN converging to 0 and ∞, respectively. This can be extended to arbitrary u using the decomposition of Proposition 5.2.

Since we know that uL1([0,),xdx)C(0,), we have lim infxx2|u(x)|=0. Thus, there is a sequence (Nk)kN converging to ∞ such that limkNk2|u(Nk)|=0. Similarly, we obtain a sequence (αk)kN that converges to 0 as k, such that limkαk2|u(αk)|=0. Since b(x)b˜x for x>0, we obtain the thesis.  □

Theorem 5.2

If

lim x 0 + p ( x ) + d ( x ) < + (5.13)
then G = T + K ¯ , thus ( S G ( t ) ) t 0 is honest.

Proof

As in the previous proof, it is enough to consider u=R(λ,G)f, fX+,λ>b˜; for such f we have also u=Lλg for some gE+. Since uX, by (5.10) and Tonelli's theorem, we obtain:

0(Lλg)(x)xdx=0yg(y)(eλB(y)+A(y)yyxeλB(x)A(x)b(x)dx)dy=0yg(y)ψ(y)dy
The function ψ(y) is continuous and non-negative, and the only points where it may be zero are at y=0 or as y. As y0, the integral term tends to infinity, see (3.8). Since a is bounded at 0, the other term tends to 0 by (3.3) and the l'Hospital rule gives:
limy0+ψ(y)=limy0+1b(y)y+λ+p(y)+d(y)>0
as λ>b˜ and limy0b(y)/y=b(0)b˜. Thus gL([0,N],xdx) for any N<+, and we can put α=0 in (5.11), and thus in (5.12), getting:
0[Gu](x)xdx=limN+(Np(y)u(y)(0Nk(x,y)xdx)dy)+0b(x)u(x)dx0xd(x)u(x)dxC(u)
so that (5.6) is obviously satisfied.  □

The theorem on dishonesty below is intended primarily as an example so that the regularity assumptions on the coefficients are not optimal. We shall also put d0 as adding or subtracting a bounded operator does not change the domain of the generator; hence ap. Moreover, we restrict our attention to k given by (2.6): k(x,y)=y−1h(x/y) and satisfying:

01zh(z)lnzdz<+(5.14)

Theorem 5.3

Assume that b C 1 ( [ 0 , ) ) with inf 0 x < b ( x ) > ,

1 x p ( x ) L 1 ( [ 0 , η ] ) , 1 x k p ( x ) L 1 ( [ N , ) ) (5.15)
for some η , N , k > 0 , p C 1 ( ( 0 , ) ) , p > 0 on ( 0 , ) and:
sup x [ 0 , ) | x p ( x ) p ( x ) | = L < + (5.16)
Then ( S G ( t ) ) t 0 is dishonest.

Proof

To simplify notation, we put η=1. We use Theorem 4.4 so that we work with the operator extensions introduced at the beginning of this section and construct uD(G)+ satisfying the assumptions of this theorem. Let us define:

u(x)={1x2p(x)for0<x<11x2+mp(x)forx1(5.17)
where m>0 and m+1k, see (5.15). Clearly uX and it is continuous on (0,). Moreover, puL1([N,),xdx) for any N>0, and therefore we can pass to the limit with N in the integral terms on the right-hand side of (5.11) (taking into account that αNk(x,y)xdx=αyk(x,y)xdxy). Thanks to the continuity, we can repeat the argument of Theorem 5.1 getting:
0[Gu](x)xdx=limkαkp(y)u(y)(0αkk(x,y)xdx)dy+0b(x)u(x)dx(5.18)
for some (αk)kN converging to zero, where we used the estimate (2.2) to pass to the limit in the last term.

Consider first the interval (0,1] where we have u(x)=1/x2a(x). Using k(x,y)=h(x/y)/y, we have:

α1(0αk(x,y)xdx)1y2dy=α1(0rzh(z)dz)1rdr
and since 01(0rzh(z)dz)1rdr=01zh(z)lnzdz, the Tonelli's theorem gives:
limα0+α1(0αk(x,y)xdx)a(y)u(y)dy=01zh(z)lnzdz<0
Furthermore, the integral:
1p(y)u(y)(0αk(x,y)xdx)dy
converges to zero as puL1([1,)) and 0αk(x,y)xdxy, by Lebesgue's dominated convergence theorem. Thus, (5.18) shows that assumption (iii) of Theorem 4.4 is satisfied. Let us turn our attention to assumption (ii). Let us write:
(λu(x)+(b(x)u(x)))+(p(x)u(x)xp(y)h(xy)y−1u(y)dy)=I1+I2
Consider first the interval (0,1]. We have:
I1=1x2p(x)(λ+b(x)2b(x)xb(x)xxp(x)p(x))(5.19)
and by assumption all the terms within the brackets are bounded on [0,1] so that I1>0 for sufficiently large λ. Moreover, I1L1([0,1],xdx) by (5.15). Furthermore, (2.4) in our case reduces to 01zh(z)dz=1 so that:
1x2=1x201zh(z)dz=x1y3h(xy)dyx11y3h(xy)dy+11y3+mh(xy)dy
for m0. Hence
01x2x11y3h(xy)dyx1y3+mh(xy)dy=I21x2x11y3h(xy)dy=1x20xzh(z)dz
which is integrable on [0,1] with respect to xdx by (5.14).

For x[1,) we have similarly to (5.19)

I1=1x2+mp(x)(λ+b(x)(2+m)b(x)xb(x)xxp(x)p(x))
which is positive and integrable on [1,) with respect to xdx, possibly with larger λ. For I2 we have:
I2=1x2+mx1y3+mh(xy)dy=1x2+m1x2+m01z1+mh(z)dz1x2+m(101zh(z)dz)=0
and clearly, as m>0,
0I21x2+m(101z1+mh(z)dz)L1([1,),xdx)
It remains to prove (i). Integrating by parts, we get:
[Lλ((bu))](x)=eλB(x)A(x)b(x)0xeλB(y)+A(y)(b(y)u(y))dy=u(x)eλB(x)A(x)b(x)limy0+b(y)eλB(y)+A(y)u(y)eλB(x)A(x)b(x)0xeλB(y)+A(y)×(λ+p(y))u(y)dy
Since close to zero eλB(x)+A(x)xλ/b˜, with λ>b˜, and both (bu) and (λ+p)u behave as 1/x2p(x) and 1/x2, respectively, we see that both integrals, and hence the limit, exist. Since 1/xp(x) is integrable and differentiable except at 0, we can prove as in Theorem 5.1 that there is a sequence (xn)nN converging to zero such that 1/p(xn)0. Hence, using this sequence we have:
b(xn)eλB(xn)+A(xn)u(xn)b˜xnxnλb˜xn2p(xn)=b˜xnλb˜11p(xn)0
and thus u satisfies assumption (i). □

Acknowledgment

The paper was prepared while the author visited the Department of Mathematics of the University of Franche-Comté in Besançon, France, as an invited professor. The warm hospitality of Prof. Mustapha Mokhtar-Kharroubi and many stimulating discussions with him are greatly appreciated. The visit was partially supported by the National Research Foundation of South Africa under GUN 2053716.


Bibliographie

[1] O. Arino; R. Rudnicki Stability of phytoplankton dynamics, C. R. Biologies, Volume 327 (2004)

[2] H.E. Dam; D.T. Drapeau Coagulation efficiency, organic-matter glues and the dynamics of particle during a phytoplankton bloom in a mesocosm study, Deep-Sea Res. II, Volume 42 (1995) no. 1, pp. 111-123

[3] G.A. Jackson A model of the formation of marine algal flocks by physical coagulation processes, Deep-Sea Res., Volume 37 (1990), pp. 1197-1211

[4] I. Jeon Stochastic fragmentation and some sufficient conditions for shattering transition, J. Korean Math. Soc., Volume 39 (2002) no. 4, pp. 543-558

[5] U. Passow; A.L. Alldredge Aggregation of a diatom bloom in a mesocosm: The role of transparent exopolymer particles (TEP), Deep-Sea Res. II, Volume 42 (1995) no. 1, pp. 99-109

[6] B.F. Edwards; M. Cai; H. Han Rate equation and scaling for fragmentation with mass loss, Phys. Rev. A, Volume 41 (1990), pp. 5755-5757

[7] I. Filippov On the distribution of the sizes of particles which undergo splitting, Theory Probab. Appl., Volume 6 (1961), pp. 275-293

[8] J. Huang; B.E. Edwards; A.D. Levine General solutions and scaling violation for fragmentation with mass loss, J. Phys. A: Math. Gen., Volume 24 (1991), pp. 3967-3977

[9] E.D. McGrady; R.M. Ziff ‘Shattering’ transition in fragmentation, Phys. Rev. Lett., Volume 58 (1987) no. 9, pp. 892-895

[10] L. Arlotti; J. Banasiak Strictly substochastic semigroups with application to conservative and shattering solutions to fragmentation equations with mass-loss, J. Math. Anal. Appl., Volume 293 (2004), pp. 693-720

[11] J. Banasiak On an extension of Kato–Voigt perturbation theorem for substochastic semigroups and its applications, Taiw. J. Math., Volume 5 (2001) no. 1, pp. 169-191

[12] J. Banasiak On a non-uniqueness in fragmentation models, Math. Methods Appl. Sci., Volume 25 (2002), pp. 541-556

[13] J. Banasiak; W. Lamb On the application of substochastic semigroup theory to fragmentation models with mass loss, J. Math. Anal. Appl., Volume 284 (2003) no. 1, pp. 9-30

[14] J. Banasiak Conservative and shattering solutions for some classes of fragmentation equations, Math. Models Methods Appl. Sci., Volume 14 (2004) no. 4, pp. 483-501

[15] L. Arlotti A perturbation theorem for positive contraction semigroups on L1-spaces with applications to transport equations and Kolmogorov's differential equations, Acta Appl. Math., Volume 23 (1991), pp. 129-144

[16] G. Frosali; C. van der Mee; F. Mugelli A characterization theorem for the evolution semigroup generated by the sum of two unbounded operators, Math. Methods Appl. Sci., Volume 27 (2004) no. 6, pp. 669-685

[17] J. Voigt On substochastic C0-semigroups and their generators, Transp. Theory Stat. Phys., Volume 16 (1987) no. 4–6, pp. 453-466

[18] W.J. Anderson Continuous-Time Markov Chains. An Application-Oriented Approach, Springer Verlag, New York, 1991


Commentaires - Politique