Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

Prove that the sequence of functions $\{f_{n}(z) = (1+nz)^{-1}\mid n=1,2,...\}$ converges uniformly to $f(z)=0$ for $|z| \geq r > 0$. To answer the question, for a given choice of $\epsilon > 0$, you must show how to choose $N$ such that if $n \geq N$, then $|f_{n}(z)-0|=|f_{n}(z)| < \epsilon$.

How would I begin this proof?

share|cite|improve this question

HINT: For a fixed $n$, if you know that $|z|\ge r$, what is the largest possible value of $$\left|\frac1{1+nz}\right|\;?$$ Since convergence depends only on what happens in the long run, you may assume that $n$ is big enough so that $nr>1$.

share|cite|improve this answer
    
I'm more confused on how I choose an E and how I can find N to satisfy the condition. – warpstack Dec 9 '11 at 12:19

Your Answer

 
discard

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.