Lectures on curvature flow of networks
Carlo MAntegazza, Matteo Novaga, Alessandra Pluda

TL;DR
This paper reviews the evolution of planar networks under curvature flow, focusing on the existence of solutions and the analysis of singularities in the process.
Contribution
It provides a comprehensive collection of results on curvature flow of networks, emphasizing existence and singularity analysis.
Findings
Existence of solutions for curvature flow of networks
Characterization of singularities in the evolution
Analytical techniques for curvature flow problems
Abstract
We present a collection of results on the evolution by curvature of networks of planar curves. We discuss in particular the existence of a solution and the analysis of singularities.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Geometric Analysis and Curvature Flows · Geometric and Algebraic Topology
Lectures on curvature flow of networks
Carlo Mantegazza 111Dipartimento di Matematica e Applicazioni, Università di Napoli Federico II, Via Cintia, Monte S. Angelo 80126 Napoli, Italy
Matteo Novaga 222Dipartimento di Matematica, Università di Pisa, Largo Bruno Pontecorvo 5, 56127 Pisa, Italy
Alessandra Pluda22footnotemark: 2
Abstract
We present a collection of results on the evolution by curvature of networks of planar curves. We discuss in particular the existence of a solution and the analysis of singularities.
1 Introduction
These notes have been prepared for a course given by the second author within the IndAM Intensive Period Contemporary Research in elliptic PDEs and related topics, organized by Serena Dipierro at the University of Bari from April to June 2017. We warmly thank the organizer for the invitation, the IndAM for the support, and the Department of Mathematics of the University of Bari for the kind hospitality.
The aim of this work is to provide an overview on the motion by curvature of a network of curves in the plane. This evolution problem attracted the attention of several researchers in recent years, see for instance [10, 11, 24, 23, 20, 9, 13, 31, 33, 29, 36, 38, 44]. We refer to the extended survey [32] for a motivation and a detailed analysis of this problem.
This geometric flow can be regarded as the -gradient flow of the length functional, which is the sum of the lengths of all the curves of the network (see [10]). From the energetic point of view it is then natural to expect that configurations with multi–points of order greater than three or –points with angles different from degrees, being unstable for the length functional, should be present only at a discrete set of times, during the flow. Therefore, we shall restrict our analysis to networks whose junctions are composed by exactly three curves, meeting at 120 degrees. This is the so-called Herring condition, and we call regular the networks satisfying this condition at each junction.
The existence problem for the curvature flow of a regular network with only one triple junctions was first considered by L. Bronsard and F. Reitich in [11], where they proved the local existence of the flow, and by D. Kinderlehrer and C. Liu in [24], who showed the global existence and convergence of a smooth solution if the initial network is sufficiently close to a minimal configuration (Steiner tree).
We point out that the class of regular networks is not preserved by the flow, since two (or more) triple junctions might collide during the evolution, creating a multiple junction composed by more than three curves. It is then natural to ask what is the subsequent evolution of the network. A possibility is restarting the evolution at the collision time with a different set of curves, describing a non–regular network, with multi–points of order higher than three. A suitable short time existence result has been worked out by T. Ilmanen, A. Neves and F. Schulze in [23], where it is shown that there exists a flow of networks which becomes immediately regular for positive times.
These notes are organizes as follows: In Section 2 we introduce the notion of regular network and the geometric evolution problem we are interested in. In Section 3 we recall the short time existence and uniqueness result by Bronsard and Reitich, and we sketch its proof. We also show that the embeddedness of the network is preserved by the evolution (till the maximal time of smooth existence). In Section 4 we describe some special solution which evolve self-similarly. More precisely, we discuss translating, rotating and homotetically shrinking solutions. The latter ones are particularly important for our analysis since they describe the blow-up limit of the flow near a singularity point. In Section 5 we derive the evolution equation for the -norm of the curvature and of its derivatives. As a consequence, we show that, at a singular point, either the curvature blows-up or there is a collision of triple junctions. Finally, in Section 6 we recall Huisken’s Monotonicity Formula for mean curvature flow, which holds also for the evolution of a network, and we introduce the rescaling procedures used to get blow–up limits at the maximal time of smooth existence, in order to describe the singularities of the flow. In particular, we show that the limits of the rescaled networks are self-similar shrinking solutions of the flow, possibly with multiplicity greater than one, and we identify all the possible limits under the assumption that the length of each curve of the network is uniformly bounded from below.
2 Notation and setting of the problem
2.1 Curves and networks
Given an interval , we consider planar curves .
The interval can be both bounded and unbounded depending whether one wants to parametrize a bounded or an unbounded curve. In the first case we restrict to consider .
By curve we mean both image of the curve in and parametrization of the curve, we will be more specific only when the meaning cannot be got by the context.
- •
A curve is of class if it admits a parametrization of class .
- •
A curve, is regular if it admits a regular parametrization, namely for every .
- •
It is then well defined its unit tangent vector .
- •
We define its unit normal vector as , where is the anticlockwise rotation centred in the origin of of angle .
- •
The arclength parameter of a curve is given by
[TABLE]
We use the letter to indicate the arclength parameter and the letter for any other parameter. Notice that .
- •
If the curve is and regular, we define the curvature and the curvature vector . We get:
[TABLE]
As we are in we remind that .
- •
The length of a curve is given by
[TABLE]
A curve is injective if for every we have .
A curve of class is closed if and if has a –periodic extension to (Figure 1).
In what follows we will consider time–dependent families of curves . We let be the unit tangent vector to the curve, the unit normal vector and its curvature vector as previously defined.
We denote with , and the derivatives of a function along a curve with respect to the variable, the arclength parameter on such curve and the time, respectively. Moreover , , are the higher order partial derivatives, possibly denoted also by , and .
We adopt the following convention for integrals:
[TABLE]
as the arclength measure is given by on every curve .
Let now be a smooth, convex, open set in .
Definition 2.1**.**
A network in is a connected set described by a finite family of regular curves contained in such that
the interior of every curve is injective, a curve can self–intersect only at its end–points; 2. 2.
two different curves can intersect each other only at their end–points; 3. 3.
a curve is allowed to meet only at its end–points; 4. 4.
if an end–point of a curve coincide with , then no other end–point of any curve can coincide with .
The curves of a network can meet at multi–points in , labeled by . We call end–points of the network, the vertices (of order one) .
Condition 4 keeps things simpler implying that multi–points can be only inside , not on the boundary.
We say that a network is of class with if all its curves are of class .
Remark 2.2*.*
With a slightly modification of Definition 2.1 we could also consider networks in the whole with unbounded curves. In this case we require that every non compact branch of is asymptotic to an half line and its curvature is uniformly bounded. We call these unbounded networks open networks.
Definition 2.3**.**
We call a network regular if all its multi–points are triple and the sum of unit tangent vectors of the concurring curves at each of them is zero.
Example 2.4*.*
- •
A network could consists of a single closed embedded curve.
- •
A network could be composed of a single embedded curve with fixed end–points on .
- •
There are two possible (topological) structures of networks with only one triple junction: the triod or the spoon . A triod is a tree composed of three curves that intersects each other at a –point and have their other end–points on the boundary of . A spoon is the union of two curves: a closed one attached to the other at a triple junction. The “open” curve of the spoon has an end–point on (Figure 2).
2.2 The evolution problem
Given a network composed of curves we define its global length as
[TABLE]
The evolution we have in mind is the –gradient flow of the global length . Therefore, geometrically speaking, this means that the normal velocity of the curves is the curvature. In the case of the curves (curve shortening flow) this condition fully defines the evolution, at least geometrically. In the case of networks another condition at the junctions comes from the variational formulation of the evolution, as we will see below.
2.2.1 Formal derivation of the gradient flow
We begin by considering one closed embedded curve, parametrized by . Then , and . We want to compute the directional derivative of the length. Given and a smooth function satisfying , we take a variation of . From now on we neglect the dependence on the variable to maintain the notation simpler. We have
[TABLE]
As is a simple closed embedded curve, then the boundary terms are equal zero. We get
[TABLE]
Since we have written the directional derivative of in the direction as the scalar product of and , we conclude (at least formally) that is the gradient of the length. Hence we can understand the curve shortening flow as the gradient flow of the length.
We considering now a triod in a convex, open and regular set , whose curves are parametrized by of class with . Without loss of generality we can suppose that and with . We consider again a variation of each curve with three smooth functions. We require that and because we want that the set parametrized by is a triod with end point on fixed at . In such a way we are asking two (Dirichlet) boundary conditions. By definition of total length of a network, we have
[TABLE]
Repeating the previous computation and using the hypothesis on we have
[TABLE]
Imposing that the boundary term equals zero we get
[TABLE]
Hence, we have derived a further boundary condition at the junctions.
2.2.2 Geometric problem
We define the motion by curvature of regular networks.
Problem 2.5**.**
Given a regular network we let it evolve by the –gradient flow of the (total) length functional in a maximal time interval . That is:
- •
each curve of the network has a normal velocity equal to its curvature at every point and for all times – motion by curvature;
- •
the curves that meet at junctions remains attached for all times – concurrency;
- •
the sum of the unit tangent vectors of the three curves meeting at a junction is zero for all times – angle condition.
Moreover we ask that the end–points stay fixed during the evolution – Dirichlet boundary condition.
As a possible variant one lets the end–points free to move on the boundary of but asking that the curves intersect orthogonally – Neumann boundary condition.
Although our problem is geometric (as we want to describe the flow of a set moving in ), to solve we will turn to a parametric approach. As a consequence we will work often at the level of parametrization.
Definition 2.6** (Geometric admissible initial data).**
A network is a geometrically admissible initial data for the motion by curvature if it is regular, at each junction the sum of the curvature is zero, the curvature at each end–point on is zero and each of its curve can be parametrized by a regular curve of class with .
We introduce a way to label the curves: given a network composed by curves with end–points (if present) and triple points , we denote with the curves of this network concurring at the multi–point with and .
Definition 2.7**.**
[Solution of the motion by curvature of networks] Consider a geometrically admissible initial network composed of curves parametrized by , with triple points and (if present) end–points . A time dependent family of networks is a solution of the motion by curvature in the maximal time interval with initial data if it admits a time dependent family of parametrization such that each curve is regular and the following system of conditions is satisfied for every , ,
[TABLE]
where we assumed conventionally that the end–point of the network is given by .
Remark 2.8*.*
The boundary conditions in system (2.1) are consistent with a second order flow of three curves. Indeed we expect three vectorial conditions at the junctions and one for each curve at the other end points.
Remark 2.9*.*
We have defined solutions in but the natural class seems to be . It is indeed possible to define a solution to the motion by curvature of networks asking less regularity on the parametrization. Our choice simplify the proof of the short time existence result. We will see in the sequel that it is based on linearization and on a fixed point argument. The classical theory for system of linear parabolic equations developed by Solonnikov [40] is a Hölder functions setting (see [40, Theorem 4.9]).
Remark 2.10*.*
Suppose that is a solution to the motion by curvature as defined in 2.7. We will see later that at the curvature at the end–points and the sum of the three curvatures at every –point are automatically zero. Then a necessary condition for to be in space till is that these properties are satisfied also by the the initial regular network. These conditions on the curvatures are geometric, independent of the parametrizations of the curves, but intrinsic to the set and they are not satisfied by a generic regular, network.
Remark 2.11*.*
Notice that in the geometric problem we specify only the the normal component of the velocity of the curves (their curvature). This does not mean that there is not a tangential component of the velocity, rather a tangential motion is needed to allow the junctions move in any direction.
Example 2.12*.*
- •
The motion by curvature of a single closed embedded curve was widely studied by many authors [4, 5, 3, 17, 16, 18, 19, 28]. In particular the curve evolves smoothly, becoming convex and getting rounder and rounder. In finite time it shrinks to a point.
- •
The case of a curve with either an angle or a cusp can be dealt by the works of Angenent [4, 5, 3]. Actually the curve becomes immediately smooth and then for all positive time we come back to the evolution described in the previous example.
- •
The evolution of a single embedded curve with fixed end–points (Figure 3) is discussed in [22, 41, 42]. The curve converges to the straight segment connecting the two fixed end–points as the time goes to infinity.
- •
Two curves that concur at a –point forming an angle (or a cusp, if they have the same tangent) can be regarded as a single curve with a singular point, which will vanish immediately under the flow (Figure 3).
2.2.3 The system of quasilinear PDEs
In this section we actually work by defining the evolution in terms of differential equations for the parametrization of the curves. For sake of presentation we restrict to the case of the triod. This allows us maintaining the notation simpler.
Let us start focusing on the geometric evolution equation , that can be equivalently written as
[TABLE]
This equation specify the velocity of each curve only in direction of the normal .
Curve shortening flow for closed curve is not affected by tangential velocity. In the evolution by curvature of a smooth closed curve it is well known that any tangential contribution to the velocity actually affects only the “inner motion” of the “single points” (Lagrangian point of view), but it does not affect the motion of the whole curve as a subset of (Eulerian point of view). Indeed the classical mean curvature flow for hypersurfaces is invariant under tangential perturbations (see for instance [30, Proposition 1.3.4]). In particular in the case of curves it can be shown that a solution of the curve shortening flow satisfying the equation for some continuous function can be globally reparametrized (dynamically in time) in order to satisfy and vice versa.
As already anticipated, in the case of networks it is instead necessary to consider an extra tangential term (as for the case of the single curve that is not closed). It allows the motion of the –points. At the junctions the sum of the unit normal vectors is zero. If the velocity would be in normal direction to the three curves concurring at a 3–point, this latter should move in a direction which is normal to all of them, then the only possibility would be that the junction does not move at all.
Saying that a junction cannot move is equivalent to fix it, hence to add a condition in the system (2.1). Thus, from the PDE point of view, the system becomes overdetermined as at the junctions we have already required the concurrency and the angle conditions.
Therefore solving the problem of the motion by curvature of regular networks means that we require the concurrency and the angle condition (regular networks remain regular networks for all the times) and that the main equation for each curve is
[TABLE]
for some continuous function not specified. To the aim of writing a non–degenerate PDE for each curve we consider the tangential velocity
[TABLE]
Then the velocity of the curves is
[TABLE]
A family of networks evolving according to (2.3) will be called a special flow.
We are finally able to write explicitly the system of PDE we consider.
Without loss of generality any triod can be parametrized by in such a way that the triple junction is and that the other end–points on are given by with .
Definition 2.13**.**
Given an admissible initial parametrization of a geometrically admissible initial triod the family of time–dependent parametrizations is a solution of the special flow in the time interval if the functions are of class and the following system is satisfied for every , ,
[TABLE]
Definition 2.14** (Admissible initial parametrization of a triod).**
We say that a parametrization is admissible for the system (2.4) if:
is a triod; 2. 2.
each curve is regular and of class ; 3. 3.
for every ; 4. 4.
; 5. 5.
for every ; 6. 6.
for every ; 7. 7.
for every .
Remark 2.15*.*
Notice that in the literature one refers to conditions to in Definition 2.14 as compatibility conditions for system (2.4). In particular conditions and are called compatibility conditions of order .
We want to stress the fact that choosing the tangential velocity and so passing to consider the special flow allows us to turn the geometric problem into a non degenerate PDE’s system. The goodness of our choice will be revealed when one verifies the well posedness of the system (2.4).
Once proved existence and uniqueness of solution for the PDE’s system, it is then crucial to come back to the geometric problem and show that we have solved it in a “geometrically” unique way. This can be done in two step: first one shows that for any geometrically admissible initial data there exists an admissible initial parametrization for system (2.4) (and consequently a unique solution related to that parametrization). In the second step one supposes that there exist two different solutions of the geometric problem and then proves that it is possible to pass from one to another by time–dependent reparametrization.
However from the previous discussion we have understood that in our situation of motion of networks the invariance under tangential terms of the curve shortening flow is not trivially true. To prove existence and uniqueness of the motion by curvature of networks starting from existence and uniqueness of the PDE’s system solution a key role will be played again by our good choice of the tangential velocity.
3 Short time existence and uniqueness
We now deal with the problem of short time existence and uniqueness of the flow.
3.1 Existence and uniqueness for the special flow
We restrict again to a triod in . We consider first system (2.4). The short time existence result is due to Bronsard and Reitich [11].
We look for classical solutions in the space with . We recall the definition of this function space and of the norm it is endowed with (see also [40, §11, §13]).
For a function we define the semi–norms
[TABLE]
and
[TABLE]
The classical parabolic Hölder space is the space of all functions that have continuous derivatives (where are such that ) for which the norm
[TABLE]
is finite.
The boundary terms are in spaces of the form with which we identify with via the isomorphism .
Calling the ball of radius centred at the origin the short time existence result reads as follows:
Theorem 3.1** (Bronsard and Reitich).**
For any admissible initial parametrization there exists a positive radius and a positive time such that the system (2.4) has a unique solution in .
Remark 3.2*.*
Actually in [11] the authors do not consider exactly system (2.4), but the analogous Neumann problem. They require that the end–points of the three curves intersect the boundary of with a prescribed angle (of 90 degrees).
Bronsard and Reitich approach, based on linearising the problem around the initial data, nowadays is considered classical. We explain here their strategy.
Step 1: Linearization
Fix an admissible initial datum . We linearise the system (2.4) around getting
[TABLE]
The concurrency condition and the Dirichlet boundary condition are already linear. The angle condition instead is not linear, so one has to take into account the linear version of it:
[TABLE]
The linearized system associated to (2.4) is the following: for , and
[TABLE]
We remind that the initial data for the system has to satisfy some linear compatibility conditions.
Step 2: Existence and uniqueness of solution for the linearized system
We have linearized system (2.4) to obtain system (3.3). We now want to show that this latter admits a unique solution in . This is due to general results by Solonnikov [40], provided the so–called complementary conditions hold (see [40, p. 11]). The theory of Solonnikov is a generalization to parabolic systems of the elliptic theory by Agmon, Douglis and Nirenberg.
The complementary conditions are algebraic conditions that the matrices that represent the boundary operator and the initial datum have to satisfy (see also [40, p. 97]). Showing this conditions for a particular system can be heavy from the computational point of view. For instance in [15, pages 11–15] it is proved that the complementary condition follows from the Lopatinskii–Shapiro condition. We state here the definition of Lopatinskii–Shapiro condition at the triple junction, it is similar at the end–points on .
Definition 3.3**.**
Let with be arbitrary. The Lopatinskii–Shapiro condition for system (3.3) is satisfied at the triple junction if every solution to
[TABLE]
which satisfies is the trivial solution.
The angle condition in the previous system can be equivalently written as
[TABLE]
It can be proved that Lopatinskii–Shapiro condition for system (3.3) is satisfied testing the motion equation by and then by and using the concurrency and the angle conditions.
Once it is shown that the complementary conditions are fulfilled, then [40, Theorem 4.9] guarantees existence and uniqueness of a solution of system (3.3).
For we define the map as
[TABLE]
where the linear spaces and are
[TABLE]
endowed with the induced norms. Then as a consequence of the existence and uniqueness of a solution of system (3.3) we get that is a continuous isomorphism.
Remark 3.4*.*
The linearized version of (linearising around ) is
[TABLE]
As the well posedness of system (3.3) depends only on the highest order term we can restrict to consider (3.1) instead of (3.5).
Step 3: Fixed point argument
In the last step of the proof we deduce existence of a solution for system (2.4) from the linear problem by a contraction argument.
Let us define the operator that “contains the information” about the non–linearity of our problem. The two components of this map are the following:
[TABLE]
where .
Then is a solution for system (2.4) if and only if and
[TABLE]
Hence there exists a unique solution to system (2.4) if and only if has a unique fixed point. By the contraction mapping principle it is enough to show that is a contraction. This result conclude the proof of Theorem 3.1. ∎
The method of Bronsard and Reitich extends to the case of a networks with several –points and end–points. Indeed such method relies on the uniform parabolicity of the system (which is the same) and on the fact that the complementary and compatibility conditions are satisfied.
We have only to define what is an admissible initial parametrization of a network.
Definition 3.5** (Admissible initial parametrization of a network).**
We say that a parametrization of a geometric admissible network composed by curves (hence such that ) is an admissible initial one if each curve is regular and of class , at the end—points it holds and at any –point we have
[TABLE]
where we abused a little the notation as in Definition 2.13.
Theorem 3.6**.**
Given an admissible initial parametrization of a geometric admissible network , there exists a unique solution in of the following system
[TABLE]
(where we used the notation of Definition 2.13) for every , and , in a positive time interval .
3.2 Existence and uniqueness
In the previous section we have explained how to obtain a unique solution for short time to system (2.4) and more in general to system (3.6), but till now we have not solved our original problem yet. Indeed in Definition 2.7 of solution of the motion by curvature appears a slightly different system. Moreover Theorem 3.1 (and Theorem 3.6) provides a solution given an admissible initial parametrization but in Definition 2.7 we speak of geometrically admissible initial network. It is then clear that we have to establish a relation between this two notions.
To this aim the following lemma will be useful.
Lemma 3.7**.**
Consider a triple junction where the curves and concur forming angles of degrees (that is ). Then
[TABLE]
is satisfied if and only if
[TABLE]
Proof.
Suppose that for we have
[TABLE]
Multiplying these vector equalities by and and varying , thanks to the conditions , we get the relations
[TABLE]
with the convention that the second superscripts are to be considered “modulus ”. Solving this system we get
[TABLE]
which implies
[TABLE]
∎
It is also possible to prove that at each triple junction the following properties hold
[TABLE]
We are ready now to establish the relation between geometrically admissible initial networks and admissible parametrizations.
Lemma 3.8**.**
Suppose that is a geometrically admissible initial triod parametrized by . Then there exist three smooth functions such that the reparametrization is an admissible initial parametrization.
Proof.
Consider the parametrization of class of (that exists as is a geometrically admissible initial triod). It is not restrictive to suppose that is the triple junction and that with .
We look for smooth maps such that for every , and . Then conditions 1. 2. 3. and 6. of Definition 2.14 are satisfied.
Condition 4. at the triple junction is true for any choice of the as it involves the unit tangent vectors that are invariant under reparametrization.
We pass now to Condition 5. namely we want that
[TABLE]
We indicate with the subscript or the geometric quantities computed for the parametrization or , respectively. We define . Then (3.13) can be equivalently written as
[TABLE]
and, as all the geometric quantities involved are invariant under reparametrization, the equality (3.14) is nothing else than
[TABLE]
that by Lemma 3.7 is satisfied if and only if
[TABLE]
To satisfy Condition 7. we need a similar request. Indeed at every end–point of the network is equivalent to the condition , that is satisfied if and only if
[TABLE]
at every end–point of the network.
Hence, we only need to find reparametrizations such that at the borders of the values of are given by the relations in (3.16) and (3.17). This can be easily done since at the borders of the interval we have and , hence
[TABLE]
where .
Choosing any functions with , and
[TABLE]
(for instance, one can use a polynomial function) the reparametrization satisfies Conditions 1. to 7. of Definition 2.14 and the proof is completed. ∎
Remark 3.9*.*
Vice versa if is an admissible initial parametrization, then the triod is clearly a geometrically admissible initial network. Indeed one uses Lemma 3.7 to get that the sum of the curvature at the junction is zero. The other properties are trivially verified.
We are ready now to discuss existence and uniqueness of solution of the geometric problem. We need to introduce the notion of geometric uniqueness because even if the solution of system (2.4) is unique, there are anyway several solutions of Problem 2.5 obtained by reparametrizing .
Definition 3.10**.**
We say that Problem 2.5 admits a geometrically unique solution if there exists a unique family of time–dependent networks (sets) satisfying the definition of solution 2.7.
In particular this means that all the solutions (functions) satisfying system (2.1) can be obtained one from each other by means of time–depending reparametrization.
Theorem 3.11** (Geometric uniqueness).**
Let be a geometrically admissible initial triod. Then there exists a geometrically unique solution of Problem (2.4) in a positive time interval .
Proof.
Let be a geometrically admissible initial triod parametrized by admissible initial parametrization (that always exists thanks to Lemma 3.8). Then by Theorem 3.1 there exists a unique solution to system (2.4) with initial data in a positive time interval . In particular is a solution of the motion by curvature.
Suppose by contradiction that there exists another solution to Problem 2.5 with the same initial . Let this solution be parametrized by with
[TABLE]
We want to show that the sets and coincide, namely that coincides to up to a reparametrization of the curves for every .
Let be in and consider the reparametrizations . We have and
[TABLE]
We ask now the maps to be solutions for some positive interval of time of the following quasilinear PDE’s
[TABLE]
with , , (hence, ) and . The existence of such solutions follows by standard theory of second order quasilinear parabolic equations (see [25, 27]). Then we have
[TABLE]
By the uniqueness result of Theorem 3.6 we can then conclude that for every , hence in the time interval where . ∎
3.3 Geometric properties of the flow
In Definition 2.1 of network we require that the curves are injective and regular. The second assumption is needed to define the flow because appears at the denominator. For the short time existence of the flow we did not require that the curves are embedded. We now show that if the initial network is embedded then the evolving networks stay embedded and intersect the boundary of only at the fixed end–points (transversally).
Proposition 3.12**.**
Let be the curvature flow of a regular network in a smooth, convex, bounded, open set , with fixed end–points on the boundary of , for . Then, for every time , the network intersects the boundary of only at the end–points and such intersections are transversal for every positive time. Moreover, remains embedded.
Proof.
By continuity, the –points cannot hit the boundary of at least for some time . The convexity of and the strong maximum principle (see [37]) imply that the network cannot intersect the boundary for the first time at an inner regular point. As a consequence, if is the “first time” when the intersects the boundary at an inner point, this latter has to be a –point. The minimality of is then easily contradicted by the convexity of , the degrees condition and the nonzero length of the curves of .
Even if some of the curves of the initial network are tangent to at the end–points, by the strong maximum principle, as is convex, the intersections become immediately transversal and stay so for every subsequent time.
Finally, if the evolution loses embeddedness for the first time, this cannot happen neither at a boundary point, by the argument above, nor at a –point, by the degrees condition. Hence it must happen at interior regular points, but this contradicts the strong maximum principle. ∎
Proposition 3.13**.**
In the same hypotheses of the previous proposition, if the smooth, bounded, open set is strictly convex, for every fixed end–point on the boundary of , for , there is a time and an angle smaller than such that the curve of the network arriving at form an angle less that with the inner normal to the boundary of , for every time .
Proof.
We observe that the evolving network is contained in the convex set , obtained by letting (which is a finite set of smooth curves with end–points ) move by curvature keeping fixed the end–points (see [22, 41, 42]). By the strict convexity of and strong maximum principle, for every positive , the two curves of the boundary of concurring at form an angle smaller that which is not increasing in time. Hence, the statement of the proposition follows. ∎
4 Self-similar solutions
Once established the existence of solution for a short time, we want to analyse the behavior of the flow in the long time. A good way to understand more about the flow is looking for examples of solutions.
A straight line is perhaps the easiest example. It is also easy to see that an infinite flat triod with the triple junction at the origin (called standard triod) is a solution (Figure 4).
In both these examples the existence is global in time and the set does not change shape during the evolution. From this last observation one could guess that there is an entire class of solutions that preserve their shape in time. We try to classify now self–similar solution in a systematic way.
Let us start looking for self–similar translating solutions.
Suppose that we have a translating curve solving the motion by curvature with initial data . We can write . The motion by curvature equation in this case reads as . As a consequence is constant, hence we are allowed to write with , and we obtain
[TABLE]
The reverse is also true: if a curve satisfies , then is a translating solution of the curvature flow. By integrating this ODE (with ) one can see that the only translating curve is given by the graph of the function in the interval . Grayson in [19] named this curve the grim reaper (Figure 5).
Passing from a single curve to a regular network, the situation becomes more delicate. Every curve of the translating network has to satisfies . A result for translating triods can be found in [33, Lemma 5.8]: a closed, unbounded and embedded regular triod self–translating with velocity is composed by halflines parallel to or translated copies of pieces of the grim reaper relative to , meeting at the 3–point with angles of 120 degrees. Notice that at most one curve is a halfline (Figure 6).
Among curves there are also rotating solutions. Suppose indeed that is of the form with a rotation. The motion equation becomes
[TABLE]
We get that is constant. By straightforward computations one also get that is a anticlockwise rotation by , where is a given constant. Then
[TABLE]
A fascinating example can be found in [2]: the Yin–Yang curve.
We have left at last the more significant case: the self–similarly shrinking networks.
Suppose that a solution of the motion by curvature evolves homothetically shrinking in time with center of homothety the origin, namely with and . Being a solution of the flow the curve satisfies . Then
[TABLE]
We have that is equal to some constant. Up to rescaling we can suppose . Then for every we have and , or equivalently .
Definition 4.1**.**
A regular open network union of curves parametrized by is called a regular shrinker if for every curve there holds
[TABLE]
Remark 4.2*.*
Every curve of a regular shrinker satisfies the equation . As a consequence it must be a piece of a line though the origin or of the so called Abresch–Langer curves. Their classification results in [1] imply that any of these non straight pieces is compact. Hence any unbounded curve of a shrinker must be a line or an halfline pointing towards the origin. Moreover, it also follows that if a curve contains the origin, then it is a straight line through the origin or a halfline from the origin.
By the work of Abresch and Langer [1] it follows that the only regular shrinkers without triple junctions (curves) are the lines for the origin and the unit circle. There are two shrinkers with one triple junction [20]: the standard triod and the Brakke spoon. The Brakke spoon is a regular shrinker composed by a halfline which intersects a closed curve, forming angles of degrees. It was first mentioned in [10] as an example of evolving network with a loop shrinking down to a point, leaving a halfline that then, in the framework of Brakke flows, vanishes instantaneously. Up to rotation, this particular spoon–shaped network is unique [13] (Figure 7).
Also the classification of shrinkers with two triple junctions is complete. It is not difficult to show [6, 7] that there are only two possible topological shapes for a complete embedded, regular shrinker: one is the “lens/fish” shape and the other is the shape of the Greek “Theta” letter (or “double cell”). It is well known that there exist unique (up to a rotation) lens–shaped or fish–shaped, embedded, regular shrinkers which are symmetric with respect to a line through the origin of [13, 38] (Figure 8). Instead, there are no regular –shaped shrinkers [8].
The classification of (embedded) regular shrinkers is completed for the shrinkers with a single bounded region [12, 13, 38, 8], see Figure 9.
Several questions (also of independent interest) arise in trying to classify the regular shrinkers. We just mention an open question: does there exist a regular shrinker with more than five unbounded halflines?
Numerical computations, partial results and conjectures can be found in [20].
5 Integral estimates
A good way to understand what happens during the evolution of a network by curvature is to describe the changing in time of the geometric quantities related to the network. For instance we can write the evolution law of the length of the curves or of area enclosed by the curves. In several situations estimating the evolution of the curvature has revealed a winning strategy to pass from short time to long time existence results.
Differently from the case of the curve shortening flow (and of the mean curvature flow) here to obtain our a priori estimates we cannot use the maximum principle and a comparison principle is not valid because of the presence of junctions. Therefore integral estimates are computed in [33, Section 3] in [32, Section 5] in the case of a triod and a regular network, respectively. An outline for the estimates appeared in [23, Section 7], where the authors consider directly the evolution . We summarise here these calculations focusing on the easier cases.
Form now on we suppose that all the derivatives of the functions that appear exist.
We start showing that if a curve moves by curvature, then its time derivative and the arclength derivative do not commute.
We have already mentioned that the motion by curvature can be written as
[TABLE]
for some continuous function .
Lemma 5.1**.**
If is a curve moving by , then we have the following commutation rule:
[TABLE]
Proof.
Let be a smooth function, then
[TABLE]
and the formula is proved. ∎
In all this section we will consider a solution of the special flow. Hence each curve is moving by
[TABLE]
and .
Using the rule in the previous lemma we can compute
[TABLE]
5.1 Evolution of length and volume
We now compute the evolution in time of the total length.
By the commutation formula (5.1) the time derivative of the measure on any curve of the network is given by the measure . Then the evolution law for the length of one curve is
[TABLE]
We remind that by relation (3.7) the contributions of at every –point vanish. Suppose that the network has end–points on the boundary of . With a little abuse of notation we call the tangential velocity at the end–point for any . Since the total length is the sum of the lengths of all the curves, we get
[TABLE]
In particular if the end–points of the network are fixed during the evolution all the terms are zero and we have
[TABLE]
The total length is decreasing in time and uniformly bounded above by the length of the initial network.
We now discuss the behavior of the area of the regions enclosed by some curves of the evolving regular network. Let us suppose that a region is bounded by curves and let be its area. We call loop the union of these curves. The loop can be regarded as a single piecewise closed curve parametrized anticlockwise (possibly after reparametrization of the curves that composed it). Hence the curvature of is positive at the convexity points of the boundary of . Then we have
[TABLE]
where is the difference in the angle between the unit tangent vector and the unit coordinate vector at the final and initial point of the curve . Indeed supposing the unit tangent vector of the curve “lives” in the second quadrant of (the other cases are analogous) there holds
[TABLE]
so
[TABLE]
Considering that the curves form angles of degrees, we have
[TABLE]
We then obtain the equality (see [34])
[TABLE]
An immediate consequence of (5.9) is that the area of every region bounded by the curves of the network evolves linearly. More precisely it increases if the region has more than six edges, it is constant with six edges and it decreases if its edges are less than six. This implies that if less than six curves of the initial network enclose a region of area , then the maximal time of existence of a smooth flow is finite and
[TABLE]
5.2 Evolution of the curvature and its derivatives
We want to estimate the norm of the curvature and its derivatives, that will result crucial in the analysis of the motion. The main consequence of these computation indeed is that the flow of a regular smooth network with “controlled” end–points exists smooth as long as the curvature stays bounded and none of the lengths of the curves goes to zero (Theorem 5.7).
We consider a regular network in , composed by curves with triple–points and end–points . We suppose that it is a solution of the system (3.6). We assume that either the end–points are fixed (the Dirichlet boundary condition in (3.6) is satisfied) or that there exist uniform (in time) constants , for every , such that
[TABLE]
for every and . This second possibility will allow us to localise the estimates if needed.
We are now ready to compute . We get
[TABLE]
Using that we get
[TABLE]
Integrating by parts and estimating the contributions given by the end–points by means of assumption (5.11) we can write
[TABLE]
Then recalling relation (3.11) at the –points we have
[TABLE]
Substituting it above we lower the maximum order of the space derivatives of the curvature in the –point terms
[TABLE]
We notice that we can estimate the boundary terms at each –point of the form by (see [33, Remark 3.9]). Hence
[TABLE]
From now on we do not use any geometric property of our problem. We suppose that the lengths of curves of the networks are equibounded from below by some positive value. We reduce to estimate the and norm of the curvature of any curve , seen as a Sobolev function defined on the interval .
Lemma 5.2**.**
Let and . Then there exists a uniform constant , depending on , such that
[TABLE]
Proof.
The key estimates of the proof are Gagliardo–Nirenberg interpolation inequalities [35, Section 3, pp. 257–263] written in the form (see also [33, Proposition 3.11])
[TABLE]
We first focus on the term . We have
[TABLE]
and so
[TABLE]
Using Young inequality
[TABLE]
Similarly we estimate the term by
[TABLE]
Putting (5.15) and (5.16) together and choosing appropriately we obtain
[TABLE]
∎
Applying Lemma 5.2 to the curvature of each curve of the network the estimate (5.14) becomes
[TABLE]
The aim now is to repeat the previous computation for with .
Although the calculations are much harder, it is possible to conclude that for every even there holds
[TABLE]
Passing from integral to estimates we have the following proposition.
Proposition 5.3**.**
If assumption (5.11) holds, the lengths of all the curves are uniformly positively bounded from below and the norm of is uniformly bounded on , then the curvature of and all its space derivatives are uniformly bounded in the same time interval by some constants depending only on the integrals of the space derivatives of on the initial network .
We now derive a second set of estimates where everything is controlled – still under the assumption (5.11) – only by the norm of the curvature and the inverses of the lengths of the curves at time zero.
As before we consider the special curvature flow of a smooth network in the time interval , composed by curves with triple junctions and end–points , satisfying assumption (5.11).
As shown above, the evolution equations for the lengths of the curves are given by
[TABLE]
Then, proceeding as in the computations above, we get
[TABLE]
where we used Young inequality in the last passage. Proceeding as before, but keeping track of the terms where the inverse of the length appear, it is possible to obtain
[TABLE]
with a constant depending only on the structure of the network and on the constants and in assumption (5.11).
5.3 Consequences of the estimates
Thanks to the just computed estimates on the curvature and on the inverse of the length one can obtain the following result:
Proposition 5.4**.**
For every there exists a time , depending only on the structure of the network and on the constants and in assumption (5.11), such that if the square of the norm of the curvature and the inverses of the lengths of the curves of are bounded by , then the square of the norm of and the inverses of the lengths of the curves of are smaller than , for every time .
Proof.
Consider the positive function . Then by inequality (5.2) satisfies the differential inequality . After integration it reads as
[TABLE]
then if we get . Hence
[TABLE]
∎
The combination of these estimates implies estimates on all the derivatives of the maps , stated in the next proposition.
Proposition 5.5**.**
If is a special evolution of the initial network , satisfying assumption (5.11), such that the lengths of the curves are uniformly bounded away from zero and the norm of the curvature is uniformly bounded by some constants in the time interval , then
- •
all the derivatives in space and time of and are uniformly bounded in ,
- •
all the derivatives in space and time of the curves are uniformly bounded in ,
- •
the quantities are uniformly bounded from above and away from zero in .
All the bounds depend only on the uniform controls on the norm of , on the lengths of the curves of the network from below, on the constants in assumption (5.11), on the norms of the derivatives of the curves and on the bound from above and below on , for the curves describing the initial network .
By means of Proposition 5.4 we can strengthen the conclusion of Proposition 5.5.
Corollary 5.6**.**
In the hypothesis of the previous proposition, in the time interval all the bounds in Proposition 5.5 depend only on the norm of on , on the constants in assumption (5.11), on the norms of the derivatives of the curves , on the bound from above and below on and on the lengths of the curves of the initial network .
By means of the a priori estimates we can work out some results about the smooth flow of an initial regular geometrically smooth network .
Theorem 5.7**.**
If , with , is the maximal time interval of existence of a curvature flow of an initial geometrically smooth network , then
either the inferior limit of the length of at least one curve of is zero, as , 2. 2.
or .
Proof.
We can reparametrize the flow in order that it becomes a special smooth flow in . If the lengths of the curves of are uniformly bounded away from zero and the norm of is bounded, the same holds for the networks . Then, by Proposition 5.5 and Ascoli–Arzelà Theorem, the network converges in to a smooth network as . We could hence restart the flow obtaining a special curvature flow in a longer time interval. Reparametrizing back this last flow, we get a “extension” in time of the flow , hence contradicting the maximality of the interval . ∎
Proposition 5.8**.**
If , with , is the maximal time interval of existence of a curvature flow of an initial geometrically smooth network . If the lengths of the curves are uniformly positively bounded from below, then this superior limit is actually a limit and there exists a positive constant such that
[TABLE]
for every .
Proof.
Considering the flow introduced in the previous theorem. By means of differential inequality (5.17), we have
[TABLE]
which, after integration between with , gives
[TABLE]
Then, if case does not hold, we can choose a sequence of times such that . Putting in the inequality above and passing to the limit, as , we get
[TABLE]
hence, for every ,
[TABLE]
for some positive constant and .
By the invariance of the curvature by reparametrization, this last estimate implies the same estimate for the flow . ∎
This theorem obviously implies the following corollary.
Corollary 5.9**.**
If , with , is the maximal time interval of existence of a curvature flow of an initial geometrically smooth network and the lengths of the curves are uniformly bounded away from zero, then
[TABLE]
as .
In the case of the evolution of a single closed curve in the plane there exists a constant such that if at time a singularity develops, then
[TABLE]
for every (see [21]). It is unknown if this lower bound on the rate of blow-up of the curvature holds also in the case of the evolution of a network.
Remark 5.10*.*
Using more refine estimates it is possible to weaken the assumption of Theorem 5.7: one can suppose to have a curvature flow (see [32, p. 33]).
We conclude this section with the following estimate from below on the maximal time of smooth existence.
Proposition 5.11**.**
For every there exists a positive time such that if the norm of the curvature and the inverses of the lengths of the geometrically smooth network are bounded by , then the maximal time of existence of a curvature flow of is larger than .
Proof.
As before, considering again the reparametrized special curvature flow , by Proposition 5.4 in the interval the norm of and the inverses of the lengths of the curves of are bounded by .
Then, by Theorem 5.7, the value cannot coincide with the maximal time of existence of (hence of ), so it must be . ∎
6 Analysis of singularities
6.1 Huisken’s Monotonicity Formula
We shall use the following notation for the evolution of a network in : let be a network homeomorphic to the all , we consider a map
[TABLE]
given by the union of the maps (with the intervals or ) describing the curvature flow of the network in the time interval , that is .
Let us start from the easiest case in which the network is composed by a unique closed simple smooth curve. Let and be the one–dimensional backward heat kernel in relative to , that is
[TABLE]
Theorem 6.1** (Monotonicity Formula).**
Assume . For every and we have
[TABLE]
Proof.
See [21]. ∎
Then one can wonder if a modified version of this formula holds for networks. Clearly one needs a way to deal with the boundary points (the triple junctions). In [33] the authors gave a positive answer to this question in the case of a triod. With a slight modification of the computation in [33, Lemma 6.3] one can extend the result to any regular network. As before, with a little abuse of notation, we will write and respectively for the unit tangent vector and the tangential velocity at the end–point of the curve of the network getting at such point, for any .
Proposition 6.2** (Monotonicity Formula).**
Assume . For every and the following identity holds
[TABLE]
Integrating between and with we get
[TABLE]
We need the following lemma in order to estimate the end–points contribution (see [33, Lemma 6.5]).
Lemma 6.3**.**
For every and , the following estimate holds
[TABLE]
*where is a constant depending only on the constants in assumption (5.11).
Then for every point , we have*
[TABLE]
As a consequence, the following definition is well posed.
Definition 6.4** (Gaussian densities).**
For every we define the Gaussian density function as
[TABLE]
and provided the limit Gaussian density function as
[TABLE]
For every , the limit exists (by the monotonicity of ) it is finite and non negative. Moreover the map is upper semicontinuous [29, Proposition 2.12].
6.2 Dynamical rescaling
We introduce the rescaling procedure of Huisken in [21] at the maximal time .
Fixed , let be the map
[TABLE]
then, the rescaled networks are given by
[TABLE]
and they evolve according to the equation
[TABLE]
where
[TABLE]
Notice that we did not put the sign “ ” over the unit tangent and normal, since they remain the same after the rescaling.
When there is no ambiguity on the point , we will write for the end–points of the rescaled network .
The rescaled curvature evolves according to the following equation,
[TABLE]
which can be obtained by means of the commutation law
[TABLE]
where we denoted with the arclength parameter for .
By straightforward computations (see [21]) we have the following rescaled version of the Monotonicity Formula.
Proposition 6.5** (Rescaled Monotonicity Formula).**
Let and set
[TABLE]
For every the following identity holds
[TABLE]
*where .
Integrating between and with we get*
[TABLE]
We have also the analog of Lemma 6.3 (see [33, Lemma 6.7 ]).
Lemma 6.6**.**
For every and , the following estimate holds for all \mathfrak{t}\in\bigl{[}-\frac{1}{2}\log{T},+\infty\bigr{)},
[TABLE]
*where is a constant depending only on the constants in assumption (5.11).
As a consequence, for every point , we have*
[TABLE]
6.3 Blow–up limits
We now discuss the possible blow–up limits of an evolving network at the maximal time of existence. This analysis can be seen as a tool to exclude the possible arising of singularity in the evolution and to obtain (if possible) global existence of the flow.
Thanks to Theorem 5.7 we know what happens when the evolution approaches the singular time : either the length of at least one curve of the network goes to zero, or the -norm of the curvature blows-up. When the curvature does not remain bounded, we look at the possible limit networks after (Huisken’s dynamical) rescaling procedure. The rescaled Monotonicity Formula 6.5 will play a crucial role. We first suppose that the length of all the curves of the network remains strictly positive during the evolution. In this case the classification of the limits is complete (Proposition 6.8). Without a bound from below on the length of the curves the situation is more involved, and we will see that in general the limit sets are no longer regular networks. For this purpose, we shall introduce the notion of degenerate regular network.
We now describe the blow–up limit of networks under the assumption that the length of each curve is bounded below by a positive constant independent of time. We start with a lemma due to A. Stone [43].
Lemma 6.7**.**
Let be the family of rescaled networks obtained via Huisken’s dynamical procedure around some as defined in formula (6.3).
There exists a constant such that, for every , \mathfrak{t}\in\bigl{[}-\frac{1}{2}\log T,+\infty\bigr{)} and there holds
[TABLE] 2. 2.
For any there is a uniform radius such that
[TABLE]
that is, the family of measures e^{-|x|^{2}/2}\,{\mathcal{H}}^{1}\begin{picture}(9.0,8.0)\put(1.0,0.0){\line(0,1){8.0}} \put(1.0,0.0){\line(1,0){5.0}} \end{picture}\widetilde{\mathcal{N}}_{\mathfrak{t},x_{0}} is tight (see **[14]**).
Proposition 6.8**.**
Let be a curvature flow of regular networks with fixed end–points in a smooth, strictly convex, bounded open set in the time interval . Assume that the lengths of the curves of the networks are uniformly in time bounded away from zero for every . Then for every and for every subset of with infinite Lebesgue measure, there exists a sequence of rescaled times , with , such that the sequence of rescaled networks (obtained via Huisken’s dynamical procedure) converges in , for any , to a (possibly empty) limit, which is (if non-empty)
- •
a straight line through the origin with multiplicity (in this case );
- •
a standard triod centered at the origin with multiplicity (in this case ).
- •
a halfline from the origin with multiplicity (in this case ).
Moreover the –norm of the curvature of goes to zero in every ball , as .
Proof.
We divide the proof into three steps. We take for simplicity .
*Step 1: Convergence to .
*Consider the rescaled Monotonicity Formula (6.4) and let and . Then thanks to Lemma 6.6 we get
[TABLE]
which implies
[TABLE]
Being the last integral finite and being the integrand a non negative function on a set of infinite Lebesgue measure, we can extract within a sequence of times , such that
[TABLE]
It follows that for every ball of radius in the networks have curvature uniformly bounded in . Moreover, by Lemma 6.7, for every ball centered at the origin of we have the uniform bound , for some constant independent of . Then reparametrizing the rescaled networks by arclength, we obtain curves with uniformly bounded first derivatives and with second derivatives uniformly bounded in .
By a standard compactness argument (see [21, 26]), the sequence of reparametrized networks admits a subsequence which converges, weakly in and strongly in , to a (possibly empty) limit (possibly with multiplicity). The strong convergence in is implied by the weak convergence in and equation (6.6).
*Step 2: The limit is a regular shrinker.
*We first notice that the bound from below on the lengths prevents any “collapsing” along the rescaled sequence. Since the integral functional
[TABLE]
is lower semicontinuous with respect to this convergence (see [39], for instance), the limit satisfies in the sense of distributions.
A priori, the limit network is composed by curves in , but from the relation , it follows that the curvature is continuous. By a bootstrap argument, it is then easy to see that is actually composed by curves.
*Step 3: Classification of the possible limits.
*If the point is distinct from all the end–points , then has no end–points, since they go to infinity along the rescaled sequence. If for some , the set has a single end–point at the origin of .
Moreover, from the lower bound on the length of the original curves it follows that all the curves of have infinite length, hence, by Remark 4.2, they must be pieces of straight lines from the origin.
This implies that every connected component of the graph underlying can contain at most one –point and in such case such component must be a standard triod (the degrees condition must be satisfied) with multiplicity one since the converging networks are all embedded (to get in the –limit a triod with multiplicity higher than one it is necessary that the approximating networks have self–intersections). Moreover, since the converging networks are embedded, if both a standard triod and a straight line or another triod are present, they would intersect transversally. Hence if a standard triod is present, a straight line cannot be present and conversely if a straight line is present, a triod cannot be present.
If no end–point is present, that is, we are rescaling around a point in (not on its boundary), and no –point is present, the only possibility is a straight line (possibly with multiplicity) through the origin.
If an end–point is present, we are rescaling around an end–point of the evolving network, hence, by the convexity of (which contains all the networks) the limit must be contained in a halfplane with boundary a straight line for the origin. This exclude the presence of a standard triod since it cannot be contained in any halfplane. Another halfline is obviously excluded, since they “come” only from end–points and they are all distinct. In order to exclude the presence of a straight line, we observe that the argument of Proposition 3.13 implies that, if is the evolution by curvature of keeping fixed the end–points , the blow–up of at an end–point must be a cone spanning angle strictly less then (here we use the fact that three end–points are not aligned) and is contained in such a cone. It follows that cannot contain a straight line.
In every case the curvature of is zero everywhere and the last statement follows by the –convergence.
∎
Remark 6.9*.*
In the previous proposition the hypothesis on the length of the curve can be replace by the weaker assumption that the lengths of the curves satisfy
[TABLE]
for every .
Lemma 6.10**.**
Under the assumptions of Proposition 6.8, there holds
[TABLE]
where denotes the integration with respect to the canonical measure on , counting multiplicities
Proof.
By means of the second point of Lemma 6.7, we can pass to the limit in the Gaussian integral and we get
[TABLE]
Recalling that
[TABLE]
as , equality (6.8) follows. ∎
Remark 6.11*.*
If the three end–points are aligned the argument of Proposition 3.13 does not work and we cannot conclude that the only blow–up at is a halfline with multiplicity . It could also be possible that a straight line (possibly with higher multiplicity) is present.
We describe now how Proposition 6.8 allows us to obtain a (conditional) global existence result when the lengths of all the curves of the networks are strictly positive.
Suppose that . As we have assumed that the lengths of all the curves of the network are uniformly positively bounded from below, the curvature blows-up as (Theorem 5.7 and Proposition 5.8). Performing a Huisken’s rescaling at an interior point of , we obtain as blow–up limit (if not empty) a standard triod or a straight line with multiplicity . One can argue as in [29] to show that when such limit is a regular triod, the curvature is locally bounded around such point . For the case of a straight line, if we suppose that the multiplicity is equal to , by White’s local regularity theorem [45] we conclude that the curvature is bounded uniformly in time, in a neighborhood of the point . If we instead rescale at an end–point we get a halfline. This case can be treated as above by means of a reflection argument. Indeed for the flow obtain by the union of the original network and the reflection of this latter, the point is no more an end–point. A blow–up at give a straight line, implying that the curvature is locally bounded also around as before by White’s theorem.
Supposing that the lengths of the curves of the network are strictly positive and supposing also that any blow–up limit has multiplicity one, it follows that the original network has bounded curvature as . Hence cannot be a singular time, and we have therefore global existence of the flow.
In the previous reasoning a key point is the hypothesis that the blow–ups have multiplicity one. Unfortunately, for a general regular network, this is still conjectural and possibly the major open problem in the subject.
Multiplicity–One Conjecture** **(M1).
Every possible –limit of rescalings of networks of the flow is an embedded network with multiplicity one.
However, in some special situations one can actually prove M1.
Proposition 6.12**.**
If is strictly convex and the evolving network has at most two triple junctions, every –limit of rescalings of networks of the flow is embedded and has multiplicity one.
Proof.
See [31, Section 4,Corollary 4.7]. ∎
Proposition 6.13**.**
If during the curvature flow of a tree the triple junctions stay uniformly far from each other and from the end–points, then every –limit of rescalings of networks of the flow is embedded and has multiplicity one.
Proof.
See [32, Proposition 14.14]. ∎
We now remove the hypothesis on the lengths of the curves of the network. In this case, nothing prevents a length to go to zero in the limit.
In order to describe the possible limits, we introduce the notion of degenerate regular networks. First of all we define the underlying graph, which is an oriented graph with edges , that can be bounded and unbounded. Every vertex of can either have order one (and in this case it is called end–points of ) or order three.
For every edge we introduce an orientation preserving homeomorphisms where is the interval , , or . If is a segment, then . If it is an halfline, we choose or . Notice that the interval can only appear if it is associated to an unbounded edge without vertices, which is clearly a single connected component of .
We then consider a family of parametrizations . In the case is , or , the map is a regular curve with unit tangent vector . If instead the map can be either a regular curve with unit tangent vector , or a constant map (degenerate curves). In this last case we assign a constant unit vector to the curve . At the points [math] and of the assigned exterior unit tangents are and , respectively. The exterior unit tangent vectors (real or assigned) at the relative borders of the intervals , , of the concurring curves , have zero sum (degenerate degrees condition). We require that the map given by the union is well defined and continuous.
We define a degenerate regular network as the the union of the sets . If one or several edges of are mapped under the map to a single point , we call this sub–network given by the union of such edges the core of at .
We call multi–points of the degenerate regular network the images of the vertices of multiplicity three of the graph by the map and end–points of the images of the vertices of multiplicity one of the graph , by the map .
A degenerate regular network with underlying graph , seen as a subset in , is a network, not necessarily regular, that can have end–points and/or unbounded curves. Moreover, self–intersections and curves with integer multiplicities can be present. Anyway, at every image of a multi–point of the sum (possibly with multiplicities) of the exterior unit tangents is zero.
Definition 6.14**.**
We say that a sequence of regular networks converges in to a degenerate regular network with underlying graph if:
- •
letting the multi–points of , for every open set with compact closure in , the networks restricted to , for large enough, are described by families of regular curves which, after possibly reparametrizing them, converge to the family of regular curves given by the restriction of to ;
- •
for every multi–point of , image of one or more vertices of the graph (if a core is present), there is a sufficiently small and a graph , with edges associated to intervals , such that:
- –
the restriction of to is a regular degenerate network described by a family of curves with (possibly “assigned”, if the curve is degenerate) unit tangent ,
- –
for sufficiently large, the restriction of to is a regular network with underlying graph , described by the family of regular curves ,
- –
for every , possibly after reparametrization of the curves, the sequence of maps J^{r}\ni x\mapsto\bigl{(}\widetilde{\sigma}^{r}_{k}(x),\widetilde{\tau}^{r}_{k}(x)\bigr{)} converge in to the maps J^{r}\ni x\mapsto\bigl{(}\widetilde{\sigma}^{r}_{\infty}(x),\widetilde{\tau}^{r}_{\infty}(x)\bigr{)}, for every .
We will say that converges to in , where is some function space, if the above curves also converge in the topology of .
Removing the hypothesis on the lengths of the curves, we get that the limit networks are degenerate regular networks which are homothetically shrinking under the flow.
Proposition 6.15**.**
Let be a curvature flow of regular networks in the time interval , then, for every and for every subset of with infinite Lebesgue measure, there exists a sequence of rescaled times , with , such that the sequence of rescaled networks (obtained via Huisken’s dynamical procedure) converges in , for any , to a (possibly empty) limit network, which is a degenerate regular shrinker (possibly with multiplicity greater than one).
Moreover, we have
[TABLE]
where denotes the integration with respect to the canonical measure on , counting multiplicities.
Remark 6.16*.*
Notice that the blow–up limit degenerate shrinker obtained by this proposition a priori depends on the chosen sequence of rescaled times .
Remark 6.17*.*
Thanks to Proposition 6.12, if the network has at most two triple junctions, the degenerate regular shrinker has multiplicity one.
Assuming that the length of at least one curve of goes to zero, as , there are two possible situations:
- •
The curvature stays bounded.
- •
The curvature is unbounded as .
Suppose that the curvature remains bounded in the maximal time interval . As the networks converge in (up to reparametrization) to a unique limit degenerate regular network in . This network can be non–regular seen as a subset of : multi–points can appear, but anyway the sum of the exterior unit tangent vectors of the concurring curves at every multi–point must be zero. Every triple junction satisfies the angle condition. The non–degenerate curves of belong to and they are smooth outside the multi–points (for the proof see [32, Proposition 10.11]).
We have seen in Section 5.1 that if a region is bounded by less than six curves then its area decreases linearly in time going to zero at . Not only the area goes to zero in a finite time, but also the lengths of all the curves that bound the region. Moreover when the lengths of all the curves of the loop go to zero, then the curvature blows up. Let us call the loop . Combing (5.8) with (5.9) there is a positive constant such that . By Hölder inequality
[TABLE]
where is the total length of the loop. Hence
[TABLE]
Then at time we have a singularity where both the length goes to zero and the curvature explodes.
Developing careful a priori estimates of the curvature one can show that if two triple junctions collapse into a –point, then the curvature remains bounded (see [32]). The interest of this result relies on the fact that it describes the formation of a “type zero” singularity: a singularity due to the change of topology, not to the blow up of the curvature. This is a new phenomenon with respect to the classical curve shortening flow and the mean curvature flow more in general. Thanks to this result it is possible to show that given an initial network without loops (a tree), if Multiplicity–One Conjecture M1 is valid, then the curvature is uniformly bounded during the flow. The only possible “singularities” are given by the collapse of a curve with two triple junctions going to collide. Moreover in the case of a tree we are able to show the uniqueness of the blow up limit (see Remark 6.16).
Although one can find example of global existence of the flow (consider for instance an initial triod contained in the triangle with vertices its three end–points and with all angles less than 120 degrees) our analysis underlines the generic presence of singularities. Then a natural question is if it is possible to go beyond the singularity.
There are results on the short time existence of the flow for non-regular networks, that is, networks with multi–points (not only -points), or networks that do not satisfy the degrees condition at the -points. Till now the most general result of this kind is the one by Ilmanen, Neves and Schulze [23], which provides short time existence of the flow starting from a non-regular network with bounded curvature. Notice that the network arising after the collapse of (exactly) two triple junctions has bounded curvature, and therefore fits with the hypotheses this result.
An ambitious project should be constructing a bridge between the analysis of the long time behavior of networks moving by curvature and short time existence results for non-regular initial data: one can interpret the short time existence results for non-regular data as a “restarting” theorem for the flow after the onset of the first singularity.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] U. Abresch and J. Langer, The normalized curve shortening flow and homothetic solutions , J. Diff. Geom. 23 (1986), no. 2, 175–196.
- 2[2] S. J. Altschuler, Singularities of the curve shrinking flow for space curves , J. Diff. Geom. 34 (1991), no. 2, 491–514.
- 3[3] S. Angenent, Parabolic equations for curves on surfaces. I. Curves with p 𝑝 p -integrable curvature , Ann. of Math. (2) 132 (1990), no. 3, 451–483.
- 4[4] , On the formation of singularities in the curve shortening flow , J. Diff. Geom. 33 (1991), 601–633.
- 5[5] , Parabolic equations for curves on surfaces. II. Intersections, blow–up and generalized solutions , Ann. of Math. (2) 133 (1991), no. 1, 171–215.
- 6[6] Pietro Baldi, Emanuele Haus, and Carlo Mantegazza, Networks self-similarly moving by curvature with two triple junctions , Atti Accad. Naz. Lincei Rend. Lincei Mat. Appl. 28 (2017), no. 2, 323–338. MR 3649351
- 7[7] , On the classification of networks self-similarly moving by curvature , Geom. Flows 2 (2017), no. 1, 125–137. MR 3745455
- 8[8] , Non-existence of t h e t a 𝑡 ℎ 𝑒 𝑡 𝑎 theta -shaped self-similarly shrinking networks moving by curvature , Comm. Partial Differential Equations 43 (2018), no. 3, 403–427. MR 3804202
