Book A Free Math Class

# Sets in Math - Definition, Types, and Symbols

[#Algebra](/content/tag/algebra/index.html)

TL;DR

A set in math is a well-defined collection of distinct objects, called elements, enclosed in curly braces — for example, A={2, 4, 6, 8}. This article covers the formal definition, the 12 most common types of sets (finite, infinite, empty, singleton, equal, equivalent, subset, superset, universal, power, disjoint, overlapping), the symbols used to describe them (∈, ⊂, ∪, ∩, ∅), the four core operations, and the mistakes that trip up most students.

## 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:

1. **Order doesn't matter.** {2, 4, 6, 8} and {8, 4, 2, 6} are the same set.
2. **Duplicates collapse.** {2, 4, 4, 6} is the same set as {2, 4, 6}. A set lists each element once.
3. **Membership is binary.** The number 4 is in E — written 4∈E. The number 5 is not — written 5∉E.

The notation ∈ (read _"is an element of"_) and ∉ ( _"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 | x 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."_

## Set Symbols You Will See Repeatedly

These nine symbols carry almost every set-theory statement you will read:

| Symbol | Read as | Meaning |
| --- | --- | --- |
| {, } | "curly braces" | Encloses the elements of a set |
| ∈ | "is an element of" | x∈A means x is in set A |
| ∉ | "is not an element of" | x∉A means x is not in A |
| ⊂ or ⊆ | "is a subset of" | Every element of one set is also in another |
| ∪ | "union" | Combines elements of two sets (the OR) |
| ∩ | "intersection" | Elements common to two sets (the AND) |
| ∅ or {} | "empty set" | A set with no elements |
| U | "universal set" | The set of all elements under consideration |
| | "such that" | Used in set-builder form |

## The 12 Types of Sets Every Student Should Know

### 1. Empty Set (or Null Set)
A set with no elements at all. Written ∅ or {}. Example: the set of even numbers between 3 and 5 is ∅.

### 2. Singleton Set (or Unit Set)
A set with exactly one element. Example: the set of even prime numbers is the singleton {2}.

### 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 N={1, 2, 3, 4,…}.

### 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 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**.

### 8. Superset
If A⊆B, then B is a **superset** of 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)={∅, {a}, {b}, {a, b}}.

### 10. Universal Set
The set containing every element under discussion, usually written U. In a probability problem about a coin toss, U={heads, tails}.

### 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.

## The Four Core Operations on Sets

Once you have two sets, four operations let you build new sets from them:

### Union (∪) — The OR
The **union** of two sets is the set of elements that are in either set (or both). Example: A∪B={1, 2, 3, 4, 5, 6}.

### Intersection (∩) — The AND
The **intersection** of two sets is the set of elements in _both_ sets. Example: A∩B={3, 4}.

### Difference (A−B) — In A but not in B
The **difference** of A and B is the set of elements in A but not in B. Example: A−B={1, 2}.

### Complement (A′) — Not in A (relative to U)
The **complement** of A — relative to a universal set U — is the set of elements in U but not in A.

## How Do You Represent Sets With Venn Diagrams?

A **Venn diagram** represents sets as overlapping circles inside a rectangle (the universal set U). Each region of the diagram corresponds to a specific set expression.

## What Are the Set Formulas?

### **Cardinality formulas:**
- For two sets: n(A∪B)=n(A)+n(B)−n(A∩B).
- For three sets: n(A∪B∪C)=n(A) + n(B) + n(C) − n(A∩B) − n(B∩C) − n(A∩C) + n(A∩B∩C).

### **De Morgan's Laws:**
- (A∪B)′=A′∩B′.
- (A∩B)′=A′∪B′.

### **Distributive laws:**
- A∩(B∪C)=(A∩B)∪(A∩C).
- A∪(B∩C)=(A∪B)∩(A∪C).

### **Commutative laws:**
- A∪B=B∪A.
- A∩B=B∩A.

### **Associative laws:**
- (A∪B)∪C=A∪(B∪C).

### **Identity laws:**
- A∪∅=A.

### **Complement laws:**
- A∪A′=U.

## Common Mistakes — and How to Avoid Them

### **Mistake 1: Confusing ∪ and ∩**
Where it slips in: Students confidently pick the wrong symbol because they look similar.

### **Mistake 2: Treating an element as a set (or a set as an element)**
### **Mistake 3: Forgetting that the empty set is a subset of every set**

## The Mathematicians Who Shaped Set Theory

Georg Cantor founded set theory between 1874 and 1884. Richard Dedekind formalised the idea of a set, and Ernst Zermelo built the first axiom system for set theory.

## Frequently Asked Questions

### What is a set in math in simple words?
A set in math is a collection of things — numbers, letters, objects — where you can always tell, for any thing, whether it's in the set or not.

### How many types of sets are there?
Twelve common types appear in school and early college math.

### What are the symbols used in sets?
The most common are ∈ (is an element of), ∉ (is not), ⊂ (subset), ∪ (union), ∩ (intersection), ∅ (empty set), and U (universal set).

### Who invented set theory?
Georg Cantor is credited with the invention of set theory.