Scribd
Upload
18 views1 page

Lesson - 3 - Week - 2 - Types of Functions (Injective, Surjective, Bijective)

Lesson plan. Grade 10. Types of Functions

Uploaded by

samuel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views1 page

Lesson - 3 - Week - 2 - Types of Functions (Injective, Surjective, Bijective)

Lesson plan. Grade 10. Types of Functions

Uploaded by

samuel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

University of Gondar Model Secondary School

Weekly Lesson Plan


Name of Teacher: Mr. SAMUEL ABEBE DELNESSAW Grade: 10 Subject: MATHEMATICS

Unit: 1 (RELATIONS & FUNCTIONS) Sem: I Week: 2 Date: Tikmit/18-22/2017 E.C. Topic: FUNCTIONS

Lesson Three: 1.2.3 Types of Functions (Injective, Surjective, Bijective)

Time: 40 Minutes

Lesson objectives: At the end of this lesson students will be able to:
Define the concepts of injective, surjective, and bijective functions.
Identify the types of functions given a specific function.

Lecture Notes
q Injective Function (One-to-One Function)
Definition: A function f: A → B is injective if for every x₁, x₂ ϵ A, if f(x₁) = f(x₂), then x₁ = x₂.
In simpler terms, each element in the domain maps to a unique element in the codomain.
Example: f(x) = 2x + 1
Þ Explanation: For any two different values of x, the function will produce two different values of f(x).

q Surjective Function (Onto Function)


Definition: A function f: A → B is surjective if for every y ϵ B, there exists at least one x ϵ A such that f(x) = y.
In simpler terms, every element in the codomain is mapped to by at least one element in the domain.
Example: f(x) = x3
Þ Explanation: Every real number has a cube root, so every element in the codomain (the set of all real
numbers) is mapped to by some element in the domain (the set of all real numbers).

q Bijective Function (One-to-One Correspondence)


Definition: A function f: A → B is bijective if it is both injective and surjective.
In simpler terms, each element in the domain maps to a unique element in the codomain, and every element in
the codomain is mapped to by exactly one element in the domain.
Example: f(x) = x (for real numbers)
Þ Explanation: Every real number is mapped to a unique real number, and every real number is the
image of exactly one real number.

Class Activity:
P Divide the class into groups of 4 -5 students.
Task: Provide each group with a set of functions (possibly from textbook).
Þ Identify whether each function is injective, surjective, bijective, or none of these.
Þ Justify their answers using the definitions and examples discussed in class.
Þ Present their findings to the class.

Homework: Provide exercises from the textbook similar to the one given below
1) Determine whether the following functions are injective, surjective, bijective, or none of these:
a) f: R → R, f(x) = x³ b) g: Z → Z, g(x) = 2x c) h: N → N, h(x) = x²
2) Give an example of a function that is:
a) Injective but not surjective c) Neither injective nor surjective
b) Surjective but not injective

Resource: https://www.youtube.com/@Saquama

Page 3 of 3

You might also like