In a recent class with my future secondary math teachers, we had a fascinating discussion concerning how a teacher should respond to the following question from a student:

Is it ever possible to prove a statement or theorem by proving a special case of the statement or theorem?

Usually, the answer is no. In this series of posts, we’ve seen that a conjecture could be true for the first 40 cases or even the first cases yet not always be true. We’ve also explored the computational evidence for various unsolved problems in mathematics, noting that even this very strong computational evidence, by itself, does not provide a proof for all possible cases.

However, there are plenty of examples in mathematics where it **is** possible to prove a theorem by first proving a special case of the theorem. For the remainder of this series, I’d like to list, in no particular order, some common theorems used in secondary mathematics which are typically proved by first proving a special case.

5. **Theorem**. For any rational number , we have .

This theorem is typically proven using the Chain Rule (in the guise of implicit differentiation) and the following lemma:

**Lemma**. For any integer , we have .

Clearly, the lemma is a special case of the main theorem. However, the lemma can be proven without using the main theorem:

*Proof of Lemma (Case 1)*. If is a positive integer, then

Case 1 can also be proven using the Product Rule and mathematical induction.

*Proof of Lemma (Case 2)*. If , then the theorem is trivially true since , and the derivative of a constant is zero.

*Proof of Lemma (Case 3)*. If is a negative integer, then write , where is a positive integer. Then, using the Quotient Rule,

**QED**

Now that the lemma has been proven, the main theorem can be proven using the lemma.

*Proof of Theorem*. Suppose that , where and are integers. Suppose that . Then:

Let’s now differentiate with respect to :

**QED**

### Like this:

Like Loading...

*Related*

## 1 Comment