Scribd
Upload
19 views

Mathematics For Economics: Euncheol Shin

This document is a lecture on functions for economics. It defines a function as a mapping between two sets like a vending machine mapping buttons to items. It discusses properties of functions like injective, surjective, and bijective. Examples are given of different types of functions and their properties. The concepts of inverse functions and composing two functions are also introduced.

Uploaded by

Luis Fernando Ramirez Rodriguez
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
19 views

Mathematics For Economics: Euncheol Shin

This document is a lecture on functions for economics. It defines a function as a mapping between two sets like a vending machine mapping buttons to items. It discusses properties of functions like injective, surjective, and bijective. Examples are given of different types of functions and their properties. The concepts of inverse functions and composing two functions are also introduced.

Uploaded by

Luis Fernando Ramirez Rodriguez
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 28

Mathematics for Economics

Euncheol Shin

Kyung Hee University


[email protected]

Lecture 3

1 / 15
Recall

Relations and preference relations

2 / 15
Outline

Functions

Injective and surjective functions

Identity function

Inverse function

Composition of two functions

3 / 15
Functions

A function is a vending machine!

4 / 15
Functions

A function is a vending machine!

4 / 15
Functions

You may remember this:


y = f (x)

- x is a button (input)
- y is an item (output)
- f (x) is a vending machine (rule)

5 / 15
Functions

You may remember this:


y = f (x)

- x is a button (input)
- y is an item (output)
- f (x) is a vending machine (rule)

Any vending machine has the following two properties:

you obtain an item whenever you press a button


pressing a button results in one item

5 / 15
Functions

You may remember this:


y = f (x)

- x is a button (input)
- y is an item (output)
- f (x) is a vending machine (rule)

Any vending machine has the following two properties:

you obtain an item whenever you press a button


pressing a button results in one item
otherwise, we say “the vending machine is out of order”

5 / 15
Functions
Definition
Let X and Y be two nonempty sets. Then, a binary relation f on
X × Y is said to be a function if

for every x ∈ X, there exists y ∈ Y such that xf y,

for every y, z ∈ Y with xf y and xf z, y = z.

6 / 15
Functions
Definition
Let X and Y be two nonempty sets. Then, a binary relation f on
X × Y is said to be a function if

for every x ∈ X, there exists y ∈ Y such that xf y,

for every y, z ∈ Y with xf y and xf z, y = z.

We write f : X → Y

We read “a function f from X to Y ” or “a function that maps X


into Y ”

X is called the domain of f

Y is called the codomain of f

6 / 15
Functions

We simply write y = f (x)

We say “y is the value of x under f ”

7 / 15
Functions

We simply write y = f (x)

We say “y is the value of x under f ”

The range of f is defined as

f (X) := {y ∈ Y | y = f (x) for some x ∈ X }

[Illustration Here]

7 / 15
Functions

We simply write y = f (x)

We say “y is the value of x under f ”

The range of f is defined as

f (X) := {y ∈ Y | y = f (x) for some x ∈ X }

[Illustration Here]

The graph of f is defined as the set of all ordered pairs (x, f (x)):

Graph(f ) := {(x, f (x)) ∈ X × Y | x ∈ X}

[Illustration Here]

7 / 15
Properties of a Function

Definition
Let f be a function from X to Y . Then,

f is said to be surjective if the range equals to the domain of f

f is said to be injective if f maps distinct points in the domain to


distinct points in the codomain:
x 6= x0 ⇒ f (x) 6= f (x0 )

f is said to be bijective if it is surjective and injective.

8 / 15
Examples

Let X = [0, 1] and Y = [0, 2]

Define f : X → Y as f (x) = x2

Is f surjective?

9 / 15
Examples

Let X = [0, 1] and Y = [0, 2]

Define f : X → Y as f (x) = x2

Is f surjective?

Is f injective?

9 / 15
Examples

Let X = [0, 1] and Y = [0, 2]

Define f : X → Y as f (x) = x2

Is f surjective?

Is f injective?

Is f bijective?

9 / 15
Examples

Let X = [0, 1] and Y = [0, 2]

Define f : X → Y as f (x) = x2

Is f surjective?

Is f injective?

Is f bijective?

What if Y = [0, 1]?

9 / 15
Some Special Functions

A constant function is a function that assigns the same value to


every element in the domain

Example: f : [0, 1] → [0, 2] defined as f (x) = 1 is a constant


function

10 / 15
Some Special Functions

A constant function is a function that assigns the same value to


every element in the domain

Example: f : [0, 1] → [0, 2] defined as f (x) = 1 is a constant


function

A function from X to Y is said to be a self-map on X if Y = X

The identity function on X is an self-map on X such that


f (x) = x for all x ∈ X

Example: f : [0, 1] → [0, 1] defined as f (x) = x is the identify


function on X

10 / 15
Inverse Function

Define the relation f −1 := {(y, x) ∈ Y × X | y = f (x)}

This is a binary relation imply reverses the function f

11 / 15
Inverse Function

Define the relation f −1 := {(y, x) ∈ Y × X | y = f (x)}

This is a binary relation imply reverses the function f

f −1 may not be a function:

Example: Let X = {−1, 0, 1}, Y = {0, 1}, and f (x) = x2


[Illustration Here]

11 / 15
Inverse Function

Define the relation f −1 := {(y, x) ∈ Y × X | y = f (x)}

This is a binary relation imply reverses the function f

f −1 may not be a function:

Example: Let X = {−1, 0, 1}, Y = {0, 1}, and f (x) = x2


[Illustration Here]

f is said to be invertible if f −1 is a function

11 / 15
Inverse Function

Q: When is a function invertible?

12 / 15
Inverse Function

Q: When is a function invertible?

Proposition
Let f : X → Y . Then, f is invertible if and only if f is bijective.

[Proof Here]

12 / 15
Composition of two functions

Definition
Let f : X → Z and g : Z → Y . Then, the composition of f and g is a
function from X to Y such that
(g ◦ f ) (x) = g(f (x)).

[Illustration Here]

13 / 15
Composition of Two Functions

Proposition
Let f : X → Y . Then, f is invertible if and only if there exists a
function G : Y → X such that

(g ◦ f ) (x) = x for all x ∈ X

(f ◦ g) (y) = y for all y ∈ Y .

[Proof Here]

14 / 15
Next Week

Sequences

15 / 15

You might also like