Unordered pair: Difference between revisions
Appearance
Content deleted Content added
cat |
Iiron munat (talk | contribs) mNo edit summary |
||
Line 1: | Line 1: | ||
A '''binary set''' is a [[set]] with (exactly) two distinct elements, or, equivalently, a set whose [[cardinality]] is [[two]]. |
|||
Examples: |
|||
* The set {''a'',''b''} is binary. |
|||
* The set {''a'',''a''} is not binary, since it is equivalent to the set {''a''}, which is a [[singleton (mathematics)|singleton]]. |
|||
In [[axiomatic set theory]], the existence of binary sets is a consequence of the [[axiom of empty set]] and the [[axiom of pairing]]. From these two axioms can be derived the existence of the singleton <nowiki>{{}}</nowiki>. From the axiom of empty set it is known that the set <nowiki>{}</nowiki> exists. From the axiom of pairing it is then known that the set <nowiki>{{},{{}}}</nowiki> exists, which contains both <nowiki>{}</nowiki> and <nowiki>{{}}</nowiki>. But the set <nowiki>{{},{{}}}</nowiki> is a binary set. |
|||
==See also== |
|||
* [[ordered pair]] |
|||
* [[binary relation]] |
|||
[[Category:Set theory]] |