# Limits in $C[0,1]$

Let $(x_i)$ be a sequence of numbers in $(0,1)$ such that $\lim_{n \to \infty} \left( \frac{1}{n} \right) \sum_{i = 1}^n x_i^k$ exists for all integers $k \geq 0$. Show that $\lim_{n \to \infty} \left( \frac{1}{n} \right) \sum_{i = 1}^n f(x_i)$ exists for all functions $f \in C[0,1]$.

I was wondering if I could get a hint?

-

## 1 Answer

• Show that $\lim_{n\to \infty}\frac 1n\sum_{i=1}^nP(x_i)$ exists for any polynomial $P$.
• Conclude by a well known theorem about approximation of continuous functions on a compact subset of the real line.
-
{"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": 9, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "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.947964608669281, "perplexity_flag": "head"}