sciandu
Mathematics

Mathematics

Proofs

Why something always holds and not just sometimes: proofs turn a guess into certainty.

In mathematics it is not enough that a rule works for a few examples. A statement only holds once it is certain for all cases. A proof is the gapless justification for that. We look at three tools: two for proving a statement and one for refuting it.

What a proof has to do

A proof leads from things already accepted as true, in clear steps, to the new claim. Every step must be compelling so that no doubt remains at the end. Examples can suggest a conjecture, but they never prove that something holds for infinitely many cases.

The direct proof

In a direct proof you start from the assumptions and calculate straight ahead to the claim. A classic: the sum of two even numbers is even again. Every even number is twice a whole number: one of them can be written as 2m2m, the other as 2n2n, with whole numbers mm and nn. Adding both and factoring out the 2 shows at once that the result is again twice a whole number. The proof therefore covers all even numbers at once, not just the ones you happened to try.

2m+2n=2(m+n)2m + 2n = 2(m + n)
The factored-out 2 shows directly that the sum is even again.
Coordinate grid
m1
b1
-6-6-4-4-2-2224466
y = 1x + 1Starts at 1, +1 per step right
Try it: set the sliders to m = 2 and b = 0 and you get the line y = 2x. Above every whole number sits an even value, which is exactly what the notation 2m captures. The picture proves nothing on its own, only factoring out the 2 does.

The counterexample

To show that a claim is false, a single case where it fails is enough. This case is called a counterexample. If someone claims all are odd, the 2 suffices: it is a prime number and yet even. That settles the claim, no matter how many other primes are odd.

2P,2=212 \in \mathbb{P},\quad 2 = 2 \cdot 1
A single counterexample refutes a claim about all cases.

The proof by contradiction

In a proof by contradiction you assume the claim is false and follow this assumption until something impossible comes out. Since the steps were correct, the false assumption itself must be the mistake. So the claim was true after all. This method feels unusual at first, but it is very powerful.

A simple example: there is no largest even number. Assume the opposite, that there is one, and call it gg. Then g+2g + 2 is even as well and larger than gg. So gg was not the largest after all, and the assumption collapses. There really is no largest even number.

Exercises

0 of 6 solved

Time to try it yourself. You can't break anything, every attempt counts.

How many counterexamples do you need to refute a claim about all numbers?

Is a single fitting example enough to prove a statement for all numbers?

Name the smallest even prime number. It is the most famous counterexample to the claim that all primes are odd.

Match each proof method to its description.

Direct proof
Counterexample
Proof by contradiction

Make the direct proof concrete with an example: what is 4+64 + 6? The result has to be even again.

A proof must show that a statement holds for cases.