Naïve

Set Theory (Axioms and Notation based on Halmos text)

§12 – The Peano Axioms (Handout)

Theorem 12-1 (The Peano Axioms):
(I) 0w.
(II) If nw, then n+w.
(III) If S  w and if 0S and if n+S whenever nS, then S = w.
(IV) n+  0 for all nw.
(V) If m,nw and m+ = n+, then m = n.

Definition 12-2: A set E is transitive if ax and xE implies aE.

Lemma 12-3:
(i) No natural number is a subset of any of its elements.
(ii) Every element of w is transitive.

Theorem 12-4 (The Recursion Theorem for w): If aX and f : X  X , then there exists a u : w  X , such that u(0)
= a and
u(n+) = f (u(n))
for all nw.

Definition 12-5: Let m,nw. We say m is less than n, written m < n, if mn. We write m  n if m < n or m = n.

=========================================================
Exercises

12-A. Prove that w is a transitive set.

12-B. Prove that if E is a nonempty subset of w then there exists a kE such that km for all mE, m  k.

12-C. Let m,nw. Prove mn iff m+n+.

12-D. Prove that nn for all nw.

12-E. If nw and n  0, then 0n.

12-F. Give a proof of PA(V) using only Lemma 1-3(ii): prove m+ = n+ implies m = n.

12-H. Justify Definition 4-5 using the Recursion Theorem to define the natural numbers as sets. [Instructor’s Note:
Be sure to specifically state the choices of f, a, u, and X.]

12-I. Let r be a relation on X.

(a) Use the Recursion Theorem to define rn for all nw. [Instructor’s Note: Be sure to specifically state the
choices of f, a, u, and X.]
(b) Prove that «{rn : nw} is transitive.

=========================================================
12-J. Defining Addition on the Natural Numbers

Fix xw. The function sx : w  w is defined recursively as sx(0) = x and sx(n+) = [sx(n)]+ for any nw.

12-J-1. Justify this definition using the Recursion Theorem. [Instructor’s Note: Be sure to specifically state the
choices of f, a, u, and X.]

Define the function s : ww  w as s = { ((x,y),z) : x,y,zw and z = sx(y) }.

Logic, Set Theory and Computability [M. Coppenbarger]

 Naïve Set Theory (Axioms and Notation based on Halmos text)

Write s(x,y) = sx(y) in shorthand notation as x + y. [Thus, the recursive definition implies that x + y+ = (x + y)+.]

12-J-2. Prove that w is associative with repect to s.

12-J-3. Prove that w contains a neutral element with respect to s.

12-J-4. Prove for any xw that x+ = x + 1 = 1 + x.

12-J-5. Prove that w is commutative with respect to s.

12-J-6. (The cancellation property) Prove for any x, y, z w that x + z = y + z implies x = y.

12-J-7. Prove for any x, y w that x + y = 0 implies x = 0 and y = 0.

12-J-8. Prove for any x, y w that x + y = 1 implies x = 1 or y = 1.

12-J-9. Prove for any x, y, z w that x < y implies x + z < y + z.

=========================================================
12-K. Defining Multiplication on the Natural Numbers

Fix xw. The function px : w  w is defined recursively as px(0) = 0 and px(n+) = px(n) + x for any nw.

12-K-1. Justify this definition using the Recursion Theorem. [Instructor’s Note: Be sure to specifically state the
choices of f, a, u, and X.]

Define the function p : ww  w as p = { ((x,y),z) : x,y,zw and z = px(y) }.

Write p(x,y) = px(y) in shorthand notation as xy (or xy).

12-K-2. (The distributive property): Prove for any x, y, z w that x(y + z) = xy + xz.

12-K-3. Prove that w is associative with respect to p.

12-K-4. Prove that w contains a neutral element with respect to p.

12-K-5. Prove that w is commutative with respect to p.

12-K-6. Prove for any x, y, z w that xy = 0 implies x = 0 or y = 0.

12-K-7. Prove for any x, y w that xy = 1 implies x = 1 and y = 1.

12-K-8. (The cancellation property) Prove for any x, y, z w that xz = yz and z ≠ 0 implies x = y.

12-K-9. Prove for any x, y w  1 that xyw  1. [Instructor’s Note: We can translate this as x > 0 and y > 0
implies xy > 0.]

=========================================================
12-L. Defining Exponentiation on the Natural Numbers

Fix xw  1. The function ex : w  1  w is defined recursively as ex(0) = 1 and ex(n+) = ex(n)x for any nw.

12-L-1. Justify this definition using the Recursion Theorem. [Instructor’s Note: Be sure to specifically state the
choices of f, a, u, and X.]

Logic, Set Theory and Computability [M. Coppenbarger]

 Naïve Set Theory (Axioms and Notation based on Halmos text)

Define the function e : w  1  w  w as e = { ((x,y),z) : x,y,zw and z = ex(y) }.

Write e(x,y) = ex(y) in shorthand notation as x y.

12-L-2. Prove for any xw  1 and y, z w that x y+z = x y  x z.

12-L-3. Prove for any xw  1 and y, z w that (x y) z = x yz.

12-L-4. Prove for any x,yw  1 and z w that (xy) z = x z  y z.

=========================================================
12-M. Construction of the Integers Z

Let N be the set of natural numbers with the operations of addition and multiplication.

Let r be the relation on NN defined as r = { ( (x,y), (u,v) ) : x,y,u,vN and x + v = y + u }. [For ease of notation, we
indicate two elements are in the relation as (x,y) r (u,v).]

12-M-1. Prove that r is an equivalence relation.

Upon the partition (NN) / r define two operations (+) and () as follows:
(x,y) / r + (u,v) / r = (x + u, y + v) / r
(x,y) / r  (u,v) / r = (xu + yv, xv + yu) / r.

12-M-2. Show that both (+) and () are well-defined. [That is, independent of the representative chosen.]

12-M-3. Prove that both (+) and () are commutative and associative.

12-M-4. Prove that () is distributive with respect to (+).

Define F : N < (NN) / r so that F(x) = (x,0) / r.

12-M-5. Show that F is a monomorphism for both operations. [That is, show
(a) F(x + y) = F(x) + F(y) for all x,yN,
(b) F(xy) = F(x)  F(y) for all x,yN, and
(c) F is injective.]

This monomorphism F identifies certain integers with the natural numbers. The notation for the natural number x
and the integer F(x) are used interchangeably. For simplicity, define Z = (NN) / r with the two operations (+) and
() to be the integers.

12-M-6. Show that for all aZ there exists a unique bZ such that a + b = F(0).

This value b is called the negative of a and is denoted –a.

12-M-7. Prove nonzero multiplicative cancellation: For any a, b, gZ, if ab = ag and a  0, then b = g.

An ordering < is defined on Z as follows: (x,y) / r < (u,v) / r when x + u < y + v.

12-M-8. Prove that (Z, <) is well-defined.

12-M-9. Properties of inequalities:

(a) F(x + y) = F(x) + F(y) for all x,yN,
(b) F(xy) = F(x)  F(y) for all x,yN, and
(c) F is injective.]

Logic, Set Theory and Computability [M. Coppenbarger]

 Naïve Set Theory (Axioms and Notation based on Halmos text)

=========================================================
12-N. Construction of the Rational Numbers Q

Let Z be the set of integers and let Z* = Z – {0}.

Let s be the relation on ZZ* defined as

s = { ( (x,y), (u,v) ) : x,uZ , y,vZ*, and xv = yu }.
[For ease of notation, we indicate two elements are in the relation as (x,y) s (u,v).]

12-N-1. Prove that s is an equivalence relation.

Upon the partition (ZZ*) / s define two operations (+) and ():
(x,y) / s + (u,v) / s = (xv + yu, yv) / s
(x,y) / s  (u,v) / s = (xu, yv) / s.

12-N-2. Show that both (+) and () are well-defined. [That is, independent of the representative chosen.]

12-N-3. Prove that both (+) and () are commutative and associative.

12-N-4. Prove that () is distributive with respect to (+).

Define W : Z < (ZZ*) / s such that W(x) = (x,1) / s.

12-N-5. Show that W is a monomorphism for both operations.

Thus the integers are isomorphic with a subset of (ZZ*) / s. Define, Q = (ZZ*) / s to be the rational numbers.

12-N-6. Show that for all aQ with a  0, there exists a unique bQ such that ab = W(1). [This value b is called
the reciprocal of a and is denoted 1/a.]

12-N-7. Prove that Q is a commutative ring with identity.

Hence Q is a field.

=========================================================
12-O. Construction of the Real Numbers R

Logic, Set Theory and Computability [M. Coppenbarger]