A Lyapunov function for Glauber dynamics on lattice triangulations

We study random triangulations of the integer points [0,n]2∩Z2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$[0,n]^2 \cap {\mathbb {Z}}^2$$\end{document}, where each triangulation σ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma $$\end{document} has probability measure λ|σ|\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda ^{|\sigma |}$$\end{document} with λ>0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda >0$$\end{document} being a real parameter and |σ|\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|\sigma |$$\end{document} denoting the sum of the length of the edges in σ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma $$\end{document}. Such triangulations are called lattice triangulations. We construct a height function on lattice triangulations and prove that, in the whole subcritical regime λ<1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda <1$$\end{document}, the function behaves as a Lyapunov function with respect to Glauber dynamics; that is, the function is a supermartingale. We show the applicability of the above result by establishing several features of lattice triangulations, such as tightness of local measures, exponential tail of edge lengths, crossings of small triangles, and decay of correlations in thin rectangles. These are the first results on lattice triangulations that are valid in the whole subcritical regime λ<1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda <1$$\end{document}. In a very recent work with Caputo, Martinelli and Sinclair, we apply this Lyapunov function to establish tight bounds on the mixing time of Glauber dynamics in thin rectangles that hold for all λ<1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda <1$$\end{document}. The Lyapunov function result here holds in great generality; it holds for triangulations of general lattice polygons (instead of the [0,n]2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$[0,n]^2$$\end{document} square) and also in the presence of arbitrary constraint edges.


Introduction
Consider the set of integer points 0 n = {0, 1, . . . , n} 2 in the n ×n square on the plane. A triangulation σ of 0 n is a maximal collection of edges (straight line segments) such that each edge has its endpoints in 0 n and, aside from its endpoints, intersects no other edge of σ and no other point of 0 n . We refer to such triangulations as lattice triangulations; see Fig. 1 for an example.
Our goal is to study properties of random lattice triangulations. Let n be the set of all triangulations of 0 n . It is known that, for any triangulation σ ∈ n , every triangle in σ has area exactly 1/2, and the set of midpoints of the edges of σ does not depend on σ . In particular, this set is n = 0, 1 2 , 1, 3 2 , . . . , n − 1 2 , n 2 \ 0 n , which is the set of half-integer points in [0, n] 2 excluding 0 n . This allows us to regard random lattice triangulations as a spin system since a lattice triangulation σ ∈ n can be seen as a collection of variables {σ x : x ∈ n }, where σ x denotes the edge (representing the spin) of the midpoint x in σ . However, many challenges arise when trying to make use of the vast literature on spin systems to study lattice triangulations. For example, lattice triangulations have unbounded dependences as long edges affect far away regions, the interaction between the spins depends on the triangulation, and some useful properties in the study of spin systems do not hold, one example being the FKG inequality, see Appendix B.
There is a natural Markov chain (or Glauber dynamics) over n , where transitions are given by flips of uniformly random edges [12,19]. More precisely, if σ ∈ n is the current state of the Markov chain, a transition consists of picking a non-boundary edge e of σ uniformly at random, and if the two triangles containing e in σ form a strictly convex quadrilateral (in which case they actually form a parallelogram), then with probability 1/2 we remove e and replace it by the opposite diagonal of that quadrilateral. Otherwise, the Markov chain stays put; see Fig. 2.
The graph on n induced by the edge-flipping operation above is usually referred to as the flip graph, and is known to be connected [15]. In addition, since the transition matrix is symmetric and aperiodic, this Markov chain converges to the uniform distribution on n . Very little is currently known regarding the dynamic properties of this Markov chain, in particular no non-trivial bound on its mixing time (the time until the Markov chain is close enough to its stationary distribution) is known.
In [5] we introduced a real parameter λ > 0 and studied random lattice triangulations distributed according to the measure where |σ x | denotes the 1 -length of edge σ x , and Z (λ) = σ ∈ n λ x∈ n |σ x | is a normalizing constant. We adapt the Markov chain discussed above using the so-called heat-bath dynamics to obtain a Markov chain whose stationary distribution is π . Namely, if we let σ x denote the triangulation obtained from σ by flipping the edge σ x , the Markov chain moves from σ to σ x with probability Simulation suggests that this Markov chain has an intriguing behavior, undergoing a phase transition at λ = 1; see Fig. 3. It is believed that for any λ < 1, which we call the subcritical regime, regions far from one another in the triangulation evolve roughly independently. This suggests the presence of decay of correlations and small mixing time. On the other hand, for λ > 1, which we call the supercritical regime, the Markov chain faces a rigidity phenomenon: long edges give rise to rigid regions of aligned edges. This suggests the presence of "bottlenecks" in the Markov chain, giving rise to exponential mixing time. Finally, in the λ = 1 case, which is the case of uniformly random triangulations, relatively long edges appear but simulation suggests that the regions of aligned edges are not as rigid as in the supercritical regime.  Our contribution. In this paper we construct a height function on lattice triangulations: given a triangulation σ ∈ n , the function attributes a positive real value to each midpoint in n . We define the function in Sect. 2, after introducing some necessary notation. Our main result (Theorem 2.3) establishes that this function behaves pointwise as a Lyapunov function with respect to the Glauber dynamics. This means that the value of the function at any midpoint x ∈ n behaves like a supermartingale. Theorem 2.3 holds for any λ ∈ (0, 1), and gives the first result on the dynamics of lattice triangulations that is valid in the whole subcritical regime. A crucial feature of Theorem 2.3 is that it holds in great generality: also in the case of triangulations of general lattice polygons 1 and in the presence of arbitrary constraint edges. 2 This generality is key in the application of our main result.
The definition of the height function is a bit involved, so we defer it, as well as the statement of our main result (Theorem 2.3), to Sect. 2. In particular, the height function is defined in terms of a novel type of geometric crossing, and uses a new partition on the edges of a triangulation in what we call regions of influence. We believe these two new concepts (which we introduce and analyze in Sects. 3,4) are of independent interest. The proof of Theorem 2.3 is given in Sect. 5. Our main result has a large range of consequences and applications, which we discuss in Sects.6-8. For example, we apply it to establish in the whole λ < 1 regime that the length of an edge of a triangulation has an exponential tail (Corollary 7.4), that local measures are tight (Theorem 7.1), and that there are crossings of triangles of constant size (Theorem 7.5). In the particular case of triangulations of n ×k rectangles, where k is a fixed integer independent of n, our technique yields stronger results such as the existence of local limits (Theorem 8.4), exponential decay of correlations 1 The set of vertices 0 n does not need to be the n × n square, but can be the set of integer points inside any lattice polygon (a polygon whose vertices are points of Z 2 ). 2 Triangulations where some given set of edges are forced to be present, see Sect. 2 for precise definitions. (Theorem 8.3), and recurrence of random walks on the induced graph (Corollary 8.7). The above results are the best possible with respect to the range of values of λ. For example, already in the case of one-dimensional, n × 1 lattice triangulations, it is known that properties such as exponential decay of correlations, existence of local limits, tightness of local measures and exponential tails of edge lengths do not hold for any λ ≥ 1. This follows from the well-known bijection between n × 1 lattice triangulations and "lattice paths" of length 2n, which start from the origin and have ±1 increments at each step [12]. Since for λ ≥ 1 the height at position n of the lattice path, which corresponds to the length of the edge of the triangulation whose midpoint is at the center of the n × 1 rectangle, will typically be of order at least √ n, none of the above properties hold.
In a very recent work with Caputo, Martinelli and Sinclair [6], we apply Theorem 2.3, as well as some of its consequences and some other geometric properties introduced in the present paper, to establish tight bounds on the mixing time of n × k triangulations in the whole λ < 1 regime. Together with our analysis of the case λ > 1 in [5], this establishes for the first time a phase transition on the mixing time of lattice triangulations at λ = 1.
Motivation and previous works. Lattice triangulations are fundamental discrete geometric objects with fascinating properties, but which bring several mathematical challenges. For example, even the asymptotic number of lattice triangulations remains unknown, a feature that is known quite precisely in other types of triangulations such as the better understood ones coming from the theory of random planar maps [17]. Nonetheless, a number of beautiful combinatorial arguments have been recently developed to estimate the number of lattice triangulations [2,12,19]. For instance, a very elegant argument by Anclin [2] shows that the cardinality of n is at most 8 n 2 . Despite not being the best known upper bound, Anclin's argument is quite general and applies to lattice triangulations of general lattice polygons; we state and use it later, see Lemma 2.1. Despite all these efforts, the best known bounds on | n | are exponentially far from each other: | n | ≥ 4.13 n 2 [12] and | n | ≤ c 6.86 n 2 [19] for some positive constant c.
Lattice triangulations have appeared in a broad range of contexts. For example, in algebraic geometry, they play a key role in the famous construction of plane algebraic curves by Viro [18], which has connections with Hilbert's 16th problem, and also appeared in the theory of discriminants [10] and toric varieties [7]. Lattice triangulations have also been studied in the contexts of discretization of random surface models [9] and two-dimensional quantum gravity [16]. Several other applications of triangulations are discussed in [8].
Much less is known about random lattice triangulations. The only result on the mixing time of the above edge-flipping Markov chain is [5]. There we showed that, for any λ > 1, the mixing time is at least e cn for some constant c > 0. We also showed that, for all sufficiently small λ, the mixing time is of order n 3 , and a random triangulation has decay of correlations. Extending these results to the whole subcritical regime turned out to be quite challenging, especially since similar results for other spin systems make use of fundamental properties that do not hold on lattice triangulations. This led us to look for new geometric properties of lattice triangulations and to develop new techniques. Concurrently to [5], a similar model of random lattice triangulations has independently appeared in the statistical physics literature [13,14]. Also, motivated by [5], a similar model has been introduced to study the mixing time of random rectangular dissections and dyadic tilings [4].

Notation and statement of main result
In order to define the height function and state our main result, we need to introduce some notation. We will consider lattice triangulations of general lattice polygons. A lattice polygon is defined as a polygon whose vertex set only contains points of Z 2 , and whose edges do not intersect one another (aside from their endpoints) and do not contain points of Z 2 in their interior, see Fig. 4a. Henceforth, let 0 be any subset of Z 2 such that 0 contains all points of Z 2 that lie inside some lattice polygon, including the vertices of the polygon. In a first reading it may be easier to consider 0 as the n × n square [0, n] 2 ∩ Z 2 , as mentioned in Sect. 1, which we refer to as the lattice square. Let be the set of triangulations of 0 , and be the set of midpoints of edges of a triangulation of 0 .

Boundary condition
Now we formally define the notion of boundary condition via constraint edges. Consider a collection of edges ξ = {ξ x : x ∈ bc } for some bc ⊂ such that each edge of ξ has endpoints in 0 and, aside from its endpoints, does not intersect other edges of ξ or points of 0 . We say that These concepts are illustrated in Fig. 4b-d. We refer to ξ as a boundary condition and let ξ = {σ ∈ : σ is compatible with ξ }.
For convenience, we assume that ξ (resp., bc ) always contains the boundary edges (resp., the midpoints of the boundary edges) of the lattice polygon induced by 0 ; for example, in the case of the lattice square 0 = [0, n] 2 ∩ Z 2 , we have that ξ contains the 4n edges of length 1 connecting consecutive points on the boundary of [0, n] 2 . Define ( 0 ) to be the collection of all possible sets of constraint edges with endpoints 0 .
Consequently, for any boundary condition ξ ∈ ( 0 ), ξ contains the boundary of the aforementioned lattice polygon induced by 0 . When ξ consists of only the edges of the lattice polygon, then we refer to ξ as the free boundary condition. Henceforth, for any ξ ∈ ( 0 ), we denote by bc = bc (ξ ) = ∩ ξ the set of midpoints of the edges in ξ .
[When the starting state is not important, we will simply denote the above Markov chain by M λ ( ξ ).] Given a initial triangulation σ ∈ ξ , the Markov chain M λ σ ( ξ ) evolves as follows. Pick a uniformly random midpoint x ∈ . If σ x is a constraint edge (i.e., σ x ∈ ξ ) or σ x is unflippable, do nothing. Otherwise, letting σ x denote the triangulation obtained by flipping σ x in σ , flip σ x in σ with probability λ |σ x x | λ |σ x x | +λ |σx | ; else do nothing. For any edge e, we denote by |e| the 1 length of e.
The stationary measure of M λ ( ξ ) is denoted by π ξ , and is given by where Z ξ (λ) = σ ∈ ξ λ x∈ |σ x | is a normalizing constant. We omit the dependence on λ from π ξ to simplify the notation.

Ground state and edges of given midpoint
Given any midpoint x ∈ , define E ξ x as the set of edges of midpoint x that are compatible with ξ . In symbols, In the case of a lattice square with free boundary condition, E ξ x comprises all the edges that have integer endpoints, have midpoint x, are entirely contained inside [0, n] 2 , and do not interesect any point of Z 2 besides its endpoints. See Fig. 5a, b. which can be obtained from σ x by flips that decrease the length of the edges (i.e., e σ x , using the notation from Sect. 2.4), and red edges representing the other edges of E ξ x . c A ground state triangulation of the lattice square with free boundary condition. d An ilustration for the definition of E ξ x (σ, g) with ξ being free boundary condition and σ being the triangulation in part (a) (color figure online) Despite not being the best known upper bound on the number of triangulations, we mention the following upper bound due to Anclin as it holds for arbitrary boundary conditions ξ . Anclin showed that if we order the midpoints in \ bc from top to bottom and left to right, and we construct the triangulation by sampling edges one by one following this order, then for each midpoint x ∈ \ bc there are at most two edges of E ξ x that are compatible with all previously sampled edges. This immediately implies the following upper bound. Lemma 2.1 (Anclin's bound, [2]) Given any set of constraint edges ξ ∈ ( 0 ), we have We refer to the edges of E ξ x of smallest length as the ground state edges of x given ξ . The ground state edges of x are either composed of a single edge or are the two opposite unit diagonals (i.e., the diagonals of a square of side length 1). In the case of the lattice square with free boundary condition, the ground state edges are either horizontal edges, vertical edges, or one of the two opposite unit diagonals; See Fig. 5c.
be the set of ground state edges given ξ . Also, define the set of all possible edges as that is, E ξ is the set of all edges with integer endpoints that are contained in the lattice polygon defining 0 and that do not contain any point of Z 2 in its interior nor intersects the edges in ξ .
We consider that the edges in E ξ are open line segments. Hence, two edges e, f ∈ E ξ that intersect only at their endpoints are considered to be disjoint. The ground state triangulation is defined as the triangulation with smallest total edge length. The following lemma from [5] gives that a ground state triangulation can be easily constructed by independently adding a ground state edge for each midpoint that is compatible with the boundary condition. Figure 4c illustrates a ground state triangulation given the boundary condition of Fig. 4b. In the case of the lattice square with free boundary condition, there are exactly 2 n 2 ground state triangulations, as there are two possible choices for each of the n 2 unit diagonals; one such example is given in Fig. 5c. Lemma 3.4]) Given any boundary condition ξ ∈ ( 0 ), the ground state triangulation given ξ is unique (up to possible flips of unit diagonals), and can be constructed by placing each edge in its minimal length configuration consistent with ξ , independent of the other edges.

Partial order on E ξ x
The flip operation induces a natural partial order on E ξ x . We refer to a given flip operation as a decreasing flip (resp., increasing flip) if it reduces (resp., increases) the length of the edge being flipped. It is known that for any non-ground-state edge x such that e can be obtained from f via a decreasing flip; see, for example, [5,Section 2.2]. In this case we say that e is the parent of f . Any other edge that can be obtained by flipping f in some triangulation has length at least as large as | f |.
When f belongs to a triangulation where f can be flipped to a shorter edge (which necessarily is the parent of f ), in this triangulation f is the largest diagonal of a parallelogram, which is referred to as the minimal parallelogram of f . Then for two distinct edges e, f ∈ E ξ x , we say that e ≺ f iff there is a sequence of edges e = e 0 , e 1 , e 2 , . . . , e k = f ∈ E ξ x such that e i is the parent of e i+1 for all i = 0, 1, 2, . . . , k − 1.
In other words, if e ≺ f , there is a length-increasing sequence of edges e = e 1 , e 2 , . . . , e k = f with e i ∈ E ξ x for all i, and such that for each i = 1, 2, . . . , k − 1 there exists two triangulations σ, η adjacent in the flip graph satisfying σ y = η y for all y ∈ \{x}, σ x = e i and η x = e i+1 . See, for example, Fig. 5b. Hence, the ground state edges of midpoint x are the only edges g ∈ E ξ x such that there exists no e ∈ E ξ x \{g} with e ≺ g. We say that e f if either e = f or e ≺ f .

Height function
Given a boundary condition ξ ∈ ( 0 ), a triangulation σ , a midpoint x ∈ and a ground state edge g ∈ G ξ (whose midpoint is not necessarily x), define the set If σ is the triangulation in Fig. 5a, and g is the red edge in Fig. 5d, then E ξ x (σ, g) are the black edges in Fig. 5d. Note that in this case E ξ x (σ, g) comprises only two edges while E ξ x is formed of the three black edges in Fig. 5b; the horizontal edge of midpoint x is not in E ξ x (σ, g) since it does not cross g. We will show later in Proposition 4.2 that E ξ x (σ, g) = ∅ if and only if σ x does not intersect g. For any e ∈ E ξ , let |e| denote the 1 length of e. Given a parameter α > 1, define the height function The term α −|g| is not crucial and is added just as a normalizing factor. With this, for any g ∈ G ξ and σ ∈ ξ , letting x ∈ be the midpoint of g, we obtain If σ is the ground state triangulation, then ξ g (σ ) = 1 for all g ∈ G ξ . We regard ξ as a height function for triangulations: given any triangulation σ ∈ ξ , ξ g (σ ) can be seen as a height value to the midpoint of g. Intuitively, for any g, a high value of ξ g (σ ) means that there are several long edges of σ that cross g. This indicates that in the neighborhood around g the triangulation σ is far from its ground state, since no edge in any ground state triangulation crosses g (aside from the edge sharing the same midpoint as g).

Statement of main result
The theorem below shows that there are values of α for which ξ g is a Lyapunov function. For this reason, in many parts of the paper we will refer to ξ g as the Lyapunov function. Let P σ = P ξ σ denote the probability measure induced by M λ σ ( ξ ), and let E σ = E ξ σ be the corresponding expectation.

Partition of triangulations and trees of influence
Fix any boundary condition ξ ∈ ( 0 ). Given a triangulation σ ∈ ξ and a midpoint x ∈ , we say that σ x is increasing if it is a flippable edge of σ and after flipping σ x we obtain a (strictly) larger edge. We could define decreasing edges in a similar way, however for technical reasons we need to include some constraint edges in the set of decreasing edges, namely the constraint edges which would be flippable and decreasing if they were not in ξ . We do this by calling σ x decreasing if it is not a unit diagonal and it is the largest edge of all triangles of σ containing σ x . Note that if σ x is decreasing according to the above definition and σ x / ∈ ξ , then σ x is flippable and after flipping σ x we obtain a (strictly) smaller edge. For any > R + and triangulation σ , define the following subsets of : is a unit diagonal and the largest edge of all triangles of σ containing σ x }.
Note that for any triangulation σ ∈ ξ and midpoint x ∈ F diag (σ ), we have that σ x is flippable but does not change its length after being flipped. Given a triangulation σ ∈ ξ , we define a collection of trees whose vertices are elements of . Each tree is rooted at a midpoint in F dec (σ ) ∪ F diag (σ ), and there will be two trees for each x ∈ F dec (σ ) ∪ F diag (σ ). We denote these trees by τ (1) (σ, x) and τ (2) (σ, x). To define τ (1) (σ, x) take one of the triangles of σ containing σ x . Denote this triangle by . The tree τ (2) (σ, x) will be defined analogously by considering the other triangle of σ containing σ x . The root of τ (1) (1) (σ, x) are the midpoints of the other two edges of . Then we proceed inductively. The children of a midpoint y with parent z in τ (1) (σ, x) are obtained by considering the triangle of σ containing σ y but not containing σ z . If σ y is not the largest edge of , then y has no child in τ (1) (σ, x); otherwise the children of y are the midpoints of the other edges of (see Fig. 6 for a reference). Note that, for any two midpoints y, z with y being a child of z in τ (1) (σ, x), we have that |σ z | > |σ y |. This guarantees that the construction above ends. Define τ (σ, x) as a tree rooted at x obtained by the union of τ (1) (σ, x) and τ (2) (σ, x). We call τ (σ, x) the tree of influence of x.
Although we used the term tree, it is not explicit from the construction above that τ (1) (σ, x), τ (2) (σ, x) and τ (σ, x) are actually trees. However, if we orient the edges from parents to children, since parents are associated to strictly larger edges than their children, the construction above is at least guaranteed to produce a directed acyclic graph. But we have not ruled out the case that a midpoint y is reached from two distinct paths from x (i.e., some vertices may have two parents). Proposition 3.1 below shows that this does not happen, hence the construction described above indeed produces trees. Given two midpoints y, z ∈ τ (σ, x), we will use standard terminology to say that y is an ancestor (resp., descendant) of z in τ (σ, x) if there exists a directed path in τ (σ, x) from y to z (resp., from z to y) using the orientation of edges described above. We will need one more definition. Partition Z 2 into 1 × 1 squares whose edges are parallel to the axes (i.e., each square is a faces of the square lattice). Let S be the set of these 1 × 1 squares. Given any edge e ∈ E ξ , let S(e) = {Q ∈ S : the interior of Q intersects e}.
Proposition 3.1 Consider any boundary condition ξ ∈ ( 0 ), any triangulation σ ∈ ξ , and any x ∈ F dec (σ ) ∪ F diag (σ ). The following statements hold: (ii) For any y, z ∈ τ (σ, x) with y being an ancestor of z, we have S(σ y ) ⊃ S(σ z ). Proof Consider the set of squares S(σ x ). Note that σ x partitions this set into two identical regions, which we denote by Q 1 and Q 2 . See Fig. 7a for a reference.
Note also that Q 1 and Q 2 are lattice polygons. Let Q * be all points of R 2 within distance . We obtain that Q * contains the same points of Z 2 as Q 1 ∪ Q 2 . Let (σ x , σ y 1 , σ y 2 ) be one of the triangles containing σ x (say, the one intersecting Q 1 ), and assume that y 1 and y 2 are the children of x in τ (1) (σ, x). We claim that all descendants of x in τ (1) In the discussion below, refer to Fig. 7b. Since y 1 , y 2 are children of x, we have that σ y 1 and σ y 2 have size smaller than σ x . This implies that the 2 length of σ x is at least √ 2. Let p denote the vertex of the triangle (σ x , σ y 1 , σ y 2 ) that is not an endpoint of σ x . Since the area of each triangle is equal to 1/2 and σ x has 2 length at least √ 2, the distance between p and σ x is at most √ 2 2 . Thus p must be inside Q * and, therefore, must be one of the vertices on the boundary of Q 1 . We can use p to partition Q 1 into three regions: Q 1 and the triangle (σ x , σ y 1 , σ y 2 ). Since the triangle (σ x , σ y 1 , σ y 2 ) cannot contain any integer point aside from its three vertices, we have that σ y 1 and σ y 2 are entirely contained in Q 1 . Doing this construction inductively for σ y 1 and σ y 2 , we establish that the descendants of y 1 are contained in Q (1) 1 and the descendants of y 2 are contained in Q (2) 1 , which establishes (9). Since Q (1) 1 and Q (2) 1 have disjoint interior, we obtain that τ (σ, x) does not contain any cycle, proving part (i). This also gives that For part (ii), let S 1 be the squares of S whose interior intersects Q (1) 1 , and let S 2 be the squares of S whose interior intersects Q (2) 1 . Note that S 1 ∩ S 2 = ∅ and S 1 ∪ S 2 = S(σ y ).
Also, S(σ y 1 ) = S 1 and S(σ y 2 ) = S 2 . Since the descendants of y 1 are contained in Q (1) 1 ⊂ S 1 , we obtain part (ii). For part (iii), applying (10) inductively we have y∈τ (1) The same reasoning applies to τ (2) For any triangulation σ ∈ ξ and any x ∈ , define the set In words, τ −1 (σ, x) is the set of midpoints z such that x is in the tree rooted at z. Note that in any tree containing x, the parent of x in the tree is a midpoint y such that σ y is the largest edge in the triangle containing both σ x and σ y .

Lemma 3.2
For any boundary condition ξ ∈ ( 0 ), any triangulation σ ∈ ξ and any x, y ∈ such that σ x , σ y are in the same triangle and σ y is the largest edge of this triangle, there exists exactly one tree containing both x and y, and y is the parent of x in that tree.
Proof We will show that we can construct a path z 0 , z 1 , z 2 , . . . of adjacent midpoints in σ (i.e., midpoints of edges sharing a triangle in σ ) from z 0 = x and z 1 = y until the root of the tree containing both x and y. This path will have the property that z i is the parent of z i−1 in the tree, for all i. Assume, inductively, that we have defined z 0 = x, z 1 = y, z 2 , z 3 , . . . , z i with the property that for all j = 1, 2, . . . , i we have that σ z j and σ z j−1 share the same triangle, for which the largest edge is σ z j . Let w be the midpoint of the largest edge in the triangle containing σ z i but not σ z i−1 . If w = z i or z i is contained in only one triangle in σ (the later implies that z i ∈ ξ as σ z i is at the boundary of the smallest lattice polygon containing 0 ), then σ z i is the largest edge in all triangles of σ containing σ z i and, consequently, and repeat this procedure. Note that |σ z i+1 | > |σ z i |, which implies that this procedure eventually ends, yielding the root of a tree containing x and y. It remains to show that this is the unique tree containing x and y. Since for each i ≥ 1 in the path z 0 , z 1 , . . ., we have that z i is the largest edge in the triangle containing σ z i and σ z i−1 , we obtain that σ z i cannot be a leaf in any tree and the only midpoint that can be a parent of z i in any tree is z i+1 . This establishes that, for all i ≥ 2, z i is an ancestor of y in any tree containing y, which implies that the root of the tree obtained by the above construction is the root of any tree containing σ y , completing the proof.
Proof Lemma 3.2 implies (i) since for any x there exists at least one and at most two midpoints z 1 , z 2 ∈ , not necessarily distinct from x, such that σ z 1 and σ z 2 are the longest edges in a triangle containing σ x . For (ii), note that the cardinality of τ −1 (σ, x) being two implies that x is not the root of a tree, and there are two midpoints z 1 , z 2 such that z 1 is the parent of x in one tree and z 2 is the parent of x in the other tree. Therefore, σ x has two distinct parents, one in each tree, implying that σ x cannot be the largest edge in any triangle of σ ; hence x cannot be the parent of any midpoint in any tree. This gives that x is a leaf in all trees containing x. For (iii), note that if x ∈ F inc (σ ), then there are two distinct midpoints z 1 , z 2 ∈ such that σ z 1 and σ z 2 are the largest edges in triangles containing σ x . Therefore, using Lemma 3.2, we have that z 1 and z 2 are the parents of x in the trees containing x, implying that x is contained in two trees. For (iv), note that if σ x , σ y , σ z is a triangle such that σ x is the largest edge, then there exists at most one midpoint that can be the parent of x in a tree: namely, the midpoint of the largest edge contained in a triangle with σ x , if that midpoint exists and is different than x. Therefore x can belong to only one tree.
For each x ∈ F dec (σ ) ∪ F diag (σ ), consider the following subset of Z 2 : T (σ, x) = union of all triangles of σ containing only edges whose midpoint is in τ (σ, x).

Proposition 3.4 For any boundary condition
Proof Proposition 3.3 (iv) gives that for any triangle σ x , σ y , σ z of σ , where σ x is the largest edge of this triangle, there exists only one tree containing x. Let τ (σ, w) be this tree. We have that x is the parent of both y and z in τ (σ, w), therefore T (σ, w) contains the triangle σ x , σ y , σ z , and the proof is completed.
Proof First consider the case of y 1 being the parent of y 2 in τ (σ, x), which gives that If y 2 = w 1 (see Fig. 8a), the lemma clearly holds since If y 2 = z 1 , then we use that σ z 1 , σ w 1 are part of the minimal parallelogram of σ y 1 . Refer to Fig. 8b. Let e be the edge opposite to σ w 1 in the minimal paralellogram of σ y 1 . Note that e may not belong to σ , and |e| = |σ w 1 |. We claim that e is in the minimal parallelogram of σ z 1 .
Using this claim, since σ w 2 is the smallest edge in the minimal parallelogram of σ y 2 = σ z 1 , we have |σ w 2 | ≤ |e| = |σ w 1 |, and the proposition follows when y 1 is the parent of y 2 . In the general case of y 1 not being the parent of y 2 , the proposition follows by applying the above reasoning inductively along the path from y 1 to y 2 in the tree τ (σ, x). It remains to establish (11). If e were an edge of σ and σ y 1 were flippable in σ (as illustrated in Fig. 8b), then σ y 1 would be a decreasing edge and, by flipping σ y 1 , we would obtain a triangulation in which σ z 1 and e are in the same triangle, whose largest edge is σ z 1 . This gives that e is part of the minimal parallelogram of σ z 1 , as claimed.

Crossings of ground state edges
In this section we consider a given edge g ∈ G ξ and establish geometric properties of the set of edges of a triangulation σ that intersect g; recall the definition of G ξ from (3). In particular, given one edge σ x intersecting g, one of our main results here gives that the edges of midpoint τ −1 (σ, x) also intersect g.
We will need the following useful facts from [5]. Fix any boundary condition ξ ∈ ( 0 ) and any midpoint x ∈ . Two edges e, f ∈ E ξ x are said to be neighbors if we can obtain e from f via a single flip; more formally, if there are σ, σ ∈ ξ such that σ x = e, σ x = f and σ y = σ y for all y = x. It is known that the graph with vertex set E ξ x and the neighborhood relation described above is a tree. This follows since, for any edge e ∈ E ξ x , there is at most one f ∈ E ξ x such that e and f are neighbors satisfying | f | < |e| (in which case we see f as the parent of e in the tree). We consider the ground state edges of E ξ x as the root of the tree, and it is possible that the tree has two neighboring roots, which are opposite unit diagonals. We will call this tree the tree induced by E ξ x . Given a boundary condition ξ ∈ ( 0 ) and a midpoint x ∈ , we denote byσ x the ground state edge of midpoint x given ξ (with an arbitrary choice among unit diagonals). Since ground state edges of distinct midpoints are all compatible with one another, we have thatσ = {σ x : x ∈ } is a ground state triangulation. In the lemma below we use the partial order on the set E ξ x , which is defined in (4), and the set of midpoints of constraint edges bc = ξ ∩ .

Proposition 4.1 Given any boundary condition
x such that e ≺ f , and any triangulation σ containing f , one can obtain a triangulation containing e by performing a sequence of decreasing flips from σ .
Proof Since the graph induced by E ξ x is a tree, there is a unique path f = h 1 h 2 · · · h k = e in this graph. We claim that there exists a sequence of decreasing flips from σ that produce a triangulation containing h 2 . With this the lemma follows since we can apply this claim repetitively for h 2 , h 3 , . . . until we obtain a triangulation containing e. Now we establish the above claim. If f is decreasing in σ , the claim follows since we can flip f to obtain h 2 . From now on assume that f is not decreasing, and let x be the midpoint of f . Let L x (σ ) be the sum of the 1 length of the edges of σ that cross S( f ), where the set S is defined in (8). Let y ∈ τ −1 (σ, x). We have that σ y is a decreasing and flippable edge. Otherwise y ∈ τ −1 (σ, x) would imply that σ y is a constraint edge, which gives that f is a ground state edge, contradicting that f e. Let σ be the triangulation obtained by flipping σ y in σ . By Proposition 3.1(ii), S( f ) ⊂ S(σ y ), hence σ y intersects S( f ). Using this and the fact that |σ y | ≤ |σ y | − 2 we obtain that Repeating these steps we obtain a sequence of triangulations so that the i-th triangulation in the sequence is obtained via a decreasing flip of an edge of the (i − 1)-th triangulation, and the value of L x monotonically decreases along the sequence. Since for any triangulation σ containing f we have that L x (σ ) ≥ | f |, we obtain that this procedure will eventually make f be a flippable and decreasing edge, establishing the claim.
The lemma below gives the first property of crossings of ground state edges. We denote by 1 (·) the indicator function.
Proof We show that if f ∩ g = ∅ then e ∩ g = ∅. If f does not intersect g, then there is a triangulation σ ∈ ξ so that g ∈ σ and σ x = f . Proposition 4.1 gives that we can perform a sequence of decreasing flips from σ until obtaining a triangulation σ with σ x = e since e f = σ x . Since g is in ground state, g is not flipped in this sequence. This implies that g is contained in σ and, consequently, cannot intersect e.
The following is a simple geometric lemma that we will need later.

Lemma 4.3
In any triangle of a lattice triangulation, the largest angle is at least π/2 and the other angles are at most π/4. Proof Without loss of generality, assume that 0 = [−n, n] 2 ∩ Z 2 and "empty" boundary condition (i.e., ξ contains only the unit horizontal and vertical edges at the boundary of 0 ). The lemma will follow for arbitrary choices of 0 and ξ since we can choose n large enough so that 0 ⊆ [−n, n] 2 ∩ Z 2 , which gives that the set of triangulations of 0 with any boundary condition ξ is contained in the set of triangulations of [−n, n] 2 ∩ Z 2 with empty boundary condition. Now this property clearly holds (with equality) for any ground state triangulation of [−n, n] 2 ∩ Z 2 . Proposition 4.1 implies that any triangulation σ ∈ can be obtained by a sequence of increasing flips from some ground state triangulation. Hence it suffices to show that the property in the statement of the lemma is preserved under increasing flips. Let and be two triangles sharing an edge e such that e is increasing. So e is the smallest diagonal of the parallelogram ∪ . Let and be the two new triangles obtained after flipping e. Note that the largest angles of and are larger than the largest angles of and . Moreover, the other angles of and are obtained by splitting angles θ, θ of , , respectively, where θ, θ are not the largest angle of , .
The next proposition gives an upper bound on the number of small edges intersecting a given ground state edge. For any triangulation σ ∈ ξ , any g ∈ G ξ , and any ∈ R + , let be the set edges of σ that intersect g and have length at most |g| + . Note that I g is a set of edges (rather than a set of midpoints), and the midpoints of the edges in I g (σ, ) are given by I g (σ, ) ∩ . A crucial property of the lemma below is that the bounds do not depend on |g|.

Proposition 4.4
Given any boundary condition ξ ∈ ( 0 ), any g ∈ G ξ and any triangulation σ ∈ ξ , all the following statements hold: (i) If an edge σ x of σ intersects g, then |σ x | ≥ |g|, with strict inequality when the midpoint of g is not x. (ii) For any ≥ 1, the midpoints of I g (σ, ) are contained in the ball of radius 2 centered at the midpoint of g.
The excluded region (blue shaded area) of edge g (iii) There exists a universal c > 0 such that for any ≥ 1 we have that the cardinality of I g (σ, ) is at most c 2 and the cardinality of σ ∈ ξ I g (σ, ) is at most c 4 .
Proof First we establish the lemma when g is either a unit horizontal, a unit vertical or a unit diagonal. Then (i) holds trivially since any edge with the same midpoint as g has length at least |g|, and an edge with midpoint different than g can only intersect g if its length is larger than √ 2 ≥ |g|. Parts (ii) and (iii) follows since any edge of length at most that intersects g must be completely contained inside a ball of radius |g| 2 + ≤ √ 2 2 + centered at the midpoint of g. Now let g be a ground state edge that is not a unit vertical, unit horizontal or unit diagonal. This means that g is constrained by a constraint edge e ∈ ξ ; that is, g ⊂ S(e). The proof uses the concept of excluded regions introduced in [5]. The excluded region of an edge g is obtained by taking its minimal parallelogram and considering the infinite strips between both pairs of opposite sides of the parallelogram, as illustrated by the shaded area in Fig. 9. The interior of the excluded region contains no point of Z 2 , cf. [5,Proposition 3.3]. The endpoints of the constraint edge e are in regions X and Y , which are the two components of the complement of the excluded region of g that contain an endpoint of g in their boundary, as illustrated in Fig. 9. Thus, all edges that intersect g must also have endpoint in X and Y , not to intersect e. This gives that any edge that intersects g must have length larger than |g|, establishing part (i). Now we establish part (ii). All edges in σ I g (σ, ) must have endpoints inside the intersection of X ∪ Y with the strip between the red dashed lines in Fig. 9, which are the lines perpendicular to g and at distance from the endpoints of g. The intersection of X ∪ Y and this strip forms two triangles X ⊂ X and Y ⊂ Y . Since the triangles in the minimum parallelogram of g have their two smallest angles of size at most π/4 (cf. Lemma 4.3), the angle of X at the endpoint of g is at most π/2. Therefore, X is contained inside an isosceles right triangle whose right angle is at the vertex of X which is an endpoint of g, and whose hypotenuse is in the red dashed line intersecting X . The length of the hypotenuse of this isosceles right triangle is 2 . Therefore, the midpoints of an edge with endpoints in X and Y is contained inside a × 2 rectangle centered at the midpoint of g and whose smallest edges are parallel to g. This rectangle is contained inside a ball of radius 2 centered at the midpoint of g.
Part (iii) follows since part (ii) implies that |I g (σ, )| ≤ c 2 for some universal constant c > 0. Also, since the area of each X and Y is at most 2 , the number of points of 0 inside each of X and Y is at most c 1 2 for some positive constant c 1 , which gives that σ ∈ ξ I g (σ, ) ≤ c 1 4 .
The geometric property below was the main inspiration for constructing the Lyapunov function (6). Roughly speaking, if an increasing edge σ x of σ that is not in ground state intersects a ground state edge g, then the decreasing edges in the same tree as σ x [i.e., the edges σ y for all y ∈ τ −1 (σ, x)] also intersect g. Hence each increasing edge can be mapped to a decreasing edge of larger length. Since only flips of increasing edges can increase the value of the Lyapunov function, we are able to show that when taking the expectation over all possible flips, each flip that increases the Lyapunov function is "compensated" by flips that decrease the Lyapunov function. Another fundamental property in the lemma below is that if σ x itself does not intersect g but the edge obtained by flipping σ x does, then g is also intersected by at least one of the decreasing edges in the same tree as σ x [i.e., there exists y ∈ τ −1 (σ, x) such that σ y intersects g].

Proposition 4.5 Fix any boundary condition
any midpoint x ∈ , and any ground state Moreover, if x ∈ F inc (σ ) and η is the triangulation obtained by flipping σ x in σ , we have that Proof We establish (12) by contradiction. Assume that x / ∈ F dec (σ ) ∪ F diag (σ ), otherwise x = z 1 = z 2 and the lemma follows trivially. Assume also that σ x = g, and that σ x intersects g but σ z 1 does not. This implies that there exists a triangulation that contains g and σ z 1 . Take ζ to be one such triangulation as following. Remove from σ all edges intersecting g, regard the edges of σ that were not removed as a new boundary condition, and define ζ to be a ground state triangulation containing g given this new boundary condition. Since a ground state triangulation (given any boundary condition) can be obtained by the union of ground state edges by Lemma 2.2, we obtain that ζ ≺ σ . Since σ x intersects g and σ x = g, we have |ζ x | < |σ x |. Also, since in σ we have that σ z 1 is the root of a tree containing σ x , we have that σ x is in ground state given σ z 1 . Since ζ z 1 = σ z 1 , then |ζ x | ≥ |σ x |, establishing a contradiction. The same reasoning applies to z 2 .
In order to establish (13), we assume that σ x does not intersect g but η x does, and show that this implies that either σ z 1 or σ z 2 must intersect g. Let w 1 , y 1 ∈ τ (σ, z 1 ) and w 2 , y 2 ∈ τ (σ, z 2 ) be such that σ x σ w 1 σ y 1 and σ x σ w 2 σ y 2 are triangles in σ . Note that if p 1 is the common endpoint of σ w 1 and σ y 1 , and p 2 is the common endpoint of σ w 2 and σ y 2 , then η x has endpoints p 1 , p 2 . Since η x intersects g and η x = g, it follows that g intersects at least one of σ w 1 , σ y 1 , σ w 2 and σ y 2 . Assume that g intersects σ w 1 . Applying the first part of the lemma with x = w 1 yields that g intersects σ z 1 .

Proposition 4.6
Fix any boundary condition ξ ∈ ( 0 ), any triangulation σ ∈ ξ and any ground state edge g ∈ G ξ . There is a sequence of non-increasing flips from σ that produces a triangulation containing g. Moreover, if ⊂ are the midpoints of the edges of σ that intersect g, then in this sequence only the edges of midpoint in are flipped. Remark 4.7 In the sequence of flips above, all flips are (strictly) decreasing unless when g ⊀ σ x , where x is the midpoint of g. In this case, g is a unit diagonal and the opposite unit diagonal g of midpoint x also belongs to G ξ . Then the sequence of flips consists of a sequence of decreasing flips that culminates in a triangulation containing g and its minimal parallelogram, and then a length-preserving flip of g to obtain g.
Proof of Proposition 4.6 Assume for the moment that g ≺ σ x , where x is the midpoint of g. We perform the same sequence of triangulations σ = η 0 , η 1 , η 2 , . . . as in the proof of Proposition 4.1 with e = g. In this sequence, η i is obtained from η i−1 by performing a decreasing flip of an edge of midpoint in intersects g for all i, Proposition 4.5 gives that all edges of midpoint in τ −1 (η i−1 , x) also intersect g. Therefore, all flipped edges in this sequence must intersect g.
When g ⊀ σ x , we have that g is a unit diagonal and the opposite unit diagonal g of midpoint x also belongs to G ξ ; otherwise for all f ∈ E ξ x we have g f . This gives that g σ x . From the previous case we obtain a sequence of triangulations σ = η 0 , η 1 , η 2 , . . . , η k such that η k x = g and, for all i, η i is obtained by performing a decreasing flip to an edge of midpoint in τ −1 (η i−1 , x). Since η i−1 x intersects g, we have that only edges intersecting g are flipped in this sequence. Now we claim that we can perform a sequence of decreasing flips from η k to obtain triangulations η k+1 , η k+2 , . . . , η such that η contains g and its minimal parallelogram. Using this the lemma follows since we can perform a length-preserving flip of g in η , which produces g. To establish the claim, let w 1 , w 2 , w 3 , w 4 be the midpoints of the edges in the minimal parallelogram of g. Note that there are exactly four edges h 1 , h 2 , h 3 , h 4 ∈ G ξ (which are unit horizontal and vertical edges) such that w i is the midpoint of h i for all i ∈ {1, 2, 3, 4}. The sequence of flips is obtained by applying the previous case for each h i ; i.e., at each step we perform a decreasing flip to an edge of midpoint in τ −1 (·, w i ) for some i ∈ {1, 2, 3, 4} until obtaining a triangulation contaning h 1 , h 2 , h 3 , and h 4 . It remains to show that in this sequence we only flip edges that intersect g. Note that any edge of a triangulation that intersects h i for some i must intersect either g or g . Since g belongs to all triangulations η k+1 , η k+2 , . . . , η and any edge flipped in this sequence intersects h i for some i, we have that all flipped edges intersect g, and the claim is established.

Proof of the Lyapunov function (Theorem 2.3)
During the proof of Theorem 2.3, we will need to treat small edges (edges smaller than some constant C) separately. We fix α ∈ (1, λ −1/2 ) and set C > 1 large enough so that the following two conditions hold: Also, we will need to handle "small trees" separately: trees whose root edge is smaller than some other constant C . After C has been fixed, set C large enough so that the following conditions hold: Throughout this section we fix an arbitrary boundary condition ξ ∈ ( 0 ) and a triangulation σ ∈ ξ . We need to introduce some notation. For any flippable edge x ∈ of σ , define = the length of the shortest edge different than σ x in a triangle of σ containing σ x .
Given any g ∈ G ξ , define where σ x stands for the triangulation obtained by flipping σ x in σ.
In words, F g dec (σ ) is the set of decreasing edges of σ that intersect g and F g inc (σ ) is the set of increasing edges of σ that either intersect g or get to intersect g after a flip.
[The fact that it is enough to define F g inc (σ ) in terms of σ x only is a consequence of Proposition 4.2.] Since the edges of G ξ are all compatible with ξ , we obtain that, unlike F dec (σ ), the set F g dec (σ ) contains no midpoint of λ bc . Let σ be the random triangulation obtained from σ by one step of the Glauber dynamics, and for x ∈ let σ x = the triangulation obtained by choosing x to be flipped in σ.
The triangulation σ x differs from σ x since σ x is a random triangulation (the probability that the flip actually occurs is λ |σ x x | λ |σx | +λ |σ x x | ), while σ x is a deterministic triangulation. Hence, We start estimating the expected change in g (σ ) incurred by flipping a given edge. For x ∈ , define and ρ g (σ, x) = 0 for all other x.
Lemma 5.1 Fix any boundary condition ξ ∈ ( 0 ), any triangulation σ ∈ ξ , any ground state edge g ∈ G ξ , and any midpoint x ∈ . We have Proof If x ∈ F diag (σ ), then σ x ∈ G ξ and, consequently, σ x only intersects g if the midpoint of g is x; hence, g (σ ) = g (σ x ) in this case. Assume henceforth that x / ∈ F diag (σ ). Then for any x such that σ x is a flippable edge we have that the absolute value of |σ x x | − |σ x | is 2ψ x . To see this, note that if w, y ∈ are such that σ w , σ y , σ x form a triangle of σ with |σ w | ≥ |σ y |, then ψ x = |σ y |. Thus if σ x is the largest edge of the triangle we have |σ x | = |σ w | + |σ y | and |σ x x | = |σ w | − |σ y |, otherwise we have |σ x | = |σ w | − |σ y | and |σ x x | = |σ w | + |σ y |. Therefore, the probability that σ x is actually flipped in σ x is .

Proof overview
Our goal is to show that x∈F g inc (σ ) ρ g (σ, x) can be bounded above by −c x∈F g dec (σ ) ρ g (σ, x) for some constant c < 1, and then apply Lemma 5.1 and (17) to establish Theorem 2.3. We will do this by comparing each ρ g (σ, x) with x ∈ F g inc (σ ) with ρ g (σ, z) for z being a root of a tree containing x (i.e., z ∈ τ −1 (σ, x)). Proposition 4.5 guarantees that there exists such a z for which z ∈ F g dec (σ ). Proposition 3.3(ii) and (iii) give that for any x ∈ F g inc (σ ), x is a leaf in all trees containing x, so in our proof we will restrict our attention to the roots and leaves of the trees.
The proof is split into sections. In Sect. 5.2 we bound above ρ g (σ, x) with x ∈ F g inc (σ ) in terms of ρ g (σ, z) with z ∈ τ −1 (σ, x) for small leaves (leaves σ x that are small enough in comparison to σ z ). In Sect. 5.3 we do the same for large leaves, which will require a more delicate proof. Then in Sect. 5.4 we combine the result of the previous two sections with (17) and establish that the expected change in the Lyapunov function can be written as a function of only the decreasing edges. In Sect. 5.5 we show that the value of the Lyapunov function can also be written in terms of the decreasing edges only. Combining these two results together gives that the expected change in the Lyapunov function can be written in terms of the value of the Lyapunov function. This is established in Sect. 5.6, completing the proof of Theorem 2.3.

Handling small leaves
For any z ∈ F dec (σ ) ∪ F diag (σ ), we will employ the following definition: where τ leaves (σ, z) are the leaves of τ (σ, z). The subscript sl above stands for "small leaves." In the lemma below, recall that ρ g (σ, z) < 0 for all z ∈ F g dec (σ ).

Lemma 5.2
Given any boundary condition ξ ∈ ( 0 ), any triangulation σ ∈ ξ , any z ∈ F g dec (σ ), and any g ∈ G ξ , we have If in addition we have |σ z | ≥ C , then the bound above can be simplified to Proof By Proposition 3.1(iii) we have that x∈τ sl (σ,z) |σ x | ≤ 2|σ z |. Then, since αλ < 1/α, we write Now let τ sl (σ, z) ⊆ τ sl (σ, z) be the set of midpoints x ∈ τ sl (σ, z) such that |σ x |−2ψ x ≤ C. Then for τ sl (σ, z) we use the simple bound When |σ z | ≥ C , using the condition on C in (15) we obtain For the other edges, we use the fact that |σ x | > ψ x , which implies that ψ x is the size of the smallest edge in the triangle containing σ x in τ (σ, z), and hence Proposition 3.5 gives that ψ x ≤ ψ z . Using this, we obtain For the edges in τ sl (σ, z)\τ sl (σ, z) we will also leverage on the fact that they are not small, applying the following technical estimate. Given any positive 1 Using that 2α −C < 1, and proceeding in the same way as above, we obtain If k = 1, then we have k i=1 α i = α 1 ≤ α S−C , and we can simply use the upper bound above. We apply this estimate twice, once for the elements of τ sl (σ, z)\τ sl (σ, z) that belong to τ (1) (σ, z) and another for the ones that belong to τ (2) (σ, z). Since we have that the sum of the |σ x | for x in each of these sets is at most S = |σ z |, applying this to the right-hand side of (20) yields x∈τ sl (σ,z)\τ sl (σ,z) Summing this and (19) establishes the lemma.

Large leaves and 1-dimensional configurations
As mentioned above, the most delicate part of the proof will be to etablish an upper bound on ρ g (σ, x) when x ∈ F g inc (σ ) is such that x belongs to a tree τ (σ, z) for which σ x and σ z have almost the same length. This is the case we treat in this section.
Here we only need to consider trees rooted at long edges. Fix a boundary condition ξ ∈ ( 0 ) and a ground state edge g ∈ G ξ . Consider the increasing edges σ x for which either both trees containing x have root in F g dec (σ ) and have length at least |g| + C , or one of them has root satisfying the conditions above and the other has root outside F g dec (σ ). In addition, only consider x that does not belong to τ sl (σ, z) for any z. More precisely, define Proposition 4.5 gives that the set F g dec (σ ) ∩ τ −1 (σ, x) has at least one element. We construct the following bipartite graph H with vertex sets X and F g dec (σ )\F |g|+C (σ ). [Recall the definition of F (σ ) from (7).] To avoid ambiguity, we will refer to the connections between pairs of vertices of H as links instead of edges; we reserve the word edges to the edges of a triangulation. There is a link between x ∈ X and has cardinality at most two [cf. Proposition 3.3(i)], the degree of x in H is at most two. Also each edge of midpoint z ∈ F g dec (σ )\F |g|+C (σ ) has length at least |g| + C > 3C, which gives that a leaf x ∈ τ leaves (σ, z)\τ sl (σ, z) must have size at least |σ z | − C > 2|σ z |/3. Since y∈τ leaves (σ,z) |σ y | = 2|σ z |, the set τ leaves (σ, z)\τ sl (σ, z) has at most two elements, which gives that the degree of z in H is at most two. Since all vertices of H have degree at most two, H is a graph formed by paths and cycles. 3 We will treat each path P of H individually. Since H is bipartite, the vertices of P must alternate between midpoints in X (which correspond to increasing edges of σ ) and midpoints in F g dec (σ )\F |g|+C (σ ) (which are decreasing edges of σ ). If the number of decreasing edges in P is at least as large as the number of increasing edges in P, then we can construct a one-to-one mapping between increasing and decreasing edges of P, which allow us to show a contraction in the Lyapunov function. The main challenge is when the number of increasing edges in P is larger than the number of decreasing edges (that is, the number of increasing edges is one plus the number of decreasing edges). In this case, we will show that the path must form a specific shape in σ , which implies that the path is long enough. Only with this we can establish a contraction in the Lyapunov function for this case. This is proved in Lemma 5.3.

Lemma 5.3
Let P = {w 1 , w 2 , . . . , w } be a path of H such that w 1 , w ∈ X . Then, Moreover, ψ w 1 = ψ w 2 = · · · = ψ w . We also obtain that H has no cycles. Proof Given P, we will construct a path of adjacent triangles 1 , 2 , . . . , k in σ starting from σ w 1 until reaching σ w , and such that it contains all edges σ w 1 , σ w 2 , . . . , σ w . We will show that this path of triangles must have a certain 1dimensional shape, which we illustrate in Fig. 10a. Now we construct the path of triangles. Let 1 be the triangle of σ containing σ w 1 and formed of edges of midpoint in τ (σ, w 2 ). Let σ x 1 and σ y 1 with |σ x 1 | ≥ |σ y 1 | be the other edges of 1 . Since σ w 1 is increasing, we have |σ x 1 | > |σ w 1 |. Let 2 be the other triangle containing σ x 1 in σ , and let σ x 2 , σ y 2 be the other edges of 2 with σ x 2 larger than σ y 2 . Then either σ x 1 is a decreasing edge or |σ x 2 | > |σ x 1 |. In the latter case, we look at the other triangle containing σ x 2 and repeat the procedure above until we reach a triangle j such that σ x j is a decreasing edge. Since w 1 ∈ X , it holds that x j = w 2 ; this must happen since at each step we cross the largest edge of the triangle, traversing a path in τ (σ, w 2 ) from the leaf w 1 to the root w 2 . This establishes a path of adjacent triangles from σ w 1 to σ w 2 . Similarly, we can find a path of adjacent triangles from the increasing edge σ w 3 to the decreasing edge σ w 2 and concatenate the two paths to obtain a path from σ w 1 to σ w 3 . Iterating this procedure we obtain a path of adjacent triangles from σ w 1 to σ w . Now define L to be the infinite line containing σ y 1 and L to be the infinite line that is parallel to L and contains the other endpoint of σ w 1 . We show that the union of the σ y j must lie on L ∪ L , and that each triangle j has all its vertices on L ∪ L (as illustrated in Fig. 10a). First assume that x 1 = w 2 , and let σ y 1 = (u, v) where u, v ∈ 0 and v = σ x 1 ∩ σ y 1 (refer to Fig. 10b). We claim that which is an edge colinear with σ y 1 and is illustrated by (v, p 1 ) in Fig. 10b. The reason for (21) is the following. Given σ x 1 , the third vertex of 2 must lie on a line L parallel to σ x 1 since the area of 2 is 1/2; this is the line containing p −1 , p 0 , p 1 in Fig. 10b. This line must pass through the vertex v + v − u since v − (v − u) = u pass through a similar line on the other side of σ x 1 . Let . . . , p −2 , p −1 , p 0 , p 1 , p 2 , . . . be the lattice vertices on L such that p 0 is the only such vertex in the minimal parallelogram of σ x 1 . Since x 1 = w 2 , then σ x 1 is not decreasing and p 0 is not a vertex of 2 . Let p 1 = v + v − u and define u ∈ Z 2 ∩ L such that σ w 1 = (u, u ). Note that for the same reason that (v, p 1 ) is a translate of σ y 1 , (u , p −1 ) is a translate of σ w 1 . If p −1 were a vertex of 2 , then But since |σ w 2 | ≥ 2C, we obtain |σ x 2 | ≥ |σ w 2 | which is a contradiction since x 2 ∈ τ (σ, w 2 ). Similarly, any point p −2 , p −3 , . . . in L cannot be a vertex of 2 ; otherwise it makes σ x 2 be too large. For a similar reason, any point p 2 , p 3 , . . . in L cannot be a vertex of 2 , otherwise we would have Therefore, p 1 must be the vertex of 2 giving that σ y 1 and σ y 2 are colinear, and establishing (21). Now, if x 1 = w 2 , then x 1 is decreasing and p 0 is the vertex of 2 .
In this case, x 1 is the diagonal of a paralellogram and, clearly, (u , p 0 ) is parallel to and has the same length as σ y 1 . Proceeding inductively, we obtain that the path of triangles must be between the two (green) parallel lines L and L in Fig. 10a, which also implies that H has no cycle. Also, it implies that ψ w i = |σ y 1 | for all i. Now we compute a lower bound on (the size of the path P). First notice that σ w 1 and σ w do not intersect g, otherwise their degree in H would be two. Also, if R is the region between L and L , and g is the closure of g (i.e., g is the union of g and its endpoints), then R\ g is not simply connected (i.e., g intersects both L and L ). The reason for this is that R must intersect g (because σ w 2 intersects g and is contained in R), but R does not contain any lattice point since R is part of the excluded region of σ w 2 . (See [5,Proposition 3.3] for the proof that the excluded region of any edge does not contain lattice points.) Let s = g ∩ L and s = g ∩ L be the points where g intersects L and L , and let r, r be the endpoints of σ w such that r ∈ L and r ∈ L . Clearly, s is between r and u in L, and s is between r and u in L . Recalling that σ w 1 stands for the triangulation obtained from σ by flipping σ w 1 , and since σ w 1 w 1 intersects g and |σ y 1 | ≤ |σ w 2 | − |σ w 1 | ≤ C, we have that Consequently, the number of edges σ y i on L that belongs to triangles of the path 1 , 2 , . . . is at least C −C C . Since for even j we have |σ w j | ≤ |σ w j−1 | + C, there must be at most C edges σ y i between σ w j and σ w j−1 . Therefore, we have that Proof Since H is bipartite, the midpoints in P must alternate between increasing and decreasing edges of σ . Also, if σ w i is increasing, then |σ w i | ≤ |σ w i−1 | ∧ |σ w i+1 |. By Lemma 5.3 we have that all ψ w i are the same; for simplicity we write ψ = ψ w i . If σ w is decreasing, then the lemma follows since each increasing σ w i can be associated with the decreasing edge σ w i+1 , and we can write Similarly, if σ w 1 is decreasing but σ w is increasing, then associate each increasing σ w i with the decreasing edge σ w i−1 , and the lemma follows by an analogous argument as in (22). It remains to establish the lemma when both σ w 1 and σ w are increasing. In this case, let j be such that σ w j is the smallest edge of σ with midpoint in P. Clearly, σ w j must be an increasing edge. The idea is to associate each increasing edge that is not σ w j to a different decreasing edge, and then split ρ g (σ, w j ) among all −1 2 decreasing edges of P. Since σ w j is the smallest edge, and is large enough, this extra addition can be controlled.
where in the inequality we used that σ w j is the smallest among all edges in P, and that there are κ terms in the summation. Now for i < j, associate each increasing edge σ w i to the decreasing edge σ w i+1 , obtaining where in the last inequality we use that 1 + 1/κ ≤ α from the condition on C in (15). For i > j, we associate each increasing edge σ w i to the decreasing edge σ w i−1 , and perform the same derivation as in (23). This completes the proof of the lemma.

Expected change in terms of decreasing edges
The next lemma puts together the results from Sects. 5.2 and 5.3 to show that the expected change in the Lyapunov function can be written as a function of only the decreasing edges, and only those that are large enough.

Lemma 5.5
There exists a positive constant c 1 = c 1 (α, C, C ) such that given any boundary condition ξ ∈ ( 0 ), any triangulation σ ∈ ξ and any ground state edge g ∈ G ξ , we have Remark 5.6 In Lemma 5.5, recall that ρ g (σ, z) < 0 for all z ∈ F g dec (σ ), which implies that Proof of Lemma 5.5 Among the increasing edges, only the ones in F g inc (σ ) can change the value of g (σ ), cf. (17). From Proposition 4.5, for any x ∈ F g inc (σ ) that is not in ground state, we have that there is a decreasing edge σ z so that x ∈ τ (σ, z) and σ z intersects g. Consequently, z ∈ F g dec (σ ). Note that σ z is not a constraint edge and is not in ground state, since no constraint edge can intersect g and no decreasing edge can be in ground state.
Let K ⊂ be defined as By Proposition 4.5, K includes all flippable edges that are not in ground state and either intersect g or will intersect g after being flipped. Let w be the midpoint of g. For the ground state edges of σ , only the one with midpoint w can intersect g. Therefore, from (17), we write We split K into two sets K big , K small . Define This set is related to the vertices of the graph H in Sect. 5.3. Also define We start with K small . Note that for all x ∈ K small ∩ F g inc (σ ), there exists an edge z ∈ τ −1 (σ, x)∩F g dec (σ ) such that |σ z | ≤ |g|+C . Hence, for each x ∈ K small ∩F g inc (σ ), we can associate one z ∈ τ −1 (σ, x) ∩ F g dec (σ ) such that |σ x | < |σ z | ≤ |g| + C . Thus, Note that for each x ∈ K small ∩ F g inc (σ ), either σ x or σ x x intersects g. In the first case, σ x belongs to the set I g (σ, C ), which is the set of edges of σ of size at most |g| + C that intersect g. By Proposition 4.4, we have |I g (σ, C )| ≤ c 1 C 2 , for some positive constant c 1 . For the case when σ x x intersects g but σ x does not, then one edge σ y in the same triangle as σ x must intersect g. Clearly, |σ y | ≤ |σ x | + ψ x ≤ |g| + C + ψ x , giving that σ y ∈ I g (σ, C + ψ x ). Since for each such edge σ y there are at most four other edges in the same triangle as σ y , we obtain for some positive constant c 2 = c 2 (α, C ). An important feature of the bound above is that it does not depend on |g|. Now for K big we have that Using Lemmas 5.2 and 5.4 we obtain Plugging this into (26), and using that Putting (25) and (27) together into (24) concludes the proof.

Long decreasing edges dominate the Lyapunov function
From Sect. 5.4 we have that the change in the Lyapunov function can be written as a sum of ρ g (σ, x) over all x such that σ x is decreasing and large enough. If this sum is small enough, then the Lyapunov function decreases in expectation. However, we want to write that the decrease in the Lyapunov function is a function of g (σ ), the value of the function. The next two lemmas are used to establish this. They show that g (σ ) can be written as a constant times a sum over decreasing edges.

Lemma 5.7
For any boundary condition ξ ∈ ( 0 ), any triangulation σ ∈ ξ and any z ∈ F dec (σ ), we have If |σ z | ≥ C , the bound above simplifies to Proof First, we decompose For the edges that are not small (i.e., the first sum in the right-hand side above), we use the tree of influence. If σ w 1 , σ w 2 , σ w 3 form a triangle in σ such that |σ w 1 | > |σ w 2 | ≥ |σ w 3 |, and we set δ = 1 α−1 , then In order to see this, note that |σ w 1 | = |σ w 2 | + |σ w 3 |, which gives that Let w 1 , w 2 , w 3 , w 4 be the children of z in τ (σ, z). Iterating (28), we obtain For the small edges, note that an edge of length crosses at most − 1 squares of S; recall the definition of S from the paragraph preceding (8). Proposition 3.1(ii) gives that for any w ∈ τ (σ, z) the descendants of w are contained in S(σ w ). Therefore, all descendants of w in the tree τ (σ, z) must amount to at most 5S(σ w ) midpoints since each square of S has 5 midpoints of . Let R ⊂ τ (σ, z) be the set of midpoints in τ (σ, z) whose edge has length smaller than C and whose parent has length larger than C; if no such midpoint of τ (σ, z) satisfies this condition, set R = {z}. By definition, no midpoint of R can be a descendant of another midpoint of R. Therefore, implying that the cardinality of R is at most 2|σ z |. Using this and the fact that the descendants of any w ∈ R have length at most |σ w | ≤ C we obtain In addition, if |σ z | ≥ C , we obtain where we used the condition on C from (15) in the second inequality, and the condition on C from (14) in the last inequality. Together with (29), this establishes the lemma.

Lemma 5.8
For any boundary condition ξ ∈ ( 0 ), any triangulation σ ∈ ξ , and any ground state edge g ∈ G ξ , if w is the midpoint of g, then where c is the constant in Proposition 4.4(iii).
Proof Since a decreasing flip decreases the length of an edge by at least 2, we have for any given midpoint x ∈ that [Recall the definition of E ξ x (σ, g) from (5).] We decompose g (σ ) using Proposition 4.5, which gives that all edges intersecting g must either be in ground state or be in trees rooted at edges that also intersect g. Letting w be the midpoint of g, we obtain We consider two cases, first when z ∈ F g dec (σ ) ∩ F |g|+C (σ ) and then when z ∈ F g dec (σ )\F |g|+C (σ ). For the first case, since all edges σ x in that sum are smaller than |g| + C and intersect g, Proposition 4.4(iii) yields For the second case, we apply Lemma 5.7 to obtain (32) Plugging (31) and (32) into (30) concludes the proof.

Finishing the proof
Proof of Theorem 2.3 Using Lemma 5.8 we have Using Lemma 5.5, since ρ g (σ, z) ≤ −α |σ z |−|g| /2 we have that if then there is a contraction on the expected change of g (σ ), where c 1 is the constant in Lemma 5.5. We can set a constant ψ 0 > 1 such that Then, whenever g (σ ) ≥ ψ 0 there is a contraction in the Lyapunov function, and using the second statement in Lemma 5.5 and (33) we have concludes the proof.

Direct consequences of the Lyapunov function
Throughout this section, we fix an arbitrary boundary condition ξ ∈ ( 0 ), an arbitrary triangulation σ ∈ ξ and an arbitrary ground state edge g ∈ G ξ , and we let α, ψ 0 and refer to the constants in Theorem 2.3. Since α, ψ 0 and all depend on λ, in the results below we omit dependences on α, ψ 0 and and highlight only dependences on λ. Let σ = σ 0 , σ 1 , σ 2 , . . . be a sequence of triangulations obtained from the Markov chain M λ σ ( ξ ), the edge-flipping Glauber dynamics with parameter λ, state space ξ , and initial configuration σ . Define good = ξ good = {η ∈ ξ : g (η) ≤ ψ 0 }. Theorem 2.3 establishes that g (η) contracts in expectation for all η / ∈ good . We denote by π = π ξ the stationary measure of M λ ( ξ ), see (1). For any function f : ξ → R, we denote by π( f ) = σ ∈ ξ π(σ ) f (σ ) the expectation of f with respect to π . The first proposition establishes that if the initial configuration σ does not belong to good , then very quickly the Glauber dynamics enters the set good . Proposition 6.1 Fix any boundary condition ξ ∈ ( 0 ), any initial triangulation σ ∈ ξ and any ground state edge g ∈ G ξ . If T = min{t ≥ 0 : σ t ∈ good }, then Consequently, there exist a constant 0 = 0 (λ) > 0 so that for any ≥ 0 , we have Proof For all t ≥ 0, define the random variable Letting F t be the σ -algebra generated by σ 0 , σ 1 , . . . , σ t , we have for all t ≥ 1 for which T ≥ t that Consequently, X t is a supermartingale, which gives that and since g (σ ) ≥ 1 for all σ ∈ ξ . Plugging the bound on E σ (X t ) from (36) into (37), and taking the limit as t → ∞ in (37) establishes (34). The statement in (35) is a simple application of Chernoff's inequality using (34), which gives The result follows for all ≥ 0 where 0 is the smallest positive number such that (1 + /x) 0 x ≥ e for all x ≥ 1. Proposition 6.2 Fix any boundary condition ξ ∈ ( 0 ), any initial triangulation σ ∈ ξ and any ground state edge g ∈ G ξ . There exists a constant c = c(λ) > 0 such that for any t ≥ 1 we have Consequently, π( g ) ≤ c.
Proof Let μ be any distribution on triangulations, and let μ be the distribution after one step of the Markov chain starting from a random triangulation distributed according to μ. For any function f : ξ → R and any ⊂ ξ , we denote by μ( f ; ) the expectation of f with respect to μ under the set ; formally, μ( f ; ) = η∈ f (η)μ(η). Using this notation, we write Then, for η, η ∈ ξ , letting p(η, η ) be the probability that the Markov chain moves from η to η in one transition, we write where c 1 is the constant from Lemma 5.5 (see Remark 5.6). Hence, Applying the lower bound on μ( g ; c good ) from (38) we obtain Fix any initial triangulation σ 0 = σ ∈ ξ , and consider the sequence . Clearly, X t is deterministic given σ , and the equation above gives that for all t, which implies the proposition.
The following two simple propositions establish that if a triangulation σ is such that g (σ ) is small, then the largest edge of σ intersecting g and the number of edges of σ intersecting g are both small.

Proposition 6.3 (Largest intersection)
Given any boundary condition ξ ∈ ( 0 ), any triangulation σ ∈ ξ and any ground state edge g ∈ G ξ , the largest edge of σ that intersects g has length at most |g| + Proof If an edge σ x intersects g, then g (σ ) ≥ α |σ x |−|g| , which establishes the lemma.

Proposition 6.4 (Number of intersections) Given any boundary condition ξ ∈
( 0 ), any triangulation σ ∈ ξ and any ground state edge g ∈ G ξ , the number of edges of σ that intersect g is at most g (σ ).

Applications of the Lyapunov function 7.1 Tightness of local measures
To avoid a cumbersome statement of the theorem below, in this section we only consider the special case where 0 is the n × n square [−n/2, n/2] 2 ∩ Z 2 , which we denote by 0 n . For 0 n , let n denote the set of triangulations with vertices in 0 n , let n be the set of midpoints of the edges of some triangulation in n , and let π n be the stationary measure over triangulations in n with parameter λ. Consider that ξ is the free boundary condition; i.e., ξ only contains the horizontal and vertical edges that form the boundary of the n × n square. To emphasize this, we will drop ξ from the notation.
Here we want to study how the configuration of edges inside a fixed neighborhood around the origin behaves as n goes to infinity. In particular, does the measure over such local configurations converge as n → ∞? We will show via the Lyapunov function that these measures are tight as n → ∞.
For any k > 0, let ϒ k = [−k/2, k/2] 2 ∩ n be the set of midpoints inside [−k/2, k/2] 2 . Let k be the set of configurations of disjoint edges of midpoint in ϒ k such that for any γ ∈ k there exists at least one n ≥ k and one triangulation σ ∈ n such that the edges in γ are the edges of σ ϒ k , the edges of σ whose midpoints lie in ϒ k . More formally, Finally, let π k n be the stationary measure projected onto k ; that is, for any γ ∈ k , we have where Z k n is a normalizing constant to make π k n a probability measure over k .
Proof Let H ⊂ G be the set of vertical and horizontal ground state edges forming the (outer) boundary of ϒ k . Using Proposition 6.3, the largest edge of a triangulation σ ∈ n that intersects the boundary of [−k/2, k/2] 2 has length at most Therefore, taking expectation over σ ∈ n according to the stationary measure π n , we have that the expected value for the largest edge crossing an edge of H is at most where the inequality follows by Jensen's inequality and Proposition 6.2. Since the bound above does not depend on n, Markov's inequality gives that for any δ > 0 there exists L such that with probability at least 1 − δ, a triangulation σ distributed as π n is such that the edges in σ ϒ k are contained inside [−L/2, L/2] 2 . Since L does not depend on n, the tightness of π k n is established.
A consequence of the proposition above is that π k n has subsequential limits. An interesting open problem is whether the limit is unique, which would establish the existence of an infinite random lattice triangulation in the whole λ < 1 regime. For small enough λ, this holds and follows from the decay of correlations obtained in [5,Theorem 4.5].

Ground state probability
The theorem below establishes that, given any midpoint x ∈ , the probability that the edge of midpoint x is in ground state given any boundary condition (even boundary conditions containing arbitrarily long edges that are very close to x), is bounded away from zero by a constant independent of the boundary condition. This will be used later in Theorem 8.3 to establish decay of correlations in thin rectangles. Theorem 7.2 Fix any boundary condition ξ ∈ ( 0 ), and any ground state edge g ∈ G ξ . For any λ ∈ (0, 1), there exists a positive constant δ = δ(λ) such that if σ is a random triangulation distributed according to π ξ , we have π ξ (g ∈ σ ) ≥ δ.
Also, Proposition 4.6 gives that in this sequence we only flip edges that intersect g. Let g (η) be the length of the largest edge of η intersecting g. Proposition 6.3 gives that log α ≤ |g| + log(2c 2 ) log α for all η ∈ ξ .
Using Proposition 4.4(ii) we obtain that the midpoints of the edges crossing g in any η ∈ ξ must belong to a ball centered at x of radius 2 log(2c 2 ) log α . Hence, there exists a constant c 3 = c 3 (λ) such that the number of midpoints of inside this ball is at most c 3 . This implies that the number of different triangulations η ∈ ξ that map to the same φ(η) is (by Anclin's bound, Lemma 2.1) at most 2 c 3 .

Exponential decay of edge length
In the next theorem we show that after running the Markov chain for a long time, given any ground state edge g, the length of the edges crossing g are not much larger than |g|. This shows that the Markov chain quickly gets to a triangulation where edges are close to their ground state.

Theorem 7.3 (Tail of intersecting ground state)
Let ξ ∈ ( 0 ) be any boundary condition, and g ∈ G ξ be a ground state edge of midpoint x ∈ . Fix any λ ∈ (0, 1). Let σ ∈ ξ be any initial triangulation, and σ 0 = σ, σ 1 , σ 2 , . . . be a sequence of triangulations obtained by the Markov chain M λ σ ( ξ ). There exists a positive constant c = c(λ) such that for any t ≥ 1 and any ≥ 0, we have Proof The proof is a simple application of Markov's inequality to Proposition 6.2, which gives that the left-hand side above is at most Corollary 7.4 (Tail at a given time) Let ξ ∈ ( 0 ) be any boundary condition, x ∈ be any midpoint, and g ∈ G ξ be a ground state edge of midpoint x. Fix any λ ∈ (0, 1). Let σ ∈ ξ be any initial triangulation, and σ 0 = σ, σ 1 , σ 2 , . . . be a sequence of triangulations obtained by the Markov chain M λ σ ( ξ ). There exists a positive constant c = c(λ) such that for any t ≥ 1 and any ≥ 0, we have Consequently, taking the limit as t → ∞, we obtain for a random triangulation σ distributed according to π ξ that π ξ (|σ x | ≥ |g| + ) ≤ cα − .

Crossings of small triangles
To simplify the statement of the theorem below, consider that 0 n is the set of integer points inside [−n/2, n/2] 2 . Let n be the set of midpoints of the edges of a triangulation of 0 n . Let ξ ∈ ( 0 n ) be any boundary condition, ξ n be the set of triangulations of 0 n consistent with ξ , and π ξ n be the stationary measure of M λ ( ξ n ). Let σ ∈ ξ n be any triangulation. We say that two triangles of σ are adjacent if they share an edge. In [5], decay of correlations for all λ small enough is established by showing the existence of crossings of triangles whose edges are all in ground state. It is not clear whether this holds for all λ < 1. The two theorems below establish a weaker version of this. First consider the case of ξ being the free boundary condition. The theorem below establishes that, with high probability, a triangulation sampled from π ξ n contains a left-to-right crossing of adjacent triangles, where all edges in the triangles are smaller than some constant depending only on λ. Theorem 7.5 Let ξ be the free boundary condition, and fix any λ ∈ (0, 1). Let σ be a random triangulation distributed according to π ξ n . Let C(σ, L) be the event that there exists a path of adjacent triangles in σ that intersects both the left and right boundaries of 0 n and such that the edges of the triangles have length at most L. Then, there exist positive constants c = c(λ) and L 0 = L 0 (λ) such that for all L ≥ L 0 we have The theorem above is a consequence of the following, more general theorem which establishes that crossings of small triangles occur even in thin slabs inside 0 n .

Theorem 7.6
Let R be a m × k rectangle inside 0 n , where m = m(n) ≥ k = k(n). Consider any boundary condition ξ ∈ ( 0 n ) that does not intersect R, and take any λ ∈ (0, 1). Let σ be a random triangulation distributed according to π ξ n . For any L ≥ 1, let C R (σ, L) be the event that there exists a path of adjacent triangles in σ that intersect both the left and right boundaries of R and such that the edges of the triangles are contained inside R and have length at most L. Then, there exist positive constants c = c(λ), c = c (λ), L 0 = L 0 (λ) and m 0 = m 0 (λ, L) such that for all m ≥ m 0 , all k ≥ c log(m) and all L ≥ L 0 we have Proof Let W be a large enough constant depending on λ, but independent of k, m, n.
Partition R into squares of side length W , such that each midpoint of n belongs to exactly one square; in order to allow the squares to completely partition R, we let the squares close to the boundary of R be rectangles with sides of length between W and 2W (for simplicity we will continue to refer to them as squares). Consider an arbitrary order of the squares and let Q i denote the ith square. Let G i be the event that all edges of midpoint inside Q i have length at most L, and let G gs i be the event that all edges of midpoint inside Q i are in ground state given ξ . For any event F for which F ∩ G gs i = ∅, we obtain that where the second inequality follows from the second part of Corollary 7.4 for some constant c 1 > 0, and α comes from Theorem 2.3. We set L = L(W ) as a function of W so that L ≤ W/100 but 5W 2 c 1 α −L(W ) → 0 as W → ∞. Let C R (σ, L) be the event that there exists a path of adjacent squares such that G i holds for each square Q i in the path and there are two squares in the path containing midpoint of the left and right boundaries of R. Clearly, π ξ n (C R (σ, L)) ≥ π ξ n (C R (σ, L)).
By planar duality, if C R (σ, L) does not hold, then there must exist a dual path of * -adjacent squares such that G i does not hold for each square Q i in the dual path and there are two squares in this path containing midpoints of the top and bottom boundaries of R. A * -adjacent path of squares is a sequence of squares so that two consecutive squares in the sequence intersect in at least one point. Such a path must contain at least k W squares. We say that a path of (not necessarily adjacent) squares Q j 1 , Q j 2 , Q j 3 , . . . is an invasive path if, for all i, we have that G j i does not hold and Q j i+1 is * -adjacent to a square Q k for which there is an edge of midpoint in Q j i intersecting Q k . We say that an invasive path is a top-to-bottom invasive path in R if it starts with a square containing a midpoint in the top boundary of R and ends with a square containing a midpoint whose edge intersects the bottom boundary of R. Note that the existence of a dual top-to-bottom path of * -adjacent squares as described in the beginning of the paragraph implies the existence of a top-to-bottom invasive path in R.
Letting I denote the set of indices i such that Q i contains a midpoint in the top boundary of R, we have π ξ n (C R (σ, L)) ≥ 1 − π ξ n (there is a top-to-bottom invasive path in R) ≥ 1 − i∈I π ξ n (there is a top-to-bottom invasive path in R starting from Q i ). (40) For two squares Q i , Q j let d(Q i , Q j ) be the length of the shortest path of * -adjacent squares from Q i to Q j . For each event F such that G gs i ∩ F = ∅ the probability that an edge of midpoint where the last inequality follows from the second part of Corollary 7.4. Hence, Let p = 5W 2 c 1 α −( −1)W for ≥ 2. For = 1, let p = 5W 2 c 1 α −L , which is the bound in (39) for the probability that G i does not hold. Therefore, the probability that a given top-to-bottom invasive path Q j 1 , Note that, by definition of invasive paths, i ≥ 2 for all i. The number of invasive paths with a given sequence 2 , 3 , . . . , κ is at most κ i=2 (2 i + 2) 2 . We put both expressions together, and set W large enough so that (2 i + 2) 2 p i −1 ≤ e −c 2 i for some positive constant c 2 (that increases with W ) and all i, which yields For the path to go from the top boundary to the bottom boundary of R we need that Setting W large enough, which causes c 2 to be large enough, we obtain for some constant c 3 > 0. Noting that the cardinality of I is at most m + 1 and that k ≥ c log m for some large enough c, depending on W , concludes the proof.

Applications to triangulations of thin rectangles
In this section we apply our Lyapunov function to study asymptotic properties of triangulations of thin rectangles; i.e., triangulations of the integer points in [−n/2, n/2] × [0, k] as n → ∞ while k is kept fixed. Define 0 n,k to be the set of integer points in [−n/2, n/2] × [0, k] and n,k to be the set of midpoints of a triangulation of 0 n,k . Given any set of constraint edges ξ ∈ ( 0 ), let ξ n,k be the set of triangulations of 0 n,k compatible with ξ.
We say that a triangulation σ ∈ ξ n,k has a top-to-bottom crossing of unit verticals if σ contains k unit vertical edges with the same horizontal coordinate. As in (1), for any λ, we denote by π ξ n,k the stationary measure of M λ ( ξ n,k ).

Vertical crossings
Our first goal is to show that for any λ ∈ (0, 1) a typical triangulation contains many top-to-bottom crossings of edges that are unit verticals and that the stationary measure has decay of correlations. Theorem 8.1 Let m = m(k) be large enough, and let R be an m × k rectangle inside [−n/2, n/2] × [0, k]. Consider an arbitrary boundary condition ξ ∈ ( 0 n,k ) such that no edge of ξ intersects R, and take any λ ∈ (0, 1). For any triangulation η ∈ ξ n,k , let C R (η) be the number of disjoint top to bottom crossings of unit verticals of η that are inside R. Let σ be a random triangulation distributed according to π ξ n,k . Then there exist positive constants c = c(λ, k) and δ = δ(λ, k) ∈ (0, 1) such that, for any large enough m, we have Proof Let W > 0 be a large enough constant (independent of m). Partition R into slabs of width W ; i.e., each such slab is a translate of [0, W ] × [0, k]. For the ith slab, let i be the set of midpoints of the ith slab with the smallest horizontal coordinate; we assume that W is set in such a way that i only contains midpoints for which the ground state edge is a unit vertical. We will sample the edges of i for each i, in order. We may need to skip some values of i if edges in previous slabs turn out to be long edges. In order to do this, define the random variable A i ≥ 1, such that A i = j iff slab i + j is the first slab to the right of i not to be intersected by an edge of midpoint in i . Let F i be the σ -algebra generated by {σ x } x∈ i j=1 j . Let V i be the event that the edges of midpoint in i are all unit verticals. We will look at events F ∈ F i−1 for which F ∩ V i = ∅, this means that under F the ground state configuration of i is unit verticals. For any x ∈ i and any i, denote byσ x the (ground state) unit vertical edge whose midpoint is x. Thus, for any event F ∈ F i−1 for which F ∩ V i = ∅ and any j ≥ 2, we have that Using Markov's inequality, we obtain where c does not depend on W . We set W large enough so that we can find a β = β(W ) ∈ (0, 1) for which Consequently, π ξ n,k A i = 1 | F ≥ β. In other words, A i is stochastically dominated by a geometric random variable of parameter β, uniformly over F ∈ F i−1 for which F ∩ V i = ∅. Using Theorem 7.2 for each x ∈ i we obtain a constant c 1 > 0 that is independent of m and k so that Let A 1 , A 2 , . . . be i.i.d. geometric random variables of parameter β. We define a sequence of random variables k 1 , k 2 , . . . inductively as follows. Let k 1 = 1. Assume that k j has been defined. Sample A k j and A k j in a coupled way so that A k j ≤ A k j . Given A k j , sample the edges of midpoint in k j . Set k j+1 = k j + A k j , and iterate. Define the stopping time In other words, k τ is the first value of k falling outside R. Let S n, p be a binomial random variable of parameters n and p. Then, setting δ = e −c 1 k β/(2W ), we have π ξ n,k (C R (σ ) ≤ δm) ≤ π ξ n,k ({τ < 2βm/(3W )} ∪ {S 2βm/(3W ),e −c 1 k ≤ δm}) ≤ π ξ n,k (τ < 2βm/(3W )) + π ξ n,k (S 2βm/(3W ),e −c 1 k ≤ δ).
The first term is the probability that a sum of 2βm/(3W ) i.i.d. geometric random variables of success probability β is larger than m W − 1, which using Lemma 9.2 with = 1 2 − 3W 2m ∈ (1/3, 1/2) gives π ξ n,k (τ < 2βm/(3W )) ≤ exp − The second term is the probability that a Binomial random variable is smaller than 3/4 of its expectation, which can be bounded above using Lemma 9.1, yielding π ξ n,k (S 2βm/(3W ),e −c 1 k ≤ δm) ≤ exp − A similar proof establishes that we can couple two triangulations so that they have the same vertical crossing.

Theorem 8.2
Let m = m(k) be large enough, and let R be an m × k rectangle inside [0, n] × [0, k]. Consider two arbitrary boundary conditions ξ, ξ ∈ ( 0 n,k ) such that no edge of ξ ∪ ξ intersects R. Take any λ ∈ (0, 1). Let σ and σ be two random triangulations distributed according to π ξ n,k and π ξ n,k , respectively. Then there exist positive constants c = c(λ, k) and δ = δ(λ, k) ∈ (0, 1) such that, for any large enough m, we can couple σ and σ such that the probability that σ, σ have less than δm equal top to bottom crossings of unit verticals in R is at most e −cm .
Proof The proof is similar to the proof of Theorem 8.1. We only need to define the A i so that A i = j iff slab i + j is the first slab to the right of i not to be intersected by any edge of σ and σ with midpoint in i , and also need to define V i as the event that both σ and σ have unit verticals at edges of midpoint in i . Then (41) translates to the bound P(A i ≥ j | F) ≤ 2kcα −( j−1)W +1 , whereas (43) holds with no change since the bound there holds uniformly on F ∩ V i = ∅.

Decay of correlations
The theorem below establishes decay of correlations for lattice triangulations in thin rectangles uniformly on the boundary conditions. We denote by the horizontal distance between two points the distance between their horizontal coordinates (ignoring their vertical coordinates).

Theorem 8.3 (Decay of correlations)
Consider any region Q ⊂ [−n/2, n/2] × [0, k] and let ϒ = Q ∩ n,k be the set of midpoints in Q. Take any λ ∈ (0, 1). Let ξ, ξ ∈ ( 0 n,k ) be two boundary conditions that do not intersect Q, and let m be the horizontal distance between Q and the edges of ξ ∪ ξ . Let σ and σ be two random triangulations distributed according to π ξ n,k and π ξ n,k , respectively, and let σ ϒ and σ ϒ denote the configuration of the edges of midpoints in ϒ in σ and σ , respectively. Then there exist a positive constant c = c(λ, k) and a coupling P between π ξ n,k and π ξ n,k such that P(σ ϒ = σ ϒ ) ≥ 1 − e −cm .
Proof The proof uses Theorem 8.2. Let R be the rectangle of height k between the leftmost point of Q and the rightmost point of ξ ∪ ξ that is to the left of Q. Note that R is a m × k rectangle with m ≥ m. We can apply Theorem 8.2 with this choice of R to show that if we sample the edges with midpoint in R from left to right, with probability at least 1 − e −c 1 m for some constant c 1 > 0, at some time we sample the same top-to-bottom crossing of unit verticals in both σ and σ . Then we repeat the same argument with R being the rectangle between the rightmost point of Q and the leftmost point of ξ ∪ ξ that is to the right of Q. If it turns out that, during the construction described in the coupling above, σ and σ at some moment sample the same top-to-bottom crossing of unit verticals inside R, and similarly inside R , then letting ϒ denote the set of midpoints between these two crossings we obtain that we can couple σ, σ so that they coincide in ϒ . Since ϒ ⊇ ϒ, the theorem is established.
We remark that, already in the one-dimensional case k = 1, such a strong decay of correlation does not hold for any λ ≥ 1. In this case, there is a bijection between the set of one-dimensional lattice triangulations n,1 and the set of (1 + 1)-dimensional lattice paths, so that when λ = 1 a random triangulation represents a random walk path of length 2n with endpoints at the origin. Consequently, in this situation, the presence of any edge of length will influence a region of order 2 around its midpoint.

Local limits
In Theorem 7.1 we showed that the measure on local configurations of a sequence of lattice triangulations for any λ ∈ (0, 1) is tight. In the case of triangulations of thin triangles, taking advantage of decay of correlations (cf. Theorem 8.3), we can establish the existence of a unique local limit.
We adapt the definitions from Sect. 7.1. For any such that 0 < < n, let ϒ = [− /2, /2] × [0, k] ∩ n be the midpoints inside [− /2, /2] × [0, k], and let be the set of configurations of disjoint edges with midpoint in ϒ such that for any γ ∈ there exists at least one n and one triangulation σ ∈ n,k such that γ = σ ϒ , where we recall that σ ϒ denotes the set of edges of σ whose midpoints belong to ϒ . Let π n,k be the stationary measure over triangulations of n,k of the edges with midpoint in ϒ . More precisely, for any γ ∈ , we have π n,k (γ ) = 1 Z n,k σ ∈ n,k : σ ϒ =γ π n,k (σ ), where Z n,k is a normalizing constant to make π n,k a probability measure over .
Therefore, under this event, the -th neighborhood around v n in G n,k has only edges of midpoints inside A n . But the set of edges of midpoints inside A n converge as n → ∞ by Theorem 8.4, concluding the proof.
We call the random graph G k the infinite lattice triangulation on slabs. We can show that the degree of a given vertex of the infinite lattice triangulation on slabs has an exponential tail.

Theorem 8.6
For any given ρ ∈ 0 ∞,k , let d G k (ρ) be a random variable denoting the degree of ρ in a graph distributed according to G k . Then there exists a positive constant c such that for any ≥ 0 we have that P(d G k (ρ) ≥ ) ≤ exp(−c ).
Proof Take n large enough so that ρ ∈ n,k . Let be the set of ground state horizontal and vertical edges forming the 2 × 2 square centered at ρ. Then the degree of ρ is at most 8 plus the number of edges intersecting edges of . Since this last random variable has an exponential tail for all large enough n by Theorem 7.3 and Proposition 6.4, the proof is completed.
It was shown by Gurel-Gurevich and Nachmias [11] that any distributional limit of graphs where the degrees have an exponential tail is a recurrent graph almost surely. Therefore, the two theorems above imply the corollary below. We remark that the below corollary can also be obtained via a direct proof, by establishing that top-tobottom crossings of ground-state squares (1×1 squares with a unit diagonal) occur infinitely often, which follows from decay of correlations, Theorem 8.3 above.

Corollary 8.7
For any integer k ≥ 1 and any real number λ ∈ (0, 1) the infinite lattice triangulation with parameter λ on k-slabs is almost surely recurrent.

Open problems
• In Theorem 8.4 we show that the local limit of random triangulations on thin rectangles exist. In the case of n × n triangulations, our results only give that subsequential limits exists (cf. Theorem 7.1). An interesting open problem is to establish whether for any λ ∈ (0, 1) there exists a unique measure π ∞ over so that π n converges to π ∞ as n → ∞? • In the context of Theorems 7.5 and 7.6, establish the existence of crossings of small triangles in the presence of arbitrary boundary conditions, where small refers to the difference between the length of the edges in the triangles and their ground state. • Establish decay of correlations (in the context of Theorem 8.3) and the corresponding results for local limits and distributional limits of the induced graph (Theorems 8.4-8.6) for triangulations of n ×n. One important step is Theorem 7.6, which shows that crossings of small triangles are likely to exist. One can use this to construct crossings that surround the boundary condition, in an attempt to block its influence. However, Theorem 7.6 gives no control on the actual shape of the crossings (besides that they are composed of small triangles). This does not rule out that, in principle, information could propagate from the boundary to the outside of the region surrounded by the crossing, contradicting decay of correlations.