Language of Proof (Edexcel A-Level Mathematics): Revision Notes
1.1.1 Language of Proof
Language of Proof
In mathematics, proof is the process of establishing the truth of a statement through logical reasoning. The language of proof is fundamental for you to know for A-Level mathematics, as it is used to validate mathematical statements rigorously.
Key Components of the Language of Proof:
- Statements:
- Theorems: Proven statements that are based on established truths like axioms or other theorems.
- Lemmas: Supporting theorems that assist in proving more significant results.
- Corollaries: Consequences that directly follow from a theorem.
- Conjectures: Statements believed to be true but not yet proven.
- Quantifiers:
- Universal quantifier : Indicates that a statement applies to all elements in a set. For example, "For all in the set of real numbers, "
- Existential quantifier Indicates that there is at least one element in the set for which the statement is true. For example, "There exists an integer such that "
- Proof Techniques:
- Proof by Deduction: Definition: Start from general principles or known facts and logically deduce the statement you want to prove.
Example: Prove that the sum of two odd numbers is even.
- Let and , where and are integers.
- Then, , which is even.
- Proof by Exhaustion: Definition: Prove a statement by considering all possible cases and showing that the statement holds in each case.
Example: Prove that a number less than is either or .
- Consider all integers less than : . In each case, the statement holds.
- Proof by Counterexample: Definition: Disprove a statement by providing a specific example where the statement does not hold.
Example: Disprove the statement "All prime numbers are odd."
- Counterexample: is a prime number and it is even, so the statement is false.
- Proof by Contradiction: Definition: Assume the opposite of what you want to prove, and show that this assumption leads to a contradiction, thereby proving the original statement.
Example: Prove that is irrational.
- Assume is rational, so it can be expressed as in its lowest terms.
- Then , implying , so must be even.
- Let , then implies so must also be even.
- This contradicts the assumption that is in its lowest terms, so is irrational.
Set Notation
- Introduction:
- When dealing with proofs, it is often the case that we need to work within specific sets of numbers.
- Common Sets:
- : Set of natural numbers (all positive integers )
Example:
- : Set of real numbers
- : Set of all integers (positive, negative, and zero)
Example:
- : Set of all rational numbers
Definition: and are integers
- : Set of complex numbers
Definition:
Definition of a Set:
- set is a "bag" containing "things".
- Curved points (braces) indicate a set:
- No repeated items in sets. For example,
{1, 2, 3}is correct, not{1, 2, 2, 3}.
Notation:
- : A set.
- : "is a member of".
- or : An empty set.
- : Union of two sets, combining elements and removing repetitions.
- : Intersection of two sets, elements they have in common.
- : The complement of a set, all items that are not in the set.
Common Sets:
- : Natural numbers .
- : Integers .
- : Natural numbers including .
- : Real numbers.
- : Rational numbers . Note: means "such that" a and b are integers.
Examples:
- List all numbers that are members of the following sets:
- a)
- is less than or equal to , () is a natural number.
- Answer:
- b)
- Find where the two sets overlap.
- Answer:
- c)
- Even numbers in less than or equal to .
- Answer:
Interval Notation
- Purpose: Convenient way of expressing inequalities.
- Symbols:
- Square brackets: Means "can be equal to."
- Round brackets: Means "cannot equal."
Example 1:
-
: All real numbers between and inclusive.
-
Equivalent set notation: Example 2:
-
: All real numbers between and , not included, included.
-
Equivalent set notation:
Incorrect Intervals:
Example 3:
- Issue: Numbers in the wrong order.
Example 4:
- Issue: Nothing can equal infinity.
Past Exam Question:
June 2018, Paper 1, Question 8: "Prove by exhaustion that the function is always positive for integer values of in the set ."
Solution Outline:
- Statement: Evaluate for each value of in the set .
- For , 2.
- For , 2.
- For , 4.
- Conclusion: Since is positive for all values of in the set , the function is always positive. This example demonstrates proof by exhaustion, where all possible cases are checked individually to establish the truth of the statement.