Welcome to the World of Proof by Cases!
In your H3 Mathematics journey, you will find that some mathematical statements are like puzzles that change depending on the numbers you use. A rule that works for even numbers might look totally different for odd numbers. This is where Proof by Cases (sometimes called "exhaustion") comes to the rescue!
Think of it as the "Divide and Conquer" strategy. Instead of trying to prove a statement for every single number at once, we break the problem into smaller, manageable groups (cases) and prove each one individually. If we cover every possible scenario, the whole statement must be true!
Don’t worry if this seems tricky at first; once you see the patterns, it becomes one of the most logical tools in your math toolkit.
1. What Exactly is Proof by Cases?
A Proof by Cases consists of showing that a statement \(P\) is true by breaking the domain (the set of numbers we are looking at) into several sub-groups. We then prove that \(P\) is true for each sub-group individually.
The Golden Rule: For the proof to be valid, your cases must be exhaustive. This means they must cover every single possibility. If you leave even one tiny scenario out, the whole proof falls apart!
A Simple Analogy:
Imagine you want to prove that you will always be prepared for the weather tomorrow. You can't just say "I'll wear a coat," because it might be hot. Instead, you break it into cases:
Case 1: It rains. (I will bring an umbrella.)
Case 2: It is sunny. (I will wear sunglasses.)
Case 3: It snows. (I will wear a parka.)
Since it must either rain, be sunny, or snow (assuming these are the only options!), you have proved you are always prepared!
Key Takeaway:
To prove a statement by cases, you must show that the statement holds true for Case 1 OR Case 2 OR Case 3... until all possibilities are exhausted.
2. When Should You Use This?
You should consider using Proof by Cases when a single formula or logical path doesn't apply to everything. Common "triggers" for using cases include:
- Parity: When a statement involves integers that could be even or odd.
- Absolute Values: When you see \( |x| \), because the behavior changes based on whether \( x \) is positive, negative, or zero.
- Inequalities: When the sign of a variable changes the direction of the inequality.
- Remainders (Modular Arithmetic): When a number could leave different remainders when divided by another number (e.g., \( n \equiv 0, 1, \text{ or } 2 \pmod 3 \)).
Did you know?
The famous "Four Color Theorem" (which states that any map can be colored with just four colors so that no two adjacent regions share a color) was proved using 1,482 different cases! It was so complex that a computer had to check all the cases.
3. Step-by-Step Guide to Writing the Proof
Let's look at how to structure your answer to keep it clear for the examiner:
Step 1: State your plan. Tell the reader you are using proof by cases.
Step 2: Define your cases. Make sure they cover everything (e.g., \( n \) is even, \( n \) is odd).
Step 3: Prove Case 1. Use algebra or logic to show the statement is true for this group.
Step 4: Prove Case 2 (and so on). Do the same for the remaining groups.
Step 5: Conclusion. Briefly state that since the statement holds for all possible cases, it is true for all values.
4. A Classic Example: Squares of Integers
The Problem: Prove that for any integer \( n \), the value of \( n^2 + n \) is always even.
Wait! Before we start, let's remember:
An even number can be written as \( 2k \).
An odd number can be written as \( 2k + 1 \).
(Where \( k \) is an integer.)
Case 1: \( n \) is even.
Let \( n = 2k \).
Then \( n^2 + n = (2k)^2 + (2k) = 4k^2 + 2k \).
We can factor out a 2: \( 2(2k^2 + k) \).
Since this is 2 times an integer, the result is even.
Case 2: \( n \) is odd.
Let \( n = 2k + 1 \).
Then \( n^2 + n = (2k + 1)^2 + (2k + 1) \).
Expanding this: \( (4k^2 + 4k + 1) + (2k + 1) = 4k^2 + 6k + 2 \).
Again, factor out a 2: \( 2(2k^2 + 3k + 1) \).
This is also 2 times an integer, so the result is even.
Conclusion: Since \( n \) must be either even or odd, and in both cases \( n^2 + n \) is even, the statement is proved!
Quick Review Box:
Checklist for a solid proof:
1. Are my cases distinct? (They shouldn't overlap unnecessarily, though it's okay if they do, as long as they cover everything).
2. Are my cases exhaustive? (Did I miss the number zero? Did I miss negative numbers?)
3. Did I reach a clear conclusion for every single case?
5. Common Mistakes to Avoid
Even the best students can trip up on these "traps":
- The "Missing Zero" Trap: If you are splitting cases into "positive" and "negative," don't forget the case where \( x = 0 \)!
- Over-complicating: Don't create 10 cases if 2 will do. Look for the simplest way to divide the numbers.
- Not being exhaustive: If you prove something for all prime numbers, you haven't proved it for all integers (you missed 1, 4, 6, 8, etc.).
Memory Trick: "CEO"
To remember what makes a good Proof by Cases, remember CEO:
Cases are defined.
Exhaustive (covers everything).
One-by-one proof.
6. Advanced Tip: Using Modulo
As an H3 student, you are expected to know Modular Arithmetic. This is a powerful way to create cases! If a problem involves divisibility by 3, you can split your proof into three cases based on remainders:
- Case 1: \( n = 3k \) (Remainder 0)
- Case 2: \( n = 3k + 1 \) (Remainder 1)
- Case 3: \( n = 3k + 2 \) (Remainder 2)
This covers every possible integer in the universe because every number leaves a remainder of 0, 1, or 2 when divided by 3!
Summary Takeaway:
Proof by cases is your best friend when a problem feels "split." By breaking the big problem into smaller, simpler logical steps, you can tackle even the most complex H3 theorems with confidence. Just remember: cover all the bases and prove every case!