In Section 2.2 we focused on existential and universal statements. In this section, we want to focus on statements that involve a conditional.
For each of the following statements, determine whether it is a conditional, universal, or existential statement.
A has the form “for all \(x\in D\text<,>\) if \(P(x)\) then \(Q(x)\text<.>\) ” In symbols, we can write a universal conditional as \(\forall x\in D, P(x)\rightarrow Q(x).\)
Translate the statement using quantifiers and variables, “If an integer is even then it is divisible by 2.”
Let \(P(x)\) be “ \(x\) is even” and \(Q(x)\) be “ \(x\) is divisible by 2.” \(\forall x\in \mathbb
Write the following statement formally as a universal conditional: Every differentiable function is continuous.
In Section 1.3 we introduced the connective for conditional statements. A conditional statement, as we've seen, has the form “if \(p\) then \(q\text\) ” and we use the connective \(p\rightarrow q\text<.>\)
As many mathematical statements are in the form of a conditional, it is important to keep in mind how to determine if a conditional statement is true or false.
A conditional, \(p\rightarrow q\text<,>\) is TRUE if you can show that whenever \(p\) is true, then \(q\) must be true. Or, using the contrapositive, \(p\rightarrow q\) is TRUE if you can show that whenever \(q\) is false, then \(p\) must be false.
A conditional, \(p\rightarrow q\text<,>\) is FALSE if you can show that there is a possibility for \(p\) to be true and \(q\) to be false. Note, by recalling the logical equivalence \(\neg(p\rightarrow q)\equiv p\ \wedge \neg q\text<,>\) we see that the negation of an “if. then” is an “and” statement.
Write the negation of the statement. Use this to check your answer to (a). In particular, your negation should have the opposite truth value to what you decided in (a).
Write the negation of the statement. Use this to check your answer to (a). In particular, your negation should have the opposite truth value to what you decided in (a).
Consider the statement “If an argument is valid, then it is impossible for the premises to be true and the conclusion false.”
Write the negation of the statement. Note, you may need to recall how to negate an “and” statement. Use this to check your answer to (a).
Write the negation of the statement. Use this to check your answer to (a). In particular, your negation should have the opposite truth value to what you decided in (a).
We restate a few equivalences and definitions from Section 1.3 for easy reference.\begin \neg(\forall x\in D, P(x)\rightarrow Q(x))&\equiv \exists x\in D, \neg(P(x)\rightarrow Q(x))\\ &\equiv \exists x\in D, P(x)\wedge \neg Q(x) \end
The universal conditional statement \(\forall x\in D, P(x)\rightarrow Q(x)\) has \(\forall x\in D, \neg Q(x)\rightarrow \neg P(x)\text<.>\)
The universal conditional statement \(\forall x\in D, P(x)\rightarrow Q(x)\) has \(\forall x\in D, Q(x)\rightarrow P(x)\text<.>\)
Consider the statement “For all integers \(n\text<,>\) if \(n\) has a factor of 15, then \(n\) has a factor of 3 and \(n\) has a factor of 5.”
Recall that a logical argument as seen in Section 1.2 and Section 1.4 can be valid or invalid, while a statement can be true or false. It is important to distiguish between these ideas. Arguments are not true or false, and statements are not valid or invalid. However, there is a connection between these ideas. In particular, we can convert arguments into conditional statements, where the premises of the argument form the hypothesis and the conclusion of the argument forms the conclusion.
| A |
| B |
| \(\therefore\ \) C |
The premises of the argument, connected with an “and” become the “if” part and the conclusion of the argument becomes the “then” part.
| \(p\wedge q\) |
| \(\therefore\ \) \(p\) |
We determined, using a truth table, that this is a valid argument. We can convert this argument to the conditional
\begin (p\wedge q)\rightarrow (p). \endIf you check the truth table for \((p\wedge q)\rightarrow (p)\text<,>\) you will see that it is always true.
| \(p\vee q\) |
| \(\therefore\ \) \(p\) |
We determined, using a truth table, that this is an invalid argument. We can convert this argument to the conditional
\begin (p\vee q)\rightarrow (p). \endIf you check the truth table for \((p\vee q)\rightarrow (p)\text<,>\) you will see that it can be false.
The corresponding conditional for a valid argument will be a tautology (always true), while the corresponding conditional for a invalid argument can be false (has at least one case where it is false).
| \(p\rightarrow q\) |
| \(\neg q\) |
| \(\therefore\ \) \(\neg p\) |
Determine if it is possible for the conditional statement to be false. What does this tell you about the validity of the argument?
| \(p\rightarrow q\) |
| \(\neg p\) |
| \(\therefore\ \) \(\neg q\) |
Determine if it is possible for the conditional statement to be false. What does this tell you about the validity of the argument?
Often it is necessary to convert an informal mathematical statement into a more formal one. Complete the following statements so they are equivalent to “The reciprocal of any positive number is positive.”
Given any positive real number \(r\text<,>\) the reciprocal of ___. For any real number \(r\text<,>\) if \(r\) is ___ then ___. If a real number \(r\) ___, then ___.Complete the following statements so they are equivalent to “The cube root of any negative real number is negative.”
Given any negative real number \(s\text<,>\) the cube root of ___. For any real number \(s\text<,>\) if \(s\) is ___, then ___. If a real number \(s\) ___, then ___.In order to better understand mathematical statements, it can be helpful to write statements less formally. First rewrite each statement without using variables, then determine whether the statements are true or false.
There are real numbers \(u\) and \(v\) with the property that \(u+v < v-u\text<.>\) There is a real number \(x\) such that \(x^2 < x\text<.>\) For all positive integers \(n\text<,>\) \(n^2\geq n\text<.>\) For all real numbers \(a\) and \(b\text<,>\) \(| a+b | \leq | a | + | b |\text<.>\)\(\forall\) integers \(n\text<,>\) if \(n\) is divisible by 6, then \(n\) is divisible by 2 and \(n\) is divisible by 3.
Use a conditional statement to determine if the following argument is valid or invalid. Clearly state your conclusion and explain how your conditional statement supports your conclusion.
| \(p\) |
| \(p\rightarrow q\) |
| \(\neg q\ \vee r\) |
| \(\therefore r\) |
Use a conditional statement to determine if the following argument is valid or invalid. Clearly state your conclusion and explain how your conditional statement supports your conclusion.
| \((p\ \wedge q)\rightarrow \neg r\) |
| \(p\ \vee \neg q\) |
| \(\neg q\rightarrow p\) |
| \(\therefore \neg r\) |
Use a conditional statement to show the following argument is valid. Explain how your conditional statement supports your conclusion.
| \(p \ \vee q\) |
| \(\neg p\) |
| \(\therefore q\) |
Use a conditional statement to show the following argument is invalid. Explain how your conditional statement supports your conclusion.
| \(\neg p\rightarrow q\) |
| \(p\) |
| \(\therefore \neg q\) |