Sequence

A sequence on a set AA is a function u:Z+→Au:\mathbb{Z}^{+}\rightarrow A.

Image of the n is written as unu_n. A sequence is indicated by one of these ways:

{un}n=1∞    or    {un}    or    (un)n=1∞\Big\{u_n\Big\}_{n=1}^{\infty} \;\; \text{or} \;\; \Big\{u_n\Big\} \;\; \text{or} \;\; \Big(u_n\Big)_{n=1}^{\infty}

Increasing or Decreasing

A sequence (un)\big(u_n\big) is

  • Increasing iff un≥umu_n\ge u_m for n>mn>m
  • Decreasing iff un≤umu_n\le u_m for n>mn>m
  • Monotone iff either increasing or decreasing
  • Strictly increasing iff un>umu_n\gt u_m for n>mn>m
  • Strictly decreasing iff un<umu_n\lt u_m for n>mn>m

Convergence

Converging

A sequence (un)n=1∞\big(u_n\big)_{n=1}^{\infty} is converging (to L∈RL\in\mathbb{R}) iff: lim⁡n→∞un=L\lim_{n\to \infty}{u_n} = L

∀ϵ>0  ∃N∈Z+  ∀n  (n>N  ⟹  ∣un−L∣<ϵ)\forall \epsilon > 0\; \exists N\in\mathbb{Z}^{+} \; \forall n \; ( n > N \implies |u_n-L| < \epsilon )

Diverging

A sequence is diverging iff it is not converging.

lim⁡n→∞un={  ∞  −∞  undefined,when  un  is osciallating\lim_{n\to\infty}u_n= \begin{cases} \;\infty\\ \;-\infty\\ \;\text{undefined}, & \text{when}\;u_n\;\text{is osciallating}\\ \end{cases}

Convergence Test

All converging sequences are bounded. Contrapositive can be used to prove the divergence.

Increasing and Bounded Above

Let (un)\big(u_n\big) be increasing and bounded above. Then (un)\big(u_n\big) is converging (to sup⁡ { un }\sup\,\set{u_n}).

Decreasing and Bounded Below

Let (un)\big(u_n\big) be decreasing and bounded below. Then (un)\big(u_n\big) is converging (to inf⁡ { un }\inf\,\set{u_n}).

Both of the above results are referred to as “monotone convergence theorem”.

Newton’s Method of Finding Roots

Suppose ff is a function. To find its roots:

  • Select a point x0x_0
  • Draw a tangent at x0x_0
  • Choose x1x_1 which is where the tangent meets y=0y=0
  • Continue this process repeatedly
xn+1=xn−f(xn)f′(xn)x_{n+1}=x_n - \frac{f(x_n)}{f'(x_n)}

Sequence of xnx_n converges to one of the roots. Different points can be taken to find other roots.

Written by September 29, 2026 2 min read
Was this helpful?