Skip to main content

Section Summary

Important ideas that we discussed in this section include the following.
  • A function f from a nonempty set A to a set B is a collection of ordered pairs (a,b) so that for each a∈A there is a pair (a,b) in f, and if (a,b) and (a,bβ€²) are in f, then b=bβ€². If f is a function we use the notation f(a)=b to indicate that (a,b)∈f.
  • If f is a function from A to B, the set A is the domain of the function.
  • If f is a function from A to B, the set B is the codomain of the function. The set
    {f(a)∣a∈A}
    is the range of the function. So the range of a function is a subset of the codomain.
  • A function f from a set A to a set B is an injection if, whenever f(a)=f(aβ€²) for a, aβ€²βˆˆA, then a=aβ€². The function f is a surjection if, whenever b∈B, then there is an a∈A so that f(a)=b.
  • If f is a function from a set A to a set B and if g is a function from B to a set C, then the composite g∘f is a function from A to C defined by (g∘f)(a)=g(f(a)) for every a∈A.
  • A function f from a set A to a set B is a bijection if f is both a surjection and injection. When f is a bijection from A to B, then f has an inverse fβˆ’1 defined by fβˆ’1(b)=a when f(a)=b.
  • If f is a function from a set A to a set B, and if C is a subset of A, then image of C under f is the set
    f(C)={f(c)∣c∈C},
    and if D is a subset of Y, the inverse image of D is the set
    fβˆ’1(D)={a∈A∣f(a)∈D}.
  • Important properties that relate images and inverse images of sets and set unions are the following. If f is a function from a set X to a set Y, and if {AΞ±} is a collection of subsets of X for Ξ± in some indexing set I, and {BΞ²} be a collection of subsets of Y for Ξ² in some indexing set J, then
    1. f(β‹ƒΞ±βˆˆIAΞ±)=β‹ƒΞ±βˆˆIf(AΞ±) and
    2. fβˆ’1(β‹ƒΞ²βˆˆJBΞ²)=β‹ƒΞ²βˆˆJfβˆ’1(BΞ²).