Unordered pair
In mathematics, an unordered pair or pair set is a set of the form {a, b}, i.e. a set having two elements a and b with , where {a, b} = {b, a}.
≈ 3 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, an unordered pair or pair set is a set of the form {a, b}, i.e. a set having two elements a and b with , where {a, b} = {b, a}. In contrast, an ordered pair (a, b) has a as its first element and b as its second element, which means (a, b) ≠ (b, a) unless a=b. While the two elements of an ordered pair (a, b) need not be distinct, modern authors only call {a, b} an unordered pair if a ≠ b. But for a few authors a singleton is also considered an unordered pair.
It is typical to use the term unordered pair even in the situation where the elements a and b could be equal, as long as this equality has not yet been established. A set with precisely two elements is also called a 2-set or (rarely) a binary set. In axiomatic set theory, the existence of unordered pairs is required by an axiom, the axiom of pairing.
More generally, an unordered n-tuple is a set of the form {a 1 , a 2 , ..., a n }.
In mathematics, an unordered pair or pair set is a set of the form {a, b}, i.e. a set having two elements a and b with , where {a, b} = {b, a}. In contrast, an ordered pair (a, b) has a as its first element and b as its second element, which means (a, b) ≠ (b, a) unless a=b. While the two elements of an ordered pair (a, b) need not be distinct, modern authors only call {a, b} an unordered pair if a ≠ b. But for a few authors a singleton is also considered an unordered pair.
It is typical to use the term unordered pair even in the situation where the elements a and b could be equal, as long as this equality has not yet been established. A set with precisely two elements is also called a 2-set or (rarely) a binary set. In axiomatic set theory, the existence of unordered pairs is required by an axiom, the axiom of pairing.
More generally, an unordered n-tuple is a set of the form {a 1 , a 2 , ..., a n }.
References
.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1355590671 under CC BY-SA 4.0; modifications have been made.