*Naive Set Theory* (book)

*See also Naive set theory for the mathematical topic.*

* 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]}

## Contents

## Absence of the Axiom of Foundation[edit]

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 ∈ ever true? It is certainly not true of any reasonable set that anyone has ever seen."
- p. 6: " ∈ ... 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 ∉ . For if ∈ , then − {} would still be a successor set, because ≠ ∅ and is not the successor of any natural number. But is not a subset of − {}, contradicting the definition of 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 ∈ , where is a natural number, then ⊂ ∈ , which contradicts the lemma.
- p. 75: "An
*ordinal number*is defined as a well ordered set such that for all in ; here is, as before, the initial segment ∈ < }." The well ordering is defined as follows: if and are elements of an ordinal number , then < means ∈ (pp. 75-76). By his choice of the symbol < instead of ≤, Halmos implies that the well ordering < is strict (pp. 55-56). This definition of < makes it impossible to have ∈ , where is an element of an ordinal number. That's because ∈ means < , which implies ≠ (because < is strict), which is impossible. - p. 75: the above definition of an ordinal number also makes it impossible to have ∈ , where is an ordinal number. That's because ∈ implies = s(). This gives us ∈ = s() = ∈ < }, which implies < , which implies ≠ (because < is strict), which is impossible.

## Errata[edit]

- 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)}".

## See also[edit]

## Bibliography[edit]

- 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[edit]

**^**Review of*Naive Set Theory*by H. Mirkil (April 1961),*American Mathematical Monthly*68 (4): 392, doi:10.2307/2311615.- ^
^{a}^{b}Review of*Naive Set Theory*, L. Rieger, MR0114756. **^**MR0453532**^**Review of*Naive Set Theory*, Alfons Borgers (July 1969),*Journal of Symbolic Logic*34 (2): 308, doi:10.2307/2271138.**^**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.

## External links[edit]

- A list of textbooks on set theory compiled by the participants of the mathematics stack exchange
- Reviews:
*Naive Set Theory*from Goodreads.