You are on page 1of 4

6/18/11

Peanos Postulates Axiomatic Development of the Real Number System


P1: 1 is an element of the set X. P2: For each element there is a unique called the successor of n. P3: For each P4: If P5: Let are distinct, then and then If for all

Construction of
From P1, From P2, From P3,
Let

Construction of
Let Following this process, we from the set
We call this the set the natural numbers.

Again from P2, From P4, since 1 and 2 are distinct,

Addition
Let Let then let for some

Multiplication
If If
Define then let for some

If If
Define

6/18/11

Principle of Mathematical Induction


Recall P5. Let then and If for all

PMI
Show that the statement holds for 1. Assume that the statement holds for some
arbitrary natural number k. (Hypothesis of Induction)

We may use this to show some statements that are true for natural numbers.

Show that the statement also holds for the


natural number k+1.

Example
Show that
is true for all natural numbers n. Proof: Using PMI

Hence, the statement holds for 1.

Let k be an arbitrary natural number, and


suppose

HOI

Let
The left side is simply 1, while the right side becomes

We want to show that the statement holds


for k+1, i.e.

Starting with the left side, we have Therefore, by PMI, for all

from HOI

6/18/11

Example
Show that for all Let k be an arbitrary natural number and suppose

Proof: Using PMI If the statement is true since both sides are 1. Show that

Starting with the left side, we have Show that

Example
is divisible by 4 for all Restatement: Show that where Proof: Using PMI may be expressed as ,

from HOI

By PMI, for all

If then we have which is divisible by 4.

Assume that i.e. Show that Start with

is divisible by 4,

HOI

We can choose , which is an integer since p is an integer. Therefore, by PMI, for all is divisible by 4,

from HOI

6/18/11

Exercises
Use PMI to show that the following holds for all 1. 2. 3. 4. is divisible by 6

You might also like