# Definition:Ordered Tuple

## Contents

## Definition

Let $n \in \N$ be a natural number.

Let $\N^*_n$ be the first $n$ non-zero natural numbers:

- $\N^*_n := \set {1, 2, \ldots, n}$

### Definition 1

An **ordered tuple (of length $n$)** is a finite sequence whose domain is $\N^*_n$.

### Definition 2

Let $\family {S_i}_{i \mathop \in \N^*_n}$ be a family of sets indexed by $\N^*_n$.

Let $\displaystyle \prod_{i \mathop \in \N^*_n} S_i$ be the Cartesian product of $\family {S_i}_{i \mathop \in \N^*_n}$.

An **ordered tuple of length $n$** of $\family {S_i}$ is an element of $\displaystyle \prod_{i \mathop \in \N^*_n} S_i$.

### Ordered Tuple on Set

Let $S$ be a set.

Let $s: \N^*_n \to S$ be an ordered tuple.

Then $s$ is called an **ordered tuple on $S$**, its codomain.

### Empty Ordered Tuple

Let $S$ be a set.

The **empty ordered tuple on $S$** is the empty mapping:

- $\varnothing \to S$

from the empty set $\varnothing$ to $S$.

### Ordered Tuple Defined by Sequence

Let $\left \langle {a_k} \right \rangle_{k \mathop \in A}$ be a finite sequence of $n$ terms.

Let $\sigma$ be a permutation of $A$.

Then the **ordered $n$-tuple defined by the sequence $\left \langle {a_{\sigma \left({k}\right)}} \right \rangle_{k \in A}$** is the ordered $n$-tuple:

- $\left \langle {a_{\sigma \left({\tau \left({j}\right)}\right)}}\right \rangle_{1 \mathop \le j \mathop \le n}$

where $\tau$ is the unique isomorphism from the totally ordered set $\left[{1 \,.\,.\, n}\right]$ onto the totally ordered set $A$.

## Term of Ordered Tuple

Let $\left \langle {a_k} \right \rangle_{k \mathop \in \N^*_n}$ be an ordered tuple.

The ordered pair $\left({k, a_k}\right)$ is called the **$k$th term** of the ordered tuple for each $k \in \N^*_n$.

## Equality of Ordered Tuples

Let:

- $(1): \quad \sequence {a_m} = \tuple {a_1, a_2, \ldots, a_m}$

and

- $(2): \quad \sequence {b_n} = \tuple {b_1, b_2, \ldots, b_n}$

be ordered tuples for some $m, n \in \N_{>0}$.

Then:

- $\sequence {a_m} = \sequence {b_n} \iff n = m \land \forall j \in \N^*_n: a_j = b_j$

## Also defined as

Some treatments take the intuitive approach of regarding an **ordered tuple** merely as an ordered set, that is, without stressing the fact of it being a mapping from a subset of the natural numbers.

## Also known as

Some sources refer to an ordered tuple as a **tuple**.

The term **ordered $n$-tuple** can sometimes be seen, particularly for specific instances of $n$.

Instead of writing **2-tuple**, **3-tuple** and **4-tuple**, the terms **couple**, **triple** and **quadruple** are usually used.

In the context of abstract algebra, the concept is encountered as **(associative) word**.

## Notation

Notation for an ordered tuple varies throughout the literature.

There are also specialised instances of an ordered tuple where the convention is to use angle brackets.

However, it is common for an ordered tuple to be denoted:

- $\left({a_1, a_2, \ldots, a_n}\right)$

extending the notation for an ordered pair.

For example: $\left({6, 3, 3}\right)$ is the ordered triple $f$ defined as:

- $f \left({1}\right) = 6, f \left({2}\right) = 3, f \left({3}\right) = 3$

The notation:

- $\left\langle {a_1, a_2, \ldots, a_n}\right\rangle$

is recommended when use of round brackets would be ambiguous.

Other notations which may be encountered are:

- $\left[{a_1, a_2, \ldots, a_n}\right]$
- $\left\{{a_1, a_2, \ldots, a_n}\right\}$

but both of these are strongly discouraged: the square bracket format because there are rendering problems on this site, the latter because it is too easily confused with set notation.

In order to further streamline notation, it is common to use the more compact $\left\langle{a_n}\right\rangle$ for $\left\langle{a_k}\right\rangle_{1 \mathop \le k \mathop \le n}$.

## Ordered Couples and Ordered Pairs

Notice the difference between ordered pairs and ordered couples.

By definition, an ordered couple $\left({a, b}\right)$ is in fact the set $\left\{{\left({1, a}\right), \left({2, b}\right)}\right\}$, where each of $\left({1, a}\right)$ and $\left({2, b}\right)$ are ordered pairs.

It is not possible to use the definition of ordered couple as the definition of ordered pair, as the latter is used to define a mapping, which is then used to define an ordered couple.

However, in view of the equality of ordered tuples, it is generally accepted that it is valid to use the notation $\left({a, b}\right)$ to mean both an ordered couple and an ordered pair.

It is worth bearing this in mind, as there are times when it is important not to confuse them.

## Also see

- Definition:Finite Sequence: Note that an
**ordered tuple**and a finite sequence are in fact the same thing. However, with an**ordered tuple**the emphasis is usually placed on the image set, while for a finite sequence the domain is usually more conceptually important, and can in fact be considered as**any**finite set.

## Sources

- 2010: Steve Awodey:
*Category Theory*... (previous) ... (next): $\S 1.7$