TheoremBase

Proof

Let ε\varepsilon be a real number with ε>0\varepsilon>0. Since (xm)m∈N(x_m)_{m\in\mathbb{N}} converges to xx, there is N∈NN\in\mathbb{N} such that

d(xm,x)<εfor every m∈N with N≤m.d(x_m,x)<\varepsilon\qquad\text{for every }m\in\mathbb{N}\text{ with }N\le m.

Let k∈Nk\in\mathbb{N} with N≤kN\le k. Because (nk)k∈N(n_k)_{k\in\mathbb{N}} is strictly increasing, Strictly Increasing Sequences of Natural Numbers Dominate Their Index gives k≤nkk\le n_k. The order ≤\le on N\mathbb{N} is transitive by Properties of the Order on the Natural Numbers, so N≤kN\le k and k≤nkk\le n_k yield N≤nkN\le n_k. Applying the displayed inequality with m=nkm=n_k gives

d(xnk,x)<ε.d(x_{n_k},x)<\varepsilon .

Thus for every real ε>0\varepsilon>0 there is N∈NN\in\mathbb{N} such that d(xnk,x)<εd(x_{n_k},x)<\varepsilon for every k∈Nk\in\mathbb{N} with N≤kN\le k. By Convergent Sequence in a Metric Space the subsequence (xnk)k∈N(x_{n_k})_{k\in\mathbb{N}} converges to xx in (X,d)(X,d).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…