Trying to Prove Uniform Convergence: Analysis II

Click For Summary
SUMMARY

The discussion centers on proving that if two sequences of functions, \( f_n \) and \( g_n \), converge uniformly to \( f \) and \( g \) respectively, then the product \( f_n g_n \) converges uniformly to \( fg \). The user, Abraham, proposes a method involving the selection of a small \( \epsilon_1 \) to show that the difference \( |f_n g_n - fg| \) can be made less than any given \( \epsilon \). Another participant emphasizes the importance of clearly distinguishing between uniform continuity and uniform convergence, suggesting that the problem should be reformulated for clarity.

PREREQUISITES
  • Understanding of uniform convergence of sequences of functions
  • Familiarity with the concept of uniform continuity
  • Knowledge of epsilon-delta definitions in analysis
  • Ability to manipulate inequalities involving limits and products
NEXT STEPS
  • Study the definitions and properties of uniform convergence in detail
  • Learn about the implications of uniform continuity on function behavior
  • Explore techniques for proving convergence of products of functions
  • Investigate common pitfalls in distinguishing between uniform convergence and pointwise convergence
USEFUL FOR

Mathematics students, particularly those studying real analysis, and anyone interested in understanding the nuances of convergence in functional sequences.

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.
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
4
Views
5K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 18 ·
Replies
18
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K