Non-coercive radially symmetric variational problems: Existence, symmetry and convexity of minimizers
Graziano Crasta, Annalisa Malusa

TL;DR
This paper establishes the existence and symmetry of solutions for a class of variational problems where traditional methods fail, using novel perturbation techniques to analyze minimizers.
Contribution
It introduces a new approach employing superlinear perturbations to prove existence and properties of minimizers in challenging variational problems.
Findings
Existence of radially symmetric solutions confirmed.
Euler-Lagrange conditions validated for these solutions.
Method applicable when standard calculus of variations techniques do not work.
Abstract
We prove existence of radially symmetric solutions and validity of Euler-Lagrange necessary conditions for a class of variational problems such that neither direct methods nor indirect methods of Calculus of Variations apply. We obtain existence and qualitative properties of the solutions by means of ad-hoc superlinear perturbations of the functional having the same minimizers of the original one.
Click any figure to enlarge with its caption.
Figure 1Peer 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.
Non-coercive radially symmetric
variational problems:
Existence, symmetry and convexity of minimizers
Graziano Crasta, Annalisa Malusa
Dipartimento di Matematica “G. Castelnuovo”, Sapienza Università di Roma
P.le A. Moro 5 – 00185 Roma (Italy)
Dipartimento di Matematica “G. Castelnuovo”, Sapienza Università di Roma
P.le A. Moro 5 – 00185 Roma (Italy)
(Date: April 23, 2019)
Abstract.
We prove existence of radially symmetric solutions and validity of Euler–Lagrange necessary conditions for a class of variational problems such that neither direct methods nor indirect methods of Calculus of Variations apply. We obtain existence and qualitative properties of the solutions by means of ad-hoc superlinear perturbations of the functional having the same minimizers of the original one.
Key words and phrases:
Variational problems, radially symmetric minimizers, Euler–Lagrange inclusions
2010 Mathematics Subject Classification:
49J30,49K21
1. Introduction
This paper is concerned with the variational problem
[TABLE]
where is the open ball centered at the origin and with radius .
Under the sole assumptions of increasing monotonicity of the Lagrangian with respect to the gradient variable one can prove, by means of a symmetrization procedure proposed in [Kro], that the problem admits a one–dimensional reduction, obtained by evaluating the functional only on the set of radially symmetric functions (see Section 3).
This reduction step leads to consider the minimum problem
[TABLE]
on the space
[TABLE]
The qualitative features of the Lagrangian are that is convex (in fact this assumption can be dropped in the autonomous case, see Corollary 5.4) and with, at least, linear growth, while is Lipschitz continuous in the variable. These assumptions do not assure that every minimizing sequence of the functional is precompact in , and hence the direct methods of Calculus of Variations fails.
For this reason indirect methods, based on the solvability of the associated Euler–Lagrange equations, have often been adopted in the literature (see [Cel04, CeTrZa, Clar93, ClarLo, C1, C2, C3, C4, CM1, CM2, CM3, Rock71]). Specifically, if the Lagrangian is convex with respect to both variables and , then any solution of the Euler–Lagrange conditions provides a minimizer, and vice-versa.
The main feature of the present work is that we do not require convexity of the Lagrangian in the variable, so that the above mentioned indirect methods cannot be implemented, and a brand-new approach is needed.
Our starting points are an existence result and the validity of the Euler–Lagrange necessary conditions under the additional requirement that has superlinear growth. These properties can be easily obtained applying well-known results (see Step 1 of the proof of Theorem 4.1). Exploiting the necessary conditions, we obtain explicit a-priori estimates on the derivative of minimizers of superlinear functionals, that depend on the Lipschitz constant of .
When satisfies only a linear growth condition, say for some positive constants and , and the Lipschitz constant of is not too large compared with (see the compatibility relation (hgr) between and in the statement of Theorem 4.1), then we proceed as follows. As a first step, we construct an ad-hoc superlinear perturbation of the slow growth functional, for which we have a Lipschitz minimizer satisfying some a-priori estimates. Then, relying on these estimates, we show that this function is in fact a minimizer of the original slow-growth problem.
In some sense, our technique is reminiscent of the semiclassical approach, based on the construction of barrier functions, for the minimization of functionals of the type on functions satisfying some prescribed boundary condition (see, e.g., [GiDirect, Chapter 1]).
As an application of our results, in Section 5 we prove existence of convex Lipschitz continuous minimizers for variational problems with a constraint on the gradient. For related convexity results, obtained by means of convex rearrangements, see [Greco2012, Carlson].
Finally, we believe that our techniques can be successfully implemented also for minimization problems related to slow-growth integral functionals in a space of functions depending only on the distance from the boundary of (see, e.g., [C6, C7, C8, CFG1, CFG2, CFG3, CFG4, CG1, CG2, CM4, CM5, CM9]).
2. Notation and preliminaries
In what follows will denote the Euclidean norm in , , and is the open ball centered at the origin and with radius .
We shall denote by and respectively the closure and the interior of a set , and by the essential domain of an extended real–valued function , i.e. . We shall always consider proper functions, that is .
Given a locally Lipschitz function , for every we denote by its generalized gradient at in the sense of Clarke (see [Clar, Chapter 2]). We recall that, if is an interior point of , then is a non-empty, convex, compact set (see [Clar, Proposition 2.1.2(a)]). Moreover, if denotes the set of points where is differentiable, then
[TABLE]
(see [Clar, Theorem 2.5.1]). Hence, if is a monotone non-decreasing -Lipschitz function, then for every .
For notational convenience, if also depends on an additional variable , we denote by the generalized gradient of the function .
If is a lower semicontinuous convex function, the generalized gradient coincides with the subgradient (in the sense of convex analysis) at every point , and hence , where and are the left and right derivative of at (see [Clar, Proposition 2.2.7]). We shall often use the following implication, due to the monotonicity of the subgradient:
[TABLE]
If , we denote by its Fenchel–Legendre transform, or polar function (see [EkTem, Section I.4]). With some abuse of notation, if , we use to denote the Fenchel–Legendre transform of the even function , so that
[TABLE]
We remark that, in this case, is a lower semicontinuous convex even function.
If is a lower semicontinuous convex function, its subgradient and the subgradient of the polar function are related in the following way:
[TABLE]
(see [EkTem, Corollary I.5.2]).
We say that is a normal integrand if is lower semicontinuous for almost every (a.e.) , and there exists a Borel function such that for a.e. (see [EkTem, Definition VIII.1.1]).
3. Symmetry of minimizers
In this section we deal with the symmetry properties of minimizers in of functionals of the form
[TABLE]
under very mild assumptions on the Lagrangian .
Our aim is to prove that the minimization problem for in is, in fact, equivalent to the minimization problem for the one–dimensional functional
[TABLE]
in the functional space
[TABLE]
Remark 3.1*.*
Notice that the functional is, up to a constant factor, the functional evaluated on the radially symmetric functions belonging to . In particular, we underline that every function satisfies
[TABLE]
so that .
We adopt a symmetrization procedure introduced in [Kro]. Given a representative of , and , let
[TABLE]
be the radial symmetric function obtained from the profile of along the straight line through [math] and with direction .
In [Kro, Lemma 3.1] it is proved that for a.e. , and
[TABLE]
Following the lines of the proof of [Kro, Theorem 3.4], we show that, for some , is a better competitor than in the minimization problem for .
Theorem 3.2**.**
Let be a normal integrand such that for almost every , the map is monotone non-decreasing. Then for every there exists a radially symmetric function such that . In particular, if admits minimizers in , then it admits a radially symmetric minimizer.
If, in addition, for almost every , the map is strictly monotone increasing, then every minimizer of in is a radially symmetric function.
Proof.
Let be a function in such that , and let be the radially symmetric function defined in (3). We claim that,
[TABLE]
where is the -dimensional Hausdorff measure. Namely, observing that
[TABLE]
using (4) and the monotonicity property of the Lagrangian , we obtain that
[TABLE]
From (5) follows that there exists a set , with , such that for every . Moreover, if is a minimizer for , then for a.e. , and (5) implies that
[TABLE]
hence almost every is a (radially symmetric) minimizer of .
Assume now that for almost every , the map is strictly monotone increasing, and let be a minimizer for . From the computation above, we deduce that (6) holds if and only if
[TABLE]
Since for a.e. , from the strict monotonicity assumption on we deduce that for -a.e. , hence, from (4), we obtain that is parallel to and then is radially symmetric (see [Kro, Lemma 3.3]). ∎
As a consequence of Theorem 3.2, we obtain the following 1–dimensional reduction of the minimum problem.
Corollary 3.3**.**
Let be as in Theorem 3.2. Then the minimization problem
[TABLE]
admits a solution if and only if the one-dimensional minimization problem
[TABLE]
admits a solution, where and are defined in (1) and (2) respectively.
Proof.
If problem (7) admits a solution , then by Theorem 3.2 there exists a radially symmetric function such that , hence is a solution to problem (8).
Assume now that problem (8) admits a solution , and let us prove that is a solution to (7). Namely, if we assume by contradiction that there exists a function such that , then by Theorem 3.2 there exists a radially symmetric function such that , so that the function satisfies , a contradiction. ∎
4. Existence of minimizers and Euler–Lagrange inclusions
In this section we focus our attention to functionals of the form
[TABLE]
whose corresponding one-dimensional functional is
[TABLE]
We prove the existence of radially symmetric Lipschitz continuous minimizers, and the validity of necessary optimality conditions of Euler–Lagrange type, when is a convex function with possibly linear growth in the gradient variable, and is a Lipschitz continuous function with respect to .
As usual, the Euler–Lagrange conditions involve a pair , where is a minimizer in , while the function belongs to the space
[TABLE]
We call a momentum associated with .
Theorem 4.1**.**
Let , and satisfy:
- (g1r)
* is a normal integrand, the function is convex for a.e. , and .*
- (g2r)
There exists a function such that
[TABLE]
and .
- (h1r)
* is a Borel function, , and there exists such that*
[TABLE]
- (hgr)
The functions and are related by the condition
[TABLE]
Then the following holds true.
- (i)
* admits a radially symmetric minimizer in , and admits a minimizer in .*
- (ii)
Every minimizer of is Lipschitz continuous.
- (iii)
For every minimizer of there exists such that the following Euler–Lagrange inclusions hold:
[TABLE]
Remark 4.2*.*
In (g2r) it is not restrictive to assume that is a non-decreasing function, with , and that is convex and smooth (possibly replacing with a suitable regularization of its convex envelope). As a consequence of these assumptions, the function turns out to be strictly increasing in , where , and hence, for every , there exists (a unique) such that . In the following we shall always assume that the function in (g2r) satisfies these additional properties. We recall that, if , such a function is called a Nagumo function (see, e.g., [Ces, Section 10.3]).
Remark 4.3*.*
If satisfies (g1r) and (g2r), then
[TABLE]
Specifically, by symmetry it is enough to show that, for every , for a.e. and (12) holds. Let and let satisfy . Then
[TABLE]
so that . Hence, (11) and (12) follow from the assumption .
Remark 4.4*.*
If satisfies (h1r), then the quantity defined in (hgr) is always finite, since
[TABLE]
We start by proving some a-priori estimates for the solutions of the Euler–Lagrange inclusions.
Lemma 4.5**.**
Let . Then the following hold:
- (i)
If satisfies (h1r) and satisfies (9), then for every , where is the (finite) quantity defined in (hgr).
- (ii)
If and satisfy (g1r)-(g2r)-(h1r)-(hgr), and the pair satisfies the Euler–Lagrange inclusions (9)–(10), then
[TABLE]
Moreover, if is defined by
[TABLE]
then for a.e. , i.e., is Lipschitz continuous and
[TABLE]
Proof.
(i) From Remark 4.4, the quantity defined in (hgr) is finite. By (h1r) we have that for a.e. , so that (9) gives the estimate
[TABLE]
and hence
[TABLE]
(ii) From (10) we have that , and, from (16), we deduce that
[TABLE]
so that (13) holds. Moreover, if is defined by (14), then, by the convexity assumption on , we obtain the estimate
[TABLE]
(with the convention if ). On the other hand, by the very definition of , we have that , hence
[TABLE]
which in turn implies that for a.e. , and (15) follows. ∎
The proof of Theorem 4.1 is divided into two steps: first we show that the result is valid in the superlinear case, i.e. when , and then we obtain the result when by constructing, with the help of the a-priori estimates obtained by the Euler–Lagrange conditions, a family of superlinear functional whose radially symmetric minimizers also minimize the functional .
Proof of Theorem 4.1.
Step 1: superlinear Lagrangians.
(i) In order to use a standard existence result for coercive functionals (see, e.g., [EkTem, Theorem 2.2]), we need to rewrite the functional in a suitable form.
Let us define
[TABLE]
Since, by (h1r), it holds that
[TABLE]
then for all and . Moreover, we have that
[TABLE]
Since , it holds that
[TABLE]
(see, e.g., the derivation of formula (13) in [C4]). Setting , we get
[TABLE]
Observe that, by (g2r),
[TABLE]
Since is a Nagumo function, then by Theorem 2.2 in [EkTem] the functional
[TABLE]
admits a minimizer in . Hence, by Corollary 3.3, the functional admits a minimizer in .
(ii)-(iii) Let us prove that, for every minimizer of in , there exists a momemtum associated with . (Hence, the Lipschitz continuity of will follow from Lemma 4.5.) Specifically, the conclusion follows from [Clar, Theorem 4.2.2], once we show that all the assumptions are satisfied. The Lagrangian is convex with respect to , and satisfies the Basic Hypotheses 4.1.2 in [Clar]. Moreover, the Hamiltonian of the problem, i.e., the Fenchel–Legendre transform of with respect to the last variable:
[TABLE]
satisfies the strong Lipschitz condition near every arc, since, by (h1r),
[TABLE]
Finally, the minimization problem is calm, since it is a free-endpoint problem, hence all assumptions of Theorem 4.2.2 in [Clar] are satisfied.
Step 2: slow growth Lagrangians.
(i) Let be defined by (14), and, for given, let be the class of all convex superlinear non-decreasing functions , such that for every .
Given and , let us define the superlinear Lagrangian
[TABLE]
and the corresponding functional
[TABLE]
For every and the functional satisfies the assumptions of Step 1, hence there exist a minimizer of in and an associated momentum , such that
[TABLE]
By Lemma 4.5(i), we obtain that for every . On the other hand, since
[TABLE]
and, by Lemma 4.5(ii), with , we obtain that
[TABLE]
Hence, a.e. in , so that , and .
By the discussion above, for every and every , we have that
[TABLE]
hence we conclude that is independent of and .
We claim that . Specifically, assume by contradiction that there exists such that . Since , by the de La Vallée Poussin criterion (see, e.g. [Ces, Theorem 10.3.i]), there exists a function such that , i.e.
[TABLE]
By (17), for small enough we have that , a contradiction.
(ii) Let be a minimizer of in , and let us prove that is Lipschitz continuous.
Assume by contradiction that is not Lipschitz continuous, i.e. for every (here denotes the Lebesgue measure on ).
Let us define , and by:
[TABLE]
Observe that, by (g2r),
[TABLE]
so that for every . (The inequality is trivially satisfied for those values of such that .) Let us define the function
[TABLE]
Since , we have that for every and .
Let be a Nagumo function such that . Given , let . Since , we have that
[TABLE]
whereas
[TABLE]
hence there exists such that
[TABLE]
For every , let us define the function (see Figure 1)
[TABLE]
and let
[TABLE]
Since , for every we have that
[TABLE]
Observe that, by the definition of and (19),
[TABLE]
hence, by (18),
[TABLE]
On the other hand, if is a minimizer of , then by Step 1 there exists such that satisfies the Euler–Lagrange inclusions (9)–(10) with replaced by . From Lemma 4.5(i) we deduce that
[TABLE]
(where the last inequality follows from ), hence
[TABLE]
and, in conclusion,
[TABLE]
in contradiction with the assumption that is a minimizer of .
(iii) Finally, let us prove that satisfies the Euler–Lagrange inclusions. Let be such that a.e. in . Reasoning as in the existence proof, is a minimizer of for every and , with . Hence, satisfies the Euler–Lagrange inclusions with instead of . Since for a.e. , the conclusion follows. ∎
5. Convex solutions of variational problems with gradient constraints
As an application of the previous results, we obtain the existence of convex radially symmetric minimizers for autonomous functionals of the form
[TABLE]
in the space
[TABLE]
of Sobolev functions with gradient constraint given by a monotone non-decreasing function .
Theorem 5.1**.**
Let us consider the integral functional (20), where and satisfy the following assumptions:
- (g1)
* is a convex function;*
- (g2)
;
- (h1)
* is a convex function;*
- (hg)
.
Then the following hold.
- (i)
* admits a radially symmetric minimizer in .*
- (ii)
There exists a momentum such that the following Euler–Lagrange inclusions hold:
[TABLE]
where
[TABLE]
- (iii)
If [resp. ], then is a convex [resp. concave] function.
- (iv)
If, in addition, has a strict minimum point at [math], or is a strictly monotone function, then every minimizer of in is radially symmetric.
Proof.
The constraint in the definition of the functional space can be incorporated into the Lagrangian. Specifically, let us define
[TABLE]
where is the indicator function of a set , defined by if and otherwise. Then minimizing in is equivalent to minimizing in .
We remark that, if satisfies (g1)–(g2), then satisfies (g1r)–(g2r) and
[TABLE]
We shall prove the theorem only in the case (since the case can be handled similarly).
If [math] is a minimum point of , then clearly parts (i)-(ii)-(iii) are satisfied choosing and . Hence, it is not restrictive to prove (i)-(ii)-(iii) under the additional assumption that [math] is not a minimum point of . Since , and is a convex function, we have that .
Since , the (possibly empty) convex and closed set is contained in the open half-line . If , let , otherwise let . Let us define
[TABLE]
(the first condition is empty if ) and
[TABLE]
Given , let , and observe that . If is a minimizer of , then also is a minimizer of ; moreover,
[TABLE]
so that is a minimizer of .
Hence, we have proved the following
Claim 1: If is a minimizer of , then is a minimizer of both and .
After this preliminary reduction, let us prove (i)–(iv).
(i) Thanks to Claim 1 and Theorem 3.2, assertion (i) is a consequence of the following
Claim 2: There exists a Lipschitz continuous, monotone non-decreasing minimizer of in satisfying .
Specifically, from (hg) we have that
[TABLE]
Hence, from Theorem 4.1 the functional admits a Lipschitz continuous minimizer .
Let us define
[TABLE]
By Riesz’s Rising sun Lemma, we have that is the union of a finite or countable family , , of pairwise disjoint open intervals, with for every (unless , in which case ). Hence, the function
[TABLE]
is a Lipschitz continuous, monotone non-decreasing function and , i.e., is a minimizer of with the required properties, and Claim 2 is proved.
(ii) Here and in the following, will denote the minimizer of constructed in Claim 2. By Theorem 4.1, there exists a momentum such that the Euler–Lagrange inclusions (21)–(22) are satisfied with replaced by . Observing that , and
[TABLE]
the same pair satisfies also the Euler–Lagrange inclusions (21)–(22) (with the original ).
(iii) Let us first prove the claim under the additional assumption that . In this case, the inclusion (21) is, in fact, the equation
[TABLE]
is monotone non-decreasing, and is Lipschitz continuous.
Since is monotone non-decreasing, there exists such that for every , and for every . Hence, to prove that is convex in , it is enough to prove that is (equivalent to) a non-decreasing function in .
Moreover, by (22), the explicit form (23) of , and the monotonicity of , this property will follow once we prove that is strictly increasing in .
For , we have that , hence . As a consequence, is strictly positive and strictly monotone increasing in .
Let us fix . We have that
[TABLE]
Since , the function is absolutely continuous in and . Moreover, since the function is monotone non-decreasing,
[TABLE]
Hence, for every , so that from (24) we deduce that the function is monotone non-decreasing. As a consequence, the function is strictly increasing in .
Finally, the assumption can be dropped as in [C3, §4, Step 3] (see also [CM2, CM3]).
(iv) If [math] is a strict minimum point of , then is strictly monotone increasing in , and the result follows from Theorem 3.2. If is a strictly monotone function, the proof can be found in [CePe1994] (step (c) in the proof of Theorem 1). ∎
Example 5.2* (The case ).*
Let , let be a non-decreasing function, let satisfy (g1)–(g2), and let be a function satisfying for every . Then every minimizer of in is convex. Specifically, let and let be an associated momentum. From (9) we deduce that for every , hence is a strictly increasing function. Since and , we conclude that is non-decreasing, hence is a convex functions.
Example 5.3*.*
We show that, if and is not convex, then a minimizer of need not be convex. Let , , , , , and consider the function
[TABLE]
We claim that the non-convex function
[TABLE]
is a minimizer of . Specifically, the family of all solution of the Euler–Lagrange inclusions (9)–(10) is given by the trivial pair and by the pairs of the form , with , , and
[TABLE]
so that . A direct computation shows that , for every , and , hence the claim follows.
From the analysis above we can prove the following result without requiring the convexity of . In the following, denotes the bipolar function of .
Corollary 5.4**.**
Let us consider the integral functional (20), where satisfies the following assumptions:
- (g0)
* is a lower semicontinuous proper function, such that ;*
- (g2)
.
Moreover, assume that satisfies (h1) and (hg). Then admits a radially symmetric minimizer in .
Proof.
The relaxed functional
[TABLE]
satisfies all the assumptions of Theorem 5.1, hence there exist a radial minimizer of in and a momentum such that (21)–(22) hold.
As in the proof of Theorem 5.1(iii), considering without loss of generality and , we have already proved that is convex and there exists such that for every , and for every . Moreover, the function is strictly increasing in .
Let be the set of all such that belongs to the set of the extremal points of the epigraph of . We recall that for every (see [C4, Remark 5.3]). Reasoning as in [CePe1994] (see the proof of Theorem 2), from the strict monotonicity of in follows that for a.e. . Since for every , we conclude that , hence is a minimizer of . ∎
References
