Skip to content

Proof By Contradiction

Version
v1 · 2026-08-24 · History
Prime #
1092
Origin domain
Mathematics
Subdomain
logic and proof theory → Mathematics

Core Idea

Establish a claim by assuming its negation, deriving consequences under the system's accepted rules, and showing they include an impossibility — at which point the negation must be false and the claim must hold.

How would you explain it like I'm…

Pretend the Opposite

Imagine you say, 'There is no biggest number.' To check, pretend the opposite: suppose there IS a biggest one. But you can always add one to it and get a bigger number, which can't be if it was really the biggest. Since pretending the opposite led to something impossible, your first idea must be right.

Assume the Opposite

Proof by contradiction is a way to show something is true by first pretending it's false and seeing what happens. You assume the opposite of what you want to prove, then follow the rules carefully step by step. If the opposite leads you to something that simply can't be, like a number being both bigger and not bigger than itself, then the opposite must have been wrong. And if the opposite is wrong, then your original claim has to be true. It's like proving a road is blocked by walking down it until you smack into a wall.

Assume False, Hit Impossible

Proof by Contradiction is the structural move of establishing a claim by assuming its *negation*, deriving consequences from that negation under the system's accepted rules, and showing those consequences include an *impossibility* — at which point the negation must have been false, so the original claim holds. Four parts define it: a target claim; the tentative assumption of its negation; a derivation chain under the system's rules that exposes the negation's consequences; and an impossibility verdict (a formal contradiction, a physical violation, an empirical disconfirmation) that retroactively invalidates the negation. Where direct proof works *forward* from accepted facts to the claim, contradiction works *outward from the negation* — exploring 'what if the claim were false?' until it hits something the system can't tolerate. The two are complementary, and some claims are tractable only this way, because the forward path branches uncontrollably while the backward path quickly reaches an impossibility. It's only valid if the rules are genuinely shared and the impossibility is genuinely discovered, not smuggled into the assumption.

 

Proof by Contradiction is the structural move of establishing a claim by assuming its negation, deriving consequences from that negation under the system's accepted rules, and showing that those consequences include an impossibility — at which point the negation must have been false, and the original claim must hold. Four commitments define it: a claim to be established; a system of rules (axioms, physical laws, accepted facts, behavioural assumptions) under which derivation proceeds; the negation as a tentative assumption; and the discovery of an impossibility — a formal contradiction, a physical violation, a behavioural incoherence, an empirical disconfirmation — that forces rejection of the negation. The skeleton has four parts: a target claim; the tentative assumption of its negation; a derivation chain under the system's rules that exposes the negation's consequences; and an impossibility verdict that retroactively invalidates the negation and so establishes the claim. The move is informative when the system's rules are genuinely accepted, so the derivation is binding, and when the impossibility is genuinely discovered rather than assumed; it is empty when the rules are not really shared by all parties, or when the contradiction was smuggled into the assumption from the start, and distinguishing a real discovered impossibility from a planted one is part of the discipline the structure enforces. Where direct proof works forward, from accepted facts to the claim, contradiction works outward from the negation: explore the consequences of 'what if the claim were false?' until they hit something the system cannot tolerate. The two strategies are complementary, and some claims are tractable only by contradiction because the forward path is too long or branches uncontrollably while the backward path quickly reaches an impossibility. The move is fully relational at the formal level — assume the negation, derive a contradiction, conclude the claim — and so substrate-neutral, though its long mathematical lineage gives the term a mild traditional tinge when carried into other fields.

Broad Use

  • Mathematics: Euclid's infinitude of primes, the irrationality of √2, Cantor's diagonal argument.
  • Software debugging: Assume "the bug is in module X," predict what else must be true, and reject when the logs falsify it; bisection is serial contradiction.
  • Formal verification: Solvers prove unsatisfiability — the negation has no model.
  • Engineering and physics: "This design cannot work" derives a conservation-law violation from the design's assumptions.
  • Economics: No-arbitrage arguments show a persisting price gap would yield unbounded profit, contradicting equilibrium.
  • Law: Reductio arguments show a proposed rule would entail an absurd or unconstitutional consequence.
  • Philosophy: Reductio ad absurdum refutes a claim by deriving absurd consequences from it.

Clarity

Forces the distinction between deriving consequences of the negation and deriving consequences of the claim, exposing question-begging where a prover assumes the claim to demonstrate it.

Manages Complexity

Converts an open-ended forward search ("derive the claim somehow") into a bounded one ("derive any contradiction from the negation"), often easier because the negation is more concrete than the affirmation.

Abstract Reasoning

The asymmetry of refutation and confirmation: one contradiction refutes, while no amount of consistent consequence confirms — the structural basis of falsifiability.

Knowledge Transfer

  • Math → engineering: The reductio becomes design rejection — assume the design works, derive a thermodynamic violation, reject — only the "rules" differ.
  • No-arbitrage → security: "If this gap/vulnerability existed, what unbounded consequence follows?" is the same proof as a privilege-escalation chain.
  • Philosophy → strategy: The pre-mortem ("assume the launch failed; what story do we tell?") is reductio applied to forward planning.

Example

To prove √2 irrational, assume √2 = a/b in lowest terms; squaring forces a and b to both be even, contradicting "lowest terms" — the impossibility is genuinely discovered, not planted.

Relationships to Other Abstractions

Local relationship map for Proof By ContradictionParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Proof ByContradictionPRIMEPrime abstraction: Contradiction — is part ofContradictionPRIMEPrime abstraction: Deductive Reasoning — is a kind ofDeductiveReasoningPRIMEDomain-specific abstraction: Auxiliary function — is a kind ofAuxiliaryfunctionDOMAINDomain-specific abstraction: Markov's Principle — is a kind ofMarkov'sPrincipleDOMAINDomain-specific abstraction: Strategy-stealing argument — is a kind ofStrategy-steali…DOMAINDomain-specific abstraction: Vitali set — is a kind ofVitali setDOMAIN

Current abstraction Proof By Contradiction Prime

Parents (2) — more general patterns this builds on

  • Proof By Contradiction is a kind of Deductive Reasoning Prime

    Proof by contradiction is the deductive strategy that assumes a target's negation, derives impossibility, and discharges that temporary assumption.

  • Proof By Contradiction is part of Contradiction Prime

    Proof by contradiction contains a derived contradiction as the discharge condition that makes rejecting the temporary negated assumption valid.

Children (4) — more specific cases that build on this

  • Auxiliary function Domain-specific is a kind of Proof By Contradiction

    The proposed strict upward parent is prime:proof_by_contradiction.

  • Markov's Principle Domain-specific is a kind of Proof By Contradiction

    The accepted reference-grade review places Markov's Principle under Proof By Contradiction because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.

  • Strategy-stealing argument Domain-specific is a kind of Proof By Contradiction

    The proposed strict upward parent is prime:proof_by_contradiction.

  • Vitali set Domain-specific is a kind of Proof By Contradiction

    The proposed strict upward parent is prime:proof_by_contradiction.

Hierarchy paths (2) — routes to 2 parentless roots

Not to Be Confused With

  • Proof by Contradiction is not Dialectic because contradiction refutes the negation outright, whereas dialectic synthesizes opposing positions into a higher resolution preserving something of both.
  • Proof by Contradiction is not Paradox because it deliberately constructs a contradiction to discharge an assumption, whereas a paradox is a standing contradiction with no accepted resolution.
  • Proof by Contradiction is not Deductive Reasoning in general because it is one strategy — assume the negation, derive falsity — whereas deduction includes the complementary direct, forward proof.