Venn diagram

A Venn diagram uses overlapping circles to visualize set membership and the relationships between sets. Each circle is a set; the regions inside (and the overlaps) represent the elements that satisfy combinations of set memberships. Shading particular regions shows the elements that satisfy a Boolean expression or set operation.

Named after John Venn (1880), who formalized them as a tool for visualizing logical syllogisms.

Anatomy

For two sets $A$ and $B$, a Venn diagram has four regions:

Image: Venn diagram with labeled regions, CC0 / public domain

• $A\setminus B$ — inside $A$ only (in $A$, not in $B$).
• $A\cap B$ — inside both (the intersection).
• $B\setminus A$ — inside $B$ only.
• Outside both circles — not in $A$ and not in $B$ (the universal complement).

For three sets, you get $2^3=8$ regions (including the “outside everything” region).

For $n$ sets, $2^n$ distinct regions are needed — but Venn diagrams with circles can only achieve this up to 3 sets. For 4 sets, you need ellipses; for 5 or more, more elaborate curve shapes are required (and the diagrams become hard to read).

Set operations as Venn shadings

Operation	Notation	Shading
Union	$A\cup B$	All of $A$ + all of $B$.
Intersection	$A\cap B$	Overlap region only.
Difference	$A\setminus B$	$A$ but not $B$ — the left crescent.
Symmetric difference	$A△B$	Either circle’s exclusive region (not the overlap).
Complement	$A^c$ or $\bar{A}$	Everything outside $A$.

Boolean algebra correspondence

Set operations map directly onto Boolean operations:

• Union ↔ OR ($\vee$).
• Intersection ↔ AND ($\wedge$).
• Complement ↔ NOT ($\neg$).
• Universal set ↔ Boolean $1$.
• Empty set ↔ Boolean $0$.

So Venn diagrams visualize Boolean expressions — shading regions for a Boolean function shows the inputs for which the function is true.

Verifying Boolean identities

A Venn diagram gives a quick visual proof of Boolean equivalences. Example: distributivity, $X\cdot (Y+Z)=XY+XZ$.

The PDF figure walks through both sides:

• Panels (a)-(c): shade $X$, then $Y+Z$, then their AND. Result: the part of $X$ overlapping $Y$ or $Z$.
• Panels (d)-(f): shade $XY$ (X and Y overlap), then $XZ$ (X and Z overlap), then their OR. Result: $X$‘s portion overlapping with anything in $Y$ or $Z$.

Both shadings match. Distributivity confirmed visually.

Why Venn diagrams scale poorly

For 2 sets: 4 regions. Two intersecting circles work fine.

For 3 sets: 8 regions. Three intersecting circles give exactly 8 (including the outside) — a perfect fit.

For 4 sets: 16 regions. You can’t get all 16 distinct regions from 4 intersecting circles in general position — at most 14 regions are achievable, so two of the required combinations of memberships go unrepresented. Use ellipses or other curve shapes to recover all 16.

For 5+ sets: technically possible but visually impossible to interpret.

This is why Venn diagrams are limited to 3-set examples in textbooks. For larger problems, K-maps take over — they’re the same logical content laid out as a grid where adjacent cells differ by one variable, scalable to any number of variables.

Worked examples

Verifying De Morgan’s Law

De Morgan’s Laws: $\overline{A\cup B}=\bar{A}\cap \bar{B}$.

LHS: shade outside the union of $A$ and $B$ — everything outside both circles.

RHS: shade $\bar{A}$ (everything outside $A$) AND $\bar{B}$ (everything outside $B$) — the intersection of those two complements is everything outside both.

Same region. ✓

Three-set associativity

$(A\cup B)\cup C=A\cup (B\cup C)$ — both shade the union of all three circles.

Trivially true; the parenthesization doesn’t matter for union.

Beyond Boolean: probability

Venn diagrams are also used to visualize probability:

• Region areas (in a “scaled” Venn diagram) represent probabilities.
• $P(A\cup B)=P(A)+P(B)-P(A\cap B)$ — the inclusion-exclusion formula corresponds to “add the circles, subtract the overlap (counted twice).”

In probability courses, Euler diagrams (which can show empty intersections) are often used instead of strict Venn diagrams.

Limitations

Venn diagrams give intuition, not rigor. They’re great for:

• Building intuition about Boolean operations.
• Verifying simple identities by inspection.
• Teaching set theory.

They’re poor for:

• Formal proofs (need algebraic manipulation).
• Many variables (5+).
• Computing complex expressions (use truth tables or K-maps).

For more variables, see Karnaugh Map. For algebraic manipulation, see Boolean Algebra and De Morgan’s Laws.