From delayed minimization to the harmonic map heat equation
Vuk Milisic

TL;DR
This paper rigorously proves the convergence of a microscopic adhesion model with delays to a macroscopic harmonic map heat equation, extending gradient flow techniques to handle delay terms and non-linear constraints.
Contribution
It introduces a novel mathematical framework extending gradient flow methods to delayed, constrained systems in cell motility modeling.
Findings
Proved convergence from microscopic adhesion dynamics to a harmonic map heat equation.
Extended gradient flow techniques to include delay terms in the energy functional.
Demonstrated convergence under weaker hypotheses despite the lack of traditional stability estimates.
Abstract
In the context of cell motility modelling and more particularly related to the Filament Based Lamelipodium Model [Manhart et al 2015 & 2017], this work deals with a rigorous mathematical proof of convergence between solutions of two problems : we start from a microscopic description of adhesions using a delayed and constrained vector valued equation with spacial diffusion and show the convergence towards the corresponding friction limit. The convergence is performed with respect to the bond characteristic lifetime whose inverse is also proportional to the stifness of the bonds. The originality of this work is the extension of gradient flow techniques to our setting. Namely, the discrete finite difference term in the gradient flow energy is here replaced by a delay term which complicates greatly the mathematical analysis. Contrarily to the standard approach [Oelz SeMa…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
\NewEnviron
thmm
Theorem 1. \BODY \NewEnviron
lemm
Lemma 1. \BODY \NewEnviron
propm
Proposition 1. \BODY \NewEnviron
defim
Definition 1. \BODY \NewEnviron
assum
Assumptions 1. \BODY \NewEnviron
rmkm
Remark 1. \BODY \NewEnviron
corom
Corollary 1. \BODY
From delayed and constrained minimizing movements
to the harmonic map heat equation
Vuk Milišić Laboratoire Analyse, Géométrie & Applications (LAGA), Université Paris 13, FRANCE ([email protected]), Draft version of .
Abstract
In the context of cell motility modelling and more particularly related to the Filament Based Lamelipodium Model [18, 10, 11], this work deals with a rigorous mathematical proof of convergence between solutions of two problems : we start from a microscopic description of adhesions using a delayed and constrained vector valued equation with spacial diffusion and show the convergence towards the corresponding friction limit. The convergence is performed with respect to the bond characteristic lifetime whose inverse is also proportional to the stifness of the bonds. The originality of this work is the extension of gradient flow techniques to our setting. Namely, the discrete finite difference term in the gradient flow energy is here replaced by a delay term which complicates greatly the mathematical analysis. Contrarily to the standard approach [2, 19], compactness in time is not provided by the energy minimization process : a series of past times are taken into account in our discrete energy. A supplementary equation on the time derivative is obtained requiring uniform estimate with respect to of the Lagrange multiplier and provides compactness. Due to the non-linearity induced by the constraint, a specific stability estimate useful in our previous works, is not at hand here. Numerical simulations even showed that this estimate does not hold. Nevertheless, transposing our delay operator, we succeed in proving convergence under slightly weaker hypotheses. The result relies on a careful initial layer analysis, extending [15] to the space dependent setting.
keywords:
integral equations, memory effects, cell motility, parabolic equations, non-linear pointwise constraint, adhesion, gradient flow, Lagrange multiplier, harmonic map
\ccode
35Q92
1 Introduction
Cell motility is at heart of important biological/medical concerns (cancer metastasis, wound healing, etc.) [3]. Among models describing spontaneous motion of cells, two types appear : those who heuristically mimic macroscopic features and models based on a microscopic description that are in some sense homogenized. The Filament Based Lamelipodium Model (FBLM) [18] belongs to the second category and has reached a certain level of maturity [10, 11].
Adhesion mechanisms are some of the pillars of the FBLM and appear as friction terms. In the pioneering paper [18], they are obtained as formal limits of memory terms inside the Euler-Lagrange equations associated to a minimization process. This limit is interpreted as quasi-instantaneous with respect to a dimensionless parameter . Our work deals with the rigorous mathematical justification of this asymptotic.
Previously, we introduced simplifications that allowed to fully understand, from the mathematical point of view, either the delay model, for fixed , or its convergence when tends to zero [12, 13, 14, 16]. More specifically in [12] and [13], we studied adhesions of a single point submitted to an external force and proved convergence. In [14] we proved that a non-linear fully coupled model could either have global solutions or, if the external load exceeds the microscopic adhesion capacity, blow-up could occur. More recently [16], we extended these results adding space dependent adhesion and diffusion.
In the previous works, Euler-Lagrange equations were considered and in some cases [16] this is equivalent to the minimization of a convex energy. Here we consider the minimization process for which the energy functional contains adhesion terms and the Dirichlet energy. But it is set pointwisely on the sphere almost everywhere, leading to a non-linear saddle point problem at the Euler-Lagrange level. The mathematical tools previously introduced extend only very partially to this new problem.
Gradient flow techniques provide existence of solutions for complicated possibly non-linear energies complemented with a finite difference term in time [2, 8]. Here the delay term in the energy could be considered as a generalization of such a finite difference. Except that it provides neither existence of solutions nor compactness in time. Thus we are forced to discretize the energy with respect to time and age. Here the age accounts for the delay. First, we obtain new energy estimates similar to the minimization principle in gradient flow theory (cf. Lemma 3.10), but there is then an extra amount of work in order to prove compactness i.e. boundedness of the time derivative in an appropriate space (cf. Proposition 3.20). This estimate is made possible thanks to a closed equation obtained for the discrete time derivative of the position. This equation appears when taking finite differences with respect to time of the Euler-Lagrange equations of the minimization process. In [16], another estimate of the elongation provided extra compactness useful in the asymptotic of the variational formulation that is not at hand here. The reason will be made more precise below. Thus, we were forced to transpose the delay term in the Euler-Lagrange equations on the test function and the density of population of bonds . This latter unknown is singular : is a measure that converges, when goes to zero, to , the time derivative of the population of linkages and to a Dirac mass located near the origin in time for all ages. Since the problem is here space dependent, these results extend and complete the initial layer analysis performed in [15].
To be more specific, we denote by . The vector position in of the moving binding site, , minimizes at each time an energy functional :
[TABLE]
where the minimization is performed on the set
[TABLE]
The energy is defined for every as
[TABLE]
Past positions are given by the function for . The age distribution is the solution of the structured model :
[TABLE]
where and the on-rate of bonds is a given function times a factor, that takes into account saturation of the moving binding site with linkages. When the off-rate is a prescribed function, we say that the problem is weakly coupled : first one exhibits solving (3) which then becomes the weight in (2).
First, we discretize in time and age the minimization process (1) and the age structured system (3). For the transport problem (3) we use the upwind scheme inside the domain, an implicit discretization of the off-rates, the non-local term is discretized using a piecewise constant approximation. This step provides, as in the gradient flow case (see for instance minimizing movements chap. 2 [2]), existence of a discrete pair of solutions . Then thanks to compactness arguments, we pass to the limit with respect to the discretization parameter , and prove that there exists a unique couple . The bond population density solves (3), whereas satisfies, almost everywhere in , the weak formulation associated to the Euler-Lagrange equation :
[TABLE]
where and is the Lagrange multiplier associated to the constraint . We prove that when goes to zero, the solutions of the previous minimization problem converge to . These solve the limit problems reading :
- •
Find being the weak solution of the problem
[TABLE]
The convergence of towards holds strongly in .
- •
The function represents the moment of order of which solves in
[TABLE]
The solution converges to in strong.
The article is structured as follows. In Section 2, we list the hypotheses used throughout the paper and set notations. In Section 3, we detail the discrete minimization process in age and time providing the piecewise solutions . In the same section, we provide stability estimates in the appropriate functional spaces. We underline that most of the results obtained therein are uniform with respect to and the discretisation step : the same properties can be extended to the continuous model for fixed . This leads to study first this latter limit for fixed and going to 0. This is done in Section 4. Then when tends to zero, we prove, in Section 5, that indeed convergence occurs towards the limit heat harmonic map equation (5) . As converges weakly in and converges strongly in , it is not possible to obtain directly the convergence of the delay term towards . Instead, as mentioned above, we transpose the delay operator on a test function and on , and then we pass to the limit with respect to .
2 Notations and hypotheses
We set and . As stated in the introduction we consider a one dimensional space domain . We set as well .
We define to be the Banach space of continuous functions in age and time whose norm in space goes to zero when goes to infinity. We endow with the norm :
[TABLE]
is a Banach space [20]. It is also a closed subspace of which is a non-separable Banach space. We define which is also a Banach space endowed with the corresponding norm :
[TABLE]
We denote the discrete differences as
[TABLE]
and we define the space of Banach valued functions
[TABLE]
and one endows with the norm :
[TABLE]
If the same space is set on a time interval then the notation is well understood. In the rest of the paper we abbreviate the notation of function spaces writing the subscripts for function spaces on and the subscript for function spaces on , for instance denotes .
One should notice that is in fact the space of functions of bounded variation with values in a Banach space . The generic space is presented and studied in a very detailed way in [7], where is the dual space of a Banach space . Since is the dual space of we are exactly in this framework. The semi norms with the discrete derivatives coincide with the total variation of the -valued Radon measures corresponding to the time/age derivative *i.e. *
[TABLE]
where the brackets denote the duality in the space variable. The proof of this equivalence can be found in [6] p. 12 in the proof of Theorem 1.7.1 and is easily extendable to the Banach valued case presented in [7].
Assumptions 2.1
The dimensionless parameter is assumed to induce two families of chemical rate functions that satisfy:
- (i)
For every , the function belongs to and the off-rate is s.t. moreover itr holds that
[TABLE]
as . 2. (ii)
We also assume that there are upper and lower bounds such that
[TABLE]
for all , , and .
The initial data for the density model (3) satisfies some hypotheses that we sum up here.
Assumptions 2.2
The initial condition satisfies
- •
positivity and boundedness : there exists , s.t.
[TABLE]
moreover, one has also that the total initial population satisfies
[TABLE]
for almost every .
- •
boundedness from below of the zero order moment,
[TABLE]
- •
initial integrability with respect to the limit problem :
[TABLE]
- •
the derivative with respect to age satisfies as well :
[TABLE]
Concerning the minimization problem (1), we assume
Assumptions 2.3
The past data satisfies :
- i)
for every time , we assume that is in , 2. ii)
there exists a Lipschitz constant which is in space s.t. :
[TABLE]
for a.e. where .
3 Existence of minimizers and a priori estimates : the discrete scheme
We discretize both (3) and the minimization process (1) in time and age, but not in space. We set a small parameter denoting the age discretization step, while the time step satisfies the CFL condition . This provides , the number of times steps. We solve :
- •
for the model, we use a first order upwind scheme and treat the source term implicitly, so we define inside the mesh
[TABLE]
while on the boundary we set
[TABLE]
where
[TABLE]
This definition provides explicitly ,
[TABLE]
The initial condition is defined as
[TABLE]
The zero order moment can be expressed in an inductive way :
[TABLE]
We define a piecewise constant function
[TABLE]
- •
whereas the minimization process is performed for each
[TABLE]
where the discrete energy functional reads :
[TABLE]
for all and for all , , and we set for every . We define the piecewise constant function
[TABLE]
The piecewise linear extension reads :
[TABLE]
where , while in what follows we denote as well an so on.
3.1 Positivity and convergence of the discrete solution
From Lemma 3.1 to Theorem 3.8, we extend results from previous works [12, 16, 15] to the discrete case. When needed, we characterize also some properties of , the continuous solution of (3).
Lemma 3.1**.**
For almost every , under the CFL condition , under hypotheses 2.1, if and then
[TABLE]
Moreover if there exists a constant , then for every ,
Proof 3.2**.**
The first result is proved by induction : by hypothesis, the claim is true for . We assume that for , and . Since for , it is straightforward that for all . Thanks to (10), one writes :
[TABLE]
which gives :
[TABLE]
which rearranging terms on both sides provides
[TABLE]
This shows that since the coefficient in front of is always positive definite. In turn one concludes that .
We prove the last claim by induction, under the hypothesis on , the claim is true for . We suppose that the claim is true for . Using (10) gives
[TABLE]
where the latter inequality holds since . Because the right hand side is strictly positive, so is the left hand side. This shows the statement for , and the recursion is complete.
Using the same Lyapunov functional , as in [12, 16], one proves that
Proposition 3.3**.**
Under hypotheses 2.1 and 2.2, there exists a unique solution , solving (3). Moreover :
[TABLE]
where the constant is independent of and on .
Proof 3.4**.**
For the existence and uniqueness part, one proceeds as in Theorem 3.1 in [16] : as is a mute parameter, for a.e. , there exists a solution . Then using Duhamel’s formula in order to commute the supremum with respect to with the integrals, one obtains the result in . Combining results from the proof of Lemma 5.1. p. 16 [16] and from Theorem 3.2 [15], one gets :
[TABLE]
Indeed, again, since is only a mute parameter, one obtains easily that
[TABLE]
which then integrated in time and taking the ess-sup on proves this first step. Then we use the method of characteristics and write :
[TABLE]
where . Now we define . One has
[TABLE]
then
[TABLE]
For the term , one has which gives
[TABLE]
so that
[TABLE]
These two estimates guarantee that In a similar way one writes that
[TABLE]
the latter term being under control, we focus on the first one, that we denote .
[TABLE]
Since is bounded uniformly in space and with respect to , the first term is smaller than . Then using the method of characteristics, one splits in two parts :
[TABLE]
This shows that which ends the proof.
Then using standard a priori estimates provides in a similar manner as in the previous proof :
Proposition 3.5**.**
Under the previous hypotheses, one has as well that
[TABLE]
where the constant is uniform with respect to . This result together with the previous proposition shows that uniformly with respect to .
One defines , and one sets
[TABLE]
where is the exact solution of (3) and
[TABLE]
in the same way one defines , and so on. With these notations, we compute error estimates for the upwind scheme :
Lemma 3.6**.**
Under the same hypotheses as above, if solves (3), and is its piecewise constant approximation computed using the upwind scheme (8) with the non-local boundary term (9), then one has
[TABLE]
Proof 3.7**.**
Using the method of characteristics one gets :
[TABLE]
for all . In a similar fashion one derives for
[TABLE]
while if ,
[TABLE]
Setting , the previous estimates give for
[TABLE]
and
[TABLE]
where and by definition . Combining these estimates leads to
[TABLE]
which gives the first result. Using similar arguments as in Lemma B.5, one can show that
[TABLE]
which gives the second result.
Theorem 3.8**.**
Under hypotheses 2.1 and 2.2, one has
[TABLE]
strongly in when goes to zero for fixed.
3.2 Existence, uniqueness and stability of the discrete solution
Existence of minimizers relies on the convexity of the Dirichlet norm and is standard as the few properties listed below (see for instance Lemma 1 and 2, p. 973 [17]).
Theorem 3.9**.**
Under hypotheses 2.1, 2.2, 2.3, for every there exists a minimizer of (11), i.e. there exists a minimizing subsequence s.t. as ,
* weak in ,* 2. 2)
* strong in ,* 3. 3)
* a.e. ,* 4. 4)
* and thus .*
A way to insure convergence, when or go to zero, is to obtain some control on a discrete time derivative of , typically an -bound is obtained in the case of a classical gradient flow directly from the minimization principle (cf Appendix in [19] and references therein). Here the result is less immediate : first, in the next lemma, we obtain a dissipation term in the energy estimates. These estimates provide a uniform bound on the dissipation term. It then appears as a source term in a closed equation (15), on that finally provides these key estimates (cf. Proposition 3.20).
Lemma 3.10**.**
If and , are defined as above, one has :
[TABLE]
where the dissipation term reads :
[TABLE]
and we denote by the discrete elongation variable for . The generic constant in (12) is independent either of or .
Proof 3.11**.**
By definition of the minimization process, one has
[TABLE]
since minimises the energy at time step . This reads
[TABLE]
Changing the indices in the first summation of the latter right hand side provides
[TABLE]
for all . In the last estimates we used the convexity of the square function, writing
[TABLE]
where , while for , one has simply . For , one has simply that
[TABLE]
Using (7), one has that for almost every and
[TABLE]
Moreover one notices that for . Together these facts allow to give a bound on uniform with respect to and :
[TABLE]
For a.e. , we denote by
Lemma 3.12**.**
For every time , solves :
[TABLE]
for all , and , is a function.
Proof 3.13**.**
We take , and set
[TABLE]
because for a small enough is strictly positive and bounded, thus on this interval . As minimizes , admits a minimum in . This leads to , as , this gives
[TABLE]
where the parentheses denote the scalar product and the identity matrix in . As for almost every , the previous expression transforms into
[TABLE]
for all . Denoting , it is a Lagrange multiplier associated to the constraint. Thanks to Theorem 3.9 and Lemma 3.10, . Thus, (14) together with the constraint is the Euler-Lagrange system associated to the discrete minimization problem (11).
Proposition 3.14**.**
Under the previous hypotheses, one has the estimate
[TABLE]
where the constant is uniformly bounded with respect to , and .
Proof 3.15**.**
As uniformly in , it is already clear that belongs to . It remains to estimate . Since for all (this statement uses the first assumption in hypotheses 2.3, in the case when ), a simple computation gives that, for every ,
[TABLE]
This in turn suggests that
[TABLE]
By Lemma 3.10, the first term is bounded for any . Thanks to the definition of , the claim follows.
Remark 3.16**.**
Proposition 3.14 shows as well that the energy minimization procedure provides a bound, uniform in , on the Lagrange multiplier . Direct use of the energy estimates from Lemma 3.10 and Jensen’s inequality give which provides only
[TABLE]
Remark 3.17**.**
The previous result shows that the delay operator points out of the unit sphere since by convexity of the square function, for a.e. . In the next proposition, we show that the scalar product is of order with respect to the norm, which makes sense. Indeed, when is small, approximates which is tangent to the sphere, and thus orthogonal to .
Proposition 3.18**.**
Under hypotheses 2.1, 2.2 and 2.3, one can also show that
[TABLE]
where the constant does not depend on .
Proof 3.19**.**
Using again the same idea as in the previous proof, one writes :
[TABLE]
the latter estimate coming from the dissipation term in the proof of Lemma 3.10.
Here we show one of the key estimates of the paper.
Proposition 3.20**.**
Under hypotheses above, and for small enough, one has :
[TABLE]
where the constant does not depend neither on nor on .
Proof 3.21**.**
Recalling the definition of one checks easily that
[TABLE]
while . Equivalently, because of the specific CFL condition, for all . Setting for , one obtains using (8) :
[TABLE]
which, summing over , gives
[TABLE]
By definition,
[TABLE]
Adding both equations gives :
[TABLE]
since . Now we make the discrete difference of (14) between steps and , in order to express as a function of . This reads :
[TABLE]
We now close the problem solved by :
[TABLE]
We rewrite the difference
[TABLE]
Applying to and using that both and satisfy the constraint, reduces to :
[TABLE]
cancelling the term containing the finite differences . Next we use the crucial estimates from Proposition 3.14, indeed :
[TABLE]
In one space dimension, the Gagliardo-Nirenberg estimates (cf. [1], p. 140, Theorem 5.9) provide
[TABLE]
Thus setting in the weak formulation above and because there is an in front of in (15) one writes finally :
[TABLE]
Using Young’s inequality on the right hand side above, for small enough, one has :
[TABLE]
The previous argument provides uniqueness as well :
Proposition 3.22**.**
Under hypotheses 2.1, 2.2 and 2.3, there exists a unique solution solving (14).
Proof 3.23**.**
We use induction arguments to show the claim. We suppose that there exists two solutions for . We denote by , and we write the equation it satisfies for :
[TABLE]
Thus choosing and using the same arguments as above implies that . We suppose at this point that for . Then a careful decomposition of leads to
[TABLE]
which again, thanks to the lower bound established in Lemma (3.1), shows that
[TABLE]
proving the claim for small enough and . This ends the proof since .
Proposition 3.24**.**
Under hypotheses 2.1, 2.2 and 2.3, , the piecewise linear interpolation of satisfies
[TABLE]
for every , the bound is uniform with respect to and . Thus converges strongly in when goes to zero. Moreover, converges strongly in .
Proof 3.25**.**
Thanks to Lemma 3.10, belongs to uniformly with respect to , which shows weak- convergence in this space. Weak convergence in follows from Proposition 3.20. The interpolation inequality
[TABLE]
holds for every and for every . Combined with the bound provided by Lemma 3.10, this leads to :
[TABLE]
We complete the convergence proof for by an application of the Ascoli-Arzela theorem.
Corollary 3.26**.**
Under the previous hypotheses, the same result can be derived for , i.e.
[TABLE]
for every , the bound is uniform with respect to . This implies that converges to strongly in when goes to zero.
Proof 3.27**.**
Considering , the piecewise continuous function in time, is bounded in uniformly with respect to , thus weakly in and one has that
[TABLE]
A similar argument provides an bound for . One can then follow again the same steps as in the proof of Proposition 3.24.
4 Convergence when is fixed and goes to 0.
Next, we consider the convergence of .
Proposition 4.1**.**
Under hypotheses 2.1, 2.2 and 2.3, for every fixed , the discrete delay term converges to the continuous limit when goes to zero, i.e.
[TABLE]
for all and where .
Proof 4.2**.**
In what follows the terms that we handle are integrable on the domain so the systematic use of Fubini’s Theorem is implicitly assumed and we freely commute integrals with respect to space, age and time. We set that we split in two parts :
[TABLE]
By Lemma 3.1, is uniformly bounded with respect to , and , in the weak- topology in . Moreover since is a separable space, the step functions in time with values in are dense. Thus tends to strongly in and the product converges strongly in . All this gives :
[TABLE]
For the second term, one first defines
[TABLE]
and then one has :
[TABLE]
We consider the convergence of the term on :
[TABLE]
and thus in a similar manner, as for , one proves the convergence of . On the other hand, on , one has that :
[TABLE]
A simple computation shows that if then
[TABLE]
which gives then that
[TABLE]
In a similar way, one proves, thanks to hypotheses 2.3, that
[TABLE]
For the last part, on , one has that :
[TABLE]
which proves that
[TABLE]
and ends the proof.
Theorem 4.3**.**
Under hypotheses above, there exists a unique solving, for almost every ,
[TABLE]
*where the brackets denote the scalar product and the Lagrange multiplier is an function uniformly with respect to . Moreover, for every , . *
Proof 4.4**.**
By Proposition 4.1, the convergence of is proved. Since uniformly with respect to and , one has
[TABLE]
where again and where . Since is the dual space of which is separable, the bounded sets in are compact for the weak- topology , we denote by , the duality brackets associated to this dual paring. Defining to be
[TABLE]
The first term tends to zero thanks to the density of valued step functions in , the second term is small due to the strong convergence of established above, the last one tends to zero thanks to the weak- convergence of in . At that point, the solution pair solves :
[TABLE]
for every . Setting with , in (17), proves that for almost every , and the right hand side is a function.
Taking now for any and shows that (16) holds a.e. for any .
An easy computation shows that
[TABLE]
which gives that
[TABLE]
thanks to Proposition 3.20. Then a triangular inequality gives :
[TABLE]
As the right hand side is arbitrary small, the left hand side is zero. Thus the constraint is fulfilled a.e. in . Thanks to Corollary 3.26, is a continuous function in time and in space, so the result holds true everywhere in .
In order to prove uniqueness we assume that there exists two distinct solutions sharing the same condition for negative times, the same kernel and both solving (16) for a.e. . We denote by and it solves :
[TABLE]
Setting one obtains thanks to the same Gagliardo-Niremberg estimates as in Proposition 3.20 that
[TABLE]
Making the first term in the left hand side above explicit one writes :
[TABLE]
In the above equality this contributes to obtain :
[TABLE]
since the second term in the left hand side is positive we omit it, setting and using that , for a.e. and , one obtains that satisfies :
[TABLE]
which after some easy computations provide that which in turn gives that and since is positive by definition this gives that for a.e. , which shows uniqueness.
Proposition 4.5**.**
Under the previous hypotheses, one has
[TABLE]
where the constant is independent of .
Proof 4.6**.**
Using the same arguments as in Proposition 4.1, one shows that tends to in as . Then using the estimate established in Proposition 3.18, one concludes.
5 Convergence when goes to zero in the continuous framework
5.1 Convergence of the population of bonds
For sake of conciseness we recall here the main result of Section 5.1 [16] in which the convergence of towards solving (6) is fully established.
Theorem 5.1**.**
Under assumptions 2.1 and 2.2, one has
[TABLE]
with and . These estimates imply converges strongly in which give strong convergence in when goes to zero.
5.2 Study of the initial layer and convergence of continuous and descrete time derivative of
Here we perform a preliminary analysis in order to obtain limits when goes to zero of the transposition of the delay operator. For this sake we introduce the initial layer and show to what limit converges in a second step (cf Theorem 5.15). Finally we exhibit the limit to which the delayed part transfered on of i.e. tends as a Banach valued Radon measure (cf Proposition 5.22).
Proposition 5.2**.**
If is in then its weak derivatives and are in . One defines the corresponding duality brackets as
[TABLE]
for any .
Proposition 5.3**.**
If is in then its weak derivatives and are in . One defines the corresponding duality brackets as
[TABLE]
for any .
For sake of conciseness, the proofs of these propositions are postponed in B. Using then these one shows :
Proposition 5.4**.**
Under hypotheses 2.1 and 2.2, the previous convergence result can be extended to where . Namely for any in , there exists a subsequence s.t.
[TABLE]
when .
In order to identify the limit to which tends when goes to zero, (part of the main ingredients were presented in Proposition 3.2 p. 10, [15], but the space variable was not taken in account), we define an initial layer, as in [15]. Setting , we look for solution of
[TABLE]
and we define . As in [15], we obtain at the microscopic level global existence and a priori bounds :
Theorem 5.5**.**
Under hypotheses 2.1 and 2.2, there exists a unique solution belonging to . Moreover, one has
[TABLE]
[TABLE]
and there exists a subsequence s.t. weak- in the topology.
Proof 5.6**.**
The proof of the existence and uniqueness part is easy and follows the same ideas as in [12, 15] where one shall only manage the dependence in addition. A priori estimates on are obtained as in Theorem 2.2 p. 6 [15]. The last part follows the same ideas as in Propositions 5.2 and 5.3 below.
Corollary 5.7**.**
Under the same hypotheses, one has the scaling
[TABLE]
Proof 5.8**.**
We start from the change of variable , which gives
[TABLE]
where , then the right hand side (resp. left hand side) converges up to a subsequence to the right hand side (resp. left hand side) of the claim by the same arguments as in Propositions 5.2 and 5.3.
Theorem 5.9**.**
Under hypotheses 2.1 and 2.2, one has for any ,
[TABLE]
and we underline that here does not depend on time.
Proof 5.10**.**
Using a priori estimates (20), one has
[TABLE]
where we recall that . This shows that is a function of bounded variation. Thus there exists a signed Radon measure associated to the time derivative of .
[TABLE]
Indeed, the integral coincides with the Riemann-Stieltjes integral, thus integration by parts holds. Moreover one has that
[TABLE]
as (up to a subsequence) goes to zero. On the other hand
[TABLE]
in the weak- topology (as in the proof of Proposition 5.3). Because
[TABLE]
and the arguments above, one has finally :
[TABLE]
One concludes since thanks to (19).
Proposition 5.11**.**
Under assumptions 2.1 and 2.2, one has
[TABLE]
which implies that :
[TABLE]
for all .
Proof 5.12**.**
As is a mute variable in the model, we first establish that :
[TABLE]
using exactly the same arguments as in Proposition 3.2 p.10 [15]. The method of characteristics gives, under the hypotheses above :
[TABLE]
as the bounds do not depend on , the first claim follows. One writes then in the duality pairing, that
[TABLE]
Thanks to the first statement above, for any fixed and any fixed , there exists s.t. implies
[TABLE]
By Proposition 5.3, there exists s.t. implies
[TABLE]
which ends the proof.
Proposition 5.13**.**
Under the same hypotheses, there is a limit related to the initial layer : for any ,
[TABLE]
Proof 5.14**.**
We set , and we use Corollary 5.7, giving that
[TABLE]
Next we write :
[TABLE]
We start with and write :
[TABLE]
Since is a positive function in , there exists a weak- limit in of the measure associated to it. Because is tight with respect to , this convergence extends to the weak- topology in .
Since is a continuous bounded function on , converging pointwisely to 0 a.e. , there exists s.t. for ,
[TABLE]
From here until the end of the proof, is fixed. Thanks to the previous tight convergence result, there exists a , s.t.
[TABLE]
and finally there exists s.t. implies
[TABLE]
thanks to the weak- convergence in topology . Summing the three terms ends the proof.
Theorem 5.15**.**
Under hypotheses 2.1 and 2.2, one has
[TABLE]
for every .
Proof 5.16**.**
We set
[TABLE]
and split this difference adding and subtracting extra terms :
[TABLE]
Now for every fixed (small), there exists s.t. implies thanks to Proposition 5.11, s.t. thanks to Proposition 5.13, and s.t. thanks to Theorem 5.9, which ends the proof.
We define
[TABLE]
where .
Theorem 5.17**.**
Under hypotheses 2.1 and 2.2, solves the weak problem : for all
[TABLE]
where we set
[TABLE]
Proof 5.18**.**
In order to express the problem solved by , we regularize the data. It gives a pointwise meaning to an approximation of . For this sake, we regularize the boundary datum and the off-rate setting :
[TABLE]
where the cut-off function is monotone and s.t.
[TABLE]
and and are the standard mollifiers in the and variable. For the initial condition we use as in the Appendix, the specific regularisation of functions originally presented in [21, 5] for the real-valued case, and more recently adapted to the vector valued case in Theorem 2.21 [7]. This regularisation provides
[TABLE]
One solves (3) with initial, boundary and off-rate datum , the solution is denoted . Together with assumptions 2.1 and 2.2, the time derivative solves :
[TABLE]
where . Since the data of (23) is regular, for a fixed , existence results follow from Theorem 2.1 p. 488 [12], and thanks to similar arguments as in Proposition 3.3, one proves as well that is a function. One obtains a priori estimates, uniform in , leading to . In the same way as in Propositions 5.2 and 5.3, there is a limit in the weak- topology , up to a subsequence. Moreover, using the Lyapunov functional , one has also that in . Now as is regular enough, one derives the ODE solved by ,
[TABLE]
This can be integrated and gives :
[TABLE]
Tested against and integrated on , this becomes :
[TABLE]
Setting
[TABLE]
one recovers the regularized version of (21). Since , one has strongly in for any compact . Thus one has : strongly in when . Since and are continuous and compactly supported, the strong convergence occurs as well in . There exists a subsequence converging in the topology to thus
[TABLE]
when goes to zero. Now other arguments using the strong convergence of justify the claim. Moreover, is bounded uniformly with respect to . Indeed :
[TABLE]
which gives after taking the sup over that
[TABLE]
Corollary 5.19**.**
Under the previous hypotheses, one has that tends to zero when goes to zero, for every fixed , where
[TABLE]
Proposition 5.20**.**
Under hypotheses 2.1 and 2.2, one has
[TABLE]
where is defined in (22).
Proof 5.21**.**
We set . As above one has
[TABLE]
the first term in the right hand side is thanks to Proposition 5.11. We focus on the second one : thanks to Corollary 5.19 and as is an integrable function on ,
[TABLE]
By Lebesgue’s Theorem, the right hand side tends to zero. Using Corollary 5.7, one writes then
[TABLE]
Since and tend to zero for a.e. , by the same arguments as in the proof of Proposition 5.13, one concludes that and vanish when goes to 0. For the last term we use Theorem 5.9, and one concludes.
Now we are in the position to prove
Proposition 5.22**.**
Under hypotheses 2.1 and 2.2, when goes to zero,
[TABLE]
for all and is defined in (26) and depends on .
Proof 5.23**.**
Considering the first term in (21), Proposition 5.20, shows that :
[TABLE]
On the other hand, hypotheses 2.1, standard arguments and the strong convergence of imply that
[TABLE]
So that finally, one has
[TABLE]
As is solving
[TABLE]
it is explicit and reads :
[TABLE]
It is then a matter of check to write
[TABLE]
which ends the proof.
5.3 Convergence of
In [16], we derived, uniformly with respect to , estimates for . Here we were not able to obtain this uniformity with respect to , and numerical simulations showed that these estimate do not hold true here. Thus the rest of the paper deals with the asymptotic when goes to zero when only compactness for is available.
We consider
[TABLE]
and we want to express the limit of this operator when goes to 0.
Theorem 5.24**.**
Under hypotheses 2.1, 2.2 and 2.3, when goes to zero, one has that
[TABLE]
where and for any test function .
Proof 5.25**.**
Splitting the domain of integration,
[TABLE]
Thanks to A, and tend respectively to
[TABLE]
where . By strong convergence established for and , and the Lebesgue’s Theorem, one shows that
[TABLE]
Setting , and rewriting gives :
[TABLE]
Thanks to Corollary 3.26 and Proposition 5.22, one concludes that :
[TABLE]
then gathering the terms provides that
[TABLE]
where is defined in (26) as a function of . The last term of the previous right hand side can then be transformed into :
[TABLE]
since , one sees easily that the latter inner integral corresponds exactly to the integration of the latter ODE.
Theorem 5.26**.**
Under hypotheses 2.1, 2.2 and 2.3, the unique solution of the problem 16 converges towards the unique solution pair satisfying :
[TABLE]
for every .
Proof 5.27**.**
From Theorem 5.24, and stability results above one has that the solution satisfying the weak formulation (17) converges strongly in to satisfying :
[TABLE]
together with the constraint everywhere in obtained in the same way as in Theorem 4.3. Then since in the first line of the latter equation all terms are well defined, one can perform an integration by parts in time and obtain that solves :
[TABLE]
again as in Theorem 4.3, choosing the test function to be , with , one proves that for almost every , which, because belongs to , is an function. Uniqueness follows the same ideas as in the proof of Theorem 4.3, it is simpler since the first term is a derivative instead of being a delay term as in (16). Indeed, denoting , where are two distinct solutions, it solves for every and for almost every ,
[TABLE]
choosing and using Gagliardo-Nirenberg as above, one recovers :
[TABLE]
For small enough, one neglects the second term in the left hand side. Thanks to Gronwall’s Lemma, one concludes, since for all , that a.e. which shows the claim.
Appendix A Initial and final terms in the weak formulation
Proposition A.1**.**
Under hypotheses 2.1 and 2.2, one has
[TABLE]
where and are defined in the proof of Theorem 5.24
Proof A.2**.**
Using the characteristics, one writes :
[TABLE]
By the Lebesgue’s Theorem the latter term tends to
[TABLE]
where is defined as
Proposition A.3**.**
Under hypotheses 2.1 and 2.2, one has
[TABLE]
where and are defined in the proof of Theorem 5.24.
Proof A.4**.**
Dividing in two equal parts and , gives two terms and . For the first one, we have
[TABLE]
Now, we estimate the latter term as
[TABLE]
applying Lebesgue’s Theorem shows that when goes to zero.
[TABLE]
where in the third line, the function is monotone increasing provided that , which then gives the result. The term can be split in two parts :
[TABLE]
Using Duhamel’s principle again for provides :
[TABLE]
Finally, we split in two terms
[TABLE]
In a straightforward manner, the latter term goes to zero since
[TABLE]
where we used that is bounded uniformly with respect to . The only term remaining and which should converge to a non-zero limit is
[TABLE]
We denote by .
[TABLE]
where . Thanks to the Duhamel’s principle applied to , one has the estimate . Indeed as in Lemma 5.2 [16], when one can show that , which gives the result. By Lemma 3.4 [16], and , one has
[TABLE]
In order to prove the limit of we define , and write :
[TABLE]
for all and all there exists , s.t.
[TABLE]
which means that , there exists s.t.
[TABLE]
Now there exists small enough s.t. for all , , thus
[TABLE]
Setting and , this shows that there is pointwise convergence for every fixed , . Moreover,
[TABLE]
and by the Lebesgue’s Theorem the convergence holds :
[TABLE]
when goes to zero.
Appendix B Functionnal analysis in Banach valued spaces
Proof B.1** (of Proposition 5.2).**
One has :
[TABLE]
for any . This proves that belongs to . is a separable Banach space. Thus according to Corollary 3.30 p. 76 [4], for any bounded sequence in there exists a subsequence converging in the weak- topology . As the bound is uniform with respect to , there exists a weak limit in denoted and we define the duality pairing as
[TABLE]
Moreover, in the weak sense i.e. for any one has
[TABLE]
The same results hold obviously for .
Proof B.2** (of Proposition 5.3).**
By Proposition 5.2, there exists a limit and a subsequence s.t.
[TABLE]
First, defines a linear continuous functional on :
[TABLE]
Moreover, one has tightness, for any continuous positive s.t. on and
[TABLE]
the latter term goes to zero as tends to infinity by the Lebesgue’s Theorem. Now one writes for any in
[TABLE]
For every there exists s.t. for and greater than the first term on the right hand side is smaller than by weak- convergence in , while the two latter terms can be made smaller than due to the tightness proved above. This implies, because is complete, that there exists a limit s.t.
[TABLE]
Since for every arbitrary fixed there exists s.t. implies
[TABLE]
* is also a linear continuous form on thanks to (27). By similar arguments as above we identify this limit with the weak derivative and we denote for every . The same proof holds for the time derivative as well.*
Lemma B.3**.**
If then
[TABLE]
Proof B.4**.**
Taking the test function , one has
[TABLE]
Lemma B.5**.**
If then
[TABLE]
Proof B.6**.**
Thanks to Theorem 2.2.1 in [7], since , there exists a smooth function , s.t. for every :
[TABLE]
*The first estimates imply directly that *
[TABLE]
as well as
[TABLE]
as . Using that
[TABLE]
and
[TABLE]
one then writes that
[TABLE]
Setting and integrating in age and time gives that
[TABLE]
One concludes thanks to a triangular inequality.
Acknowledgements
I would like to thank warmly Ioan Ionescu for his encouragements and comments that helped me in order to finish and submit this work. I thank also the referee for the very attentive reading of this article and for her/his wise comments.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. A. Adams and J. J. F. Fournier. Sobolev spaces , volume 140 of Pure and Applied Mathematics (Amsterdam) . Elsevier/Academic Press, Amsterdam, second edition, 2003.
- 2[2] L. Ambrosio, N. Gigli, and G. Savaré. Gradient flows in metric spaces and in the space of probability measures . Lectures in Mathematics ETH Zürich. Birkhäuser Verlag, Basel, second edition, 2008.
- 3[3] D. Bray. Cell movements: from molecules to motility . Garland Science, 2000.
- 4[4] H. Brezis. Functional analysis, Sobolev spaces and partial differential equations . Universitext. Springer, New York, 2011.
- 5[5] E. Giusti. Minimal surfaces and functions of bounded variation , volume 80 of Monographs in Mathematics . Birkhäuser Verlag, Basel, 1984.
- 6[6] C. M. Dafermos. Hyperbolic conservation laws in continuum physics , volume 325 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] . Springer-Verlag, Berlin, 2000.
- 7[7] M. Heida, R. I. A. Patterson, and D. R. M. Renger. Topologies and measures on the space of functions of bounded variation taking values in a Banach or metric space. J. Evol. Equ. , 19(1):111–152, 2019.
- 8[8] E. De Giorgi, A. Marino, and M. Tosques. Problems of evolution in metric spaces and maximal decreasing curve. Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. (8) , 68(3):180–187, 1980.
