Quick answer: A set is a well-defined collection of distinct objects. It can be written in roster form, such as , or set-builder form, such as . If a set has elements, it has subsets, proper subsets, and its power set (the set of all subsets) has elements.
What makes a collection a set
The collection must be well defined: for any object, you can decide whether it belongs. "Vowels of the English alphabet" is a set; "good books" is not. Elements are not repeated, and their order does not matter, so .
| Symbol | Meaning |
|---|---|
| is an element of A | |
| is not an element of A | |
| Number of elements (cardinality) of A | |
| or | Empty set |
Two ways to write a set
| Form | Example |
|---|---|
| Roster (tabular) | |
| Set-builder |
Types of sets
| Type | Definition | Example |
|---|---|---|
| Empty (null) | No elements | |
| Singleton | Exactly one element | |
| Finite | Countable number of elements | |
| Infinite | Not finite | |
| Equal | Same elements | |
| Equivalent | Same number of elements | and |
| Universal | Contains all sets under discussion |
Note that and are not empty; each has one element.
Subsets and proper subsets
A is a subset of B, written , if every element of A is in B. A is a proper subset, written , if in addition .
- Every set is a subset of itself.
- The empty set is a subset of every set.
- If and , then .
Standard number sets
Power set
The power set is the set of all subsets of A.
Example: If , then , which has elements.
Counting formulas
For :
| Quantity | Count |
|---|---|
| Subsets | |
| Proper subsets | |
| Non-empty subsets | |
| Non-empty proper subsets | |
| Subsets with exactly elements | |
| Elements of |
Why : each element is either in a subset or not, giving 2 choices for each of the elements.
Intervals as subsets of ℝ
| Interval | Set |
|---|---|
Worked examples
Example 1: counting subsets
A set has 5 elements. How many subsets have at least one element and are not the whole set?
.
Example 2: finding n from the power set
If , find .
, so .
Example 3: subsets of a given size
How many 2-element subsets does have?
.
Example 4: true or false
Is ? Yes, φ is listed as an element. Is ? No, because 1 itself is not an element; only the set is.
Summary table
| Concept | Key point |
|---|---|
| Set | Well-defined, distinct elements, order irrelevant |
| Subset | Every element of A is in B |
| Proper subset | Subset and not equal |
| Power set | All subsets, elements |
| Empty set | Subset of every set |
Exam tips
- Distinguish (element) from (subset); many questions test exactly this.
- Use for subsets and for subsets of a fixed size.
- Remember , so .
Continue with set operations and the laws of sets, or browse the NIMCET Set Theory chapter.
Common mistakes
- Treating as the empty set.
- Counting proper subsets as ; only the set itself is excluded, so it is .
- Repeating elements, as in writing as a 3-element set.
- Thinking that equivalent sets must be equal.
Frequently Asked Questions
How many subsets does a set with n elements have?
It has 2ⁿ subsets, including the empty set and the set itself.
What is a power set?
The power set of A is the set of all subsets of A. If A has n elements, its power set has 2ⁿ elements.
Is the empty set a subset of every set?
Yes. The empty set has no elements, so the condition for being a subset is always satisfied.
What is the difference between a subset and a proper subset?
A proper subset is a subset that is not equal to the whole set. A set with n elements has 2ⁿ − 1 proper subsets.
What is the difference between equal and equivalent sets?
Equal sets have exactly the same elements. Equivalent sets only have the same number of elements.