Math 2.0

statement theorem

Inclusion–exclusion for two sets

Statement

Let AA and BB be finite sets. Then ∣A∪B∣+∣A∩B∣=∣A∣+∣B∣.|A \cup B| + |A \cap B| = |A| + |B|. Equivalently, ∣A∪B∣=∣A∣+∣B∣−∣A∩B∣|A \cup B| = |A| + |B| - |A \cap B|.

Remarks

If A∩B=∅A \cap B = \varnothing, this is the rule of sum. For three sets: ∣A∪B∪C∣=∣A∣+∣B∣+∣C∣−∣A∩B∣−∣A∩C∣−∣B∩C∣+∣A∩B∩C∣|A \cup B \cup C| = |A| + |B| + |C| - |A \cap B| - |A \cap C| - |B \cap C| + |A \cap B \cap C|. The inclusion–exclusion principle is the version for nn sets.

Explanations

L1 human

When you add the sizes of AA and BB, you count the elements of both sets twice. Subtract the size of A∩BA \cap B once to correct this. For example, 1212 students play football, 88 play chess, and 33 do both, so 1717 students do at least one.

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 this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Cardinality of a finite set definition
  2. Rule of sum statement
  3. Inclusion–exclusion for two sets statement

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Inclusion–exclusion_principle, Formula