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
Extensionality
(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!
==In mathematics== The extensional definition of function equality, discussed above, is commonly used in mathematics. A similar extensional definition is usually employed for [[relation (mathematics)|relations]]: two relations are said to be equal if they have the same [[Extension (predicate logic)|extensions]]. In [[set theory]], the [[axiom of extensionality]] states that two [[set (mathematics)|sets]] are equal if and only if they contain the same elements. In mathematics formalized in set theory, it is common to identify relations—and, most importantly, [[function (mathematics)|functions]]—with their extension as stated above, so that it is impossible for two relations or functions with the same extension to be distinguished. Other mathematical objects are also constructed in such a way that the intuitive notion of "equality" agrees with set-level extensional equality; thus, equal [[ordered pair]]s have equal elements, and elements of a set which are related by an [[equivalence relation]] belong to the same [[equivalence class]]. [[Type theory|Type-theoretical]] foundations of mathematics are generally ''not'' extensional in this sense, and [[setoid]]s are commonly used to maintain a difference between intensional equality and a more general equivalence relation (which generally has poor [[constructivism (mathematics)|constructibility]] or [[Decidability (logic)|decidability]] properties).
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)