The Idea of Induction

Color the integers ≥ 0
0, 1, 2, 3, 4, 5, ?, …
Induction I tell you, 0 is red, & any int
next to a red integer is red,
then you know that
all the ints are red!
Albert R Meyer February 24, 2012 lec 3F.1 Albert R Meyer February 24, 2012 lec 3F.2

The Idea of Induction Induction Rule

Color the integers ≥ 0
R(0), R(0) IMPLIES R(1), R(1) IMPLIES R(2),
0, 1, 2, 3, 4, 5, … R(2) IMPLIES R(3),…, R(n) IMPLIES R(n+1),…
I tell you, 0 is red, & any int
R(0), R(1), R(2), …, R(n),…
next to a red integer is red,
then you know that
all the ints are red!
Albert R Meyer February 24, 2012 lec 3F.3 Albert R Meyer February 24, 2012 lec 3F.4



  

Induction Rule Like Dominos…

R(0), R(0) IMPLIES R(1), R(1) IMPLIES R(2),

R(0), ∀n.R(n) IMPLIES R(n+1)
R(2) IMPLIES R(3),…, R(n) IMPLIES R(n+1),…

∀m.R(m)
R(0), R(1), R(2), …, R(n),…

Image by MIT OpenCourseWare.

Albert R Meyer February 24, 2012 lec 3F.5 Albert R Meyer February 24, 2012 lec 3F.6

Example Induction Proof Example Induction Proof

Statements in magenta form a
Let’s prove: template for inductive proofs:
(n+1)
r -1 Proof: (by induction on n)
1+r+r2 ++rn = The induction hypothesis, P(n), is:
r-1 r(n+1) -1
1+r+r2 ++rn =
(for r ≠ 1) r-1
(for r ≠ 1)
Albert R Meyer February 24, 2012 lec 3F.7 Albert R Meyer February 24, 2012 lec 3F.8



  

Example Induction Proof Example Induction Proof

Base Case (n = 0): Inductive Step: Assume P(n)
? 0+1 where n ≥ 0 and prove P(n+1):
2 0 r -1
1 + r + r ++ r =
r -1 r (n+1)+1- 1
r -1 2 n+1
1 1 + r + r ++ r =
= =1 r -1
r -1
OK!
Albert R Meyer February 24, 2012 lec 3F.9 Albert R Meyer February 24, 2012 lec 3F.10

Example Induction Proof Example Induction Proof

Now from induction adding rn+1 to both sides,

⎛ rn+1 - 1 ⎞ n+1
hypothesis P(n) we have (1 + r + r 2
++ r + r n
) n+1
=⎜
⎝ r - 1 ⎠⎟
+r

2 rn+1 - 1 n This proves rn+1 -1 + rn+1 (r -1)

1 + r + r ++ r = =
r -1 P(n+1) r -1
so add rn+1 to both sides completing the r(n+1)+1 -1
=
proof by induction. r -1
Albert R Meyer February 24, 2012 lec 3F.11 Albert R Meyer February 24, 2012 lec 3F.12



  

an aside: ellipsis The MIT Stata Center

“” is an ellipsis. Means you
should see a pattern:
n

1 + r + r ++ r = ∑ r
2 n
i

i=0

Can lead to confusion (n = 0?)

sum (∑) notation more precise
Albert R Meyer February 24, 2012 lec 3F.13 Albert R Meyer February 24, 2012 lec 3F.14

Copyright © 2003, 2004, 2005 Norman Walsh. This

work is licensed under a Creative Commons license.

Design Mockup: Stata Lobby Mockup: Plaza Outside Stata

Goal: Tile the plaza, except for 1×1
square in the middle for Bill.

Image removed due to copyright restrictions.

2n

Albert R Meyer February 24, 2012 lec 3F.15 Albert R Meyer

2n
February 24, 2012 lec 3F.16



  

Plaza Outside Stata Plaza Outside Stata

Gehry specifies L-shaped tiles covering
three squares: Theorem: For any 2n×2n plaza, we can
make Bill and Frank happy.
For example, for 8 x 8 plaza might tile for Bill Proof: (by induction on n)
this way: P(n) ::= can tile 2n×2n with Bill in middle.
Base case: (n=0)

(no tiles needed)

Albert R Meyer February 24, 2012 lec 3F.17 Albert R Meyer February 24, 2012 lec 3F.18

Plaza Outside Stata Plaza Outside Stata

Induction step: assume can tile
2n×2n, prove can tile 2n+1×2n+1 Now what?...

2n 2n
2n+1 2n+1

Albert R Meyer February 24, 2012 lec 3F.19 Albert R Meyer February 24, 2012 lec 3F.20



  

Plaza Outside Stata Plaza Theorem

Theorem:For any 2n×2n plaza, we
The fix: can make Bill and Frank happy.
prove something stronger Proof: (by induction on n)
—that we can find a tiling revised induction hypothesis P(n) ::=
with Bill in any square. can tile with Bill anywhere
Base case: (n=0) as before

Albert R Meyer February 24, 2012 lec 3F.21 Albert R Meyer February 24, 2012 lec 3F.22

Plaza Proof Plaza Proof

Inductive step:
Now group the squares together,
Assume we can get Bill anywhere in 2n×2n
and fill the center Bill’s with a tile.
Prove we can get Bill anywhere in 2n+1×2n+1

2n Done!

2n

Albert R Meyer February 24, 2012 lec 3F.23 Albert R Meyer February 24, 2012 lec 3F.24

  

Recursive Procedure

Note: The induction proof

implicitly defines a
recursive procedure
for tiling with Bill anywhere.

Albert R Meyer February 24, 2012 lec 3F.25

MIT OpenCourseWare
http://ocw.mit.edu

6.042J / 18.062J Mathematics for Computer Science

Spring 2015

For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.