6.8.3. Equality of Dual and Original Statement

Dual of a compound proposition is denoted by this notation s*. What exactly is the dual? How do we construct a dual of a compound proposition? What we have to do is wherever we have an occurrence of conjunction in s, we replace them by a disjunction. Wherever there is a disjunction we replace them by a conjunction. Wherever there is an occurrence of the constant true, we replace them by constant false and wherever there is an occurrence of false I replace them by constant true.

The dual of a compound proposition transforms the operators present within it. Specifically, for any expression that contains conjunctions (ANDs), they are switched to disjunctions (ORs), and vice versa. Additionally, true constants (always true) are swapped with false constants (always false). Similarly, false becomes true. The notation for representing the dual of a statement is s*, which signifies this transformed version of the original statement.

Think of the dual of a compound proposition as switching the lights in a room. If you have a room with multiple light switches, flipping one switch means changing the state of that light. If 'AND' is like turning on all lights for the room to be bright, then its dual 'OR' means just one light needs to be on for the room to have some light. These switches exemplify how the dual operation modifies the original setup.

The first part of the question is you are given some statements and you have to construct their duals. So here is one of the compound propositions. While forming the dual I do not change the literals; the literal remains in their original form. I just have to change the conjunctions and disjunctions and the constants.

When tasked with constructing the dual of a compound statement, it’s crucial to only modify the logical connective symbols. The actual variables (or literals) in the proposition remain untouched. For example, if you originally have a statement that uses both 'AND' and 'OR', your task is to switch these for their counterparts (AND to OR, and OR to AND). All while keeping the actual variables intact. This constructed dual is useful in various mathematical and logical analyses.

Imagine you are baking a cake using specific ingredients like flour and sugar, where flour represents 'AND' and sugar represents 'OR'. If your recipe says, 'Add flour AND sugar,' that’s one way to make it sweet. The dual would be like flipping the instruction to say, 'Add sugar OR flour'. The ingredients remain the same, only the method of combining them has changed, showing how their roles have switched in context.

The second part of the question asks when it is possible that the dual of the statement is exactly equal to the original statement. The answer is very simple: its s* will be equal to s only when s is a single literal and that too different from the constants true or false.

For the dual of a statement to be exactly the same as the original, it must consist solely of a single variable, and it cannot be either of the truth constants (true or false). This is because if additional operators like 'AND' or 'OR' are introduced, their transformations through dualization will invariably change the expression, resulting in a different outcome.

Consider a light bulb: when on, it’s true, and when off, it’s false. If you think of the dual operation as asking if the light bulb is either 'on' or 'off', the answer depends on having more than just a simple 'light is on' statement. However, if you only have a statement that says, 'This bulb is either light or not light' — it remains true regardless of the state. Therefore, only single memories of the bulb can reflect the unchanged dual; complex statements cannot.

The third part of question 7 asks you to show that if you take the dual of a statement and then again take its dual, you will get back the original expression.

When you take the dual of an expression and then take the dual of that result, you effectively reverse the transformations made in the first step. This means any conjunctions that were switched to disjunctions revert back, and constants toggle back to their original form (true to false and vice versa). Hence, performing the dual operation twice restores the original proposition, showcasing a fundamental property of logical operations.

Think about editing a photo using filters. First, you might apply a filter that brightens the image (akin to creating a dual). If you then apply a filter that darkens it back, you effectively restore the photo to its original state. Just like in digital editing where repeated actions can revert changes, applying the dual operation twice on a statement returns you fully to where you started.

The last part of question 7 is the following. You are given two compound propositions P and Q, and they are logically equivalent. It is given to you that P and Q contain only conjunction, disjunction, and negation; there is no occurrence of implications and bi-implication. In that case, we have to show that the dual of P and dual of Q are also logically equivalent.

If two compound propositions are logically equivalent, transforming them into their duals preserves their equivalence. After applying the properties of dualization, any negations will also remain equivalent. This is a key principle emphasizing that the logical structure of statements can be mirrored in their dual forms. If P equals Q under logical operations, then their counterparts when converted to duals would also equate, ensuring consistency in logical statements.

Imagine two friends, Alice and Bob, who agree on everything — they share the same opinions. If you create a list of their combined opinions (P and Q) and you invert that list to understand their dual perspectives, you'll find that when they switch positions in discussing their thoughts, their core beliefs remain the same. Just like Alice and Bob’s consistent views, the logical equivalence of their statements implies that their duals will reflect this shared quality.

--