Intereting Posts

Finding a prime number $p$ and $x, y, z\in \mathbb N$ such that $x^p+y^p=p^z$
Why does the amoeba shrink to its skeleton when we go to infinity?
Solve the pde $u_t(x,t)=u_{xx}(x,t)-bu(x,t)+q(t)$ for $u(x,t)$
How many planar arrangements of $n$ circles?
Generators of a cyclic group
For which $s\in\mathbb R$, is $H^s(\mathbb T)$ a Banach algebra?
If $R$ and $R]$ are isomorphic, then are they isomorphic to $R$ as well?
How can I find the points at which two circles intersect?
Proof for convergence of a given progression $a_n := n^n / n!$
Embedding $\mathbb{F}_{q^2}^*$ into $GL_2(\mathbb{F}_{q})$
Concerning the sequence $\Big(\dfrac {\tan n}{n}\Big) $
List of Local to Global principles
expectation of $\int_0^t W_s^2 dW_s $ (integral of square of brownian wrt to brownian)
How to Self-Study Mathematical Methods?
How to calculate the expected value when betting on which pairings will be selected

Let $\{f_n\}$ be an equicontinuous family of functions on $[0,1]$ such that each $f_n$ is pointwise bounded and $\int_{[a,b]} f_n(x)dx \rightarrow 0$ as $n\rightarrow \infty$, for every $ 0\leq a \leq b \leq 1$.

Show $f_n$ converges to $0$ uniformly.

For this question I know that there exists a uniformly convergent subsequence $f_{n_k}$ by Arzela-Ascoli Theorem. For this uniformly convergent sequence I know $$\lim_{n\rightarrow \infty} \int_a^bf_{n_k}(x)dx = \int_a^b \lim_{n\rightarrow \infty}f_{n_k}(x)dx$$

Since the left side is zero If we assume $\lim_{n\rightarrow \infty}f_{n_k}(x)dx \neq \ 0$ for some $x\in [0,1]$ Then uniform continuity of the limit implies that it is $\neq 0$ on some interval which implies the integral is $\neq 0$ Which is a contradiction . Thus $f_{n_k}$ must converge uniformly to $0$. I don’t see how to get to $f_n$ converges uniformly to $0$ though.

- Finite Sum $\sum\limits_{k=1}^{m-1}\frac{1}{\sin^2\frac{k\pi}{m}}$
- Why does $1+2+3+\cdots = -\frac{1}{12}$?
- Uniform continuity on $$ and $ $ $\implies$ uniform continuity on $$.
- Prove $x^n$ is not uniformly convergent
- Is there a proof that there is no general method to solve transcendental equations?
- Mean Value Theorem for the Second Derivative

- Gaussian-like integral : $\int_0^{\infty} e^{-x^2} \cos( a x) \ \mathrm{d}x$
- Analytic Applications of Stone-Čech compactification
- Riemann's thinking on symmetrizing the zeta functional equation
- Maximal ideals in the ring of real functions on $$
- Converging series question, Prove that if $\sum_{n=1}^{\infty} a_n^{2}$ converges, then does $\sum_{n=1}^{\infty} \frac {a_n}{n}$
- If $\sum a_n$ converges, then $\sum \sqrt{a_na_{n+1}}$ converges
- Does a nonlinear additive function on R imply a Hamel basis of R?
- Show $\lim_{n \to \infty} \sum_{i=1}^n Y_i/\sum_{i=1}^n Y_i^2 = 1$ for Bernoulli distributed random variables $Y_i$
- In what way is the Peano curve not one-to-one with $^2$?
- If $\int_A f\,dm = 0$ for all $A$ having some fixed measure $C$, then $f = 0$ almost everywhere

You essentially proved: Every subsequence of $(f_n)$ has a (sub-)subsequence which converges uniformly to zero (why?).

The first bullet point in the link I provided in a comment asserts that then the sequence $(f_n)$ itself must converge to zero.

Here’s why: Suppose $f_{n}$ does not converge uniformly to zero. Then there is an $\varepsilon \gt 0$ and a subsequence $f_{n_j}$ with sup-norm $\|f_{n_j}\|_{\infty} \geq \varepsilon$ for all $j$. This subsequence has again a convergent subsequence by Arzelà-Ascoli. Your argument shows that its limit must be zero, hence the subsequence must have uniform norm $\lt \varepsilon$ eventually, contradiction.

Here’s the abstract thing:

Let $x_n$ be a sequence in a metric space $(X,d)$. Suppose that there is $x \in X$ such that every subsequence $(x_{n_j})$ has a subsubsequence $(x_{n_{j_k}})$ converging to $x$. Then the sequence itself converges to $x$.

**Edit:** As leo pointed out in a comment below the converse is also true: a convergent sequence obviously has the property that every subsequence has a convergent subsubsequence.

The proof is trivial but unavoidably uses ugly notation: Suppose $x_n$ does not converge to $x$. Then there is $\varepsilon \gt 0$ and a subsequence $(x_{n_j})$ such that $d(x,x_{n_j}) \geq \varepsilon$ for all $j$. By assumption there is a subsubsequence $x_{n_{j_k}}$ converging to $x$. But this means that $d(x,x_{n_{j_k}}) \lt \varepsilon$ for $k$ large enough. Impossible!

The way this is usually applied in “concrete situations” is to show

- If a subsequence converges then it
*must*converge to a specific $x$. This involves an analysis of the specific situation—this is usually the harder part and that’s what you did. - Appeal to compactness to find a convergent subsubsequence of every subsequence—that’s the trivial part I contributed.

- Proof: $\lim_{n\to\infty} (1-\frac{1}{n})^{-n} = e$
- Determine the degree of the splitting field for $f(x)=x^{15}-1$.
- How to prove that two non-zero linear functionals defined on the same vector space and having the same null-space are proportional?
- Product of a Lebesgue measurable function with an indicator function is measurable
- A real differentiable function is convex if and only if its derivative is monotonically increasing
- When the sum of independent Markov chains is a Markov chain?
- Dual Optimization Problem
- precise official definition of a cell complex and CW-complex
- Uniform convexity of equivalent intersection norm
- Joint moments of Brownian motion
- Applications of Algebra in Physics
- Complex analysis book for Algebraic Geometers
- trouble calculating sum of the series $ \sum\left(\frac{n^2}{2^n}\right) $
- Prove that $\sin(2A)+\sin(2B)+\sin(2C)=4\sin(A)\sin(B)\sin(C)$ when $A,B,C$ are angles of a triangle
- Group homomorphisms and which of the following statements are true (NBHM-$2014$)