Let
be
holomorphic
on
.
Also, suppose the following holds:
Then which of the following necessarily holds?
Details and Assumptions:
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
A more elementary proof, using lower levels of complex analysis, runs as follows. We can find R > 0 such that ∣ f ( z ) ∣ ≥ 1 for all ∣ z ∣ ≥ R . Thus all zeros of f lie in the compact set { z : ∣ z ∣ ≤ R } . Since f is not constant, it must have at most a finite number of zeros, and so we can write f ( z ) = p ( z ) g ( z ) where p ( z ) is a polynomial and g ( z ) is an entire function with no zeros. But then g − 1 is entire without zeros, and we can find K > 0 such that ∣ ∣ ∣ g ( z ) 1 ∣ ∣ ∣ = ∣ ∣ ∣ f ( z ) p ( z ) ∣ ∣ ∣ ≤ K ∣ z ∣ ∂ p ∣ z ∣ ≥ R where ∂ p is the degree of p ( z ) . Considering Taylor's Theorem for the entire function g − 1 we know that g ( z ) 1 = m = 0 ∑ ∞ b m z m , z ∈ C where b m = 2 π i 1 ∫ ∣ z ∣ = S g ( z ) z m + 1 d z m ≥ 0 , S > 0 and hence it follows that ∣ b m ∣ ≤ K S ∂ p − m m ≥ 0 , S ≥ R and hence that b m = 0 for all m > ∂ p . Thus g − 1 is a polynomial without zeros, and hence is constant. This implies that f is a polynomial . This implies that f is surjective, and that the range of f is cofinite, but does not force f to be either injective or bijective.