Venn Diagrams

A Venn diagram is a visual tool that uses overlapping closed curves — usually circles — to illustrate the relationships between two or more sets. Introduced in the late 19th century, Venn diagrams have become one of the most widely used diagrams in mathematics, logic, statistics, and everyday reasoning. Each circle represents a set, and the position of elements (or regions) relative to the circles encodes set-theoretic relationships such as union, intersection, and complement. The power of a Venn diagram lies in how naturally it converts abstract set notation into spatial intuition. When two circles overlap, the shared region corresponds exactly to the intersection A ∩ B — elements belonging to both sets simultaneously. Regions inside only one circle represent elements exclusive to that set, while the region outside all circles represents the complement within the universal set U. This spatial encoding makes logical relationships immediately visible without algebraic manipulation. Venn diagrams are not merely illustrative — they can be used to solve counting problems, verify logical equivalences, and reason about probabilities. For three sets A, B, and C, the diagram produces seven distinct non-empty regions (plus the exterior), each corresponding to a specific combination of memberships. Understanding how to read, draw, and use Venn diagrams fluently is a fundamental skill in set theory and mathematical logic.

Key takeaways
  • Define the Universal Set
  • Draw Circles for Each Set
  • Identify the Four Regions (Two-Set Case)
  • Place Elements or Counts in Regions
  • Extending to Three Sets

Define the Universal Set

Begin by drawing a rectangle representing the universal set U — the collection of all elements under consideration in the problem. Every element and every set in the discussion lives inside this rectangle. For example, if discussing integers from 1 to 10, then U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}.

Draw Circles for Each Set

Draw one circle inside the rectangle for each set. For two sets A and B, draw two overlapping circles. The overlap (intersection region) is intentional — it visually represents that some elements may belong to both sets. If you know in advance that A and B share no elements (they are disjoint), draw the circles without overlapping.

Identify the Four Regions (Two-Set Case)

For sets A and B inside U, four distinct regions exist: (1) A only — elements in A but not B, written A \ B or A ∩ B'; (2) A ∩ B — elements in both A and B (the lens-shaped overlap); (3) B only — elements in B but not A, written B \ A; (4) neither — elements in U but outside both circles, representing (A ∪ B)'.

Place Elements or Counts in Regions

Once regions are identified, populate them. In a concrete problem, write specific elements in each region. In a counting or probability problem, write the number of elements (cardinality) in each region. For example, if |A| = 10, |B| = 8, and |A ∩ B| = 3, then |A only| = 7, |B only| = 5, and |A ∪ B| = 7 + 3 + 5 = 15.

Extending to Three Sets

For three sets A, B, and C, draw three mutually overlapping circles producing 7 interior regions: A only, B only, C only, A∩B only, A∩C only, B∩C only, and A∩B∩C (the central region where all three overlap). The Inclusion-Exclusion Principle gives |A ∪ B ∪ C| = |A| + |B| + |C| − |A∩B| − |A∩C| − |B∩C| + |A∩B∩C|, which the diagram makes visually obvious by showing how regions are added and subtracted to avoid double-counting.

The Key Equation

∣A∪B∣=∣A∣+∣B∣−∣A∩B∣|A \cup B| = |A| + |B| - |A \cap B|
  • |A \cup B| — Cardinality of union (count): The total number of distinct elements belonging to A or B or both.
  • |A| — Cardinality of A (count): The number of elements in set A.
  • |B| — Cardinality of B (count): The number of elements in set B.
  • |A \cap B| — Cardinality of intersection (count): The number of elements belonging to both A and B simultaneously; subtracted to correct for double-counting.

Worked Example

Problem. In a class of 30 students, 18 study French (set F), 15 study Spanish (set S), and 7 study both languages. Draw a Venn diagram and find: (a) how many study French only, (b) how many study Spanish only, (c) how many study neither language.

∣F∖S∣=11,∣S∖F∣=8,∣(F∪S)′∣=4|F \setminus S| = 11,\quad |S \setminus F| = 8,\quad |(F \cup S)'| = 4

Answer. French only: 11 students; Spanish only: 8 students; Neither: 4 students.

Figure
Diagram
U (Universal Set)FS1178French onlyBothSpanish only4neitherFrench onlySpanish onlyF∩S
Origins · 1 minJohn Venn and how this was discovered
JV
John Venn
1834–1923 · British

John Venn was a British logician and philosopher at Cambridge University who introduced the overlapping-circle diagrams in his 1880 paper 'On the Diagrammatic and Mechanical Representation of Propositions and Reasonings,' published in the Philosophical Magazine. He used these diagrams as a systematic method to visualise the relations between sets in Boolean algebra and categorical logic, providing a rigorous geometric interpretation of syllogistic reasoning. Although Leonhard Euler had used similar non-overlapping circles earlier (Euler diagrams), Venn's contribution was to develop a consistent system where circles always overlap, with empty regions indicating impossible combinations. Venn was also a skilled machine builder — he constructed a mechanical cricket-bowling machine so effective that it clean-bowled one of the members of the Australian cricket team visiting Cambridge in 1909.

  • Union and Intersection of Sets — Union (A ∪ B) and intersection (A ∩ B) are the core operations that the regions in a Venn diagram directly represent.
  • Complement of a Set — The region outside a circle inside the universal set rectangle is the complement A', a concept made visually clear by Venn diagrams.
  • Set Notation and Symbols — Reading and labelling Venn diagrams requires fluency with set notation such as ∈, ∪, ∩, ⊆, and |A|.
  • Inclusion-Exclusion Principle — The formula |A ∪ B| = |A| + |B| − |A ∩ B| is derived directly from the regional structure of a Venn diagram and is essential for counting problems.