This an animated slides for teachers. Introduce basis concept of proofs to students. Direct proofs. Please search for slides Proof methods-students. Which is suitable for students.
1. Section 4: Proof methods
SQU-Math2350
Dr. Yassir Dinar
Sultan Qaboos University
Department of Mathematics
Math2350: Foundation of Mathematics
Fall 2019
SQU-Math2350 Section 4: Proof methods Fall 2019 1 / 15
2. Structure of Mathematics: Informal definitions
SQU-Math2350 Section 4: Proof methods Fall 2019 2 / 15
3. Structure of Mathematics: Informal definitions
Definition 4.1
Undefined terms are known concepts fundamentals to the context of
study which are not defined formally.
SQU-Math2350 Section 4: Proof methods Fall 2019 2 / 15
4. Structure of Mathematics: Informal definitions
Definition 4.1
Undefined terms are known concepts fundamentals to the context of
study which are not defined formally.
Example 4.2
In this course undefined concepts include natural, integers and real numbers.
They are known but are undefined formally.
SQU-Math2350 Section 4: Proof methods Fall 2019 2 / 15
6. Axioms
Definition 4.3
Axioms or postulates are statements and propositions that are
assumed to be true.
Example 4.4
In this course must properties of natural, integer and real numbers are assumed to
be true like
SQU-Math2350 Section 4: Proof methods Fall 2019 3 / 15
7. Axioms
Definition 4.3
Axioms or postulates are statements and propositions that are
assumed to be true.
Example 4.4
In this course must properties of natural, integer and real numbers are assumed to
be true like
1 The product and sum of integers is an integer.
SQU-Math2350 Section 4: Proof methods Fall 2019 3 / 15
8. Axioms
Definition 4.3
Axioms or postulates are statements and propositions that are
assumed to be true.
Example 4.4
In this course must properties of natural, integer and real numbers are assumed to
be true like
1 The product and sum of integers is an integer.
2 Let a,b be real numbers. If ab = 0 then a = 0 or b = 0.
SQU-Math2350 Section 4: Proof methods Fall 2019 3 / 15
9. Axioms
Definition 4.3
Axioms or postulates are statements and propositions that are
assumed to be true.
Example 4.4
In this course must properties of natural, integer and real numbers are assumed to
be true like
1 The product and sum of integers is an integer.
2 Let a,b be real numbers. If ab = 0 then a = 0 or b = 0.
3 Let a,b and c be real numbers and c > 0. Then ac > bc if and only if a > b.
SQU-Math2350 Section 4: Proof methods Fall 2019 3 / 15
10. Axioms
Definition 4.3
Axioms or postulates are statements and propositions that are
assumed to be true.
Example 4.4
In this course must properties of natural, integer and real numbers are assumed to
be true like
1 The product and sum of integers is an integer.
2 Let a,b be real numbers. If ab = 0 then a = 0 or b = 0.
3 Let a,b and c be real numbers and c > 0. Then ac > bc if and only if a > b.
4 All properties in the appedix II of the reference book are assumed to be true.
SQU-Math2350 Section 4: Proof methods Fall 2019 3 / 15
12. Definitions
Definition 4.5
A definition is used to introduce new concepts using axioms and undefined
terms.
SQU-Math2350 Section 4: Proof methods Fall 2019 4 / 15
13. Definitions
Definition 4.5
A definition is used to introduce new concepts using axioms and undefined
terms.
Example 4.6
Here are examples of new concepts introduced earlier
SQU-Math2350 Section 4: Proof methods Fall 2019 4 / 15
14. Definitions
Definition 4.5
A definition is used to introduce new concepts using axioms and undefined
terms.
Example 4.6
Here are examples of new concepts introduced earlier
1 Divisibility on the set of integers.
SQU-Math2350 Section 4: Proof methods Fall 2019 4 / 15
15. Definitions
Definition 4.5
A definition is used to introduce new concepts using axioms and undefined
terms.
Example 4.6
Here are examples of new concepts introduced earlier
1 Divisibility on the set of integers.
2 Prime and composite numbers in N.
SQU-Math2350 Section 4: Proof methods Fall 2019 4 / 15
16. Definitions
Definition 4.5
A definition is used to introduce new concepts using axioms and undefined
terms.
Example 4.6
Here are examples of new concepts introduced earlier
1 Divisibility on the set of integers.
2 Prime and composite numbers in N.
3 Even and odd integers.
SQU-Math2350 Section 4: Proof methods Fall 2019 4 / 15
17. Definitions
Definition 4.5
A definition is used to introduce new concepts using axioms and undefined
terms.
Example 4.6
Here are examples of new concepts introduced earlier
1 Divisibility on the set of integers.
2 Prime and composite numbers in N.
3 Even and odd integers.
4 Rational and irrational numbers in R.
SQU-Math2350 Section 4: Proof methods Fall 2019 4 / 15
18. Definitions
Definition 4.5
A definition is used to introduce new concepts using axioms and undefined
terms.
Example 4.6
Here are examples of new concepts introduced earlier
1 Divisibility on the set of integers.
2 Prime and composite numbers in N.
3 Even and odd integers.
4 Rational and irrational numbers in R.
5 Continuous functions on the set of real functions.
SQU-Math2350 Section 4: Proof methods Fall 2019 4 / 15
20. Theorems and Proofs
Definition 4.7
A theorem is a proposition that describes a pattern or relationship
among quantities or structures which can be proved to be true by using
principles of logic.
SQU-Math2350 Section 4: Proof methods Fall 2019 5 / 15
21. Theorems and Proofs
Definition 4.7
A theorem is a proposition that describes a pattern or relationship
among quantities or structures which can be proved to be true by using
principles of logic.A proof of a theorem is a justification of the truth of
the theorem that follow the principle of logic.
Example 4.8
This course gives tools to prove statements like:
SQU-Math2350 Section 4: Proof methods Fall 2019 5 / 15
22. Theorems and Proofs
Definition 4.7
A theorem is a proposition that describes a pattern or relationship
among quantities or structures which can be proved to be true by using
principles of logic.A proof of a theorem is a justification of the truth of
the theorem that follow the principle of logic.
Example 4.8
This course gives tools to prove statements like:
1 Let a and b be two integers: if a and b are even then a + b is even.
SQU-Math2350 Section 4: Proof methods Fall 2019 5 / 15
23. Theorems and Proofs
Definition 4.7
A theorem is a proposition that describes a pattern or relationship
among quantities or structures which can be proved to be true by using
principles of logic.A proof of a theorem is a justification of the truth of
the theorem that follow the principle of logic.
Example 4.8
This course gives tools to prove statements like:
1 Let a and b be two integers: if a and b are even then a + b is even.
2 There exist a real number x such that x4
− 4x + 2 = 0.
SQU-Math2350 Section 4: Proof methods Fall 2019 5 / 15
24. Theorems and Proofs
Definition 4.7
A theorem is a proposition that describes a pattern or relationship
among quantities or structures which can be proved to be true by using
principles of logic.A proof of a theorem is a justification of the truth of
the theorem that follow the principle of logic.
Example 4.8
This course gives tools to prove statements like:
1 Let a and b be two integers: if a and b are even then a + b is even.
2 There exist a real number x such that x4
− 4x + 2 = 0.
3 Let a and b be two integers: ab is even if and only if a is even or b is even.
SQU-Math2350 Section 4: Proof methods Fall 2019 5 / 15
25. Theorems and Proofs
Definition 4.7
A theorem is a proposition that describes a pattern or relationship
among quantities or structures which can be proved to be true by using
principles of logic.A proof of a theorem is a justification of the truth of
the theorem that follow the principle of logic.
Example 4.8
This course gives tools to prove statements like:
1 Let a and b be two integers: if a and b are even then a + b is even.
2 There exist a real number x such that x4
− 4x + 2 = 0.
3 Let a and b be two integers: ab is even if and only if a is even or b is even.
4 Product of rational and irrational numbers are irrational.
SQU-Math2350 Section 4: Proof methods Fall 2019 5 / 15
26. Theorems and Proofs
Definition 4.7
A theorem is a proposition that describes a pattern or relationship
among quantities or structures which can be proved to be true by using
principles of logic.A proof of a theorem is a justification of the truth of
the theorem that follow the principle of logic.
Example 4.8
This course gives tools to prove statements like:
1 Let a and b be two integers: if a and b are even then a + b is even.
2 There exist a real number x such that x4
− 4x + 2 = 0.
3 Let a and b be two integers: ab is even if and only if a is even or b is even.
4 Product of rational and irrational numbers are irrational.
5 Let x and y be positive real numbers such that x − 4y < y − 3x. Prove that
if 3x > 2y then 12x2
+ 10y2
< 24xy.
SQU-Math2350 Section 4: Proof methods Fall 2019 5 / 15
27. Theorems and Proofs
Definition 4.7
A theorem is a proposition that describes a pattern or relationship
among quantities or structures which can be proved to be true by using
principles of logic.A proof of a theorem is a justification of the truth of
the theorem that follow the principle of logic.
Example 4.8
This course gives tools to prove statements like:
1 Let a and b be two integers: if a and b are even then a + b is even.
2 There exist a real number x such that x4
− 4x + 2 = 0.
3 Let a and b be two integers: ab is even if and only if a is even or b is even.
4 Product of rational and irrational numbers are irrational.
5 Let x and y be positive real numbers such that x − 4y < y − 3x. Prove that
if 3x > 2y then 12x2
+ 10y2
< 24xy.
6
√
2 is irrational number.
SQU-Math2350 Section 4: Proof methods Fall 2019 5 / 15
28. Modus Ponens
One of the basic tools in proofs
SQU-Math2350 Section 4: Proof methods Fall 2019 6 / 15
29. Modus Ponens
One of the basic tools in proofs
Definition 4.9
Modus ponens rule states that when both proposition P and P ⇒ Q are
true then Q must be true.
SQU-Math2350 Section 4: Proof methods Fall 2019 6 / 15
30. Modus Ponens
One of the basic tools in proofs
Definition 4.9
Modus ponens rule states that when both proposition P and P ⇒ Q are
true then Q must be true.
Proof.
From the truth table of conditional statement when P is true, then
P ⇒ Q is true only when Q is true.
SQU-Math2350 Section 4: Proof methods Fall 2019 6 / 15
31. Modus Ponens
One of the basic tools in proofs
Definition 4.9
Modus ponens rule states that when both proposition P and P ⇒ Q are
true then Q must be true.
Proof.
From the truth table of conditional statement when P is true, then
P ⇒ Q is true only when Q is true.
Example 4.10
Let n, m be integers. Show that 3n − 7m is an integer.
SQU-Math2350 Section 4: Proof methods Fall 2019 6 / 15
32. Modus Ponens
One of the basic tools in proofs
Definition 4.9
Modus ponens rule states that when both proposition P and P ⇒ Q are
true then Q must be true.
Proof.
From the truth table of conditional statement when P is true, then
P ⇒ Q is true only when Q is true.
Example 4.10
Let n, m be integers. Show that 3n − 7m is an integer.
Solution.
It is known that sum and product of integers is an integer.
SQU-Math2350 Section 4: Proof methods Fall 2019 6 / 15
33. Modus Ponens
One of the basic tools in proofs
Definition 4.9
Modus ponens rule states that when both proposition P and P ⇒ Q are
true then Q must be true.
Proof.
From the truth table of conditional statement when P is true, then
P ⇒ Q is true only when Q is true.
Example 4.10
Let n, m be integers. Show that 3n − 7m is an integer.
Solution.
It is known that sum and product of integers is an integer. Since m and n
are integers.
SQU-Math2350 Section 4: Proof methods Fall 2019 6 / 15
34. Modus Ponens
One of the basic tools in proofs
Definition 4.9
Modus ponens rule states that when both proposition P and P ⇒ Q are
true then Q must be true.
Proof.
From the truth table of conditional statement when P is true, then
P ⇒ Q is true only when Q is true.
Example 4.10
Let n, m be integers. Show that 3n − 7m is an integer.
Solution.
It is known that sum and product of integers is an integer. Since m and n
are integers. then 3n − 7m is an integer (by modus ponens).
SQU-Math2350 Section 4: Proof methods Fall 2019 6 / 15
36. Direct Proof
One of the basic proofs methods for statement having the proposition
form P ⇒ Q.
SQU-Math2350 Section 4: Proof methods Fall 2019 7 / 15
37. Direct Proof
One of the basic proofs methods for statement having the proposition
form P ⇒ Q.
Direct Proof of P ⇒ Q.
Assume P.
SQU-Math2350 Section 4: Proof methods Fall 2019 7 / 15
38. Direct Proof
One of the basic proofs methods for statement having the proposition
form P ⇒ Q.
Direct Proof of P ⇒ Q.
Assume P.
{Use definitions, axioms, properties,algebraic manipulation,
principles of logic, mathematical tricks, etc...}
SQU-Math2350 Section 4: Proof methods Fall 2019 7 / 15
39. Direct Proof
One of the basic proofs methods for statement having the proposition
form P ⇒ Q.
Direct Proof of P ⇒ Q.
Assume P.
{Use definitions, axioms, properties,algebraic manipulation,
principles of logic, mathematical tricks, etc...}
Therefore Q,
Thus, P ⇒ Q.
SQU-Math2350 Section 4: Proof methods Fall 2019 7 / 15
40. Examples of Direct Proof I
SQU-Math2350 Section 4: Proof methods Fall 2019 8 / 15
41. Examples of Direct Proof I
Example 4.11
Let x be an integer. Prove that if x is odd, then x + 1 is even.
SQU-Math2350 Section 4: Proof methods Fall 2019 8 / 15
42. Examples of Direct Proof I
Example 4.11
Let x be an integer. Prove that if x is odd, then x + 1 is even.
Solution.
SQU-Math2350 Section 4: Proof methods Fall 2019 8 / 15
43. Examples of Direct Proof I
Example 4.11
Let x be an integer. Prove that if x is odd, then x + 1 is even.
Solution.
Let x be an integer. Suppose x is odd.
SQU-Math2350 Section 4: Proof methods Fall 2019 8 / 15
44. Examples of Direct Proof I
Example 4.11
Let x be an integer. Prove that if x is odd, then x + 1 is even.
Solution.
Let x be an integer. Suppose x is odd.Then, by definition, x = 2k + 1 for
some integer k.
SQU-Math2350 Section 4: Proof methods Fall 2019 8 / 15
45. Examples of Direct Proof I
Example 4.11
Let x be an integer. Prove that if x is odd, then x + 1 is even.
Solution.
Let x be an integer. Suppose x is odd.Then, by definition, x = 2k + 1 for
some integer k.
x + 1 = (2k + 1) + 1 = 2k + 2 = 2(k + 1).
SQU-Math2350 Section 4: Proof methods Fall 2019 8 / 15
46. Examples of Direct Proof I
Example 4.11
Let x be an integer. Prove that if x is odd, then x + 1 is even.
Solution.
Let x be an integer. Suppose x is odd.Then, by definition, x = 2k + 1 for
some integer k.
x + 1 = (2k + 1) + 1 = 2k + 2 = 2(k + 1).
Since k is an integer. Then k + 1 is an integer.
SQU-Math2350 Section 4: Proof methods Fall 2019 8 / 15
47. Examples of Direct Proof I
Example 4.11
Let x be an integer. Prove that if x is odd, then x + 1 is even.
Solution.
Let x be an integer. Suppose x is odd.Then, by definition, x = 2k + 1 for
some integer k.
x + 1 = (2k + 1) + 1 = 2k + 2 = 2(k + 1).
Since k is an integer. Then k + 1 is an integer. Then x + 1 is a product of
2 and the integer k + 1. Then, by definition, x + 1 is even.
SQU-Math2350 Section 4: Proof methods Fall 2019 8 / 15
48. Examples of Direct Proof I
Example 4.11
Let x be an integer. Prove that if x is odd, then x + 1 is even.
Solution.
Let x be an integer. Suppose x is odd.Then, by definition, x = 2k + 1 for
some integer k.
x + 1 = (2k + 1) + 1 = 2k + 2 = 2(k + 1).
Since k is an integer. Then k + 1 is an integer. Then x + 1 is a product of
2 and the integer k + 1. Then, by definition, x + 1 is even.Therefore, if x
is odd, then x + 1 is even.
SQU-Math2350 Section 4: Proof methods Fall 2019 8 / 15
49. Examples of Direct Proof II
SQU-Math2350 Section 4: Proof methods Fall 2019 9 / 15
50. Examples of Direct Proof II
Example 4.12
Let a, b and c be integers. If a divides b and b divides c, then a divides c.
SQU-Math2350 Section 4: Proof methods Fall 2019 9 / 15
51. Examples of Direct Proof II
Example 4.12
Let a, b and c be integers. If a divides b and b divides c, then a divides c.
Solution.
Let a, b and c be integers. Suppose a divides b and b divides c.
SQU-Math2350 Section 4: Proof methods Fall 2019 9 / 15
52. Examples of Direct Proof II
Example 4.12
Let a, b and c be integers. If a divides b and b divides c, then a divides c.
Solution.
Let a, b and c be integers. Suppose a divides b and b divides c. Then, by
definition, b = ak for some integer k and c = bm for some integer m.
SQU-Math2350 Section 4: Proof methods Fall 2019 9 / 15
53. Examples of Direct Proof II
Example 4.12
Let a, b and c be integers. If a divides b and b divides c, then a divides c.
Solution.
Let a, b and c be integers. Suppose a divides b and b divides c. Then, by
definition, b = ak for some integer k and c = bm for some integer m. Then
c = bm = (ak)m = a(km).
SQU-Math2350 Section 4: Proof methods Fall 2019 9 / 15
54. Examples of Direct Proof II
Example 4.12
Let a, b and c be integers. If a divides b and b divides c, then a divides c.
Solution.
Let a, b and c be integers. Suppose a divides b and b divides c. Then, by
definition, b = ak for some integer k and c = bm for some integer m. Then
c = bm = (ak)m = a(km).
Since k and m are integers, km is an integer. Then, by definition, a
divides c.
SQU-Math2350 Section 4: Proof methods Fall 2019 9 / 15
55. Examples of Direct Proof II
Example 4.12
Let a, b and c be integers. If a divides b and b divides c, then a divides c.
Solution.
Let a, b and c be integers. Suppose a divides b and b divides c. Then, by
definition, b = ak for some integer k and c = bm for some integer m. Then
c = bm = (ak)m = a(km).
Since k and m are integers, km is an integer. Then, by definition, a
divides c. Therefore, If a divides b and b divides c, then a divides c.
SQU-Math2350 Section 4: Proof methods Fall 2019 9 / 15
56. Examples of Direct Proof III, (Working Backward)
SQU-Math2350 Section 4: Proof methods Fall 2019 10 / 15
57. Examples of Direct Proof III, (Working Backward)
Example 4.13
Prove that if x2
≤ 1, then x2
− 7x > −10.
SQU-Math2350 Section 4: Proof methods Fall 2019 10 / 15
58. Examples of Direct Proof III, (Working Backward)
Example 4.13
Prove that if x2
≤ 1, then x2
− 7x > −10.
Note that form the context , x is a real number.
SQU-Math2350 Section 4: Proof methods Fall 2019 10 / 15
59. Examples of Direct Proof III, (Working Backward)
Example 4.13
Prove that if x2
≤ 1, then x2
− 7x > −10.
Note that form the context , x is a real number.
Working Backward:
SQU-Math2350 Section 4: Proof methods Fall 2019 10 / 15
60. Examples of Direct Proof III, (Working Backward)
Example 4.13
Prove that if x2
≤ 1, then x2
− 7x > −10.
Note that form the context , x is a real number.
Working Backward:
x2
− 7x > 10 ⇔ x2
− 7x − 10 > 0 ⇔ (x − 5)(x − 2) > 0
SQU-Math2350 Section 4: Proof methods Fall 2019 10 / 15
61. Examples of Direct Proof III, (Working Backward)
Example 4.13
Prove that if x2
≤ 1, then x2
− 7x > −10.
Note that form the context , x is a real number.
Working Backward:
x2
− 7x > 10 ⇔ x2
− 7x − 10 > 0 ⇔ (x − 5)(x − 2) > 0
Now (x − 5)(x − 2) > 0 if both (x − 5) and (x − 2) are positive or both
are negative.
SQU-Math2350 Section 4: Proof methods Fall 2019 10 / 15
62. Examples of Direct Proof III, (Working Backward)
Example 4.13
Prove that if x2
≤ 1, then x2
− 7x > −10.
Note that form the context , x is a real number.
Working Backward:
x2
− 7x > 10 ⇔ x2
− 7x − 10 > 0 ⇔ (x − 5)(x − 2) > 0
Now (x − 5)(x − 2) > 0 if both (x − 5) and (x − 2) are positive or both
are negative.
x2
≤ 1 ⇒ −1 ≤ x ≤ 1 ⇒ x ≤ 1 ⇒ x < 2 ∧ x < 5
⇒ [(x − 2) < 0] ∧ [(x − 5) < 0].
SQU-Math2350 Section 4: Proof methods Fall 2019 10 / 15
63. Examples of Direct Proof III, (Working Backward)
Example 4.13
Prove that if x2
≤ 1, then x2
− 7x > −10.
Note that form the context , x is a real number.
Working Backward:
x2
− 7x > 10 ⇔ x2
− 7x − 10 > 0 ⇔ (x − 5)(x − 2) > 0
Now (x − 5)(x − 2) > 0 if both (x − 5) and (x − 2) are positive or both
are negative.
x2
≤ 1 ⇒ −1 ≤ x ≤ 1 ⇒ x ≤ 1 ⇒ x < 2 ∧ x < 5
⇒ [(x − 2) < 0] ∧ [(x − 5) < 0].
Solution.
Assume x2 ≤ 1 .
SQU-Math2350 Section 4: Proof methods Fall 2019 10 / 15
64. Examples of Direct Proof III, (Working Backward)
Example 4.13
Prove that if x2
≤ 1, then x2
− 7x > −10.
Note that form the context , x is a real number.
Working Backward:
x2
− 7x > 10 ⇔ x2
− 7x − 10 > 0 ⇔ (x − 5)(x − 2) > 0
Now (x − 5)(x − 2) > 0 if both (x − 5) and (x − 2) are positive or both
are negative.
x2
≤ 1 ⇒ −1 ≤ x ≤ 1 ⇒ x ≤ 1 ⇒ x < 2 ∧ x < 5
⇒ [(x − 2) < 0] ∧ [(x − 5) < 0].
Solution.
Assume x2 ≤ 1 . Then −1 ≤ x ≤ 1. Then x ≤ 1.
SQU-Math2350 Section 4: Proof methods Fall 2019 10 / 15
65. Examples of Direct Proof III, (Working Backward)
Example 4.13
Prove that if x2
≤ 1, then x2
− 7x > −10.
Note that form the context , x is a real number.
Working Backward:
x2
− 7x > 10 ⇔ x2
− 7x − 10 > 0 ⇔ (x − 5)(x − 2) > 0
Now (x − 5)(x − 2) > 0 if both (x − 5) and (x − 2) are positive or both
are negative.
x2
≤ 1 ⇒ −1 ≤ x ≤ 1 ⇒ x ≤ 1 ⇒ x < 2 ∧ x < 5
⇒ [(x − 2) < 0] ∧ [(x − 5) < 0].
Solution.
Assume x2 ≤ 1 . Then −1 ≤ x ≤ 1. Then x ≤ 1.Thus x < 2 and x < 5,
and so (x − 2) < 0 and (x − 5) < 0.
SQU-Math2350 Section 4: Proof methods Fall 2019 10 / 15
66. Examples of Direct Proof III, (Working Backward)
Example 4.13
Prove that if x2
≤ 1, then x2
− 7x > −10.
Note that form the context , x is a real number.
Working Backward:
x2
− 7x > 10 ⇔ x2
− 7x − 10 > 0 ⇔ (x − 5)(x − 2) > 0
Now (x − 5)(x − 2) > 0 if both (x − 5) and (x − 2) are positive or both
are negative.
x2
≤ 1 ⇒ −1 ≤ x ≤ 1 ⇒ x ≤ 1 ⇒ x < 2 ∧ x < 5
⇒ [(x − 2) < 0] ∧ [(x − 5) < 0].
Solution.
Assume x2 ≤ 1 . Then −1 ≤ x ≤ 1. Then x ≤ 1.Thus x < 2 and x < 5,
and so (x − 2) < 0 and (x − 5) < 0. Then,
(x − 5)(x − 2) = x2 − 7x − 10 > 0. Therefore, x2 − 7x > 10 .
SQU-Math2350 Section 4: Proof methods Fall 2019 10 / 15
67. Examples of Direct Proof IV (by Exhaustion)
A proof by exhaustion consists of an examination of every possible case.
SQU-Math2350 Section 4: Proof methods Fall 2019 11 / 15
68. Examples of Direct Proof IV (by Exhaustion)
A proof by exhaustion consists of an examination of every possible case.
Example 4.14
If the statement contains |x|, then two cases can be considered, x ≥ 0 which
implies |x| = x or x < 0 which implies |x| = −x.
SQU-Math2350 Section 4: Proof methods Fall 2019 11 / 15
69. Examples of Direct Proof IV (by Exhaustion)
A proof by exhaustion consists of an examination of every possible case.
Example 4.14
If the statement contains |x|, then two cases can be considered, x ≥ 0 which
implies |x| = x or x < 0 which implies |x| = −x.
Example 4.15
Let x be a real number. Prove that −|x| ≤ x ≤ |x|.
SQU-Math2350 Section 4: Proof methods Fall 2019 11 / 15
70. Examples of Direct Proof IV (by Exhaustion)
A proof by exhaustion consists of an examination of every possible case.
Example 4.14
If the statement contains |x|, then two cases can be considered, x ≥ 0 which
implies |x| = x or x < 0 which implies |x| = −x.
Example 4.15
Let x be a real number. Prove that −|x| ≤ x ≤ |x|.
Solution.
Let x be a real number:
SQU-Math2350 Section 4: Proof methods Fall 2019 11 / 15
71. Examples of Direct Proof IV (by Exhaustion)
A proof by exhaustion consists of an examination of every possible case.
Example 4.14
If the statement contains |x|, then two cases can be considered, x ≥ 0 which
implies |x| = x or x < 0 which implies |x| = −x.
Example 4.15
Let x be a real number. Prove that −|x| ≤ x ≤ |x|.
Solution.
Let x be a real number:
Case 1: Suppose x ≥ 0. Then |x| = x.
SQU-Math2350 Section 4: Proof methods Fall 2019 11 / 15
72. Examples of Direct Proof IV (by Exhaustion)
A proof by exhaustion consists of an examination of every possible case.
Example 4.14
If the statement contains |x|, then two cases can be considered, x ≥ 0 which
implies |x| = x or x < 0 which implies |x| = −x.
Example 4.15
Let x be a real number. Prove that −|x| ≤ x ≤ |x|.
Solution.
Let x be a real number:
Case 1: Suppose x ≥ 0. Then |x| = x.
SQU-Math2350 Section 4: Proof methods Fall 2019 11 / 15
73. Examples of Direct Proof IV (by Exhaustion)
A proof by exhaustion consists of an examination of every possible case.
Example 4.14
If the statement contains |x|, then two cases can be considered, x ≥ 0 which
implies |x| = x or x < 0 which implies |x| = −x.
Example 4.15
Let x be a real number. Prove that −|x| ≤ x ≤ |x|.
Solution.
Let x be a real number:
Case 1: Suppose x ≥ 0. Then |x| = x. Since x ≥ 0, −x ≤ x.
SQU-Math2350 Section 4: Proof methods Fall 2019 11 / 15
74. Examples of Direct Proof IV (by Exhaustion)
A proof by exhaustion consists of an examination of every possible case.
Example 4.14
If the statement contains |x|, then two cases can be considered, x ≥ 0 which
implies |x| = x or x < 0 which implies |x| = −x.
Example 4.15
Let x be a real number. Prove that −|x| ≤ x ≤ |x|.
Solution.
Let x be a real number:
Case 1: Suppose x ≥ 0. Then |x| = x. Since x ≥ 0, −x ≤ x. Hence
−x ≤ x ≤ x which is −|x| ≤ x ≤ |x|.
SQU-Math2350 Section 4: Proof methods Fall 2019 11 / 15
75. Examples of Direct Proof IV (by Exhaustion)
A proof by exhaustion consists of an examination of every possible case.
Example 4.14
If the statement contains |x|, then two cases can be considered, x ≥ 0 which
implies |x| = x or x < 0 which implies |x| = −x.
Example 4.15
Let x be a real number. Prove that −|x| ≤ x ≤ |x|.
Solution.
Let x be a real number:
Case 1: Suppose x ≥ 0. Then |x| = x. Since x ≥ 0, −x ≤ x. Hence
−x ≤ x ≤ x which is −|x| ≤ x ≤ |x|.
Case 2: Suppose x < 0. Then |x| = −x.
SQU-Math2350 Section 4: Proof methods Fall 2019 11 / 15
76. Examples of Direct Proof IV (by Exhaustion)
A proof by exhaustion consists of an examination of every possible case.
Example 4.14
If the statement contains |x|, then two cases can be considered, x ≥ 0 which
implies |x| = x or x < 0 which implies |x| = −x.
Example 4.15
Let x be a real number. Prove that −|x| ≤ x ≤ |x|.
Solution.
Let x be a real number:
Case 1: Suppose x ≥ 0. Then |x| = x. Since x ≥ 0, −x ≤ x. Hence
−x ≤ x ≤ x which is −|x| ≤ x ≤ |x|.
Case 2: Suppose x < 0. Then |x| = −x.
SQU-Math2350 Section 4: Proof methods Fall 2019 11 / 15
77. Examples of Direct Proof IV (by Exhaustion)
A proof by exhaustion consists of an examination of every possible case.
Example 4.14
If the statement contains |x|, then two cases can be considered, x ≥ 0 which
implies |x| = x or x < 0 which implies |x| = −x.
Example 4.15
Let x be a real number. Prove that −|x| ≤ x ≤ |x|.
Solution.
Let x be a real number:
Case 1: Suppose x ≥ 0. Then |x| = x. Since x ≥ 0, −x ≤ x. Hence
−x ≤ x ≤ x which is −|x| ≤ x ≤ |x|.
Case 2: Suppose x < 0. Then |x| = −x. Since x < 0, x ≤ −x.
SQU-Math2350 Section 4: Proof methods Fall 2019 11 / 15
78. Examples of Direct Proof IV (by Exhaustion)
A proof by exhaustion consists of an examination of every possible case.
Example 4.14
If the statement contains |x|, then two cases can be considered, x ≥ 0 which
implies |x| = x or x < 0 which implies |x| = −x.
Example 4.15
Let x be a real number. Prove that −|x| ≤ x ≤ |x|.
Solution.
Let x be a real number:
Case 1: Suppose x ≥ 0. Then |x| = x. Since x ≥ 0, −x ≤ x. Hence
−x ≤ x ≤ x which is −|x| ≤ x ≤ |x|.
Case 2: Suppose x < 0. Then |x| = −x. Since x < 0, x ≤ −x.
Hence x ≤ x ≤ −x which is −|x| ≤ x ≤ |x|.
SQU-Math2350 Section 4: Proof methods Fall 2019 11 / 15
79. Examples of Direct Proof IV (by Exhaustion)
A proof by exhaustion consists of an examination of every possible case.
Example 4.14
If the statement contains |x|, then two cases can be considered, x ≥ 0 which
implies |x| = x or x < 0 which implies |x| = −x.
Example 4.15
Let x be a real number. Prove that −|x| ≤ x ≤ |x|.
Solution.
Let x be a real number:
Case 1: Suppose x ≥ 0. Then |x| = x. Since x ≥ 0, −x ≤ x. Hence
−x ≤ x ≤ x which is −|x| ≤ x ≤ |x|.
Case 2: Suppose x < 0. Then |x| = −x. Since x < 0, x ≤ −x.
Hence x ≤ x ≤ −x which is −|x| ≤ x ≤ |x|.
Thus in both cases −|x| ≤ x ≤ |x|.
SQU-Math2350 Section 4: Proof methods Fall 2019 11 / 15
80. Without loss of generality
SQU-Math2350 Section 4: Proof methods Fall 2019 12 / 15
81. Without loss of generality
The expression “ Without loss of generality ” is used when a proof by
exhaustion leads to cases so similar in reasoning.
SQU-Math2350 Section 4: Proof methods Fall 2019 12 / 15
82. Without loss of generality
The expression “ Without loss of generality ” is used when a proof by
exhaustion leads to cases so similar in reasoning.
Example 4.16
Let m and n be integers. Prove that if one of them is odd and the other is even,
then m2
+ n2
= 4k + 1 for some integer k.
SQU-Math2350 Section 4: Proof methods Fall 2019 12 / 15
83. Without loss of generality
The expression “ Without loss of generality ” is used when a proof by
exhaustion leads to cases so similar in reasoning.
Example 4.16
Let m and n be integers. Prove that if one of them is odd and the other is even,
then m2
+ n2
= 4k + 1 for some integer k.
Solution.
Let m and n be integers. Without loss of generality, assume m is even and
n is odd.
SQU-Math2350 Section 4: Proof methods Fall 2019 12 / 15
84. Without loss of generality
The expression “ Without loss of generality ” is used when a proof by
exhaustion leads to cases so similar in reasoning.
Example 4.16
Let m and n be integers. Prove that if one of them is odd and the other is even,
then m2
+ n2
= 4k + 1 for some integer k.
Solution.
Let m and n be integers. Without loss of generality, assume m is even and
n is odd. Then, by definition,
SQU-Math2350 Section 4: Proof methods Fall 2019 12 / 15
85. Without loss of generality
The expression “ Without loss of generality ” is used when a proof by
exhaustion leads to cases so similar in reasoning.
Example 4.16
Let m and n be integers. Prove that if one of them is odd and the other is even,
then m2
+ n2
= 4k + 1 for some integer k.
Solution.
Let m and n be integers. Without loss of generality, assume m is even and
n is odd. Then, by definition, there exist integers t,u such that m = 2t
and n = 2u + 1. Then
m2
+ n2
= 4(t2
+ u2
+ u) + 1
Since t2 + u2 + u is an integer, m2 + n2 has the form 4k + 1 for some
integer k
SQU-Math2350 Section 4: Proof methods Fall 2019 12 / 15
86. Direct Proofs of Compound Propositions
SQU-Math2350 Section 4: Proof methods Fall 2019 13 / 15
87. Direct Proofs of Compound Propositions
Form Proof Outline reason
SQU-Math2350 Section 4: Proof methods Fall 2019 13 / 15
88. Direct Proofs of Compound Propositions
Form Proof Outline reason
(P ∧ Q) ⇒ R Assume P and Q · · · . Thus R -
SQU-Math2350 Section 4: Proof methods Fall 2019 13 / 15
89. Direct Proofs of Compound Propositions
Form Proof Outline reason
(P ∧ Q) ⇒ R Assume P and Q · · · . Thus R -
P ⇒ (Q ∧ R) Assume P · · · . Thus Q · · · thus R -
SQU-Math2350 Section 4: Proof methods Fall 2019 13 / 15
90. Direct Proofs of Compound Propositions
Form Proof Outline reason
(P ∧ Q) ⇒ R Assume P and Q · · · . Thus R -
P ⇒ (Q ∧ R) Assume P · · · . Thus Q · · · thus R -
(P ⇒ Q) ⇒ R Assume P ⇒ Q · · · . Thus R -
SQU-Math2350 Section 4: Proof methods Fall 2019 13 / 15
91. Direct Proofs of Compound Propositions
Form Proof Outline reason
(P ∧ Q) ⇒ R Assume P and Q · · · . Thus R -
P ⇒ (Q ∧ R) Assume P · · · . Thus Q · · · thus R -
(P ⇒ Q) ⇒ R Assume P ⇒ Q · · · . Thus R -
(P ∨ Q) ⇒ R Case 1: Assume P · · · . Thus R P ∨ Q ⇒ R ≡
Case 2: Assume Q · · · . Thus R (P ⇒ R) ∧ (Q ⇒ R)
SQU-Math2350 Section 4: Proof methods Fall 2019 13 / 15
92. Direct Proofs of Compound Propositions
Form Proof Outline reason
(P ∧ Q) ⇒ R Assume P and Q · · · . Thus R -
P ⇒ (Q ∧ R) Assume P · · · . Thus Q · · · thus R -
(P ⇒ Q) ⇒ R Assume P ⇒ Q · · · . Thus R -
(P ∨ Q) ⇒ R Case 1: Assume P · · · . Thus R P ∨ Q ⇒ R ≡
Case 2: Assume Q · · · . Thus R (P ⇒ R) ∧ (Q ⇒ R)
P ⇒ (Q ∨ R) Assume P and ∼ Q · · · . Thus R P ⇒ (Q ∨ R) ≡
(P∧ ∼ Q) ⇒ R
SQU-Math2350 Section 4: Proof methods Fall 2019 13 / 15
93. Direct Proofs of Compound Propositions
Form Proof Outline reason
(P ∧ Q) ⇒ R Assume P and Q · · · . Thus R -
P ⇒ (Q ∧ R) Assume P · · · . Thus Q · · · thus R -
(P ⇒ Q) ⇒ R Assume P ⇒ Q · · · . Thus R -
(P ∨ Q) ⇒ R Case 1: Assume P · · · . Thus R P ∨ Q ⇒ R ≡
Case 2: Assume Q · · · . Thus R (P ⇒ R) ∧ (Q ⇒ R)
P ⇒ (Q ∨ R) Assume P and ∼ Q · · · . Thus R P ⇒ (Q ∨ R) ≡
(P∧ ∼ Q) ⇒ R
P ⇒ (Q ⇒ R) Assume P and Q · · · . Thus R P ⇒ (Q) ≡
(P ∧ Q) ⇒ R
SQU-Math2350 Section 4: Proof methods Fall 2019 13 / 15
95. Proofs Outlines I
Example 4.17
Let f be a polynomial. Outline a direct proof that if f has degree 4, then f
has a real zero or f is product of two irreducible quadratics.
SQU-Math2350 Section 4: Proof methods Fall 2019 14 / 15
96. Proofs Outlines I
Example 4.17
Let f be a polynomial. Outline a direct proof that if f has degree 4, then f
has a real zero or f is product of two irreducible quadratics.
Solution.
The statement is in the form P ⇒ (Q ∨ R).
SQU-Math2350 Section 4: Proof methods Fall 2019 14 / 15
97. Proofs Outlines I
Example 4.17
Let f be a polynomial. Outline a direct proof that if f has degree 4, then f
has a real zero or f is product of two irreducible quadratics.
Solution.
The statement is in the form P ⇒ (Q ∨ R). A possible outline is:
Assume f has degree 4 and f has no real zero
.
.
.
SQU-Math2350 Section 4: Proof methods Fall 2019 14 / 15
98. Proofs Outlines I
Example 4.17
Let f be a polynomial. Outline a direct proof that if f has degree 4, then f
has a real zero or f is product of two irreducible quadratics.
Solution.
The statement is in the form P ⇒ (Q ∨ R). A possible outline is:
Assume f has degree 4 and f has no real zero
.
.
.
Therefore, f is a product of two irreducible quadratics.
SQU-Math2350 Section 4: Proof methods Fall 2019 14 / 15
100. Proofs Outlines II
Example 4.18
Outline a direct proof that if a quadrilateral has opposite sides equal or opposite
angles equal, then it is a parrellelogram.
SQU-Math2350 Section 4: Proof methods Fall 2019 15 / 15
101. Proofs Outlines II
Example 4.18
Outline a direct proof that if a quadrilateral has opposite sides equal or opposite
angles equal, then it is a parrellelogram.
Solution.
Let a be a quadrilateral.
Case 1: Assume a has equal opposite sides
.
.
.
SQU-Math2350 Section 4: Proof methods Fall 2019 15 / 15
102. Proofs Outlines II
Example 4.18
Outline a direct proof that if a quadrilateral has opposite sides equal or opposite
angles equal, then it is a parrellelogram.
Solution.
Let a be a quadrilateral.
Case 1: Assume a has equal opposite sides
.
.
.
Therefore, a is a parallelogram.
SQU-Math2350 Section 4: Proof methods Fall 2019 15 / 15
103. Proofs Outlines II
Example 4.18
Outline a direct proof that if a quadrilateral has opposite sides equal or opposite
angles equal, then it is a parrellelogram.
Solution.
Let a be a quadrilateral.
Case 1: Assume a has equal opposite sides
.
.
.
Therefore, a is a parallelogram.
case 2: Assume a has equal opposite angles
.
.
.
SQU-Math2350 Section 4: Proof methods Fall 2019 15 / 15
104. Proofs Outlines II
Example 4.18
Outline a direct proof that if a quadrilateral has opposite sides equal or opposite
angles equal, then it is a parrellelogram.
Solution.
Let a be a quadrilateral.
Case 1: Assume a has equal opposite sides
.
.
.
Therefore, a is a parallelogram.
case 2: Assume a has equal opposite angles
.
.
.
Therefore, a is a parallelogram.
SQU-Math2350 Section 4: Proof methods Fall 2019 15 / 15