Free Mathematics Class 8 ICSE notes · practise this chapter with an AI quiz

← All study notes

A Collection of Three Things Has Eight Different Subsets

Learn to write a set in roster and set-builder form, classify sets as empty, singleton, finite, equal or equivalent, count subsets with the two-to-the-n rule, and find the complement of a set in a universal set.

How many subsets does a set of three elements have?

Eight — and the reason is simple once you see it.

For each element you have exactly two choices: put it in the subset or leave it out. Three elements, each with two choices independently, give

2×2×2=23=82 \times 2 \times 2 = 2^3 = 8

That count includes the subset where you left everything out — the empty set — and the one where you took everything — the set itself. Both are genuine subsets, and forgetting them is why students often answer six.

So the number of subsets is 2n2^n for a set of nn elements. This page covers the first part of the ICSE Class 8 Mathematics chapter on sets: how to write them, how to classify them, how to count their subsets, and how to complement them.

How do you write a set in roster form and in set-builder form?

A set is a well-defined collection of distinct objects. The objects are its elements or members, and they are written inside curly brackets.

Well-defined means there is no doubt whether a given thing belongs. The collection of *prime numbers less than 1010 is well defined; the collection of interesting numbers* is not, so it is not a set.

Roster form, also called tabular form, lists the elements separated by commas:

A={2,3,5,7}A = \{2, 3, 5, 7\}

Set-builder form states the property the elements share:

A={x:x is a prime number less than 10}A = \{x : x \text{ is a prime number less than } 10\}

The colon is read as such that, so the whole line reads *the set of all xx such that xx is a prime number less than ten*.

Converting between the two. The same set can always be written either way.

- B={1,4,9,16,25}B = \{1, 4, 9, 16, 25\} becomes B={x:x=n2,  n∈N,  n≤5}B = \{x : x = n^2, \; n \in \mathbb{N}, \; n \leq 5\}
- C={x:x is an even natural number less than 12}C = \{x : x \text{ is an even natural number less than } 12\} becomes C={2,4,6,8,10}C = \{2, 4, 6, 8, 10\}

Two conventions that matter. Elements are not repeated — the letters of level form the set {l,e,v}\{l, e, v\} and not {l,e,v,e,l}\{l, e, v, e, l\}. And the order does not matter: {1,2,3}\{1, 2, 3\} and {3,1,2}\{3, 1, 2\} are the same set.

Membership notation. 2∈A2 \in A means *22 belongs to AA*, and 4∉A4 \notin A means *44 does not belong to AA*.

When to use which form. Roster form is clearer for a small finite set. Set-builder form is essential for an infinite set, since you cannot list all of it — so the set of natural numbers must be written {x:x∈N}\{x : x \in \mathbb{N}\}, or at best as {1,2,3,…}\{1, 2, 3, \ldots\} with dots standing in for a property.

What are the different types of sets?

Six classifications, and each answers a different question about the set.

Empty set — a set with no elements, written { }\{\,\} or ∅\varnothing. Also called the null or void set.

{x:x is a natural number less than 1}=∅\{x : x \text{ is a natural number less than } 1\} = \varnothing

Singleton set — a set with exactly one element.

{x:x is an even prime number}={2}\{x : x \text{ is an even prime number}\} = \{2\}

Finite set — the number of elements can be counted and comes to an end. {2,3,5,7}\{2, 3, 5, 7\} is finite.

Infinite set — the elements never end. The set of natural numbers is infinite.

Cardinal number — written n(A)n(A), it is the number of distinct elements in a finite set. For A={2,3,5,7}A = \{2, 3, 5, 7\}, n(A)=4n(A) = 4; and n(∅)=0n(\varnothing) = 0.

Equal sets — two sets are equal if they have exactly the same elements, written A=BA = B. Order and repetition are ignored, so

{1,2,3}={3,2,1}\{1, 2, 3\} = \{3, 2, 1\}

Equivalent sets — two sets are equivalent if they have the same cardinal number, whatever their elements are. So

{1,2,3} and {a,b,c}\{1, 2, 3\} \text{ and } \{a, b, c\}

are equivalent — both have three elements — but they are not equal, since not one element is shared.

The one-way relationship to remember. Equal sets are always equivalent, because identical elements means an identical count. But equivalent sets need not be equal, as the example above shows. Treating the two words as interchangeable is the commonest mistake in this section, and the question are these sets equal or equivalent? is set precisely to test it.

A boundary case worth knowing. ∅\varnothing and {∅}\{\varnothing\} are not the same. The first is the empty set, with n=0n = 0. The second is a singleton whose one element happens to be the empty set, so n=1n = 1. Similarly {0}\{0\} is a singleton and not empty — it contains one element, which happens to be the number zero.
Formula

How do you count and list all the subsets of a set?

Set AA is a subset of set BB, written A⊆BA \subseteq B, if every element of AA is also in BB.

It is a
proper subset
, written A⊂BA \subset B, if A⊆BA \subseteq B and A≠BA \neq B — so at least one element of BB is missing from AA.

Two subsets every set has:

- The set itself, since every element of AA is certainly in AA.
- The empty set, since it has no element that could fail to be in AA.

For a set of nn elements:

number of subsets=2n\text{number of subsets} = 2^n

number of proper subsets=2n−1\text{number of proper subsets} = 2^n - 1

The proper count is one less because the set itself is excluded.

Worked example 1 — listing them all. Find all the subsets of A={1,2,3}A = \{1, 2, 3\}.

Work by size:

- With no elements: ∅\varnothing
- With one: {1}\{1\}, {2}\{2\}, {3}\{3\}
- With two: {1,2}\{1, 2\}, {1,3}\{1, 3\}, {2,3}\{2, 3\}
- With three: {1,2,3}\{1, 2, 3\}

That is 1+3+3+1=81 + 3 + 3 + 1 = 8 subsets, matching 23=82^3 = 8. Of these, seven are proper — all except {1,2,3}\{1, 2, 3\} itself.

Listing by size is worth doing in that order, because it guarantees none is missed and none repeated.

Worked example 2 — counting only. How many subsets does a set of 55 elements have?

25=32 subsets,32−1=31 proper subsets2^5 = 32 \text{ subsets}, \qquad 32 - 1 = 31 \text{ proper subsets}

Worked example 3 — working backwards. A set has 6464 subsets. How many elements does it have?

2n=64=26  ⇒  n=62^n = 64 = 2^6 \;\Rightarrow\; n = 6

This is an exponential equation of the kind met in the chapter on exponents — same base, so equate the indices.

Worked example 4 — the empty set. How many subsets does ∅\varnothing have?

20=12^0 = 1

Exactly one — the empty set itself. And it has 20−1=02^0 - 1 = 0 proper subsets, since the only subset available is the set itself.

The distinction that costs marks. ∈\in and ⊆\subseteq are different. For A={1,2,3}A = \{1, 2, 3\}:

- 1∈A1 \in A is true — 11 is an element
- {1}⊆A\{1\} \subseteq A is true — {1}\{1\} is a subset
- 1⊆A1 \subseteq A is wrong, because 11 is not a set
- {1}∈A\{1\} \in A is wrong, because the elements of AA are numbers, not sets

What is a universal set, and how do you find a complement?

The universal set, written ξ\xi or UU, is the set containing all the elements under consideration in a particular discussion. Every other set in that discussion is a subset of it.

Which set is universal depends entirely on the context. Discussing the digits, ξ={0,1,2,…,9}\xi = \{0, 1, 2, \ldots, 9\}; discussing the students of a class, ξ\xi is that class.

The complement of AA, written A′A', is the set of all elements of the universal set that are not in AA:

A′=ξ−AA' = \xi - A

Worked example. Let ξ={1,2,3,4,5,6,7,8,9,10}\xi = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\} and A={2,4,6,8,10}A = \{2, 4, 6, 8, 10\}.

Then

A′={1,3,5,7,9}A' = \{1, 3, 5, 7, 9\}

Checking the counts:

n(A)=5,n(A′)=5,n(ξ)=10n(A) = 5, \qquad n(A') = 5, \qquad n(\xi) = 10

n(A)+n(A′)=5+5=10=n(ξ)n(A) + n(A') = 5 + 5 = 10 = n(\xi)

This relation always holds, and it is a useful check:

n(A)+n(A′)=n(ξ)n(A) + n(A') = n(\xi)

Four properties of complements:

- (A′)′=A(A')' = A — complementing twice returns the original set.
- ξ′=∅\xi' = \varnothing — nothing is outside the universal set.
- ∅′=ξ\varnothing' = \xi — everything is outside the empty set.
- AA and A′A' have no element in common, and together they make up the whole of ξ\xi.

Worked example 2 — with a described set. Let ξ={x:x is a natural number≤12}\xi = \{x : x \text{ is a natural number} \leq 12\} and let BB be the set of multiples of 33 in ξ\xi.

B={3,6,9,12},n(B)=4B = \{3, 6, 9, 12\}, \qquad n(B) = 4

B′={1,2,4,5,7,8,10,11},n(B′)=8B' = \{1, 2, 4, 5, 7, 8, 10, 11\}, \qquad n(B') = 8

And 4+8=12=n(ξ)4 + 8 = 12 = n(\xi). Correct.

Why the universal set must be stated. A complement has no meaning on its own. The complement of {2,4,6,8,10}\{2, 4, 6, 8, 10\} is {1,3,5,7,9}\{1, 3, 5, 7, 9\} only because ξ\xi was the numbers to 1010. Had ξ\xi been the numbers to 2020, the complement would have contained ten more elements.

So a question asking for a complement must give you a universal set, and an answer that does not say which ξ\xi was used is incomplete.
Exam tip

Exam tip: count the empty set and the set itself as subsets

When listing subsets, always include ∅\varnothing and the set itself. Omitting them is the most frequent error here, and it makes the count disagree with 2n2^n — which is a free check you should run every time.

List subsets by size — none, then one element, then two, and so on. It guarantees nothing is missed or duplicated.

Remember proper subsets number 2n−12^n - 1, excluding the set itself.

Keep ∈\in and ⊆\subseteq apart: ∈\in relates an element to a set, ⊆\subseteq relates a set to a set. For A={1,2,3}A = \{1,2,3\}, write 1∈A1 \in A and {1}⊆A\{1\} \subseteq A, never the reverse.

For equal or equivalent, say which and why: equal means the same elements, equivalent means the same number of elements. Equal sets are always equivalent; the reverse is not true.

Note that ∅\varnothing, {∅}\{\varnothing\} and {0}\{0\} are three different sets, with n=0n = 0, 11 and 11.

A complement needs a stated universal set — say which ξ\xi you used.

Use n(A)+n(A′)=n(ξ)n(A) + n(A') = n(\xi) to check a complement, and remember (A′)′=A(A')' = A.

And in set-builder form, read the colon as such that and state the property fully, including any restriction such as n∈Nn \in \mathbb{N}.
Did you know

Why does the empty set count as a subset of every set?

It sounds like a technicality invented to make a formula work. It is not — it follows from what subset means.

A⊆BA \subseteq B says: every element of AA is also in BB. To show that this fails, you would have to produce an element of AA that is missing from BB.

Now try to do that for the empty set. You would need to find an element of ∅\varnothing — and there are none to find. So the requirement can never be broken, and the statement ∅⊆B\varnothing \subseteq B holds for every set BB without exception.

The same reasoning is why the count works out to exactly 2n2^n. Choosing a subset means making an in-or-out decision for each of nn elements, and out for all of them is a perfectly ordinary set of decisions — it produces ∅\varnothing.

Which is a neat demonstration of how mathematical definitions behave. The empty set was not added to the list of subsets to tidy up the arithmetic; the arithmetic came out tidy because the definition already included it.
Key takeaways

Sets, subsets and complements: quick revision

- A set is a well-defined collection of distinct objects, written in curly brackets. Elements are never repeated and the order does not matter.
- Roster form lists the elements: A={2,3,5,7}A = \{2, 3, 5, 7\}. Set-builder form states the property: A={x:x is a prime<10}A = \{x : x \text{ is a prime} < 10\}, with the colon read as such that.
- Use ∈\in for membership and ∉\notin for non-membership.
-
Empty set
∅\varnothing has no elements; a singleton has exactly one; a finite set ends; an infinite set does not.
- Cardinal number n(A)n(A) counts distinct elements — n(∅)=0n(\varnothing) = 0.
- Equal sets have the same elements; equivalent sets have the same number of elements. Equal implies equivalent, but not the reverse.
- ∅\varnothing, {∅}\{\varnothing\} and {0}\{0\} are three different sets, with n=0n = 0, 11 and 11.
- A⊆BA \subseteq B if every element of AA is in BB; a proper subset A⊂BA \subset B also requires A≠BA \neq B.
- Every set has itself and ∅\varnothing as subsets.
-
Number of subsets =2n= 2^n; proper subsets =2n−1= 2^n - 1
. So {1,2,3}\{1,2,3\} has 23=82^3 = 8 subsets and 77 proper ones; a set of 55 has 3232 and 3131; a set with 6464 subsets has 2n=262^n = 2^6, so n=6n = 6; and ∅\varnothing has 20=12^0 = 1 subset.
- List subsets by size — 1+3+3+1=81 + 3 + 3 + 1 = 8 for a three-element set.
- Keep ∈\in (element to set) apart from ⊆\subseteq (set to set).
- The
universal set
ξ\xi holds everything under consideration; the complement A′=ξ−AA' = \xi - A.
- With ξ={1,…,10}\xi = \{1, \ldots, 10\} and A={2,4,6,8,10}A = \{2,4,6,8,10\}: A′={1,3,5,7,9}A' = \{1,3,5,7,9\}, and n(A)+n(A′)=5+5=10=n(ξ)n(A) + n(A') = 5 + 5 = 10 = n(\xi).
- Properties: (A′)′=A(A')' = A, ξ′=∅\xi' = \varnothing, ∅′=ξ\varnothing' = \xi, and AA with A′A' share nothing and together fill ξ\xi.
- A complement is meaningless without a stated universal set.

Try listing every subset of a four-element set by size and checking the total against 242^4 — the count either confirms your list or tells you exactly how many you missed.

Ready to put this into practice?

Create a personalized quiz on this exact topic — free to start.

Create your own quiz on Sets — Part 1Create a free account
← Back to all articles