Hausdorff dimension of biaccessible angles of quadratic Julia sets and of the Mandelbrot set Henk Bruin (University of Surrey) joint work with Dierk

Transcription

1 Hausdorff dimension of biaccessible angles of quadratic Julia sets and of the Mandelbrot set Henk Bruin (University of Surrey) joint work with Dierk Schleicher (Jacobsuniversität Bremen) 1

2 2 Personae Dramatis: Quadratic polynomials f c (z) = z 2 + c; Basin of : B c ( ) = {z C : f n (z) }; Julia set J c = B c ( ); Mandelbrot set M = {c C : J c is connected}; Riemann map for dynamic plane ϕ c : B c ( ) {z C : z > 1}; R c (ϑ) = ϕ 1 c ({re 2πiϑ : r > 1}) is dynamic ray of angle ϑ; Riemann map for parameter plane ϕ : C \ M {z C : z > 1}; R(ϑ) = ϕ 1 ({re 2πiϑ : r > 1}) is parameter ray of angle ϑ.

3 Figure 1. Left: the kneading sequence of an external angle ϑ (here ϑ = 1/6) is defined as the itinerary of the orbit of ϑ under angle doubling, where the itinerary is taken with respect to the partition formed by the angles ϑ/2, and (ϑ + 1)/2. Right: in the dynamics of a polynomial for which the ϑ-ray lands at the critical value, an analogous partition is formed by the dynamic rays at angles ϑ/2 and (ϑ + 1)/2, which land together at the critical point.

4 4 Dendritic model for Julia sets For every c M, there is a model (J, f) that is combinatorially representing what happens on the true Julia set. J is a dendrite: compact, one-dimensional connected, locally connected space without loops. f : J J is continuous and unicritical: there is a unique critical point 0 such that f is locally homeomorphic away from 0. Notation for critical orbit: c i = f i (0). 0 separates J into two components J 1 c 1 and J 0, and f : J e J is onto for e {0, 1}. f : J J is transitive (hence no superfluous arms). A point x J has valency n if J \ {x} has n components. biaccessible { 1 end point 2 3 branch point

5 5 Symbolic dynamics: Using the partition J = J 0 J 1 {0} we can define symbolic dynamics. The itinerary of z J is 0 if f i (z) J 0 ; e(z) = e 0 e 1 e 2... where e i = 1 if f i (z) J 1 ; if f i (z) = 0; The kneading sequence ν = ν 1 ν 2 ν 3... is the itinerary of the critical point (neglecting the initial ). The ρ-function is defined as ρ = ρ ν : N N { }, ρ ν (n) = inf{k > n : ν k ν k n }. The internal address is the ρ-orbit of 1. 1 = S 0 S 1 S 2... More generally, for fixed itinerary x and kneading sequence ν, define also ρ ν,x (n) := min{k > n : x k ν k n }.

6 6 Biaccessibility: A point is biaccessible if at least two external rays land on it. An angle ϑ is biaccessible if there is another angle ϑ so that their external rays land at the same point. This definition holds both for dynamic and parameter space. Modulo local connectivity, c M is biaccessible if and only if c J c is biaccessible. Theorem 1. Let ν be the kneading sequence of a Julia set J and z J have itinerary e(z) = x. Then the valency of J at z is equal to the number of grand ρ ν,x -orbits. Modulo local connectivity: the valency of c in M is equal to the number of grand ρ-orbits.

7 c 6 c c 3 c 5 8 p 1 p 4 p 0 p 0 p 6 p 3 c 0 = c 13 p 5 c 1 c w c 10 4 c 7 c 2 p 2 c 9 c 11 c 12 7 Figure 2. The Hubbard tree for with orb(p 0 ) drawn in and pre-periodic branch point w [p 0, c 7 ]; it maps to p 1 in three iterates. Hubbard trees: The Hubbard tree (T, f) of a Julia set (or more easily, its dendritic model) is the connected hull of the critical orbit. f(t ) = T, but f : T T is not globally 2-to-1 (except for z z 2 2). c 1 is always an endpoint of T ; so 0 has at most two branches in T. Every biaccessible point in J eventually maps into T.

8 8 Admissibility: For every ν = 1ν 2 ν 3 {0, 1} N 0, there is a dendritic model J and Hubbard tree T such that its kneading sequence is ν. However, not very such model belongs to a true Julia set of a quadratic polynomial. This is not is much about local connectivity, but rather about the existence of evil branch points, that is: m- periodic branch points so that f m does fix one of its arms, and permutes the others. c 1 c 5 c 4 c 3 c 0 = c 6 c 2 Figure 3. The Hubbard tree for contains an evil orbit of period 3. The Admissibility Condition A kneading sequence ν {0, 1} N 0 fails the admissibility condition (for period m) if the following three conditions hold: (1) the internal address of ν does not contain m; (2) if k < m divides m, then ρ(k) m; (3) ρ(m) < and if r {1,..., m} is congruent to ρ(m) modulo m, then orb ρ (r) contains m. Theorem 2. The non-admissible kneading sequences are dense. The admissible kneading sequences have positive ( 1 2, 1 2 )-Bernoulli measure. Corollary 1. Restricting to admissible kneading sequences has no real effect on Hausdorff dimension of biaccessible parameter angles.

9 9 Hausdorff estimate near the antenna of M Let N := 1 + min{i > 1 : ν i = 1} log(2 N/2 1 1) if N {6, 7, 8,... } log 2 L 1 (N) := N/2 1 1/2 if N = 5, 0 if N {3, 4} U 1 (N) := log(2n 1) log 2 N, and L 1 (N) = U 1 (N) = 1 if N =. Theorem 3. (Julia set) For every external parameter angle ϑ S 1, the set of biaccessible external dynamic angles ϕ S 1 has Hausdorff dimension between L 1 (N) and U 1 (N) for N = N(ϑ). In particular, the set of biaccessible external dynamic angles has Hausdorff dimension less than 1 unless ϑ = 1/2. Theorem 4. (Mandelbrot set) The set of external parameter angles ϑ for with N(ϑ) = N has Hausdorff dimension in between L 1 (N) and U 1 (N). In particular, the measure of biaccessible parameter angles (and this includes the real spine of M) is zero.

10 10 Hausdorff estimate near the main cardioid of M Define κ := sup{k 1 : S j is a multiple of S j 1 for all 1 j k}, L 2 (κ) := 1 S κ+1 { } 7 U 2 (κ) := min 1, 2(S κ + 1), and if κ =, then L 2 (κ) = U 2 (κ) = 0; if S κ < S κ+1 =, then 0 = L 2 (κ) < U 2 (κ). Theorem 5. (Julia set) For every external parameter angle ϑ S 1, the set of biaccessible external dynamic angles ϕ S 1 has Hausdorff dimension between L 2 (κ) and U 2 (κ) for κ = κ(ϑ). In particular, the set of biaccessible external dynamic angles of the Feigenbaum map has Hausdorff dimension zero. Theorem 6. (Mandelbrot set) The set of external parameter angles ϑ for with κ(ϑ) = κ has Hausdorff dimension in between L 2 (κ) and U 2 (κ). In particular, the Hausdorff dimension of angles of infinitely renormalizable maps is zero.

11 Theorem 7. Let B ϑ be the set of combinatorially biaccessible dynamic external angles for parameter angle ϑ, and (T ϑ, f) is the corresponding (abstract) Hubbard tree. Then dim H (B ϑ ) = h top(f Tϑ ). (1) log 2 Furthermore, these numbers depend Hölder continuously on ϑ S 1, with Hölder exponent equal to dim H (B ϑ ). Remarks: Monotonicity was proven in the Ph.D-theses of Chris Penrose (1994) and Tao Li (2007). (Monotonicity of ϑ h top (f Tϑ ) is in the sense that if ϑ and φ are biaccessible parameter angles such that φ (ϑ, ϑ ), i.e., φ belongs to the wake, or shorter arc, of ϑ and its companion angle ϑ with the same kneading sequence, then h top (f Tφ ) h top (f Tϑ ).) With Hölder exponent dim H (B ϑ ) = h top(f Tϑ ) log 2, Hölder continuity fails at the zero-entropy locus. For estimates of ϑ h top (f c(ϑ) Tϑ ) along the the real antenna (and especially the Feigenbaum parameter), see also work by Carminati and Tiozzo. A similar question which we don t solve here is the modulus of continuity of c h top (f c Tϑ ) along the the real antenna. 11

12 12 Steps in the proof: I: dim H (B ϑ ) = h top (f Tϑ )/ log 2 for finite trees: By Variational Principle. II. Argument is inconclusive for infinite trees: The problem is potential non-compactness of infinite Hubbard trees. taking the closure can increase entropy. III. Continuity of ϑ dim H (B ϑ ): Exploit that for large N, up to a set of tiny Hausdorff dimension, biaccessibility of itineraries can be determined by the first N entries of ν. IV. Monotonicity of ϑ h top (f Tϑ ): Itineraries of Hubbard tree of the smaller parameter angle are represented as Cantor set within the Hubbard tree of the parameter larger. V. The biaccessible Mandelbrot set: Monotonicity + Continuity of Hausdorff dimension implies Continuity of Entropy as long as we have majorizing parameter angles. No majorized angles at tips of the Mandelbrot set. VI. Zero entropy tips: No possibility of jumps here. VII. Continuity of ϑ h top (f Tϑ ) at tips: Compare non-zero entropy tips with nearby Thurston-Misiurewicz tips.

13 13 References [B] Arne Beurling, Ensembles exceptionnels, Acta Math. 72 (1940) [BS1] Henk Bruin, Dierk Schleicher, Admissibility of kneading sequences and structure of Hubbard trees for quadratic polynomials, J. London. Math. Soc. 8 (2009), [BS2] Henk Bruin, Dierk Schleicher, Combinatorial and topological biaccessibility of quadratic polynomials, in preparation. [BKS] Henk Bruin, Alexandra Kaffl, Dierk Schleicher, Existence of quadratic Hubbard trees, Fund. Math. 202 (2009), [Ch] Kai Lai Chung, A course in probability theory, Harcourt, Brace & World, Inc., New York (1968). [CT] C. Carminati, G. Tiozzo, The bifurcation locus of numbers of bo9unded type, Preprint [DH1] Adrien Douady, John Hubbard, Études dynamique des polynômes complexes I & II, Publ. Math. Orsay. ( ) (The Orsay notes). [LS] Eike Lau, Dierk Schleicher, Internal addresses in the Mandelbrot set and irreducibility of polynomials, Stony Brook Preprint #19 (1994). [Mat] Pertti Mattila, Geometry of sets and measures in Euclidean spaces, Cambridge University Press, (1995). [Man] Anthony Manning, Logarithmic capacity and renormalizability for landing on the Mandelbrot set, Bull. London Math. Soc. 28 (1996), [Mi1] John Milnor, Dynamics in one complex variable. Introductory lectures, Friedr. Vieweg & Sohn, Braunschweig (1999). [MS] Philipp Meerkamp, Dierk Schleicher Hausdorff dimension and biaccessibility for polynomial Julia sets, to appear in Proc. Amer. Math. Soc. arxiv: v2 [math.ds] [Pen] Chris Penrose, On quotients of shifts associated with dendrite Julia sets of quadratic polynomials, Ph.D. Thesis, University of Coventry, (1994). [Re] Mary Rees, A partial description of the parameter space of rational maps of degree two: Part 1, Acta. Math. 168 (1992), (See also: Realization of matings of polynomials as rational maps of degree two, preprint 1986). [Sch1] Dierk Schleicher, Internal Addresses in the Mandelbrot Set and Galois Groups of Polynomials. Preprint. [Sch2] Dierk Schleicher, On fibers and local connectivity of Mandelbrot and Multibrot sets. In: M. Lapidus, M. van Frankenhuysen (eds): Fractal Geometry and Applications: A Jubilee of Benoit Mandelbrot. Proceedings of Symposia in Pure Mathematics 72, American Mathematical Society (2004), [SZ] Dierk Schleicher, Saeed Zakeri: On biaccessible points in the Julia set of a Cremer quadratic polynomial. Proc. Amer. Math. Soc (1999), [Shi] Mitsuhiro Shishikura, On a theorem of M. Rees for matings of polynomials, in: Tan Lei (ed.), The Mandelbrot set, theme and variations, Cambridge University Press 274 (2000), [Sm] Stas Smirnov, On support of dynamical laminations and biaccessible points in Julia set, Colloq. Math. 87 (2001), [Ta1] Tan Lei, Similarity between the Mandelbrot set and Julia sets, Commun. Math. Phys. 134 (1990), [Ta2] Tan Lei, Matings of quadratic polynomials, Ergod. Th. & Dynam. Sys. 12 (1992), [TL] Tao Li, A monotonicity conjecture for the entropy of Hubbard trees, PhD thesis, Stony Brook (2007). [Za] Saeed Zakeri, Biaccessibility in quadratic Julia sets, Ergod. Th. & Dynam. Sys. 20 (2000), [Zd] Anna Zdunik, On biaccessible points in Julia sets of polynomials, Fund. Math. 163 (2000),