English

Uniformization of planar domains by exhaustion

Complex Variables 2021-11-02 v1

Abstract

We study the method of finding conformal maps onto circle domains by approximating with finitely connected subdomains. Every domain DC^D \subset \hat{C} admits exhaustions, i.e., increasing sequences of finitely connected subdomains DjD_j whose union is DD. By Koebe's theorem, each DjD_j admits a conformal map fDjf_{D_j} from DjD_j onto a circle domain fDj(Dj)f_{D_j}(D_j). Assuming fDjff_{D_j} \to f, our goal is to find out if f(D)f(D) is also a circle domain. We present a countably connected DD with an exhaustion (Dj)(D_j) so that (fDj)(f_{D_j}) has a limit whose image is not a circle domain, and a domain Ω\Omega with an exhaustion (Ωj)(\Omega_j) so that (fΩj)(f_{\Omega_j}) has a limit whose image has uncountably many non-point complementary components. On the other hand, we prove that every exhaustion (Dj)(D_j) of a countably connected DD admits a refinement so that the image of the corresponding limit map is a circle domain. Our result extends the He-Schramm theorem on the uniformization of countably connected domains and provides a new proof.

Keywords

Cite

@article{arxiv.2111.00845,
  title  = {Uniformization of planar domains by exhaustion},
  author = {Kai Rajala},
  journal= {arXiv preprint arXiv:2111.00845},
  year   = {2021}
}