Equivalent characterization of uniform convergence

Click For Summary
SUMMARY

The discussion centers on the characterization of uniform convergence in calculus, specifically the equivalence between the uniform convergence of a sequence of functions \( f_n \) to a function \( f \) on a non-empty set \( M \) and the condition that the limit of the supremum of the absolute differences approaches zero. The proof demonstrates that uniform convergence is defined by the condition \( \lim_{n \rightarrow \infty} \sup_{x \in M} |f_n(x) - f(x)| = 0 \). A key point of confusion addressed is the use of \( \leq \epsilon \) instead of \( < \epsilon \) in the proof, clarified by the standard result regarding the supremum of a set of real numbers.

PREREQUISITES
  • Understanding of uniform convergence in calculus
  • Familiarity with the concepts of supremum and limits
  • Basic knowledge of real analysis
  • Experience with function sequences and their convergence properties
NEXT STEPS
  • Study the definitions and properties of uniform convergence in detail
  • Explore the concept of supremum in real analysis
  • Learn about the implications of uniform convergence on integration and differentiation
  • Investigate examples of uniform convergence in various function spaces
USEFUL FOR

Students and professionals in mathematics, particularly those studying real analysis, calculus, or anyone interested in the properties of function sequences and their convergence behavior.

twoflower
Messages
363
Reaction score
0
Hi all,

I'm learning some calculus theory and I found one point I don't fully understand:

<br /> \mbox{Let M} \subset \mathbb{R} \mbox{ be non-empty set and let } f, f_{n}, n \in \mathbb{N} \mbox{ be functions defined on M. Then the following is true:}<br />

<br /> f_n \rightrightarrows f \mbox{ on M} \Leftrightarrow \lim_{n \rightarrow \infty} \sup \left\{\left|f_{n}(x) - f(x)\right|; x \in M \right\} = 0<br />

Proof:

<br /> f_{n} \rightrightarrows f \mbox{ on M }<br />

<br /> \Leftrightarrow\ \forall \epsilon &gt; 0\ \exists n_{0} \in \mathbb{N}\ \forall n \geq n_{0} \forall x \in M\ : |f_{n}(x) - f(x)| &lt; \epsilon<br />

<br /> \Leftrightarrow \forall \epsilon &gt; 0\ \exists n_{0} \in \mathbb{N}\ \forall n \geq n_{0} : \sup_{x \in M} \left\{ | f_{n}(x) - f(x) | \leq \epsilon \right\}<br />

<br /> \Leftrightarrow \lim_{n \rightarrow \infty} \left( \sup_{x \in M} |f_{n}(x) - f(x)| \right) = 0<br />

I don't get why in the last but one condition in the proof there is \leq \epsilon[/tex] instead of &amp;lt; \epsilon[/tex].&lt;br /&gt; &lt;br /&gt; Could you please tell me the reason?&lt;br /&gt; &lt;br /&gt; Thank you very much&lt;br /&gt; &lt;br /&gt; &lt;br /&gt; Standa.
 
Last edited:
Physics news on Phys.org
This case it is the standard result that if S is a set of real number and, for all s in S, s<K, then sup(s)<=K. E.g. take S =(0,1), every s in S is strictly less than 1, but the sup is 1.
 
Thank you matt! I see it now.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K