Approximate convexity principles and applications to PDEs in convex domains
Claudia Bucur, Marco Squassina

TL;DR
This paper develops approximate convexity principles for solutions to certain nonlinear elliptic PDEs in convex domains, focusing on equations with nearly concave nonlinearities, and explores specific applications of these principles.
Contribution
It introduces new approximate convexity principles for nonlinear elliptic PDEs with nearly concave nonlinearities in convex domains, expanding theoretical understanding.
Findings
Established approximate convexity principles for specific PDE classes
Demonstrated applications to meaningful special cases
Enhanced understanding of solution behavior in convex domains
Abstract
We obtain approximate convexity principles for solutions to some classes of nonlinear elliptic partial differential equations in convex domains involving approximately concave nonlinearities. Furthermore, we provide some applications to some meaningful special cases.
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.
Approximate convexity principles and
applications to PDEs in convex domains
Claudia Bucur
and
Marco Squassina
Dipartimento di Matematica e Fisica
Università Cattolica del Sacro Cuore
Via dei Musei 41, I-25121 Brescia, Italy
Dipartimento di Matematica e Fisica
Università Cattolica del Sacro Cuore
Via dei Musei 41, I-25121 Brescia, Italy
Abstract.
We obtain approximate convexity principles for solutions to some classes of nonlinear elliptic partial differential equations in convex domains involving approximately concave nonlinearities. Furthermore, we provide some applications to some meaningful special cases.
Key words and phrases:
Elliptic PDEs, convexity, concavity, maximum principles
2010 Mathematics Subject Classification:
46E35, 28D20, 82B10, 49A50
The authors are members of Gruppo Nazionale per l’Analisi Matematica, la Probabilità e le loro Applicazioni (GNAMPA) of the Istituto Nazionale di Alta Matematica (INdAM)
1. Introduction
Convexity properties of solutions to elliptic partial differential equations in convex domains are a fascinating subject. One of the first results in this direction goes back to the work of Brascamp and Lieb [1] from 1976, where they proved that the logarithm function applied to the first eigenfunction of the Laplace operator with zero Dirichlet boundary conditions in a convex domain is concave. Notice that the first eigenfunction itself is not concave in any domain (as it can be easily seen), thus considering a transformation (in this case, taking the logarithm) of the solution is necessary. Previously, in 1971, Makar-Limanov [11] had proved that if is the positive solution to the torsion equation in the convex domain , then is concave. Later, at the beginning of the eighties, Korevaar [9, 10] and Kennington [8] were able to derive these results from general convexity principles (see also [7, 2, 3]). Given a convex domain and a function , these convexity principles are essentially maximum principles for the auxiliary function
[TABLE]
for and . Positivity (negativity) of in is equivalent to concavity (convexity) of the function .
As a by product of the general theory, some results about concavity of positive solutions of notable semilinear problems can be obtained. For instance (see [8, Theorem 4.2]), if , , is a bounded convex domain of that satisfies an interior ball condition and is a solution to
[TABLE]
then is concave in . Also (see [8, Theorem 4.1]), if and is a solution to
[TABLE]
for some nonnegative such that is concave, then
[TABLE]
and the upper bound is sharp (cf. Property 2 and Theorem 6.2 of [8]). Roughly speaking, some form of concavity on the nonlinear term forces a suitable power of the positive solution to be concave. Similar statements hold in some cases when one takes the logarithm of the first eigenvalue of the Laplace or -Laplace operator with Dirichlet boundary conditions, see [12]. See also [4, 5] for general concavity principles for some classes of fully nonlinear elliptic problems, obtained with different techniques compared to [9, 8].
It is rather natural to wonder what happens if the concavity of the nonlinear term is broken down by a small perturbation. Is then the corresponding solution of the problem convex up to a small perturbation function of proportional size?
The answer is affirmative and it follows from approximate convexity principles that we prove in Theorems 2.5 and 2.10, in combination with constraints furnished by the boundary conditions of the problems under consideration. As a consequence of the approximate convexity principles we obtain the corresponding results of approximate convexity of perturbed problems like the ones in (1.2) and (1.3).
The main applications of this paper are given in the following informal terms.
Let , , a bounded strictly convex domain of that satisfies an interior ball condition. Let be a solution to
[TABLE]
Then under some assumptions of -approximate harmonic convexity and monotonicity of , and requiring that the nonlinear term stays positive, there exists a concave function and a positive constant such that
- (1)
if , then
[TABLE] 2. (2)
if , then
[TABLE]
This main application is proved in Theorem 4.3 and Corollary 4.2 (some less restrictive hypothesis will be required in the respective results). Furthermore, we provide a result for a problem like the one in (1.3), as follows.
Let , be a bounded convex domain of . Let be a solution to
[TABLE]
Asking hypothesis on the concavity and strict positivity of , approximate harmonic convexity of , and requiring that the nonlinearity stays positive, there exists a concave function and such that
[TABLE]
This result is given in Theorem 4.4.
In the rest of the paper, we introduce the framework and state the approximate convexity principles in Section 2. Boundary conditions of particular problems (that we use in Section 3) will allow us to give some explicit examples in the last Section 4.
2. Approximate Convexity Principles
Let be a convex domain (i.e. a connected open set) here and in the rest of the paper. We denote by the generic points of and by their convex combination, precisely
[TABLE]
We adopt the same notation for , denoting as their convex combination.
Let and . As in [6], we say that is -convex in if
[TABLE]
where is defined in (1.1). We say that is -concave if is -convex (notice also that ). Also, with an abuse of notation, for , and we define
[TABLE]
as the convexity function of some , jointly in its two variables. We write also
[TABLE]
as the convexity function of jointly in two variables, along .
Remark 2.1**.**
We make a remark on the notation adopted in the course of this paper. If depends only on the variable then the two notions in (1.1) and (LABEL:cg) coincide. Nonetheless, we still use the notation when the function depends only on , and in general to denote the convexity function in one, or jointly in two variables. We point out once more that the notation is referred to the joint convexity of , and contains no information about the convexity of itself.
We say that is jointly convex in if and only if for all and any we have that , that is jointly -convex if
[TABLE]
and is jointly -concave if is jointly -convex. In particular, is jointly convex along if
[TABLE]
and is jointly -concave along when is jointly -convex along . Of course, asking that is concave along is a refinement, and joint concavity of implies the concavity along .
Furthermore, we define the harmonic convexity function jointly in the two variables of the function exclusively when
[TABLE]
This may seem a little weird to the reader, but its definition is justified by the use we make in the rest of the paper, in particular in Lemma 2.9 (we note also that this definition coincides with the one given in [8]). Thus, the definition is given for positive functions , or changing sign functions that satisfy at the given point one of the conditions in (2.2). Notice also that none of these conditions hold if . We thus define
[TABLE]
In general, we say that is -harmonic concave (-harmonic convex) if satisfying one of the two conditions in (2.2) we have that
[TABLE]
It is readily seen that a positive concave function is harmonic concave. We notice also that the simple inequality
[TABLE]
that holds whenever implies that
[TABLE]
In particular, all positive -harmonic convex functions are -convex, and all positive -concave are also -harmonic concave. We denote the harmonic convexity function of along as
[TABLE]
We say that is -harmonic concave (-harmonic convex) along if satisfying one of the two condition in (2.2), it holds that
[TABLE]
As expected from the previous work in the literature (for instance [9, 8, 7]), the convexity of solutions of a second order elliptic problems with a nonlinear term in a convex domain depends solely on the convexity and the monotonicity of the nonlinearity. We give in the next lemma a quantitative estimate of the convexity function of the solution.
Let us also mention that, as in [7, 9, 8] it is crucial that the second order coefficients depend only on the gradient of the solution. To our knowledge, convexity principles that allow a dependence on the solution itself or are not available.
For the sake of clarity, we give the next definition.
Definition 2.2**.**
We say that the triple is an interior point for if each of is in with , while we say that the point is on the boundary if at least one belongs to .
Here and in the rest of the section we consider measurable functions for all and derivable in the second variable, on its domain of definition. Moreover, we write to denote the non-orientated segment from to .
Lemma 2.3**.**
We consider the equation in
[TABLE]
*Let be a solution of (2.3). We assume that *
[TABLE]
Then, if achieves a positive interior maximum at and there exists such that
[TABLE]
then
[TABLE]
We follow in the next proof the main ideas from [9, Lemma 1.4]. We remark that this Lemma contributes to the result in Theorem 2.5, which affirms that the -concavity of along implies the -convexity of the solution . Requiring thus a positive maximum of is natural (otherwise, gives that is convex, and there would be nothing else to prove).
Proof.
We consider and (i.e., does not coincide with or ), otherwise , which gives that is convex. Given that is a interior maximum point, we have
[TABLE]
therefore we may denote
[TABLE]
Take now for
[TABLE]
Since gives a maximum, we have that
[TABLE]
Here denotes the Hessian with respect to of at zero. Also notice that
[TABLE]
Since is symmetrical and positive defined, we get that
[TABLE]
hence
[TABLE]
Using the equation (2.3) we obtain
[TABLE]
Therefore, we get that
[TABLE]
Using the mean value theorem of Lagrange, we have that there exists between and such that
[TABLE]
hence, since is positive at it follows that
[TABLE]
This concludes the proof of the lemma. ∎
Roughly speaking the previous statement says that under the assumption that the function achieves a positive maximum in the interior of , then this maximum is bounded from above by the convexity function of along (with strictly increasing), computed at the interior maximum point of .
We recall now a result [6, Theorem 2] for -convex functions.
Proposition 2.4** (Hyers-Ulam Theorem).**
Let be a space of finite dimension and convex. Assume that is -convex. Then there exists a convex function such that , where depends only on .
The following is the main -convexity tool for applications. It states that the approximate concavity of along and the strict monotonicity of yields in turn the approximate convexity of the solution .
Theorem 2.5** (-Convexity Principle I).**
Let be a solution of (2.3) and set , . For some and we assume that condition (2.4) holds, and furthermore, that
[TABLE]
[TABLE]
Then, if achieves a positive interior maximum in , there exist a convex function and such that
[TABLE]
Proof.
The proof is a consequence of Lemma 2.3 and Proposition 2.4. ∎
Remark 2.6**.**
*For the assertion reduces exactly to the Korevaar maximum principle (see [9, Theorem 1.3, Lemma 1.4]). *
Remark 2.7**.**
One can obtain a statement similar to Theorem 2.5 in the parabolic case (check [9, Theorem 1.6]). Indeed, consider the problem
[TABLE]
Let be a solution of (2.10) such that for any and . Assume that
[TABLE]
*and denote *
[TABLE]
for any fixed . Then, if achieves a positive maximum at and there exists such that
[TABLE]
then
[TABLE]
To see this, it is enough to substitute the equation (2.10) into (2.6), obtaining that
[TABLE]
We use the fact that has a maximum in , getting
[TABLE]
and from there the proof follows as in Lemma 2.3. The analogue of Theorem 2.5 is obtained by imposing that the function be jointly -convex along for any , with and any fixed . In other words, there exist such that
[TABLE]
[TABLE]
In the next theorem, we encompass the case in which (from Theorem 2.5) may reach zero. The proof follows that of Korevaar in [9, Lemma 1.5, Theorem 1.4], we provide here a complete proof. Namely, we consider a perturbation of the problem in way that will allow us to apply Theorem 2.5 to the solution of the perturbed problem on a smaller domain. Notice that we obtain a significant result if is jointly convex (i.e., one gets that is convex, as in Korevaar’s result). When however, we are only able to provide a rate of convergence of the solution of the perturbed problem to a convex function, whereas the solution of the perturbed problem converges uniformly to the solution of the initial problem. The precise result goes as follows.
Proposition 2.8**.**
Let be a solution of (2.3) and assume that (2.4) and (LABEL:ah1) holds for . Let be smooth. If achieves a positive interior maximum in , then for every there exist such that for any there exists a function , a convex function and such that whenever (LABEL:ah21) holds, then
[TABLE]
Proof.
For small, there exists and (indipendent on ) such that the function , given as
[TABLE]
solves the perturbed problem
[TABLE]
Indeed, let us take a Taylor expansion in . For we get
[TABLE]
while for
[TABLE]
Summing up we get that
[TABLE]
In the above computation, represent the rest of order two of the Taylor expansions. Just to be precise, for some we have
[TABLE]
Knowing that satisfies the equation (2.3), and dividing by we get that
[TABLE]
Then solves the problem
[TABLE]
with
[TABLE]
and
[TABLE]
By iteration we will consider and take
[TABLE]
Notice that considering a problem
[TABLE]
by Schauder estimates there exists such that
[TABLE]
Also, since , one has for that if
[TABLE]
for some . Using these two remarks for the problem (2.13), there exists such that for any
[TABLE]
Consider now the problem for , namely
[TABLE]
To get , by Lagrange theorem, we have
[TABLE]
for some laying on the segment that unites the two arguments of . Therefore we obtain that
[TABLE]
hence for (since is arbitrarily small)
[TABLE]
Therefore there exists such that in with
[TABLE]
We apply to as the solution of (LABEL:vvv) Theorem 2.5 (where from Theorem 2.5 is given by in our case). Then
[TABLE]
By Theorem 2.5 there exists a convex function such that
[TABLE]
Set . Then Of course . Then the assertion follows. ∎
In the next lemma, we relax the conditions we ask to the nonlinear term. Following the work in [8, 7], we can ask the function to be -harmonic concave and obtain anyways the -convexity of the solution to the problem (2.3). As a matter of fact, we can estimate the convexity function of the solution by the harmonic concavity function of the nonlinear term and its rate of monotonicity.
Lemma 2.9**.**
Let be a solution of (2.3) and assume that (2.4) holds. Then, if achieves a positive interior maximum at and there exists such that (2.11) holds, then
[TABLE]
We follow in the next proof the main ideas from [8, Theorem 3.1] (another proof is given in [7, Theorem 3.13]).
Proof.
If , or , or then and there is nothing to prove. In the other cases as in Lemma 2.3, we notice that we have that
[TABLE]
and we name the matrix . Let us also define the matrices
[TABLE]
(which is negative defined since is a maximum for in the interior of its domain), and
[TABLE]
for any (which is positive defined, since is so). We have from linear algebra arguments (see i.e. [8, Lemma A.1]) that This means that
[TABLE]
Denoting
[TABLE]
it holds that
[TABLE]
thus
[TABLE]
Using as in the proof of [8, Theorem 3.1]
[TABLE]
we compute
[TABLE]
This together with (2.14) leads to
[TABLE]
If then
[TABLE]
hence , and in the same way . Then it can happen that either
[TABLE]
or
[TABLE]
(see also [8, (3.5)], but we remark that the notations and signs there are different). By using the equation (2.3) it holds that
[TABLE]
hence we get in the case (2.16)
[TABLE]
Then
[TABLE]
By Lagrange’s mean value theorem, there exists some such that
[TABLE]
Notice also that in the case (2.15), since , one gets that
[TABLE]
Since , in any case it follows that
[TABLE]
therefore
[TABLE]
This concludes the proof of the Lemma. ∎
With the aid of this Lemma, we can obtain the second -convexity principle, that we state in the next rows.
Theorem 2.10** (-Convexity Principle II).**
Let be a solution of (2.3) and set , . For some and we assume that condition (2.4) holds, and furthermore, that
[TABLE]
[TABLE]
Then, if achieves a positive interior maximum in , there exist a convex function and such that
[TABLE]
Proof.
The proof is a consequence of Lemma 2.9 and Proposition 2.4. ∎
Theorem 2.10 says that under the assumption that the function achieves a positive interior maximum, then the approximate harmonic concavity of and the strict monotonicity of ( needs to be strictly increasing) yields in turn the approximate convexity of the solution .
3. Boundary constraints
In this section, we present some results that will allow us to exclude the possibility that the maximum of the convexity function of the solution to (2.3) is reached on the boundary. Let us mention that a general framework for boundary constraints is given in [9, Lemma 2.1]. We focus here on some particular cases, that will allow us to apply in a simple way our approximate convexity principles. We recall that the definition of boundary point for the convexity function is given in Definition 2.2.
Proposition 3.1**.**
Let , a bounded convex domain of and such that on , in and for every and any , there holds
[TABLE]
Then for any the function cannot achieve the positive maximum on the boundary.
Proof.
Assume by contradiction that the positive maximum of the function is achieved at a boundary point .
Notice that if at least two of the points are on then , hence there is nothing to prove. In view of the previous consideration, we can reduce to the case in which and (the fact that and is excluded by the convexity of the domain).
Now, the condition (3.1) is equivalent to
[TABLE]
There exists sufficiently small that Then, setting
[TABLE]
we have and
[TABLE]
which yields a contradiction. ∎
The next result will be very useful in applications. We will denote by the normal derivative where stands for the outer normal vector at the boundary.
Corollary 3.2**.**
Let , a bounded convex domain of and such that
[TABLE]
Then for any the function cannot achieve the positive maximum on the boundary.
Proof.
In light of Proposition 3.1, it is enough to prove that for any and , it holds
[TABLE]
Since , by convexity of and we have
[TABLE]
which yields the assertion. ∎
Let us also mention that:
Lemma 3.3**.**
Let , a bounded convex domain of and such that on , in and
[TABLE]
for some and . Then there exists such that is not -concave.
Proof.
Assume by contradiction that for every , is -concave. Then, since , we have
[TABLE]
Letting with and dividing by yields
[TABLE]
which gives a contradiction as goes to zero. ∎
For the next lemma we refer the reader to [7, Lemma 3.12].
Lemma 3.4**.**
Let be a bounded and strictly convex domain (i.e., if then ) with boundary of class Let such that
[TABLE]
Let be a functions that satisfies
[TABLE]
Then cannot achieve a positive maximum on the boundary.
For instance satisfies conditions (3.3).
4. -concave solutions
In this section, we give some applications of the -convexity principles established in Theorems 2.5 and 2.10.
The next results is a meaningful application of our general results. It contains in particular semi-linear eigenvalue problems.
Theorem 4.1** (-convex solutions).**
Let , be such that it satisfies (3.3) and in addition, that
[TABLE]
Let be a bounded strictly convex domain of and be a solution to and on in and
[TABLE]
We suppose furthermore that denoting , , there exists such that
[TABLE]
Then there exists a convex function and such that
[TABLE]
Proof.
Setting , a standard computation shows that satisfies the problem
[TABLE]
Notice that, by assumption on , we have that the function
[TABLE]
is monotonically increasing in , and its derivative is greater or equal than . The function
[TABLE]
is concave in , thus . This yields that
[TABLE]
for any , by hypothesis. Notice also that according to Lemma 3.4 the convexity function cannot achieve a positive maximum on the boundary. Thus the maximum is reached in the interior of the domain. It follows by Theorem 2.5 that there exist a convex function and such that
[TABLE]
This concludes the proof of the Theorem. ∎
Corollary 4.2**.**
Let be a bounded strictly convex domain of and be a solution to on in and
[TABLE]
Let , and with
[TABLE]
and
[TABLE]
Then there exists a concave function and such that
[TABLE]
Proof.
By Hopf’s Lemma, we get first of all that on . With the choice
[TABLE]
we find ourselves with the problem in Theorem 4.1. We have that ,
[TABLE]
and that for any
[TABLE]
The assertion follows by Theorem 4.1. ∎
In this example, we take as the nonlinearity a perturbation of a concave function and prove that an appropriate power of the solution is approximately concave, hence it can be written as a bounded perturbation of a concave function.
Theorem 4.3** (Power concave solutions).**
Let , , a bounded convex domain of that satisfies an interior ball condition. Let be a solution to
[TABLE]
Denoting , we take here is such that it holds that
[TABLE]
and for some
[TABLE]
Then there exists a concave function and a positive constant such that
[TABLE]
Proof.
Notice that by (4.1)
[TABLE]
so applying Hopf’s Lemma, we deduce that on . Consider now the transformation of given by
[TABLE]
By applying Corollary 3.2 with we have that the convexity function cannot achieve the maximum on the boundary. Thus, the maximum is achieved in the interior of the domain. If such a maximum is non-positive, there is nothing to prove, since this yields that is convex. So we assume that the maximum is positive. Observe that standard computations yield that satisfies
[TABLE]
where we have set , , with
[TABLE]
Thanks to (4.1) we have that
[TABLE]
In view of (A.2) (remark that the harmonic concavity function is well defined, since all functions involved are non-negative) it follows that for any
[TABLE]
Given that and that the map
[TABLE]
is convex, it follows that is harmonic concave, thus . Therefore
[TABLE]
and by Theorem 2.10, is convex. The conclusion immediately follows. ∎
Theorem 4.4**.**
Let , be a bounded convex domain of , that satisfies the interior ball condition . Let be a solution to
[TABLE]
Here, are such that there exists , and such that
[TABLE]
denoting
[TABLE]
and
[TABLE]
Then there exists a concave function and such that
[TABLE]
Proof.
Let
[TABLE]
By Hopf’s Lemma (notice that by hypothesis), we have that on , hence by Corollary 3.2, cannot achieve the maximum at a boundary point. It follows that the maximum of is achieved at an interior point. The function satisfies the equation
[TABLE]
with ,
[TABLE]
We have that
[TABLE]
We claim that is harmonic concave in the two variables . Indeed, denoting
[TABLE]
we follow the next line of thought. Since and \big{(}(-s)^{-\frac{1}{\gamma}+1}\big{)}^{\frac{\gamma}{1-\gamma}} are concave, from [8, Property 8] we have that is concave (basically, [8, Property 8] says that if and are positive concave functions, that is concave). Thus is concave, as sum of two concave functions. Then using Proposition A.3, we have that is convex. Employing Proposition A.4, we get the claim that is harmonic concave. Thus . We use (A.2) to obtain that
[TABLE]
It follows from Theorem 2.10 that is convex, thus is -concave. This concludes the proof of the Theorem. ∎
Remark 4.5** (Quasilinear equations).**
Assume that is a function of class such that there exists with for all . Let be the unique solution to
[TABLE]
which is smooth and strictly increasing. Consider the quasilinear problem
[TABLE]
Then, it is possible to associate to (4.3) the semilinear problem
[TABLE]
where
[TABLE]
In fact, a direct computation shows that if is a classical solution to problem (4.4), then is a classical solution to problem (4.3) and vice versa. In particular, one can apply Theorem 4.3 and get information about the approximate concavity of from the harmonic concavity of . Of course the concavity of the solution depends also upon .
Appendix A
In this section, we give some properties related to -harmonic concavity. In the first lemma, we establish a sub-additivity property of the harmonic concavity function.
Lemma A.1**.**
Let . Then at all points for which one of the conditions (2.2) holds for
[TABLE]
Furthermore, at all points for which one of the conditions (2.2) holds for , then
[TABLE]
Proof.
Recalling that (and is th convex combination of ), for simplicity, we write
[TABLE]
When for we have or or all or then
[TABLE]
Otherwise, for and we compute
[TABLE]
considering the function
[TABLE]
Denoting for we have that
[TABLE]
We apply the Lagrange mean value theorem: for ,
[TABLE]
so we obtain
[TABLE]
Hence, we get
[TABLE]
which concludes the proof of (A.1).
To prove (A.2), we use (A.1) for and and we obtain that
[TABLE]
hence the result. This concludes the proof of the Lemma. ∎
As an outcome of the previous lemma, we obtain also the following estimates.
Corollary A.2**.**
Let . If then at all points for which one of the conditions (2.2) holds for
[TABLE]
If furthermore there exist such that , , then
[TABLE]
Proof.
The proof follows immediately by estimating {\lambda g_{1}h_{3}^{2}+(1-\lambda)g_{3}h_{1}^{2}}\big{(}\lambda h_{3}+(1-\lambda)h_{1}\big{)}^{-2} in line two of formula (LABEL:stt). ∎
The next proposition is the approximate concavity adaptation of [8, Lemma A.2].
Proposition A.3**.**
**
- (1)
Let be constants and let be -concave and . Then the map is -convex jointly in the two variables . 2. (2)
Let be concave. Then the map is convex jointly in the two variables .
Proof.
We take any and denote as usual and and . Then, given that
[TABLE]
(notice that the right hand side term is strictly positive) we obtain
[TABLE]
We have that
[TABLE]
It follows that
[TABLE]
for , hence the conclusion. The second point is obvious if one takes . ∎
It is a known result that if for a positive function we have that is convex, then itself results harmonic concave. We can establish an approximate concavity analogue if we take bounded from above.
Proposition A.4**.**
**
- (1)
Let be constants. Let be -concave and . Then if is jointly -convex, then is -harmonic concave. 2. (2)
Let be concave. Then if is jointly convex, then is harmonic concave.
Proof.
Consider any and take and , as usual and . Then putting
[TABLE]
we have by definition
[TABLE]
Then
[TABLE]
implies that
[TABLE]
This concludes the proof of the proposition, as the second point corresponds to and it is easily seen. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H.J. Brascamp, E. Lieb, On extensions of the Brunn-Minkowski and Prekopa-Leindler theorems, including inequalities for log concave functions, and with an application to the diffusion equation, J. Funct Anal. 22 (1976), 366–389.
- 2[2] L.A. Caffarelli, J. Spruck, Convexity properties of solutions to some classical variational problems, Comm. Partial Differential. Equat. 7 (1982), 1337–1379.
- 3[3] L.A. Caffarelli, A. Friedman, Convexity of solutions of semilinear elliptic equations, Duke Math. J. 52 (1985), 431–456.
- 4[4] A. Colesanti, P. Salani, Quasi-concave envelope of a function and convexity of level sets of solutions to elliptic equations, Math. Nachr. 258 (2003), 3–15.
- 5[5] P. Cuoghi, P. Salani, Convexity of level sets for solutions to nonlinear elliptic problems in convex rings, Electron. J. Diff. Equations 124 (2006), 1–12.
- 6[6] D.H. Hyers, S.M. Ulam, Approximately convex functions, Proc. Amer. Math. Soc. , 3 (1952), 821–828.
- 7[7] B. Kawohl, Rearrangements and convexity of level sets in PDE , Lecture Notes in Mathematics, 1150 (1985), iv+136.
- 8[8] A.U. Kennington, Power concavity and boundary value problems, Indiana J. Math. 34 (1985), 687–704.
