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

← All study notes

A Set With Three Elements Hides Eight Sets Inside It

Learn to use the subset and proper-subset symbols, list every subset and verify the two-to-the-n rule, find a complement against a universal set, and compute unions, intersections and differences.

How many subsets does a set of three elements have?

Eight — and there is a formula rather than a need to count. A set with nn elements has 2n2^n subsets, so three elements give 23=82^3 = 8.

That includes two that are easy to forget: the empty set and the whole set itself. This page covers everything in the ICSE Class 7 Mathematics chapter's second part: subsets and proper subsets, listing all subsets, the universal set and complement, and union, intersection and difference.

What is the difference between a subset and a proper subset?

AA is a subset of 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 it is a subset and A≠BA \neq B — so BB has at least one element that AA does not.

Take A={1,2}A = \{1, 2\} and B={1,2,3}B = \{1, 2, 3\}. Both 1 and 2 lie in BB, so A⊆BA \subseteq B. And since BB also holds 3, A⊂BA \subset B as well.

But with C={1,2,3}C = \{1, 2, 3\} and B={1,2,3}B = \{1, 2, 3\}: C⊆BC \subseteq B is true, while C⊂BC \subset B is false, because the two sets are equal.

Two facts follow from the definition and are asked directly:

- Every set is a subset of itself, so A⊆AA \subseteq A always holds.
- The empty set is a subset of every set, so ∅⊆A\varnothing \subseteq A always holds — there is no element of ∅\varnothing that could fail the test.

The cricket team is a subset of the whole class, and a proper subset so long as somebody in the class is not in the team.

The symbol to watch is ∈\in against ⊆\subseteq. Membership joins an element to a set, as 2∈{1,2,3}2 \in \{1,2,3\}; subset joins a set to a set, as {2}⊆{1,2,3}\{2\} \subseteq \{1,2,3\}. Writing 2⊆{1,2,3}2 \subseteq \{1,2,3\} or {2}∈{1,2,3}\{2\} \in \{1,2,3\} is marked wrong.

How do you list all the subsets of a set?

Work up by size — the empty set, then every single element, then every pair, and so on up to the whole set.

For A={a,b,c}A = \{a, b, c\}:

- 0 elements: ∅\varnothing
- 1 element: {a}\{a\}, {b}\{b\}, {c}\{c\}
- 2 elements: {a,b}\{a, b\}, {a,c}\{a, c\}, {b,c}\{b, c\}
- 3 elements: {a,b,c}\{a, b, c\}

That is 1+3+3+1=81 + 3 + 3 + 1 = 8 subsets, matching

2n=23=82^n = 2^3 = 8

The proper subsets are all of them except AA itself, so there are

2n−1=72^n - 1 = 7

Checking the rule on other sizes: a set of 2 elements has 22=42^2 = 4 subsets, and a set of 4 elements has 24=162^4 = 16. A set of 5 has 32.

The reason the rule works is that each element faces one independent choice — in the subset or out of it. Three elements give 2×2×2=82 \times 2 \times 2 = 8 combinations of those choices, which is exactly the subset count.

So listing them in order of size is not just tidiness. It guarantees you produce all 8 rather than stopping at 6, which is what happens when people forget ∅\varnothing and AA itself.

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

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

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

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

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

Count them: n(A)=3n(A) = 3 and n(A′)=7n(A') = 7, and

n(A)+n(A′)=3+7=10=n(U)n(A) + n(A') = 3 + 7 = 10 = n(U)

That relation always holds, and it is a quick way to check a complement — if the two counts do not add to n(U)n(U), an element has been dropped or duplicated.

Two boundary cases are examined: U′=∅U' = \varnothing, since nothing in UU is outside UU; and ∅′=U\varnothing' = U. Also (A′)′=A(A')' = A, because excluding twice returns you to the start.

In a class survey, the universal set is the whole class, and the complement of "pupils who play cricket" is "pupils who do not".

The complement has no meaning without a stated universal set. The complement of {2,4,6}\{2,4,6\} is {1,3,5,7,8,9,10}\{1,3,5,7,8,9,10\} for the UU above, but it would be {1,3,5}\{1,3,5\} if UU were {1,…,6}\{1,\ldots,6\} — so always write down UU first.
Formula

How do you find the union, intersection and difference of two sets?

Let A={1,2,3,4}A = \{1, 2, 3, 4\} and B={3,4,5,6}B = \{3, 4, 5, 6\}.

Union A∪BA \cup B — elements in AA or BB or both, each listed once:

A∪B={1,2,3,4,5,6},n(A∪B)=6A \cup B = \{1, 2, 3, 4, 5, 6\}, \qquad n(A \cup B) = 6

Intersection A∩BA \cap B — elements in both:

A∩B={3,4},n(A∩B)=2A \cap B = \{3, 4\}, \qquad n(A \cap B) = 2

Difference A−BA - B — elements in AA but not in BB:

A−B={1,2},B−A={5,6}A - B = \{1, 2\}, \qquad B - A = \{5, 6\}

The counts are linked by a formula worth memorising:

n(A∪B)=n(A)+n(B)−n(A∩B)n(A \cup B) = n(A) + n(B) - n(A \cap B)

Checking it here: 4+4−2=64 + 4 - 2 = 6, which matches n(A∪B)=6n(A \cup B) = 6. The intersection is subtracted because the common elements 3 and 4 would otherwise be counted twice.

For disjoint sets the intersection is empty, so the formula simplifies to n(A∪B)=n(A)+n(B)n(A \cup B) = n(A) + n(B).

The operation students get wrong is the difference, because it is not symmetric. A−B={1,2}A - B = \{1,2\} while B−A={5,6}B - A = \{5,6\} — quite different sets. Union and intersection are symmetric, so A∪B=B∪AA \cup B = B \cup A, but the order in a difference always matters.
Exam tip

Exam tip: remembering the empty set and the set itself

Subset and operation questions lose marks in a handful of predictable places.

When listing subsets, include ∅\varnothing and the set itself, and lay them out by size so the total matches 2n2^n. State the count as a check: *8 subsets, since 23=82^3 = 8; 7 proper subsets.*

Keep the symbols straight — ∈\in for an element, ⊆\subseteq for a subset, ⊂\subset for a proper subset.

Write the universal set down before finding any complement, and verify with n(A)+n(A′)=n(U)n(A) + n(A') = n(U).

In a union, list each common element once; in a difference, respect the order, since A−BA - B and B−AB - A differ.

And when a question gives only the cardinal numbers, use n(A∪B)=n(A)+n(B)−n(A∩B)n(A \cup B) = n(A) + n(B) - n(A \cap B) rather than trying to list elements you were never given.
Did you know

Why does each extra element double the number of subsets?

Because every element gets an independent choice: in the subset, or out of it.

With one element there are 2 subsets — ∅\varnothing and {a}\{a\}. Add a second element and each of those two subsets can either take bb or leave it, giving 4. Add a third and each of those four splits again, giving 8.

So the count multiplies by 2 for every element added, which is exactly what 2n2^n says. A set of 10 elements already has 1024 subsets — which is why the formula matters far more than any attempt to list them.
Key takeaways

Subsets and set operations: quick revision

- A⊆BA \subseteq B means every element of AA is in BB; A⊂BA \subset B adds that A≠BA \neq B.
- Every set is a subset of itself, and ∅\varnothing is a subset of every set.
- A set of nn elements has 2n2^n subsets and 2n−12^n - 1 proper subsets, because each element is independently in or out.
- The complement A′A' holds everything in UU but not in AA, and n(A)+n(A′)=n(U)n(A) + n(A') = n(U) — so a complement is meaningless without a stated UU.
- A∪BA \cup B takes elements of either set once, A∩BA \cap B takes the common ones, and A−BA - B takes those in AA only.
- n(A∪B)=n(A)+n(B)−n(A∩B)n(A \cup B) = n(A) + n(B) - n(A \cap B), and unlike union and intersection, the difference is not symmetric.

You will remember all of this far better after answering five questions on it than after reading it twice.

Ready to put this into practice?

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

Create your own quiz on Set Concepts — Part 2Create a free account
← Back to all articles