Math 2.0

statement theorem

De Morgan's laws for sets

Statement

Let UU be a set and let AA and BB be subsets of UU. Write Xc=U∖XX^c = U \setminus X for the complement of a subset XX in UU. Then (A∪B)c=Ac∩Bc,(A \cup B)^{c} = A^{c} \cap B^{c}, (A∩B)c=Ac∪Bc.(A \cap B)^{c} = A^{c} \cup B^{c}.

Remarks

The laws come from De Morgan's laws of logic, applied to x∈Ax \in A and x∈Bx \in B. They hold also for arbitrary families: the complement of ⋃iAi\bigcup_i A_i is ⋂iAic\bigcap_i A_i^c, and the complement of ⋂iAi\bigcap_i A_i is ⋃iAic\bigcup_i A_i^c. With set differences, C∖(A∪B)=(C∖A)∩(C∖B)C \setminus (A \cup B) = (C \setminus A) \cap (C \setminus B) for each set CC.

Explanations

L1 human

An element is outside A∪BA \cup B exactly when it is outside AA and outside BB. An element is outside A∩BA \cap B exactly when it is outside AA or outside BB. A Venn diagram with two circles shows both laws.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

5 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/De_Morgan's_laws, lead section