The generalisation of ordered pair to something having more positions is usually called a tuple (or ordered tuple). More particularly one gets the term -tuple, which refers to a list, , with entries from some set, ; here is a natural number. It thus corresponds to an element in the -fold product set, . The various elements of the -tuple are usually called its components and sometimes it is useful to call the set of components the support or range of the tuple.
An ordered pair is a -tuple. A -tuple is a triple, a -tuple is a quadruple, a -tuple is a quintuple etc.
The notion of -tuple is trivial; a -tuple from is equivalent to an element of . But if you wish to emphasize that you have a -tuple, then it may be called a singleton.
The notion of -tuple is also trivial, but in a different way; there is (for each set ) a single -tuple from . See empty list for notations, but in the end it hardly matters what you call it.
The term ‘tuple’ is usually used for an -tuple for a specific number . If we wish to speak of an -tuple for an arbitrary (particularly without specifying that ), then we may speak of a list (which has other terminology, described on that page). Then the set of lists is the disjoint union over of the sets of -tuples.
The term ‘tuple’ is usually used for an -tuple for a finite number . If we wish to speak of an -tuple for an infinite (or possibly infinite) , then we may speak of a sequence.
See ordered pair for methods of formalising ordered pairs (which are -tuples) in various foundations of mathematics. Some of these generalise immediately to -tuples for arbitrary ; otherwise, we may define -tuples recursively: a triple is an ordered pair whose (say) first component is an ordered pair; a quadruple is an ordered pair whose first component is a triple, etc.
Last revised on January 24, 2023 at 17:51:25. See the history of this page for a list of all contributions to it.