Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Ordered pair
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Informal and formal definitions== In some introductory mathematics textbooks an informal (or intuitive) definition of ordered pair is given, such as <blockquote> For any two objects {{mvar|a}} and {{mvar|b}}, the ordered pair {{math|(''a'', ''b'')}} is a notation specifying the two objects {{mvar|a}} and {{mvar|b}}, in that order.<ref name=Wolf>{{citation|first=Robert S.| last=Wolf|title=Proof, Logic, and Conjecture / The Mathematician's Toolbox| publisher=W. H. Freeman and Co.| year=1998| isbn=978-0-7167-3050-7|page=164}}</ref> </blockquote> This is usually followed by a comparison to a set of two elements; pointing out that in a set {{mvar|a}} and {{mvar|b}} must be different, but in an ordered pair they may be equal and that while the order of listing the elements of a set doesn't matter, in an ordered pair changing the order of distinct entries changes the ordered pair. This "definition" is unsatisfactory because it is only descriptive and is based on an intuitive understanding of ''order''. However, as is sometimes pointed out, no harm will come from relying on this description and almost everyone thinks of ordered pairs in this manner.<ref>{{citation | first1=Peter|last1=Fletcher | first2=C. Wayne|last2=Patty| title=Foundations of Higher Mathematics| publisher=PWS-Kent| year=1988 | isbn=0-87150-164-3|page=80}}</ref> A more satisfactory approach is to observe that the characteristic property of ordered pairs given above is all that is required to understand the role of ordered pairs in mathematics. Hence the ordered pair can be taken as a [[primitive notion]], whose associated axiom is the characteristic property. This was the approach taken by the [[Nicolas Bourbaki|N. Bourbaki]] group in its ''Theory of Sets'', published in 1954. However, this approach also has its drawbacks as both the existence of ordered pairs and their characteristic property must be axiomatically assumed.<ref name=Wolf /> Another way to rigorously deal with ordered pairs is to define them formally in the context of set theory. This can be done in several ways and has the advantage that existence and the characteristic property can be proven from the axioms that define the set theory. One of the most cited versions of this definition is due to Kuratowski (see below) and his definition was used in the second edition of Bourbaki's ''Theory of Sets'', published in 1970. Even those mathematical textbooks that give an informal definition of ordered pairs will often mention the formal definition of Kuratowski in an exercise.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)