A pair records two objects. An ordered pair has a distinguished first and second position, so and can differ; an unordered pair does not record their order. Repeated entries are permitted in an ordered pair, while is a singleton.
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.
An unordered pair is a set containing the specified elements, with no distinction between first and second positions. Hence . If , the notation denotes the singleton , rather than a two-element set.
For distinct , an unordered pair represents an edge in a simple undirected graph. An ordered pair instead represents a directed edge because reversing its entries changes the direction. If multiplicity must be retained even for equal elements, a multiset is needed instead of a set.
Articles by others on the same topic
There are currently no matching articles.