Editing Naive Set Theory (book) (section)

==Axioms used in the book==

The statements of the axioms given below are as they appear in the book, with section references, and with explanatory commentary on each one. The "principal primitive (undefined) concept of ''belonging''" (that is, [[Element (mathematics)#Notation and terminology|set membership]]) is the starting point, where "<math>x</math> belongs to <math>A</math>" is written in the usual notation as <math>x\in A</math>. Here <math>x</math> and <math>A</math> are both sets, with the notational distinction of upper/lower case a purely stylistic choice. The axioms govern the properties of this relation between sets.

1. '''[[Axiom of extensionality|Axiom of Extension]]''' (Section 1): two sets are equal if and only if they have the same [[Element (mathematics)|elements]].

This guarantees that the membership and (logical) [[First-order logic#Equality and its axioms|equality]] relations interact appropriately.

2. '''[[Axiom schema of specification|Axiom of Specification]]''' (Section 2): To every set <math>A</math> and every condition <math>S(x)</math> there corresponds a set <math>B</math> whose elements are precisely those elements of <math>A</math> for which <math>S(x)</math> holds.

This is more properly an [[axiom schema]] (that is, each condition <math>S(x)</math> gives rise to an axiom). "Condition" here means a "sentence" in which the variable <math>x</math> (ranging over all sets) is a [[Free variables and bound variables|free variable]]. "Sentences" are defined as being built up from smaller sentences using [[First-order logic|first order logical]] operations ([[Logical conjunction|and]], [[Logical disjunction|or]], [[Negation|not]]), including [[Quantifier (logic)|quantifiers]] ("[[Existential quantification|there exists]]", "[[Universal quantification|for all]]"), and with [[atomic formula|atomic]] (i.e. basic starting) sentences <math>x\in A</math> and <math>A=B</math>.

This schema is used in 4.-7. below to cut down the set that is stated to exist to the set containing precisely the intended elements, rather than some larger set with extraneous elements. For example, the  axiom of pairing applied to the sets <math>A</math> and <math>B</math> only guarantees there is ''some'' set <math>X</math> such that <math>A\in X</math> and <math>B\in X</math>. Specification can be used to then construct the set <math>\{A,B\}</math> with ''just'' those elements.

3. '''Set existence''' (Section 3): There exists a set.

Not specified as an named axiom, but instead stated to be "officially assumed". This assumption is not necessary once the axiom of infinity is adopted later, which also specifies the existence of a set (with a certain property). The existence of any set at all is used to show the [[empty set]] exists using the axiom of specification.

4. '''[[Axiom of pairing]]''' (Section 3): For any two sets there exists a set that they both belong to.

This is used to show that the [[Singleton (mathematics)|singleton]] <math>\{A\}</math> containing a given set <math>A</math> exists.

5. '''[[Axiom of union|Axiom of unions]]''' (Section 4): For every collection of sets there exists a set that contains all the elements that belong to at least one set of the given collection.

In Section 1 Halmos writes that "to avoid terminological monotony, we shall sometimes say ''collection'' instead of set." Hence this axiom is equivalent to the usual form of the axiom of unions (given the axiom of specification, as noted above).

From the axioms so far Halmos gives a construction of [[Intersection (set theory)|intersections of sets]], and the usual [[Algebra of sets|Boolean operations on sets]] are described and their properties proved.

6. '''[[Axiom of power set|Axiom of powers]]''' (Section 5): For each set there exists a collection of sets that contains among its elements all the subsets of the given set.

Again (noting that "collection" means "set") using the axiom (schema) of specification we can cut down to get the [[power set]] <math>P(A)</math> of a set <math>A</math>, whose elements are precisely the subsets of <math>A</math>. The axioms so far are used to construct the [[cartesian product]] of sets.

7. '''[[Axiom of infinity]]''' (Section 11): There exists a set containing 0 and containing the successor of each of its elements.

The set <math>0 := \emptyset</math>. The ''successor'' of a set <math>x</math> is defined to be the set <math>x^+:=x \cup \{x\}</math>. For example: <math>\{a,b\}^+ = \{a,b,\{a,b\}\}</math>. This axiom ensures the existence of a set containing <math>0</math> and hence <math>\{0\}</math>, and hence <math>\{0,\{0\}\}</math> and so on. This implies that there is a set containing all the elements of the first infinite [[Ordinal number#Von Neumann definition of ordinals|von Neumann ordinal]] <math>\omega</math>. And another application of the axiom (schema) of specification means <math>\omega</math> itself is a set.

8. '''[[Axiom of choice]]''' (Section 15): The Cartesian product of a non-empty family of non-empty sets is non-empty.

This is one of many [[axiom of choice#Equivalents|equivalents to the axiom of choice]]. Note here that "family" is defined to be a function <math>f\colon I\to X</math>, with the intuitive idea that the sets of the family are the sets <math>f(i)</math> for <math>i</math> ranging over the set <math>I</math>, and in usual notation this axiom says that there is at least one element in <math>\prod_{i\in I} f(i)</math>, as long as <math>f(i)\neq \emptyset</math> for all <math>i\in I \neq \emptyset</math>.

9. '''Axiom of substitution''' (Section 19): If <math>S(a,b)</math> is a sentence such that for each <math>a</math> in a set <math>A</math> the set <math>\{b : S(a,b)\}</math> can be formed, then there exists a function <math>F</math> with domain <math>A</math> such that <math>F(a) = \{b : S(a,b)\}</math> for each <math>a</math> in <math>A</math>.

A function <math>F\colon A\to X</math> is defined to be a [[Relation (mathematics)#Properties of relations|functional relation]] (i.e. a certain subset of <math>A\times X</math>), not as a certain type of set of [[Ordered pair#Kuratowski's definition|ordered pairs]], as in ZFC, for instance.

This 'axiom' is essentially the [[Axiom_schema of replacement#Collection|axiom schema of collection]], which, given the other axioms, is equivalent to the [[axiom schema of replacement]]. It is the collection schema rather than replacement, because 1) <math>S(a,b)</math> is a [[Class (set theory)#Classes in formal set theories|class]] ''relation'' instead of a class function and 2) the function <math>F</math> is not specified to have [[codomain]] precisely the set <math>\{F(a) : a\in A\}</math>, but merely some set <math>X\supseteq \{F(a) : a\in A\}</math>.

This axiom is used in the book to a) construct [[Limit ordinal|limit]] [[Ordinal number#Von Neumann definition of ordinals|von Neumann ordinals]] after the first infinite ordinal <math>\omega</math>, and b) prove that every [[Well-order|well-ordered set]] is [[order isomorphic]] to a unique von Neumann ordinal.