Universal Set
The rectangle \(U\) contains every object under discussion.
Note 24
Venn Diagrams and Set Relationships
Complete notes for SSC Combined Graduate Level examinations
1The Big Picture — Graphic Mind Map
Intersection
The shared lens contains members common to both sets.
Union
Everything in either set, including the overlap.
Subset
One class lies wholly inside a broader class.
Disjoint
No member is common; the circles do not overlap.
Complement
Members in \(U\) but outside the named set.
Three Sets
Seven internal regions track only, pairwise-only, and all three.
Existence Dot
“Some” places at least one definite member in a region.
1. Define
universe & sets
➜universe & sets
2. Draw
relations
➜relations
3. Fill
deepest overlap
➜deepest overlap
4. Subtract
only-regions
➜only-regions
5. Verify
total & wording
total & wording
2The Foundation — Sets, Regions and Complete Counting
2.1 Set Language
A set is a well-defined collection. If object \(x\) belongs to set \(A\), write \(x\in A\); otherwise \(x\notin A\).
- Empty set: \(\varnothing\)
- Cardinality: \(n(A)\)
- Subset: \(A\subseteq B\)
- Proper subset: \(A\subset B\)
2.2 Region Meaning
- \(A\cap B\): in both.
- \(A\cup B\): in at least one.
- \(A-B\): in \(A\) but not \(B\).
- \(A'\): outside \(A\) but inside \(U\).
- Neither: \((A\cup B)'\).
2.3 Set Operations — Visual Dictionary
| Wording | Notation | Region | Counting expression |
|---|---|---|---|
| Both / common | \(A\cap B\) | Overlap only | \(n(A\cap B)\) |
| At least one | \(A\cup B\) | All parts of both circles | \(n(A)+n(B)-n(A\cap B)\) |
| Only \(A\) | \(A-B\) | \(A\) excluding overlap | \(n(A)-n(A\cap B)\) |
| Exactly one | \((A-B)\cup(B-A)\) | Two non-overlap wings | \(n(A)+n(B)-2n(A\cap B)\) |
| Neither | \((A\cup B)'\) | Outside both circles | \(n(U)-n(A\cup B)\) |
2.4 Two-Set Inclusion–Exclusion
\[n(A\cup B)=n(A)+n(B)-n(A\cap B)\]
The overlap is counted twice in \(n(A)+n(B)\), so subtract it once.
2.5 Only-Region Method
\[n(A\text{ only})=n(A)-n(A\cap B)\]
“Only” removes every overlap containing the named set.
2.6 Total with Neither
\[n(U)=n(A\cup B)+n(\text{neither})\]
The rectangle outside the circles is part of the total.
2.7 Two-Set Fill Order
Deepest first
- Place \(A\cap B\).
- Subtract it from each set total.
- Add the three inside regions.
- Subtract from \(U\) to get neither.
Audit equation
\[A_{\rm only}+A\cap B+B_{\rm only}+\text{neither}=n(U)\]
Every person/object must occupy exactly one final region.
2.8 Three-Set Inclusion–Exclusion
At least one
\[\begin{aligned}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)\end{aligned}\]
Why add triple back?
Single totals count the centre three times. Subtracting the three pairwise intersections removes it three times, leaving zero; add it once to count it correctly.
2.9 Three-Set Region Formula Bank
| Required region | Formula |
|---|---|
| \(A\cap B\) only | \(n(A\cap B)-n(A\cap B\cap C)\) |
| Only \(A\) | \(n(A)-n(A\cap B)-n(A\cap C)+n(A\cap B\cap C)\) |
| Exactly two | \(n(A\cap B)+n(B\cap C)+n(C\cap A)-3n(A\cap B\cap C)\) |
| At least two | \(n(A\cap B)+n(B\cap C)+n(C\cap A)-2n(A\cap B\cap C)\) |
| Exactly one | Sum of the three only-regions |
| None | \(n(U)-n(A\cup B\cup C)\) |
2.10 Three-Set Fill Order
- All three.
- Each pairwise-only region.
- Each single-only region.
- Neither.
Always work from deepest overlap outward.
2.11 “Pairwise” Ambiguity
Unless “only” is stated, \(n(A\cap B)\) normally includes members also in \(C\). Subtract the triple intersection to obtain pairwise-only.
2.12 Unknown Total
If neither and all inside regions are known, add them. If total and union are known, subtract to find neither.
2.13 Relationship Concepts — Choose the Diagram
| Verbal relationship | Diagram | Example structure |
|---|---|---|
| Every \(A\) is \(B\) | \(A\) inside \(B\) | Squares inside rectangles |
| No \(A\) is \(B\) | Separate circles | Even and odd integers |
| Some \(A\) are \(B\), some are not | Partial overlap | Teachers and writers |
| \(A\) and \(B\) are separate subsets of \(C\) | Two disjoint circles inside a larger circle | Two exclusive species within a genus |
| Three independent categories | Three overlapping circles | Three optional interests |
| Same class under two names | Coincident circles | Equivalent definitions |
2.14 Classification and Overlap
Species–Genus
Specific class inside broader class.
Mutually Exclusive
No possible common member.
Cross-Classifying
Attributes can coexist for some members.
Coextensive
Both descriptions pick exactly the same members.
2.15 Syllogism Representation
All \(S\) are \(P\)
Place \(S\) entirely inside \(P\). Do not imply that all \(P\) are \(S\).
No \(S\) is \(P\)
Use disjoint circles. The relation safely converts: no \(P\) is \(S\).
Some \(S\) are \(P\)
Place an existence dot in the overlap. The circles need not otherwise be fixed.
2.16 Possibility and Multiple Diagrams
Definite conclusion
A conclusion follows only if it holds in every diagram consistent with the premises.
Possibility conclusion
A possibility follows if at least one valid diagram permits it and no premise forbids it.
2.17 Boundary & Data Checks
| Check | Requirement |
|---|---|
| Non-negativity | Every final region count must satisfy \(x\ge0\) |
| Intersection limit | \(n(A\cap B)\le\min\{n(A),n(B)\}\) |
| Union bounds | \(\max\{n(A),n(B)\}\le n(A\cup B)\le n(A)+n(B)\) |
| Total reconciliation | Sum of mutually exclusive final regions equals \(n(U)\) |
| Integer condition | Counts of discrete members are whole numbers |
| Wording match | “Both” may include triple overlap; “both only” excludes it |
3Short Tricks & Magic Formulas
3.1 Centre First
For three sets, fill all three, then pairwise-only, then single-only, then neither.
3.2 Add Singles, Subtract Doubles
Two-set union: add both set totals and subtract their common part once.
3.3 Triple Comes Back
In three-set inclusion–exclusion: add singles, subtract pairs, add the triple once.
3.4 “Only” Means Subtract
Remove all overlaps touching the named set; restore triple overlap if it was subtracted twice.
3.5 Neither Last
Compute the union first, then \(n(\text{neither})=n(U)-n(\text{union})\).
3.6 Exactly Two Shortcut
Sum pairwise intersections and subtract the triple three times.
3.7 “All Goes Inside”
In syllogisms, subject inside predicate—never reverse the container.
3.8 “Some Gets a Dot”
A witness dot captures existence without turning “some” into “all.”
3.9 Rectangle Audit
Add every mutually exclusive region. It must equal the universe total.
3.10 Non-Negative Test
A negative only-region means the data, interpretation or arithmetic is wrong.
3.11 Possibility Test
Try to draw one valid arrangement. If successful and not forbidden, “may be” follows.
3.12 Circle the Qualifier
Mark “only,” “at least,” “exactly,” “none,” and “all three” before calculating.
3.13 Formula Strip
| Need | Formula |
|---|---|
| Two-set union | \(n(A\cup B)=n(A)+n(B)-n(A\cap B)\) |
| Only \(A\) | \(n(A)-n(A\cap B)\) |
| Exactly one of two | \(n(A)+n(B)-2n(A\cap B)\) |
| Neither | \(n(U)-n(A\cup B)\) |
| Three-set union | \(\sum n(\text{single})-\sum n(\text{pair})+n(A\cap B\cap C)\) |
| Exactly two of three | \(\sum n(\text{pair})-3n(A\cap B\cap C)\) |
| At least two of three | \(\sum n(\text{pair})-2n(A\cap B\cap C)\) |
4The SSC / TCS Traps — Red Flags
🚩 4.1 Double-Counting Overlap
Adding set totals counts common members twice; inclusion–exclusion repairs it.
🚩 4.2 Pair Includes Triple
“In \(A\) and \(B\)” includes the centre unless “but not \(C\)” or “only” is stated.
🚩 4.3 “Only” Ignored
Only-region counts exclude every overlap, not merely the deepest overlap.
🚩 4.4 Neither Omitted
The universe includes members outside every circle.
🚩 4.5 Subset Reversed
All \(A\) are \(B\) does not mean all \(B\) are \(A\).
🚩 4.6 Some Becomes All
An existence dot represents at least one member, not the entire class.
🚩 4.7 Existence Invented
Universal statements may not establish that a class contains any member.
🚩 4.8 Subtracting Triple Once
For exactly two, triple members contaminate all three pair totals and must be removed three times.
🚩 4.9 Negative Region Accepted
Counts cannot be negative; revisit wording or data placement.
🚩 4.10 May vs Must
One possible diagram proves possibility; every valid diagram is needed for certainty.
🚩 4.11 Wrong Fill Order
Filling single totals first forces repeated corrections; deepest overlap must come first.
🚩 4.12 Real-World Assumptions
Choose relations stated or logically necessary—not stereotypes about the class names.
Exam guardrail: every final number belongs to one mutually exclusive region. If two regions overlap conceptually, the diagram has not yet been resolved.
5Memory Hooks & Mnemonics
5.1 “DFSA” Fill
Deepest, Face pairs, Singles, Around/outside.
5.2 “Meet Twice? Subtract Once”
The two-set overlap appears twice in the sum of set totals.
5.3 “Triple Returns Home”
Add the three-way centre back once in inclusion–exclusion.
5.4 “Neither Lives in Corners”
Look inside the rectangle but outside all circles.
5.5 “All Goes Inside”
The smaller subject class sits inside the predicate class.
5.6 “Some Gets a Dot”
The dot remembers existence without exaggerating quantity.
5.7 “May Needs One Door”
One valid diagram is enough for possibility; “must” needs every door.
5.8 “Rectangle Pays the Bill”
All final regions must add up exactly to the universal total.
Counting Recall
- Mark the universe.
- Circle all qualifiers.
- Fill triple and pair overlaps.
- Subtract to obtain only-regions.
- Reconcile with the total.
Relationship Recall
- All → inside.
- No → apart.
- Some → existence dot.
- May → one possible diagram.
- Must → every possible diagram.
Final recall line: “Draw the relationship, fill the deepest region first, and make every region pay into the total.”