There is N so that[tex] |S_n(x) - S_m(x)| \leq \epsilon [/tex] for

  • Thread starter Thread starter Pearce_09
  • Start date Start date
Click For Summary
SUMMARY

The discussion focuses on proving uniform convergence of a sequence of functions \( s_n(x) \) to a function \( S(x) \) using Cauchy's criterion. It establishes that if \( |S_n(x) - S_m(x)| < \epsilon \) for all \( x \) in the interval \( I \) when \( n, m \geq N \), then the series converges pointwise to \( S(x) \). The key claim is that uniform convergence is achieved if the sequence satisfies Cauchy's criterion, which requires demonstrating that the convergence holds uniformly across the interval.

PREREQUISITES
  • Understanding of Cauchy's criterion for convergence
  • Familiarity with pointwise and uniform convergence of functions
  • Knowledge of sequences and limits in real analysis
  • Basic concepts of function spaces and continuity
NEXT STEPS
  • Study the formal definition of uniform convergence in detail
  • Explore examples of sequences of functions that converge uniformly
  • Learn about the implications of uniform convergence on integration and differentiation
  • Investigate the relationship between pointwise and uniform convergence in function analysis
USEFUL FOR

Mathematicians, students of real analysis, and anyone studying convergence properties of sequences of functions will benefit from this discussion.

Pearce_09
Messages
71
Reaction score
0
there is N so that
[tex]|S_n(x) - S_m(x)| \leq \epsilon[/tex] for ever x in I if n,m [tex]\geq[/tex] N

( prove by cauchy's criterion )

claim: [tex]lim S_n(x) = S(x)[/tex]

[tex]|S_n(x) - S(x)| < \epsilon /2[/tex] if n[tex]\geq N[/tex]
then,
[tex]|S_n(x) - S_m(x)| < |S_n(x) - S(x)| + |S(x) - S_m(x)|[/tex]
< [tex]\epsilon /2 + \epsilon /2[/tex]
< [tex]\epsilon[/tex]

therefor the series converges pointwise to a funtion S(x)
... and I am not sure how to show that this converging uniformly on I
 
Last edited:
Physics news on Phys.org
How did you define uniform convergence?

I have that a sequence of functions [itex]s_n \left( x \right)[/itex] converges uniformely to the function [itex]\ell :\left( {a,b} \right) \to \mathbb{R}[/itex] if:

[tex]\forall \varepsilon > 0,\exists n > N \Rightarrow \forall x \in \left( {a,b} \right):\left| {s_n \left( x \right) - \ell \left( x \right)} \right| < \varepsilon[/tex]

If I understand, you need to show that a sequence of functions [itex]s_n \left( x \right)[/itex] converges uniformely over that interval iff (I believe you only have to prove it one way, using this to prove uniform convergence) it satisfies Cauchy's criterion, being:

[tex]\forall \varepsilon > 0,\exists N:m,n > N \Rightarrow \forall x \in \left( {a,b} \right):\left| {s_n \left( x \right) - s_m \left( x \right)} \right| < \varepsilon[/tex] (*)

So assume that [itex]\left( {s_n } \right)[/itex] satisfies (*). Then for all x in I, the numerical sequence [itex]\left( {s_n \left( x \right)} \right)[/itex] is a Cauchy-sequence and is therefore convergent, call the limit l(x). So we already have pointwise convergence to l(x), the only thing you need to show now is that the convergence is uniform. Now use the assumption of Cauchy's criterion.
 

Similar threads

Replies
7
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
9
Views
2K
Replies
11
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 7 ·
Replies
7
Views
1K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K