Cardinality of Sets: 9 Identities

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/9

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering the 9 cardinality identities of sets, De Morgan's laws, and memory rules for JEE set theory.

Last updated 4:59 PM on 9/4/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

10 Terms

1
New cards

Complement Identity

n(A)=n(U)n(A)n(A') = n(U) - n(A), which states that AA' contains everything in UU that is not in AA.

2
New cards

Union Identity

n(AB)=n(A)+n(B)n(AB)n(A \cup B) = n(A) + n(B) - n(A \cap B), which adds AA and BB and subtracts their overlap once to prevent double-counting.

3
New cards

Disjoint Union Identity

n(AB)=n(A)+n(B)n(A \cup B) = n(A) + n(B), if AB=A \cap B = \emptyset, because disjoint sets have no common elements to subtract.

4
New cards

Intersection with Complement Identity

n(AB)=n(A)n(AB)n(A \cap B') = n(A) - n(A \cap B), which counts elements in AA but not BB (the same as ABA - B).

5
New cards

Both Complements Identity

n(AB)=n((AB))=n(U)n(AB)n(A' \cap B') = n((A \cup B)') = n(U) - n(A \cup B), which counts everything outside ABA \cup B using De Morgan's law.

6
New cards

Union of Complements Identity

n(AB)=n((AB))=n(U)n(AB)n(A' \cup B') = n((A \cap B)') = n(U) - n(A \cap B), which counts everything except the common part of AA and BB using De Morgan's law.

7
New cards

Difference Identity

n(AB)=n(A)n(AB)n(A - B) = n(A) - n(A \cap B), which removes the overlap ABA \cap B from AA.

8
New cards

Intersection Identity

n(AB)=n(A)+n(B)n(AB)n(A \cap B) = n(A) + n(B) - n(A \cup B), which is obtained by rearranging the two-set union identity.

9
New cards

Three-Set Inclusion-Exclusion Identity

n(ABC)=n(A)+n(B)+n(C)n(AB)n(BC)n(CA)+n(ABC)n(A \cup B \cup C) = n(A) + n(B) + n(C) - n(A \cap B) - n(B \cap C) - n(C \cap A) + n(A \cap B \cap C), which adds the single sets, subtracts pairwise overlaps, and adds the triple overlap once.

10
New cards

Three-Set Inclusion-Exclusion Memory Pattern

  • singles − pairs + triple