In most Indian textbooks, the phrases proof by contradiction and proof of negation are used interchangeably — or the second one is never used at all. That is fine for school. But if you have met the terms separately and wondered whether they are the same thing, they are not quite. The difference is subtle, matters only for a particular style of rigour, and clears up several "why does this proof feel weird?" puzzles once you see it.

This article names the distinction, gives the precise logical forms, and shows which classroom proofs are really each kind.

The two forms, written out

Proof of negation. You want to prove "\lnot P." You assume "P" and derive a contradiction (a statement of the form Q \land \lnot Q). Therefore P is false, which means \lnot P is true. Done.

Proof by contradiction (strict form). You want to prove "P." You assume "\lnot P" and derive a contradiction. Therefore \lnot P is false, which means by the law of the excluded middle P is true. Done.

The structural difference is which one of the two is the goal and which is the assumption:

Why the distinction is philosophical, not cosmetic

In standard (classical) mathematics, the law of the excluded middle — every proposition is either true or false — is accepted without question. So "not-P is false" and "P is true" are treated as the same thing, and the two forms of proof are equally valid.

In constructive mathematics, the law of the excluded middle is not accepted as a universal axiom. A constructive mathematician accepts proof of negation without objection (showing that P would be false if it held is perfectly direct reasoning) but is cautious about proof by contradiction in the strict sense — because establishing "\lnot \lnot P" (i.e., "not-P is false") does not, for them, automatically yield "P." They want a constructive witness.

Why the constructivist distinction has bite: to prove "there exists an x with property \phi" constructively, you must produce an actual x. A proof by contradiction that shows "it is inconsistent that no such x exists" does not, under constructive rules, exhibit any specific x. It only rules out one case. Under the law of the excluded middle, the ruling out is sufficient; without that law, it is not.

For JEE and CBSE purposes, the distinction is invisible — classical logic is the default, and proof by contradiction works fully. But the distinction is real, and knowing about it sharpens your sense of what kind of proof you are writing.

Which classroom proofs are which

The famous proof that \sqrt{2} is irrational is usually presented as a "proof by contradiction." Look carefully at the statement, though: "\sqrt{2} is irrational" already is a negative statement — it means "\sqrt{2} is not rational." So the proof where you assume "\sqrt{2} is rational" and derive a contradiction is really a proof of negation. You did not need the law of the excluded middle at all.

Examples of proofs that truly are proofs by contradiction in the strict sense — ones that need excluded middle — are harder to find in school. A classic one: every non-empty bounded set of real numbers has a supremum. To prove this you often assume no supremum exists and derive a contradiction. Here the goal is a positive existence statement ("there exists a supremum"), so the assumption is its negation ("no supremum exists"), and deriving a contradiction gives only "\lnot \lnot (\text{supremum exists})" — which equals "supremum exists" only if you accept excluded middle.

Here is a handy classification:

A worked example: telling them apart

Claim 1: There is no smallest positive rational number.

What kind of claim? "There is no..." — negative. So the proof is a proof of negation.

Proof. Suppose, for contradiction, that there is a smallest positive rational r. Then r/2 is also a positive rational and r/2 < r, contradicting the smallest-ness of r.

This is a clean proof of negation. No excluded middle needed: you assumed the positive claim, found it impossible, and your goal was already negative.

Claim 2: There exists a prime number greater than 1000.

What kind of claim? "There exists..." — positive. A proof by contradiction would be strict.

Proof (strict contradiction style). Suppose there is no prime greater than 1000. Then the set of primes is finite; let p_1, \dots, p_n be all of them. Consider N = p_1 p_2 \cdots p_n + 1. Then N is not divisible by any of the p_i (it leaves remainder 1 each time). So N has a prime factor not on the list — contradicting that p_1, \dots, p_n are all the primes.

Notice what this proof actually gives you: the claim "there is no prime > 1000" is false. The classical mathematician concludes "so there exists a prime > 1000." But look: we also have a construction — N = p_1 \cdots p_n + 1 has a prime factor bigger than 1000 (since N > 1000). Reworded slightly, the proof is constructive after all — it actually exhibits a (possibly very large) prime. This is a sign that the underlying logic was never truly requiring excluded middle; the proof just looked like strict contradiction on the surface.

Why most "proof by contradiction" is actually proof of negation in disguise: many positive claims can be recast negatively with no loss. "There exists x with property \phi" is equivalent to "it is not the case that every x lacks property \phi" — and that restated goal is negative, so the contradiction move is now a proof of negation. For most classroom and competition mathematics, this reframing is always available, which is why the distinction rarely shows up in school practice.

Classify the proof

Take the classical proof that there are infinitely many primes (Euclid's proof, mentioned above). Classify it: proof by contradiction or proof of negation?

Answer. The statement "there are infinitely many primes" is equivalent to "it is not the case that there are only finitely many primes." Reading it the second way makes the goal negative, so the proof that assumes finitely many and derives a contradiction is really a proof of negation — it directly establishes "not-finite," without needing excluded middle.

Follow-up: How would you write the same proof as a true positive statement needing excluded middle? You would state the goal as "there exists a prime greater than any given N" and assume there is no such prime. But even this proof, as shown above, hands you an explicit construction of the prime, so it is really constructive.

The pattern: in most natural mathematics, the deep logical form is proof of negation. True strict proof by contradiction — where the only way out is to appeal to excluded middle — is rarer than it looks.

What to carry away

For school and JEE, you can keep calling both of these "proof by contradiction" without hesitation — in classical logic, the techniques are interchangeable. But when a proof feels cleaner than you expected, or you cannot see why excluded middle was needed, it may be because what you wrote was really a proof of negation all along. The distinction is not a technicality teachers were hiding from you; it is one of the quiet structural facts of mathematical logic, and it is worth knowing the name of.

Related: Proof by Contradiction · Proof by Contrapositive · Logic and Propositions · When Is It Really a Contradiction (vs Just Something Weird)? · Proof by Contradiction for Irrationality