HOME

TheInfoList



OR:

In
logic Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the study of deductively valid inferences or logical truths. It examines how conclusions follow from premises based on the structure o ...
, extensionality, or extensional equality, refers to principles that judge objects to be equal if they have the same external properties. It stands in contrast to the concept of intensionality, which is concerned with whether the internal definitions of objects are the same.


In mathematics

The extensional definition of function equality, discussed above, is commonly used in mathematics. A similar extensional definition is usually employed for relations: two relations are said to be equal if they have the same extensions. In
set theory Set theory is the branch of mathematical logic that studies Set (mathematics), sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory – as a branch of mathema ...
, the
axiom of extensionality The axiom of extensionality, also called the axiom of extent, is an axiom used in many forms of axiomatic set theory, such as Zermelo–Fraenkel set theory. The axiom defines what a Set (mathematics), set is. Informally, the axiom means that the ...
states that two 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, 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 In mathematics, an ordered pair, denoted (''a'', ''b''), is a pair of objects in which their order is significant. The ordered pair (''a'', ''b'') is different from the ordered pair (''b'', ''a''), unless ''a'' = ''b''. In contrast, the '' unord ...
s have equal elements, and elements of a set which are related by an
equivalence relation In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is equ ...
belong to the same
equivalence class In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements ...
. Type-theoretical foundations of mathematics are generally ''not'' extensional in this sense, and setoids are commonly used to maintain a difference between intensional equality and a more general equivalence relation (which generally has poor constructibility or decidability properties).


Extensionality principles

There are various extensionality principles in mathematics. * Propositional extensionality of predicates P,Q: if P\iff Q then P = Q * Functional extensionality of functions f,g: if \forall x, f x = g x then f = g * Univalence of types A, B: if A\simeq B then A = B, where \simeq denotes homotopy equivalence. Depending on the chosen foundation, some extensionality principles may imply another. For example it is well known that in univalent foundations, the univalence axiom implies both propositional and functional extensionality. Extensionality principles are usually assumed as axioms, especially in type theories where computational content must be preserved. However, in set theory and other extensional foundations, functional extensionality can be proven to hold by default.


Example

Consider the two functions ''f'' and ''g'' mapping from and to
natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
s, defined as follows: * To find ''f''(''n''), first add 5 to ''n'', then multiply by 2. * To find ''g''(''n''), first multiply ''n'' by 2, then add 10. These functions are extensionally equal; given the same input, both functions always produce the same value. But the definitions of the functions are not equal, and in that intensional sense the functions are not the same. Similarly, in natural language there are many predicates (relations) that are intensionally different but are extensionally identical. For example, suppose that a village has just one person named Joe, who is also the oldest person in the village. Then, the two predicates "being called Joe", and "being the oldest person" are intensionally distinct, but extensionally equal for the (current) population of this village.


See also

* Identity of indiscernibles * Univalence axiom *
Type theory In mathematics and theoretical computer science, a type theory is the formal presentation of a specific type system. Type theory is the academic study of type systems. Some type theories serve as alternatives to set theory as a foundation of ...


Notes


References

* * *
Intensional Logic (Stanford Encyclopedia of Philosophy)
* equality in nLab {{Mathematical logic Set theory Concepts in logic Equivalence (mathematics)