conjugacy classes of disjoint type functions
play

Conjugacy classes of disjoint-type functions Simon Albrecht ( joint - PowerPoint PPT Presentation

Conjugacy classes of disjoint-type functions Simon Albrecht ( joint work with Anna Benini and Lasse Rempe-Gillen ) University of Liverpool TCD 2017 Barcelona, 2 October 2017 S. Albrecht (UoL) Conjugacies in class B 2 October 2017 1 / 12


  1. Conjugacy classes of disjoint-type functions Simon Albrecht ( joint work with Anna Benini and Lasse Rempe-Gillen ) University of Liverpool TCD 2017 Barcelona, 2 October 2017 S. Albrecht (UoL) Conjugacies in class B 2 October 2017 1 / 12

  2. Fatou set and Julia set Let f : C → C be entire. S. Albrecht (UoL) Conjugacies in class B 2 October 2017 2 / 12

  3. Fatou set and Julia set Let f : C → C be entire. We define the n-th iterate of f by f n := f ◦ f ◦ . . . ◦ f . � �� � n -times S. Albrecht (UoL) Conjugacies in class B 2 October 2017 2 / 12

  4. Fatou set and Julia set Let f : C → C be entire. We define the n-th iterate of f by f n := f ◦ f ◦ . . . ◦ f . � �� � n -times F ( f ) = Fatou set of f = set of stability S. Albrecht (UoL) Conjugacies in class B 2 October 2017 2 / 12

  5. Fatou set and Julia set Let f : C → C be entire. We define the n-th iterate of f by f n := f ◦ f ◦ . . . ◦ f . � �� � n -times F ( f ) = Fatou set of f = set of stability = { z ∈ C : { f n : n ∈ N } is equicontinuous in z } S. Albrecht (UoL) Conjugacies in class B 2 October 2017 2 / 12

  6. Fatou set and Julia set Let f : C → C be entire. We define the n-th iterate of f by f n := f ◦ f ◦ . . . ◦ f . � �� � n -times F ( f ) = Fatou set of f = set of stability = { z ∈ C : { f n : n ∈ N } is equicontinuous in z } J ( f ) = Julia set of f = C \ F ( f ) S. Albrecht (UoL) Conjugacies in class B 2 October 2017 2 / 12

  7. Conjugacy We say that two entire functions f and g are conjugate if there exists a homeomorphism T : C → C with f ◦ T = T ◦ g . S. Albrecht (UoL) Conjugacies in class B 2 October 2017 3 / 12

  8. Conjugacy We say that two entire functions f and g are conjugate if there exists a homeomorphism T : C → C with f ◦ T = T ◦ g . Then: f n ◦ T = T ◦ g n for all n ∈ N . S. Albrecht (UoL) Conjugacies in class B 2 October 2017 3 / 12

  9. Conjugacy We say that two entire functions f and g are conjugate if there exists a homeomorphism T : C → C with f ◦ T = T ◦ g . Then: f n ◦ T = T ◦ g n for all n ∈ N . F ( f ) = T ( F ( g )) and J ( f ) = T ( J ( g )). S. Albrecht (UoL) Conjugacies in class B 2 October 2017 3 / 12

  10. Conjugacy We say that two entire functions f and g are conjugate if there exists a homeomorphism T : C → C with f ◦ T = T ◦ g . Then: f n ◦ T = T ◦ g n for all n ∈ N . F ( f ) = T ( F ( g )) and J ( f ) = T ( J ( g )). Example: f ( z ) = z 2 , g ( z ) = 2 z 2 − 2 z + 1 , T ( z ) = 2 z − 1 S. Albrecht (UoL) Conjugacies in class B 2 October 2017 3 / 12

  11. Examples of Julia sets Example 1: f ( z ) = z 2 − 1. S. Albrecht (UoL) Conjugacies in class B 2 October 2017 4 / 12

  12. Examples of Julia sets Example 1: f ( z ) = z 2 − 1. Source of image: Prokofiev, Wikimedia commons, http://commons.wikimedia.org/wiki/File:Julia_z2-1.png S. Albrecht (UoL) Conjugacies in class B 2 October 2017 4 / 12

  13. Examples of Julia sets Example 2: f ( z ) = e z − 2. S. Albrecht (UoL) Conjugacies in class B 2 October 2017 5 / 12

  14. Examples of Julia sets Example 2: f ( z ) = e z − 2. Image created by Lasse Rempe-Gillen. S. Albrecht (UoL) Conjugacies in class B 2 October 2017 5 / 12

  15. Examples of Julia sets Example 2: f ( z ) = e z − 2. Image created by Lasse Rempe-Gillen. S. Albrecht (UoL) Conjugacies in class B 2 October 2017 5 / 12

  16. Cantor bouquets Cantor bouquet: (informal definition) S. Albrecht (UoL) Conjugacies in class B 2 October 2017 6 / 12

  17. Cantor bouquets Cantor bouquet: (informal definition) Collection of injective curves to ∞ . S. Albrecht (UoL) Conjugacies in class B 2 October 2017 6 / 12

  18. Cantor bouquets Cantor bouquet: (informal definition) Collection of injective curves to ∞ . Each curve has a finite endpoint. S. Albrecht (UoL) Conjugacies in class B 2 October 2017 6 / 12

  19. Cantor bouquets Cantor bouquet: (informal definition) Collection of injective curves to ∞ . Each curve has a finite endpoint. The set of endpoints is dense in the Cantor bouquet. S. Albrecht (UoL) Conjugacies in class B 2 October 2017 6 / 12

  20. Cantor bouquets Cantor bouquet: (informal definition) Collection of injective curves to ∞ . Each curve has a finite endpoint. The set of endpoints is dense in the Cantor bouquet. Fact: All Cantor bouquets are homeomorphic to each other by ambient homeomorphisms (that is by homeomorphisms which can be extended to the whole plane). S. Albrecht (UoL) Conjugacies in class B 2 October 2017 6 / 12

  21. Cantor bouquets Example 3: f ( z ) = − 3 4 cos( z ) + 3 4 . S. Albrecht (UoL) Conjugacies in class B 2 October 2017 7 / 12

  22. Cantor bouquets Example 3: f ( z ) = − 3 4 cos( z ) + 3 4 . Image created by Lasse Rempe-Gillen. S. Albrecht (UoL) Conjugacies in class B 2 October 2017 7 / 12

  23. Disjoint-type functions S. Albrecht (UoL) Conjugacies in class B 2 October 2017 8 / 12

  24. Disjoint-type functions f S. Albrecht (UoL) Conjugacies in class B 2 October 2017 8 / 12

  25. Disjoint-type functions S. Albrecht (UoL) Conjugacies in class B 2 October 2017 8 / 12

  26. Disjoint-type functions f f f f S. Albrecht (UoL) Conjugacies in class B 2 October 2017 8 / 12

  27. Disjoint-type functions f f f f Example: e z − 2 is of disjoint type, S. Albrecht (UoL) Conjugacies in class B 2 October 2017 8 / 12

  28. Disjoint-type functions f f f f Example: e z − 2 is of disjoint type, e z is not of disjoint type . S. Albrecht (UoL) Conjugacies in class B 2 October 2017 8 / 12

  29. Order of f We say that an entire function f has finite order , if there exist c , ρ > 0 so that | f ( z ) | ≤ c · exp( | z | ρ ) for all z ∈ C . S. Albrecht (UoL) Conjugacies in class B 2 October 2017 9 / 12

  30. Order of f We say that an entire function f has finite order , if there exist c , ρ > 0 so that | f ( z ) | ≤ c · exp( | z | ρ ) for all z ∈ C . The infimum of the possible ρ is called order of f , denoted ρ ( f ). S. Albrecht (UoL) Conjugacies in class B 2 October 2017 9 / 12

  31. Order of f We say that an entire function f has finite order , if there exist c , ρ > 0 so that | f ( z ) | ≤ c · exp( | z | ρ ) for all z ∈ C . The infimum of the possible ρ is called order of f , denoted ρ ( f ). In fact, log log max | z | = r | f ( z ) | ρ ( f ) = lim sup . log r r →∞ S. Albrecht (UoL) Conjugacies in class B 2 October 2017 9 / 12

  32. Order of f We say that an entire function f has finite order , if there exist c , ρ > 0 so that | f ( z ) | ≤ c · exp( | z | ρ ) for all z ∈ C . The infimum of the possible ρ is called order of f , denoted ρ ( f ). In fact, log log max | z | = r | f ( z ) | ρ ( f ) = lim sup . log r r →∞ Examples: ρ ( P ) = 0 for every polynomial P . S. Albrecht (UoL) Conjugacies in class B 2 October 2017 9 / 12

  33. Order of f We say that an entire function f has finite order , if there exist c , ρ > 0 so that | f ( z ) | ≤ c · exp( | z | ρ ) for all z ∈ C . The infimum of the possible ρ is called order of f , denoted ρ ( f ). In fact, log log max | z | = r | f ( z ) | ρ ( f ) = lim sup . log r r →∞ Examples: ρ ( P ) = 0 for every polynomial P . ρ (exp( z n )) = n . S. Albrecht (UoL) Conjugacies in class B 2 October 2017 9 / 12

  34. Order of f We say that an entire function f has finite order , if there exist c , ρ > 0 so that | f ( z ) | ≤ c · exp( | z | ρ ) for all z ∈ C . The infimum of the possible ρ is called order of f , denoted ρ ( f ). In fact, log log max | z | = r | f ( z ) | ρ ( f ) = lim sup . log r r →∞ Examples: ρ ( P ) = 0 for every polynomial P . ρ (exp( z n )) = n . ρ (exp(exp( z ))) = ∞ . S. Albrecht (UoL) Conjugacies in class B 2 October 2017 9 / 12

  35. Functions with Cantor bouquet Julia sets Fact: Every disjoint-type transcendental entire function of finite order has a Cantor bouquet Julia set. S. Albrecht (UoL) Conjugacies in class B 2 October 2017 10 / 12

  36. Functions with Cantor bouquet Julia sets Fact: Every disjoint-type transcendental entire function of finite order has a Cantor bouquet Julia set. Hence, the Julia sets of two such functions f and g are homeomorphic (by ambient homeomorphisms). S. Albrecht (UoL) Conjugacies in class B 2 October 2017 10 / 12

  37. Functions with Cantor bouquet Julia sets Fact: Every disjoint-type transcendental entire function of finite order has a Cantor bouquet Julia set. Hence, the Julia sets of two such functions f and g are homeomorphic (by ambient homeomorphisms). Question Are f and g conjugate on their Julia sets? S. Albrecht (UoL) Conjugacies in class B 2 October 2017 10 / 12

  38. Functions with Cantor bouquet Julia sets Fact: Every disjoint-type transcendental entire function of finite order has a Cantor bouquet Julia set. Hence, the Julia sets of two such functions f and g are homeomorphic (by ambient homeomorphisms). Question Are f and g conjugate on their Julia sets? S. Albrecht (UoL) Conjugacies in class B 2 October 2017 10 / 12

  39. Results Theorem Let f and g be disjoint-type transcendental entire functions of order less than 1 . S. Albrecht (UoL) Conjugacies in class B 2 October 2017 11 / 12

  40. Results Theorem Let f and g be disjoint-type transcendental entire functions of order less than 1 . Then f and g are conjugate on their Julia sets by an ambient homeomorphism. S. Albrecht (UoL) Conjugacies in class B 2 October 2017 11 / 12

Recommend


More recommend