This topic covers the fundamental structure of mathematical proof, requiring students to progress from given assumptions through logical steps to a valid c
Topic Synopsis
This topic covers the fundamental structure of mathematical proof, requiring students to progress from given assumptions through logical steps to a valid conclusion. It includes specific methods such as proof by deduction, proof by exhaustion, disproof by counter-example, and proof by contradiction, with applications including the irrationality of root 2 and the infinity of primes.
Key Concepts & Core Principles
- Direct proof: Starting from known facts or assumptions, use logical steps to derive the desired conclusion. For example, proving that the sum of two even numbers is even.
- Proof by contradiction: Assume the opposite of what you want to prove, then show that this leads to a contradiction. For example, proving that √2 is irrational.
- Proof by exhaustion: Check all possible cases individually. This is useful when the statement can be split into a finite number of cases, such as proving that all integers n satisfy n² ≡ 0 or 1 mod 4.
- Disproof by counterexample: To disprove a statement, find a single example that contradicts it. For instance, to disprove 'all prime numbers are odd', use the counterexample 2.
Exam Tips & Revision Strategies
- Always define your variables clearly at the start of a proof
- If asked to prove a statement is false, look for a counter-example first
- In proof by contradiction, ensure the final step explicitly shows the contradiction with the initial assumption
- Use precise mathematical terminology (e.g., 'integer', 'rational', 'even', 'odd') throughout the argument
Common Misconceptions & Mistakes to Avoid
- Failing to state the assumption clearly in proof by contradiction
- Assuming the result to be proved at the start of the argument
- Using a single example as a proof for a general statement
- Incomplete exhaustion in proof by exhaustion
- Incorrect use of logical connectives or symbols
Examiner Marking Points
- Clear and logical progression of steps from assumption to conclusion
- Correct use of mathematical language and symbols
- Explicit statement of the method of proof being used
- For proof by contradiction, clearly stating the assumption that the opposite is true
- For disproof by counter-example, providing a single specific case that invalidates the statement
- For proof by exhaustion, ensuring all possible cases are covered