
TL;DR
This paper extends the class of known alpha-minimizing hypercones by analyzing special cubic and quartic polynomials using sub-calibration methods, advancing the understanding of minimal hypercone structures.
Contribution
It introduces new alpha-minimizing hypercones through detailed polynomial analysis, significantly broadening the existing class of such hypercones.
Findings
Expanded the class of known alpha-minimizing hypercones
Developed new sub-calibration techniques for analysis
Identified specific cubic and quartic polynomials related to hypercones
Abstract
In this paper we considerably extend the class of known -minimizing hypercones using sub-calibration methods. Indeed, the improvement of previous results follows from a careful analysis of special cubic and quartic polynomials.
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.
On -minimizing hypercones
Peter [email protected], University of Duisburg-Essen, Germany
(October 29, 2018)
Abstract
In this paper we considerably extend the class of known -minimizing hypercones using sub-calibration methods. Indeed, the improvement of previous results follows from a careful analysis of special cubic and quartic polynomials.
AMS 2010 MSC: Primary: 53C38; Secondary: 53A10, 49Q10, 49Q15, 58E15.
Keywords: -minimizing hypercones, calibrations, foliations.
1 Introduction
Let and be two distinct points in and consider for the variational problem
[TABLE]
within the class
[TABLE]
Hence, with we are looking for the shortest curve joining and , with we gain a parametric version of the brachistochrone-problem, and the case leads to rotationally symmetric minimal surfaces in . On the other hand, the variational integral with appears when considering the potential energy of heavy chains.
Of course, the shortest path between and is a line, and the minimizing curve in the case was named brachistochrone. However, the variational problem with may possess two distinct minimizers, namely a catenary and a Goldschmidt curve, which consists of three straight lines, cf. [11, ch. 8 sec. 4.3].
In order to prove the minimality of the above mentioned curves it is sufficient to embed the corresponding curve into a field of extremals222An argument which goes back to Weierstrass., i.e. into a foliation of extremal curves, cf. [10, ch. 6 sec. 2.3]. In fact, this can be directly justified by the divergence theorem. For this purpose let us look at the vector field
[TABLE]
where are the normal fields orienting the curves from the foliation. Since all these curves are extremals, the vector field is divergence-free. The conclusion then follows by applying the divergence theorem to the vector field on the open set which is bounded by a critical curve and a comparison curve. In geometric measure theory setting, the critical curve is said being calibrated by , and the vector field is called calibration.333Such method of conclusion is applicable even in a more general context and is well-known as Federer’s differential form argument, cf. [9, 5.4.19].
In this paper we consider the higher dimensional variational problem and prove the minimizing property of special hypercones. Therefor we will construct suitable foliations. The crux hereby is to find an auxiliary function whose level sets are extremals.
First, we will weaken our considerations and look at “inner” and “outer” variations separately as in [5]. This gives simplified proofs and yields sub-solutions and sub-calibrations. The advantage of this weakened ansatz is that we can gain specific auxiliary functions. Moreover, we will show that a careful analysis of extremals as in [4] provides better results to our variational problem but loses the concrete representation of an auxiliary function.
1.1 The main result
Let and let be an oriented Lipschitz-hypersurface in . Its -energy is given by
[TABLE]
where we use the notation and denote by the -dimensional Hausdorff measure. We show
Theorem 1.1**.**
There exists an algebraic number such that the cone
[TABLE]
is a local -perimeter minimizer in .
Remark 1.2*.*
For an integer, our result is equivalent to the area-minimizing property of the corresponding rotated cones in . Indeed, with our lower bounds presented in rem. 1.5 we recover the area-minimizing property of all Lawson’s cones, i.e. of the cones
[TABLE]
with and or , cf. [2, 14, 17], where and take over the parts of and . For further reading on area-minimizing cones, see also [13] and the references contained therein.
Remark 1.3*.*
Following the minimal surfaces theory we will introduce the terminology of a local -perimeter minimizer in the next section. Alternatively, we could say in theorem 1.1 that the hypercone
[TABLE]
is -minimizing in , where the boundary of is seen with respect to the induced topology.
Remark 1.4*.*
In our proof, we will specify polynomials which characterize the corresponding as the unique positive root. Moreover, we show , thus with .
Remark 1.5*.*
First ( integer ) bounds can be found in [6], namely
[TABLE]
Shortly thereafter, they were corrected in [7] to
[TABLE]
Our investigations show, that they can be improved to
[TABLE]
[TABLE]
[TABLE]
Remark 1.6*.*
For all we have m+\alpha_{m}\geq 4+\mathchoice{{\hbox{\displaystyle\sqrt[\ ]{8,}}\lower 0.4pt\hbox{\vrule height=6.44444pt,depth=-5.15558pt}}}{{\hbox{\textstyle\sqrt[\ ]{8,}}\lower 0.4pt\hbox{\vrule height=6.44444pt,depth=-5.15558pt}}}{{\hbox{\scriptstyle\sqrt[\ ]{8,}}\lower 0.4pt\hbox{\vrule height=4.51111pt,depth=-3.6089pt}}}{{\hbox{\scriptscriptstyle\sqrt[\ ]{8,}}\lower 0.4pt\hbox{\vrule height=3.22221pt,depth=-2.57779pt}}}\kern 1.00006pt, cf. remark 4.3, so, direct calculations yield that all hypercones , with , are (of course) -stable, see also [8, p. 168].
Remark 1.7*.*
Although is -stable, the corresponding cone is not a (local) -perimeter minimizer in . Similarly, the hypercone is -stable, but the cone does not minimize the -perimeter in , cf. [7]. Hence, the optimality question of our ’s still remains open.
2 Notations and preliminary results
Let be open (with respect to the induced topology) and let . We say that if and the quantity
[TABLE]
is finite. For a Lebesgue measurable set we call
[TABLE]
the -perimeter of in . Furthermore, we call an -Caccioppoli set in if has a locally finite -perimeter in , i.e. .
Example 2.1*.*
By the divergence theorem, if is an open set with regular boundary, then
[TABLE]
for all open sets .
Remark 2.2*.*
Of course, several properties of the -perimeter can be directly transferred from the known properties of the perimeter, cf. [12, 15].
Remark 2.3*.*
Note that there are -Caccioppoli sets which are not Caccioppoli, i.e. do not possess a locally finite perimeter: In an arbitrary neighborhood of the origin consider the set
[TABLE]
where is a triangle with vertices
[TABLE]
Hereby, the are chosen in such a way that
[TABLE]
On the other hand, the -perimeter of is dominated by the convergent series
[TABLE]
Definition 2.4**.**
Let be an -Caccioppoli set in . We say that is a local -perimeter minimizer in if in all bounded open sets we have
[TABLE]
2.1 Under weakened conditions
The following definitions and results are analogous to the observations in [5, sec. 1]. We only prove one proposition, which was not used in [5].
Definition 2.5**.**
Let be an -Caccioppoli set in . We say that is a local -perimeter sub-minimizer in if in all bounded open sets we have
[TABLE]
The connection with minimizers is given by
Proposition 2.6**.**
* is a local -perimeter minimizer in if and only if as well as is a local -perimeter sub-minimizer in .*
The lower semicontinuity of the -perimeter implies
Proposition 2.7**.**
Let and be -Caccioppoli sets in with and suppose that locally converge to in . If all ’s are local -perimeter sub-minimizers in , then is a local -perimeter sub-minimizer in as well.
Furthermore, the existence of a so called sub-calibration ensures the sub-minimality.
Definition 2.8**.**
Let be an -Caccioppoli set in with . We call a vector field an -sub-calibration of in if it fulfills
- (i)
for all , 2. (ii)
for all , 3. (iii)
\operatorname{div}\xi(z)\leq 0$$\xi(z)=y^{\alpha}\cdot\nu_{E}(z) for all ,
where denotes the exterior unit normal vector field on .444Note that, in contrast to [4], our vector field has been weighted.
Proposition 2.9**.**
If is an -sub-calibration of in an open set , then is a local -perimeter sub-minimizer in all .
Note that it suffices to find a sub-calibration on a subset of which contains since we only deal with inner deformations. Finally, we add
Proposition 2.10**.**
If the cone is a local -perimeter sub-minimizer in , then is also a local -perimeter sub-minimizer in the whole .
Proof.
Firstly, we have for a bounded open set :
[TABLE]
for all such that . Let now be with . For we consider the set
[TABLE]
Hence,
[TABLE]
thus with the preliminary observation we have
[TABLE]
∎
3 First proof of theorem 1.1
Arguing in this section as in [5] we give a first proof of theorem 1.1. Unfortunately, this does not lead to our best bounds, but gives the ’s as constructible numbers. This study is based on the analysis of the cubic polynomial
[TABLE]
Lemma 3.1**.**
For all , we have
[TABLE]
Proof.
For all admissible and , the polynomial has one sign change in the sequence of its coefficients
[TABLE]
Hence, due to Descartes’ rule of signs, always has one negative root. On the other hand, has none, a double or two distinct positive roots.
The number of real roots of the cubic polynomial is determined by its discriminant
[TABLE]
Summarizing, we have:
- i)
If , then has one negative and two distinct positive roots. 2. ii)
If , then has one negative and a double positive root. 3. iii)
If , then has only one negative root.
The statement of the lemma then follows since has the same sign as the quadratic polynomial
[TABLE]
whose sole positive root is
[TABLE]
Proof of theorem 1.1 (with concrete bounds).
We consider over the function
[TABLE]
It is
[TABLE]
Moreover, on we have:
[TABLE]
Hence,
[TABLE]
For consider the sets
[TABLE]
They all are -Caccioppoli sets in since
[TABLE]
whereby . Furthermore, the ’s locally converge to .
With lemma 3.1 we have
[TABLE]
consequently, due to the above computation of the divergence, the vector filed
[TABLE]
is an -sub-calibration for each in \{0<\mathchoice{{\hbox{\displaystyle\sqrt[\ ]{m-1,}}\lower 0.4pt\hbox{\vrule height=6.44444pt,depth=-5.15558pt}}}{{\hbox{\textstyle\sqrt[\ ]{m-1,}}\lower 0.4pt\hbox{\vrule height=6.44444pt,depth=-5.15558pt}}}{{\hbox{\scriptstyle\sqrt[\ ]{m-1,}}\lower 0.4pt\hbox{\vrule height=4.51111pt,depth=-3.6089pt}}}{{\hbox{\scriptscriptstyle\sqrt[\ ]{m-1,}}\lower 0.4pt\hbox{\vrule height=3.22221pt,depth=-2.57779pt}}}\kern 1.00006pty<\mathchoice{{\hbox{\displaystyle\sqrt[\ ]{\alpha,}}\lower 0.4pt\hbox{\vrule height=4.30554pt,depth=-3.44446pt}}}{{\hbox{\textstyle\sqrt[\ ]{\alpha,}}\lower 0.4pt\hbox{\vrule height=4.30554pt,depth=-3.44446pt}}}{{\hbox{\scriptstyle\sqrt[\ ]{\alpha,}}\lower 0.4pt\hbox{\vrule height=3.01389pt,depth=-2.41113pt}}}{{\hbox{\scriptscriptstyle\sqrt[\ ]{\alpha,}}\lower 0.4pt\hbox{\vrule height=2.15277pt,depth=-1.72223pt}}}\kern 1.00006pt|x|\}.
Hence, propositions 2.9, 2.7 and 2.10 ensure that is a local -perimeter sub-minimizer in the whole .
In view of the characterization of -perimeter minimizing sets, cf. proposition 2.6, the claim of theorem 1.1 follows for
[TABLE]
after proving the sub-minimality of the complement of . We therefor argue as above considering the sets
[TABLE]
and the vector field
[TABLE]
Remark 3.2*.*
All previous computations were carried out by hand.
Remark 3.3*.*
For we have and is an upper bound for our best ’s.
Remark 3.4*.*
Improvements of these bounds can be achieved by an alternative auxiliary function. As seen in the proof, such a function should fulfill the following conditions
F\in C^{2}(\big{(}\mathds{R}^{m}\times\mathds{R}_{>0}\backslash\{\,x=0\,\}\big{)}\backslash\mathcal{M}^{\alpha}_{m})\cap C^{0}(\mathds{R}^{m}\times\mathds{R}_{\geq 0}), 2. 2.
, , 3. 3.
in .
Remark 3.5*.*
In fact, corresponding auxiliary functions can be found in papers concerning the minimizing property of Lawson’s cones, namely
- •
in [16]: F(x,y)=\big{(}|x|^{2}-|y|^{2}\big{)}\big{(}|x|^{2}+|y|^{2}\big{)}, for .
- •
in [3]:
[TABLE]
for and , and for and .
- •
in [1]:
[TABLE]
where was chosen in a way, that such an argumentation was admissible for all Lawson’s cones.
- •
in [5]: F(x,y)=\frac{1}{4}\big{(}|x|^{2}-|y|^{2}\big{)}\big{(}|x|^{2}+|y|^{2}\big{)}, for .
Note that
- •
in [3, 1] computer algebra systems were used to perform the symbolic manipulations.
- •
the argumentation using sub-calibration method from [5] is applicable to the function
[TABLE]
and yields the minimality of all Lawson’s cones with
[TABLE]
However, we have already performed such computations above and the exceptional cases correspond to the given bounds in lemma 3.1 for integer values, where and take over the parts of and .
Remark 3.6*.*
With the aid of a suitable parametrization Davini detected the existence of an auxiliary function which was applicable to all Lawson’s cones. All his computations he carried out by hand, cf. [4].
4 Second proof of theorem 1.1 with better bounds
Since the hypercones are invariant under the action of on the first components, we will look for a foliation consisting of extremal hypersurfaces with the same type of symmetry. In fact, recalling (1), a dimension reduction and the special parametrization555Note that the simplification in [4] towards the argumentation as in [2] comes from such a parametrization.
[TABLE]
with yields as Euler-Lagrange equation
[TABLE]
cf. [4], where and take over the parts of and .
Hence, with the initial problem reduces to a question about the behavior of solutions of the following ordinary differential equation of first order:
[TABLE]
The existence of a solution follows, for example, from the existence of an upper and a lower solution of (4). Arguing as Davini we will directly give an upper solution and the difficult part is in finding the conditions on and under which a suitable lower solution exists. Note that we push the argumentation from [4] to the extreme, since is real valued and not necessarily an integer. Our study is based on the analysis of the quartic polynomial
[TABLE]
Lemma 4.1**.**
There exists an algebraic number such that for all we can find a value \text{\gamma_{m,\alpha}}\in(0,1-\frac{1}{m+\alpha}) with
[TABLE]
Proof.
Note that
[TABLE]
Further, for all admissible and the coefficients of fulfill:
[TABLE]
consequently, \text{P_{m,\alpha}}(-\gamma) has, regardless of the value , always one sign change in the sequence of its coefficients . Hence, due to Descartes’ rule of signs, always has one negative root. Moreover, we have
[TABLE]
thus, regardless of the value , we always have one sign change in the sequence of coefficients of the polynomial \text{P_{m,\alpha}}(\gamma+1-\textstyle\frac{1}{m+\alpha}). In other words, always has one root in .
All in all, has none, a double or two distinct roots in the interval . To determine the nature of roots of the quartic equation
[TABLE]
we convert it by the change of variable to the depressed quartic
[TABLE]
with coefficients
[TABLE]
and consider its resolvent cubic, namely
[TABLE]
We have and as
[TABLE]
Consequently, (5**) has no negative roots, since there is no sign change in the sequence of the coefficients . On the other hand, (5**) has one or three positive roots depending on the sign of its discriminant
[TABLE]
In view of the foregoing, it follows:
- i)
If , then has two distinct roots in . 2. ii)
If , then has one double root in . 3. iii)
If , then has no roots in .
So, the statement of the lemma follows for such values of and for which . We have:
[TABLE]
Note that the polynomial has three changes of sign in its sequence of coefficients if and five changes if , so that Descartes’ rule of signs is not applicable to show that has only one positive root. To prove the latter we will now apply Sturm’s theorem. For that purpose we consider the canonical Sturm chain
[TABLE]
and count the number of sign changes in these sequences for and :
[TABLE]
Hence, due to Sturm’s theorem, the polynomial has always positive root which we denote by . Moreover we have
[TABLE]
thus,
[TABLE]
Remark 4.2*.*
The lengthy symbolic manipulations were completed here with the aid of the Wolfram Language on a Raspberry Pi 2, Model B. The following computations will again be carried out by hand:
Proof of theorem 1.1.
Denoting the right-hand side of (4) by we see that
[TABLE]
fulfills
[TABLE]
where
[TABLE]
Since , the function is an upper solution of (4). As we are interested in a solution of (4), which has the same growth properties as , it is natural to ask for a lower solution of the form with , i.e., we should have
[TABLE]
For t\neq\text{t_{m,\alpha}} this is equivalent to
[TABLE]
Note that (6*) is valid on as long as . The latter is equivalent to . Hence, the left hand side of (6*) is bounded below by
[TABLE]
In other words, to find an adequate lower solution, it suffices to find conditions on and under which a exists with
[TABLE]
and lemma 4.1 yields the desired conclusion. Consequently, we gain for :
[TABLE]
i.e., the function \text{\gamma_{m,\alpha}}\cdot{g_{m,\alpha}} is a lower solution of (4), so that we can proceed as in [4]: Due to results from classical ordinary differential equations theory it follows the existence of a -solution of (4) on (0,\text{t_{m,\alpha}})\cup(\text{t_{m,\alpha}},\textstyle\frac{\pi}{2}). Moreover, satisfies
[TABLE]
as well as
[TABLE]
Let us denote by the antiderivative of with
[TABLE]
Reconstructing the auxiliary function from its level curves which are parametrized by
[TABLE]
with and t\in(0,\text{t_{m,\alpha}})\cup(\text{t_{m,\alpha}},\frac{\pi}{2}), we gain
[TABLE]
Note that, since satisfies (3), we obtain
[TABLE]
We than conclude as in our first proof above because has the desired properties, cf. remark 3.4. ∎
Remark 4.3*.*
The crucial ingredient in our argumentation was to find conditions on and under which a exists such that (6*) is fulfilled on (0,\text{t_{m,\alpha}})\cup(\text{t_{m,\alpha}},\frac{\pi}{2}). For t\to\text{t_{m,\alpha}} the inequality (6*) is equivalent to
[TABLE]
The last inequality has solutions in as long as m+\alpha\geq 4+\mathchoice{{\hbox{\displaystyle\sqrt[\ ]{8,}}\lower 0.4pt\hbox{\vrule height=6.44444pt,depth=-5.15558pt}}}{{\hbox{\textstyle\sqrt[\ ]{8,}}\lower 0.4pt\hbox{\vrule height=6.44444pt,depth=-5.15558pt}}}{{\hbox{\scriptstyle\sqrt[\ ]{8,}}\lower 0.4pt\hbox{\vrule height=4.51111pt,depth=-3.6089pt}}}{{\hbox{\scriptscriptstyle\sqrt[\ ]{8,}}\lower 0.4pt\hbox{\vrule height=3.22221pt,depth=-2.57779pt}}}\kern 1.00006pt. Hence,
[TABLE]
are lower bounds for the optimal ’s. With our values we have already reached the lower bounds quite close, so, for we have
[TABLE]
Acknowledgement**.**
This paper is a part of my PhD thesis written under supervision of Prof. Ulrich Dierkes.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D. Benarrós and M. Miranda, Lawson cones and the Bernstein theorem, Advances in geometric analysis and continuum mechanics (1995), pp. 44 – 56.
- 2[2] E. Bombieri, E. De Giorgi and E. Giusti, Minimal cones and the Bernstein problem , Invent. Math. 7 (1969), pp. 243 – 268.
- 3[3] P. Concus and M. Miranda, MACSYMA and minimal surfaces, Proc. of Symposia in Pure Mathematics, by the Amer. Math. Soc., 44, (1986), pp. 163 – 169.
- 4[4] A. Davini, On calibrations for Lawson’s cones, Rend. Sem. Mat. Univ. Padova 111 (2004), pp. 55 – 70.
- 5[5] G. de Philippis and E. Paolini, A short proof of the minimality of Simons cone, Rend. Sem. Mat. Univ. Padova 121 (2009), pp. 233 – 241.
- 6[6] U. Dierkes, Minimal hypercones and C 0 , 1 / 2 superscript 𝐶 0 1 2 C^{0,\nicefrac{{1}}{{2}}} -minimizers for a singular variational problem, Indiana University Math. Journ. 37 (1988), no. 4, pp. 841 – 863.
- 7[7] U. Dierkes, A classification of minimal cones in ℝ n × ℝ + superscript ℝ 𝑛 superscript ℝ \mathds{R}^{n}\times\mathds{R}^{+} and a counterexample to interior regularity of energy minimizing functions, Manuscripta Math. 63 (1989), pp. 173 – 192.
- 8[8] U. Dierkes, S. Hildebrandt and A. J. Tromba, Global analysis of minimal surfaces, Revised and enlarged second edition, Grundlehren der mathematischen Wissenschaften 341. Springer-Verlag Berlin Heidelberg, 2010.
