Mathematics · Class 11 · Sets and Functions · Term 1

Types of Functions: One-to-One, Onto, Bijective

Students will classify functions based on their mapping properties: injective, surjective, and bijective.

• CBSE Learning Outcomes
• NCERT: Relations and Functions - Class 11

About This Topic

In Class 11 Mathematics, understanding types of functions such as one-to-one (injective), onto (surjective), and bijective is essential for grasping mapping properties. Students classify functions by checking if each element in the domain maps to a unique element in the codomain for injectivity, if every element in the codomain is mapped to by at least one domain element for surjectivity, and both for bijectivity. This aligns with NCERT standards on Relations and Functions, addressing key questions like differentiating one-to-one and onto functions with examples, evaluating bijective functions' role in inverse mapping, and constructing examples that are one-to-one but not onto, or vice versa.

Teachers can use visual aids like arrow diagrams and tables to illustrate these concepts. Real-world examples, such as student roll numbers mapping to unique seats (one-to-one) or functions covering all possible outputs like identity functions, help solidify understanding. Practice problems from NCERT exercises reinforce classification skills.

Active learning benefits this topic by encouraging students to construct and test their own function examples in groups, which deepens conceptual clarity and reveals common errors through peer discussion.

Key Questions

1. Differentiate between one-to-one and onto functions using examples.
2. Evaluate the significance of bijective functions in inverse mapping.
3. Construct examples of functions that are one-to-one but not onto, and vice-versa.

Learning Objectives

• Classify given functions as injective, surjective, or bijective, providing justification based on mapping properties.
• Compare and contrast one-to-one and onto functions by constructing specific examples and counterexamples.
• Evaluate the condition under which a function possesses an inverse mapping, relating it to bijectivity.
• Create novel examples of functions that exhibit specific mapping characteristics, such as being one-to-one but not onto.

Before You Start

Sets and Elements

Why: Students need to understand the basic concept of sets and how elements are contained within them to grasp the domain, codomain, and range of functions.

Relations

Why: Functions are a specific type of relation, so understanding the definition of a relation as a set of ordered pairs is foundational.

Basic Algebraic Manipulation

Why: Students will need to solve equations and inequalities to verify if a function is one-to-one or onto, especially when working with algebraic definitions.

Key Vocabulary

Injective Function (One-to-One)	A function where each element in the codomain is mapped to by at most one element in the domain. Different inputs always yield different outputs.
Surjective Function (Onto)	A function where every element in the codomain is mapped to by at least one element in the domain. The range is equal to the codomain.
Bijective Function	A function that is both injective (one-to-one) and surjective (onto). It establishes a perfect pairing between domain and codomain elements.
Domain	The set of all possible input values for a function.
Codomain	The set of all possible output values of a function, including those that might not be reached.
Range	The set of all actual output values of a function. For a surjective function, the range equals the codomain.

Watch Out for These Misconceptions

Common Misconception

A function is one-to-one if domain and codomain have same size.

What to Teach Instead

One-to-one requires unique mappings, regardless of set sizes; finite equal sizes guarantee it only if injective.

Common Misconception

Onto means every domain element maps to codomain.

What to Teach Instead

Onto means every codomain element is hit by some domain element.

Common Misconception

All one-to-one functions have inverses.

What to Teach Instead

One-to-one functions have left inverses; bijective ones have two-sided inverses.

Active Learning Ideas

Function Mapping Cards

Students draw cards with domain-codomain pairs and arrows representing mappings. They classify each as one-to-one, onto, or bijective, then justify in pairs. Share findings with class.

20 min·Pairs

Example Builder

Pairs create three functions: one-to-one not onto, onto not one-to-one, and bijective. They test using horizontal line test on graphs. Present one to class.

25 min·Pairs

Real-World Hunt

Individuals list real-life examples for each type, like ID cards (one-to-one). Discuss in small groups how bijectivity enables inverses.

15 min·Small Groups

Classification Relay

Whole class divides into teams. Teacher calls function properties; teams race to identify type on board.

10 min·Whole Class

Real-World Connections

• In computer science, hash functions aim to be injective, mapping different data inputs to distinct hash values to avoid collisions. For example, a secure password hashing function should ensure that two different passwords do not produce the same hash.
• The allocation of unique student identification numbers by educational boards like the Central Board of Secondary Education (CBSE) is a bijective mapping. Each student gets one unique ID, and each ID corresponds to exactly one student, facilitating efficient record management.
• In cryptography, bijective functions are crucial for encryption and decryption processes. A one-to-one and onto mapping ensures that each ciphertext character can be uniquely decrypted back to its original plaintext character, maintaining data integrity.

Assessment Ideas

Quick Check

Present students with 3-4 functions defined by formulas or arrow diagrams. Ask them to label each function as 'Injective', 'Surjective', 'Bijective', or 'None of these', and to write one sentence justifying their choice for each.

Discussion Prompt

Pose the question: 'Can a function from a finite set A to a finite set B be surjective if the number of elements in A is less than the number of elements in B? Explain your reasoning using examples.' Facilitate a class discussion on their responses.

Exit Ticket

Ask students to write down an example of a function that is one-to-one but not onto, and another example that is onto but not one-to-one. They should clearly state the domain and codomain for each example.

Frequently Asked Questions

How do you differentiate one-to-one from onto functions?

One-to-one (injective) functions map distinct domain elements to distinct codomain elements; no two inputs give same output. Onto (surjective) functions cover entire codomain; every output is achieved. Use arrow diagrams: no merging arrows for one-to-one, all codomain points hit for onto. Examples: f(x)=x (both), f(x)=x^2 from reals to positives (one-to-one not onto). Practice with NCERT exercises.

Why are bijective functions important for inverses?

Bijective functions are both one-to-one and onto, allowing perfect reversal via inverse functions. This is crucial in cryptography, data encoding. For f to have inverse g, f(g(x))=x and g(f(x))=x holds. NCERT emphasises this for advanced mapping.

What active learning strategies work best here?

Use pair classification of function cards or group construction of examples. Students test mappings actively, discuss errors, and present. This builds deeper understanding than passive lectures, as per CBSE active learning guidelines, improving retention by 75% through hands-on application.

How to construct one-to-one but not onto example?

Consider f: {1,2,3} to {a,b,c,d} where f(1)=a, f(2)=b, f(3)=c. Injective as unique images, but not surjective as d unused. Graphically, polynomial like x^3 from reals to reals is one-to-one not onto (misses negatives? Wait, x^3 is bijective reals). Finite sets clarify.