Theory
A question a computer would ask
Try to make two lists:
1. All students in your class taller than 170 cm.
2. All good singers in your class.
List 1 is easy: measure, decide, done. List 2 starts a fight, because "good" means different things to different people.
Mathematics only works with collections like list 1, where membership is a clear yes or no. Such a collection has a name: a set.
Theory
Labelled boxes
Think of a set as a labelled box. The label is a rule ("natural numbers below 5"), and for any object you can check the label and instantly say: goes in, or stays out. No object is half inside. That instant in-or-out check is what mathematicians call well-defined.
Theory
The definition and the notation
A set is a well-defined collection of distinct objects, called its elements.
- Sets get capital letters: A, B, V
- Elements are listed in curly brackets: A = {1, 2, 3, 4}
- ∈ means "is an element of", ∉ means "is not"
So for A = {1, 2, 3, 4}: 3 ∈ A, but 6 ∉ A. That one symbol pair carries most of set theory.
Quiz
Which of these collections is a set?
- The tall students of your class
- Students of your class taller than 170 cm
- The good movies released in 2025
- The difficult subjects in BCA
Show the answer
Students of your class taller than 170 cm
Only option B gives a test anyone can apply and get the same answer: measure against 170 cm. "Tall", "good" and "difficult" are opinions, so those collections are not well-defined and not sets. Exams love asking you to justify exactly this.
Theory
Distinct means counted once
A set never contains the same element twice. Writing {1, 2, 2, 3} is allowed, but it IS the set {1, 2, 3}: three elements, not four.
Order does not matter either: {1, 2, 3} and {3, 1, 2} are the same set. A set only remembers what is in the box, not how many copies or in what sequence.
Think first
Take the letters of the word MISSISSIPPI and form a set from them.
Before tapping: how many elements does that set have?
Show the answer
4: the set is {M, I, S, P}.
The word has 11 letters, but a set keeps each distinct object once. If you said 11, you counted copies, which sets never do. This exact question style appears in exams as a one-mark trap.
Theory
Three special sets to recognise
- Empty (null) set: no elements at all, written { } or Ø. Example: BCA students aged 200.
- Finite set: you could finish counting its elements, like {a, e, i, o, u}.
- Infinite set: counting never ends, like the natural numbers {1, 2, 3, ...}.
Subsets, equal sets and power sets come in the next topics; these three are enough for now.
Quiz
What kind of set is {0}?
- The empty set, since 0 means nothing
- A finite set with exactly one element
- An infinite set
- Not a set at all
Show the answer
A finite set with exactly one element
{0} contains one element, the number 0, so it is a finite set of size 1. The empty set has NO elements and is written { } or Ø. Confusing {0} with Ø is one of the most common first-year mistakes.
Watch out
Where marks leak
Three habits fix most set-theory mistakes: justify "well-defined" in words when asked if something is a set; never count duplicate elements twice; never call {0} empty. And write Ø or { }, not 0, for the empty set: 0 is a number, not a set.
Theory
Where you will meet this again
A database table is a set of records, and SQL's DISTINCT keyword exists precisely because sets ignore duplicates. Your next topics (representation, operations, Venn diagrams) and later units (relations, functions, Boolean algebra) all stand on today's one idea.
Summary
Key takeaways
- A set is a well-defined collection of distinct objects; membership is a clear yes or no.
- Notation: capital letters, curly brackets, the element symbol and its negation.
- Duplicates count once and order does not matter: {1, 2, 2, 3} = {1, 2, 3}.
- Empty set Ø has no elements; finite sets end, infinite sets do not; {0} is not empty.
- Memory hook: a set answers yes or no, never maybe.