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.

The next theorem is needed in calculus to show that .

4. **Theorem***. Let . Suppose that has the following four properties:*

* for all *
* is continuous*

*Then for all .*

In other blog posts, I went through the full proof of this theorem, which is divided — actually, scaffolded — into cases:

*Case 1*. if is a positive integer.

*Case 2*. if is a positive rational number.

*Case 3*. if is a negative rational number.

*Case 4*. if is a real number.

Clearly, Case 1 is a subset of Case 2, and Case 3 is a subset of Case 4. Once again, a special case of a theorem is used to prove the full theorem.

### Like this:

Like Loading...

*Related*

## 1 Comment