Naive Set Theory (book)
Get Naive Set Theory Book essential facts below. View Videos or join the Naive Set Theory Book discussion. Add Naive Set Theory Book to your Like2do.com topic list for future reference or share this resource on social media.
Naive Set Theory Book
First edition

Naive Set Theory is a mathematics textbook by Paul Halmos providing an undergraduate introduction to set theory.[1] Originally published by Van Nostrand in 1960,[2] it was reprinted in the Springer-Verlag Undergraduate Texts in Mathematics series in 1974.[3]

While the title states that it is naive, which is usually taken to mean without axioms, the book does introduce all the axioms of ZFC set theory (except the Axiom of Foundation), and gives correct and rigorous definitions for basic objects.[2][4] Where it differs from a "true" axiomatic set theory book is its character: there are no discussions of axiomatic minutiae, and there is next to nothing about advanced topics like large cardinals. Instead, it tries to be intelligible to someone who has never thought about set theory before.

Halmos later stated that it was the fastest book he wrote, taking about six months, and that the book "wrote itself".[5]

## Absence of the Axiom of Foundation

As noted above, the book omits the Axiom of Foundation. Halmos repeatedly dances around the issue of whether or not a set can contain itself.

• p. 1: "a set may also be an element of some other set" (emphasis added)
• p. 3: "is ${\displaystyle A}$ ? ${\displaystyle A}$ ever true? It is certainly not true of any reasonable set that anyone has ever seen."
• p. 6: "${\displaystyle B}$ ? ${\displaystyle B}$ ... unlikely, but not obviously impossible"

But Halmos does let us prove that there are certain sets that cannot contain themselves.

• p. 44: Halmos lets us prove that ${\displaystyle \omega }$ ? ${\displaystyle \omega }$. For if ${\displaystyle \omega }$ ? ${\displaystyle \omega }$, then ${\displaystyle \omega }$ - {${\displaystyle \omega }$} would still be a successor set, because ${\displaystyle \omega }$ ? ? and ${\displaystyle \omega }$ is not the successor of any natural number. But ${\displaystyle \omega }$ is not a subset of ${\displaystyle \omega }$ - {${\displaystyle \omega }$}, contradicting the definition of ${\displaystyle \omega }$ as a subset of every successor set.
• p. 47: Halmos proves the lemma that "no natural number is a subset of any of its elements." This lets us prove that no natural number can contain itself. For if ${\displaystyle n}$ ? ${\displaystyle n}$, where ${\displaystyle n}$ is a natural number, then ${\displaystyle n}$ ? ${\displaystyle n}$ ? ${\displaystyle n}$, which contradicts the lemma.
• p. 75: "An ordinal number is defined as a well ordered set ${\displaystyle \alpha }$ such that ${\displaystyle s(\xi )=\xi }$ for all ${\displaystyle \xi }$ in ${\displaystyle \alpha }$; here ${\displaystyle s(\xi )}$ is, as before, the initial segment ${\displaystyle \{\eta }$ ? ${\displaystyle \alpha :}$ ${\displaystyle \eta }$ < ${\displaystyle \xi }$}." The well ordering is defined as follows: if ${\displaystyle \xi }$ and ${\displaystyle \eta }$ are elements of an ordinal number ${\displaystyle \alpha }$, then ${\displaystyle \xi }$ < ${\displaystyle \eta }$ means ${\displaystyle \xi }$ ? ${\displaystyle \eta }$ (pp. 75-76). By his choice of the symbol < instead of ${\displaystyle \xi }$ ? ${\displaystyle \xi }$, where ${\displaystyle \xi }$ is an element of an ordinal number. That's because ${\displaystyle \xi }$ ? ${\displaystyle \xi }$ means ${\displaystyle \xi }$ < ${\displaystyle \xi }$, which implies ${\displaystyle \xi }$ ? ${\displaystyle \xi }$ (because < is strict), which is impossible.
• p. 75: the above definition of an ordinal number also makes it impossible to have ${\displaystyle \alpha }$ ? ${\displaystyle \alpha }$, where ${\displaystyle \alpha }$ is an ordinal number. That's because ${\displaystyle \alpha }$ ? ${\displaystyle \alpha }$ implies ${\displaystyle \alpha }$ = s(${\displaystyle \alpha }$). This gives us ${\displaystyle \alpha }$ ? ${\displaystyle \alpha }$ = s(${\displaystyle \alpha }$) = ${\displaystyle \{\eta }$ ? ${\displaystyle \alpha :}$ ${\displaystyle \eta }$ < ${\displaystyle \alpha }$}, which implies ${\displaystyle \alpha }$ < ${\displaystyle \alpha }$, which implies ${\displaystyle \alpha }$ ? ${\displaystyle \alpha }$ (because < is strict), which is impossible.

## Errata

• p. 73, line 19: "for each z in X" should be "for each a in X".
• p. 75, line 3: "if and only if x ? F(n)" should be "if and only if x = {b: S(n, b)}".

## Bibliography

• Halmos, Paul, Naive Set Theory. Princeton, NJ: D. Van Nostrand Company, 1960. Reprinted by Springer-Verlag, New York, 1974. ISBN 0-387-90092-6 (Springer-Verlag edition). Reprinted by Martino Fine Books, 2011. ISBN 978-1-61427-131-4 (Paperback edition).

## References

1. ^ Review of Naive Set Theory by H. Mirkil (April 1961), American Mathematical Monthly 68 (4): 392, doi:10.2307/2311615.
2. ^ a b Review of Naive Set Theory, L. Rieger, MR0114756.
3. ^
4. ^ Review of Naive Set Theory, Alfons Borgers (July 1969), Journal of Symbolic Logic 34 (2): 308, doi:10.2307/2271138.
5. ^ Ewing, John H.; Gehring, Frederick W., eds. (1991), Paul Halmos: celebrating 50 years of mathematics, Springer-Verlag, Interview of Halmos with Donald J. Albers, p. 16, ISBN 0-387-97509-8.