# GetWiki

*tuple*

ARTICLE SUBJECTS

being →

database →

ethics →

fiction →

history →

internet →

language →

linux →

logic →

method →

news →

policy →

purpose →

religion →

science →

software →

truth →

unix →

wiki →

ARTICLE TYPES

essay →

feed →

help →

system →

wiki →

ARTICLE ORIGINS

critical →

forked →

imported →

original →

tuple

[ temporary import ]

**please note:**

- the content below is remote from Wikipedia

- it has been imported raw for GetWiki

**tuple**is a finite ordered list (sequence) of elements. An

**{{math|**is a sequence (or ordered list) of {{math|

*n*}}-tuple*n*}} elements, where {{math|

*n*}} is a non-negative integer. There is only one 0-tuple, an empty sequence, or empty tuple, as it is referred to. An {{math|

*n*}}-tuple is defined inductively using the construction of an ordered pair.Mathematicians usually write tuples 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 "< >". Braces "{ }" are only used in defining arrays in some programming languages such as Java and Visual Basic, but not in mathematical expressions, as they are the standard notation for sets. The term

*tuple*can often occur when discussing other mathematical objects, such as vectors.In computer science, tuples come in many forms. In dynamically typed languages, such as Lisp, lists are commonly used as tuples.{{citation needed|date =May 2017}} Most typed functional programming languages implement tuples directly as product typesweblink tightly associated with algebraic data types, pattern matching, and destructuring assignmentweblink Many programming languages offer an alternative to tuples, known as record types, featuring unordered elements accessed by labelweblink 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;WEB,weblink Nâ€tuple - Oxford Reference, oxfordreference.com, 1 May 2015, and in philosophy.BOOK, Blackburn, Simon, Simon Blackburn, 1994, ordered n-tuple, The Oxford Dictionary of Philosophy,weblink 3, Oxford, Oxford University Press, 2016, 342, Oxford quick reference, 9780198735304, 2017-06-30, ordered n-tuple[:] A generalization of the notion of an [...] ordered pair to sequences of n objects.,

## Etymology

The term originated as an abstraction of the sequence: single, double, triple, quadruple, quintuple, sextuple, septuple, octuple, ..., {{math|*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. {{math|

*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 medieval Latin

*plus*(meaning "more") related to Greek â€‘Ï€Î»Î¿á¿¦Ï‚, which replaced the classical and late antique

*â€‘plex*(meaning "folded"), as in "duplex".

*OED*,

*s.v.*"triple", "quadruple", "quintuple", "decuple"{{efn|Compare the etymology of ploidy, from the Greek for -fold.}}

### Names for tuples of specific lengths

{{cot|Table of names and varants for specific lengths}}{| class="wikitable"! Tuple length, n !! Name !! Alternative names0 | empty tuple | unit / empty sequence / null tuple |

1 | single | singleton / monuple / monad |

2 | double | dual / couple / (ordered) pair / twin / duad |

3 | triple | treble / triplet / triad |

4 | quadruple | quad / tetrad |

5 | quintuple | pentuple / quint / pentad |

6 | sextuple | hextuple |

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 |

31 | untrigintuple |

40 | quadragintuple |

41 | unquadragintuple |

50 | quinquagintuple |

60 | sexagintuple |

70 | septuagintuple |

80 | octogintuple |

90 | nongentuple |

100 | centuple |

1,000 | milluple |

## Properties

The general rule for the identity of two {{math|*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. - 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

If we are dealing with sets, an {{math|*n*}}-tuple can be regarded as a function, {{math|

*F*}}, whose domain is the tuple's implicit set of element indices, {{math|

*X*}}, and whose codomain, {{math|

*Y*}}, is the tuple's set of elements. Formally:

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

where:
begin{align}

X & = {1, 2, dots, n}

Y & = {a_1, a_2, ldots, a_n}

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

end{align}

In slightly less formal notation this says:
X & = {1, 2, dots, n}

Y & = {a_1, a_2, ldots, a_n}

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

end{align}

(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- The 0-tuple (i.e. the empty tuple) is represented by the empty set emptyset.
- An {{math|
*n*}}-tuple, with {{math|*n*> 0}}, can be defined as an ordered pair of its first entry and an {{math|(*n*âˆ’ 1)}}-tuple (which contains the remaining entries when {{math|*n*> 1)}}: - : (a_1, a_2, a_3, ldots, a_n) = (a_1, (a_2, a_3, ldots, a_n))

*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:
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: (1, 2, 3) & = (1, (2, (3, emptyset)))

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

end{align}

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

(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}

(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 {{math|
*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".)

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}

() & & &=& 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}

## {{anchor|n-tuple}}{{math|*n*}}-tuples of {{math|*m*}}-sets

In discrete mathematics, especially combinatorics and finite probability theory, {{math|*n*}}-tuples arise in the context of various counting problems and are treated more informally as ordered lists of length {{math|

*n*}}.{{harvnb|D'Angelo|West|2000|p=9}} {{math|

*n*}}-tuples whose entries come from a set of {{math|

*m*}} elements are also called

*arrangements with repetition*,

*permutations of a multiset*and, in some non-English literature,

*variations with repetition*. The number of {{math|

*n*}}-tuples of an {{math|

*m*}}-set is {{math|

*m*

*n*}}. This follows from the combinatorial rule of product.{{harvnb|D'Angelo|West|2000|p=101}} If {{math|

*S*}} is a finite set of cardinality {{math|

*m*}}, this number is the cardinality of the {{math|

*n*}}-fold Cartesian power {{math|

*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.BOOK, Pierce, Benjamin, Types and Programming Languages, MIT Press, 2002, 0-262-16209-1, 126â€“132, 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 {{math|*n*}}-tuple of type theory has the natural interpretation as an {{math|

*n*}}-tuple of set theory:Steve Awodey,

*From sets, to types, to categories, to sets*, 2009, preprint

[![(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

{{Wiktionary|tuple}}- Arity
- Exponential object
- Formal language
- (Multidimensional ExpressionsMDX data types|OLAP: Multidimensional Expressions)
- Prime k-tuple
- Relation (mathematics)
- Tuplespace

## Notes

{{notelist}}## References

{{Reflist}}## Sources

- {{citation|first1=John P.|last1=D'Angelo|first2=Douglas B.|last2=West|title=Mathematical Thinking/Problem-Solving and Proofs|year=2000|edition=2nd|publisher=Prentice-Hall|isbn=978-0-13-014412-6}}
- Keith Devlin,
*The Joy of Sets*. Springer Verlag, 2nd ed., 1993, {{isbn|0-387-94094-4}}, pp. 7â€“8 - Abraham Adolf Fraenkel, Yehoshua Bar-Hillel, Azriel LÃ©vy,
*Foundations of set theory*, Elsevier Studies in Logic Vol. 67, Edition 2, revised, 1973, {{isbn|0-7204-2270-1}}, p. 33 - Gaisi Takeuti, W. M. Zaring,
*Introduction to Axiomatic Set Theory*, Springer GTM 1, 1971, {{isbn|978-0-387-90024-7}}, p. 14 - George J. Tourlakis,
*Lecture Notes in Logic and Set Theory. Volume 2: Set theory*, Cambridge University Press, 2003, {{isbn|978-0-521-75374-6}}, pp. 182â€“193

**- content above as imported from Wikipedia**

- "

- time: 8:36pm EDT - Mon, Aug 20 2018

- "

__tuple__" does not exist on GetWiki (yet)- time: 8:36pm EDT - Mon, Aug 20 2018

[ this remote article is provided by Wikipedia ]

LATEST EDITS [ see all ]

GETWIKI 09 MAY 2016

GETWIKI 18 OCT 2015

GETWIKI 20 AUG 2014

GETWIKI 19 AUG 2014

GETWIKI 18 AUG 2014

© 2018 M.R.M. PARROTT | ALL RIGHTS RESERVED