Proving Convergence of f_n(a_n) to f(a) Given Uniform Convergence of f_n on I

Treadstone 71
Messages
275
Reaction score
0
"Suppose f_n are defined and continuous on an interval I. Assume that f_n converges uniformly to f on I. If a_n in I is a sequence and a_n -> a, prove that f_n(a_n) converges to f(a)."

I don't understand the question. Doesn't uniform convergence imply that for all x in I and e>0, | f_n(x) - f(x) | < e? So in particular, |f_n(a_n) - f(a) | < e.
 
Physics news on Phys.org
Wait, nevermind. | f_n(a_n) - f(a_n) | <e, not f(a).
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top