Professional Documents
Culture Documents
The words mapping or just map are synonyms for function. The graph of
a function f is the set of all ordered pairs of the form (x, f (x)) as x varies
over the domain.
The definition of function just given says nothing at all about equations or
formulas. While we can, and very often do, define functions in terms of
some formula, formulas are NOT the same thing as functions. The concept
of function is much more general.
However, consider the function h such that h(t) is the temperature at time
t at a certain chosen location in Chicago. Can you write down a formula for
h(t)?
How about a formula for the function DJ(t) which gives the closing value
of the Dow–Jones industrial average, day-by-day?
Functions between small finite sets can be shown in a picture with arrows,
such as this one:
1
The domain is {a, b, c} and the codomain is {x, y, z}. Both a, c map to x,
b maps to z, and nothing maps to y. The range of this function is the set
{x, z}.
Examples
The rule f (x) =x2 defines a mapping from R to R which is NOT surjective
since image(f ) (the set of non-negative real numbers) is not equal to the
codomain R.
2
Definition (One-to-one = Injective). We say that a function f : A → B
is called one-to-one or injective if unequal inputs always produce unequal
outputs: x1 6= x2 implies that f (x1 ) 6= f (x2 ). An injective function is also
called an injection.
This is just the contrapositive form of the above definition. Since we usually
prefer equalities over inequalities, this form is the one most often used.
3
Definition (Identity function). Let A be a given set. The identity function
on A is the function i such that i(x) = x for all x ∈ A. If we must specify
the underlying set A then we write iA (or sometimes 1A ).
To state the definition another way: the requirement for invertibility is that
f (g(y)) = y for all y ∈ B and g(f (x)) = x for all x ∈ A.
4
• On the other hand, the sets R and C of real and complex numbers are
uncountable. (Georg Cantor)
Theorem. If A, B are finite sets of the same cardinality then any injection
or surjection from A to B must be a bijection.
It would be a good exercise for you to try to prove this to yourself now.
To prove that a given infinite set X is countable requires a bijection from
N onto X. Such a bijection provides a way of listing or enumerating the
elements of X in an infinite sequence x1 , x2 , x3 , . . . indexed by the natural
numbers.
Some people find it strange that a set can have the same cardinality as a
proper subset of itself!