Théorèmes de Picard

In complex analysis, Picard's great theorem and Picard's little theorem are related theorems about the range of an analytic function. They are named after Émile Picard. Little Picard Theorem: If a function is entire and non-constant, then the set of values that assumes is either the whole complex plane or the plane minus a single point. Sketch of Proof: Picard's original proof was based on properties of the modular lambda function, usually denoted by , and which performs, using modern terminology, the holomorphic universal covering of the twice punctured plane by the unit disc. This function is explicitly constructed in the theory of elliptic functions. If omits two values, then the composition of with the inverse of the modular function maps the plane into the unit disc which implies that is constant by Liouville's theorem. This theorem is a significant strengthening of Liouville's theorem which states that the image of an entire non-constant function must be unbounded. Many different proofs of Picard's theorem were later found and Schottky's theorem is a quantitative version of it. In the case where the values of are missing a single point, this point is called a lacunary value of the function. Great Picard's Theorem: If an analytic function has an essential singularity at a point , then on any punctured neighborhood of takes on all possible complex values, with at most a single exception, infinitely often. This is a substantial strengthening of the Casorati–Weierstrass theorem, which only guarantees that the range of is dense in the complex plane. A result of the Great Picard Theorem is that any entire, non-polynomial function attains all possible complex values infinitely often, with at most one exception. The "single exception" is needed in both theorems, as demonstrated here: ez is an entire non-constant function that is never 0, has an essential singularity at 0, but still never attains 0 as a value. Suppose is an entire function that omits two values and . By considering we may assume without loss of generality that and .