Classification Axiomatic Form
Axioms 1
For any set , there exists a subset composed of elements that have property .
- is a propositional function in .
Explanation
The reason why is limited to a subset of 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 . If there are two different propositional functions and , what guarantees the existence of is not the ‘Classification Axiom for ’ but the ‘Classification Axiom for ’.
Definition of Intersection and Difference Sets 2
The axiom schema of classification guarantees the existence of an intersection as defined below.
For any two sets , , the set of elements belonging to both is called the intersection of and , denoted as .
Regarding the set , the given propositional function is , which can be specifically written as . If , then and 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.
For any two sets , , the set of elements that belong to but not to is called the difference set of with respect to , denoted as .
The set is called the complement of , denoted as . In considering the complement, the set 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 , are any subsets of the universal set .
- [1]
- [2]
- [3]
- [4]
- [5]
Proof
[5]
■