Section Summary
Important ideas that we discussed in this section include the following.
- A function
from a nonempty set to a set is a collection of ordered pairs so that for each there is a pair in and if and are in then If is a function we use the notation to indicate that - If
is a function from to the set is the codomain of the function. The setis the range of the function. So the range of a function is a subset of the codomain. - A function
from a set to a set is an injection if, whenever for then The function is a surjection if, whenever then there is an so that - If
is a function from a set to a set and if is a function from to a set then the composite is a function from to defined by for every - A function
from a set to a set is a bijection if is both a surjection and injection. When is a bijection from to then has an inverse defined by when - If
is a function from a set to a set and if is a subset of then image of under is the setand if is a subset of the inverse image of is the set