Min-max formulas for nonlocal elliptic operators on Euclidean space
Nestor Guillen, Russell Schwab

TL;DR
This paper revisits the min-max representation of nonlocal elliptic operators satisfying the Global Comparison Property in Euclidean space, clarifying the proof and extending results for operators with translation invariance or spatial regularity.
Contribution
It simplifies the proof of min-max formulas for nonlocal elliptic operators in Euclidean space and introduces new results for translation-invariant and spatially regular operators.
Findings
Clarified proof of min-max representation in Euclidean space
Extended results to translation-invariant operators
Established new properties for spatially regular operators
Abstract
An operator satisfies the Global Comparison Property if anytime a function touches another from above at some point, then the operator preserves the ordering at the point of contact. This is characteristic of degenerate elliptic operators, including nonlocal and nonlinear ones. In previous work, the authors considered such operators in Riemannian manifolds and proved they can be represented by a min-max formula in terms of L\'evy operators. In this note we revisit this theory in the context of Euclidean space. With the intricacies of the general Riemannian setting gone, the ideas behind the original proof of the min-max representation become clearer. Moreover, we prove new results regarding operators that commute with translations or which otherwise enjoy some spatial regularity.
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.
Min-max formulas for nonlocal elliptic operators on Euclidean Space
Nestor Guillen
and
Russell W. Schwab
Department of Mathematics
University of Massachusetts, Amherst
Amherst, MA 01003-9305
Department of Mathematics
Michigan State University
619 Red Cedar Road
East Lansing, MI 48824
(Date: Monday 18th February, 2019 (This is the revised version per referee suggestions.))
Abstract.
An operator satisfies the Global Comparison Property if anytime a function touches another from above at some point, then the operator preserves the ordering at the point of contact. This is characteristic of degenerate elliptic operators, including nonlocal and nonlinear ones. In previous work, the authors considered such operators in Riemannian manifolds and proved they can be represented by a min-max formula in terms of Lévy operators. In this note we revisit this theory in the context of Euclidean space. With the intricacies of the general Riemannian setting gone, the ideas behind the original proof of the min-max representation become clearer. Moreover, we prove new results regarding operators that commute with translations or which otherwise enjoy some spatial regularity.
Key words and phrases:
Global Comparison Principle, Integro-differential operators, Isaacs equation, Whitney extension, Dirichlet-to-Neumann, fully nonlinear equations
2010 Mathematics Subject Classification:
35J99, 35R09, 45K05, 46T99, 47G20, 49L25, 49N70, 60J75, 93E20
The authors gratefully acknowledge partial support from the National Science Foundation while this work was in progress: N. Guillen DMS-1700307 and R. Schwab DMS-1665285. The authors also thank the anonymous referee for some suggestions that we believe improved the presentation of our results.
1. Introduction
A map is said to satisfy the Global Comparison Property (GCP) if
[TABLE]
The Laplacian operator, as well as its fractional powers () all satisfy this property. More generally, given a Lévy measure (a measure on such that is integrable with respect to ) the operator
[TABLE]
will have the GCP. The GCP is also satisfied by Dirichlet-to-Neumann maps for elliptic equations, generators of Markov processes, Bellman-Isaacs operators in control and differential games, among many examples. When the operator is known a priori to be local, then nonlinear examples of maps with the GCP are of the form,
[TABLE]
where is monotone in its first argument, and Lipschitz continuous in all arguments.
The main contribution of this article is to address when certain operators acting on must necessarily enjoy a structure similar to those examples above. The canonical object used to address this question will be a linear operator we choose to say is “of Lévy type”: those operators for which there exist functions, , , , and measures so that
[TABLE]
We will review some recent results that show for that enjoys the GCP, is Lipschitz, and has a natural structural constraint, there exists a family of functions, and linear operators of Lévy type, , so that
[TABLE]
For linear operators, in the 1960’s Courrège [19] showed that all of those that satisfy the GCP must have the form given in (1.2). All of our results here should be considered an extension of Courrège’s result to the nonlinear setting.
In our previous work, [29], we showed such a min-max representation in (1.3). The result in [29] in fact dealt with a more general situation where where is a complete Riemannian manifold. We will review the proof of this result in the context of Euclidean space, where many of the arguments simplify greatly. Moreover, we prove two refinements of the main result from [29] relevant to the Euclidean case, one involving translation invariant operators and one for operators that behave continuously with respect to translation operators. Stated informally, our results are the following:
Theorem 1**.**
An operator that is Lipschitz and satisfies the GCP admits a min-max formula in terms of Lévy type operators.
Theorem 2**.**
In the previous theorem, assume further that commutes with translations. Then the Lévy operators appearing in the min-max formula all commute with translations.
Theorem 3**.**
Instead of translation invariance assume that the finite differences of commute with translations up to a certain error depending on a modulus of continuity . Then the Lévy operators appearing in the min-max formula have continuous coefficients with common modulus of continuity of the form .
Theorem 1 above is a special case of the main result in [29], and Theorems 2 and 3 are new.
1.1. Assumptions and main results
Here are our main assumptions.
Assumption 1.1**.**
The map is Lipschitz continuous and has the Global Comparison Property (1.1).
Assumption 1.2**.**
The map is translation invariant. Namely, for any and we have
[TABLE]
Assumption 1.3**.**
There is a non-increasing function with as such that if are such that in , then
[TABLE]
Assumption 1.4**.**
There exists a modulus, , for all , , , we have
[TABLE]
It is allowed that as ; in some examples may be bounded and in some it may be unbounded.
The meaning of Assumption 1.1 and Assumption 1.2 is self-evident. Assumption 1.3 seems rather technical, but it will be necessary to obtain compactness for a family of measures arising in the proof (and this assumption is satisfied by a broad family of examples). Note however that this assumption is not needed for the translation invariant case as well as the setting of Theorem 1.9 as these two theorems are obtained with different methods.
Last but not least, Assumption 1.4 can be thought of as a “coefficient regularity” assumption. For instance, in the linear and local case, in which is a Lévy operator without integral part, Assumption 1.4 is equivalent to the coefficients of the operator having modulus of continuity for some constant . In fact, Assumption 1.4 is stated so that it indeed linearizes to this usual assumption that one expects in the linear case.
Remark 1.5**.**
As mentioned above, one can check that for linear operators, Assumption 1.4 is equivalent to the coefficients of the local part being uniformly continuous and the Lévy measures being uniformly continuous in the TV norm along shifts in the base point, i.e.
[TABLE]
By its design, Assumption 1.4 is a technical artifact of our proof, and as such, it is unlikely to be sharp or even the most natural assumption. There is most likely room for improvement here. In fact, one indication of the possibility to make a more natural assumption lies in the fact that even when the original operator, , is translation invariant (so the most regular dependence on ), it does not necessarily follow that also satisfies Assumption 1.4. This also reflects the fact that we have taken a two completely different methods of proof for the results that concern translation invariant operators, and ones that have a modulus with respect to translations.
Remark 1.6**.**
In Section 6, we give a short list of some operators that fall within the scope of Assumptions 1.1–1.4 and Theorems 1.9–1.14. At the end of Section 6, we give a list of which assumptions each example satisfies.
Remark 1.7**.**
We note that one subtle improvement of the current work upon our previous one in [29] is that because of a more streamlined proof for the translation invariant case, we were able to establish the non-translation invariant case, Theorem 1.9 (below), without the technical Assumption 1.3. This is purely an artifact of using an approximation scheme in [29] to treat all operators by the same method, and this turns out to have been not essential when one does not want the extra information provided by Theorems 1.11 and 1.14.
The first theorem uses the notion of “pointwise” or , and so we will define that property here.
Definition 1.8**.**
For a fixed we say that (“pointwise at ”) if there exists a vector, , and a symmetric matrix, , such that
[TABLE]
Similarly if only enjoys the existence of and
[TABLE]
we say that (“pointwise at ”).
Now we can restate Theorems 1–3 above, in more precise terms.
Theorem 1.9**.**
If satisfies Assumption 1.1, then, for each , there exists a family of linear functionals on that depend on and , called , so that for all
[TABLE]
Here, each , has the form
[TABLE]
and for some universal , the terms also satisfy the bound for all :
[TABLE]
The proof of Theorem 1.9 appears in Section 3.1, which is at the end of Section 3.
We want to point out to the reader that the notation in Theorem 1.9 is intentional in its use of subscripts for e.g. , etc. This is because our construction does not actually produce as a linear mapping , and so it is not correct to think of having a family of whose coefficients are actually functions of . Rather, it just says that at each there is a family functionals that have the desired structure, but it is not clear that they can be put together across all to make a family of -dependent operators.
This situation changes under other assumptions, and in the next two theorems, our method produces a family of linear operators mapping , all of the form (1.2).
Theorem 1.10**.**
If satisfies Assumption 1.1 and Assumption 1.2 then there exists a family, that depends only on , where for all , are constants, and are linear translation invariant operators mapping of the form (1.2) (i.e. constant coefficients), and for all and we have
[TABLE]
Furthermore, for a universal , for all and ,
[TABLE]
The proof of Theorem 1.10 appears in Section 3.1, which is at the end of Section 3.
Theorem 1.11**.**
If satisfies Assumption 1.1, Assumption 1.3, and Assumption 1.4, then, there exists a family, that depends only on , where for all , are functions, and are linear operators mapping of the form (1.2), and for all , we have
[TABLE]
and for a universal , for all and ,
[TABLE]
Furthermore, if is as in Assumption 1.4, then the functions all have a modulus of continuity , while for each we have the estimate,
[TABLE]
where as above, , is a constant that may possibly (but not necessarily) have the property that as .
The proof of Theorem 1.11 appears in Section 5.5, which is at the end of Section 5.
Finally, we give a theorem that reduces the possible terms in the min-max over (1.2). Namely, there are instances in which there may be no second order terms or first order terms. To state this, we abuse notation slightly, and we give a shorthand as to mean the following:
[TABLE]
Definition 1.12**.**
For a fixed , we say that (“pointwise ”) if the same requirements of Definition 1.8 hold, but the estimate on the right hand side takes into account the different decay as follows:
- •
if, , then has a second order Taylor expansion and the right hand side is ;
- •
if, , then has a second order Taylor expansion and the right hand side is ;
- •
if, , then we include this in the previous case whenever has a second order taylor expansion at ;
- •
if, , then has a first order Taylor expansion and the right hand side is ;
- •
if, , then has a first order Taylor expansion and the right hand side is ;
- •
if, , then we include this in the previous case whenever has a first order taylor expansion at ;
- •
if, , then .
Assumption 1.13**.**
All of Assumptions 1.1 – 1.4 hold, but with all instances of replaced by .
Theorem 1.14**.**
For each of Theorems 1.9, 1.10, 1.11, we have the following variation: in each case assume that satisfies Assumption 1.13, for some (as enumerated above). Then, taking into account Definition 1.12 for Theorem 1.9, the min-max formula holds in each of the previous results with the following additions: if then for all , while if then for all and the operators take the form
[TABLE]
Moreover, the smaller , the more regular the Lévy measures are at , namely, we have
[TABLE]
The proof of Theorem 1.14 appears in Section 5.5, which is at the end of Section 5.
Remark 1.15**.**
In Sections 4 and 5, one can see that at its heart, the fact that the modulus for is passed onto the coefficient functions in (1.2) is a consequence of our choice to use a Whitney extension in an approximation to , and the Whitney extension is well known to preserve a modulus of continuity. The actual details are a bit more involved, but that is the main reason. We note the presence of the factor of in the new modulus is a consequence of the Whitney Extension method; the interested reader can see [54, Chapter VI].
A further comment regarding the assumptions is in order. Suppose that satisfies Assumption 1.4 with . In this case, taking the assumption says that
[TABLE]
and if we further assume that is constant (i.e. applied to the zero function returns a constant), then we have
[TABLE]
that is, is translation invariant. However, at first sight it is not clear what happens in the reverse direction. That is, we do not know how to show that a translation-invariant operator automatically satisfies Assumption 1.4 with , and in fact we expect that this assumption can be modified so that it seamlessly includes the translation invariant operators as well.
1.2. Notation
For the readers’ convenience, a summary of symbols used in the paper is presented below.
[TABLE]
1.3. Background
There were roughly two reasons that motivated the results we present in this paper. First of all, the link between elliptic equations and a min-max formula for operators has a long history, and it has been exploited extensively in the case of local operators. Until [29], the connection was not known for nonlocal, nonlinear operators. Even so, the link between the two was natural enough that there are at least a few results that assumed a structure like (1.3), including [5], [35], [40], [47], [48], [51], among many others. Thus the theorems here and in [29] give a sort of a posteriori justification to min-max assumptions that appeared in earlier works. Secondly, a formula such as (1.3) can be very useful in connecting results about the integro-differential theory (of which, there has been a large volume recently) with some other pursuits that may not obviously relate to operators such as (1.2). Two recent projects that exploit or were motivated by the min-max formulas are on some Hele-Shaw type free boundary evolutions in [16] and some Neumann homogenization problems [30] [31]. Both of these relate to linear and nonlinear Dirichlet-to-Neumann maps, studied in [26], and there is plenty more to learn about the integro-differential structure in the nonlinear setting. The choice to pursue continuity properties such as the dependence given in (1.5), although a posteriori seems straightforward, was not initially obvious, and it was motivated by recent results about comparison theorems for viscosity solutions of integro-differential equations in [27].
As mentioned earlier, for linear operators, the representation of (1.2) goes back to Courrège [19]. This was naturally connected with generators of Markov processes and boundary excursion processes for reflected diffusions. Hsu [32] provides a similar representation for the Dirichlet to Neumann map for the Laplacian in a smooth domain , and this corresponds to studying the boundary process for a reflected Brownian motion. If is not necessarily linear but happens to satisfy the stronger local comparison principle, there are min-max results by many authors, e.g. Evans [21], Souganidis [53], Evans-Souganidis [22] and Katsoulakis [38]. In this case, the operator takes the form,
[TABLE]
which can be expressed as in Theorem 1.9, but with . This was extended to even include the possibility of weak solutions acting as a local semi-group on , related to image processing, in Alvarez-Guichard-Lions-Morel [1], and to weak solutions of sets satisfying an order preserving set flow by Barles-Souganidis in [6]. In [1] it was shown under quite general assumptions that certain nonlinear semigroups must be represented as the unique viscosity solution to a degenerate parabolic equation.
Although it is still too early to tell, one hopes that theorems like those presented here can create a bridge between some nonlocal equations for which regularity questions arise and the known results about such equations when a min-max structured is known to hold. In the local setting, there are a number of results that leverage the min-max to shed new light on certain issues, and it would be interesting to see if similar things can be done for the nonlocal theory (see the discussion in [29, Section 1] for an incomplete list of such results). The types of regularity results that could find new applications via the min-max theorems here fall into roughly three categories: Krylov-Safonov type results; regularity for translation invariant equations; and Schauder type regularity results. For Krylov-Safonov, this means that solutions of fully nonlinear equations can be shown to enjoy Hölder estimates depending only on the norm of the solution; some examples are: [9], [14], [15], [37], and [49], among many others. For translation invariant equations, these are the results that show solutions to translation invariant equations very often enjoy regularity under mild assumptions; some examples are: [9], [17], [41], [44], [50], among others. Finally, for Schauder regularity, we mean results that show that for -dependent operators, under certain regularity for the coefficients (such as Dini), solutions will have as much regularity as those equations with “constant coefficients”; some examples are: [20], [36], [43], among others. On top of questions of the type of Krylov-Safonov regularity mentioned above, there is another family of regularity results that accompanies existence and uniqueness techniques for viscosity solutions of elliptic partial-differential / integro-differential equations, and it is typically referred to as the Ishii-Lions method, going back to [34]. Both this Ishii-Lions regularity and comparison results could connect well with the operators treated in this paper, as many of the existing works on nonlocal equations assume a min-max. The types of results that could be applicable are like those in [2], [3], [4], [5], and [35], among others.
There is some more discussion of related works and background inside of the examples that we list in Section 6.
1.4. Another description of operators satisfying the GCP
Let us describe an elementary but useful way to view operators satisfying the GCP, which is also related to the min-max representation. First, we introduce a family of functional spaces.
Definition 1.16**.**
For (using the abuse of notation in (1.13)) we define the space as follows. First, if ,
[TABLE]
while for ,
[TABLE]
(We note the first space requires “Big-O”, while the second space requires “little-o”.) The spaces are Banach spaces, with norms given by
[TABLE]
Now, suppose we are given a continuous function
[TABLE]
Assume that this function is monotone (non-decreasing) with respect to the first two variables. Then, given define
[TABLE]
where we are using the notation for , and for . It is clear the operator thus defined has the GCP.
Do all operators with the GCP arise in this form? It is easy to see that the answer is positive, at least when . Given , with , we define a function
[TABLE]
by the formula . It is straightforward to see that for so defined and we have
[TABLE]
2. Real valued Lipschitz functions on Banach Spaces
In this section we review various well known facts about Lipschitz functions on Banach spaces, following Clarke’s book [18, Chapter 2]. We will refer most of the proofs to the relevant section in [18]. The section ends with Theorem 2.6 which yields a min-max formula for any real valued, Lipschitz , such a result is neither new nor surprising, but we present it here in complete detail for the sake of completeness.
We fix a Banach Space, denoted by , an open convex subset , and a function
[TABLE]
which is assumed Lipschitz with constant , that is
[TABLE]
Definition 2.1**.**
The upper gradient of at in the direction of , is defined as
[TABLE]
This can be seen as a function .
Proposition 2.2**.**
The function has the following properties
- (1)
For any , and we have . 2. (2)
For any , and we have . 3. (3)
If then . 4. (4)
.
Proof.
We refer the reader to [18, Proposition 2.1.1]. ∎
Definition 2.3**.**
The generalized gradient of at is the subset of given by
[TABLE]
We will denote by the convex hull of the union of ,
[TABLE]
Proposition 2.4**.**
The set , , has the following properties
- (1)
* is a non-empty, convex, -compact subset of .* 2. (2)
* for every .* 3. (3)
For any , we have that
[TABLE]
Proof.
We refer the reader to [18, Proposition 2.1.2].
∎
The following theorem, due to Lebourg, is a generalization of the mean value theorem for differentiable functions.
Theorem 2.5** (Lebourg’s Theorem).**
Let be points in . Then there exist of the form for some , such that for some
[TABLE]
Proof.
We refer the reader to [18, Theorem 2.3.7].
∎
Using the generalized gradient and Lebourg’s theorem we can easily prove a min-max formula for Lipschitz functionals. Observe this is a general result for Lipschitz functionals in general Banach spaces, and it does not involve anything like GCP (functionals with the GCP on are considered in the next section).
Theorem 2.6**.**
Let be a Lipschitz function, with convex, then for all ,
[TABLE]
Proof.
According to Theorem 2.5, given there is some such that
[TABLE]
In other words, for any and in we have the inequality
[TABLE]
This also yields an equality for , thus .
∎
3. Functionals with the GCP, revisited
Throughout this section denotes an open convex set of (see (1.13)). Moreover, for , we shall write
[TABLE]
Definition 3.1**.**
Let be a map and . Such a functional is said to have the Global Comparison Property with respect to if for any pair of functions such that for all and –we will say in such a case that touches from above at .
The following two auxiliary functions will be useful throughout the section: Fix , a nondecreasing function such that , for , for . Then, given we define the functions
[TABLE]
The following Proposition was first proved in [29, Lemma 4.15, Corollary 4.16], we review the proof here for the reader’s convenience.
Proposition 3.2**.**
Suppose that is a Lipschitz functional which has the with respect to . Fix . There is a constant such that given , , and , then
[TABLE]
Remark 3.3**.**
It is worth comparing Proposition 3.2 with Assumption 1.3. In the latter, one is interested in how depends very little on the values of far away from (so, as ), whereas the former deals with a weak version of this property that holds only for but which follows alone from the GCP without the need for further assumptions on .
Proof.
Take , such that and . Then, for any we have
[TABLE]
with the above being an equality for . Now, let be chosen so that
[TABLE]
Then, let us suppose that are such that . In this case, we have since and in this case the GCP says that
[TABLE]
Moreover, and , thus
[TABLE]
Consider the function . Thanks to , the following estimates hold
[TABLE]
Substituting these in the inequality for , the desired inequality follows when is no larger than . Otherwise, and iterating the inequality in the previous case one obtains that
[TABLE]
∎
Lemma 3.4**.**
Let be a Lipschitz functional which has the GCP with respect to . Then, for every we have
[TABLE]
In other words, if has the GCP with respect to , then any arising as a generalized gradient of also has the GCP with respect to . Furthermore, for any such and we have
[TABLE]
Proof.
Let , and let be such that
[TABLE]
Then, touches from below at for each small , therefore for every , and
[TABLE]
Since,
[TABLE]
it follows that for any , and the first part of the Lemma is proved. For the second part, one argues similarly, except that instead of invoking the GCP, one applies Proposition 3.2 in order to pass the same estimate for any . ∎
Fix a functional having the GCP with respect to . Then, define by
[TABLE]
This associates a constant to any having the GCP. Likewise, we shall associate a vector and positive semi-definite matrix . First, let us introduce some notation,
[TABLE]
Given , define the function
[TABLE]
For we will simply write . Observe that, for example, if then is a smooth function which, in a neighborhood of , coincides with the second order Taylor polynomial of the function at the point .
Definition 3.5**.**
Given any let be the vector defined by
[TABLE]
At the same time, given let be the symmetric matrix defined by
[TABLE]
The following lemmas will characterize all of functionals having the GCP with respect [math] (compare with Courrege’s original proof [19], see also [29]).
Lemma 3.6**.**
Let be a bounded linear functional which has the GCP with respect to [math], and (defined in (3.4)). There is a positive measure on with
[TABLE]
such that for any we have the following representation,
[TABLE]
(The notation, and , appears in Definition 1.8.)
Remark 3.7**.**
We want to note that the dependence of only on is not a typo. Even though the vector and matrix clearly depend on the functions and , the reader can see in the proof in (3.9) that does not depend on or .
Proof.
It suffices to prove the representation formula for (even if ), as it trivially extends to all of by approximation. We fix . We recall is defined in (3.8). Since for each fixed , we may write
[TABLE]
and linearity gives
[TABLE]
Let us study each of these two terms. Using the definition of and , we have for
[TABLE]
as well as the corresponding expressions in the other cases when . Next, we analyze the second term in the expression for above, that is
[TABLE]
First take the case . Given , define by
[TABLE]
Observe that since , the function belongs to . The linear transformation defines a linear functional via the relation
[TABLE]
This clearly defines a bounded functional on . In fact, however, this functional extends uniquely to a bounded functional in : since is touched from above at [math] by the function , the GCP guarantees that
[TABLE]
This shows is a uniquely defined continuous functional on whose norm as a functional on is no larger than . It follows there is a measure such that
[TABLE]
Moreover, since whenever , is a non-negative measure. Now, since , we have that the function
[TABLE]
remains continuous as , so and thus is well defined. In this case, we have
[TABLE]
and we obtain the formula
[TABLE]
In particular, taking , it follows that
[TABLE]
and
[TABLE]
Revisiting the expression of , we have when
[TABLE]
and the analogous formulas follow for the other cases where , per the change in definition of the function in (3.8). It remains to consider the case .
Since is not a function, we are going to approximate it by a more regular function. For every small we repeat the argument above with and conclude that for some we have the formula
[TABLE]
and this measure is positive and satisfies the bound
[TABLE]
Since
[TABLE]
it follows that the respective finite measures have uniformly bounded mass. Therefore, it is not difficult to show (using to get tightness for the ) that along a subsequence we can find a limit , and if we let then
[TABLE]
and again, for any ,
[TABLE]
∎
We consider the following special functions. For , define (see (3.2) for definition of )
[TABLE]
Note that inside and outside , while inside and outside . Furthermore, we note that implies that .
Lemma 3.8**.**
Assume that , is a bounded linear functional with the GCP with respect to [math], and that , are as in Definition 3.5. Taking as in (3.11), the limit
[TABLE]
exists for all , and if . Moreover, if is as in (3.10), there is a sequence such that the following limit exists
[TABLE]
Proof.
Let and such that . Then for any positive semi-definite we have
[TABLE]
Since has the GCP with respect to [math], it follows that
[TABLE]
From this monotonicity and the elementary inequality we conclude that the following limit exists for every positive semi-definite
[TABLE]
At the same time, when we have as for all , so in this case the limit is zero. Now, given a symmetric matrix , write , where both and are positive semi-definite. Then, we also have that the limit
[TABLE]
exists for any symmetric matrix . It is clear then that this limit is linear as a function of , and therefore, there is a unique symmetric matrix such that
[TABLE]
Moreover, this matrix is positive semi-definite and as , and when . It remains to analyze the limit of along a subsequence. For every
[TABLE]
Now, recall the estimate from Lemma 3.4, which implies
[TABLE]
A direct computation shows that
[TABLE]
It follows that
[TABLE]
and by compactness, there must be a subsequence for which converges.
∎
Lemma 3.9**.**
Assume that . Let be a bounded linear functional which has the GCP with respect to [math]. For and any , we have the representation
[TABLE]
This representation is unique. This means that if there were , , and a measure in all such that
[TABLE]
for all , then , , , and . Furthermore, if and , then , and if , then and the integrand on the right can be replaced with just .
Proof.
Let . Applying Lemma 3.6 with the functions and ,
[TABLE]
Since is integrable against , it follows that
[TABLE]
Therefore,
[TABLE]
Then, thanks to Lemma 3.8, the formula for becomes (for every fixed )
[TABLE]
Now, let be chosen so that (which can be done thanks to Lemma 3.8). From the definition of , we have that
[TABLE]
At the same time, for every we have
[TABLE]
Therefore, by monotone convergence we have
[TABLE]
From where it follows that
[TABLE]
as claimed. It remains to prove the uniqueness part. For this, it is enough to show that if for all we have and
[TABLE]
then . First, consider any with compact support which is disjoint from , for such a we have
[TABLE]
Since can be any function with compact support in , it follows that . Evaluating at the function we obtain . Lastly, evaluating at all of the functions of the form , and , symmetric matrix, we see that for any vector and for any symmetric matrix , so that and .
∎
By a simple change of variables, Lemma 3.9 implies the following.
Corollary 3.10**.**
Assume that is fixed, , and let be a bounded linear functional which has the GCP with respect to . For any we have the representation
[TABLE]
As before, this representation is unique, and when and , we have , while for we have and the integrand can be replaced with just .
3.1. Proofs of Theorems 1.9 and 1.10
With Lemmas 3.4 and 3.9 and Corollary 3.10 in hand, we can now prove Theorems 1.10 and 1.9.
Proof of Theorem 1.10.
Consider the functional,
[TABLE]
Now, by Theorem 2.6, we have that
[TABLE]
By Lemma 3.4, each is a linear operator having the GCP with respect to [math], in which case Lemma 3.9 says that for ,
[TABLE]
The translation invariance of boils down to the identity
[TABLE]
Therefore,
[TABLE]
However, has a simple expression, namely
[TABLE]
and this proves the theorem. ∎
Proof of Theorem 1.9.
The beginning of the proof is similar to that of the previous one. For each , define a functional
[TABLE]
Applying Theorem 2.6, it follows that
[TABLE]
Applying Lemma 3.4, it follows that for any
[TABLE]
Since this proves the Theorem, with .
∎
Remark 3.11**.**
It is worthwhile to compare the proof of Theorem 1.9 above to the much longer and complicated one given in [29]. The simplicity here is made possible by the use of a mean value theorem for Lipschitz functionals (Theorem 2.5) in the infinite dimensional setting, which suffices to prove Theorem 1.9 as it involves a min-max formula in terms of linear functionals in and not linear operators from to . The more complicated method from [29] is however still of value, specially if one is interested in obtaining a min-max representation in terms of a family of linear operators from to . Moreover, it is by adapting the method from [29] that we are able to prove Theorem 1.11, after analyzing the spatial properties of the finite dimensional approximations (see in Section 5).
4. Finite Dimensional Approximations to
4.1. Graph approximations
The following nested family of sets will be important in what follows
[TABLE]
It will be convenient to write . Then, represents the maximum possible distance between and , and in particular for all . Observe that
[TABLE]
and note also the union of the sets is dense in .
Definition 4.1**.**
We consider the following function spaces
[TABLE]
These spaces will be related to by restriction, which we think of as a map denoted by and given by
[TABLE]
Remark 4.2**.**
The space is a finite dimensional vector space.
4.2. Cube decomposition and partition of unity
In this section we shall apply the Whitney theory to extend functions in a grid to all of . Since it is in our interest for the Whitney construction to be compatible with the grid structure, we shall do the usual cube decomposition making sure the resulting family of cubes is invariant under translations by vectors in , the resulting construction is illustrated in Figure 1.
Lemma 4.3**.**
For every , there exists a collection of cubes such that
- (1)
The cubes have pairwise disjoint interiors. 2. (2)
The cubes cover 3. (3)
** 4. (4)
For every , there is a bijection such that for every .
Proof.
We consider the case , once the collection of cubes is obtained in this case, the general case follows via scaling by taking the family .
Consider the cube , let denote the family of equal size cubes obtained from by bisecting each of its sides. Let denote the family of cubes obtained from applying this same procedure to each of the cubes in . Note that the side length of each cube in is just . Now, we construct a family as follows, with for each , then
[TABLE]
Observe that if then for some and there is some such that and . This means,
[TABLE]
and since , we conclude that
[TABLE]
On the other hand, we have that
[TABLE]
If denotes the subfamily of maximal cubes in , it follows that: the union of these cubes is still , the inequality holds for each , and the cubes have pairwise disjoint interiors.
Denote by an enumeration of the family of cubes of the form , where and . It is clear that covers all of and that these cubes have pairwise disjoint interiors. Furthermore, for any the map gives a bijection of the set onto itself, therefore one can represent it via a bijection so that . Last but not least, as each cube of the form is closest to than to any other point in , property (3) follows from the respectively inequality for the family .
∎
Remark 4.4**.**
We apply Lemma 4.3 with , for some , and for the rest of the section shall refer to the resulting cubes as .
Furthermore, for every and , we will denote the center of by , and for each and we will denote by the unique point in such that
[TABLE]
(note that there is only one since by construction not a single center lies at equidistance to two different lattice points).
In particular, for each of the bijections from Lemma 4.3 we have
[TABLE]
Remark 4.5**.**
In all what follows, given a cube , we shall denote by the cube with same center as but whose sides are increased by a factor of . Observe that for every and , we have , and that any given lies in at most some number of the cubes .
Proposition 4.6**.**
For every , there is a family of functions such that
- (1)
* for every and outside (using the notation in Remark 4.5)* 2. (2)
* for every .* 3. (3)
There is a constant , independent of and , such that
[TABLE] 4. (4)
For every , we have
[TABLE]
where are the bijections introduced above.
Proof.
Fix a function such that
[TABLE]
Let denote the common length for the sides of , and with as given in Remark 4.4 we define
[TABLE]
Consider the function
[TABLE]
It follows from Remark 4.5 that given any ,at most of the terms appearing in the sum are non-zero in a neighborhood of , and therefore is a smooth function. Then, define
[TABLE]
It is clear that the functions satisfy properties (1) and (2). Property (3) follows easily from the chain rule, using the differentiability of the function . It remains to check property (4), let , then
[TABLE]
where we used that , which follows clearly from the definition of . ∎
4.3. Discrete derivatives
In what follows, it will be in our interest to approximate the first and second derivatives of a function (see (1.13) for our convention regarding the meaning of ) at a point using only information about the values of on . This motivates the following two definitions (we recall that ).
Definition 4.7**.**
The vector is defined via the system of equations ()
[TABLE]
Definition 4.8**.**
The matrix is defined via the system of equations (),
[TABLE]
Remark 4.9**.**
From the definition it is clear that these discrete derivatives commute with translations with respect to a vector . That is, given a function and then for every we have
[TABLE]
Depending on how regular the function is, these discrete derivative operators enjoy quantitative “continuity estimates” as functions on . An important point being that these estimates are uniform in once is fixed.
Proposition 4.10**.**
There is a universal constant such that for and ,
[TABLE]
Proof.
See appendix.
∎
Proposition 4.11**.**
Fix . Then, given , we have
[TABLE]
Proof.
See appendix.
∎
4.4. The Whitney Extension and Projection operators.
Definition 4.12**.**
[TABLE]
We are now ready to define the Whitney extension operator.
[TABLE]
The projector operator is given by
[TABLE]
where we recall that (Definition 4.1).
Theorem 4.13**.**
There is a constant such that for any and any we have
[TABLE]
Proof.
This follows arguing exactly as in [54, Chapter VI, Theorem 3 and 4], making use of the regularity estimates in Proposition 4.11. Since this is a standard argument, we omit the details. ∎
Proposition 4.14**.**
Let and , then.
[TABLE]
Proof.
Let us show that for every and . Note that if then the equality is trivial, so let us take and , then we have
[TABLE]
Furthermore, it is not difficult to check that (see Remark 4.9)
[TABLE]
while part (4) of Proposition 4.6 implies that
[TABLE]
From these two identities we conclude that
[TABLE]
where we used that is bijective, this proves the proposition. ∎
Remark 4.15**.**
Given there is a such that for every , , and unit vector there is some and such that
[TABLE]
Indeed, this follows from the fact that and that is a -net in , so there is such that . Then, the inequalities for follow from two applications of the triangle inequality and the fact that and for all .
Proposition 4.16**.**
Let be such that for every and such that at some . Then, there is a universal such that
[TABLE]
Here, for a given symmetric matrix , denotes it’s negative part.
Proof.
Fix any . Thanks to Proposition 4.10 and the fact that we have
[TABLE]
Since , and by assumption,
[TABLE]
It is easy to see there is some such that and
[TABLE]
and therefore,
[TABLE]
Combining these inequalities and recalling Theorem 4.13 it follows that
[TABLE]
This proves the estimate for the gradient when . Now assume , the beginning of the argument in this case goes along similar lines. For any we have that
[TABLE]
where we have once again used Theorem 4.13. Thus, since and for ,
[TABLE]
Now, since we are on a lattice, it is obvious that for any we have that . In this case we can add up the inequalities for and , and conclude that
[TABLE]
Since , we conclude that
[TABLE]
Let be a unit vector such that
[TABLE]
According to Remark 4.15, there is and such that
[TABLE]
For this we have
[TABLE]
This, together with the previous step, shows that
[TABLE]
again having used Theorem 4.13. Simplifying, this becomes
[TABLE]
Choosing , and noting , we conclude that
[TABLE]
∎
We fix an auxiliary function , with , and
[TABLE]
The function , as well as the following two estimates, will be useful in the next section. Essentially, should be thought of as a smooth replacement for .
Lemma 4.17**.**
Let , and consider and such that
[TABLE]
Then, there is a function such that , and
[TABLE]
for some constant .
Remark 4.18**.**
For , it is straightforward that in guarantees that everywhere, that is, the Whitney extension for is order preserving. Accordingly, Lemma 4.17 is only needed for .
Proof.
We consider the cases and separately. First suppose . Let be a smooth function such that for all , for and for . Then set
[TABLE]
For each , let denote a point in such that . Then, since for any (from the assumption), we have
[TABLE]
By Proposition 4.16, we have when , therefore,
[TABLE]
where we have used Theorem 4.13 to bound . On the other hand, since and , we have
[TABLE]
Now, we take as in (4.5) and define the function
[TABLE]
If , then
[TABLE]
If on the contrary, , then
[TABLE]
We conclude that
[TABLE]
On the other hand, an elementary computation (see the Appendix) shows that
[TABLE]
Finally, let
[TABLE]
We conclude that and
[TABLE]
This proves the Proposition when . The argument for is similar, we only highlight the main differences. This time, we subtract not just the first order part of near , but also the second order part, namely we consider the function
[TABLE]
Then, one applies again Proposition 4.16 and use the regularity of to obtain (in analogy to the previous case)
[TABLE]
The respective function is defined exactly as and one argues as in the previous case. ∎
Remark 4.19**.**
The argument in the proof provides -after small modifications- a closely related result: if instead of we assume that and that for some and we have
[TABLE]
then there is as before a function such that and for all , but this time the estimate for is
[TABLE]
The following proposition will be useful later in the proof of Proposition 5.8.
Proposition 4.20**.**
Let or and . Fix , and let be as in (4.5). Let and , then
[TABLE]
for some function such that and
[TABLE]
where is as in Lemma 4.17.
Proof.
Define the function . Then and
[TABLE]
while, since , we also have for every . If , using Lemma 4.17 and the function from Remark 4.19, we have
[TABLE]
This inequality, after some rearranging, yields (for )
[TABLE]
Since we also have , we have again by Remark 4.19
[TABLE]
and the Proposition is proved in this case. For we argue along similar lines, using Remark 4.18 instead of Lemma 4.17.
∎
4.5. Convergence of the projection operators
Lemma 4.21**.**
Let , there is a constant such that if , then
[TABLE]
Here, .
Proof.
For notational simplicity let us write throughout the proof.
Since throughout , for an arbitrary we have (with denoting a point in such that ), with
[TABLE]
where we made use of Theorem 4.13 to obtain . This shows that goes to zero at some rate determined by and the size of . To prove the lemma we need to also bound the Hölder seminorm of and its derivatives, according to .
The case . Fix . First, suppose that , then
[TABLE]
In this case, and since , we have that . Then, using Theorem 4.13
[TABLE]
Next, suppose that . In this case
[TABLE]
where once again Theorem 4.13 was used. Combining these two estimates, we conclude that
[TABLE]
Then, using that for all , we have
[TABLE]
The case . In this case we trivially have the same estimates from the previous case, and only need the bounds for first derivative. This is done as follows, first
[TABLE]
Then, using Theorem 4.13, we have
[TABLE]
Recall that , and use Proposition 4.10 to conclude that
[TABLE]
The Hölder seminorm is bounded with the same argument used to bound in the previous case, we omit the details.
The case . Right as before, we note that
[TABLE]
Then, applying Theorem 4.13 and Proposition 4.10 as in the previous case, we have
[TABLE]
For the Hölder seminorm, we repeat the argument used in the case , again we leave the details to the reader. ∎
Remark 4.22**.**
If , then the same argument from Lemma 4.21 can be used to show
[TABLE]
the rate of convergence being determined by the modulus of continuity of .
5. Analysis of via the finite dimensional approximations
In this section we introduce a sequence of operators which approximate . The operators behave like operators in a finite dimensional vector space in the sense that they arise from a composition between linear maps with a Lipschitz map from a finite dimensional space onto itself. This allows us to prove a min-max formula for at least when by using Clarke’s idea of a generalized gradient [18]. More precisely, we use the fact that factorizes via a map between finite dimensional vector spaces (which is what the spaces were introduced for), where the generalized gradient can be used, and then lift this to corresponding maps from to using the Whitney extension. The majority of the section is concerned with deriving estimates and regularity properties for the linear operators arising in the min-max formula for , and ultimately concluding such linear operators are pre-compact, which leads to a min-max formula for the original operator.
5.1. The operators and their min-max representation
We are going to approximate the operator via “finite dimensional approximations”, this referring to maps , which factorize through a finite dimensional space (see (5.3) below).
We introduce a modification of the projection operator defined in (4.4). First, we define
[TABLE]
That is, given , we define as the function obtained by restricting to and then extending it to the rest of by zero. Then, we define the modified Whitney extension,
[TABLE]
and the modified projection operator
[TABLE]
These are, respectively, bounded linear maps from to and from to . Now we are ready to introduce the finite dimensional approximations to the operator , define
[TABLE]
That is, to compute , we first compute the modified projection , and compute , to which we later apply the modified projection . In particular, only depends on the values of on . Associated to this, we introduce a map, , defined as follows
[TABLE]
From the definition of , we have , thus we see and are themselves related by
[TABLE]
The situation for both and is represented in the following two diagrams,
[TABLE]
Now, the space is finite dimensional (Remark 4.2), and the map is Lipschitz continuous. Therefore, tools available for Lipschitz functions in the finite dimensional setting can be applied to and then related to via (5.3).
We recall the generalized derivative of in the sense of Clarke [18, Section 2.6].
Definition 5.1**.**
Let be a Banach space, and a Lipschitz continuous function. We define the set of generalized derivatives of , by
[TABLE]
By Rademacher’s theorem, the set is not empty when is finite dimensional. Applying this to , we have, first, that is non-empty, and secondly that is non-empty as well, this is proved in Lemma 5.3, where we describe the relationship between to . The following Lemma is the mean value theorem for nonsmooth Lipschitz functions between finite dimensional spaces (note the similarity with Theorem 2.5).
Lemma 5.2**.**
Assume that is Lipschitz. For any , there is a such that
[TABLE]
Proof.
We refer the reader to [18, Proposition 2.6.5] for a proof of the lemma. ∎
The second lemma is basically the chain rule.
Lemma 5.3**.**
Assume that is Lipschitz. The set is non-empty, and for any there is a such that
[TABLE]
conversely, any defined in this way for some belongs to .
Proof.
Note that is differentiable at a point if and only if is differentiable at , a fact which follows applying the chain rule to the identities (5.2) and (5.3). Furthermore, at such ’s we have
[TABLE]
If is a sequence along which is differentiable, and converges to some , then the sequence has a limit , and , taking the convex hull and by the linearity of and , the lemma follows. ∎
The following remark will not be of any relevance until the proof of Theorem 1.11 at the end of this section, but we include it here to illustrate how Lemmas 5.2 and 5.3 immediately yield a min-max formula for (for ).
Remark 5.4**.**
Fix and let . Then for any we have
[TABLE]
Indeed, according to Lemma 5.2 given and says there is some such that
[TABLE]
In this case, we have , and thus setting , we have
[TABLE]
and (5.4) immediately follows.
Next we make an elementary observation regarding the nature of the operators . This observation is merely a consequence of the factorization of through the space .
Remark 5.5**.**
For each there is a function , such that
[TABLE]
Indeed, simply let us use the basis functions given by
[TABLE]
Observe that for any the function has finite support, and in particular as the sum on the right has at most a finite number of non-zero terms. Thanks to Lemma 5.3, there is some such that and therefore,
[TABLE]
Then, defining for the identity (5.5) follows.
For the rest of this section we analyze the operators and the sets and obtain in the limit a min-max formula for . We shall focus on operators satisfying Assumption 1.4. As we see below this property is inherited –to some extent– by the operators , and by any operator , this fact is covered in the next two propositions. In the subsections that follow, we will use the spatial regularity afforded by Assumption 1.4 to show that the operators in the family have coefficients enjoying some regularity, which in the limit yields regular coefficients.
Proposition 5.6**.**
Let be Lipschitz and satisfy Assumption 1.4. Let and , and . Then, for any we have
[TABLE]
where is the modulus of continuity and the function given by Assumption 1.4.
Proof.
Observe that
[TABLE]
and recall that Proposition 4.14 says that when .
Therefore, applying the bound in Assumption 1.4 with ,
[TABLE]
Now, provided , we have
[TABLE]
the proposition follows.
∎
Proposition 5.7**.**
Let be Lipschitz and satisfy Assumption 1.4. Given , , and , we have the inequality
[TABLE]
Here, and and are given by Assumption 1.4.
Proof.
Consider any such that is differentiable at with derivative . Then,
[TABLE]
By Proposition 5.6, we have
[TABLE]
This proves the desired inequality for those which happen to be the derivative of at a point of differentiability. This property is clearly preserved under limits and convex combinations, so it follows any has the desired property. ∎
The following proposition is directly related to Proposition 4.20.
Proposition 5.8**.**
Assume that is Lipschitz and satisfies Assumption 1.1. For let with as in (4.5), then
[TABLE]
If instead we have with non-negative and some , then
[TABLE]
for some constant .
Proof.
We apply Proposition 4.20, and we have with from the same proposition, we have
[TABLE]
with equality holding for . It follows that is touched from above at by . Then, since has the GCP,
[TABLE]
This means that
[TABLE]
Since the first inequality is proved. For the second inequality, we apply Remark 4.19 directly, and use that has the GCP to conclude that
[TABLE]
Then, using the Lipschitz property of we conclude that
[TABLE]
where we used that and Remark 4.19 to obtain the last inequality.
∎
Proposition 5.9**.**
Let be Lipschitz and satisfy Assumption 1.3. Let and with in , then for any we have
[TABLE]
where is the rate coming from Assumption 1.3.
Proof.
If in , then in . In other words, and are identically equal in . Therefore, Assumption 1.3 says that
[TABLE]
By Proposition 4.20, , the proposition is proved.
∎
5.2. Properties of
For each and we define a Borel measure (which is possibly signed) as follows
[TABLE]
where is as in Remark 5.5. From its definition, it is immediate that given and then
[TABLE]
Proposition 5.10**.**
Assume that is Lipschitz and satisfies Assumption 1.1. For each and , and the function in (4.5),
[TABLE]
Proof.
Fix . Let us assume first that . Let , then
[TABLE]
Therefore it suffices to show there is a universal constant such that
[TABLE]
Let us prove this when arises as the derivative of at some , namely, that
[TABLE]
In this case, we can apply Proposition 5.8 to the expression on the right and conclude that
[TABLE]
where we used that when the function belongs to and the norm is bounded in terms of and the function . This the desired estimate for such . Since this property is clearly preserved under limits and convex combinations, it follows that the property holds for all elements of .
The case proceeds similarly, except one first fixes and considers the function instead. After proceeding as in the previous case, we obtain the estimate
[TABLE]
for every and . The constant is independent of , since is independent of when . Letting for the integral on the left (and using the special form of ) one obtains the estimate in the case .
∎
Proposition 5.11**.**
Assume that is Lipschitz and satisfies Assumption 1.1. Let be a non-negative function. There is a constant such that given then for each and ,
[TABLE]
As before, is the function in (4.5), and .
Proof.
As in the proof of the previous proposition, we note that if , , and , then
[TABLE]
As in the previous Proposition, it suffices to show that , and from ’s definition, it suffices to show this for those in which are the derivative of at some . In this case, given that , we may apply the second part of Proposition 5.8 to obtain
[TABLE]
and the proposition is proved. ∎
Let us recall the function
[TABLE]
In this section we introduce a variation on this function. This modification takes into account the geometry of the grid as well as the regularity exponent , and will be used in a way analogous to the previous section.
[TABLE]
Associated with this, we introduce functions in taking (respectively) scalar, vector, and matrix values.
First, some notation. To functions we associate the following family of functions
[TABLE]
Then, for and we define a symmetric matrix , a vector , and a scalar . These are functions in defined by the formulas,
[TABLE]
The functions and give us a representation for for .
Proposition 5.12**.**
Assume that is Lipschitz. Let , then for and we may write it as
[TABLE]
For
[TABLE]
and for
[TABLE]
Proof.
We do the case explicitly, as the others are identical. Let us compute by adding and subtracting ,
[TABLE]
From Remark 5.5, (5.7), we have that
[TABLE]
As for the other term, we observe that
[TABLE]
Rewriting the terms on the right and gathering the terms, we conclude that
[TABLE]
The remaining cases of follow from the corresponding definition of in those cases.
∎
The next two propositions say that the terms appearing Proposition 5.12 satisfy a uniform continuity in . The first refers to the measure .
Proposition 5.13**.**
Assume satisfies Assumptions 1.1, 1.3, and 1.4, as stated for . Let , , and . There is a constant such that for any such that in ,
[TABLE]
where is the modulus from Assumption 1.4. In particular,
[TABLE]
On the other hand, if is such that in for some , then for any we have
[TABLE]
where is the function from Assumption 1.3.
Proof.
From the fact that and vanish in, respectively, and , we have
[TABLE]
Since in , Proposition 5.7 says that, as long as
[TABLE]
This proves the first estimate, for the second one, fix and , and define , then
[TABLE]
Therefore, as before, it suffices for us to bound for every , and from the definition of it suffices to prove the bound for those such that at some . In this case, Proposition 5.9 says that
[TABLE]
∎
The following notation will be useful in what follows,
[TABLE]
where is as in Assumption 1.4 (see also Proposition 5.6).
Proposition 5.14**.**
Assume satisfies Assumptions 1.1, 1.3, and 1.4, as stated for . Let , , and , then
[TABLE]
Proof.
Fix and let . Applying Proposition 5.7 to and , with the functions , , and , we see that for
[TABLE]
These inequalities respectively amount to the stated estimate for , , and .
∎
5.3. Properties of
Now, we define the set , which plays the role the Clarke differential played for (we recall that c.h. stands for “convex hull”).
[TABLE]
Remark 5.15**.**
We would like to note a point about notation and definitions, namely why above we have with as a subscript. This is to avoid confusion (or perhaps, to promote it) by distinguishing it from the generalized derivative in the sense of Clarke from Definition 5.1. The objects are closely related, and in fact one would hope that , but we are not concerned with whether this is actually the case as the above definition works for our purposes.
The following is an important Lemma that says –among other things– that is non-empty.
Lemma 5.16**.**
Assume satisfies Assumptions 1.1, 1.3, and 1.4, as stated for . Given a sequence and operators with for every , and we have the following
- (1)
There is a subsequence and functions and defined on and taking values respectively in , , and , such that if for some then we have the convergence
[TABLE] 2. (2)
There is a function in , taking values on the space of Lévy measures in , such that for every , and every as before we have the convergence
[TABLE] 3. (3)
The functions all have a modulus of continuity , while for each we have the estimate,
[TABLE] 4. (4)
If we define by
[TABLE]
Then, . 5. (5)
Moreover, if , then we have . Furthermore, if then and takes the form
[TABLE]
Proof.
Let us fixe and . First of all, we invoke Proposition 5.12 to obtain the collection of , , , and . Furthermore, already as a result of Proposition 5.12, we have item (5) of the lemma.
Step 1. (Extension) We have a sequence of functions defined on varying, monotone increasing sets . One way to show they converge (along a subsequence) to a function in is by extending them to all of and check whether the resulting sequences are pre-compact.
With this idea in mind, for each we apply the Whitney extension to , , ,
[TABLE]
We repeat the same for , resulting in a map from to the space of Lévy measures, given by the formula
[TABLE]
where is the partition of unity from Proposition 4.6. The functions , , and all have modulus of continuity , thanks to Proposition 5.14 and the properties of the Whitney extension operator, see [54, Chapter VI, Theorem 3]. The same proof from reference [54] can be applied with minor modifications to show that for every we have
[TABLE]
Furthermore, for every , by Proposition 5.13,
[TABLE]
where as . This shows that for each , the functions are an equicontinuous family of functions taking values inside the space of measures which are supported in and such that for all . This space, equipped with the total variation distance, is a compact metric space.
Step 2. (Cantor diagonalization) We now use a standard Cantor diagonalization argument to obtain locally uniform convergence along a subsequence. We construct a family nested sequences in the following recursive manner. First, is a subsequence of along which the functions converge uniformly in to functions , and ) defined in . Next, suppose that for we have build a nested family of sequences such that the functions , etc converge uniformly in to functions , etc. In this case, we choose to be a subsequence of along which converge uniformly in to functions and so on.
Having constructed these , we define the sequence as . The resulting sequences converge locally uniformly, respectively, to , and .
Step 3. (Cantor diagonalization continued)
As noted at the end of Step 1, for every , the sequence is an equicontinuous family of functions taking values in a compact metric space. Therefore, we can apply the Arzela-Ascoli type theorem found in [24, p. 202] to obtain a subsequence of and a measure such that
[TABLE]
Now, suppose we have repeated this times: we have (a subsequence of ), as well as a measure such that
[TABLE]
Then, using again the compactness theorem in [24, p. 202] we pick a subsequence of and a measure such that
[TABLE]
Observe that the measures are such that for all , which uniquely defines a direct limit measure for each . Letting we see that for every and we have
[TABLE]
Since is a subsequence of , we still have convergence of to . Moreover, the continuity estimates in the previous step all pass to the limit to give respective estimates for and in the respective metrics.
Last but not least, we note that while are a sequence of signed measures, their limit will be a measure, which follows at once from Proposition 5.11.
Step 4. (Convergence)
First, note that for fixed , we have that as ,
[TABLE]
which in particular guarantees that, for every fixed ,
[TABLE]
Then, by the bound in Proposition 5.10, we conclude that
[TABLE]
Therefore, and taking into account the convergence of and , and with defined as in the statement of the Lemma, , and , we have
[TABLE]
and we conclude that .
∎
It is to be expected that every satisfies the GCP, and thus, it has to be an operator of Lévy type. This is proved in the lemma below, and further, we show that the coefficients in the operator inherit a modulus of continuity from Assumption 1.4.
Lemma 5.17**.**
Assume satisfies Assumptions 1.1, 1.3, and 1.4, as stated for . Given , and any , the operator can be represented as
[TABLE]
Here, is a Lévy measure satisfying the continuity estimate (5.12), and
[TABLE]
all have modulus of continuity .
Proof.
Fix . Assume first that is the limit of a sequence with . Then, by Lemma 5.16 there is a subsequence as well as (matrix, vector, scalar, measure)-valued functions , and , all such that
[TABLE]
and, as a result, we have
[TABLE]
The estimate in Proposition 5.10 in the limit as implies that
[TABLE]
for some constant independent of and . Meanwhile, also the limit of the estimate in Proposition 5.11 implies that is a non-negative measure in . The positivity of means that the previous estimate is equivalent to
[TABLE]
Since , for every , we have in particular, for
[TABLE]
From where it follows that (and thus for all , by continuity), the exact same argument yields that , and , and the lemma is proved.
∎
Let us now simplify things by doing away with the auxiliary functions and . To accomplish this, we shall make use of the auxiliary functions from Section 3.
[TABLE]
where we recall the two-parameter of functions was defined in (3.2). An important property of these one-parameter families is the bound
[TABLE]
Corollary 5.18**.**
Assume satisfies Assumptions 1.1, 1.3, and 1.4, as stated for . Then, any has the form,
[TABLE]
Moreover, and each have modulus of continuity , and for every and any we have
[TABLE]
If , then , while if then and the integrand with respect to in the formula above is replaced with .
Proof.
Take a decreasing sequence such that , and let us take the functions and , as defined in (5.13). Then for each , has the representation
[TABLE]
where , and are as in Lemma 5.17. Now, satisfies the estimate
[TABLE]
Thanks to (5.14), it follows that for all . It follows that has a uniform modulus of continuity. The same argument yields a modulus of continuity for and for the function , all given by , with independent of and being the modulus from Assumption 1.4. This equicontinuity means these sequences of functions are pre-compact at least when restricted to any compact subset of , by the Arzela-Ascoli theorem. Therefore, after a Cantor diagonalization argument we see that along some subsequence these functions converge locally uniformly in to functions , , respectively. Of course, the functions and all inherit the modulus of continuity . The respective TV-norm continuity estimate for follows by applying Proposition 5.13 and passing to the limit (always recalling that, is the convex hull of such limit points).
With the convergence established, we have
[TABLE]
and so, for every we have the formula
[TABLE]
It remains to compute the limit of the integral, observe that
[TABLE]
which means that
[TABLE]
Therefore,
[TABLE]
On the other hand, for every we have
[TABLE]
and the limit is monotone. Therefore, by monotone convergence we conclude that
[TABLE]
and with this the Corollary is proved. ∎
5.4. Limits of
Lemma 5.19**.**
Assume that is Lipschitz. Let and . If is supported in , and , then
[TABLE]
for a universal constant and . Furthermore, we have
[TABLE]
Proof.
Let be compactly supported in , and be such that . First, note that since , then we have
[TABLE]
thus, . Keeping this in mind, using the Lipschitz property of , we have
[TABLE]
Since we have that when restricted to , which thanks to Lemma 4.21 implies the first estimate. Next, Theorem 4.13 guarantees that
[TABLE]
Thus,
[TABLE]
Applying Lemma 4.21 to the first term and Remark 4.22 to the second, we conclude that
[TABLE]
∎
Corollary 5.20**.**
Assume satisfies Assumptions 1.1, 1.3, and 1.4, as stated for . Then for every and every ,
[TABLE]
Proof.
Fix and . For (to be determined later), we may decompose as , where is compactly supported in and in , all such that
[TABLE]
The constant being independent of . Now, by Assumption 1.3 and since in , we have
[TABLE]
Choose large enough so that and . Then, with this , we apply Lemma 5.19 two times, and conclude that there is some such that
[TABLE]
On the other hand, in all we have the pointwise inequality,
[TABLE]
and it follows that, for and , that
[TABLE]
and the corollary is proved.
∎
5.5. Proofs of Theorems 1.11 and 1.14
We conclude this section with the proofs of the remaining theorems.
Proof of Theorem 1.11.
Consider the set . The proof will boil down to showing that for any and any there is some such that
[TABLE]
Fix and . Then, by Remark 5.4, for every we have
[TABLE]
In particular, for every , there is some such that (with this same and )
[TABLE]
Let us obtain an inequality as we let along some subsequence. Thanks to Corollary 5.20, for every we have
[TABLE]
On the other hand, Lemma 5.16 says there is a subsequence and an operator such that converges to , and moreover , by the definition of . Then, we conclude that
[TABLE]
The above holds for any pair of functions and and any point . Taking the minimum over all , we obtain for any and ,
[TABLE]
Using and as the set of labels, which we rename , and letting correspond to the functions , we obtain the desired min-max representation.
The bounds for the coefficients follow from the construction of , etc… in (5.8), (5.9), (5.10). The continuity of the coefficients and the Lévy measures follows from Lemma 5.16.
∎
Proof of Theorem 1.14.
For the versions of Theorems 1.9 and 1.10 with we apply the last part of Lemma 3.9 to conclude the functionals (or translation invariant operators) appearing in the min-max all have the corresponding simpler form. As for Theorem 1.11, we use instead the last part of Corollary 5.18 to obtain the simpler expresion for the Lévy operators in the cases where .
∎
6. Some Examples
In this section we list some examples to which our results apply, yet the integro-differential structure given in either (1.2) or (1.3) is not readily apparent from the definition of the operator itself. We emphasize that most cases of the linear examples that we list were already contained in the classic work of Courrège [19], but we include them here for the sake of illustration. In all of these examples, the operators satisfy the GCP and the other technical requirements to apply the results presented above. We do not intend to give all details, but rather just make a list, with some appropriate references. At the end of the section, we list how these examples relate to Assumptions 1.1–1.4.
6.1. The statement of the examples.
Example 6.1**.**
The generator of a Markov process. Assume that is a Markov process taking values in , and that is the expectation of the process, having started from at . The generator is defined as the operator
[TABLE]
over all for which the limit exists. (See Liggett [42, Chapter 3].)
Thanks to the fact that preserves ordering, one can immediately see that enjoys the GCP. When is such that , this example is covered by Courrège [19]; but if is such that (in a Lipschitz fashion) for some , then by Theorem 1.14, there are fewer terms (see the list just above Theorem 1.14 for our use of the notation ). In this context, the result of Courrège can be seen as a version of the Lévy-Khintchine formula for a process whose increments need not be stationary.
Example 6.2**.**
The Dirichlet-to-Neumann map for linear, elliptic operators on half-space. Assume that is an operator that admits unique bounded solutions on and that has a comparison principle. What we mean by this is the following: we can take and associate to it the unique bounded solution, of
[TABLE]
A couple of reasonable examples would be
[TABLE]
where is uniformly elliptic and Hölder continuous. The Dirichlet-to-Neumann map is then defined as
[TABLE]
First of all, the assumptions on are such that for some , and hence the normal derivative is well defined (see, e.g. [23, Chapters 8, 9]). It is not hard to check that this operator satisfies the GCP, and this fact comes entirely from the property that the solution operator, by the assumed comparison principle, preserves ordering of solutions whenever the boundary data are ordered (it has nothing to do with linearity of the solution operator). This is, again, within the context of Courrège’s result, but we can invoke Theorem 1.14 to remove extra terms of order higher than . Ellipticity and scaling show that this is always an operator of order (and will map ). We note that in this example, via linear equations with nice coefficients, one can derive lots of information about the operator by directly using the Poisson kernel that represents the solution .
In the context of periodic equations, one can use the results in Sections 4 and 5 to show that the coefficients in the resulting Lévy operators will share the same periodicity. In fact, this is very straightforward if is linear. If instead one looks at almost periodic coefficients, it seems reasonable to hope that the coefficients will also be almost periodic, but we have not checked this claim. If it is the case, there could be an application to some boundary homogenization problems with irrationally oriented half-spaces inside a periodic medium, related to [31]. Operators related to the Dirichlet-to-Neumann mapping of this example are also of interest in conformal geometry, see Chang-Gonzalez [13]. It is also possible to consider an elliptic equation with weights in order to obtain some operators of order different than 1, e.g. Caffarelli-Silvestre [8].
Example 6.3**.**
The boundary process of a reflected diffusion. (See Hsu [32], or [33, Chp. IV, Sec. 7] and/or [45, Sec. 8].)
In this context, one starts with a diffusion in , say , so that reflects off of the bottom boundary whenever it reaches it. Under a time rescaling of (because it spends zero time on the boundary), the resulting process can be viewed at times only when it hits , and induces a pure jump process on . This process is generated by an operator of the form (1.2) with . It turns out that this generator for the boundary process is exactly the Dirichlet-to-Neumann mapping from the previous example. This process was studied in a smooth domains for Brownian motion by Hsu [32].
Example 6.4**.**
Subordinated diffusions and Bernstein functions. (See Schilling-Song-Vondraček [46].)
The time-rescaling of the reflected diffusion in the previous example is just one choice of a rescaling, and in general one can time-rescale diffusions on (so no boundary space here) in a myriad of fashions to create new stochastic processes from one reference Brownian motion. This is a process known as subordination, and it can be used to create operators with generators in the class (1.2), starting with one that may simply only contain the second order term. The generator for the subordinated process will enjoy the GCP because the generator of the original diffusion also enjoys the GCP. This technique has played a large and fundamental role in the study of Lévy processes, and one can see it in use in e.g., the book of Schilling-Song-Vondraček [46], especially [46, Chapter 13]. The subordination formula is closely related to an extension into plus one space variables, and this extension was used to create operators of fractional order that enjoy the GCP in the work of Stinga-Torrea [55] and also provide other properties of the fractional operators.
Example 6.5**.**
The Monge-Ampère operator, .
When one restricts this operator to the subset of of convex functions, then MA is in fact (degenerate) elliptic and locally Lipschitz. Specifically for each , MA is uniformly elliptic (depending upon ), Lipschitz, and translation invariant as a mapping,
[TABLE]
Thus, MA, must enjoy a min-max structure. Experts have known and utilized this min-max propert of MA in the study of fully nonlinear elliptic equations for a long time, and one can show that
[TABLE]
In fact, this formula is intimately connected with various investigations into nonlocal operators that should be an analog of MA in the fractional setting (as of yet, there is not one that is considered better than others). Some works that address nonlocal analogs of MA are: [7], [11], and [28].
Example 6.6**.**
General nonlocal operators as treated in Caffarelli-Silvestre [9] [10]. These are simply operators that are assumed to satisfy the GCP, are defined for all functions in , map , and satisfy a form of uniform ellipticity that is given by the existence of concave respectively convex operators, and so that
[TABLE]
Here, is a class of linear operators that is usually a particular subset of those that satisfy the Lévy type condition (1.2).
This context for nonlocal operators was given in [9, Definition 3.1], and it played an important role in many of the results– especially when is chosen to contain certain classes of operators. These operators, in cases in which they are Lipschitz fall into the scope of our results, and furthermore, the role of the extremal operators gives extra information about the min-max formula. In particular, as shown in [29, Section 4.6], when ellipticity occurs with respect to , then the min-max may be restricted to only utilize linear functionals (or linear operators) that also satisfy the extremal inequality in (6.1). This also appeared in a homogenization result by one of the authors in which they were unable to show that the limit operator had an explicit integro-differential formula, but rather was only integro-differential and uniformly elliptic in the sense of [9, Definition 3.1] ( see the homogenization in [47]).
Example 6.7**.**
The Dirichlet to Neumann map for fully nonlinear elliptic equations. In Example 6.2, the linearity of is not necessary, and the function can also be taken to solve a fully nonlinear, uniformly elliptic equation in . These equations always possess a comparison principle (by definition), and under most reasonable assumptions, the solution will be globally , allowing for the normal derivative to be defined classically (see [52] for this regularity).
This was a main topic in the recent paper by the authors and Kitagawa [26]. It turns out that the extremal operators (as in Example 6.6) for the nonlinear D-to-N not only play a crucial role in investigating the Lévy measures in the min-max, but they also take a refreshingly simple form. The extremal operators in this case, of Example 6.6, are simply the Dirichlet-to-Neumann operators for the solutions of the corresponding extremal operators for the elliptic second order equation in . These are usually called the Pucci extremal operators (see [12]), and solutions to their equations are generally very well behaved. In [26], the properties of the Lévy measures in the min-max are linked to the harmonic measures for linear equations with bounded measurable coefficients (e.g. [39]), but there is still more to learn about them before they can be connected with existing integro-differential theory.
Example 6.8**.**
An operator that drives surface evolution in one and two phase free boundary problems related to a type of Hele-Shaw flow. Given , such that , we can define the unique solution, , of the elliptic equation,
[TABLE]
This allows to define a (fully nonlinear) operator on as
[TABLE]
that is, the normal derivative of the solution on the upper boundary given by the graph of .
For Hele-Shaw flow in the simplified setting that the free boundary is parametrized by the graph of , it can be shown that the free boundary evolves by a normal velocity that at each time is given by . The interpretation here is that fluid flows into the domain under a pressure at the bottom boundary, , and the top edge of the fluid exists at , with representing the pressure of the fluid. This pressure induces a force on the fluid, which is given by at the top boundary. This operator, and its implications for rewriting a class of free boundary problems that are similar to Hele-Shaw was studied by the authors and Chang Lara in [16]. In particular, the min-max formula makes it straightforward to convert the free boundary flow into a nonlocal parabolic equation for , and this parabolic equation is very similar to ones that have already been studied in the nonlocal literature (e.g. [51]). When is defined to be harmonic in the domain determined by , standard regularity theory immediately gives estimates that show there is some so that the mapping from to is Lipschitz from to . In [16] it was also shown that the same Lipschitz property can be obtained when is defined as the solution of a nonlinear uniformly elliptic second order equation instead of just the Laplacian. This operator gives a good example of what can be said in the translation invariant case of the min-max, and its properties are studied initially in [16]. Even in the simplest case of defining to be harmonic, the resulting operator will always be inherently nonlinear and nonlocal.
6.2. Relationship to Assumptions 1.1–1.4
Here we list how each of the above examples fits within the context of Assumptions 1.1–1.4.
(Example 6.1). By construction, this is always linear. Thus, Assumption 1.1 follows from simply saying that is a bounded operator on , which of course requires assumptions on the process, , or more specifically the transition probability measure for . Again, via linearity, Assumption 1.2 follows whenever the process, , has stationary and independent increments. Assumptions 1.3 and 1.4 will be an extra requirement on the transition probability measure for . In particular (although a bit circular), Assumption 1.4, in view of linearity, is equivalent to the martingale problem for having a solution and the generator having uniformly continuous coefficients.
(Example 6.2). (The interested reader can see [26] for more details.) Assumption 1.1 holds for when is -Hölder continuous. Assumption 1.2 holds if is a constant. Assumption 1.3 holds in both of the above settings, by using a barrier argument (which is easier implemented for the non-divergence equation). Since is linear, Assumption 1.4 holds when is Hölder continuous. Indeed, by linearity, checking Assumption 1.4 is equivalent to estimating
[TABLE]
In the case of divergence equations, one can write down the equations satisfied for , and then also the equation satisfied by . The desired estimate is then equivalent to estimating , i.e. a global Lipschitz estimate for . Since satisfies
[TABLE]
we see that by global Lipschitz estimates,
[TABLE]
by the original assumption that is Hölder continuous. (Note, the Lipschitz estimates here are a standard modification to, e.g. [25, Lemma 3.2] to allow for a right hand side of the form with .)
(Example 6.3). In most reasonable situations in which the diffusion has regular coefficients, this is contained in the previous example.
(Example 6.4). This, of course, depends heavily on the original Markov process and the choice of subordinator. However, one of the most classical situations starts with a Brownian motion and then uses a Lévy stable subordinator. In this case, the resulting operator is translation invariant, and Assumptions 1.1 and 1.2 follow more or less by construction.
(Example 6.5). This is a translation invariant operator, and as mentioned already satisfies the Lipschitz property on the specified convex subsets of . So, Assumptions 1.1 and 1.2 hold.
(Example 6.6). As this is a general example, the operators only satisfy the given assumptions when explicitly required to do so. However, the interesting part of this example arises from the fact that the knowledge of the extremal inequalities in (6.1) in fact gives more detailed information about the linear operators that will appear in the min-max of Theorems 1.9–1.14. This is discussed in [29, Section 4.6].
(Example 6.7). This operator satisfies Assumption 1.1 as a mapping of (for some ) under standard assumptions about . The relevant regularity theory comes from Silvestre-Sirakov [52]. It can also be checked by using the same type of barrier argument that works for Example 6.2 will show Assumption 1.3 is also satisfied. Due to the nonlinear nature of the D-to-N in this setting, it is not obvious how to show that Assumption 1.4 is satisfied– we do not know if it satisfied or not. Thus, the best one can say about this operator when it is not translation invariant is the outcome of Theorem 1.9. We simply note to the interested reader that because of the lack of exact cancelation from the fact that the mapping is not linear, one probably needs more detailed information about . Indeed, using the extremal operators would not help because it would produce
[TABLE]
Here we use as the extremal operators for , and also that these are translation invariant. This estimate completely neglects the influence of the shift, , and so it would not be useful (furthermore, one expects that ).
(Example 6.8). As it is stated above, this operator, , is actually translation invariant, and so it is straightforward to check that Assumptions 1.1 and 1.2 hold. In the case that the equation for (i.e. ) is replaced by either a fully nonlinear operator and/or and operator that is not translation invariant, it is harder to check all of the applicable assumptions. Again, for fully nonlinear equations that define , in [16] was checked to be Lipschitz as a map of (which took a reasonably non-trivial amount of work).
Appendix A Additional proofs and computations
Proof of Proposition 4.10.
Fix , and let , then by the regularity of ,
[TABLE]
Therefore,
[TABLE]
For the second estimate, we shall make use of
[TABLE]
Therefore,
[TABLE]
It follows that
[TABLE]
and the proposition is proved. ∎
Proof of Proposition 4.11.
Fix .
Step 1. Let , then
[TABLE]
Proof of Step 1. By the regularity of ,
[TABLE]
Therefore,
[TABLE]
Step 2. Given , we have
[TABLE]
Step 3.
[TABLE]
∎
Computation for Lemma 4.17.
[TABLE]
If , then
[TABLE]
This expression is zero except when , so
[TABLE]
Furthermore, for such that , we have
[TABLE]
In conclusion,
[TABLE]
∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Luis Alvarez, Frédéric Guichard, Pierre-Louis Lions, and Jean-Michel Morel. Axioms and fundamental equations of image processing. Arch. Rational Mech. Anal. , 123(3):199–257, 1993.
- 2[2] G. Barles, E. Chasseigne, and C. Imbert. On the Dirichlet problem for second-order elliptic integro-differential equations. Indiana Univ. Math. J. , 57(1):213–246, 2008.
- 3[3] G. Barles, E. Chasseigne, and C. Imbert. Hölder continuity of solutions of second-order elliptic integro-differential equations. J. Eur. Math. Soc. , 13(1):1–26, 2011.
- 4[4] Guy Barles, Emmanuel Chasseigne, Adina Ciomaga, and Cyril Imbert. Lipschitz regularity of solutions for mixed integro-differential equations. J. Differential Equations , 252(11):6012–6060, 2012.
- 5[5] Guy Barles and Cyril Imbert. Second-order elliptic integro-differential equations: viscosity solutions’ theory revisited. Ann. Inst. H. Poincaré Anal. Non Linéaire , 25(3):567–585, 2008.
- 6[6] Guy Barles and Panagiotis E. Souganidis. A new approach to front propagation problems: theory and applications. Arch. Rational Mech. Anal. , 141(3):237–296, 1998.
- 7[7] Luis Caffarelli and Fernando Charro. On a fractional Monge-Ampère operator. Ann. PDE , 1(1):Art. 4, 47, 2015.
- 8[8] Luis Caffarelli and Luis Silvestre. An extension problem related to the fractional Laplacian. Comm. Partial Differential Equations , 32(7-9):1245–1260, 2007.
