Definition 2
Tag 03MX, permanent. Cite it as [Bourbaki, Tag 03MX].
Theory of Sets, chapter III, § 6. Infinite sets
A sequence (resp. a sequence of elements of a set E) is a family (resp. a family of elements of E) whose index set is a subset of . The sequence is said to be infinite if its index set is an infinite subset of .
Let be a relation and let I denote the set of integers such that is true. I is then a subset of . A sequence is then sometimes written , and is called the nth term in the sequence. A sequence whose index set is the set of integers is often written or , or even just if or . Under the same conditions, for example, the notations and are used to denote the product of a sequence of sets , and there are analogous notations for unions, intersections, cardinal products, and cardinal sums.
Every subfamily of a sequence is a sequence, called a subsequence of the given sequence.
Two sequences , with the same index set are said to differ only in the order of their terms if there exists a permutation of the index set I such that for all .
A multiple sequence is a family whose index set is a subset of a product ( an integer) ("double sequence" for , "triple sequence" for , and so on).
Let I be a set equipotent to and let be a bijection of onto I. For each family indexed by the set I, the sequence is said to be obtained by arranging the family in the order defined by . The sequences which correspond in this way to two distinct bijections of onto I differ only in the order of their terms. For a finite family indexed by a set I of elements we may similarly define a finite sequence with or as index set, by arranging the family in the order defined by a bijection of one or the other of these intervals onto I.
Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.
Cited by
Nothing.
Cites
Nothing.