Commun. Math. Phys. 287, 1–40 (2009) Digital Object Identifier (DOI) 10.1007/s00220-008-0598-y
Communications in
Mathematical Physics
Mating Non-Renormalizable Quadratic Polynomials Magnus Aspenberg1, , Michael Yampolsky2, 1 Mathematics Division, RTH-Royal Institute of Technology, st-10044 Stockholm, Sweden 2 Mathematics Department, University of Toronto, 40 St George Street, Toronto,
ON, M5S 2E4, Canada. E-mail:
[email protected] Received: 27 January 2008 / Accepted: 14 April 2008 Published online: 16 August 2008 – © Springer-Verlag 2008
Abstract: In this paper we prove the existence and uniqueness of matings of the basilica with any quadratic polynomial which lies outside of the 1/2-limb of M, is nonrenormalizable, and does not have any non-repelling periodic orbits.
1. Introduction 1.1. Two definitions of mating. The idea of mating quadratic polynomials was introduced by Douady and Hubbard [Do2] as a way to dynamically parameterize parts of the parameter space of quadratic rational maps by pairs of quadratic polynomials. We will present several different ways of describing the construction, which lead to equivalent definitions in the case which is of interest to us. Consider two quadratic polynomials f 1 (z) = z 2 + c1 and f 2 (z) = z 2 + c2 whose Julia sets J1 and J2 are connected and locally connected. For i = 1, 2 denote i the Böttcher coordinate at infinity ˆ i → C\ ˆ D, ¯ i : C\K where K i is the filled Julia set of f i . It gives a conjugation i ◦ f i (z) = (i (z))2 , for i = 1, 2. Carathéodory’s Theorem implies that i−1 extends to a continuous parameterization ∂D → Ji . Setting γi : t → i−1 (e2πit ) ∈ Ji , The first author was partially supported by the Foundation Blanceflor Boncompagni-Ludovisi, née Bildt and by the Fields Institute. The second author was partially supported by an NSERC Discovery Grant.
2
M. Aspenberg, M. Yampolsky
we have f i (γi (t)) = γi (2t).
(1.1)
The topological space X = (K 1 K 2 )/(γ1 (t) ∼ γ2 (−t)) is obtained by glueing the two filled Julia sets along their boundaries in reverse order. Note that by (1.1) the dynamics of f 1 | K 1 and f 2 | K 2 correctly defines a dynamical system F : X → X, F = ( f 1 K 1 f 2 K )/(γ1 (t) ∼ γ2 (−t)). 2
If X is homeomoprhic to S 2 , then we say that f 1 and f 2 are topologically mateable. In this case, we call the mapping F the topological mating, and use the notation F = f 1 T f 2 . ˆ Assume further that there exists a homeomorphic change of coordinate ψ : X → C ◦
◦
which is conformal on K 1 ∪ K 2 and such that ˆ →C ˆ R = ψ ◦ F ◦ ψ −1 : C is a rational mapping. We then say that R is a conformal mating (or simply a mating) of f 1 and f 2 , and write R = f 1 f 2 . The pair of quadratics f 1 and f 2 is then called conformally mateable. Conformal mateability thus implies, in particular, topological mateability. Let us give another useful definition of mating. Let © be the complex plane compactified by adjoining the circle of directions at infinity {∞ · e2πiθ : θ ∈ S 1 }. Given two quadratic polynomials f 1 and f 2 as before, consider the extension of f i to the circle at infinity given by f i (∞ · e2πiθ ) = ∞ · e4πiθ . Glueing the two circles at infinity in reverse order, we obtain a 2-sphere = ©1 ∪ ©2/ ∼∞ , with the equivalence relation ∼∞ identifying (∞ · e2πiθ1 ) with (∞ · e2πiθ2 ) whenever θ1 = −θ2 , and a well defined map f 1 F f 2 equal to f i on ©i , i = 1, 2. The map f 1 F f 2 is called the formal mating between f 1 and f 2 . For each θ ∈ S 1 we denote Ri (θ ) the external ray of f i with angle θ given by i−1 ({r e2πiθ for r ≥ 1}). Label Rˆ i (t) the closure of Ri (t) in . We define the ray equivalence relation ∼r on in the following way: x ∼r y if and only if there exists a finite sequence of closed external rays { Rˆ i j (t j )} j=1,...,k with the property Rˆ i j (t j ) ∩ Rˆ i j+1 (t j+1 ) = ∅, for 1 ≤ j ≤ k − 1 and Rˆ i1 (t1 ) x, Rˆ ik (tk ) y. If f 1 and f 2 are topologically mateable then it follows from the definition that the topological space ©1 ©2/ ∼∞ modulo ∼r is again a 2-sphere and f 1 T f 2 = f 1 F f 2/ ∼r .
Mating Non-Renormalizable Quadratic Polynomials
3
We can now give another equivalent definition of conformal mating in terms of ray equivalence: f 1 and f 2 are conformally mateable if there exists a rational mapping ˆ →C ˆ and a pair of semiconjugacies φi : K i → C, ˆ i = 1, 2, R:C R ◦ φi = φi ◦ f i , ◦
such that the following holds: φi is conformal on K i , and φi (z) = φ j (w) if and only if z ∼r w. The map R is called a conformal mating between f 1 and f 2 . Recall that two branched coverings Fi : S 2 → S 2 , i = 1, 2 with finite postcritical sets Pi are equivalent in the sense of Thurston if there exist orientation preserving homeomorphisms of the sphere φ and ψ such that φ ◦ F1 = F2 ◦ ψ, and ψ is isotopic to φ rel P1 . Using Thurston’s characterization of postcritically finite rational mappings as branched coverings (see [DH2]), Tan Lei [Tan] and Rees [Re1] demonstrated that if f i (z) = z 2 + ci , i = 1, 2 is a pair of postcritically finite quadratics and the parameters c1 and c2 are not in conjugate limbs of the Mandelbrot set, then the formal mating f 1 F f 2 (or a certain degenerate form of it) is equivalent to a quadratic rational map R in the sense of Thurston. Further, Rees [Re2] and Shishikura [Sh1] showed that under the above assumptions, f 1 and f 2 are conformally mateable. Note that the condition that c1 and c2 are not in conjugate limbs is clearly necessary for topological mateability. Indeed, otherwise the cycles of external rays {R1 (t j )} and {R2 (s j )} landing at the dividing fixed points of the respective maps have opposite angles t j = −s j (see e.g. [Mi3]). Thus { Rˆ 1 (t j )} ∪ { Rˆ 2 (s j )} separates and therefore / ∼r is not homeomorphic to S 2 . It is remarkable that this condition is also sufficient when f 1 and f 2 have finite critical orbits, as this includes cases when both Julia sets are dendrites with empty interior. First examples of matings not based on Thurston’s characterization of rational maps appeared in the paper of Zakeri and the second author [YZ]. Before formulating it, recall that an irrational number θ ∈ (0, 1) is of bounded type if there exists B > 0 such that θ can be expressed as an infinite continued fraction with terms bounded by B. Theorem. Let θ1 and θ2 be two irrationals of bounded type, such that θ1 + θ2 = 1. Then the pair of quadratic polynomials f i = e2πiθ j z + z 2 , j = 1, 2 are conformally mateable. The mating R = f 1 f 2 is unique up to a Möbius change of coordinates, and is identified algebraically. However, it is very far from being postcritically finite. The postcritical sets of its two critical points are quasicircles, bounding a pair of Siegel disks. The approach taken in [YZ] consists in defining a dynamical puzzle partition of ˆ for the mapping R. The renormalization theory of critical circle the Riemann sphere C maps [Ya] can be used to show that nested sequences of puzzle pieces shrink to points. This provides a combinatorial description of the Julia set of R, sufficient to verify that it is a mating. The history of the problem we consider in this paper is as follows. In 1995 J. Luo [Luo] has proposed an approach to constructing a particular class of non postcritically finite matings of the following sort. A quadratic polynomial f c (z) = z 2 + c is called starlike if c is contained in one of the hyperbolic components attached to the main cardioid of the Mandelbrot set M. The name is due to the fact that Hubbard trees associated to such components have only one branching point. A Yoccoz’ quadratic polynomial has only repelling periodic cycles, and is renormalizable at most finitely many times. Yoccoz (see e.g. [Hub]) has proved that such
4
M. Aspenberg, M. Yampolsky
polynomials are combinatorially rigid, and have locally connected Julia sets. Luo has proposed mating starlike maps with Yoccoz’ ones, arguing that the Yoccoz’ puzzle partition for quadratics can be transplanted into the quadratic rational map. In this paper we carry this program out for a particular instance of a critically finite starlike polynomial f −1 (z) = z 2 − 1, whose Julia set is known as the basilica. We use the symbol ◦◦ as a graphical reference to this particular quadratic parameter, to avoid awkward notation. Thus f −1 becomes f ◦◦ , and its Julia set is denoted J◦◦ . We prove: Main Theorem. Suppose c is a non-renormalizable parameter value outside the 1/2-limb of M such that f c does not have a non-repelling periodic orbit. Then the quadratic polynomials f c and f ◦◦ are conformally mateable, and their mating is unique up to a Möbius coordinate change. It will be evident from the argument how to adapt it to work for an arbitrary starlike map; however, we decided to specialize to the case f◦◦ for the sake of clarity. Potentially, the methods of the proof should also work for the case of a general Yoccoz’ parameter c, or even an infinitely renormalizable parameter with good combinatorics. Since f ◦◦ has a superattracting orbit 0 → −1 → 0, any candidate mating R must exhibit a superattracting orbit of order 2. Let us place the critical point at ∞ and assume that R(∞) = 0, R 2 (∞) = ∞. The following family will serve as our candidate matings: Ra (z) =
z2
a . + 2z
The critical points of Ra are ∞ and −1. A crucial obstacle now (and a principal difference with [YZ]) is that there is no algebraic approach to specifying the candidate mating of f c and f ◦◦ . Instead, and similarly to Yoccoz’ rigidity result, we will define a puzzle partition in the parameter space of Ra , and select the mating as the unique intersection point of a specific sequence of puzzle-pieces. 2. Basic Properties for Ra and f◦◦ For ease of reference, we summarize in this section some of the basic properties of the mapping f ◦◦ (z) = z 2 − 1 and the quadratic rational maps in the family Ra . We refer the reader to [Mi1] for the discussion of the properties of Fatou and Julia sets, and to [Mi3] for the properties of external rays of polynomial maps. 2.1. Basic properties of f ◦◦ . Let us begin with the following general statement (cf. [Mi1]). Lemma 2.1. Let U be a simply-connected immediate basin of a superattracting perˆ → C ˆ of period q. Denote φ : U → D a iodic point of a rational mapping F : C Böttcher coordinate: φ(F q (z)) = (φ(z))d for some d > 1. An internal ray is a curve φ −1 ({r e2πit | r ∈ [0, 1)}. Then: • suppose, p is a repelling or parabolic periodic point on the boundary of U . Then p is the landing point of an internal ray whose period is divisible by the period of p; • conversely, every periodic internal ray lands at a repelling or parabolic periodic point in ∂U .
Mating Non-Renormalizable Quadratic Polynomials
5
Let B0 , B−1 be the immediate basins of attraction of 0 and −1 respectively for f ◦◦ . Let B∞ be the basin of attraction at infinity. Note that f ◦◦ : B0 → B−1 is also a 2 → 1 covering branched at 0. Lemma 2.2. For any two Fatou components A and B of f ◦◦ , neither of which is the attracting basin of infinity, exactly one of the following holds: (1) A ∩ B = ∅. (2) A ∩ B is only one point, which is a pre-fixed point for f ◦◦ . (3) A = B. The statement of the lemma follows immediately from the Maximum Principle. Note that the boundaries of the Fatou components B0 and B−1 touch at the repelling fixed point α of f ◦◦ . Since the mapping f ◦◦ is hyperbolic, its Julia set is locally connected. In particular, ˆ if : C\K ( f ◦◦ ) → C\D denotes the Böttcher coordinate at ∞, the Carathéodory’s Theorem implies that −1 extends continuously to ∂D. Moreover, every external ray R(θ ) = −1 ({r e2πiθ | r > 1}) lands at a point of the Julia set. We denote γ (θ ) = lim+ (r e2πiθ ). r →1
Hyperbolicity of f ◦◦ also implies: Lemma 2.3. Let Fi be an arbitrary infinite sequence of distinct Fatou components of f ◦◦ . Then diam Fn → 0. We will also make use of the following lemma: Lemma 2.4. A point z ∈ J◦◦ is a landing point of precisely two external rays if and only if z is a preimage of the fixed point α. No other point z ∈ J◦◦ is biaccessible. The angles of the two external rays which land at α are easily identified as 1/3 and 2/3.
2.2. Properties of maps in the family Ra . In what follows, we will refer to the illustration of the parameter space for the family Ra pictured in Fig. 1. For Ra let A∞ be the immediate basin of attraction at infinity, and A0 the Fatou component containing 0. Let us note: Proposition 2.5. The Fatou components A0 and A∞ are distinct and simply-connected. The critical point −1 of Ra is never contained in A∞ . Proof. We have A0 = A∞ by Denjoy-Wolff Theorem. If A∞ is multiply-connected, then, necessarily, −1 ∈ A∞ , by the Riemann-Hurwitz formula. Thus A0 contains all critical values of Ra . In this case, it follows (see e.g. [Mi2], Lemma 8.1) that the Julia set of Ra is totally disconnected, and that every orbit in the Fatou set converges to an attracting fixed point, which is impossible.
6
M. Aspenberg, M. Yampolsky
Fig. 1. The parameter set for Ra
Note that whenever a is such that −1 ∈ A0 , the Fatou set of Ra is the union of A0 and A∞ . The Julia set J (Ra ) is the common boundary of the two Fatou components, and we have (see, for instance, [CG], Theorem 2.1 on p. 102): Proposition 2.6. If −1 ∈ A0 , then J (Ra ) is a quasicircle. In the parameter space (Fig. 1) the above values of a form the “exterior” hyperbolic component which we denote P∞ . More generally, a capture hyperbolic component for the family Ra contains maps for which there exists an iterate Ran (−1) ∈ A∞ . The smallest such n will be referred to as the generation of the capture component. For instance, a = 2 is the center of the biggest red “bubble” in Fig. 1, in which we have Ra2 (−1) ∈ A∞ . The corresponding Julia set is depicted in Fig. 2. Similarly to the statement of Lemma 2.2, we will show in Sect. 5: Lemma 2.7. Suppose that the parameter a is chosen outside of the closure P¯∞ . Then given any two Fatou components A and B in the basin of ∞ of Ra exactly one of the following holds: (1) A ∩ B = ∅, (2) A ∩ B is only one point, (3) A = B. Moreover, if Case (2) occurs, then A¯ ∩ B¯ is either a preimage of the fixed point xa ≡ A¯ 0 ∩ A¯ ∞
Mating Non-Renormalizable Quadratic Polynomials
7
Fig. 2. A capture dynamics: dynamical plane of R2
or a pre-critical point. For the latter possibility to occur, the parameter a must belong to the boundary of a capture component. Denote Mat the set of parameter values a not contained in any of the capture components. This set is colored in black in Fig. 1. The interior of Mat contains matings with ◦
basilica, and thus should be naturally identified with M with the 1/2-limb removed. As an example of a mating in Mat, consider Fig. 3. This image was popularized on the cover of Stony Brook preprint series; it is the mating of Douady’s rabbit with basilica.
3. Orbit Portraits for Quadratic Polynomials In this section we provide a brief summary of several results on the combinatorics of external rays of quadratic polynomials following Milnor’s paper [Mi3]. All proofs are given in [Mi3]. Let the points {x1 , x2 = f (x1 ), . . . , x p = f (x p−1 )} form a periodic orbit of a quadratic polynomial f c (z) = z 2 + c with period p. Assume further, that this orbit is either repelling or parabolic, and hence the landing set of a finite collection of periodic external rays R(θi ) (see e.g. [Mi1]). Definition 3.1. For each 1 ≤ i ≤ p, let Ai = {θ1i , . . . , θki } denote the set of angles of the external rays landing at xi . The collection O = {A1 , . . . , A p } is called the orbit portrait of the cycle (x1 , . . . , x p ). According to the type of the cycle, the orbit portrait is either repelling or parabolic.
8
M. Aspenberg, M. Yampolsky
Fig. 3. Stony Brook preprint cover: the dynamical plane of the mating of basilica and Douady’s rabbit
Given the periodicity of xi , the iterate f ci permutes the rays with angles in Ai . The following is immediate: Lemma 3.1. Given an orbit portrait O = {A1 , . . . , A p } the size of Ai is the same for all i. Moreover, Ai+1 = 2 Ai mod Z, and if |Ai | ≥ 3, then the cyclic order of the angles θ ij ∈ Ai is the same as that of their images 2θ ij mod Z ∈ Ai+1 . Definition 3.2. For A = {θ1 , . . . , θk } ⊂ T, write exp(A) = {e2πiθ1 , . . . , e2πiθk } ⊂ S 1 . A formal orbit portrait is a collection {A1 , . . . , A p } of subsets of T for which the following properties hold: • each Ai is a finite subset of T; • for each j modulo p, the doubling map t → 2t mod Z carries A j bijectively onto A j+1 preserving the cyclic order around the circle; • all of the angles in A1 ∪ · · · ∪ A p are periodic under doubling with the same period r p; • for each i = j, the convex hulls of the sets exp(Ai ) and exp(A j ) are disjoint. The valence of an orbit portrait O is vO = |Ai |. Every angle in Ai is periodic of period pr . Since there are pvO angles in O, the quantity vO/r is the number of distinct cycles of external rays in the orbit portrait O. Lemma 3.2. Only two possibilities can occur: either vO = r or vO = 2 and r = 1. Assume that vO ≥ 2. For each Ai , the complement T\Ai consists of finitely many complementary arcs. Each such arc corresponds to a sector between two of the rays landing at xi .
Mating Non-Renormalizable Quadratic Polynomials
9
Lemma 3.3. Let O = {A1 , . . . , A p } be a formal orbit portrait. Then every complementary arc for Ai , except for one is mapped one-to-one under z → 2z onto a complementary arc of Ai+1 . The exception is the critical arc of Ai , which has length greater than 1/2. The image of the critical arc wraps around the whole unit circle, covering one of the complementary arcs of Ai+1 twice. If the portrait O is realized by a quadratic polynomial, then for each i, the sector corresponding to the critical arc of Ai contains the critical point 0. Lemma 3.4. Assume that vO ≥ 2. There exists a unique shortest complementary arc in O. If the portrait is realized by a quadratic polynomial f c , then the sector corresponding to this arc can be characterized among the pv sectors formed by the rays landing at points xi as the one which contains the critical value c = f c (0) and no points of the orbit xi . Definition 3.3. The complementary arc in the previous lemma is referred to as the characteristic arc of the orbit portrait. 4. Bubble Rays To construct a Yoccoz puzzle partition for the quadratic rational maps in Mat, we will use chains of Fatou components in place of external rays. This method was employed in [YZ] and [Ro2], it was also suggested in [Luo]. We begin by describing such chains in the filled Julia set of f ◦◦ ; this discussion, while mostly trivial, will serve as a useful preparation for handling maps in the family Ra . 4.1. Bubble rays for f ◦◦ . Recall that B0 and B−1 denote the components of the immediate super-attracting basin of f ◦◦ , labelled according to the point in the critical orbit they surround. ◦
Definition 4.1. A bubble of K ◦◦ is a Fatou component F ⊂ K ◦◦ . The generation of n (F) = B . The a bubble F is the smallest non-negative n = Gen(F) for which f ◦◦ 0 − Gen(F)
center of a bubble F is the preimage f ◦◦ (0) ∩ F. If F = B0 , then let G be the bubble with the lowest value of Gen(G) for which G¯ ∩ F¯ = ∅. We will refer to G as the predecessor of F, and to the point x = root(F) ≡ G¯ ∩ F¯ as the root of F. A bubble ray B is a collection of bubbles ∪m≤∞ Fk such that for each k the intersection 0 Fk ∩ Fk+1 = {xk } is a single point, and Gen(Fk ) < Gen(Fk+1 ). Note that by Lemma 2.2, each of the points xk is a preimage of the α-fixed point of f ◦◦ . If m < ∞, we will refer to the component Fm as the last bubble of B. Hyperbolicity of f ◦◦ readily implies: ◦
Proposition 4.1. There exist s ∈ (0, 1), and C > 0 such that for a bubble F ⊂ K ◦◦ we have diam(F) ≤ Cs Gen(F) . In particular, for each infinite bubble ray B = ∪∞ 0 Fk there exists a unique point x ∈ J◦◦ such that Fk → x in Hausdorff sense.
10
M. Aspenberg, M. Yampolsky
We refer to x as the landing point of B. By Lemma 2.2 we have: Proposition 4.2. If two bubble rays B1 , B2 have the same landing point, then one of them is contained in the other one. By Lemma 2.1, each pre-periodic point on the boundary of a bubble is a landing point of an internal ray. We may therefore define: Definition 4.2. The axis of a bubble ray B = {Fk }m≤∞ is the closed union 0 γ (B) ≡ ∪m 0 γk , where γk for k ≥ 1 is the union of two internal rays of Fk connecting its center to the points xk−1 and xk , and γ0 is the internal ray of F0 terminating at x0 . Let x be the landing point of an infinite bubble ray B. As the Julia set J◦◦ is locally connected, Carathéodory’s Theorem implies that there exists at least one external ray R(θ ) landing there. By Lemma 2.4, such θ is unique. Let us refer to the number −θ as the angle of the bubble ray B and denote it (B) ≡ −θ. By Proposition 4.2, (B1 ) = (B2 ) implies that one of these rays is a subset of the other. We will call a bubble ray B periodic if the angle (B) is periodic under doubling; the period of the ray will refer to the period of its angle. Note that the angle of a bubble ray can be determined intrinsically, from the choice of the bubbles themselves. Indeed, consider the spine (K ◦◦ ) ≡ K ◦◦ ∩ R = [−β, β], where β is the non-dividing fixed point of f ◦◦ . The spine may also be seen as the union of the axes of the bubble rays B+ , B− starting with the bubble B0 and terminating at ±β respectively. Let B = ∪Fk be an infinite bubble ray, landing at x = β. Consider the forward k (x). Define a sequence s(B) = (s )∞ of 0’s and 1’s as follows. We set iterates xk = f ◦◦ i 1 • si = 0 if xi is above the spine, or equivalently, if there is a bubble Fk with k ≥ i which is above the spine; • si = 1 if xi is below the spine, or equivalently, if there is a bubble Fk with k ≥ i which is below the spine; • if i is the first instance when neither of these two possibilities holds, set si = 1, and s j = 0 for all j > i (note, that in this case we necessarily have xi = −β. For B ⊂ B+ we set s(B) = (0)∞ 0 . We will sometimes refer to the dyadic sequence s(B) as the intrinsic address of B. Noting that (β, +∞) = R(0), and (−∞, −β) = R(1/2), we immediately have Proposition 4.3. For each infinite bubble ray B we have (B) = −
∞ i=1
2−i si , where s(B) = (si )∞ 0 .
Mating Non-Renormalizable Quadratic Polynomials
11
4.2. Bubble rays for a map Ra . The definition of a bubble ray for a rational mapping Ra is completely analogous to Definition 4.1. Definition 4.3. A bubble of Ra is a Fatou component F ⊂ ∪Ra−k (A∞ ). The generation of a bubble F is the smallest non-negative n = Gen(F) for which Ran (F) = A∞ . The center of a bubble F is the preimage Ra− Gen(F) (∞) ∩ F. A bubble ray B is a collection of bubbles ∪m≤∞ Fk such that for each k the intersection 0 Fk ∩ Fk+1 = {xk } is a single point, and Gen(Fk ) < Gen(Fk+1 ). The structure of bubble rays for Ra is particularly easy to describe when a ∈ Mat, and somewhat more difficult in the capture case. We consider the simpler possibility first. The case a∈ Mat. Consider the Böttcher coordinates b1 : D → B0 , and b2 : D → A∞ . The identification φ ≡ b2 ◦ b1−1 : B0 → A∞ conjugates the dynamics of f ◦◦ and Ra . Note that by Lemmas 2.1 and 2.7 the components A∞ and A0 have a single common boundary point x = limr →1− b2 (r ) and is fixed by the dynamics of Ra . By Lemma 2.7 we have the following: Proposition 4.4. If two bubbles F1 and F2 of Ra touch at a boundary point z, then z is a preimage of x. By Lemma 2.1, the axis γ (B) of a bubble ray B of Ra can be defined as before. To ˆ which is the define the spine a begin by considering the union of internal rays l∞ ⊂ C image under b2 of the segment (−1, 1). Let l0 ⊂ A0 be its preimage, and set t1 = l¯∞ ∪ l¯0 ∪ {x}. We now inductively define tn = tn−1 ∪ h 1 ∪ h 2 , where h i are the two components of Ra−1 (tn−1 )\A∞ intersecting tn−1 . Definition 4.4. We set a = ∪tn , and endow this arc with positive orientation as induced by the orientation of (−1, 1) → l∞ . Further, for a bubble F of Ra with F ∩ a = ∅, we say that F is above the spine, if the unique finite bubble ray connecting it to the spine lies above a with respect to the orientation of a . In the complementary case, we say that the bubble F is below the spine. We define the intrinsic address s(B) of a bubble ray B in exactly the same fashion as before. −n The oriented spine allows us to extend inductively the conjugacy φ : f ◦◦ (B0 ) → −n Ra (A∞ ) so that: Proposition 4.5. Denote ◦
L = K ◦◦ ∪
∞
n=0
−n f ◦◦ (α)
.
12
M. Aspenberg, M. Yampolsky
Then φ extends as a conjugacy to the whole of L. Moreover, this conjugacy obeys the property: s(φ(B)) = s(B) for each bubble ray B in K ◦◦ . Definition 4.5. For an infinite bubble ray B of Ra we set the angle of B equal to (B) ≡ (φ −1 (B)). By construction, we have (B) =
∞
2−n sn , where s(B) = (sn )∞ 1
(4.1)
n=1
for each bubble ray B of Ra . The case when a belongs to a capture component. Let us exclude the trivial possibility when the critical value −a = Ra (−1) ∈ A∞ , and denote n > 1 the smallest natural number for which Ran (−1) ∈ A∞ holds. The conjugacy φ can still be extended consis−(n−1) tently with the orientation to f ◦◦ (B0 ). Denote F −a the bubble of Ra containing ◦
the critical value, and set H = φ −1 (F) ⊂ K ◦◦ . ◦
Definition 4.6. We define an equivalence relation ∼ on K ◦◦ as follows. Connect the two ˆ ◦◦ . The equivalence relation identifies preimages H1 , H2 of H by a simple arc h ⊂ C\K ◦
any two bubbles G 1 , G 2 ⊂ K ◦◦ if there exists l ≥ 0 such that G 1 is connected to G 2 −l by a component of f ◦◦ (h). For points xi ∈ G i we set x1 ∼ x2 if this happens, and if n+l n+l f ◦◦ (x1 ) = f ◦◦ (x2 ). One readily verifies: Lemma 4.6. In the capture case, the mapping φ extends as a surjective conjugacy from ∞ ∞ ◦ −i K ◦◦ ∪ f ◦◦ α −→ Ra−i (A∞ ∪ {x}). i=0
z 1 ∼z 2
i=0
5. Parabubble Rays Removing the α-fixed point from the basilica K ◦◦ separates it into two connected components. We will denote them L for “left”, and R for “right”. Put Re = R\B 0 , (the subscript e, standing for "exterior" of the right half of the basilica). As we will see below, there is a natural correspondence between the components of the interior of Re , and the capture hyperbolic components in the parameter plane of the family Ra . For the remainder of this section, let us fix the notation Ra (z) = R(z, a), Ran (z) = R n (z, a).
Mating Non-Renormalizable Quadratic Polynomials
13
Definition 5.1. Let a0 be such that Rak0 (−1) = ∞ for some k ∈ N, and let n be the smallest such value of k. Then a connected set P of parameters a containing a0 , such that R n (−1, a) ∈ A∞ is called a capture hyperbolic component or a parabubble. The point a0 is called a center of P. We will see further that it is unique. Finally, we say that the generation of P is n, and write Gen(P) = n. Set ξn (a) = R n (−1, a). Then we have ξn+1 (a) =
(ξn
a a = . + 2ξn (a) ξn (a)(ξn (a) + 2)
(a))2
(5.1)
From (5.1) it follows by a straightforward induction, that Lemma 5.1. The degree of ξn is the nearest integer value to 2n+1/3. We now state: Lemma 5.2. For n ≥ 2, the degree of ξn is equal to the number of bubbles of generation n in the basilica which are contained in R. Proof. To each bubble B ⊂ K ◦◦ we associate an interval (a, b) = I B ⊂ R/Z, where a, b are the angles of the external rays meeting at the root of B. It is easy to see that the centers of the intervals I B of all bubbles of generation n are symmetrically distributed around the unit circle and that each I B does not intersect 1/3 or −1/3. It is easy to verify that the closest integer to 2n × (2/3) is equal to the number of I B which are contained in the interval (−1/3, 1/3). The claim follows from Lemma 5.1. Denote Aa∞ the set A∞ for the map Ra . Let ˆ a : Aa∞ → C\D be the Böttcher coordinate for Ra normalized so that a (∞) > 0. Note that a is analytic in a. A direct calculation implies a (z) =
1 z + o(1), as z → ∞. 2
(5.2)
If −a ∈√A∞ then a can be extended around ∞ until we hit a critical point z = 1 ± 1 − a for Ra2 . However, the Green’s function g(z, a) = log |a (z)| is still well defined on A∞ and moves continuously with a, and g(z, a) → 0 as z → ∂ A∞ for all a ∈ C. Let P∞ be the open set of parameters where −a ∈ A∞ , that is, where J (Ra ) is a quasicircle. This capture component obviously contains an open neighborhood of ∞. By the λ-Lemma of [MSS] we have: Lemma 5.3. The Julia set J (Ra ) moves holomorphically for all a ∈ P∞ . Let us continuously extend the Green’s function g(z, a) on the whole sphere so g(z, a) = 0 outside A∞ . The proof of Theorems III.3.2 in [CG] can be easily adjusted to the family Ra2 : A∞ → A∞ , to show that the Green’s function g is uniformly Hölder α-continuous for |a| ≤ C, some α = α(C) ∈ (0, 1]. As a consequence, g(−a, a) → 0 as a → ∂ P∞ , (see Theorem III.3.3 [CG]). Moreover, by (5.2), the function a (−a) has
14
M. Aspenberg, M. Yampolsky
a simple pole at ∞. Since g(−a, a) → 0 as a → ∂ P∞ , the Argument Principle implies ˆ that a (−a) takes every value in C\D exactly once. We get the following: c has logarithmic capacity Lemma 5.4. The set P∞ ∪ {∞} is simply connected and P∞ equal to 1/2.
It is easy to verify that A∞ does not necessarily move continuously at ∂ P∞ if we step inside P∞ (e.g. at a = 3), but the following holds. Lemma 5.5. The set A∞ moves holomorphically for all parameters a ∈ (P ∞ )c . We have a ∈ ∂ P∞ if −a ∈ ∂ Aa∞ . Proof. Put ψa = a ◦ a−1 . Then ψa maps Aa∞0 onto Aa∞ . If a ∈ / P ∞ then −a ∈ / A∞ 0 c a0 by definition and we have that ψa (z) = ψ(z, a) is a holomorphic motion on A∞ × P ∞ . By the -Lemma, ∂ Aa∞ also moves holomorphically. If −a1 ∈ ∂ A∞ for some a1 ∈ / P ∞ then since A∞ moves holomorphically, the point −a1 is an image of some point z 1 ∈ ∂ Aa∞0 under ψ, i.e. ψ(z 1 , a1 ) = −a1 . The analytic function ψz 1 (a) satisfies ψz 1 (a1 ) + a1 = 0. Either ψz 1 (a) + a ≡ 0 or not. If so, then −a ∈ ∂ A∞ for all a ∈ (P ∞ )c , which is clearly false. If not so, then choose a small disk B(a1 , ε) ⊂ (P ∞ )c and some z 2 ∈ Aa∞0 , with z 2 sufficiently close to z 1 , such that |ψz 1 (a) − ψz 2 (a)| < |ψz 1 (a) + a| for a ∈ ∂ B(a1 , ε). By Roche’s Theorem, ψz 2 (a) + a = 0 must have a solution b ∈ B(a1 , ε), which means that −b ∈ Ab∞ , which is a contradiction. Corollary 5.6. The statement of Lemma 2.7 holds for a ∈ ( P¯∞ )c . Moreover, for every such a, the bubbles of Ra have locally connected boundaries. Proof. Consider a mapping Ra with the parameter a ∈ ( P¯∞ )c contained in a capture component. Since Ra is a hyperbolic mapping, the boundary of every Aa∞ is locally connected by the standard considerations. The second claim follows. The first claim is now immediate. 5.1. Internal parameter rays.. If P is a capture component of generation n ≥ 1, for t ∈ P let gn (t) = t (R n (−1, t))), so that gn maps a ∈ P to the Böttcher coordinate for Ran (−1) in A∞ . The function ξn is a rational function and has a pole of finite order at the center of every capture component (later we show that it is in fact a simple pole). We proceed with the following definition. Definition 5.2. An internal parameter ray of angle θ is a connected component of the set {gn−1 (r e2πiθ ) : r > 1}. Lemma 5.7. Let P be a parabubble with Gen(P) = n ≥ 2, and let θ ∈ T be periodic (pre-periodic) under doubling. Then an internal parameter ray of P with angle θ lands at a point a0 ∈ ∂ P. Moreover, the point p(a0 ) = Ran0 (−1) is a repelling periodic (pre-periodic) point on the boundary of A∞ .
Mating Non-Renormalizable Quadratic Polynomials
15
Proof. To fix the ideas, we assume that θ = 0 so that p(a0 ) is the repelling fixed point where A∞ and A0 touch. Set γn (t) = gn−1 (te2πiθ ), for t > 1, where we assume that gn−1 (te2πiθ ) belongs to a chosen connected component of {gn−1 (r e2πiθ ) : r > 1}. We want to show that lim+ γn (r ) exists and is equal to a0 . First note that
r →1
|a−1 (r ) − p(a)| ≤ δ(r ),
(5.3)
where δ(r ) → 0 as r → 1, which follows by Lemma 2.1. Also, note that the left hand side of (5.3) is a continuous function of both a and r on P × (1, ∞). This implies that a−1 (r ) → p(a) uniformly as r → 1 on P. Therefore, for a = γn (r ), |−1 γn (r ) (r ) − p(γn (r ))| ≤ δ(r ),
(5.4)
where δ(r ) → 0 as r → 1. Now, for |a−a0 | ≤ ε, we have |Ran (−1)− p(a)| ≤ ε (ε) → 0, as ε → 0. On the other hand, since the zeros of |Ran (−1) − p(a)| are isolated, we can find a C > 0 such that if 0 < ε ≤ |a − a0 | ≤ C, then |Ran (−1) − p(a)| ≥ ε . If γn (r ) does not land at a0 , take an a ∈ γn (r )\B(a0 , ε), where r is sufficiently close to 1, so that (5.4) holds for δ(r ) ≤ ε/2. But since |a−a0 | ≥ ε we have |Ran (−1)− p(a)| ≥ ε , for a = γn (r ), which is a contradiction. Hence γn (t) must land at a0 . The landing property for periodic parameter rays in P∞ follows from the standard theory in e.g. [CG], Theorem 5.2: Proposition 5.8. If θ is rational then the internal parameter ray of angle θ in P∞ lands at a parameter a ∈ ∂ P∞ . Moreover, if θ = 0 is periodic then Ra has a parabolic cycle and if θ is strictly preperiodic then Ra is a postcritically finite map. Consider the conjugacy φ from Lemma 4.6. We have the following: Lemma 5.9. Let P be a parabubble of generation n ≥ 2 and address σ . (I) There exists a unique bubble W ∈ K ◦◦ such that the following holds. Let a ∈ P and denote Ba the bubble of Ra which contains the critical value −a. Then φ −1 (Ba ) = W . (II) On the other hand, for each bubble W ∈ R, there exists a unique parabubble P such that for any a ∈ P we have φ(Ba ) = W , where −a ∈ Ba . (III) Moreover, a ∈ ∂ P if and only if −a ∈ ∂ Ba . (IV) The parabubble P is an open set, has a unique center, and is simply connected. Proof. The first and third claim are immediate consequences of Lemma 5.5. The same lemma implies that P is an open set. We have ξn (a) = R n (−1, a) → ∂ A∞ as a → ∂ P by Lemma 5.9, so a ◦ ξn → ∂D as a → ∂ P. By the Argument Principle, this means that every capture component P is ˆ mapped by a ◦ ξn onto C\D as a d −→ 1 covering. We want to show that d = 1. Let P be a parabubble of generation n, and F the corresponding bubble for Ra in which −a lies. Note that the map φ in Lemma 4.6 is an injection of all bubbles of generation ≤ n. Hence we can define B = φ −1 (F). The root of B then is a landing point
16
M. Aspenberg, M. Yampolsky
x of an internal ray of B with angle θ = 0 (by Lemma 2.1). The predecessor C touches B at x. It follows from Lemma 5.7 that an internal parameter ray with angle θ = 0 in P will land at a parameter a such that Ran (−1) is the unique repelling fixed point on the boundary of A∞ . It follows that there is a corresponding parabubble Q to C (in the same way as P corresponds to B), such that P touches Q at a. Moreover, gen(Q) < gen(P), since gen(C) < gen(B). Proceeding in this way we see that for every parabubble P, there is a finite sequence of internal parameter rays connecting the center of P with a point on ∂ P∞ . Reversing this process we also see that for every bubble B in the right basilica R there is a corresponding parabubble P, in the sense that if F is the bubble for Ra in which −a lies, then B = φ −1 (F). We cannot have such correspondence to the left basilica simply because a = 0 is a singularity for the family Ra and no sequence of parabubble rays can end there. We have to prove that there is one and only one bubble in the right basilica corresponding to every parabubble. By Lemma 5.1 the only thing we have to show is that it is impossible to have one parabubble P corresponding to two different bubbles B1 and B2 in the right basilica. This would imply that the parabubble has two distinct centers. By the λ-lemma of [MSS], any two centers in the same parabubble P would correspond to quasi-conformally conjugate rational maps. Since these maps would also be postcritically finite, Thurston’s Theorem implies that a center is unique. Hence every parabubble corresponds to a unique bubble in the right basilica and (II) is proven. Now, since the degree of ξn coincides with the number of parabubbles of generation n, the Pigeonhole Principle implies that ξn has a simple pole at the center of each parabubble ˆ of generation n. By the Argument Principle, a ◦ ξn : P → C\D assumes every value ˆ in C\D exactly once, so indeed d = 1. It follows that every capture component is simply connected. By Lemma 5.9, the mapping ψ : a → −a → φ −1 (−a) ◦
is an injection from the capture locus of the family Ra to R. It is straighforward to extend this mapping to the roots of the (para)bubbles, except for the roots contained in the boundary of P∞ . Denote by C the union of capture components of the family Ra and Ce = C\P∞ . Since dynamical bubbles may only touch at a single point, which is a preimage of the c fixed point where A∞ and A0 as long as a ∈ P ∞ , our discussion implies: Proposition 5.10. If P and Q are two parabubbles not equal to P∞ , and P = ψ(P), Q = ψ(Q), then the following holds: (1) P ∩ Q ∩ (P ∞ )c = ∅ ⇔ P ∩ Q = ∅, (2) P ∩ Q ∩ (P ∞ )c is exactly one point ⇔ P ∩ Q is exactly one point, (3) P = Q ⇔ P = Q . Moreover, ◦
ψ(C) = R.
Mating Non-Renormalizable Quadratic Polynomials
17
Similarly to the notation for dynamical bubbles, if the intersection of the closures of two parabubbles P ∩ Q = {a} is exactly one point and Gen(P) > Gen(Q), let us refer to Q as the predecessor of P and a as the root of P. Let {a j } be the set of all touching points between parabubbles not including those which lie on the boundary of P∞ . The above proposition implies that ψ continuously extends to a homeomorphism ⎞ ⎛ ∞ ◦ ⎝ ( f − j (α) ∩ Re )⎠ . ψ : Ce ∪ {a j } → Re j=1
Definition 5.3. Let B = {Fk }∞ 0 ⊂ K ◦◦ be an infinite bubble ray with angle (B) = θ ∈ (−1/3, 1/3). We call the corresponding sequence of capture components {Pk }∞ 0 , with ψ(Pk ) = Fk , a parabubble ray in C with angle θ , and write (P) = θ . Similarly to the definition for dynamical bubble rays, we define the axis for a parabubble ray P to be the union of the internal parameter rays γk , γk ⊂ Pk which land at the points P k ∩ P k−1 = xk and P k+1 ∩ P k = xk respectively, starting from ∞. In the next section we show that certain infinite bubble rays and parabubble rays land at a single point. 6. Landing Lemmas 6.1. Dynamical bubble rays. We begin with the following lemma. Lemma 6.1. Assume that B is a periodic infinite bubble ray B such that the axis is disjoint from the closure of the postcritical set. Then the axis γ for B lands at a single periodic point which is either repelling or parabolic. Proof. Let be the closure of the postcritical set and let S be the set of cluster points for γ . If the period of γ to itself is n then R n maps ∪ S into itself. Hence R −n can be lifted ˆ by the universal covering D of C\( ∪ S) to a map fˆ : D → D such that fˆ(D) ⊂ D is a strict inclusion. Hence R n is strictly expanding with respect to the Poincaré metric on ˆ C\( ∪ S). Since γ is invariant under f we can take a starting point x0 ∈ γ and set f (x0 ) = x1 , and xk = f (xk−1 ). Let γk be the part of γ between xk and xk+1 . The hyperbolic distance between xk and xk+1 decreases as k increases. Take a point p ∈ S. Then the hyperbolic distance from any point on γ to p is infinite, since S is contained in the boundary of the ˆ hyperbolic set C\( ∪ S). Since the hyperbolic length of γk decreases for increasing k, any neighbourhood N of p has the property that there is a smaller neighbourhood N ⊂ N such that if γk ∩ N = ∅ then γk ⊂ N . But this means that f (N ) ∩ N = ∅. So p has to be a fixed point. Since S is connected, S must contain only this point. By the Snail Lemma, p must be a parabolic or repelling point (cf. [Mi1], Lemma 16.2).
18
M. Aspenberg, M. Yampolsky
We next prove that the axis of a periodic (or preperiodic) bubble ray cannot accumulate on some bubble. Lemma 6.2. Let B be a periodic infinite bubble ray for which the axis is disjoint from the closure of the postcritical set. Then the axis of B cannot accumulate at some bubble. Proof. Without loss of generality, in order to reach a contradiction, it suffices to suppose that the axis of B accumulates at ∂ A∞ . Since B is periodic, we know from Lemma 6.1 that the axis for the bubble ray B lands at a single periodic point p on the boundary of A∞ . The bubble ray B then encloses a domain D whose boundary is a connected part I = A∞ of ∂ A∞ and half of the boundary of all the other bubbles in B. Since p and B is fixed under some iterate n we have that D is invariant under R n . This means that any bubble B in D must never be mapped into A0 ∪ A∞ , since this set lies outside D (the fact that there exists some bubble in D is obvious). This is clearly impossible, since bubbles by definition are preimages of A∞ . We are now in position to prove a landing lemma for periodic or preperiodic bubble rays. Lemma 6.3. Assume that B is periodic infinite bubble ray, for which there exist an N such that all bubbles in B of generation at least N are disjoint from the closure of the postcitical set. Then B lands at a single point. Proof. Assume that B is periodic of period q. We have seen (Lemma 6.1 and Lemma 6.2) that the axis γ of the bubble ray must land on a periodic point x. Since the postcritical set is disjoint from any bubble B in B with Gen(B) ≥ N , we have an annulus R around this B of some definite modulus m > 0 such that there are −q −qn well defined inverse branches of Ra on R ∪ B, where Ra (B) ∈ B for all n ≥ 0. This means that the lengths of the γk in the proof of Lemma 6.1 are commensurable with the diameter of the corresponding bubbles Fk , by the Koebe Distortion Lemma. Hence the bubble ray B converges to the same periodic point as the axis γ lands on.
6.2. Orbit portraits for Ra . We have seen in Sect. 4 that bubble rays have angles inherited from the angles of external rays in the basilica (although these angles are not always well defined, as in the capture case for instance). With the theory about orbit portraits for quadratic polynomials in Sect. 3 in mind, it is now straightforward to define an orbit portrait for Ra . Definition 6.1. Let x1 , x2 , . . . , x p be a (repelling or parabolic) periodic orbit, where Ra (xi ) = xi+1 , Ra (x p ) = x1 . Assume that there are a finite number of periodic infinite bubble rays landing on xi , with well defined angles; let Ai be the corresponding angles for the bubble rays landing at xi . Then the orbit portrait for Ra is the set O = {A1 , A2 , . . . , A p }. Given two angles θ1 = θ2 we let [θ1 θ2 ] ⊂ T be the arc of the unit circle swept by going in counter-clockwise direction from θ1 to θ2 . We say that θ lies between θ1 and θ2 if θ ∈ [θ1 θ2 ]. Before we state the next lemma we make some more definitions.
Mating Non-Renormalizable Quadratic Polynomials
19
Definition 6.2. Let B1 and B2 be two bubble rays starting from A∞ with well defined angles θ1 and θ2 and axes γ1 and γ2 . Assume that B1 and B2 land at a common point p. Denote D the domain bounded by the axes γ1 , γ2 which does not contain any bubble rays with angles in T\[θ1 θ2 ]. Define the outer boundary of the sector bounded by B1 , B2 as the union of the arcs of the boundaries of the bubbles in these two bubble rays lying outside D together with ˆ lies between their endpoints. Similarily, define the inner boundary. We say that z ∈ C B1 and B2 if z ∈ D and z ∈ / B1 ∪ B2 . This notion of being between two bubble rays also makes sense for bubble rays even if B1 and B2 do not land on a common point. Definition 6.3. Assume that the two bubble rays B1 and B2 have intrinsic addresses s(B1 ) = (x0 , x1 , . . . , ) and s(B2 ) = (y0 , y1 , . . .) respectively. We say that an infinite bubble ray B, with intrinsic address s(B) = (z 0 , z 1 , . . .), lies between B1 and B2 if yi ≤ z i ≤ xi for all i ≥ 0. Equivalently, the angle (B) ∈ [(B1 ) (B1 )]. This definition also makes sense for parabubble rays in an exactly analoguous way. Lemma 6.4. Let O = {A1 , . . . , A p } be a formal orbit portrait with vO ≥ 2 and let I = [t− t+ ] be its characteristic arc. If the formal orbit portrait O is realisable by some Ra then −a cannot lie on the outer boundary of a bubble ray with angle t− or t+ . Proof. Since a ∈ Mat, in the case when −a belongs to the boundary of some bubble, we have a conjugacy φ from Proposition 4.5 between the dynamics of f ◦◦ on the interior of K ◦◦ and that of Ra on its Fatou set. Now suppose O is realised and let Ai be the set of angles of the bubble rays landing at xi . Assume that A2 contains the characteristic arc. Let B− and B+ be the bubble rays corresponding to the angles t− , t+ ∈ A2 and let A+ , A− be the bubble rays corresponding to the critical arc in A1 , i.e. so that A− and A+ are mapped onto B− and B+ respectively. Also, let D be the domain enclosed by the axes of B− and B+ . There are two more preimages of B− and B+ , call them A− , A+ respectively. Also, = (A ), a = (A ). Since I = (a , a ) is let a− = (A− ), a+ = (A+ ) and a− c − + − + + , a lie entirely inside I , and thus the bubble the critical arc in A1 we have that both a− c + rays A− , A+ lie entirely inside the domain Dc enclosed by the axes for the bubble rays forming the critical arc. Now, assume that −a lies on an outer boundary of a bubble in B+ (the proof is the same if −a ∈ B− ). Then the critical point −1 must belong to a bubble in A+ . Since Ra is 2 − 1 in a neighbourhood of −1 and orientation preserving, we have that the bubble ray A+ must touch A+ at −1. Since −a is outside D, this implies that −1 must be outside Dc . Thus A+ must be outside Dc , which is a contradiction. The following lemma tells us when a specific orbit portrait is realised. Lemma 6.5 (Realization of orbit portraits). Let O = {A1 , . . . , A p } be a formal orbit portrait with a characteristic arc I = [t− t+ ]. Let Pt− , Pt+ be the corresponding parabubble bubble rays, with angles t− and t+ and assume that a belongs to a parabubble P between Pt− and Pt+ . Then the orbit portrait O is realised by Ra . The proof follows that of Lemma 2.9 in [Mi3].
20
M. Aspenberg, M. Yampolsky
Proof. Note that all infinite bubble rays with angles in any A j are well defined since their forward images do not intersect the critical value. Let be the closure of the postcritical set for Ra and let ρ(z) be the induced hyperbolic ˆ metric on C\. Let C be the critical bubble containing −1 and V the critical value bubble containing −a. There is a unique finite bubble ray ending at V . Its preimage is two finite bubble rays B1 and B2 both ending at C. Their axes γ1 and γ2 join in C and form a ˆ closed simple curve in C. Take a hyperbolic disk D C which covers the critical point −1 and let L=
∞
Rak (γ1 ∪ γ2 ∪ D).
k=0
It is easy to see that the complement of L is two topological disks U1 and U2 . We have R(L) ⊂ L and ⊂ L. Moreover dist(, L c ) ≥ ε > 0 for some definite ε > 0. It is easy to check that the n th preimages of U1 and U2 consist of 2n+1 topological disks. Moreover, all preimages of the U j will be on a definite distance ε > 0 from so we have a uniform constant c = c(ε) > 1 so that ρ(R(x), R(y)) ≥ cρ(x, y) for x, y lying in any of these preimages of Ui . It follows that the preimages of Ui shrink to points. Thus the symbol sequence of some point with respect to the initial partition L is unique. In particular the landing points of the periodic bubble rays in O will have the same symbol sequence if and only if they land at a common point. To show that O is indeed realised it now suffices to show that all the landing points of the bubble rays with angles in A j lie entirely in one of the components Ui . Since they are mapped onto each other they will have the same symbol sequence in that case. The preimages of the characteristic arc [t−1 t+ ] under the doubling map will be two smaller arcs I and I at the end of the critical arc. Since every A j ∈ O cannot have any element in I or I we have that all bubble rays corresponding to angles in A j are completely contained in U1 or completely contained in U2 . Thus all the angles in every A j have the same symbol sequence, so they land on a common point, and so O is a realised bubble portrait. Lemma 6.6. Assume that Ra has a parabolic fixed point z 0 , with Ra (z 0 ) = e2πi p/q , where p/q ∈ Q with ( p, q) = 1. Then there are precisely q periodic bubble rays B j , j = 1, . . . , q, landing at z 0 . These bubble rays are mapped onto each other under the action of Ra , with combinatorial rotation number p/q. Proof. For simplicity, consider the mapping Ra with a = 32/27 which has a simple parabolic with eigenvalue 1. After a suitable change of coordinates shifting the fixed point to the origin, this mapping takes the form ζ → ζ + ζ 2 + O(ζ 3 ) in a neighborhood of ζ = 0. Denote A and R the attracting and repelling petals of Ra correspondingly. Note that Montel’s Theorem guarantees that the repelling petal contains a bubble B.
Mating Non-Renormalizable Quadratic Polynomials
21
Now, B is the end of some finite bubble ray C F . Taking the preimages of the bubble ray C F we get a sequence of bubble rays Ck = Ra−k (C F ), whose ends will converge to z0 . Since preimages will increase the generation and since there are finitely many finite bubble rays of any fixed generation, for any N there must be some bubble B0 of generation N contained in infinitely many Ck . Let Ck0 ⊃ B0 be the Ck containing B0 with lowest generation and Ck1 ⊃ B0 the second lowest. Then Ram (Ck1 ) = Ck0 for some m ≥ 1 and the preimage of B0 under Ram is a longer bubble ray B1 ⊃ B0 . Moreover, B1 ⊂ Ck1 . Taking further preimages of B1 under the same branch f = Ra−m we get a sequence Bn of nested finite bubble rays such that Bn ⊂ Ckn . Moreover, the “difference” between Bn and Ckn , i.e. the number of bubbles in Dn = Ckn \Bn is a fixed constant K for all n. The bubble Dn is also a preimage of the starting set D0 under f . Since the postcritical set accumulates on z 0 , it is disjoint from Dn . Thus there is a neighbourhood around all bubbles in D0 where f n is defined for all n ≥ 0. Now, the Koebe Distortion Lemma implies that all bubbles in Dn shrinks to points, namely the parabolic fixed point z 0 , since one of them, namely the end of Ckn ⊃ Dn , converges to z 0 . Hence there is a subsequence of bubbles in Bn which converge to z 0 (but we do not know a priori that the bubble ray itself will converge to z 0 ). However, by construction, the bubble ray B = ∪n Bn is periodic. We can now apply Lemma 6.3 to B, which shows that B lands at a single point, which must be equal to z 0 . Let us show that the period of B is 1. A priori, C is periodic with a period which divides m. Assume the period is p = 1 and that Ra (B j ) = B j+1 for 1 ≤ j ≤ p − 1, Ra (B p ) = B1 . By simple combinatorial considerations (see e.g. [Mi3]), these bubbles form their own orbit portrait. But this means that some point z ∈ R\A in the domain bounded by two consecutive bubble rays B j and B j+1 , will be mapped into A, which is impossible. Hence p = 1. 6.3. Parameter bubble rays. Let us first note the following evident statement: Lemma 6.7. Assume that an orbit portrait O is realized for some rational map Ra by bubble rays landing at a repelling orbit {xi }. Let at , t ∈ [0, 1] be a continuous path with a0 = a along which the corresponding periodic orbit {xit } remains repelling. Assume further that for every t no iterate of the critical value −at is contained in the boundary of a bubble ray with angle γ ∈ O. Then the orbit portrait O is realized for all Rat . The following proposition has an analogue in [Mi1], Theorem 4.1 (and Lemma 4.2). Since the proof is completely similar, we omit it. Proposition 6.8 (Milnor; Parameter Path). Given a parameter a0 such that Ra0 has a parabolic fixed point z 0 with combinatorial rotation number p/q and an orbit portrait O (from Lemma 6.6). Then there is a path γ emerging from a0 in parameter space so that a ∈ γ implies that Ra has a repelling fixed point z = z(a) with orbit portrait O and an attracting periodic orbit with period q, close to z(a). The set A of parameters where the attracting periodic orbit in the above lemma exists, is bounded by a finite number of analytic curves. Indeed, A = {a : |(R q ) (z i (a), a)| < 1}. The condition |(R q ) (z i (a), a)| = 1 represents an analytic curve with a finite number of singularities. We conclude that there is a “wedge” W˜ , that is, two analytic curves γ1
22
M. Aspenberg, M. Yampolsky
and γ2 which meet at a0 such that for a small neighbourhood B(a0 , ε), an open set E bounded by γ1 , γ2 and ∂ B(a0 , ε) has the property that inside E, we have O realised and z i (a) is an attracting periodic orbit of period q (as in the above lemma). By Lemma 6.7 and Lemma 6.4 the parabubble rays Pt + , Pt − lie outside of the wedge ˜ W. Lemma 6.9. Let a0 be as in the above lemma and assume that (t + , t − ) is the characteristic arc for O. Then for any ε > 0, we have B(a0 , ε) ∩ Pt = ∅, for at least one t = t + , t − , where Pt + , Pt − denote the parabubble rays with angles t + , t − respectively. Proof. Assume the contrary. Then there is an ε > 0 such that B(a0 , ε) is disjoint from the parabubble rays Pt for t = t + , t = t − . By the above argument, and Theorem 6.8, the orbit portrait O is realised in B(a0 , ε) ∩ N , where N = {a : |Ra (α(a))| > 1}, and α(a) is the (local) continuation of the parabolic fixed point z 0 (this is possible if the multiplier is = 1). Hence there is a parameter a1 ∈ B(a0 , ε), such that Ra1 also has a parabolic fixed point z 1 . But since the combinatorial rotation number is changed for a1 the new wedge W˜ 1 emerging from a1 has to exhibit a different orbit portrait O1 . But W˜ 1 must intersect B(a0 , ε) ∩ N , and so both orbit portraits O1 and O are realised, which is impossible. The lemma follows. Proposition 6.10 (Parabubble wakes I). Let a0 be such that Ra0 has a parabolic fixed point z 0 with eigenvalue Ra 0 (z 0 ) = e2πi p/q , ( p, q) = 1. Denote O = {{θ1 , . . . , θq }} the orbit portrait from Lemma 6.6, and let I = [t− t+ ] be its characteristic arc. Then the corresponding parabubble rays with angles t+ and t− land on a0 . Proof. The standard considerations of parabolic dynamics imply that q
Ra0 (z) = R(z) = (z − z 0 ) + b(z − z 0 )q+1 + O((z − z 0 )q+2 ), for some b = 0. For a close to a0 the fixed point z 0 will bifurcate into q + 1 fixed points q (for Ra ) z k (a), which are analytic in a neighbourhood of a0 , and where z k (a0 ) = z 0 , for k = 1, . . . , q + 1. One of these fixed points must be a fixed point for Ra as well if q q ≥ 2, while the other fixed points (for Ra ) are all repelling, indifferent or attracting. By Lemma 6.9 there must be a subsequence of parabubbles Pn k ⊂ Pt + (or Pt − ) such that Pn k ∩ B(a0 , ε) = ∅, for all k ≥ N (ε). Hence, for sufficiently large k, if a1 ∈ Pn k , then −a1 ∈ B n k , where B n k is the corresponding dynamical bubble in the bubble ray Bt + , i.e. with same address as P n k . Since a1 is a capture parameter the fixed points z i (a1 ) (under q Ra ) cannot be attracting. They cannot be neutral so they must be repelling. We now use the standard theory of parabolic bifurcation (see for ex [Sh2] Sect. 7, k [Sh3], [DH1]). For a suitable small perturbation, we get q fundamental domains S+,a k , 1 ≤ k ≤ q, for the repelling and attracting petals respectively for the perturbed and S−,a map Ra . They have the property that k k ∩ S−,a = {α(a), z k (a)}. S+,a
Moreover, there exist analytic functions k+,a , k−,a (the perturbed Fatou coordinates) k = S k \{α(a), z (a)} and which are defined and injective in a neighbourhood of S˜+,a k +,a q k k ˜S−,a = S−,a \{α(a), z k (a)} respectively, and conjugate the dynamics of Ra to that of the unit translation. With a choice of normalization, these coordinates will vary locally analytically with a.
Mating Non-Renormalizable Quadratic Polynomials
n,
23
k , then there is an n ≥ 1 such that R qn (z) ∈ S˜ k , and for the smallest such If z ∈ S˜−,a a +,a
qn
k+,a (Ra (z)) = k−,a (z) −
1 + n + const, β(a)
where β(a) = βk (a) is an analytic function in a punctured neighbourhood of a0 , β(0) = 0, defined by (Ra ) (α(a)) = e2πiβ(a) . q
k the Écalle-Voronin cylinders, obtained as the quotients Denote C+k , C− q
q
k k k C+k = S+,a mod Ra C/Z, C− = S−,a mod Ra C/Z.
We get that for z ∈ C+k , k−,a ◦ Ra ◦ (k+,a )−1 (z) = z + qn
1 mod Z. β(a)
(6.1)
The function τa (z) =
1 + z mod Z β(a)
k is called the transit map. viewed as an isomorphism C+k → C− Now let us fix some k so that the critical point −1 belongs to the k th attracting petal. For simplicity let us drop the indices k in the above discussion and only focus on these particular Fatou coodinates. Then for any prescribed bubble Bl in Bt + we can find a qn parameter a ∈ B(a0 , ε) such that Ra (−1) ∈ Bl , for some n ≥ 1, n = n(l). Fix a = a1 as above. For this specific perturbation, we already have −a ∈ B n k , so we know that n = 1 in (6.1). The bubbles Bn move holomorphically and with uniformly bounded distortion in the Fatou coordinates for a in some disk B(a0 , ε) (the lifted dynamical bubbles in Bt + , in the Fatou coordinates, are all unit translates of each other). The function τa (−1) = 1/β(a) + z mod Z has derivative
∂a τa (z) ∼ D
1 −m = , (a − a0 )m (a − a0 )m+1
for some m ∈ Q, m > 0. This, and the distortion considerations, imply that Pn k converge to a0 . It remains to show that all parabubbles Pl ⊂ Pt + converge to a0 , instead of just a subsequence lk . This follows from the fact that n = n(a) in (6.1) is continuous function of a which only assumes integer values. Hence n = 1 for all l and Pt + lands on a0 . Of course a similar statement holds for Pt − . Let us write W = W (t + , t − ) for the parabubble wake being a set of points between the parabubble rays from the above lemma. Also, let O = O(t + , t − ) be the corresponding orbit portrait. Note that the characteristic arcs corrsponding to different orbit portraits around the fixed point are disjoint. Lemma 6.11 (Parabubble wakes II). The parabubble rays in the above lemma cut out an open set in the complex plane, called the bubble wake W = W (t + , t − ) such that a ∈ W if and only if Ra exhibits the repelling orbit portrait O = O(t + , t − ).
24
M. Aspenberg, M. Yampolsky
Proof. By Lemma 5.9 the set A∞ moves holomorphically and the critical value −a belongs to the boundary of a bubble if and only if a belongs to the boundary of the corresponding parabubble. By Lemma 6.7 if for a single parameter a ∈ W = W (t + , t − ) the map Ra realises the orbit portrait O = O(t + , t − ), then the same is true for every parameter in W . On the other hand, O cannot be realised for any parameter value outside W . Indeed, O is not realised for a in any of the capture components outside W , since this would imply that the critical value is outside the characterisic arc. 7. A Puzzle Partition for Ra The idea of a puzzle partition for a Julia set originated in the work of Branner and Hubbard [BH]. It has been further developed by Yoccoz (see e.g. [Hub] and [Mi5]), to study the local connectedness of the Mandelbrot set at Yoccoz parameters, and the local connectedness of the corresponding Julia sets. We employ the Branner-Hubbard-Yoccoz approach to maps of the family Ra using partitions given by landing bubble rays.
7.1. The Yoccoz puzzle for quadratic polynomials. Let us recall the main steps of Yoccoz’ construction for a quadratic polynomial f c without non-repelling orbits with a connected Julia set. Let α stand for the dividing fixed point of f c . It is the landing point of a cycle of q > 1 external rays of f c . Denote these rays R1 , . . . , Rq . Recall that the Böttcher coordinate ˆ ˆ : C\K ( f c ) → C\D, conjugates f c to the dynamics of z → z 2 . Fix an arbitrary r > 1 and let Er be the equipotential curve Er = −1 ({r e2πiθ : θ ∈ [0, 1]}. Let U0 be the graph formed by U0 = R1 ∪ · · · ∪ Rq ∪ Er ∪ {α}. The puzzle pieces of depth 0 are the bounded components of C\U0 . Denote these q j topological disks P0 , j = 0, . . . q − 1. By definition, the Yoccoz’ puzzle pieces of depth d ≥ 1 are the first preimages of the puzzle pieces of depth d − 1 under f c . What makes puzzle partitions of Julia sets so useful in the study of local connectedness are the following two straightforward observations: Proposition 7.1. The following two properties hold: j
j
• (Markov property) any two puzzle pieces Pd and Pd are either disjoint, or one of them is contained in the other; j • the intersection Jc ∩ Pd is a connected set. The Markov property allows us to make the following definition for any point z ∈ Jc which is not a preimage of α.
Mating Non-Renormalizable Quadratic Polynomials
25
Definition 7.1. For any z ∈ Jc with α ∈ / ∪ f cn (z), let Pd (z) denote the puzzle piece of depth d which contains z. Let us also set Ad (z) = Pd (z)\Pd+1 (z). We will refer to Ad (z) as an annulus, even though it may be degenerate. The sequence of annuli Ad (0) will be called the critical annuli. The following is a consequence of the Grötzch Inequality (see e.g. [BH]): Lemma 7.2. Let Ai , i ∈ N be a sequence of bounded conformal annuli in the plane with simply-connected complementary components. Denote Wi the bounded component of C\ A¯ i . Assume that Ai+1 ⊂ Wi and mod Ai = ∞. Then diam
Wi = 0
Yoccoz has demonstrated, in particular: Lemma 7.3. Assume that f c is non-renormalizable. Then mod Ad (0) = ∞. His proof uses the concept of a tableau developed by Branner and Hubbard [BH]. Below we extract a definition suitable for a generalization from [Mi5]. To motivate some of the notation, fix a point z ∈ Jc , and consider its orbit under f c : z = z 0 → z 1 → z 2 → . . . . Note that the puzzle piece Pd (z j ) is mapped onto Pd−1 (z j+1 ), either as a conformal isomorphism or a branched double covering, depending on whether the piece Pd (z i ) contains the critical point or not. Definition 7.2. Let S(z) be the largest integer d ≥ 0, for which Pd (z) = Pd (0). If Pd (z) = Pd (0) for all d, put S(z) = ∞, and if Pd (z) = Pd (0) for all d, put S(z) = −1. We then distinguish the following three possibilities: • Critical case. d < S(z i ). Here the critical point lies in Pd (z i ) = Pd (0). Hence the annulus Ad (z i ) is mapped onto its image as an unbranched two-to-one covering. One easily deduces that mod Ad (z i ) =
1 mod Ad−1 (z i+1 ). 2
• Off-critical case. d > S(z i ). Here the critical point is outside Ad (z i ) so that Ad (z i ) is mapped conformally onto its image Ad−1 (z i+1 ). Indeed, mod Ad (z i ) = mod Ad−1 (z i+1 ).
26
M. Aspenberg, M. Yampolsky
• Semi-critical case. d = S(z i ). This means that the critical point lies in the annulus Ad (z i ), and 1 mod Ad−1 (z i+1 ). 2 Definition 7.3 (A critical tableau). A critical tableau is a two-dimensional array of nonnegative real numbers (µd,n ), d, n ≥ 0 together with a marking, formed according to a set of rules given below. Each position of the tableau is marked as critical, semi-critical, or off-critical. An iterate I in the tableau is a move in the north-western direction in the array: mod Ad (z i ) >
µd,n −→ µd−1,n+1 . I
The rules of a critical tableau are as follows. • Every column of a tableau is either all critical; or all off-critical; or has exactly one semi-critical position (d0 , n) and is critical above (d > d0 ) and off-critical below. The 0th - column is all critical. • If µd,n > 0 then I(µd,n ) > 0. Moreover, if (d, n) is marked off-critical, then I(µd,n ) = µd,n ; if (d, n) is marked semi-critical, then I(µd,n ) < 2µd,n ; if (d, n) is marked critical, then I(µd,n ) = 2µd,n . • Let position (d0 , n) be marked as either critical or semi-critical. Draw a line northeast from this position, and do the same from the position (d0 , 0) in the tableau. Then the marking above the second line must be copied above the first one. • Suppose that (d, 0) is marked critical, (d − k, k) is also critical, and (d − i, i) is offcritical for i < k. Assume that (d, n) is semi-critical for some n. Then (d − k, n + k) is also semi-critical. Finally, we say that a tableau is recurrent if sup{d| (d, k) is critical for some k > 0} = ∞; we say that it is periodic if there exists k > 0 such that the k th column is entirely critical. The relevance to the quadratic Yoccoz’ puzzle should be evident from the above discussion: Definition 7.4 (The critical tableau of a Yoccoz’ puzzle). For f c as above, we let µd,n = mod Ad ( f cn (0)). We note: Proposition 7.4. The critical tableau of the Yoccoz’ puzzle of f c is periodic if and only if f c is renormalizable. The basis of the Yoccoz’ result is given by the following theorem: Theorem 7.1. Assume that (µd,n ) is a tableau, which is recurrent and not periodic. Assume further that there exists d such that µd,0 > 0. Then µd,0 = ∞. d
Mating Non-Renormalizable Quadratic Polynomials
27
7.2. A puzzle partition for Ra . The puzzle pieces for Ra which we construct are similar to those just described but instead of external rays we use bubble rays. More specifically, choose a parameter a in a parabubble wake W (t + , t − ), and let the corresponding orbit portrait be O(t + , t − ) = {{θ1 , . . . , θq }}. Denote Bi = Bθi the bubble ray with angle θi starting with the bubble A∞ , and let αa be the common landing point of these rays. Another repelling fixed point of Ra , that in the intersection of A¯ 0 and A¯ ∞ will be denoted pa . Definition 7.5. The thin initial puzzle-pieces of Ra are the connected components of
ˆ (∪i Bi ) ∪ {αa } . C\ Similarly, a thick initial puzzle-piece of Ra corresponding to a thin puzzle-piece P is the set P¯ ∪ B 1 ∪ B 2 , where Bi are the two bubble rays which bound P. Finally, an initial puzzle-piece of Ra is a domain obtained as follows. Let γi be the axis of Bi terminating at α and ∞. Further, let ˆ : A∞ → C\D be the Böttcher coordinate, fix an arbitrary r > 1, and let D = −1 ({|z| > r }) and D = Ra−1 (Dr ) ∩ A0 . The initial puzzle-pieces are the connected components of ˆ (∪γi ) ∪ {αa } ∪ D¯ ∪ D¯ . C\ q
We denote the initial puzzle-pieces P01 , . . . , P0 . The puzzle pieces of depth n are the j n th preimages of P0i ; they will be denoted Pn . The basic properties being the same for all three kinds of puzzle-pieces, we will only formulate the results for the last kind. We begin by noting: j
Lemma 7.5 (Markov property). For any two puzzle pieces Pni , Pm one of the following two possibilities holds: they are disjoint, or one is a subset of the other. This allows us again to define for a point z ∈ J (Ra ) which is not a preimage of αa Pd (z) as the puzzle-piece of depth d which contains z. Further, set Ad (z) = Pd (z)\Pd+1 (z); we refer to this set as a complementary annulus, although it could be degenerate. We again label the annuli as critical, off-critical, and semi-critical depending on the position of the critical point −1. A critical annulus Ad+k (−1) will be called a child of the critical annulus Ad (−1) if Rak : Ad+k (−1) → Ad (−1) is an unramified double covering.
28
M. Aspenberg, M. Yampolsky
We define Ta to be a marked array Ta = (mod Ad (Ran (−1))), d, n ≥ 0, with the positions marked as critical, off-critical, or semi-critical if the respective annuli are. The following proposition is verified in a straightforward way, completely similarly to the quadratic case. We therefore omit the proof. Proposition 7.6. The marked array Ta is a critical tableau. However, it may happen that there is no non-degenerate annulus in the tableau Ta . We will need to modify the construction of the annuli slightly to guarantee the existence of one. 7.3. Non-degenerate annuli. The construction of a non-degenerate critical annulus for Ra is somewhat more delicate than that for a quadratic polynomial. We begin with the following: ˆ D. ¯ Lemma 7.7. We have P1 (−1) C\ Proof. There are q ≥ 3 infinite bubble rays Bk , k = 1, . . . q landing at α. First, let us argue that at least one bubble ray Bk contains A−2 (the Fatou component of Ra containing −2) and another contains A0 . Suppose this is not the case. Then all, but possibly one, external angles θk for Bk will belong to (1/6, 1/3) ∪ (2/3, 5/6). But then all, but possibly one, of the images of θk under doubling will belong to (1/3, 2/3), which is disjoint from (1/6, 1/3) ∪ (2/3, 5/6). Since q ≥ 3 this gives a contradiction. We want to show that the preimages Bk of Bk landing at the preimage of α have the same property, that is at least one bubble ray Bk contains A−2 and another contains A0 . If this is not the case then the images of all, but possibly one, Bk have angles in (1/3, 2/3), which is impossible. Hence the region P1 (−1) is bounded by four bubble rays which all emerge from A−2 or A0 . It is easy to see that this region is compactly contained in Ac∞ , and the lemma follows. 1 Now let us denote Z 11 , . . . , Z q−1 the puzzle-pieces of level 1 which are not adjacent to αa , but to its other preimage αa . It is easy to see that if Ta is not a periodic tableau, q j then some iterate of the critical point −1 under Ra will escape to one of the pieces Z 1 . The first time this happens, say after the n th iterate, we can pull back the degenerate j qn annulus P0 (−1)\P1 under Ra . See Fig. 8 for an illustration. This will give a degenerate critical annulus Am (−1). However, by Lemma 7.7, the only place where the boundaries of Pm (−1) and Pm+1 (−1) touch is a preimage of the segment l of two internal rays containing A∞ ∩ A0 which connects D and D . The invariance of A∞ ∪ A0 implies:
Lemma 7.8. The pinching of any child of Am (−1) is disjoint from Pm (−1) ∩ Pm+1 (−1). This means in particular the following: Corollary 7.9. Let Am (−1) be as above. Let Am j (−1) be any child of Am (−1). Then the critical puzzle pieces Pm j (−1) satisfy Pm j+1 (−1) Pm j (−1) and Pm j+1 +1 (−1) Pm j +1 (−1).
Mating Non-Renormalizable Quadratic Polynomials
29
Fig. 4. Bubble rays for f ◦◦ and Ra . The picture below is a mating of f ◦◦ with a hyperbolic parameter in the 1/3-limb of M. Three periodic bubble rays land at a repelling fixed point of the rational map. The solid lines follow their axes. Their angles are 1/7, 2/7, and 4/7 respectively. The axes of the same bubbles are shown inside K ◦◦ in the above pictures. The broken lines show the position of the spines
Let us now thicken the arc l to a strip S which is invariant under the branch of Ra−1 fixing pa . Let us now replace Am (−1) with a non-degenerate annulus A˜ m (−1) obtained by thickening Am (−1) with the preimage of S. Definition 7.6. The thickened tableau T˜a is obtained from Ta by preserving the same marking, and replacing the moduli of the images and pre-images of Am (−1) with those of A˜ m (−1). We derive: Theorem 7.2. Assume that the critical tableau Ta is recurrent and not periodic. Then Pd (−1) = {−1}.
30
M. Aspenberg, M. Yampolsky
Fig. 5. An example of a parameter wake, W (1/7, 2/7). The axes of the parabubble rays P1/7 , P2/7 which bound the wake are indicated. Their common landing point is the parameter value a0 for which Ra0 has a parabolic fixed point z 0 with eigenvalue e2πi/3 . The orbit portrait of z 0 is {1/7, 2/7, 4/7}
Fig. 6. The Yoccoz puzzles of depths 0 and 1, with q = 3 external rays landing at α
Proof. By Corollary 7.9, it is evident that T˜a is a critical tableau, and Theorem 7.1 holds for it. By Lemma 7.2 this implies the result. We now handle the non-recurrent case: Lemma 7.10. If there is some N so that PN (−1) is disjoint from the orbit z 0 → z 1 → . . ., then ∩n Pn (z 0 ) = {z 0 }. Proof. Let us first thicken the puzzle pieces at the initial depth 0. Let B be a linearizing neighborhood of α, and let G be a linearizing neighborhood of p = A∞ ∩ A0 . Denote G 1 , . . . , G k the finitely many preimages of G which
Mating Non-Renormalizable Quadratic Polynomials
31
j
Fig. 7. A bubble puzzle of depth 1. Note that the pieces P0i and P1 touch at an arc connecting A0 and A∞
/ /
/ / /
/ /
/ / / /
/
/ /
/
Fig. 8. A bubble-puzzle of depth 1 together with some preimages of the pieces Z 11 and Z 12 . The broken lines show the “equipotential” of depth 4. Note that Z 41 is degenerate in the sense that its boundary touches the boundary of P0 (−1), whereas Z 42 is not
• intersect one of the B1 , . . . , Bq , and j j • are not contained in B. Let P˜0 be a thick puzzle-piece of depth zero. We denote Pˆ0 j the union of P˜0 with B and with those of the domains G i which intersect with it. j j Thickened puzzle pieces Pˆd of depth d are the d th preimages of Pˆ0 . Note that the Markov property fails for these domains, however for each puzzle piece Pd (z) there exists a unique thickened puzzle piece Pˆd (z) which compactly contains it.
32
M. Aspenberg, M. Yampolsky
Now the proof goes precisely as in [Mi5]. Set Ui = PˆNi −1 , numbered so that U0 = PˆN −1 (−a). Equip every Ui with the Poincaré distance ρi (x, y). Note that for each i > 0 there are exactly two univalent branches g1i and g2i of Ra−1 defined on Ui , each of which carries Ui into a proper subset of some U j . It follows that for each puzzle piece PNi −1 , i > 0, the branch gki shrinks the Poincaré distance by some definite factor λ < 1. Since the orbit z 0 , z 1 , z 2 , . . . avoids the critical puzzle piece we get that diam(PN +h (z 0 )) ≤ δλh , and the statement of the lemma follows.
7.4. Combinatorics of the puzzle. We make some definitions first. Let a1 , a2 be two parameters in the same wake W . We say that Ra1 and Ra2 have the same combinatorics of the puzzle up to depth d if there exists an orientation preserving homeomorphism ˆ →C ˆ such that the following holds: φ:C • φ homeomorphically maps distinct puzzle pieces Pki of depth k ≤ d of Ra1 to distinct j puzzle-pieces Q k of depth k of Ra2 ; • for all k ≤ d we have φ : Pk (−1) → Q k (−1); • finally, φ respects the dynamics, that is, j
j
Pki = Ra1 (Pk ) if and only if φ(Pki ) = Ra2 (φ(Pk )). Similarly, we will say that a quadratic polynomial f c and Ra have the same combinatorics of the puzzle up to depth d, if there exists an orientation-preserving continuous surjection φ which maps puzzle-pieces of f c to those of Ra up to depth d, sending critical pieces to critical ones, and respecting the dynamics. Proposition 7.11. Let f c be a quadratic polynomial without non-repelling fixed points. For every d there exists a parameter a such that Ra and f c have the same combinatorics of the puzzle down to depth d. Moreover, consider the puzzle-piece Pd (c) of f c , and let β1 , . . . , βk be the angles of external rays which bound it. Then bubble rays with the same angles bound the puzzle piece Q d (−a) of Ra . Finally, there exists an open set d in the a−plane, with d ⊂ d−1 , and 0 = W such that Rb has the same combinatorics of the puzzle to depth d and −b is contained in the particular puzzle piece of level d if and only if b ∈ d . Proof. The proposition follows by a straightforward induction on the depth d. The base of induction, with d = 0 is given by Lemma 6.11. Assuming the statement is true at depth d − 1, consider the pullback of the puzzle of level 1 inside the critical value piece Pd−1 (−a). By assumption, this picture has the same combinatorial structure as the similar one for f c . By Lemma 6.7, as the parameter a moves through d−1 , the critical value sweeps out Pd−1 (−a). We can hence select a parameter a to match the combinatorics of the puzzle of f c down to level d. The parameter plane statement follows from similarly obvious consideration and is left to the reader. Definition 7.7. We call a set d as above a parameter puzzle piece.
Mating Non-Renormalizable Quadratic Polynomials
33
8. Existence of a Mating Fix a Yoccoz’ polynomial f c which is not critically finite, non-renormalizable, and such that c does not belong to the 1/2-limb of the Mandelbrot set. By Proposition 7.11, there exists a parameter value a such that Ra has the same combinatorics of the puzzle as f c for all d ∈ N. Lemma 8.1. Consider any z ∈ J (Ra ) which is not a preimage of αa or pa . Then the nested sequence of puzzle pieces Pd (z) shrinks to z : Pd (z) = {z}. Proof. Assume first that there exists some N > 0 such that the orbit of z is disjoint from PN (−1). In this case, the claim is implied by Lemma 7.10. In the opposite case, for each n ∈ N consider the first instance i such that Rai (z) ∈ Pn+1 (−1). Then the annulus A˜ n+i (z) is a conformal copy of A˜ n (−1). By construction, all these annuli around z are disjoint, and hence by Theorem 7.2, mod A˜ n (z) = ∞. By Lemma 7.2, we have the claim.
Lemma 8.2. Every bubble ray for Ra lands. Proof. This is obviously true for the preimages of the rays landing at the fixed point α. Let z be an accumulation point of any other ray B = ∪∞ 0 Fi . There is an infinite sequence of nested puzzle pieces Pd (z) containing z, and by the previous lemma, Pd (z) = {z}. Now by Lemma 2.7 the bubbles Fi do not cross the boundaries of Pd (z), and hence Fi → z. 8.1. Construction of semiconjugacies. Consider the conjugacy ◦
−n φ : K ◦◦ ∪n f ◦◦ (α) → ∪n Ra−n (A∞ ∪ { p})
defined in Proposition 4.5. By Lemma 8.2 and Lemma 5.6 it extends by continuity to a ˆ semi-conjugacy K ◦◦ → ∪Ra−n (A∞ ) = C: φ1 ◦ f ◦◦ (z) = Ra ◦ φ1 (z).
(8.1)
Let z ∈ Jc and not a preimage of α, and let Pd (z) be the sequence of Yoccoz’ puzzlepieces of depth d containing z. Let Q d (z) be the corresponding pieces in the puzzle of Ra and define φ2 (z) = ∩Q d (z). By construction, φ2 extends continuously to ∪n f c−n ({α}) and for the extended map φ2 ◦ f c = R a ◦ φ2 . Let ∼r denote the ray equivalence relation generated by the quadratics f ◦◦ and f c . We proceed to demonstrate:
34
M. Aspenberg, M. Yampolsky
Theorem 8.1. We have φi (z) = φ j (w) if and only if they are in the same ray equivalence class, z ∼r w. We begin with the following definition. Definition 8.1. For q > 1, let θ1 → θ2 → · · · → θq → θ1 be a period q orbit of the doubling map. The angles θi partition the circle into arcs Ai , i = 1, . . . , q, which we enumerate in the counter-clockwise order starting from the arc containing 0. For θ ∈ T which does not eventually fall into the orbit under doubling, we denote σθ1 ,...,θq (θ ) the itinerary of θ with respect to the partition Ai , viewed as an infinite string in {1, . . . , q}∞ . In the case when θ is a preimage of one of the θi the itinerary σθ1 ,...,θq (θ ) will be a finite string of digits between 1 and q – to avoid ambiguity, the last Ai will be chosen to the right of θi . In a very similar way, let us define a symbol sequence σ (z) ∈ {1, . . . , q}∞ with respect to the initial Yoccoz puzzle for f c or the initial Yoccoz bubble-puzzle for Ra as follows. Enumerate the initial puzzle-pieces of f c as P0k , k = 1, . . . , q in counterclockwise order around α, starting with P01 0. Set Q k0 to be the puzzle piece of Ra , which corresponds to P0k . Put j k if f c (z) ∈ P0k , for z ∈ J ( f c )\ ∪n f c−n (α), σ (z) = j k if Ra (z) ∈ Q k0 , for z ∈ J (Ra )\ ∪n Ra−n (αa ∪ pa ). Since φ1 is a semi-conjugacy the following lemma is immediate. Lemma 8.3. Assume that z ∈ K ◦◦ is uni-accessible and let φ1 (z) = ζ . Let −β be the angle of the external ray landing at z. If z is not a preimage of the α-fixed point, then σ (ζ ) = σ−θ1 ,...,−θq (−β). Recall now that a point in the Julia set J◦◦ is bi-accessible if and only if it is a preimage of α◦◦ . The latter is the landing point of two external rays, R1/3 , and R2/3 , forming a period 2 cycle. Let d be the function d : z → 2z mod Z. Lemma 8.4. Let Rθ be a ray landing at a bi-accessible point x ∈ J◦◦ . Then the landing point of R−θ in Jc is uni-accessible. Proof. The angle −θ has a finite orbit under the doubling, and hence the orbit of the landing point y of the ray R−θ is also finite. By assumption, f c is not critically finite, and hence the orbit of y does not include 0. Denote n the first iterate for which d n (−θ ) ∈ {1/3, 2/3}, and z = f n (y). Since f n is a local homeomorphism on a neighborhood of y, the number m of accesses is the same for y and z. Assume that m > 1. Note first that z cannot be a fixed point, as otherwise the ray portrait {{1/3, 2/3}} is realized for f c , and c is in the 1/2-limb. Hence z has period 2. By the properties of periodic external rays all rays landing at z have the same period, 2, and same for f (z). Hence, there are m × 2 ≥ 4 angles in T whose period under the doubling is equal to 2. By inspection, 1/3 and 2/3 are the only angles with this property, and we have arrived at a contradiction.
Mating Non-Renormalizable Quadratic Polynomials
35
By assumption, there exists q > 2 such that there is a cycle of rays Rθ1 , . . . , Rθq landing at the dividing fixed point α of f c . By construction, a cycle of bubble rays Bθ1 , . . . , Bθq with the same angles lands at the fixed point αa . Lemma 8.5. We have φ1 (z) = φ1 (w) if and only if z ∼r w. Proof. By Lemma 2.7, only uni-accessible points can be identified. From Lemma 8.4 the lemma now follows if at least one of z and w is bi-accessible. Hence we can assume that both z and w are either landing points of infinite bubble rays B1 , B2 ⊂ K ◦◦ , or that one of z and w or both lies on a uni-accessible point on the boundary of a bubble. Denote −β1 , −β2 the angles of the external rays landing at z and w respectively. (In the case when z and w are landing points of infinite bubble rays Bi , note by definition, that the angles of these bubble rays are β1 and β2 respectively.) By Lemma 8.3, φ1 (z) = φ1 (w) if and only if σ−θ1 ,...,−θq (−β1 ) = σ−θ1 ,...,−θq (−β2 ).
(8.2)
Now, consider the external rays Rβi of f c . Since the combinatorics of the puzzles of f c and Ra is the same for every depth, these two rays have a common landing point if and only if (8.2) holds. The statement of the lemma now follows from Lemma 8.4. Lemma 8.6. We have φ2 (z) = φ2 (w) if and only if z ∼r w. Proof. Note that by Lemma 8.4, if z = w, then z ∼r w if and only if both of these points are uni-accessible, and denoting β1 , β2 their external angles, we have d n (β1 ) = 1/3, d n (β2 ) = 2/3 for some n. On the other hand, if ζ = φ2 (z) = φ2 (w), then ζ ∈ Ra−n ( pa ) for some n. It is thus enough to show that φ2 (z) = φ2 (w) = pa if and only if z, w are the landing points of the external rays R1/3 , R2/3 respectively. By construction, at most two points in Jc are mapped to pa by φ2 , so we only need to prove the second implication. The landing points z, w of rays R1/3 , R2/3 form a cycle of period 2, hence, the period of the cycle ζ1 = φ2 (z), ζ2 = φ2 (w) is at most 2. By Lemma 2.7, these points do not lie in the boundary of any of the bubbles. Assume that ζ1 = pa = ζ2 . Then there exists a bubble ray of angle θ landing at ζ1 . Since the combinatorics of the puzzle is the same for Ra and f c , σθ1 ,...,θq (θ ) = σθ1 ,...,θq (1/3). This bubble ray then lands at a point in J◦◦ with the external angle 2/3, which is a contradiction. We finish the proof of Theorem 8.1 with the following: Lemma 8.7. We have φ1 (z) = φ2 (w) if and only if z ∼r w.
36
M. Aspenberg, M. Yampolsky
Proof. If z ∈ K ◦◦ is uni-accessible then let −β be the angle of the external ray landing at z and put ζ = φ1 (z). By Lemma 8.3, σ−θ1 ,...,−θq (−β) = σ (ζ ). If ζ = φ2 (w), then w lies in the same puzzle-pieces as the point ζ , by definition. An external ray Rγ (there can be more than one) which lands at w must by Lemma 8.3 satisfy σθ1 ,...,θq (γ ) = σ (ζ ). Obviously, one solution is γ = −β, and therefore z ∼r w. Conversely, if z ∼r w, then φ1 (z) = φ2 (w) by construction. If z ∈ K ◦◦ is bi-accessible then the lemma follows from Lemma 8.4. We conclude: Main Theorem, the existence part. Suppose c is a non-renormalizable parameter value outside the 1/2-limb of M. Then the quadratic polynomials f c and f ◦◦ are conformally mateable.
9. Uniqueness of Mating To transfer the results of shrinking puzzle pieces in the dynamical plane to the parameter plane, we use a variation of the approach of Yoccoz (see [Hub]). Our arguments follow the presentation of [Ro1]. Let us recall the following definition. Definition 9.1. Let X be a connected complex mainfold. A holomorphic motion over a set E ⊂ C is a function ˆ ϕ : X × E → C, where ϕ(λ, z) is holomorphic in the variable λ ∈ X and injective in z ∈ E. We make use of a stronger version of the λ-lemma of Man˜e-Sud-Sullivan [MSS], due to Slodkowski [Slo]. The λ-Lemma. A holomorphic motion over a set E has a unique extension to a holoˆ morphic motion over E. The extended motion gives a continuous map ϕ : X × E → C. ˆ extends to a quasiconformal map of C ˆ to itself. For each λ ∈ X , the map ϕλ : E → C Let us fix a parameter c satisfying the conditions of the Main Theorem. Let n be the nested sequence of parameter puzzle-pieces of Proposition 7.11 in the a-plane. Our aim is to show: Theorem 9.1. We have diam(n ) → 0.
Mating Non-Renormalizable Quadratic Polynomials
37
Let us fix a parameter a0 ∈ ∩n . Let P be a parabubble intersecting some n . Denote by Ba the bubble containing the critical value −a for Ra with a ∈ P. Let k ∈ N be the smallest such that for any a ∈ P, R k (−a) ∈ Aa∞ . Let ˆ a : Aa∞ → C\D denote the normalized Böttcher coordinate at infinity. By Lemma 5.6, it extends homeomorphically to the boundary. We then obtain a homeomorphism P → Ba0 by the formula F : a → Ra−k ◦ a−1 ◦ a ◦ Rak (−a). 0 0 Pasting these homeomorphisms together, we obtain Lemma 9.1. There is a homeomorphism from the closure of the boundary of the parameter puzzle piece of depth n into the closure of the boundary of the puzzle of depth n for Ra0 . We now construct a holomorphic motion on the boundary of the puzzle at an initial level. a0 ˆ where I a0 is the → C, Lemma 9.2. There is a holomorphic motion h n : n × In+1 n+1 a a . Moreover, 0 closure of the boundary of the puzzle of depth n + 1. We have h an (In+1 ) = In+1 a0 Ra ◦ h an (z) = h an0 ◦ Ra0 (z), for any z ∈ In+1 .
Proof. Indeed, as a varies throughout n , the critical value does not hit the bubble rays corresponding to the puzzle of depth n according to Lemma 5.5. We get from Lemma 5.9 that Aa∞ moves holomorphically on n . So do the preimages of Aa∞ as long as we do not hit the critical value. It follows that every bubble B in the boundary of the puzzle of depth n moves holomorphically according to the formula ηa (z) = Ra−k ◦ a−1 ◦ a0 ◦ Rak0 (z),
(9.1)
where k is smallest integer such that Rak (z) ∈ A∞ , for z ∈ B. Since the critical value does not intersect the puzzle of depth n, we can pull back this puzzle once so that the puzzle of depth n + 1 moves holomorphically as well. The λ-Lemma now extends the motion to its closure. It follows from (9.1) that a ) = I a0 and that the diagram h an (In+1 n+1 h an
a0 In+1 −−−−→ ⏐ ⏐ R a0
a In+1 ⏐ ⏐R a
h an−1
Ina0 −−−−→ Ina is commutative.
a be the puzzle piece bounded by h a (∂ P a0 ), where P a0 is the Definition 9.1. Let Dn+1 n n+1 n+1 puzzle piece Pn+1 surrounding the critical value −a0 at depth n + 1.
38
M. Aspenberg, M. Yampolsky
We have the following: Lemma 9.3. The parameter a ∈ m \m+1 if and only if the critical value −a ∈ a \D a . Dm m+1 Proof. Take a non self-intersecting path at from a0 to the boundary of m ,t ∈ [0, 1], crossing the boundary of m+1 exactly once. Then the critical value −at has to cross the a0 a ⊃ D a . Assume this happens at boundary of h amt (∂ Pm+1 ), since we always have Dm m+1 at t = t0 . Then for t > t0 we get that −at ∈ / Dm+1 , since we are outside m+1 . Similarly, a0 −at ∈ Dm+1 for t < t0 . Proof of Theorem 9.1. Let us first handle the harder case, when the critical tableau of f c is recurrent. Extend the holomorphic motion on m 0 at depth m 0 by the λ-Lemma, so that we get a holomorphic motion on m 0 with dilatation K = K (δ(a, ∂m 0 )), which depends on the conformal distance δ(a, ∂m 0 ) from a to the boundary of m 0 . Let us call this extended motion h˜ m 0 . m −m Now, lift the motion h˜ m 0 via the unbranched covering maps Ra j 0 for a ∈ m j . We get a holomorphic motion ˆ h˜ m j : m j × Aam0j −→ C, where Aam0j = Pm j (−a0 )\Pm j +1 (−a0 ) is an annulus surrounding the critical value (the Am j are children to Am 0 ). Since holomorphic composition does not change the dilatation, it follows that this lifted motion has the same dilatation K as h˜ m 0 . Moreover, the annuli a \D a Aam0j move holomorphically; set Aam j = h˜ m j (Aam0j ). In other words, Aam j = Dm m j +1 . j a By Lemma 9.3, we have that a ∈ m j \m j +1 if and only if −a ∈ Am j . Define the parameter annuli An = n \n+1 . Fix the number N = m j from now on and let N = . Define a map defined on , by H = H N : a → h˜ a−1 (−a). We see that H N : A N → AaN0 . On the boundary of it is injective, which follows directly from Lemma 5.9. The next issue is to show that the map H N is quasiconformal with a definite bound on the dilatation independent of N . Here the proof is again the same as in [Ro1]; let us differentiate the relation h˜ aN (H N (a)) = −a. Then we get ∂h aN (H N (a))∂ H N (a) + ∂h aN ∂ H N (a) = 0. This implies that the Beltrami coefficient µ(a) = ∂ H N/∂ H N satisfies |µ(a)| =
|∂h aN (H N (a))| KN − 1 = < 1, a |∂h N (H N (a))| KN + 1
where K N is the dilatation of h aN . However, if we consider the conformal representation χ : N → D, the λ-Lemma implies that KN =
1 + |χ (a)| . 1 − |χ (a)|
Since the set m j is compactly contained in m 0 for j ≥ 2, we get that K m j ≤ K , for all j ≥ 2.
Mating Non-Renormalizable Quadratic Polynomials
39
We claim that the map H N is injective. First of all, it is injective on the boundary of A N . Moreover, if we solve the Beltrami equation for µ, then we get a quasiconformal map φ : A N → φ(A N ), so that ∂φ = µ∂φ. It follows that H N ◦ φ −1 is conformal. By the Riemann- Hurwitz formula, there can not be any branch points in A N . Since H N is injective on the boundary of A N , it follows that H N ◦ φ −1 maps φ(A N ) conformally onto AaN0 . It follows that H N must be a homeomorphism. Since the annulus Am 0 (−1) may be degenerate, we again consider the thickened annuli A˜ m (−1) from Definition 7.6 – we select the initial thickened piece so that it moves holomorphically with a. Consider the thickened annulus A˜ m 0 (−a0 ) for a = a0 . The map H N (N = m j ) defined above then easliy extends to the thickened non-degenerate parameter annulus A˜ N . It follows that 1 1 mod A˜ am0j ≤ mod A˜ m j ≤ mod A˜ am0j . K K Since mod A˜ N = ∞ we have mod A˜ N = ∞, and we conclude from Lemma 7.2 that the parameter pieces N shrink to a single point, which has to be a0 . In the non-recurrent case, consider the puzzle of depth N so that the critical puzzle piece PN (−1) is disjoint from the postcritical set. As the critical value −a varies through N the puzzle at depth N +1 moves holomorphically as in Lemma 9.2. Hence every annulus A N (z) moves holomorphically. Extend this holomorphic motion by Slodkowski’s Theorem and denote the extended motion by h˜ similar to the above argument. Since every annulus An (−a0 ), for n > N , is a univalent pullback of some A N (z) (since R − a0 is non-recurrent) we can lift the holomorphic motion h˜ to the parameter piece n over Pn (−a0 ). Define a map Hn : An → An (−a0 ) in exactly the same way as above. The proof of the fact that the parameter annuli shrink to a single point is now similar to the recurrent case and we leave the details to the reader. We conclude: Main Theorem, the uniqueness part. The mating in the Main Theorem is unique. Acknowledgements. We wish to thank Mitsu Shishikura for useful comments. We are grateful to Vladlen Timorin for dicussing his own results on the family Ra with us, and for a helpful remark on a preliminary version of the paper. We are grateful to Roland Roeder for help with computer graphics and stimulating conversations. We thank Tan Lei for useful comments on an earlier version. Finally, the first author thanks Rodrigo Perez for stimulating discussions. This work was carried out at the Fields Institute, during the Dynamics Thematic Program of 2005-6. We gratefully acknowledge the Institute’s support and hospitality.
References [AB] [BH] [BS] [CG] [Do1]
Ahlfors, L., Bers, L.: Riemann Mapping Theorem for variable metrics. Ann. Math. 72, 385– 404 (1960) Branner, B., Hubbard, J.H.: The iteration of cubic polynomials. ii. Patterns and parapatterns. Acta Math. 3-4, 229–325 (1992) Bullett, S., Sentenac, P.: Ordered orbits of the shift, square roots, and the devil’s staircase. Math. Proc. Camb. Phil. Soc. 115, 451–481 (1994) Carleson, L., Gamelin, T.: Complex Dynamics. Berlin-Heidelberg NewYork: Springer-Verlag, 1993 Douady, A.: Algorithms for computing angles in the Mandelbrot set, In: Barnsley, Demko (ed.) “Chaotic Dynamics and Fractals,” London-NewYork: Academic Press, 1986, pp. 155–168
40
[Do2] [Do3] [DE] [DH1] [DH2] [Ep] [Hub] [Luo] [Lyu1] [Lyu2] [Lyu3] [MSS] [Mc] [Mi1] [Mi2] [Mi3] [Mi4] [Mi5] [Mo] [Re1] [Re2] [Ro1] [Ro2] [Sh1] [Sh2] [Sh3] [ST] [Slo] [Tan] [TY] [Ya] [YZ] [Za]
M. Aspenberg, M. Yampolsky
Douady, A.: Systéms dynamiques holomorphes. Seminar Bourbaki. Astérisque. 105-106, 39–64 (1983) Douady, A.: Disques de Siegel at aneaux de Herman. Seminar Bourbaki. Astérisque. 152-153, 151– 172 (1987) Douady, A., Earle, C.: Conformally natural extension of homeomorphisms of the circle. Acta Math. 157, 23–48 (1986) Douady, A., Hubbard, J.H.: Étude dynamique des polynômes complexes I & II. Preprint, Pub. Math. d’Orsay 84-02, 85-05, 1984/1985 Douady, A., Hubbard, J.H.: A proof of Thurston’s topological characterization of rational functions. Acta Math. 171, 263–297 (1993) Epstein, A.: Counterexamples to the quadratic mating conjecture. Manuscript Hubbard, J.H.: Local connectivity of Julia sets and bifurcation loci: three theorems of J.-C. Yoccoz, In: “Topological methods in modern mathematics” (Stony Brook, NY, 1991), Houston, TX: Publish or Perish, pp. 467–511, 1993 Luo, J.: Combinatorics and holomorphic dynamics: Captures, matings, Newton’s method. Thesis, Cornell University, 1995 Lyubich, M.Yu.: The dynamics of rational transforms: the topological picture. Russian Math. Surveys 41, 43–117 (1986) Lyubich, M.Yu.: Dynamics of quadratic polynomials i-ii. Acta Math. 178, 185–297 (1997) Lyubich, M.Yu.: Parapuzzles and SRB measures. Asterisque. 261, 173–200 (2000) Mañé, R., Sad, P., Sullivan, D.: On the dynamics of rational maps. Ann. Sci. École Norm. Sup. (4) 16(2), 193–217 (1983) McMullen, C.: Complex Dynamics and Renormalization. Ann. Math Stud. Vol. 135, 1994 Milnor, J.: Dynamics in One Complex Variable: Introductory Lectures, Wiesbaden: Vieweg, 1999 Milnor, J.: Geometry and dynamics of quadratic rational maps. Experim. Math. 2, 37–83 (1993) Milnor, J.: Periodic orbits, external rays, and the Mandelbrot set: An expository account. Asterisque 261 (1999) Milnor, J.: Pasting together Julia sets - a worked out example of mating. Expe. Math. 13(1), 55–92 (2004) Milnor, J.: Local connectivity of Julia sets: expository lectures. In: The Mandelbrot set, theme and variations, London Math. Soc. Lecture Note Ser., 274, Cambridge: Cambridge Univ. Press, pp. 67–116, 2000 Moore, R.L.: Concerning upper semi-continuous collection of continua. Trans. Amer. Math. Soc. 27, 416–428 (1925) Rees, M.: Realization of matings of polynomials as rational maps of degree two. Manuscript, 1986 Rees, M.: A partial description of parameter space of rational maps of degree two: part i. Acta Math. 168, 11–87 (1992) Roesch, P.: Holomorphic motions and parapuzzles, In: The Mandelbrot set, Theme and variations, London Math. Soc. Lecture Note Ser., 274, Cambridge: Cambridge Univ. Press, 2000 Roesch, P.: Topologie locale des méthodes de Newton cubiques. Thesis, E.N.S, Lyon, 1997 Shishikura, M.: On a theorem of M. Rees for matings of polynomials. In: The Mandelbrot set, Theme and variations, London Math. Soc. Lecture Note Ser., 274, Cambridge: Cambridge Univ. Press, 2000 Shishikura, M.: The Hausdorff dimension of the boundary of the Mandelbrot set and Julia sets. Ann. Math. 147, 25–267 (1998) Shishikura M.: Bifurcation of parabolic fixed points. In: The Mandelbrot set, Theme and variations, London Math. Soc. 274, Cambridge: Cambridge Univ. Press, 2000 Shishikura, M., Tan, L.: A family of cubic rational maps and matings of cubic polynomials. Exp. Math. 9(1), 29–53 (2000) Slodkowski, Z.: Natural extensions of holomorphic motions. J. Geom. Anal. 7(4), 637–651 (1997) Tan, L.: Matings of quadratic polynomials. Erg. Th. and Dyn. Sys. 12, 589–620 (1992) Tan, L., Yin, Y.: Local connectivity of the Julia set for geometrically finite rational maps. Sci. China Ser. A 39(1), 39–47 (1996) Yampolsky, M.: Complex bounds for renormalization of critical circle maps. Erg. Th. Dyn. Sys. 18, 1–31 (1998) Yampolsky, M., Zakeri, S.: Mating Siegel quadratic polynomials. J. Amer. Math. Soc. 14(1), 25–78 (2001) Zakeri, S.: Biaccessibility in quadratic Julia sets. Erg. Th. Dyn. Sys. 20(6), 1859–1883 (2000)
Communicated by L. Takhtajan
Commun. Math. Phys. 287, 41–65 (2009) Digital Object Identifier (DOI) 10.1007/s00220-008-0710-3
Communications in
Mathematical Physics
The Power of Quantum Systems on a Line Dorit Aharonov1, , Daniel Gottesman2, , Sandy Irani3, , Julia Kempe4, 1 School of Computer Science and Engineering, Hebrew University, Jerusalem, Israel.
E-mail:
[email protected]
2 Perimeter Institute, Waterloo, Canada. E-mail:
[email protected] 3 Computer Science Department, University of California, Irvine, CA 92697, USA.
E-mail:
[email protected]
4 School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel.
E-mail:
[email protected] Received: 28 January 2008 / Revised: 2 October 2008 / Accepted: 8 October 2008 Published online: 13 January 2009 – © Springer-Verlag 2009
Abstract: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic quantum computation using a one-dimensional quantum system (with 9 states per particle). This might have practical implications for experimentalists interested in constructing an adiabatic quantum computer. Building on the same construction, but with some additional technical effort and 12 states per particle, we show that the problem of approximating the ground state energy of a system composed of a line of quantum particles is QMA-complete; QMA is a quantum analogue of NP. This is in striking contrast to the fact that the analogous classical problem, namely, one-dimensional MAX-2-SAT with nearest neighbor constraints, is in P. The proof of the QMA-completeness result requires an additional idea beyond the usual techniques in the area: Not all illegal configurations can be ruled out by local checks, so instead we rule out such illegal configurations because they would, in the future, evolve into a state which can be seen locally to be illegal. Our construction implies (assuming the quantum Church-Turing thesis and that quantum computers cannot efficiently solve QMA-complete problems) that there are one-dimensional systems which take an exponential time to relax to their ground states at any temperature, making them candidates for being one-dimensional spin glasses. Supported by Israel Science Foundation grant number 039-7549, Binational Science Foundation grant number 037-8404, and US Army Research Office grant number 030-7790. Supported by CIFAR, by the Government of Canada through NSERC, and by the Province of Ontario through MRI. Partially supported by NSF Grant CCR-0514082. This work was mainly done while the author was at CNRS and LRI, University of Paris-Sud, Orsay, France. Partially supported by the European Commission under the Integrated Project Qubit Applications (QAP) funded by the IST directorate as Contract Number 015848, by an ANR AlgoQP grant of the French Research Ministry, by an Alon Fellowship of the Israeli Higher Council of Academic Research, by an Individual Research grant of the ISF, and by a European Research Council (ERC) Starting Grant.
42
D. Aharonov, D. Gottesman, S. Irani, J. Kempe
1. Introduction The behavior of classical or quantum spin systems frequently depends very heavily on the number of spatial dimensions available. In particular, there is often a striking difference between the behavior of one-dimensional systems and of otherwise similar twoor higher-dimensional systems. For instance, one-dimensional systems generally do not experience phase transitions except at zero temperature, whereas phase transitions are common in other dimensions. As another example, satisfiability with nearest neighbor constraints between constant-size variables set on a two- or larger-dimensional grid is a hard problem (NP-complete, in fact), whereas for a one-dimensional line, it can be solved in polynomial time. We thus ask: what is the computational power associated with a line of quantum particles? There are a number of ways to interpret the question. For instance, we can ask whether the evolution of such systems can be efficiently simulated by a classical computer. We can ask whether the system is powerful enough to create a universal quantum computer under various scenarios for how we may control the system — in which case we cannot hope to simulate this behavior efficiently on a classical computer, unless of course BQP = BPP. (BPP and BQP are the classes of problems efficiently solvable on a probabilistic classical computer and on a quantum computer, respectively.) We can also ask how difficult it is to calculate or approximate interesting properties of the system, such as its ground state energy (that is, the lowest eigenvalue of the Hamiltonian operator for the system). For many one-dimensional quantum systems, it is indeed possible to classically compute many properties of the system, including in some cases the dynamical behavior of the system. The method of the density matrix renormalization group (DMRG) [Whi92, Whi93,Sch05] has been particularly successful here, although there is no complete characterization of which one-dimensional systems it will work on. Indeed, DMRG provides a good example of the difference between one- and two-dimensional systems; there are only a few results applying DMRG techniques to simulate special two-dimensional systems. However, it has long been known that one-dimensional quantum systems can also, under the right circumstances, perform universal quantum computation. It is straightforward to create a quantum computer from a line of qubits with fully controllable nearest-neighbor couplings by using SWAP gates to move the qubits around. Even a one-dimensional quantum cellular automaton can perform universal quantum computation [Wat95,SFW06]; the smallest known construction has 12 states per cell. While many one-dimensional systems are relatively simple and can be simulated classically, the general one-dimensional quantum system must thus have complexities that are inaccessible classically. In two interesting (and closely related) subfields of the area of quantum computation, studied extensively over the past few years, it has been conjectured that one-dimensional systems are not as powerful as systems of higher dimensionality. These cases are adiabatic evolution, and the QMA-completeness of the local Hamiltonian problem.
1.1. Results related to adiabatic computation. In an adiabatic quantum computer, the Hamiltonian of the system is slowly shifted from a simple Hamiltonian, whose ground state is easy to calculate and to create, to a more complicated Hamiltonian, whose ground state encodes the solution to some computational problem. The quantum adiabatic theorem guarantees that if the Hamiltonian is changed slowly enough, the system stays close
The Power of Quantum Systems on a Line
43
to its ground state; the time required to safely move from the initial Hamiltonian to the final Hamiltonian is polynomial in the minimal spectral gap between the ground state and the first excited state over the course of the computation. The first adiabatic quantum algorithm was introduced by Farhi et al. [FGGS00, FGG+ 01], though the idea of encoding the solution to an optimization problem in the ground state of a Hamiltonian appeared as early as 1988 [ACdf90,ACdf88]. The computational power of the model was clarified in [AvDK+ 04], where it was shown that adiabatic quantum computers could in fact perform any quantum computation. Adiabatic computation can thus be viewed as an alternative model to quantum circuits or quantum Turing machines. Adiabatic quantum computers might be more robust against certain kinds of noise [CFP02], and the slow change of parameters used in an adiabatic quantum computer might be more amenable to some kinds of experimental implementation. To this end, it is important to understand what sorts of physical systems can be used to build an adiabatic quantum computer, and in particular, we would like the interactions of the physical Hamiltonian to be as simple as possible. Several research groups have devoted effort to this question recently. To describe their work, let us make the following definition: Definition 1 (Local Hamiltonian). Let H be a Hermitian operator (interpreted as a Hamiltonian, giving the energy of some system). We say that H is an r -state Hamiltonion if it acts on r -state particles. When r = 2, namely, when the particles are qubits, we often omit mention of the number of states per particle. We say that H is k-local if it can be written as H = i Hi , where each Hi acts non-trivially on at most k particles. Note that this term does not assume anything about the physical location of the particles. We say that H is a d-dim Hamiltonian if the particles are arranged on a d-dimensional grid and the terms Hi interact only pairs of nearest neighbor particles. Note that the term d-dim implies that the Hamiltonian is 2-local. We will in this paper assume for simplicity that each local term Hi in the Hamiltonian is positive definite and of norm at most 1. It is always possible to ensure this by shifting and rescaling the Hamiltonian H → λ(H + E 0 ). Provided we also similarly shift and rescale all other energies in the problem (such as the spectral gap), this transformation will not at all alter the properties of the Hamiltonian. We will further assume, to avoid pathologies, that there are at most polynomially many terms Hi and that the coefficients in each Hi are specified to polynomially many bits of precision. Aharonov et al. [AvDK+ 04] made a first step towards a practical Hamiltonian, by showing that a 2-dim 6-state Hamiltonian suffices for universal adiabatic quantum computation. Kempe, Kitaev and Regev [KKR06], using perturbation-theory gadgets, improved the results and showed that qubits can be used instead of six-dimensional particles, namely, adiabatic evolution with 2-local Hamiltonians is quantum universal. Their interactions, however, were not restricted to a two-dimensional grid. Terhal and Oliveira [OT05] combined the two results, using other gadgets, to show that a similar result holds with 2-dim 2-state Hamiltonians. Naturally, the next question was whether a one-dimensional adiabatic quantum computer could be universal. Since one-dimensional systems are fairly simple, it was conjectured that the answer was “no.” However, in this paper, we prove Theorem 1. Adiabatic computation with 1-dim 9-state Hamiltonians is universal for quantum computation. As mentioned, this could be important experimentally, as one-dimensional systems are easier to build than two-dimensional ones, and adiabatic systems might be more
44
D. Aharonov, D. Gottesman, S. Irani, J. Kempe
robust than standard ones. Any simplification to the daunting task of building a quantum computer is potentially useful. However, a more systematic way of dealing with errors will be needed before it is possible to build a large adiabatic quantum computer. The results of [CFP02] only imply adiabatic quantum computation is robust against certain types of control errors, and it remains an interesting open question to show that adiabatic quantum computation can be made fault-tolerant in the face of general small errors. An important step in this direction is [JFS06], which introduces some quantum error-correcting codes in the adiabatic model. It is also worth noting that the adiabatic construction given in the proof of Theorem 1 actually has a degenerate ground state, which makes it less robust against noise than a non-degenerate adiabatic computer, although still resistant to timing errors, for instance. Using a 1-dim 13-state Hamiltonian similar to the QMA-complete 1-dim 12-state Hamiltonian family described below, it is possible to break the degeneracy. This construction is outlined in Sect. 4.1. It is natural to ask whether our result holds even when we restrict ourselves to translationally invariant Hamiltonians. We sketch one way to do this in Sect. 2. However, it does not appear to be possible to make the translational invariant adiabatic construction nondegenerate.
1.2. Results related to QMA-completeness. Theorem 1 means that efficient simulation of general one-dimensional adiabatic quantum systems is probably impossible. One might expect that calculating, or at least approximating, some specific property of a system, such as its ground state energy, would be more straightforward, as this does not require complete knowledge of the system. This intuition is misleading, and in fact it can be harder to find the ground state energy than to simulate the dynamics of a system. More concretely, it has long been known that it is NP-hard to find the ground state energy of some classical spin systems, such as a three-dimensional Ising model. Kitaev [KSV02] extended these results to the quantum realm, by defining the quantum analogue of NP, called QMA (for “quantum Merlin-Arthur”). QMA is thus, roughly speaking, the class of problems that can be efficiently checked on a quantum computer, provided we are given a “witness” quantum state related to the answer to the problem. QMA is believed to be strictly larger than both BQP and NP. That is, a problem which is QMA-complete can most likely not be solved efficiently with a quantum computer, and the answer cannot even be checked efficiently on a classical computer. Kitaev proved that the problem of approximating the ground state energy of a quantum system with a 5-local Hamiltonian is complete for this class. (The ability to solve a QMA-complete problem implies the ability to solve any problem in QMA.) The exact definition of the local Hamiltonian problem is this: Definition 2 (Local Hamiltonian problem). Let H = i Hi be an r -state k-local Hamiltonian. Then (H, E, ∆) is in r -STATE k-LOCAL HAMILTONIAN if the lowest eigenvalue E 0 of H is less than or equal to E. The system must satisfy the promises that ∆ = (1/poly(n)) and that either E 0 ≤ E or E 0 ≥ E + ∆. We can define a language d-DIM r -STATE HAMILTONIAN similarly. Kitaev’s proof uses what is called the circuit-to-Hamiltonian construction of Feynman [Fey85], which we sketch in Subsect. 1.5. The main result of [AvDK+ 04], namely the universality of adiabatic computation, was based on the observation that the circuit-to-Hamiltonian construction is useful also in the adiabatic context, where it is used
The Power of Quantum Systems on a Line
45
to design the final Hamiltonian of the adiabatic evolution. It turns out that the same connection between adiabatic universality proofs and QMA-completeness proofs can also be made for many of the follow-up papers on the two topics. It is often the case that whenever adiabatic universality can be proven for some class of Hamiltonians, then the local Hamiltonian problem with the same class (roughly) can be shown to be QMA-complete — and vice versa. Note, however, that there is no formal implication from either of those problems to the other. On one hand, proving QMA-completeness is in general substantially harder than achieving universal adiabatic quantum computation: In an adiabatic quantum computer, we can choose the initial state of the adiabatic computation to be any easily-created state which will help us solve the problem, so we can choose to work on any convenient subspace which is invariant under the Hamiltonian. For QMA, the states we work with are chosen adversarially from the full Hilbert space, and we must be able to check ourselves, using only local Hamiltonian terms, that they are of the correct form. On the other hand, proving adiabatic universality involves analyzing the spectral gap of all of the Hamiltonians H (t) over the duration of the computation, whereas QMA-completeness proofs are only concerned with one Hamiltonian. Both [KKR06 and OT05] in fact prove QMA-completeness; universal adiabatic quantum computation follows with a little extra work. Thus, the 2-DIM HAMILTONIAN problem is QMA-complete. However, the 1-DIM r -STATE HAMILTONIAN problem remained open for all (constant) r . It was suspected that the problem was not QMA-complete, and in fact might be in BQP or even BPP. For one thing, ground state properties of one-dimensional quantum systems are generally considered particularly easy. For instance, Osborne has recently proven [Osb07] that there are efficient classical descriptions for a class of onedimensional quantum systems. DMRG techniques have been employed extensively to calculate ground state energies and other properties of a variety of one-dimensional quantum systems. Furthermore, the classical analogue of 1-DIM r -STATE HAMILTONIAN is easy: Take r -state variables arranged on a line with constraints restricting the values of neighboring pairs of variables. If we assign a constant energy penalty for violating a constraint, the lowest energy state satisfies as many constraints as possible. This problem, a one-dimensional restriction of MAX-2-SAT with r -state variables, is in fact in P; it can be solved with a recursive divide-and-conquer algorithm or by dynamic programming. For instance, we can divide the line in half, and run through all possible assignments of the two variables xi and xi+1 adjacent to the division. For each pair of values for xi and xi+1 , we can calculate the maximal number of satisfiable constraints by solving the sub-problems for the right and left halves of the line. Then we can compare across all r 2 assignments for the one that gives the largest number of satisfied constraints. Thus, to solve the problem for n variables, it is sufficient to solve 2r 2 similar problems for n/2 variables. By repeatedly dividing in half, we can thus solve the problem in 2 O((2r 2 )log n ) = O(n log(2r ) ) steps. MAX-k-SAT in one dimension is also in P, and can in fact be reduced to MAX-2-SAT with large enough variables. Despite the intuition that one-dimensional systems should not be too difficult, we prove: Theorem 2. 1-DIM 12-STATE HAMILTONIAN is QMA-complete. The theorem implies a striking qualitative difference between the quantum and the classical one-dimensional versions of the same problem — one is easy, whereas the other is complete for a class which seems to be strictly larger than NP. This might seem
46
D. Aharonov, D. Gottesman, S. Irani, J. Kempe
surprising, but in retrospect, we can provide an intuitive explanation. The reason is that the k-local Hamiltonian essentially allows us to encode an extra dimension, namely, time, by making the ground state a superposition of states corresponding to different times. In other words, the result implies that the correct analogue of one-dimensional local Hamiltonian is two-dimensional MAX-k-SAT, which is of course NP-complete. Indeed, there are many cases in physics where one-dimensional quantum systems turn out to be most closely analogous to two-dimensional classical systems. One such example is given by Suzuki who showed that the d-dimensional Ising model with a transverse field is equivalent to the (d + 1)-dimensional Ising model at finite temperatures [Suz76], although the extra dimension there is quite different from the dimension of time addressed in this paper.
1.3. Implications of our results. One consequence of Theorem 2 is that there exist onedimensional systems which take exponentially long to relax to the ground state, with any reasonable environment or cooling strategy. To see this, we invoke a quantum version of the modern Church-Turing thesis, 1 which would state that any reasonable physical system can be efficiently simulated on a quantum computer. As it invokes a notion of a “reasonable” physical system, this is of course not a provable statement, but one can be convinced of it by looking at examples. The details of doing so for any particular system may be complicated, but no counter-example is known, and barring undiscovered laws of physics modifying quantum mechanics, the quantum Church-Turing thesis is believed to be true. In this particular case, we could thus use a quantum computer to simulate the system plus the environment. If the system reliably relaxes to the ground state in a time T , then by causality, we need only simulate an environment of size O(T 3 ) (for a threedimensional environment); the quantum simulation can be performed using standard techniques and runs in polynomial time. We can then use the simulation to solve 1-DIM 12-STATE HAMILTONIAN problems. Since the latter problem is difficult, that implies the simulation must also take a long time to reach the ground state. This observation assumes, of course, that QMA is exponentially hard to solve by a quantum computer. Similarly, we can argue that the class of systems presented in this paper will take an exponentially long time to relax to the thermal equilibrium state at very low temperatures (again, assuming QMA is hard for a quantum computer). To see this, suppose that there is a state of the system with energy less than E (the bound on the ground state energy from Definition 2), and note that at a temperature less than O(∆/n) (with ∆ polynomially small in the system size n), the Gibbs distribution gives a constant probability of the system occupying the low-lying state, even if there are exponentially many eigenstates with energy just above E + ∆. Of course, if there is no state with energy less than E + ∆, then the system will never have energy less than E + ∆, no matter what the temperature. Therefore, if the system were able to reach its thermal equilibrium state, by observing it, we would be sampling from the Gibbs distribution, and would, with good probability, be able to answer the QMA-complete 1-DIM 12-STATE HAMILTONIAN problem. Exponentially long relaxation times are a characteristic of a spin glass [BY86], making this system a candidate to be a one-dimensional spin glass. Spin glasses are not completely understood, nor is there a precise definition of the term, but it has been unclear whether a true one-dimensional spin glass can exist. There are a number of properties relevant to being a spin glass, long relaxation times among them, and clas1 The modern Church-Turing thesis is discussed, for instance, in [vEB90].
The Power of Quantum Systems on a Line
47
sical one-dimensional systems generally lack that property and most other typical spin glass properties. On the other hand, some other one-dimensional quantum systems are known [Fis95] that exhibit long relaxation times and some, but not all, other spin-glasslike properties. Our result may help shed further light on the situation. Unfortunately, we are unable to present a specific Hamiltonian with long relaxation times. As usual in complexity, it is difficult to identify specific hard instances of computationally hard problems. Similarly, we cannot say very much about other physically interesting properties of the system, such as the nature or existence of a liquid/glass phase transition. This paper is a merger of [Ira07] and version 1 of [AGK07], two similar papers originally written independently. The extended abstract of the merged version appeared in [AGIK07]. Following the initial version of our paper, various groups have improved and extended our result. For instance, [NW08] gives a 20-state translation-invariant modification of our construction (improving on a 56-state construction by [JWZ07]) that can be used for universal 1-dimensional adiabatic computation. Kay [Kay08] gives a QMA-complete 1-dim r -state Hamiltonian with all two-particle terms identical. Nagaj [Nag08] has improved our QMA construction to use 11-state particles. 1.4. Notation. A language is computer science terminology for a computational problem; it can be defined as a set of bit strings. Frequently we consider the language to be a proper subset of all possible bit strings, but here we will be more concerned with languages which satisfy a promise, meaning we consider the language as a subset of a smaller set of bit strings which satisfy some constraint. We will refer to the set of strings which satisfy the constraint as the instances of the problem. The instances then can be partitioned into two sets L yes , the set of instances which are in the language, and L no , the set of instances which are not in the language. The decision problem associated with the language is to decide if a given bit string is in the language or not. The instances represent different possible inputs about which we are attempting to reach a yes/no decision. For example, satisfiability (or SAT) is the decision problem for the language composed of Boolean formulas which have satisfying assignments of the variables; each instance encodes a possible formula, some of which can be satisfied and some of which cannot. A complexity class is a set of languages. The precise definition of the complexity class QMA is as follows: Definition 3. A language L is in QMA iff for each instance x there exists a uniform polynomial-size quantum circuit 2 C x such that (a) if x ∈ L yes , ∃|ψ (the “witness”, a polynomial-size quantum state) such that C x |ψ accepts with probability at least 2/3, and (b) if x ∈ L no , then ∀|ψ, C x |ψ accepts with probability at most 1/3. We only consider strings which are instances of L. We say we reduce language L to language M if we have a function f converting bit strings x to bit strings f (x) such that if x ∈ L yes then f (x) ∈ Myes and if x ∈ L no , then f (x) ∈ Mno . We do not put any requirement on the behavior of f when the input x does not satisfy the promise. f must be computable classically in polynomial time. The point is that if we can solve the decision problem for M then we can automatically also solve the decision problem for L by first converting x to f (x) and then checking if f (x) is in M. There are other notions of reduction, but this will be sufficient for our purposes. A language L is complete for a complexity class C if any language in C can be reduced to L. Thus, solving a C-complete language L implies the ability to solve any problem in 2 A uniform circuit is one whose description can be generated in polynomial time by a Turing machine.
48
D. Aharonov, D. Gottesman, S. Irani, J. Kempe
C with polynomial time overhead; L is thus one of the most computationally difficult problems in C. We will be interested in reducing an arbitrary QMA language L to variants of the language r -STATE k-LOCAL HAMILTONIAN. We will use x to refer to an instance of the original problem L, and C x to refer to the checking circuit associated with the instance x. That is, we assume that information about the instance is encoded in the structure of the checking circuit. The circuit C x acts on n qubits. Some of the qubits will be ancilla qubits which must be initialized to the state |0, whereas others are used for the potential witness for x ∈ L. In the context of adiabatic quantum computation, we will also use C x to refer to a more general quantum circuit, unrelated to a QMA problem. In this case, we consider C x to be in a form where all input qubits are |0. When the adiabatic quantum computation is intended to compute some classical function (such as factoring), x is the classical input to the function, which we hardwire into the structure of the circuit itself.
1.5. Outline of the approach. To explain the main idea behind the proofs of our two main theorems, we recall Kitaev’s proof that 5-LOCAL HAMILTONIAN is QMA-complete. The fact that r -STATE k-LOCAL HAMILTONIAN is in QMA is not difficult. The witness is the ground state of the Hamiltonian (or indeed any state with energy less than E), and a standard phase estimation technique can be used to measure its energy. The accuracy of the measurement is not perfect, of course, which is why we need the promise that the energy is either below E or above E + ∆. To prove completeness, we need to reduce an arbitrary QMA language L to 5-LOCAL HAMILTONIAN. The translation to local Hamiltonians is done by creating a Hamiltonian whose ground state is of the form t |φt |t (ignoring normalization), where the first register |φt is the state of the checking circuit C x at time t and the second register acts as a clock. We call this state the history state of the circuit. 3 The main term in Kitaev’s Hamiltonian sets up constraints ensuring that |φt+1 = Ut |φt , where Ut is the (t + 1)st gate in C x . This term, denoted Hprop , ensures that the ground state is indeed a history state, reflecting a correct propagation in time according to C x . The clock is used to associate the correct constraint with each branch of the superposition; any state which does not have the correct time evolution for the circuit will violate one or more constraints and will thus have a higher energy. Kitaev’s Hamiltonian includes more terms, which guarantee that the input to C x is correct, that the final state of the circuit is accepted, and that the state of the clock is a valid clock state and not some arbitrary state. In the context of adiabatic evolution, these additional terms are not needed, since we have control over the initial state, but they are needed to prove QMA-completeness, since we must be able to check (i) that the witness being tested for the QMA-complete problem has the correct structure, corresponding to a valid history state for a possible input to C x , and (ii) that C x accepts on that input. In order to prove the universality of adiabatic quantum computation, [AvDK+ 04] let Kitaev’s Hamiltonian Hprop be the final Hamiltonian in the adiabatic evolution, and set the initial Hamiltonian to be diagonal in the standard basis, forcing the initial ground state to be the correct input state |φ0 |0 of the circuit. At any point during the adiabatic quantum computation, the state of the system is then in a subspace I spanned by the states |φt |t, and the spectral gap of any convex combination of the initial and final Hamiltonians restricted to this subspace is at most polynomially small in the size of the 3 We call a state a history state if it has the above form for any input |φ to C , not just the correct input. x 0
The Power of Quantum Systems on a Line
49
original circuit. Therefore, the adiabatic quantum computation can be performed with at most polynomial overhead over the original circuit, to reach a state which is very close to the history state, from which the result of the original circuit can be measured with reasonable probability. Our idea for proving universality of adiabatic evolution and QMA-completeness in one dimension is similar. One would consider a quantum circuit C x , and design a 1-dim r -state Hamiltonian which will verify correct propagation according to this circuit, and then use this Hamiltonian as the final Hamiltonian for the adiabatic evolution or as the instance of the QMA-complete problem corresponding to the instance x of the original problem. This idea, however, is not easy to realize when our Hamiltonian is restricted to work on a one- or two-dimensional lattice, since we cannot directly access a separate clock register, as only the subsystems nearest to the clock would be able to take advantage of it in order to check correct propagation in time. Instead, following the strategy of [AvDK+ 04], we must first modify the original circuit C x into a new circuit C˜ x . This allows us to distribute the clock, making the time implicit in the global structure of the state. When time is encoded somehow in the configuration, then it can be ensured that the transition rules allow only propagation to the correct next step. The construction of [AvDK+ 04] used the following arrangement: the qubits of the original circuit were put initially in the left-most column in the two-dimensional grid, and one set of gates was performed on them. To advance time and perform another set of gates, the qubits were moved over one column, leaving used-up “dead” states behind. Doing all this required going up to 6 states per particle instead of 2, with the qubits of the original circuit encoded in various two-dimensional subspaces. The time could therefore be read off by looking at the arrangement and location of the two-dimensional subspaces containing the data. This construction relies heavily on the ability to copy qubits to the next column in order to move to the next block of gates in the computation, so a new strategy is needed in one dimension. For the modified circuit C˜ x , we instead place the qubits in a block of n adjacent particles. We do one set of gates, and then move all of the qubits over n places to advance time in the original circuit C x . It is considerably more complicated to move qubits n places than to move them over one column in a two-dimensional arrangement, and we thus need extra states. The adiabatic construction can be done using 9 states per particle, which we increase to 12 for QMA-completeness. A straightforward application of existing techniques can then complete the proof of one-dimensional universal adiabatic quantum computation, but there is an additional wrinkle for proving QMA-completeness. In particular, previous results used local constraints to ensure that the state of the system had a valid structure; for instance, in [AvDK+ 04], terms in the Hamiltonian check that there are not two qubit states in adjacent columns. However, using only local constraints, there is no way to check that there are exactly n qubit data states in an unknown location in a one-dimensional system — there are only a constant number of local rules available, which are therefore unable to count to an arbitrarily large n. We instead resort to another approach, which might be useful elsewhere. While our modified circuit has invalid configurations (containing, for instance, too many qubit states) which cannot be locally checked, we ensure that, under the transition rules of the system, any invalid configurations will evolve in polynomial time into a configuration which can be detected as illegal by local rules. Thus, for every state which is not a valid history state, either the propagation is wrong, which implies an energy penalty due to the propagation Hamiltonian, or the state evolves to an illegal
50
D. Aharonov, D. Gottesman, S. Irani, J. Kempe
configuration which is locally detectable, which implies an energy penalty due to the local check of illegal configurations. We call this result the clairvoyance lemma. The structure of the paper is as follows: in Sect. 2 we describe how to map circuits to one-dimensional arrangements. Sect. 3 shows our result on the universality of adiabatic computation on the line, and Sect. 4 gives the result on QMA-completeness. We conclude in Sect. 5. 2. The Basic Construction In this section, we will describe our construction which maps a quantum circuit C x to a modified circuit C˜ x . We first present the larger 12-state QMA construction, and explain how to modify it to get the 9-state adiabatic construction at the end of this section. There are a number of properties which C˜ x must satisfy. It should perform the same computation as C x , of course. In addition, each gate in C˜ x must interact only nearest-neighbor particles in a line; on the other hand, we allow those particles to be 12-dimensional. The gate performed at any given time cannot depend explicitly on the time (the number of gates already performed), but can depend on location. We will define the gates in terms of a variety of possible transition rules, and to remove any ambiguity, we will ensure that for a legal state of the system, only one transition rule will apply at any given time. For QMA-completeness, we need some additional properties ensuring that enough of the constraints are locally checkable. The problem of moving to one dimension is somewhat similar to a quantum cellular automaton in that the transition rules need to depend only on the local environment and not on some external time coordinate, but differs from a cellular automaton in a number of ways. A cellular automaton acts on all locations simultaneously and in the same way, whereas our transition rules are required to only cause one pair of particles to change per time step (provided the system is in a state of the correct form), and the transition rules differ slightly from location to location. A better analogy is to a single-tape Turing machine. We will have a single “active site” in our computation, analogous to the head of a Turing machine, which moves around manipulating the computational qubits, changing states as it does so in order to perform different kinds of actions. The transition rules of a Turing machine are independent of the location. In the construction below, we have a few different kinds of locations, for instance for the different sorts of quantum gates used in C x . Each kind of location has a different set of transition rules that apply (although many of the rules are the same for all types of location), and the position of a site determines which set of rules applies to that site. For the adiabatic construction, we could instead proceed with translational-invariant rules as with a Turing machine by initializing each site with an additional marker indicating what type of location it is supposed to be. This would require a substantial increase in the number of states per site (perhaps to 100 or so), and we do not know how to use translational invariant nearest-neighbor rules for the QMA result. Instead we use position-dependent rules. This enables us to use essentially the same construction for both the adiabatic result and the QMA-completeness result, and reduces the required number of states in the adiabatic case. In the beginning we put the quantum circuit we wish to simulate into a canonical form. Let n be the number of qubits in the circuit, labeled 1 . . . n from left to right in a line. We assume that the circuit is initialized to the all |0 state and consists of R rounds. Each round is composed of n − 1 nearest-neighbor gates (some or all of which may be the identity gate); the first gate in a round acts on qubits 1 and 2, the second on qubits
The Power of Quantum Systems on a Line
51
2 and 3, and so on. Any quantum circuit can be put into this form with the number of rounds at most proportional to the number of gates. We will assume that the first round and the last round contain only identity gates, as we will need those two rounds for additional checking in the QMA-completeness result. In the 1D arrangement, there will be a total of n R 12-state particles, arranged on a line in R blocks of n qubits, each block corresponding to one round in the circuit. Roughly speaking, we imagine that in the beginning the qubits are all in the first block. The first round of quantum gates is performed one by one on these qubits, after which they are moved to the next block, where the second round of gates is performed, and so on. Once the qubits reach the last block and undergo the last round of gates, their state will be the final state of the circuit. The main difficulty we will have to overcome is our inability to count. Since there are only a constant number of states per site, there is no way to directly keep track of how far we have moved. Our solution is to move the full set of qubits over only one space at a time. We keep moving over until the qubits reach the next block. We can tell that we have reached a new block, and are ready to perform a new set of gates, by making the transition rules different at the boundary between two blocks. When the qubits are correctly aligned with a block, a qubit state and a non-qubit state will be adjacent across a block boundary, whereas while the qubits are moving, adjacent pairs of particles which cross a block boundary will either have two qubit states or two non-qubit states. We denote a block boundary by · ·. The 12 states in each site consist of 2-state subsystems (different versions of a qubit holding data), represented by elongated shapes (e.g., ), and 1-state subspaces, represented by round shapes (e.g., ). Two of the 2-state systems and two of the 1-state site types will be “flags” or “active” sites, which will be represented by dark shapes and can be thought of as pointers on the line that carry out the computation. Light-colored shapes represent a site that is inactive, waiting for the active site to come nearby. There will only be one active site in any (valid) configuration. We have the following types of states: Inactive states : Qubits to right of active site : Qubits to left of active site : Unborn (to right of all qubits) : Dead (to left of all qubits)
Flags (active states) : Gate marker (moves right) : Right-moving flag : Left-moving flag, moves qubits right one space : Turning flag
The and active sites are qubit states. In the analogy to a Turing machine, they can be thought of as the head sitting on top of a qubit on the tape. The and flags are one-dimensional subspaces, which sit between or next to the particles which are in qubit states. Definition 4. We use the term configuration to refer to an arrangement of the above types of states without regard to the value of the data stored in the qubit subsystems. Valid (or legal) configurations of the chain have the following structure: · · · (qubits) · · · , where the · · · string or · · · string might not appear if the qubits are at one end of the computer. The (qubits) string consists of either n sites (for the first two possibilities) or n + 1 sites (for the last three choices) and is of one of the following forms:
52
D. Aharonov, D. Gottesman, S. Irani, J. Kempe
··· ··· ···
··· ···
··· ··· ···
In the first three cases, either the string or the string might be absent when the active site is at one end of the qubits. (The flag is only needed at the left or right end of a string of qubits.) When the flag is , the n qubit sites are lined up inside a single block; for all other values of the flag, the (qubits) string crosses a block boundary. ··· · · · · · · · · · where the The initial configuration is and the qubits are in the state corresponding to the input of the original circuit C x . Following the transition rules below, the sweeps to the right, performing gates as it goes. When it reaches the end of the qubit states at the border of the next block, it becomes a , which in turn creates a flag which sweeps left, moving each qubit one space to the right in the process. When the flag reaches the left end, it stops by turning into a which then creates a flag, which moves right through the qubits without disturbing them. The flag hits the right end of the set of qubits and becomes a , which begins a flag moving left again. The - - - cycle continues until the qubits have all been moved past the next block boundary. Then we get a arrangement, which spawns a new , beginning the gate cycle again. The evolution stops when the qubits reach the last block boundary and the gate flag reaches the end of the line, i.e., the final configuration ··· is · · · · · · · · · . We have the following transition rules. Something of the form XY is never across a block boundary, whereas X Y is. Y and X represent the left and right end of the chain, respectively. → (performing the appropriate gate between the two encoded 1. (Gate rule) qubits) 2. (Turning rules right side) → , → , → , → 3. (Sweeping left rules) → , → 4. (Turning rules left side) → , → , → , → → , → , → 5. (Sweeping right rules) 6. (Starting new round rule) → We can see by inspection that these rules create the cycle described above; Fig. 1 follows an example with n = 3 step-by-step through a full cycle. A single cycle takes n(2n + 3) moves, so the full computation from the initial configuration to the final one takes a total of K = n(2n + 3)(R − 1) + n − 1 steps. (The additional n − 1 steps are for the gate flag to move through the final block.) The only tricky part is to note the following fact: Fact 1. For any configuration containing only one active site, there is at most one transition rule that applies to move forward one time step and at most one transition rule to move backwards in time by one step. For valid configurations, there is always exactly one forwards transition and exactly one backwards transition, except for the final and initial states, which have no future and no past, respectively. Proof. We can see this by noting that the transition rules only refer to the type of active site present and to the state of the site to the right (for , , and ) or left (for ) of the active site (or left and right respectively for backwards transitions). For a configuration
The Power of Quantum Systems on a Line
53
Fig. 1. A full cycle, with n = 3. Time goes down the first and then the second column
with only one active site, there is therefore at most one transition rule that applies. We can also see that for every legal configuration, there is indeed a transition rule that applies; the few cases that may appear to be missing cannot arise because of the constraints on alignment of the string of qubits with the blocks.
The illegal cases without forward transitions are cases without backwards transitions are , , play an important role in Sect. 4.
,
, , and
, and , and the illegal . These arrangements will
Remark. For adiabatic computation, we can simplify this construction a bit. For the proof of QMA-completeness, we will need to distinguish the particles to the left of the active site from the particles to its right, but this is not necessary for universal adiabatic computation. Therefore, we may combine the and states into a single qubit subspace , and we may combine and into a single state . That leaves us with essentially the same construction, but with only 9 states per particle instead of 12. 3. Universality of Adiabatic Evolution in One Dimension We first recall the definition of adiabatic computation [FGGS00,FGG+ 01]. A quantum system slowly evolves from an easy to prepare ground state of some initial Hamiltonian H0 to the ground state of a tailored final Hamiltonian H1 , which encodes the problem. The state evolves according to Schrödinger’s equation with a time-varying Hamiltonian H (s) = (1 − s)H0 + s H1 , with s = t/T , where t is the time and T is the total duration of the adiabatic computation. Measuring the final ground state in the standard basis gives the solution of the problem. The adiabatic theorem tells us that if T is chosen to be large enough, the final state will be close to the ground state of H1 . More specifically, we can define instantaneous Hamiltonians H (t/T ), and let gmin be the minimum of the spectral gaps over all the Hamiltonians H (t/T ). T is required to be polynomial in 1/gmin . To prove Theorem 1, given a general quantum circuit, we would like to design an efficient simulation of this circuit by adiabatic evolution on a one-dimensional line. The construction in Sect. 2 associates to any circuit C x with n qubits a modified circuit C˜ x using n R9-state particles in one dimension (with some states merged according to the remark in the end of Sect. 2), together with transition rules which evolve the system for
54
D. Aharonov, D. Gottesman, S. Irani, J. Kempe
K = n(2n + 3)R + n − 1 steps through K + 1 configurations from initial to final. We denote the quantum state of the t th configuration by |γ (t) for t = 0, . . . , K . Observe that the |γ (t) are orthogonal to each other, since each has a different configuration. We note that the last state |γ (K ) contains the final state of the original circuit, encoded in the last block of particles. Next we construct a one-dimensional adiabatic evolution whose final Hamiltonian has as its ground state the history state of this evolution, namely, √
1 K +1
K
|γ (t).
t=0
To define H1 ≡ Hprop , we simply translate the transition rules of the previous section to 9-state 2-local Hamiltonians. In other words, any transition rule which takes a state |α to |β is translated to a Hamiltonian of the form 21 (|α α| + |β β| − |α β| − |β α|). E.g., the first rule becomes 21 (| | + U | |U † − U | | − | |U † ), summed over a basis of states for the encoded qubits and over all nearest neighbor pairs of particles (recall we have combined and ). Here U is the gate corresponding to this location and acts on the two qubits encoded as | . Restricted to the eight-dimensional subspace spanned by | and | (each for values of |00, |01, |10, and |11 for the two qubits) for a single pair of particles, that would give the matrix 1 I −U , 2 −U † I with I the 4 × 4 identity matrix. Our initial Hamiltonian has the initial configuration |γ (0) as its ground state. To define H0 , we penalize all configurations that do not have in its |0 state (| (0)) in the first position: H0 = I − | (0) (0)|1 This Hamiltonian of course has a highly degenerate ground state, but the important point is that |γ (0) is the only state which satisfies H0 in the invariant subspace spanned by the |γ (t). We assume we are able to select the correct ground state |γ (0) to be the actual initial state of the adiabatic computation. We could avoid the need for this by various methods, for instance by having an additional phase of adiabatic evolution from a simple non-degenerate Hamiltonian to H0 . Another option is to break the degeneracy of the ground state of H1 by using the full 12-state construction with the Hamiltonian described in Sect. 4. Even then, we either need to modify H0 to be non-degenerate (this approach requires a new analysis of the spectral gap, which we have not done), or to add an additional 13th start state. We outline the latter approach in Sect. 4.1. To analyze the spectral gap of any Hamiltonian in the convex combination of H0 and H1 , we essentially follow the proof of [AvDK+ 04], using an improvement due to [DRS07]. We first observe that Claim. The subspace K0 spanned by the states |γ (t) is invariant under any of the Hamiltonians H (s). This is easily seen to be true by the fact that it is invariant under the initial and final Hamiltonians. From this claim, it follows that throughout the evolution we are inside
The Power of Quantum Systems on a Line
55
K0 , so we only need to analyze the spectral gap in this subspace. We next move to the basis of K0 spanned by the |γ (t) states. In this basis H0 restricted to K0 looks like ⎛ ⎞ 0 0 ... 0 ⎜0 1 ... 0⎟ ⎟ H0 |K0 = ⎜ ⎝ ... ... . . . ... ⎠ , 0 0 ... 1
and H1 restricted to K0 becomes ⎛ 1 2 ⎜ 1 ⎜− ⎜ 2
⎜ ⎜ ⎜ H1 |K0 = ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎝
− 21
1 − 21
0 − 21 .. . .. . 0
0
··· . 0 ..
1 − 21 .. .. . .
0 .. .
0 − 21 1 0 − 21 ··· 0
⎞ 0 .. ⎟ .⎟ ⎟ .. ⎟ .. . .⎟ ⎟ ⎟. .. ⎟ . ⎟ ⎟ 1 −2 0⎟ ⎟ 1 − 21 ⎠ 1 − 21 2
It can easily be seen that the history state (which in this basis is simply the all ones vector) is a zero eigenstate of this Hamiltonian. Finally we need to analyze the spectral gaps of all convex combinations of these two. This has been done in Sect. 3.1.2 of [AvDK+ 04] and simplified with improved constants in [DRS07]; we refer the reader there for the details. The result is that the spectral gap is at least 1/[2(K + 1)2 ], an inverse polynomial in n and R, which itself is an inverse polynomial in the number of gates in the original circuit. This proves Theorem 1. 4. 1D QMA The propagation Hamiltonian Hprop introduced in Sect. 3 is insufficient for QMA-completeness. Now we have a circuit C x which checks the witness for a QMA problem, taking as input the witness and some ancilla qubits in the state |0. However, any correct history state for the circuit C x will have zero eigenvalue for Hprop , even if the t = 0 component of the history state is not correctly initialized, or if C x does not accept the witness. Even worse, Hprop also has zero eigenvalue for any other state which is a uniform superposition of states connected by the transition rules, even if the superposition includes illegal configurations. To solve these problems, we will introduce three new terms to the overall Hamiltonian H: H = Hprop + Hinit + Hfinal + Hpenalty . The initialization term Hinit will constrain the initial state of the modified checking circuit C˜ x so that all ancilla qubits are initialized to |0, and the final Hamiltonian Hfinal verifies that the checking circuit does accept the witness as input. Hpenalty will penalize illegal configurations using local constraints. As mentioned in the Introduction, not all illegal configurations can be penalized directly. Instead, some of them will only be penalized because they evolve into a locally checkable illegal configuration.
56
D. Aharonov, D. Gottesman, S. Irani, J. Kempe
To create the initialization term, we will assume without loss of generality that all the gates performed in the first block are the identity. We will use the gate flag to check that qubits are correctly initialized instead of using it to do gates in the first block. Then we get the following Hamiltonian term: | (1) (1)|i . Hinit = i
The sum is taken over ancilla qubits i in their starting positions in the first block of n sites. (The remaining qubits in the first block of n sites are used to encode the potential witness.) Hinit creates an energy penalty for any ancilla to be in the state |1 when the gate flag passes over it. Since the gate flag sweeps through the whole block, this ensures that the ancilla qubits must be correctly initialized to |0 or the state suffers an energy penalty. Similarly, for the final Hamiltonian, we assume no gates are performed in the final block, and use to check that the circuit accepts the output. That is, we get the following term in the Hamiltonian: Hfinal = | (0) (0)|out . This causes an energy penalty if the output qubit “out” is in the state |0 when the gate flag sweeps over it. In general, a correct history state for some potential input witness state will have, for the final block, a superposition of terms with the output qubit in the state |0 and terms with the output qubit in the state |1, and the energy penalty is thus proportional to the probability that the circuit rejects the potential witness. Now we move to Hpenalty , which is a bit more involved. We will describe a set of local penalties that will enforce that each illegal configuration will be penalized either directly or because it will evolve into a configuration that will be penalized. We forbid the following arrangements: 1. X, X (X is anything but ), X , X (X is anything but ). 2. In the first block on the left: , . In the last block on the right: , . 3. X, X (X is anything but or ), X , X (X is anything but or ). 4. , , , , , . 5. , . 6. Any adjacent pair of active sites (e.g., or ), with or without block boundaries. 7. , , , , , , , (but the first two are OK with a block boundary and the next four are OK without a block boundary). Note that the arrangements forbidden in group 7 are precisely those missing a forward or backwards transition rule in the note following Fact 1. We encode these rules into a penalty Hamiltonian in the straightforward way: Hpenalty = |X Y X Y |i,i+1 , XY
where the sum is taken over the forbidden arrangements XY listed above for all adjacent pairs of sites (tailored appropriately to the location of block boundaries and the first and last blocks). Claim. A configuration that satisfies the rules in groups 1 through 6 is of one of the legal forms described in Sect. 2, or it is in one of three cases: (i) a (qubits) string of the
The Power of Quantum Systems on a Line
57
· · · (such a configuration is allowed in Sect. 2 only when is all the form · · · way on one end of the (qubits) string), (ii) a (qubits) string that has incorrect length: different from n when the active site is or or different from n + 1 when the active site is or , or (iii) a (qubits) string of length n, but with either an active site and the (qubits) string aligned with a block boundary, or an active site and the (qubits) string not aligned with a block boundary. Note that we do not need the rules in group 7 for this claim; they are used later to deal with the illegal states that cannot be checked locally. Proof. The rules in group 1 enforce that the configuration is of the form · · · (qubits) · · · by ensuring that all unborn ( ) states are at the far right and all dead ( ) states are at the far left. Group 2 ensures that the particles are not all or all (and in fact ensures that there is at least one block of n composed of something else). Group 3 ensures that within the (qubits) string, any qubits are on the right end and any qubits are on the left end. Groups 2 and 4 guarantee that the (qubits) string is not empty and does not consist of only or qubits. Group 5 then checks that the (qubits) string does not directly jump from to , so there is at least one active site in between, and the rules in group 6 ensure that there cannot be more than one adjacent active site. Since, by groups 1 and 3, an active site can only occur to the right of all and sites and to the left of all and sites, all active sites are together in a group, so the rules in groups 5 and 6 ensure that there is exactly one active site. Comparing with Definition 4, we see that this leaves only the exceptions listed in the claim.
The three exceptions in the above claim cannot be ruled out directly via a local check, since counting cannot be done using local constraints. 4 We can only rule out the exceptions by considering both the penalty Hamiltonian Hpenalty and the propagation Hamiltonian Hprop . In order to do so, we first break down the full Hilbert space into subspaces which are invariant under both Hpenalty and Hprop . Let us consider the minimal sets of configurations such that the sets are invariant under the action of the transition rules. This defines a partition of the set of configurations. Given such a minimal set S, we consider the subspace K S spanned by all the configurations in S. The penalty Hamiltonian is diagonal in the basis of configurations, so K S is invariant under Hpenalty , and the set S is closed under the action of Hprop , so K S is invariant under Hprop as well. The space K S belongs to one of three types: 1. All states in S are legal. (We call this subspace K0 .) 2. All states in S are illegal, but are all locally detectable, namely, none of them belong to the exceptions of Claim 4. 3. All states in S are illegal, but at least one of them is not locally detectable. Note that the set S cannot contain both legal and illegal configurations, since legal configurations do not evolve to illegal ones, and vice-versa. We want to show that subspaces of type 2 or 3 have large energy. The main challenge will be to give a lower bound on the energy of a space K S of type 3, which we will do by lower bounding the fraction of configurations in S that violate one of the conditions 1-7 above. We want to prove: 4 If we are willing to add a 13th state, we could split the state into two states, one to turn around on the · · · with local rules. However, left and one to turn around on the right. Then we could rule out · · · this strategy will not work for strings with the wrong number of qubit states.
58
D. Aharonov, D. Gottesman, S. Irani, J. Kempe
Lemma 1 (Clairvoyance lemma). The minimum eigenvalue of Hprop +Hpenalty , restricted to any K S of type 2 or 3, is (1/K 3 ), where K is the number of steps in C˜ x . Proof. To prove the theorem, we deal separately with each type of invariant subspace. Type 2 is straightforward: the full subspace K S has energy of at least 1, due to Hpenalty . We now focus on type 3. We observe several properties of type 3 subspaces. First, notice that the number of qubit states ( , , , and ) and the number of active sites ( , , , and ) are conserved under all transition rules. Since S is a minimal set preserved by the transition rules, all the configurations in S therefore contain the same number of qubit states. Since S is of type 3, it must contain an undetectable illegal configuration, such as a (qubits) string of the wrong length, and by Claim 4 has exactly one active site somewhere in the string. By Fact 1, there is at most one forwards transition rule and one backwards transition rule that applies to each configuration in S. Note also that configurations with one active site which is or always have both a forward and backwards transition rule available. Therefore, if S is of type 3 it must contain at least one configuration with a or active site. Going further, we claim that a fraction of at least (1/n 2 R) of the configurations in S violate one of the rules in groups 1 through 7 above. To see this, we divide into three cases: · · · : In this – S contains a configuration with a qubit string of the form · · · case, the forward transition rule that applies to the illegal configuration is either → or → . This gives us a configuration which can be locally seen as · · · . This violates group 1, as sites should be to the illegal, such as · · · left of all other kinds of sites. Therefore S contains at least 1/2 locally checkable illegal configurations. In fact, it is a much larger fraction, as all the backwards transition rules and further forward transition rules will also produce locally checkable illegal states. – S contains a configuration with a active site: Via forward transitions, the will move to the right until it hits either the right end of the (qubits) string or until it hits a block boundary. If it does not encounter both together, it has reached one of the illegal configurations forbidden in group 7. Via backwards transitions, the moves to the left until it hits either the left end of the (qubits) string or until it hits a block boundary. Again, if it does not encounter both together, we must now be in one of the configurations forbidden in group 7. If the right and left ends of the (qubits) string are both lined up with block boundaries, and there are no other block boundaries in between, then the (qubits) string contains exactly n sites and is correctly aligned with the block boundary. Therefore it is actually a legal state, which cannot occur in S of type 3. Thus, we must have one of the locally checkable illegal states, and it must occur after at most n transitions (in either direction). The configurations themselves, however, could be part of a larger cycle with transitions involving , , and active sites. However, the length of the (qubits) string is at most n R, and we can have at most n - - - cycles before getting a , so the locally checkable illegal states comprise a fraction at least (1/n 2 R) of all the states in S. – S contains no configuration with a active site: S still must contain configurations with . These configurations can form part of a normal cycle, but the normal cycle eventually leads to a transition to a configuration. For forward transitions, this occurs when the left end of the (qubits) string is aligned with a block boundary, and for backwards transitions, it occurs when the right end of the (qubits) string is aligned with a block boundary. The only way to avoid this happening is for S to
The Power of Quantum Systems on a Line
59
have a configuration with no forward transition and another with no backwards transition. Since the only such configurations contain one of the arrangements , , , or , all of which are forbidden by the rules in group 7, S must contain a locally checkable illegal configuration. Again, the length of the (qubits) string is at most n R, and we can have at most n - - - cycles in a row, so the locally checkable illegal states comprise a fraction at least (1/n 2 R) of all the states in S. We can now invoke Lemma 14.4 from [KSV02] to lower bound the energy of the overall Hamiltonian for a type 3 subspace: Lemma 2. Let A1 , A2 be nonnegative operators, and L 1 , L 2 their null subspaces, where L 1 ∩ L 2 = {0}. Suppose further that no nonzero eigenvalue of A1 or A2 is smaller than v. Then A1 + A2 ≥ v · 2 sin2 θ/2, where θ = θ (L 1 , L 2 ) is the angle between L 1 and L 2 . In our case, A1 is the propagation Hamiltonian Hprop , and its null subspace, restricted to K S , consists of equal superpositions over all configurations in the invariant subspace S. (There are multiple such states, with different values of the encoded qubit states.) A2 is the penalty Hamiltonian Hpenalty , diagonal in the basis of configurations. Then sin2 θ is the projection (squared) of the superposition of all shapes on the subspace of locally checkable illegal configurations; that is, it is the fraction of locally checkable illegal configurations in the invariant set. The minimum nonzero eigenvalue of Hpenalty is 1, but (as in [KSV02]) the minimum nonzero eigenvalue of Hprop is (1/K 2 ), where K = n(2n + 3)(R − 1) + n − 1 is the number of steps in C˜ x . Thus, if S is a set containing a configuration which is illegal but cannot be locally checked, all states in K S have an energy at least (1/K 3 ). We can now prove Theorem 2. We start by assuming the circuit C x accepts correct witnesses and rejects incorrect witnesses with a probability exponentially close to 1. This can be achieved, for instance, by checking multiple copies of the witness. Then we will show that if there exists a witness which is accepted by C x with probability at least 1 − O(1/K 3 ), then there is a state with energy at most O(1/K 4 ), whereas if all possible witnesses are only accepted by C x with probability at most 1/K 3 , then all states have energy at least (1/K 3 ). We already know that on subspaces of type 2 and 3, the minimum eigenvalue of Hprop + Hpenalty is (1/K 3 ). We therefore restrict attention to the subspace K0 of type 1, built from only legal configurations, and can hence ignore Hpenalty . From this point on, the proof follows [KSV02], but we include it for completeness. The type 1 space K0 contains only valid history states. However, some have incorrect ancilla inputs and are penalized by Hinit , while others include an incorrect witness input, and are penalized by Hfinal . Only history states corresponding to a correct witness have low energy. If there exists a witness which is accepted by C x with probability at least 1 − 1/K 3 , 1 then the history state | = √ t |φt for that witness will have small enough K +1 energy:
|Hprop + Hpenalty + Hinit | = 0,
60
D. Aharonov, D. Gottesman, S. Irani, J. Kempe
so we only need to calculate |Hfinal |. The only term in | that contributes √ is the one with on the output qubit in the last block, which has a coefficient 1/ K + 1. Therefore, the energy due to Hfinal is 1/(K + 1) times the probability that the witness is rejected by C x . That is, it is O(1/K 4 ). Now let us consider what happens for a “no” instance. The following lemma will complete the proof of Theorem 2: Lemma 3. If there is no witness that causes the circuit to accept with probability larger than 1/K 3 , then every state in K0 has energy at least (1/K 3 ). Proof. We will invoke Lemma 2 once more, with A1 = Hprop , and A2 = Hinit + Hfinal . From now on, all the operators we discuss will be restricted to K0 . The null subspace of the propagation Hamiltonian Hprop contains states which correspond to a history ˜ |ψ = √ 1 t |φt of the circuit C x for some input state |φ0 , not necessarily correct. K +1 Fix such a history state |ψ. We will upper bound its projection squared on the null space of A2 . Let us first study the structure of this null space. The null space of Hinit is spanned by states for which either the is not on an ancilla qubit in the first block or the is on an ancilla qubit, but the ancilla qubit is a |0. Let init be the projection on the null space of Hinit . The null space of Hfinal contains states for which either the is not on the output qubit in the last block or the is on the output qubit and the output qubit is a |1. Let final be the projection on the null space of Hfinal . The two projectors commute, so the projector onto the null subspace of Hinit + Hfinal is init final . We would thus like to upper bound
ψ| init final |ψ. To this end, we expand the input state |φ0 for |ψ into |φ0 = α|φ0v + β|φ0i , where |φ0v is a state with all valid ancilla input qubits and |φ0i is an orthogonal state consisting of a superposition of states with one or more invalid ancilla input qubits. Note that |ψ = α|ψ v + β|ψ i , where |ψ v is the history state for input |φ0v and |ψ i is the history state for input |φ0i . We have:
ψ| init final |ψ = |α|2 ψ v | init final |ψ v + |β|2 ψ i | init final |ψ i +2Re α ∗ β ψ v | init final |ψ i , where we have used the fact that the two projectors commute, so init final is Hermitian. We now bound each of the three terms. For the first term, note that ψ v | init = ψ v |. We might as well assume the output qubit is the very last qubit, so the reaches it only at t = K , and we have that
ψ v | final |ψ v =
1 K+p v v K + φ K , | final |φ K = K +1 K +1
where p is the probability that the circuit C x accepts |φ0v . We thus find that the first term is at most |α|2 (K + O(1/K 3 ))/(K + 1). For the second term, it suffices to upper bound ψ i | init |ψ i since
ψ i | init |ψ i = init |ψ i 2 ≥ final init |ψ i 2 = ψ i | init final |ψ i ,
The Power of Quantum Systems on a Line
61
again using the fact that the two projectors commute. Since the computation C˜ x begins by sweeping a through the first n sites, and thereafter never has within the first n sites, only the first n states |φt can possibly be outside the null space of Hinit . Also, note that φt | init |φt = 0 unless t = t . We can thus write n−1 1 i i i i
ψ | init |ψ =
φt | init |φt . (K + 1 − n) + K +1 t=0
We have φt | init |φt = 0 if the t th qubit of the input is an ancilla qubit and is in the state |1, and φt | init |φt = 1 otherwise. Since the |φti states are superpositions of terms with at least one incorrect ancilla input qubit, we have
ψ i | init |ψ i ≤ K /(K + 1). For the third term, we have |Re α ∗ β ψ v | init final |ψ i | ≤ | ψ v | init final |ψ i | = | ψ v | final |ψ i |. Note, however, that φtv |φti = 0, since |φt is related to |φ0 by a unitary transformation and φ0v |φ0i = 0. This gives us 1 | φ v | final |φ iK | K +1 K 1 v ≤ final |φ K K +1 = O(K −5/2 ).
| ψ v | final |ψ i | =
The above expression might not be 0 since both |ψ v and |ψ i might have a non-zero component which is accepted by the circuit, but since |φ v is only accepted rarely (with probability O(1/K 3 )), it cannot be too large. Summing up all contributions, we have:
ψ| init final |ψ ≤ |α|2 =
K + O(1/K 3 ) K + |β 2 | + O(K −5/2 ) K +1 K +1
K + O(K −5/2 ). K +1
From this we can conclude that sin2 (θ ) is at least (1/K ), where θ is the angle between the null spaces of Hprop and Hinit + Hfinal . Lemma 2 then tells us that every state has energy (1/K 3 ). 4.1. Non-degenerate universal adiabatic hamiltonian. If we wish to create a universal adiabatic quantum computer with a non-degenerate ground state, the Hamiltonians from Sect. 3 do not suffice. In fact, even if we used a 12-state construction with the final Hamiltonian H1 equal to H from the QMA-completeness construction above, then H1 would be non-degenerate, but the initial Hamiltonian H0 in Sect. 3 still is not. We sketch
62
D. Aharonov, D. Gottesman, S. Irani, J. Kempe
here a construction that adds an additional 13th state to make sure that the Hamiltonian remains non-degenerate throughout the adiabatic evolution. The new state is a start state , which serves as the state for the input qubits in the initial configuration. We will add a set of terms to H0 and H1 (which also includes Hinit , Hfinal , and Hpenalty , in addition to Hprop ). These terms will guarantee that the unique ··· · · · · · · · · · . Furthermore, H0 will have the propground state of H0 is erty that H0 |γ (t) = 1 for any t > 0, which allows us to use the calculation of the gap given in Sect. 3. To do this, we add a term that enforces the condition that if the first particle is in state , then the second particle is in state . This is accomplished by forbidding any configuration that has in the first location and any state except in the second. For example, to forbid states in particles 1 and 2, we add the term | |12 . Similarly, for i = 2, . . . , n − 1, we enforce that if particle i is in state then particle i + 1 must be in state as well. Then we add a term that says if particle n is in state then particle n + 1 is in state . For i > n, add terms that enforce that if particle i is in state , then so is particle i + 1. Similar terms should also be added to H1 to assure that its ground state remains non-degenerate when the new start state is added. Finally, we need to slightly alter the transition rules used to build Hprop . For i = 1, . . . , n − 1, replace the rule → in locations i and i + 1 with → (0). With this change, Fact 1 still holds, with the small caveat that valid configurations now must have any qubits in the first block set to |0. Note that none of the configurations in the subspace spanned by the |γ (t) violate any of the extra conditions. Furthermore, the additional terms guarantee the uniqueness of the ground state of H0 given above. In order to establish the non-degeneracy of any of the Hamiltonians H (s), we need to prove that there are no low energy states outside of the subspace spanned by the |γ (t), which follows from the Clairvoyance lemma and a simplified version of Lemma 3. 5. Discussion and Open Problems We have shown that 1-dim 12-state Hamiltonians can be used for both universal adiabatic quantum computation and to produce very difficult, QMA-complete problems. A similar result holds also for a related quantum complexity class, called QCMA, which is the subclass of QMA where the witnesses are restricted to be classical. To see this, observe first that our reduction from an arbitrary QMA language to the 1-DIM 12-STATE HAMILTONIAN problem is witness-preserving, at least once the acceptance probability has been amplified. Given a witness for the original QMA language, we can, in fact, efficiently construct on a quantum computer a witness for the corresponding instance of 1-DIM 12-STATE HAMILTONIAN using the adiabatic algorithm. This implies that if the witness for the original problem is efficiently constructible (which means we may as well assume it is a classical bit string describing the circuit used to construct the quantum witness), then the witness for 1-DIM 12-STATE HAMILTONIAN is also efficiently constructible. Thus, we have also shown that the sub-language of 1-DIM 12-STATE HAMILTONIAN which has the additional promise of an efficiently-constructible ground state is complete for QCMA. There remain many interesting related open problems. Clearly, it is interesting to ask whether the size of the individual particles in the line can be further decreased, perhaps as far as qubits. We could, of course, interpret our 12-state particles as sets of 4 qubits, in which case our Hamiltonian becomes 8-local, with the sets of 8 interacting qubits arranged consecutively on a line. The perturbation-theory gadgets used to convert 8-local interactions to 2-local ones do not work in a one-dimensional system: The pairs
The Power of Quantum Systems on a Line
63
of interacting qubits form a graph, which needs to have degree at least 3 (or 4 for some of the gadgets used by [OT05]). If we do apply the approach of [OT05], however, to the system described here, we get a 2-dim Hamiltonian on a strip of qubits of constant width. The constant is rather large, but this still constitutes an improvement over the result of [OT05]. Another approach to decreasing the dimensionality of the individual particles is to find a new protocol for removing the explicit reference to time from the circuit C x . It seems likely that some further improvement is possible in this regard, but it is unlikely that an improved protocol by itself can take us all the way to qubits, as we need additional states to provide the control instructions. If it is possible to have universal adiabatic quantum computation and QMA-completeness with 1-dim 2-state Hamiltonians, we will probably need new techniques to prove it. It may also be that there is a transition at some intermediate number of states between 2 and 12 for which universality and QMAcompleteness become possible. This would be analogous to the classical 2-dimensional Ising spin problem without magnetic field, which is in P for a single plane of bits, but is NP-complete when we have two layers of bits [Bar82]. Another interesting line of open questions is to investigate the energy gap. There are two energy gaps of relevance, both interesting. One is the “promise gap” ∆ in the definition of QMA. We have shown that we have QMA-completeness when ∆ is polynomially small relative to the energy per term. This can easily be improved to a constant value of ∆ by amplification: t copies of the ground state will either have energy less than t E or above t (E + ∆), amplifying the promise gap to t∆. A more interesting question is whether ∆ can be made a constant fraction of the total energy available in the problem, the largest eigenvalue of H ; if so, that would constitute a quantum version of the PCP theorem. Hastings and Terhal [HT] have argued that it is not possible to do this in any constant number of dimensions unless QMA = P: To approximate the ground state energy, we can divide the system into blocks of a constant size, and diagonalize the Hamiltonian within each block. We can then consider the tensor product of the ground states for each separate block; since such a state ignores the energy due to Hamiltonian terms interacting different blocks, it will not be the true ground state, but its energy can differ from the ground state energy by at most the surface area of each block times the number of blocks (normalizing the maximum energy per term to be 1), whereas the maximum eigenvalue of H is roughly proportional to the volume of each block times the number of blocks. Thus, the tensor product state approximates the ground state energy up to a constant fraction of the total energy, and the fraction can be made arbitrarily small by increasing the size of each block. This gives a polynomial-time classical algorithm for approximating the ground state energy to this accuracy. When the interactions in H are not constrained by dimensionality, the argument breaks down, so this quantum version of PCP remains an interesting open problem for general r -state k-local Hamiltonians. We can also look at the spectral gap, the gap between the ground state and the first excited state of H . For adiabatic computation, we are interested in the minimal spectral gap over the course of the computation. We have shown that universal adiabatic quantum computation is possible if the spectral gap is polynomially small relative to the energy per term. What happens if it is bounded below by a constant? Hastings has recently shown [Has] that it is possible to efficiently classically simulate the adiabatic evolution of a 1-dim r -state Hamiltonian system with constant spectral gap. We should therefore not expect to be able to perform universal adiabatic quantum computation with such Hamiltonians, as that would imply BQP = P. Hastings’ argument builds on his earlier paper [Has07], which showed that the ground state of a gapped 1-dim r -state Hamiltonian
64
D. Aharonov, D. Gottesman, S. Irani, J. Kempe
has an efficient classical description as a matrix product state. By repeatedly updating the matrix product state description, one can then keep track of the adiabatic evolution with resources polynomial in the path length in parameter space and the inverse error of the approximation. For d-dim r -state Hamiltonians with constant spectral gap and d ≥ 2, the question remains open in general, although Osborne has proven [Osb06] that such systems can be efficiently classically simulated for logarithmic time. For the QMA-completeness problem, we know very little about the possible values of the spectral gap. If the spectral gap is constant relative to the energy per term (or even (1/ ln ln n R)), the ground state has a matrix product state representation [Has07] and the problem is in NP. In our construction, there are enough low-energy states that the spectral gap cannot be much larger than the promise gap ∆, but it might be much smaller. In the “no” instances, there are likely very many states which violate only a small number of transition rules, penalty terms, or initial conditions, and these have energy just above E + ∆, so likely the spectral gap is exponentially small in the “no” instances. We know less about the size of spectral gap in the “yes” instances. States which do not correspond to valid histories have an energy at least ∆ larger than the ground state, but unfortunately, there may be different valid histories with energies less than E + ∆ but above the ground state energy. The difficulty is that the original problem might have many potential witnesses. Some may be good witnesses, accepted with high probability, whereas others may be mediocre witnesses, accepted with a probability near 1/2. There could, in fact, be a full spectrum of witnesses with only exponentially small gaps between their acceptance probabilities. In order to show that the “yes” instances can be taken to have a spectral gap which is at least inverse polynomial in the system size, we would need a quantum version of the Valiant-Vazirani theorem [VV86], which would say that we can always modify a QMA problem to have a unique witness accepted with high probability. Acknowledgement. This work was partly done while three of the authors (D. A., D. G., and J. K.) were visiting the Institute Henri Poincaré in Paris, and we want to thank the IHP for its hospitality. We wish to thank Daniel Fisher, Matt Hastings, Lev Ioffe, Tobias Osborne, Oded Regev, and Barbara Terhal for helpful discussions and comments and Oded for help with the design of the state icons.
References [ACdf88] [ACdf90] [AGIK07]
[AGK07] [AvDK+ 04] [Bar82] [BY86] [CFP02]
Apolloni, B., Carvalho, C., de Falco, D.: Quantum stochastic optimization. Stochastic Processes and Their Applications 33(5), 233–244 (1988) Apolloni, B., Cesa-Bianchi, N., de Falco, D.: A numerical implementation of “quantum annealing”. In: Stochastic Processes, Physics and Geometry: Proceedings of the Ascona-Locarno Conference. River Edge, NJ: World Scientific. 1990, pp. 97–111 Aharonov, D., Gottesman, D., Irani, S., Kempe, J.: The power of quantum systems on a line. In: FOCS. Proc. 48th Ann. IEEE, Symp on Foundations of Computer Science, Los Alamitos, CA: IEEE Comp. Soc., 2007, pp. 373–383 Aharonov, D., Gottesman, D., Kempe, J.: The power of quantum systems on a line. http://arXiv. org/abs/0705.4077v2 [quant-ph], 2007 Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. In: Proc. 45th FOCS, Los Alamitos, CA: IEEE Comp. Soc., 2004, pp. 42–51 Barahona, F.: On the computational complexity of ising spin glass models. J. Phys. A: Math. Gen. 15, 3241–3253 (1982) Binder, K., Young, A.P.: Spin glasses: experimental facts, theoretical concepts, and open questions. Rev. Mod. Phys. 58, 801–976 (1986) Childs, A., Farhi, E., Preskill, J.: Robustness of adiabatic quantum computation. Phys. Rev. A 65, 012322 (2002)
The Power of Quantum Systems on a Line
[DRS07] [Fey85] [FGG+ 01] [FGGS00] [Fis95] [Has] [Has07] [HT] [Ira07] [JFS06] [JWZ07] [Kay08] [KKR06] [KSV02] [Nag08] [NW08] [Osb06] [Osb07] [OT05] [Sch05] [SFW06] [Suz76] [vEB90] [VV86] [Wat95] [Whi92] [Whi93]
65
Deift, P., Ruskai, M.B., Spitzer, W.: Improved gap estimates for simulating quantum circuits by adiabatic evolution. Quant Infor. Proc. 6(2), 121–125 (2007) Feynman, R.: Quantum mechanical computers. Optics News 11, 11–21 (1985) Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., Preda, D.: A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292(5516), 472–476 (2001) Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution. http://arXiv.org/list/quant-ph/0001106, 2000 Fisher, D.S.: Critical behavior of random transverse-field ising spin chains. Phys. Rev. B 51(10), 6411–6461 (1995) Hastings, M.: Personal communication Hastings, M.: An area law for one dimensional quantum systems. JSTAT. P08024 (2007) Hastings, M., Terhal, B.: Personal communication Irani, S.: The complexity of quantum systems on a one-dimensional chain. http://arXiv.org/abs/ 0705.4067v2[quant-ph], 2007 Jordan, S.P., Farhi, E., Shor, P.W.: Error-correcting codes for adiabatic quantum computation. Phys. Rev. A 74, 052322 (2006) Janzing, D., Wocjan, P., Zhang, S.: A single-shot measurement of the energy of product states in a translation invariant spin chain can replace any quantum computation. http://arXiv.org/ abs/0710.1615v2[quant-ph], 2007 Kay, A.: The computational power of symmetric hamiltonians. Phys. Rev. A. 78, 012346 (2008) Kempe, J., Kitaev, A., Regev, O.: The complexity of the local hamiltonian problem. SIAM J. Comp. 35(5), 1070–1097 (2006) Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation. Providence, RI: Amer. Math. Soc., 2002 Nagaj, D.: Local Hamiltonians in Quantum Computation. PhD thesis, MIT. http://arXiv.org/ abs/0808.2117v1[quant-ph], 2008 Nagaj, D., Wocjan, P.: Hamiltonian quantum cellular automata in 1d. Phys. Rev. A 78, 032311 (2008) Osborne, T.: Efficient approximation of the dynamics of one-dimensional quantum spin systems. Phys. Rev. Lett. 97, 157202 (2006) Osborne, T.: Ground state of a class of noncritical one-dimensional quantum spin systems can be approximated efficiently. Phys. Rev. A 75, 042306 (2007) Oliveira, R., Terhal, B.: The complexity of quantum spin systems on a two-dimensional square lattice. Quant. Inf. Comp. 8(10), 0900–0924 (2008) Schollwöck, U.: The density-matrix renormalization group. Rev. Mod. Phys. 77, 259– 316 (2005) Shepherd, D.J., Franz, T., Werner, R.F.: Universally programmable quantum cellular automaton. Phys. Rev. Lett. 97, 020502 (2006) Suzuki, M.: Relationship between d-dimensional quantal spin systems and (d+1)-dimensional ising systems. Prog. Theor. Phys. 56(5), 1454–1469 (1976) van Emde Boas, P.: Handbook of Theoretical Computer Science. volume A, Chapter 1. Cambridge, MA: MIT Press, 1990, pp. 1–66 Valiant, L.G., Vazirani, V.V.: Np is as easy as detecting unique solutions. Theor. Comput. Sci. 47(3), 85–93 (1986) Watrous, J.: On one-dimensional quantum cellular automata. In: Proc. 36th Annual IEEE Symp. on Foundations of Computer Science (FOCS), Los Alamitos, CA: IEEE Comp. Sci, 1995, pp. 528–537 White, S.R.: Density matrix formulation for quantum renormalization groups. Phys. Rev. Lett. 69, 2863 (1992) White, S.R.: Density-matrix algorithms for quantum renormalization groups. Phys. Rev. B 48, 10345 (1993)
Communicated by M. B. Ruskai
Commun. Math. Phys. 287, 67–98 (2009) Digital Object Identifier (DOI) 10.1007/s00220-008-0662-7
Communications in
Mathematical Physics
Thermal Conductivity for a Momentum Conservative Model Giada Basile1 , Cédric Bernardin2 , Stefano Olla3 1 WIAS, Mohrenstr. 39, 10117, Berlin, Germany. E-mail:
[email protected] 2 Université de Lyon, CNRS (UMPA), Ecole Normale Supérieure De Lyon,
46, Allée D’Italie, 69364, Lyon Cedex 07, France. E-mail:
[email protected] 3 Ceremade, UMR CNRS 7534, Université de Paris Dauphine, Place du Maréchal De Lattre De Tassigny, 75775 Paris Cedex 16, France. E-mail:
[email protected] Received: 29 January 2008 / Accepted: 19 July 2008 Published online: 29 October 2008 – © Springer-Verlag 2008
Abstract: We introduce a model whose thermal conductivity diverges in dimension 1 and 2, while it remains finite in dimension 3. We consider a system of oscillators perturbed by a stochastic dynamics conserving momentum and energy. We compute thermal conductivity via Green-Kubo formula. In the harmonic case we compute the current-current time correlation function, that decay like t −d/2 in the unpinned case and like t −d/2−1 if an on-site harmonic potential is present. This implies a finite conductivity in d ≥ 3 or in pinned cases, and we compute it explicitly. For general anharmonic strictly convex interactions we prove some upper bounds for the conductivity that behave qualitatively as in the harmonic cases. 1. Introduction The mathematical deduction of Fourier’s law and heat equation for the diffusion of energy from a microscopic Hamiltonian deterministic dynamics is one of the major open problems in non-equilibrium statistical mechanics [6]. Even the existence of the thermal conductivity defined by the Green-Kubo formula, is a challenging mathematical problem and it may be infinite in some low dimensional cases [13]. Let us consider the problem in a generic lattice system where dynamics conserves energy (between other quantities like momentum, etc.). For x ∈ Zd , denote by Ex (t) the energy of atom x. To simplify notations let us consider the 1-dimensional case. Since the dynamics conserves the total energy, there exist energy currents jx,x+1 (local functions of the coordinates of the system), such that d Ex (t) = jx−1,x (t) − jx,x+1 (t). dt
(1)
Another consequence of the conservation of energy is that there exists a family of stationary equilibrium measures parametrized by temperature value T (between other possible parameters). Let us denote by < · > = < · >T the expectation of the
68
G. Basile, C. Bernardin, S. Olla
system starting from this equilibrium measure, and assume that parameters are set so that < jx,y > = 0 (for example if total momentum is fixed to be null). Typically these measures are Gibbs measure with sufficiently fast decay of space correlations so that energy has static fluctuation that are Gaussian distributed if properly rescaled in space. Let us define the space-time correlations of the energy as S(x, t) = < Ex (t)E0 (0) > − < E0 >2 . If thermal conductivity is finite, S(x, t) should be solution of the diffusion equation (in a proper large space-time scale) and thermal conductivity (TC) can be defined as 1 2 x S(x, t). t→∞ 2t T 2
κ(T ) = lim
(2)
x∈Z
By using the energy conservation law (1), time and space invariance (see Sect. 3), one can rewrite ⎞⎛ t ⎞ ⎛ t 1 ⎝ κ(T ) = lim jx,x+1 (s)ds ⎠ ⎝ j0,1 (s )ds ⎠ t→∞ 2t T 2 x∈Z
=
1 T2
∞
0
jx,x+1 (t) j0,1 (0) dt,
0
(3)
x∈Z 0
which is the celebrated Green-Kubo formula for the thermal conductivity (cf. [17]). One can see from (3) why the problem is so difficult for deterministic dynamics: one needs some control of time decay of the current-current correlations, a difficult problem even for finite dimensional dynamical systems. Furthermore in some one–dimensional systems, like the Fermi-Pasta-Ulam chain of unpinned oscillators, if total momentum is conserved by the dynamics, thermal conductivity is expected to be infinite (cf. [13] for a review of numerical results on this topic). Very few mathematically rigorous results exist for deterministic systems ([8,15]). In this paper we consider stochastic perturbations of a deterministic Hamiltonian dynamics on a multidimensional lattice and we study the corresponding thermal conductivity as defined by (3). The stochastic perturbations are such that they exchange momentum between particles with a local random mechanism that conserves total energy and total momentum. Thermal conductivity of Hamiltonian systems with stochastic dynamical perturbations have been studied for harmonic chains. In [5,7] the stochastic perturbation does not conserve energy, and in [3] only energy is conserved. The novelty of our work is that our stochastic perturbations conserve also momentum, with dramatic consequences in low dimensional systems. In fact we prove that for unpinned systems (where also the Hamiltonian dynamics conserve momentum, see the next section for a precise definition) with harmonic interactions, thermal conductivity is infinite in 1 and 2 dimensions, while it is finite for d ≥ 3 or for pinned systems. Notice that for stochastic perturbations of harmonic systems that do not conserve momentum, thermal conductivity is always finite [3,7]. This divergence of TC in dimension 1 and 2 is expected generically for a deterministic Hamiltonian non-linear system when unpinned. So TC in our model behaves qualitatively like in a deterministic non-linear system, i.e. these stochastic interactions reproduce some
Thermal Conductivity for a Momentum Conservative Model
69
of the features of the non-linear deterministic hamiltonian interactions. Also notice that because of the conservation laws, the noise that we introduce is of multiplicative type, i.e. intrinsically non-linear (cf. (6) and (7)). On the other hand, purely deterministic harmonic chains (pinned or unpinned and in any dimension) have always infinite conductivity [15]. In fact in these linear systems energy fluctuations are transported ballistically by waves that do not interact with each other. Consequently, in the harmonic case, our noise is entirely responsible for the finiteness of the TC in dimension 3 and for pinned systems. Also in dimension 1 and 2, the divergence of TC for unpinned harmonic systems is due to a superdiffusion of the energy fluctuations, not to ballistic transport (see [2,12] where this behavior is explained with a kinetic argument). For anharmonic systems, even with the stochastic noise we are not able to prove the existence of thermal conductivity (finite or infinite). If the dimension d is greater than 3 and the system is pinned, we get a uniform bound on the finite size system conductivity. For low dimensional pinned systems (d = 1, 2), we can show the conductivity is finite if the interaction potential is quadratic and the pinning is generic. For the unpinned system we have to assume that the interaction between nearest-neighbor particles is strictly convex and quadratically bounded at infinity. This is because we need some information on the spatial decay of correlations in the stationary equilibrium measure, that decay slow in the unpinned system [9]. In this case, we prove the conductivity is finite in dimension d ≥ 3 and we obtain upper bounds in the size N of the system of the form √ N in d = 1 and (log N )2 in d = 2 (see Theorem 3 for precise statements). The paper is organized as follows. Section 2 is devoted to the precise description of the dynamics. In Sects. 3, we present our results. The proofs of the harmonic case are in Sect. 4 and 5 while the proofs of the anharmonic case are stated in Sect. 6. The final section contains technical lemmas related to equivalence of ensembles. Notations. The canonical basis of Rd is noted (e1 , e2 , . . . , ed ) and the coordinates of a vectoru ∈ Rd are noted (u1 , . . . , ud ). Its Euclidean norm |u| is given by |u| = (u1 )2 + . . . + (ud )2 and the scalar product of u and v is u · v. If N is a positive integer, ZdN denotes the d-dimensional discrete torus of length N and we identify x = x + k N e j for any j = 1, . . . , d and k ∈ Z. If F is a function from Zd (or ZdN ) into R then the (discrete) gradient of F in the direction e j is defined by (∇e j F)(x) = F(x + e j ) − F(x) and the Laplacian of F is
given by (F)(x) = dj=1 F(x + e j ) + F(x − e j ) − 2F(x) . 2. The Dynamics In order to avoid difficulties with definitions of the dynamics and its stationary Gibbs measures, we start with a finite system and we will define thermal conductivity through an infinite volume limit procedure (see sect. 3). We consider the dynamics of the system of length N with periodic boundary conditions. The atoms are labeled by x ∈ ZdN . Momentum of atom x is px ∈ Rd and its displacement from its equilibrium position is qx ∈ Rd . The Hamiltonian is given by HN =
x∈ZdN
⎤ 2 1 |p | ⎣ x + W (qx ) + V (qx − qy )⎦ . 2 2 ⎡
|y−x|=1
70
G. Basile, C. Bernardin, S. Olla
We assume that V and W have the following form: V (qx − qy ) =
d
j
j
V j (qx − qy ),
W (qx ) =
d
j=1
j
W j (qx ),
j=1
and that V j , W j are smooth and even. We call V the interaction potential, and W the pinning potential. The case where W = 0 will be called unpinned. We consider the stochastic dynamics generated by the operator L = A+γS .
(4)
The operator A is the usual Hamiltonian vector field px · ∂qx − ∂qx H N · ∂px , A= x
while S is the generator of the stochastic perturbation and γ > 0 is a positive parameter that regulates its strength. The operator S acts only on the momentums {px } and generates a diffusion on the surface of constant kinetic energy and constant momentum. This is defined as follows. If d ≥ 2, for every nearest neighbor atoms x and z, consider the d − 1 dimensional surface of constant kinetic energy and momentum 1 |px |2 + |pz |2 = e ; px + pz = p . Se,p = (px , pz ) ∈ R2d : 2 The following vector fields are tangent to Se,p : i, j
j
j
X x,z = ( pz − px )(∂ pzi − ∂ pxi ) − ( pzi − pxi )(∂ p j − ∂ p j ), z
so
d
i, j 2 i, j=1 (X x,z )
x
generates a diffusion on Se,p (see [11]). In d ≥ 2 we define i, j 2 1 X x,x+ek 2(d − 1) x i, j,k i, j 2 1 X x,z , = 4(d − 1) d d
S=
x,z∈Z N |x−z|=1
i, j
where e1 , . . . , ed is canonical basis of Zd . Observe that this noise conserves the total momentum x px and energy H N , i.e. S px = 0 , S H N = 0. x
In dimension 1, in order to conserve total momentum and total kinetic energy, we have to consider a random exchange of momentum between three consecutive atoms (because if d = 1, Se,p has dimension 0), and we define S=
1 (Yx )2 , 6 d x∈Z N
Thermal Conductivity for a Momentum Conservative Model
71
where Yx = ( px − px+1 )∂ px−1 + ( px+1 − px−1 )∂ px + ( px−1 − px )∂ px+1 which is vector field tangent to the surface of constant energy and momentum of the three particles involved. The corresponding Fokker-Planck equation for the time evolution of the probability distribution P(q, p, t), given an initial distribution P(q, p, 0) is given by ∂P = (−A + γ S)P = L ∗ P, ∂t
(5)
where L ∗ is the adjoint of L with respect to the Lebesgue measure. i, j Let {wx,y ; x, y ∈ ZdN ; i, j = 1, . . . , d; |y − x| = 1} be independent standard i, j i, j Wiener processes, such that wx,y = wy,x . Equation (5) corresponds to the law at time t of the solution of the following stochastic differential equations: dqx = px dt, dpx = −∂qx H N dt + 2γ px dt √ d γ i, j i, j X x,z px dwx,z (t). + √ 2 d − 1 z:|z−x|=1 i, j=1
(6)
In d = 1 these are: γ dpx = −∂qx H N dt + (4 px + px−1 + px+1 )dt 6 γ + (Yx+k px ) dwx+k (t), 3
(7)
k=−1,0,1
where here {wx (t), x = 1, . . . , N } are independent standard Wiener processes. Defining the energy of the atom x as Ex =
1 1 2 p + W (qx ) + 2 x 2
V (qy − qx ),
y:|y−x|=1
the energy conservation law can be read locally as Ex (t) − Ex (0) =
d
Jx−ek ,x ([0, t]) − Jx,x+ek ([0, t]) ,
k=1
where Jx,x+ek ([0, t]) is the total energy current between x and x + ek up to time t. This can be written as t Jx,x+ek ([0, t]) =
jx,x+ek (s) ds + Mx,x+ek (t). 0
(8)
72
G. Basile, C. Bernardin, S. Olla
In the above Mx,x+ek (t) are martingales that can be written explicitly as Itô stochastic integrals Mx,x+ek (t) =
γ (d − 1)
t
i, j i, j X x,x+ek Ex (s) dwx,x+ek (s).
(9)
i, j 0
In d = 1 these martingales are written explicitly as Mx,x+1 (t) =
γ 3
t
(Yx+k Ex ) dwx+k (t).
(10)
0 k=−1,0,1
The instantaneous energy currents jx,x+ek satisfy the equation LEx =
d
jx−ek ,x − jx,x+ek ,
k=1
and it can be written as a s jx,x+ek = jx,x+e + γ jx,x+e . k k
(11)
The first term in (11) is the Hamiltonian contribution to the energy current 1 a jx,x+e = − (∇V )(qx+ek − qx ) · (px+ek + px ) k 2 d 1 j j j j V j (qx+ek − qx )( px+ek + px ) =− 2
(12)
j=1
while the noise contribution in d ≥ 2 is s = −γ (∇ek p2 )x γ jx,x+e k
(13)
and in d = 1 is s γ jx,x+1 = −γ ∇ϕ( px−1 , px , px+1 ), 1 2 2 + 4 px2 + px−1 + px+1 px−1 − 2 px+1 px − 2 px px−1 ]. ϕ( px−1 , px , px+1 ) = [ px+1 6
In the unpinned case (W = 0), given any values of E > 0, the uniform probability measure on the constant energy-momentum shell ⎧ ⎫ ⎪ ⎪ ⎨ ⎬ px = 0, qx = 0 N ,E = (p, q) : H N = N E, ⎪ ⎪ ⎩ ⎭ x∈Zd x∈Zd N
N
is stationary for the dynamics, and A and S are respectively antisymmetric and symmetric with respect to this measure. For the stochastic dynamics, we believe that these measures are also ergodic, i.e. total energy, total momentum and center of mass are the only conserved quantities. Notice that because of the periodic boundary conditions, no other
Thermal Conductivity for a Momentum Conservative Model
73
conserved quantities associated to the distortion of the lattice exist. For example in d = 1 the total length of the chain x (qx+1 − qx ) is automatically null. In the pinned case, total momentum is not conserved, and the ergodic stationary measures are given by the uniform probability measures on the energy shells N ,E = {(p, q) : H N = N E } . In both cases we refer to these measures as microcanonical Gibbs measures. We denote by < · > N ,E the expectation with respect to these microcanonical measures. We will also consider the dynamics starting from the canonical Gibbs measure d < · > N ,T with temperature T > 0 defined on the phase space (R2d )Z N by < · > N ,T =
e−H N /T dq dp. Z N ,T
To avoid confusion between these measures we restrict the use of the subscript E for the microcanonical measure and the subscript T for the canonical measure. 3. Green-Kubo Formula and Statement of the Results In the physical literature several variations of the Green-Kubo formula (3) can be found ([13,7]). As in (3), one can start with the infinite system and sum over all x ∈ Zd . One can also start working with the finite system with periodic boundary conditions and sum over x ∈ dN , where dN is a finite box of size N and take the thermodynamic limit N → ∞ (before sending the time to infinity). In the finite case there is a choice of the equilibrium measure. If < · > is the canonical measure at temperature T , one refers to the derivation à la Kubo. If < · > is the microcanonical measure at energy E N d , one refers to the derivation à la Green. Because of the equivalence of ensembles one expects that these different definitions give all the same value of the conductivity, provided that temperature T and energy E are suitably related by the corresponding thermodynamis relation. Nevertheless a rigorous justification is absent in the literature. In the sequel we will consider the microcanonical Green-Kubo formula (noted κ) and the canonical Green-Kubo formula (noted κ) ˜ starting from our finite system. In the harmonic case we work out the microcanonical Green-Kubo version that we compute explicitly. Similar computations are valid (with less work) for the canonical version of the Green-Kubo formula and will give the same result. In the anharmonic case equivalence of ensembles is less developed and we deal only with the canonical version of the Green-Kubo formula. The microcanonical Green-Kubo formula for the conductivity in the direction e1 is defined as the limit (when it exists) ! " 1 E N ,E Jx,x+e1 ([0, t]) J0,e1 ([0, t]) , t→∞ N →∞ 2T 2 t d
κ 1,1 (T ) = lim lim
(14)
x∈Z N
where E N ,E is the expectation starting with the microcanonical distribution < · > N ,E , and the energy E = E(T ) is chosen such that it corresponds to the thermodynamic energy at temperature T (i.e. the average of the kinetic energy in the canonical measure). In the harmonic case T = E.
74
G. Basile, C. Bernardin, S. Olla
Similarly the canonical version of the Green-Kubo formula is given by ! " 1 E N ,T Jx,x+e1 ([0, t])J0,e1 ([0, t]) 2 t→∞ N →∞ 2T t d
κ˜ 1,1 (T ) = lim lim
(15)
x∈Z N
when this limit exists. Here E N ,T indicates the expectation with respect to the equilibrium dynamics starting with the canonical measure < · > N ,T at temperature T . These definitions are consistent with (2)–(3) as we show at the end of this section. Our first results concern the (α, ν)-harmonic case: V j (r ) = αr 2 , W j (q) = νq 2 , α > 0, ν ≥ 0.
(16)
Theorem 1. In the (α, ν)-harmonic case (16), the limits defining κ 1,1 and κ˜ 1,1 exist. They are finite if d ≥ 3 or if the on-site harmonic potential is present (ν > 0), and are infinite in the other cases. When finite, κ(T ) and κ(T ˜ ) are independent of T , coincide and the following formula holds: γ (∂k1 ω)2 (k) 1 κ˜ 1,1 (T ) = κ 1,1 (T ) = dk + , (17) 2 8π dγ ψ(k) d [0,1]d
where ω(k) is the dispertion relation ⎛ ω(k) = ⎝ν + 4α
d
⎞1/2 sin (π k )⎠ 2
j
(18)
j=1
and
# 8 dj=1 sin2 (π k j ), if d ≥ 2 ψ(k) = if d = 1. 4/3 sin2 (π k)(1 + 2 cos2 (π k)),
(19)
Consequently in the unpinned harmonic cases in dimension d = 1 and 2, the conductivity of our model diverges. In order to understand the nature of this divergence we define the (microcanonical) conductivity of the finite system of size N as ⎛⎡ ⎤2 ⎞ 1 1 ⎜⎢ ⎥ ⎟ κ N1,1 (T ) = (20) E N ,E ⎝⎣ Jx,x+e1 ([0, t N ])⎦ ⎠ , 2T 2 t N N d d x∈Z N
where t N = N /vs with vs = limk→0 |∂k1 ω(k)| = 2α 1/2 the sound velocity. This definition of the conductivity of the finite system is motivated by the following consideration: ∇k ω(k) is the group velocity of the k-mode waves, and typically vs is an upper bound for these velocities. Consequently t N is the typical time a low k (acoustic) mode takes to cross around the system once. One defines similarly κ˜ N1,1 (T ) by ⎛⎡ κ˜ N1,1 (T ) =
1 1 E N ,T 2 2T t N N d
⎤2 ⎞ ⎜⎢ ⎥ ⎟ Jx,x+e1 ([0, t N ])⎦ ⎠ . ⎝⎣ x∈ZdN
(21)
Thermal Conductivity for a Momentum Conservative Model
75
We conjecture that κ N (resp. κ˜ N ) has the same asymptotic behavior as the conductivity defined in the non-equilibrium stationary state on the open system with thermostats at the boundary at different temperature, as defined in eg. [3,6,15]. With these definitions we have the following theorem: Theorem 2. In the harmonic case, if W = 0: (1) κ N ∼ N 1/2 if d = 1, (2) κ N ∼ log N if d = 2. In all other cases κ N is bounded in N and converges to κ. Same results are valid for κ˜ N . In fact we show that, in the harmonic case, we have lim
N →∞
κ˜ N1,1 (T ) κ N1,1 (T )
= 1.
(22)
This is a consequence of Eq. (51) that one can easily check is also valid if the microcanonical measure is replaced by the canonical measure. In the anharmonic case we cannot prove the existence of either κ˜ 1,1 (T ) or κ 1,1 (T ), but we can establish upper bounds for the canonical version of the finite size GreenKubo formula (21). Extra assumptions on the potentials V and W assuring a uniform control on the canonical static correlations (see (86–89)) have to be done. In the unpinned case W = 0, (89) is valid as soon as V is strictly convex. In the pinned case W > 0, (86) is “morally” valid as soon as the infinite volume Gibbs measure is unique. Exact assumptions are given in [4], Theorem 3.1 and Theorem 3.2. In the sequel, “the general anharmonic case” will refer to potentials V and W such that (86) (or (89)) is valid. Theorem 3. Consider the general anharmonic case. There exists a constant C (depending on the temperature T ) such that • For d ≥ 3, (1) either W > 0 is general (2) or if W = 0 and 0 < c− ≤ V j ≤ C+ < ∞ for any j, then κ˜ N1,1 (T ) ≤ C. • For d = 2, if W = 0 and 0 < c− ≤ V j ≤ C+ < ∞ for any j, then κ˜ N1,1 (T ) ≤ C(log N )2 . • For d = 1, if W = 0 and 0 < c− ≤ V ≤ C+ < ∞, then κ˜ N1,1 (T ) ≤ C
√
N.
• Moreover, in any dimension, if V j are quadratic and W > 0 is general then κ˜ N1,1 (T ) ≤ C.
76
G. Basile, C. Bernardin, S. Olla
The proof of this statement is in Sect. 6. We now relate the definition of the Green-Kubo (14) and (15) to the variance of the energy-energy correlations function (2). Consider the infinite volume dynamics on Zd under the infinite volume canonical Gibbs measure with temperature T > 0. The expectation is denoted by ET . Fix t > 0 and assume that the following sum makes sense: i, j xi x j ET [ (Ex (t) − T )(E0 (0) − T ) ] = xi x j S(x, t). (23) DT (t) = x∈Zd
x∈Zd
If x = 0, by space and time invariance of the dynamics, we have 1 ET [(Ex (t) − T )(E0 (0) − T )] = − ET [ (Ex (t) − Ex (0)) (E0 (t) − E0 (0)) ] . (24) 2 By definition of the current, we have for any y ∈ Zd : Ey (t) − Ey (0) =
d
Jy−ek ,y ([0, t]) − Jy,y+ek ([0, t]) .
(25)
k=1
By two discrete integration by parts one obtains ! " i, j ET Jx,x+ei ([0, t]) J0,e j ([0, t]) DT (t) =
(26)
x∈Zd
so that the thermal conductivity is equal to the space-time correlations of the total current ! " 1 ET Jx,x+ei ([0, t]) J0,e j ([0, t]) . t→∞ 2T 2 t d
κ i, j (T ) = δ0 (i − j) lim
(27)
x∈Z
Of course this derivation is only formal even for fixed time t > 0. The problem is to define the infinite volume dynamics and to show S(x, t) has a sufficiently fast decay in x. For the purely Hamiltonian dynamics, it is a challenging problem. For the stochastic dynamics it seems less difficult but remains technical. To avoid these difficulties we adopt a finite volume limit procedure starting from (3). This explains the definitions (14) and (15). Consider now the closed dynamics on ZdN starting from the microcanonical state. The rest of the section is devoted to the proof of the following formula: ⎛⎡ ⎤2 ⎞ 1 1 ⎜⎢ ⎥ ⎟ E N ,E ⎝⎣ Jx,x+e1 ([0, t])⎦ ⎠ 2 d 2T t N d x∈Z N
⎛⎡
⎤2 ⎞ t ⎜⎢ ⎥ ⎟ γ ON a = (2T 2 t N d )−1 E N ,E ⎝⎣ jx,x+e (s)ds ⎦ ⎠ + + d , 1 d N d
(28)
x∈Z N 0
and an identical formula in the canonical case (with E N ,E substituted by E N ,T ). The term γ /d in (28) is the direct contribution of the stochastic dynamics to the thermal conductivity. In the microcaconical case we actually prove that is equal to
Thermal Conductivity for a Momentum Conservative Model
77
γ /d only for the harmonic case. A complete proof of (28) for anharmonic interaction demands an extension of the equivalence of ensembles estimates proven in Sect. 7. In the grancanonical case this problem does not appear. Starting in the microcanonical case, remark that the first term on the RHS of (28) can be written as ⎛⎡ ⎤2 ⎞ t ⎜⎢ ⎥ ⎟ a (2T 2 t N d )−1 E N ,E ⎝⎣ jx,x+e (s)ds ⎦ ⎠ 1 x∈ZdN 0
1 = 2 T
) ∞ ( a s + a 1− E N ,E jx,x+e (s) j0,e (0) ds. 1 1 t d
(29)
x∈Z N
0
If γ = 0, which corresponds to the purely Hamiltonian system, as N and then t goes to infinity, and if one can prove that the current-current correlation function has a sufficiently fast decay, then one recovers the usual Green-Kubo formula (3). To prove (29) one uses space and time translation invariance of the dynamics ⎛⎡ ⎤2 ⎞ t ⎜ ⎟ a (2T 2 t N d )−1 E N ,E ⎝⎣ jx,x+e (s)ds ⎦ ⎠ 1 x
d −1
= (2T t N ) 2
x,y
d −1
= (T t N ) 2
x,y
d −1
= (T t N ) 2
1 = 2 T
∞ ( 1− 0
s t
t
t
ds
0
0
t
s ds
0
x,y
0
a a du E N ,E jx,x+e (s) j (u) y,y+e1 1
a a du E N ,E jx,x+e (s) j (u) y,y+e 1 1
0
s
t
ds
0
a a du E N ,E jx−y,x−y+e (s − u) j (0) 0,e 1 1
0
)+
a a E N ,E jx,x+e (s) j0,e (0) ds. 1 1
x
We now give the proof of (28). Because of the periodic boundary conditions, since j s if a gradient (cf. (13)), the corresponding terms cancel, and we can write
Jx,x+e1 ([0, t]) =
x
t 0
a jx,x+e (s) ds + 1
x
Mx,x+e1 (t)
x
t Je1 (s) ds + Me1 (t)
= 0
(30)
78
G. Basile, C. Bernardin, S. Olla
so that
⎛* +2 ⎞ Jx,x+e1 ([0, t]) ⎠ (t N d )−1 E N ,E ⎝ x
⎛⎡ ⎤2 ⎞ t ⎜ ⎟ = (t N d )−1 E N ,E ⎝⎣ Je1 (s)ds ⎦ ⎠ + (t N d )−1 E N ,E M2e1 (t) 0
⎛⎡ d −1
+2(t N )
E N ,E ⎝⎣
t
⎤
⎞
Je1 (s) ds ⎦ Me1 (t)⎠ .
(31)
0
The third term on the RHS of (31) is shown to be zero by a time reversal argument and the second term on the RHS of (31) gives in the limit a contribution equal to γ /d. To see the first claim let us denote by {ω(s)}0≤s≤t the process {(px (s), qx (s)); x ∈ ZdN , 0 ≤ s ≤ t} arising in (6) or in (7) for the one-dimensional case. The reversed process {ωs∗ }0≤s≤t is defined as ωs∗ = ωt−s . Under the microcanonical measure, the time reversed process is still Markov with generator −A + γ S. The total current Jt (ω· ) = x Jx,x+e1 ([0, t]) is a functional of {ωs }0≤s≤t . By (6–7), we have in fact that Jt (·) is an anti-symmetric functional of {ωs }0≤s≤t , meaning Jt ({ωs∗ }0≤s≤t ) = −Jt ({ωs }0≤s≤t ).
(32)
In fact, similarly to (8), we have Js (ω·∗ )
s =
(Je1 )∗ (ω∗ (v))dv + M∗e1 (s), 0 ≤ s ≤ t,
(33)
0
where (M∗e1 (s)) is a martingale with respect to the natural filtration of (ωs∗ )0≤s≤t 0≤s≤t ∗ a ∗ a and (Je1 ) = x ( j )x,x+e1 is equal to −Je1 = − x jx,x+e . 1 We have then by time reversal E N ,E [Jt (ω· )Je1 (ω(t))] = −E N ,E [Jt (ω·∗ )Je1 (ω∗ (0))] ⎡⎛ t ⎞ ⎤ = −E N ,E ⎣⎝ (Je1 )∗ (ω∗ (s))ds + M∗ (t)⎠ Je1 (ω∗ (0))⎦ ⎡⎛ = −E N ,E ⎣⎝
0
t
⎞
⎤
Je1 ∗ (ω∗ (s))ds ⎠ Je1 (ω∗ (0))⎦ ,
(34)
0
where the last equality follows from the martingale property of M∗ . Recall now that (Je1 )∗ = −Je1 . By variables change s → t − s in the time integral, we get ⎡⎛ t ⎞ ⎤ E N ,E [Jt (ω· )Je1 (ω(t))] = E N ,E ⎣⎝ Je1 (ω(s))ds ⎠ Je1 (ω(t))⎦ . (35) 0
Thermal Conductivity for a Momentum Conservative Model
79
It follows that ⎞ ⎤ ⎤ ⎡⎛ t ⎡ t E N ,E ⎣⎝ Je1 (ω(s))ds ⎠ Me1 (t)⎦ = E N ,E ⎣ Je1 (ω(s))Me1 (s)ds ⎦ 0
t =
0
⎛
⎡
ds E N ,E ⎣Je1 (ω(s)) ⎝ Js (ω· ) −
0
s
⎞⎤
Je1 (ω(v))dv ⎠⎦ . = 0
(36)
0
For the second term on the RHS of (31) we have 2 , i, j γ 2 X (p /2) x,x+e1 x (d − 1)N d x N ,E i, j , 2 γ j i i j p = p − p p x x+e1 x x+e1 (d − 1)N d x N ,E i= j . / 2γ j i ( px px+e = )2 1 N ,E (d − 1)N d x i= j / . 2γ j j i i ( p − p p p ) . x x+e x x+e 1 1 N ,E (d − 1)N d x
(t N d )−1 E N ,E M2e1 (t) =
i= j
Thanks to the equivalence of ensembles (cf. Lemma 7), this last quantity is equal to 2γ
T2 + N −d O N , d
(37)
where O N remains bounded as N → ∞. The calculation in d = 1 is similar. The contribution of the martingale term for the conductivity is hence γ /d and we have shown (28). Notice this is the only point where we have used the equivalence of ensembles results of Sect. 7 that we have proven only in the harmonic case. We conjecture these are true also for the anharmonic cases. Observe that all the arguments above between (30) and (37) apply directly also to the canonical definition of the Green-Kubo but without the small error in N (because for the canonical measure momentums px are independently distributed and the equivalence of ensembles approximations are in fact equalities). Therefore we have the similar formula to (28): 1 E N ,T Jx,x+e1 ([0, t])J0,e1 ([0, t]) 2 2T t x ⎛⎡ ⎤2 ⎞ t ⎜ ⎟ γ a = (2T 2 N d t)−1 E N ,T ⎝⎣ jx,x+e (s)ds ⎦ ⎠ + . 1 d x
(38)
0
In the next sections we will consider the (α, ν)-harmonic case and we will compute explicitly the limit (as N → ∞ and then t → ∞) of the two first term on the RHS of (31).
80
G. Basile, C. Bernardin, S. Olla
4. Correlation Function of the Energy Current in the Harmonic Case We consider the (α, ν)-harmonic case (16). We recall that Je1 = x jx,x+e1 . Because s of the periodic boundary a conditions, and being jx,x+e1 a spatial gradient (cf. (13)), we have that Je1 = x jx,x+e1 . We are interested in the decay of the correlation function: C1,1 (t) = lim
N →∞
1 a a E N ,E (Je1 (t)Je1 (0)) = lim E N ,E ( j0,e (0) jx,x+e (t)), (39) 1 1 d N →∞ N x
where E N ,E is the expectation starting with the microcanonical distribution defined above. For λ > 0, let u λ,N be the solution of the Poisson equation a jx,x+e λu λ,N − Lu λ,N = − 1 x
given explicitly in Lemma 2 of Sect. 5. By Lemma 1, we can write the Laplace transform of C1,1 (t) as ∞
dte−λt C1,1 (t) dt = lim
N →∞
a j0,e u 1 λ,N
N ,E
.
(40)
0
Substituting in (40) the explicit form of u λ,N given in Lemma 2, we have: a
α2 − j0,e u = gλ,N (x − y) (qe1 − q0 ) · (pe1 + p0 )(px · qy ) N ,E λ,N 1 N ,E 2γ x,y =
α2 gλ,N (x − y) (qe1 · p0 − q0 · pe1 )(px · qy ) N ,E 2γ x,y +
α2 gλ,N (x − y) (qe1 · pe1 − q0 · p0 )(px · qy ) N ,E . 2γ x,y (41)
Observe that the last term on the RHS of (41) is null by the translation invariance property. So we have (using again the translation invariance and the antisymmetry of gλ,N ) a
α2 − j0,e u = gλ,N (x − y) (qe1 − q−e1 ) · p0 )(px · qy ) N ,e . 1 λ,N N ,e 2γ x,y Define K N (q) = N d E −
1 qx · (ν I − α)qx . 2 x
In the unpinned case ν = 0, conditionally to the positions configuration q, the law of p Nd is µq = µ√ (defined in Lemma 6), meaning the uniform measure on the surface 2K (q) N
# (px )x∈Zd ; N
0 1 2 p = K N (q); px = 0 . 2 x x x
Thermal Conductivity for a Momentum Conservative Model
81
By using properties (i),(ii) and (iii) of Lemma 6, one has for x = 0, / .
j j i µq p0i px (qei 1 − q−e )q ((qe1 − qe1 ) · p0 )(px · qy ) N ,E = y 1 i, j
=
.
i µq p0i pxi (qei 1 − q−e )qyi 1
i
=−
d , i=1
N ,E
/ N ,E
2K N (q) i (q i − q−e )qyi 1 d N d (N d − 1) e1
N ,E
/ 1 . i 2 i i i ( p ) (q − q )q . e −e y 0 1 1 N ,E Nd − 1 d
=−
(42)
i=1
For x = 0, one gets / .
j j i µq p0i p0 (qei 1 − q−e ((qe1 − qe1 ) · p0 )(p0 · qy ) N ,E = )q y 1 i, j
=
/ i i µq p0i p0i (qei 1 − q−e )q y 1
d . i=1
=
N ,E
d ,
p0i
2
N ,E
(qei 1
i=1
i − q−e )qyi 1
.
(43)
N ,E
In the pinned case ν > 0, conditionally to the positions configuration q, the law of p Nd is λq = λ√ (defined in Lemma 5), meaning the uniform measure on the surface 2K N (q) 0 # 1 2 p = K N (q) . (px )x∈Zd ; N 2 x x We proceed in a similar way and we observe that if x = 0, λq ( p0i pxi ) = 0 (cf. ii) of Lemma 5) Since gλ,N is antisymmetric (see (64–65)) and such that z gλ,N (z) = 0, one obtains easily in both cases (pinned and unpinned) −
a j0,e u 1 λ,N
N ,e
, 2 α2 i i i i p0 (qe1 − q−e1 )qy =− gλ,N (y) 2γ y N ,E i , 2 2 α 1ν=0 i i i i p0 (qe1 − q−e1 )qy + gλ,N (y − x) 2γ N d − 1 N ,E x=0,y i , ) 2 ( 2 1ν=0 α i p0i (qei 1 − q−e = − 1+ d gλ,N (y) )qyi . 1 N − 1 2γ y N ,E i
(44) Let N (x), x ∈ such that
ZdN ,
be the unique solution of (ν I − α) N = δe1 − δ−e1
x∈ZdN
N (x) = 0.
(45)
82
G. Basile, C. Bernardin, S. Olla
By (iii) of Lemma 7 and (77), we have 1 1 1 1 ) 2 2 ( 1 1 a
1 α E ν=0 1− j u λ,N − 1+ d gλ,N (y) N (y)11 0,e1 1 N ,E N − 1 2γ d 1 1 y 2 31/2 1 C log N C log N 11 C log N ≤ gλ,N (y)1 ≤ (gλ,N (x))2 ≤ . d d/2 N N λN d/2 y x
(46)
Hence the last term of (46) goes to 0. Taking the limit as N → ∞ we obtain (see (80)) ∞
e−λt C1,1 (t) dt =
0
α2 E 2 gλ (z)(z), 2dγ z
(47)
where gλ are solutions of the same equations as gλ,N but on Zd and is the solution of the same equation as N but on Zd . Using Parseval relation and the explicit form of the Fourier transform of gλ (cf. (74)) and , one gets the following formula for the Laplace transform of C1,1 (t) for d ≥ 2: 2 3 sin2 (2π k1 ) α2 E 2 1 . (48) dk d d 2 j d ν + 4α j=1 sin (π k ) λ + 8γ j=1 sin2 (π k j ) [0,1]d
By injectivity of Laplace tranform, C1,1 (t) is given by: 2 3 α2 E 2 sin2 (2π k1 ) dk C1,1 (t) = d ν + 4α dj=1 sin2 (π k j ) [0,1]d
⎧ ⎨ exp
⎩
−8γ t
d j=1
⎫ ⎬
sin2 (π k j ) . ⎭
(49)
For the one dimensional case, the equation for gλ,N (resp. gλ ) is different (see (75) ) and we get the following integral representation of the correlation function of the energy current: 1 C1,1 (t) = αE
2
4γ t 2 sin (π k)(1 + 2 cos2 (π k) . dk cos2 (π k) exp − 3
(50)
0
In any dimension, we have the following unified formula for C1,1 (t) E2 C1,1 (t) = 4π 2 d
[0,1]d
(∂k1 ω(k))2 e−tγ ψ(k) dk,
(51)
Thermal Conductivity for a Momentum Conservative Model
83
where ω(k) is defined by (18) and ψ(k) by (19). Observe that the same formula holds if we replace E N ,E by E N ,T . In this last case, the situation is simpler since we do not need equivalence of ensembles. Standard analysis shows the behavior of C1,1 (t) as t goes to infinity is governed by the behavior of the function (∂k1 ω(k))2 and ψ(k) around the minimal value of ψ which is 0. In fact, ψ(k) = 0 if and only if k = 0 or k = (1, . . . , 1). By symmetry, we can treat only the case k = 0. Around k = 0, ψ(k) ∼ a|k|2 and (∂κ 1 ω(k))2 ∼ b(ν + |k|2 )−1 (k1 )2 , where a and b are positive constants depending on ν and α. Essentially, C1,1 (t) has the same behavior as
(k 1 )2 e−aγ t|k| 1 = d/2+1 2 ν + |k| t 2
dk
√ [0, t]d
k∈[0,1]d
(k1 )2 e−aγ |k| . ν + t −1 |k|2 2
dk
(52)
Hence, we have proved the following theorem: Theorem 4. In the (α, ν)-harmonic case, the current-current time correlation function C1,1 (t) decays like • C1,1 (t) ∼ t −d/2 in the unpinned case (ν = 0) • C1,1 (t) ∼ t −d/2−1 in the pinned case (ν > 0) 5. Conductivity in the Harmonic Case Lemma 1. Consider the (α, ν)-harmonic case. For any time t, the following limit exists: C1,1 (t) = lim
N →∞
1 E N ,E (Je1 (t)Je1 (0)). Nd
(53)
and ∞
dte−λt C1,1 (t) dt = lim
N →∞
a j0,e u 1 λ,N
N ,E
.
(54)
0
The same result holds with E N ,E replaced by E N ,T . Proof. We only prove this lemma in the microcanonical setting. Let us define f N (t) =
1 E N ,E (Je1 (t)Je1 (0)). Nd
(55)
We first prove the sequence ( f N ) N is uniformly bounded. By Cauchy-Schwarz and stationarity, we have
1 4 2 4 2 Je1 (t) N ,E Je1 (0) N ,E d N 1 . / = d J2e1 . N ,E N
| f N (t)| ≤
(56)
84
G. Basile, C. Bernardin, S. Olla
We now use symmetry properties of the microcanonical ensemble to show this last term is bounded above by a constant independent of N , a N −d < J2e1 > N ,E = < j0,e ja > N ,E 1 x,x+e1 x
=
α2 4
d .
j
j
j
j
(qei 1 − q0i )(qx+e1 − qx )( pei 1 + p0i )( px+e1 + px
x i, j=1
/ N ,E
.
In the unpinned case ν = 0, conditionally to the positions configuration q, the law Nd of p is µq = µ√ (defined in Lemma 6). 2K N (q) By using properties (i), (ii) and (iii) of Lemma 6, one has / α2 . i i i i i i 2 (qe1 − q0i )(q2e − q − 3q + 3q )( p ) . −e1 e1 0 0 1 N ,E 4 d
N −d < J2e1 > N ,E =
(57)
i=1
By Cauchy-Schwarz inequality, the modulus of this last quantity is bounded above by 1 17 α[8 < E02 > N ,E + < Ee21 > N ,E ] = < E02 > N ,E , 2 2
(58)
where the last equality is a consequence of the invariance by translation of < · > N ,E . Let Nd (X 1 , . . . , X N d ) be a random vector with law λ√ , meaning the uniform measure on NdE √ the N d -dimensional sphere of radius N d E. The vector of energies (Ex , x ∈ ZdN ) has the same law as (X 12 , . . . , X 2N d ). By Lemma 4, E(X 14 ) = < E02 > N ,E is bounded above by a constant independent of N . Hence there exists a positive constant C such that | f N (t)| ≤ C.
(59)
Similarly, inequality (59) can be proved in the pinned case ν > 0. Let f (t) be any limit point of the sequence ( f N (t)) N ≥1 and choose a subsequence (Nk )k≥0 such that ( f Nk ) converges to f (for the pointwise convergence topology). By Lebesgue’s theorem, we have ∞
∞
e−λt f (t)dt.
(60)
e−λt f N (t)dt = − < j0,e1 , u λ,N > N ,E
(61)
lim
e
k→∞
−λt
f Nk (t)dt =
0
0
But we have that ∞ 0
and we have seen in Sect. 4 this last quantity converges as N goes to infinity to ∞ 0
e−λt f ∞ (t)dt,
(62)
Thermal Conductivity for a Momentum Conservative Model
85
where f ∞ is given by (see (18–19) for the notations) E2 (∂k1 ω(k))2 e−tγ ψ(k) dk. f ∞ (t) = 4π 2 d
(63)
[0,1]d
By injectivity of the Laplace transform, we get f (t) = f ∞ (t). Uniqueness of limit points implies ( f N (t)) N ≥1 converges to f ∞ (t) for any t. It follows also we can inverse time integral and infinite volume limit in the left hand side of (54) and the lemma is proved.
Lemma 2 (Resolvent equation). 2 −1
u λ,N = (λ − L)
−
3 a jx,x+e 1
x
where gλ,N (z) is the solution (such that
=
α gλ,N (x − y)px · qy , γ x,y
z gλ,N (z)
= 0) of the equation
2λ gλ,N (z) − 4gλ,N (z) = (δ(z + e1 ) − δ(z − e1 )) γ
(64)
for d ≥ 2, or " 2λ 1 ! gλ,N (z)− 4gλ,N (z) + gλ,N (z + 1) + gλ,N (z − 1) = (δ(z + 1)−δ(z − 1)) γ 3 (65) for d = 1. Moreover, Au λ,N = 0 and Lu λ,N = γ Su λ,N . Proof. We only give the proof for the dimension d ≥ 2 since the proof for the one dimensional case is similar. Let u λ,N = γα x,y gλ,N (x − y)px · qy . The generator L is equal to the sum of the Liouville operator A and of the noise operator γ S. The action of A on u λ,N is null. Indeed, we have: ⎛ ⎞ α α [(α−ν I )qx ] · ⎝ gλ,N (x − y)qy ⎠ + gλ,N (x−y)px · py . Au λ,N = γ x γ y,x y (66) Here, and in the sequel of the proof, sums indexed by x, y, z are indexed by Z N and sums indexed by i, j, k, are indexed by {1, . . . , d}. Summation by parts can be performed (without outcoming boundary terms since we are on the torus) and we get Au λ,N =
α α [(α − ν I )gλ,N ](x − y)qx qy + gλ,N (x − y)px · py . γ x γ y,x
(67)
Remark now that the function δ(· − e1 ) − δ(· + e1 ) is antisymmetric. Hence gλ,N , and consequently gλ,N , is still antisymmetric. We have therefore Au λ,N which is of the form: {a1 (x − y)px · py + a2 (x − y)qx · qy } (68) Au λ,N = x,y
86
G. Basile, C. Bernardin, S. Olla
with a1 , a2 antisymmetric. Using the antisymmetricity of a1 and a2 , it is easy to show that the last two sums are zero and hence Au λ,N = 0. A simple computation shows that if ∈ {1, . . . , d} then S( px ) =
i, j 1 (X y,y+ek )2 ( px ) 2(d − 1) y i= j,k
=
2 2(d − 1)
i, (X x,x+e )2 ( px ) + k
i=,k
i=,k 2 (X x−ek ,x )2 ( px ) 2(d − 1) i=,k
6 1 5 ( px+ek − px ) − ( px − px−e ) = k d −1 i=,k
=
2( px ).
Since the action of S is only on the p’s, we have γ Su λ,N = α gλ,N (x − y)S(px ) · qy x,y
= 2α
gλ,N (x − y)(px ) · qy
x,y
= 2α
(gλ,N )(x − y)px · qy ,
x,y
where in the last line, we performed a summation by parts. Since gλ,N is a solution of (64), we have λu λ,N − γ Su λ,N =
α a px · (qx+e1 − qx−e1 ) = − jx,x+e . 1 2 x x
(69)
of the function v on Let us define the Fourier transform v(ξ ˆ ), ξ ∈ v(ξ ˆ )= v(z) exp(2iπ ξ · z/N ). ZdN ,
ZdN
as (70)
z∈ZdN
The inverse transform is given by v(z) =
1 v(ξ ˆ ) exp(−2iπ ξ · z/N ) Nd d
(71)
ξ ∈Z N
On Zd we define similarly: v(k) ˆ =
v(z) exp(2iπ k · z), k ∈ [0, 1]d .
z∈Zd
and its inverse by
v(z) =
v(k) ˆ exp(−2iπ k · z). [0,1]d
(72)
Thermal Conductivity for a Momentum Conservative Model
87
For λ > 0, the function gλ : Zd → R is the solution on Zd of the equation 2λ gλ (z) − 4gλ (z) = δ0 (z + e1 ) − δ0 (z + e1 ), d ≥ 2, γ 2λ 1 gλ (z) − (4gλ (z) + gλ (z + 1) + gλ (z − 1)) = δ0 (z + 1) − δ0 (z − 1), d = 1. γ 3 (73) Then we have gˆ λ (k) =
−2iπ sin(2π k1 ) , if d ≥ 2 d 2λ 2 j + 16 j=1 sin (π k ) γ
(74)
and gˆ λ (k) =
−2iπ sin(2π k) , if d = 1. 2λ 8 2 2 + sin (π k) 1 + 2 cos (π k) γ 3
(75)
Since gλ,N is the solution of the same equation as gλ but on ZdN , we have the following formula for gˆ λ,N : gˆ λ,N (ξ ) = gˆ λ (ξ/N ).
(76)
The following bound follows easily from Parseval relation:
(gλ,N (x))2 ≤
x∈ZdN
γ2 λ2
(77)
Similarly, the function N defined in (45) has Fourier transform given by ˆ ), ˆ N (ξ ) = (ξ/N
(78)
where ˆ (k) =
−2i sin(2π k1 ) . ν + 4α dj=1 sin2 (π k j )
(79)
Let us denote by z ∗ the conjugate 7 8∗ of the complex number z and observe that the funcd ˆ tion k ∈ [0, 1] → gˆ λ (k) (k) ∈ R+ is continuous. Hence we have the following convergence of Riemann sums:
gλ,N (y) N (y) =
y∈ZdN
−−−−→ N →∞
[0,1]d
1 gˆ λ,N (ξ )[ˆ N (ξ )]∗ Nd d ξ ∈Z N
∗ ˆ dk gˆ λ (k)[(k)] =
gλ (y).(y).
(80)
y∈Zd
The limits as λ → 0 of the above expressions give the values for the conductivity (up to a multiplicative constant) when this is finite. If ν = 0 it diverges if d = 1 or 2.
88
G. Basile, C. Bernardin, S. Olla
6. Anharmonic Case: Bounds on the Thermal Conductivity We consider in this section the general anharmonic case and we prove Theorem 3. Recall (38), then all we need to estimate is ⎛⎡ ⎤2 ⎞ N ⎜ ⎟ a (81) (2T 2 N d+1 )−1 E N ,T ⎝⎣ jx,x+e (s)ds ⎦ ⎠ . 1 x
Let us define
E N ,T
0
= Je1 , then we have the general bound ([16], Lemma 3.9) ⎛⎡ ⎤2 ⎞ N / . ⎜⎣ ⎟ Je1 (s)ds ⎦ ⎠ ≤ 10N Je1 , (N −1 − L)−1 Je1 ⎝ a x jx,x+e1
N ,T
0
/ . ≤ 10N Je1 , (N −1 − γ S)−1 Je1
N ,T
.
(82)
1 Recall that S(px ) = 2(px ) if d ≥ 2 and S( px ) = (4 px + px+1 + px−1 ) if d = 1, 6 (N −1 − γ S)−1 Je1 =
d
G N (x − y) px V j (qy+e1 − qy ), j
j
j
(83)
j=1 y
where G N (z) is the solution of the resolvent equation ⎧ " 1! ⎪ ⎪ N −1 G N (z) − 2γ (G N )(z) = − δ0 (z) + δe1 (z) , d ≥ 2 ⎪ ⎪ ⎪ 2 ⎨ γ −1 G (z) − )(z) + (G N )(z + 1) + (G N )(z − 1)] N [4(G N N ⎪ 6 ⎪ ⎪ ⎪ ⎪ ⎩ = − 1 [δ0 (z) + δ1 (z)] , d = 1. 2
(84)
The left-hand side of (82) is equal to − 5T N d+1
d j=i
. / j j j j (G N (x) + G N (x + e1 )) V j (qx+e1 − qx )V j (qe1 − q0 )
x
N ,T
. (85)
• Pinned case.
/ . j j j j In the pinned case, the correlations V j (qx+e1 − qx )V j (qe1 − q0 )
nentially in x, 1. / 11 1 j −c|x| 1 V (qx+e − qxj )V (qej − q j ) 1 . j 1 0 N ,T 1 ≤ Ce 1 1 j It follows that the previous expression is bounded by |G N (x) + G N (x + e1 )|e−c|x| . C T 2t N d x
N ,T
decay expo-
(86)
Thermal Conductivity for a Momentum Conservative Model
89
Since G N is bounded in d ≥ 3, it follows that (81) is uniformly bounded in N . In low dimensions, our estimates are too rough and we obtain only diverging upper-bounds. Nevertheless, if V j (r ) = α j r 2 are quadratics and W j are general but strictly positive then . / j j j j V j (qx+e1 − qx )V j (qe1 − q0 ) N ,T 5 6 j j j j j j (87) = α j 2 < qx q0 > N ,T − < qx−e1 q0 > N ,T − < qx+e1 q0 > N ,T . As a function of x, this quantity is a Laplacian in the first direction and by integration by parts, the left-hand side of (81) is upper bounded by |(G N )(x) + (G N )(x + e1 )| e−c|x| . C (88) x
By Lemma 3, this quantity is uniformly bounded in N . • Unpinned case. In the unpinned case, we assume that 0 < c ≤ V j (q) ≤ C < +∞. We have (cf. [9], Theorem 6.2, that can be proved in finite volume uniformly) 1. / 11 1 j −d 1 V (qx+e − qxj )V (qej − q j ) 1 (89) j 1 0 N ,T 1 ≤ C|x| . 1 1 j In the one dimensional case, the random variables r x = qx+1 − qx are i.i.d. and < V (r x ) > N ,T = 0. Only the term corresponding to x = 0 remains in the sum of (85). By Lemma 3, we get the upper bound . / √ ≤ C N. (90) (G N (0) + G N (1)) V (r02 ) N ,T
For the unpinned two dimensional case, we obtain the upper bound |G N (x) + G N (x + e1 )||x|−d C x∈Z2N
≤ C log N
|x|−2
x∈Z2N
∼ C(log N )2 . For the case d ≥ 3, we use the first point of Lemma 3, (89) and the fact that |x|−d ∼ log N .
(91)
(92)
x∈ZdN
Lemma 3. Let G N be the solution of the discrete equation (84). There exists a constant C > 0 independent of N such that • • • •
G N (x) ≤ C(|x|d−2 + N −1/2 ), d ≥ 3 G N (x) ≤ C √ log N , d = 2 G N (x) ≤ C N , d = 1 |G N (x + e1 ) + G N (x − e1 ) − 2G N (x)| ≤ C, d ≥ 1.
90
G. Basile, C. Bernardin, S. Olla
Proof. In the proof, C is a constant independent of N but which can change from line to line. We first treat the case d ≥ 3. We use Fourier’s transform representation of G N : G N (x) = −
−2iπ k·x/N 1 2iπ k1 /N e , (1 + e ) 2N d θ N (k/N ) d
(93)
k∈Z N
where θ N (u) = N −1 + 8γ form:
d
j=1 sin
2 (π u j ).
G N can also be written in the following
1 G N (x) = − [FN (x) + FN (x − e1 )] , 2
(94)
where 1 e−2iπ k·x/N . Nd θ N (k/N ) d
FN (x) =
(95)
k∈Z N
Let us introduce the continuous Fourier’s transform representation of the Green function F∞ on Zd given by: exp(2iπ x · u) F∞ (x) = du, (96) θ (u) [0,1]d
where θ (u) = 8γ dj=1 sin2 (π u j ). Remark that F∞ is well defined because d ≥ 3. We have to prove there exists a constant C > 0 independent of N such that FN (x) ≤ C(|x|d−2 + N −1/2 ).
(97)
Observe that by symmetries of FN , we can restrict our study to the case x ∈ [0, N /2]d . We want to show that FN (x) is well approximated by F∞ (x). We have N N (x) + F∞ (x) − F∞ (x), FN (x) − F∞ (x) = FN (x) − F∞
(98)
where
exp(2iπ x · u) du. θ N (u)
N (x) = F∞ [0,1]d
(99)
9 For each k ∈ ZdN , we introduce the hypercube Q k = dj=1 [k j /N , (k j + 1)/N ) and we divide [0, 1]d following the partition ∪k∈Zd Q k . By using this partition, we get N
N FN (x) − F∞ (x) =
k∈ZdN Q k
du
e2iπ k·x/N − e2iπ u·x θ N (k/N )
+ Qk
due2iπ u·x
(
) 1 1 − . θ N (k/N ) θ N (u)
(100)
Thermal Conductivity for a Momentum Conservative Model
Remark that
due2iπ u·x =
91
e2iπ k·x/N ϕ(x/N ), Nd
(101)
Qk
where ϕ(u) =
d :
e2iπ u
d : sin(π u j ) . (π u j )
j
j=1
(102)
j=1
It follows that the first term on the right-hand side of (100) is equal to (1 − ϕ(x/N ))FN (x) so that FN (x) =
( ) N (x) 1 F∞ 1 1 . due2iπ u·x + − ϕ(x/N ) ϕ(x/N ) θ N (k/N ) θ N (u) d
(103)
(104)
k∈Z N Q k
The next step consists to show that the second term on the right-hand side of (104) is small. In the sequel, C is a positive constant independent of N but which can change from line to line. For each u ∈ Q k , we have sin2 (π u j ) − sin2 (π k j /N ) = π sin(2π c j )(u j − k j /N ).
(105)
for some c j ∈ [k j /N , (k j + 1)/N ). Consequently, we have | sin2 (π u j ) − sin2 (π k j /N )| ≤
C | sin(π k j /N )|. N
(106)
Moreover, there exists a positive constant C such that ∀k ∈ ZdN , ∀u ∈ Q k , θ N (u) ≥ Cθ N (k/N ).
(107)
It follows that the modulus of the second term on the right-hand side of (104) is bounded by d 1 N −1 | sin(π k j /N )| C . |ϕ(x/N )| Nd θ N (k/N )2 d
(108)
k∈Z N
j=1
Since the modulus of the function ϕ(u) is bounded below by a positive constant on [0, 1/2]d , this last term is of the same order as N
−1
d j=1
[0,1]d
| sin(π u j )| du. θ N (u)2
(109)
Elementary standard analysis shows that this term is of the same order as N
−1
1 0
rd dr. + r 2 )2
(N −1
(110)
92
G. Basile, C. Bernardin, S. Olla
For d ≥ 4, this term is clearly of order N −1 . For d = 3, the change of variables r = N −1/2 v gives an integral of order N −1 log N . In conclusion, we proved F N (x) FN (x) = ∞ +O ϕ(x/N )
(
) log N . N
(111)
Moreover, it is not difficult to show that N |F∞ (x) − F∞ (x)| ≤ C N −1/2 .
(112)
Since we have (cf. [14], Theorem 4.5) F∞ (x) ≤ C|x|2−d
(113)
we obtained the first point of the lemma. For the 1- and 2-dimensional estimates, we have that |G N (x)| ≤ G N (0) and by standard analysis, there exists a constant C > 0 independent of N such that G N (0) ≤ C
dk [0,1/2]d
N −1
+
d
1
j=1 sin
2 (π k)
.
(114)
By using the inequality sin2 (π u) ≥ 4u 2 , one gets G N (0) is of same order as dk [0,1/2]d
1 . N −1 + |k|2
(115)
√ This last quantity is of order N if d = 1 and log N if d = 2. Let us now prove the final statement. Assume d ≥ 2 (the case d = 1 can be proved in a similar way). We have |G N (x + e1 ) + G N (x − e1 ) − 2G N (x)| 1 1 1 1 1 2 1 −2iπ k·x/N e 1 1 2iπ k1 /N 2 (1 + e ) sin (π k1 /N ) =1 d 1 1N 1 θ (k/N ) N d 1 1 k∈Z N ≤
4 sin2 (π k1 /N ) Nd θ N (k/N ) d k∈Z N
≤ (2γ )−1 .
(116)
Thermal Conductivity for a Momentum Conservative Model
93
7. Appendix: Equivalence of Ensembles In this part, we establish a result of equivalence of ensembles for the microcanonical measure < · > N ,E , since it does not seem to appear in the literature. The decomposition in normal modes permits to obtain easily the results we need from the classical equivalence of the ensemble for the uniform measure on the sphere. This last result proved in [10] says that the expectation of a local √ function in the microcanonical ensemble (the uniform measure on the sphere of radius k in this context) is equal to the expectation of the same function in the canonical ensemble (the standard gaussian measure on R∞ ) with an error of order k −1 . In fact, the equivalence of ensembles of Diaconis and Freedman is expressed in terms of a very precise estimate of variation distance between the microcanonical ensemble and the canonical ensemble. In this paper, we need to consider equivalence of ensembles for unbounded functions and to be self-contained we prove in the following lemma a slight modification of estimates of [10]. Lemma 4. Let λrnn 1/2 be the uniform measure on the sphere # Srnn 1/2 = (x1 , . . . , xn ) ∈ Rn ;
n =1
0 x2 = nr 2
of radius r and dimension n − 1 and λr∞ the Gaussian product measure with mean 0 and variance r 2 . Let θ > 0 and φ be a function on Rk such that |φ(x1 , . . . , xk )| ≤ C
2 k =1
3θ x2
, C > 0.
There exists a constant C (depending on C, θ, k, r ) such that 1 1 lim sup n 1λrnn 1/2 (φ) − λr∞ (φ)1 ≤ C .
(117)
(118)
n→∞
Proof. This lemma is proved in [10] for φ positive bounded by 1. Without loss of generality, we can assume r = 1 and we simplify the notations by denoting λrnn 1/2 with λn and λr∞ with λ∞ . The law of (x1 + . . . + xk )2 under λn is n times a β[k/2, (n − k)/2] distribution and has density (cf. [10]) f (u) = 1{0≤u≤n} ·
( )(k/2)−1 ( ) u ((n−k)/2)−1 (n/2) u 1 1− . (119) n (k/2)[(n − k)/2] n n
On the other hand, the law of (x1 + . . . + xk )2 under λ∞ is χk2 with density (cf. [10]) g(u) =
1 2k/2 (k/2)
e−u/2 u (k/2)−1 .
(120)
With these notations, we have 1 1 n 1λ (φ) − λ∞ (φ)1 ≤ C
∞ 0
u θ | f (u) − g(u)|du.
(121)
94
G. Basile, C. Bernardin, S. Olla
The RHS of the inequality above is equal to ∞ 2C
u
θ
(
)+ ∞ f (u) − 1 g(u)du + C u θ (g(u) − f (u))du. g(u)
0
(122)
0
(
)+ f (u) In [10], it is proved 2 − 1 ≤ 2(k +3)/(n −k −3) as soon as k ∈ {1, . . . , n −4}. g(u) The second term of (122) can be computed explicitly and is equal to * + ((2θ + k)/2) θ n θ (n/2) 2 − . (123) (k/2) (θ + n/2) A Taylor expansion shows that this term is bounded by C /n for n large enough.
We recall here the following well known properties of the uniform measure on the sphere. Lemma 5 (Symmetry properties of the uniform measure on the sphere). Let λrk be the uniform measure on the sphere # 0 k Srk = (x1 , . . . , xk ) ∈ (Rd )k ; x2 = r 2 =1
of radius r and dimension dk − 1. i) λrk is invariant by any permutation of coordinates. ii) Conditionally to {x1 , . . . , xk }\{xi }, the law of xi has an even density w.r.t. the Lebesgue measure on Rd . In the same spirit, we have the following lemma. Lemma 6. Let µrk be the uniform measure on the surface defined by # 0 k k k d k 2 2 Mr = (x1 , . . . , xk ) ∈ (R ) ; x = r ; x = 0 . =1
=1
We have the following properties: i) µrk is invariant by any permutation of the coordinates. j
ii) If i = j ∈ {1, . . . , d} then for every h, ∈ {1, . . . , k} (distinct or not), µrk (xhi x ) = 0. iii) If h = ∈ {1, . . . , k} and i ∈ {1, . . . , d}, µrk (xhi xi ) = −
µk (x2 ) µk (x2 ) r2 =− r h =− r . dk(k − 1) k−1 k−1
(124)
Lemma 7. (Equivalence of ensembles.) Consider the (α, ν)-harmonic case. There exists a positive constant C = C(d, E) such that:
Thermal Conductivity for a Momentum Conservative Model
95
1 1, 1 C E 2 11 1 j i 2 i) If i = j, 1 p0 pe1 − 21 ≤ d . 1 d 1 N N ,E 1 1. 1 i i j j / 1 1≤ C . ii) If i = j, 11 ( p0 pe1 p0 pe1 ) 1 Nd N ,E iii) For any i and any y ∈ ZdN , we have 1 1 ( )2 1. 1 Clog N / E 1 j j 1 j j 2 − N (y)1 ≤ . 1 qy (q−e1 − qe1 )( p0 ) 1 1 N ,E d Nd Proof. Let us treat only the unpinned case ν = 0. The pinned case is similar. We take the Fourier transform of the positions and of the momentums (defined by (70)) and we define ˜ ) = (1 − δ(ξ ))ω(ξ )q(ξ ˆ ), p(ξ ˜ ) = N −d/2 (1 − δ(ξ ))p(ξ ˆ ), ξ ∈ ZdN , q(ξ
(125)
4 where ω(ξ ) = 2N −d/2 α dk=1 sin2 (π ξ k /N ) is the normalized dispersion relation. The factor 1 − δ in the definition above is due to the condition x px = x qx = 0 assumed in the microcanonical state. Then the energy can be written as 6 1 5 ˜ )|2 + |q(ξ ˜ )|2 |p(ξ 2 ξ =0 6 1 5 2 ˜ )) + Im 2 (p(ξ ˜ )) + Re2 (q(ξ ˜ )) + Im 2 (q(ξ ˜ ) . = Re (p(ξ 2
HN =
ξ =0
˜ Re(q) ˜ are even and Im(p), ˜ Im(q) ˜ are odd: Since px , qx are real, Re(p), ˜ ) = Re(p)(−ξ ˜ ˜ ) = Re(q)(−ξ ˜ Re(p)(ξ ), Re(q)(ξ ), ˜ ) = −Im(p)(−ξ ˜ ˜ ) = −Im(q)(−ξ ˜ Im(p)(ξ ), Im(q)(ξ ).
(126)
On ZdN \{0}, we define the relation ξ ∼ ξ if and only if ξ = −ξ . Let UdN be a class of representants for ∼ (UdN is of cardinal (N d − 1)/2). With these notations and by using (126), we have 6 5 ˜ )) + Im 2 (p(ξ ˜ )) + Re2 (q(ξ ˜ )) + Im 2 (q(ξ ˜ ) . Re2 (p(ξ HN = (127) ξ ∈UdN
It follows that in the microcanonical state, the random variables ˜ ), (Im p)(ξ ˜ ), (Req)(ξ ˜ ), Im q)(ξ ˜ ))ξ ∈Ud ((Rep)(ξ
N
√ are distributed according to the uniform measure on the sphere of radius N d E (which is not true without the restriction on the set UdN ). The classical results of equivalence of ensembles for the uniform measure on the sphere ([10]) can be applied for these random variables.
96
G. Basile, C. Bernardin, S. Olla
i) By using inverse Fourier transform and (126), we have ,
j
p0 pei 1
2 -
1 = 2d N N ,E
.
p˜ j (ξ ) p˜ j (ξ ) p˜ i (η) p˜ i (η )
ξ,ξ ,η,η =0
/
2iπ e1 · (η + η ) N e . −
N ,E
(128) It is easy to check by using (ii) of Lemma 5 that the only terms in this sum which are nonzero are only for ξ = −ξ and η = −η . One gets hence ,
2 j p0 pei 1
N ,E
, 1 11 j 112 11 i 112 = 2d . 1 p˜ (ξ )1 1 p˜ (η)1 N N ,E
(129)
ξ,η=0
Classical equivalence of ensembles estimates of [10] show that this last sum is equal to (E/d)2 + O(N −d ). ii) Similarly, one has .
j
j
( p0i pei 1 p0 pe1 )
/ N ,E
=
1 N 2d
.
p˜ i (ξ ) p˜ i (ξ ) p˜ j (η) p˜ j (η )
/
ξ,xi ,η,η =0
( ) 2iπ e1 · (ξ + η ) . × exp − N
N ,E
(130)
It is easy to check by using (ii) of Lemma 5 that the only terms in this sum which are nonzero are for ξ = −ξ and η = −η. One gets hence .
j
j
( p0i pei 1 p0 pe1 )
/ N ,E
=
, 1 11 i 112 11 j 112 p ˜ p ˜ (ξ ) (η) 1 1 1 1 N 2d N ,E ξ,η=0 ) ( 2iπ e1 · (ξ +η) . × exp N
(131)
Using classical equivalence of ensembles estimates ([10]), one obtains .
/
⎛
E2 ⎜ 1 j j ( p0i pei 1 p0 pe1 ) = 2⎝ d e N ,E d N
⎞2 2iπ e1 ·ξ ⎟ −d −d N ⎠ + O(N ) = O(N ). (132)
ξ =0
iii) By using the symmetry properties, we have . / q˜ j (ξ )q˜ j (ξ ) p˜ j (η) p˜ j (η )
N ,E
=0
Thermal Conductivity for a Momentum Conservative Model
97
for ξ = −ξ or η = −η . Hence one has / . j j j q x q z ( p 0 )2 1 = 3d N
N ,E
. / q˜ j (ξ )q˜ j (ξ ) p˜ j (η) p˜ j (η )
ξ,ξ ,η,η =0
N ,E
exp (−2iπ(ξ · z + ξ · y)/N ) ω(ξ )ω(ξ )
, 12 - exp (−2iπ ξ · (z − y)/N ) 1 11 j 1 i q ˜ (ξ ) p ˜ (η) 1 1 N 3d ω(ξ )2 N ,E ξ,η=0 , 12 - exp (−2iπ ξ · (z − y)/N ) 1 11 j 1 j q ˜ = 2d (ξ ) p ˜ (e ) , 1 1 1 N ω(ξ )2 N ,E =
ξ =0
Estimates of [10] give 1 ( )2 11 1. / C E 1 1 j 2 j 2 − 1 (q˜ (ξ )) ( p˜ (e1 )) 1≤ d. 1 N ,E d 1 N It follows that . / j j j j qy (q−e1 − qe1 )( p0 )2
N ,E
=
E 2 e−2iπ ξ ·(−e1 −y)/N − e−2iπ ξ ·(e1 −y)/N + RN , d N 2d ω(ξ )2 ξ =0
where |R N | ≤ C N −2d
| sin(2π ξ 1 /N )| . d 2 k k=1 sin (π ξ /N ) ξ =0 4α
To obtain iii) observe that 1 e−2iπ ξ ·(−e1 −y)/N − e−2iπ ξ ·(e1 −y)/N = N (y) N 2d ω(ξ )2 ξ =0
and ⎧ ⎪ ⎨log N /N , d = 1 N −2d ∼ 1/N , d = 2 d 2 k ⎪ ⎩1/N d , d ≥ 3. k=1 sin (π ξ /N ) ξ =0 4α | sin(2π ξ 1 /N )|
Acknowledgements. We acknowledge the support of the ANR LHMSHE n.BLAN07-2184264 and of the accord GREFI-MEFI.
98
G. Basile, C. Bernardin, S. Olla
References 1. Basile, G., Bernardin, C., Olla, S.: A momentum conserving model with anomalous thermal conductivity in low dimension. Phys. Rev. Lett. 96, 204303 (2006) 2. Basile, G., Olla, S., Spohn, H.: Energy transport in stochastically perturbed lattice dynamics. http:// arxiv.org/abs/0805.3012, 2008 3. Bernardin, C., Olla, S.: Fourier’s law for a microscopic model of heat conduction. J. Stat. Phys. 121(3/4), 271–289 (2005) 4. Bodineau, T., Helffer, B.: Correlations, Spectral gap and Log-Sobolev inequalities for unbounded spins systems. In: Differential equations and mathematical physics (Birmingham, AL, 1999), AMS/IP Stud. Adv. Math., 16, Providence, RI: Amer. Math. Soc., 2000, pp 51–66 5. Bolsterli, M., Rich, M., Visscher, W.M.: Simulation of nonharmonic interactions in a crystal by selfconsistent reservoirs. Phys. Rev. A 4, 1086–1088 (1970) 6. Bonetto, F., Lebowitz, J.L., Rey-Bellet, L.: Fourier’s law: A challenge to theorists, In: Mathematical Physics 2000, Fokas, A. et al. (eds.), London, Imperial College Press, 2000, pp. 128–150 7. Bonetto, F., Lebowitz, J.L., Lukkarinen, J.: Fourier’s Law for a harmonic Crystal with Self-Consistent Stochastic Reservoirs. J. Stat. Phys. 116, 783–813 (2004) 8. Bricmont, J., Kupianen, A.: Towards a Derivation of Fouriers Law for Coupled Anharmonic Oscillators. Comm. Math. Phys. 274(3), 555–626 (2007) 9. Deuschel, J.D., Delmotte, T.: On estimating the derivative of symmetric diffusions in stationary random environment, with pplications to ∇φ interface model. Prob. Theory Relat. Fields 133, 358–390 (2005) 10. Diaconis, P., Freedman, D.: A dozen de Finetti style results in search of a theory. Ann. Inst. H. Poincaré (Probabilités Et Statistiques), 23, 397–423 (1987) 11. Ikeda, N., Watanabe, S.: Stochastic differential equations and diffusion processes, North-Holland Mathematical Library, 24. Amsterdam: North-Holland Publishing Co., 1989 12. Jara, M., Komorowski, T., Olla, S.: Limit theorems for additive functionals of a Markov chain. http:// arxiv.org/abs/0809.0177, 2008 13. Lepri, S., Livi, R., Politi, A.: Thermal Conduction in classical low-dimensional lattices. Phys Rep. 377, 1– 80 (2003) 14. Mangad, M.: Asymptotic expansions of Fourier transforms and discrete polyharmonic Green’s functions. Pacific J. Math. 20, 85–98 (1967) 15. Lebowitz, J.L., Lieb, E., Rieder, Z.: Properties of harmonic crystal in a stationary non-equilibrium state. J. Math. Phys. 8, 1073–1078 (1967) 16. Sethuraman, S.: Central limit theorems for additive functionals of the simple exclusion process. Ann. Probab. 28(1), 277–302 (2000) 17. Spohn, H.: Large Scale Dynamics of interacting Particles. Berlin-Heidelberg-New York: Springer, 1991 Communicated by A. Kupiainen
Commun. Math. Phys. 287, 99–115 (2009) Digital Object Identifier (DOI) 10.1007/s00220-008-0621-3
Communications in
Mathematical Physics
Incompressible Flow Around a Small Obstacle and the Vanishing Viscosity Limit Drago¸s Iftimie1 , Milton C. Lopes Filho2 , Helena J. Nussenzveig Lopes2 1 Université de Lyon, Université Lyon 1, CNRS, UMR 5208 Institut Camille Jordan,
Bâtiment du Doyen Jean Braconnier, 43, Blvd du 11 Novembre 1918, F–69622 Villeurbanne Cedex, France. E-mail:
[email protected]
2 Departamento de Matemática, IMECC, Universidade Estadual de Campinas - UNICAMP,
Caixa Postal 6065, Campinas, SP 13083-970, Brazil. E-mail:
[email protected];
[email protected] Received: 31 January 2008 / Accepted: 8 April 2008 Published online: 11 October 2008 – © Springer-Verlag 2008
Abstract: In this article we consider viscous flow in the exterior of an obstacle satisfying the standard no-slip boundary condition at the surface of the obstacle. We seek conditions under which solutions of the Navier-Stokes system in the exterior domain converge to solutions of the Euler system in the full space when both viscosity and the size of the obstacle vanish. We prove that this convergence is true assuming two hypotheses: first, that the initial exterior domain velocity converges strongly in L 2 to the full-space initial velocity and second, that the diameter of the obstacle is smaller than a suitable constant times viscosity, or, in other words, that the obstacle is sufficiently small. The convergence holds as long as the solution to the limit problem is known to exist and stays sufficiently smooth. This work complements the study of incompressible flow around small obstacles, which has been carried out in [4–6].
1. Introduction The purpose of the present work is to study the asymptotic behavior of families of solutions of the incompressible Navier-Stokes equations, in two and three space dimensions, in the exterior of a single smooth obstacle, when both viscosity and the size of the obstacle become small. More precisely, let be a smooth and bounded domain in Rn , n = 2, 3, such that is connected and simply connected if n = 2 and R3 \ is connected and simply connected if n = 3. Let ε > 0 and set ε = Rn \ε. Let u 0 be a smooth, divergence-free vector field in Rn , which gives rise to a smooth solution u of the Euler equations, defined on an interval [0, T ]. Let u ν,ε ∈ L ∞ ((0, T ); L 2 (ε )) ∩ Cw0 ([0, T ); L 2 (ε )) ∩ L 2 ((0, T ); H01 (ε )) be a weak Leray solution of the incompressible Navier-Stokes equations, with viscosity ν, in ε , satisfying the no-slip boundary condition at ∂ε . We prove that there exists a constant C = C(u 0 , , T ) > 0 such that, if the following hypothesis holds:
100
D. Iftimie, M. C. Lopes Filho, H. J. Nussenzveig Lopes
[H] We have that sup u ν,ε (·, 0) − u 0 L 2 (ε ) → 0,
ε≤Cν
as ν → 0, then we have that supε≤Cν u ν,ε − u L ∞ ((0,T );L 2 (ε )) → 0, as ν → 0. Furthermore, if we assume that [H] occurs at a certain rate in ν we can obtain an explicit error estimate in L 2 . In addition, we prove that if we fix an initial vorticity ω0 in R2 , smooth and compactly supported in R2 \{0} and consider u ν,ε (·, 0) = K ε [ω0 ] + m H ε , where K ε denotes the Biot-Savart operator in ε , while H ε is the normalized generator of the harmonic vector fields in ε , and m = ω0 , then Hypothesis [H] is satisfied. In the case of dimension three, if we fix an initial vorticity ω0 in R3 , smooth, divergence-free and compactly supported in R3 \{0} and consider u ν,ε (·, 0) = K ε [ω0 ], where K ε again denotes the Biot-Savart operator in ε , then it is proved in [4] that Hypothesis [H] is satisfied. In both cases we have rates √ for the convergence of the initial data in such a way that u ν,ε − u L 2 (ε ) = O( ν) when ν → 0, uniformly in time. A central theme in incompressible hydrodynamics is the vanishing viscosity limit, something naturally associated with the physical phenomena of turbulence and of boundary layers. In particular, a natural question to ask is whether the limiting flow associated with the limit of vanishing viscosity satisfies the incompressible Euler equations. This is known to be true in the absence of material boundaries, see [1,18] for the two dimensional case and [9,24] for the three dimensional case. Also, if the boundary conditions are of Navier type, see [2,8,17,28], noncharacteristic, see [26] or for certain symmetric 2D flows, see [15,16,19], convergence to an Euler solution remains valid. The most relevant case from the physical point of view corresponds to no slip boundary conditions. In this case, we have results on criteria for convergence to solutions of the Euler system, see [10,11,25,27], and also results when the data for the boundary layer equations are analytic, see [13,21–23], but the general problem remains wide open. To be a bit more precise, let us assume that u 0 is a solution of the Euler equations in the exterior domain and that u ν is a solution of the Navier-Stokes equations with viscosity ν, with no-slip boundary condition in . Suppose further that u ν and u 0 have the same initial velocity v0 and that both u 0 and the family {u ν } are smooth, defined on a fixed time interval [0, T ]. It is easy to see that δ E(ν, t) ≡ u 0 (·, t) − u ν (·, t) L 2 () is uniformly bounded in ν and t ∈ [0, T ] (by 2v0 L 2 if v0 has finite energy), but it is not known whether δ E → 0 when ν → 0. In fact, given the experimentally and numerically observed behavior of high Reynolds number flows in the presence of boundaries, it is reasonable to conjecture that δ E does not, in general, vanish as ν → 0; see, for instance, Sect. 15.6 of [20] for illustrations of high Reynolds number flow past a cylinder. Of course, this leaves open the possibility that u ν might approach another solution of the Euler equations, different from u 0 . This article contains an answer to the following question: can we make δ E small, by making both the viscosity and the obstacle small? This problem was one of the main motivations underlying the authors’ research on incompressible flow around small obstacles. Our previous results include the small obstacle limit for the 2D inviscid equations, see [5,14] and for the viscous equations, see [4,6]. The work we present here is a natural outgrowth of this research effort.
Vanishing Viscosity Limit Around a Small Obstacle
101
The remainder of this article is divided into three sections. In Sect. 2, we state and prove our main result, namely the convergence in the small viscosity and small obstacle limit, assuming convergence of the initial data. In Sect. 3 we study the problem of convergence of the initial data: for two space dimensions, we adapt techniques developed in our previous work, while in the three dimensional case we refer the reader to recent work by D. Iftimie and J. Kelliher, see [4]. In Sect. 4, we interpret the smallness condition on the obstacle as the condition that the local Reynolds number stays below a certain (small) constant. In addition, still in Sect. 4, we obtain an enstrophy estimate for the wake generated by the small obstacle and we list some open problems. 2. Main Theorem We use the notation from the Introduction to state and prove our main result. We consider the initial-value problem for the Navier-Stokes equations in ε , with no-slip boundary condition, given by: ⎧ ν,ε ∂ u + u ν,ε · ∇u ν,ε = −∇ p ν,ε + νu ν,ε , in ε × (0, ∞), ⎪ ⎨ t ν,ε div u = 0, in ε × [0, ∞), (1) ν,ε (x, t) = 0, u for x ∈ ∂ε , t > 0, ⎪ ⎩ ν,ε ε u (t = 0) = ϑ (x), for x ∈ ε , t = 0. We assume that the initial velocity ϑ ε ∈ L 2loc (ε ) is divergence-free and tangent to ∂ε , but we do not assume that it satisfies the no-slip boundary condition. In three dimensions we assume further that ϑ ε ∈ L 2 (ε ). Under these hypotheses it was shown by H. Kozono and M. Yamazaki, see [12], that, in two dimensions, there is a unique global strong solution to (1) with initial velocity ϑ ε , while, in three dimensions, there is a global Leray weak solution u ν,ε of (1), see [3]. More precisely, in three dimensions there exists u ν,ε ∈ L ∞ ([0, ∞); L 2 (ε )) ∩ Cw0 ([0, ∞); L 2 (ε )) ∩ L 2loc ([0, ∞); H01 (ε )) such that u ν,ε is a distributional solution of (1) and the following energy inequality holds true: t u ν,ε (t) L 2 (ε ) + 2ν ∇u ν,ε (s) L 2 (ε ) ds ≤ u ε0 L 2 (ε ) ∀t ≥ 0. (2) 0
ϑε
u ν,ε (·, t)
Both and are defined only in ε , but we will consider them as defined on the whole space by extending them to be identically zero inside ε. Let u 0 be a smooth, divergence-free vector field defined in all Rn , and let u be the corresponding smooth solution of the Euler equations; in two dimensions u is globally defined while in three dimensions it is defined, at least, on an interval [0, T ]. We are now ready to state our main result. Theorem 1. Assume that ϑ ε − u 0 L 2 (Rn ) → 0 as ε → 0. Fix T > 0, arbitrary if n = 2, and smaller than the time of existence of the smooth Euler solution if n = 3. Then there exists a constant C1 = C1 (, u 0 , T ) such that, if ε ≤ C1 ν, then u ν,ε (·, t) − u(·, t) L 2 (Rn ) → 0 as ν → 0.
102
D. Iftimie, M. C. Lopes Filho, H. J. Nussenzveig Lopes
√ Moreover, if we assume that ϑ ε − u 0 L 2 (Rn ) = O( ν), then there exists also C2 = C2 (T, u 0 , ) such that √ u ν,ε (·, t) − u(·, t) L 2 (Rn ) ≤ C2 ν, for all 0 < ε < C1 ν and all 0 ≤ t ≤ T . Before we proceed with the proof, we require two technical lemmas. To state the first lemma we must introduce some notation. As in the statement of the theorem, u denotes the smooth Euler solution in Rn . In dimension two, we denote by ψ = ψ(x, t) the stream function for the velocity field u, chosen so that ψ(0, t) = 0. In dimension three, ψ denotes the unique divergence free vector field vanishing for x = 0 and whose curl is u. In other words, we set (x − y)⊥ · u(y, t) y ⊥ · u(y, t) ψ(x, t) = dy + dy 2π |x − y|2 2π |y|2 R2 R2 in dimension two so that u = ∇ ⊥ ψ and x−y y × u(y, t)dy − × u(y, t)dy ψ(x, t) = − 3 3 R3 4π |x − y| R3 4π |y| in dimension three so that u = curl ψ. In both two and three dimensions one has that ψ and ∇ψ are uniformly bounded on the time interval [0, T ]. Let R > 0 be such that the ball of radius R, centered at the origin, contains . Let ϕ = ϕ(r ) be a smooth function on R+ such that ϕ(r ) ≡ 0 if 0 ≤ r ≤ R + 1, ϕ ≥ 0 and ϕ(r ) ≡ 1 if r ≥ R + 2. Set ϕ ε = ϕ ε (x) = ϕ(|x|/ε) and u ε = ∇ ⊥ (ϕ ε ψ) in dimension two and u ε = curl(ϕ ε ψ) in dimension three. In both dimensions two and three, the vector field u ε is divergence free and vanishes in a neighborhood of the boundary. We also re-define the pressure p = p(x, t) from the Euler equation in Rn with data u 0 so that p(0, t) = 0. Lemma 2. Fix T > 0. There exist constants K i > 0, i = 1, . . . , 5 such that, for any 0 < ε < ε0 and any 0 ≤ t < T we have: (1) (2) (3) (4) (5)
∇u ε 2L 2 ≤ K 1 , u ε L ∞ ≤ K 2 , u ε − u L 2 + u ε − ϕ ε u L 2 ≤ K 3 ε, ∇ψ∇ϕ ε L ∞ + ψ∇ 2 ϕ ε L ∞ ≤ K 4 /ε, p∇ϕ ε L 2 + ∂t ψ∇ϕ ε L 2 ≤ K 5 ε.
Above, we used the notation ∇ψ∇ϕ ε L ∞ = i, j ∂i ψ∂ j ϕ ε L ∞ in dimension two and ∇ψ∇ϕ ε L ∞ = i, j,k ∂i ψk ∂ j ϕ ε L ∞ in dimension three. Similar notations were used for the other terms.
Vanishing Viscosity Limit Around a Small Obstacle
103
Proof. Some of the inequalities above can be improved in dimension three. However, it turns out that these improvements have no effect on the statement of Theorem 1. Therefore, to avoid giving separate proofs in dimension three we choose to state these weaker estimates. Recall that both u and ∇u are uniformly bounded. First we write ∂i u ε = ∂i ∇ ⊥ (ϕ ε ψ) = u∂i ϕ ε + ∂i ψ∇ ⊥ ϕ ε + ψ∂i ∇ ⊥ ϕ ε + ϕ ε ∂i u in dimension two and ∂i u ε = ∂i curl(ϕ ε ψ) = u∂i ϕ ε + ∇ϕ ε × ∂i ψ + ∂i ∇ϕ ε × ψ + ϕ ε ∂i u in dimension three. The supports of the first three terms of the right-hand sides of the relations above are contained in the annulus ε(R + 1) < |x| < ε(R + 2), whose Lebesgue measure is O(ε2 ). Furthermore, |∇ϕ ε | = O(1/ε), |∇ 2 ϕ ε | = O(1/ε2 ) and |ψ(x, t)| = O(ε) for |x| < ε(R + 2), since ψ(0, t) = 0. Taking L 2 norms in the expressions above gives the first estimate. Next we observe that u ε = ϕ ε u + ψ∇ ⊥ ϕ ε or u ε = ϕ ε u + ∇ϕ ε × ψ. Clearly ϕ ε u is bounded and to bound the second term, we use again that ψ(0, t) = 0, which proves the second estimate. For the third estimate, observe that u ε − u and u ε − ϕ ε u are bounded, as we have just proved, and have support in the ball |x| < ε(R + 2). For the fourth estimate, we use again that ψ(0, t) = 0. The last estimate follows from two facts: that the functions whose L 2 -norm we are estimating have support on the ball |x| < ε(R + 2) and that they are both bounded, since p(0, t) = 0 and ψt (0, t) = 0. We also require a modified Poincaré inequality, stated below. Lemma 3. Let be the obstacle under consideration and let R be such that ⊂ B R . Consider the scaled obstacles ε and the exterior domains ε . Then, if W ∈ H01 (ε ) we have W L 2 (ε ∩B(R+2)ε ) ≤ K 6 ε ∇W L 2 (ε ∩B(R+2)ε ) . Proof. The case ε = 1 is standard. The remainder of the proof requires a scaling argument. Let W ∈ H01 (ε ) and set Y = Y (x) = W (εx). Then Y ∈ H01 (1 ). Using the case ε = 1 there exists a constant K 6 such that Y L 2 (1 ∩B R+2 ) ≤ K 6 ∇Y L 2 (1 ∩B R+2 ) . Undoing the scaling we find: Y 2L 2 ( ∩B ) 1 R+2 ∇Y 2L 2 (
1 ∩B R+2 )
= =
|W (εx)| d x = 2
1 ∩B R+2 1 ∩B R+2
W 2L 2 (
ε ∩B(R+2)ε )
εn
;
ε2 |∇W (εx)|2 d x = ε2−n ∇W 2L 2 (
ε ∩B(R+2)ε )
.
The desired result follows immediately. We are now ready to prove Theorem 1. Proof of Theorem 1. We begin by noting that, since u is a smooth solution of the Euler equations in Rn × [0, T ], it follows that √ u ν,ε (·, t) − u(·, t) L 2 (ε) ≡ u(·, t) L 2 (ε) ≤ Cε ≤ C ν, (3) if ε < Cν. Hence it remains only to estimate the L 2 -norm of the difference in ε , which we do below.
104
D. Iftimie, M. C. Lopes Filho, H. J. Nussenzveig Lopes
We first give the proof in two dimensions and then we indicate how the proof should be adapted to three dimensions.
2.1. Case n = 2. The vector field u ε is divergence free and satisfies the equation u εt = −ϕ ε u · ∇u − ϕ ε ∇ p + ∂t ψ∇ ⊥ ϕ ε . We set W ν,ε ≡ u ν,ε − u ε . The vector field W ν,ε is divergence free, vanishes on the boundary and satisfies: ∂t W ν,ε − νW ν,ε = − u ν,ε · ∇u ν,ε − ∇ p ν,ε + νu ε + ϕ ε u · ∇u + ϕ ε ∇ p − ∂t ψ∇ ⊥ ϕ ε . We perform an energy estimate, multiplying this equation by W ν,ε and integrating over ε . We obtain 1 d W ν,ε 2L 2 + ν∇W ν,ε 2L 2 2 dt = −ν ∇W ν,ε · ∇u ε d x − W ν,ε · [(u ν,ε · ∇)u ν,ε ] d x ε ε ν,ε ε ν,ε ε + W · [(ϕ u · ∇)u] d x + W · ϕ ∇ p dx − W ν,ε · ∂t ψ∇ ⊥ ϕ ε d x. ε
ε
ε
(4) We will examine each one of the five terms on the right-hand-side of identity (4). We look at the first term. We use Cauchy-Schwarz and Young’s inequalities followed by Lemma 2, item (1), to obtain ν
ε
∇W
ν,ε
ν ∇W ν,ε 2L 2 + K 1 . · ∇u d x ≤ 2 ε
(5)
Next we look at the second and third terms together. We write |I| ≡ − W ν,ε · [(u ν,ε · ∇)u ν,ε ] d x + W ν,ε · [(ϕ ε u · ∇)u] d x ε ε ν,ε ν,ε ε ν,ε ε ν,ε ε = − W · [((W + u ) · ∇)(W + u )] d x + W · [(ϕ u · ∇)u] d x ε ε = − W ν,ε · [(W ν,ε · ∇)u ε ] d x − W ν,ε · [(u ε · ∇)u ε ] d x ε ε ν,ε ε + W · [(ϕ u · ∇)u] d x , ε
Vanishing Viscosity Limit Around a Small Obstacle
105
where we used the fact that W ν,ε · [((W ν,ε + u ε ) · ∇)W ν,ε ] = 0. Finally, we add and subtract W ν,ε · [(u ε · ∇)u] to obtain −W ν,ε · (W ν,ε · ∇u ε ) + W ν,ε · [u ε · ∇(u − u ε )] |I| = ε ν,ε ε ε + W · [((ϕ u − u ) · ∇)u] d x ν,ε ν,ε ε ν,ε ε ε ≤ W · (W · ∇u ) d x + W · [u · ∇(u − u )] d x ε ε + W ν,ε · [((ϕ ε u − u ε ) · ∇)u] d x ε = W ν,ε · (W ν,ε · ∇u ε ) d x + (u − u ε ) · [(u ε · ∇)W ν,ε ] d x ε ε ν,ε ε ε + W · [((ϕ u − u ) · ∇)u] d x ε ν,ε ε ν,ε ≤ (W · ∇u ) · W d x + u − u ε L 2 u ε L ∞ ∇W ν,ε L 2 ε
+W ν,ε L 2 ϕ ε u − u ε L 2 ∇u L ∞ . For each i = 1, 2 we have that ∂i u ε = ∂i ψ∇ ⊥ ϕ ε + ψ∂i ∇ ⊥ ϕ ε + ∂i ϕ ε u + ϕ ε ∂i u.
(6)
Therefore, |I| ≤ (∇ψ∇ϕ ε L ∞ + ψ∇ 2 ϕ ε L ∞ )W ν,ε 2L 2 (A ) + ϕ ε ∇u L ∞ W ν,ε 2L 2 ε
+u − u ε L 2 u ε L ∞ ∇W ν,ε L 2 + W ν,ε L 2 ϕ ε u − u ε L 2 ∇u L ∞ ,
(7)
where Aε is the set ε ∩ B(R+2)ε , which contains the support of ∇ϕ ε . Hence, using Lemma 2, items (2), (3) and (4), together with Lemma 3, in the inequality (7), we find |I| ≤
K4 2 2 ε K 6 ∇W ν,ε 2L 2 + ϕ ε ∇u L ∞ W ν,ε 2L 2 ε +K 2 K 3 ε∇W ν,ε 2L 2 + K 3 ε∇u L ∞ W ν,ε L 2 .
(8)
Next we look at the fourth and fifth terms in (4). Recall that we chose the pressure p in such a way that p(0, t) = 0. We find |J | ≡ W ν,ε · ϕ ε ∇ p d x − W ν,ε · ∂t ψ∇ ⊥ ϕ ε d x ε ε ≤ W ν,ε · p∇ϕ ε d x + W ν,ε · ∂t ψ∇ ⊥ ϕ ε d x . ε
ε
We estimate each term above to obtain, using Lemma 2 item (5), |J | ≤ ( p∇ϕ ε L 2 + ∂t ψ∇ ⊥ ϕ ε L 2 )W ν,ε L 2 ≤ K 5 εW ν,ε L 2 .
(9)
106
D. Iftimie, M. C. Lopes Filho, H. J. Nussenzveig Lopes
We use estimates (5), (8) and (9) in the energy identity (4) to deduce that 1 d ν ν W ν,ε 2L 2 + ν∇W ν,ε 2L 2 ≤ ∇W ν,ε 2L 2 + K 1 + K 2 K 3 ε∇W ν,ε L 2 2 dt 2 2 2 ν,ε 2 ε ν,ε 2 ∞ +K 4 K 6 ε∇W L 2 + ϕ ∇u L W L 2 + ε(K 5 + K 3 ∇u L ∞ )W ν,ε L 2 ≤
ε2 ν ν ν ∇W ν,ε 2L 2 + K 1 + ∇W ν,ε 2L 2 + K 22 K 32 + K 4 K 62 ε∇W ν,ε 2L 2 2 2 4 ν ν,ε 2 2 2
W K ε L2 + 5 . +K 0 W ν,ε 2L 2 + 2 2
(10)
5 = K 5 + K 3 ∇u L ∞ . Above we have used the notation K 0 = supε ϕ ε ∇u L ∞ and K At this point we choose ε so that ν 0 < ε < min ε0 , . (11) 8K 4 K 62 With this choice, letting y = y(t) = W ν,ε 2L 2 , we obtain dy ε2 2 2 ≤ ν K 1 + 2K 22 K 32 + K 5 ε + (2K 0 + 1)y ≤ C 1 ν + C 2 y. dt ν
(12)
From Gronwall’s inequality it follows that
u ν,ε − u ε 2L 2 ( ) ≤ C(T, u 0 , ) ν + ϑ ε − u ε0 2L 2 ( ) . ε
ε
(13)
If ϑ ε − u 0 L 2 → 0 then it follows from (13) together with Lemma 2, item (3), and from (3), that u ν,ε − u L 2 → 0, as desired, where the constant √ C1 can be chosen to be (8K 4 K 62 )−1 . If we assume further that ϑ ε − u 0 L 2 = O( ν), then the second part of the statement of Theorem 1 easily follows. This concludes the proof in the two dimensional case. 2.2. Case n = 3. The proof in dimension three is similar to the previous one. There are two differences: notation and the justification that we can multiply the equation of W ν,ε by W ν,ε . First, about notation. One has to replace everywhere the term ∂t ψ∇ ⊥ ϕ ε by ∇ϕ ε ×∂t ψ and also relation (6) becomes ∂i u ε = ∇ϕ ε × ∂i ψ + ∂i ∇ϕ ε × ψ + ∂i ϕ ε u + ϕ ε ∂i u. These two modifications are just changes of notations. These new terms are of the same type as the old ones, so the estimates that follow are not affected. Second, we multiplied the equation of W ν,ε by W ν,ε . The solution u ν,ε , and therefore ν,ε W too, is not better than L ∞ (0, T ; L 2 (ε ))∩ L 2 (0, T ; H 1 (ε )). But it is well-known that some of the trilinear terms that appear when multiplying the equation of W ν,ε by W ν,ε are not well defined in dimension three with this regularity only. In other words, one cannot multiply directly the equation of W ν,ε by W ν,ε . Nevertheless, there is a classical trick that allows us to perform this multiplication if the weak solution u ν,ε verifies the energy inequality. What we are trying to do, is to subtract the equation of u ε from the
Vanishing Viscosity Limit Around a Small Obstacle
107
equation of u ν,ε and to multiply the result by u ν,ε − u ε . This is the same as multiplying the equation of u ν,ε by u ν,ε , adding the equation of u ε times u ε and subtracting the equation of u ν,ε times u ε and the equation of u ε times u ν,ε . Since u ε is smooth, all these operations are legitimate except for the multiplication of the equation of u ν,ε by u ν,ε . Formally, multiplying the equation of u ν,ε by u ν,ε and integrating in space and time from 0 to t yields the energy equality, i.e. relation (2), where the sign ≤ is replaced by =. Since we assumed that the energy inequality holds true, the above operations are justified provided that the relation we get at the end is an inequality instead of an equality. But an inequality is, of course, sufficient for our purpose. Finally, to be completely rigorous, one has to integrate in time from the beginning. That is, we would obtain at the end relation (12) integrated in time. Clearly, the result of the application of the Gronwall lemma in (12) is the same as in (12) integrated in time. This completes the proof in dimension three. Remark. The proof above is closely related to the proof of Kato’s criterion for the vanishing viscosity limit in bounded domains, see [10]. Both results are based on estimating the difference between Navier-Stokes solutions and Euler solutions by means of energy methods. In Kato’s argument, the difference is estimated in terms of the Navier-Stokes solution, on which Kato’s criterion was imposed. In contrast, our proof estimates the difference in terms of the full-space Euler solution, which is smooth in the context of interest. 3. Compactly Supported Initial Vorticity Now that we are in possession of Theorem 1 we will examine two asymptotic problems for which we can prove the convergence condition on the initial velocity. We focus on flows with compactly supported vorticity, and the diameter of the support of vorticity becomes the order one length scale, relative to which the obstacle is small. Let us begin with the three dimensional case. We consider an initial vorticity ω0 which is assumed to be smooth, compactly supported in R3 \{0}, and divergence-free. Let ε > 0 be sufficiently small so that the support of ω0 is contained in ε . The domain ε is assumed simply connected so that there exists a unique divergence-free vector field, tangent to ∂ε , in L 2 (ε ), whose curl is ω0 , see, for example, [4]. We take ϑ ε to be this unique vector field. We take u 0 to be the unique divergence-free vector field in L 2 (R3 ) whose curl is ω0 , given by the full space Biot-Savart law. In [4], D. Iftimie and J. Kelliher studied the small obstacle asymptotics for viscous flow in ε , for fixed viscosity, in three dimensions. They proved that the small obstacle limit converges to the appropriate Leray solution of the Navier-Stokes equations in the full space. One important ingredient in their proof was precisely to verify strong convergence of the initial data; in our notation, Iftimie and Kelliher proved that 3
ϑ ε − u 0 L 2 (R3 ) = O(ε 2 ), as ε → 0. We may hence apply Theorem 1 to obtain the following corollary. Corollary 4. Let ω0 ∈ Cc∞ (R3 \{0}) and consider u 0 and ϑ ε defined as above. Fix T > 0 and assume that the solution u = u(x, t) of the incompressible Euler equations in R3 , with initial velocity u 0 , exists up to time T . Let u ν,ε be a Leray solution of
108
D. Iftimie, M. C. Lopes Filho, H. J. Nussenzveig Lopes
(1) with initial velocity ϑ ε . Then there exist constants C1 = C1 (, ω0 , T ) > 0 and C2 = C2 (, ω0 , T ) > 0 such that √ u ν,ε (·, t) − u(·, t) L 2 (R3 ) ≤ C2 ν, for all 0 < ε < C1 ν and all 0 ≤ t ≤ T . Next we discuss at length the case n = 2. In dimension two the exterior domain is no longer simply connected. This means that the vorticity formulation of the Euler equations is incomplete, and we must specify the harmonic part of the initial velocity as well as the initial vorticity, see [5] for a thorough discussion of this issue. To specify the asymptotic problem we wish to consider, we must choose the initial data for (1). Let ω0 be smooth and compactly supported in R2 \{0}. Let K denote the operator associated with the Biot-Savart law in the full plane and set H = x ⊥ /(2π |x|2 ), to be its kernel. Let K ε be the operator associated with the Biot-Savart in ε , i.e., K ε = ∇ ⊥ −1 ε , where ε is the Dirichlet Laplacian in ε . Let H ε be the generator of the harmonic vector fields in ε , normalized so that its circulation around ∂ε is one. The divergencefree vector fields in ε with curl equal to ω0 are of the form K ε [ω0 ] + α H ε , with α ∈ R, see [5]. In [6] the authors studied the asymptotic behavior, as ε → 0, of solutions of (1) with ν fixed and initial velocity K ε [ω0 ] + α H ε . It was shown in [6] that u ν,ε converges to a solution of the Navier-Stokes equations in the full plane with initial data K [ω0 ] + (α − m)H , where m = ω0 , as long as |α − m| is sufficiently small. For the vanishing viscosity limit, we must consider only the case α = m. There are two reasons for this. First, K ε [ω0 ] + α H ε converges weakly to K [ω0 ] + (α − m)H in distributions, see Lemma 10 in [6], but, as we shall see, this convergence is not strong in L 2 (see Remark 1 following the proof of the next lemma). Second, one cannot expect solutions of the Euler equations in the full plane with initial velocity K [ω0 ] + (α − m)H to be smooth (even existence is not clear) unless α = m. In view of this discussion, set u 0 = K [ω0 ] and ϑ ε = K ε [ω0 ] + m H ε . With this notation, we can prove strong convergence in L 2 of the initial data, as follows. Lemma 5. Fix ε0 such that the support of ω0 does not intersect ε for any ε < ε0 . There exists a constant C > 0, depending on and ω0 such that ϑ ε − u 0 L 2 (R2 ) ≤ Cε. Proof. We begin the proof with a construction whose details can be found in [5]. In Sect. 2 of [5], an explicit formula for both K ε and H ε can be found in terms of a conformal map T , which takes into the exterior of the unit disk centered at zero. The construction of T and its behavior near infinity are contained in Lemma 2.1 of [5]. Using identities (3.5) and (3.6) in [5], we have that the vector field H ε can be written explictly as H ε = H ε (x) =
1 (T (x/ε))⊥ DT t (x/ε) , 2π ε |T (x/ε)|2
and the operator K ε can be written as an integral operator with kernel Kε , given by Kε =
1 (T (x/ε) − T (y/ε))⊥ (T (x/ε) − (T (y/ε))∗ )⊥ , DT t (x/ε) − 2π ε |T (x/ε) − T (y/ε)|2 |T (x/ε) − (T (y/ε))∗ |2
Vanishing Viscosity Limit Around a Small Obstacle
109
where x ∗ = x/|x|2 denotes the inversion with respect to the unit circle. Furthermore, we recall Theorem 4.1 of [5], from which we obtain ϑ ε L ∞ (ε ) ≤ Cω0 L ∞ ω0 L 1 , 1/2
1/2
for some constant C > 0. To understand the behavior for ε small in the expressions above, we need to understand the behavior of T (x) for large x. We use Lemma 1 in [7], which is a more detailed version of Lemma 2.1 in [5], to find that there exists a constant β > 0 such that T (x/ε) = βxε−1 + h(x/ε),
(14)
with h = h(x) a bounded, holomorphic function on 1 satisfying |Dh(x)| ≤ C/|x|2 . Therefore, |DT (x/ε) − βI| ≤ C
ε2 . |x|2
(15)
We will need a further estimate on the bounded holomorphic function h = h(z) = T (z) − βz, namely that |h(z 1 ) − h(z 2 )| ≤ C
|z 1 − z 2 | , |z 1 ||z 2 |
(16)
for some constant C > 0 independent of z 1 , z 2 . This estimate holds since, by construction (see Lemma 2.1 in [5]), we have that h(z) = g(1/z) with g a holomorphic function on (1 )∗ , whose derivatives are bounded in the closure of (1 )∗ . Here, (1 )∗ denotes the image of 1 through the mapping x → x ∗ = x/|x|2 to which we add {0}. Here, we are using the following fact: If D is a bounded domain with ∂ D a C 1 Jordan curve then any bounded function f ∈ C 1 (D) with bounded derivatives is globally Lipschitz in D. This fact is a nice exercise in basic analysis, which we leave to the reader. Therefore we have 1 |z 1 − z 2 | 1 1 1 ≤C − =C . (17) |h(z 1 ) − h(z 2 )| = g −g z z z z |z ||z | 1
2
1
2
1
2
In order to estimate ϑ ε −u
0 L 2 (ε ) we use the fact that the support of ω0 is contained in ε for ε sufficiently small to write 1 (T (x/ε) − T (y/ε))⊥ (x − y)⊥ DT t (x/ε) ω0 (y) dy − 2π [ϑ ε (x) − u 0 (x)] = |T (x/ε) − T (y/ε)|2 |x − y|2 ε ε 1 (T (x/ε))⊥ t DT (x/ε) + |T (x/ε)|2 ε ε (T (x/ε) − (T (y/ε))∗ )⊥ ω0 (y) dy ≡ Aε + Bε . − |T (x/ε) − (T (y/ε))∗ |2
Let us begin by estimating Bε . We make the change of variables η = εT (y/ε), whose Jacobian is J = | det(DT −1 )(η/ε)|, a bounded function. Additionally, we set z = εT (x/ε). With this we find: ⊥ z (z − ε2 η∗ )⊥ ε t B = DT (x/ε) ω0 (εT −1 (η/ε)) J dη. − 2 |z − ε2 η∗ |2 {|η|>ε} |z|
110
D. Iftimie, M. C. Lopes Filho, H. J. Nussenzveig Lopes
We observe now that there exists ρ independently of ε such that the support of ω0 (εT −1 (η/ε)) is contained in the set {|η| > ρ}. Moreover, one can bound |z − ε2 η∗ | ≥ |z| − ε2 |η∗ | ≥ |z| − ε2 /ρ ≥ |z|/2 provided that ε2 ≤ ρ/2. Therefore we can write ε2 |η∗ | ε2 |ω0 (εT −1 (η/ε))| J dη ≤ C 2 , |Bε | ≤ C 2 ∗ |z| {|η|>ρ} |z||z − ε η | where C depends on the support of ω0 , on the L 1 -norm of ω0 and on the domain through the bounds on the conformal map T and its derivatives. Finally, we use this estimate in the integral of the square of Bε : 1 |Bε |2 d x ≤ Cε4 dz ≤ Cε2 , 4 ε {|z|>ε} |z| as desired. Next we treat Aε . First we re-write Aε in a more convenient form: 1 β (T (x/ε) − T (y/ε))⊥ (x − y)⊥ ε t ω0 (y) dy DT (x/ε) A = − ε |T (x/ε) − T (y/ε)|2 |x − y|2 ε β (x − y)⊥ 1 DT t (x/ε) − I ω0 (y) dy + |x − y|2 ε β ≡ Aε 1 + Aε 2 . By (15), the term Aε 2 can be easily estimated: 1 ε2 ε2 |ω |Aε 2 | ≤ (y)| dy ≤ C , 0 |x|2 ε |x − y| |x|2 so this reduces to an estimate similar to the one we found for Bε . Next we examine Aε 1 . We use the expression for T given in (14) to write (x − y + ( ε )[h( x ) − h( y )])⊥ DT t ( xε ) (x − y)⊥ β ε ε ε A 1= − ω0 (y) dy. β |x − y|2 |x − y + ( βε )[h( xε ) − h( εy )]|2 ε With this we have: |Aε 1 | ≤ C
| βε [h( xε ) − h( εy )]|
ε
|x − y + ( βε )[h( xε ) − h( εy )]||x − y|
|ω0 (y)| dy.
We will make use several times of the estimate we obtained for h given in (17). First |
y ε2 |x − y| ε x
−h . h ≤C β ε ε |β||x||y|
(18)
Using (18) gives |Aε 1 | ≤ C
ε
ε2
|x − y
+ ( βε )[h( xε ) −
h( εy )]||β||x||y|
|ω0 (y)| dy.
Let R, r > 0 be such that the support of ω0 is contained in the disk of radius R and outside the disk of radius r . We will estimate Aε 1 in two regions: |x| ≥ 2R and |x| < 2R.
Vanishing Viscosity Limit Around a Small Obstacle
111
Also, recall that the estimate of the L 2 -norm of Aε 1 is to be performed in ε so we may assume throughout that |x| ≥ Cε. Suppose first that |x| ≥ 2R. Then we find: |Aε 1 | ≤ C
ε2 . |x|2
Above we used that r < |y| ≤ |x|/2 and hence |x − y + ( βε )[h( xε ) − h( εy )]| ≥ C|x| if ε is sufficiently small, since h is bounded. Finally, in the region Cε ≤ |x| < 2R we use (16) and the fact that |y| is of order 1 to bound
y x |x − y| ε h −h ≥ ||x − y| − ε2 (|x − y|/|x||y|)| ≥ |x − y + β ε ε 2 for ε small enough. Therefore ε2 |A 1 | ≤ C |x| ε
Clearly this last portion has
ε
L 2 -norm
ε2 |ω0 (y)| dy ≤ C ≤ Cε. |x − y| |x|
in the region |x| < 2R bounded by Cε.
Remark 1. Let ω0 ∈ Cc∞ (R2 \{0}) does not converge strongly in L 2
and α ∈ R, α = m. We observe that K ε [ω0 ] + α H ε to K [ω0 ] + (α − m)H . We argue by contradiction, assuming this convergence holds. In view of the lemma above, K ε [ω0 ] + m H ε converges strongly to K [ω0 ] so we must have (α − m)H ε → (α − m)H.
This does not hold, as it can be easily seen in the case of the exterior of the disk. In this case, H ε = H outside the disk of radius ε, but H ε vanishes for |x| < ε. Since H L 2 ({|x|<ε}) = ∞, we have a contradiction. Remark 2. Note that if we were willing to confine our analysis to the exterior of a small disk, the proof of Lemma 5 would be much simpler. Indeed, let ε = {|x| > ε}. Then the conformal map T is the identity, so Aε ≡ 0 and all that is needed is the easier estimate for Bε . Remark 3. The constant α − m is precisely the circulation of ϑ ε around the boundary of ε . The condition α − m = 0 is physically reasonable, in particular because viscous flows vanish at the boundary, and therefore, so does their circulation. This is the condition for the small obstacle limit of ideal flow to satisfy Euler equations in the full plane, see [5] and also for the small obstacle limit of viscous flows to satisfy the full plane NavierStokes equations for all viscosities, see [6]. The argument in [6] required sufficiently small α − m to obtain the appropriate limit when ε → 0, and the smallness condition was actually α − m = O(ν) as ν → 0. We conclude this section with the formal statement of a corollary which encompasses Theorem 1 and Lemma 5. Corollary 6. Let ω0 ∈ Cc∞ (R2 \{0}) and consider u 0 and ϑ ε defined as in Lemma 5. Let u = u(x, t) be the global s