Scribd
Upload
147 views3 pages

MA210 Peano Postulates Definitions Theorems

The document defines Peano numbers and outlines Peano's postulates and theorems about them. Peano numbers are defined by five postulates that establish 1 as a number, a successor function, and an induction axiom. Definitions are provided for addition, multiplication, order, and other concepts. Twenty-four theorems are then stated about the properties of Peano numbers, such as the cancellation law for addition, associativity of addition and multiplication, and transitivity of order.

Uploaded by

tripper66
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
147 views3 pages

MA210 Peano Postulates Definitions Theorems

The document defines Peano numbers and outlines Peano's postulates and theorems about them. Peano numbers are defined by five postulates that establish 1 as a number, a successor function, and an induction axiom. Definitions are provided for addition, multiplication, order, and other concepts. Twenty-four theorems are then stated about the properties of Peano numbers, such as the cancellation law for addition, associativity of addition and multiplication, and transitivity of order.

Uploaded by

tripper66
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

MA 210 Peano Numbers PEANOS POSTULATES: There is a set N of objects called Peano numbers satisfying the following ve postulates

(i.e., rules): N-1. There is a Peano number called 1. N-2. For all x N, there is a unique Peano number (i.e., its the only one for that x) denoted by x . (Think of x as the next Peano number, like x+1.) N-3. There is no x N such that x = 1. (I.e., there is no number like zero in N.) N-4. For all x N and y N, we have that if x = y , then x = y. N-5. Axiom of Induction: Let S be a subset of N. Then [(1 S) x(x S x S)] S = N

Over
1

DEFINITIONS FOR N: 1. x = y means that x and y are the same element of N. x = y means that x and y are dierent elements of N. 2. The sum of two Peano numbers, denoted by x + y, is uniquely dened by recursion as (a) x N(x + 1 = x ) (b) If x + y is dened, then x + y is dened by x + y = (x + y) + 1 = (x + y) 3. The Peano numbers 2, 3, 4, etc., are dened by 2 = 1 ,3 = 2 ,4 = 3 ,... 4. The product of two Peano numbers, denoted by xy, is uniquely dened by recursion as (a) x N(x 1 = x) (b) If x y is dened, then x y is dened by x y = (x y) + x 5. An order on N is dened by (a) x < y means that z N(x + z = y). (b) x > y means that y < x. (c) x y means that x < y or x = y. 6. Let S N and S = . An element u S is the least element of S i x S(u x). 7. Given two elements x N and y N, where x > y, the dierence between x and y, denoted by x y, is dened to be that element z N such that x = y + z.

PEANOS THEOREMS: Theorem 1: For all x, y N, (a) x = y x = y (b) x = y x = y Theorem 2: x N(x = x) Theorem 3: If x = 1, then there exists a unique element u N such that u = x. Theorem 4: x + y is well dened for all x and y in N (i.e., for each x and y in N, x + y stands for only one element of N). Theorem 5: The addition tables (for the natural numbers 1, 2, 3, . . .) hold for N. Theorem 6: x, y N(x + y = y) (there is no left additive identity, 0) Theorem 7: x, y N(x + y = 1) Theorem 8: x, y, z N[(x + z) = (y + z) x = y] (cancellation under addition) Theorem 9: x, y, z N[(x + y) + z = x + (y + z)] (associativity) Theorem 10: x, y N(x + y = y + x) (commutativity) Theorem 11: 1. For all x, y N, x y is well dened. 2. The multiplication tables hold for N. Theorem Theorem Theorem Theorem Theorem Theorem 12: 13: 14: 15: 16: 17: x, y, z N[(x + y) z = (x z) + (y z)] (distributive property) x, y N(x y = y x) (commutativity) x, y, z N[(x y) z = x (y z)] (associativity) x, y N(x < y y > x) x, y N(x + y > x) For all x N, x = 1 x > 1. For all x, y N,

(i) (x < y) (x = y) (x > y) (ii) no two of the disjuncts in (i) can hold at the same time. Theorem Theorem Theorem Theorem Theorem 18: 19: 20: 21: 22: x, y, z N[(x < y) (y < z) x < z (transitivity) x, y, z N(x < y x + z < y + z) x, y, z N(x + z < y + z x < y) x, y, z N(x < y x z < y z) For all x, y, z N,

(a) x z < y z x < y (b) x z = y z x = y Theorem 23: For all x, y, u, v N, if (x < y) (u < v), then (a) x u < y v; (b) x + u < y + v Theorem 24: N is separated. That is, x Ny N(x < y < x + 1). 3

You might also like