Math 2.0

statement proposition

Complement principle

Statement

Let UU be a finite set and let A⊆UA \subseteq U. Let Ac=U∖AA^c = U \setminus A be the complement of AA in UU. Then ∣Ac∣=∣U∣−∣A∣|A^c| = |U| - |A|.

Remarks

The rule follows from the rule of sum, because UU is the disjoint union of AA and AcA^c. It is useful when the complement is easier to count. For example, the number of words of length nn over {0,1}\{0, 1\} that contain at least one 11 is 2n−12^n - 1.

Explanations

L1 human

Sometimes it is easier to count what you do not want. To count the outcomes with at least one six in two dice rolls, count the outcomes with no six: 5⋅5=255 \cdot 5 = 25. Then 36−25=1136 - 25 = 11 outcomes have at least one six.

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. Complement principle statement

Sources

  1. Web https://en.wikipedia.org/wiki/Complement_(set_theory), Properties