Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Statement  





2 An inequality of Grunsky  



2.1  Proof  







3 Proof of the theorem  





4 References  














Grunsky's theorem






Svenska
 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


Inmathematics, Grunsky's theorem, due to the German mathematician Helmut Grunsky, is a result in complex analysis concerning holomorphic univalent functions defined on the unit disk in the complex numbers. The theorem states that a univalent function defined on the unit disc, fixing the point 0, maps every disk |z| < r onto a starlike domain for r ≤ tanh π/4. The largest r for which this is true is called the radius of starlikeness of the function.

Statement[edit]

Let f be a univalent holomorphic function on the unit disc D such that f(0) = 0. Then for all r ≤ tanh π/4, the image of the disc |z| < risstarlike with respect to 0, , i.e. it is invariant under multiplication by real numbers in (0,1).

An inequality of Grunsky[edit]

Iff(z) is univalent on D with f(0) = 0, then

Taking the real and imaginary parts of the logarithm, this implies the two inequalities

and

For fixed z, both these equalities are attained by suitable Koebe functions

where |w| = 1.

Proof[edit]

Grunsky (1932) originally proved these inequalities based on extremal techniques of Ludwig Bieberbach. Subsequent proofs, outlined in Goluzin (1939), relied on the Loewner equation. More elementary proofs were subsequently given based on Goluzin's inequalities, an equivalent form of Grunsky's inequalities (1939) for the Grunsky matrix.

For a univalent function ginz > 1 with an expansion

Goluzin's inequalities state that

where the zi are distinct points with |zi| > 1 and λi are arbitrary complex numbers.

Taking n = 2. with λ1 = – λ2 = λ, the inequality implies

Ifg is an odd function and η = – ζ, this yields

Finally if f is any normalized univalent function in D, the required inequality for f follows by taking

with

Proof of the theorem[edit]

Let f be a univalent function on D with f(0) = 0. By Nevanlinna's criterion, f is starlike on |z| < r if and only if

for |z| < r. Equivalently

On the other hand by the inequality of Grunsky above,

Thus if

the inequality holds at z. This condition is equivalent to

and hence f is starlike on any disk |z| < r with r ≤ tanh π/4.

References[edit]


Retrieved from "https://en.wikipedia.org/w/index.php?title=Grunsky%27s_theorem&oldid=961784481"

Category: 
Theorems in complex analysis
 



This page was last edited on 10 June 2020, at 11:35 (UTC).

Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



Privacy policy

About Wikipedia

Disclaimers

Contact Wikipedia

Code of Conduct

Developers

Statistics

Cookie statement

Mobile view



Wikimedia Foundation
Powered by MediaWiki