Skip to content

Mathematics · Ch 12 — Discrete Mathematics

Duality

12.3.4

Duality

Definition 12.19 (Dual). The dual of a statement formula is obtained by replacing every ∨\vee with ∧\wedge, every ∧\wedge with ∨\vee, every T\mathbb T with F\mathbb F, and every F\mathbb F with T\mathbb T.

Remarks.

  1. The negation symbol ¬\neg is never changed while forming the dual.
  2. The dual of a dual is the original statement itself (applying the swap twice undoes it).
  3. T\mathbb T (tautology) and F\mathbb F (contradiction) are duals of each other.
  4. Every T\mathbb T becomes F\mathbb F and vice versa.

Principle of Duality. If a compound statement S1S_1 contains only ¬,∧,∨\neg,\wedge,\vee (no →\to or ↔\leftrightarrow), and S2S_2 is obtained from S1S_1 by swapping ∧↔∨\wedge\leftrightarrow\vee, then S1S_1 is a tautology if and only if S2S_2 is a contradiction.

Worked patterns.

  • The dual of (p∨q)∧(r∨F)(p\vee q)\wedge(r\vee\mathbb F) is (p∧q)∨(r∧T)(p\wedge q)\vee(r\wedge\mathbb T) -- every ∨↔∧\vee\leftrightarrow\wedge and F→T\mathbb F\to\mathbb T.
  • The dual of p∧[¬q∨(p∧q)∨¬r]p\wedge[\neg q\vee(p\wedge q)\vee\neg r] is p∨[¬q∧(p∨q)∧¬r]p\vee[\neg q\wedge(p\vee q)\wedge\neg r] -- note ¬q\neg q and ¬r\neg r are left completely untouched, only the ∧/∨\wedge/\vee around them flip. …