Type a command or search the notes. Tab cycles completions. Up and down recall history when blank. Escape dismisses, then leaves the prompt.
MATH
[1251]

Theorems from Sequences and limits

All theorems from Sequences and limits.

Back to Sequences and limits

Algebra and continuity of sequence limits

If an→Ka_n\to K and bn→Lb_n\to L, with KK and LL finite, then

an±bn→K±L,anbn→KL,anbn→KL(L≠0).a_n\pm b_n\to K\pm L,\qquad a_nb_n\to KL,\qquad \frac{a_n}{b_n}\to\frac KL\quad(L\ne0).

If hh is continuous at KK, then

an→K⟹h(an)→h(K).a_n\to K\quad\Longrightarrow\quad h(a_n)\to h(K).

For example,

4n2−3n+22n2+6n+1=4−3/n+2/n22+6/n+1/n2⟶2.\frac{4n^2-3n+2}{2n^2+6n+1} =\frac{4-3/n+2/n^2}{2+6/n+1/n^2} \longrightarrow2.

If a real function has a limit as x→∞x\to\infty, its sampled sequence f(n)f(n) has the same limit. The converse is false: f(x)=sin⁡(πx)f(x)=\sin(\pi x) gives f(n)=0f(n)=0 for every integer nn, although f(x)f(x) has no limit as x→∞x\to\infty.

Squeeze theorem for sequences

If, for all sufficiently large nn,

an≤bn≤cn,a_n\le b_n\le c_n,

and an→La_n\to L and cn→Lc_n\to L, then bn→Lb_n\to L.

Only the tail needs to satisfy the inequalities. This helps with growth estimates when an exact formula for the middle sequence is unavailable.

Completeness of the real numbers

Every non-empty subset of R\mathbb R that is bounded above has a supremum and every non-empty subset bounded below has an infimum.

The characterisation

M=sup⁡SM=\sup S

is equivalent to:

  1. x≤Mx\le M for every x∈Sx\in S;
  2. for every ε>0\varepsilon>0, some x∈Sx\in S satisfies M−ε<xM-\varepsilon<x.

The second condition says that no smaller number remains an upper bound. Reversing the inequalities gives the corresponding characterisation of an infimum.

Monotone convergence theorem

A non-decreasing sequence bounded above converges. A non-increasing sequence bounded below converges.

The theorem guarantees a finite limit without giving a formula for it. Completeness supplies the least upper bound or greatest lower bound that becomes the limit.

On this page