Picard's Theorem

Little Picard Theorem
A nonconstant entire function $f: \C \to \C$ omits at most one complex value $a \in \C$.

Big Picard Theorem
Let:
 * $U \subset \C$ be a domain
 * $z_0 \in U$
 * $f: U \setminus \left\{{z_0}\right\} \to \C$ be a holomorphic function with an essential singularity at $z_0$.

Then $f$ omits at most one complex value $a \in \C$.

Proof of the little Picard theorem using the universal cover of the twice-punctured plane
For this proof, we use the fact that there is a holomorphic covering map:
 * $\phi: \Bbb D \to \C \setminus \left\{{0, 1}\right\}$

where $\Bbb D = \left\{ {z \in \C: \left|{z}\right| < 1}\right\}$.

This follows from the Riemann Uniformization Theorem, but is much easier to prove.

Indeed, such a covering is given by the elliptic modular function.

Now suppose that an entire function $f: \C \to \C$ omits two different complex values.

Assume for simplicity that the omitted values are $0$ and $1$.

This can always be achieved by postcomposing $f$ with a suitable complex affine map.

Because $\C$ is simply connected and $\phi$ is a covering, we can lift $f$ to a holomorphic function:
 * $F: \C \to \Bbb D$

with $\phi \circ F = f$.

By Liouville's Theorem (Complex Analysis), $F$ is constant.

Therefore $f$ is also constant.

Hence the result.

Proof of the Big Picard Theorem using Montel's Theorem
Montel's Theorem is a very close relative of Picard's theorem.

It states that a family of holomorphic functions that all omit the same two values is normal.

(Recall that a family $\mathcal F$ of holomorphic functions $f: U \to \C$ is normal if every sequence in $\mathcal F$ has a subsequence that converges locally uniformly to a holomorphic function or to infinity.)

, assume that $U = \Bbb D = \left\{ {z \in \C: \left|{z}\right| < 1}\right\}$, and that $z_0 = 0$.

Suppose that $f: \Bbb D \setminus \left\{ {0}\right\} \to \C$ is an analytic function that omits two different values $a, b \in \C$.

We need to show that $0$ is a pole or a removable singularity of $f$.

If $f \left({z}\right) \to \infty$ as $z \to 0$, then $0$ is a pole.

So suppose that there is a sequence $z_n \to 0$ such that $f \left({z_n}\right)$ converges to a value $w \ne \infty$.

We may assume that:
 * $\left|{z_n}\right|$ is strictly decreasing
 * $\left|{z_n}\right| < \dfrac 1 2$ for all $n$.

Let $\lambda_n := 2 z_n$.

Consider the sequence of functions:
 * $f_n: \Bbb D \setminus \left\{ {0}\right\} \to \C \setminus \left\{ {a, b}\right\}$

such that:
 * $f_n \left({z}\right) := f \left({\lambda_n z}\right)$

By Montel's Theorem, this family is normal.

So we may assume, passing to a subsequence if necessary, that $f_n$ converges locally uniformly to a holomorphic function or to $\infty$.

Note that:
 * $f_n \left({\dfrac 1 2}\right) = f \left({z_n}\right) \to w$

so $f_n$ does not converge to $\infty$.

Let us set:
 * $K_n := \max_{\left|{z}\right| = 1/2} \left|{f_n \left({z}\right)}\right| = \max_{\left|{z}\right| = \left|{z_n}\right|} \left|{f \left({z}\right)}\right|$

It follows from the above that
 * $\displaystyle K := \sup_{n \mathop \in \N} K_n < \infty$

But by the Maximum Principle:
 * $\left|{f \left({z}\right)}\right| \le \max \left\{{K_{n -1}, K_n}\right\} \le K$

whenever $\left|{z_n}\right| \le \left|{z}\right| \le \left|{z_{n-1} }\right|$.

So $|f \left({z}\right)| \le K$ for $\left|{z}\right| < \left|{z_0}\right|$, and hence $0$ is a removable singularity by the Riemann Removable Singularities Theorem.

Proof that big Picard implies little Picard
By the Fundamental Theorem of Algebra, a nonconstant polynomial does not omit any value.

Hence it suffices to prove the little Picard theorem when $f$ has an essential singularity at $\infty$, in which case it follows from the big Picard theorem.

Remarks
The above proof of the little Picard theorem using the universal cover of a twice-punctured plane can also be used to prove Montel's theorem. There are also more elementary proofs, using Zalcman's Rescaling Lemma.

The little Picard theorem also implies Montel's theorem, using the Rescaling Lemma. Hence all three theorems are equivalent.

This is an instance of the heuristic Bloch principle, which states that properties that force entire functions to be constant also force families of functions to be normal.