next up previous
Next: Basic Concepts and Terminologies Up: Proof Techniques Previous: Proof by Induction

Proof by Contradiction

Proof by contradiction is another powerful technique that often works when everything else fails. Suppose that we want to prove that some statement $P$ is true. We then assume for the moment, that $P$ is false and to see whether this will lead to a contradictive statement. If it does, then the only assumption to be blamed is the starting assumption that $P$ is false. We then can conclude that $P$ is true.
\begin{example}
Prove that real numbers are not countable.
\end{example}


xiangyang li 2000-09-06