statement theorem
Inclusion–exclusion for two sets
Statement
Let and be finite sets. Then Equivalently, .
Remarks
If , this is the rule of sum. For three sets: . The inclusion–exclusion principle is the version for sets.
Explanations
L1 human
When you add the sizes of and , you count the elements of both sets twice. Subtract the size of once to correct this. For example, students play football, play chess, and do both, so 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.
- no evidence level
- Cardinality of a finite set definition
- Rule of sum statement
- Inclusion–exclusion for two sets statement
What depends on this
2 nodes use this node, directly or through other nodes.
- Addition rule for two events 0BZQ6ZX584
- Inclusion–exclusion principle 0FF7726C7P
Sources
What links here
Used by
- Addition rule for two events 0BZQ6ZX584
- Inclusion–exclusion principle 0FF7726C7P