Local Gradient Estimates for Second-Order Nonlinear Elliptic and Parabolic Equations by the Weak Bernstein's Method
G Barles (IDP)

TL;DR
This paper extends the weak Bernstein's method, using viscosity solutions, to establish local gradient bounds for second-order nonlinear elliptic and parabolic equations, facilitating solution regularity analysis.
Contribution
It introduces an extension of the weak Bernstein's method to obtain local gradient estimates, overcoming previous limitations of the approach.
Findings
Established local gradient bounds for nonlinear elliptic equations.
Provided a new technique for local regularity in parabolic equations.
Enhanced the applicability of the weak Bernstein's method in PDE analysis.
Abstract
In the theory of second-order, nonlinear elliptic and parabolic equations, obtaining local or global gradient bounds is often a key step for proving the existence of solutions but it may be even more useful in many applications, for example to singular perturbations problems. The classical Bernstein's method is a well-known tool to obtain these bounds but, in most cases, it has the defect of providing only a priori estimates. The "weak Bernstein's method", based on viscosity solutions' theory, is an alternative way to prove the global Lipschitz regularity of solutions together with some estimates but it is not so easy to perform in the case of local bounds. The aim of this paper is to provide an extension of the "weak Bernstein's method" which allows to prove local gradient bounds with reasonnable technicalities.
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.
Taxonomy
TopicsNonlinear Partial Differential Equations · Differential Equations and Numerical Methods · Advanced Numerical Methods in Computational Mathematics
Local Gradient Estimates for Second-Order Nonlinear Elliptic and Parabolic Equations by the Weak Bernstein’s Method
G.Barles Institut Denis Poisson (UMR CNRS 7013) Université de Tours, Université d’Orléans, CNRS. Parc de Grandmont 37200 Tours, France. Email: [email protected]
This work was partially supported by the project ANR MFG (ANR-16-CE40-0015-01) funded by the French National Research Agency
Abstract
In the theory of second-order, nonlinear elliptic and parabolic equations, obtaining local or global gradient bounds is often a key step for proving the existence of solutions but it may be even more useful in many applications, for example to singular perturbations problems. The classical Bernstein’s method is a well-known tool to obtain these bounds but, in most cases, it has the defect of providing only a priori estimates. The “weak Bernstein’s method”, based on viscosity solutions’ theory, is an alternative way to prove the global Lipschitz regularity of solutions together with some estimates but it is not so easy to perform in the case of local bounds. The aim of this paper is to provide an extension of the “weak Bernstein’s method” which allows to prove local gradient bounds with reasonnable technicalities.
Key-words: Second-order elliptic and parabolic equations, gradient bounds, weak Bernstein’s method, viscosity solutions.
MSC: 35D10 35D40, 35J15 35K10
The classical Bernstein’s method is a well-known tool for obtaining gradient estimates for solutions of second-order, elliptic and parabolic equations (cf. Caffarelli and Cabré [2] Gilbarg and Trudinger[5] (Chap. 15) and Lions[6]). The underlying idea is very simple: if is a domain in and is a smooth solution of
[TABLE]
where denotes the Laplacian in , then satisfies
[TABLE]
The gradient bounded is deduced from this property by using the Maximum Principle if one knows that is bounded on and this bound on the boundary is usually the consequence of the existence of barriers functions.
Of course this strategy, consisting in showing that is a subsolution of an elliptic equation and then using the Maximum Principle, can be applied to far more general equations but it has a clear defect: in order to justify the above computations, the solution has to be and, since it is rare that the solution has such a regularity, the classical Bernstein’s method provides, in general, only a priori estimates; then one has to find a suitable approximation of the equation, with smooth enough solutions, to actually obtain the gradient bound.
In 1990, this difficulty was partially overcomed by the weak Bernstein’s method whose idea is even simpler: if one looks at the maximum of the function
[TABLE]
and if one can prove that it is achieved only for for large enough, then . Surprisingly, as it is explained in the introduction of [1], the computations and structure conditions which are needed to obtain this bound are the same (or almost the same with tiny differences) as for the classical Bernstein’s method. Of course, the main advantage of the weak Bernstein’s method is that it does not require to be smooth since there is no differentiation of and it can even be used in the framework of viscosity solutions.
Problem solved? Not completely because the weak Bernstein’s method is not of an easy use if one looks for local bounds instead of global bounds. In fact, in order to get such local gradient bounds, the only possible way seems to multiply the solution by a cut-off function and to look for a gradient bound for this new function. Unfortunately, this new function satisfies a rather complicated equation where the derivatives of the cut-off function appear at different places and the computations become rather technical. The classical Bernstein’s method also faces similar difficulties but, at least in some cases, succeeds in providing these local bounds in a not too complicated way.
The aim of this article is to describe a slight improvement of the weak Bernstein’s method which allows to obtain local gradient bounds in a simpler way, “simpler” meaning that the technicalities are as reduced as possible, although some are unavoidable. This improvement is based on an idea of P. Cardaliaguet [3] which dramatically simplifies a matrix analysis which is keystone in [1] but also allows this extension to local bounds.
To present our result, we consider second-order, possibly degenerate, elliptic equations which we write in the general form
[TABLE]
where is a domain of and is a locally Lipschitz continuous function, denotes the space of symmetric matrices, the solution is a real-valued function defined on , denote respectively its gradient and Hessian matrix. We assume that satisfies the (degenerate) ellipticity condition : for any and for any ,
[TABLE]
Our results consist in providing several general “structure conditions” on under which one has a local gradient bound depending or not on the local oscillation of and the uniform ellipticity of the equation. We also consider the parabolic case for which we give a structure condition on the equation allowing to prove a local gradient bound, depending on the local oscillation of , where “local” means both in space and time.
In the stationary framework, we focus in particular on the following example
[TABLE]
where and , which is a particular case for which the classical Bernstein’s method provides local bound (independent of the oscillation of ) in a rather easy way, while it is not the case for the weak Bernstein’s method.
We conclude this introduction by two remarks: the first one concerns the “structure conditions” on on which our results are based. In [1], it is pointed out that, in general, the equation we consider does not satisfy these structure conditions and we have to make a change of unknown function , choosing in order that the new equation for satisfies them. Obviously, the same remark is true here and we provide an example where such a change allows to obtain the desired gradient bound. But, contrarily to [1], we are not going to study the effect of such changes in a more systematic way.
The second remark concerns the method we are going to present: the results we obtain are based on several choices we made at several places and, in particular, in the estimates of the terms we have to handle. Clearly, many variants are possible and we have just tried to convince the reader that, actually, the technicalities are really “reasonnable” as we pretend it in the abstract.
Acknowledgement: the author would like to thank the anonymous referees whose remarks led to significant improvements of the readability of this article.
1 Some preliminary results
In this section, we are going to construct the functions we use in the proof of our main result. To do so, we introduce which is the class of continuous functions such that if , is increasing on , for , for some and some constant , and
[TABLE]
The first ingredient we use below is a smooth function such that , for any with as and which solves the ode for some constant . In fact the existence of such function is classical using that
[TABLE]
and by choosing we already see that as . Moreover
[TABLE]
and therefore, for close enough to
[TABLE]
This means that
[TABLE]
and therefore is not integrable at since . Hence we have as .
On the other hand, given and , we use below a smooth function is a smooth function such that on , in and when and with
[TABLE]
where is a function in the class . If is a function which satisfies the above properties for and , we see that we can choose as
[TABLE]
and therefore behaves like .
To build , we first solve
[TABLE]
for some constant to be chosen later on. Multiplying the equation by , we obtain that
[TABLE]
where
[TABLE]
Again we look for a function such that as and to do so, the following condition should hold
[TABLE]
But, since is increasing,
[TABLE]
and since is in , we have the result for , and then for by choosing appropriately the constant .
Moreover
[TABLE]
and therefore
[TABLE]
Finally, we can extend by setting for and the equations satisfied by show that we define in that way a -function on .
With such a , the construction of is easy, we may choose
[TABLE]
and define from as above. We notice that, because of the properties of , remains bounded on and is a , a property that we will use later on.
2 The Main Result
In the statement of our main result below, for the sake of clarity, we are going to drop the arguments of the partial derivatives of and to simply denote by the quantity for . Actually these arguments are everywhere.
Our result is the following
Theorem 2.1
Assume that is a locally Lipschitz function in which satisfies : is Lipschitz continuous in and
[TABLE]
*and let be a solution of (1).
(i) (Uniformly elliptic equation with coercive gradient dependence: estimates which are independant of the oscillation of ) Assume that there exist a function and such that, for any , there exists large enough such that
[TABLE]
[TABLE]
in the set
[TABLE]
*If then is Lipschitz continuous in and in where depends only on and .
(ii) (Uniformly elliptic equation with coercive gradient dependence: estimates depending the oscillation of ) Assume that there exist a function and small enough such that, for any , there exists large enough such that
[TABLE]
*in the set . If then is Lipschitz continuous in and in where depends on , and , the oscillation of on .
(iii) (Non-uniformly elliptic equation : estimates depending the oscillation of ) Assume that there exist a function and small enough such that, for any , there exists large enough such that
[TABLE]
[TABLE]
in the set . If then is Lipschitz continuous in and in where depends on , and .
As an application we consider Equation (2): in order to have a gradient estimate which is independant of the oscillation of , i.e. Result (i) in Theorem 2.1, the idea is to choose for with and . The most important point is that, for large , the constraint on reads
[TABLE]
and therefore behaves as if is large enough. Since , this implies that, for such ,
[TABLE]
But, by Cauchy-Schwarz inequality
[TABLE]
Therefore the term behaves like . For the other terms, we have, for large
the term behaves like ; 2. 2.
the term behaves like ; 3. 3.
the term K||F_{M}||_{\infty}\bigl{(}|p|\left(1+K\chi(\eta|p|)\right)\chi(\eta|p|)\bigr{)}^{2} behaves like .
Since , the term clearly dominates all the other terms as tends to ; therefore we have the gradient bound since the assumption holds for any . Moreover the classical case () can be also treated under the assumptions of Result (ii).
In this example, it is also clear that we can replace the term by a term where satisfies: there exists such that
[TABLE]
and
[TABLE]
In the case of non-uniformly elliptic equation, the gradient bound comes necessarely from the -term. We consider the equation
[TABLE]
where and is locally bounded and Lipschitz continuous; concerning , we use the classical assumption: for some bounded, Lipschitz continuous function , where denotes the transpose matrix of .
In order to obtain a local gradient bound for , a change of variable is necessary: assuming (without loss of generality) that at least in the ball , we can use the change . The equation satisfied by is
[TABLE]
And the aim is now to apply Theorem 2.1-(iii) to get the gradient bound for (hence for ).
The computation of the different terms gives
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We first use Cauchy-Schwarz inequality and the assumption on to deduce that, for any
[TABLE]
This control of the first term in is the only use of the term .
Therefore the -term which behaves like if , has to control the terms
[TABLE]
We have now to consider the -term and the term K\bigl{(}|p|\chi(\eta|p|)\bigr{)}^{2} in the right-hand side. Notice that, for the time being, we have not chosen nor .
The -term behaves as and therefore behaves as . On the other hand, K\bigl{(}|p|\chi(\eta|p|)\bigr{)}^{2} behaves as . If we choose any , because of the growth of such at infinity, these two terms are controlled by the -one. Therefore Theorem 2.1 (iii) applies.
It is worth pointing out that, in this last example, we do not use the fact that the assumption has to hold only in the set , a fact which is going to be (almost) the general case in the parabolic setting.
3 Proof of Theorem 2.1
We start by proving (i) : the aim is to prove that, for any , is bounded with an explicit bound. This will provide the desired gradient bound. We recall that
[TABLE]
To do so, we consider on
[TABLE]
the following function
[TABLE]
where
- •
is a constant which is our future gradient bound (and therefore which has to be choosen large enough),
- •
the functions and are built in Section 1,
- •
is a small constant devoted to tend to [math].
We remark that the above function achieves its maximum in the open set : indeed, if , we have and therefore for some . Moreover implies and, since , this implies and . Therefore, clearly if .
Next we argue by contradiction: if, for some , this maximum is achieved for any at with , then and therefore necessarely by the maximality property and the form of . Moreover, for any
[TABLE]
and if this is true, for a fixed , this implies that, for any
[TABLE]
Choosing , we have
[TABLE]
and this inequality implies that any element in has a norm which is less than , which we wanted to prove.
Notice that, by using slightly more complicated arguments, the same conclusion is true if, for some , we have when .
Therefore, we may assume without loss of generality that, for any fixed , the maximum points of , satisfies not only for small enough but is bounded away from [math] when . We are going to prove that this is a contradiction for large enough.
For the sake of simplicity of notations, we omit the indice in all the quantities which depends on (actually they also depend on ). In particular, we denote by a maximum point of and we set and
[TABLE]
By a classical result of the User’s guide (cf. Crandall, Ishii and Lions [4]), there exist matrices such that , , for which the following viscosity inequalities hold
[TABLE]
Moreover the matrices satisfy, for any
[TABLE]
and where, if , and ||A||=\max\{|\lambda|:\ \hbox{\lambdaA}\}.
Since is arbitrary and since we are going to use only the second above inequality, we may choose a sufficiently small in order that the term becomes negligible. Using this remark, we argue below assuming that in order to simplify the exposure.
With this convention, the matrices satisfy, for any
[TABLE]
where
[TABLE]
[TABLE]
[TABLE]
By easy manipulations, it is easy to see that
[TABLE]
[TABLE]
where the comes from terms of the form . Again, for the sake of clarity, we are going to drop these terms which play no role at the end.
By Cauchy-Schwarz inequality, we deduce that, using appearing in the assumption,
[TABLE]
where depends on through and therefore is a if is fixed.
Coming back to and , we also have
[TABLE]
since , everywhere and since is a . In order to have simpler formulas, we denote below by any quantity which is a .
Now we arrive at the key point of the proof: by (4), choosing , we have where is the identity matrix in . Therefore the matrix is invertible and rewriting (5) as
[TABLE]
we can take the infimum in in the right-hand side and we end up with
[TABLE]
Setting , this implies that we have , and then, using the Lipschitz continuity of in , we have the viscosity inequalities
[TABLE]
[TABLE]
Next we introduce the function
[TABLE]
where
[TABLE]
[TABLE]
From now on, in order to simplify the exposure, we are going to argue as if were : the case when is just locally Lipschitz continuous follows from tedious but standard approximation arguments.
The above viscosity inequalities read and : if we can show that the -function satisfies if , we would have a contradiction. Therefore we compute
[TABLE]
and using that and , we are lead to
[TABLE]
Before estimating the different terms inside the brackets, we point out that, contrarily to [1] where was given by and where we had to prove an inequality between and , here this inequality comes for free because of the form of : this is the key idea of Cardaliaguet [3].
Now we estimate the terms , and in terms of in order to be able to use the assumptions on .
Using that and the properties of , we have
[TABLE]
Indeed, recalling the estimate on , and, on an other hand, since , we have
[TABLE]
From now on, we are going to assume that is chosen large enough in order to have and, since is fixed, . Notice that these constraints on depend only on and , hence on and .
Using this choice, the above estimate of – and we can argue in the same way for – takes the simple form
[TABLE]
This leads to the simpler estimate
[TABLE]
In the same way, since we can take as small as we want and is bounded away from [math], one has
[TABLE]
This allows to estimate the -term, namely
[TABLE]
Finally, by the same estimates
[TABLE]
We end up with
[TABLE]
On the other hand, in order to take into account the constraint , we have to estimate . Since is bounded away from [math] and , we have
[TABLE]
But and therefore
[TABLE]
This implies
[TABLE]
while
[TABLE]
The conclusion follows by applying the assumption on for large enough and small enough in order that the -terms are controlled by the -terms. Taking large enough depending on and , we have a contradiction and the proof of (i) is complete.
Now we turn to the proof of (ii) where we choose and
[TABLE]
The proof follows the same arguments, except that the fact that allows different estimates on the , because several terms do not exist anymore. We denote by any quantity of the form and we choose large enough in order to have for any of these terms and . We notice that, here, the constraints on depend not only on and but also on .
We have and therefore
[TABLE]
since . Using this inequality and taking into account our choice of , it is easy to check that (6) still holds.
Moreover we have
[TABLE]
And we still have the same estimates on
[TABLE]
[TABLE]
The proof is then done in the same way as in the first case with the computation of and then with the estimates of the different terms
[TABLE]
But here
[TABLE]
and in the same way,
[TABLE]
and
[TABLE]
We end up with
[TABLE]
On the other hand, for the constraint , we have
[TABLE]
and
[TABLE]
Hence
[TABLE]
The conclusion follows as in the first case by applying the assumption on for large enough and small enough for which we have a contradiction.
For the proof of (iii), we keep the same test-function and the same set but since we are not expecting the gradient bound to come from the same term in , we are going to change the strategy in our computation of by keeping the -term. Using that and
[TABLE]
we obtain
[TABLE]
This computation is close to the one given in [1] if there is no localization term ().
Since and using anagolous estimates as above, we are lead to
[TABLE]
On the other hand, the constraint still implies (7) and we also conclude by choosing large enough and small enough.
4 The parabolic case
In this section, we consider evolution equations under the general form
[TABLE]
and the aim is to provide a local gradient bound where “local” means both local in space and time. As a consequence, we will have to provide a localization also in time and a second main difference is that we will not be able to use that the equation holds since the -term has no property in general and therefore the assumptions on have to hold for any and not only those for which is close to [math].
Theorem 4.1
**(Estimates for non-uniformly parabolic equations : estimates depending the oscillation of )
**Assume that is a locally Lipschitz function in which satisfies : is Lipschitz continuous in and
[TABLE]
and let be a solution of (8). Assume that there exists a function , such that, for any , there exists large enough such that, for , we have and
[TABLE]
[TABLE]
If and , then is Lipschitz continuous in in and in where depends on , , and the oscillation of in .
It is worth pointing out that the assumptions of Theorem 4.1 are rather close to the one of Theorem 2.1 (iii) and the same computations provide a gradient bound for the evolution equation
[TABLE]
if .
Proof of Theorem 4.1 : We argue as in the proof of Theorem 2.1 (iii), except that here with as . We still choose and we denote by , the subset of points such that
[TABLE]
where denotes the oscillation of in .
We consider maximum points of the function
[TABLE]
and, if , we are lead to the viscosity inequalities
[TABLE]
where , and
[TABLE]
As in the proof of Theorem 2.1, the second inequality holds for as well and subtracting these inequalities, we have
[TABLE]
Then, with the notations of the proof of Theorem 2.1, we introduce
[TABLE]
[TABLE]
Here we have no information on the signs of and , we only know that ; therefore, in order to have the contradiction, we have to show that for any if we choose a function such that is large enough for any .
The computation of and the estimates are done as above; we have just to estimate the new term which is multiplied by when we put it inside the bracket. We have
[TABLE]
and if we choose as the solution of the ode
[TABLE]
By choosing properly , we have (notice that decreases when increases). Since , we have
[TABLE]
Using this estimate, the conclusion follows as above by applying the assumption on for large enough and small enough for which we have a contradiction by taking large enough.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Barles, G., (1991), A weak Bernstein method for fully nonlinear elliptic equations. J. Diff. and Int. Equations, vol 4, n ∘ 2, pp 241-262.
- 2[2] L. A. Caffarelli and X. Cabré, Fully non-linear elliptic equations. American Mathematical Society Colloquium Publications, 43. American Mathematical Society, Providence, RI, 1995.
- 3[3] Cardaliaguet, P. : Personal communication.
- 4[4] Crandall, M.G., Ishii, H., Lions, P.-L. (1992). User’s guide to viscosity solutions of second order partial differential equations. Bull. Amer. Math. Soc. (N.S.) 27(1) 1-67.
- 5[5] Gilbarg D., Trudinger N.-S., Elliptic Partial Differential Equations of Second Order , Second edition, Springer, 2001.
- 6[6] Lions P.-L., Generalized solutions of Hamilton-Jacobi equations , vol. 69 of Research Notes in Mathematics, Pitman (Advanced Publishing Program), Boston, Mass., 1982.
