These are important notions for maps.
Click on an arrow to get a description of the connection!
Click on an arrow to get a description of the connection!
Show requirements
Show consequences
Definition 1 (Injective, surjective and
bijective). A map is
called
injective if every fiber of has only one element: .
surjective if . With quantifiers:
.
bijective if
is both injective and surjective.
Example 2. Define the function that maps each
student to her or his chair. This means that is the set of all students in the room,
and the set of all chairs in the
room.
well-defined: every student has a chair
surjective: every chair is taken
injective: on each chair there is no more than one
student
bijective: every student has his/her own chair, and no chair is
empty

Rule of Thumb 3. Surjective,
injective, bijective A map is
Thus, if is bijective, there
is a well defined inverse map Then is
called invertible and is called the inverse map
of .
Example 4. Consider the function given by . This is a bijective function. The inverse map is given by:

Example 5. For a function , we can
sketch the graph in the --plane:



Which of the functions are injective, surjective or bijective?
These notions might seem a little bit off-putting, but we will use
them so often that you need to get use to them. Maybe the video will
help you as well.
Discuss your questions by typing below.