PRINCIPLE OF MATHEMATICAL INDUCTION – ARGUE BY CONTRADICTION
The Principle of Mathematical Induction is a method used to prove statements that are
formulated for natural numbers. The principle typically involves two steps:
1. Base Case: Prove the statement is true for the initial value, usually n = 1 or n = 0.
2. Inductive Step: Assume the statement is true for some arbitrary n = k, and then prove
that it is also true for n = k+1.
While induction itself is a direct proof technique, proof by contradiction can sometimes be
combined with induction. To apply proof by contradiction using induction, we assume that
the statement is false for some n and attempt to show that this assumption leads to a
contradiction.
STRUCTURE OF THE PROOF BY CONTRADICTION WITH INDUCTION
1.Assume the opposite (Contradiction Hypothesis):
•Assume that the statement is false for at least one natural number n.
2. Find the smallest n where the statement is false:
•By the well-ordering principle, if the statement is false for some n, then there must be a
smallest natural number n = m for which the statement does not hold. This value m is the
smallest counterexample.
3. Base Case:
•Prove that the statement is true for the smallest value of n (typically n = 1). If the base
case holds, then m > 1, since the statement must be false for the smallest m but true for all
smaller n.
4. Inductive Step (Contradiction):
•Assume the statement is true for n = k, where 1≤ k < m (this is the induction hypothesis).
Then show that if the statement holds for k, it must also hold for k+1.
•Since the statement holds for all values less than m, and we show it must also hold for
m, this contradicts the assumption that m is the smallest counterexample.
5. Conclusion:
•Since the assumption that the statement is false leads to a contradiction, we conclude
that the statement must be true for all n.
Example of Proof by Contradiction using Induction Consider the following statement:
P(n) : The sum of the first n positive integers is n(n+1)/2.
1.Assume the statement is false for at least one n, and let m be the smallest such number.
2. Base Case: For n = 1
P(1) : 1(1+1)/2=1,
which is true.
3. Inductive Step: Assume P(k) is true for some k < m i.e., 1+2+…+ k = k(k + 1)/2. Now show
that it holds for k + 1.
1+2+…+k+ (k + 1) = k(k+1)/ 2 + (k + 1) = (k+1)(k+2)/ 2
Hence, P(k + 1) is true.
4. Since P(k) holds for all k < m, this implies P(m) must also be true, contradicting the
assumption that P(m) is false.
Thus, the statement must be true for all n.
This shows how proof by contradiction can be combined with induction.
Reported by: Christopher John Sabaoan
Arlebeth Natividad
