Scribd
Upload
45 views

CS109A Notes For Lecture 1/17/96 Simple Inductions: Basis Inductive Step Inductive Hypothesis Not

1) This document discusses simple inductive proofs. Inductive proofs have three parts: a statement to prove about an integer parameter n, a basis case proving the statement for a starting value of n, and an inductive step proving that if the statement holds for n it also holds for n+1. 2) It provides an example proof by induction that the sum of the series 1/1 + 1/2 + 1/3 + ... + 1/n equals 1. The basis case proves it for n=1 and the inductive step assumes it is true for n and uses that to prove it is true for n+1. 3) General patterns for inductive proofs are outlined, including

Uploaded by

savio77
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
45 views

CS109A Notes For Lecture 1/17/96 Simple Inductions: Basis Inductive Step Inductive Hypothesis Not

1) This document discusses simple inductive proofs. Inductive proofs have three parts: a statement to prove about an integer parameter n, a basis case proving the statement for a starting value of n, and an inductive step proving that if the statement holds for n it also holds for n+1. 2) It provides an example proof by induction that the sum of the series 1/1 + 1/2 + 1/3 + ... + 1/n equals 1. The basis case proves it for n=1 and the inductive step assumes it is true for n and uses that to prove it is true for n+1. 3) General patterns for inductive proofs are outlined, including

Uploaded by

savio77
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/ 4

CS109A Notes for Lecture 1/17/96

Simple Inductions

Three pieces:
1. A statement ( ) to be proved.
The statement must be about an integer
parameter .
2. A basis for the proof. This is the statement
( ) for some integer . Often = 0 or = 1.
3. An inductive step for the proof. We prove the
statement \ ( ) implies ( + 1)" for any .
The statement ( ), used in this proof, is
called the inductive hypothesis.
We conclude that ( ) is true for all
.
( ) might not be true for some
.
Example: The limit of the sum
1 + 1 + 1 + 1 +
1 2 2 3 3 4 4 5
is 1. (Each term is 1 divided by the product of
two consecutive integers.)
To prove this fact, we can prove the following
statement about the nite pre xes of the sum:
S n

S b

S n

S n

S n

S n

S n

n < b

( ):

S n

1 =
+1
=1 ( + 1)
n

i i

Basis: The basis is the case = 1, that is, we


n

must prove (1), or


S

1
X

1 = 1
=1 ( + 1) 1 + 1
There is one term, for = 1, so we nd that the
left and right sides of the = sign evaluate to 1 2.
Thus, the basis is true.
i

i i

Induction: To prove the induction, we must


prove ( ) implies ( + 1). ( + 1) is:
S n

S n

+1
X

S n

1 =
+1
=1 ( + 1) ( + 1) + 1

i i

Key \trick": Express ( +1) using ( ) and


\something left over."
In this case, the sum in ( + 1) is the sum
in ( ) plus the \extra" term for = + 1:
1 ( + 1)( + 2).
That is, ( + 1) can be written:
S n

S n

S n

S n

= n

S n

1
1 +
= ( + + 1+ 1
1)
=1 ( + 1) ( + 1)( + 2)
Use the inductive hypothesis. The sum is equal to
( + 1); that's what ( ) says. Thus, we must
prove:
1
+ ( + 1)( + 2) = ( + + 1+ 1
+1
1)
n

i i

n= n

S n

That's simple algebra!


Thus, the induction is proved, and we conclude ( ) holds for all
the basis value,
1.
S n

General Pattern for (Simple) Inductive


Proofs

1. State what ( ) is.


2. Explain intuitively what represents, e.g.,
\any positive integer" or \the length of a
string."
3. Tell what value of is the basis value, say
= .
4. Prove ( ).
5. State that you are assuming
and that
( ) is true.
S n

S b

S n

6. Prove ( + 1) using these assumptions. You


will surely have to use the \inductive hypothesis" ( ) in the proof.
7. State that as a result of your proofs (4) and
(6), you conclude ( ) for all
.
S n

S n

S n

More General Inductive Proofs


There can be more than one basis case.
We can do a complete induction (or \strong"
induction), in which or proof that ( + 1) is
true uses any of ( ) ( +1)
( ), where
is the lowest basis value.
Page 51 of FCS has the general proof outline.
S n

S b ;S b

; :::; S n

An Example With Multiple Basis Cases,


Complete Induction

We claim that every integer 24 can be written


as 5 + 7 for nonnegative integers and .
Note that some integers 24 cannot be expressed this way, e.g., 16, 23.
Let ( ) be the statement \ = 5 + 7 for some
0 and 0."
Basis: The ve basis cases are 24 through 28.
24 = 5 2 + 7 2
25 = 5 5 + 7 0
26 = 5 1 + 7 3
27 = 5 4 + 7 1
28 = 5 0 + 7 4
a

<

S n

Induction: Let +1 29. Then

4 24, the
lowest basis case.
Thus, ( 4) is true, and we can write
4 = 5 + 7 for some and .
Thus, +1 = 5( +1)+7 , proving ( +1).
Do not be thrown by the fact that in
the statement ( +1) is +1 here. The
statement calls for \any ."
n

S n

S n

S n

Actually, this \complete" induction is


not very complete; we only used one previous statement, ( 4). But ( ) is
not enough of an inductive hypothesis.
S n

Class Problem for Next Time

S n

What is the sum of the rst terms of the series


2 + 5 + 8 + 11 + ?
Figure out the answer, then prove you are
right by induction on .
n

You might also like