No history yet

Reductio ad Absurdum Structure

The Logic of Contradiction

Proof by contradiction, or reductio ad absurdum, is a powerful technique for proving a statement is true. Instead of building a direct case, you take the opposite approach: assume the statement is false and show that this assumption leads to a logical impossibility. If an assumption creates an absurd outcome, the assumption itself must be wrong.

Let's formalise this. Suppose you want to prove a conditional statement of the form 'If P, then Q' (symbolically, P    QP \implies Q). The direct path would be to start with P and logically derive Q. The indirect path of contradiction starts differently. You assume the conclusion, Q, is false. So, you begin with the single assumption that both P is true AND 'not Q' is true.

P¬QP \land \neg Q

Hunting for the Absurd

Once you've made your initial assumption, your goal is to follow a chain of valid logical steps until you arrive at a contradiction. This isn't just any disagreement; it's a specific kind of logical impossibility where a statement and its exact opposite are both shown to be true. This violates the fundamental , a cornerstone of classical logic which states that something cannot be both true and false at the same time in the same way.

The contradiction you are searching for will always take the form 'R and not R', for some statement R. The statement R can be anything, from a simple variable to a complex expression. The key is that you have derived both R and its negation, ¬R\neg R, from your initial assumption. This is the logical 'break' you need.

R¬RR \land \neg R

Since your logical steps were all valid, the only possible source of this absurd conclusion is your starting assumption. Therefore, the assumption (P¬QP \land \neg Q) must be false. If it's false that 'P and not Q' is true, then it must be true that 'If P, then Q'.

In an indirect proof, instead of proving a statement directly, you assume that the statement is false and then show that this assumption leads to a contradiction.

The Reductio Template

This method provides a clear template for constructing proofs. Let's look at the formal structure.

StepActionGoal
1State the proposition to prove.We want to prove P    QP \implies Q.
2Assume the negation of the proposition.Assume P¬QP \land \neg Q.
3Use rules of inference and logic.Deduce a series of new statements from the assumption.
4Arrive at a contradiction.Show that your deductions lead to R¬RR \land \neg R.
5Conclude the assumption is false.The assumption P¬QP \land \neg Q led to a contradiction, so it must be false.
6Conclude the original proposition is true.Since P¬QP \land \neg Q is false, its negation, P    QP \implies Q, must be true.

Let's apply this to a classic example: proving that 2\sqrt{2} is This can be framed as: If x=2x = \sqrt{2}, then xx cannot be expressed as a fraction of two integers. We start by assuming the opposite: that 2\sqrt{2} can be expressed as a fraction a/ba/b in its simplest form. Through a series of algebraic steps, we can show that this assumption implies that a must be even, and b must also be even. But if both are even, the fraction wasn't in its simplest form, which contradicts our starting condition. The assumption must be false, so 2\sqrt{2} must be irrational.

Quiz Questions 1/5

What is the fundamental first step when starting a proof by contradiction to prove a statement 'S'?

Quiz Questions 2/5

In a proof by contradiction, after making an initial assumption, what are you trying to achieve?

Mastering this structure allows you to tackle proofs that are difficult or impossible to solve with direct methods. It's a fundamental tool for rigorous thinking in mathematics, computer science, and philosophy.