Proof
Proof
You may be asked to prove something in mathematics. There are a number of different types of proof questions that you will encounter.
There are 4 skills for proof that you need to understand.
Skill 1: Proof Notation
The following notation will be used throughout proofs, but will also be relevant to topics later in the course.
A set is a collection of objects or numbers (called elements). A set is denoted using a capital letter, and curly brackets are used to show what is in the set, e.g. .
You can write sets in various different ways:
- as a list of elements: e.g.
- as a rule: e.g.
- as mathematical notation: e.g. – this means “the set of values such that is greater than ”
There are different variations of an sign that you need to be aware of:
- means “not equal to”
- means “approximately equal to”
- means two things are “equivalent”. It is called the identity symbol.
There are logic symbols that you need to understand:
- “” means “if then ” or “ implies ”
- “” means “ if and only if ” or “ implies and implies ”
Note: “if and only if” can be written as “iff”
Skill 2: Direct Proof
A direct proof (or proof by deduction) is a proof where a statement is proven to be true using fundamental mathematical principles.
Example: Prove that is positive for any integer.
Completing the square gives
is always positive, since it is a square number.
Therefore, if we add to the square number, then the result is still positive.
Hence, is positive for any integer.
Skill 3: Proof by Exhaustion
In a proof by exhaustion, you will need to break situations down into two or more cases and try all possibilities to prove that the statement holds true for each case.
Example: Prove the following statement:
“For any integer , is an even integer”
We need to split the statement into two cases: if is an even number, or if is an odd number.
Case 1: If is even, then for some integer .
Then,
is an integer, therefore is an integer.
Hence, is an even integer.
So, is even when is even.
Case 2: If is an odd number, then for some integer .
Then,
is an integer, therefore is an integer.
Hence, is an even integer.
So, is even when is odd.
Hence, is even for any integer , and the statement is true.
Skill 4: Disproof by Counter-Example
To disprove a statement by a counter-example, all you need to do is show that the statement is false for one case.
Example: Disprove the following statement:
“For any pair of real numbers and , if then ”
We only need to find one set of values such that the statement is false.
For example, take and
Then,
and
So,
However, , and so the statement is not true.
Proof Example Questions
Question 1: Write out the following sets as lists of elements:
a)
b)
[2 marks]
Question 2: Is the following statement true or not?
“For any pair of real numbers and , ”
Give either a proof or a counter-example.
[3 marks]
We only need to give one case for a counter-example, if it is false.
The only case in which the statement isn’t true is when and . This gives , and clearly is not greater than
Question 3: Prove that the sum of two rational numbers is rational.
[4 marks]
Take any two rational numbers, and call them and
By definition of rational numbers, can be written in the form and , where and are not .
Then either:
if the denominators are the same
if the denominators are different
, and are all products of integers, so they must also be integers.
and are all sums of integers, so they must also be integers.
Since and are both non-zero, must also be non-zero.
Hence, and are rational numbers.
Therefore, must be rational.
So, the statement is true.
Question 4: Prove that the sum of any consecutive even numbers is always a divisible by .
[3 marks]
By definition, three consecutive even numbers are and .
Adding them together gives,
is an integer, so is divisible by
Question 5: Prove that , for all integers in the interval
[2 marks]
We need to prove by exhaustion that the statement is true for all integers in the interval
:
:
:
:
Hence, the statement is true.
Specification Points Covered
A1 – Understand and use the structure of mathematical proof, proceeding from given assumptions through a series of logical steps to a conclusion; use methods of proof, including proof by deduction, proof by exhaustion]
Disproof by counter example
Proof by contradiction (including proof of the irrationality of and the infinity of primes, and application to unfamiliar proofs)