Some mathematical truths are so fundamental — so deeply woven into the structure of numbers — that they resist direct proof. You simply cannot start from the hypothesis and walk in a straight line to the conclusion. In these situations, mathematics offers a powerful detour: proof by contradiction, or reductio ad absurdum (Latin for “reduction to the absurd”).

This technique is one of three indirect proof methods in the NCERT Class XII Mathematics appendix, and it has a long and celebrated history — it was used by ancient Greek mathematicians to prove the irrationality of √2 and the infinitude of primes. Understanding it deeply will serve you in board exams, CUET, and every mathematics course beyond Class XII.

What is Proof by Contradiction?

In a direct proof, you march from the hypothesis toward the conclusion. In proof by contradiction, you try the opposite: you assume the conclusion is false and see where that leads.

The strategy has four stages:

  1. Negate the conclusion. Assume the opposite of what you want to prove is true.

  2. Follow the logic. Using valid deductive steps — just as in a direct proof — derive consequences from this assumption.

  3. Reach an absurdity. At some point, your deductions will contradict a known fact, an axiom, or the hypothesis itself.

  4. Conclude the contradiction. Since the assumption (that the conclusion is false) led to an impossibility, the assumption must be wrong. Therefore, the original conclusion must be true.

The logical principle underlying this method is the law of the excluded middle: every proposition is either true or false, with no middle ground. If “the conclusion is false” leads to a contradiction, then “the conclusion is true” is the only remaining option.

Why Use Contradiction Rather Than Direct Proof?

Contradiction is particularly valuable when:

  • The conclusion involves an infinite or unbounded claim (“there are infinitely many…”) that cannot be reached by a finite forward argument.

  • Assuming the opposite gives you a rich, concrete structure to work with.

  • The direct route requires knowing something in advance that you cannot assume.

The technique essentially transforms a hard problem (“prove X is true”) into a more workable one (“prove that X being false leads to nonsense”).

Worked Example: The Set of All Prime Numbers is Infinite

This is one of the oldest and most beautiful proofs in mathematics, and it appears directly in the NCERT Class XII appendix.

Claim: The set of all prime numbers is infinite.

Proof by contradiction:

Step 1 — Negate the conclusion. Assume the opposite: suppose the set of all prime numbers is finite. Then we can list every prime number as p₁, p₂, p₃, …, pₖ — a complete, exhaustive list.

Step 2 — Construct a new number. Define the number:

N = (p₁ × p₂ × p₃ × … × pₖ) + 1

This number N is larger than every prime on our list.

Step 3 — Analyse N. Every integer greater than 1 is either prime or composite (has a prime factor). So N is one of the two:

  • If N is prime: Then N is a prime number not on our list (since N is larger than every prime on the list). This contradicts our assumption that the list is complete.

  • If N is composite: Then N has a prime divisor, call it q. Now q must be one of p₁, p₂, …, pₖ. But when you divide N by any pᵢ, the remainder is 1 (because pᵢ divides p₁ × p₂ × … × pₖ exactly, and N is that product plus 1). So no pᵢ can divide N — meaning q is a prime not on the list. Again, a contradiction.

Step 4 — Conclude. In both cases, the assumption that all primes are listed leads to a contradiction. Therefore, the assumption is false, and the set of prime numbers must be infinite. ∎

Writing Contradiction Proofs in Board Exams

  1. State the negation explicitly. Begin with: “Assume, for the sake of contradiction, that [negation of conclusion].”

  2. Derive carefully. Every step must be justified, exactly as in a direct proof.

  3. Name the contradiction. Do not just trail off — explicitly state: “This contradicts [the known fact / the hypothesis / the assumption].”

  4. State the conclusion. Close with: “Therefore, our assumption is false, and [original conclusion] is true.”

  5. Keep the negation precise. The negation of “infinitely many” is “finitely many.” The negation of “is irrational” is “is rational.” Getting the negation right is half the battle.

Prove It for Yourself

The prime numbers proof is one example — proof by contradiction applies throughout algebra, number theory, and analysis.

Practise Proof by Contradiction on ChampionsPrep → PrepCoin packs from ₹59

ChampionsPrep offers exam-style questions on every proof technique in Class XII Mathematics, with AI-powered doubt resolution to walk you through each step.

Proof by Contradiction in Mathematics: Reductio Ad Absurdum Explained for Class XII podcast artwork
Audio LessonClass 12

Proof by Contradiction in Mathematics: Reductio Ad Absurdum Explained for Class XII

ChampionsPrep MathematicsEpisode 1494:38

Subscribe in any podcast app:

Frequently Asked Questions

What is the difference between proof by contradiction and proof by contrapositive? +

In proof by contradiction, you assume the conclusion is false and derive a general logical impossibility. In proof by contrapositive, you prove the equivalent statement not-q implies not-p directly. Contradiction is open-ended; contrapositive has a fixed target.

What does reductio ad absurdum mean? +

Reductio ad absurdum is Latin for reduction to the absurd. It describes the strategy of taking an assumption, following it to its logical conclusion, and showing that conclusion is contradictory or impossible — thereby proving the original assumption was false.

Does proof by contradiction appear in CBSE Class XII board exams? +

Yes. Proof by contradiction can appear in board exams. A classic question is proving that the square root of 2 or the square root of 3 is irrational — which uses exactly this technique.

Can proof by contradiction be used to prove any mathematical statement? +

In principle yes — any true statement can be proved by contradiction. In practice, this method is most effective when the direct approach is blocked, or when assuming the opposite provides useful structural information.

How is the number N used in the proof that primes are infinite? +

N is constructed as the product of all listed primes plus 1. This ensures that no listed prime divides N evenly, meaning N's prime factor (if composite) must be an unlisted prime — contradicting the assumption that the list was complete.