Revision notes

Chapter 1 Sets, Relations and Functions: 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 revisited: subsets, power sets and the laws of set operations

The real numbers R

  • Rational numbers Q p/q with p, q integers and q ≠ 0
    • Integers Z
    • inside Z: whole numbers W = {0, 1, 2, ...}
    • inside W: natural numbers N = {1, 2, 3, ...}
    • Fractions such as −7/3
  • Irrational numbers real but not rational
    • √2, √5
    • π, e
The laws of set operations
LawUnion formIntersection form
CommutativeA ∪ B = B ∪ AA ∩ B = B ∩ A
Associative(A ∪ B) ∪ C = A ∪ (B ∪ C)(A ∩ B) ∩ C = A ∩ (B ∩ C)
DistributiveA ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
IdentityA ∪ ∅ = AA ∩ U = A
IdempotentA ∪ A = AA ∩ A = A
AbsorptionA ∪ (A ∩ B) = AA ∩ (A ∪ B) = A
ComplementA ∪ A′ = U, ∅′ = UA ∩ A′ = ∅, U′ = ∅
De Morgan(A ∪ B)′ = A′ ∩ B′(A ∩ B)′ = A′ ∪ B′

n(A ∪ B) = n(A) + n(B) − n(A ∩ B); for disjoint sets n(A ∪ B) = n(A) + n(B). n(A ∪ B ∪ C) = n(A) + n(B) + n(C) − n(A ∩ B) − n(B ∩ C) − n(A ∩ C) + n(A ∩ B ∩ C).

— Cardinality formulas

Counting 'only A' in a three-set problem

  1. Start with n(A) everyone in A
  2. Subtract n(A ∩ B) and n(A ∩ C) removes those who are also in B or C
  3. Add back n(A ∩ B ∩ C) it was removed twice
  4. Result: n(A ∩ B′ ∩ C′) those in A only

Key takeaways: ∈ links a member to a set, ⊆ links two sets; ∅ and A are the trivial subsets of A; n(P(A)) = 2ⁿ; A∆B = (A ∪ B) − (A ∩ B); De Morgan's laws turn a complement of a union into an intersection of complements; and in three-set counting problems, add back what was subtracted twice.

Read the full lesson

Lesson 2

Cartesian products, constants and variables, intervals and neighbourhoods

Types of intervals (a < b)
IntervalSet formType
(a, b){x : a < x < b}finite, open
[a, b]{x : a ≤ x ≤ b}finite, closed
(a, b]{x : a < x ≤ b}finite, neither open nor closed
[a, b){x : a ≤ x < b}finite, neither open nor closed
(a, ∞){x : x > a}infinite
[a, ∞){x : x ≥ a}infinite
(−∞, b){x : x < b}infinite
(−∞, b]{x : x ≤ b}infinite
(−∞, ∞)Rinfinite, the whole line

Neighbourhood or deleted neighbourhood?

  • ε-neighbourhood of a
    • (a − ε, a + ε)
    • |x − a| < ε
    • contains a itself
  • Deleted neighbourhood of a
    • (a − ε, a + ε) − {a}
    • 0 < |x − a| < ε
    • a is removed

n(A × B) = n(A) n(B). In intervals, ( ) excludes an end and [ ] includes it; ∞ always takes ( ). The ε-neighbourhood of a is (a − ε, a + ε) = {x : |x − a| < ε}.

— Remember

Key takeaways: Cartesian products are sets of ordered pairs, so order matters and A × B ≠ B × A unless A = B; constants stay fixed while dependent variables follow independent ones; an interval is a gap-free subset of R with at least two points; and the ε-neighbourhood of a is the open interval of half-width ε centred at a.

Read the full lesson

Lesson 3

Relations: domain, range and reflexive, symmetric, transitive and equivalence relations

Testing a relation R on a set S

  • Reflexive? look at every element
    • Is (a, a) in R for all a ∈ S?
    • One missing (a, a) is enough to fail
  • Symmetric? look at every pair
    • For each (a, b) in R, is (b, a) in R?
    • Pairs (a, a) never cause trouble
  • Transitive? look at chains
    • For each (a, b) and (b, c) in R, is (a, c) in R?
    • No chain at all means it passes
  • Equivalence all three pass
    • Splits S into disjoint classes

Reflexive: (a, a) for all a. Symmetric: (a, b) ⇒ (b, a). Transitive: (a, b) and (b, c) ⇒ (a, c). Number of relations on an n-element set = 2^(n²).

— Relations in one line

Key takeaways: a relation is a subset of A × B; its range lies inside the co-domain; test the three properties pair by pair and chain by chain; give both the rule and the set; equivalence relations partition their set; and there are 2^(mn) relations from an m-element set to an n-element set.

Read the full lesson

Lesson 4

Functions: definition, representations, special functions and one-to-one and onto

Elementary functions
FunctionRuleSample values
Identity I on Xf(x) = xf(5) = 5
Constantf(x) = c for all xc = 0 gives the zero function
Modulus |x|−x if x < 0; x if x ≥ 0|−4| = 4, |3| = 3
Signum sgnx/|x| if x ≠ 0; 0 if x = 0sgn(−7) = −1, sgn(0) = 0, sgn(2) = 1
Greatest integer (floor) ⌊x⌋largest integer ≤ x⌊3.6⌋ = 3, ⌊−1.2⌋ = −2, ⌊5⌋ = 5
Smallest integer (ceiling) ⌈x⌉smallest integer ≥ x⌈3.6⌉ = 4, ⌈−1.2⌉ = −1, ⌈5⌉ = 5

The two properties

  • One-to-one
    • No two inputs share an output
    • Prove: f(x) = f(y) ⇒ x = y
    • Horizontal lines meet the graph at most once
  • Onto
    • Every element of the co-domain is hit
    • Prove: for each y, solve f(x) = y inside the domain
    • Every horizontal line through the co-domain meets the graph

Function: every input has exactly one output. One-to-one: f(x) = f(y) ⇒ x = y. Onto: range = co-domain. Bijective: both.

— Functions in one line

Key takeaways: state the domain and co-domain of every function; use the vertical line test to decide whether a curve is a function and the horizontal line test for one-to-one and onto; watch negative inputs in ⌊x⌋ and ⌈x⌉; and when solving f(x) = f(y), factor fully, because a second factor can hide extra solutions.

Read the full lesson

Lesson 5

Composition, inverse, algebra of functions, odd and even functions, and graph transformations

Computing (g∘f)(x)

  1. Start with x x in the domain of f
  2. Apply f get f(x), which must lie in the domain of g
  3. Apply g get g(f(x)) = (g∘f)(x)
Transformations of y = f(x)
New graphEffect on the graph of y = f(x)
y = −f(x)reflection in the x-axis
y = f(−x)reflection in the y-axis
y = f⁻¹(x)reflection in the line y = x
y = f(x + c), c > 0shift c units left
y = f(x − c), c > 0shift c units right
y = f(x) + d, d > 0shift d units up
y = f(x) − d, d > 0shift d units down
y = k f(x), k > 1vertical stretch, away from the x-axis
y = k f(x), 0 < k < 1vertical compression, towards the x-axis
y = f(kx), k > 1horizontal compression towards the y-axis by the factor k

From y = sin x to y = 3 sin(x + 1) − 2

  1. y = sin x the known curve
  2. y = sin(x + 1) shift 1 unit left
  3. y = 3 sin(x + 1) stretch vertically by 3; values now between −3 and 3
  4. y = 3 sin(x + 1) − 2 shift 2 units down; values between −5 and 1

(g∘f)(x) = g(f(x)): f first. Only bijections have inverses, and f⁻¹(f(x)) = x. Even: f(−x) = f(x). Odd: f(−x) = −f(x). f(x − c) moves right, f(x) + d moves up.

— Remember

Key takeaways: check that the range of f lies in the domain of g before forming g∘f; composition is usually not commutative; to invert, solve y = f(x) for x and verify both compositions; even graphs mirror in the y-axis and odd graphs turn half a revolution about the origin; and a complicated graph is often a familiar one shifted, reflected and stretched.

Read the full lesson

Privacy · Terms · Refunds · Delivery