Proof design
Objective. Plan lemmas and select proof architecture.
- 1. Learn
- 2. Worked example
- 3. Practice
- 4. Feedback
- 5. Continue
Learn: the key idea
Proof design is the planning stage before writing a proof: choosing an overall architecture (direct argument, contradiction, contrapositive, induction) and identifying the lemmas needed as stepping stones to the main result. For example, to prove √2 is irrational, the architecture of choice is proof by contradiction: assume √2 = p/q in lowest terms, derive that both p and q must be even, contradicting lowest terms. For an induction proof, the design must specify the base case, the inductive hypothesis, and exactly how the inductive step uses that hypothesis, since an incomplete inductive step invalidates the whole argument even if the base case is correct.
Worked example
For a proof design question, which proof architecture is most appropriate for showing that there is no largest prime number?
- Direct computation of all primes
- Proof by contradiction assuming a largest prime exists and constructing a new prime
- Proof by induction on the number of primes
- Proof by exhaustive case checking of small numbers
- 1Consider the structure of the claim: it asserts no finite maximum exists.
- 2Direct computation and case checking cannot cover infinitely many numbers.
- 3Assuming a largest prime p exists and constructing a number with a prime factor greater than p gives a contradiction.
- 4This contradiction architecture is the standard, appropriate proof design for this claim.
Answer: Proof by contradiction assuming a largest prime exists and constructing a new prime
Concept mastery
Based on your past attempts at this lesson — the question types to practise again come first.
Complete a practice set to see your concept breakdown here.
Practice
Practice happens on its own screen, one question at a time. Answers stay hidden until you submit yours, and you can stop and pick up at the same question later.
Start practisingCommon mistake. A common mistake in proof design is choosing induction and writing the inductive step without ever verifying the base case, leaving the argument logically incomplete even though the step itself may be valid.
Your progress
Tick each step as you finish it. Your exact reading position is saved automatically, so Continue drops you back on the same line.
0 of 5 steps complete
Your place saves automatically as you read.