1/9
Vocabulary flashcards covering the 9 cardinality identities of sets, De Morgan's laws, and memory rules for JEE set theory.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
Complement Identity
n(A′)=n(U)−n(A), which states that A′ contains everything in U that is not in A.
Union Identity
n(A∪B)=n(A)+n(B)−n(A∩B), which adds A and B and subtracts their overlap once to prevent double-counting.
Disjoint Union Identity
n(A∪B)=n(A)+n(B), if A∩B=∅, because disjoint sets have no common elements to subtract.
Intersection with Complement Identity
n(A∩B′)=n(A)−n(A∩B), which counts elements in A but not B (the same as A−B).
Both Complements Identity
n(A′∩B′)=n((A∪B)′)=n(U)−n(A∪B), which counts everything outside A∪B using De Morgan's law.
Union of Complements Identity
n(A′∪B′)=n((A∩B)′)=n(U)−n(A∩B), which counts everything except the common part of A and B using De Morgan's law.
Difference Identity
n(A−B)=n(A)−n(A∩B), which removes the overlap A∩B from A.
Intersection Identity
n(A∩B)=n(A)+n(B)−n(A∪B), which is obtained by rearranging the two-set union identity.
Three-Set Inclusion-Exclusion Identity
n(A∪B∪C)=n(A)+n(B)+n(C)−n(A∩B)−n(B∩C)−n(C∩A)+n(A∩B∩C), which adds the single sets, subtracts pairwise overlaps, and adds the triple overlap once.
Three-Set Inclusion-Exclusion Memory Pattern