Section 3.4 Using Cases in Proofs
Beginning Activity Beginning Activity 1: Using a Logical Equivalency
1.
Complete a truth table to show that
2.
Suppose that you are trying to prove a statement that is written in the form
3.
Now consider the following proposition:
Proposition.
For all integers
4.
Now prove that if
5.
Use the results proved in Exercise 4 and the explanation in Exercise 2 to explain why we have proved the contrapositive of the proposition in Exercise 3.
Beginning Activity Beginning Activity 2: Using Cases in a Proof
The work in Beginning Activity 1 was meant to introduce the idea of using cases in a proof. The method of using cases is often used when the hypothesis of the proposition is a disjunction. This is justified by the logical equivalencyProposition 1.
If
The integer
is an even integer;The integer
is an odd integer.
1.
Complete the proof for the following proposition:
Proposition 2.
If
Proof.
Let
2.
Construct a proof for the following proposition:
Proposition 3.
If
3.
Explain why the proofs of Proposition 2 and Proposition 3 can be used to construct a proof of Proposition 1.
Subsection Some Common Situations to Use Cases
When using cases in a proof, the main rule is that the cases must be chosen so that they exhaust all possibilities for an object- When the hypothesis is, “
is an integer.” -
Case 1:
is an even integer.Case 2:
is an odd integer. - When the hypothesis is, “
and are integers.” -
Case 1:
and are even.Case 2:
is even and is odd.Case 3:
is odd and is even.Case 4:
and are both odd. - When the hypothesis is, “
is a real number.” -
Case 1:
is irrational.Case 2:
is irrational. - When the hypothesis is, “
is a real number.” -
Case 1:
Case 2:
OR
Case 1:
Case 2:
Case 3:
- When the hypothesis is, “
and are real numbers.” -
Case 1:
Case 2:
OR
Case 1:
Case 2:
Case 3:
Subsection Writing Guidelines for a Proof Using Cases
When writing a proof that uses cases, we use all the other writing guidelines. In addition, we make sure that it is clear where each case begins. This can be done by using a new paragraph with a label such as “Case 1,” or it can be done by starting a paragraph with a phrase such as, “In the case where ….”
Progress Check 3.26. Using Cases: Is Even or Is Odd.
Complete the proof of the following proposition:
Proposition: For each integer
Proof: Let
Case 1: The integer
Proposition: For each integer
Proof.
Let
In the case where
Since
In the case where
Since
Proposition 3.27.
For all real numbers
Proof.
We let
In the case where
In the case where
So in both cases,
Subsection Absolute Value
Most students by now have studied the concept of the absolute value of a real number. We use the notationDefinition.
For
Since
we see that which should be no surprise.Since
we see that
Theorem 3.28.
Let
if and only if or
Proof.
The proof of Item 2 is part of Exercise 10. We will prove Item 1.
We let
In the case where
We will now prove that if
When
and hence,
Progress Check 3.29.
(a)
What is
(b)
Use the properties of absolute value in Theorem 3.28 to help solve the following equations for
(i)
(ii)
(iii)
(iv)
Theorem 3.30.
Let
if and only if This is known as the Triangle Inequality.
Proof.
We will prove Item 1. The proof of Item 2 is included in Exercise 10, and the proof of Item 3 is Activity 16. For Item 1, we will prove the biconditional proposition by proving the two associated conditional propositions.
So we let
In the case where
we know that and so the inequality implies that However, we also know that and that Therefore, we conclude that and, hence,When
we see that Therefore, the inequality implies that which in turn implies that In this case, we also know that since is negative and is positive. Hence,
So in both cases, we have proven that
If
then and hence,If
then and so Thus, By multiplying both sides of the last inequality by we conclude that
These two cases prove that if
Exercises Exercises
1.
In Beginning Activity 2, we proved that if
Use the fact that
2.
Prove that if
Do not use the quadratic formula. Try a proof by contradiction. If there exists a solution of the equation
From Exercise 1, we know that
3.
Prove that if
If
4.
Prove the following proposition:
For each integerif then or
If
5.
Complete the following.
(a)
Prove the following proposition:
For all integersand with if divides or divides then divides the product
Notice that the hypothesis is a disjunction. So use two cases.
(b)
Write the contrapositive of the proposition in Task 5.a.
(c)
Write the converse of the proposition in Task 5.a. Is the converse true or false? Justify your conclusion.
For all integers
6.
Are the following propositions true or false? Justify all your conclusions. If a biconditional statement is found to be false, you should clearly determine if one of the conditional statements within it is true. In that case, you should state an appropriate theorem for this conditional statement and prove it.
(a)
For all integers
The statement, for all integers
We have proven the
(b)
For all integers
7.
Is the following proposition true or false? Justify your conclusion with a counterexample or a proof.
For each integerif is odd, then
8.
Prove that there are no natural numbers
Try a proof by contradiction with two cases:
9.
Are the following propositions true or false? Justify each conclusion with a counterexample or a proof.
(a)
For all integers
(b)
For all integers
Do not use the quadratic formula. Use a proof by contradiction and recall that any rational number can be written in the form
(c)
For all integers
10.
Prove the following.
(a)
Item 2 of Theorem 3.28.
For each
One way is to use three cases: (i)
(b)
Item 2 of Theorem 3.30.
For all real numbersand
11.
Let
(a)
Complete the following statement: For each real number
For each real number
(b)
Prove that for each real number
(c)
Complete the following statement: For each real number
12.
Prove each of the following:
(a)
For each nonzero real number
(b)
For all real numbers
An idea that is often used by mathematicians is to add 0 to an expression “intelligently”. In this case, we know that
(c)
For all real numbers
13. Evaluation of Proofs.
See the instructions for Exercise 19 from Section 3.1.
(a)
- Proposition
For all nonzero integers
and if and then the equation does not have a solution that is a natural number.- Proof
-
We will prove the contrapositive, which is: For all nonzero integers
and if the equation has a solution that is a natural number, then orSo we let
and be nonzero integers and assume that the natural number is a solution of the equation So we haveSo we can conclude that
and Since we now have the value of we can substitute it in the equation and obtain Dividing both sides of this equation by 3 shows that So there is no need for us to go any further, and this concludes the proof of the contrapositive of the proposition.
(b)
- Proposition
For all nonzero integers
and if and then the equation does not have a solution that is a natural number.- Proof
-
We will use a proof by contradiction. Let us assume that there exist nonzero integers
and such that and and where is a natural number. First, we will solve one equation for doing this, we obtainWe can now substitute for
in This givesBy the closure properties of the integers,
is an integer and, hence, equation (12) implies that divides 3. So or When we substitute into the equation we obtain This is a contradiction since we are told in the proposition that This proves that the negation of the proposition is false and, hence, the proposition is true.
Activity 16. Proof of the Triangle Inequality.
(a)
Verify that the triangle inequality is true for several different real numbers
(b)
Explain why the following proposition is true: For each real number
(c)
Now let