An **ordered pair** is a collection of two objects such that one can be distinguished as the *first element* and the other as the *second element*. An ordered pair with first element *a* and second element *b* is usually written as (*a*, *b*). Two such ordered pairs (*a*_{1}, *b*_{1}) and (*a*_{2}, *b*_{2}) are equal if and only if *a*_{1} = *a*_{2} and *b*_{1} = *b*_{2}.

The set of all ordered pairs whose first element is in some set *X* and second element in some set *Y* is called the Cartesian product of said sets. Subsets thereof are mathematical relations.

Ordered triples and n-tuples (ordered lists of n terms) are defined recursively from this definition: an ordered triple (a,b,c) can be defined as (a , (b,c) ): two nested pairs. This approach is mirrored in programming languages: It is possible to represent a list of elements as a construction of nested ordered pairs. For example, the list (1 2 3 4 5) becomes (1, (2, (3, (4, (5, {}))))). The Lisp programming language uses such lists as its primary data structure.

In pure set theory, where there are only sets, ordered pairs (*a*, *b*) can be defined as the set { {*a*}, {*a*, *b*} }. The statement that *x* is the first element of an ordered pair *p* can then be formulated as

- ∀
*Y*∈*p*:*x*∈*Y*

- (∃
*Y*∈*p*:*x*∈*Y*) ∧ (∀*Y*_{1}∈*p*, ∀*Y*_{2}∈*p*:*Y*_{1}≠*Y*_{2}→ (*x*∉*Y*_{1}∨*x*∉*Y*_{2})).

In the usual ZF formulation of set theory including the axiom of regularity, ordered pairs (*a*, *b*) can also be defined as the set {*a*, {*a*, *b*}}. However, the axiom of regularity is required, since without it, it is possible to consider sets *x* and *z* such that *x* = {*z*}, *z* = {*x*}, and *x* ≠ *z*. Then we have that

- (
*x*,*x*) = {*x*, {*x*,*x*}} = {*x*,{*x*}} = {*x*,*z*} = {*z*,*x*} = {*z*, {*z*}} = {*z*, {*z*,*z*}} = (*z*,*z*)