From Infogalactic: the planetary knowledge core
Jump to: navigation, search

A tuple is a finite ordered list of elements. In mathematics, an n-tuple is a sequence (or ordered list) of n elements, where n is a non-negative integer. There is only one 0-tuple, an empty sequence. An n-tuple is defined inductively using the construction of an ordered pair. Tuples are usually written by listing the elements within parentheses "(\text{ })" and separated by commas; for example, (2, 7, 4, 1, 7) denotes a 5-tuple. Sometimes other symbols are used to surround the elements, such as square brackets "[ ]" or angle brackets "\langle\text{ }\rangle". Braces "{ }" are never used for tuples, as they are the standard notation for sets. Tuples are often used to describe other mathematical objects, such as vectors. In computer science, tuples are directly implemented as product types in most functional programming languages. More commonly, they are implemented as record types, where the components are labeled instead of being identified by position alone. This approach is also used in relational algebra. Tuples are also used in relation to programming the semantic web with Resource Description Framework or RDF. Tuples are also used in linguistics[1] and philosophy.[2]


The term originated as an abstraction of the sequence: single, double, triple, quadruple, quintuple, sextuple, septuple, octuple, ..., n‑tuple, ..., where the prefixes are taken from the Latin names of the numerals. The unique 0‑tuple is called the null tuple. A 1‑tuple is called a singleton, a 2‑tuple is called an ordered pair and a 3‑tuple is a triple or triplet. n can be any nonnegative integer. For example, a complex number can be represented as a 2‑tuple, a quaternion can be represented as a 4‑tuple, an octonion can be represented as an 8‑tuple and a sedenion can be represented as a 16‑tuple.

Although these uses treat ‑tuple as the suffix, the original suffix was ‑ple as in "triple" (three-fold) or "decuple" (ten‑fold). This originates from a medieval Latin suffix ‑plus (meaning "more"[dubious ]) related to Greek ‑πλοῦς, which replaced the classical and late antique ‑plex (meaning "folded"), as in "duplex".[3]

Names for tuples of specific lengths

Tuple Length n Name Alternative names
0 empty tuple unit / empty sequence
1 single singleton / monuple
2 double couple / (ordered) pair / dual / twin / product
3 triple treble / triplet / triad
4 quadruple quad
5 quintuple pentuple
6 sextuple hexuple
7 septuple heptuple
8 octuple
9 nonuple
10 decuple
11 undecuple hendecuple
12 duodecuple
13 tredecuple
14 quattuordecuple
15 quindecuple
16 sexdecuple
17 septendecuple
18 octodecuple
19 novemdecuple
20 vigintuple
21 unvigintuple
22 duovigintuple
23 trevigintuple
24 quattuorvigintuple
25 quinvigintuple
26 sexvigintuple
27 septenvigintuple
28 octovigintuple
29 novemvigintuple
30 trigintuple
40 quadragintuple
50 quinquagintuple
60 sexagintuple
70 septuagintuple
80 octogintuple
90 nongentuple
100 centuple
1,000 milluple


The general rule for the identity of two n-tuples is

(a_1, a_2, \ldots, a_n) = (b_1, b_2, \ldots, b_n) if and only if a_1=b_1,\text{ }a_2=b_2,\text{ }\ldots,\text{ }a_n=b_n.

Thus a tuple has properties that distinguish it from a set.

  1. A tuple may contain multiple instances of the same element, so
    tuple (1,2,2,3) \neq (1,2,3); but set \{1,2,2,3\} = \{1,2,3\}.
  2. Tuple elements are ordered: tuple (1,2,3) \neq (3,2,1), but set \{1,2,3\} = \{3,2,1\}.
  3. A tuple has a finite number of elements, while a set or a multiset may have an infinite number of elements.


There are several definitions of tuples that give them the properties described in the previous section.

Tuples as functions

If we are dealing with sets, an n-tuple can be regarded as a function, F, whose domain is the tuple's implicit set of element indices, X, and whose codomain, Y, is the tuple's set of elements. Formally:

(a_1, a_2, \dots, a_n) \equiv (X,Y,F)


      X & = \{1, 2, \dots, n\}                       \\
      Y & = \{a_1, a_2, \ldots, a_n\}                \\
      F & = \{(1, a_1), (2, a_2), \ldots, (n, a_n)\}. \\

In slightly less formal notation this says:

 (a_1, a_2, \dots, a_n) := (F(1), F(2), \dots, F(n)).

Tuples as nested ordered pairs

Another way of modeling tuples in Set Theory is as nested ordered pairs. This approach assumes that the notion of ordered pair has already been defined; thus a 2-tuple

  1. The 0-tuple (i.e. the empty tuple) is represented by the empty set \emptyset.
  2. An n-tuple, with n > 0, can be defined as an ordered pair of its first entry and an (n - 1)-tuple (which contains the remaining entries when n > 1):
    (a_1, a_2, a_3, \ldots, a_n) = (a_1, (a_2, a_3, \ldots, a_n))

This definition can be applied recursively to the (n - 1)-tuple:

(a_1, a_2, a_3, \ldots, a_n) = (a_1, (a_2, (a_3, (\ldots, (a_n, \emptyset)\ldots))))

Thus, for example:

         (1, 2, 3) & = (1, (2, (3, \emptyset)))      \\
      (1, 2, 3, 4) & = (1, (2, (3, (4, \emptyset)))) \\

A variant of this definition starts "peeling off" elements from the other end:

  1. The 0-tuple is the empty set \emptyset.
  2. For n > 0:
    (a_1, a_2, a_3, \ldots, a_n) = ((a_1, a_2, a_3, \ldots, a_{n-1}), a_n)

This definition can be applied recursively:

(a_1, a_2, a_3, \ldots, a_n) = ((\ldots(((\emptyset, a_1), a_2), a_3), \ldots), a_n)

Thus, for example:

         (1, 2, 3) & = (((\emptyset, 1), 2), 3)      \\
      (1, 2, 3, 4) & = ((((\emptyset, 1), 2), 3), 4) \\

Tuples as nested sets

Using Kuratowski's representation for an ordered pair, the second definition above can be reformulated in terms of pure set theory:

  1. The 0-tuple (i.e. the empty tuple) is represented by the empty set \emptyset;
  2. Let x be an n-tuple (a_1, a_2, \ldots, a_n), and let x \rightarrow b \equiv (a_1, a_2, \ldots, a_n, b). Then, x \rightarrow b \equiv \{\{x\}, \{x, b\}\}. (The right arrow, \rightarrow, could be read as "adjoined with".)

In this formulation:

     ()      & &                     &=& \emptyset                                    \\
             & &                     & &                                              \\
     (1)     &=& ()    \rightarrow 1 &=& \{\{()\},\{(),1\}\}                          \\
             & &                     &=& \{\{\emptyset\},\{\emptyset,1\}\}            \\
             & &                     & &                                              \\
     (1,2)   &=& (1)   \rightarrow 2 &=& \{\{(1)\},\{(1),2\}\}                        \\
             & &                     &=& \{\{\{\{\emptyset\},\{\emptyset,1\}\}\},     \\
             & &                     & & \{\{\{\emptyset\},\{\emptyset,1\}\},2\}\}    \\
             & &                     & &                                              \\
     (1,2,3) &=& (1,2) \rightarrow 3 &=& \{\{(1,2)\},\{(1,2),3\}\}                    \\
             & &                     &=& \{\{\{\{\{\{\emptyset\},\{\emptyset,1\}\}\}, \\
             & &                     & & \{\{\{\emptyset\},\{\emptyset,1\}\},2\}\}\}, \\
             & &                     & & \{\{\{\{\{\emptyset\},\{\emptyset,1\}\}\},   \\
             & &                     & & \{\{\{\emptyset\},\{\emptyset,1\}\},2\}\},3\}\}                                       \\

n-tuples of m-sets

In discrete mathematics, especially combinatorics and finite probability theory, n-tuples arise in the context of various counting problems and are treated more informally as ordered lists of length n.[4] n-tuples whose entries come from a set of m elements are also called arrangements with repetition, permutations of a multiset and, in some non-English literature, variations with repetition. The number of n-tuples of an m-set is mn. This follows from the combinatorial rule of product.[5] If S is a finite set of cardinality m, this number is the cardinality of the n-fold Cartesian power S × S × ... S. Tuples are elements of this product set.

Type theory

In type theory, commonly used in programming languages, a tuple has a product type; this fixes not only the length, but also the underlying types of each component. Formally:

(x_1, x_2, \ldots, x_n) : \mathsf{T}_1 \times \mathsf{T}_2 \times \ldots \times \mathsf{T}_n

and the projections are term constructors:

\pi_1(x) : \mathsf{T}_1,~\pi_2(x) : \mathsf{T}_2,~\ldots,~\pi_n(x) : \mathsf{T}_n

The tuple with labeled elements used in the relational model has a record type. Both of these types can be defined as simple extensions of the simply typed lambda calculus.[6]

The notion of a tuple in type theory and that in set theory are related in the following way: If we consider the natural model of a type theory, and use the Scott brackets to indicate the semantic interpretation, then the model consists of some sets S_1, S_2, \ldots, S_n (note: the use of italics here that distinguishes sets from types) such that:

[\![\mathsf{T}_1]\!] = S_1,~[\![\mathsf{T}_2]\!] = S_2,~\ldots,~[\![\mathsf{T}_n]\!] = S_n

and the interpretation of the basic terms is:

[\![x_1]\!] \in [\![\mathsf{T}_1]\!],~[\![x_2]\!] \in [\![\mathsf{T}_2]\!],~\ldots,~[\![x_n]\!] \in [\![\mathsf{T}_n]\!].

The n-tuple of type theory has the natural interpretation as an n-tuple of set theory:[7]

[\![(x_1, x_2, \ldots, x_n)]\!] = (\,[\![x_1]\!], [\![x_2]\!], \ldots, [\![x_n]\!]\,)

The unit type has as semantic interpretation the 0-tuple.

See also


  1. "N‐tuple - Oxford Reference". oxfordreference.com. Retrieved 1 May 2015.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
  2. "Ordered n-tuple - Oxford Reference". oxfordreference.com. Retrieved 1 May 2015.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
  3. OED, s.v. "triple", "quadruple", "quintuple", "decuple"
  4. D'Angelo & West 2000, p. 9
  5. D'Angelo & West 2000, p. 101
  6. Pierce, Benjamin (2002). Types and Programming Languages. MIT Press. pp. 126–132. ISBN 0-262-16209-1.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
  7. Steve Awodey, From sets, to types, to categories, to sets, 2009, preprint


ar:زوج مرتب