Revision notes

Chapter 1 Sets: 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

What a set is: roster form and set-builder form

Set or not a set?

  • Well-defined: a set
    • Factors of 24
    • Months with 30 days
    • Letters of the word INDIA
    • Solutions of x² = 9
  • Not well-defined: not a set
    • Clever students in a class
    • Tall buildings in Delhi
    • Tasty fruits
    • Famous singers
A collection is a set only when membership can be decided without opinion.
Standard number sets
SymbolThe set ofExamples of elements
Nnatural numbers1, 2, 3, ...
Zintegers..., −2, −1, 0, 1, 2, ...
Qrational numbers−3, 1/2, 0.75
Rreal numbers√2, π, −4.1
Z⁺positive integers1, 2, 3, ...
Q⁺positive rational numbers2/3, 5
R⁺positive real numbers0.1, √3

Roster form lists the elements: {2, 3, 5, 7}. Set-builder form states the rule: {x : x is a prime number and x < 10}. Both describe the same set.

— Two ways to write a set

Converting from set-builder form to roster form

  1. Read the rule Note the universal type of number (N, Z, R) and the condition.
  2. Find every object that passes Solve the equation or test each candidate.
  3. List them once each Drop repeats; order does not matter.
  4. Check the edges Is each end value included (≤) or excluded (<)?

Key takeaways: a set must be well-defined; ∈ means belongs to and ∉ means does not belong to; roster form lists distinct elements in any order, while set-builder form states a rule. When you convert, check the end values carefully and never repeat an element.

Read the full lesson

Lesson 2

The empty set, finite and infinite sets, and equal sets

Sets by size

  • Empty set n = 0; written φ or { }.
    • {x ∈ N : x < 1}
    • Real solutions of x² + 1 = 0
  • Finite, non-empty n is a natural number.
    • Days of the week, n = 7
    • Factors of 10, n = 4
  • Infinite No natural number counts it.
    • N, Z, Q, R
    • Points on a circle
    • Lines through a point
The empty set is finite, because n(φ) = 0.

A = B exactly when every element of A is in B and every element of B is in A. Order of listing and repeated elements make no difference.

— Equal sets
Quick summary
SetRoster formnType
{x ∈ N : x < 1}φ0empty, finite
{x ∈ Z : x² = 4}{−2, 2}2finite
{x ∈ N : x is a multiple of 4}{4, 8, 12, ...}noneinfinite
{0}{0}1finite, singleton

Key takeaways: φ has no element, but {0} and {φ} each have one. n(A) counts distinct elements, and n(φ) = 0. A set is finite if its elements can be counted to a definite number, otherwise infinite. Two sets are equal when they have exactly the same elements; write both in roster form to check.

Read the full lesson

Lesson 3

Subsets, intervals and the universal set

The real numbers R

  • Rational numbers Q Numbers p/q with p, q integers, q ≠ 0.
    • Integers Z, which contain the natural numbers N
    • Fractions such as 3/7 and −11/4
    • Terminating or recurring decimals
  • Irrational numbers T Real numbers that are not rational.
    • √2, √5
    • π
    • Non-terminating, non-recurring decimals
Intervals as subsets of R
IntervalSet-builder formEnd points
(a, b) open{x : a < x < b}neither included
[a, b] closed{x : a ≤ x ≤ b}both included
[a, b){x : a ≤ x < b}a included, b excluded
(a, b]{x : a < x ≤ b}a excluded, b included
[0, ∞){x : x ≥ 0}non-negative reals
(−∞, 0){x : x < 0}negative reals

A ⊂ B means every element of A is in B. φ ⊂ A and A ⊂ A for every set A. In intervals, ( ) excludes an end point and [ ] includes it.

— Subsets in one line

Key takeaways: test a subset element by element; φ and A itself are always subsets of A; ∈ links an element to a set and ⊂ links two sets; intervals are subsets of R with length b − a; and a universal set must contain every set in the problem.

Read the full lesson

Lesson 4

Venn diagrams: union, intersection and difference of sets

Three operations on two sets

  • Union A ∪ B
    • In A or B or both
    • Both circles shaded
    • Common elements listed once
    • Largest of the three
  • Intersection A ∩ B
    • In both A and B
    • Only the overlap shaded
    • Empty when A, B are disjoint
    • A ∩ B ⊂ A and A ∩ B ⊂ B
  • Difference A − B
    • In A but not in B
    • A with the overlap removed
    • A − B ≠ B − A in general
    • Disjoint from B
Laws of the operations
LawUnionIntersection
CommutativeA ∪ B = B ∪ AA ∩ B = B ∩ A
Associative(A ∪ B) ∪ C = A ∪ (B ∪ C)(A ∩ B) ∩ C = A ∩ (B ∩ C)
Identity / empty setA ∪ φ = Aφ ∩ A = φ
IdempotentA ∪ A = AA ∩ A = A
Law of UU ∪ A = UU ∩ A = A

A ∪ B: in A or B. A ∩ B: in A and B. A − B: in A, not in B. If A ∩ B = φ, A and B are disjoint.

— The three operations

Key takeaways: union collects, intersection keeps what is shared, difference removes. Union and intersection are commutative and associative, difference is not commutative. Intersection distributes over union. If B ⊂ A, then A ∪ B = A and A ∩ B = B.

Read the full lesson

Lesson 5

Complement of a set and De Morgan's laws

Properties of complements
LawStatement
Complement lawsA ∪ A′ = U and A ∩ A′ = φ
Double complement(A′)′ = A
Empty set and universal setφ′ = U and U′ = φ
De Morgan's laws(A ∪ B)′ = A′ ∩ B′ and (A ∩ B)′ = A′ ∪ B′

(A ∪ B)′ = A′ ∩ B′ and (A ∩ B)′ = A′ ∪ B′: complement each set and swap ∪ with ∩.

— De Morgan's laws

Verifying (A ∪ B)′ = A′ ∩ B′ on an example

  1. Write U, A, B in roster form Make sure A and B are subsets of U.
  2. Left side Find A ∪ B, then its complement.
  3. Right side Find A′ and B′, then their intersection.
  4. Compare The two sets should match element for element.

Key takeaways: A′ = U − A depends on U. A ∪ A′ = U, A ∩ A′ = φ, (A′)′ = A, φ′ = U, U′ = φ. De Morgan: the complement of a union is the intersection of the complements, and vice versa. To prove two sets equal, show each is a subset of the other by following a single element.

Read the full lesson

Privacy · Terms · Refunds · Delivery