The real numbers R
-
Rational numbers Q
p/q with p, q integers and q ≠ 0
- Integers Z
- inside Z: whole numbers W = {0, 1, 2, ...}
- inside W: natural numbers N = {1, 2, 3, ...}
- Fractions such as −7/3
-
Irrational numbers
real but not rational
- √2, √5
- π, e
| Law | Union form | Intersection form |
|---|---|---|
| Commutative | A ∪ B = B ∪ A | A ∩ B = B ∩ A |
| Associative | (A ∪ B) ∪ C = A ∪ (B ∪ C) | (A ∩ B) ∩ C = A ∩ (B ∩ C) |
| Distributive | A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) | A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) |
| Identity | A ∪ ∅ = A | A ∩ U = A |
| Idempotent | A ∪ A = A | A ∩ A = A |
| Absorption | A ∪ (A ∩ B) = A | A ∩ (A ∪ B) = A |
| Complement | A ∪ A′ = U, ∅′ = U | A ∩ A′ = ∅, U′ = ∅ |
| De Morgan | (A ∪ B)′ = A′ ∩ B′ | (A ∩ B)′ = A′ ∪ B′ |
n(A ∪ B) = n(A) + n(B) − n(A ∩ B); for disjoint sets n(A ∪ B) = n(A) + n(B). n(A ∪ B ∪ C) = n(A) + n(B) + n(C) − n(A ∩ B) − n(B ∩ C) − n(A ∩ C) + n(A ∩ B ∩ C).
Counting 'only A' in a three-set problem
- Start with n(A) everyone in A
- Subtract n(A ∩ B) and n(A ∩ C) removes those who are also in B or C
- Add back n(A ∩ B ∩ C) it was removed twice
- Result: n(A ∩ B′ ∩ C′) those in A only
Key takeaways: ∈ links a member to a set, ⊆ links two sets; ∅ and A are the trivial subsets of A; n(P(A)) = 2ⁿ; A∆B = (A ∪ B) − (A ∩ B); De Morgan's laws turn a complement of a union into an intersection of complements; and in three-set counting problems, add back what was subtracted twice.