# Sequence

In mathematics, a **sequence** is an enumerated collection of objects in which repetitions are allowed. Like a set, it contains members (also called *elements*, or *terms*). The number of elements (possibly infinite) is called the *length* of the sequence. Unlike a set, order matters, and exactly the same elements can appear multiple times at different positions in the sequence. Formally, a sequence can be defined as a function whose domain is either the set of the natural numbers (for infinite sequences) or the set of the first *n* natural numbers (for a sequence of finite length *n*). The position of an element in a sequence is its *rank* or *index*; it is the integer from which the element is the image. It depends on the context or of a specific convention, if the first element has index 0 or 1. When a symbol has been chosen for denoting a sequence, the *n*th element of the sequence is denoted by this symbol with *n* as subscript; for example, the *n*th element of the Fibonacci sequence is generally denoted *F*_{n}.

For example, (M, A, R, Y) is a sequence of letters with the letter 'M' first and 'Y' last. This sequence differs from (A, R, M, Y). Also, the sequence (1, 1, 2, 3, 5, 8), which contains the number 1 at two different positions, is a valid sequence. Sequences can be *finite*, as in these examples, or *infinite*, such as the sequence of all even positive integers (2, 4, 6, ...). In computing and computer science, finite sequences are sometimes called strings, words or lists, the different names commonly corresponding to different ways to represent them in computer memory; infinite sequences are called streams. The empty sequence ( ) is included in most notions of sequence, but may be excluded depending on the context.

## Contents

## Examples and notation[edit]

A sequence can be thought of as a list of elements with a particular order. Sequences are useful in a number of mathematical disciplines for studying functions, spaces, and other mathematical structures using the convergence properties of sequences. In particular, sequences are the basis for series, which are important in differential equations and analysis. Sequences are also of interest in their own right and can be studied as patterns or puzzles, such as in the study of prime numbers.

There are a number of ways to denote a sequence, some of which are more useful for specific types of sequences. One way to specify a sequence is to list the elements. For example, the first four odd numbers form the sequence (1, 3, 5, 7). This notation can be used for infinite sequences as well. For instance, the infinite sequence of positive odd integers can be written (1, 3, 5, 7, ...). Listing is most useful for infinite sequences with a pattern that can be easily discerned from the first few elements. Other ways to denote a sequence are discussed after the examples.

### Examples[edit]

The prime numbers are the natural numbers bigger than 1, that have no divisors but 1 and themselves. Taking these in their natural order gives the sequence (2, 3, 5, 7, 11, 13, 17, ...). The prime numbers are widely used in mathematics and specifically in number theory.

The Fibonacci numbers are the integer sequence whose elements are the sum of the previous two elements. The first two elements are either 0 and 1 or 1 and 1 so that the sequence is (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...).

For a large list of examples of integer sequences, see On-Line Encyclopedia of Integer Sequences.

Other examples of sequences include ones made up of rational numbers, real numbers, and complex numbers. The sequence (.9, .99, .999, .9999, ...) approaches the number 1. In fact, every real number can be written as the limit of a sequence of rational numbers, e.g. via its decimal expansion. For instance, π is the limit of the sequence (3, 3.1, 3.14, 3.141, 3.1415, ...). A related sequence is the sequence of decimal digits of π, i.e. (3, 1, 4, 1, 5, 9, ...). This sequence does not have any pattern that is easily discernible by eye, unlike the preceding sequence, which is increasing.

### Indexing[edit]

Other notations can be useful for sequences whose pattern cannot be easily guessed, or for sequences that do not have a pattern such as the digits of π. One such notation is to write down a general formula for computing the *n*th term as a function of *n*, enclose it in parentheses, and include a subscript indicating the range of values that *n* can take. For example, in this notation the sequence of even numbers could be written as . The sequence of squares could be written as . The variable *n* is called an index, and the set of values that it can take is called the index set.

It is often useful to combine this notation with the technique of treating the elements of a sequence as variables. This yields expressions like , which denotes a sequence whose *n*th element is given by the variable . For example:

Note that we can consider multiple sequences at the same time by using different variables; e.g. could be a different sequence than . We can even consider a sequence of sequences: denotes a sequence whose *m*th term is the sequence .

An alternative to writing the domain of a sequence in the subscript is to indicate the range of values that the index can take by listing its highest and lowest legal values. For example, the notation denotes the ten-term sequence of squares . The limits and are allowed, but they do not represent valid values for the index, only the supremum or infimum of such values, respectively. For example, the sequence is the same as the sequence , and does not contain an additional term "at infinity". The sequence is a **bi-infinite sequence**, and can also be written as .

In cases where the set of indexing numbers is understood, the subscripts and superscripts are often left off. That is, one simply writes for an arbitrary sequence. Often, the index *k* is understood to run from 1 to ∞. However, sequences are frequently indexed starting from zero, as in

In some cases the elements of the sequence are related naturally to a sequence of integers whose pattern can be easily inferred. In these cases the index set may be implied by a listing of the first few abstract elements. For instance, the sequence of squares of odd numbers could be denoted in any of the following ways.

Moreover, the subscripts and superscripts could have been left off in the third, fourth, and fifth notations, if the indexing set was understood to be the natural numbers. Note that in the second and third bullets, there is a well-defined sequence , but it is not the same as the sequence denoted by the expression.

### Defining a sequence by recursion[edit]

Sequences whose elements are related to the previous elements in a straightforward way are often defined using **recursion**. This is in contrast to the definition of sequence elements as a function of their position.

To define a sequence by recursion, one needs a rule to construct each element in terms of the ones before it. In addition, enough initial elements must be provided so that all subsequent elements of the sequence can be computed by the rule. The principle of mathematical induction can be used to prove that in this case, there is exactly one sequence that satisfies both the recursion rule and the initial conditions. Induction can also be used to prove properties about a sequence, especially for sequences whose most natural description is recursive.

The Fibonacci sequence can be defined using a recursive rule along with two initial elements. The rule is that each element is the sum of the previous two elements, and the first two elements are 0 and 1.

- , with and .

The first ten terms of this sequence are 0, 1, 1, 2, 3, 5, 8, 13, 21, and 34. A more complicated example of a sequence that is defined recursively is Recaman's sequence. We can define Recaman's sequence by

- and , if the result is positive and not already in the list. Otherwise, .

Not all sequences can be specified by a rule in the form of an equation, recursive or not, and some can be quite complicated. For example, the sequence of prime numbers is the set of prime numbers in their natural order, i.e. (2, 3, 5, 7, 11, 13, 17, ...).

Many sequences have the property that each element of a sequence can be computed from the previous element. In this case, there is some function *f* such that for all *n*, .

## Formal definition and basic properties[edit]

There are many different notions of sequences in mathematics, some of which (*e.g.*, exact sequence) are not covered by the definitions and notations introduced below.

### Formal definition[edit]

For the purposes of this article, we define a sequence to be a function whose domain is a convex subset of the set of integers. This definition covers several different uses of the word "sequence", including one-sided infinite sequences, bi-infinite sequences, and finite sequences (see below for definitions). However, many authors use a narrower definition by requiring the domain of a sequence to be the set of natural numbers. The narrower definition has the disadvantage that it rules out finite sequences and bi-infinite sequences, both of which are usually called sequences in standard mathematical practice. Many authors also impose a requirement on the codomain of a function before calling it a sequence, by requiring it to be the set **R** of real numbers,^{[1]} the set **C** of complex numbers,^{[2]} or a topological space.^{[3]}

Although sequences are a type of function, they are usually distinguished notationally from functions in that the input is written as a subscript rather than in parentheses, i.e. *a _{n}* rather than

*f*(

*n*). There are terminological differences as well: the value of a sequence at the input 1 is called the "first element" of the sequence, the value at 2 is called the "second element", etc. Also, while a function abstracted from its input is usually denoted by a single letter, e.g.

*f*, a sequence abstracted from its input is usually written by a notation such as , or just as . Here

*A*is the domain, or index set, of the sequence.

Sequences and their limits (see below) are important concepts for studying topological spaces. An important generalization of sequences is the concept of nets. A **net** is a function from a (possibly uncountable) directed set to a topological space. The notational conventions for sequences normally apply to nets as well.

### Finite and infinite[edit]

The **length** of a sequence is defined as the number of terms in the sequence.

A sequence of a finite length *n* is also called an *n*-tuple. Finite sequences include the **empty sequence** ( ) that has no elements.

Normally, the term *infinite sequence* refers to a sequence that is infinite in one direction, and finite in the other—the sequence has a first element, but no final element. Such a sequence is called a **singly infinite sequence** or a **one-sided infinite sequence** when disambiguation is necessary. In contrast, a sequence that is infinite in both directions—i.e. that has neither a first nor a final element—is called a **bi-infinite sequence**, **two-way infinite sequence**, or **doubly infinite sequence**. A function from the set **Z** of *all* integers into a set, such as for instance the sequence of all even integers ( …, −4, −2, 0, 2, 4, 6, 8… ), is bi-infinite. This sequence could be denoted .

### Increasing and decreasing[edit]

A sequence is said to be *monotonically increasing*, if each term is greater than or equal to the one before it. For example, the sequence is monotonically increasing if and only if *a*_{n+1} *a*_{n} for all *n* ∈ **N**. If each consecutive term is strictly greater than (>) the previous term then the sequence is called **strictly monotonically increasing**. A sequence is **monotonically decreasing**, if each consecutive term is less than or equal to the previous one, and **strictly monotonically decreasing**, if each is strictly less than the previous. If a sequence is either increasing or decreasing it is called a **monotone** sequence. This is a special case of the more general notion of a monotonic function.

The terms **nondecreasing** and **nonincreasing** are often used in place of *increasing* and *decreasing* in order to avoid any possible confusion with *strictly increasing* and *strictly decreasing*, respectively.

### Bounded[edit]

If the sequence of real numbers (*a _{n}*) is such that all the terms are less than some real number

*M*, then the sequence is said to be

**bounded from above**. In less words, this means that there exists

*M*such that for all

*n*,

*a*≤

_{n}*M*. Any such

*M*is called an

*upper bound*. Likewise, if, for some real

*m*,

*a*≥

_{n}*m*for all

*n*greater than some

*N*, then the sequence is

**bounded from below**and any such

*m*is called a

*lower bound*. If a sequence is both bounded from above and bounded from below, then the sequence is said to be

**bounded**.

### Subsequences[edit]

A **subsequence** of a given sequence is a sequence formed from the given sequence by deleting some of the elements without disturbing the relative positions of the remaining elements. For instance, the sequence of positive even integers (2, 4, 6, ...) is a subsequence of the positive integers (1, 2, 3, ...). The positions of some elements change when other elements are deleted. However, the relative positions are preserved.

Formally, a subsequence of the sequence is any sequence of the form , where is a strictly increasing sequence of positive integers.

### Other types of sequences[edit]

Some other types of sequences that are easy to define include:

- An
**integer sequence**is a sequence whose terms are integers. - A
**polynomial sequence**is a sequence whose terms are polynomials. - A positive integer sequence is sometimes called
**multiplicative**, if*a*_{nm}=*a*_{n}*a*_{m}for all pairs*n*,*m*such that*n*and*m*are coprime.^{[4]}In other instances, sequences are often called*multiplicative*, if*a*_{n}=*na*_{1}for all*n*. Moreover, a*multiplicative*Fibonacci sequence^{[5]}satisfies the recursion relation*a*_{n}=*a*_{n−1}*a*_{n−2}.

## Limits and convergence[edit]

An important property of a sequence is *convergence*. A sequence converges, it converges to a particular value known as the *limit*. If a sequence converges to some limit, then it is **convergent**. A sequence that does not converge is **divergent**.

Informally, a sequence has a limit if the elements of the sequence become closer and closer to some value (called the limit of the sequence), and they become and remain *arbitrarily* close to , meaning that given a real number greater than zero, all but a finite number of the elements of the sequence have a distance from less than .

For example, the sequence shown to the right converges to the value 0. On the other hand, the sequences (which begins 1, 8, 27, …) and (which begins -1, 1, -1, 1, …) are both divergent.

If a sequence converges, then the value it converges to is unique. This value is called the **limit** of the sequence. The limit of a convergent sequence is normally denoted . If is a divergent sequence, then the expression is meaningless.

### Formal definition of convergence[edit]

A sequence of real numbers **converges to** a real number if, for all , there exists a natural number such that for all we have^{[1]}

If is a sequence of complex numbers rather than a sequence of real numbers, this last formula can still be used to define convergence, with the provision that denotes the complex modulus, i.e. . If is a sequence of points in a metric space, then the formula can be used to define convergence, if the expression is replaced by the expression , which denotes the distance between and .

### Applications and important results[edit]

Let and be convergent sequences, and let be a sequence that is not necessarily convergent. Then the following limits exist, and can be computed as follows:^{[1]}^{[6]}

- for all
*c* - provided
- for all

Moreover:

- If
*a*≤_{n}*b*for all_{n}*n*greater than some*N*, then . (Note that, if the inequalities are replaced by strict inequalities then this is false: there are sequences such that*a*<_{n}*b*for all_{n}*n*, but .) - (Squeeze Theorem) If for all
*n*>*N*, and , then the sequence is convergent, and . - If a sequence is bounded and monotonic then it is convergent.
- A sequence is convergent if and only if all of its subsequences are convergent.

### Cauchy sequences[edit]

A Cauchy sequence is a sequence whose terms become arbitrarily close together as n gets very large. The notion of a Cauchy sequence is important in the study of sequences in metric spaces, and, in particular, in real analysis. One particularly important result in real analysis is *Cauchy characterization of convergence for sequences*:

- A sequence of real numbers is convergent (in the reals) if and only if it is Cauchy.

In contrast, there are Cauchy sequences of rational numbers that are not convergent in the rationals, e.g. the sequence defined by *x*_{1} = 1 and *x*_{n+1} = *x*_{n} + 2/*x*_{n}/2 is Cauchy, but has no rational limit, cf. here. More generally, any sequence of rational numbers that converges to an irrational number is Cauchy, but not convergent when interpreted as a sequence in the set of rational numbers.

Metric spaces that satisfy the Cauchy characterization of convergence for sequences are called complete metric spaces and are particularly nice for analysis.

### Infinite limits[edit]

In calculus, it is common to define notation for sequences which do not converge in the sense discussed above, but which instead become and remain arbitrarily large, or become and remain arbitrarily negative. If becomes arbitrarily large as , we write

In this case we say that the sequence **diverges**, or that it **converges to infinity**. An example of such a sequence is *a*_{n} = *n*.

If becomes arbitrarily negative (i.e. negative and large in magnitude) as , we write

and say that the sequence **diverges** or **converges to negative infinity**.

## Series[edit]

A **series** is, informally speaking, the sum of the terms of a sequence. That is, it is an expression of the form or , where is a sequence of real or complex numbers. The **partial sums** of a series are the expressions resulting from replacing the infinity symbol with a finite number, i.e. the *N*th partial sum of the series is the number , i.e.

The partial sums themselves form a sequence , which is called the **sequence of partial sums** of the series . If the sequence of partial sums converges, then we say that the series is **convergent**, and the limit is called the **value** of the series. The same notation is used to denote a series and its value, i.e. we write .

## Use in other fields of mathematics[edit]

### Topology[edit]

Sequences play an important role in topology, especially in the study of metric spaces. For instance:

- A metric space is compact exactly when it is sequentially compact.
- A function from a metric space to another metric space is continuous exactly when it takes convergent sequences to convergent sequences.
- A metric space is a connected space if and only if, whenever the space is partitioned into two sets, one of the two sets contains a sequence converging to a point in the other set.
- A topological space is separable exactly when there is a dense sequence of points.

Sequences can be generalized to nets or filters. These generalizations allow one to extend some of the above theorems to spaces without metrics.

#### Product topology[edit]

The topological product of a sequence of topological spaces is the cartesian product of those spaces, equipped with a natural topology called the product topology.

More formally, given a sequence of spaces , the product space

is defined as the set of all sequences such that for each *i*, is an element of . The **canonical projections** are the maps *p _{i}* :

*X*→

*X*defined by the equation . Then the

_{i}**product topology**on

*X*is defined to be the coarsest topology (i.e. the topology with the fewest open sets) for which all the projections

*p*are continuous. The product topology is sometimes called the

_{i}**Tychonoff topology**.

### Analysis[edit]

In analysis, when talking about sequences, one will generally consider sequences of the form

which is to say, infinite sequences of elements indexed by natural numbers.

It may be convenient to have the sequence start with an index different from 1 or 0. For example, the sequence defined by *x _{n}* = 1/log(

*n*) would be defined only for

*n*≥ 2. When talking about such infinite sequences, it is usually sufficient (and does not change much for most considerations) to assume that the members of the sequence are defined at least for all indices large enough, that is, greater than some given

*N*.

The most elementary type of sequences are numerical ones, that is, sequences of real or complex numbers. This type can be generalized to sequences of elements of some vector space. In analysis, the vector spaces considered are often function spaces. Even more generally, one can study sequences with elements in some topological space.

#### Sequence spaces[edit]

A sequence space is a vector space whose elements are infinite sequences of real or complex numbers. Equivalently, it is a function space whose elements are functions from the natural numbers to the field **K**, where **K** is either the field of real numbers or the field of complex numbers. The set of all such functions is naturally identified with the set of all possible infinite sequences with elements in **K**, and can be turned into a vector space under the operations of pointwise addition of functions and pointwise scalar multiplication. All sequence spaces are linear subspaces of this space. Sequence spaces are typically equipped with a norm, or at least the structure of a topological vector space.

The most important sequences spaces in analysis are the ℓ^{p} spaces, consisting of the *p*-power summable sequences, with the *p*-norm. These are special cases of L^{p} spaces for the counting measure on the set of natural numbers. Other important classes of sequences like convergent sequences or null sequences form sequence spaces, respectively denoted *c* and *c*_{0}, with the sup norm. Any sequence space can also be equipped with the topology of pointwise convergence, under which it becomes a special kind of Fréchet space called an FK-space.

### Linear algebra[edit]

Sequences over a field may also be viewed as vectors in a vector space. Specifically, the set of *F*-valued sequences (where *F* is a field) is a function space (in fact, a product space) of *F*-valued functions over the set of natural numbers.

### Abstract algebra[edit]

Abstract algebra employs several types of sequences, including sequences of mathematical objects such as groups or rings.

#### Free monoid[edit]

If *A* is a set, the free monoid over *A* (denoted *A*^{*}, also called Kleene star of *A*) is a monoid containing all the finite sequences (or strings) of zero or more elements of *A*, with the binary operation of concatenation. The free semigroup *A*^{+} is the subsemigroup of *A*^{*} containing all elements except the empty sequence.

#### Exact sequences[edit]

In the context of group theory, a sequence

of groups and group homomorphisms is called **exact**, if the image (or range) of each homomorphism is equal to the kernel of the next:

Note that the sequence of groups and homomorphisms may be either finite or infinite.

A similar definition can be made for certain other algebraic structures. For example, one could have an exact sequence of vector spaces and linear maps, or of modules and module homomorphisms.

#### Spectral sequences[edit]

In homological algebra and algebraic topology, a **spectral sequence** is a means of computing homology groups by taking successive approximations. Spectral sequences are a generalization of exact sequences, and since their introduction by Jean Leray (1946), they have become an important research tool, particularly in homotopy theory.

### Set theory[edit]

An ordinal-indexed sequence is a generalization of a sequence. If α is a limit ordinal and *X* is a set, an α-indexed sequence of elements of *X* is a function from α to *X*. In this terminology an ω-indexed sequence is an ordinary sequence.

### Computing[edit]

Automata or finite state machines can typically be thought of as directed graphs, with edges labeled using some specific alphabet, Σ. Most familiar types of automata transition from state to state by reading input letters from Σ, following edges with matching labels; the ordered input for such an automaton forms a sequence called a *word* (or input word). The sequence of states encountered by the automaton when processing a word is called a *run*. A nondeterministic automaton may have unlabeled or duplicate out-edges for any state, giving more than one successor for some input letter. This is typically thought of as producing multiple possible runs for a given word, each being a sequence of single states, rather than producing a single run that is a sequence of sets of states; however, 'run' is occasionally used to mean the latter.

### Streams[edit]

Infinite sequences of digits (or characters) drawn from a finite alphabet are of particular interest in theoretical computer science. They are often referred to simply as *sequences* or *streams*, as opposed to finite *strings*. Infinite binary sequences, for instance, are infinite sequences of bits (characters drawn from the alphabet {0, 1}). The set *C* = {0, 1}^{∞} of all infinite binary sequences is sometimes called the Cantor space.

An infinite binary sequence can represent a formal language (a set of strings) by setting the *n* th bit of the sequence to 1 if and only if the *n* th string (in shortlex order) is in the language. This representation is useful in the diagonalization method for proofs.^{[7]}

## See also[edit]

- Operations

- Examples

- Types

- ±1-sequence
- Arithmetic progression
- Automatic sequence
- Cauchy sequence
- Constant-recursive sequence
- Geometric progression
- Holonomic sequence
- Regular sequence

- Related concepts

- List (computing)
- Net (topology) (a generalization of sequences)
- Ordinal-indexed sequence
- Recursion (computer science)
- Set (mathematics)
- Tuple

## References[edit]

- ^
^{a}^{b}^{c}Gaughan, Edward. "1.1 Sequences and Convergence".*Introduction to Analysis*. AMS (2009). ISBN 0-8218-4787-2. **^**Edward B. Saff & Arthur David Snider (2003). "Chapter 2.1".*Fundamentals of Complex Analysis*. ISBN 01-390-7874-6.**^**James R. Munkres. "Chapters 1&2".*Topology*. ISBN 01-318-1629-2.**^**Lando, Sergei K. "7.4 Multiplicative sequences".*Lectures on generating functions*. AMS. ISBN 0-8218-3481-9.**^**Falcon, Sergio. "Fibonacci's multiplicative sequence".*International Journal of Mathematical Education in Science and Technology*.**34**(2): 310–315. doi:10.1080/0020739031000158362.**^**Dawikins, Paul. "Series and Sequences".*Paul's Online Math Notes/Calc II (notes)*. Retrieved 18 December 2012.**^**Oflazer, Kemal. "FORMAL LANGUAGES, AUTOMATA AND COMPUTATION: DECIDABILITY" (PDF).*cmu.edu*. Carnegie-Mellon University. Retrieved 24 April 2015.

## External links[edit]

Look up or enumerate in Wiktionary, the free dictionary.collection |

- The dictionary definition of sequence at Wiktionary
- Hazewinkel, Michiel, ed. (2001), "Sequence",
*Encyclopedia of Mathematics*, Springer, ISBN 978-1-55608-010-4 - The On-Line Encyclopedia of Integer Sequences
- Journal of Integer Sequences (free)
- "Sequence".
*PlanetMath*.