5.1 Set Theory, Operations & Venn Diagrams

5.1 Set Theory, Operations & Venn Diagrams

Set theory provides the foundational language for formal mathematics, probability modeling, and data analysis on the Bocconi Admission Test. Questions testing set theory typically appear as overlapping group word problems, formal set algebra simplifications, or cardinality evaluations. Under the test's strict timing of approximately 90 seconds per question, mastering systematic Venn diagram decompositions and the algebraic Principle of Inclusion-Exclusion enables candidates to extract numerical solutions swiftly while avoiding double-counting traps.

---

1. Foundational Set Concepts and Notation

A set is a well-defined collection of distinct mathematical objects, termed elements. If an element $x$ belongs to set $A$, we write $x \in A$; if it does not, we write $x \notin A$.

Core Definitions and Classifications

• Universal Set ($U$): The overarching frame of reference containing all possible elements under consideration in a given problem.
• Empty Set ($\emptyset$ or $\{\}$): The unique set containing no elements, with cardinality $|\emptyset| = 0$. The empty set is a subset of every set: $\forall A, \, \emptyset \subseteq A$.
• Subset ($A \subseteq B$): Every element of $A$ is also an element of $B$: $$\forall x, \quad (x \in A \implies x \in B)$$
• Proper Subset ($A \subset B$): $A \subseteq B$ and $A \neq B$ (meaning there exists at least one element $y \in B$ such that $y \notin A$).
• Cardinality ($|A|$ or $n(A)$): The total number of elements in a finite set $A$.
• Power Set ($\mathcal{P}(A)$): The set of all subsets of $A$. If $|A| = n$, the power set contains exactly $2^n$ elements: $$|\mathcal{P}(A)| = 2^{|A|}$$ Proof sketch: For each of the $n$ elements, there are 2 independent binary choices: include it in the subset or exclude it. By the multiplication principle, there are $2 \times 2 \times \dots \times 2 = 2^n$ unique subsets.

---

2. Fundamental Set Operations

Given subsets $A, B \subseteq U$, standard binary and unary operations generate new sets:

Cardinality of Differences and Partitions

Because $(A \setminus B)$ and $(A \cap B)$ are mutually disjoint and their union is $A$:

$$|A \setminus B| = |A| - |A \cap B|$$

Similarly, the symmetric difference cardinality is:

$$|A \Delta B| = |A \setminus B| + |B \setminus A| = |A| + |B| - 2|A \cap B| = |A \cup B| - |A \cap B|$$

---

3. Cartesian Product and Cardinality

The Cartesian product of two sets $A$ and $B$, denoted $A \times B$, is the set of all ordered pairs $(a, b)$ such that $a \in A$ and $b \in B$:

$$A \times B = \{(a, b) \mid a \in A, \, b \in B\}$$

Essential Properties

1. Cardinality Rule: $|A \times B| = |A| \cdot |B|$.
2. Non-Commutativity: In general, $A \times B \neq B \times A$ unless $A = B$ or at least one set is empty ($A = \emptyset$ or $B = \emptyset$).
3. Distributivity over Union and Intersection:
   • $A \times (B \cup C) = (A \times B) \cup (A \times C)$
   • $A \times (B \cap C) = (A \times B) \cap (A \times C)$

---

4. Set Identities and De Morgan's Laws

Set operations satisfy Boolean algebraic laws that mirror propositional logic:

Commutative, Associative, and Distributive Laws

• Distributive Law of $\cap$ over $\cup$: $A \cap (B \cup C) = (A \cap B) \cup (A \cap C)$
• Distributive Law of $\cup$ over $\cap$: $A \cup (B \cap C) = (A \cup B) \cap (A \cup C)$

De Morgan's Laws

De Morgan's Laws describe how complementation interchanges unions and intersections:

1. Complement of a Union: The complement of a union is the intersection of the complements: $$(A \cup B)^c = A^c \cap B^c$$ Verbal interpretation: Failing to be in either $A$ or $B$ means you are outside $A$ and outside $B$.
2. Complement of an Intersection: The complement of an intersection is the union of the complements: $$(A \cap B)^c = A^c \cup B^c$$ Verbal interpretation: Failing to be in both $A$ and $B$ means you are either outside $A$ or outside $B$.

---

5. The Principle of Inclusion-Exclusion (PIE)

When summing the cardinalities of overlapping sets, simple addition overcounts intersecting regions. The Principle of Inclusion-Exclusion provides exact formulas to adjust for this overlap.

Two-Set Inclusion-Exclusion

For any two finite sets $A$ and $B$:

$$|A \cup B| = |A| + |B| - |A \cap B|$$

Rearranging this identity allows computing the intersection directly:

$$|A \cap B| = |A| + |B| - |A \cup B|$$

Three-Set Inclusion-Exclusion

For any three finite sets $A, B,$ and $C$:

$$|A \cup B \cup C| = |A| + |B| + |C| - (|A \cap B| + |A \cap C| + |B \cap C|) + |A \cap B \cap C|$$

Derived Regional Formulas for 3 Sets

In Bocconi word problems, questions frequently ask for specific sub-categories:

• Exactly One Set: $$|\text{Exactly 1}| = (|A| + |B| + |C|) - 2(|A \cap B| + |A \cap C| + |B \cap C|) + 3|A \cap B \cap C|$$
• Exactly Two Sets: $$|\text{Exactly 2}| = (|A \cap B| + |A \cap C| + |B \cap C|) - 3|A \cap B \cap C|$$
• At Least Two Sets: $$|\text{At Least 2}| = (|A \cap B| + |A \cap C| + |B \cap C|) - 2|A \cap B \cap C|$$

---

6. Venn Diagram Problem-Solving Protocol

To solve overlapping group problems without algebraic confusion under exam conditions, execute this 5-step protocol:

1. Define the Total: Identify $|U|$ and write down all given marginal totals ($|A|, |B|, |C|$).
2. Isolate the Core (Innermost Region): Identify or assign a variable $x$ to the central intersection: $|A \cap B \cap C| = x$.
3. Populate Pairwise-Only Regions: For each pair, subtract the core: $|A \cap B \text{ only}| = |A \cap B| - x$.
4. Populate Single-Set-Only Regions: For each set, subtract all three adjacent overlapping regions from the marginal total: $$|A \text{ only}| = |A| - [|A \cap B \text{ only}| + |A \cap C \text{ only}| + x]$$
5. Account for Neither: Calculate elements belonging to none of the sets: $$|\text{Neither}| = |U| - |A \cup B \cup C|$$

---

7. Common Bocconi Traps & Exam Strategies

1. Confusing 'Set A' with 'Only A': In word problems, '40 students study Finance' means $|F| = 40$. It does not mean $|F \setminus (A \cup M)| = 40$. The marginal total includes students who also study other subjects.
2. The Triple-Count Omission in PIE: Adding pairwise intersections and then subtracting them removes the center three times. Candidates must remember to add back $|A \cap B \cap C|$ at the final stage.
3. Subsets vs. Elements: Distinguish between set membership and inclusion:
   • If $S = \{1, \{2, 3\}\}$, then $1 \in S$ and $\{1\} \subseteq S$.
   • $\{2, 3\} \in S$ is true, but $\{2, 3\} \subseteq S$ is false (since $2 \notin S$). The correct subset notation is $\{\{2, 3\}\} \subseteq S$.
4. Percentage Universe Benchmark: When a problem states survey results in percentages without specifying a population size, immediately fix $|U| = 100$. This turns all percentage values directly into integer counts.

---

8. Worked Step-by-Step Examples

Example 1: Two-Set Market Survey

In a consumer study of 200 investors, 130 hold equities, 90 hold fixed-income bonds, and 40 hold neither asset class. How many investors hold both equities and bonds?

1. Determine the Union: The total universe is $|U| = 200$. Since 40 investors hold neither: $$|E \cup B| = |U| - |\text{Neither}| = 200 - 40 = 160$$
2. Apply Two-Set Inclusion-Exclusion: $$|E \cup B| = |E| + |B| - |E \cap B| \implies 160 = 130 + 90 - |E \cap B|$$
3. Solve for Intersection: $$160 = 220 - |E \cap B| \implies |E \cap B| = 220 - 160 = 60$$ Exactly 60 investors hold both asset classes.

Example 2: Three-Set University Enrollment

At Bocconi, 100 students were surveyed regarding language proficiencies: 55 speak English, 45 speak French, and 40 speak German. Furthermore, 20 speak English and French, 15 speak English and German, and 12 speak French and German. If 5 students speak all three languages, how many students speak none of these three languages?

1. Identify Given Cardinalities: $|E| = 55, |F| = 45, |G| = 40$ $|E \cap F| = 20, |E \cap G| = 15, |F \cap G| = 12$ $|E \cap F \cap G| = 5$
2. Compute Total Speaking at Least One Language via PIE: $$|E \cup F \cup G| = (55 + 45 + 40) - (20 + 15 + 12) + 5 = 140 - 47 + 5 = 98$$
3. Compute Complementary Count: $$|\text{None}| = |U| - |E \cup F \cup G| = 100 - 98 = 2$$ Exactly 2 students speak none of the three languages.

Example 3: Set Identity Reduction

Simplify the set expression $X = (A \cap B) \cup (A \cap B^c)$ using set algebra axioms.

1. Factor out $A$ using the distributive law of $\cap$ over $\cup$: $$(A \cap B) \cup (A \cap B^c) = A \cap (B \cup B^c)$$
2. Apply the complement law $B \cup B^c = U$: $$A \cap (B \cup B^c) = A \cap U$$
3. Apply the identity law $A \cap U = A$: $$X = A$$