Nepedia
Back to Discover
Advanced Reader
🔢

Reductio ad absurdum

math Maturity 13-18 Next article →

Reductio ad absurdum is a powerful form of logical reasoning used to establish a claim. The name is Latin for "reduction to absurdity." It is also known as an apagogical argument or a proof by contradiction. This method works by attempting to show that a contrary proposition leads to an impossible result. If following a specific logic leads to a contradiction, that logic must be flawed. In mathematics, this technique is frequently used to provide a proof by contradiction. This is often called an indirect proof because it does not prove a statement directly. Instead, it proves a statement by showing that its opposite cannot possibly be true.

To perform a mathematical proof by contradiction, a thinker follows a strict sequence of steps. First, identify the proposition you wish to prove, which we can call P. Next, assume that P is actually false. This is written as the negation of P, or ¬P. You then use logical reasoning to see what happens if ¬P is true. The goal is to derive two mutually contradictory assertions, such as Q and ¬Q. This process relies on the law of non-contradiction, which states that a proposition cannot be both true and false at once. Once you reach this contradiction, you have proven that your initial assumption was wrong. Therefore, the original proposition P must be true.

There are different ways this technique can manifest in reasoning. One common version is the existence proof by contradiction. In this case, you want to show that an object with a specific property exists. To do this, you assume that no such object exists. You then show that this assumption leads to a logical contradiction. Another version is refutation by contradiction, also called a proof of negation. In a refutation, you are trying to prove that a statement is false. You assume the statement is true and then derive a falsehood to conclude it is actually false. While these terms are often used interchangeably in math, they are formally distinct.

This method has a deep history reaching back to Ancient Greek philosophy. A satirical poem attributed to Xenophanes of Colophon around 570 to 475 BCE provides an early example. He argued that if gods had human forms, then animals would draw gods with horse or ox bodies. Since the gods cannot have both forms, the idea was a contradiction. Later, the philosopher Socrates used a formal dialectical method known as the Socratic method. He would lead an opponent through a step-by-step train of reasoning. He would use background assumptions to force the opponent to admit their assertion led to an absurd conclusion. This often left the opponent in a state of aporia, or a realization of doubt.

Great mathematicians have relied on this tool for centuries. Euclid of Alexandria and Archimedes of Syracuse used it to prove fundamental mathematical propositions. The mathematician G. H. Hardy famously described proof by contradiction as one of a mathematician's finest weapons. He claimed it was a far finer gambit than any move in a game of chess. Hardy noted that while a chess player might sacrifice a single piece, a mathematician offers the entire game. In modern logic, the principle is expressed through propositional formulas. It can be justified by the law of the excluded middle, which states that a proposition either holds or it does not.

Beyond the West, reductio ad absurdum is central to Buddhist philosophy. The Madhyamaka school uses these arguments, known as prasaṅga in Sanskrit, to challenge essentialist ideas. The philosopher Nāgārjuna used this in his work, the Mūlamadhyamakakārikā. He aimed to show that theories of permanent essence were unsustainable. For example, he argued that if a "young man" had a permanent essence, he could never grow old. Because change is possible, the idea of a fixed, unchanging essence must be false. This helped demonstrate that phenomena are empty of essential existence.

In modern times, philosophers still use these appeals to highlight irrationality. Lewis White Beck used them to criticize mechanism philosophy in 1974. Robert L. Holmes used the technique in 1989 to critique deterrence theory. He argued that relying on the threat of war to prevent war was irrational. Interestingly, the technique is not universally accepted in all logic systems. In intuitionistic logic, proof by contradiction is not generally considered valid. This is because intuitionistic logic requires a constructive method to prove a statement. Without a direct way to build the result, the contradiction alone is not always enough.

747 words

Where will your curiosity go next?

Keep exploring at your chosen reading level.

🖼️ Images & Media (1)
File:John Pettie - Reductio Ad Absurdum.jpg
John Pettie - Reductio Ad Absurdum.jpg
More to explore

🔬 Go deeper

More advanced topics to explore

🪜 Step back

Simpler topics to build understanding

What is Nepedia?

A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.