Sets and Methods of Proof
The main types of proof
Proving a mathematical proposition is not about convincing yourself intuitively that it is true: it means producing a rigorous chain of implications, starting from accepted or already proven hypotheses, all the way to the desired conclusion. There are several classic strategies, and knowing which one to choose is already a skill in its own right.
Direct proof
It starts from the hypotheses and chains deductions up to the conclusion: if is true, we show step by step that necessarily follows. It is the most natural method, but not always the easiest to carry out.
Proof by contrapositive
It exploits a fundamental logical equivalence: is strictly equivalent to its contrapositive .
When it is hard to start directly from , it is often easier to assume is false and show that must then be false too.
Be careful never to confuse the contrapositive, which is always equivalent to the original implication, with the converse , which in general has no guaranteed truth relationship with it.
Proof by contradiction
We assume the opposite of what we want to prove, then deduce a contradiction from it — a proposition and its negation both true at the same time. Since this contradiction is impossible, the initial assumption was false, and the original proposition is therefore true.
| Step | What we write |
|---|---|
| we want to prove | |
| we assume | |
| we carry out valid logical deductions | |
| we obtain , a contradiction | |
| so is impossible | |
| conclusion: is true |
It is the method of choice for proving that an object does not exist, or that a given number is irrational.
Proof by cases
It splits the problem into several situations that together cover all possibilities — for example an integer being even or odd — and proves the proposition separately in each case.
Two points must be checked with the greatest care: that the cases cover all possibilities, without exception, and that each one is handled correctly all the way through.

