Revision notes

Sets and Relations: Practice

The key points, rules to remember, tables and diagrams from all 9 lessons, on one page for quick revision. To keep a copy, use your browser's Print and choose "Save as PDF".

Lesson 1

Set notation and types: the common traps

Solve the condition first, then keep only values from the stated number system. ∅ has 0 elements; {0} and {∅} each have 1.

— Rule to remember

Read where x comes from before you list anything. Watch strict and non-strict inequalities at both ends, and check the boundary value by substitution. Test any set-builder rule on its first and last element. Count distinct elements only. {0} and {∅} are singletons, never the empty set.

Read the full lesson

Lesson 2

Subsets and power sets: counting fast

Forced-in and forced-out elements have no choice; each free element doubles the count, so k free elements give 2^k subsets. For 2^m − 2^n = N, write N as (power of 2) × (odd number).

— Rule to remember

Treat an inner set as one sealed element when testing ∈ and ⊆. Count conditional subsets with free elements only. Build power sets of power sets one layer at a time. Split the difference of two powers of 2 into a power of 2 times an odd number. And always check whether the question counts the empty set and the set itself.

Read the full lesson

Lesson 3

Set operations and identities: quick simplification

Number the regions (1 A only, 2 both, 3 B only, 4 outside) and compare region lists. (A − B) ∪ B = A ∪ B, and A ∪ (A' ∩ B) = A ∪ B.

— Rule to remember

Use laws when the structure is obvious and regions when it is not. One counter-example with small sets kills a false identity. Watch differences: they are not undone by unions and they depend on order. Translate conditions such as A ∩ B = A into subset statements before doing anything else.

Read the full lesson

Lesson 4

Venn diagram problems: only, exactly and at least

Three sets: at least one = S1 − S2 + S3; exactly two = S2 − 3S3; exactly one = S1 − 2S2 + 3S3. Least overlap of two sets = n(A) + n(B) − n(U), not below 0.

— Rule to remember

Name the region the question asks about before calculating. For two sets, find the overlap first and everything else follows. For three sets, use S1, S2 and S3 for one quick answer, and fill from the centre when several regions are needed or when you want a check. The least overlap comes from the union not exceeding the total.

Read the full lesson

Lesson 5

Relations: products, counts and properties

Properties of some standard relations
RelationReflexiveSymmetricTransitive
a ≤ b on RYesNoYes
a < b on RNoNoYes
a divides b on NYesNoYes
a − b even on ZYesYesYes
|a − b| ≤ 1 on RYesYesNo

n(A × B) = pq and there are 2^(pq) relations from A to B. To break a property, one counter-example is enough; to prove it, argue for every pair.

— Rule to remember

Products distribute over union and intersection, and their size multiplies. For relations given by an equation over N, list values until one fails. Test reflexive on the diagonal, symmetric by reversing, and transitive by chaining every pair. Learn the standard relations in the table, because they recur as options.

Read the full lesson

Lesson 6

Counting with divisibility: multiples, divisors and the union formula

n(multiples of a or b up to N) = ⌊N/a⌋ + ⌊N/b⌋ − ⌊N/lcm(a, b)⌋. Common divisors of two numbers = divisors of their hcf. If n = p^x q^y r^z (prime factorisation), then n has (x + 1)(y + 1)(z + 1) divisors.

Key takeaways: turn the words into sets, use ⌊N/k⌋ for each count, use lcm for 'both' and hcf for common divisors, and take the complement for 'neither'. Check small cases by listing.

Read the full lesson

Lesson 7

Set equations: unknown sets, cancellation traps and sandwich counts

A ∪ B = A ∪ C alone does not give B = C, and A ∩ B = A ∩ C alone does not either. If both hold, then B = C. Also A ⊆ B ⟺ A ∩ B = A ⟺ A ∪ B = B ⟺ A − B = ∅.

Key takeaways: translate every equality into a subset statement, remember that a single union or intersection equality cannot be cancelled, and count unknown sets by listing forced, forbidden and free elements.

Read the full lesson

Lesson 8

Disproving relation properties: the counterexample method

PropertyTo proveTo disprove
Reflexiveshow that a R a for every afind one a with a R a false
Symmetricassume a R b, show b R afind a, b with a R b but not b R a
Transitiveassume a R b and b R c, show a R cfind a, b, c with a R b and b R c but not a R c

One counterexample kills a property; a general argument proves it. Try 0, 1, a repeated element, and 'bridge' elements such as 0 or 1 when searching for counterexamples.

RelationReflexiveSymmetricTransitive
x = yyesyesyes
x ≤ y on Ryesnoyes
x < y on Rnonoyes
x + y = 10 on Znoyesno
x and y have a common prime factor, on {2, 3, ...}yesyesno

Key takeaways: disprove with a single example, prove with a general argument. Remember the catalogue: ≤ is reflexive and transitive, < is only transitive, 'divides' is reflexive and transitive, and x + y = 10 is only symmetric.

Read the full lesson

Lesson 9

Mixed practice: sets, Venn diagrams, products and relations

Question saysTool
list or count elements given by a ruleroster form, test the first failure
how many subsets2ⁿ, then adjust for proper or non-empty
both, only, neithern(A ∪ B) formula and the complement
how many relations2^(pq)
how many functionsqᵖ
equal pairsequate each position
equivalence relationreflexive, symmetric, transitive, then classes

Name the tool first. Subsets: 2ⁿ. Relations from a p-set to a q-set: 2^(pq). Functions: q^p. Union: n(A) + n(B) − n(A ∩ B). For an equivalence relation, the pairs number the sum of the squares of the class sizes.

Key takeaways: identify the tool before you calculate, keep the universal set in mind (N, Z or R), and use a quick check such as listing, an alternative method, or a total that must add up.

Read the full lesson

Privacy · Terms · Refunds · Delivery