Common Mistakes in Induction Proofs
What You'll Learn
You'll learn to identify and avoid the two most critical errors that undermine induction proofs: circular reasoning and skipping the base case.
The Two Fatal Flaws
Mathematical induction is a powerful tool, but two common mistakes can completely invalidate your proof—and they're surprisingly easy to make, even for experienced students.
Mistake #1: Assuming What You Need to Prove
The inductive hypothesis says "assume P(k) is true." But some students accidentally use P(k+1) itself during the proof of P(k+1). This is circular reasoning—you're assuming the very thing you're trying to prove!
Example of the error: Suppose you're proving that the sum 1 + 2 + ... + n = n(n+1)/2. In the inductive step, you must start from the sum up to k (using the hypothesis) and add the (k+1)-th term. You cannot write "assume the sum up to k+1 equals (k+1)(k+2)/2" and then manipulate it—that's assuming your conclusion!
Think of it like climbing stairs: The inductive hypothesis lets you stand on step k. You must physically step up to reach k+1. You can't assume you're already standing on k+1 and work backward—that's not a proof, that's wishful thinking.
Mistake #2: Forgetting the Base Case
Some students dive straight into the inductive step and never verify P(1) (or P(0), depending on where you start). Without the base case, the domino chain has no starting point—the entire proof collapses.
Analogy: It's like proving "if one domino falls, the next falls" but never actually pushing the first domino. Nothing happens!
Checking Your Work
Before submitting an induction proof, ask yourself:
- Did I verify the base case explicitly?
- Did I clearly state what I'm assuming (P(k)) versus what I'm proving (P(k+1))?
- Did I use only P(k) and valid steps to reach P(k+1)?
Key Takeaway: Avoid circular reasoning by using only P(k) in your proof, and always verify your base case—both are essential pillars of mathematical induction.