Source
Adapted from my own handwritten and hand-typed notes from Year 1 to Year 3 of my EEE degree
A sequence is a list of real numbers in a definite order, , written or . It is really a function from (a subset of) the integers to , so its graph is a set of separate dots, not a joined curve.
Ways to define a sequence
- Formula: gives
- Alternating sign: switches sign each term
- Piecewise: different formulas for different
- Recursive: each term from earlier ones, e.g. Fibonacci , , , or Newton's iterates
If the start index is not given, start at the smallest for which the formula makes sense from then on. For example starts at , and starts at .
Convergence
converges to , written , if for every there is an integer with
Otherwise it diverges. A sequence diverges if it goes to or if it never settles (like ). Limits are unique, and a constant sequence converges to .
Example proof: for , given , pick an integer . Then gives .
Limit laws
If and exist:
- if
- If is continuous, , e.g.
Standard limits
- for
- for , and diverges for or
Subsequences
A subsequence keeps some terms in order, e.g. even terms and odd terms .
Facts:
- If , every subsequence also tends to
- So if one subsequence diverges, or two subsequences have different limits, diverges
- if and only if (useful for alternating or piecewise sequences)
Worked example
: odd terms are all , even terms are all . Different limits, so diverges.
if and if : both subsequences tend to , so .
For harder limits, see Limit Techniques for Sequences.