This topic covers the fundamental structure of mathematical proof, requiring students to proceed from given assumptions to a conclusion through logical ste
Topic Synopsis
This topic covers the fundamental structure of mathematical proof, requiring students to proceed from given assumptions to a conclusion through logical steps. 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 √2 and the infinity of primes.
Key Concepts & Core Principles
- Proof by deduction: Start from known facts (e.g., definitions, theorems) and use logical steps to derive the conclusion. Example: Prove that the sum of two even numbers is even.
- Proof by exhaustion: Break the statement into a finite number of cases and check each one. Example: Prove that all integers n satisfy n² ≡ 0 or 1 mod 4.
- Disproof by counterexample: To show a statement is false, provide one example that contradicts it. Example: 'All prime numbers are odd' is false because 2 is prime and even.
- Proof by contradiction: Assume the statement is false, then derive a contradiction with a known fact. Classic examples: √2 is irrational, and there are infinitely many primes.
- Logical structure: Every proof must clearly state assumptions, justify each step (e.g., using algebraic manipulation, definitions), and end with a clear conclusion (e.g., QED or 'therefore the statement is true').
Exam Tips & Revision Strategies
- State the method of proof being used clearly at the start
- Ensure all logical steps are explicitly written out; do not skip steps
- For proof by contradiction, clearly state the assumption that the statement is false
- Check that the conclusion follows directly from the preceding logical steps
- Use precise mathematical language and avoid vague statements
Common Misconceptions & Mistakes to Avoid
- Failing to cover all cases in a proof by exhaustion
- Assuming the result to be proved in a deductive proof
- Incorrectly negating a statement for proof by contradiction
- Providing an example that satisfies the statement instead of a counter-example that disproves it
- Lack of logical connectivity between steps in a proof
Examiner Marking Points
- Clear, logical progression from assumptions to conclusion
- Correct use of mathematical notation and symbols
- Accurate application of the chosen proof method
- For proof by exhaustion, ensuring all cases are covered and verified
- For disproof by counter-example, providing a single case that invalidates the statement
- For proof by contradiction, correctly assuming the negation of the statement and deriving a logical contradiction
- Rigorous mathematical argument construction