Trying to Prove Uniform Convergence: Analysis II

Abraham
Messages
68
Reaction score
0

Homework Statement



I have a solution to the following problem. I feel it is somewhat questionable though

If fn converges uniformly to f, i.e. fn\rightarrowf as n\rightarrow∞ and
gn converges uniformly to g, i.e. gn\rightarrowf as n\rightarrow∞ ,

Prove that fngn \rightarrow fg

The domain is ℝ for all functions.

The Attempt at a Solution



If f and g are uniformly continuous, then for any ε>0, there is an N for which n\geqN implies | fn - f | < ε. The same for g.

This is my idea:

For any given ε >0, find N such that for n>N, |fn-f| < ε1, and |gn-f| < ε1. This ε1 should be made very small, such that:

|fngn - fg| = | (f+ε1)(g+ε1) - fg|
= | f*g + f*ε1 + g*ε1 + (ε1)2 - fg|
The ε1 terms can be made very small as needed, such that:
= | f*g + [STRIKE]f*ε1[/STRIKE] +[STRIKE] g*ε1[/STRIKE] + [STRIKE](ε1)2[/STRIKE] - fg| < ε

Agree, or disagree? Secondly, is there a shorter, simpler method? Thanks.
--Abraham
 
Last edited:
Physics news on Phys.org
Abraham said:

Homework Statement



I have a solution to the following problem. I feel it is somewhat questionable though

If f is uniformly continuous, i.e. fn\rightarrowf as n\rightarrow∞ and
g is uniformly continuous, i.e. gn\rightarrowf as n\rightarrow∞ ,

Prove that fngn \rightarrow fg

The Attempt at a Solution



If f and g are uniformly continuous, then for any ε>0, there is an N for which n\geqN implies | fn - f | < ε. The same for g.

This is my idea:

For any given ε >0, find N such that for n>N, |fn-f| < ε1, and |gn-f| < ε1.

I probably should refrain from answering this because I have to leave momentarily. But my suggestion is that you need to state the question more carefully to begin with. I think you are confusing the ideas of uniform continuity and uniform convergence. You haven't told us what ##f_n\rightarrow f## means. Pointwise convergence? Uniform convergence? Any information about the domain? Problems like this are frequently addressed by adding and subtracting terms:$$|f_ng_n-fg|
=|f_ng_n-f_ng+f_ng-fg|$$ and working with that.
 
Sorry, I wrote the problem incorrectly. I meant to write:

fn converges uniformly to f, i.e. fn→f.

I don't know why I wrote "uniformly continuous" instead...

I see what you mean though, adding and subtracting quantities. I'll start with that.
 
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