An indirect proof does not follow the most direct route from hypothesis to conclusion. Two important forms are proof by contradiction and proof by contrapositive. Their logical structures are different, even though both can simplify a difficult argument.
Proof by contradiction
Proof by contradiction assumes that the target statement is false and derives an impossibility. The contradiction must be explicit: it should violate a definition, an established theorem, or one of the hypotheses.
Prove that the diagonal of a unit square, whose length is , is irrational.
Assume for contradiction that , where and are coprime integers and . Squaring gives
Thus is even, so is even. Write . Substitution gives , so is even as well. This contradicts the assumption that and are coprime. Therefore is irrational.
The same lowest-terms argument proves that is irrational. The key number-theoretic fact is that if a prime divides a square, it divides the number being squared.
Prove that there is no smallest positive rational number.
Suppose were the smallest positive rational number, with . Then is also positive and rational, but
This contradicts the assumed minimality.
Proof by contrapositive
To prove an implication , it is enough to prove the logically equivalent implication
For example, to prove “if is even, then is even,” prove instead that an odd integer has an odd square. If , then
which is odd. Hence being even forces to be even.
Prove that if is odd for integers and , then both and are odd.
Prove the contrapositive. If either factor is even, say , then
which is even. Therefore an odd product cannot have an even factor, so both factors are odd.
Contrapositive proof directly proves an equivalent implication. Contradiction proof instead assumes the negation of the target and derives an impossible statement. Keeping those two patterns distinct makes the proof strategy easier to audit.
Comments