$L^p$ regularity of least gradient functions
Wojciech G\'orny

TL;DR
This paper establishes optimal $L^p$ regularity for solutions to the anisotropic least gradient problem, demonstrating their boundedness and precise boundary behavior in various settings.
Contribution
It proves the optimal $L^{rac{Np}{N-1}}$ regularity for solutions and provides explicit boundary blow-up bounds in specific cases.
Findings
Solutions are in $L^{rac{Np}{N-1}}()$ for boundary data in $L^p()$.
Solutions are locally bounded with explicit boundary blow-up rates.
Optimality of the regularity exponent is demonstrated.
Abstract
It is shown that solutions to the anisotropic least gradient problem for boundary data lie in ; the exponent is shown to be optimal. Moreover, the solutions are shown to be locally bounded with explicit bounds on the rate of blow-up of the solution near the boundary in two settings: in the anisotropic case on the plane and in the isotropic case in any dimension.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric Analysis and Curvature Flows · Nonlinear Partial Differential Equations · Numerical methods in inverse problems
regularity of least gradient functions
Wojciech Górny
W. Górny: Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland.
Abstract.
It is shown that solutions to the anisotropic least gradient problem for boundary data lie in ; the exponent is shown to be optimal. Moreover, the solutions are shown to be locally bounded with explicit bounds on the rate of blow-up of the solution near the boundary in two settings: in the anisotropic case on the plane and in the isotropic case in any dimension.
Key words and phrases:
Least Gradient Problem, Anisotropy, regularity
2010 Mathematics Subject Classification:
35J20, 35J25, 35J75, 35J92
1. Introduction
Our main focus is the least gradient problem, which is the following minimisation problem
[TABLE]
This problem was introduced in [13], where the authors estabilish that for continuous boundary data, under a set of conditions on an open bounded set slightly weaker than strict convexity, a unique solution to Problem (LGP) exists and it is continuous up to the boundary. Recently, the authors of [10] considered an anisotropic version of the least gradient problem:
[TABLE]
This type of problems appear as a dimensional reduction in the free material design, see [8], and conductivity imaging, see [10]. In this paper, we follow the approach to this problem from the point of view of geometric measure theory, following [3], [10], and [13]. In particular, we understand the boundary condition in the sense of traces of functions.
In both the isotropic and anisotropic least gradient problem, existence of solutions depends on the shape of . In particular, for continuous boundary data sufficient conditions are: for Problem (LGP) strict convexity of , see [13]; for Problem (ALGP), the barrier condition introduced in [10]. As continuous boundary data are bounded, by a maximum principle we obtain an immediate bound on the solution. However, under suitable regularity assumptions on , a recent article [7] gives existence of solutions to Problem (ALGP) also for unbounded boundary data, provided that their discontinuity set has Hausdorff measure zero. In this case, the direct method gives no regularity estimates for the solutions.
The paper is organised as follows: Section 2 provides the necessary background concerning anisotropic least gradient functions. Section 3 is devoted to proving the main result of this paper, i.e. Theorem 3.2, which concerns regularity of solutions to the least gradient problem for boundary data which lie in , using an argument based on the isoperimetric inequality. Moreover, in Example 3.5 we see that the exponent is optimal.
Let us stress that we do not discuss existence or uniqueness of minimisers; here, given a minimiser of Problem (ALGP), we prove an estimate of its norm. For this reason, we only assume to be an open bounded set with Lipschitz boundary; we do not impose geometric assumptions on sufficient to obtain existence of minimisers. However, we have an indirect assumption that the set and the function support at least one solution to the anisotropic least gradient problem.
In Section 4 we prove that solutions to the least gradient problem are locally bounded. This is done in two settings: firstly, in in the anisotropic case, using a characterisation of one-dimensional integral currents; secondly, in the isotropic least gradient problem in any dimension, using the monotonicity formula for area-minimising boundaries.
2. Preliminaries
2.1. Least gradient functions
In this section, we recall the definition of least gradient functions on bounded domains and their basic properties.
Definition 2.1**.**
Let be an open and bounded set. We say that is a function of least gradient, if for every compactly supported in we have
[TABLE]
In case when has Lipschitz boundary, this is equivalent to the condition that , see [14, Theorem 2.2]. This equivalence is proved using an approximation with functions of the form for suitably chosen .
Definition 2.2**.**
We say that is a solution to Problem (LGP), if is a function of least gradient and the trace of equals , i.e. for almost every we have
[TABLE]
Now, we recall a classical theorem by Bombieri-de Giorgi-Giusti, which gives us a link between the function of least gradient and the regularity of its superlevel sets. Here and in the whole manuscript let us denote .
Theorem 2.3**.**
([3, Theorem 1]) Suppose that is open and let be a function of least gradient in . Then for every the set is minimal in , i.e. the function is of least gradient. ∎
Finally, as least gradient functions are functions, they are defined up to a set of measure zero, we have to choose a proper representative if we want to state any pointwise regularity results. In this paper we deal with regularity, so at first glance it is not an issue; however, in the proofs in Section 4 we will use regularity of boundaries of area-minimising sets, so following [13] we employ the convention that a set of a bounded perimeter consists of all its points of positive density.
2.2. Anisotropic formulation
Firstly, we recall the notion of a metric integrand and spaces with respect to a metric integrand. This entire subsection is based on the construction in [1].
Definition 2.4**.**
Let be an open bounded set with Lipschitz boundary. A continuous function is called a metric integrand, if it satisfies the following conditions:
is convex with respect to the second variable for a.e. ;
is 1-homogeneous with respect to the second variable, i.e.
[TABLE]
is bounded and uniformly elliptic in , i.e.
[TABLE]
These conditions apply to most cases considered in the literature, such as the classical least gradient problem, i.e. (see [13]), the weighted least gradient problem, i.e. (see [10]), where , and norms for , i.e. (see [6]).
Definition 2.5**.**
The polar function of is defined as
[TABLE]
Definition 2.6**.**
Let be a continuous metric integrand in . For a given function we define its total variation in by the formula:
[TABLE]
Another popular notation for the total variation is . We will say that if its total variation is finite in ; furthermore, let us define the perimeter of a set as
[TABLE]
If , we say that is a set of bounded perimeter in .
Remark 2.7*.*
By property of a metric integrand
[TABLE]
In particular, as sets; however, they are equipped with different (but equivalent) norms. Moreover, the total variation admits the following integral representation:
[TABLE]
where is the Radon-Nikodym derivative . If we take to be a characteristic function of a set with a boundary, we have
[TABLE]
where is the (Euclidean) unit vector normal to at . For the isotropic version of these facts, see [2] or [4]; for the exposition of BV theory in the anisotropic setting and the integral representation formula, see [1].
2.3. least gradient functions
Now, we turn our attention to the precise formulation of Problem (ALGP). Then we recall several known properties of the minimisers.
Definition 2.8**.**
Let be an open bounded set with Lipschitz boundary. We say that is a function of least gradient, if for every compactly supported we have
[TABLE]
We say that is a solution to Problem (ALGP), the anisotropic least gradient problem with boundary data , if is a function of least gradient and .
We will recall a few properties of functions of least gradient. Firstly, we state an anisotropic version of Theorem 2.3. Its proof in both directions is based on the the co-area formula.
Theorem 2.9**.**
([11, Theorem 3.19]) Let be an open bounded set with Lipschitz boundary. Assume that the metric integrand has a continuous extension to . Take . Then is a function of least gradient in if and only if is a function of least gradient in for almost all . ∎
Finally, we recall the following observation:
Lemma 2.10**.**
([7, Lemma 2.16]) Let be an open bounded set with Lipschitz boundary. Let be a function of least gradient in . Then
[TABLE]
where is the -a.e. well-defined outer normal to at . ∎
2.4. Monotonicity formula
We will also use the monotonicity formula for stationary varifolds; we refer to [12, §17] for the full statement. Here, we will only use it in codimension one for area-minimising boundaries. In particular, we know that if is a minimal set in (i.e. is a function of least gradient), then is regular except for a set of Hausdorff dimension , hence .
Proposition 2.11**.**
Let be a set of finite perimeter such that is locally area-minimising. Then, for each and , the function
[TABLE]
is increasing in . In particular, the limit density
[TABLE]
exists and equals at least one at each point of the support of . ∎
2.5. Traces of characteristic functions
The following Lemma is an easy exercise in traces of functions, but to the best of the author’s knowledge there is no proof in the literature.
Lemma 2.12**.**
Let and . For all except countably many we have
[TABLE]
Proof.
Denote . Fix such that (this happens for all but countably many ). For -almost every we have
[TABLE]
and
[TABLE]
we denote the set of such points by . By our assumption on , the set is of full measure. Now, fix .
There are two possibilities: either or . Without loss of generality assume that . Suppose that . Then on a subsequence we have
[TABLE]
We rewrite this as
[TABLE]
Now, we see that this leads to a contradiction with . We calculate
[TABLE]
[TABLE]
[TABLE]
[TABLE]
hence there exists a sequence such that the mean integral condition defining the trace of at is not satisfied, contradiction. Thus . ∎
3. regularity
In this Section, we prove regularity of least gradient functions for boundary data. The exponent we obtain is consistent with the exponent in the inclusion for ; at the end of the Section, we provide an example that this estimate is optimal. The following Theorem is valid without any regularity assumptions on the metric integrand . The first result in this Section is an estimate on the Lebesgue measure of a superlevel set of a function of -least gradient. Then, we will prove that this estimate implies Theorem 3.2, which is the main result in this Section.
Lemma 3.1**.**
Suppose that is an open bounded set with Lipschitz boundary. Let be a -least gradient function such that . Then for almost all we have
[TABLE]
Proof.
Denote . Recall the isoperimetric inequality: if is a bounded set of finite perimeter, then (see for instance [4, Theorem 5.6.2])
[TABLE]
We want to use the isoperimetric inequality to estimate the Lebesgue measure of the set . To this end, as is defined as a superlevel set of and hence a subset of , we firstly have to estimate . We recall that (see for instance [4, Theorem 5.4.1]) if is an open bounded set with Lipschitz boundary and and , then the extension lies in and
[TABLE]
We use this result with and to estimate . For almost all , so that the statements of Theorem 2.9 and Lemma 2.12 hold, we calculate
[TABLE]
where the last equality follows from Lemma 2.12. Now, we recall that by Theorem 2.9 is a function of -least gradient for almost all . By Lemma 2.10
[TABLE]
[TABLE]
where in the last equality we use Lemma 2.12. Hence
[TABLE]
and by isoperimetric inequality we obtain
[TABLE]
We take both sides of this inequality to the power to obtain the desired inequality with . ∎
Theorem 3.2**.**
Suppose that is an open bounded set with Lipschitz boundary. Suppose that . Let be a -least gradient function such that . Then .
Proof.
Denote . Let us decompose into a positive and negative part, i.e. , where and . Let be an analogous decomposition for . We will prove that and at the end remark how to modify this proof to show that also .
Firstly, we recall that for any measure space we have an inclusion , where denotes the weak Lebesgue space, and that the seminorm is bounded by the norm . In other words, for all
[TABLE]
We apply this to , and take both sides of the inequality to power to obtain that for all
[TABLE]
Denote . While is not necessarily a function of least gradient, we immediately see that for we have ; hence, by Theorem 2.9 almost every superlevel set of is area-minimising. We calculate
[TABLE]
Now, we use Lemma 3.1 to estimate the last integral.
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We combine the above estimates to obtain
[TABLE]
We take both sides to power and obtain
[TABLE]
Hence, if , then . Now, we make a similar calculation for : we take for . We easily see that and we proceed as above, except for the fact that we use a Lemma 3.1 for in place of to estimate the measure of . Finally, as and , we have that . ∎
Remark 3.3*.*
As the proof of Theorem 3.2 comes in two parts in which we estimate separately the norm of in terms of the norm of , a following variant of the Theorem holds: in the notation of Theorem 3.2, let . Then .
Remark 3.4*.*
Notice that the estimate on the norm of does not depend on , only on the dimension (both directly and via the constant in the isoperimetric inequality) and the bounds on the metric integrand . Moreover, we see that if we let , we obtain exactly the maximum principle for least gradient functions (see for instance [9, Theorem 5.1]):
[TABLE]
Finally, we present an example that showing that the exponent in Theorem 3.2 is optimal.
Example 3.5**.**
Let . Take , where is a decreasing function such that on . Then the function , i.e. such that all level lines are vertical, is a function of least gradient with trace .
Now, we look at the measure of superlevel sets of . For all , is a triangle with vertices and , so
[TABLE]
Let . We use this estimate to calculate
[TABLE]
Now, we fix a function defined by the formula . We see that is continuous, strictly decreasing, and that on . We put in the calculation above and obtain
[TABLE]
and the last integral is finite if and only if . We pass with and see that the statement of Theorem 3.2 can only hold for , which is precisely the exponent given by Theorem 3.2.
4. regularity
When the boundary data lie in , then the maximum principle as in Remark 3.4 implies that any solution to Problem (ALGP) lies in . Conversely, if , then , as the trace of a bounded function cannot be unbounded. However, it turns out that may blow up only near the boundary of .
This Section contains three versions of the result stating that -least gradient functions are locally bounded. Firstly, we prove this result on a toy model: we assume that and that is the Euclidean norm. Then, in Proposition 4.2 we prove this in for any metric integrand , using a characterisation of one-dimensional integral currents. Finally, in Theorem 4.3 we prove this in any dimension for the isotropic least gradient problem, using the monotonicity formula for area-minimising boundaries.
Proposition 4.1**.**
Let be an open bounded set with Lipschitz boundary. Suppose that is a least gradient function. Then .
Proof.
Denote . Let be open with Lipschitz boundary and suppose that . Without loss of generality is unbounded from above. In particular, for each we have . As , for sufficiently large we have , hence .
As by Theorem 2.3 each connected component of is a line segment with ends on , the connected component of passing through has length equal at least to . By the co-area formula
[TABLE]
contradiction with . ∎
Proposition 4.2**.**
Let be an open bounded set with Lipschitz boundary. Suppose that is a metric integrand and that is a -least gradient function. Then .
Proof.
Let be a set of finite perimeter. As , the measure is a one-dimensional integral current. By [5, §4.2.25], each one-dimensional integral current may be decomposed into a (possibly infinite) sum of indecomposable integral currents. Each such current is an oriented simple curve with finite length, i.e. its support is parametrised by a function with Lip and .
Let be open with Lipschitz boundary and suppose that . Without loss of generality is unbounded from above. In particular, for each we have . As , for sufficiently large we have , hence .
Let be as above, hence it is a minimal set. Then , the reduced boundary of , can be represented (up to a set of -measure zero) as a possibly infinite union of Lipschitz curves. We have
[TABLE]
where are Lipschitz curves and . As is a -minimal set, none of these curves are closed loops. Without loss of generality, assume that for some ; if , then (with our convention of representing sets of finite perimeter) we could replace it by a point in some arbitrarily close to . Now, we notice that the Euclidean length of a Lipschitz curve connecting and a point in is at least and estimate
[TABLE]
[TABLE]
hence we have a uniform bound from below. By the co-area formula
[TABLE]
contradiction with . ∎
Theorem 4.3**.**
Let be an open bounded set with Lipschitz boundary. Suppose that is a least gradient function. Then .
Proof.
We start as in the previous Propositions: denote , let be open with Lipschitz boundary and suppose that is unbounded from above. In particular, for sufficiently large we have .
As previously, we intend to use the co-area formula and we need to estimate from below the perimeter of . To this end, we will use Proposition 2.11, i.e. the monotonicity formula. We recall that as are area-minimising, we have . Now, let us fix . Then, in the notation of Proposition 2.11, the density satisfies , hence for . We set and calculate
[TABLE]
[TABLE]
[TABLE]
contradiction with . ∎
In fact, this proof leads to an explicit bound on the essential range on on , which depends on and . Before we state Corollary 4.4, let us notice that
[TABLE]
and
[TABLE]
Corollary 4.4**.**
Let be an open bounded set with Lipschitz boundary and be an open bounded set with Lipschitz boundary. Suppose that is a least gradient function with trace . Then
[TABLE]
The left hand side of the above inequality describes the width of the essential range of on .
Proof.
By Lemma 2.10 we have . We make a similar calculation as in the proof of Theorem 4.3 and we see that
[TABLE]
[TABLE]
[TABLE]
from which follows the desired inequality with constant . ∎
Acknowledgements. I would like to thank my PhD advisor, Piotr Rybka, for his support and fruitful discussions about this paper. This work was partly supported by the research project no. 2017/27/N/ST1/02418, ”Anisotropic least gradient problem”, funded by the National Science Centre, Poland.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Amar and G. Bellettini. A notion of total variation depending on a metric with discontinuous coefficients. Ann. Inst. H. Poincaré Anal. Non Linéaire , 11:91–133, 1994.
- 2[2] L. Ambrosio, N. Fusco, and D. Pallara. Functions of bounded variation and free-discontinuity problems . Oxford Math. Monogr., Oxford, 2000.
- 3[3] E. Bombieri, E. de Giorgi, and E. Giusti. Minimal cones and the Bernstein problem. Invent. Math. , 7:243–268, 1969.
- 4[4] L.C. Evans and R.F. Gariepy. Measure theory and fine properties of functions . CRC Press, Boca Raton, 1992.
- 5[5] H. Federer. Geometric Measure Theory . Springer, New York, 1969.
- 6[6] W. Górny. Planar least gradient problem: existence, regularity and anisotropic case. Calc. Var. Partial Differential Equations , 57(4):98, 2018.
- 7[7] W. Górny. Existence of minimisers in the least gradient problem for general boundary data. Indiana Univ. Math. J. , to appear.
- 8[8] W. Górny, P. Rybka, and A. Sabra. Special cases of the planar least gradient problem. Nonlinear Anal. , 151:66–95, 2017.
