Tuple

In mathematics, a tuple is a finite sequence (or ordered list) of numbers.

Uses your system voice; voice and rate in settings.

≈ 9 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, a tuple is a finite sequence (or ordered list) of numbers. More generally, it is a sequence of mathematical objects, called the elements of the tuple. An -tuple is a tuple of elements, where is a non-negative integer.

There is only one 0-tuple, called the empty tuple. A 1-tuple and a 2-tuple are commonly called a singleton and an ordered pair, respectively. The term "infinite tuple" is occasionally used for "infinite sequences".

Tuples are usually written by listing the elements within parentheses " " and separated by commas; for example, denotes a 5-tuple. Other types of brackets are sometimes used, although they may have a different meaning. An -tuple can be formally defined as the image of a function that has the set of the first natural numbers as its domain ( ).

Tuples may be also defined from ordered pairs by a recurrence starting from an ordered pair; indeed, an -tuple can be identified with the ordered pair of its first elements and its th element, for example, \left( \left( \left( 1,2 \right),3 \right),4 \right)=\left( 1,2,3,4 \right) . In computer science, tuples come in many forms.

Most typed functional programming languages implement tuples directly as product types, tightly associated with algebraic data types, pattern matching, and destructuring assignment. Many programming languages offer an alternative to tuples, known as record types, featuring unordered elements accessed by label.

A few programming languages combine ordered tuple product types and unordered record types into a single construct, as in C structs and Haskell records. Relational databases may formally identify their rows (records) as tuples. Tuples also occur in relational algebra; when programming the semantic web with the Resource Description Framework (RDF); in linguistics; and in philosophy.

Etymology

The term originated as an abstraction of the sequence: single, couple/double, triple, quadruple, quintuple, sextuple, septuple, octuple, ..., ‑tuple, ..., where the prefixes are taken from the Latin names of the numerals. The unique 0-tuple is called the null tuple or empty tuple.

A 1‑tuple is called a single (or singleton), a 2‑tuple is called an ordered pair or couple, and a 3‑tuple is called a triple (or triplet). The number can be any nonnegative integer.

For example, a complex number can be represented as a 2‑tuple of reals, 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 medieval Latin plus (meaning "more") related to Greek ‑πλοῦς, which replaced the classical and late antique ‑plex (meaning "folded"), as in "duplex".

Properties

The general rule for the identity of two -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: 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\} .

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

Definitions

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

Tuples as functions

The 0 -tuple may be identified as the empty function. For n \geq 1, the n -tuple \left(a_1, \ldots, a_n\right) may be identified with the surjective function F ~:~ \left\{ 1, \ldots, n \right\} ~\to~ \left\{ a_1, \ldots, a_n \right\} with domain \operatorname{domain} F = \left\{ 1, \ldots, n \right\} = \left\{ i \in \N : 1 \leq i \leq n\right\} and with codomain \operatorname{codomain} F = \left\{ a_1, \ldots, a_n \right\}, that is defined at i \in \operatorname{domain} F = \left\{ 1, \ldots, n \right\} by F(i) := a_i.

That is, F is the function defined by \begin{alignat}{3} 1 \;&\mapsto&&\; a_1 \\ \;&\;\;\vdots&&\; \\ n \;&\mapsto&&\; a_n \\ \end{alignat} in which case the equality \left(a_1, a_2, \dots, a_n\right) = \left(F(1), F(2), \dots, F(n)\right) necessarily holds. Tuples as sets of ordered pairs Functions are commonly identified with their graphs, which is a certain set of ordered pairs.

Indeed, many authors use graphs as the definition of a function. Using this definition of "function", the above function F can be defined as: F ~:=~ \left\{ \left(1, a_1\right), \ldots, \left(n, a_n\right) \right\}.

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. The 0-tuple (i.e. the empty tuple) is represented by the empty set \emptyset .

An -tuple, with , can be defined as an ordered pair of its first entry and an -tuple (which contains the remaining entries when : (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 -tuple: (a_1, a_2, a_3, \ldots, a_n) = (a_1, (a_2, (a_3, (\ldots, (a_n, \emptyset)\ldots)))) Thus, for example: \begin{align} (1, 2, 3) & = (1, (2, (3, \emptyset))) \\ (1, 2, 3, 4) & = (1, (2, (3, (4, \emptyset)))) \\ \end{align} A variant of this definition starts "peeling off" elements from the other end: The 0-tuple is the empty set \emptyset . For : (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: \begin{align} (1, 2, 3) & = (((\emptyset, 1), 2), 3) \\ (1, 2, 3, 4) & = ((((\emptyset, 1), 2), 3), 4) \\ \end{align}

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: The 0-tuple (i.e. the empty tuple) is represented by the empty set \emptyset ; Let x be an -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: \begin{array}{lclcl} () & & &=& \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\}\} \\ \end{array}

-tuples of -sets

In discrete mathematics, especially combinatorics and finite probability theory, -tuples arise in the context of various counting problems and are treated more informally as ordered lists of length . -tuples whose entries come from a set of elements are also called arrangements with repetition, permutations of a multiset and, in some non-English literature, variations with repetition. The number of -tuples of an -set is .

This follows from the combinatorial rule of product. If is a finite set of cardinality , this number is the cardinality of the -fold Cartesian power . Tuples are elements of this product set.

[\![\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 -tuple of type theory has the natural interpretation as an -tuple of set theory: [\![(x_1, x_2, \ldots, x_n)]\!] = (\,[\![x_1]\!], [\![x_2]\!], \ldots, [\![x_n]\!]\,) The unit type has as semantic interpretation the 0-tuple.

For a list of tuple types in programming languages, see Product type#Product types in programming languages.

See also

Arity Coordinate vector Exponential object Formal language Multidimensional Expressions (OLAP) Prime k-tuple Relation (mathematics) Sequence Tuplespace

Sources

Keith Devlin, The Joy of Sets. Springer Verlag, 2nd ed., 1993, , pp. 7–8 Abraham Adolf Fraenkel, Yehoshua Bar-Hillel, Azriel Lévy, Foundations of school Set Theory, Elsevier Studies in Logic Vol. 67, 2nd Edition, revised, 1973, , p. 33 Gaisi Takeuti, W. M. Zaring, Introduction to Axiomatic Set Theory, Springer GTM 1, 1971, , p. 14 George J. Tourlakis, Lecture Notes in Logic and Set Theory.

Volume 2: Set Theory, Cambridge University Press, 2003, , pp. 182–193

Text derived from https://en.wikipedia.org/w/index.php?oldid=1374780887 under CC BY-SA 4.0; modifications have been made.

Words in each sectionTuples as nested ordere…Tuples as nested ordered pairsTuples as nested ordered pairs: 229 words229Tuples as functionsTuples as functionsTuples as functions: 214 words214Tuples as nested setsTuples as nested setsTuples as nested sets: 196 words196-tuples of -sets-tuples of -sets-tuples of -sets: 193 words193EtymologyEtymologyEtymology: 175 words175PropertiesPropertiesProperties: 125 words125SourcesSourcesSources: 97 words97DefinitionsDefinitionsDefinitions: 16 words16See alsoSee alsoSee also: 16 words16
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001374780887 · captured 2026-09-14 · ledger · version history

Cite this page as: encyclopegia.org, “Tuple”, snapshot enwiki-001374780887. https://encyclopegia.org/a/tuple

Sources cited in this revision

7 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.