The Area of Polynomial Images and Preimages
Abstract
Let p be a monic polynomial in one complex variable and K a measurable subset of the complex plane. In terms of the area of K, we give an upper bound on the area of the preimage of K under p and a lower bound on the area of the image of K under p, (counted with multiplicity). Both bounds are sharp. The former extends an inequality of Polya. The proof uses Carleman's isoperimetric inequality for plane condensers. We include a summary of the necessary potential theory.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.