# Thread:

1. ## Series of Functions

This is number 2 of the problem set for real analysis problems:

Prove that if
$<br /> \sum_{n=1}^{\infty}{{g_n}}<br />$
converges uniformly, then (g_n) converges uniformly to zero.

2. ## Ideas

Intuitively this makes sense to me. If something converges, then that means the terms eventually get small enough so that they are infinitely small. I just can't put it into formal terms through a proof. Any ideas?

3. Originally Posted by ajj86
This is number 2 of the problem set for real analysis problems:

Prove that if
$<br /> \sum_{n=1}^{\infty}{{g_n}}<br />$
converges uniformly, then (g_n) converges uniformly to zero.
If $\sum_{n=1}^{\infty} g_n$ converges uniformly then it is uniformly Cauchy.
Let $\epsilon > 0$ then there is $N$ so that if $n,m>N$
Then, $\left| \sum_{k=1}^n g_k(x) - \sum_{k=1}^m g_k(x) \right| < \epsilon$ for $x\in S$.
Thus, for example if $n=m+1$ then, $|g_n(x)| < \epsilon$.
Thus, we see that $g_n \to 0$ uniformly on $S$.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 12, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8894844651222229, "perplexity_flag": "middle"}