๐ What are Sets?
๐ Welcome to the World of Sets!
A set is like a guest list โ you're either on it, or you're not. No maybes, no "sort of." This simple but powerful idea is the very foundation of modern mathematics!
In everyday language, we often talk about collections: a pack of cards, a bouquet of flowers, a team of players. Mathematics takes this idea and sharpens it into something precise โ a set.
The Definition
A set is a well-defined collection of distinct objects. The objects that belong to a set are called its elements or members.
But what does "well-defined" really mean? It means that given any object, there must be no ambiguity โ we can always decide with certainty whether that object belongs to the collection or not.
โ Examples of Well-Defined Collections (Sets)
- The collection of vowels in the English alphabet:
{a, e, i, o, u} - The collection of natural numbers less than 10:
{1, 2, 3, 4, 5, 6, 7, 8, 9} - The collection of all even prime numbers:
{2} - The collection of planets in our solar system
โ Examples That Are NOT Sets
- "The collection of beautiful flowers" โ beauty is subjective
- "The collection of talented singers" โ talent is a matter of opinion
- "The collection of difficult problems" โ difficulty varies from person to person
Is "the collection of tall people in your class" a set? No! "Tall" is subjective. But "the collection of people in your class whose height exceeds 170 cm" is a set โ it has a clear, measurable criterion.
Notation & Symbols
Sets are conventionally denoted by capital letters: A, B, C, X, Y, Z, etc. Elements are typically represented by lowercase letters: a, b, c, x, y, z, etc.
If an element a belongs to a set A, we write:
Membership Notation
Standard Number Sets
Mathematics uses special symbols for commonly used sets of numbers. You will encounter these throughout your studies:
The symbol โค comes from the German word "Zahlen", meaning "numbers." The symbol โ comes from the Italian/German word "Quoziente" (quotient), since every rational number can be expressed as a quotient of two integers!
๐ Representing Sets
There are two principal ways to describe a set: by explicitly listing every element, or by stating the rule that determines membership.
1. Roster (Tabular) Form
In roster form, we list all the elements of the set, separated by commas, enclosed in curly braces { }.
Roster Form Examples
2. Set-Builder Form
In set-builder form, we describe the set by stating the property that its elements must satisfy:
Set-Builder Form Examples
Converting Between Forms
= {x : x = 3n, n โ โ, 1 โค n โค 5}
= {2, 3}
= {x : x = nยฒ, n โ โ, 1 โค n โค 5}
= {1, 2, 3, 4, 6, 12}
Key Rules to Remember
Order does not matter: {1, 2, 3} = {3, 1, 2} = {2, 3, 1}. The arrangement of elements is irrelevant โ only membership counts.
Repetition is ignored: {1, 1, 2, 2, 3} = {1, 2, 3}. Each element is listed only once. Writing duplicates does not create a "larger" set!
The word "MISSISSIPPI" has 11 letters, but the set of letters in "MISSISSIPPI" is just {M, I, S, P} โ a set with only 4 elements. The set strips away repetition and keeps only the distinct members.
๐ข Types of Sets
Sets come in many flavours. Understanding these different types is essential before we can work with operations on sets.
Empty Set (Null Set)
A set that contains no elements is called the empty set (or null set). It is denoted by โ
or { }.
Empty Set Examples
{โ } is NOT the same as โ ! The set {โ } contains one element โ the empty set itself. So {โ } is a singleton set, not an empty set. Be very careful with this distinction.
Singleton Set
A set with exactly one element is called a singleton set.
- {0} โ the set containing only zero
- {x โ โ : x is even and prime} = {2}
Finite and Infinite Sets
A set is finite if its elements can be counted (the counting process terminates). Otherwise, it is infinite.
| Finite Sets | Infinite Sets |
|---|---|
| {a, e, i, o, u} | โ = {1, 2, 3, ...} |
| {x โ โค : โ3 โค x โค 3} | โค = {..., โ1, 0, 1, ...} |
| Set of days in a week | Set of points on a line |
Cardinality (Order) of a Finite Set
The number of elements in a finite set A is called its cardinality (or order), denoted n(A) or |A|.
- If A = {2, 4, 6, 8}, then n(A) = 4
- n(โ ) = 0
Equal Sets
Two sets A and B are said to be equal (written A = B) if they have exactly the same elements.
Checking Equality
Equivalent Sets
Two sets are equivalent if they have the same number of elements (same cardinality), even if the elements themselves are different.
- A = {1, 2, 3} and B = {a, b, c} are equivalent since n(A) = n(B) = 3
- Equal sets are always equivalent, but equivalent sets are not necessarily equal!
Power Set
The power set of a set A, denoted P(A), is the set of all subsets of A (including โ and A itself).
If a set A has n elements, then P(A) has exactly 2n elements. A set with 3 elements has 2ยณ = 8 subsets. A set with 10 elements has 2ยนโฐ = 1024 subsets. The numbers grow incredibly fast!