Base Case: Starting the Proof
You'll learn how to establish the foundation of a proof by induction by verifying the simplest case.
What Is the Base Case?
When using mathematical induction (the principle you just learned), the base case is your starting point—the first domino you need to prove falls. It's where you demonstrate that your statement holds true for the smallest value in your domain, typically n = 0 or n = 1.
Think of it like climbing a ladder: before proving you can climb from any rung to the next, you must first prove you can actually get on the ladder at the bottom rung.
How to Establish the Base Case
- Identify the starting value: Determine whether your statement begins at
n = 0,n = 1, or some other initial value. - Substitute directly: Plug that starting value into your statement.
- Verify it's true: Use direct calculation or logic to confirm the statement holds.
Example
Suppose you want to prove that the sum of the first n positive integers equals n(n+1)/2.
Base Case (n = 1):
- Left side: The sum of the first 1 positive integer = 1
- Right side: 1(1+1)/2 = 1(2)/2 = 1
- Since both sides equal 1, the base case holds! ✓
That's it—you've proven the statement is true when n = 1. This is your foundation.
Why It Matters
Without a valid base case, your entire proof collapses. Even if the inductive step (climbing rung-to-rung) is perfect, you need that first foothold to begin.
Key Takeaway: The base case proves your statement is true for the smallest value in the domain, establishing the foundation for induction.