Montel's theorem

Montel's theorem In complex analysis, an area of mathematics, Montel's theorem refers to one of two theorems about families of holomorphic functions. These are named after French mathematician Paul Montel, and give conditions under which a family of holomorphic functions is normal.

Contents 1 Locally uniformly bounded families are normal 2 Functions omitting two values 3 Necessity 4 Proofs 5 Relationship to theorems for entire functions 6 See also 7 Notes 8 References Locally uniformly bounded families are normal The first, and simpler, version of the theorem states that a family of holomorphic functions defined on an open subset of the complex numbers is normal if and only if it is locally uniformly bounded.

This theorem has the following formally stronger corollary. Suppose that {displaystyle {mathcal {F}}} is a family of meromorphic functions on an open set {displaystyle D} . If {displaystyle z_{0}in D} is such that {displaystyle {mathcal {F}}} is not normal at {displaystyle z_{0}} , and {displaystyle Usubset D} is a neighborhood of {displaystyle z_{0}} , then {displaystyle bigcup _{fin {mathcal {F}}}f(U)} is dense in the complex plane.

Functions omitting two values The stronger version of Montel's Theorem (occasionally referred to as the Fundamental Normality Test) states that a family of holomorphic functions, all of which omit the same two values {displaystyle a,bin mathbb {C} ,} is normal.

Necessity The conditions in the above theorems are sufficient, but not necessary for normality. Indeed, the family {displaystyle {zmapsto z}} is normal, but does not omit any complex value.

Proofs The first version of Montel's theorem is a direct consequence of Marty's Theorem (which states that a family is normal if and only if the spherical derivatives are locally bounded) and Cauchy's integral formula.[1] This theorem has also been called the Stieltjes–Osgood theorem, after Thomas Joannes Stieltjes and William Fogg Osgood.[2] The Corollary stated above is deduced as follows. Suppose that all the functions in {displaystyle {mathcal {F}}} omit the same neighborhood of the point {displaystyle z_{1}} . By postcomposing with the map {displaystyle zmapsto {frac {1}{z-z_{1}}}} we obtain a uniformly bounded family, which is normal by the first version of the theorem.

The second version of Montel's theorem can be deduced from the first by using the fact that there exists a holomorphic universal covering from the unit disk to the twice punctured plane {displaystyle mathbb {C} setminus {a,b}} . (Such a covering is given by the elliptic modular function).

This version of Montel's theorem can be also derived from Picard's theorem, by using Zalcman's lemma.

Relationship to theorems for entire functions A heuristic principle known as Bloch's Principle (made precise by Zalcman's lemma) states that properties that imply that an entire function is constant correspond to properties that ensure that a family of holomorphic functions is normal.

For example, the first version of Montel's theorem stated above is the analog of Liouville's theorem, while the second version corresponds to Picard's theorem.

See also Montel space Fundamental normality test Notes ^ Hartje Kriete (1998). Progress in Holomorphic Dynamics. CRC Press. p. 164. Retrieved 2009-03-01. ^ Reinhold Remmert, Leslie Kay (1998). Classical Topics in Complex Function Theory. Springer. p. 154. Retrieved 2009-03-01. References John B. Conway (1978). Functions of One Complex Variable I. Springer-Verlag. ISBN 0-387-90328-3. "Montel theorem", Encyclopedia of Mathematics, EMS Press, 2001 [1994] J. L. Schiff (1993). Normal Families. Springer-Verlag. ISBN 0-387-97967-0.

This article incorporates material from Montel's theorem on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.

Categories: Compactness theoremsTheorems in complex analysis

Si quieres conocer otros artículos parecidos a Montel's theorem puedes visitar la categoría Compactness theorems.

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