Musing
I’ve been watching a series of lectures by Frederic Schuller on YouTube lately and this listing of the axioms of set theory come from those lectures. It’s a quite an interesting series of lectures covering most of differential geometry starting from propositional logic. I would recommend it!
Set theory is probably the most popular theory on which we build the rest of mathematics. Its objects (sets) are quite primitive and, from an intuitional perspective, easy to grasp as “collections of things”. However, presented as axioms, set theory can feel rather abstract because from these few axioms we derive essentially all the power of mathematics. All other structures, e.g. groups, manifolds, vector spaces, algebras, etc. can be defined as “sets with extra properties”. In this view, the additional structure do not form additional axioms per se, but more definitions (although the exact difference between definitions and axioms can become blurry). I use the quantifiers from first order logic on this page to make things easier to write out. For some discussion of first order logic, see: First Order Logic
The Zermelo–Fraenkel Choice Axioms
Existence of
is a logical proposition (i.e. is either true or false)
Musing
Everything in set theory are sets. So in the above, and are sets. What’s the “stuff” being collected in sets? Sets. Kind of like turtles all the way down.
Existence of Null
Axiom of Extensionality
This axiom tells you that two sets are equal if they each contain exactly the same members.
Axiom of Pairing
A lot of symbols to say that given and you can always construct the set .
Axiom of Union
This says roughly that you can create a set that contains the elements of the elements of another set.
Axiom (Schema) of Replacement
This axiom roughly says the images of functions of sets are themselves sets. But to state it more precisely we need to first make a few definitions.
We will use to denote “there exists a unique such and such”, i.e. is shorthand for:
Then a functional relation (colloquially function) is a binary formula such that The image of a set under is then all such that there is an for which (is true).
The axiom of replacement then says that for each functional relation the image of any set under is a set. This is, technically, an axiom schema since it must hold for each .
Generally speaking, we will use restricted comprehension instead of directly invoking this axiom schema of replacement. So, we write things like for some formula with a single variable . This is restricted comprehension because we need to specify some set that we are filtering down. The ability to do restricted comprehension is implied by the axiom of replacement.
Info
We avoid unrestricted comprehension, something like , because it’s possible that is the formula which would lead to Russell’s paradox. Can you see what such a set would mean and why there’s a paradox?
Axiom of Infinity
This says basically there exists an infinite set that can be built inductively. is in this set, then is in the set, and then so on ad infinitum.
Musing
The interesting thing to me with this axiom is we can use it to build the natural numbers. One possible encoding of the natural numbers using this axiom directly is Von Neumann’s. Given this axiom, you know the set exists (the curly braces are important!).
Axiom of Power
The powerset (set of all subsets) of a set always exists. Technically I need to define the symbol. In words, a subset of is a set such that every element of the subset is an element of :
Axiom of Choice
For any set of nonempty disjoint elements, there exists a set which contains, as elements, exactly one element from each element of .
Info
For a while, nobody knew if the axiom of choice was implied by the other axioms of ZF or not. Choice was not fully proven to be independent of ZF until the 60’s by Cohen, though Gödel proved that ZF could not disprove Choice already in the 1930s. For why that’s not enough to show independence, see godel-incompleteness. If one assumes the axiom of choice, some paradoxical results are obtained, such as the Banach-Tarski paradox. But if one does not assume the axiom of choice, one can not always prove the existence of bases for vector spaces.
Axiom of Foundation
For any non-empty set there exists an element of , let’s call it , such that no element of is an element of . The axiom of foundation is a non-existence axiom because an immediate implication of it is that no set exists which is a member of itself .