Power Set Axiom
Axioms 1
For any set , there exists a set that contains every subset of as an element.
Explanation
The power set of is generally denoted by or , the reason being if the number of elements of a finite set is denoted by , then . It’s not always about the number, so the more someone uses set theory, the more they prefer expressions like .
One can guess to some extent from the fact that the number of elements increases exponentially, but a power set is quite, very large compared to . Moreover, according to the axiom of power set, there also exists a power set of a power set, thus, one can think of sets that grow in size indefinitely in this manner.
As an example of a power set, consider the following:
Note that the empty set and the original set belong to . The following are some basic properties of power sets. That the empty set is also an element of might be awkward at first encounter, but one should naturally accept it since an empty set is also a set and a set can be an element of a set.
Basic Properties
- [1]:
- [2]:
- [3]:
If one’s concept of set inclusion is weak, it’s naturally confusing. Unfortunately, when one first encounters set theory, power sets are not used extensively and there aren’t particularly good practice problems to get accustomed to. Realistically, one must think time is the remedy and slowly get used to it.
이흥천 역, You-Feng Lin. (2011). 집합론(Set Theory: An Intuitive Approach): p83. ↩︎