RankRizz
JEE MAIN 2020 · 02 SEP S2+4 / −1EASYTRANSCRIBED

JEE Main 2020 Mathematics question — Logical connectives, truth tables and tautologies

Which of the following is a tautology?

SOLUTION

We recall that a statement is called a tautology when it remains true for every possible truth-value assignment of its component propositions. We shall examine each option one by one, reducing the compound statement with standard logical identities and looking for a possible counter-example. If even a single assignment makes the statement false, then it is not a tautology.

We begin with Option A:

(∼p)  ∧  (p∨q)  →  q(\sim p)\;\wedge\;(p \vee q)\;\to\; q

First we simplify the antecedent "(∼p)∧(p∨q)(\sim p)\wedge (p\vee q)". Using the distributive law

a∧(b∨c)  =  (a∧b)  ∨  (a∧c),a\wedge(b\vee c)\;=\;(a\wedge b)\;\vee\;(a\wedge c),

with a=∼p,  b=p,  c=q,a=\sim p,\; b=p,\; c=q, we obtain

(∼p)∧(p∨q)  =  [(∼p)∧p]  ∨  [(∼p)∧q].(\sim p)\wedge(p\vee q)\;=\;[(\sim p)\wedge p] \;\vee\;[(\sim p)\wedge q].

Now (∼p)∧p(\sim p)\wedge p is a contradiction, i.e. it is always false, so it may be dropped from the disjunction:

(∼p)∧(p∨q)  =  (∼p)∧q.(\sim p)\wedge(p\vee q)\;=\;(\sim p)\wedge q.

Therefore Option A becomes

[(∼p)∧q]  →  q.[(\sim p)\wedge q]\;\to\;q.

Next we recall the definition of implication:

a→b  ≡  ∼a  ∨  b.a\to b\;\equiv\;\sim a\;\vee\;b.

Replacing aa with (∼p)∧q(\sim p)\wedge q and bb with qq gives

[(∼p)∧q]  →  q  ≡  ∼[(∼p)∧q]  ∨  q.[(\sim p)\wedge q]\;\to\;q\;\equiv\;\sim[(\sim p)\wedge q]\;\vee\;q.

Apply De Morgan’s law to the negation inside:

∼[(∼p)∧q]  =  ∼(∼p)  ∨  ∼q  =  p  ∨  ∼q.\sim[(\sim p)\wedge q]\;=\;\sim(\sim p)\;\vee\;\sim q\;=\;p\;\vee\;\sim q.

So the whole expression is

(p  ∨  ∼q)  ∨  q.(p\;\vee\;\sim q)\;\vee\;q.

The associative and commutative laws for disjunction permit us to regroup and obtain

p  ∨  (q  ∨  ∼q).p\;\vee\;(q\;\vee\;\sim q).

Within the parentheses, q  ∨  ∼qq\;\vee\;\sim q is the law of excluded middle, which is always true, i.e. a tautology TT. Hence we have

p  ∨  T  =  T.p\;\vee\;T\;=\;T.

Thus Option A simplifies to a statement that is invariably true, making it a tautology.

Now we test Option B:

(q→p)  ∨  ∼(p→q).(q\to p)\;\vee\;\sim(p\to q).

First expand each implication using a→b≡∼a  ∨  ba\to b \equiv \sim a\;\vee\;b:

(q→p)=(∼q)  ∨  p,(p→q)=(∼p)  ∨  q.(q\to p) = (\sim q)\;\vee\;p, \qquad (p\to q) = (\sim p)\;\vee\;q. Hence

∼(p→q)=∼[(∼p)∨q]=p∧∼q\sim(p\to q) = \sim[(\sim p)\vee q] = p\wedge\sim q by De Morgan’s law. Therefore Option B becomes

(∼q  ∨  p)  ∨  (p∧∼q).(\sim q\;\vee\;p)\;\vee\;(p\wedge\sim q).

We look for a truth-value combination that makes the whole disjunction false. A disjunction is false only when each of its components is false. So we need

∼q  ∨  p=F,andp∧∼q=F.\sim q\;\vee\;p = F, \quad\text{and}\quad p\wedge\sim q = F.

Take p=Fp = F and q=Tq = T. Then

∼q=F,p=F,∴∼q  ∨  p=F.\sim q = F,\quad p = F,\quad \therefore \sim q\;\vee\;p = F. Also p∧∼q=F∧F=F.p\wedge\sim q = F\wedge F = F. Both parts are false, so the entire statement is false for this assignment. Hence Option B is not a tautology.

Next we inspect Option C:

(∼q)  ∨  (p∧q)  →  q.(\sim q)\;\vee\;(p\wedge q)\;\to\;q.

Choose q=Fq = F (i.e. qq is false). Then ∼q=T\sim q = T, so the antecedent (∼q)  ∨  (p∧q)(\sim q)\;\vee\;(p\wedge q) is true irrespective of pp. The consequent qq, however, is false. Therefore the implication becomes T→F,T\to F, which is false. So Option C is also not a tautology.

Finally Option D:

(p→q)  ∧  (q→p).(p\to q)\;\wedge\;(q\to p).

This is logically equivalent to the biconditional p↔q,p\leftrightarrow q, which is true only when pp and qq share the same truth value. Take p=T, q=Fp = T,\, q = F. Then p→q=Fp\to q = F, so the whole conjunction is false. Consequently Option D is not a tautology.

Only Option A survives every test and is always true.

Hence, the correct answer is Option A.

Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicLogical connectives, truth tables and tautologies
TypeMultiple choice