用“压缩映像”原理证明数列收敛
定理
1 ∘ 1^{\circ} 1∘ 对于任一数列 { x n } \left\{x_{n}\right\} { xn}而言,若存在常数 r, 使得 ∀ n ∈ N \forall n \in \mathbf{N} ∀n∈N, 桓有
∣ x n + 1 − x n ∣ ⩽ r ∣ x n − x n − 1 ∣ , 0 < r < 1 → ( A ) \left|x_{n+1}-x_{n}\right| \leqslant r\left|x_{n}-x_{n-1}\right|,0< r< 1\rightarrow(A) ∣xn+1−xn∣⩽r∣xn−xn−1∣,0<r<1→(A)
则数列 { x n } \left\{x_{n}\right\} { xn}收敛.
2 ∘ 2^{\circ} 2∘特别,若数列 { x n } \left\{x_{n}\right\} { xn} 利用递推公式给出:
x n + 1 = f ( x n ) ( n = 1 , 2 , ⋯ ) x_{n+1}=f\left(x_{n}\right)(n=1,2, \cdots) xn+1=f(xn)(n=1,2,⋯), 其中 f 为某一可微函数,且 ∃ r ∈ R \exists r\in R ∃r∈R,使得
∣ f ′ ( x ) ∣ ⩽ r < 1 ( ∀ x ∈ R ) → ( B ) \left|f^{\prime}(x)\right| \leqslant r<1 \quad(\forall x \in \mathbf{R}) \rightarrow(B) ∣f′(x)∣⩽r<1(∀x∈R)→(B)
则 { x n } \left\{x_{n}\right\} { xn}收敛.
证明
1 ∘ 1^{\circ} 1∘
此时 ∣ x n + p − x n ∣ ⩽ ∑ k = n + 1 n + p ∣ x k − x k − 1 ∣ ⩽ ∑ k = n + 1 n + p r k − 1 ∣ x 1 − x 0 ∣ = ∣ x 1 − x 0 ∣ ⋅ r n − r n + p 1 − r ⩽ ∣ x 1 − x 0 ∣ r n 1 − r \begin{array}{l} \text { 此时 }\left|x_{n+p}-x_{n}\right| &\leqslant \sum_{k=n+1}^{n+p}\left|x_{k}-x_{k-1}\right| \\ &\leqslant \sum_{k=n+1}^{n+p} r^{k-1}\left|x_{1}-x_{0}\right|\\ &=\left|x_{1}-x_{0}\right| \cdot \frac{r^{n}-r^{n+p}}{1-r} \\ &\leqslant\left|x_{1}-x_{0}\right| \frac{r^{n}}{1-r} \end{array} 此时 ∣xn+p−xn∣⩽∑k=n+1