Picard theorem

Picard theorem For the theorem on existence and uniqueness of solutions of differential equations, see Picard–Lindelöf theorem.

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.

Contents 1 The theorems 2 Proof 2.1 Little Picard Theorem 2.2 Great Picard Theorem 3 Generalization and current research 4 Notes 5 References The theorems Domain coloring plot of the function exp(1⁄z), centered on the essential singularity at z = 0. The hue of a point z represents the argument of exp(1⁄z), the luminance represents its absolute value. This plot shows that arbitrarily close to the singularity, all non-zero values are attained.

Little Picard Theorem: If a function {textstyle f:mathbb {C} to mathbb {C} } is entire and non-constant, then the set of values that {textstyle f(z)} 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 f omits two values, then the composition of f with the inverse of the modular function maps the plane into the unit disc which implies that f 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 f are missing a single point, this point is called a lacunary value of the function.

Great Picard's Theorem: If an analytic function f has an essential singularity at a point {textstyle w} , then on any punctured neighborhood of {textstyle w,f(z)} 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 {textstyle f} 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, {textstyle e^{frac {1}{z}}} has an essential singularity at 0, but still never attains 0 as a value. Proof Little Picard Theorem Suppose {textstyle f:mathbb {C} to mathbb {C} } is an entire function that omits two values {textstyle z_{0}} and {textstyle z_{1}} . By considering {textstyle {frac {f(z)-z_{0}}{z_{1}-z_{0}}}} we may assume without loss of generality that {textstyle z_{0}=0} and {textstyle z_{1}=1} .

Because {textstyle mathbb {C} } is simply connected and the range of {textstyle f} omits {textstyle 0} , f has a holomorphic logarithm. Let {textstyle g} be an entire function such that {textstyle f(z)=e^{2pi ig(z)}} . Then the range of {textstyle g} omits all integers. By a similar argument using the quadratic formula, there is an entire function {textstyle h} such that {textstyle g(z)=cos(h(z))} . Then the range of {textstyle h} omits all complex numbers of the form {textstyle 2pi npm icosh ^{-1}(m)} , where {textstyle n} is an integer and {textstyle m} is a nonnegative integer.

By Landau's theorem, if {textstyle h'(w)neq 0} , then for all {textstyle {R>0}} , the range of {textstyle h} contains a disk of radius {textstyle |h'(w)|R/72} . But from above, any sufficiently large disk contains at least one number that the range of h omits. Therefore {textstyle h'(w)=0} for all {textstyle w} . By the fundamental theorem of calculus, {textstyle h} is constant, so {textstyle f} is constant.

Great Picard Theorem show Proof of the Great Picard Theorem Generalization and current research Great Picard's theorem is true in a slightly more general form that also applies to meromorphic functions: Great Picard's Theorem (meromorphic version): If M is a Riemann surface, w a point on M, P1(C) = C ∪ {∞} denotes the Riemann sphere and f : M{w} → P1(C) is a holomorphic function with essential singularity at w, then on any open subset of M containing w, the function f(z) attains all but at most two points of P1(C) infinitely often.

Example: The function f(z) = 1/(1 − e1/z) is meromorphic on C* = C - {0}, the complex plane with the origin deleted. It has an essential singularity at z = 0 and attains the value ∞ infinitely often in any neighborhood of 0; however it does not attain the values 0 or 1.

With this generalization, Little Picard Theorem follows from Great Picard Theorem because an entire function is either a polynomial or it has an essential singularity at infinity. As with the little theorem, the (at most two) points that are not attained are lacunary values of the function.

The following conjecture is related to "Great Picard's Theorem":[1] Conjecture: Let {U1, ..., Un} be a collection of open connected subsets of C that cover the punctured unit disk D  {0}. Suppose that on each Uj there is an injective holomorphic function fj, such that dfj = dfk on each intersection Uj ∩ Uk. Then the differentials glue together to a meromorphic 1-form on D.

It is clear that the differentials glue together to a holomorphic 1-form g dz on D  {0}. In the special case where the residue of g at 0 is zero the conjecture follows from the "Great Picard's Theorem".

Notes ^ Elsner, B. (1999). "Hyperelliptic action integral" (PDF). Annales de l'Institut Fourier. 49 (1): 303–331. doi:10.5802/aif.1675. References Conway, John B. (1978). Functions of One Complex Variable I (2nd ed.). Springer. ISBN 0-387-90328-3. Shurman, Jerry. "Sketch of Picard's Theorem" (PDF). Retrieved 2010-05-18. Categories: Theorems in complex analysis

Si quieres conocer otros artículos parecidos a Picard theorem puedes visitar la categoría Theorems in complex analysis.

Deja una respuesta

Tu dirección de correo electrónico no será publicada.


Utilizamos cookies propias y de terceros para mejorar la experiencia de usuario Más información