Revision notes

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

Types of relations: empty, universal, reflexive, symmetric, transitive

Reflexive: every a R a. Symmetric: a R b ⇒ b R a. Transitive: a R b and b R c ⇒ a R c. To prove a property you need a general argument; to disprove it, one counterexample is enough.

— Definitions
Proof versus counterexample
PropertyTo prove itTo disprove it
ReflexiveShow (a, a) ∈ R for an arbitrary a ∈ AFind one a with (a, a) ∉ R
SymmetricAssume (a, b) ∈ R, deduce (b, a) ∈ RFind one (a, b) ∈ R with (b, a) ∉ R
TransitiveAssume (a, b), (b, c) ∈ R, deduce (a, c) ∈ RFind (a, b), (b, c) ∈ R with (a, c) ∉ R

Testing a relation given as a list of pairs

  1. Reflexive check Is every (a, a) present for each a in the set? One missing pair is enough to say no.
  2. Symmetric check For each listed (a, b) with a ≠ b, is (b, a) also listed?
  3. Transitive check For every chain (a, b), (b, c) in the list, is (a, c) listed too? Include chains that use pairs like (a, a).
  4. Conclude Equivalence relation only if all three answers are yes.

Key takeaways: a relation in A is a subset of A × A. The empty and universal relations are the two extremes. Reflexive needs every (a, a); symmetric needs every pair reversed; transitive needs every chain completed. Prove with a general argument, disprove with one counterexample, and remember that the three properties are independent of one another.

Read the full lesson

Lesson 2

Equivalence relations and equivalence classes

A relation R in a set A is an equivalence relation if it is reflexive, symmetric and transitive.

— Definition

A = {1, 2, …, 10} sorted by remainder on division by 4

  • [0] (remainder 0)
    • 4
    • 8
  • [1] (remainder 1)
    • 1
    • 5
    • 9
  • [2] (remainder 2)
    • 2
    • 6
    • 10
  • [3] (remainder 3)
    • 3
    • 7
Four disjoint classes whose union is A: a partition.

Key takeaways: an equivalence relation is reflexive, symmetric and transitive. Its classes [a] are disjoint, cover the set, and form a partition; a partition, in turn, defines an equivalence relation. Intersections of equivalence relations are equivalence relations; unions may not be.

Read the full lesson

Lesson 3

One-one, onto and bijective functions

Three kinds of function

  • One-one
    • Different inputs, different outputs
    • Test: f(x₁) = f(x₂) ⇒ x₁ = x₂
    • Some of Y may be left unreached
  • Onto
    • Every element of Y is reached
    • Range = co-domain
    • Two inputs may share an output
  • Bijective
    • Both one-one and onto
    • Each y reached by exactly one x
    • Exactly the functions that have an inverse

One-one: f(x₁) = f(x₂) ⇒ x₁ = x₂. Onto: for every y in the co-domain there is an x in the domain with f(x) = y. Bijective: both.

— Tests to remember
Same idea, different answers: always read the domain and co-domain
FunctionOne-one?Onto?Reason
f : R → R, f(x) = 5x − 3YesYesx = (y + 3)/5 always real
f : N → N, f(x) = 3x + 1YesNo2 has no natural pre-image
f : R → R, f(x) = x² + 2NoNof(1) = f(−1); values below 2 missed
g : [0, ∞) → [0, ∞), g(x) = x²YesYes√y is the unique pre-image
h : Z → Z, h(x) = x + 4YesYespre-image of y is y − 4

Key takeaways: one-one means no two inputs share an output; onto means range equals co-domain; bijective means both. Always state the domain and co-domain, because changing them changes the answer. For a function from a finite set to itself, one-one and onto are the same thing.

Read the full lesson

Lesson 4

Composition of functions

(gof)(x) = g(f(x)): first f, then g. In general gof ≠ fog.

— Composition

How gof works on an input x

  1. Start with x in A x must be in the domain of f.
  2. Apply f Get f(x), which lies in B.
  3. Apply g to f(x) B must be inside the domain of g.
  4. Output g(f(x)) in C This is (gof)(x).
Facts used in proofs
PropertyStatement
Not commutativegof and fog are usually different, and one may exist without the other
Associativeho(gof) = (hog)of whenever the compositions are defined
IdentityfoI_A = f and I_Bof = f for f : A → B, where I is the identity function
One-oneIf f and g are both one-one, gof is one-one
OntoIf f : A → B and g : B → C are both onto, gof is onto

Key takeaways: gof means 'do f, then g', and needs the outputs of f to be valid inputs for g. Composition is associative but not commutative, so always keep the order. Composing one-one functions gives a one-one function, and composing onto functions gives an onto function.

Read the full lesson

Lesson 5

Invertible functions and finding the inverse

f is invertible ⇔ f is one-one and onto (bijective). Then f⁻¹(y) = the unique x with f(x) = y.

— Key theorem

Finding and checking an inverse

  1. Check bijective Show f is one-one and onto from X to Y.
  2. Write y = f(x) Treat y as any element of the co-domain.
  3. Solve for x Express x in terms of y; check this x lies in X for every y in Y.
  4. Define f⁻¹(y) f⁻¹ : Y → X is the formula you found.
  5. Verify Confirm f⁻¹(f(x)) = x and f(f⁻¹(y)) = y.
Inverses found in this lesson
f(x) and its domain → co-domainInverse f⁻¹(y)
3x − 7, R → R(y + 7)/3
(x + 3)/(x − 2), R − {2} → R − {1}(2y + 3)/(y − 1)
x² + 4, [0, ∞) → [4, ∞)√(y − 4)
x³, R → R∛y

Key takeaways: invertible means bijective. To find f⁻¹, solve y = f(x) for x, check that x lies in the domain for every y in the co-domain, and verify both compositions. Restrict domain and co-domain when a function is not one-one or not onto, and remember (gof)⁻¹ = f⁻¹og⁻¹.

Read the full lesson

Privacy · Terms · Refunds · Delivery