3.2 Logical connectives and the ‘not’ operator
We can construct new sentences of English by connecting two sentences in various ways. For example, consider the following two sentences.
-
:
‘I will go to class today.’
-
:
‘I will go to class tomorrow.’
We can connect these to make a new sentence in several ways.
-
and :
‘I will go to class today and I will go to class tomorrow.’
-
or :
‘I will go to class today or I will go to class tomorrow.’
-
If then :
‘If I [will] go to class today then I will go to class tomorrow.’
We can also express the negation of a sentence by adding the word ‘not’.
-
not :
‘I will not go to class today.’
Then we can connect these sentences to construct even more complex ones.
-
not and :
‘I will not go to class today and I will go to class tomorrow.’
-
or not :
I will go to class today or I will not go to class tomorrow.’
-
If not then :
‘If I don’t go to class today then I will go to class tomorrow.’
We will now think about what it means for statements constructed like this to be true.
3.2.1 Negation (not)
Let’s introduce new labels for two statements.
-
:
‘I will go to class today.’
-
:
‘I will not go to class today.’
When we have two statements related like this, we say that is the negation of . Also, is the negation of or, in other words, ‘not(not )’ is the same as .
Observe that the statement
-
:
‘I will go to class tomorrow.’
is not the negation of the statement
-
:
‘I will go to class today.’
The truth of statements and are independent; they could both be true, both be false, or one could be true and the other false.
Given any statement , we label its negation as ‘not ’. An Euler diagram representing the statements and ‘not ’ is shown in Figure 3.3.
The area outside the shape labelled (but inside the rectangle) represents the statement ‘not ’. Since we put a dot inside to mean than is true, placing a dot anywhere outside means that ‘not ’ is true. Hence when is false, ‘not ’ is true and when is true, ‘not ’ is false.
3.2.2 Conjunction (and)
Given statements and , the statement ‘ and ’ is called their conjunction.
For example, given statements
-
:
‘I will go to class today.’
-
:
‘I will go to class tomorrow.’
their conjunction is
-
and :
‘I will go to class today and I will go to class tomorrow.’
The Euler diagram representing the statement ‘ and ’ is shown in Figure 3.5.
The shaded intersection of and represents the statement ‘ and ’. A dot being inside the shape labelled ‘ and ’ means it must be inside and inside . In other words, the statement ‘ and ’ is true precisely when is true and is true. Otherwise ‘ and ’ is false.
Exercise 3.1.
For each of the following statements, determine and explain whether the statement is true or false.
-
(a)
is even and is even.
-
(b)
is even and is odd.
-
(c)
is odd and is odd.
-
Solution.
-
(a)
Since ‘ is even’ is false , the statement ‘ is even and is even’ is false. Note that ‘ is even’ is also false but this doesn’t matter: we already know that ‘ is even and is even’ is false because ‘ is even’ is false.
-
(b)
Since ‘ is even’ is true and ‘ is odd’ is true, the statement ‘ is even and is odd’ is true.
-
(c)
Since ‘ is odd‘ is false and ‘ is odd‘ is true, the statement ‘ is odd and is odd’ is false.
-
(a)
3.2.3 Disjunction (or)
Given statements and , the statement ‘ or ’ is called their disjunction.
For example, given statements
-
:
‘I will go to class today.’
-
:
‘I will go to class tomorrow.’
their disjunction is
-
or :
‘I will go to class today or I will go to class tomorrow.’
You might interpret statement ‘ or ’ as meaning I will go to class either today or tomorrow, but not both. It is often the case in English that the word ‘or’ is meant to be interpreted in this exclusive way. In mathematics, a disjunction like ‘ or ’ is always inclusive unless stated otherwise. So, in this case, ’ or ’ includes the scenario where I will go to class both today and tomorrow.
The Euler diagram representing the statement ‘ or ’ is shown in Figure 3.6.
The shaded union of and represents the statement ‘ or ’. A dot being inside the shape labelled ‘ or ’ means it must be inside or or both. In other words, the statement ‘ or ’ is true when is true or is true (or both). Otherwise ‘ or ’ is false.
Exercise 3.2.
For each of the following statements, determine and explain whether the statement is true or false.
-
(a)
is even or is even.
-
(b)
is even or is odd.
-
(c)
is odd or is odd.
-
Solution.
-
(a)
Since ‘ is even’ is false and ‘ is even’ is false, the statement ‘ is even or is even’ is false.
-
(b)
Since ‘ is even’ is true and ‘ is odd’ is true, the statement ‘ is even or is odd’ is true. (Remember that ‘or’ is always inclusive.)
-
(c)
Since ‘ is odd‘ is false and ‘ is odd‘ is true, the statement ‘ is odd or is odd’ is true.
-
(a)
3.2.4 Conditional (If … then …)
Consider the following two statements.
-
‘If today is Saturday, then I will not go to class today.’
-
‘For any two real numbers and , if then .’
These are called conditional statements. In general, given statements and , the statement ‘If then ’ is called a conditional statement.
Note that, in English, there are different ways of expressing the same conditional statement. For example, the following statements mean the same thing.
-
‘If today is Saturday, then I will not go to class today.’
-
‘I will not go to class today if today is Saturday.’
-
‘I will not go to class on Saturdays.’
When making conditional statements, it is conventional to stick to the form ‘If then ’ rather than ‘ if ’22 2 However, see Section 3.2.5 for an example of when the phrasing ‘ if ’ is commonly used. or any other phrasing. This helps to make such statements clear. Mathematicians often write to mean ‘If then ’. This can also be read as ‘ implies ’.
Warning: do not misuse the ‘’ symbol. It only ever belongs between two statements. Phrases such as ‘’, literally ‘if then ’, are meaningless.
The conditional statement ‘If then ’ asserts that if is true then is also true. The Euler diagram representing a conditional statement looks as shown in Figure 3.7.
We can use the diagram to draw the following conclusions.
-
•
If is true then must also be true; if we put a dot inside then it is guaranteed to be inside . [Thus the diagram does indeed capture the intended meaning of ‘If then ’.]
-
•
If is false then must also be false; we cannot put a dot outside but inside . [This observation is crucial to the ideas of proving the contrapositive of a statement (Section 4.4) and proof by contradiction (Section 4.5).]
-
•
Statement being false tells us nothing about the truth of ; a dot placed outside could be either inside or outside .
Given the statement ‘If then ’, we can say that is a sufficient condition for because knowing that is true is sufficient to ensure that is true. Similarly, can be said to be a necessary condition for because, for to be true, it is necessary that is true. We will not use these terms again in this companion, but you should be aware of them in case you see them used elsewhere.
Note that, in this companion, we will not discuss precisely what it means for the entire statement ‘If then ’ to be true or false. Rather, we are thinking of ‘If then ’ as expressing a relationship between statements and , and discussing what this means about the truth of and .33 3 For completeness, you should be aware that logicians consider the statement ‘If then ’ to be equivalent to ‘not or ’. This means, in particular, that ‘If then ’ is considered to be true when is false and is true, and also when and are both false! These facts are not particularly useful when doing mathematics since we are usually more concerned with the truth of statements and themselves.
Many of the statements we considered in Chapter 2 can be thought of as conditional statements. For example, Claim 2.8 (‘For all positive real numbers , is positive’) could instead be written as ‘If is a positive real number then is positive’.
The point here is that you already know how you can prove a conditional statement ‘If then ’: you can start by assuming is true then show that follows as a logical certainty using a chain of deductive reasoning.
Example 3.3.
Suppose and are any two real numbers. We shall prove the statement: ‘if then .’
Suppose that and are two real numbers and that .
-
•
Multiplying both sides of the equation by gives .
-
•
Multiplying both sides of the equation by gives .
Since and both equal , they must be the same, that is .
The converse of a conditional statement
When we form the conjunction or disjunction of two statements and , the order in which we do so does not matter. For example, the following statements mean exactly the same thing.
-
and :
‘I will go to class today and I will go to class tomorrow.’
-
and :
‘I will go to class tomorrow and I will go to class today.’
However, the order of statements in a conditional statement does matter. Given statements and , the converse of the statement ‘If then ’ is the statement ‘If then .’
Given a conditional statement ‘If then ’ (or ‘’), we cannot assume that the converse ‘If then ’ (or ‘’) also holds. This can be illustrated by considering our familiar example.
-
:
‘If today is Saturday, then I will not go to class today.’
-
:
‘If I will not go to class today, then today is Saturday.’
Statement is the converse of . Statement means that the only day I do not go to class is a Saturday. This is false, even though is true.
On the other hand, the converse of a conditional statement may also be true.
-
:
‘If I am in Edinburgh then I am in the capital of Scotland.’
-
:
‘If I am in the capital of Scotland then I am in Edinburgh.’
This time statements and its converse are both true.
The truth of a conditional statement guarantees nothing about the truth of its converse. Assuming that the converse of a true statement is true is a very common error, so be careful not to do it!
Example 3.4.
Consider the statement from Claim 2.8 phrased as a conditional statement: ‘Let be a real number. If is positive then is positive.’ We proved this statement in Example 2.20.
The converse of the statement is ‘If is positive then is positive.’ This is false. For example, let . Then which is positive but is not positive.
Example 3.5 (The Pythagorean theorem).
Suppose we have a triangle with sides of length , , and . If the angle between sides and is a right angle then . (You probably know this result already, perhaps phrased differently.) A proof is presented in Theorem 4.14.
In fact, the converse of this statement is also true. Suppose we have a triangle with sides of length , , and . If then the angle between sides and is a right angle. A proof is presented in Theorem 4.15.
3.2.5 Equivalence (If and only if)
Recall from Section 3.2.4 the statements and its converse .
-
:
‘If I am in Edinburgh then I am in the capital of Scotland.’
-
:
‘If I am in the capital of Scotland then I am in Edinburgh.’
Two statements and are said to be (logically) equivalent when and . In this case, we may write ‘’ or ‘ if and only if ’44 4 Mathematicians sometimes write ‘iff’ as a shorthand for ‘if and only if’..
So statements and above assert that
-
:
‘I am in Edinburgh.’ and
-
:
‘I am in the capital of Scotland.’
are logically equivalent, and in place of and we can write:
-
‘I am in the capital of Scotland if and only if I am in Edinburgh.’
Note that and are reversed in ‘’ compared with ‘ if and only if ’. This is not a typo. Recall from Section 3.2.4 that ‘’ means ‘If then ’ or, alternatively ‘ if ’. So the ‘if’ part of ‘ if and only if ’ corresponds to the statement ‘’.
The Euler diagram representing a logical equivalence is shown in Figure 3.8.
The shapes for statements and coincide; any dot placed on the diagram will be either inside both and or outside both and .
Example 3.6.
Consider the statement: ‘For any positive real numbers and , if and only if .’
Let’s introduce labels:
-
:
-
:
So the statement under consideration is saying that, assuming and are positive real numbers, . Proving means proving that and .
We already proved for any two real numbers and in Example 3.3 and so the same proof holds assuming and are both positive.
To prove that , we can proceed as follows. Suppose ,
(taking square roots on both sides) | ||||||
(since and are both positive). |
Since we have proved and , we have proved .
It is likely that in the past you will have seen and written many line-by-line deductions like the one above without the ‘’ symbol between statements. For example, instead of the above, you may have written:
(taking square roots on both sides) | |||||
(since and are both positive). |
You should always include the correct logical connectives in your line-by-line reasoning. Doing so makes your argument clearer and can help prevent errors in reasoning.
For instance, note that the statement ‘’ is not true if or were allowed to be negative. For example, let and so that . This does not imply that .
So where does the argument above go wrong if or can be negative? It’s the following step:
(taking square roots on both sides) | |||||
(You can see this is false by putting and .) For completeness, observe that the following chain of reasoning is correct for any real numbers and :
(taking square roots on both sides) | ||||||
But this does not allow us to conclude that in the case where or could be negative.