A Level Maths Notes: FP1 – Proof By Induction
The simplest proofs by induction have two steps. This is maybe best illustrated with an example.
Suppose we wanted to prove that
(1)
for all
W
e say
is
the proposition that
and
we can write this as![]()
The first step, written
or
is
the statement that
or
is
true.
We can take
as
the statement
ie
which
is true.
Now we assume that
are
all true. If we can prove that
is
true then we will have proved that
is
true for all
since
we can take any value for
including
hence
proving
or
hence
proving
etc.
To prove
is
true, we first write down![]()
We work with the left hand side:
![]()
Now use![]()
If
then![]()
We have proved
so
is
proved and we have proved (1).
This is the general procedure:
Show
or
P(1) then assume
and
use
to
prove![]()
Example: Prove![]()
is
true since both sides equal 3
Assume![]()
Prove![]()
because
of![]()
If
then
hence![]()
Example Prove
(2)
If
then![]()
Assume
then![]()
We must prove![]()
which we obtain from (2) by replacing
by
throughout.
![]()
Hence (2) is proved.