RankRizz
JEE MAIN 2020 · 08 JAN S2+4 / −1EASYTRANSCRIBED

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

Which of the following statement is a tautology?

SOLUTION

To decide which given statement is a tautology, we consider every option one by one and simplify it algebraically.

First, recall the basic logical equivalence for an implication:

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

We will convert each implication using this rule and then simplify.

Option A is p ∨ (∼q)  →  p ∧ q.p \,\vee\, (\sim q) \;\rightarrow\; p \,\wedge\, q.

Using the implication rule we have

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

Apply De Morgan’s law to the negation:

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

Now take qq common:

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

Inside the parentheses, ∼p  ∨  p\sim p \;\vee\; p is a tautology (it is always true). Therefore the whole expression reduces to

q  ∧  (True)  =  q.q \;\wedge\; \text{(True)} \;=\; q.

This final result qq is not always true (it is false when qq is false), so Option A is not a tautology.

Option B is ∼(p ∧ ∼q)  →  p ∨ q.\sim(p \,\wedge\, \sim q) \;\rightarrow\; p \,\vee\, q.

Convert the implication:

∼ ⁣(∼(p ∧ ∼q))  ∨  (p ∨ q).\sim\!\bigl(\sim(p \,\wedge\, \sim q)\bigr) \;\vee\; (p \,\vee\, q).

The double negation simplifies immediately:

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

Group the pp terms:

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

Using the absorption law p ∨ (p ∧ r)=p,p \,\vee\, (p \,\wedge\, r)=p, we obtain

p  ∨  q.p \;\vee\; q.

The expression p  ∨  qp \;\vee\; q can be false (specifically when pp and qq are both false). Thus Option B is not a tautology.

Option C is ∼(p ∨ ∼q)  →  p ∧ q.\sim(p \,\vee\, \sim q) \;\rightarrow\; p \,\wedge\, q.

Again convert the implication:

∼ ⁣(∼(p ∨ ∼q))  ∨  (p ∧ q).\sim\!\bigl(\sim(p \,\vee\, \sim q)\bigr) \;\vee\; (p \,\wedge\, q).

The double negation gives

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

Take pp common from the last two pieces:

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

Using absorption again, p  ∨  (p ∧ q)=pp \;\vee\; (p \,\wedge\, q)=p, so we get

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

This can be false whenever pp is false and qq is true. Hence Option C is not a tautology.

Option D is ∼(p ∨ ∼q)  →  p ∨ q.\sim(p \,\vee\, \sim q) \;\rightarrow\; p \,\vee\, q.

Convert the implication exactly as before:

∼ ⁣(∼(p ∨ ∼q))  ∨  (p ∨ q).\sim\!\bigl(\sim(p \,\vee\, \sim q)\bigr) \;\vee\; (p \,\vee\, q).

Simplify the double negation:

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

Rearrange the terms:

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

Using idempotent law p ∨ p=p,p \,\vee\, p = p, merge the repeated pp terms:

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

Now notice that ∼q  ∨  q\sim q \;\vee\; q is always true (law of excluded middle), so write

p  ∨  (True).p \;\vee\; \text{(True)}.

Finally, α  ∨  (True)=True\alpha \;\vee\; \text{(True)} = \text{True} for any statement α\alpha. Therefore the whole expression is always true, no matter what truth-values pp and qq take.

Thus Option D represents a statement that is true in every possible case; that is exactly the definition of a tautology.

Hence, the correct answer is Option D.

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