\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
Set Complements
Pair Unions
Pair Intersections
Needed by:
Generalized Set Dualities
Set Exercises
Links:
Sheet PDF
Graph PDF

Set Dualities

Why

How does taking complements relate to forming unions and intersections.

Complements of unions or intersections

Let $E$ denote a set. Let $A$ and $B$ denote sets and $A, B \subset E$. All complements are taken with respect to $E$. The following are known as DeMorgan’s Laws.1

$\complement{A \cup B} = \complement{A} \cap \complement{B}$
$\complement{A \cap B} = \complement{A} \cup \complement{B}$

Principle of duality

As a result of DeMorgan’s Laws2 and basic facts about complements (see  Set Complements) theorems about sets often come in pairs. In other words, given an inclusion or identity relation involving complements, unions and intersections of some set (above $E$) if we replace all sets by their complemnets, swap unions and intersections, and flip all inclusions we obtain another, true, result. The correspondence is called the principle of duality for sets.


  1. Proofs will appear in a future edition. ↩︎
  2. Future editions will change the name to remove the reference to DeMorgan in accordance with the project’s policy on naming. ↩︎
Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc About Show the old page view