Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-28T15:03:41.447Z Has data issue: false hasContentIssue false

Semi-hyperbolic fibered rational maps and rational semigroups

Published online by Cambridge University Press:  18 April 2006

HIROKI SUMI
Affiliation:
Department of Mathematics, Graduate School of Science, Osaka University, 1-1, Machikaneyama, Toyonaka, Osaka, 560-0043, Japan (e-mail: [email protected]) (http://www.math.sci.osaka-u.ac.jp/˜sumi/welcomeou-e.html)

Abstract

This paper is based on the author's previous work (Dynamics of sub-hyperbolic and semi-hyperbolic rational semigroups and skew products. Ergod. Th. & Dynam. Sys. 21 (2001), 563–603). We consider fiber-preserving complex dynamics on fiber bundles whose fibers are Riemann spheres and whose base spaces are compact metric spaces. In this context, without any assumption on (semi-)hyperbolicity, we show that the fiberwise Julia sets are uniformly perfect. From this result, we show that, for any semigroup G generated by a compact family of rational maps on the Riemann sphere $\overline{\mathbb C}$ of degree two or greater, the Julia set of any subsemigroup of G is uniformly perfect. We define the semi-hyperbolicity of dynamics on fiber bundles and show that, if the dynamics on a fiber bundle is semi-hyperbolic, then the fiberwise Julia sets are porous, and the dynamics is weakly rigid. Moreover, we show that if the dynamics is semi-hyperbolic and the fiberwise maps are polynomials, then under some conditions, the fiberwise basins of infinity are John domains. We also show that the Julia set of a rational semigroup (a semigroup generated by rational maps on $\overline{\mathbb C}$) that is semi-hyperbolic, except at perhaps finitely many points in the Julia set, and which satisfies the open set condition, is either porous or equal to the closure of the open set. Furthermore, we derive an upper estimate of the Hausdorff dimension of the Julia set.

Type
Research Article
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)