This paper investigates Euler's classical variational problem, proving the existence of minimizers using relaxation methods and analyzing their structure, uniqueness, and dependence on geometric parameters.
Contribution
It provides a rigorous existence proof for minimizers and characterizes their analytical structure and uniqueness conditions based on geometric parameters.
Findings
01
Existence of minimizers established via relaxation methods.
02
Detailed analysis of minimizers' structure depending on parameters.
03
Identification of parameter ranges for uniqueness and non-uniqueness.
Abstract
We study an old variational problem formulated by Euler as Proposition 53 of his `Scientia Navalis' by means of the direct method of the calculus of variations. Precisely, through relaxation arguments, we prove the existence of minimizers. We fully investigate the analytical structure of the minimizers in dependence of the geometric parameters and we identify the ranges of uniqueness and non-uniqueness.
Equations325
F(γ)=∫01(γ1′)2+(γ2′)2(γ2′)+3dt→min,
F(γ)=∫01(γ1′)2+(γ2′)2(γ2′)+3dt→min,
∫01γ1(t)γ2′(t)dt=ah−L.
∫01γ1(t)γ2′(t)dt=ah−L.
Aa,h,L0:
Aa,h,L0:
\displaystyle\gamma\ \hbox{simple,}\ \left.|\gamma^{\prime}(t)|\neq 0\mbox{ for a.e. $t\in(0,1)$},\,\int_{0}^{1}\gamma_{1}(t)\gamma_{2}^{\prime}(t)\,dt=ah-L\right\}.
\mathcal{A}_{a,h,L}:=\{\gamma\in\mathcal{A}^{0}_{a,h,L}:\gamma_{1}^{\prime}(t)\geq 0\mbox{ for a.e. $t\in(0,1)$}\}
\mathcal{A}_{a,h,L}:=\{\gamma\in\mathcal{A}^{0}_{a,h,L}:\gamma_{1}^{\prime}(t)\geq 0\mbox{ for a.e. $t\in(0,1)$}\}
min{F(γ):γ∈Aa,h,L}.
min{F(γ):γ∈Aa,h,L}.
u(t):=\left\{\begin{array}[]{lll}t&\mbox{ if $0\leq t\leq\frac{1}{2}$}\\
1-t&\mbox{ if $\frac{1}{2}\leq t\leq 1$}\end{array}\right.
u(t):=\left\{\begin{array}[]{lll}t&\mbox{ if $0\leq t\leq\frac{1}{2}$}\\
1-t&\mbox{ if $\frac{1}{2}\leq t\leq 1$}\end{array}\right.
x_{n}(t)=\left\{\begin{array}[]{lll}u_{n}(t)&\mbox{ if $0\leq t\leq 1-\frac{1}{n}$}\vskip 6.0pt plus 2.0pt minus 2.0pt\\
\frac{n(t-1)+1}{2}&\mbox{ if $1-\frac{1}{n}<t\leq 1,$}\end{array}\right.\quad\;\;y_{n}(t)=\left\{\begin{array}[]{lll}v_{n}(t)&\mbox{ if $0\leq t\leq 1-\frac{1}{n}$}\vskip 6.0pt plus 2.0pt minus 2.0pt\\
\frac{t}{2}&\mbox{ if $1-\frac{1}{n}<t\leq 1$}\end{array}\right.
x_{n}(t)=\left\{\begin{array}[]{lll}u_{n}(t)&\mbox{ if $0\leq t\leq 1-\frac{1}{n}$}\vskip 6.0pt plus 2.0pt minus 2.0pt\\
\frac{n(t-1)+1}{2}&\mbox{ if $1-\frac{1}{n}<t\leq 1,$}\end{array}\right.\quad\;\;y_{n}(t)=\left\{\begin{array}[]{lll}v_{n}(t)&\mbox{ if $0\leq t\leq 1-\frac{1}{n}$}\vskip 6.0pt plus 2.0pt minus 2.0pt\\
\frac{t}{2}&\mbox{ if $1-\frac{1}{n}<t\leq 1$}\end{array}\right.
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.
Full text
Euler’s optimal profile problem
Francesco Maddalena, Edoardo Mainini, Danilo Percivale
Abstract
We study an old variational problem formulated by Euler as Proposition 53 of his Scientia Navalis
by means of the direct method of the calculus of variations. Precisely, through relaxation arguments,
we prove the existence of minimizers. We fully investigate the analytical structure of the minimizers in dependence of the geometric parameters and we identify the ranges of uniqueness and non-uniqueness.
Key words: Calculus of variations, variational integrals, shape optimization
Mathematics Subject Classification: 49Q10, 49K30
1 Introduction
L. Euler in his treatise Scientia Navalis (1749), which is considered to be one of the cornerstones of the eighteenth century naval architecture,
at Proposition 53, formulated the following optimal profile problem (see [14], [21]).
Among all curves AM which with the axis AP and perpendicular PM comprehend the same area, to find that one which with its symmetric branch on the opposite side of the axis AP will form the figure offering the least resistance in water when it moves in the direction PA along the axis (Fig.1).
The problem can be viewed as a variant of the celebrated Newton’s aerodynamic problem (Proposition 34 of Book 2 of the Principia, 1687, [27]) which relies in optimizing the shape of a solid of revolution,
moving in a fluid along its axis, experiencing the least resistance, at parity of length and caliber. Actually, at Proposition 65 of the same
treatise, Euler studies in different terms a very similar problem.
Newton’s problem of
minimal resistance was the first solved problem in the calculus of variations (by Newton himself a decade before
the brachistochrone problem, see [16]) and assumes a fluid like medium made by particles of equal mass moving at a constant velocity
with a fixed direction, while the dynamic interaction between solid and fluid is only due to the perfectly elastic collisions between the fluid particles and the surface of the solid body.
Though Newton’s constitutive assumptions ruling the fluid-solid interaction seems too crude to copy the complex physical phenomena occurring at the interface
(strongly influenced by the properties of the fluid and the dynamic features of the motion, [26]), certainly they capture the essential basic ingredients of the problem.
Let us recall that the drag problem is one of the oldest problems in
fluid mechanics and at present it
still seems to be out of reach of analytical results,
for realistic Reynolds numbers.
On the other hand, from a mathematical perspective, the variational integral representing the resistance functional is
neither coercive nor convex, hence a natural route to prove existence of a minimum via the direct method relies in imposing additional constraints on the admissible shapes. These arguments explain the reasons the oldest problem of the calculus of variations still provides continuous inspirations for new and challenging problems:
we refer, for instance, to [2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 15, 17, 18, 19, 20, 22, 23, 24, 25, 28, 29, 30].
Unlike Newton’s problem, the Euler optimal profile problem,
as far as the authors know,
has never been studied in the framework of modern calculus of variations, with the only exception of the paper [3] which deals with a constrained Newton’s problem in a special class of admissible functions.
In analytical terms the problem admits the following formulation.
Given a>0, h>0, L∈(0,ah), find a curve γ:[0,1]→R2, γ=(γ1,γ2), such that
γ(0)=(0,0),γ(1)=(a,h), and such that (with the notation z+:=z∨0)
[TABLE]
subject to the area constraint
[TABLE]
In fact, problem (1.1)-(1.2) is a constrained Newton-like problem, since L represents the area of the
region between the curve γ and the lines y=0 and x=a, taking {0;x,y} as a coordinate system in R2.
L. Euler, after the problem statement (Propositio 53, Scientia Navalis, pg. 238) deduces the stationary conditions in terms of differential equations and G.H. Light (in [21]) proves that the extremal curves are precisely branches of hypocycloids of three cusps.
In this paper we provide an exhaustive solution of the problem (1.1), (1.2), by exploiting the direct methods of the calculus of variations. It turns out that, in the generality of Euler’s formulation, the problem doesn’t admit a solution (see Example 2.2). Indeed, we prove the existence of global minimizers (Theorem 2.1) under the natural assumption γ1′≥0. Then, we study their precise analytical structure in dependence of the given geometric parameters a,h,L.
In most cases,
the optimal profile is the union of the graph of a convex or concave function (which is exactly Euler’s solution) and of a vertical segment
(Theorem 2.3). Moreover,
non-uniqueness of minimizers is shown to occur for certain ranges of the geometric parameters (Theorem 2.4).
These results, obtained through relaxation techniques, seem to capture the essential ideas of naval architecture: indeed, it is easy to recognize that a lot of boat profiles are quite similar to the solutions of the Euler’s problem (see Figure 1), suggesting that the global shapes realize a compromise between the
dynamical performance and the total mass.
On the other hand we guess that the non-uniqueness of solutions appearing for certain ranges of the parameters,
suggests the possible occurrence of solutions exhibiting fine scale structures.
Indeed, as it is well known [13] the skin of fast-swimming sharks is characterized (at the mesoscale) by the presence
of riblet structures which are known to reduce skin friction drag in the turbulent-flow regime.
In this respect, it would be quite natural to ask
if
a suitable modification of the Euler resistance
could select a class of minimizers exhibiting at certain scales the riblet geometries which are responsible
of the impressive drag reduction characterizing the shark’s skin, contributing in the comprehension of
this surprising natural morphology.
2 Statement of the problem and main results
2.1 Existence and uniqueness
Let a>0, h>0 and L∈(0,ah).
We shall introduce a suitable function space for the minimization of the resistance functional.
Starting from the original formulation of the problem, a natural choice is the class of rectifiable simple curves connecting (0,0) with (a,h). Admissible curves should be contained in [0,a]×[0,h] and should split such rectangle in two subsets with prescribed areas L and ah−L.
A rectifiable simple curve is an equivalence class:
the equivalence relation ∼ is given by orientation-preserving parametrizations, so that γ~∼γ if a monotone nondecreasing mapping ϕ from [0,1] onto itself exists such that γ~=γ∘ϕ. We shall identify each rectifiable simple curve γ with an absolutely continuous parametrization (still denoted by γ) such that ∣γ′(t)∣=0 a.e in (0,1). Therefore, we set
[TABLE]
We also consider the class
[TABLE]
and the minimization problem for functional F from (1.1), that is,
[TABLE]
The following is our first main result.
Theorem 2.1**.**
Let a>0, h>0, L∈(0,ah). The following properties hold.
i)
If 2L∈/(a2,2ah−a2) (in particular if h≤a), then there exists a unique solution to problem
(2.1).
ii)
If 2L∈(a2,2ah−a2), then there exist infinitely many solutions to problem (2.1).
The choice of the subclass Aa,h,L is motivated by the fact that, without further constraints,
the problem min{F(γ):γ∈Aa,h,L0}
admits no solution, as shown through the following
Example 2.2**.**
Let u:R→R be a 1-periodic function defined as
[TABLE]
and, for every n∈N, let un(t)=u(nt), t∈[0,1].
Let us define vn∈AC[0,1] such that vn(0)=0 and
vn′(t)=n1(un′(t))+ for a.e. t∈(0,1).
Then we set
[TABLE]
and we define γn(t)=(xn(t),yn(t)), t∈[0,1]. See Figure 2. We have γn(0)=(0,0), γn(1)=(21,21) and ∣(γn)′(t)∣=0 for a.e. t∈(0,1).
A direct computation shows that for every n∈N the area between the curve γn and the
lines y=0 and x=21 is
[TABLE]
Thus, for any n∈N we have γn∈Aa,h,L0 with a=h=21 and L=ah−L=81. Moreover, another direct computation shows that
F(γn)→0 as n→∞.
Since F(γ)>0 for every γ∈Aa,h,L0, it follows that no minimizer exists. **
It is not difficult to modify the above example in order to see that, for any other value of a,h,L, there holds inf{F(γ):γ∈Aa,h,L0}=0. Strong changing-sign oscillations of γ1′ are indeed energetically favorable.
2.2 Representation of solutions
In the uniqueness range of Theorem 2.1, the form of the solution can be obtained through an explicit parametrization. Towards this end, we need some more notation. Here and in the following let
[TABLE]
Let Ψ:[0,1]2→R and Φ:[0,1]2→R be defined by
[TABLE]
[TABLE]
where the integral terms are understood to vanish in case ξ=η. Moreover,
let
[TABLE]
Then we have
Theorem 2.3**.**
Let a>0, h>0.
Suppose that 0<2L≤(ah)∧a2. If 2L=(ah)∧a2, then the unique solution of problem (2.1) is given by the piecewise affine curve connecting the points (0,0), (a,a∧h) and (a,h). Else if 2L<(ah)∧a2, then there exists a unique minimizer (ξ∗,η∗) of Ψ on T, there holds ξ∗<η∗, and the unique solution to problem (2.1) is
[TABLE]
where
[TABLE]
and h∗:=y∗(η∗)<h.
It has been argued in [21] that, whenever t∈[0,2η∗−ξ∗], the parametrization given in (2.7)-(2.8) is that of a branch of an hypocycloyd with three vertices and it is worth noticing that its trace is the graph of a convex function. In particular, if 2L<(ah)∧a2, the optimal profile is the union of the graph of such convex function and of a vertical segment of length h−h∗>0.
We also notice that Theorem 2.3 covers only half of the uniqueness range of the parameters. The other half is 2L≥(ah)∨(2ah−a2). However, the parameters fall in the latter range if L satisfying the assumptions of Theorem 2.3 is changed to ah−L.
In particular, if 2L>(ah)∨(2ah−a2), then the corresponding optimal profile becomes the graph of a concave function joined to a vertical segment of strictly positive length.
Indeed, given the solution γ∗ in Aa,h,L from (2.7)-(2.8) and letting t∗=2η∗−ξ∗, we will prove later on that the solution in Aa,h,ah−L is just obtained by reflection and precisely it is given by
[TABLE]
We refer to Figure 3 for a plot of the solutions obtained with a numerical simulation.
Let us now discuss the non-uniqueness range of Theorem 2.1. We have the following
Theorem 2.4**.**
Let h>a>0 and 2L∈(a2,2ah−a2).
Then γ∈Aa,h,L is solution to problem (2.1) if and only if γ2′(t)≥0 for a.e. t∈(0,1) and γ1′(t)=γ2′(t) for a.e. t in {γ1′(t)>0}.
*The piecewise affine curve γ∘ connecting the points (0,0), (0,p), (a,p+a) and (a,h), where p:=aL−2a, is a solution to problem (2.1). Moreover, γ∘ is the unique solution to problem (2.1) among all curves γ that further satisfy {γ1′(t)>0}=(t1,t2) (up to a L1-negligible set) for some 0<t1<t2<1.
*
More piecewise affine solutions to problem (2.1) can be constructed as follows.
Let k∈N, k≥5. Let (xj,yj) be points in {(x,y)∈[0,a]×[0,h]:x≤y≤h−a+x}, such that 0=x0≤x1≤…≤xk=a, 0=y0<y1<…<yk=h,
and such that for any j=1,…k there holds either xj=xj−1 or xj−xj−1=yj−yj−1. We denote by J2(k) the set of indices in {1,…k} such that xj=xj−1 and by J1(k) its complement in {1,…k}.
Let γ^(t)=(xj−1,yj−1)+tj−tj−1t−tj−1(xj−xj−1,yj−yj−1) for t∈[tj−1,tj], j=1,…,k.
Then the energy of γ^ can be computed as
[TABLE]
where we have exploited the fact that
∑j∈J1(k)(yj−yj−1)=a and ∑j∈J2(yj−yj−1)=h−a.
Hence, we see that any piecewise affine curve made by vertical segments and slope 1 segments has the same energy of γ∘: it is therefore solution to problem (2.1) as soon as the area constraint ∑j∈J1(k)(yj+yj−1)(xj−xj−1)=2L is matched. See also Figure 4.
Understanding L as a material design constraint, it is natural to look for its optimal value, in case there is some freedom in its choice. Letting Fmin(a,h,L) be the minimal value corresponding to the solution of problem (2.1), we have the following result (see also Figure 5).
Theorem 2.5**.**
The mapping (0,ah)∋L↦Fmin(a,h,L) is continuous and symmetric around L=ah/2.
If h≤a, then
it is strictly decreasing on (0,ah/2], strictly increasing on [ah/2,ah), and its range is [a2+h2h3,h).
Else if h>a, then
it is strictly decreasing on (0,a2/2], constant on [a2/2,ah−a2/2], strictly increasing on [ah−a2/2,ah), and its range is [h−a/2,h).
Let us conclude by remarking that the maximization problem is easier. Indeed, we have sup{F(γ):γ∈Aa,h,L}=+∞. For instance, if a=h=21 and L=81, this can be seen by taking the sequence of curves γˉn(t):=(yn(t),xn(t)), t∈[0,1], where xn and yn are defined in (2.2). Again, the same behavior is clearly possible for any a>0, h>0, L∈(0,ah). On the other hand, if we maximize F over Aa,h,L with the further constraint γ2′(t)≥0 for a.e. t∈(0,1), we may consider the estimate
[TABLE]
where equality holds if and only if γ1′(t)∧γ2′(t)=0 for a.e. t∈(0,1). Hence, for any a>0, h>0 and L∈(0,ah), the problem
[TABLE]
has infinitely many solutions. Any piecewise affine curve made by alternating horizontal ad vertical segments is indeed a solution as soon as the area constraint is matched, as it realizes the maximal value h. Such construction is analogous to the one of piecewise affine minimizers in the nonuniqueness regime from Theorem 2.4. However, these piecewise affine maximizers are found for any value of a>0, h>0 and L∈(0,ah).
Plan of the paper
Section 3 provides some basic properties of functional F. In Section 4 we introduce the relaxed functional and we analyze the associated minimization problem. Section 5 delivers the proof of the main results.
Notation
Through the rest of the paper, without further explicit mention, it is always understood that the parameters are in the range a>0, h>0 and L∈(0,ah).
3 Some properties of functional F
Let us start with a very simple estimate.
Lemma 3.1**.**
There holds
[TABLE]
Proof.
Let us suppose that 2L≥ah (the other case is analogous). It is enough to test the functional on the following curve made by two segments
[TABLE]
where r∈[0,h] is a parameter. Note that γr∈Aa,h,L if and only if ar=2L−ah. A direct computation shows that
[TABLE]
The function [0,h]∋r↦F(γr) is strictly decreasing on [0,r∗] and strictly increasing on [r∗,h], where r∗:=(h−a)+, as easily checked. Moreover, F(γ0)=a2+h2h3<h=F(γh). In particular, such function is uniquely maximized for r=h with value h. The result is proved.
∎
Remark 3.2**.**
Let γ∈Aa,h,L. We note that if γ1(t1)=γ1(t2) and γ2(t2)−γ2(t1)=h for some 0≤t1<t2≤1, then F(γ)≥h.
This happens in particular if (0,h)∈γ([0,1]) or (a,0)∈γ([0,1]).
Indeed, it is enough to compute the contribution to the functional coming from the interval [t1,t2] where γ is a vertical segment, which is exactly h.
We will often make use of approximations by means of piecewise affine curves. Here, we provide the approximation construction.
Lemma 3.3**.**
For any ϵ>0 and any γ∈Aa,h,L,
there exists γˉ∈Aa,h,L such that
i)
γˉ* is piecewise affine*
ii)
γˉ1′(t)>0* for a.e. t∈(0,1)*
iii)
γˉ2′(t)≥0* for a.e. t∈(0,1) if the same holds for γ.*
iv)
∣F(γˉ)−F(γ)∣<ϵ**
v)
t∈[0,1]sup∣γˉ(t)−γ(t)∣<ϵ.
In particular,
there holds
[TABLE]
Proof.
Step 1.
We approximate any γ∈Aa,h,L with a piecewise affine γ˘ with nodes on the curve γ, such that γ˘(0)=(0,0) and γ˘(1)=(a,h). This entails strong W1,1(0,1) (hence uniform) approximation of both γ1 and γ2.
In particular, for any δ>0, γ˘ can be chosen such that
[TABLE]
and
[TABLE]
where C=33/4 is the Lipschitz constant of the map R2∋(x,y)↦x2+y2x3.
Let 0=t0<t1<…<tn=1 be the partition of [0,1] such that γ(ti), i=1,…,n−1 are the nodes of γ˘. We mention that since ah>L>0, if the partition is fine enough there are always grid points ti, i=1,…,n−1, such that 0<γ2(ti)<h. Let I⊂{1,…,n} denote the subset of indices such that γ˘1′(t)=0 on (ti−1,ti) if i∈I and γ˘1′(t)=0 on (ti−1,ti) otherwise. We assume wlog that I does not contain two consecutive integers. We introduce the piecewise affine curve γ^, such that γ^(0)=(0,0) and γ^(1)=(a,h), whose nodes are found at the points
[TABLE]
For small enough δ the trace of γ^ is still contained in [0,a]×[0,h] and there holds γ^1′(t)>0 for a.e. t∈(0,1).
Clearly, if γ2′(t)≥0 for a.e. t∈(0,1), then γ^ and γ˘ enjoy this same property.
It is readily seen that supt∈[0,1]∣γ˘(t)−γ^(t)∣≤δ/2, and by computing the sums of trapezoidal areas we get
[TABLE]
Moreover,
[TABLE]
By combining the latter estimates with (3.1) and (3.2), we find
[TABLE]
Therefore, by taking δ small enough we see that γ^ satisfies properties i) to v). Still, it does not necessarily belong to Aa,h,L.
Step 2. In view of the previous step, we need to modify γ^ in order to match the area constraint.
A parametrization for γ^ is
[TABLE]
Let σ∈[−1,1]. We define a new piecewise affine curve depending on σ. Let γσ(t0)=(0,0), γσ(tn)=(a,h), and let γσ(ti)=(γ^1(ti),(1−∣σ∣)γ^2(ti)+σ+h), i=1,…n−1.
Accordingly, let
[TABLE]
The area in [0,a]×[0,h] that lies below the curve γσ is once more easily computed as sum of trapezoidal areas and there holds
[TABLE]
Since ∫01γ^1′γ^2<ah, we see from (3.6) that the map [−1,1]∋σ↦I(σ) is continuous strictly increasing. Moreover, it is readily seen using the second estimate in (3.3) and (3.6) that I(ah−L+δ2δ)>L+δ and that I(−L+δ2δ)<L−δ. We conclude that there exists a unique value σδ∈(−L+δ2δ,ah−L+δ2δ) such that I(σδ)=L, so that γσδ∈Aa,h,L.
It is clear that supt∈[0,1]∣γ^(t)−γσδ(t)∣<∣σδ∣h.
Eventually, by taking derivatives in (3.4) and (3.5) we get
[TABLE]
By taking (3.2) and the latter estimates into account, we get
[TABLE]
Since σδ vanishes as δ↓0, if we define, for δ small enough, γˉ:=γσδ we obtain γˉ∈Aa,h,L and i), ii) iii), iv), v) hold.
∎
4 Relaxation
In this section we gather some results about minimization of auxiliary functionals defined on BV functions of one variable, rather than parametric curves of the plane. We start by introducing some more notation.
be the convex envelope of g, i.e., the largest convex function that is smaller than or equal to g. In the following
for every u∈BVloc(R),
u′ will denote the distributional derivative and u˙,us′ its absolutely continuous and singular part respectively.
Let
[TABLE]
We further define the functionals
[TABLE]
and the functionals
[TABLE]
We shall often use the shorthands infG, infJ, infJ+infJ+ for the infimum over
BVloc(R). We also write infF in place of inf{F(γ):γ∈Aa,h,L}, which is the infimum of problem (2.1).
The first statement of this section is a suitable version of Lemma 3.3 for the new functionals.
Lemma 4.1**.**
Let ϵ>0. Let u∈Ba,h,L. There exist a piecewise affine function uˉ∈Ba,h,L such that
∣G(u)−G(uˉ)∣+∣J(u)−J(uˉ)∣<ϵ. Moreover, uˉ∈Ba,h,L+ if u∈Ba,h,L+. In particular,
there hold
[TABLE]
[TABLE]
[TABLE]
Proof.
By considering that both g from (2.3) and g∗∗ from (4.1) are Lipschitz on R, the proof follows the same line of that of Lemma 3.3. It is in fact an application of the same construction to the case of curves in Aa,h,L that are graphs of functions in Ba,h,L, therefore we omit the details.
∎
The following result shows that it is convenient to consider nondecreasing functions.
Lemma 4.2**.**
There holds
[TABLE]
Proof.
Thanks to Lemma 4.1, it is enough to show that for any piecewise linear function u∈Ba,h,L, there exists a piecewise linear nondecreasing function w∈Ba,h,L such that J(w)≤J(u). This will be achieved is some steps.
Step 1.
For n∈N we shall consider sequences of N points (xi,yi){i=1,…N}∈S, where
[TABLE]
is a connected subset of the rectangle [0,a]N×[0,h]N.
To a sequence of points (xi,yi){i=1,…N}∈S we may associate a continuous piecewise linear function
u=u{x1,y1,…xN,yN}, joining the endpoints (0,0) and (a,h), with vertices located at the points (xi,yi), and such that 0≤u≤h. As a convention, we do not include the endpoints (0,0) and (a,h) in the list of vertices, and we do not exclude that three or more consecutive points lie on the same line segment.
We notice that the energy of u=u{x1,y1,…xN,yN} is
[TABLE]
In particular, J is continuous on S, as g∗∗ is continuous on R.
We also notice that the area below the graph of u=u{x1,y1,…xN,yN} is given by
[TABLE]
and it is also a continuous function on S.
Let us moreover introduce a connected subset of S by
[TABLE]
so that the corresponding function u{x1,y1,…xN,yN} is a monotone nondecreasing piecewise constant functions with N vertices.
Step 2.
Now, let us fix (xˉi,yˉi){i=1,…N}∈S and the corresponding function u=u{xˉ1,yˉ1,…xˉN,yˉN}.
Let
[TABLE]
Then we recursively define
[TABLE]
for any j∈{2,…N} such that xˉN>vj−1. Let J:=max{j∈{1,…N}:xˉN>vj−1}, so we necessarily have vJ=xˉN.
Notice that by construction
[TABLE]
In particular, the continuous piecewise linear function u− having vertices exactly at the points {v1,…vJ} (and endpoints at (0,0),(a,h)) is nondecreasing on [0,a].
With the convention v0=0 and vJ+1=a, on each interval [vj,vj+1], j∈(0,J), let us consider the line segment
[TABLE]
connecting (vj,u(vj)) and (vj+1,u(vj+1)). We claim that
[TABLE]
This is obvious if u≡0 or u≡h in [vj,vj+1], and in fact it holds with equality on [vJ,vJ+1] since vJ=xˉN.
Otherwise, from (4.4) sj has positive slope and if by contradiction there is a point p∈(vj,vj+1) such that u(p)<sj(p), then since u is piecewise linear and joins (vj,u(vj)) with (vj+1,u(vj+1)), then u needs to have at least one vertex p′ on the interval (vj,vj+1), such that
[TABLE]
This is a contradiction, since by definition of Vj+1 and vj+1 the value of u at vj+1 is minimal among all the vertex points v of u such that v>vj. The claim is proved and since j is arbitrary we have u−(x)≤u(x) on [0,a].
For the sake of consistency, if J<N we complete te sequence (vi,u(vi)){i=1,…J} by adding N−J vertices on a uniform partition of the line segment connecting (vJ,u(vJ)) to (a,h), so that we obtain a sequence of points (vi,u(vi)){i=1,…N}∈S, and the associated piecewise linear function is still u−.
All in all, we have constructed a sequence of N vertices (vi,u(vi)){i=1,…N}∈S, and the associated piecewise linear function u− is nondecreasing
with u−(0)=0,u−(a)=h, it satisfies 0≤u−≤h, and moreover its vertices are on the graph of u.
Eventually, with an analogous construction we provide another continuous piecewise constant function 0≤u+≤h, with u+(0)=0,u+(a)=h, having a sequence of vertices in S which lie on the graph of u, such that u+ is nondecreasing and u+(x)≥u(x) for any x∈[0,a]. In particular, the set of vertices of u+ and u− belong to S′ from (4.3).
Step 3.
Given (xˉi,yˉi){i=1,…N}∈S and the associate piecewise linear function u=u{xˉ1,yˉ1,…xˉN,yˉN} from the previous step, we consider the set
[TABLE]
We claim that S′′ is a conncected subset of S. Indeed, let (xi,yi)i=1,…N∈S and (x~i,y~i)i=1,…N∈S. Then for each t∈[0,1], we let
[TABLE]
so that [0,1]∋t↦(xi(t),yi(t)){i=1,…N}∈[0,a]N×[0,h]N is a continuous mapping and by its very definition we have (xi(t),yi(t)){i=1,…N}∈S′′ for any t∈[0,1]. This proves the claim.
Step 4.
We consider again a generic piecewise linear mapping u=u{xˉ1,yˉ1,…xˉN,yˉN}∈Ba,h,L, with vertices at (xˉi,yˉi){i=1,…N}∈S. We consider the two piecewise linear nondecreasing mappings u+, u−, defined in Step 2. By the construction of u+ and u−, the respective sets of N vertices belong to
S′∩S′′. Moreover, we recall that the area below the graph is continuous on S, as seen in Step 1. On the other hand, still from Step 2 we have u−≤u≤u+ therefore ∫0au−≤∫0au=L≤∫0au+. Since the set of vertices of u+ and u− belong to S′∩S′′, which is a connected subset of S by Step 3, and since the area is continuous on S, we deduce that there exists a set of vertices in S′∩S′′ which realizes the value L of the area. We let w the corresponding piecewise linear function, which therefore belongs to Ba,h,L.
If 0≤p<q≤h correspond to any two consecutive vertices of w (or a vertex and an endpoint), since these points lie on the graph of u we have
[TABLE]
Since g∗ is convex on R, by the above equality we may invoke Jensen inequality and get
[TABLE]
We conclude that J(w)≤J(u), where w is a nondecreasing piecewise linear function in Ba,h,L.
∎
The following is not a Γ-convergence result since in the limsup inequality the sequence uj is not required to be converging to u. In any case, this will be sufficient for our later purposes.
Lemma 4.3**.**
*The following two properties hold true:
a) for every u∈BVloc(R) and every sequence (uj)⊂BVloc(R) such that uj→u in w∗−BVloc(R), there holds*
[TABLE]
b)* for every u∈BVloc(R) there exists a sequence (uj)⊂BVloc(R) such that*
[TABLE]
Proof.
We first prove a). Let uj→u in w∗−BVloc(R) and assume without restriction that J+(uj) is a bounded sequence. Then u∈Ca,h,L+ and (4.5) follow from [6, Theorem 3.4.1, Corollary 3.4.2], see also [1].
In order to prove b) it will be enough to assume that u∈Ca,h,L+. If this is the case by recalling that us′ has compact support we choose c1,c2≥0 such that
[TABLE]
and we introduce the function u∈BVloc(R) defined by:
[TABLE]
It is readily seen that u(0+)=0
and by using (4.7), (LABEL:widetildeu) we get
[TABLE]
and by taking into account (LABEL:widetildeu) we get u(x)=h for every x>a.
On the other hand, again by (LABEL:widetildeu) and the relation ∫0au+xu′=∫0a(xu)′=au(a−), we get
[TABLE]
Since us′([0,a])=us′([0,a]) we get J+(u)=J+(u) and it will be enough to find a sequence (uj)⊂BVloc(R) such that limsupj→∞J+(uj)≤J+(u) to achieve the result.
Let us consider the nondecreasing W1,1(0,a/3) function w1 satisfying w1(0)=0 and w1(a/3)=u(a/3−), that is obtained by restricting u to (0,a/3). Similarly, by taking the restriction of u to (a/3,a/2) (resp. to (a/2,a)), we obtain a nondecreasing function w2∈W1,1(a/3,a/2) with w2(a/3)=u(a/3+) and w2(a/2)=u(a/2−) (resp. a nondecreasig function w3∈W1,1(a/2,a) with w3(a/2)=u(a/2+) and w3(a)=h). We let a0:=0, a1:=a/3, a2:=a/2, a3:=a. Thanks to Lemma 4.1, for i=1,2,3 we approximate wi with nondecreasing piecewise affine functions (wi,j)j∈N with same values at ai−1 and ai and such that
[TABLE]
and
[TABLE]
Therefore, by defining vj:=wi,j on (ai−1,ai), i=1,2,3 (extended to R with value [math] for x<0 and with value h for x>a), we get vj∈Ca,h,L+ and for any j∈N the function vj is piecewise affine nondecreasing, it is continuous outside at most two jump points at a/3 and a/2, and
[TABLE]
Moreover, there holds
[TABLE]
If c1=c2=0, then vj∈Ba,h,L+ and we let uj=vj, thus the proof is concluded since (4.6) holds true. In general,
as vj may have jump points at a/3,a/2, we approximate it with a continuous piecewise affine function in Ba,h,L+ as follows.
We choose a decreasing vanishing sequence (λj)⊂R such that v˙j is constant on (a/3−λj,a/3),(a/3,a/3+λj),(a/2−λj,a/2),(a/2,a/2+λj) and we define for every t∈[0,1]
[TABLE]
where
[TABLE]
It is readily seen that vj,t∈Wloc1,1(R),vj,t(0)=0,vj,t(a)=h, that
Φj(t):=∫0avj,t is continuous on the whole [0,1] and that Φj(1)≤L≤Φj(0). Hence, there exists tj∈[0,1] such that ∫0avj,tj=L, so that uj:=vj,tj∈Ba,h,L+ and
[TABLE]
where we have set
Ij:=(3a+(t−1)λj,3a+tλj)∪(2a+(t−1)λj,2a+tλj).
By taking into account (4.1), (4.9), (4.10) and the fact that limj→+∞∣Ij∣=0 we get
[TABLE]
thus limj→+∞J+(uj)=J+(u) and b) follows.
∎
We next give an alternative representation for functional J+ from (4.2) and show that it admits a minimizer.
Lemma 4.4**.**
For every u∈Ca,h,L+ we have
[TABLE]
Proof.
Since
[TABLE]
and
[TABLE]
the result follows.
∎
Lemma 4.5**.**
The functional J+ admits a minimizer over Ca,h,L+ and
[TABLE]
Proof.
Let (uj)⊂Ba,h,L+ be a sequence such that J+(uj)=infJ++o(1) as j→+∞. Since u˙j≥0,uj(x)≡0 if x≤0,uj(x)≡h if x≥a then uj are equibounded in BVloc(R)
hence there exists u∈Ca,h,L+ such that , up to subsequences, uj→u in w∗−BVloc(R).
By a) of Lemma 4.3 we get
[TABLE]
and by b) of Lemma 4.3 for any other u∈Ca,h,L+there exists uj∈Ba,h,L+ such that
[TABLE]
Therefore,
[TABLE]
and by taking the limit the result is proved.
∎
We need now some fine properties of minimizers of J+. To this aim we introduce for ϵ>0 the penalized functionals
[TABLE]
defined for u∈H and extended with value +∞ if u∈BVloc(R)∖H,
where
[TABLE]
Minimizing sequences for Jε are equibounded in Wloc1,2(R), therefore (up to subsequences) converging weakly in Wloc1,2(R) and strongly in Lloc2(R). By taking into account the convexity and nonnegativity of x↦x−2 and x↦g∗∗(x), it is readily seen that the limit points minimize Jε over H. We next show that Lemma 4.3 holds also for Jε.
Lemma 4.6**.**
*Let ϵj→0 be a decreasing sequence, then
a) for every u∈BVloc(R) and every sequence (uj)⊂BVloc(R) such that uj→u in w∗−BVloc(R), there holds*
[TABLE]
b)* for every u∈BVloc(R) there exists a sequence (uj)⊂BVloc(R) such that*
[TABLE]
Proof.
a) is straightforward by sequential lower semicontinuity of J+(u) an b) is obvious if u∈Ca,h,L+. If u∈Ca,h,L+, we
choose c1,c2≥0
such that (4.7) holds.
We define u∈BVloc(R) as in (LABEL:widetildeu):
as seen in the proof of Lemma 4.3, there holds u(0+)=0,us′([0,a])=us′([0,a]), hence J+(u)=J+(u) and it is now enough to approximate J+(u). We let δj→0+ such that ϵjδj−1→0 and we define
[TABLE]
Then uj∈H and limsupj→∞Jϵj(uj)≤J+(u) follows by arguing as in Lemma 4.3.
∎
The next lemma introduces the Euler-Lagrange equation for functional J+, which will be a key step for the proof of Theorem 2.3.
Lemma 4.7**.**
*Let j∈N. Let ϵj→0 be a decreasing sequence and let uj∈argminHJϵj. Then:
i) u˙j is continuous and monotone in (0,a);
ii) u˙j≥0 a.e. in (0,a) and ∫0au˙j=h for any j∈N;
iii) there exists a (not relabeled) subsequence (uj) such that uj→u∗ in w∗−BVloc(R) as j→+∞ and u∗ minimizes J+ over Ca,h,L+;
iv) either u˙∗≥1 a.e. in (0,a) or u∗∈W1,∞(0,a) with 0≤u˙∗≤1 a.e. in (0,a) and in the latter case we have
for suitable λ,μ∈R*
[TABLE]
Proof.
Let uj∈argminJϵj. Then 0≤uj≤h in R (indeed, if this was not the case, 0∨uj∧h would provide a lower value for Jεj). Since 0≤uj≤h, by the Du-Bois-Raymond equation, there exist a real constant μj such that
[TABLE]
where λj=2ϵj−1((∫0auj)−L). Since hj is a continuous strictly increasing function, from (4.11) we have u˙j=hj−1(λjx+μj) and we see that
u˙j is continuous and monotone on the whole (0,a) thus proving i).
If ∣{u˙j<0}∣>0 then there exists an interval [αj,βj]⊂[0,a] such that u˙j<0 in (αj,βj). Since 0>∫αjβju˙j=uj(βj)−uj(αj) and since uj(0)=0≤u(x)≤h=uj(a) in R, we can exclude both αj=0 and βj=h. Therefore 0<αj<βj<h and u˙j+(αj)=u˙j−(βj)=0, hence
[TABLE]
in (αj,βj) which implies λjαj+μj=λjβj+μj=0, that is λj=μj=0 so u˙j≡0 in (αj,βj), a contradiction. Since u˙j≥0 a.e. in (0,a) we get
[TABLE]
and ii) is proven.
By ii) we get, up to subsequences, that uj→u∗ in w∗−BVloc(R) and by point a) of Lemma 4.6
[TABLE]
If now u∈Ca,h,L+, we construct uj from u as done in the proof of Lemma 4.6, which then entails along with the minimality of uj
[TABLE]
Hence, J+(u∗)≤J+(u) and iii) is proven.
We eventually prove iv). Since (g∗∗)′(u˙j)≤1 by (4.11) and ii) we get
[TABLE]
hence by integrating both members of previous inequality in [0,a] and in [0,a/3] and by assuming without restriction that 2hϵj≤a we get
[TABLE]
Then, by taking into account ii) we have, up to subsequences, λj→λ,μj→μ and ϵju˙j→0 in L1(0,a) so by recalling (4.11) we get
[TABLE]
and λjx+μj−2ϵju˙j→λx+μ in L1(0,a). By i) u˙j is monotone and continuous and without restriction we may assume (up to subsequences) that {u˙j>1}=(sj,a) for some sj∈(0,a) and that sj→s∈[0,a].
If s<a then by (4.12) we get
λx+μ≡1 in (s,a),
that is μ=1,λ=0.
Therefore, since
[TABLE]
by taking into account the form of (g∗∗)′ and the fact that u˙j≤1 on (0,sj), we get u˙j→1 a.e. on each compact subset of (0,s) that is u∗′=u˙∗=1 a.e on (0,s). On the other hand
since for j large enough u˙j>1 on each compact subset of (s,a) we get u˙∗≥1 a.e. on (s,a) thus proving that u˙∗≥1 a.e. on (0,a) in this case.
If s=a then ∣{u˙j>1}∣→0 and for every 0<β<a, we have 0≤u˙j≤1 in (0,β) for j large enough. Thus (up to subsequences), we find v∈L∞((0,β)) with ∥v∥L∞((0,β))≤1 such that u˙j→v in w∗−L∞((0,β)), so u∗′=v=u˙∗ on (0,β). This holds for every 0<β<a, that is, u∗′=u˙∗ on (0,a) and u∗∈W1,∞(0,a),0≤u˙∗≤1 a.e. in (0,a).
In addition by recalling that u˙j→u˙∗ in w∗−L∞((0,β)) and uj(x)=∫0βu˙j(t)1(0,x)dt for every x∈(0,β) we get uj(x)→u∗(x) in (0,β)
which, by taking into account that uj is convex, entails u˙j→u˙∗ a.e. in (0,β) and iv) completely follows from
(4.11) by passing to the limit as j→∞.
∎
Next we discuss property iv) of Lemma 4.7 in relation to the parameters range.
Lemma 4.8**.**
There exists a minimizer u∗ of J+ over Ca,h,L+ such that u∗∈W1,∞(0,a) and 0≤u˙∗≤1 a.e. in (0,a).
Moreover, if 2L∈/[a2,2ah−a2], then any minimizer u of J+ over Ca,h,L+ satisfies u∈W1,∞(0,a) and 0≤u˙≤1 a.e. in (0,a).
Proof.
Case I: 0<h<a (hence 2L<a2). By iv) of Lemma 3.10 there exists u∗∈argminCa,h,L+J+ such that either u˙∗≥1 a.e. in (0,a) or u∗∈W1,∞(0,a) with 0≤u˙∗≤1 a.e. in (0,a). If the first case occurs then by taking into account that u∗′≥0 and u∗(0+)≥0 we get u∗(a−)≥∫0au˙∗≥a>h, a contradiction. Hence, u∗∈W1,∞(0,a), 0≤u˙∗≤1 a.e. in (0,a)
and J+(u∗)=J+(u∗), thus proving the thesis.
Case II: h=a and 2L<a2. Choose u∗∈argminCa,h,L+J+ as in the previous case: if u˙∗≥1 a.e. in (0,a) then by taking into account that u∗′≥0 and u∗(0+)≥0 we get u∗(x)≥x hence L=∫0au∗≥a2/2, a contradiction. The thesis follows by arguing as before.
Case III: h≥a and a2≤2L≤a(2h−a). It is readily seen that there exists u∗∈W1,∞(0,a) such that u˙∗=1 a.e. in (0,a) and ∫0au∗=L. Since g∗∗(1)−1≤g∗∗(z)−z for every z∈R we get u∗∈argminCa,h,L+J+ and a direct computation shows that J+(u∗)=J+(u∗), thus proving the thesis.
Case IV: h≥a and a(2h−a)<2L<2ah. Assume by contradiction that u˙∗≥1 a.e. in (0,a): then either u∗(0+)>h−a or u∗(0+)≤h−a. In the first case we easily get u∗(x)>h−a+x, hence u∗(a−)>h, a contradiction. In the second one we claim that u∗(x)≤h−a+x: if this is true we get
[TABLE]
a contradiction. To prove the claim it is enough to observe that if there exists x∈(0,a) such that u∗(x)>h−a+x then by taking into account that u˙∗≥1 a.e. in (0,a) we get u∗(x)≥u∗(x)+x−x>h−a+x for every x≥x hence u∗(a−)>h, a contradiction. Therefore u∗∈W1,∞(0,a) and 0≤u∗≤1 a.e. in (0,a) also in this last case.
∎
The following is the version of Theorem 2.1 for functional J+.
Lemma 4.9**.**
Suppose that
2L∈/(a2,2ah−a2). Then J+ admits a unique minimizer over Ca,h,L+. Otherwise, J+ admits infinitely many minimizers over Ca,h,L+.
Proof.
By Lemma 4.4, there holds J+(u)=h+∫0aψ(u˙(x))dx for every u∈BVloc(R), where ψ(x):=g∗∗(x)−x is a convex function on R which is strictly convex on [0,1].
Suppose first that 2L∈/[a2,2ah−a2]. By Lemma 4.8, J+ admits a minimizer u∗ over Ca,h,L+, which necessarily satisfies u∗∈W1,∞(0,a) with 0≤u˙∗≤1 a.e. in (0,a). On the other hand u˙∗=1 a.e. in (0,a) is not admissible in this range of the parameters a,h,L (see Lemma 4.8), thus u˙∗<1 on a set of positive measure in (0,a). Since ψ is strictly convex in [0,1], if v∗∈Ca,h,L+ was another minimizer of J+, not coinciding a.e. with u∗, we could consider Ca,h,L+∋w∗:=21u∗+21v∗: by the strict convexity of ψ in [0,1], Jensen inequality would give J+(w∗)<J+(u∗), contradicting minimality of u∗. Therefore, the minimizer u∗ of J+ is unique. If h≥a and either 2L=a2 or 2L=a(2h−a), the Ca,h,L+ piecewise affine function u∗ having slope 1 on (0,a) is the unique minimizer of J+. Indeed, in this case it is clear that if v∗∈Ca,h,L+ satisfies v˙∗≥1 a.e. in (0,a), then v∗=u∗ a.e. R. Therefore any admissible competitor v∗, not coinciding a.e. with u∗, needs to satisfy v˙∗<1 on a set of positive measure in (0,a), thus it is not a minimizer due to the former Jensen inequality argument.
Else suppose that both the conditions h>a and a2<2L<a(2h−a) hold true. Since we are in Case III from the proof of Lemma 4.8, we see that Lemma 4.8 and Lemma 4.7 entail existence of a minimizer u∗ of J+ over Ca,h,L+ such that u˙∗=1 a.e. in (0,a). In this range of parameters, there necessarily holds 0<u∗(0+)<u∗(a−)<h (in order to match the area constraint).
Therefore, we may consider the family uϵ(x):=(1+ϵ)(x−a/2)+u∗(a/2), x∈(0,a), and for any ϵ>0 small enough uϵ fits the strip [0,h]. After having extended uϵ to R in such a way that it belongs to Ca,h,L+, from the representation of J+ given by J+(u)=h−∫0aψ(u˙(x))dx, it is clear that J+(uε) does not depend on ϵ, as ψ is constant on [1,+∞) and the slope of uε is greater than 1 for any ϵ>0.
∎
Remark 4.10**.**
In case competitors with u˙>1 a.e. in (0,a) are present, a large nonuniquenss phenomenon occurs. Solutions are not restricted to functions such that u˙ is constant in (0,a) as in the proof of Lemma 4.9. For instance, it is clear that any other continuous piecewise affine curve with slopes greater or equal than 1 on (0,a), as soon as it satisfies the constraints that define Ca,h,L+, is a minimizer of J+ over Ca,h,L+. Any other graph enjoying the same properties will attain the minimum. However, by Jensen inequality we obtain that the solution defined by u˙=1 in (0,a) is unique among those elements u of Ca,h,L+ that satisfy u∈W1,∞(0,a) and u˙≤1 a.e. in (0,a).
This section ends with some further properties of minimizers of functional J+.
Lemma 4.11**.**
Suppose that 2L∈/(a2,2ah−a2).
Then the unique minimizer u of J+ over Ca,h,L+ provided by Lemma 4.9 is either convex on (0,a) with u(0+)=0 or concave on (0,a) with u(a−)=h.
Proof.
By points i) and iii) of Lemma 4.7, u can be obtained as w∗−BVloc(R) limit of Wloc1,2(R) functions uj that are convex for all j or concave for all j. Up to subsequences, uj converge to u pointwise in (0,a) and u itself is therefore either concave or convex.
If u˙(x)=1 for any x∈(0,a), by Lemma 4.9 we are necessarily in the case 2L=a2 or in the case 2L=a(2h−a) and the proof is concluded. Else suppose that u is concave and that there exists 0<c<a such that u′<1 a.e. in (0,c). Suppose by contradiction that u(a−)<h. Let us consider a piecewise affine approximation of uˉ of u, with nodes on the graph of u, such that ∫0au−∫0auˉ=ε. By Jensen inequality, due to the strict convexity of ψ(x):=g∗∗(x)−x on (0,1), we have J+(uˉ)<J+(u). On the other hand, if ε is small enough we have that v:=uˉ+(ε/a)1(0,a) belongs to Ca,h,L+ and J+(v)=J+(uˉ). This contradicts the minimality of u. In case u is convex and u′<1 on a set of positive measure, an analogous argument shows that u(0+)=0.
∎
Corollary 4.12**.**
Let h≤a. If 2L≤ah (resp. 2L≥ah), then the unique minimizer u of J+ over Ca,h,L+ provided by Lemma 4.9 is convex on (0,a) with u(0+)=0 (resp. concave on (0,a) with u(a−)=h). In particular, u(x)=0∨(hx/a)∧h if 2L=ah.
Else suppose that h>a. If 2L≤a2 (resp. 2L≥a(2h−a)), then the unique minimizer u of J+ over Ca,h,L+ provided by Lemma 4.9 is convex with u(0+)=0 (resp. concave with u(a−)=h). In particular,
if 2L=a2 then u(x)=x in (0,a).
Proof.
Let h≤a. Suppose that 2L<ah. Suppose by contradiction that u is concave on (0,a). Letting w(x):=0∨(hx/a)∧h, since u(a−)=h by Lemma 4.11 and since u is concave, it is clear that u≥w in (0,a). This entails ∫0au≥∫0aw=ah/2>L, a contradiction. In case 2L>ah the argument is analogous.
The same reasoning also applies for proving the result in case h>a.
∎
Remark 4.13**.**
It is worth noticing that by symmetry reasons, if u∈Ca,h,L+ is a minimizer and it is convex in (0,a), then v(x):=h−u(a−x) satisfies J+(v)=J+(u) and it is a minimizer in Ca,h,ah−L+ which is concave in (0,a). Therefore all significant cases of Corollary 4.12 can be reduced to
2L≤(ah)∧a2 (as in Theorem 2.3).
5 Proof of the main results
We go back to the analyis of functional F. The next two results give its relation with the auxiliary functionals from Section 4.
Lemma 5.1**.**
Let γ∈Aa,h,L be a piecewise affine curve such that γ1′(t)>0 for a.e. t∈(0,1). Then there exists a piecewise affine function u∈Ba,h,L such that G(u)=F(γ).
Conversely,
let u∈Ba,h,L be piecewise affine. Then there exists γ∈Aa,h,L with γ1′(t)>0 for a.e. t∈(0,1) such that F(γ)=G(u).
In particular there holds
[TABLE]
Proof.
It is enough to exploit the fact that the values of F(γ) and ∫01γ1(t)γ2′(t)dt are invariant by reparametrization.
If γ∈Aa,h,L is piecewise affine with γ1′>0 a.e. in (0,1), then γ can be reparametrized as the graph of a continuous piecewise affine map u on [0,a], that is, as [0,a]∋t↦(t,u(t)). This is done by defining u:=γ2∘γ1−1.
Note that u is absolutely continuous, as the composition of an absolutely continuous function and an absolutely continuous strictly increasing function.
By changing variables, since (γ1−1)′(x)=1/γ1′(γ1−1(x)) for a.e. x∈(0,a), we get
[TABLE]
[TABLE]
showing that indeed u∈Ba,h,L and G(u)=F(γ).
Similarly, if u∈Ba,h,L is a piecewise affine map, we may consider the curve [0,1]∋t↦γ(t):=(at,u(at)). It is immediate to check that γ∈Aa,h,L is piecewise affine with γ1′(t)>0 in (0,1) and that F(γ)=G(u).
∎
Lemma 5.2**.**
*There holds infG=infJ=infF=minCa,h,L+J+.
*
Proof.
Take u∗∈BVloc(R) from Lemma 4.8, such that u∗∈argminCa,h,L+J+ and 0≤u˙∗≤1 a.e. in (0,a).
It is easy to check that minimality of u∗ implies that u˙∗>0 on a set of postive measure in (0,a), and since the inequality g∗∗(z)<z holds in (0,1], by Lemma 4.4 we get
On the other hand, by definition of g∗∗ in (4.1) it is clear that G≥J, so that by the above equalities we get infJ≤infG. We are left to prove the opposite inequality.
Let 0≤t1<t2≤1 and let
γ∗:[0,1]→[0,a]×[0,h] be defined by
[TABLE]
It is readily seen that γ∗∈Aa,h,L and that
[TABLE]
where we can replace g with g∗∗ in the last line due to 0≤u˙∗≤1. Therefore, by Lemma 4.4 we get F(γ∗)=J+(u∗)<h. We next take ε>0 and a piecewise affine curve γˉ∈Aa,h,L such that γˉ1′(t)>0 for a.e. t∈(0,1) and ∣F(γ∗)−F(γˉ)∣<ε, which is possible by Lemma 3.3.
By Lemma 5.1 there is uˉ∈Ba,h,L such that G(uˉ)=F(γˉ). Summing up we have
[TABLE]
and by arbitrariness of ε we get infG≤J+(u∗)=infJ.
We have shown that infJ=infG. Lemma 3.3, Lemma 5.1 and Lemma 4.1 imply that infG=infF, concluding the proof.
∎
Before proceeding to the proof of Theorem 2.1, we need three more technical lemmas.
Lemma 5.3**.**
Let γ∈Aa,h,L and suppose that there exist t1,t2, with 0≤t1<t2≤1, such that γ2(t2)<γ2(t1). Then
F(γ)>infF.
Proof.
We let ϵ>0 and we let γ^∈Aa,h,L be a piecewise affine approximation of γ with γ^1′(t)>0 a.e. in (0,1),
such that ∣F(γ)−F(γ^)∣<ϵ and such
that ∣γ^2(ti)−γ2(ti)∣<ϵ, i=1,2. We let (xp,yp):=(γ^1(t1),γ^2(t1)) and (xq,yq):=(γ^1(t2),γ^2(t2)). We may assume wlog that
[TABLE]
otherwise we could define
[TABLE]
and subsequently redefine
(xp,yp):=(γ^1(t~1),γ^2(t~1)) and (xq,yq):=(γ^1(t~2),γ^2(t~2)).
Notice that γ^ coincides on [0,a] with the graph of a piecewise affine function u^∈Ba,h,L. Hence, by the proof of Lemma 4.2 there exists a new piecewise affine curve u∈Ba,h,L+ having ordered vertices at the points (0,0)=(s0,u(s0)),(s1,u(s1)),…,(sk,u(sk))=(a,h) along the curve γ^. We let S:={s0,s1,…,sk}. Jensen inequality ensures that
[TABLE]
We let
[TABLE]
Supposing that {s∈S:xp<s<xq}=∅, we further define
[TABLE]
so that y1≤y2≤y3≤y4. Else if {s∈S:xp<s<xq}=∅,
we define x2=x3=2xp+xq and y2=y3=2yp+yq.
By construction, there always holds yq≤y2≤y3≤yp.
By repeated use of Jensen inequality and since from (4.1) we have g∗∗(z)=0 for z≤0, there hold
[TABLE]
where the mapping (0,+∞)×R∋(x,y)↦xg∗∗(y/x) is understood to be extended by continuity to x=0 (with value y+), and we used the fact that [0,+∞)∋x↦xg∗∗(y/x) is nonincreasing for any y∈R.
Thanks to (5.2) and (LABEL:4) we get
[TABLE]
We define φ(x):=min{2x,a2+h2x3} for x≥0. Again
the definition of g∗∗ in (4.1) entails
[TABLE]
for all u∈(0,a),v1∈(0,h),v2∈(0,h) with v1≥v2.
If y2≥y1 and y4≥y3, from (5.4) and (5.5) we get
[TABLE]
where we have used
y3≥y2 which entails 2max{yp−y2,y3−yq}≥yp−y2+y3−yq≥yp−yq.
Else we notice that y2<y1 or y4<y3 may happen only if {s∈S:xp<s<xq}=∅, in which case yp−y2=y3−yq=2yp−yq. Moreover, in such case since y1≤y4 and y2=y3 it is clear that the two inequalities y2<y1 and y4<y3 do not simultaneously hold. Therefore, even in this case from (5.4) and (5.5) we get J(u^)−J(u)≥φ(2yp−yq).
We finally notice that
[TABLE]
where γ2(t2)−γ2(t1) is, by assumption, a prescribed positive value (independent of ϵ).
We conclude that for any small enough ϵ
[TABLE]
Since we have shown in Lemma 5.2 that infJ=infF, the result follows.
∎
Before stating the next lemma, as further notation we introduce the class
[TABLE]
Lemma 5.4**.**
*Suppose that 2L∈/(a2,2ah−a2). Let γ∈Aa,h,L+.
If 0<t1<t2<1 exist such that γ1′(t)=0 on (t1,t2), then F(γ)>infF.
*
Proof.
For γ2(t1)<s<γ2(t2), we define ts as the unique number in (t1,t2) such that γ2(ts)=γ2(t1)+s, hs:=γ2(t2)−γ2(ts) and
[TABLE]
It is clear that for any s, F(γs)=F(γ), since γs is just obtained from γ by rearrangement of pieces (by translations).
It is also clear that s can be (uniquely) chosen such that γs∈Aa,h,L+. Let r denote such value of s and let γ˘:=γr. We next define suitable approximations by means of Lemma 3.3. We let
[TABLE]
where
[TABLE]
are piecewise affine approximations of \breve{\gamma}{\big{|}}_{[t_{r}-t_{1},t_{r}+1-t_{2}]},
with same initial point γ˘(tr−t1)=(0,r), same end point γ˘(tr+1−t2)=(a,h−hr), with (γ2N)′(t)≥0 and (γ1N)′(t)>0 for a.e. t∈(tr−t1,tr+1−t2). These approximating curves are constructed by means of Lemma 3.3, so that γ˘N∈Aa,h,L, γ˘N→γ˘ uniformly on [tr−t1,tr+1−t2] and F(γ˘N)→F(γ˘) as N→+∞. Since γ1N is strictly increasing we may define the piecewise affine function
uN:=γ2N∘(γ1N)−1 on [0,a], that we extend to R by setting uN(x)=0 if x<0 and uN(x)=h if x>a. By changing variables as done in the proof of Lemma 5.1 we get
[TABLE]
and
[TABLE]
Thanks to the latter estimate, uN admits a w∗−BVloc(R) limit u, which satisfies u(0+)≥r and u(a−)≤h−hr. Up to extraction of a not relabeled subsequence, the convergence also holds strongly in L1(0,a), thus ∫0au=limN→+∞∫0aun=L so that u∈Ca,h,L+. The lower semicontinuity of J+ and (5.7) entail
[TABLE]
But u(0+)>0 and u(a−)<h, thus u is not a minimizer of J+ over Ca,h,L+ due to Lemma 4.11. We conclude that F(γ)>minCa,h,L+J+. By Lemma 5.2, the result follows.
∎
Lemma 5.5**.**
Let γ∈Aa,h,L+. Then F(γ)≥h−a/2 and equality holds if and only if γ1′(t)=γ2′(t) for a.e. t∈{γ1′(t)>0}.
Proof.
Let γ∈Aa,h,L+.
We have
[TABLE]
Equality holds if and only if γ1′=γ2′ a.e. on {γ1′(t)>0}, since the Young inequality 2αβ≤α2+β2 is an equality if and only if α=β.
∎
Let us start by proving existence. Take u∗∈Ca,h,L+ from Lemma 4.8, such that u∗∈argminCa,h,L+J+, u∗∈W1,∞(0,a) and 0≤u˙∗≤1 a.e. in (0,a).
We have seen in the proof of Lemma 5.2 that there exists γ∗∈Aa,h,L such that
J+(u∗)=F(γ∗)=infF. This concludes the proof.
We also stress that from (5.1) we deduce γ∗∈Aa,h,L+, which is the class defined in (5.6). In fact, any solution to problem (2.1) belongs to Aa,h,L+ by Lemma (5.3).
Let us prove i).
Suppose that 2L∈/(a2,2ah−a2).
Let γ be an element of Aa,h,L+ that solves problem (2.1),
so that F(γ)=minCa,h,L+J+. Taking advantage of Lemma 5.4, there exist
0≤t1<t2≤1 such that γ1 is constant on [0,t1] and [t2,1], and it is strictly increasing on [t1,t2]. We let
γˉ=(γˉ1,γˉ2) denote the restriction of γ to [t1,t2] and we define a monotonic BVloc(R) function by
u(x)=γˉ2∘γˉ1−1(x) for x∈(0,a) (extended to R by u(x)=0 if x<0 and u(x)=h if x>a).
By invoking Lemma 3.3 as done in the proof of Lemma 5.4, we introduce piecewise affine approximations γN∈Aa,h,L+ of γ, with (γ1N)′(t)>0 for a.e. t∈(0,1), so that F(γN)→F(γ) and γN→γ uniformly on [0,1] as N→+∞. As a consequence, letting uN:=γ2N∘(γ1N)−1 in (0,a) (extended to R by uN(x)=0 if x<0 and uN(x)=h if x>a) there also holds uN→u pointwise a.e. in R as N→+∞.
By changing variables we get
[TABLE]
so that uN∈Ca,h,L+ for any N, and (by using g∗∗≤g)
[TABLE]
A w∗−BVloc(R) limit point of uN necessarily coincides with u since w∗−BVloc(R) and pointwise a.e. limit coincide.
By passing to the limit with the w∗−BVloc(R) lower semicontinuity of J+ we get J+(u)≤F(γ).
But Lemma 5.2 and Theorem 2.1 yield F(γ)=infF=minCa,h,L+J+. We conclude that u coincides with the unique minimizer u∗ of J+ over Ca,h,L+ provided by Lemma 4.9. Hence the curve γ necessarily coincides with the graph of u∗ on (0,a) plus the possible vertical segments at x=0 or x=a. This concludes the proof of i).
Eventually, let us prove the statement ii). Suppose that h>a and a2<2L<a(2h−a). All the piecewise affine curves γ in Aa,h,L+ that are constructed in Section 2 after the statement of Theorem 2.4 satisfy F(γ)=h−a/2 as seen in (2.10). Therefore, they solve problem 2.1 thanks to Lemma 5.5.
□
Let us now give a precise characterization of solutions in the nonuniqueness range, by proving Theorem 2.4.
Suppose that h>a and a2<2L<a(2h−a). By Lemma 5.3 any solution to problem (2.1) belongs to Aa,h,L+. As γ∘∈Aa,h,L+ and F(γ∘)=h−a/2, we conclude that γ∘ solves problem (2.1) as a consequence of Lemma 5.5. More generally, still by Lemma 5.5, γ is solution to problem (2.1) if and only if γ∈Aa,h,L+ and γ1′=γ2′ a.e. on {γ1′>0}. It is clear that
γ∘ is the unique curve in the latter class such that the set {γ1′(t)>0} is an interval (t1,t2) for some 0<t1<t2<1.
□
Remark 5.6**.**
Suppose that h>a and a2<2L<a(2h−a).
γ∘ corresponds indeed to the unique minimizer of J+ among functions u in Ca,h,L+ such that u∈W1,∞(0,a) with u˙=1 on (0,a), see Lemma 4.9 and Remark 4.10.
The proof of Theorem 2.3 relies on a careful application of the Euler-Lagrange equation and it requires some preliminary lemmas.
We shall provide a parametrization in terms of u˙ as originally done by Euler in the solution of Proposition 53 in Scientia Navalis [14].
Without loss of generality, as we have pointed out in Lemma 4.11 and in Remark 4.13, we may consider only the case of convex solutions.
We start by proving the following
Lemma 5.7**.**
Assume that 2L≤(ah)∧a2
holds true and let Ψ,Φ,T as in (2.4), (2.5) and (2.6) respectively.
Then
[TABLE]
Proof.
Since 2L≤(ah)∧a2, then by Lemma
4.9 there exists a unique u∗∈argminCa,h,L+J+, u∗∈W1,∞(0,a) and 0≤u˙∗≤1. By Corollary 4.12u∗ is convex in (0,a), u∗(0)=0 and finally by Lemma 4.7 there exist λ,μ∈R such that
[TABLE]
hence μ=g′(u˙∗(0)) and λ=a−1(g′(u˙∗(a))−g′(u˙∗(0)))≥0 since g′ is increasing in [0,1] and u˙∗(a)≥u˙∗(0) by convexity of u.
Moreover, due to continuity of the right hand side, (5.8) holds everywhere in [0,a] and u˙∗ is continuous therein; therefore the set
[TABLE]
is nonempty and
[TABLE]
If u∈K and u˙(0)<u˙(a) then u˙ is strictly increasing and by setting t:=u˙(x), taking into account that g′(u˙(x))=λx+μ and that u(0)=0, it is readily seen that
the curve σ(x):=(x,u(x)),x∈[0,a], is equivalent to the one parametrized by
[TABLE]
and a direct computation using Lemma 4.4 shows that
[TABLE]
Moreover, by using again the change of variable t:=u˙(x), taking into account that u(0)=0, x(u˙(0))=0, x(u˙(a))=a, the area constraint becomes
[TABLE]
On the other hand if u˙(0)=u˙(a) then u˙(x)≡u˙(0) and since ∫0au=L we get u˙(x)≡2La−2 and
We claim that if (ξ∗,η∗)∈argminTΨ then there exists u∗∈K such that (u˙∗(0),u˙∗(a))=(ξ∗,η∗): indeed if ξ∗=η∗ then by (2.5) we get Φ(ξ∗,ξ∗)=a2ξ∗/2=L, that is ξ∗=η∗=2L/a2 and therefore it is enough to choose u∗(x)=ξ∗x; otherwise we have ξ∗<η∗ and we may define a parametrized curve by
[TABLE]
It is readily seen that x∗(t) is strictly increasing from [ξ∗,η∗] onto [0,a] and by denoting with φ its inverse we define u∗(x):=y∗(φ(x)). A direct computation shows that u∗ is differentiable in (0,a) and u˙∗(x)=φ(x) therein, so it is easy to see that u∗∈K and u˙∗(0)=φ(0)=ξ∗,u˙∗(a)=φ(a)=η∗ thus proving the claim. Therefore
[TABLE]
and the proof is achieved.
∎
Lemma 5.8**.**
Assume that 2L≤(ah)∧a2. Then there exists a unique (ξ∗,η∗)∈argminTΨ. Moreover, if 2L<(ah)∧a2, then ξ∗<η∗.
Proof.
Let (ξ∗,η∗) be a minimizer of Ψ over T.
Following the proof of Lemma 5.7, there exists u∈K such that (ξ∗,η∗)=(u˙(0),u˙(a)) and moreover
[TABLE]
But Lemma 4.9 shows that there exists a unique minimizer u∗ of J over Ca,h,L+ (and u∗∈K as seen in the proof of Lemma 5.7). Therefore u necessarily coincides with u∗. Thus (ξ∗,η∗)=(u˙∗(0),u˙∗(a)) and this proves uniqueness.
Assume now by contradiction that 2L<(ah)∧a2 and ξ∗=η∗. Then by (2.5) ξ∗=η∗=2L/a2. If we consider a couple (ξ,η) that satisfies
[TABLE]
then it is readily seen that (ξ,η)∈T:
indeed by setting
we have
ϕ(2L/a2)=Ψ(ξ∗,η∗)
and by taking into account that 2L<a2 a direct computation shows that
[TABLE]
Hence there exist 1≥η>2L/a2 and 0≤ξ=a2−2L2L(1−η)<2L/a2 such that the couple (ξ,η) satisfies the constraint (5.13) and
[TABLE]
thus contradicting minimality of (ξ∗,η∗).
∎
The previous results suggests the following parametric representation of the minimizer.
Lemma 5.9**.**
Assume that 0<2L≤(ah)∧a2.
Let u∗ be the unique minimizer of J+ over Ca,h,L+ provided by Lemma 4.9. Then either 2L=(ah)∧a2 and u∗(x)=2La−2x for any x∈(0,a), or the curve σ(x):=(x,u∗(x)),x∈[0,a], is equivalent to the one parametrized by (5.12),
where (ξ∗,η∗) is the unique minimizer of Ψ on T, ξ∗<η∗, and h∗:=y∗(η∗)=u∗(a−)<h.
Proof.
By Corollary 4.12 if 2L=(ah)∧a2 then u∗(x)=2La−2x for any x∈(0,a). Assume now that 2L<(ah)∧a2: if (ξ∗,η∗)∈argminTΨ then by Lemma 5.8ξ∗<η∗, the unique minimizer u∗ can be parametrized as in (5.12) and in particular
(ξ∗,η∗) is the unique minimizer of Ψ on T.
We have only to prove that h∗<h. Indeed
[TABLE]
and
[TABLE]
By gathering together the two last relations we get
Let γ∗∈Aa,h,L as in (2.7), x∗,y∗,u∗ as in Lemma 5.9: since h∗:=u∗(a−) and 0≤u˙∗≤1, a direct computation shows that
[TABLE]
and the result follows easily by taking (5.14) into account.
□
Remark 5.10**.**
If we change L to ah−L, the unique solution is given by γ~∗ from (2.9). Indeed, by considering the construction of the solution, this is a consequence of Remark 4.13.
The following simple lemma will be used for proving Theorem 2.5.
Lemma 5.11**.**
Let S:={(ξ,η):0≤ξ≤η≤1} and let Φ:S→R be the function defined by (2.5). Then ∂ξΦ(ξ,η)>0
for any (ξ,η)∈S such that 0<ξ<η, ∂ηΦ(0,η)>0 for any η∈(0,1), and q′(ξ)>0 for any ξ∈(0,1), where q(ξ):=Φ(ξ,ξ). Moreover, Φ(S)=[0,a2/2].
Proof.
A computation exploiting (2.5) shows that for any (ξ,η)∈S such that 0<ξ<η there holds
[TABLE]
Similarly, for any η∈(0,1) there holds
[TABLE]
Positivity follows by considering the explicit expression of g from (2.3). The statement about q is obvious since q(ξ)=21a2ξ.
Φ is continuous on S with Φ(0,0)=0 and Φ(1,1)=a2/2, thus having checked the sign of the derivatives, we conclude that Φ(S)=[0,a2/2].
∎
Let us first prove the continuity of (0,21((ah)∧a2)]∋L↦Fmin(a,h,L). Let S as in Lemma 5.11. If 0<2L≤(ah)∧a2 we take a sequence (Lj)⊂(0,21((ah)∧a2))∖{L} such that Lj→L as j→∞. By taking advantage of Lemma 5.7 we take a couple (ξj,ηj) that minimizes Ψ over Tj:={(ξ,η):0≤ξ≤η≤1,Φ(ξ,η)=Lj}, so that Fmin(a,h,Lj)=Ψ(ξj,ηj). We extract a subsequence (not relabeled) such that ξj→ξ∞, ηj→η∞ as j→∞. By continuity of Φ over S we have (ξ∞,η∞)∈T:={(ξ,η):0≤ξ≤η≤1,Φ(ξ,η)=L}.
We claim that (ξ∞,η∞) is a minimizer of Ψ over T. Indeed, let us assume by contradiction that it is not, and by using Lemma 5.7 let us take a minimizer (ξ^,η^) of Ψ over T, thus Ψ(ξ^,η^)=Fmin(a,h,L) and Ψ(ξ∞,η∞)−Ψ(ξ^,η^)=:σ>0. For ε>0, let B^ε denote the ε-neighbour of (ξ^,η^) in S. Thanks to Lemma 5.11, for any ε>0 there exists δ>0 such that the image of B^ε through the continuous function Φ contains the interval (L−δ,L+δ)∩[0,a2/2]. By using the continuity of Ψ in S, let ε>0 be small enough such that ∣Ψ(ξ^,η^)−Ψ(ξ,η)∣<σ/2 for any (ξ,η)∈B^ε. Therefore, we can find j large enough and (ξ~,η~)∈B^ε such that Φ(ξ~,η~)=Lj (hence (ξ~,η~)∈Tj) and such that ∣Ψ(ξ∞,η∞)−Ψ(ξj,ηj)∣<σ/2. Summarizing, we have the three relations
[TABLE]
and such relations imply Ψ(ξj,ηj)>Ψ(ξ~,η~), contradicting the minimality of (ξj,ηj) for Ψ on Tj. The claim is proved, and since the minimizer of Ψ over T is unique by Lemma 5.8, the whole sequence (ξj,ηj) converges to (ξ∞,η∞), yielding
[TABLE]
This proves the continuity of the map L↦Fmin(a,h,L) on (0,21((ah)∧a2)) and the left continuity at 21((ah)∧a2).
Let us also remark that if h≤a, (5.11) yields
Ψ(h/a,h/a)=a2+h2h3, therefore by the above left continuity we get limL↑ah/2Fmin(a,h,L)=a2+h2h3. Similarly, if h>a, still by (5.11) we have Ψ(1,1)=h−a/2, hence limL↑a2/2Fmin(a,h,L)=h−a/2.
In case h>a, we also have Fmin(a,h,L)=h−a/2 for any L∈[a2/2,ah/2] as a consequence of the characterization of the optimal energy in the nonuniqueness range, see Theorem 2.4.
We next notice that Φ(ξ,η)=0 implies ξ=η=0 and the elementary estimate Φ(ξ,η)≥2a2(ξ∨(η−ξ)) on S shows that T shrinks to the origin as L goes to [math]. Since Ψ(0,0)=h we obtain by (5.14) that limL↓0Fmin(a,h,L)=h by continuity of Φ and Ψ over S.
All in all, we have proven the continuity of the map L↦Fmin(a,h,L) in (0,ah/2), the left continuity at ah/2
and limL↓0Fmin(a,h,L)=h.
The symmetry around L=ah/2 follows from Remark 5.10, and then it implies continuity on (0,ah).
Let us eventually discuss the monotonicity.
Let h≤a. Of course we have Fmin(a,h,L)<h (see Lemma 3.1 and Remark 3.2). If L<ah/2 is increased to a close value L, still with 2L≤ah, from the curve that realizes the value Fmin(a,h,L) we take a piecewise affine interpolating curve whose subtended area is L. The energy goes down by convexity (slopes are smaller than 1). Therefore Fmin(a,h,L)<Fmin(a,h,L), proving the monotonicity. The range is [a2+h2h3,h), as we have already obtained the continuity and the limit values at L=0 and L=ah/2.
About the case 2L≥ah, we obtain the desired monotonicity by making use of the symmetry of the optimal energy values around L=ah/2.
Let now h>a: we cross the nonuniqueness regime as L grows from [math] to ah.
The argument is the same, also taking into account that Fmin(a,h,L)=h−a/2 for any L∈[a2/2,ah−a2/2] as seen in the proof of Theorem 2.4.
□
Acknowledgements
The authors are members of the
GNAMPA group of the Istituto Nazionale di Alta Matematica
(INdAM).
Bibliography30
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] L. Ambrosio, G. Dal Maso, On the Relaxation in B V ( Ω ; 𝐑 m ) 𝐵 𝑉 Ω superscript 𝐑 𝑚 BV(\Omega;{\mathbf{R}}^{m}) of Quasi-convex Integrals , J. Funct. Anal. 109 (1992), 76–97.
2[2] M. Belloni, B. Kawohl, A paper of Legendre revisited , Forum Math. 9 (1997), no. 5, 655-667.
3[3] M. Belloni, A. Wagner, Newton’s problem of minimal resistance in the class of bodies with prescribed volume . J. Convex Anal. 10 (2003), no. 2, 491-500.
4[4] O. Bolza, Vorlesungen u ¨ ¨ u \ddot{\rm u} ber Variationsrechnung, Verlag von B.G.Teubner , Leipzig (1909).
5[5] G. Buttazzo, A survey on the Newton problem of optimal profiles . In ‘Variational Analysis and Aerospace Engineering’, Volume 33 of the series Springer Optimization and Its Applications (2009), 33-48.
6[6] G. Buttazzo, Semicontinuity, Relaxation and Integral Representation in the Calculus of Variations , volume 207 of Pitman research notes in mathematics, Longman Scientific, Harlow (1989).
7[7] G. Buttazzo, B. Kawohl, On Newton’s problem of minimal resistance. Math. Intelligencer 15 (1993), no. 4, 7-12.
8[8] F. Brock, V. Ferone, B. Kawohl, A Symmetry Problem in the Calculus of Variations , Calc. Var. Partial Differential Equations 4 (1996), 593 – 599.