Picard's great theorem
Anchor (Master): Picard 1879 Comptes Rendus 89; Ahlfors Complex Analysis Ch. 8; Montel 1912 Ann. Sci. ENS
Intuition [Beginner]
An essential singularity is a point where a function behaves as wildly as possible. Near such a point, the function has no limit — not finite, not infinite. It oscillates uncontrollably.
Picard's great theorem makes this precise: near an essential singularity, a function takes every complex value, with at most one exception, and it does so infinitely often.
Compare with the three types of isolated singularities. A removable singularity is no real problem — the function can be filled in. A pole means the function blows up to infinity. An essential singularity is chaos: the function takes every value infinitely many times in any neighbourhood, missing at most one.
The function has an essential singularity at . As spirals toward , spirals through every complex value (except ) infinitely often.
Visual [Beginner]
A zoom into the origin for the function . Concentric circles of decreasing radius show the function cycling through all nonzero complex values repeatedly. One point at is marked as the omitted value.
Near an essential singularity, the function image is essentially the entire complex plane, repeated densely at every scale.
Worked example [Beginner]
Consider near .
For any nonzero value , write for some (possible since is surjective onto ). Then when for any integer , giving .
As , these solutions . So in every neighbourhood of , the function takes the value infinitely often. The only exception is , which never attains.
This is exactly what Picard's great theorem predicts: one omitted value (zero), and every other value is hit infinitely often near the singularity.
Check your understanding [Beginner]
Formal definition [Intermediate+]
Definition (Essential singularity). Let be holomorphic on a punctured disk . The point is an essential singularity of if the Laurent expansion has infinitely many nonzero coefficients with .
Equivalently, by the Casorati-Weierstrass theorem, is essential if and only if has no limit (finite or infinite) as .
Definition (Normal family). A family of holomorphic functions on a domain is normal if every sequence in has a subsequence that converges uniformly on compact subsets of (either to a holomorphic function or to ).
By Montel's theorem [Montel 1912], a family omitting three fixed values is normal. This is the key tool for the modern proof of Picard's great theorem.
Key theorem with proof [Intermediate+]
Theorem (Picard's great theorem, 1879). Let be holomorphic on with an essential singularity at . Then for every with at most one exception, has infinitely many solutions in .
Proof. Suppose for contradiction that omits two finite values in some punctured neighbourhood . Without loss, and .
Step 1: Translate to Schottky. For each , define on . Then is a family of holomorphic functions on , each omitting and .
Step 2: Apply Montel. The functions on the fixed disk form a family of holomorphic functions omitting and . By Montel's theorem (a family omitting three values is normal; two values plus compactness gives normality after composing with the modular function), is normal.
Step 3: Extract and analyse. Extract a subsequence uniformly on compact subsets. If is holomorphic, then , meaning has a removable singularity at (setting ), contradicting the hypothesis. If , then has a pole at , again contradicting the essential-singularity hypothesis. If has an essential singularity at , then the family was not normal — a contradiction to Montel.
Step 4: Conclusion. The assumption that omits two values leads to the conclusion that is removable or a pole. Since is essential, omits at most one value.
The infinite-solutions part follows: if had only finitely many solutions, then would be bounded near , giving a removable singularity and contradicting the essential-singularity hypothesis.
Bridge. The proof generalises the normal-families technique from 06.01.14; this is exactly the Montel machinery applied to the geometry of omitted values. The foundational reason Picard's great theorem holds is that normal families and essential singularities are incompatible — normal families force convergence, while essential singularities force divergence. This pattern appears again in the theory of meromorphic functions where Nevanlinna's Second Main Theorem quantifies the same tension. The bridge is that value-omission constrains function growth, and growth constraints force singularity types.
Exercises [Intermediate+]
Advanced results [Master]
Montel's theorem (sharp form). A family of meromorphic functions on a domain is normal if and only if omits three distinct values in . This is the sharpest possible result: omitting two values does not guarantee normality (consider on , which omits but no second value uniformly).
Zalcman's lemma (1975) gives a rescaling characterisation of non-normality: a family is not normal at if and only if there exist sequences , , and such that uniformly on compact subsets of , where is a non-constant entire function of order at most . Zalcman's lemma is the modern engine behind proofs of Picard-type theorems.
Nevanlinna's Second Main Theorem [Nevanlinna 1929] provides the quantitative form: for a meromorphic function on and distinct values ,
where is the Nevanlinna characteristic, counts distinct -points, and outside a set of finite measure. Setting and assuming two deficiencies equal recovers Picard's great theorem.
Synthesis. Picard's great theorem is the local counterpart of the little theorem 06.01.20; the central insight is that essential singularities force the maximal range of values, just as non-constancy forces the maximal range for entire functions. The Montel normal-families approach builds toward a unified framework: both Picard theorems are instances of the general principle that functions with restricted ranges are "tame" (normal, bounded, or constant). This pattern recurs across complex analysis: the Riemann mapping theorem 06.01.06 and the uniformisation theorem both reflect the same tension between range restriction and geometric rigidity. Zalcman's lemma identifies non-normality with the existence of a "limit entire function," putting these together with the Bloch theorem 06.01.29 to give the modern, streamlined proofs.
Full proof set [Master]
Proposition (Zalcman's lemma, simplified). Let be a family of functions holomorphic on a domain , and suppose is not normal at . Then there exist sequences , , and such that on , where is a non-constant entire function of order at most .
Proof sketch. Non-normality at means there is a compact neighbourhood of on which the family fails to be equicontinuous. By Marty's theorem (a family is normal if and only if the spherical derivative is locally bounded), the spherical derivatives blow up for some . Set and rescale. The rescaled functions satisfy a uniform Lipschitz bound on compact sets, yielding a normal limit that is non-constant (since ) and of finite order.
Connections [Master]
Picard's little theorem 06.01.20 is the global special case: an entire function has a removable singularity or pole at infinity, so the great theorem applied at infinity recovers the little theorem as a corollary.
Normal families and Montel's theorem 06.01.14 provide the framework; Zalcman's lemma is the modern refinement that converts non-normality into the existence of a non-constant entire limit function.
Schottky's and Bloch's theorems 06.01.29 give alternative routes to Picard via quantitative growth bounds rather than normal-family arguments; the two approaches are ultimately equivalent through the Schottky--Landau theorem.
The Casorati-Weierstrass theorem is the weak precursor: near an essential singularity, the range is dense in ; Picard strengthens "dense" to "all but at most one value, infinitely often" 06.01.27.
Bibliography [Master]
@article{picard1879,
author = {Picard, {\'E}mile},
title = {Sur une propri{\'e}t{\'e} des fonctions enti{\`e}res},
journal = {Comptes Rendus Acad. Sci. Paris},
volume = {89},
pages = {663--665},
year = {1879}
}
@book{stein-shakarchi-complex,
author = {Stein, Elias M. and Shakarchi, Rami},
title = {Complex Analysis},
series = {Princeton Lectures in Analysis},
volume = {II},
publisher = {Princeton University Press},
year = {2003}
}
@book{ahlfors-complex,
author = {Ahlfors, Lars V.},
title = {Complex Analysis},
edition = {3},
publisher = {McGraw-Hill},
year = {1979}
}
@article{montel1912,
author = {Montel, Paul},
title = {Sur les familles de fonctions analytiques qui admettent des valeurs exceptionnelles},
journal = {Ann. Sci. {\'E}cole Norm. Sup.},
volume = {29},
pages = {483--511},
year = {1912}
}
@article{zalcman1975,
author = {Zalcman, Lawrence},
title = {A heuristic principle in complex function theory},
journal = {Amer. Math. Monthly},
volume = {82},
pages = {813--817},
year = {1975}
}
@article{nevanlinna1929,
author = {Nevanlinna, Rolf},
title = {Le th{\'e}or{\`e}me de {P}icard-{B}orel et la th{\'e}orie des fonctions m{\'e}romorphes},
journal = {Acta Math.},
volume = {52},
pages = {131--143},
year = {1929}
}
Historical & philosophical context [Master]
Picard proved his great theorem in the same 1879 paper [Picard 1879] as the little theorem. The result completed the classification of isolated singularities by showing that essential singularities are not merely "wild" but maximally range-filling.
Montel's theory of normal families (1912) [Montel 1912] revolutionised the proof strategy. The modern approach via Zalcman's lemma (1975) reduced the entire argument to a rescaling technique, making Picard's theorem accessible to graduate students.
The philosophical significance is that complex differentiability, a seemingly mild hypothesis, has devastatingly strong consequences. A single complex derivative constrains the global behaviour of a function far more than any finite number of real derivatives. Picard's theorem is one of the sharpest expressions of this principle.