Scribd
Upload
11 views

Lecture 09

Uploaded by

3r32r
Copyright
© © All Rights Reserved
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
11 views

Lecture 09

Uploaded by

3r32r
Copyright
© © All Rights Reserved
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/ 5

Lecture 9: Principle of Mathematical Induction

1 Properties of Natural Numbers


Most fundamental property of natural numbers is ability to do proof by induction.
The set of natural numbers is denoted by the set N. The set N consists of a dis-
tinguished element denoted by 1 considered to be starting point for the induction.
A unique property for the set of natural numbers is that, there is a function s
which maps the elements of N to its successor in N. Any rigorous treatment of the
natural numbers must ultimately rely upon some axioms. There are two standard
axiomatic approaches to developing the natural numbers. One approach, involv-
ing the minimal axiomatic assumptions and the most effort deducing facts from
the axioms, is to assume the Peano Postulates for the natural numbers, which are
stated as follows.

Axiom 1.1 (Peano Postulates). There exists a set N with an element 1 ∈ N


and a function s : N → N, that satisfy the following three properties.

• There is no n ∈ N such that s(n) = 1.

• The function s is injective.

• Let G ⊆ N be a set. Suppose that 1 ∈ G, and that if g ∈ G then s(g) ∈ G.


Then G = N.

If we think intuitively of the function s in the Peano Postulates as taking each


natural number to its successor, then first postulate says that 1 is the first number
in N, because it is not a successor of anything.

Definition 1.2 (Natural numbers). The set of natural numbers is the set N,
the existence of which is given in the Peano Postulates.

How do we know that there is a set, and an element of the set, and a function
of the set to itself, that satisfy the Peano Postulates? There are two approaches
to resolving this matter. When we do mathematics, we have to take something as
axiomatic, which we use as the basis upon which we prove all our other results.

1
Hence, one approach to the Peano Postulates is to recognize their very reasonable
and minimal nature, and to be satisfied with taking them axiomatically. Alterna-
tively, if one takes the Zermelo-Fraenkel Axioms as the basis for set theory, then
it is not necessary to assume additionally that the Peano Postulates hold, because
the existence of something satisfying the Peano Postulates can be derived from
the Zermelo-Fraenkel Axioms.
If one goes through the full development of the natural numbers starting from
the Peano Postulates, the first major theorem one encounters is the one which
will be stated shortly. This theorem is used in particular in the definition of
addition and multiplication of the natural numbers.This theorem, called Definition
by Recursion.

Theorem 1.3 (Defintion by Recursion). Let A be a set, b ∈ A, and k : A → A


be a function. Then there exists a unique function f : N → A such that f (1) = b
and f ◦ s = k ◦ f .

Remark 1. We make following observations about definition by recursion.

1. The equation f ◦ s = k ◦ f means that f (s(n)) = k(f (n)) for all n ∈ N.

2. If s(n) were to be interpreted as n + 1, that it will turn out to be once


addition for N is rigorously defined, then f (s(n)) = k(f (n)) would mean
that f (n + 1) = k(f (n)), which looks more familiar intuitively.

3. It’s easier to understand this definition by the commutative diagram in Fig-


ure 1.

N N
s
f f

A A
k
Figure 1: Commutative diagram for recursive function k : A → A.

Theorem 1.4. Let a, b, c, d ∈ N. Then the following hold.

1. If a + c = b + c, then a = b. (Additive inverse)

2. (a + b) + c = a + (b + c). (Additive associativity)

2
3. s(a) = a + 1. (Additive increment)

4. a + b = b + a. (Additive commutativity)

5. a · 1 = a = 1 · a. (Product identity)

6. (a + b)c = ac + bc. (Multiplicative distributivity)

7. ab = ba. (Multiplicative commutativity)

8. c(a + b) = ca + cb. (Multiplicative distributivity)

9. (ab)c = a(bc). (Multiplicative associativity)

10. If ac = bc then a = b. (Multiplicative inverse)

11. a ≥ a, and a ≯ a, and a + 1 > a.

12. a ≥ 1, and if a 6= 1 then a > 1.

13. If a < b and b < c, then a < c; if a ≤ b and b < c, then a < c. If a < b and
b ≤ c, then a < c; if a ≤ b and b ≤ c, then a ≤ c.

14. a < b if and only if a + c < b + c.

15. a < b if and only if ac < bc.

16. Precisely one of the following holds: a < b, or a = b, or a > b. (Trichotomy


Law)

17. a ≤ b or b ≤ a. (Comparability)

18. If a ≤ b and b ≤ a, then a = b. (Equality)

19. It cannot be that b < a < b + 1.

20. a < b if and only if a + 1 ≤ b.

21. If a < b, there is a unique p ∈ N such that a + p = b.

Theorem 1.5 (Well-ordering principle). Let A ⊆ N be a set. If A is non-


empty, then there is a unique m ∈ A such that m ≤ a for all a ∈ A.

Remark 2. Uniqueness is easy to see from Thm 1.4, but existence is hard to show.

Definition 1.6. Let a, b ∈ N. The sets {a, . . . , b} and {a, . . .} are defined by
{a, . . . , b} = {x ∈ N : a ≤ x ≤ b} and {a, . . .} = {x ∈ N : a ≤ x} respectively.

3
2 Mathematical Induction
Mathematical induction is a method to prove statements of the form (∀n ∈
N)(P (n)). Informally, we show that P (1) is true, and if P (1) is true then P (2)
is true, and so on. It suffices to show that P (1) holds, and if P (n) holds then
P (n + 1) holds for any arbitrary natural number n.

Theorem 2.1 (Principle of mathematical induction (PMI)). Let G ⊆ N.


Suppose that

1. 1 ∈ G,

2. if n ∈ G, then n + 1 ∈ G.

Then, G = N.

Remark 3. Notice second assumption is called inductive step and n ∈ G is called


inductive hypothesis.

Example 2.2. If n ∈ N, then 8n − 3n is divisible by 5.

Proof. Let

G = {n ∈ N : 8n − 3n divisible by 5},

and we’ll show G = N. Notice that G ⊆ N. Further, we have 1 ∈ G, since


81 − 31 = 5 is divisible by 5. Let n ∈ G, then 8n − 3n is divisible by 5. Further,

8n+1 − 5n+1 = 8 · 8n − 3 · 5n = 5 · 8n + 3(8n − 3n ).

Hence, 8n+1 − 5n+1 is divisible by 5 and hence n + 1 ∈ G.

Theorem 2.3 (PMI-Variant 1). Let G ⊆ N and k0 ∈ N. Suppose that

1. k0 ∈ G,

2. if n ∈ {k0 , . . .} and n ∈ G, then n + 1 ∈ G.

Then, {k0 , . . .} ⊆ G.

Theorem 2.4 (PMI-Variant 2). Let G ⊆ N. Suppose that

1. 1 ∈ G,

2. if n ∈ N and {1, . . . , n} ∈ G, then n + 1 ∈ G.

Then, G = N.

4
Proof. Suppose G 6= N, we’ll derive a contradiction. Let H = N \ G 6= ∅. Since,
H ⊆ N, we have some m ∈ H such that m ≤ h for all h ∈ H by well-ordering
principle. We have m > 1 since 1 ∈ G. Therefore, m = 1 + b for some b ∈ N. Let
p ∈ {1, 2, . . . , b}, then p ≤ b < b + 1 = m. That is, p ∈
/ H and hence p ∈ G. By
second hypothesis of the theorem, we have m = b + 1 ∈ G. Therefore, we have a
contradiction.

Theorem 2.5 (PMI-Variant 3). Let G ⊆ N and k0 ∈ N. Suppose that

1. k0 ∈ G,

2. if n ∈ {k0 , . . .} and {k0 , . . . , n} ∈ G, then n + 1 ∈ G.

Then, {k0 , . . .} ⊆ G.

Definition 2.6. Set {1, 2, . . . , n} is also denoted by [n].

Example 2.7. Let n ∈ N. Suppose that n ≥ 2. Then n is either a prime number


or a product of finitely many prime numbers.

Theorem 2.8. Let n, k ∈ N. Then the following are true.

1. Let f : [n] → N be a function. Then, there is a q ∈ [n] such that f (q) ≥ f (i)
for all i ∈ [n].

2. Let S ∈ [n] be a non-empty subset. Then, there is a bijective function g :


[n] → [n] such that g(S) = [r] for some r ∈ N such that r ≤ n. If S ⊂ [n],
then r < n.

3. Let f : [n] → [k] be a function. If f is bijective, then n = k. If f is injective


but not surjective, then n < k.

You might also like