TheoremBase

The threshold N for the sequence also works for the subsequence, because a strictly increasing index map satisfies k at most sigma(k).

Proof

By Subsequences §subsequence, a subsequence of (xn)(x_{n}) is the composite of the sequence (xn)(x_{n}) with a strictly increasing map σ:N→N\sigma:\mathbb{N}\to\mathbb{N}; fix such a σ\sigma. The composite is a sequence in XX whose kk-th term is xσ(k)x_{\sigma(k)}, by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §composition; we write it (xσ(k))k∈N(x_{\sigma(k)})_{k\in\mathbb{N}}.

Let ε\varepsilon be a real number with ε>0\varepsilon>0. Since (xn)(x_{n}) converges to xx, Convergent Sequence in a Metric Space §converges gives, for this ε\varepsilon, an N∈NN\in\mathbb{N} with d(xn,x)<εd(x_{n},x)<\varepsilon for every n∈Nn\in\mathbb{N} with n≥Nn\ge N. Let k∈Nk\in\mathbb{N} with k≥Nk\ge N. By Monotone Sequences and Subsequences: Comparison of All Terms, Growth of the Indices, and Subsequences of Subsequences §index, k≤σ(k)k\le\sigma(k), so N≤σ(k)N\le\sigma(k) by the transitivity in Arithmetic and Order of the Natural Numbers §partial-order; applying the choice of NN with n=σ(k)n=\sigma(k) gives

d(xσ(k),x)<ε.d(x_{\sigma(k)},x)<\varepsilon .

Thus for every real number ε>0\varepsilon>0 there is N∈NN\in\mathbb{N} with d(xσ(k),x)<εd(x_{\sigma(k)},x)<\varepsilon for every k∈Nk\in\mathbb{N} with k≥Nk\ge N, and by Convergent Sequence in a Metric Space §converges the subsequence (xσ(k))k∈N(x_{\sigma(k)})_{k\in\mathbb{N}} converges to xx in (X,d)(X,d). As σ\sigma was an arbitrary strictly increasing map, this holds for every subsequence of (xn)(x_{n}).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…