AXIOZAZZZZZAAzs4. 444. Axiomatic Set Theory - A brief formal introductionMS OF SET THEORY

The Zermelo-Fraenkel Axioms (ZF)

Axiom ZF1 - Sets with the same members are equal - (Extensionality).

If x and y are sets then x $\QTR{Large}{=}$ y $\QTR{Large}{\iff }$ MATHz (z$\QTR{Large}{\in }$x $\QTR{Large}{\iff }$ z$\QTR{Large}{\in }$y ).

Axiom ZF2 - The "Empty Set" is a set. We write it as MATH

There exists a set MATH such that MATHx(MATH(xMATH)).

Note by ZF1 MATH is unique.

Axiom ZF3 - Set Formation - Unordered Pairs.

If x,y are sets then there exists a set z such that

MATHa (a$\QTR{Large}{\in }$z $\QTR{Large}{\iff }$ (a $\QTR{Large}{=}$ x or a $\QTR{Large}{=}$ y)).

We write this unique set as {x,y} . Note that {x,x} which is the same as {x} is not the set x.

Axiom ZF4 - Set Formation - Selection.

If z,y$_{\QTR{Large}{1}}$,y$_{\QTR{Large}{2}}$, ..., yMATH are sets and MATH is a proposition

containing variables MATH and a free variable $\QTR{bs}{x}$

and doesn't contain other free variables then

there exits a set y such that

MATHx(x$\QTR{Large}{\in }$y $\QTR{Large}{\iff }$ (x$\QTR{Large}{\in }$z and MATH) ).

Note that this avoids Russell's Paradox since we require x to be a member of a "known set." Again, it is unique.

Translation:We write y$\QTR{Large}{=}${x$\QTR{Large}{\in }$z \ MATH}.

Axiom ZF5 - Set Formation - Union.

If x is a set then there exists a set y such that

MATHa (a$\QTR{Large}{\in }$y $\QTR{Large}{\iff }$ (MATHz( z$\QTR{Large}{\in }$x and a$\QTR{Large}{\in }$z) ).

Translation: We write yMATHx , or some variant thereof

Axiom ZF6 - Set Formation - Power set.

If x is a set then there exists a set z such that

MATHy( y$\QTR{Large}{\in }$z $\QTR{Large}{\iff }$ ( MATHa (a$\QTR{Large}{\in }$yMATH a$\QTR{Large}{\in }$y ) ).

Translation: ( MATHa (a$\QTR{Large}{\in }$yMATH a$\QTR{Large}{\in }$y ) is just a definition of inclusion yMATHx

Axiom ZF7 - There is an infinite set

There exists a set m such that MATHm and MATHx(x$\QTR{Large}{\in }$y MATH ($\QTR{Large}{\cup }$({x,{x}})$\QTR{Large}{\in }$m).

Translation:MATH({x,{x}} is the set containing all the members of x and the set x itself.

Axiom ZF8 - Replacement( Functional Image)

Let MATH be a proposition that does not contain the symbol b then

MATHxMATHyMATHy$_{2}$( (MATHx$\QTR{Large}{,}$y$\QTR{Large}{_{1})}$ and MATHx$\QTR{Large}{,}$y$\QTR{Large}{_{2})}$)MATH y$_{1}\QTR{Large}{=}$y$_{2}$ )MATH MATHaMATHbMATHc ( c$\QTR{Large}{\in }$b $\QTR{Large}{\iff }$ MATHd(d$\QTR{Large}{\in }$a and \Phi $\QTR{bs}{(}$d$,$c)) ).

Translation: If, given any set x, there is a unique set y such that MATHx$\QTR{Large}{,}$y$\QTR{Large}{)}$, then, given any set a, there is a set b such that, given any set c, c is a member of b if and only if there is a set d such that d is a member of a and \Phi holds for d and c.

Axiom ZF9 - There are not Russell's Paradox like Sets (Regularity).

If x is a set and x $\QTR{Large}{\neq }$ MATH then MATHy (y$\QTR{Large}{\in }$x and MATHa (MATH(a$\QTR{Large}{\in }$x and a$\QTR{Large}{\in }$y)).

Translation: Every non-empty set contains a member that does not any members in common with it.

Note MATHa( MATH(a$\QTR{Large}{\in }$x and a$\QTR{Large}{\in }$y)). can be read x$\QTR{Large}{\cap }$yMATH. This can be shown to rule out the Russell set.

To be continued.