1/17
Vocabulary flashcards covering the fundamental laws and equalities from Theorem 5.18 (Algebra of Set Operations).
Theorem 5.18 (Algebra of Set Operations)
A theorem stating that if A, B, and C are subsets of a universal set U, then specific algebraic set equalities hold regarding the empty set, universal set, idempotent laws, commutative laws, associative laws, and distributive laws.
Properties of the Empty Set and the Universal Set
The set operational identities stating that A×∅=∅, A∪∅=A, A∩U=A, and A∪U=U.
Idempotent Laws
The set equalities stating that operating on a set with itself yields the same set: A∩A=A and A∪A=A.
Commutative Laws
The set equalities stating that the order of the sets does not change the result: A∩B=B∩A and A∪B=B∪A.
Associative Laws
The set equalities stating that grouping does not affect the outcome of consecutive identical operations: (A∩B)∩C=A∩(B∩C) and (A∪B)∪C=A∪(B∪C).
Distributive Laws
The set equalities stating that intersection distributes over union, and union distributes over intersection: A∩(B∪C)=(A∩B)∪(A∩C) and A∪(B∩C)=(A∪B)∩(A∪C).
A∪B=
B∪A
A∩B=
B∩A
A×∅=
∅
A∪∅=
A
A∩U=
A
A∪U=
U
A∩A=
A
A∪A=
A
(A∩B)∩C=
A∩(B∩C)
(A∪B)∪C=
A∪(B∪C)
A∩(B∪C)=
(A∩B)∪(A∩C)
A∪(B∩C)=
(A∪B)∩(A∪C)}],