Welcome to the World of Proofs!
Welcome to H3 Mathematics! If you’ve ever wondered why a mathematical rule "just works," you’re in the right place. In H2 Maths, we mostly focused on using formulas. In H3, we look under the hood to prove why they are true.
Direct proof is the most fundamental and "honest" way to prove a statement. Think of it like building a sturdy bridge: you start on one side with what you know (the facts), and you lay down one logical plank at a time until you reach the other side (your conclusion). Let’s dive in!
Section 1: What exactly is a Direct Proof?
A direct proof is a way of showing that a statement is true by using a clear chain of logical steps. Most of these statements look like this: "If P, then Q."
- P is your starting point (the hypothesis).
- Q is your destination (the conclusion).
In a direct proof, we assume P is true and use definitions, previously proven theorems, and basic algebra to show that Q must follow.
Analogy: The Recipe
Imagine a recipe says: "If you have flour, water, and yeast (P), then you can make bread (Q)." A direct proof is the step-by-step process of mixing, kneading, and baking that logically leads from the raw ingredients to the final loaf.
Did you know?
The word "Mathematics" comes from the Greek word 'mathema', which means "that which is learnt." Proofs are how we ensure that what we learn is 100% certain, forever!
Section 2: The "Toolbox" (Prerequisite Definitions)
To build a proof, you need "building blocks." In H3 Maths, these blocks are often definitions. Don't worry if these seem simple—writing them down formally is the secret to a great proof!
1. Even Numbers: An integer \( n \) is even if there exists an integer \( k \) such that \( n = 2k \).
2. Odd Numbers: An integer \( n \) is odd if there exists an integer \( k \) such that \( n = 2k + 1 \).
3. Divisibility: We say \( a \) divides \( b \) (written as \( a | b \)) if there is an integer \( k \) such that \( b = ak \).
4. Rational Numbers: A number \( x \) is rational if it can be written as \( x = \frac{p}{q} \) where \( p \) and \( q \) are integers and \( q \neq 0 \).
Quick Tip: Whenever a proof mentions "even," "odd," or "divisible," your first step should almost always be to write down these algebraic definitions!
Section 3: The Step-by-Step Process
Don't worry if you feel stuck at first. Follow these four steps to structure any direct proof:
- Identify: Figure out what is given (P) and what you need to prove (Q).
- Assume: Start your proof by saying: "Assume P is true."
- Apply Definitions: Convert the words in P into math equations (like \( n = 2k \)).
- Logical Chain: Use algebra or logic to manipulate your equations until they look like the definition of Q.
- Conclude: State clearly that you have reached Q.
Memory Aid: THE LADDER
Imagine a ladder. The top is your conclusion. You can't jump to the top! You must step on every rung (logical step) one by one. If a rung is missing, the proof fails.
Section 4: A Concrete Example
Let’s prove a classic: "If \( n \) is an odd integer, then \( n^2 \) is an odd integer."
Step 1: The Assumption
Assume \( n \) is an odd integer.
Step 2: Use the Definition
By the definition of an odd number, \( n = 2k + 1 \) for some integer \( k \).
Step 3: Logical Manipulation (The Algebra)
We want to find out about \( n^2 \), so let's square our expression:
\( n^2 = (2k + 1)^2 \)
\( n^2 = 4k^2 + 4k + 1 \)
Now, we want to show this is "odd." Remember, "odd" means 2 times (something) + 1.
\( n^2 = 2(2k^2 + 2k) + 1 \)
Step 4: Conclusion
Since \( k \) is an integer, \( m = 2k^2 + 2k \) is also an integer.
Therefore, \( n^2 = 2m + 1 \), which fits the definition of an odd number.
Thus, \( n^2 \) is odd. (Done!)
Section 5: Common Pitfalls to Avoid
Even the best students can fall into these traps. Keep an eye out for them!
- Circular Reasoning: Using the conclusion to prove the conclusion. (e.g., You can't say "\( n^2 \) is odd because \( n \) is odd.")
- The "Example" Trap: Showing that \( 3^2 = 9 \) (which is odd) is not a proof. A proof must work for all numbers, not just one or two. This is what the "For all" (\(\forall\)) quantifier in your syllabus refers to!
- Vague Logic: Jumping from \( 4k^2 + 4k + 1 \) to "it's odd" without showing the \( 2(\dots) + 1 \) step. Be explicit!
Encouraging Note: Proofs are like a new language. You might feel a bit "clunky" writing them at first, but with practice, the logic will start to feel like second nature.
Section 6: Quick Review Box
Key Takeaways
1. Direct Proof: Moves from "If P" to "Then Q" via logical steps.
2. Use Definitions: Always translate words (odd, even, divisible) into algebra early on.
3. Integer Property: In your proof, always state that your new variables (like \( k \) or \( m \)) are integers.
4. Structure: Start with "Assume..." and end with "Therefore...".
Section 7: Summary of Mathematical Statements
As per your syllabus, remember these terms used in direct proofs:
- Axiom: A starting statement assumed to be true without proof (like "1 + 1 = 2").
- Theorem: A big, important statement that has been proven true.
- Proposition: A smaller statement or "mini-theorem."
- Corollary: A statement that follows immediately from a theorem you just proved.
In the next chapter, we will look at what happens when a direct proof isn't easy to find, and we have to use "Proof by Contradiction"!