logo

Classification Axiomatic Form 📂Set Theory

Classification Axiomatic Form

Axioms 1

XAa(aA    (aXp(a))) \forall X \exists A \forall a \left( a \in A \iff ( a \in X \land p(a)) \right) For any set XX, there exists a subset AA composed of elements that have property pp.


Explanation

The reason why AA is limited to a subset of XX is to prevent problems like Russell’s paradox. The reason it is not called an axiom but an axiom schema is that there are infinitely many such axioms, depending on the infinitely many p(x)p(x). If there are two different propositional functions p1(x)p_{1}(x) and p2(x)p_{2}(x), what guarantees the existence of {aX:p2(a) is truth}X\left\{ a \in X : p_{2}(a) \text{ is truth} \right\} \subset X is not the ‘Classification Axiom for p1(x)p_{1}(x)’ but the ‘Classification Axiom for p2(x)p_{2}(x)’.

Definition of Intersection and Difference Sets 2

The axiom schema of classification guarantees the existence of an intersection as defined below.

xAxB    xAB x \in A \land x \in B \iff x \in A \cap B For any two sets AA, BB, the set of elements belonging to both is called the intersection of AA and BB, denoted as ABA \cap B.

Regarding the set AA, the given propositional function is p(x):xBp(x): x \in B, which can be specifically written as AB={xA:xB}A \cap B= \left\{ x \in A : x \in B \right\}. If AB=A \cap B = \emptyset, then AA and BB are called disjoint.

Of course, the axiom schema of classification not only guarantees the existence of intersections but also the existence of all subsets satisfying a specific condition. This can be seen as the method of specifying conditions itself, one way of expressing sets.

xAxB    xAB x \in A \land x \notin B \iff x \in A \setminus B For any two sets AA, BB, the set of elements that belong to AA but not to BB is called the difference set of AA with respect to BB, denoted as ABA \setminus B.

The set UU is called the complement of AA, denoted as AcA^{c}. In considering the complement, the set UU is also referred to as the universal set.

Although set theory is infinite, not all branches of mathematics need to explore the entire abstract world. Typically, a certain universal set is predetermined as needed, and areas such as topology often use these concepts. Here are a few properties of complements and universal sets.

Basic Properties

Let’s assume sets AA, BB are any subsets of the universal set UU.

  • [1] (Ac)c=A \left(A^{c} \right)^{c} = A
  • [2] c=UUc= \emptyset^{c} = U \\ U^{c} = \emptyset
  • [3] AAc=AAc=U A \cap A^{c} = \emptyset \\ A \cup A^{c} = U
  • [4] AB    BcAc A \subset B \implies B^{c} \subset A^{c}
  • [5] AB=ABc A \setminus B = A \cap B^{c}

Proof

[5]

xAB    xA and xB    xA and xBc    xABc \begin{align*} x \in A \setminus B &\iff x \in A \text{ and } x \notin B \\ &\iff x \in A \text{ and } x \in B^{c} \\ &\iff x \in A \cap B^{c} \end{align*}


  1. Translated by Heungcheon Lee, You-Feng Lin. (2011). Set Theory: An Intuitive Approach: p81. ↩︎

  2. Translated by Heungcheon Lee, You-Feng Lin. (2011). Set Theory: An Intuitive Approach: p87, 95. ↩︎