WTW 114 Lesson 07

Presented by Dr. Schwanke

Department of Mathematics and Applied Mathematics

University of Pretoria

1st Semester 2025

[Link]

Presented by Dr. Schwanke Lesson 07

Try This Activity Before We Begin!

[Link]

Presented by Dr. Schwanke Lesson 07

Try This Activity Before We Begin!

Answer:

[Link]

Presented by Dr. Schwanke Lesson 07

Evaluating Functions

Remark:
Given a function f (x), we can evaluate f (a) for any a ∈ Df by
simply substituting a for each x that appears in the expression of
f (x) and then simplifying.

[Link]

Presented by Dr. Schwanke Lesson 07

Evaluating Functions

Remark:
Given a function f (x), we can evaluate f (a) for any a ∈ Df by
simply substituting a for each x that appears in the expression of
f (x) and then simplifying. “x out, a in”

[Link]

Presented by Dr. Schwanke Lesson 07

Evaluating Functions

Remark:
Given a function f (x), we can evaluate f (a) for any a ∈ Df by
simply substituting a for each x that appears in the expression of
f (x) and then simplifying. “x out, a in”

Example:
Let f (x) = x 2 + 2x + 5.

[Link]

Presented by Dr. Schwanke Lesson 07

Evaluating Functions

Remark:
Given a function f (x), we can evaluate f (a) for any a ∈ Df by
simply substituting a for each x that appears in the expression of
f (x) and then simplifying. “x out, a in”

Example:
Let f (x) = x 2 + 2x + 5. Find f (13).

[Link]

Presented by Dr. Schwanke Lesson 07

Evaluating Functions

Remark:
Given a function f (x), we can evaluate f (a) for any a ∈ Df by
simply substituting a for each x that appears in the expression of
f (x) and then simplifying. “x out, a in”

Example:
Let f (x) = x 2 + 2x + 5. Find f (13).

Answer:

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In fact, we can plug in any mathematical expression into f (x) in
the same manner.

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In fact, we can plug in any mathematical expression into f (x) in
the same manner.

Example:
Let f (x) = x 2 + 2x + 5.

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In fact, we can plug in any mathematical expression into f (x) in
the same manner.

Example:
Let f (x) = x 2 + 2x + 5. Find f (x + h).

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In fact, we can plug in any mathematical expression into f (x) in
the same manner.

Example:
Let f (x) = x 2 + 2x + 5. Find f (x + h).

Answer:

[Link]

Presented by Dr. Schwanke Lesson 07

Example:
Let f (x) = x 2 + 2x + 5.

[Link]

Presented by Dr. Schwanke Lesson 07

Example:
Let f (x) = x 2 + 2x + 5. Find f ( ). ,

[Link]

Presented by Dr. Schwanke Lesson 07

Example:
Let f (x) = x 2 + 2x + 5. Find f ( ). ,

Answer:

[Link]

Presented by Dr. Schwanke Lesson 07

Example:
Let f (x) = x 2 + 2x + 5.

[Link]

Presented by Dr. Schwanke Lesson 07

Example:
Let f (x) = x 2 + 2x + 5. Find f (f (x)).

[Link]

Presented by Dr. Schwanke Lesson 07

Example:
Let f (x) = x 2 + 2x + 5. Find f (f (x)).

Answer:

[Link]

Presented by Dr. Schwanke Lesson 07

Piecewise Functions

Definition:
A piecewise function is a function that is defined by different
formulas in different parts of its domain.

[Link]

Presented by Dr. Schwanke Lesson 07

Piecewise Functions

Definition:
A piecewise function is a function that is defined by different
formulas in different parts of its domain.

Example:
We saw a piecewise function already in this class:
(
x
if x is a multiple of 20
f (x) = 2 .
2x if x is not a multiple of 20

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In fact, the absolute value function is a piecewise function!

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In fact, the absolute value function is a piecewise function! If
f (x) = |x|, then

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In fact, the absolute value function is a piecewise function! If
f (x) = |x|, then (
x if x ≥ 0
f (x) = .
−x if x < 0

[Link]

Presented by Dr. Schwanke Lesson 07

Group Activity:
Below are some ordered pairs that come from a piecewise function.

[Link]

Presented by Dr. Schwanke Lesson 07

Group Activity:
Below are some ordered pairs that come from a piecewise function.
Can you guess what this piecewise function is? You only have one
minute!

(0, 1), (1, 2), (2, 4), (3, 9), (4, 3), (5, 25), (6, 36), (7, 49), (8, 64), (9, 4),

(10, 100), (11, 121), (12, 144), (13, 169), (14, 196), (15, 225), (16, 5),
(17, 289)

[Link]

Presented by Dr. Schwanke Lesson 07

Group Activity:
Below are some ordered pairs that come from a piecewise function.
Can you guess what this piecewise function is? You only have one
minute!

(0, 1), (1, 2), (2, 4), (3, 9), (4, 3), (5, 25), (6, 36), (7, 49), (8, 64), (9, 4),

(10, 100), (11, 121), (12, 144), (13, 169), (14, 196), (15, 225), (16, 5),
(17, 289)

Answer:

[Link]

Presented by Dr. Schwanke Lesson 07

Notation:
Recall that given a function f , mathematicians write f : A → B

[Link]

Presented by Dr. Schwanke Lesson 07

Notation:
Recall that given a function f , mathematicians write f : A → B to
indicate that A is the domain of f and B is the codomain of f .

[Link]

Presented by Dr. Schwanke Lesson 07

Notation:
Recall that given a function f , mathematicians write f : A → B to
indicate that A is the domain of f and B is the codomain of f . A
rule here is that the range must always be contained in the
codomain.

[Link]

Presented by Dr. Schwanke Lesson 07

Notation:
Recall that given a function f , mathematicians write f : A → B to
indicate that A is the domain of f and B is the codomain of f . A
rule here is that the range must always be contained in the
codomain.

Example:
Define f : [0, ∞) → R by
√
f (x) = x.

[Link]

Presented by Dr. Schwanke Lesson 07

Notation:
Recall that given a function f , mathematicians write f : A → B to
indicate that A is the domain of f and B is the codomain of f . A
rule here is that the range must always be contained in the
codomain.

Example:
Define f : [0, ∞) → R by
√
f (x) = x.

Define g : [0, ∞) → [0, ∞) by

√
g (x) = x.

[Link]

Presented by Dr. Schwanke Lesson 07

Notation:
Recall that given a function f , mathematicians write f : A → B to
indicate that A is the domain of f and B is the codomain of f . A
rule here is that the range must always be contained in the
codomain.

Example:
Define f : [0, ∞) → R by
√
f (x) = x.

Define g : [0, ∞) → [0, ∞) by

√
g (x) = x.

√ [Link]
Define h : [0, ∞) → [−2, ∞) by h(x) = x.
Presented by Dr. Schwanke Lesson 07
Remark:
All of these functions make sense because each of their codomains
contain their range, which is [0, ∞).

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
All of these functions make sense because each of their codomains
contain their range, which is [0, ∞).
√
However, j : [0, ∞) → [0, 4] defined by j(x) = x is not a
properly written function

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
All of these functions make sense because each of their codomains
contain their range, which is [0, ∞).
√
However, j : [0, ∞) → [0, 4] defined by j(x) = x is not a
properly written function because [0, 4] does not contain the
range of j and is thus not a possible codomain.

[Link]

Presented by Dr. Schwanke Lesson 07

Definition: (Dr. S.’s Version)
A function f : A → B is called injective or one-to-one if it has
the following property: if

f (input1 ) = f (input2 )

[Link]

Presented by Dr. Schwanke Lesson 07

Definition: (Dr. S.’s Version)
A function f : A → B is called injective or one-to-one if it has
the following property: if

f (input1 ) = f (input2 )

with
input1 , input2 ∈ A,
then

[Link]

Presented by Dr. Schwanke Lesson 07

Definition: (Dr. S.’s Version)
A function f : A → B is called injective or one-to-one if it has
the following property: if

f (input1 ) = f (input2 )

with
input1 , input2 ∈ A,
then
input1 = input2 .

[Link]

Presented by Dr. Schwanke Lesson 07

Definition: (Textbook Version)
A function f : A → B is called injective or one-to-one if it has
the following property: if

f (x1 ) = f (x2 )

[Link]

Presented by Dr. Schwanke Lesson 07

Definition: (Textbook Version)
A function f : A → B is called injective or one-to-one if it has
the following property: if

f (x1 ) = f (x2 )

with
x1 , x2 ∈ A,
then

[Link]

Presented by Dr. Schwanke Lesson 07

Definition: (Textbook Version)
A function f : A → B is called injective or one-to-one if it has
the following property: if

f (x1 ) = f (x2 )

with
x1 , x2 ∈ A,
then
x1 = x2 .

[Link]

Presented by Dr. Schwanke Lesson 07

Definition: (Textbook Version)
A function f : A → B is called injective or one-to-one if it has
the following property: if

f (x1 ) = f (x2 )

with
x1 , x2 ∈ A,
then
x1 = x2 .

Put informally: no two inputs in the domain of f correspond to the

same output in the range.

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
A function is injective if and only if it passes the Horizontal Line
Test, meaning there are no horizontal lines that intersect the graph
at more than one point.

[Link]

Presented by Dr. Schwanke Lesson 07

Question:
Is f : R → R defined by f (x) = x 2 injective?

[Link]

Presented by Dr. Schwanke Lesson 07

Question:
Is f : R → R defined by f (x) = x 2 injective?

Answer:

[Link]

Presented by Dr. Schwanke Lesson 07

Proving Injectivity
A Helpful Tip:
To prove that an injective function is indeed injective, follow these
steps:

[Link]

Presented by Dr. Schwanke Lesson 07

Proving Injectivity
A Helpful Tip:
To prove that an injective function is indeed injective, follow these
steps:

1. Let x1 , x2 ∈ Df .

[Link]

Presented by Dr. Schwanke Lesson 07

Proving Injectivity
A Helpful Tip:
To prove that an injective function is indeed injective, follow these
steps:

1. Let x1 , x2 ∈ Df .

2. Assume that f (x1 ) = f (x2 ).

[Link]

Presented by Dr. Schwanke Lesson 07

Proving Injectivity
A Helpful Tip:
To prove that an injective function is indeed injective, follow these
steps:

1. Let x1 , x2 ∈ Df .

2. Assume that f (x1 ) = f (x2 ).

3. Show that x1 = x2 . Do not skip steps!

[Link]

Presented by Dr. Schwanke Lesson 07

Proving Injectivity
A Helpful Tip:
To prove that an injective function is indeed injective, follow these
steps:

1. Let x1 , x2 ∈ Df .

2. Assume that f (x1 ) = f (x2 ).

3. Show that x1 = x2 . Do not skip steps!

4. Conclude that f is injective.

[Link]

Presented by Dr. Schwanke Lesson 07

Proving Injectivity
A Helpful Tip:
To prove that an injective function is indeed injective, follow these
steps:

1. Let x1 , x2 ∈ Df .

2. Assume that f (x1 ) = f (x2 ).

3. Show that x1 = x2 . Do not skip steps!

4. Conclude that f is injective.

See how this proves that f is injective?

[Link]

Presented by Dr. Schwanke Lesson 07

Proving Injectivity
A Helpful Tip:
To prove that an injective function is indeed injective, follow these
steps:

1. Let x1 , x2 ∈ Df .

2. Assume that f (x1 ) = f (x2 ).

3. Show that x1 = x2 . Do not skip steps!

4. Conclude that f is injective.

See how this proves that f is injective? This tells us that if two
inputs yield the same output, then those two inputs are actually
the same input.
[Link]

Presented by Dr. Schwanke Lesson 07

Proving Injectivity
A Helpful Tip:
To prove that an injective function is indeed injective, follow these
steps:

1. Let x1 , x2 ∈ Df .

2. Assume that f (x1 ) = f (x2 ).

3. Show that x1 = x2 . Do not skip steps!

4. Conclude that f is injective.

See how this proves that f is injective? This tells us that if two
inputs yield the same output, then those two inputs are actually
the same input. Hence no two different inputs correspond to the
[Link]
same output!

Presented by Dr. Schwanke Lesson 07

Example:
Prove that f : R → R defined by f (x) = 3x − 2 is injective.

[Link]

Presented by Dr. Schwanke Lesson 07

Example:
Prove that f : R → R defined by f (x) = 3x − 2 is injective.

Answer:

[Link]

Presented by Dr. Schwanke Lesson 07

Definition:
A function f : A → B is called surjective or onto if Rf = B;

[Link]

Presented by Dr. Schwanke Lesson 07

Definition:
A function f : A → B is called surjective or onto if Rf = B; in
other words, if for every y ∈ B, there exists an x ∈ A such that
f (x) = y .

[Link]

Presented by Dr. Schwanke Lesson 07

Definition:
A function f : A → B is called surjective or onto if Rf = B; in
other words, if for every y ∈ B, there exists an x ∈ A such that
f (x) = y .

Put more informally: A function is surjective if every element of its

codomain is an output for the function.

[Link]

Presented by Dr. Schwanke Lesson 07

Question:
√
Is f : [0, ∞) → R defined by f (x) = x surjective?

[Link]

Presented by Dr. Schwanke Lesson 07

Question:
√
Is f : [0, ∞) → R defined by f (x) = x surjective?

Answer:

[Link]

Presented by Dr. Schwanke Lesson 07

Question:
√
Is f : [0, ∞) → [0, ∞) defined by f (x) = x surjective?

[Link]

Presented by Dr. Schwanke Lesson 07

Question:
√
Is f : [0, ∞) → [0, ∞) defined by f (x) = x surjective?

Answer:

[Link]

Presented by Dr. Schwanke Lesson 07

An Important Lesson Learned: Codomains matter!

[Link]

Presented by Dr. Schwanke Lesson 07

A Helpful Tip:
To prove that a function f is surjective, follow these steps:
1. Let y ∈ Cf (the codomain of f ).

[Link]

Presented by Dr. Schwanke Lesson 07

A Helpful Tip:
To prove that a function f is surjective, follow these steps:
1. Let y ∈ Cf (the codomain of f ).

2. Find an x ∈ Df such that f (x) = y .

[Link]

Presented by Dr. Schwanke Lesson 07

A Helpful Tip:
To prove that a function f is surjective, follow these steps:
1. Let y ∈ Cf (the codomain of f ).

2. Find an x ∈ Df such that f (x) = y . This will sometimes require

some scratch work.

[Link]

Presented by Dr. Schwanke Lesson 07

A Helpful Tip:
To prove that a function f is surjective, follow these steps:
1. Let y ∈ Cf (the codomain of f ).

2. Find an x ∈ Df such that f (x) = y . This will sometimes require

some scratch work.

3. Conclude that f is surjective.

[Link]

Presented by Dr. Schwanke Lesson 07

A Helpful Tip:
To prove that a function f is surjective, follow these steps:
1. Let y ∈ Cf (the codomain of f ).

2. Find an x ∈ Df such that f (x) = y . This will sometimes require

some scratch work.

3. Conclude that f is surjective.

See how this proves that f is surjective?

[Link]

Presented by Dr. Schwanke Lesson 07

A Helpful Tip:
To prove that a function f is surjective, follow these steps:
1. Let y ∈ Cf (the codomain of f ).

2. Find an x ∈ Df such that f (x) = y . This will sometimes require

some scratch work.

3. Conclude that f is surjective.

See how this proves that f is surjective? It tells us that every

possible output is a true output!

[Link]

Presented by Dr. Schwanke Lesson 07

Example:
Prove that f : R → R defined by f (x) = 3x − 2 is surjective.

[Link]

Presented by Dr. Schwanke Lesson 07

Example:
Prove that f : R → R defined by f (x) = 3x − 2 is surjective.

Answer:

[Link]

Presented by Dr. Schwanke Lesson 07

Definition:
A function is called bijective if it is both injective and surjective.

[Link]

Presented by Dr. Schwanke Lesson 07

Definition:
A function f is said to be increasing on an interval I ⊆ Df if it
has the following property:

if x1 , x2 ∈ I and x1 < x2 , then f (x1 ) ≤ f (x2 ).

[Link]

Presented by Dr. Schwanke Lesson 07

Definition:
A function f is said to be increasing on an interval I ⊆ Df if it
has the following property:

if x1 , x2 ∈ I and x1 < x2 , then f (x1 ) ≤ f (x2 ).

Definition:
A function f is said to be strictly increasing on an interval
I ⊆ Df if it has the following property:

if x1 , x2 ∈ I and x1 < x2 , then f (x1 ) < f (x2 ).

[Link]

Presented by Dr. Schwanke Lesson 07

Definition:
A function f is said to be decreasing on an interval I ⊆ Df if it
has the following property:

if x1 , x2 ∈ I and x1 < x2 , then f (x1 ) ≥ f (x2 ).

[Link]

Presented by Dr. Schwanke Lesson 07

Definition:
A function f is said to be decreasing on an interval I ⊆ Df if it
has the following property:

if x1 , x2 ∈ I and x1 < x2 , then f (x1 ) ≥ f (x2 ).

Definition:
A function f is said to be strictly decreasing on an interval
I ⊆ Df if it has the following property:

if x1 , x2 ∈ I and x1 < x2 , then f (x1 ) > f (x2 ).

[Link]

Presented by Dr. Schwanke Lesson 07

True or False?
It is possible for a function f to be increasing AND decreasing on
an interval.

[Link]

Presented by Dr. Schwanke Lesson 07

True or False?
It is possible for a function f to be increasing AND decreasing on
an interval.

Answer:

[Link]

Presented by Dr. Schwanke Lesson 07

Definition:
A function f is called even if f (−x) = f (x) holds for all x ∈ Df .

[Link]

Presented by Dr. Schwanke Lesson 07

Definition:
A function f is called even if f (−x) = f (x) holds for all x ∈ Df .

A function f is called odd if f (−x) = −f (x) holds for all x ∈ Df .

[Link]

Presented by Dr. Schwanke Lesson 07

Definition:
A function f is called even if f (−x) = f (x) holds for all x ∈ Df .

A function f is called odd if f (−x) = −f (x) holds for all x ∈ Df .

Remark:
Even functions “gobble up” negative signs, whereas odd functions
“kick negative signs out front.”

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
Even functions are symmetric with respect the y -axis,

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
Even functions are symmetric with respect the y -axis, meaning if
you fold their graph in half along the y -axis,

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
Even functions are symmetric with respect the y -axis, meaning if
you fold their graph in half along the y -axis, the two sides will
coincide perfectly.

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
Even functions are symmetric with respect the y -axis, meaning if
you fold their graph in half along the y -axis, the two sides will
coincide perfectly.

Odd functions are symmetric with respect to the origin,

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
Even functions are symmetric with respect the y -axis, meaning if
you fold their graph in half along the y -axis, the two sides will
coincide perfectly.

Odd functions are symmetric with respect to the origin, meaning if

you turn their graph upside-down,

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
Even functions are symmetric with respect the y -axis, meaning if
you fold their graph in half along the y -axis, the two sides will
coincide perfectly.

Odd functions are symmetric with respect to the origin, meaning if

you turn their graph upside-down, the graph will look exactly the
same as it did upside-up.

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In order to prove that a function is even, follow these steps:

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In order to prove that a function is even, follow these steps:

1. Let x ∈ Df .

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In order to prove that a function is even, follow these steps:

1. Let x ∈ Df .

2. Show that f (−x) = f (x).

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In order to prove that a function is even, follow these steps:

1. Let x ∈ Df .

2. Show that f (−x) = f (x).

3. Conclude that f is even.

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In order to prove that a function is even, follow these steps:

1. Let x ∈ Df .

2. Show that f (−x) = f (x).

3. Conclude that f is even.

Remark:
In order to prove that a function is odd, follow these steps:

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In order to prove that a function is even, follow these steps:

1. Let x ∈ Df .

2. Show that f (−x) = f (x).

3. Conclude that f is even.

Remark:
In order to prove that a function is odd, follow these steps:

1. Let x ∈ Df .

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In order to prove that a function is even, follow these steps:

1. Let x ∈ Df .

2. Show that f (−x) = f (x).

3. Conclude that f is even.

Remark:
In order to prove that a function is odd, follow these steps:

1. Let x ∈ Df .

2. Show that f (−x) = −f (x).

[Link]

Presented by Dr. Schwanke Lesson 07

Remark:
In order to prove that a function is even, follow these steps:

1. Let x ∈ Df .

2. Show that f (−x) = f (x).

3. Conclude that f is even.

Remark:
In order to prove that a function is odd, follow these steps:

1. Let x ∈ Df .

2. Show that f (−x) = −f (x).

[Link]
3. Conclude that f is odd.
Presented by Dr. Schwanke Lesson 07
Example:
Prove that f : R → R defined by f (x) = x 5 + x 3 + x is odd.

[Link]

Presented by Dr. Schwanke Lesson 07

Example:
Prove that f : R → R defined by f (x) = x 5 + x 3 + x is odd.

Answer:

[Link]

Presented by Dr. Schwanke Lesson 07

Recap Activity:

[Link]

Presented by Dr. Schwanke Lesson 07

The End

Next time in WTW114: building new functions from old

[Link]

Presented by Dr. Schwanke Lesson 07