Why can no fraction in lowest terms ever square to give exactly ? Questions like this are where proof by contradiction earns its place. The method proves a claim by assuming the opposite and showing that the assumption leads to an impossibility. If the logic is valid and the contradiction is genuine, the original claim must be true.
When to reach for proof by contradiction
Proof by contradiction works best when the opposite of a claim has a rigid structure. That happens often in number theory, impossibility proofs, and some existence questions.
For example, if you want to prove that a number is irrational, assuming it is rational gives you a fraction form to work with. That extra structure often makes the contradiction easier to find than a direct proof. The negation gives you something concrete to push on.
It is less useful when a short direct proof already exists. Contradiction is a valid method, but it should clarify the argument rather than make it feel longer than necessary.
The step-by-step structure
Suppose the statement you want to prove is . A contradiction proof moves through these steps:
- Assume the statement is false. Replace with its negation and treat that as a temporary assumption.
- Translate that assumption into a concrete form you can manipulate.
- Push the consequences step by step, using definitions, algebra, and known theorems.
- Reach a contradiction with a known fact, such as:
or a conflict with a definition, or a statement that cannot hold at the same time as an earlier step.
- Conclude the original statement is true, because the negation cannot be correct.
The key condition is that the contradiction must come from valid reasoning and accepted facts. A result that merely looks strange is not enough. It has to be impossible under the definitions or theorems you are using. If step 2 is weak, the proof usually stays fuzzy. The strongest contradiction proofs come from turning the negation into something very concrete.
Full example: why is irrational
This is the classic case, worked end to end.
Start by assuming the opposite:
If that were true, then could be written as
where and are integers, , and the fraction is in lowest terms.
Now square both sides:
so
This tells us that is even. That forces to be even too, because the square of an odd integer is odd. So write
for some integer .
Substitute that into :
Now is even, so is even as well.
But now both and are even. That means both are divisible by , which contradicts the assumption that was already in lowest terms.
So the original assumption was false. Therefore is irrational.
Where the proof can stall, and how to check yourself
Each step has a place where beginners get stuck. Use these self-checks.
At the assumption step, the danger is assuming the opposite too vaguely. You need the actual negation of the statement, not a nearby statement that sounds similar. Self-check: state the negation precisely before continuing.
At the reasoning step, the danger is an invalid algebra step. If you reach a contradiction because of bad algebra, the contradiction proves only that the algebra was wrong, not that the original claim was true. Self-check: every line should follow from accepted rules.
At the contradiction step, the danger is not naming the fact that is being contradicted. The conflict in the proof is specific:
- The assumption says in lowest terms.
- The algebra shows both and must be even.
- A fraction cannot be both in lowest terms and have numerator and denominator divisible by .
That direct clash is the contradiction. Self-check: point to the exact rule that failed, whether a parity rule, a definition, a minimality condition, or a previously proved theorem. If you cannot name it, the proof is probably incomplete. It is easy to hide weak reasoning behind the phrase "this is a contradiction."
Build the skill on a new claim
A good next claim to prove this way: "there is no smallest positive rational number." Assume there is one, call it , and ask what happens to . Translate the assumption into concrete form, push the consequences, and watch for the exact fact that breaks. Naming that fact is what turns a vague feeling into a finished proof.
Frequently Asked Questions
- What is proof by contradiction in simple terms?
- It proves a statement by assuming the statement is false and then showing that this assumption leads to an impossibility or a conflict with a known fact.
- Is proof by contradiction always valid?
- It is valid when the argument from the negated assumption to the contradiction is logically correct and the contradiction really conflicts with accepted definitions or established results.
- When do mathematicians choose contradiction instead of a direct proof?
- Often when the direct route is awkward, but the negation creates a strong restriction that quickly leads to an impossible conclusion.
Need help with a problem?
Upload your question and get a verified, step-by-step solution in seconds.
Open GPAI Solver →