logo

Extensionality Axiom 📂Set Theory

Extensionality Axiom

Axiom 1

AB(x(xA    xB)) \forall A \forall B ( \forall x ( x \in A \iff x \in B) )
Two sets AA, BB are said to be equal if every element of the first is an element of the second and vice versa. This is represented as A=BA = B.

Explanation

If AA and BB are not equal, it is denoted as ABA \ne B.

The equality of two sets is an axiom and a definition in itself. Extensionality refers not to extension but to external manifestation, meaning that a set is distinguished solely by the external relations of its elements, not by ambiguous explanations like ‘some kind of set.’ Considering the concept of elements as ‘objects distinctly distinguishable in our intuition or thought,’ this approach is valid.

In simpler terms, the axiom of extensionality ignores ’the essence’ of elements. Intuitively, both aa and AA appear to be the same letter, differing only in case. Regardless, if a=Aa=A is stated, they are the same, and if aAa \ne A is stated, they are seen as different.

According to this definition of ’equality,’ sets’ elements have no order or repetition. For example, the following equalities hold: {9,6,0,1,2,5}={0,1,2,5,6,9} \left\{ 9, 6, 0, 1, 2, 5 \right\} = \left\{ 0, 1, 2, 5, 6 ,9 \right\}

{y,y,x,y}={y,x} \left\{ y, y, x, y \right\} = \left\{ y , x \right\}

{1,5,0,4,2,1}={0,1,2,4,5} \left\{ 1, 5, 0, 4, 2, 1 \right\} = \left\{ 0, 1, 2, 4, 5 \right\}

In conjunction with inclusion relations of sets, the following useful theorem is introduced. This property is widely used throughout mathematics, particularly in pure mathematics fields such as abstract algebra or topology, where its application is fundamental. The axiom of extensionality is so intuitive that it’s sometimes underestimated, but it’s essential to recognize its fundamental importance.

Theorem

A=B    ABBA A = B \iff A \subset B \land B \subset A

Proof

A=B    x((xA)    (xB))    x((xA    xB)(xB    xA))    ABBA \begin{align*} A = B \iff & \forall x ( (x \in A) \iff (x \in B)) \\ \iff & \forall x \left( ( x \in A \implies x \in B) \land ( x \in B \implies x \in A) \right) \\ \iff &A \subset B \land B \subset A \end{align*}


  1. 이흥천 역, You-Feng Lin. (2011). 집합론(Set Theory: An Intuitive Approach): p75. ↩︎