# Sequence > Mediated Wiki article. Canonical URL: https://mediated.wiki/source/Sequence > Markdown URL: https://mediated.wiki/source/Sequence.md > Source: https://en.wikipedia.org/wiki/Sequence > Source revision: 1356256155 > License: Creative Commons Attribution-ShareAlike 4.0 International (https://creativecommons.org/licenses/by-sa/4.0/) Finite or infinite ordered list of elements "Sequential" redirects here. For other uses, see [Sequential (disambiguation)](/source/Sequential_(disambiguation)). For other uses, see [Sequence (disambiguation)](/source/Sequence_(disambiguation)). A part of an infinite sequence of [real numbers](/source/Real_number) (in blue), indexed by a natural number n. This sequence is neither increasing, decreasing, convergent, nor [Cauchy](/source/Cauchy_sequence). It is, however, bounded (by red dashed lines). In mathematics, a **sequence** is a collection of [objects](/source/Mathematical_object) possibly with repetition, that come in a specified order. Like a [set](/source/Set_(mathematics)), it contains [members](/source/Element_(mathematics)) (also called *elements*, or *terms*). Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. The notion of a sequence can be generalized to an [indexed family](/source/Indexed_family), defined as a function from an *arbitrary* index set. 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](/source/Finiteness)*, as in these examples, or *infinite*, such as the sequence of positive [even integers](/source/Even_integer) (2, 4, 6, 8, ...). The *length* of a finite sequence is defined as the number of elements in the sequence. The position of an element in a sequence is its *rank* or *index*; it is the [natural number](/source/Natural_number) for which the element is the [image](/source/Image_(mathematics)). The first element typically has index 0 or 1. In [mathematical analysis](/source/Mathematical_analysis), a sequence is often denoted by letters in the form of a n {\displaystyle a_{n}} , b n {\displaystyle b_{n}} and c n {\displaystyle c_{n}} , where the subscript n refers to the nth element of the sequence; for example, the nth element of the [Fibonacci sequence](/source/Fibonacci_sequence) F {\displaystyle F} is generally denoted as F n {\displaystyle F_{n}} . In [computing](/source/Computing) and [computer science](/source/Computer_science), finite sequences are usually called *[strings](/source/String_(computer_science))*, *[words](/source/Word_(formal_language_theory))* or *[lists](/source/List_(computer_science))*, with the specific technical term chosen depending on the type of object the sequence enumerates and the different ways to represent the sequence in [computer memory](/source/Computer_memory). Infinite sequences are called *[streams](/source/Stream_(computing))*. The empty sequence ( ) is included in most notions of sequence. It may be excluded depending on the context. ## Examples and notation A sequence can be thought of as a list of elements with a particular order.[1][2] Sequences are useful in a number of mathematical disciplines for studying [functions](/source/Function_(mathematics)), [spaces](/source/Space_(mathematics)), and other mathematical structures using the [convergence](#Limits_and_convergence) properties of sequences. In particular, sequences are the basis for [series](/source/Series_(mathematics)), which are important in [differential equations](/source/Differential_equations) and [analysis](/source/Analysis_(mathematics)). 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](/source/Prime_number). 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 all its elements. For example, the first four odd integers form the sequence (1, 3, 5, 7). This notation is used for infinite sequences as well. For instance, the infinite sequence of positive odd integers is written as (1, 3, 5, 7, ...). Because notating sequences with [ellipsis](/source/Ellipsis) leads to ambiguity, listing is most useful for customary infinite sequences which can be easily recognized from their first few elements. Other ways of denoting a sequence are discussed after the examples. ### Examples A [tiling](/source/Tessellation) with squares whose sides are successive Fibonacci numbers in length. A [prime number](/source/Prime_number) is a [natural numbers](/source/Natural_numbers) greater than 1 that has no [divisors](/source/Divisor) except 1 and itself. Listing the prime numbers in their natural order gives the sequence (2, 3, 5, 7, 11, 13, 17, ...). The prime numbers are widely used in [mathematics](/source/Mathematics), particularly in [number theory](/source/Number_theory) where many results related to them exist. The [Fibonacci numbers](/source/Fibonacci_number) are a sequence for which each element is the sum of the previous two elements. The zeroth and first elements are 0 and 1, so the sequence is (0, 1, 1, 2, 3, 5, 8, 13, ...).[1] Other sequences have [rational numbers](/source/Rational_number) as elements. The sequence (.9, .99, .999, .9999, ...), for instance, approaches the number 1. As another example, [π](/source/Pi) is the limit of the sequence (3, 3.1, 3.14, 3.141, 3.1415, ...), which is increasing. In fact, every [real number](/source/Real_number) can be written as the [limit of a sequence](/source/Limit_of_a_sequence) of rational numbers (e.g. via its [decimal expansion](/source/Decimal_expansion), also see *[completeness of the real numbers](/source/Completeness_of_the_real_numbers)*). A related type of sequence consists of the decimal digits of a real number, for example the sequence of digits of π, (3, 1, 4, 1, 5, 9, ...). This sequence does not have any pattern that is easily discernible by inspection. The elements of a sequence can be [functions](/source/Function_(mathematics)) instead of numbers. For example, the [monomial basis](/source/Monomial_basis) for polynomials of a single variable forms the sequence ( x ↦ 1 , x ↦ x , x ↦ x 2 , x ↦ x 3 , … ) {\displaystyle (x\mapsto 1,x\mapsto x,x\mapsto x^{2},x\mapsto x^{3},\ldots )} , using [arrow notation](/source/Function_(mathematics)#Arrow_notation). The [On-Line Encyclopedia of Integer Sequences](/source/On-Line_Encyclopedia_of_Integer_Sequences) comprises a large list of examples of integer sequences.[3] ### Indexing 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 [π](/source/Pi). One such notation is to write down a general formula for computing the nth term as a function of n, enclose it in parentheses, and include a subscript indicating the set of values that n can take. For example, in this notation the sequence of even integers could be written as ( 2 n ) n ∈ N {\displaystyle (2n)_{n\in \mathbb {N} }} , where ⁠ N {\displaystyle \mathbb {N} } ⁠ denotes the set of [natural numbers](/source/Natural_number). The sequence of [square numbers](/source/Square_number) could be written as ( n 2 ) n ∈ N {\textstyle (n^{2})_{n\in \mathbb {N} }} . The variable n is called an [index](/source/Indexed_family), and the set of values that it can take is called the [index set](/source/Index_set). It is often useful to combine this notation with the technique of treating the elements of a sequence as individual variables. This yields expressions like ( a n ) n ∈ N {\displaystyle (a_{n})_{n\in \mathbb {N} }} , which denotes a sequence whose nth element is given by the variable a n {\displaystyle a_{n}} . For example: - a 1 = 1 st element of ( a n ) n ∈ N a 2 = 2 nd element a 3 = 3 rd element ⋮ a n − 1 = ( n − 1 ) th element a n = n th element a n + 1 = ( n + 1 ) th element ⋮ {\displaystyle {\begin{aligned}a_{1}&=1{\text{st element of }}(a_{n})_{n\in \mathbb {N} }\\a_{2}&=2{\text{nd element }}\\a_{3}&=3{\text{rd element }}\\&\;\;\vdots \\a_{n-1}&=(n-1){\text{th element}}\\a_{n}&=n{\text{th element}}\\a_{n+1}&=(n+1){\text{th element}}\\&\;\;\vdots \end{aligned}}} One can consider multiple sequences at the same time by using different variables; e.g. ( b n ) n ∈ N {\textstyle (b_{n})_{n\in \mathbb {N} }} could be a different sequence than ( a n ) n ∈ N {\displaystyle (a_{n})_{n\in \mathbb {N} }} . One can even consider a sequence of sequences: ( ( a m , n ) n ∈ N ) m ∈ N {\displaystyle {\bigl (}(a_{m,n})_{n\in \mathbb {N} }{\bigr )}_{m\in \mathbb {N} }} denotes a sequence whose mth term is the sequence ( a m , n ) n ∈ N {\textstyle (a_{m,n})_{n\in \mathbb {N} }} . 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 ( k 2 ) ) k = 1 10 {\textstyle (k^{2}){\vphantom {)}}_{k=1}^{10}} denotes the ten-term sequence of squares ( 1 , 4 , 9 , … , 100 ) {\displaystyle (1,4,9,\ldots ,100)} . Using the symbol ∞ {\displaystyle \infty } as an upper limit means that the indices continue infinitely. For example, the notations ( 2 n − 1 ) n = 1 ∞ {\textstyle {(2n-1)}_{n=1}^{\infty }} and ( 2 n − 1 ) n ∈ N {\textstyle (2n-1)_{n\in \mathbb {N} }} both describe the sequence of odd integers (1, 3, 5, ...). A **bi-infinite sequence** is a sequence indexed by ⁠ Z {\displaystyle \mathbb {Z} } ⁠, the set of all [integers](/source/Integer), and therefore continues infinitely in both negative and positive directions. Such a sequence can be written as ( … , a − 1 , a 0 , a 1 , a 2 , … ) {\textstyle (\ldots ,a_{-1},a_{0},a_{1},a_{2},\ldots )} , ( a n ) n ∈ Z {\textstyle {(a_{n})}_{n\in \mathbb {Z} }} , or ( a n ) n = − ∞ ∞ {\textstyle {(a_{n})}_{n=-\infty }^{\infty }} . In cases where the set of indexing numbers is understood, the subscripts and superscripts are often left off. That is, one simply writes ( a n ) {\textstyle (a_{n})} for an arbitrary sequence. Typically the index n is then understood to run over all natural numbers starting from 1, or sometimes over all non-negative integers starting from 0. ### Defining a sequence by recursion Main article: [Recurrence relation](/source/Recurrence_relation) Sequences whose elements are related to the previous elements in a straightforward way are often defined using [recursion](/source/Recursive_definition). This is in contrast to the definition of sequences of elements as functions of their positions. To define a sequence by recursion, one needs a rule, called *recurrence relation* 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 successive applications of the recurrence relation. The [Fibonacci sequence](/source/Fibonacci_sequence) is a simple classical example, defined by the recurrence relation - a n = a n − 1 + a n − 2 , {\displaystyle a_{n}=a_{n-1}+a_{n-2},} with initial terms a 0 = 0 {\displaystyle a_{0}=0} and a 1 = 1 {\displaystyle a_{1}=1} . The first several terms can be simply computed as (0, 1, 1, 2, 3, 5, 8, 13, ...). A complicated example of a sequence defined by a recurrence relation is [Recamán's sequence](/source/Recam%C3%A1n's_sequence),[4] defined by the recurrence relation - { a n = a n − 1 − n , if the result is positive and not already in the previous terms, a n = a n − 1 + n , otherwise , {\displaystyle {\begin{cases}a_{n}=a_{n-1}-n,\quad {\text{if the result is positive and not already in the previous terms,}}\\a_{n}=a_{n-1}+n,\quad {\text{otherwise}},\end{cases}}} with initial term a 0 = 0. {\displaystyle a_{0}=0.} A *linear recurrence with constant coefficients* is a recurrence relation of the form - a n = c 0 + c 1 a n − 1 + ⋯ + c k a n − k , {\displaystyle a_{n}=c_{0}+c_{1}a_{n-1}+\dots +c_{k}a_{n-k},} where c 0 , … , c k {\displaystyle c_{0},\dots ,c_{k}} are [constants](/source/Constant_(mathematics)). There is a general method for expressing the general term a n {\displaystyle a_{n}} of such a sequence as a function of n; see [Linear recurrence](/source/Linear_recurrence). In the case of the Fibonacci sequence, one has c 0 = 0 , c 1 = c 2 = 1 , {\displaystyle c_{0}=0,c_{1}=c_{2}=1,} and the resulting function of n is given by [Binet's formula](/source/Binet's_formula). A [holonomic sequence](/source/Holonomic_sequence) is a sequence defined by a recurrence relation of the form - a n = c 1 a n − 1 + ⋯ + c k a n − k , {\displaystyle a_{n}=c_{1}a_{n-1}+\dots +c_{k}a_{n-k},} where c 1 , … , c k {\displaystyle c_{1},\dots ,c_{k}} are [polynomials](/source/Polynomial) in n. For most holonomic sequences, there is no explicit formula for expressing a n {\displaystyle a_{n}} as a function of n. Nevertheless, holonomic sequences play an important role in various areas of mathematics. For example, many [special functions](/source/Special_functions) have a [Taylor series](/source/Taylor_series) whose sequence of coefficients is holonomic. The use of the recurrence relation allows a fast computation of values of such special functions. Not all sequences can be specified by a recurrence relation. An example is the sequence of [prime numbers](/source/Prime_number) in their natural order (2, 3, 5, 7, 11, 13, 17, ...). ## Formal definition and basic properties ### Definition Formally, a sequence can be defined as a [function](/source/Function_(mathematics)) whose [domain](/source/Domain_of_a_function) is an [interval](/source/Interval_(mathematics)) of [integers](/source/Integers). The elements of the domain are the positions or indices of the elements in the sequence, while the values taken by the function are the elements of the sequence. The interval can be finite or infinite; thus, 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 of these kinds of sequences). In some contexts, the [codomain](/source/Codomain) of the sequence (the possible values of the terms) is fixed by context, for example by requiring it to be the set R {\displaystyle \mathbb {R} } of real numbers,[5] the set C {\displaystyle \mathbb {C} } of complex numbers,[6] or a [topological space](/source/Topological_space).[7] 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, that is, *a**n* rather than *a*(*n*). There are terminological differences as well: the value of a sequence at the lowest input (often 1) is called the "first element" of the sequence, the value at the second smallest input (often 2) is called the "second element", etc. Also, while a function abstracted from its input is usually denoted by a single letter (such as f), a sequence abstracted from its input is usually written by a notation such as ( a n ) n ∈ A {\textstyle (a_{n})_{n\in A}} , or just as ( a n ) . {\textstyle (a_{n}).} Here A is the domain, or index set, of the sequence. ### Finite and infinite See also: [ω-language](/source/%CE%A9-language) The **length** of a sequence is defined as the number of terms in the sequence. A sequence of a finite length is a **finite sequence**. A finite sequence of length n is also called an [n-tuple](/source/N-tuple). Finite sequences include the **empty sequence**, denoted ( ), that has no elements. Normally, the term *infinite sequence* refers to a sequence that is infinite in one direction, and finite in the other; such a sequence has a first element, but no final element, and are called **singly infinite sequence** or a **one-sided infinite sequence** when disambiguation is needed. 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 Z {\displaystyle \mathbb {Z} } the set of *all* [integers](/source/Integers), into a set, for example the sequence of all even integers (..., −4, −2, 0, 2, 4, 6, 8, ...), is bi-infinite. This sequence could be denoted ( 2 n ) n = − ∞ ∞ {\textstyle {(2n)}_{n=-\infty }^{\infty }} . ### Increasing and decreasing 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 ( a n ) n = 1 ∞ {\textstyle {(a_{n})}_{n=1}^{\infty }} is monotonically increasing if and only if a n + 1 ≥ a n {\textstyle a_{n+1}\geq a_{n}} for all n ∈ N . {\displaystyle n\in \mathbb {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 is **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](/source/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 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 other 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 A **[subsequence](/source/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 ( a n ) n ∈ N {\displaystyle (a_{n})_{n\in \mathbb {N} }} is any sequence of the form ( a n k ) k ∈ N {\textstyle (a_{n_{k}})_{k\in \mathbb {N} }} , where ( n k ) k ∈ N {\displaystyle (n_{k})_{k\in \mathbb {N} }} is a strictly increasing sequence of positive integers. ### Other types of sequences Some other types of sequences that are easy to define include: - An **[integer sequence](/source/Integer_sequence)** is a sequence whose terms are integers. - A **[polynomial sequence](/source/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](/source/Coprime).[8] In other instances, sequences are often called *multiplicative*, if *a**n* = *na*1 for all n. Moreover, a *multiplicative* Fibonacci sequence[9] satisfies the recursion relation *a**n* = *a**n*−1 *a**n*−2. - A [binary sequence](/source/Binary_sequence) is a sequence whose terms have one of two discrete values, e.g. [base 2](/source/Base_2) values (0, 1, 1, 0, ...), a series of coin tosses (Heads/Tails) (H, T, H, H, T, ...), the answers to a set of True or False questions (T, F, T, T, ...), and so on. ## Limits and convergence Main article: [Limit of a sequence](/source/Limit_of_a_sequence) The plot of a convergent sequence (*a**n*) is shown in blue. From the graph we can see that the sequence is converging to the limit zero as n increases. An important property of a sequence is *convergence*. If 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 L {\displaystyle L} (called the limit of the sequence), and they become and remain *arbitrarily* close to L {\displaystyle L} , meaning that given a real number d {\displaystyle d} greater than zero, all but a finite number of the elements of the sequence have a distance from L {\displaystyle L} less than d {\displaystyle d} . For example, the sequence a n = n + 1 2 n 2 {\textstyle a_{n}={\frac {n+1}{2n^{2}}}} shown to the right converges to the value 0. On the other hand, the sequences b n = n 3 {\textstyle b_{n}=n^{3}} (which begins 1, 8, 27, ...) and c n = ( − 1 ) n {\displaystyle c_{n}=(-1)^{n}} (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 ( a n ) {\displaystyle (a_{n})} is normally denoted lim n → ∞ a n {\textstyle \lim _{n\to \infty }a_{n}} . If ( a n ) {\displaystyle (a_{n})} is a divergent sequence, then the expression lim n → ∞ a n {\textstyle \lim _{n\to \infty }a_{n}} is meaningless. ### Formal definition of convergence A sequence of real numbers ( a n ) {\displaystyle (a_{n})} **converges to** a real number L {\displaystyle L} if, for all ε > 0 {\displaystyle \varepsilon >0} , there exists a natural number N {\displaystyle N} such that for all n ≥ N {\displaystyle n\geq N} we have[5] - | a n − L | < ε . {\displaystyle |a_{n}-L|<\varepsilon .} If ( a n ) {\displaystyle (a_{n})} 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 | ⋅ | {\displaystyle |\cdot |} denotes the [modulus](/source/Modulus_of_complex_number), i.e. | z | = z ∗ z {\displaystyle |z|={\sqrt {z^{*}z}}} , where z ∗ {\displaystyle z^{*}} is the [complex conjugate](/source/Complex_conjugate) of ⁠ z {\displaystyle z} ⁠. If ( a n ) {\displaystyle (a_{n})} is a sequence of points in a [metric space](/source/Metric_space), then the formula can be used to define convergence, if the expression | a n − L | {\displaystyle |a_{n}-L|} is replaced by the expression dist ⁡ ( a n , L ) {\displaystyle \operatorname {dist} (a_{n},L)} , which denotes the [distance](/source/Metric_(mathematics)) between a n {\displaystyle a_{n}} and L {\displaystyle L} . ### Applications and important results If ( a n ) {\displaystyle (a_{n})} and ( b n ) {\displaystyle (b_{n})} are convergent sequences, then the following limits exist, and can be computed as follows:[5][10] - lim n → ∞ ( a n ± b n ) = lim n → ∞ a n ± lim n → ∞ b n {\displaystyle \lim _{n\to \infty }(a_{n}\pm b_{n})=\lim _{n\to \infty }a_{n}\pm \lim _{n\to \infty }b_{n}} - lim n → ∞ c a n = c lim n → ∞ a n {\displaystyle \lim _{n\to \infty }ca_{n}=c\lim _{n\to \infty }a_{n}} for all real numbers c {\displaystyle c} - lim n → ∞ ( a n b n ) = ( lim n → ∞ a n ) ( lim n → ∞ b n ) {\displaystyle \lim _{n\to \infty }(a_{n}b_{n})={\bigl (}\lim _{n\to \infty }a_{n}{\bigr )}{\bigl (}\lim _{n\to \infty }b_{n}{\bigr )}} - lim n → ∞ a n b n = ( lim n → ∞ a n ) / ( lim n → ∞ b n ) {\displaystyle \lim _{n\to \infty }{\frac {a_{n}}{b_{n}}}={\bigl (}\lim \limits _{n\to \infty }a_{n}{\bigr )}{\big /}{\bigl (}\lim \limits _{n\to \infty }b_{n}{\bigr )}} , provided that lim n → ∞ b n ≠ 0 {\displaystyle \lim _{n\to \infty }b_{n}\neq 0} - lim n → ∞ a n p = ( lim n → ∞ a n ) p {\displaystyle \lim _{n\to \infty }a_{n}^{p}={\bigl (}\lim _{n\to \infty }a_{n}{\bigr )}^{p}} for all p > 0 {\displaystyle p>0} and a n > 0 {\displaystyle a_{n}>0} Moreover: - If a n ≤ b n {\displaystyle a_{n}\leq b_{n}} for all n {\displaystyle n} greater than some N {\displaystyle N} , then lim n → ∞ a n ≤ lim n → ∞ b n {\displaystyle \lim _{n\to \infty }a_{n}\leq \lim _{n\to \infty }b_{n}} .[a] - ([Squeeze theorem](/source/Squeeze_theorem)) If ( c n ) {\displaystyle (c_{n})} is a sequence such that a n ≤ c n ≤ b n {\displaystyle a_{n}\leq c_{n}\leq b_{n}} for all n > N {\displaystyle n>N} and lim n → ∞ a n = lim n → ∞ b n = L {\displaystyle \lim _{n\to \infty }a_{n}=\lim _{n\to \infty }b_{n}=L} , then ( c n ) {\displaystyle (c_{n})} is convergent, and lim n → ∞ c n = L {\displaystyle \lim _{n\to \infty }c_{n}=L} . - If a sequence is [bounded](#Bounded) and [monotonic](#Increasing_and_decreasing) then it is convergent. - A sequence is convergent if and only if all of its subsequences are convergent. ### Cauchy sequences Main article: [Cauchy sequence](/source/Cauchy_sequence) The plot of a Cauchy sequence (*X**n*), shown in blue, as *X**n* versus n. In the graph the sequence appears to be converging to a limit as the distance between consecutive terms in the sequence gets smaller as n increases. In the [real numbers](/source/Real_number) every Cauchy sequence converges to some limit. 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](/source/Metric_spaces), and, in particular, in [real analysis](/source/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](/source/Rational_numbers) that are not convergent in the rationals, e.g. the sequence defined by x 1 = 1 {\displaystyle x_{1}=1} and x n + 1 = 1 2 ( x n + 2 x n ) {\displaystyle x_{n+1}={\tfrac {1}{2}}{\bigl (}x_{n}+{\tfrac {2}{x_{n}}}{\bigr )}} is Cauchy, but has no rational limit (cf. [Cauchy sequence § Non-example: rational numbers](/source/Cauchy_sequence#Non-example:_rational_numbers)). More generally, any sequence of rational numbers that converges to an [irrational number](/source/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](/source/Complete_metric_space) and are particularly nice for analysis. ### Infinite limits 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 a n {\displaystyle a_{n}} becomes arbitrarily large as n → ∞ {\displaystyle n\to \infty } , we write - lim n → ∞ a n = ∞ . {\displaystyle \lim _{n\to \infty }a_{n}=\infty .} 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 a n {\displaystyle a_{n}} becomes arbitrarily negative (i.e. negative and large in magnitude) as n → ∞ {\displaystyle n\to \infty } , we write - lim n → ∞ a n = − ∞ {\displaystyle \lim _{n\to \infty }a_{n}=-\infty } and say that the sequence **diverges** or **converges to negative infinity**. ## Series Main article: [Series (mathematics)](/source/Series_(mathematics)) A **series** is, informally speaking, the sum of the terms of a sequence. That is, it is an expression of the form ∑ n = 1 ∞ a n {\textstyle \sum _{n=1}^{\infty }a_{n}} or a 1 + a 2 + ⋯ {\displaystyle a_{1}+a_{2}+\cdots } , where ( a n ) {\displaystyle (a_{n})} 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 Nth partial sum of the series ∑ n = 1 ∞ a n {\textstyle \sum _{n=1}^{\infty }a_{n}} is the number - S N = ∑ n = 1 N a n = a 1 + a 2 + ⋯ + a N . {\displaystyle S_{N}=\sum _{n=1}^{N}a_{n}=a_{1}+a_{2}+\cdots +a_{N}.} The partial sums themselves form a sequence ( S N ) N ∈ N {\displaystyle (S_{N})_{N\in \mathbb {N} }} , which is called the **sequence of partial sums** of the series ∑ n = 1 ∞ a n {\textstyle \sum _{n=1}^{\infty }a_{n}} . If the sequence of partial sums converges, then we say that the series ∑ n = 1 ∞ a n {\textstyle \sum _{n=1}^{\infty }a_{n}} is **convergent**, and the limit lim N → ∞ S N {\textstyle \lim _{N\to \infty }S_{N}} is called the **value** of the series. The same notation is used to denote a series and its value, i.e. we write ∑ n = 1 ∞ a n = lim N → ∞ S N {\textstyle \sum _{n=1}^{\infty }a_{n}=\lim _{N\to \infty }S_{N}} . ## Use in other fields of mathematics ### Topology Sequences play an important role in topology, especially in the study of [metric spaces](/source/Metric_spaces). For instance: - A [metric space](/source/Metric_space) is [compact](/source/Compact_space) exactly when it is [sequentially compact](/source/Sequential_compactness). - A function from a metric space to another metric space is [continuous](/source/Continuous_function) exactly when it takes convergent sequences to convergent sequences. - A metric space is a [connected space](/source/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](/source/Topological_space) is [separable](/source/Separable_space) exactly when there is a dense sequence of points. Sequences can be generalized to [nets](/source/Net_(mathematics)) or [filters](/source/Filter_on_a_set). These generalizations allow one to extend some of the above theorems to spaces without metrics. #### Product topology The [topological product](/source/Product_topology) of a sequence of topological spaces is the [cartesian product](/source/Cartesian_product) of those spaces, equipped with a [natural topology](/source/Natural_topology) called the [product topology](/source/Product_topology). More formally, given a sequence of spaces ( X i ) i ∈ N {\displaystyle (X_{i})_{i\in \mathbb {N} }} , the product space - X := ∏ i ∈ N X i , {\displaystyle X:=\prod _{i\in \mathbb {N} }X_{i},} is defined as the set of all sequences ( x i ) i ∈ N {\displaystyle (x_{i})_{i\in \mathbb {N} }} such that for each i, x i {\displaystyle x_{i}} is an element of X i {\displaystyle X_{i}} . The **[canonical projections](/source/Projection_(set_theory))** are the maps *p**i* : *X* → *X**i* defined by the equation p i ( ( x j ) j ∈ N ) = x i {\displaystyle p_{i}((x_{j})_{j\in \mathbb {N} })=x_{i}} . Then the **product topology** on X is defined to be the [coarsest topology](/source/Coarsest_topology) (i.e. the topology with the fewest open sets) for which all the projections *p**i* are [continuous](/source/Continuous_(topology)). The product topology is sometimes called the **Tychonoff topology**. ### Analysis When discussing sequences in [analysis](/source/Mathematical_analysis), one will generally consider sequences of the form - ( x 1 , x 2 , x 3 , … ) or ( x 0 , x 1 , x 2 , … ) {\displaystyle (x_{1},x_{2},x_{3},\dots ){\text{ or }}(x_{0},x_{1},x_{2},\dots )} which is to say, infinite sequences of elements indexed by [natural numbers](/source/Natural_number). A sequence may start with an index different from 1 or 0. For example, the sequence defined by *x**n* = 1/log(*n*), where log is the [natural logarithm](/source/Natural_logarithm), 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](/source/Large_enough), that is, greater than some given N. The most elementary type of sequences are numerical ones, that is, sequences of [real](/source/Real_number) or [complex](/source/Complex_number) numbers. This type can be generalized to sequences of elements of some [vector space](/source/Vector_space). In analysis, the vector spaces considered are often [function spaces](/source/Function_space). Even more generally, one can study sequences with elements in some [topological space](/source/Topological_space). #### Sequence spaces Main article: [Sequence space](/source/Sequence_space) A [sequence space](/source/Sequence_space) is a [vector space](/source/Vector_space) whose elements are infinite sequences of [real](/source/Real_number) or [complex](/source/Complex_number) numbers. Equivalently, it is a [function space](/source/Function_space) whose elements are functions from the [natural numbers](/source/Natural_numbers) to the [field](/source/Field_(mathematics)) 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](/source/Vector_space) under the operations of [pointwise addition](/source/Pointwise_addition) of functions and pointwise scalar multiplication. All sequence spaces are [linear subspaces](/source/Linear_subspace) of this space. Sequence spaces are typically equipped with a [norm](/source/Norm_(mathematics)), or at least the structure of a [topological vector space](/source/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](/source/Lp_space) for the [counting measure](/source/Counting_measure) on the set of natural numbers. Other important classes of sequences like convergent sequences or [null sequences](/source/Sequence_space#c,_c0_and_c00) form sequence spaces, respectively denoted c and *c*0, with the sup norm. Any sequence space can also be equipped with the [topology](/source/Topology) of [pointwise convergence](/source/Pointwise_convergence), under which it becomes a special kind of [Fréchet space](/source/Fr%C3%A9chet_space) called an [FK-space](/source/FK-space). ### Linear algebra Sequences over a [field](/source/Field_(mathematics)) may also be viewed as [vectors](/source/Vector_(geometric)) in a [vector space](/source/Vector_space). Specifically, the set of F-valued sequences (where F is a field) is a [function space](/source/Function_space) (in fact, a [product space](/source/Product_space)) of F-valued functions over the set of natural numbers. ### Abstract algebra Abstract algebra employs several types of sequences, including sequences of mathematical objects such as groups or rings. #### Free monoid Main article: [Free monoid](/source/Free_monoid) If A is a set, the [free monoid](/source/Free_monoid) over A (denoted *A**, also called [Kleene star](/source/Kleene_star) of A) is a [monoid](/source/Monoid) containing all the finite sequences (or strings) of zero or more elements of A, with the binary operation of concatenation. The [free semigroup](/source/Free_semigroup) *A*+ is the subsemigroup of *A** containing all elements except the empty sequence. #### Exact sequences Main article: [Exact sequence](/source/Exact_sequence) In the context of [group theory](/source/Group_theory), a sequence - G 0 ⟶ f 1 G 1 ⟶ f 2 G 2 ⟶ f 3 ⋯ ⟶ f n G n {\displaystyle G_{0}\;{\overset {f_{1}}{\longrightarrow }}\;G_{1}\;{\overset {f_{2}}{\longrightarrow }}\;G_{2}\;{\overset {f_{3}}{\longrightarrow }}\;\cdots \;{\overset {f_{n}}{\longrightarrow }}\;G_{n}} of [groups](/source/Group_(mathematics)) and [group homomorphisms](/source/Group_homomorphism) is called **exact**, if the [image](/source/Image_(mathematics)) (or [range](/source/Range_of_a_function)) of each homomorphism is equal to the [kernel](/source/Kernel_(algebra)) of the next: - i m ( f k ) = k e r ( f k + 1 ) {\displaystyle \mathrm {im} (f_{k})=\mathrm {ker} (f_{k+1})} The sequence of groups and homomorphisms may be either finite or infinite. A similar definition can be made for certain other [algebraic structures](/source/Algebraic_structure). For example, one could have an exact sequence of [vector spaces](/source/Vector_space) and [linear maps](/source/Linear_map), or of [modules](/source/Module_(mathematics)) and [module homomorphisms](/source/Module_homomorphism). #### Spectral sequences Main article: [Spectral sequence](/source/Spectral_sequence) In [homological algebra](/source/Homological_algebra) and [algebraic topology](/source/Algebraic_topology), a **spectral sequence** is a means of computing homology groups by taking successive approximations. Spectral sequences are a generalization of [exact sequences](/source/Exact_sequence), and since their introduction by [Jean Leray](/source/Jean_Leray) ([1946](#CITEREFLeray1946)), they have become an important research tool, particularly in [homotopy theory](/source/Homotopy_theory). ### Set theory An [ordinal-indexed sequence](/source/Order_topology#Ordinal-indexed_sequences) is a generalization of a sequence. If α is a [limit ordinal](/source/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 In [computer science](/source/Computer_science), finite sequences are called [lists](/source/List_(computer_science)). Potentially infinite sequences are called [streams](/source/Stream_(computer_science)). Finite sequences of characters or digits are called [strings](/source/String_(computer_science)). ### Streams Infinite sequences of [digits](/source/Numerical_digit) (or [characters](/source/Character_(computing))) drawn from a [finite](/source/Finite_set) [alphabet](/source/Alphabet_(computer_science)) are of particular interest in [theoretical computer science](/source/Theoretical_computer_science). They are often referred to simply as *sequences* or *[streams](/source/Stream_(computing))*, as opposed to finite *[strings](/source/String_(computer_science)#Formal_theory)*. Infinite binary sequences, for instance, are infinite sequences of [bits](/source/Bit) (characters drawn from the alphabet {0, 1}). The set *C* = {0, 1}∞ of all infinite binary sequences is sometimes called the [Cantor space](/source/Cantor_space). An infinite binary sequence can represent a [formal language](/source/Formal_language) (a set of strings) by setting the nth bit of the sequence to 1 if and only if the nth string (in [shortlex order](/source/Shortlex_order)) is in the language. This representation is useful in the [diagonalization method](/source/Cantor's_diagonal_argument) for proofs.[11] ## See also - [Enumeration](/source/Enumeration) - [On-Line Encyclopedia of Integer Sequences](/source/On-Line_Encyclopedia_of_Integer_Sequences) - [Recurrence relation](/source/Recurrence_relation) - [Sequence space](/source/Sequence_space) **Operations** - [Cauchy product](/source/Cauchy_product) **Examples** - [Discrete-time signal](/source/Discrete-time_signal) - [Farey sequence](/source/Farey_sequence) - [Fibonacci sequence](/source/Fibonacci_number) - [Look-and-say sequence](/source/Look-and-say_sequence) - [Thue–Morse sequence](/source/Thue%E2%80%93Morse_sequence) - [List of integer sequences](/source/List_of_integer_sequences) **Types** - [±1-sequence](/source/%C2%B11-sequence) - [Arithmetic progression](/source/Arithmetic_progression) - [Automatic sequence](/source/Automatic_sequence) - [Cauchy sequence](/source/Cauchy_sequence) - [Constant-recursive sequence](/source/Constant-recursive_sequence) - [Geometric progression](/source/Geometric_progression) - [Harmonic progression](/source/Harmonic_progression_(mathematics)) - [Holonomic sequence](/source/Holonomic_function) - [Regular sequence](/source/K-regular_sequence) - [Pseudorandom binary sequence](/source/Pseudorandom_binary_sequence) - [Random sequence](/source/Random_sequence) **Related concepts** - [List (computing)](/source/List_(computing)) - [Net (topology)](/source/Net_(topology)) (a generalization of sequences) - [Ordinal-indexed sequence](/source/Order_topology#Ordinal-indexed_sequences) - [Recursion (computer science)](/source/Recursion_(computer_science)) - [Set (mathematics)](/source/Set_(mathematics)) - [Tuple](/source/Tuple) - [Permutation](/source/Permutation) ## Notes 1. **[^](#cite_ref-11)** If the inequalities are replaced by strict inequalities then this is false: There are sequences such that a n < b n {\displaystyle a_{n}