Revision notes

Chapter 1 Set Language: Foundation

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

Lesson 1

Sets, elements and the three ways of writing a set

Set or not a set?

  • Well defined: sets
    • Prime numbers less than 30
    • Colours of a rainbow
    • Districts of Tamil Nadu
    • Letters of the word CHENNAI
  • Not well defined: not sets
    • Kind people in a village
    • Tall students in a class
    • Delicious dishes
    • Easy chapters in a book
Words like kind, tall, delicious and easy depend on the person judging, so they do not fix the members.
One set, three forms
FormHow it is writtenExample: odd natural numbers less than 10
Descriptive formIn wordsThe set of odd natural numbers less than 10
Set builder (rule) formA rule that every element obeys: {x : rule}{x : x is an odd natural number, x < 10}
Roster (tabular) formEvery element listed in { }{1, 3, 5, 7, 9}

Descriptive form uses words, set builder form uses a rule {x : ...}, and roster form lists each element once inside { }.

— Three forms of a set

Changing set builder form into roster form

  1. Read the rule Note the kind of number (N, W, Z) and the condition.
  2. Try values Test each candidate against the condition.
  3. Keep those that fit Check the end points carefully: < or ≤?
  4. List each once in { } Order does not matter.

Key takeaways: a set is a well-defined collection; ∈ means 'belongs to' and ∉ means 'does not belong to'; a set can be written in descriptive, set builder or roster form; in roster form each element appears once and order does not matter.

Read the full lesson

Lesson 2

Types of sets: empty, singleton, finite, infinite, equivalent, equal

Types of sets
TypeMeaningExample
Empty (null, void) setHas no element; written ∅ or { }{x : x ∈ N, x < 1} = ∅
Singleton setHas exactly one element{x : x is an even prime number} = {2}
Finite setIts elements can be counted and the counting endsThe set of days of a week
Infinite setA set that is not finite{4, 8, 12, 16, ...}; points on a line

Classifying a set by its elements

  • Finite
    • Empty set: 0 elements
    • Singleton set: 1 element
    • Any other countable number
  • Infinite
    • Elements never end
    • Examples: N, W, Z, multiples of 7

Equivalent: n(A) = n(B). Equal: the same elements. Equal sets are equivalent; equivalent sets need not be equal.

— Equivalent and equal

Key takeaways: find the elements before classifying a set; ∅ is finite with n(∅) = 0; {0} is a singleton; equivalent sets have the same number of elements, equal sets have the same elements; the universal set U holds everything under discussion.

Read the full lesson

Lesson 3

Subsets, proper subsets, disjoint sets and the power set

Three ways two sets can be related

  • Subset
    • Every element of A is in B
    • In a Venn diagram, A's circle lies inside B's
    • Example: {2, 4} ⊆ {1, 2, 3, 4}
  • Overlapping
    • At least one common element
    • The circles cross
    • Example: {1, 2, 3} and {3, 4, 5}
  • Disjoint
    • No common element
    • The circles do not touch
    • Example: {1, 3, 5} and {2, 4, 6}

If n(A) = m, then n[P(A)] = 2ᵐ, and the number of proper subsets is 2ᵐ − 1.

— Counting subsets

Key takeaways: A ⊆ B when every element of A is in B; ∅ and A itself are subsets of every set A; a proper subset is a subset that is not equal to the whole set; disjoint sets share nothing; a set with m elements has 2ᵐ subsets and 2ᵐ − 1 proper subsets.

Read the full lesson

Lesson 4

Set operations: complement, union, intersection, difference

Set operations with one example
OperationSymbolMeaning (in symbols)With U = {1, ..., 8}, A = {1, 2, 3, 4}, B = {3, 4, 5, 6}
Complement of AA′{x : x ∈ U, x ∉ A}{5, 6, 7, 8}
UnionA ∪ B{x : x ∈ A or x ∈ B}{1, 2, 3, 4, 5, 6}
IntersectionA ∩ B{x : x ∈ A and x ∈ B}{3, 4}
DifferenceA − B{x : x ∈ A and x ∉ B}{1, 2}
Symmetric differenceA Δ B(A − B) ∪ (B − A){1, 2, 5, 6}

Where each operation sits in a two-circle Venn diagram

  • Only in A
    • This region is A − B
  • In both A and B
    • This region is A ∩ B
  • Only in B
    • This region is B − A
  • Outside both circles
    • This region is (A ∪ B)′
A ∪ B is the first three regions together; A Δ B is 'only in A' plus 'only in B'.
Laws for any sets A, B and C
PropertyUnionIntersection
CommutativeA ∪ B = B ∪ AA ∩ B = B ∩ A
AssociativeA ∪ (B ∪ C) = (A ∪ B) ∪ CA ∩ (B ∩ C) = (A ∩ B) ∩ C
DistributiveA ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)

Union is distributive over intersection, and intersection is distributive over union: A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) and A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C).

— Distributive laws

Key takeaways: A′ is what is in U but not in A; ∪ collects everything, ∩ keeps only the common part; A − B keeps A's elements that are not in B; A Δ B keeps what belongs to exactly one of the sets; union and intersection are commutative and associative and each distributes over the other, but set difference is not commutative.

Read the full lesson

Lesson 5

De Morgan's laws and counting with n(A ∪ B)

De Morgan's laws
Laws for set difference (any sets A, B, C)Laws for complementation (A, B subsets of U)
A − (B ∪ C) = (A − B) ∩ (A − C)(A ∪ B)′ = A′ ∩ B′
A − (B ∩ C) = (A − B) ∪ (A − C)(A ∩ B)′ = A′ ∪ B′

(A ∪ B)′ = A′ ∩ B′ and (A ∩ B)′ = A′ ∪ B′: the complement turns ∪ into ∩ and ∩ into ∪.

— De Morgan's laws for complementation

Solving a word problem with a Venn diagram

  1. Name the sets Let each group be a set, e.g. T = tea drinkers.
  2. Fill the centre first Write the number in all the sets.
  3. Work outwards Subtract to get 'exactly two' and then 'only one' regions.
  4. Add the regions Answer the question that was asked.

Key takeaways: De Morgan's laws swap ∪ and ∩ when you take a complement or a difference; n(A ∪ B) = n(A) + n(B) − n(A ∩ B) stops double counting; in three-set problems always fill the Venn diagram from the centre outwards and check that the regions add to the total.

Read the full lesson

Privacy · Terms · Refunds · Delivery