Unit1 - Conditional Statements, Converse, Contrapositive Inverse
Unit1 - Conditional Statements, Converse, Contrapositive Inverse
in/1425002-discrete-mathematical-structures/unit-i-
foundations/g-conditional-statements
Conditional Statements
In the last topic, we saw that the operators ∧ (AND), ∨ (OR), and ¬(NOT) allow us to create
complex statements. We also saw that some of these complex statements are logically
equivalent to each other, i.e. their truth tables have the same truth values. Similarly, there is one
more type of complex statement, called the if-then statements, or conditional statements.
For example,
Like in other complex statements, there are at least two statements in this conditional statement
too.
The whole statement can be denoted by p⇒q. Let us construct the truth table for such a
statement.
If it does not rain in Greater Noida, then the road there will be wet. – TRUE
(A road can be wet for many reasons beside rain, e.g. - Leaky water carrier, damaged
water supply pipes etc)
If it does not rain in Greater Noida, then the road there will not be wet. – TRUE
(Since there is no other reason mentioned explicitly, the statement can be true).
NOTE:A more profound reason is that, conditional statements are all about cause and effect. Our main
concern is not the cause, but the effect in the statement.
A Conditional statements can be manipulated in some interesting ways to create a new conditional
statement. These derived statements are -
Converse Statements –
If the original statement is p⇒q, then the converse statement is given by q⇒p. However, it is worth noting
that in most cases, these statements are logically equivalent.
For example -
Evidently, the converse statement in this case is false. But, in some cases they can also be true. For
example -
In this case, both the statements are true, i.e. p⇒q is the same as q⇒p. Such statements are represented by
p⇔q, i.e. if and only if. The previous statement can be conveniently stated as -
Inverse Statements –
If the original statement is p⇒q, then the inverse statement is given by ¬p⇒¬q. Once again, like converse
statements, they may or may not be logically equivalent.
For example -
The inverse statement in this case is false. But, in other cases they can be true. For example -
Contrapositive Statements –
If the original statement is p⇒q, then the contrapositive statement is given by ¬q⇒¬p. Contrapostive
statements are always logically equivalent to the original statement. -
Another example -
BiConditional Statement
Definition: A biconditional statement is defined to be true whenever both parts have the same
truth value. The biconditional operator is denoted by a double-headed arrow . The
biconditional p q represents "p if and only if q," where p is a hypothesis and q is a conclusion.
The following is a truth table for biconditional p q.
If p and q are two statements then "p if and only if q" is a compound statement, denoted as p ↔ q
and referred as a biconditional statement or an equivalence. The equivalence p ↔ q is true only
when both p and q are true or when both p and q are false.
For Example: (i) Two lines are parallel if and only if they have the same slope.
(ii) You will pass the exam if and only if you will work hard.
Example
p: x + 7 = 11
Given:
q: x = 5
Problem: Is this sentence biconditional? "x + 7 = 11 iff x = 5."
Solution:
The statement p q is false by the definition of a conditional. The statement q p is also false
by the same definition. Therefore, the sentence "x + 7 = 11 iff x = 5" is not biconditional.
Example :
a: x + 2 = 7
Given:
b: x = 5
Write a b as a sentence. Then determine its truth values a
Problem:
b.
Solution: The biconditonal a b represents the sentence: "x + 2 = 7 if and only if x = 5." When
x = 5, both a and b are true. When x 5, both a and b are false. A biconditional statement is
defined to be true whenever both parts have the same truth value. Accordingly, the truth values
of a b are listed in the table below.
Truth Table