Venn diagrams

The three ingredients. Every Venn diagram has the same three parts. The universal set $U$ is the outer rectangle — everything under discussion lives inside it. Each set being discussed is a closed curve, almost always drawn as a circle, placed inside that rectangle. Individual elements are points; when it helps, the actual elements are written directly inside the region they belong to.

How relationships become shapes. The relationship between two sets $A$ and $B$ decides how their circles are arranged, and this is the part students most often get wrong by defaulting to one habitual picture:

• If $A \subseteq B$ (every element of $A$ is also in $B$), the circle for $A$ is drawn entirely inside the circle for $B$ — a small circle nested in a bigger one.
• If $A$ and $B$ share some elements but neither is a subset of the other, the circles are drawn overlapping, crossing to form a lens-shaped region that represents $A \cap B$.
• If $A$ and $B$ share no elements at all — they are disjoint — the circles are drawn not touching, standing apart inside $U$.

The four-region picture for two overlapping sets. When $A$ and $B$ genuinely overlap, the rectangle splits into four disjoint regions, and every element of $U$ falls into exactly one of them: inside $A$ only, inside $B$ only, inside both (the lens, $A \cap B$), and outside both (the complement of $A \cup B$). Because the regions never share a boundary element, you can count a set's size by adding up how many elements sit in each of its regions — this is the habit the worked example below relies on.

where: $n(A)$ is the number of elements in $A$, $n(A \text{ only})$ is the count in the crescent belonging to $A$ but not $B$, and $n(A \cap B)$ is the count in the shared lens — the same split works for $B$ by symmetry.

A Venn diagram is not decoration; it is a faithful picture only because circles and regions genuinely mirror the logic of set membership. Nesting means subset. If every element of $A$ must also lie in $B$, then drawing $A$'s circle partly outside $B$ would show an element of $A$ that is not in $B$ — a contradiction of $A \subseteq B$. The only shape consistent with "every $A$-element is a $B$-element" is $A$ drawn wholly inside $B$, leaving a ring-shaped region of $B$ that holds the elements $B$ has beyond $A$.

Crossing means partial sharing. If some but not all elements are common to $A$ and $B$, no single containment picture works: $A$ is not wholly inside $B$ (some $A$-elements lie outside $B$) and $B$ is not wholly inside $A$ either. Two overlapping circles are the unique shape that shows some elements exclusive to $A$, some exclusive to $B$, and some shared — matching the actual membership pattern element by element.

Separation means disjoint. If no element of $A$ is ever in $B$, any overlap in the drawing would falsely suggest a shared element exists. Only non-touching circles correctly show zero shared elements. Because these three drawing rules map one-to-one onto the three possible logical relationships between two sets, reading a correctly drawn diagram back into words (or numbers) is always reliable — the picture never has to be "interpreted," only read.

For $U = \{1,2,\dots,10\}$, $A = \{1,2,3,4,5\}$ and $B = \{4,5,6,7\}$, sort the elements into the four Venn-diagram regions and use the region counts to verify $n(A \cup B)$.

Step 1. Find the shared region $A \cap B$: elements in both lists are $4$ and $5$, so $n(A \cap B) = 2$.

Step 2. Find the $A$-only crescent: elements of $A$ not in $B$ are $1, 2, 3$, so $n(A \text{ only}) = 3$.

Step 3. Find the $B$-only crescent: elements of $B$ not in $A$ are $6, 7$, so $n(B \text{ only}) = 2$.

Step 4. Find the region outside both circles but inside $U$: since $A \cup B = \{1,2,3,4,5,6,7\}$ and $U$ runs to $10$, the leftover elements are $8, 9, 10$, so that region holds $3$ elements.

Step 5. Read the diagram: a rectangle labelled $U$ with two overlapping circles $A$ and $B$; the lens holds $4, 5$; the $A$-only crescent holds $1, 2, 3$; the $B$-only crescent holds $6, 7$; outside both circles sit $8, 9, 10$.

Step 6. Verify by adding the region counts: $n(A \cup B) = n(A \text{ only}) + n(B \text{ only}) + n(A \cap B) = 3 + 2 + 2 = 7$, which matches directly counting $\{1,2,3,4,5,6,7\}$. The four regions hold $3, 2, 2, 3$ elements respectively, and $n(A \cup B) = 7$.

Competitive stretch

If instead $P \subseteq Q$ with $n(P) = 4$ and $Q$ has exactly $3$ elements not in $P$, the diagram is a small circle $P$ nested entirely inside a larger circle $Q$: the ring of $Q$ outside $P$ holds those $3$ extra elements, so $n(Q) = n(P) + 3 = 4 + 3 = 7$ — the nested picture directly gives the addition, with no lens region to worry about since $P$ contributes nothing outside $Q$.

• Drawing two circles as overlapping by default even when the problem states the sets are disjoint or one is a subset of the other — the shape must match the stated relationship, never a habitual template.
• Leaving out the outer rectangle for $U$: without it there is no region left over to represent the complement of $A \cup B$.
• Placing a shared element inside only one circle instead of in the lens where both circles overlap.
• Treating the diagram itself as a proof — it is an excellent way to check a claim visually, but a rigorous subset or set-equality argument still needs an element-wise check.

Ask the tutor: Want to sketch a Venn diagram for your own set of numbers, or check whether your shaded region matches a given relationship — ask the AI tutor to walk through it with you.