What is Proof by Contradiction? | Simple Explanation for Class 8

S8-SA2-0147

What is a Proof by Contradiction?

Grade Level:

Class 8

AI/ML, Data Science, Research, Journalism, Law, any domain requiring critical thinking

Definition

What is it?

A Proof by Contradiction is a way to prove something is true by first assuming it's false. If that assumption leads to a situation that cannot be true (a contradiction), then our initial assumption must have been wrong, meaning the original statement was true all along.

Simple Example

Quick Example

Imagine your friend says, 'The school canteen will serve only idli today.' To prove this wrong by contradiction, you'd assume, 'The canteen will NOT serve only idli today.' If you then go to the canteen and see only idli being served, your assumption was wrong. So, your friend's original statement was correct!

Worked Example

Step-by-Step

Let's prove that 'There is no largest prime number.'

Step 1: Assume the opposite is true. So, assume 'There IS a largest prime number.' Let's call this largest prime number 'P'.

---

Step 2: Now, let's create a new number. Multiply all prime numbers up to P, and then add 1. So, N = (2 x 3 x 5 x ... x P) + 1.

---

Step 3: Consider the number N. When you divide N by any prime number (2, 3, 5, ... P), you will always get a remainder of 1. This means N is not divisible by any of the prime numbers up to P.

---

Step 4: Since N is not divisible by any prime number up to P, N must either be a prime number itself, or it must be divisible by a prime number larger than P.

---

Step 5: Both possibilities (N is prime, or N is divisible by a prime larger than P) mean that there exists a prime number greater than P. For example, if P was 7, and N calculated to 211 (which is prime), then 211 is a prime larger than 7.

---

Step 6: This contradicts our initial assumption that P was the LARGEST prime number. Since our assumption led to a contradiction, the assumption must be false.

---

Answer: Therefore, our original statement, 'There is no largest prime number,' must be true.

Why It Matters

This thinking method is super important in fields like AI/ML to verify algorithms, in Data Science to check data integrity, and even in Law to challenge claims. Lawyers use it to show that if a certain argument were true, it would lead to an impossible situation, thus proving the argument false. It helps in building strong, logical arguments in any career.

Common Mistakes

MISTAKE: Not clearly stating the initial assumption (the opposite of what you want to prove). | CORRECTION: Always begin by clearly writing down 'Assume the opposite is true...' or 'Let's assume the statement is false...'

MISTAKE: Failing to find a genuine contradiction, or creating a contradiction that doesn't logically follow from the assumption. | CORRECTION: The contradiction must be a direct, unavoidable result of your initial (false) assumption. Double-check your logic step-by-step.

MISTAKE: Stopping after finding the contradiction, without stating the conclusion. | CORRECTION: After showing the contradiction, explicitly state that 'Since this leads to a contradiction, our initial assumption must be false, and therefore the original statement is true.'

Practice Questions

Try It Yourself

QUESTION: To prove that 'It is NOT raining,' using contradiction, what would be your first assumption? | ANSWER: You would assume 'It IS raining.'

QUESTION: If you want to prove that 'All samosas in the shop are fresh,' by contradiction, and you find one stale samosa, what does that mean? | ANSWER: Finding one stale samosa contradicts your assumption that 'NOT all samosas are fresh.' This means your original statement, 'All samosas in the shop are fresh,' is false. (You would have assumed 'At least one samosa is NOT fresh' and then finding a stale one supports your assumption, meaning the original statement is false).

QUESTION: Prove by contradiction: 'The sum of an even number and an odd number is always an odd number.' (Hint: Assume the sum is an even number). | ANSWER: Assume the sum of an even number (2k) and an odd number (2m+1) is an even number (2n). So, 2k + (2m+1) = 2n. This simplifies to 2k + 2m + 1 = 2n. Rearranging gives 1 = 2n - 2k - 2m, or 1 = 2(n - k - m). This means 1 is an even number, which is a contradiction. Therefore, the initial assumption is false, and the sum of an even and an odd number is always odd.

MCQ

Quick Quiz

Which of the following is the first step in a Proof by Contradiction?

Assume the statement you want to prove is true.

Assume the opposite of the statement you want to prove is true.

Look for examples that support the statement.

Look for examples that contradict the statement.

The Correct Answer Is:

In a Proof by Contradiction, you start by assuming the opposite of what you want to prove. This assumption is then used to derive a contradiction, proving the original statement true. Options A, C, and D are not the starting point for this specific proof method.

Real World Connection

In the Real World

Imagine a cybersecurity expert trying to prove that a new banking app is secure. They might use contradiction: 'Assume the app IS NOT secure.' They would then try to find a vulnerability (a contradiction to their assumption). If they can't find any, it strengthens the argument that the app IS secure. Or, when a doctor diagnoses an illness, they might rule out possibilities by thinking, 'If it were X disease, then Y symptom would be present, but Y is not there. So, it can't be X.'

Key Vocabulary

Key Terms

ASSUMPTION: A thing that is accepted as true or as certain to happen, without proof. | CONTRADICTION: A situation or statement in which two things are in direct opposition to each other; they cannot both be true at the same time. | LOGIC: A system or set of principles underlying the arrangements of elements in a computer or electronic device or in a philosophical or scientific theory. | PROOF: Evidence or argument establishing a fact or the truth of a statement.

What's Next

What to Learn Next

Now that you understand Proof by Contradiction, explore 'Direct Proofs' and 'Proof by Induction'. These are other powerful ways to prove mathematical statements and will further strengthen your logical reasoning skills.