Set: A collection of distinct objects or elements.
Intersection (A ∩ B): Elements that belong to both sets A and B.
Union (A ∪ B): Elements that belong to either set A or set B (or both).
Complement (A'): Elements not in set A.
- Draw overlapping circles for each set
- Start by filling the intersection region
- Calculate and fill the "only" regions
- Calculate and fill the universal set regions
- Verify that all regions sum to the total
Total surveyed: 100
Rock listeners: 40
Jazz listeners: 30
Both rock and jazz: 20
Only Rock = Total Rock - Both = 40 - 20 = 20
Only Jazz = Total Jazz - Both = 30 - 20 = 10
Rock or Jazz = Only Rock + Only Jazz + Both = 20 + 10 + 20 = 50
Or using formula: |A ∪ B| = |A| + |B| - |A ∩ B| = 40 + 30 - 20 = 50
Neither = Total - (Rock or Jazz) = 100 - 50 = 50
(a) 20 people like only rock music
(b) 10 people like only jazz music
(c) 50 people like rock or jazz (or both)
(d) 50 people like neither rock nor jazz
• Intersection: A ∩ B = Elements in both A and B
• Union Formula: |A ∪ B| = |A| + |B| - |A ∩ B|
• Exclusive Regions: Only A = |A| - |A ∩ B|
• Universal Set: Total = Union + Complement
Inclusion-Exclusion Principle: |A ∪ B| = |A| + |B| - |A ∩ B|, prevents double counting.
Disjoint Sets: Sets with no common elements (A ∩ B = ∅).
Universal set: 200 students
Calculus students: 120
Statistics students: 90
Both courses: 40
Only Calculus = Total Calculus - Both = 120 - 40 = 80
Only Statistics = Total Statistics - Both = 90 - 40 = 50
Using inclusion-exclusion: |A ∪ B| = |A| + |B| - |A ∩ B|
= 120 + 90 - 40 = 170
Or: Only Calc + Only Stats + Both = 80 + 50 + 40 = 170
Neither = Total - (Calculus or Statistics) = 200 - 170 = 30
Total = Only Calculus + Only Statistics + Both + Neither
= 80 + 50 + 40 + 30 = 200 ✓
This matches the given total of 200 students.
(a) 80 students are taking only calculus
(b) 50 students are taking only statistics
(c) 170 students are taking calculus or statistics (or both)
(d) 30 students are taking neither course
• Inclusion-Exclusion: |A ∪ B| = |A| + |B| - |A ∩ B|
• Exclusive Counts: |Only A| = |A| - |A ∩ B|
• Verification: Sum of all disjoint regions equals total
Three-Set Venn Diagram: Diagram with three overlapping circles showing all possible intersections.
Exactly Two: Belongs to two sets but not the third (A ∩ B ∩ C').
At Least One: Union of all three sets (A ∪ B ∪ C).
All three: 20
Pizza and Pasta only = (Pizza and Pasta) - (All three) = 60 - 20 = 40
Pizza and Salad only = (Pizza and Salad) - (All three) = 40 - 20 = 20
Pasta and Salad only = (Pasta and Salad) - (All three) = 30 - 20 = 10
Only Pizza = Total Pizza - (Pizza and Pasta only) - (Pizza and Salad only) - (All three)
= 150 - 40 - 20 - 20 = 70
Only Pasta = Total Pasta - (Pizza and Pasta only) - (Pasta and Salad only) - (All three)
= 120 - 40 - 10 - 20 = 50
Only Salad = Total Salad - (Pizza and Salad only) - (Pasta and Salad only) - (All three)
= 90 - 20 - 10 - 20 = 40
(a) Only Pizza = 70
(b) Exactly two dishes = (Pizza and Pasta only) + (Pizza and Salad only) + (Pasta and Salad only)
= 40 + 20 + 10 = 70
(c) At least one dish = Sum of all regions in the three sets
= 70 + 50 + 40 + 40 + 20 + 10 + 20 = 250
(d) None of the three = Total - At least one = 300 - 250 = 50
Only Pizza: 70
Only Pasta: 50
Only Salad: 40
Exactly two dishes: 70
All three: 20
None: 50
Total: 70 + 50 + 40 + 40 + 20 + 10 + 20 + 50 = 300 ✓
(a) 70 customers like only pizza
(b) 70 customers like exactly two dishes
(c) 250 customers like at least one dish
(d) 50 customers like none of the three dishes
• Three-Set Inclusion-Exclusion: |A∪B∪C| = |A| + |B| + |C| - |A∩B| - |A∩C| - |B∩C| + |A∩B∩C|
• Working Inside Out: Start with smallest intersections and work outward
• Disjoint Partition: Total = Sum of all non-overlapping regions
Set: A collection of distinct objects, called elements.
Subset: A ⊆ B means every element of A is also in B.
Empty Set: ∅, a set with no elements.
Universal Set: U, contains all elements under consideration.
Cardinality: |A|, the number of elements in set A.
• Union: |A ∪ B| = |A| + |B| - |A ∩ B|
• Three sets: |A ∪ B ∪ C| = |A| + |B| + |C| - |A∩B| - |A∩C| - |B∩C| + |A∩B∩C|
• Complement: |A'| = |U| - |A|
• Difference: |A - B| = |A| - |A ∩ B|
Medical Symptoms: Categorical health indicators that may co-occur.
At Least Two: Includes those with exactly two and those with all three symptoms.
Patients with all three symptoms: 50
Fever and Cough only = (Fever and Cough) - (All three) = 90 - 50 = 40
Fever and Fatigue only = (Fever and Fatigue) - (All three) = 100 - 50 = 50
Cough and Fatigue only = (Cough and Fatigue) - (All three) = 80 - 50 = 30
Only Fever = Total Fever - (Fever and Cough only) - (Fever and Fatigue only) - (All three)
= 200 - 40 - 50 - 50 = 60
Only Cough = Total Cough - (Fever and Cough only) - (Cough and Fatigue only) - (All three)
= 180 - 40 - 30 - 50 = 60
Only Fatigue = Total Fatigue - (Fever and Fatigue only) - (Cough and Fatigue only) - (All three)
= 220 - 50 - 30 - 50 = 90
(a) Only Fever = 60 patients
(b) Exactly one symptom = Only Fever + Only Cough + Only Fatigue = 60 + 60 + 90 = 210
(c) At least two symptoms = (Exactly two) + (All three) = (40 + 50 + 30) + 50 = 120 + 50 = 170
(d) No symptoms = Total - (At least one) = 500 - (210 + 120 + 50) = 500 - 380 = 120
|A ∪ B ∪ C| = |A| + |B| + |C| - |A∩B| - |A∩C| - |B∩C| + |A∩B∩C|
= 200 + 180 + 220 - 90 - 100 - 80 + 50 = 600 - 270 + 50 = 380
Patients with no symptoms = 500 - 380 = 120 ✓
(a) 60 patients have only fever
(b) 210 patients have exactly one symptom
(c) 170 patients have at least two symptoms
(d) 120 patients have no symptoms
• Three-Set Inclusion-Exclusion: Prevents overcounting in complex overlaps
• Systematic Approach: Innermost to outermost regions
• Verification: Cross-check using alternative formulas
Technology Adoption: Categorical variable representing device usage patterns.
Device Combinations: Various ways users may combine different technologies.
Users of all three devices: 80
Smartphone and Tablet only = 120 - 80 = 40
Smartphone and Laptop only = 140 - 80 = 60
Tablet and Laptop only = 100 - 80 = 20
Only Smartphone = 280 - 40 - 60 - 80 = 100
Only Tablet = 180 - 40 - 20 - 80 = 40
Only Laptop = 220 - 60 - 20 - 80 = 60
(a) Only Smartphone = 100 adults
(b) Exactly two devices = 40 + 60 + 20 = 120 adults
(c) At least one device = Sum of all regions with devices = 100 + 40 + 60 + 40 + 60 + 20 + 80 = 400
(d) No devices = Total - (At least one) = 400 - 400 = 0
|A ∪ B ∪ C| = 280 + 180 + 220 - 120 - 140 - 100 + 80 = 680 - 360 + 80 = 400
This confirms that all 400 adults use at least one device.
(a) 100 adults use only smartphones
(b) 120 adults use exactly two devices
(c) 400 adults use at least one device
(d) 0 adults use none of the devices (everyone uses at least one)
• Three-Set Inclusion-Exclusion: |A∪B∪C| = |A|+|B|+|C| - |A∩B|-|A∩C|-|B∩C| + |A∩B∩C|
• Region Calculation: Work systematically from center outward
• Verification: Cross-check with total population
Complete Summary: Set Theory and Venn Diagrams
Set: A well-defined collection of distinct objects.
Element: An object belonging to a set (denoted x ∈ A).
Subset: Every element of A is also in B (A ⊆ B).
Empty Set: A set with no elements (∅).
Universal Set: The set containing all objects under consideration (U).
Union (A ∪ B): All elements in A or B (or both).
Intersection (A ∩ B): Elements in both A and B.
Complement (A'): Elements not in A.
Difference (A - B): Elements in A but not in B.
Overlapping Circles: Represent sets and their relationships.
Regions: Each area represents a unique combination of set membership.
Three-Set Diagram: Creates 8 distinct regions.
Cardinality: Count elements in each region.
Step 1: Identify all sets and their cardinalities.
Step 2: Start with the most specific information (innermost intersections).
Step 3: Work outward, calculating each region.
Step 4: Verify total counts.
Set: A collection of well-defined and distinct objects, considered as an object in its own right.
Venn Diagram: A diagrammatic representation of all possible logical relations between different sets.
Cardinality: The number of elements in a set, denoted |A|.
Disjoint Sets: Sets with no elements in common (A ∩ B = ∅).
Partition: A collection of non-empty, pairwise disjoint sets whose union is the universal set.
- Diagram Setup: Draw appropriate number of overlapping circles.
- Start Center: Fill the intersection of all sets first.
- Work Outward: Calculate intersections of fewer sets.
- Calculate Singles: Find elements exclusive to each set.
- Verify Total: Ensure all regions sum to universal set size.
• Union: |A ∪ B| = |A| + |B| - |A ∩ B|
• Three sets: |A ∪ B ∪ C| = |A| + |B| + |C| - |A∩B| - |A∩C| - |B∩C| + |A∩B∩C|
• Complement: |A'| = |U| - |A|
• De Morgan's Laws: (A ∪ B)' = A' ∩ B', (A ∩ B)' = A' ∪ B'
Questions & Answers
Question: How do I know when to use inclusion-exclusion versus just adding up the numbers in a Venn diagram?
Answer: The key is understanding what you're calculating:
Use Inclusion-Exclusion When:
- Finding the size of a union (A ∪ B or A ∪ B ∪ C)
- You're given individual set sizes and intersection sizes
- You want to avoid double/triple counting
Formula:
For two sets: |A ∪ B| = |A| + |B| - |A ∩ B|
For three sets: |A ∪ B ∪ C| = |A| + |B| + |C| - |A∩B| - |A∩C| - |B∩C| + |A∩B∩C|
Add Individual Regions When:
- You already know the size of each distinct region
- Calculating total from a completed Venn diagram
- Finding specific combinations like "exactly two" or "only A"
Inclusion-exclusion prevents overcounting; adding regions assumes no overlap in the numbers you're adding.
Question: Why do we subtract the intersection in the inclusion-exclusion formula? Isn't that removing data?
Answer: We subtract the intersection to correct for double counting:
The Problem:
When you add |A| + |B|, elements in A ∩ B are counted twice - once in |A| and once in |B|.
The Solution:
Subtract |A ∩ B| once to remove the duplicate count:
|A ∪ B| = |A| + |B| - |A ∩ B|
Example:
Set A = {1, 2, 3}, Set B = {2, 3, 4}
A ∪ B = {1, 2, 3, 4} (size = 4)
If we just added |A| + |B| = 3 + 3 = 6, we'd overcount elements 2 and 3.
Using inclusion-exclusion: |A ∪ B| = 3 + 3 - 2 = 4 ✓
We're not removing data; we're removing the double count to get the correct total.
Question: How many regions are there in a Venn diagram with 4 sets? Can we draw them?
Answer: For n sets, there are 2ⁿ possible regions (including the outside region).
For 4 sets: 2⁴ = 16 regions
Challenge: While 4-set Venn diagrams exist, they become very complex to draw with perfect circles. Traditional circular Venn diagrams are limited to 3 sets.
For more than 3 sets:
- Ellipses or other shapes are used
- Complexity makes them hard to read
- Set notation and formulas become more practical
For 4 or more sets, it's often easier to work with set operations and formulas rather than visual diagrams.