Community

Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.
Login Register Memberlist Search AoPS Blogs Contests Galleries Forum Index
The time now is Thu Dec 03, 2009 4:23 am
All times are UTC - 8
View posts since last visit
View unanswered posts
schwarz lemma exercies
Moderators: College Playground Moderators
Post new topic   Reply to topic View previous topicView next topic
5 Posts • Page 1 of 1
Author Message
mokong
New Member
New Member

Offline
Joined: 23 Mar 2004
Posts: 4

To rate posts you must be logged in
#1
schwarz lemma exercies

f(z) is analytic on and within the unit circle. Also, |f(z)| < 1 for |z| <= 1 and f(0) = 0. Show that f(z) < |z| for |z|<= 1.

I know this can be done by the max mod principle, but I'm following a way which doesn't seem to use it.

After showing f(z)/z is analytic, I am to express [f(z_0)/z_0]^n by the Cauchy integral formula, so that maybe later I would come with |f(z_0)/z_0|^n <= 1. I still can't get any expression via the Cauchy integral formula that does this. Maybe someone has an idea to do this?

Any help would be greatly appreciated! Thanks..

PostPosted: Sun Sep 12, 2004 4:56 pm  Back to top 
  ProfilePM
Kent Merryfield
Birch & Swinnerton Dyer
Birch & Swinnerton Dyer

Offline
Joined: 11 Jun 2004
Posts: 11409
Location: Long Beach, CA
United States

To rate posts you must be logged in
#2
I'm not quite sure why you're trying to avoid the maximum modulus principle, since that principle is so naturally suited to the proof of this theorem. I need to guess what you mean by "[f(z_0)/z_0]^n".

Maybe this is what you're looking for: Suppose that |h(\zeta)|<1 for |\zeta|= 1 and note that for \zeta on the boundary circle, \frac1{|\zeta-z|}\le\frac1{1-|z|}. Put this into the Cauchy Integral Formula for h to get that |h(z)|<\frac1{|2\pi i|}\int_{|\zeta|=1}\frac{|h(\zeta)||d\zeta|}{|\zeta-z|} < \frac1{1-|z|}. Now let h(z) = (g(z))^n where g(z)=\frac{f(z)}z. Since this satisfies the boundary estimate no matter what n is, we get that |g(z)|^n<\frac1{1-|z|} \forall n. This estimate can only be true independent of n if |g(z)|\le 1. That's our proof. It also seems to be an extra-hard way to prove the maximum modulus principle in the first place.
Last edited by Kent Merryfield on Sat Sep 18, 2004 4:12 pm; edited 1 time in total 
PostPosted: Sun Sep 12, 2004 9:10 pm  Back to top 
  ProfilePM
mokong
New Member
New Member

Offline
Joined: 23 Mar 2004
Posts: 4

To rate posts you must be logged in
#3
wow! that was great kent. thanks a lot! Very Happy

just some minor questions..

how did you get the inequality |{z_1 - z_2}|\ge\,||z_1| - z_2|, and did you mean |h(z)| \le \frac{1}{|2 \pi i|} \displaystyle\int_{|\zeta|=1}\frac{|h(\zeta)||d\zeta|}{|\zeta - z|}

i cant use the max mod becaue it wasnt proved in the book.. its a math physics text, unfortunately. Sad

again, thanks a lot!

PostPosted: Sat Sep 18, 2004 3:35 am  Back to top 
  ProfilePM
Kent Merryfield
Birch & Swinnerton Dyer
Birch & Swinnerton Dyer

Offline
Joined: 11 Jun 2004
Posts: 11409
Location: Long Beach, CA
United States

To rate posts you must be logged in
#4
I've just realized a mistake in what I wrote: that shouldn't be \frac1{|\zeta-z|}\le\frac1{|1-z|}; instead it should be \frac1{|\zeta-z|}\le\frac1{1-|z|}. I'll go back and edit this to fix it.

As to where that inequality involving |h(z)| and the integral: that simply is the Cauchy Integral Formula, followed by applying the theorem (think of it as an analogue of the triangle inequality) that the absolute value of an integral is less than or equal to the integral of the absolute value. (Have you seen the proof of that for complex valued functions?)

I still don't particularly like this proof, becuase I would prefer to first prove, then use, the Maximum Modulus Principle. I see Max Mod as a more elementary and more accessible theorem than Schwarz, so why not prove it first?

PostPosted: Sat Sep 18, 2004 4:09 pm  Back to top 
  ProfilePM
mokong
New Member
New Member

Offline
Joined: 23 Mar 2004
Posts: 4

To rate posts you must be logged in
#5
thanks for clearing that up. Smile we just did it via max mod in class this morning, and yup, it was more straightforward and much easier.

thanks for helping out! it was nice knowing two proofs of the same theorem.

PostPosted: Sat Sep 18, 2004 9:08 pm  Back to top 
  ProfilePM
Display posts from previous:   Sort by:   
5 Posts • Page 1 of 1
Post new topic   Reply to topic View previous topicView next topic
Jump to:  

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum
You cannot post calendar events in this forum


© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us