Mastering the Proof: Induction and the Monotone Convergence Theorem

Hey [Student Name]! We noticed you crushed the last few arithmetic modules, and now it's time to level up your thinking. When the movement shifts from 'how do I calculate this?' to 'how do I *prove* this?' that's when the real magic of mathematics begins. This isn't just about finding the answer; it's about building the unshakable scaffold of logic that supports the answer.

If you've been following the great work of faculty like 3Blue1Brown or diving deep into the concepts laid out by AoPS, you know that mathematics is built on assumptions—but those assumptions must be proven. Today, we're tackling Proof by Induction using a recursive sequence. It looks intimidating, but trust me: math will click when it's taught your kid's way, and that means breaking down the 'why' behind every single algebraic step.

We are looking at a sequence defined by $a_1 = 0$ and $a_{n+1} = \frac{1+a_n}{2+a_n}$. Our goal is to prove, using induction, that this sequence is increasing (i.e., $a_{n-1} < a_n$ for $n \ge 2$).

The Logic of Induction: A Three-Step Dance

Proof by induction is essentially an infinite domino effect. If you can prove the first domino falls (the Base Case), and if you can prove that *if* any domino falls, the next one *must* also fall (the Inductive Step), then you know every single domino will fall. It’s a beautiful, logical chain.

The video walk-through helps visualize this process, showing how careful algebraic manipulation allows us to bridge the gap between our assumption and the statement we need to prove.

1. The Base Case (The First Domino)

We start by checking the first few terms. Is $a_1 < a_2$? Yes, $0 < 1/2$. Our foundation is solid!

2. The Inductive Hypothesis (The Assumption)

This is where we assume the statement is true for some arbitrary number $K$. We assume $a_{K-1} < a_K$. This assumption is the key piece of information we are allowed to use.

3. The Inductive Step (The Proof)

Our job is to use the assumption ($a_{K-1} < a_K$) to prove the statement is true for the next number, $K+1$. This is where the 'trick' comes in, as shown in the video. Instead of trying to solve the inequality directly, the mathematician uses clever algebraic moves—like rewriting the definition and dividing by the same positive quantity—to isolate the relationship we need.

The Takeaway: The hardest part of induction isn't the algebra; it's knowing *how* to rewrite the relationship so that your assumption ($a_{K-1} < a_K$) pops out naturally into the new statement ($a_K < a_{K+1}$). This requires seeing the underlying structure, a skill that only practice can build.

Why Does This Matter?

The fact that we proved $a_n$ is increasing is crucial because it connects directly to the Monotone Convergence Theorem. This theorem tells us that even though the sequence is always getting bigger, it won't run off to infinity; it must level off at a specific limit (approximately 0.618...).

Understanding these foundational concepts—like the difference between a limit and a theorem, or the difference between an inequality and a proof—is what separates calculation from true mathematical mastery. If you feel like this kind of rigorous proof is right in your wheelhouse, you're ready to move to the next level.

You've shown yourself to be a true academic explorer. Keep practicing these proof techniques! When you’re ready to tackle even more advanced topics, head over to the Math Circle or check out the next Easy Score level up. We know you'll nail it!