An ordered pair records two elements together with their positions. Its defining equality rule is exactly when and . Thus , and repeated entries such as are allowed.
The Cartesian product consists of the ordered pairs with first entry in and second entry in . A function can be represented by a set of such pairs with exactly one output for each input. In set theory, a Kuratowski ordered pair realizes the equality rule using ordinary sets.
This representation of an ordered pair by sets satisfies exactly when and . Its intersection recovers , and its union recovers ; if the latter is a singleton then . Its rank of a set is , which bounds the ranks of function graphs in absoluteness of cardinalhood in limit ranks.

Ancestors (7)

  1. Pair
  2. Set
  3. Set theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (2)

Ordered pair by Ciro Santilli 40 Updated 2025-07-16
Sets are unordered, but we can use them to create ordered objects, which are of fundamental importance. Notably, they are used in the definition of functions.