TheoremBase

Both claims are immediate from the epsilon-N definition of convergence, the second because n≥Nn\ge N implies n+1≥Nn+1\ge N.

Proof

1. (Constant sequences.) Let ε>0\varepsilon>0 and take N=1N=1. For every n∈Nn\in\mathbb{N} with n≥Nn\ge N the nnth term of the constant sequence is cc, and

∣c−c∣=∣0∣=0<ε|c-c|=|0|=0<\varepsilon

by Properties of the Absolute Value in an Ordered Field. Hence the constant sequence converges to cc.

2. (Index shift.) Suppose (an)(a_n) converges to LL, and let ε>0\varepsilon>0. Choose N∈NN\in\mathbb{N} such that ∣am−L∣<ε|a_m-L|<\varepsilon for every m∈Nm\in\mathbb{N} with m≥Nm\ge N. Let n∈Nn\in\mathbb{N} with n≥Nn\ge N. By clause 6 of Properties of the Order on the Natural Numbers, n<n+1n<n+1 in N\mathbb{N}; by clause 1 of that lemma this gives n≤n+1n\le n+1, and combining with N≤nN\le n through the transitivity in the same clause gives N≤n+1N\le n+1. Therefore

∣bn−L∣=∣an+1−L∣<ε.|b_n-L|=|a_{n+1}-L|<\varepsilon .

Hence (bn)(b_n) converges to LL.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…