On Gradient Flows with Obstacles and Euler's Elastica
Marius M\"uller

TL;DR
This paper studies a gradient flow with obstacle constraints in higher order energy settings, focusing on elastic flow of graph curves with Navier boundary conditions, establishing existence and long-term behavior.
Contribution
It introduces a new approach to construct obstacle-constrained gradient flows in complex energy frameworks using De Giorgi's scheme, applied to elastic graph curves.
Findings
Established long-time existence of elastic flow with obstacles.
Analyzed asymptotic behavior of the flow.
Developed a general construction method for obstacle gradient flows.
Abstract
We examine a steepest energy descent flow with obstacle constraint in higher order energy frameworks where the maximum principle is not available. We construct the flow under general assumptions using De Giorgi's minimizing movement scheme. Our main application will be the elastic flow of graph curves with Navier boundary conditions for which we study long-time existence and asymptotic behavior.
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 Gradient Flows with Obstacles and
Euler’s Elastica
Marius Müller
Institut für Analysis, Universität Ulm, 89069 Ulm
Abstract.
We examine a steepest energy descent flow with obstacle constraint in higher order energy frameworks where the maximum principle is not available. We construct the flow under general assumptions using De Giorgi’s minimizing movement scheme. Our main application will be the elastic flow of graph curves with Navier boundary conditions for which we study long-time existence and asymptotic behavior.
Key words and phrases:
Gradient Flows in Metric Spaces, Higher Order PDE’s, Elastic Bending Energy
2010 Mathematics Subject Classification:
Primary 35K87, 35R35; Secondary 49J40, 34G20
The author is supported by the LGFG Grant (Grant no. 1705 LGFG-E) and would like to thank Anna Dall’Acqua and Fabian Rupp for helpful discussions.
1. Introduction
Under Obstacle Problems one understands the question whether a given energy functional attains a minimum in the set , where is a space of Lebesgue-measurable functions and is a certain measurable function such that , the so-called obstacle. The question can be posed more generally as minimization of an energy functional in some convex closed subset of a Banach space , but since has more structural properties than just convexity and closedness, one could also impose more conditions on . Part of the goal of this article is to identify reasonable structural requirements in a more abstract framework, e.g. if is not required to be a space of functions.
Such obstacle problems have various applications in physics and finance. A very important concept in this field is that of a variational inequality. This can be stated as follows: If is a Banach Space, is convex and closed and is an energy functional then
[TABLE]
where denotes the Frechét derivative of .
In this article we are especially interested in the case when is a Hilbert Space. The energy we mainly focus on is the elastic bending energy for graphs with fixed ends, i.e.
[TABLE]
This energy is motivated as follows: If is an immersed plane curve, then one can define its one-dimensional Willmore energy to be
[TABLE]
where denotes the curvature of and denotes the arclength element. If is a graph curve, i.e. for , then . The obstacle problem for elastic curves in the framework presented above has already been studied in [Anna] and [Mueller]. Elastic Curves with other obstacle-type confinements have also recently raised a lot of interest, see [Novaga].
In this article we want to construct gradient flows respecting the obstacle condition. In this framework, a gradient flow should be understood as a flow that realizes the steepest possible energy descent in the class of admissible curves. The so-called steepest descent curve approach is also the starting point for [Ambrosio] to define gradient flows in metric spaces . Since each convex closed subset of a Banach space forms a metric space, one could think that the gradient flow we are interested in is already constructed in [Ambrosio]. However, in [Ambrosio] the authors impose a condition on the energy that the elastic energy does not satisfy. We want to comment on this condition shortly. For a metric space one defines the metric slope of to be
[TABLE]
If is a convex subset of a Hilbert space and , , then one has (see Proposition 2.16 below)
[TABLE]
In order to show existence of the flow, [Ambrosio, Equation (2.3.1)] requires that is weakly lower semicontinuous on which is in general not true for nonlinear evolutions such as the evolution by elastic flow. If this condition is not satisfied, then one obtains the gradient flow only with a relaxed version of , which is denoted by in [Ambrosio]. Nevertheless, we can construct a steepest-descent flow without relaxation for the elastic energy and even in a larger class of higher order energies. Existence and asymptotic behavior of this flow are proved in Theorem 3.19, Theorem 4.10 and Theorem 5.11, which are our main results.
Important progress on the field of higher order gradient flows with obstacle constraint has been made in [Okabe1] and [Okabe2], where for some open bounded and
[TABLE]
Even though in this case, the article provides plenty of new insights in regularity of the obstacle gradient flow, which can hardly be discussed in the general framework in [Ambrosio]. The reason why the energy is extended by infinity is, that one obtains an -gradient flow in the end, which is actually more desireable than a gradient flow in , since the PDE for the flow is usually easier. Unfortunately, we are unable to construct an -gradient flow for the elastic energy respecting the obstacle condition at this point. In [Okabe1], the existence problem for this flow is presented as an open question and one of the main motivations of the authors to consider parabolic fourth order obstacle problems. The present article can be understood as some progress on this question.
The main method to show existence in [Ambrosio], [Okabe1] and [Okabe2] is the De Giorgi Minimizing Movement Scheme, which we will define later. For fundamental literature on the scheme see [Ambrosio, Chapter 3]. It serves as a discrete approximation of the flow and has been used by several authors to construct gradient flows. Remarkable is an important application to optimal transport, the so-called JKO-scheme, see [JKO]. Moreover it has already been applied to the elastic flow without obstacles, see [Pozzi].
The article is organized as follows: In Chapter 2 we clarify what we understand by an Obstacle Gradient Flow in a Hilbert Space, show first properties of the defined flow and explain why the definition is consistent with the notion of a steepest energy descent flow in a metric space. Furthermore, we will discuss how the structure of an obstacle problem can be understood in a Hilbert Space which is not necessarily a space of functions. In Chapter 3 we examine a condition that is sufficient for the convergence of the De Giorgi Minimizing Movement Scheme to an Obstacle Gradient Flow that exists for all positive times. In Chapter 4 we find a class of higher order energies for which the aforementioned condition is satisfied and examine space and time regularity of the flow. The Elastic Energy defined in (1.1) is a member of the considered class. Chapter 5 deals with the elastic flow only and uses identities for higher derivatives from Chapter 4 to study long time behavior and asymptotics of the Obstacle Gradient Flow. The main result in Chapter 5 identifies two possible asymptotic behaviors, both of which may occur as we show in the end of the article. Fortunately, one of the two possible behaviors is convergence to a ’critical point’, i.e. a solution of the variational inequality.
2. The Notion of Obstacle Gradient Flows
In the following, denotes a real Hilbert Space with scalar product and norm . For a Frechét differentiable map and , or just denotes the Gradient of , i.e. the unique element such that for all .
2.1. Definition and First Properties
Assumption 1** (Assumptions on the Energy).**
We assume that is weakly lower semicontinuous and bounded from below by some . Furthermore, we assume that
[TABLE]
Assumption 2** (Gradient Growth Condition).**
Another condition we will sometimes impose is that there is nondecreasing and continuous such that for each
[TABLE]
Definition 2.1** (Obstacle Gradient Flow).**
Let be a real Hilbert space and be a closed convex set. Suppose that satisfies Assumption 1. A curve in is called Obstacle Gradient Flow with initial datum if it satisfies
- (1)
(Initial Datum) . 2. (2)
(Regularity) for each , for every . 3. (3)
(Flow Variational Inequality) It holds for almost every that
[TABLE]
Remark 2.2*.*
In the following, we need some more assumptions on to prove existence of the flow. These will be discussed in Section 3.
Remark 2.3*.*
Requiring that for every is only meaningful if we take the -representative of , which we will always do unless otherwise specified.
Remark 2.4*.*
From this point we will refer to the Flow Variational Inequality with as an abbreviation. Because of the requirement, our definition of the Obstacle Gradient Flow is slightly stronger than the definition of a weak solution in [Okabe1, Definition 1.1].
Proposition 2.5** (Energy Dissipation).**
Assume Assumption 1. Let be an Obstacle Gradient Flow. Then is noncreasing and lies in . Furthermore and
[TABLE]
Proof.
Recall from [Cazenave, Theorem 1.4.35] that is almost everywhere Frechét differentiable. Fix be such that is Frechét differentiable at and holds at . Note that is Bochner measurable as a continuous function. It is also bounded by Assumption 1. One computes using [Arendt, Proposition 1.1.6]
[TABLE]
Using that
[TABLE]
in we find
[TABLE]
Let be arbitrary. Use from Definition 2.1 and plug in to find
[TABLE]
Recall also that was chosen such that is Frechét differentiable at . If , dividing by and letting yields
[TABLE]
The same procedure as implies
[TABLE]
We obtain together with (2.2)
[TABLE]
This however does not prove that is nonincreasing, since the fundamental theorem of calculus holds true iff is locally absolutely continuous. To show this, we apply [Ambrosio, Remark 1.1.3] and verify [Ambrosio, Definition 1.1.1]. Fix . Since is continuous, the set is compact. Since is locally Lipschitz, it is Lipschitz on . Let denote the Lipschitz constant. Now for
[TABLE]
which proves that in the sense of [Ambrosio, Definition 1.1.1]. Hence the monotonicity. We can use the fundamental theorem of calculus to obtain
[TABLE]
Letting and using the monotone convergence theorem proves that . The claim follows. ∎
Corollary 2.6** (Control of the Time Derivative).**
Assume Assumption 1. Let be an Obstacle Gradient Flow. Then for almost every .
Proof.
Adopting the notation from the previous proposition and using (2.2) we obtain for a.e.
[TABLE]
Proposition 2.7** (Global Hölder Continuity and Growth).**
Let and assume Assumption 1. Then
[TABLE]
In particular, for each one has
[TABLE]
Proof.
From (2.1) follows immediately that for
[TABLE]
The rest of the claim follows easily choosing and applying the triangle inequality. ∎
Proposition 2.8** (Uniqueness and Continuous Dependence).**
Let be arbitrary and assume Assumptions 1 and 2. Suppose , are Obstacle Gradient Flows with initial data ,, respectively. Then
[TABLE]
In particular, if then .
Proof.
Let be such that and are differentiable at and holds. Using and (2.5) we find
[TABLE]
Since this holds true for almost every , we can integrate over and find
[TABLE]
The Gronwall Lemma implies the desired estimate. ∎
Proposition 2.9** (Approximation of Flows).**
Assume Assumptions 1 and 2. Assume further that is a -convergent sequence and is such that in as . Assume that for each , is an Obstacle Gradient Flow with initial value . Then there exists an Obstacle Gradient Flow with initial value and in for all .
Proof.
We show first that for each , defines a Cauchy sequence in . Indeed, Proposition 2.8 implies that
[TABLE]
Therefore there exists such that for each , is the limit of in . Since is closed, we obtain for each . Since uniform convergence implies pointwise convergence we conclude . It remains to show that and holds. For this we use [Marcel, Theorem 2.2]. Fix and . Using (2.1) we get
[TABLE]
Since the bound is independent of we obtain with [Marcel, Theorem 2.2] that . This proves the regularity assertion. For the variational inequality let be such that is differentiable at .
[TABLE]
Observe that since
[TABLE]
We obtain that
[TABLE]
because of continuity of and . Therefore
[TABLE]
Now recall that uniformly on for each and is bounded in , see Proposition 2.7. Since is locally Lipschitz, uniformly in provided that is appropriately small. Passing to the limit in (2.1) we find
[TABLE]
where we used the continuity of the integrand in the last step. We obtain . ∎
Corollary 2.10** (Admissibility and Approximation).**
Under Assumptions 1 and 2, the set
[TABLE]
is a closed subset of .
Proof.
The proof is immediate by Proposition 2.9. ∎
2.2. The HPR-property and generalized Obstacle Problems
In this article we focus on obstacle problems and not just on flows in some convex closed set. There is usually more structure in the admissible set for obstacle problems. In this section, we aim at understanding the obstacle structure geometrically. This will result in an estimate for the gradient along the flow and can be seen as an investigation of sharpness of the inequality in Corollary 2.6.
Definition 2.11** (Half Plane Residuum Property).**
Let be a Hilbert space. A closed, convex set is said to have the Half Plane Residuum Property (for short: HPR-property) if for each and one has . Here denotes the nearest point projection on in .
Proposition 2.12** (Justification of the Name).**
A convex set has the HPR-property if and only if for each
[TABLE]
Proof.
Suppose first that has the HPR-property. Fix . Then, by [Brezis, Theorem 5.2],
[TABLE]
Choosing , which lies in because of the HPR-property, implies (2.7). Now suppose that (2.7) holds and let and be arbitrary. Apply (2.7) with and to find
[TABLE]
since by construction . Here we used in the last step that is Lipschitz continuous with Lipschitz constant , see [Brezis, Proposition 5.3]. Therefore all inequalities have to be equalities. From equality in the Cauchy-Schwarz estimate one can infer that there is such that . Again because of equality in the above estimates one has . We obtain that and hence . Rearranging we obtain that . ∎
Proposition 2.13** (A Gradient Estimate).**
Suppose Assumption 1. Let be an Obstacle Gradient Flow in . Assume that satisfies the HPR-property, see Definition 2.11. Then for each .
Proof.
Note that because of the HPR property. Using this as a test function for in Definition 2.1 and the inequality in [Brezis, Theorem 5.2] we find
[TABLE]
Finally, the claim is shown once one observes
[TABLE]
2.3. The Obstacle Gradient Flow in the Context of Gradient Flows in Metric Spaces
The following Definition is a standard notion for Gradient Flows in Metric Spaces. The notions appear for example in [Santambrogio] and [Guide].
Definition 2.14** (Metric Slopes and Gradient Flows).**
Let be a metric space and be a map. Let be a curve in that is absolutely continuous in the sense of [Ambrosio, Definition 1.1.1]. Then we call for each
[TABLE]
the metric derivative of at . Moreover we define for
[TABLE]
the metric slope of at , where the is taken with respect to convergence in . The curve is called -Gradient Flow for if for each
[TABLE]
Here stands for ‘Energy Dissipation Equation’.
Remark 2.15*.*
The defining equation for an -gradient flow is inspired by an equation that symbolizes the steepest possible energy descent in the setting of a smooth gradient flow in a Hilbert Space, for details see [Santambrogio].
Proposition 2.16** (Metric Quantities for Convex Subsets of ).**
Suppose is convex and closed. Set and let be the distance on that is induced by the norm on . Then the following assertions hold true.
- (1)
If is absolutely continuous on then it is almost everywhere differentiable and
[TABLE] 2. (2)
If then for each we have
[TABLE]
Proof.
We show first. If is absolutely continuous on then it is also absolutely continuous on . By [Cazenave, Theorem 1.4.35], it also lies in and is almost everywhere differentiable. Using (2.8) we find that for each point of differentiability of
[TABLE]
Claim follows. For Claim let be as in the statement and fix . For in (2.10) observe that
[TABLE]
where the last equality follows from the continuity of . Now we show . Fix such that . Then by (2.9)
[TABLE]
Taking the supremum over all such that , the claim follows. ∎
Proposition 2.17** (-Property of the Obstacle Gradient Flow).**
Let be a convex subset of and be an Obstacle Gradient Flow in . Then is an gradient flow in .
Proof.
First, we show that
[TABLE]
For this observe, using Proposition 2.16 and that
[TABLE]
Next, we show that
[TABLE]
Let be a point of Frechét differentiability of . If then the statement is trivial. If not then
[TABLE]
and therefore there exists such that for each . Using Proposition 2.5 and the fact that is decreasing we find
[TABLE]
Equation (2.12) follows immediately. Now we fix and compute using (2.3) and Propositon 2.5
[TABLE]
3. Existence
We will show the existence of Obstacle Gradient Flows, provided that the initial value satisfies a condition which we will formulate and motivate in this section. Throughout this section we assume Assumption 1. Assumption 2 will not be needed for the existence proof.
3.1. Construction of the Flow Trajectory
Proposition 3.1** (Existence of Minimizing Movement Sequences, Proof in Appendix A).**
Let . Define for fixed
[TABLE]
Then there exists such that
[TABLE]
Moreover, each that is a solution of (3.1) satisfies
[TABLE]
Algorithm 3.2**.**
(Minimizing Movement Scheme)
Input: , .
Output: A sequence .
Set .
For
[TABLE]
Remark 3.3*.*
It may happen that minimizers of the variational problems are not unique. In this case, the algorithm fixes some choice of minimizers. Whenever we refer to a minimizing movement sequence from now on, we mean an arbitrary but fixed choice of minimizers unless otherwise specified.
Remark 3.4*.*
To keep notation consistent later when we consider different time stepwidths , one should actually write instead of . We will nevertheless use the other notation for the sake of simplicity.
Remark 3.5*.*
(Discrete Energy Descent)
Note that . More exactly,
[TABLE]
which is easy to see rearranging the inequality .
Definition 3.6** (Interpolations).**
Let and be a minimizing movement sequence generated by Algorithm 3.2. Then we define the energy interpolation of to be
[TABLE]
where denotes the characteristic function of a set . Moreover, we define
[TABLE]
Definition 3.7** (Preconditioned Initial Values).**
We call a preconditioned initial value, if there exists a family of minimizing movement sequences starting at such that for each the set is precompact in . We denote by the set of preconditioned initial values.
Remark 3.8*.*
Of course it is possible that . We will analyze for some special problems in Section 4. A more general statement about would be very desirable, but is at this point out of reach for this article.
Proposition 3.9** (Uniform Hölder Bound).**
Let . Then for each ,
[TABLE]
where is defined as in (3.6).
Proof.
First assume that . Then and hence using (3.3)
[TABLE]
Now assume that there is such that . Using (3.1) we obtain
[TABLE]
Corollary 3.10** (A Growth Rate).**
For each the restrictions of the linear interpolations are locally uniformly bounded, more precisely
[TABLE]
Proof.
Immediate by the triangle inequality and Proposition 3.9 with . ∎
Proposition 3.11** (Rate of Energy Descent).**
Let be a family of sequences generated by Algorithm 3.2. Then for each , there exists a constant such that for all and all with
[TABLE]
Proof.
Define and compute using (3.7)
[TABLE]
The claim follows choosing . ∎
Proposition 3.12** (Limit Trajectories).**
Let be a preconditioned initial value. Then there exists a sequence converging to zero and nonincreasing as well as such that pointwise and for each : in .
Proof.
First fix . Since is nonincreasing for each we can conclude from Helly’s Theorem, see [Ambrosio, Lemma 3.3.3], that there exists a sequence and nonincreasing such that pointwise on . We show the convergence of a subsequence of in using an appropriate version of the Arzelá-Ascoli Theorem, namely [Alt, 4.12, ”Warning” on p.106]. For this, note that boundedness in implies uniform equicontinuity. It remains to show that for each the set is precompact. This however is immediate if we write
[TABLE]
where is chosen such that . Since and lie in a precompact set (as ), one can extract a subsequence such that every summand converges and this gives rise to a convergent subsequence of . Therefore the Arzela-Ascoli Theorem applies and we obtain a further subsequence of which we do not relabel, such that uniformly in for some . It remains to show that but this follows passing to the limit in (3.5). Since was arbitrary we can - using a standard diagonal sequence argument - find a subsequence (again called) such that for each , is uniformly convergent to some and converges pointwise to a nonincreasing function on . Since pointwise limits are unique, we get and . Therefore setting if and if is well-defined and gives the desired functions. ∎
Remark 3.13*.*
Note that is a bounded function since for each one has and the inequality carries over to the pointwise limit . Moreover, (3.7) carries over to the limit, so
[TABLE]
Corollary 3.14** (Limit of Constant Interpolations).**
Let be a limit trajectory and be chosen as in Proposition 3.12. Then the constant interpolations also converge to pointwise in and uniformly on for each .
Proof.
Fix . Assume without loss of generality that for each . For , let be chosen such that . Then by (3.6) and (3.3)
[TABLE]
Therefore . Since was arbitrary, the claim follows. ∎
3.2. Regularity of the limit trajectories
So far, we have shown that the minizing movement schemes approximate a limit trajectory as the stepwidth becomes small. However, it is unclear whether this limit is an Obstacle Gradient Flow. Here we examine the regularity of the limit trajectory and discover that it meets the regularity requirements of the flow. The argument will use difference quotient techniques, which are also available for vector-valued functions. For a detailed overview about these methods see [Marcel].
Lemma 3.15** (Difference Quotients of BV-Functions).**
Let and be open and bounded, . Then there exists a constant such that for each and
[TABLE]
where for and denotes the total variation measure.
Proof.
For let be the standard mollifier supported in . Set
[TABLE]
Observe that in . Since on for we find that that in as . Define and observe that using the constant from [Evans, Theorem 5.8.3 (i)], [EvansGariepy, Example 1, Section 5.1] and Fubini’s Theorem
[TABLE]
since for small enough. Here we used that on . ∎
Proposition 3.16** (-Bounds for the Difference Quotients).**
Let be as in Proposition 3.12. Then for each there is such that for
[TABLE]
Proof.
We only show the claim for . The case is very similar. Let be chosen as in Proposition 3.12. For we define to be the unique natural number such that . Using Fatou’s Lemma, Remark 3.5 and the Cauchy-Schwarz inequality we find
[TABLE]
where we used in the last step that
[TABLE]
The integrand converges pointwise to as , see Proposition 3.12, and is dominated by . So Lebesgue’s Theorem yields
[TABLE]
Now can be extended to a nonincreasing function on by a constant. As a nonincreasing and bounded function, the extended version is of bounded variation and , see [EvansGariepy, Theorem 1 of Section 5.10]. Using Lemma 3.15 with and we find, since ,
[TABLE]
∎
Corollary 3.17** (Sobolev Regularity in Time).**
Let be as in Proposition 3.12 and . Then . In particular, .
Proof.
This follows immediately from [Marcel, Lemma 2.1] and Proposition 3.16. ∎
3.3. Conclusion of the Existence Proof
We have already shown regularity of the limit trajectory of the minimizing movement scheme. What is still missing is the -property, which we will verify immediately using the variational inequalities for the discrete approximations.
Lemma 3.18** (Flow Variational Inequality).**
Let be as in Proposition 3.12. Then satisfies , i.e. for almost every ,
[TABLE]
Proof.
Choose to be a set of measure zero such that for each we have and , chosen as in Proposition 3.12, is continuous in (Recall that nonincreasing functions have at most countably many points of discontinuity and therefore can indeed be chosen to be a null set). Fix and . Let be such that is Lipschitz continuous in , see Assumption 1. Denote the Lipschitz constant on by . Let be such that and be such that for each . Whenever we write in the following, we shall actually mean . We compute for
[TABLE]
We estimate the second summand using Remark 3.5 and that by (3.9) we obtain
[TABLE]
Using the Hölder estimate from Proposition 3.9 and the fact that for each we find
[TABLE]
Letting in this expression, we obtain that
[TABLE]
which goes to zero as since was chosen to be a point of continuity of . Therefore (3.3) simplifies to
[TABLE]
Using the variational inequalities for the minimizing movement elements, see Proposition 3.1, we can compute
[TABLE]
where
[TABLE]
Further, define and
[TABLE]
According to (3.9)
[TABLE]
Using that by (3.6) we obtain with the Lipschitz estimate (see Assumption 1 and definition of at the beginning of the proof)
[TABLE]
We need for the last step, in order to use the Lipschitz continuity from Assumption 1, that for each , . This is ensured by and the choice of in the beginning of the proof. Indeed,
[TABLE]
since for all . Also, for each as defined in the beginning of the proof one has
[TABLE]
where we used the same estimate as in (3.13) in the last step. All in all, for one obtains with (3.3) that for
[TABLE]
and therefore as for each fixed .
The original computation can now be simplified to
[TABLE]
Notice that is a partition of and is Riemann integrable as continuous map, see Proposition 3.12 and Assumption 1. Therefore
[TABLE]
where the last equality holds because of continuity. This proves the claim. ∎
Theorem 3.19** (Existence Result).**
Suppose Assumption 1 and 2. Let be the set of Corollary 2.10 and be the set in Definition 3.7. Then i.e. for each there exists an Obstacle Gradient Flow starting at .
Proof.
Because of Corollary 2.10 it is enough to show that . But this follows from Proposition 3.12, Corollary 3.17 and Lemma 3.18. ∎
Remark 3.20*.*
If one imposes Assumption 1 only one has still . In the section to follow, we will outline a situation where is dense in and Assumption 2 holds true. Then, the previous theorem implies that , a desirable situation.
4. Fourth Order Flows with Obstacles and Navier Boundary Conditions
For this section we fix an obstacle function such that . We are considering gradient flows for the following class of fourth order obstacle problems
Definition 4.1** (The Considered Framework).**
Set with scalar product and Additionally, we suppose that
[TABLE]
for functions that satisfy and .
First, we will check the conditions that are necessary to guarantee existence of the flow and then show further properties. An important property will be that the flow preserves -space regularity and Navier Boundary conditions. The reason why this is so important is that both properties hold for minimizers of the static problem, as a close examination of [Anna, Corollary 3.3] and [Anna, Theorem 5.1] should reveal.
Remark 4.2*.*
The scalar product given in Definition 4.1 is actually a scalar product and is actually a Hilbert Space because of [Sweers, Theorem 2.31].
4.1. Verification of Existence Conditions
Remark 4.3*.*
Notice that is dense in . Indeed, if is arbitrary but fixed then there exists such that in . As an easy computation shows
[TABLE]
defines a sequence in that converges to in .
Proposition 4.4** (Verification of the Assumptions, Proof in Appendix A).**
The energy defined in (4.1) satisfies Assumption 1 and 2 and
[TABLE]
for all .
Proposition 4.5** (Verification of HPR Property).**
The set given in Definition 4.1 is convex, closed and has the HPR property as defined in Definition 2.11.
Proof.
Convexity and closedness are easy to show. We only show the HPR property. We have to show that for and , . We do this by showing that for each . If this is shown implies certainly , which proves the claim. Now let arbitrary but fixed. For each we infer from [Brezis, Theorem 5.2] that Let be arbitrary such that almost everywhere. Choosing we find that and therefore
[TABLE]
Fix be such that a.e.. Then, according to elliptic regularity and the weak maximum principle, there exists such that and a.e. This implies that
[TABLE]
However this results in almost everywhere. The weak maximum principle implies that almost everywhere which proves the claim. ∎
Lemma 4.6** (A Recursion Identity, Proof in Appendix A).**
Suppose that is a sequence such that and there are such that for each . Then
[TABLE]
Proposition 4.7** (Precompactness of the Discrete Trajectories).**
Suppose that and . Let be a family of minimizing movement sequences generated by Algorithm 3.2 for (4.1). Then for each the set is bounded in and therefore precompact in .
Proof.
Fix . Let be such that and . Define
[TABLE]
where denotes the operator norm of the embedding Let be arbitrary. We first claim that on . Indeed, for arbitrary we find using (3.7)
[TABLE]
Since is negative, the claim follows. For the estimate can be shown similarly.
Recall from Propositon 3.1 that implies that
[TABLE]
For the sake of simplicity of notation we define and leave out the integration indicators . Note that for each such that one can use as test function in (3.2). Using this and Proposition 4.4 we find
[TABLE]
Additionally, for each and also for each such that
[TABLE]
Our first claim is that and . For this we proceed by induction over . The first step of the induction is so . For this we observe with (4.4) that for all
[TABLE]
This implies (see [Hestenes, Lemma 13.1]) that is weakly differentiable and there is a constant such that
[TABLE]
Since and as is locally Lipschitz, we obtain by the product rule that and
[TABLE]
We infer from the equation that . From this however, one concludes that and as a result of that, (4.7) yields that . The induction step is now very similar since we can assume that and therefore we generate the same equations for as before for with replaced by . We leave the details to the reader. To show that we proceed again by induction. Here we just show that implies that . For this we conclude just like in (4.5) and (4.6) that
[TABLE]
for some . Now plug some into (4.4) that satisfies and . Integrating by parts in (4.4) we obtain
[TABLE]
Evaluating in the first summand and using (4.8) we obtain
[TABLE]
The last integral evaluates to . Using the induction hypothesis that we find . We can show very similarly that and . Next, we show that . We conclude from (4.4) and (4.3) and [EvansGariepy, Corollary 1, Section 1.8] that there exists a Radon measure on supported on such that for all :
[TABLE]
The measure is finite since is compactly contained in . Using Fubini’s Theorem, we find for
[TABLE]
Therefore
[TABLE]
From here we can proceed like in (4.5) and (4.6). Define and observe, according to (4.1), that there is such that
[TABLE]
Using the product rule again we obtain that and
[TABLE]
and rearrranged
[TABLE]
Note that this already implies that since implies that and given this information, we conclude from (4.16) that .
We claim that there is independent of such that To show this, choose a fixed such that and on . Set and , where - recall - is the operator norm of the embedding operator . Also define for given . We can estimate using Remark 3.5 and Corollary 3.10
[TABLE]
Note that where is the constant from Proposition 3.11. All in All we obtain independent of such that as claimed.
We continue showing that is bounded independently of . We first prove an estimate for , defined as in (4.14). For this observe that, using and (4.16),
[TABLE]
Notice that and therefore
[TABLE]
Hence
[TABLE]
Now observe that since
[TABLE]
All in all we get the crucial estimate for :
[TABLE]
where , are constants only depending on but independent of . Taking absolute values and integrating in , then using the derived estimate for we obtain that
[TABLE]
for some independent of . If we set we obtain the recursive inequality
[TABLE]
This given, Lemma 4.6 shows that
[TABLE]
We observe that and therefore
[TABLE]
since is bounded from above by for all . Hence and since for each we have
[TABLE]
Uniform Boundedness of independent of implies also uniform boundedness of independent of , see (4.1). Together with we obtain uniform boundedness of independent of . Using all these uniform bounds in (4.16) we obtain that there exists some independent of such that
[TABLE]
If we understand this again as a recursion formula (recall and was arbitrary), we obtain that for each such that
[TABLE]
The claim follows. ∎
Remark 4.8*.*
The proof of Proposition 4.7 reveals that for as in the statement of the Proposition we have that for each , and . This property is noteworthy and also carries over to the Obstacle Gradient Flow, as discussed in Theorem 4.10.
Remark 4.9*.*
If we omit the assumption , the argument of the previous proof can not be repeated. The reason for that is that (4.10) shows that the second derivatives at the boundary are not necessarily maintained and this might generate contributuions to the term in (4.17) which are not necessarily elements of . This however was crucial for the proof.
4.2. Some Qualitative Properties
Theorem 4.10** (Existence, Space Regularity and Navier Boundary Conditions).**
Let be as in Definition 4.1. Then for each such that there exists an Obstacle Gradient Flow starting at . Additionally, for every , and . Furthermore, for almost every . Moreover, for each
[TABLE]
Proof.
The existence follows from Proposition 4.4, Proposition 4.7 and Theorem 3.19. Fix . By Corollary 3.14 there exists such that in . Because of the boundedness of in , see Proposition 4.7, we can extract a subsequence such that in . From this follows the -regularity of . Since by Proposition 4.7 and the norm is weakly lower semicontinuous we find that . Because of the compact embedding and Remark 4.8 we obtain that
[TABLE]
Analogously one shows that . Now fix such that in Definition 2.1 holds true. The and [EvansGariepy, Corollary 1, Section 1.8] imply that there is a Radon measure supported on such that for all
[TABLE]
Since is compactly contained in (as and ), we obtain that is finite and therefore, we can derive like in (4.12) that there is such that for all
[TABLE]
Proceeding similar to (4.14), (4.15) and (4.16) one can derive that
[TABLE]
and
[TABLE]
Since we find from (4.22) that . To bound it remains to bound . For this, one observes using the fact that for each and Corollary 2.6
[TABLE]
where , see (2.5). Now let be such that . Then the flow variational inequality implies that
[TABLE]
for all such that . Similar to (4.5), (4.6) and (4.1) one can derive that
[TABLE]
and therefore using (4.21) one finds that . Similarly one can compute , which finishes the proof. ∎
Remark 4.11*.*
For the time-independent problem, [Anna, Theorem 5.1] shows -regularity of each solution of the time independent variational inequality. For the discrete trajectories, we have also shown -regularity and boundedness independent of the stepwidth , see (4.20). Since is not reflexive, the regularity does not immediately carry over to the limit. However note that and for all , see [Heinonen, Theorem 6.12 and Exercise 6.14] for and are immediate using the fundamental theorem of calculus. Now fix and . Then, according to the proof of Theorem 4.10, there is a sequence such that in . Now observe that for arbitrary but fixed , since embeds compactly in
[TABLE]
and the supremum in the last step is finite because of (4.20). Therefore for each .
Later we will be interested in asymptotic behavior of solutions. For this it is vital to obtain estimates for the third derivative uniformly in time. The rest of this section will be dedicated to such estimates.
Proposition 4.12** (Measurability in Time).**
Suppose that is such that . Let be the Obstacle Gradient Flow with initial datum . Let be arbitrary. Then and are Bochner measurable maps. Moreover
[TABLE]
is measurable with respect to the product Lebesgue measure on . In particular, there is a set of measure zero such that for each , is measurable. Analogous statements hold for .
Proof.
For the Bochner measurability, we use the Pettis measurability Theorem, see [Yosida, Section V.4]. The map is separably valued since is separable. We claim that it is weakly measurable, i.e. for each
[TABLE]
is Lebesgue measurable. For this we assume first that . In this case
[TABLE]
which is measurable in as a continuous function in . For arbitrary there is such that in . An easy computation shows that
[TABLE]
pointwise in . The claim follows since pointwise limits of measurable functions are measurable. Hence Pettis measurability Theorem applies and Bochner measurability follows. The fact that is also product measurable follows from the fact that and are isomorphic, see [Arendt, bottom of p.14]. The rest of the claim follows using Fubini’s Theorem. For everything is analogous except for the weak measurability, on which we will elaborate shortly. Observe that for we find
[TABLE]
This however is the weak derivative of and as such measurable. For arbitrary an approximation argument similar to (4.24) applies. ∎
Remark 4.13*.*
Definition 2.1, Theorem 4.10 and Proposition 4.12 together imply that the constructed Obstacle Gradient Flow lies in for each which embeds compactly in because of the Aubin-Lions-Simon Lemma, see [Simon, Corollary 5]. Because of Remark 4.11, we also have that for each . Since the norms on and coincide on , we obtain that for each , i.e. .
Corollary 4.14** (Regularity in Space-Time).**
Let be such that . Then there is a set of Lebesgue measure zero such that for each and , is weakly differentiable on and for almost every .
Proof.
First fix . Let and define
[TABLE]
We show that is weakly differentiable in with derivative
[TABLE]
Indeed, fix . Using Fubini’s Theorem - which is applicable since - we find
[TABLE]
Observe that by the Riesz-Frechét theorem for each there is such that for each . Therefore
[TABLE]
We conclude using Fubini’s Theorem again
[TABLE]
The intermediate claim follows. Now let be a sequence of standard mollifiers. We claim that
[TABLE]
and
[TABLE]
From this follows by [EvansGariepy, Section 1.3, Theorem 5] that there is a subsequence such that for almost every
[TABLE]
and
[TABLE]
Once this is shown, we can infer that there exists a null set such that for , is convergent in and the limit coincides with . Moreover, the weak derivative of the limit corresponds to the -limits of , i.e. for almost every . Choosing we find that the claim is really shown once (4.26) and (4.27) are verified. To verify we use Fubini-Tonelli’s Theorem:
[TABLE]
Since is an -function and is a sequence of standard mollifiers, the integrand goes to zero pointwise as . Note also that the integrand is uniformly bounded in since for each we can estimate, using [Evans, Proof of Theorem 6, Appendix C],
[TABLE]
since by Proposition 4.7. By the dominated convergence theorem, we conclude that the expression in (4.2) tends to zero as . Finally, (4.27) can be verified with similar techniques applying the formula for found in (4.2). ∎
Proposition 4.15** (Regularity of the Gradient and Dynamics in ).**
Let be such that . Let be the Obstacle Gradient Flow with initial data . Then
[TABLE]
and for almost every there exists a finite Radon measure on such that for all
[TABLE]
Additionally, for each there exists a null set such that for each
[TABLE]
Proof.
Let be such that holds. First one can infer from the and [EvansGariepy, Corollary 1, Section 1.8] that there exists a Radon measure supported on on such that for all
[TABLE]
Notice that is finite since and and therefore is compactly contained in because of continuity of . Hence we can derive like in (4.12) that there is such that for all
[TABLE]
more explicitly
[TABLE]
Integrating by parts (which is justified by Proposition 4.7) we obtain for all
[TABLE]
This implies, see [Hestenes, Lemma 13.1] that and
[TABLE]
for some . Because of continuity there exists such that on . Therefore, one has on . The implies that for each such that
[TABLE]
Integrating by parts and using that one finds that
[TABLE]
We infer that . Similarly one proves that . Using this and integrating over (4.31) one obtains
[TABLE]
This proves (4.29). Integrating by parts in (4.30) one finds that for all
[TABLE]
By density, the same formula holds true for . If we fix then we can use integration by parts again in (4.32) and obtain with that
[TABLE]
as claimed in the statement. ∎
5. Application: Elastic Flow with obstacle constraint
In this section we examine long-time behavior of the gradient flow of the elastic energy given in (1.1) in the same framework as in Definition 4.1. To do so, we will need to assume slightly stronger conditions on the obstacle, namely that it is in neighborhoods of [math] and . The main theorem predicts two possible behaviors for the flow for large times: Either one has convergence to a critical point in the sense of a solution of the time-independent variational inequality or one has blow-up of the -norm of the first derivative. If the obstacle is too large the second case can actually occur, as we will show.
5.1. Classification of the Asymptotic Behavior
Remark 5.1*.*
The elastic energy, which will be denoted by in this section, is one of the energies studied in Section 4, see Definition 4.1 with
[TABLE]
Clearly, and satisfy the assumptions in Definition 4.1 and therefore we can use the results of Section 4. Recall in particular that and are given by Definition 4.1.
Proposition 5.2** (Gradient Formula and Estimate).**
For each one has
[TABLE]
In particular,
[TABLE]
where denotes the operator norm of the embedding .
Proof.
The formula for the gradient (5.2) can be shown by a very easy computation, see [Anna, Equation 1.5]. Using for each we find
[TABLE]
Estimating by and using one obtains the claim. ∎
Proposition 5.3** (Evolution of Third Derivatives).**
Let be as in Definition 4.1 and be given by (1.1). Let be such that and let be the Obstacle Gradient Flow for starting at . Then
[TABLE]
for almost every .
Proof.
If and is fixed such that one can integrate by parts in (5.2)
[TABLE]
Therefore, for each there exists some
[TABLE]
Now note that for almost every and for such one has
[TABLE]
Integrating and using that one obtains
[TABLE]
and (5.4) follows. ∎
Lemma 5.4** (A linear ODE of weakly differentiable functions, Proof in Appendix A).**
Suppose that and , are such that
[TABLE]
Then
[TABLE]
Proposition 5.5** (Global -estimates).**
Let be such that and be an Obstacle Gradient Flow for with inital datum . Assume further that there is such that for all , . Then there is such that
[TABLE]
Proof.
Adopting the notation from Proposition 4.15 we define for
[TABLE]
Fix . ** We show that for each , and **. For this we have to show Lebesgue measurability and boundedness. For the measurability observe that for each
[TABLE]
is measurable. Note that this map is only defined for almost every , but this does not affect the measurability claim as null sets are Lebesgue measurable. Indeed,
[TABLE]
is measurable in as is Bochner measurable and hence also weakly measurable. The second summand is continuous and therefore also measurable. Now fix and choose such that in . Here we use the convention that intervals are by definition empty if the lower bound exceeds the upper bound. Since
[TABLE]
and so is measurable as pointwise limit of measurable functions. It remains to show that
[TABLE]
is measurable. But this follows from being monotone for each and therefore Riemann integrable. Hence
[TABLE]
and therefore it is measurable in as pointwise limit of linear combinations of measurable functions. We continue showing that this map is essentially uniformly bounded in . For this fix such that on . Then using Corollary 2.6 and (5.3) we obtain
[TABLE]
We conclude that defines an function and an upper bound for the norms can be chosen independently of . The intermediate claim follows. Let be the null set of Corollary 4.14. Define for and
[TABLE]
Estimating in the numerator one obtains that . Now we compute using the definition of , Fubini’s Theorem (which can easily be justified) and (4.29) as well as (5.4)
[TABLE]
Define for
[TABLE]
Then
[TABLE]
One infers that and satisfies a differential equation like (5.5) with
[TABLE]
Now observe that for
[TABLE]
where is given in (5.1). Furthermore,
[TABLE]
Using Lemma 5.4, one finds that
[TABLE]
and therefore, using and (5.8), (5.1) one has
[TABLE]
Observe that for each and
[TABLE]
and because of continuity of the integrand
[TABLE]
For the following we define Now the Lebesgue differentiation theorem and the dominated convergence theorem imply that for almost every
[TABLE]
Integrating over and using Fubini’s Theorem we obtain
[TABLE]
Estimating and we obtain
[TABLE]
Therefore, we have bounded in terms of . Since we find
[TABLE]
Using this we can go back to (5.1) and find for almost every
[TABLE]
for some . The claim follows. ∎
Remark 5.6*.*
The measurability discussion in (5.6) was really necessary the way it is presented in this article, see [Aliprantis, Discussion below Theorem 4.48] for details.
Remark 5.7*.*
The -estimate for the third derivative holds only true provided that the contact set does not come arbitrarily close to [math] or . For the elastic energy, one finds mild conditions on the obstacle which ensure exactly that, as we will discuss in the next two propositions.
Proposition 5.8** (A Standard Estimate for the Elastic Energy).**
Let be arbitrary and let be the function defined in (5.1). Then
[TABLE]
Proof.
Suppose that is such that . Observe that
[TABLE]
the claim follows easily using the Cauchy Schwarz inequality and the fundamental theorem of calculus. ∎
Remark 5.9*.*
For the rest of the article we define
[TABLE]
where is given in (5.1). For the study of the time-independent problem, is an important constant since see [Anna, Lemma 2.4]. Note also that is a diffeomorphism.
Proposition 5.10** (Trapping the Contact Set).**
Suppose that is such that and there is such that . Let be such that and let be the Obstacle Gradient Flow starting at . Then there is such that for each .
Proof.
Suppose that there is a sequence and such that . Without loss of generality, one can assume that for each . Note that since attains its global minimum at , we obtain for each . Further, let be defined as in (5.1). Observe that then
[TABLE]
Since , we find that
[TABLE]
and thus by continuity of ,,
[TABLE]
Monotonicity of and implies
[TABLE]
which implies that
[TABLE]
because of monotonicity and continuity of in a neighborhood for a sufficiently small . Now observe that
[TABLE]
a contradiction since . Therefore there exists such that for each , for each . Similarly one can show that there exists such that for each . The claim follows choosing . ∎
Theorem 5.11** (Subconvergence Behavior of the Elastic Flow).**
Let be such that and there is such that . Further, let be such that . Let be the Obstacle Gradient Flow for the elastic energy with initial data . Then one of the following is true:
- (1)
(Vertical parts at ) There is a sequence such that
[TABLE] 2. (2)
(Subconvergence to a critical point) There is a sequence and such that in and
[TABLE]
Proof.
Suppose that does not hold true. Then is bounded. Because of (2.1), and hence there is a sequence such that . Moreover can be chosen such that and the estimate in Proposition 5.5 hold true, since these hold almost everywhere. From Proposition 5.5 can be inferred that is bounded. Since for all , see Theorem 4.10, we find that is bounded. Therefore there exists a subsequence of which we do not relabel such that has a weak limit in . Let denote this weak limit. Since is convex and closed in , we find that . The compact embedding shows also that in . We show finally that is also a critical point of the functional. Indeed, let be arbitrary but fixed. Then
[TABLE]
Remark 5.12*.*
This behavior is consistent with the behavior of the static problem, see [Mueller] and [Anna]. Here it is shown that minimizers exist either as -graphs or in a slightly larger class, roughly speaking, the class of graphs that may have vertical parts at the boundary.
5.2. Examples for all possible asymptotics
The rest of this article will be dedicated to the question whether case in Theorem 5.11 really occurs and whether there are conditions that ensure that case occurs. As [Anna] points out, the minimization problem does not possess a solution in the class of symmetric functions for large obstacles.
Proposition 5.13** (Symmetry of the Gradient).**
Let . Then .
Proof.
Fix and let be arbitrary. Observe that
[TABLE]
One can take the derivative of both sides with respect to and evaluate at to find that Writing the right hand side as an integral and using the substitution rule, one obtains
[TABLE]
Therefore and the claim follows. ∎
Lemma 5.14** (Symmetry Preservation).**
Suppose that is a symmetric obstacle, i.e. for all . Let be such that and for all . Let be an Obstacle Gradient Flow. Then for all .
Proof.
We show that is also an Obstacle Gradient Flow with intital datum . Equality follows then from the uniqueness result in Proposition 2.8. We check the conditions required in Definition 2.1. Condition follows from the symmetry of . For condition observe that for fixed one has because of symmetry of . Therefore for all . It is straightforward to check that with weak time derivative coinciding with almost everywhere. To verify we check . Let be arbitrary and be such that holds. Using the substitution rule and Proposition 5.13
[TABLE]
since because of symmetry of . The claim follows. ∎
Remark 5.15*.*
The observation that symmetry is preserved by the flow is of special interest in the context of higher order variational problems, where symmetry of minimizers is often difficult to obtain. This is due to the lack of a maximum principle.
Corollary 5.16** (A Condition Ensuring Subconvergence).**
Suppose that for some and . Let satisfy and be symmetric with Then the Obstacle Gradient Flow starting at subconverges, that is case in Theorem 5.11 applies.
Proof.
To show that case in Theorem 5.11 applies, we exclude case . Let be the Obstacle Gradient Flow with initial datum . Fix . Then using (5.12) with we obtain
[TABLE]
Since according to Lemma 5.14 we find that and hence Since is an odd function, one has
[TABLE]
In particular, since is monotone and is a diffeomorphism, see Remark 5.9, we find
[TABLE]
Since we find
[TABLE]
which excludes case in Theorem 5.11. ∎
Remark 5.17*.*
Of course it could happen that a symmetric function like in Corollary 5.16 does not exist. The following Lemma is to convince the reader that for small obstacles, such exists. The appropriate smallness condition is the same as in [Anna, Lemma 4.2]. For the condition, an important comparision function is needed:
[TABLE]
For details on those see [Djondjorov] and [Deckelnick]. The reason why is so important is that is a graph reparametrization of one of Euler’s free elastica, i.e. the critical points of (1.2). In the latter article, symmetric critical points of (1.2) that possess a graph reparametrization are investigated. The authors show that all symmetric critical graphs are given by a family that approximates from below, see Figure 1. In particular, no symmetric critical graph can be found above .
Lemma 5.18** (Existence of Symmetric Graphs with Small Energy).**
Suppose that is symmetric. Let
[TABLE]
Then
[TABLE]
If additionally for each , where is given in Remark 5.17, then there exists such that .
Proof.
The proof uses ideas from [Anna, Lemma 2.4] and [Deckelnick, Lemma 4] with just slight modifications. We start with the last part of the claim. To this, suppose that . Note that according to [Anna, Lemma 2.3], is the uniform limit of a family of symmetric functions that is increasing in and satisfies Because of continuity of and as well as uniform convergence of there exists and such that for each . Now take symmetric such that in . For , let denote the unique (and symmetric) solution of
[TABLE]
Then since by elliptic regularity . Now by definition of the norm in one has and hence in as . Since embeds into the convergence is also uniform and therefore there exists such that for each , because of the choice of . Observe that Therefore there exists also some stuch that for each . The claim follows taking , which is and satisfies as the second derivative of is compactly supported. It follows that which proves the last part of the claim. To show (5.14) one can use a similar approximation of the functions given in [Anna, Equation (2.10)] which exceed any obstacle for small enough and satisfy . ∎
In the rest of the article we construct a special class of (large) obstacles for the flow can not subconverge.
Definition 5.19** (Cone Obstacle).**
Let and . Define
[TABLE]
Remark 5.20*.*
For , all the assumptions of Theorem 5.11 are satisfied with
Lemma 5.21** (Energy and Contact Set).**
Let for some , and let be symmetric and such that almost everywhere. If there is such that , then
[TABLE]
Proof.
Note that and symmetry of imply that . Therefore one can assume without loss of generality that . We distinguish two cases, namely or . If one obtains using (5.12) with and that
[TABLE]
Also note that and which is due to the fact that is in a neighborhood of and attains its global minimum at . Hence the claim in this case. Now suppose that . Then . Note that and since there has to be such that . Because of the intermediate value theorem there exists such that . Hence and . Using this and the Cauchy Schwarz inequality like in the proof of Proposition 5.8 we find
[TABLE]
Corollary 5.22** (Non-Subconverging Solutions).**
Suppose that with
[TABLE]
where denotes the hypergeometric function in [Andrews, Definition 2.1.5]. Let be symmetric such that and . Then there is no symmetric such that , , and
[TABLE]
In particular, for the Obstacle Gradient Flow with initial data , case (2) in Theorem 5.11 is excluded.
Remark 5.23*.*
Note that as in the statement of Corollary 5.22 actually exists because of (5.14).
Proof of Corollary 5.22.
Notice that the supremum on the right hand side of (5.16) is finite by [Mueller, Proof of Theorem 1.1, Lemma C.6]. Let be as in the statement and . Further, we denote . Note that
[TABLE]
and assume for a contradiction that there exists symmetric such that , , and for each . We distinguish cases analyzing the coincidence set . If then one obtains from (5.17) with the techniques of [Stampacchia, Theorem 6.9 Section 2] that . In this case, [Deckelnick, Lemma 4] implies that there exists
[TABLE]
for some . Given this, [Deckelnick, Corollary 3] and (5.18) imply that
[TABLE]
a contradiction to . Now suppose that contains some point . Then because of (5.15) and one has
[TABLE]
which is a contradiction to . The only possibility that remains is From here we proceed similar to [Mueller, Lemma 3.3, Proof of Theorem 1.5]. We first show that there is such that
[TABLE]
[TABLE]
where Indeed, for and small enough we have . Therefore
[TABLE]
Using , and almost everywhere we obtain
[TABLE]
Hence there is such that
[TABLE]
Equation (5.20) follows by symmetry of . If now then on , and since , we have . As a result is a line, which is a contradiction to the fact that . Therefore . We show next that . Indeed, and imply
[TABLE]
and hence using the definition of ,
[TABLE]
Integrating once we find that
[TABLE]
Hence is either increasing or decreasing in depending on the sign of . If is increasing then for each which implies that is decreasing in . But this makes impossible. A contradiction. Hence is decerasing and therefore is concave on . In particular and together with (5.21), . Equation (5.21) reveals moreover that on . By symmetry, on , so is strictly concave on . Once this is shown, one can compute exactly like in [Mueller, Lemma 3.3, Theorem 1.1] that
[TABLE]
We sketch the arguments for the sake of convenience of the reader. Multiplying by we obtain
[TABLE]
Integrating we obtain that
[TABLE]
and therefore, since is strictly decreasing and on the only possible sign option is
[TABLE]
In particular, dividing by and integrating one obtains
[TABLE]
Since by symmetry one has
[TABLE]
Define for . Then is increasing and has a inverse that satisfies according to (5.22). Moreover, and . Hence
[TABLE]
Using (5.23), and one has
[TABLE]
Using [Mueller, Lemma C.5] and (5.18) we find
[TABLE]
and one obtains a contradiction again. The claim follows. ∎
Remark 5.24*.*
A computer assisted calculation for the expression in (5.18) shows that
[TABLE]
Then the quantity in (5.18) coincides with , which is also the highest value a symmetric critical graph curve of (1.2) can attain, see Remark 5.17. This can be seen as a sharpness result for Corollary 5.16 in the following sense: If then the flow subconverges for symmetric initial data with small energy. On the contrary, (5.18) implies that we can find examples of obstacles that exceed ’only by a little’ with the property that the flow starting at symmetric initial data of small energy cannot subconverge.
Appendix A Technical Proofs
Proof of Proposition 3.1.
Let be a minimizing sequence for . Note that then
[TABLE]
which implies that is bounded. Therefore possesses a weakly convergent subsequence which we call again for the sake of simplicity. Let denote its weak limit. Since is weakly closed we infer that . Since is weakly lower semicontinuous as the sum of two weakly lower semicontinous functionals (see Assumption 1 and [Brezis, Proposition 3.5(iii)]), we obtain
[TABLE]
Equation (3.2) follows after an easy computation from the inequality
[TABLE]
Proof of Proposition 4.4.
The Frechét differentiability and the formula for the Frechét derivative follows after a straightforward computation from
[TABLE]
We continue verifying Assumption 1 and 2. The energy is clearly bounded from below by [math]. To show weak lower semicontinuity, suppose that in . Then uniformly on . This implies that there is such that for each . Hence
[TABLE]
Thus, since the convergence is uniform
[TABLE]
Additionally,
[TABLE]
The lower semicontinuity follows. We proceed verifying Assumption 2 and the rest follows immediately. Let . Denote by the operator norm of the embedding operator . Also define .
[TABLE]
Note that for a.e
[TABLE]
and
[TABLE]
Therefore
[TABLE]
Estimating all norms with one obtains the claim with
[TABLE]
∎
Proof of Lemma 4.6.
We prove the claim by induction over . The case is clear. Suppose now the claim is true for each . We prove that it is also true for .
[TABLE]
Proof of Lemma 5.4.
The product rule for Sobolev functions, see [EvansGariepy, Theorem 4 in Section 4.2.2] implies that
[TABLE]
is weakly differentiable with weak derivative
[TABLE]
Therefore and hence
[TABLE]
The claim follows together with (A.1). ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[10]
- 3[12]
- 4[14]
- 5author= Müller, Marius, title = An obstacle problem for elastic curves: existence results, journal = preprint date= 2018 eprint= ar Xiv:1812.03095
- 6[26]
- 7[28]
- 8[32]
