Convexity of level sets and a two-point function
Ben Weinkove

TL;DR
This paper introduces a maximum principle for a two-point function to analyze the convexity of level sets of harmonic functions, leading to a strict convexity result related to principal curvature.
Contribution
It develops a novel maximum principle for two-point functions to study convexity properties of harmonic function level sets.
Findings
Proves a maximum principle for a two-point function.
Establishes strict convexity of level sets based on principal curvature.
Links convexity of level sets to harmonic functions' geometric properties.
Abstract
We establish a maximum principle for a two-point function in order to analyze the convexity of level sets of harmonic functions. We show that this can be used to prove a strict convexity result involving the smallest principal curvature of the level sets.
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.
Convexity of level sets
and a two-point function
Ben Weinkove
Department of Mathematics, Northwestern University, 2033 Sheridan Road, Evanston, IL 60208
Abstract.
We establish a maximum principle for a two-point function in order to analyze the convexity of level sets of harmonic functions. We show that this can be used to prove a strict convexity result involving the smallest principal curvature of the level sets.
MSC 35J05, 31B05. Keywords: convexity, level sets, harmonic functions, principal curvature. Supported in part by National Science Foundation grant DMS-1406164.
1. Introduction
The study of the convexity of level sets of solutions to elliptic PDEs has a long history, starting with the well-known result that the level curves of the Green’s function of a convex domain in are convex [1]. In the 1950s Gabriel [13] proved the analogous result in 3 dimensions and this was extended by Lewis [20] and later Caffarelli-Spruck [10] to higher dimensions and more general elliptic PDEs. These results show that for a large class of PDEs, there is a principle that convexity properties of the boundary of the domain imply convexity of the level sets of the solution .
There are several approaches to these kinds of convexity results (see for example [16, Section III.11]). One is the “macroscopic” approach which uses a globally defined function of two points (which could be far apart) such as . Another is the “microscopic” approach which computes with functions of the principal curvatures of the level sets at a single point. This is often used together with a constant rank theorem. There is now a vast literature on these and closely related results, see for example [2, 4, 5, 6, 7, 8, 9, 12, 15, 17, 18, 19, 25, 26, 27, 28, 29] and the references therein.
It is natural to ask whether these ideas can be extended to cases where the boundary of the domain is not convex. Are the level sets of the solution at least as convex as the boundary in some appropriate sense? In this short note we introduce a global “macroscopic” function of two points which gives a kind of measure of convexity and makes sense for non-convex domains. Our function
[TABLE]
is evaluated at two points , which are constrained to lie on the same level set of . Under suitable conditions, a level set of is convex if and only if this quantity has the correct sign on that level set. We prove a maximum principle for this function using the method of Rosay-Rudin [25] who considered a different two-point function
[TABLE]
In addition, we show that our “macroscopic” approach can be used to prove a “microscopic” result. Namely, we localize our function and show that it gives another proof of a result of Chang-Ma-Yang [11] on the principal curvatures of the level sets of a harmonic function . In this paper, we consider only the case of harmonic functions. However, we expect that our techniques extend to some more general types of PDEs.
We now describe our results more precisely. Let and be bounded domains in with . Define . Assume that satisfies
[TABLE]
and
[TABLE]
It is well known that (1.4) is satisfied if and are both starshaped with respect to some point . A special case of interest is when both and are convex, but this is not required for our main result.
To introduce our two-point function, first fix a smooth function satisfying
[TABLE]
For example, we could take for . Then define
[TABLE]
restricted to in
[TABLE]
Comparing with the Rosay-Rudin function (1.2), note that the function does not require and makes sense whether or not or are convex. Taking , the level set is convex if and only if the quantity is nonpositive on . If for then implies strict convexity of the level set. More generally gives quantitative information about the convexity of the level sets , relative to the gradient .
We also remark that the function (1.6) looks formally similar to the two-point function of Andrews-Clutterbuck, a crucial tool in their proof of the fundamental gap conjecture [3]. However, here and are constrained to lie on the same level set of and so the methods of this paper are quite different.
Our main result is:
Theorem 1.1**.**
* does not attain a strict maximum at a point in the interior of .*
Roughly speaking, this result says that the level sets for are “the least convex” when or . As mentioned above, the result holds even in the case that and are non-convex.
The proof of Theorem 1.1 follows quite closely the paper of Rosay-Rudin [25]. Indeed a key tool of [25] is Lemma 2.1 below which gives a map from points to points with the property that lie on the same level set.
Next we localize our function (1.6) to prove a strict convexity result on the level sets of . If we assume now that and are strictly convex, we can apply the technique of Theorem 1.1 to obtain an alternative proof of the following result of Chang-Ma-Yang [11].
Theorem 1.2**.**
Assume in addition that and are strictly convex and . Then the quantity attains its minimum on the boundary of , where is the smallest principal curvature of the level sets of .
Note that many other strict convexity results of this kind are proved in [11, 14, 21, 22, 23, 24, 30] and other papers using microscopic techniques.
The author thanks G. Székelyhidi for some helpful discussions and the referee for useful comments.
2. Proof of Theorem 1.1
First we assume that is even. We suppose for a contradiction that attains a maximum at an interior point, and assume that . Then we may choose sufficiently small so that
[TABLE]
still attains a maximum at an interior point.
We use a lemma from [25]. Suppose is an interior point with . We may assume that and are nonzero vectors. Let be an element of with the property that
[TABLE]
Note that there is some freedom in the definition of . We will make a specific choice later. Rosay-Rudin show the following (it is a special case of [25, Lemma 1.3]).
Lemma 2.1**.**
There exists a real analytic function so that for all sufficiently close to the origin,
[TABLE]
where is a harmonic function defined in a neighborhood of the origin in , given by
[TABLE]
Proof of Lemma 2.1.
We include the brief argument here for the sake of completeness. Define a real analytic map which takes sufficiently close to the origin to
[TABLE]
for and defined by (2.1), (2.2) and (2.3). Note that and, by the definition of ,
[TABLE]
where here and henceforth we are using the convention of summing repeated indices.
Hence by the implicit function theorem there exists a real analytic map defined in a neighborhood of the origin in to with such that for all . It only remains to show that .
Write , and so that and . Then at ,
[TABLE]
and evaluating at gives and hence for all .
Differentiating (2.4) and evaluating at , we obtain for all ,
[TABLE]
Hence , as required. ∎
Now assume that achieves a maximum at the interior point . Write and and
[TABLE]
To prove the lemma it suffices to show that , where we write . Observe that
[TABLE]
Hence, evaluating at [math], we get
[TABLE]
First compute
[TABLE]
using the Cauchy-Schwarz inequality and the condition (1.5).
Next, at ,
[TABLE]
where for the second line we used the fact that and . Hence, combining the above,
[TABLE]
Now we use the fact that is even, and we make an appropriate choice of following Lemma 4.1(a) of [25]. Namely, after making an orthonormal change of coordinates, we may assume, without loss of generality that is , and
[TABLE]
for some . Here we are writing and etc for the standard unit basis vectors in . Then define the isometry by
[TABLE]
In terms of entries of the matrix , this means that for and for , we have
[TABLE]
with all other entries zero. Then
[TABLE]
Similarly This completes the proof of Theorem 1.1 in the case of even.
For odd, we argue in the same way as in [25]. Let be an isometry of the even-dimensional , defined in the same way as above, but now with
[TABLE]
In Lemma 2.1, replace by . Define to be the projection and replace (2.2) and (2.3) by
[TABLE]
where and is given by
[TABLE]
As in [25], note that if is harmonic in then is harmonic in . In particular, is harmonic in a neighborhood of the origin in . The function above becomes with , and we make similar changes to . It is straightforward to check that the rest of the proof goes through.
Remark 2.1*.*
The proof of Theorem 1.1 also shows that when the quantity does not attain a strict interior minimum.
3. Global to Infinitesimal
Here we give a proof of Theorem 1.2 using the quantity . We first claim that, for and ,
[TABLE]
if and only if
[TABLE]
Indeed, to see this, first choose coordinates such that at we have and is diagonal with
[TABLE]
For the “if” direction of the claim choose such that , for small. By Taylor’s Theorem,
[TABLE]
giving , which is the same as . Indeed from a well-known and elementary calculation (see for example [11, Section 2]),
[TABLE]
at . Hence . The “only if” direction of the claim follows similarly.
We will make use of this correspondence in what follows.
Proof of Theorem 1.2.
By assumption, on . It follows from Theorem 1.1 and the discussion above that the level sets of are all strictly convex. Assume for a contradiction that achieves a strict (positive) minimum at a point in the interior of , say
[TABLE]
We may assume without loss of generality that . Indeed, if not then if lies on the level set for some we can replace by a convex ring for with . We still denote by the minimum value of on the boundary of this new . For appropriately chosen we have (3.1) and . This changes the boundary conditions on and to and , but this will not affect any of the arguments.
Pick sufficiently small, so that the distance from to the boundary of is much larger than , and in addition, so that .
Consider the quantity
[TABLE]
and restrict to the set
[TABLE]
Suppose that attains a maximum on at a point . First assume that lies in the boundary of . There are two possible cases:
- (1)
If with and in (note that since , if one of is a boundary point then so is the other) then since on we have
[TABLE]
Hence in this case . 2. (2)
If then since everywhere,
[TABLE]
by the assumption .
We claim that neither case can occur. Indeed, consider for small, where is vector in the direction of the smallest curvature of the level set of and satisfies (3.1). Then since ,
[TABLE]
If say then since we assume . Since here is larger than in (1) or (2), this rules out (1) or (2) as being possible cases for the maximum of .
This implies that must attain an interior maximum, contradicting the argument of Theorem 1.1. Here we use the fact that if then for with ,
[TABLE]
This completes the proof. ∎
Remark 3.1*.*
In [11] and also [23] it was shown that when the smallest principal curvature also satisfies a minimum principle. It would be interesting to know whether a modification of the quantity (1.6) can give another proof of this.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Ahlfors, L.V. Conformal invariants: Topics in geometric function theory , Mc Graw-Hill Series in Higher Mathematics. Mc Graw-Hill Book Co., New York-Düsseldorf-Johannesburg, 1973
- 2[2] Alvarez, O., Lasry, J.-M., Lions, P.-L. Convex viscosity solutions and state constraints , J. Math. Pures Appl. (9) 76 (1997), no. 3, 265–288
- 3[3] Andrews, B., Clutterbuck, J. Proof of the fundamental gap conjecture , J. Amer. Math. Soc. 24 (2011), no. 3, 899–916
- 4[4] Bian, B., Guan, P. A microscopic convexity principle for nonlinear partial differential equations , Invent. Math. 177 (2009), 307–335
- 5[5] Bianchini, C., Longinetti, M., Salani, P. Quasiconcave solutions to elliptic problems in convex rings , Indiana Univ. Math. J., 58 (2009), 1565–1590
- 6[6] Borell, C. Brownian motion in a convex ring and quasiconcavity , Comm. Math. Phys. 86 (1982), no. 1, 143–147
- 7[7] Brascamp, H.J., Lieb, E.H. On extensions of the Brunn-Minkowski and Prékopa-Leindler theorems, including inequalities for log concave functions, and with an application to the diffusion equation , J. Functional Analysis 22 (1976), no. 4, 366–389
- 8[8] Caffarelli, L., Friedman, A. Convexity of solutions of some semilinear elliptic equations , Duke Math. J. 52 (1985), 431–455
