What Is a Set in Math? (The Answer Up Front)
A set in math is a well-defined collection of distinct objects, written inside curly braces ${, }$. Each object is called an element of the set, and every set has the same rule: you can always answer the question "is this thing in the set, yes or no?" without ambiguity.
That single requirement — well-defined membership — is what separates a mathematical set from a casual list. "The set of even numbers less than 10" is a set: ${2, 4, 6, 8}$. "The set of interesting numbers" is not a set, because "interesting" has no precise rule.
A Concrete First Example
Take the set of single-digit even numbers:
$$E = {2, 4, 6, 8}$$
Read this aloud as "E is the set containing 2, 4, 6, and 8." Three things to notice immediately, because they show up in every problem about sets:
Order doesn't matter. ${2, 4, 6, 8}$ and ${8, 4, 2, 6}$ are the same set.
Duplicates collapse. ${2, 4, 4, 6}$ is the same set as ${2, 4, 6}$. A set lists each element once.
Membership is binary. The number $4$ is in $E$ — written $4 \in E$. The number $5$ is not — written $5 \notin E$.
The notation $\in$ (read "is an element of") and $\notin$ ("is not an element of") are the two most-used symbols in all of set theory. Internalise them now and the rest of the article gets easier.
Two Ways to Write a Set
Mathematicians write sets in two standard forms:
Roster form — list every element inside braces: ${2, 4, 6, 8}$.
Set-builder form — describe the rule: ${x \mid x \text{ is an even number and } 0 < x < 10}$, read as "the set of all $x$ such that $x$ is even and between 0 and 10." The vertical bar $\mid$ means "such that."
Roster form is simpler for small finite sets. Set-builder form is the only practical way to describe large or infinite sets — like the set of all real numbers between 0 and 1.
Set Symbols You Will See Repeatedly
These nine symbols carry almost every set-theory statement you will read. Each one has a precise meaning — and confusion between any two of them produces wrong answers downstream.
Symbol | Read as | Meaning |
|---|---|---|
${, }$ | "curly braces" | Encloses the elements of a set |
$\in$ | "is an element of" | $x \in A$ means $x$ is in set $A$ |
$\notin$ | "is not an element of" | $x \notin A$ means $x$ is not in $A$ |
$\subset$ or $\subseteq$ | "is a subset of" | Every element of one set is also in another |
$\cup$ | "union" | Combines elements of two sets (the OR) |
$\cap$ | "intersection" | Elements common to two sets (the AND) |
$\varnothing$ or ${,}$ | "empty set" | A set with no elements |
$\mathbb{U}$ | "universal set" | The set of all elements under consideration |
$\mid$ or $:$ | "such that" | Used in set-builder form |
The two symbols students confuse most often — $\cup$ (union) and $\cap$ (intersection) — have a built-in memory aid: the union $\cup$ looks like a capital U for Union; the intersection $\cap$ looks like a lower-case n for the first letter of intersection.
Where Sets Came From — and Why They Built Modern Mathematics
"The essence of mathematics lies precisely in its freedom." — Georg Cantor, 1883.
Sets were not always a part of mathematics. Until the late 1800s, mathematicians worked with numbers, equations, and shapes — but had no single language to talk about collections of mathematical objects in general. Then a single mathematician changed that.
Between 1874 and 1884, Georg Cantor — working at the University of Halle in Germany — invented set theory while trying to solve a problem about trigonometric series. He needed to describe the collection of points where a series did or did not converge, and the existing tools were not precise enough. So he built a new one.
Cantor's first major paper, published in 1874, proved something that shocked his contemporaries: that some infinities are larger than others — that the real numbers are "more numerous" than the natural numbers, even though both collections are infinite. To prove this, he had to define what "more numerous" even meant for infinite collections — and the answer was sets, paired with one-to-one correspondence.
Modern mathematics rests on this foundation. Three concrete examples of where sets quietly do the work:
Probability — every probability question begins with a sample space, which is a set of possible outcomes. Roll one die: the sample space is ${1, 2, 3, 4, 5, 6}$.
Computer science and databases — every database query is a set operation. "Customers in the US AND who ordered last month" is the intersection of two sets. "Customers in the US OR in Canada" is the union.
Statistics and machine learning — every dataset is a set of observations; every classification model partitions data into sets.
The 12 Types of Sets Every Student Should Know
Sets get classified by what's inside them and how they relate to other sets. Here are the 12 types that appear in school and early college mathematics.
1. Empty Set (or Null Set)
A set with no elements at all. Written $\varnothing$ or ${,}$. Example: the set of even numbers between 3 and 5.
$$\varnothing = {,}$$
2. Singleton Set (or Unit Set)
A set with exactly one element. Example: the set of even prime numbers is the singleton ${2}$ — because 2 is the only even prime.
3. Finite Set
A set you can count, even if the count is large. Example: the set of letters in the English alphabet has 26 elements.
4. Infinite Set
A set whose elements cannot be counted. Example: the set of natural numbers $\mathbb{N} = {1, 2, 3, 4, \ldots}$.
5. Equal Sets
Two sets containing exactly the same elements. Example: ${1, 2, 3}$ and ${3, 1, 2}$ are equal — order doesn't matter.
6. Equivalent Sets
Two sets with the same number of elements, but not necessarily the same elements. Example: ${1, 2, 3}$ and ${a, b, c}$ are equivalent (both have 3 elements) but not equal.
7. Subset and Proper Subset
Set $A$ is a subset of set $B$ (written $A \subseteq B$) if every element of $A$ is also in $B$. If $A$ is a subset of $B$ but $A$ and $B$ are not equal, $A$ is a proper subset (written $A \subset B$).
Example: ${1, 2} \subset {1, 2, 3, 4}$. Every set is a subset of itself; the empty set is a subset of every set.
8. Superset
If $A \subseteq B$, then $B$ is a superset of $A$, written $B \supseteq A$. Superset is just "subset" read the other way.
9. Power Set
The set of all subsets of a given set. If $S = {a, b}$, then the power set is:
$$P(S) = {, \varnothing, {a}, {b}, {a, b} ,}$$
A set with $n$ elements has $2^n$ subsets — so $P(S)$ above has $2^2 = 4$ elements. The power set always contains the empty set and the original set itself.
10. Universal Set
The set containing every element under discussion, usually written $\mathbb{U}$. In a probability problem about a coin toss, $\mathbb{U} = {\text{heads}, \text{tails}}$. In a problem about real numbers, $\mathbb{U} = \mathbb{R}$.
11. Overlapping Sets
Two sets that share at least one common element. Example: $A = {1, 2, 3}$ and $B = {3, 4, 5}$ overlap because $3$ is in both.
12. Disjoint Sets
Two sets that share no elements. Example: ${1, 2, 3}$ and ${4, 5, 6}$ are disjoint. Disjoint sets have empty intersection: $A \cap B = \varnothing$.
The Four Core Operations on Sets
Once you have two sets, four operations let you build new sets from them. These four are the workhorses of probability, logic, and database querying.
Let $A = {1, 2, 3, 4}$ and $B = {3, 4, 5, 6}$ throughout the examples below.
Union ($\cup$) — The OR
The union of two sets is the set of elements that are in either set (or both). The keyword is or.
$$A \cup B = {1, 2, 3, 4, 5, 6}$$
Intersection ($\cap$) — The AND
The intersection of two sets is the set of elements in both sets. The keyword is and.
$$A \cap B = {3, 4}$$
Difference ($A - B$ or $A \setminus B$) — In A but not in B
The difference of $A$ and $B$ is the set of elements in $A$ but not in $B$.
$$A - B = {1, 2}$$
Note: $B - A = {5, 6}$, which is different from $A - B$. Difference is not commutative.
Complement ($A'$ or $A^c$) — Not in A (relative to U)
The complement of $A$ — relative to a universal set $\mathbb{U}$ — is the set of elements in $\mathbb{U}$ but not in $A$.
If $\mathbb{U} = {1, 2, 3, 4, 5, 6, 7, 8}$ and $A = {1, 2, 3, 4}$, then:
$$A' = {5, 6, 7, 8}$$
How Do You Represent Sets With Venn Diagrams?
A Venn diagram represents sets as overlapping circles inside a rectangle (the universal set $\mathbb{U}$). Each region of the diagram corresponds to a specific set expression.
For two sets $A$ and $B$:
The left-only crescent → $A - B$ (elements in $A$ but not $B$)
The right-only crescent → $B - A$
The overlapping lens → $A \cap B$ (elements in both)
The outside of both circles → $(A \cup B)'$ (elements in neither)
The two circles together → $A \cup B$
For three sets, the standard Venn diagram has eight regions (three single-only, three pair-only, one triple-overlap, one outside). This is the same picture used in elementary probability — where each region's area represents the probability of that combination.
Venn diagrams were introduced by John Venn in 1880 in the Philosophical Magazine — though Euler had used similar overlapping-circle diagrams a century earlier. The naming convention stuck for Venn because his version explicitly showed every possible logical combination.
What Are the Set Formulas?
A handful of identities turn up everywhere from counting problems to probability to logic. Memorise these; they save derivation time.
Cardinality formulas (where $n(S)$ means "number of elements in $S$"):
$$n(A \cup B) = n(A) + n(B) - n(A \cap B)$$
$$n(A \cup B \cup C) = n(A) + n(B) + n(C) - n(A \cap B) - n(B \cap C) - n(A \cap C) + n(A \cap B \cap C)$$
The first is the inclusion-exclusion principle for two sets; the second is the three-set version. Both generalise to any number of sets — a deep result in combinatorics.
Subset count. A set with $n$ elements has $2^n$ subsets (including the empty set and itself). Its power set $P(A)$ has cardinality $2^n$.
De Morgan's Laws — the most-used algebraic identities on sets:
$$(A \cup B)' = A' \cap B'$$
$$(A \cap B)' = A' \cup B'$$
In words: "the complement of a union is the intersection of complements," and vice versa. Named for Augustus De Morgan (1806–1871).
Distributive laws.
$$A \cap (B \cup C) = (A \cap B) \cup (A \cap C)$$
$$A \cup (B \cap C) = (A \cup B) \cap (A \cup C)$$
Commutative laws. $A \cup B = B \cup A$ and $A \cap B = B \cap A$.
Associative laws. $(A \cup B) \cup C = A \cup (B \cup C)$ and the same for intersection.
Identity laws. $A \cup \emptyset = A$ and $A \cap \mathbb{U} = A$.
Complement laws. $A \cup A' = \mathbb{U}$ and $A \cap A' = \emptyset$.
A Worked Example — Wrong Path First
Suppose a problem says: "In a class of 30 students, 18 take Math, 14 take Physics, and 6 take both. How many take at least one of the two subjects?"
The intuitive (wrong) approach. A student in a hurry adds the two numbers: $18 + 14 = 32$. That's already greater than the class size of 30 — so something is wrong. The wrong answer signals the error before the student even checks.
Why it's wrong. Adding $18 + 14$ counts the 6 students who take both twice — once in the Math set, once in the Physics set. The set-theory diagnosis is: $|A| + |B|$ over-counts $|A \cap B|$.
The correct method — the inclusion-exclusion formula:
$$|A \cup B| = |A| + |B| - |A \cap B|$$
$$|A \cup B| = 18 + 14 - 6 = 26$$
Final answer: 26 students take at least one of the two subjects. The 4 remaining students take neither.
The reason this formula matters: the same shape — "add the parts, subtract the overlap" — shows up later in probability ($P(A \cup B) = P(A) + P(B) - P(A \cap B)$) and in database joins. Get the pattern early and the later concepts feel like the same problem in a new costume.
At Bhanzu, our trainers use this exact wrong-path-first sequence — let the intuitive error happen, name it, then introduce the formula as the rescue. The reasoning sticks because the student felt the gap, not just memorised the rule.
Common Mistakes — and How to Avoid Them
Three failure modes show up repeatedly in classroom work on sets. Each one is genuinely small, but a single slip changes the answer.
Mistake 1: Confusing $\cup$ (union) and $\cap$ (intersection)
Where it slips in: Anywhere the problem uses the words "or" and "and" — students confidently pick the wrong symbol because they look similar.
Don't do this: Reading "students who take Math AND Physics" and writing $\text{Math} \cup \text{Physics}$.
The correct way: AND maps to $\cap$ (intersection). OR maps to $\cup$ (union). Memory aid: $\cup$ looks like a U for Union; $\cap$ looks like an n for intersection. The rusher who skips this check often hits this exact mistake.
Mistake 2: Treating an element as a set (or a set as an element)
Where it slips in: Power-set and subset problems. Students write $1 \subset A$ when they mean $1 \in A$.
Don't do this: $1 \in {1, 2, 3}$ is correct ($1$ is an element). ${1} \in {1, 2, 3}$ is wrong — ${1}$ is a set, not an element of ${1, 2, 3}$.
The correct way: $1 \in {1, 2, 3}$ — single element belongs. ${1} \subseteq {1, 2, 3}$ — the singleton set ${1}$ is a subset. The second-guesser who freezes here often has the right intuition but uses the wrong symbol.
Mistake 3: Forgetting that the empty set is a subset of every set
Where it slips in: Listing all subsets of a set, especially when constructing the power set.
Don't do this: Power set of ${a, b}$ listed as ${{a}, {b}, {a, b}}$ — three elements.
The correct way: The power set of ${a, b}$ is ${\varnothing, {a}, {b}, {a, b}}$ — four elements. The empty set is always there. A set with $n$ elements has $2^n$ subsets — count them, and if the count is wrong, the empty set is usually what's missing.
The Mathematicians Who Shaped Set Theory
Georg Cantor (1845–1918, Russia/Germany) — Founded set theory through papers published between 1874 and 1884. Proved that some infinities are larger than others — a result so counterintuitive that several of his contemporaries refused to accept it. The mathematician David Hilbert later defended his work with the famous line: "No one shall expel us from the paradise that Cantor has created."
Richard Dedekind (1831–1916, Germany) — Cantor's friend and frequent correspondent. Dedekind formalised the idea of a set as a "system" and contributed the rigorous definition of infinite sets — a set is infinite if it can be put into one-to-one correspondence with a proper subset of itself.
Ernst Zermelo (1871–1953, Germany) — Built the first axiom system for set theory in 1908, addressing paradoxes that had emerged in Cantor's original formulation. The modern axiom system most mathematicians use today is called ZFC — Zermelo–Fraenkel set theory with the axiom of Choice.
These three turned set theory from one mathematician's idea into the language all of modern mathematics is now written in.
A Practical Next Step
Try these three problems before moving on. Each one tests a distinct slice of what's above.
List all subsets of ${a, b, c}$. (There should be $2^3 = 8$.)
Let $A = {1, 2, 3, 4, 5}$ and $B = {4, 5, 6, 7}$. Find $A \cup B$, $A \cap B$, $A - B$, and $B - A$.
In a survey of 50 students, 28 play cricket, 23 play football, and 8 play both. How many play neither?
If you got stuck on problem 3, come back to the inclusion-exclusion worked example above — the same formula applies. Want to build this kind of reasoning with a live Bhanzu trainer? Book a free demo class — online globally.
Was this article helpful?
Your feedback helps us write better content