
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Notes; Class: Advanced Calculus I; Subject: Mathematics; University: Arizona State University - Tempe; Term: Unknown 1989;
Typology: Study notes
1 / 1
This page cannot be seen from the preview
Don't miss anything!

(Adapted from http://149.150.2.6/projects/reals/logic/defs/peano.html) Peano axioms:
then all natural numbers have the property P.
Adapted from http://sisenis.com.latnet.lv/˜podnieks/gt3.html The modern version of Peano axioms can be put as follows. Let variables x, y, range over natural numbers, and let 0 denote the number ”zero”, x′^ - denote the operation x + 1, and let the variable S range over sets of natural numbers. Then the following statements are called Peano axioms: P1) ∀x, (0 6 = x′)
P2) ∀x∀y, ((x 6 = y) −→ (x′^6 = y′) P3) (0 ∈ S) ∧ ∀x (x ∈ S −→ x′^ ∈ S)) −→ ∀x (xinS)
One can prove easily that any two “systems” IN and IN satisfying the axioms (P1)-(P3) are˜ isomorphic.... One of such “systems” can be constructed in Zermelo-Fr¨ankel ZF set theory: Define 0 as the empty set, and x′^ = x ∪ {x}, and let variables range over the set ω....
From here, define: x + 1 = x′, and “inductively” x + y′^ = (x + y)′, then prove associativity and commutativity of (IN, +). Define x · 1 = x and “inductively” x · y′^ = (x · y) + y, and prove associativity and commutativity of (IN, +), establish the distributive laws.
Proceed along either of the following ways:
In order to be able to solve all equations m + x = n (with m, n ∈ IN) define the set ZZ of integers as the set of equivalence classes (m, n) ∈ IN × IN under the relation (m, n) ∼ (r, s) iff m + s = n + r. Define subtraction (of equivalence classes)...
In order to be able to solve all equations q ∗ x = p (with p, q ∈ IN, q 6 = 0) define the set Q+ of positive rational numbers as the set of equivalence classes (p, q) ∈ IN × (IN \ { 0 }) under the relation (p, q) ∼ (r, s) iff p · s = q · t. Define division (of equivalence classes)...
In either case check that the usual rules of arithmetic still hold, especially check that associativ- ity and commutativity carry over from IN. Then carry out the other step as well to eventually obtain the set of rational numbers Q.