Minimization and Steiner symmetry of the first eigenvalue for a fractional eigenvalue problem with indefinite weight
Claudia Anedda, Fabrizio Cuccu, Silvia Frassu

TL;DR
This paper investigates the properties of the first eigenvalue in a fractional eigenvalue problem with indefinite weight, establishing continuity, convexity, differentiability, and symmetry of minimizers under certain conditions.
Contribution
It introduces new results on the weak* continuity, convexity, and differentiability of the eigenvalue map, and proves the existence and symmetry of minimizers in Steiner symmetric domains.
Findings
The eigenvalue map is weak* continuous and convex.
Existence of minimizers of the first eigenvalue under rearrangements.
Minimizers inherit Steiner symmetry in symmetric domains.
Abstract
Let , , be an open bounded connected set. We consider the fractional weighted eigenvalue problem in with homogeneous Dirichlet boundary condition, where , , is the fractional Laplacian operator, and . We study weak* continuity, convexity and G\^ateaux differentiability of the map , where is the first positive eigenvalue. Moreover, denoting by the class of rearrangements of , we prove the existence of a minimizer of when varies on . Finally, we show that, if is Steiner symmetric, then every minimizer shares the same symmetry.
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
TopicsNonlinear Partial Differential Equations · Advanced Mathematical Modeling in Engineering · Numerical methods in inverse problems
Minimization and Steiner symmetry of the first eigenvalue for a fractional eigenvalue problem
with indefinite weight
Abstract
Let , , be an open bounded connected set. We consider the fractional weighted eigenvalue problem in with homogeneous Dirichlet boundary condition, where , , is the fractional Laplacian operator, and .
We study weak* continuity, convexity and Gâteaux differentiability of the map , where is the first positive eigenvalue. Moreover, denoting by the class of rearrangements of , we prove the existence of a minimizer of when varies on . Finally, we show that, if is Steiner symmetric, then every minimizer shares the same symmetry.
Claudia Anedda, Fabrizio Cuccu and Silvia Frassu
Mathematics and Computer Science Department,
University of Cagliari, 09124 Cagliari (CA), Italy
††Keywords: fractional Laplacian, eigenvalue problem, optimization, Steiner symmetry.††AMS (2010) Subject Classifications: 35R11, 47A75, 49R05.
1 Introduction
Recently, great attention has been focused on the study of fractional and nonlocal operators of elliptic type, both for pure mathematical research and in view of concrete real-world applications. This type of operators arises in a quite natural way in many different contexts, such as, among others, the thin obstacle problem, optimization, finance, phase transition, stratified materials, anomalous diffusion, crystal dislocation, soft thin films, semipermeable membranes, flame propagation, conservation laws, ultrarelativistic limits of quantum mechanics, quasi-geostrophic flows, multiple scattering, minimal surfaces, materials science, water waves, chemical reactions of liquids, population dynamics, geophysical fluid dynamics and mathematical finance. In all these cases, the nonlocal effect is modeled by the singularity at infinity. For more details and applications, see [6, 10, 28] and the references therein.
In this paper we consider the weighted fractional eigenvalue problem
[TABLE]
where () is a bounded domain with boundary and , , denotes the fractional Laplacian operator defined for all by
[TABLE]
where is a Lebesgue measurable function and is a suitable normalization constant. In the sequel we will assume (for a precise evaluation of see [9, 16]). Finally, , and .
The operator is nonlocal, in the sense that the value of at any point depends not only on the values of on the whole , but actually on the whole , since can be thought as the expected value of a random variable tied to a process randomly jumping arbitrarily far from the point . In this sense, the natural Dirichlet boundary condition consists in assigning the values of in rather than merely on (a general reference on the theory can be found in [16, 24]).
The problem (1.1) with has been investigated by Servadei and Valdinoci in [27] for a general nonlocal operator. Molica Bisci et al., in [24], studied the same problem with a positive and Lipschitz continuous weight . Iannizzotto and Papageorgiou, in [21], considered the case of a general positive function and Frassu and Iannizzotto, in [18], treated a more general eigenvalue problem with indefinite weight .
We denote by , , the -th eigenvalue of problem (1.1) corresponding to the weight . In this paper we study the dependence of on , in particular we investigate continuity and, for , convexity and differentiability properties. Then, we examine the minimization of in the class of rearrangements of a fixed function . We prove the existence of minimizers and a characterization of them in terms of the eigenfunctions relative to . Moreover, when is a Steiner symmetric domain, we get that any minimizer inherits the same symmetry. Consequently, if is a ball, there exists a unique radially symmetric minimizer.
The analogous problem in the case of the Laplacian operator has been studied by Cox and McLaughlin in [12, 13] when the weight is a positive step function. Cosner et al. in [11] studied the same optimization problem with an indefinite weight for the first eigenvalue, they proved existence of optimizers and a characterization formula of them. Related problems are investigated in [2, 3]. In the first paper the eigenvalue problem is driven by the -Laplacian operator. In the second an example of symmetry breaking of the minimizer is exhibited. For a complete survey on the optimization of eigenvalues related to elliptic problems we refer the reader to [20].
We remark that the argument used in this paper to prove the existence of minimizers is inspired by the approach of [20] and it is different from those used in [11, 12, 13], nevertheless it can be applied also for the corresponding problem driven by the Laplacian operator.
This paper is organized in this way: in Section 2 we fix the functional framework and study the eigenvalues of problem (1.1); in Section 3 we collect some results about rearrangements of measurable functions; in Section 4 we prove the existence results; finally, in Section 5 we focus on the symmetry of the minimizers.
Throughout the paper, and unless otherwise specified, measurable means Lebesgue measurable and denotes the Lebesgue measure of a measurable set .
2 Fractional weighted eigenvalue problem
Let , , be a bounded domain with boundary. We denote by
[TABLE]
the usual inner product in and by
[TABLE]
the corresponding norm.
In order to formulate problem (1.1) in weak form we introduce the fractional Sobolev space (for a systematic treatise of this topics see [16]). For any we define the fractional Sobolev space
[TABLE]
and its subspace
[TABLE]
is a separable Hilbert space under the inner product
[TABLE]
whose associated norm is
[TABLE]
We denote by and the topological dual of and its norm. Clearly and moreover contains as a dense subset.
As in the case of the usual Sobolev spaces, the following inclusions
[TABLE]
[TABLE]
are compact and dense and there exists a positive constant such that
[TABLE]
[TABLE]
Let us now introduce the notion of weak solution of the boundary value problem
[TABLE]
where . A function is called weak solution of problem (2.3) if
[TABLE]
holds, where means the duality between and . By the Riesz-Fréchet representation Theorem, for every there exists a unique solution of (2.3) and moreover
[TABLE]
We call ,
[TABLE]
the linear operator defined by . Identity (2.4) implies
[TABLE]
For any in , let be the linear operator defined by . Of course
[TABLE]
Next, we introduce the linear operator
[TABLE]
defined by or, briefly, . Equivalently, is the unique weak solution of the problem
[TABLE]
i.e.
[TABLE]
From (2.1), (2.2), (2.6) and (2.7) it follows straightforwardly that
[TABLE]
In the sequel we will use the formula
[TABLE]
In particular, (2.10) implies for all .
Proposition 2.1**.**
Let be the operator (2.8). Then is a self-adjoint compact operator.
Proof.
For all , by (2.9), we have
[TABLE]
then is self-adjoint.
The compactness of the operator is an immediate consequence of the representation and the compactness of and . ∎
By general theory of self-adjoint compact operators (see [4, 15, 23]) it follows that all nonzero eigenvalues of have a finite dimensional eigenspace and they can be obtained by the Fischer’s Principle
[TABLE]
and
[TABLE]
where the first extrema are taken over all the subspaces of of dimension . The sequence contains all the real positive eigenvalues (repeated with their multiplicity), is decreasing and converging to zero, whereas is formed by all the real negative eigenvalues (repeated with their multiplicity), is increasing and converging to zero.
Remark 2.1**.**
By the Fischer’s Principle it follows easily that for all and
For this reason, in the rest of the paper, we will consider mainly positive eigenvalues.
We will write as short form of and similarly for . The following proposition is analogous to [15, Proposition 1.11].
Proposition 2.2**.**
*Let , the operator defined in (2.8) and , its eigenvalues. The following statements hold:
i) if , then there are no positive eigenvalues;
ii) if , then there is a sequence of positive eigenvalues ;
iii) if , then there are no negative eigenvalues;
iv) if , then there is a sequence of negative eigenvalues .*
Proof.
i) Let be an eigenvalue and a corresponding eigenfunction. Then
[TABLE]
ii) By measure theory covering theorems, for each positive integer there exist disjoint closed balls in such that for . Let such that for every . Note that the functions are linearly independent and let F_{k}=\span. is a subspace of and for every , , , we have
[TABLE]
where , and denote, respectively, the euclidean norm of the vector , the norm of the non null matrix and the inner product in . From the Fischer’s Principle (2.11) we conclude that for every .
The cases iii) and iv) are similarly proved. ∎
Finally, we introduce the weak formulation of problem (1.1). A function is said an eigenfunction of (1.1) associated to the eigenvalue if
[TABLE]
that is
[TABLE]
It is easy to check that zero is not an eigenvalue of problem (1.1). The eigenvalues of problem (1.1) are exactly the reciprocal of the nonzero eigenvalues of the operator and the correspondent eigenspaces coincide. Indeed, if is an eigenvalue of problem (1.1) and is an associated eigenfunction, by (2.12) we have
[TABLE]
and then, by definition of , . Consequently, in general, the eigenvalues of problem (1.1) form two monotone sequences
[TABLE]
and
[TABLE]
where every eigenvalue appears as many times as its multiplicity, the latter being finite owing to the compactness of .
It has been recently shown in [18] that and are simple and any associated eigenfunction is one signed in . We call first eigenfunction any eigenfunction relative to . The variational characterization (2.11) for becomes
[TABLE]
and, thus, for we have
[TABLE]
The maximum in (2.13) (respectively the minimum in (2.14)) is obtained if and only if (respectively ) is a first eigenfunction. Throughout the paper we will denote by the first positive eigenfunction of problem (1.1) normalized by
[TABLE]
which is equivalent to
[TABLE]
As last comment, we observe that is homogeneous of degree 1, i.e.
[TABLE]
This follows immediately from (2.13).
3 Rearrangements of measurable functions
In this section we introduce the concept of rearrangement of a measurable function and summarize some related results we will use in next section. The idea of rearranging a function dates back to the book [19] of Hardy, Littlewood and Pólya, since than many authors have investigated both extensions and applications of this notion. Here we relies on the results in [1, 7, 8, 14, 22, 26].
Let be an open bounded set of .
Definition 3.1**.**
For every measurable function the function defined by
[TABLE]
is called distribution function of .
The symbol is also used. It is easy to prove the following properties of .
Proposition 3.1**.**
For each the distribution function is decreasing, right continuous and the following identities hold true
[TABLE]
Definition 3.2**.**
Two measurable functions are called equimeasurable functions or rearrengements of one another if one of the following equivalent conditions is satisfied
i) ;
ii) .
Equimeasurability of and is denoted by . Equimeasurable functions share global extrema and integrals as it is stated precisely by the following proposition.
Proposition 3.2**.**
Suppose and let be a Borel measurable function, then
i) ;
ii) and ;
iii) ;
iv) implies and .
For a proof see, for example, [14, Proposition 3.3] or [8, Lemma 2.1].
In particular, for each , if and then and
[TABLE]
Definition 3.3**.**
For every measurable function the function defined by
[TABLE]
is called decreasing rearrangement of .
An equivalent definition (used by some authors) is .
Proposition 3.3**.**
For each its decreasing rearrangement is decreasing, right continuous and we have
[TABLE]
Moreover, if is a Borel measurable function then implies and
[TABLE]
Finally, and, for each measurable function we have if and only if .
Some of the previous claims are simple consequences of the definition of , for more details see [14, Chapter 2].
As before, it follows that, for each , if then and
Definition 3.4**.**
Given two functions , we write if
[TABLE]
Note that if and only if and . Among many properties of the relation we mention the following (a proof is in [14, Lemma 8.2]).
Proposition 3.4**.**
For any pair of functions and real numbers and , if a.e. in and then a.e. in .
Proposition 3.5**.**
For let . Then we have .
Definition 3.5**.**
Let a measurable function. We call the set
[TABLE]
class of rearrangement of or set of rearrangements of .
Note that, for , if is in then is contained in .
As we will see in the next section, we are interested in the optimization of a functional defined on a class of rearrangement , where belongs to . For this reason, although almost all of what follows holds in a much more general context, hereafter we restrict our attention to rearrangement classes of functions in . We need compactness properties of the set , with a little effort it can be showed that this set is closed but in general it is not compact in the norm topology of . Therefore we focus our attention on the weak* compactness. By we denote the closure of in the weak* topology of .
Proposition 3.6**.**
Let be a function of . Then is
i) weakly compact;*
ii) metrizable in the weak topology;*
iii) sequentially weakly compact.*
Proof.
i) By (3.1) it follows that is contained in . is weakly* compact and then it is also weakly* closed because the weak* topology is Hausdorff. Hence is a weakly* closed subset of and thus it is weakly* compact as well. ii) Owing to the separability of , is metrizable in the weak* topology and the claim follows. iii) It is an immediate consequence of i) and ii). ∎
Moreover, the sets and have further properties.
Definition 3.6**.**
Let be a convex set of a real vector space. An element in is said an extreme point of if for every and in the identity implies .
A vertex of a polygon is an example of extreme point.
Proposition 3.7**.**
Let be a function of , then
i) ,
ii) is convex,
iii) is the set of the extreme points of .
Proof.
The claims follow from [14, Theorems 22.13, 22.2, 17.4, 20.3]. ∎
An evident consequence of the previous theorem is that is the weakly* closed convex hull of .
The following is [14, Theorem 11.1] rephrased for our case.
Proposition 3.8**.**
Let and . Then
[TABLE]
moreover both sides of (3.2) are taken on.
The previous proposition implies that the linear optimization problems
[TABLE]
and
[TABLE]
admit solution.
Finally, we recall the following result proved in [7, Theorem 5].
Proposition 3.9**.**
Let and . If problem (3.3) has a unique solution , then there exists an increasing function such that a.e. in .
4 Existence of minimizers
Let , be the class of rearrangements of and , , be the -th positive eigenvalue of problem (1.1). In this section we investigate the optimization problem
[TABLE]
which can be expressed in terms of the eigenvalue of the operator , defined in (2.8), as
[TABLE]
Observe that, by Proposition 2.2, and (the positive first eigenfuction of problem (1.1) normalized as in (2.15)) are well defined only when . We extend them to the whole space by putting
[TABLE]
and
[TABLE]
Remark 4.1**.**
Note that if and only if a.e. in and, in this circumstance, the inequality
[TABLE]
holds, where varies among all the -dimensional subspaces of .
Moreover, from (2.17), we have for every .
Theorem 4.1**.**
*Let , be the linear operator (2.8), as defined in (4.1) for and as in (4.2). Then
i) the map is sequentially weakly* continuous from to endowed with the norm topology;
ii) the map is sequentially weakly* continuous in ;
iii) the map is sequentially weakly* continuous from to (endowed with the norm topology). In particular, for any sequence weakly* convergent to , with , then converges to in .*
Proof.
i) Let be a sequence which weakly* converges to in . Being bounded in , there exists a constant such that
[TABLE]
We begin by proving that tends to in for any fixed . Note that the sequence is weakly convergent to in , then, exploiting the compactness of the embedding , we conclude that this convergence is also strong in . Then
[TABLE]
where we used , with defined by (2.5), and (2.6). Therefore converges to in .
Now, for fixed , let , , be a maximizing sequence of
[TABLE]
Then, being , we can extract a subsequence (still denoted by ) weakly convergent to some . Since and are compact operators (see Proposition 2.1), it follows that converges to and converges to strongly in as goes to . Thus we find
[TABLE]
This procedure yields a sequence in such that for all . Then, up to a subsequence, we can assume that weakly converges to a function and (by compactness of the embedding ) strongly in . By using (2.2), (2.6) and (4.4) we find
[TABLE]
Therefore converges to in the operator norm.
ii) If we show that, for any and the estimates
[TABLE]
hold, then the claim follows immediately from i).
We split the argument in three cases.
Case 1. .
Following [20, Theorem 2.3.1] and by means of the Fischer’s Principle (2.11) we have
[TABLE]
where is a -dimensional subspace of such that
[TABLE]
and is a function in such that
[TABLE]
Interchanging the role of and we find (4.5).
Case 2. , (and similarly in the case , ).
Note that in this case (4.3) holds for the weight function . Then the previous argument still applies provided that we replace the first step of the inequality chain by
[TABLE]
Case 3. .
In this case (4.5) is obvious.
Therefore statement ii) is proved.
iii) Let be such that is weakly∗ convergent to in . Being , up to a subsequence we can assume that is weakly convergent to , strongly in and pointwisely a.e. in .
First suppose . Then, by ii) weakly converges in to . Moreover, tends to . Therefore strongly converges to in .
Next, consider the case . By ii) we have for all large enough. This implies and . Positiveness and pointwise convergence of to imply a.e. in . Moreover, by (2.16) we have
[TABLE]
and by ii), passing to the limit, we find
[TABLE]
which implies . By using the weak form of problem (1.1) for we have
[TABLE]
and, letting to infinity, we deduce .
By ii) weakly converges in to and tends to . Hence strongly converges to in .
The last claim is immediate provided one observes that implies for all large enough. ∎
Theorem 4.2**.**
Let , be defined as in (4.1) for and the weak closure in of the class of rearrangement introduced in Definition 3.5. Then
i) the map is convex on ;
ii) if and are linearly indipendent and , then*
[TABLE]
*for all ;
iii) if , then the map is strictly convex on .*
Proof.
i) The Fischer’s Principle (2.11) and (4.3) both for yield
[TABLE]
for every . Moreover, if , then equality sign holds and the supremum is attained when is an eigenfunction of . Let , . We show that
[TABLE]
If (4.7) is obvious. Suppose . Then, for all we have
[TABLE]
where we used (2.10) and (4.6). Taking the supremum in the left-hand term and using (4.6) again with equality sign we find (4.7).
ii) Arguing by contradiction, we suppose that equality holds in (4.7). We find out that and are linearly dependent. Equality sign in (4.7) implies , then (by (4.6)) the equality also holds in (4.8) with . We get
[TABLE]
The simplicity of the first eigenvalue, the positiveness of and the normalization (2.15) imply that . Writing the problem (1.1) in weak form for both weigths and we have
[TABLE]
and
[TABLE]
Taking the difference of these identities we find
[TABLE]
which gives , i.e. and are linearly dependent.
iii) First, note that for any . This follows easily by i) of Proposition 3.7, Definition 3.4 and Proposition 3.3. Therefore, we have and thus for all . Next, we show that any distinct functions and in are linearly independent. Indeed, let with . Integrating over we obtain , which implies and, in turn, and . Hence, and are linearly independent. The statement is now an immediate consequence of ii) ∎
Remark 4.2**.**
If , , the map is not strictly convex on . In fact, in this case (by Proposition 3.5) the null function belongs to . By convexity of (see Proposition 3.7), for every and, by Remark 4.1, we have , which excludes strict convexity.
For the definitions and some basic results on the Gâteaux differentiability we refer the reader to [17].
Theorem 4.3**.**
Let , be defined as in (4.1) for and denote the first positive eigenfunction of problem (1.1) normalized as in (2.15). The map is Gâteaux differentiable at any such that with Gâteaux differential equal to . In other words, for every direction we have
[TABLE]
Proof.
Let us compute
[TABLE]
Note that, by ii) of Theorem 4.1, converges to as goes to zero for any . Therefore, for small enough.
The eigenfunctions and satisfy
[TABLE]
and
[TABLE]
By choosing in the former equation, in the latter and comparing we get
[TABLE]
Rearranging we find
[TABLE]
If goes to zero, then by iii) of Theorem 4.1 it follows that converges to in and therefore in . Passing to the limit in (4.10) and using (2.16) we conclude
[TABLE]
i.e. (4.9) holds.∎
We are now able to prove our main result.
Theorem 4.4**.**
*Let be the first positive eigenvalue of problem (1.1), such that and the class of rearrangement of introduced in Definition 3.5. Then
i) there exist such that*
[TABLE]
ii) there exists an increasing function such that
[TABLE]
where is the positive first eigenfunction relative to normalized as in (2.15).
Proof.
i) By iii) of Proposition 3.6 and ii) of Theorem 4.1, is sequentially weakly* continuous and the map is sequentially weakly* compact. Therefore, there exists such that
[TABLE]
Note that, by Proposition 2.2, the condition guarantees .
Let us show that actually belongs to (in fact, the following argument shows that there are not maximizers of in ). Proceeding by contradiction, suppose that . Then, by iii) of Proposition 3.7, is not an extreme point of and thus there exist such that and . By i) of Theorem 4.2 and being a maximizer, we have
[TABLE]
and then, equality sign holds. This implies , that is and are maximizers as well. Now, applying ii) of Theorem 4.2 to and with , we conclude that and are linearly dependent. Without loss of generality, we can assume that there exists such that , moreover is nonzero since is a maximizer. Combining with we get . It is immediate to show that at least one of the coefficients and must be nonnegative. In either cases we find a contradiction. For instance, if , by Remark 4.1 and maximality of we obtain
[TABLE]
which implies and yields the contradiction . The other case is analogous. Thus, we conclude that and
[TABLE]
Being , we have
[TABLE]
for all . Therefore, (4.13) is equivalent to (4.11) and i) is proved.
ii) We prove the claim by using Proposition 3.9; more precisely, we show that
[TABLE]
for every . By exploiting the convexity of (see Theorem 4.2) and its Gâteaux differentiability in (see Theorem 4.3) we have (for details see [17])
[TABLE]
for all . First, let us suppose . Comparing with (4.15) we find
[TABLE]
that is (4.14).
Next, let us consider the case , . By the argument used in part i) there are not maximizers of in , therefore .
If and are linearly independent, then, ii) of Theorem 4.2 implies
[TABLE]
Then, as in the previous step, (4.15) with in place of yields (4.14).
Finally, let and be linearly dependent. Being and both nonzero, we can assume for a constant . Therefore . Now, by i) and ii) of Proposition 3.2, the functions and are equimeasurable and . This leads to and, being and distinct, . Thus , which by (2.16) gives
[TABLE]
i.e. (4.14). This completes the proof. ∎
Remark 4.3**.**
If satisfies the stronger condition , then the proof simplifies as one can rely on iii) of Theorem 4.2 (strict convexity of ). Indeed, from , , it follows immediately the contradiction
[TABLE]
Further, note that in this case is well defined for all (it follows by i) of Proposition 3.7, Definition 3.4 and Proposition 3.3 with equal to the identity function). However, the previous proof shows that no minimizer of belongs to .
Finally, in this case the estimate
[TABLE]
holds, where denotes the first eigenvalue of problem (1.1) with . The estimate (4.16) follows by the fact that the constant function belongs to (see Proposition 3.5), the minimality of and the identity (which is a straightforward consequence of the variational characterization (2.14)).
Remark 4.4**.**
The study of the maximization of on seems to be rather different. We list here some partial results. Assume . If , then, by Proposition 3.5 and Proposition 3.7, the nonpositive constant function belongs to . Therefore, by definition of , which, in turns, being dense in and sequentially weak* continuous, implies and, finally, .
If, instead , then by proceeding as in the first part of the previous proof and using iii) of Theorem 4.2, one immediately concludes that there is a unique such that
[TABLE]
which, in this case, is equivalent to
[TABLE]
Moreover, by Theorem 4.3, for all and we can write
[TABLE]
for that goes to zero. Finally, after some easy algebraic manipulations and passing to the limit we find
[TABLE]
Remark 4.5**.**
As already note in Remark 2.1, we have for all such that . Furthermore, it is easy to see from (2.12) that the eigenspaces relative to and coincide. Finally, observe that by iii) of Proposition 3.2 with , it follows that and then . Thus, Theorem 4.4 can be reformulated in terms of the first negative eigenvalue as follows.
Theorem 4.5**.**
*Let be the first negative eigenvalue of problem (1.1), such that and the class of rearrangement of introduced in Definition 3.5. Then
i) there exist such that*
[TABLE]
ii) there exists a decreasing function such that
[TABLE]
where is the first positive eigenfunction relative to normalized as in (2.15).
5 Steiner symmetry
We introduce first the definitions and some results about the Steiner symmetrization of sets and functions. For a thorough treatment we refer the reader to [5]. Then, we prove our symmetry result.
Let for any fixed and let be the hyperplane .
Definition 5.1**.**
Let be a measurable set. Then
i) the set
[TABLE]
where denotes the one dimensional Lebesgue measure, is said Steiner symmetrization of with respect to the hyperplane ;
ii) the set is said Steiner symmetric if .
It can be shown that .
Definition 5.2**.**
Let be a measurable set of finite measure and a measurable function bounded from below. Then
i) the function , defined by
[TABLE]
is said Steiner symmetrization of with respect to the hyperplane ;
ii) the function is said Steiner symmetric if .
It can be proved that
[TABLE]
Proposition 5.1**.**
Let be a measurable set of finite measure, a measurable function bounded from below and an increasing function. Then a.e. in .
For the proof see [5, Lemma 3.2].
Proposition 5.2** (Hardy-Littlewood’s inequality).**
Let be a measurable set of finite measure, two measurable functions bounded from below such that . Then
[TABLE]
This proposition follows easily from [5, Lemma 3.3].
Proposition 5.3** (nonlocal Pòlya-Szegö’s inequality).**
Let be an open bounded set, and . Then
[TABLE]
moreover, the equality holds if and only if is proportional to a translate of a function which is symmetric with respect to the hyperplane .
For the proof we refer the reader to [25].
Theorem 5.4**.**
Let be a bounded domain of class Steiner symmetric with respect to the hyperplane and such that . Then, every minimizer of the problem (4.11) is Steiner symmetric relative to .
Proof.
Let be as in (4.11) and let be the positive first eigenfunction of the problem (1.1) normalized as in (2.15).
By (4.12) and Proposition 5.1, the Steiner symmetry of is a consequence of the analogous symmetry of ; hence it suffices to show that . By (2.14) we have
[TABLE]
Propositions 5.1, 5.2 and 5.3 yield
[TABLE]
and
[TABLE]
Consequently we find
[TABLE]
where is the normalized positive first eigenfunction corresponding to and the last inequality comes from (a straightforward consequence of (5.1)) and the minimality of . Therefore, all the inequalities are actually equalities and this implies the equality sign also in (5.2). Then, by Proposition 5.3 it follows that
[TABLE]
where is Steiner symmetric with respect to a hyperplane , . Therefore is symmetric with respect to both hyperplanes and . Being bounded, it follows that and then is Steiner symmetric relative to , i.e.
[TABLE]
This completes the proof. ∎
In particular, when is a ball we find the following assertion.
Corollary 5.5**.**
Let be a ball in and such that . Then every minimizer of problem (4.11) is decreasing radially symmetric.
Remark 5.1**.**
Note that, in this case, is unique and explicitly determined by the class of rearrangement of . Indeed, we have for any , where denotes the measure of the unit ball in .
Recalling Remark 4.5, we can immediately state the symmetry results for .
Theorem 5.6**.**
Let be a bounded domain of class Steiner symmetric with respect to the hyperplane and such that . Then, every maximizer of the problem (4.17) is such that is Steiner symmetric relative to .
Corollary 5.7**.**
Let be a ball in and such that . Then every maximizer of problem (4.17) is increasing radially symmetric. More precisely, we have the unique maximizer for any .
Acknowledgement. The authors are members of GNAMPA (Gruppo Nazionale per l’Analisi Matematica, la Probabilità e le loro Applicazioni) of INdAM (Istituto Nazionale di Alta Matematica “Francesco Severi”). Claudia Anedda and Fabrizio Cuccu are partially supported by the research project Integro-differential Equations and Non-Local Problems, funded by Fondazione di Sardegna (2017).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Alvino, G. Trombetti and P.L. Lions, On optimization problems with prescribed rearrangements , Nonlinear Anal. 13 , no. 2 (1989), 185-220.
- 2[2] C. Anedda and F. Cuccu, Steiner symmetry in the minimization of the first eigenvalue in problems involving the p-Laplacian , Proc. Amer. Math. Soc. 144 , no. 8 (2016), 3431-3440.
- 3[3] C. Anedda and F. Cuccu, Symmetry breaking in the minimization of the second eigenvalue for composite membranes , Proc. Roy. Soc. Edinburgh Sect. A 145 , no. 1 (2015), 1-11.
- 4[4] H. Brezis, Functional analysis, Sobolev Spaces and partial differential equations , Springer, New York (2011).
- 5[5] F. Brock, Rearrangements and applications to symmetry problems in PDE , Handbook of Differential Equations, Stationary Partial Differential Equations, vol. 4 , Elsevier (2007).
- 6[6] C. Bucur, E. Valdinoci, Nonlocal diffusion and applications , Vol. 20 , Bologna, Springer (2016).
- 7[7] G.R. Burton, Rearrangements of functions, maximization of convex functionals and vortex rings , Math. Ann. 276 (1987), 225-253.
- 8[8] G.R. Burton, Variational problems on classes of rearrangements and multiple configurations for steady vortices , Ann. Inst. H. Poincaré Anal. Non Linéaire 6 , no.4, (1989) 295-319.
