How Does the Maximum Modulus Principle Apply to Polynomial Functions?

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
5 replies · 3K views
podboy6
Messages
12
Reaction score
0
So my professor threw in what he called an extra 'hard' question for a practice test. So naturally I have a question about it. It relates to the Maximum Modulus Principle:

a) Let [tex]p(z) = a_0 + a_1 z + a_2 z^2 + ...[/tex]
and let M = max |p(z)| on |z|=1.
Show that [tex]|a_i|< M[/tex] for [tex]i = 0,1,2.[/tex]

b) What is the order of the zero at infinity if f(z) is a rational function of the form

[tex]f(z) = \frac {p(z)}{q(z)}[/tex]

where both p(z) and q(z) are both polynomials and [tex]deg(p) < deg(q).[/tex]
 
Last edited:
Physics news on Phys.org
podboy6 said:
a) Let [tex]p(z) = a_0 + a_1 z + a_2 z^2 + ...[/tex]
and let M = max |p(z)| on |z|=1.
Show that [tex]|a_i|< M[/tex] for [tex]i = 0,1,2.[/tex]
As you have it, that's not necessarily true.
Consider:
[tex]p(z) \equiv 0[/tex]
That is, the polynomial is constant zero.
Then [tex]M=0[/tex],but
[tex]a_i = M = 0[/tex] which contradicts [tex]|a_i|<M[/tex]
 
okay, it should be [tex]|a_i|[/tex] is less than or equal to M for [tex]i=0,1,2.[/tex]
 
Well, for the first part, given that |p(z)| [tex]\leq[/tex]|M| for |z|=1,
and with:
p(0)=[tex]a_0[/tex]
p'(0)=[tex]a_1[/tex]
p''(0)=[tex]2a_2[/tex],

then in general,

[tex]|p^k (0)| \geq \frac{k!}{2\pi i} \int_{|z|=1} \frac{f(z)}{z^(k+1)} dz \Rightarrow \frac{k!}{2\pi i} \int_{0}^{2\pi} f( e^(it) ) dt \leq k!M[/tex].

thats about as far for that one. the other one is

[tex]\frac{p(z)}{q(z)} = \frac{a_0 + a_1 z +...+a_k z^k}{b_0 + b_1 z +...+b_l z^l}[/tex] for some l>k. After that, I'm still working.
 
Last edited: