Schottky's theorem

In mathematical complex analysis, Schottky's theorem, introduced by is a quantitative version of Picard's theorem.

Uses your system voice; voice and rate in settings.

≈ 2 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematical complex analysis, Schottky's theorem, introduced by is a quantitative version of Picard's theorem. It states that for a holomorphic function f in the open unit disk that does not take the values 0 or 1, the value of |f(z)| can be bounded in terms of z and f(0).

Schottky's original theorem did not give an explicit bound for f. gave some weak explicit bounds. gave a strong explicit bound, showing that if f is holomorphic in the open unit disk and does not take the values 0 or 1, then \log |f(z)| \le \frac{1+|z|}{1-|z|}(7+\max(0,\log |f(0)|)) . Several authors, such as , have given variations of Ahlfors's bound with better constants: in particular gave some bounds whose constants are in some sense the best possible.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1352623537 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001352623537 · captured 2026-05-05 · ledger · version history

Cite this page as: encyclopegia.org, “Schottky's theorem”, snapshot enwiki-001352623537. https://encyclopegia.org/a/schottky-s-theorem

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.