用户名: 密码: 验证码:
Dimension rigidity in conformal structures
详细信息    查看全文
文摘
Let Λ be the limit set of a conformal dynamical system, i.e. a Kleinian group acting on either finite- or infinite-dimensional real Hilbert space, a conformal iterated function system, or a rational function. We give an easily expressible sufficient condition, requiring that the limit set is not too much bigger than the radial limit set, for the following dichotomy: Λ is either a real-analytic manifold or a fractal in the sense of Mandelbrot (i.e. its Hausdorff dimension is strictly greater than its topological dimension).Our primary focus is on the infinite-dimensional case. An important component of the strategy of our proof comes from the rectifiability techniques of Mayer and Urbański ('03), who obtained a dimension rigidity result for conformal iterated function systems (including those with infinite alphabets). In order to handle the infinite dimensional case, both for Kleinian groups and for iterated function systems, we introduce the notion of pseudorectifiability, a variant of rectifiability, and develop a theory around this notion similar to the theory of rectifiable sets.Our approach also extends existing results in the finite-dimensional case, where it unifies the realms of Kleinian groups, conformal iterated function systems, and rational functions. For Kleinian groups, we improve on the rigidity result of Kapovich ('09) by substantially weakening its hypothesis of geometrical finiteness. Moreover, our proof, based on rectifiability, is entirely different than that of Kapovich, which depends on homological algebra.Another advantage of our approach is that it allows us to use the “demension” of Štan'ko ('69) as a substitute for topological dimension. For example, we prove that any dynamically defined version of Antoine's necklace must have Hausdorff dimension strictly greater than 1 (i.e. the demension of Antoine's necklace).

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700