Tuple

In mathematics a tuple is a finite ordered list (sequence) of elements. 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.

Mathematicians usually write tuples by listing the elements within parentheses " " and separated by commas; for example,
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 asvectors.

In computer science, tuples come in many forms. In dynamically typed languages, such as Lisp, lists are commonly used as tuples.
Most typed functional programming languages implement tuples directly as product types[1], tightly associated with algebraic data
types, pattern matching, and destructuring assignment.[2] Many programming languages offer an alternative to tuples, known as
record types, featuring unordered elements accessed by label.[3] 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[4]; and in philosophy.[5]

Contents
Etymology
Names for tuples of specific lengths
Properties
Definitions
Tuples as functions
Tuples as nested ordered pairs
Tuples as nested sets
n-tuples of m-sets
Type theory
See also
Notes
References

Etymology
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 asedenion 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".[6]

Names for tuples of specific lengths

Tuple length, Name Alternative names
0 empty tuple unit / empty sequence
1 single singleton / monuple / monad
2 double couple / (ordered) pair / 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
50 quinquagintuple
60 sexagintuple
70 septuagintuple
80 octogintuple
90 nongentuple
100 centuple
 1,000 milluple

Properties
The general rule for the identity of twon-tuples is

if and only if

Thus a tuple has properties that distinguish it from aset.

1. A tuple may contain multiple instances of the same element, so

tuple ; but set .
2. Tuple elements are ordered: tuple , but set .
3. A tuple has a finite number of elements, while a set or amultiset 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 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:

where:

In slightly less formal notation this says:

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 .
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 whenn > 1) :

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

Thus, for example:

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

1. The 0-tuple is the empty set .

2. For n > 0 :

This definition can be applied recursively:

Thus, for example:

Tuples as nested sets

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

1. The 0-tuple (i.e. the empty tuple) is represented by the empty set ;
2. Let be an n-tuple , and let . Then, .
(The right arrow, , could be read as "adjoined with".)
In this formulation:

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.[7] 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 combinatorialrule of product.[8] If S is a finite set of cardinality m,
this number is the cardinality of then-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:

and the projections are term constructors:

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.[9]

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 (note:
the use of italics here that distinguishes sets from types) such that:

and the interpretation of the basic terms is:

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

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

See also
Arity
Exponential object
Formal language
OLAP: Multidimensional Expressions
Prime k-tuple
Relation (mathematics)
Tuplespace

Notes
1. https://wiki.haskell.org/Algebraic_data_type
2. https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Destructuring_assignment
3. http://stackoverflow.com/questions/5525795/does-javascript-guarantee-object-property-order
 4. "N‐tuple - Oxford Reference"(http://www.oxfordreference.com/view/10.1093/acref/9780199202720.001.0001/acref-9
780199202720-e-2276). oxfordreference.com. Retrieved 1 May 2015.
5. Blackburn, Simon (2016) [1994]. "ordered n-tuple".The Oxford Dictionary of Philosophy(https://books.google.com/b
ooks?id=Mno8CwAAQBAJ). Oxford quick reference (3 ed.). Oxford: Oxford University Press. p. 342.
ISBN 9780198735304. Retrieved 2017-06-30. "ordered n-tuple[:] A generalization of the notion of an [...] ordered
pair to sequences of n objects."
6. OED, s.v. "triple", "quadruple", "quintuple", "decuple"
7. D'Angelo & West 2000, p. 9
8. D'Angelo & West 2000, p. 101
9. Pierce, Benjamin (2002).Types and Programming Languages. MIT Press. pp. 126–132.ISBN 0-262-16209-1.
10. Steve Awodey, From sets, to types, to categories, to sets(http://www.andrew.cmu.edu/user/awodey/preprints/stcsFin
al.pdf), 2009, preprint

References
D'Angelo, John P.; West, Douglas B. (2000),Mathematical Thinking/Problem-Solving and Proofs(2nd ed.), 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

Retrieved from "https://en.wikipedia.org/w/index.php?title=T

uple&oldid=816479471"

This page was last edited on 21 December 2017, at 16:34.

Text is available under theCreative Commons Attribution-ShareAlike License ; additional terms may apply. By using this
site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of theWikimedia
Foundation, Inc., a non-profit organization.