This work is motivated by the paper Annular itineraries for entire - - PowerPoint PPT Presentation

this work is motivated by the paper annular itineraries
SMART_READER_LITE
LIVE PREVIEW

This work is motivated by the paper Annular itineraries for entire - - PowerPoint PPT Presentation

Annular Itineraries for C David Mart-Pete Dept. of Mathematics and Statistics The Open University supervised by Phil Rippon and Gwyneth Stallard Winter School on Kleinian Groups and Transcendental Dynamics Universitt Bremen


slide-1
SLIDE 1

Annular Itineraries for C∗

David Martí-Pete

  • Dept. of Mathematics and Statistics

The Open University — supervised by Phil Rippon and Gwyneth Stallard —

Winter School on Kleinian Groups and Transcendental Dynamics Universität Bremen April 10, 2014

slide-2
SLIDE 2

This work is motivated by the paper Annular itineraries for entire functions by Phil Rippon and Gwyneth Stallard (January 2013).

  • P. Rippon and G. Stallard, Annular itineraries for entire functions, to appear in Trans. Amer.
  • Math. Soc.; arXiv:1301.1328.
slide-3
SLIDE 3

Sketch of the talk

  • 1. Introduction to holomorphic self-maps of C∗
  • 2. The escaping set
  • 3. Symbolic dynamics

and annuli covering results

  • 4. Types of orbits
  • 5. The fast escaping set
slide-4
SLIDE 4

Holomorphic self-maps of C∗

Let f : S ⊆ C → S be holomorphic. By Montel’s thm., if J (f ) = ∅ then:

◮ S =

C = C ∪ {∞}, the Riemann sphere (rational functions);

◮ S = C, the complex plane (transcendental entire functions); ◮ S = C∗ = C \ {0}, the punctured plane.

Holomorphic self-maps of C∗ were first studied in 1953 by H. Rådström.

  • H. Rådström, On the iteration of analytic functions. Math. Scand. 1 (1953), 85–92.
  • P. Bhattacharyya, Iteration of analytic functions. PhD Thesis (1969), University of London,

1969.

slide-5
SLIDE 5

Holomorphic self-maps of C∗

Let f : S ⊆ C → S be holomorphic. By Montel’s thm., if J (f ) = ∅ then:

◮ S =

C = C ∪ {∞}, the Riemann sphere (rational functions);

◮ S = C, the complex plane (transcendental entire functions); ◮ S = C∗ = C \ {0}, the punctured plane.

Holomorphic self-maps of C∗ were first studied in 1953 by H. Rådström.

Theorem (Bhattacharyya 1969)

Every transcendental holomorphic function f : C∗ → C∗ is of the form f (z) = zn exp

  • g(z) + h(1/z)
  • for some n ∈ Z and g, h non-constant entire functions.
  • H. Rådström, On the iteration of analytic functions. Math. Scand. 1 (1953), 85–92.
  • P. Bhattacharyya, Iteration of analytic functions. PhD Thesis (1969), University of London,

1969.

slide-6
SLIDE 6

Holomorphic self-maps of C∗

Let f : S ⊆ C → S be holomorphic. By Montel’s thm., if J (f ) = ∅ then:

◮ S =

C = C ∪ {∞}, the Riemann sphere (rational functions);

◮ S = C, the complex plane (transcendental entire functions); ◮ S = C∗ = C \ {0}, the punctured plane.

Holomorphic self-maps of C∗ were first studied in 1953 by H. Rådström.

Theorem (Bhattacharyya 1969)

Every transcendental holomorphic function f : C∗ → C∗ is of the form f (z) = zn exp

  • g(z) + h(1/z)
  • for some n ∈ Z and g, h non-constant entire functions.

Later results are due to: L. Keen, J. Kotus, P. M. Makienko, A. N. Mukha- medshin, L. Fang, W. Bergweiler, I. N. Baker, P. Domínguez Soto, etc.

  • H. Rådström, On the iteration of analytic functions. Math. Scand. 1 (1953), 85–92.
  • P. Bhattacharyya, Iteration of analytic functions. PhD Thesis (1969), University of London,

1969.

slide-7
SLIDE 7

Motivation: complexification of circle maps

The complexification of the Arnol’d standard family Fαβ(θ) = θ + α + β sin(θ) (mod 2π), θ ∈ R are transcendental hol. self-maps of C∗: Fαβ(w) = weiαeβ(w−1/w)/2. α = 3.1, β = 0.8. α = 3.1, β = 5.

  • N. Fagella, Dynamics of the complex standard family. J. Math. Anal. Appl. 229 (1999), no. 1,

1–31.

slide-8
SLIDE 8

Summary of results about holomorphic self-maps of C∗

Relation with the lift F : C → C (i.e. exp ◦F ≡ f ◦ exp):

◮ exp−1 J (f ) = J (F). [Ber95]

About the Julia set:

◮ J (f ) has no compact component; [BD98] ◮ J (f ) has either one or infinitely many components. [BD98]

About the Fatou set: if f is not a Möbius transformation,

◮ the Fatou components are simply or doubly-connected and there is

at most one doubly connected component (if f (z) ≡ kzn); [Kee88]

◮ if A is doubly-connected comp. which is relatively compact in C∗,

then A is either a Herman ring, pre-periodic, or wandering. [BD98]

  • I. N. Baker and P. Domínguez, Analytic self-maps of the punctured plane. Complex Variables

Theory Appl. 37 (1998), no. 1-4, 67–91.

  • W. Bergweiler, On the Julia set of analytic self-maps of the punctured plane. Analysis 15 (1995),
  • no. 3, 251–256.
  • L. Keen, Dynamics of holomorphic self-maps of C∗. Holomorphic functions and moduli, Vol. I,
  • Math. Sci. Res. Inst. Publ., vol. 10, Springer, 1988, 9–30.
slide-9
SLIDE 9

The escaping set

The escaping set was firstly studied for transcendental entire functions by

  • A. Eremenko in 1989,

I(f ) := {z ∈ C : |f n(z)| → ∞}.

Theorem (Eremenko 1989, Eremenko & Lyubich 1992)

Let f be a transcendental entire function. Then,

◮ I(f ) ∩ J (f ) = ∅; ◮ J (f ) = ∂I(f ); ◮ all the components of I(f ) are unbounded; ◮ if f ∈ B, then I(f ) ⊆ J (f ).

  • A. Eremenko, On the iteration of entire functions, Dynamical Systems and Ergodic Theory,

Banach Center Publ. 23 (1989), 339-345.

  • A. Eremenko, and M. Lyubich Dynamical properties of some classes of entire functions, Ann.
  • Inst. Fourier (Grenoble) 42 (1992), 989–1020.
slide-10
SLIDE 10

The escaping set in C∗

If f : C∗ → C∗ with 0, ∞ essential singularities, I(f ) := {z ∈ C∗ :

  • log |f n(z)|
  • → ∞}

which contains I0(f ) := {z ∈ C∗ : |f n(z)| → 0}, I∞(f ) := {z ∈ C∗ : |f n(z)| → ∞} and also for (sn) ∈ {−1, +1}N Is(f ) :=

  • z ∈ I(f ) : ∃ℓ ∈ N,

|f n+ℓ(z)| > 1 if sn = +1, |f n+ℓ(z)| < 1 if sn = −1

  • .

Theorem (Fang 1998, Baker, Domínguez & Herring 2001)

Let f be a transcendental self-map of C∗, then

◮ J (f ) ∩ I0(f ) = ∅, J (f ) ∩ I∞(f ) = ∅; ◮ J (f ) = ∂I0(f ) = ∂I∞(f ). I.N. Baker, P. Domínguez and M.E. Herring, Dynamics of functions meromorphic outside a small set, Ergodic Theory and Dynamical Systems 21 (2001), no. 3, 647–672. Fang L., On the Iteration of Holomorphic Self-Maps of C∗, Acta Mathematica Sinica, New Series 14 (1998), no. 1, 139–144.

slide-11
SLIDE 11

Different rates of escape

f (z) = z + 1 + e−z: Cantor bouquet (blue) & Baker domain (red).

slide-12
SLIDE 12

The maximum and minimum modulus

Let f be a holomorphic self-map of C∗ and R > 0, the functions M(R) = max

|z|=R |f (z)| < +∞,

m(R) = min

|z|=R |f (z)| > 0

are continuous and unimodal.

slide-13
SLIDE 13

The maximum and minimum modulus

Let f be a holomorphic self-map of C∗ and R > 0, the functions M(R) = max

|z|=R |f (z)| < +∞,

m(R) = min

|z|=R |f (z)| > 0

are continuous and unimodal. Main properties: i)

log M(R) log R

→ ∞ as R → ∞; ii) log M(R) is a convex function of log R; iii) ∃R0 > 0 such that M(Rk) M(R)k for every R R0 and k > 1; iv) if k > 1, M(kR)

M(R) → ∞ as R → ∞.

slide-14
SLIDE 14

The maximum and minimum modulus

Let f be a holomorphic self-map of C∗ and R > 0, the functions M(R) = max

|z|=R |f (z)| < +∞,

m(R) = min

|z|=R |f (z)| > 0

are continuous and unimodal. Main properties: i)

log M(R) log R

→ ∞ as R → ∞; ii) log M(R) is a convex function of log R; iii) ∃R0 > 0 such that M(Rk) M(R)k for every R R0 and k > 1; iv) if k > 1, M(kR)

M(R) → ∞ as R → ∞.

The analogous properties hold at 0, and similarly for m(R).

slide-15
SLIDE 15

Defining an annular partition

Let R+ be big enough such that for all R > R+, M(R) > R, and let R− be small enough such that for all R < R−, m(R) < R. Define A0 := A(R−, R+) = {z ∈ C∗ : R− < |z| < R+} and, for every n > 0, An := A(Mn−1(R+), Mn(R+)), A−n := A(mn(R−), mn−1(R−)).

slide-16
SLIDE 16

Itineraries

The annular itinerary of z ∈ C∗ is a0a1a2 . . ., with an ∈ Z, and f n(z) ∈ Aan, for all n 0.

slide-17
SLIDE 17

Itineraries

The annular itinerary of z ∈ C∗ is a0a1a2 . . ., with an ∈ Z, and f n(z) ∈ Aan, for all n 0. What kind of sequence can be realized as an itinerary? By construction, an+1 an + 1 if an > 0, an+1 an − 1 if an < 0. because of the Maximum Modulus Principle.

slide-18
SLIDE 18

Constructing orbits with a prescribed itinerary

We will use the following well-known result:

Lemma

Let Cm, m 0, be compact sets in C and f continuous such that f (Cm) ⊇ Cm+1, for m 0. Then ∃ξ such that f m(ξ) ∈ Cm, for m 0. We are going to construct a sequence of annuli Bn ⊂ An such that

◮ f (Bn) ⊇ Bn+1 if n > 0; ◮ f (Bn) ⊇ Bn−1 if n < 0.

slide-19
SLIDE 19

Annuli covering lemma

Theorem (Bergweiler, Rippon & Stallard 2011)

There exists an absolute constant δ > 0 such that if f : A(R, R′) → C∗ is analytic, where R′ > R, then for all z1, z2 ∈ A(R, R′) such that ρA(R,R′)(z1, z2) < δ and |f (z2)| 2|f (z1)|, we have f (A(R, R′)) ⊃ A(|f (z1)|, |f (z2)|).

  • W. Bergweiler, P. Rippon and G. Stallard, Multiply connected wandering domains of entire

functions, to appear in Proc. London Math. Soc.; arXiv:1109.1794

slide-20
SLIDE 20

Construction of the annuli Bn (for n > 0)

Let µ(R) := εM(R) for ε > 0. For large enough values of R, µn(R) Mn(εR) for n ∈ N.

  • P. Rippon and G. Stallard, Fast escaping points of entire functions, Proc. London Math. Soc.

(3) 105 (2012) 787–820.

slide-21
SLIDE 21

Construction of the annuli Bn (for n > 0)

Let µ(R) := εM(R) for ε > 0. For large enough values of R, µn(R) Mn(εR) for n ∈ N. We have the following situation: for n > 0, Mn−1(R+) < ε2M(µn−1(R+)) < µn(R+) < M(µn−1(R+)) < Mn(R+).

  • P. Rippon and G. Stallard, Fast escaping points of entire functions, Proc. London Math. Soc.

(3) 105 (2012) 787–820.

slide-22
SLIDE 22

Construction of the annuli Bn (for n > 0)

Let µ(R) := εM(R) for ε > 0. For large enough values of R, µn(R) Mn(εR) for n ∈ N. We have the following situation: for n > 0, Mn−1(R+) < ε2M(µn−1(R+)) < µn(R+) < M(µn−1(R+)) < Mn(R+). We are going to take, for n > 0, Bn := A(ε2M(µn−1(R+)), M(µn−1(R+))) ⋐ An and z1, z2 such that |z1| = |z2| = µn(R+) such that |z1| = m(µn(R+)), |z2| = M(µn(R+)).

  • P. Rippon and G. Stallard, Fast escaping points of entire functions, Proc. London Math. Soc.

(3) 105 (2012) 787–820.

slide-23
SLIDE 23

Construction of the annuli Bn (for n > 0)

Let µ(R) := εM(R) for ε > 0. For large enough values of R, µn(R) Mn(εR) for n ∈ N. We have the following situation: for n > 0, Mn−1(R+) < ε2M(µn−1(R+)) < µn(R+) < M(µn−1(R+)) < Mn(R+). We are going to take, for n > 0, Bn := A(ε2M(µn−1(R+)), M(µn−1(R+))) ⋐ An and z1, z2 such that |z1| = |z2| = µn(R+) such that |z1| = m(µn(R+)), |z2| = M(µn(R+)). Observe that making ε small enough we can ensure that ρAn(z1, z2) < δ and for R+ big enough the condition |f (z2)| 2|f (z1)| is trivial.

  • P. Rippon and G. Stallard, Fast escaping points of entire functions, Proc. London Math. Soc.

(3) 105 (2012) 787–820.

slide-24
SLIDE 24

Jumping from ∞ to 0 and vice versa

Observe that we can choose R− and R+ respectively small and big enough such that

◮ if n > 0: f (Bn) ⊇ Bk for all 0 < k n + 1; ◮ if n < 0: f (Bn) ⊇ Bk for all n − 1 k < 0.

slide-25
SLIDE 25

Jumping from ∞ to 0 and vice versa

Observe that we can choose R− and R+ respectively small and big enough such that

◮ if n > 0: f (Bn) ⊇ Bk for all 0 < k n + 1; ◮ if n < 0: f (Bn) ⊇ Bk for all n − 1 k < 0.

We introduce the following functions

◮ for n > 0, σ+(n) = min{k ∈ Z : f (Bn) ⊇ Bk} 0; ◮ for n < 0, σ−(n) = max{k ∈ Z : f (Bn) ⊇ Bk} 0;

from which we only know that they are resp. non-increasing and non- decreasing.

slide-26
SLIDE 26

Types of orbits

Theorem (M)

Let f : C∗ → C∗ be holomorphic with 0, ∞ essential singularities. Given a partition {An} defined as above with R+, 1/R− big enough, we can construct points with the following annular itineraries:

◮ fast escaping points to either 0, ∞ or both; ◮ periodic itineraries, in given consecutive annuli in the

neighbourhood of 0 or ∞, or jumping from one to the other;

◮ uncountably many bounded itineraries; ◮ uncountably many unbounded non-escaping itineraries; ◮ arbitrarily slowly escaping itineraries.

slide-27
SLIDE 27

The fast escaping set

We say that a point z ∈ C∗ is fast escaping if there is ℓ ∈ N and a sequence of positive real numbers (Rn)n starting with R0 > 0 sufficiently large/small and given by Rn+1 = M(Rn) or Rn+1 = m(Rn) for n > 0, such that

◮ |f n+ℓ(z)| Rn if Rn+1 = M(Rn); ◮ |f n+ℓ(z)| Rn if Rn+1 = m(Rn).

We write z ∈ A(f ). Remark: fast escaping points with this definition are indeed escaping!

slide-28
SLIDE 28

The fast escaping set is not empty

If f is a transcendental entire function, Bergweiler and Hinkkanen showed that A(f ) = ∅ in the original paper from 1999. This construction proves that, with this definition, A(f ) = ∅ for holomor- phic self-maps with two essential singularities as well. Moreover, it can be adapted to show that if s ∈ {−1, +1}N is a sequence describing which of the essential singularities the escaping points are visiting (sn = −1 if f n(z) is in a neighbourhood of 0 and sn = +1 otherwise) and As(f ) := {z ∈ A(f ) : ∃ℓ ∈ N s.t. f ℓ(z) has escaping itinerary s} then for every s ∈ {−1, +1}N ∅ = As(f ) ⊆ I(f ). Observe that sn = sign(an).

  • W. Bergweiler and A. Hinkkanen, On semiconjugation of entire functions, Math. Proc. Cambridge
  • Philos. Soc. 126 (1999), no. 3, 565–574.
slide-29
SLIDE 29

The components of the fast escaping set are unbounded

In 2005, Rippon and Stallard proved that every component of A(f ) is unbounded and hence I(f ) has at least one unbounded component.

Theorem (M)

Let f be a holomorphic self-map of C∗ with 0, ∞ essential singularities. The connected components of A(f ) are unbounded. Hence, A(f ) contains uncountably many disjoint unbounded continua attached to each essential singularity.

  • P. Rippon and G. Stallard, On questions of Fatou and Eremenko, Proc. Amer. Math. Soc. 133

(2005), no. 4, 1119–1126.

slide-30
SLIDE 30

THE END

Thank you for your attention!