This topic covers the fundamental structure of mathematical proof, requiring students to proceed from given assumptions through logical steps to a conclusi
Topic Synopsis
This topic covers the fundamental structure of mathematical proof, requiring students to proceed from given assumptions through logical steps to a conclusion. It specifically includes proof by deduction, proof by exhaustion, and disproof by counter-example, with a specific requirement to prove the laws of logarithms.
Key Concepts & Core Principles
- Direct proof: Start from known facts or assumptions and use logical steps to reach the 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. Classic example: proving √2 is irrational.
- Proof by exhaustion: Check all possible cases individually. This is used when the statement can be split into a finite number of cases, e.g., proving that all integers from 1 to 10 satisfy a property.
- Proof by counterexample: To disprove a statement, find a single example where it fails. For instance, to disprove 'all prime numbers are odd', use the counterexample 2.
- Proof by induction: Used for statements involving natural numbers. Show the base case (e.g., n=1) is true, then assume true for n=k and prove it for n=k+1. Common in sequences and divisibility.
Exam Tips & Revision Strategies
- Ensure every step of a deductive proof is justified by a previous statement or definition
- When using disproof by counter-example, a single specific case that contradicts the statement is sufficient
- For proof by exhaustion, ensure you have explicitly listed all possible cases and verified each one
- Practice the formal proof of the laws of logarithms as this is explicitly mentioned in the guidance
- Use precise mathematical language; avoid vague or colloquial explanations
Common Misconceptions & Mistakes to Avoid
- Failing to state assumptions clearly at the start of a proof
- Using examples to 'prove' a general statement instead of using algebraic deduction
- Incomplete exhaustion in proof by exhaustion (missing cases)
- Incorrect use of logical symbols or connecting language
- Assuming the result to be proved as part of the working
Examiner Marking Points
- Clear logical progression from assumptions to conclusion
- Correct use of mathematical notation and connecting language
- Accurate application of proof by deduction for laws of logarithms
- Correct identification of counter-examples for disproof
- Systematic coverage of all cases in proof by exhaustion