RankRizz
JEE MAIN 2020 · 05 SEP S1+4 / −1EASYTRANSCRIBED

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

The negation of the Boolean expression x↔∼yx \leftrightarrow \sim y is equivalent to:

SOLUTION

We have to find the negation (logical NOT) of the Boolean statement x↔∼yx \leftrightarrow \sim y and then express the result in a simplified disjunctive form so that it can be matched with one of the given options.

First of all, let us recall the standard equivalence for a biconditional. The formula for any two propositions pp and qq is:

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

Now we apply this rule to the concrete biconditional x↔∼yx \leftrightarrow \sim y by replacing pp with xx and qq with ∼y\sim y. Doing so gives:

x↔∼y  =  (x∧∼y)  ∨  (∼x∧∼(∼y)).x \leftrightarrow \sim y \;=\; (x \wedge \sim y)\;\vee\;(\sim x \wedge \sim(\sim y)).

The double negation inside the second conjunct can be removed with the rule ∼(∼y)=y\sim(\sim y)=y. Hence we get:

x↔∼y  =  (x∧∼y)  ∨  (∼x∧y).x \leftrightarrow \sim y \;=\; (x \wedge \sim y)\;\vee\;(\sim x \wedge y).

We must now take the negation of the whole expression. So we write:

∼(x↔∼y)  =  ∼[(x∧∼y)  ∨  (∼x∧y)].\sim\bigl(x \leftrightarrow \sim y\bigr) \;=\; \sim\Bigl[(x \wedge \sim y)\;\vee\;(\sim x \wedge y)\Bigr].

To push the negation inside the parentheses, we invoke De Morgan’s law, which states:

∼(A∨B)  =  (∼A)∧(∼B).\sim(A \vee B)\;=\;(\sim A) \wedge (\sim B).

Here AA is x∧∼yx \wedge \sim y and BB is ∼x∧y\sim x \wedge y. Therefore:

∼[(x∧∼y)  ∨  (∼x∧y)]  =  [∼(x∧∼y)]  ∧  [∼(∼x∧y)].\sim\Bigl[(x \wedge \sim y)\;\vee\;(\sim x \wedge y)\Bigr] \;=\; \bigl[\sim(x \wedge \sim y)\bigr] \;\wedge\; \bigl[\sim(\sim x \wedge y)\bigr].

The next step is to remove each inner negation. Again, we apply De Morgan’s law, this time in the form ∼(A∧B)=(∼A)∨(∼B).\sim(A \wedge B) = (\sim A) \vee (\sim B). For the first bracket we have A=xA = x and B=∼yB = \sim y:

∼(x∧∼y)  =  (∼x)  ∨  (∼(∼y))  =  (∼x)∨y.\sim(x \wedge \sim y) \;=\; (\sim x) \;\vee\; (\sim(\sim y)) \;=\; (\sim x) \vee y.

For the second bracket we have A=∼xA = \sim x and B=yB = y:

∼(∼x∧y)  =  (∼(∼x))  ∨  (∼y)  =  x∨(∼y).\sim(\sim x \wedge y) \;=\; (\sim(\sim x)) \;\vee\; (\sim y) \;=\; x \vee (\sim y).

So the entire expression is now

[(∼x)∨y]  ∧  [x∨(∼y)].\bigl[(\sim x) \vee y\bigr] \;\wedge\; \bigl[x \vee (\sim y)\bigr].

To simplify, we distribute the conjunction across the disjunctions. The distributive law tells us:

(A∨B)∧(C∨D)  =  (A∧C)  ∨  (A∧D)  ∨  (B∧C)  ∨  (B∧D).(A \vee B)\wedge(C \vee D) \;=\; (A \wedge C)\;\vee\;(A \wedge D)\;\vee\;(B \wedge C)\;\vee\;(B \wedge D).

Letting A=∼x,  B=y,  C=x,  D=∼y,A = \sim x,\; B = y,\; C = x,\; D = \sim y, we compute each product term one by one:

1. (∼x)∧x=False,(\sim x) \wedge x = \text{False}, because a proposition and its negation cannot both be true.

2. (∼x)∧(∼y)=∼x∧∼y.(\sim x) \wedge (\sim y) = \sim x \wedge \sim y.

3. y∧x=x∧y.y \wedge x = x \wedge y.

4. y∧(∼y)=False,y \wedge (\sim y) = \text{False}, again because a variable and its negation cannot both be true.

Combining the surviving non-false terms under disjunction gives:

(∼x∧∼y)  ∨  (x∧y).(\sim x \wedge \sim y)\;\vee\;(x \wedge y).

Conventionally we write the positive term first, so we obtain the final simplified negation as:

(x∧y)  ∨  (∼x∧∼y).(x \wedge y)\;\vee\;(\sim x \wedge \sim y).

Now we match this with the options provided. Option B is exactly

(x∧y)∨(∼x∧∼y).(x \wedge y) \vee (\sim x \wedge \sim y).

Hence, the correct answer is Option 2.

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