What is a sequence?
A sequence is simply an ordered list like:
I hope that this was helpful.
A sequence is an infinite set of points which are ordered and a mapping can be associated with with that set and the set of natural numbers.
The general notion of a sequence is that it is an infinite set with every element associated with a natural number even though all infinite sets may not be sequences.
A sequence may be represented by,
This is indeed the set of naturals.
However, there can be other ordered arrays of numbers which are sometimes referred at as sequences. They don't fit right with the definition I gave.
Let's for example take a Fibonacci sequence.
This sequence is made by adding the previous two numbers on the list to form the next one and so on.
There can be arithmetic sequences, like
I like to call them progressions and reserve the word sequence for the definition I proposed in the first 2 paragraphs.
A well ordered set is a set of objects together with an ordering relation
A sequence is a function from a well ordered set to another set. The domain is known as the index, and the terms of the sequence are often written with the index as a subscript, e.g.
Normally the domain is either finite, being the set of all natural numbers up to a given natural number, or is infinite, being the set of all natural numbers. It is also possible to have sequences larger than the set of natural numbers, indexed by well ordered sets larger than the natural numbers.
More simply, a finite sequence is a list of elements:
#a_1, a_2, a_3,..., a_n#
and most infinite sequences you will encounter are written:
#a_1, a_2, a_3,...#
where the ellipsis signifies that the list continues with no last element.
Typical examples you will meet at precalculus level are arithmetic sequences and geometric sequences, but these are only very particular kinds of sequence. There are many other useful types and examples of sequence.
For a use of transfinite sequences indexed by well-ordered sets larger than