RankRizz
JEE MAIN 2021 · 27 JUL S1+4 / −1EASYTRANSCRIBED

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

The compound statement (P∨Q)∧(∼P)⇒Q(P \vee Q) \wedge (\sim P) \Rightarrow Q equivalent to:

SOLUTION

We have the compound statement

((P∨Q)∧(∼P))  ⇒  Q.\bigl((P \vee Q) \wedge (\sim P)\bigr)\;\Rightarrow\;Q.

First we recall the basic logical equivalence for an implication:

A⇒B  ≡  ∼A  ∨  B.A \Rightarrow B \;\equiv\; \sim A \;\vee\; B.

Here,

A=(P∨Q)∧(∼P)andB=Q.A = (P \vee Q)\wedge(\sim P) \quad\text{and}\quad B = Q.

Applying the rule we obtain

((P∨Q)∧(∼P))⇒Q  ≡  ∼((P∨Q)∧(∼P))  ∨  Q.\bigl((P \vee Q)\wedge(\sim P)\bigr)\Rightarrow Q \;\equiv\; \sim\bigl((P \vee Q)\wedge(\sim P)\bigr)\;\vee\;Q.

Now we remove the negation inside by using De Morgan’s law:

∼(X∧Y)  ≡  ∼X  ∨  ∼Y.\sim(X\wedge Y)\;\equiv\; \sim X\;\vee\;\sim Y.

So, with

X=(P∨Q)andY=(∼P),X = (P \vee Q)\quad\text{and}\quad Y = (\sim P),

we have

∼((P∨Q)∧(∼P))=(∼(P∨Q))  ∨  (∼(∼P))=(∼P∧∼Q)  ∨  P.\sim\bigl((P \vee Q)\wedge(\sim P)\bigr) = \bigl(\sim(P \vee Q)\bigr)\;\vee\;\bigl(\sim(\sim P)\bigr) = (\sim P\wedge\sim Q)\;\vee\;P.

The expression therefore becomes

((∼P∧∼Q)  ∨  P)  ∨  Q.\bigl((\sim P\wedge\sim Q)\;\vee\;P\bigr)\;\vee\;Q.

The associative and commutative laws of ∨\vee allow us to regroup and reorder the disjunction:

((∼P∧∼Q)  ∨  P)  ∨  Q  =  P  ∨  Q  ∨  (∼P∧∼Q).\bigl((\sim P\wedge\sim Q)\;\vee\;P\bigr)\;\vee\;Q \;=\; P\;\vee\;Q\;\vee\;(\sim P\wedge\sim Q).

Next we distribute ∨\vee over ∧\wedge to simplify the mixed term:

P  ∨  Q  ∨  (∼P∧∼Q)=(P  ∨  Q)  ∨  (∼P∧∼Q)=(P  ∨  Q  ∨  ∼P)  ∧  (P  ∨  Q  ∨  ∼Q).P\;\vee\;Q\;\vee\;(\sim P\wedge\sim Q) = (P\;\vee\;Q)\;\vee\;(\sim P\wedge\sim Q) = \bigl(P\;\vee\;Q\;\vee\;\sim P\bigr)\;\wedge\;\bigl(P\;\vee\;Q\;\vee\;\sim Q\bigr).

Each of the two factors contains a full pair of complementary literals:

P  ∨  ∼P=T,Q  ∨  ∼Q=T.P\;\vee\;\sim P = \text{T},\quad Q\;\vee\;\sim Q = \text{T}.

Hence both brackets reduce to T (truth), and we are left with

T  ∧  T=T.\text{T}\;\wedge\;\text{T} = \text{T}.

Thus the given compound statement is a tautology; it is always true for every possible truth-value assignment to PP and QQ.

Among the provided options, Option D is

∼(P⇒Q)  ⇔  P∧∼Q,\sim(P \Rightarrow Q)\;\Leftrightarrow\;P\wedge\sim Q,

which is itself a biconditional connecting two logically equivalent expressions (since ∼(P⇒Q)≡P∧∼Q\sim(P \Rightarrow Q)\equiv P\wedge\sim Q). A biconditional between two identical propositions is also a tautology, i.e. it is always true. Therefore the original statement and Option D are equivalent.

Hence, the correct answer is Option 4.

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