Horoballs and iteration of holomorphic maps on bounded symmetric domains (Q2400515): Difference between revisions
From MaRDI portal
Latest revision as of 07:31, 14 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Horoballs and iteration of holomorphic maps on bounded symmetric domains |
scientific article |
Statements
Horoballs and iteration of holomorphic maps on bounded symmetric domains (English)
0 references
29 August 2017
0 references
Wolff's classical theorem on the unit disc \(\mathbb{D}\) in \(\mathbb{C}\) shows that to every holomorphic fixed-point free self-map \(f\) of \(\mathbb{D}\) there corresponds a point \(\xi \) in \(\partial \mathbb{D}\) with the property that each disc in \(\mathbb{D}\) that is tangent at \(\xi \) to \(\partial \mathbb{D}\) is \(f\)-invariant. The goal of this paper is to extend Wolff's theorem to all bounded symmetric domains. For the main result (Theorem 4.4) one considers a fixed-point free holomorphic self map \(f\) on a bounded symmetric domain \(D\) in a finite- or infinite-dimensional complex vector space \(V\) such that \(f(D)\) is relatively compact. Then it is shown that for a sequence \((z_k)\) in \(D\) converging to a boundary point \(\xi \), and for each \(\lambda >0\), there is a nonempty convex domain \(H(\xi ,\lambda )\) such that \[ f\bigl(H(\xi ,\lambda )\bigr)\subset H(\xi ,\lambda ),\quad D=\bigcup _{\lambda >0} H(\xi ,\lambda ). \] The domains \(H(\xi ,\lambda )\) generalize the horodiscs involved in Wolff's Theorem. The proofs use the underlying Jordan structure of the complex vector space \(V\), i.e., \(V\) is equipped with a \(JB^*\)-structure. In particular the domains \(H(\xi ,\lambda )\) are described by using the Bergman operator associated with such a structure. Moreover a generalization of the Denjoy-Wolff Theorem about iterations of holomorphic maps is established for finite rank bounded symmetric domains
0 references
bounded symmetric domain
0 references
holomorphic map
0 references
\(JB^*\)-triple structure
0 references
iteration
0 references
0 references
0 references