Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

could any one help me to understand the Proposition $3.1$, specially why $p$ will be a polynomial? Thank you!

share|cite|improve this question
up vote 1 down vote accepted

Following the notation of the proof, first we construct $f(z) = p(z)/q(z)$, where $q$ is the polynomial whose zeroes are the poles of $f$ (with corresponding multiplicities), and thus we have $p(z) = f(z) q(z)$. Since both $f(z)$ and $q(z)$ are meromorphic on the Riemann sphere, then $p$ must also be meromorphic on the Riemann sphere.

However, $p$ is also a entire function on $\mathbb{C}$. So the key fact to prove is

The only entire functions on $\mathbb{C}$ that are meromorphic on $\hat{\mathbb{C}}$ are polynomials.

To prove this, write $p(z) = \sum_k a_k z^k$. Then $p(z)$ is entire on $\mathbb{C}$, so it only remains to check that $\infty$ is a pole. This is equivalent to showing that the function $g(z) : = p(1/z)$ has a pole at $z = 0$. The Laurent series expansion of $g(z)$ about $z = 0$ is precisely $g(z) = \sum_k a_k z^{-k}$. If indeed $g$ has a pole of order $N$ at $z = 0$, then $a_k = 0$ for all $k > N$ for some fixed $N$. But then $p(z)$ is a polynomial of order $N$.

share|cite|improve this answer
but you did not prove that there is a pole of order $N$ at $z=0$ of $g(z)$, you just assumed, am I right? – Un Chien Andalou Mar 7 '13 at 2:58
$g$ is meromorphic, so either it has a pole at zero or it is holomorphic at zero. – Christopher A. Wong Mar 7 '13 at 7:57

Your function has a pole of finite order at $\infty$. Does this help?

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.