Relations and Functions

Chapter Overview

Relations and Functions is a fundamental chapter in mathematics that deals with the study of relations and functions between sets. A relation is a set of ordered pairs, while a function is a special type of relation where each element in the domain maps to exactly one element in the range. This chapter introduces students to the concept of relations and functions, their types, and their properties.

Learning Objectives

Define and understand the concept of relations and functions.
Identify and describe different types of relations and functions.
Understand the properties of relations and functions, such as domain, range, and codomain.
Apply the concepts of relations and functions to solve problems.

Important Concepts

Relations

A relation R from a set A to a set B is a subset of the Cartesian product A × B. It is a set of ordered pairs (a, b), where a ∈ A and b ∈ B. For example, consider the sets A = {1, 2, 3} and B = {a, b, c}. The Cartesian product A × B is {(1, a), (1, b), (1, c), (2, a), (2, b), (2, c), (3, a), (3, b), (3, c)}. A relation R from A to B can be any subset of A × B, such as R = {(1, a), (2, b), (3, c)}.

Functions

A function f from a set A to a set B is a relation that satisfies the following conditions:

Every element in A has exactly one image in B.
For every element a in A, there exists an element b in B such that (a, b) ∈ f. For example, consider the relation R = {(1, a), (2, b), (3, c)} from the previous example. This relation is a function because every element in A has exactly one image in B.

Types of Relations

Empty Relation: A relation R from A to B is empty if R = ∅. For example, if A = {1, 2, 3} and B = {a, b, c}, then the empty relation R from A to B is R = ∅.
Universal Relation: A relation R from A to B is universal if R = A × B. For example, if A = {1, 2, 3} and B = {a, b, c}, then the universal relation R from A to B is R = {(1, a), (1, b), (1, c), (2, a), (2, b), (2, c), (3, a), (3, b), (3, c)}.
Identity Relation: A relation R from A to A is an identity relation if R = {(a, a) | a ∈ A}. For example, if A = {1, 2, 3}, then the identity relation R from A to A is R = {(1, 1), (2, 2), (3, 3)}.
Inverse Relation: If R is a relation from A to B, then the inverse relation R^(-1) from B to A is defined as R^(-1) = {(b, a) | (a, b) ∈ R}. For example, if R = {(1, a), (2, b), (3, c)}, then the inverse relation R^(-1) from B to A is R^(-1) = {(a, 1), (b, 2), (c, 3)}.

Types of Functions

One-to-One Function: A function f from A to B is one-to-one if f(x) = f(y) implies x = y for all x, y ∈ A. For example, consider the function f: A → B defined by f(x) = 2x. This function is one-to-one because f(x) = f(y) implies x = y for all x, y ∈ A.
Onto Function: A function f from A to B is onto if for every b ∈ B, there exists an a ∈ A such that f(a) = b. For example, consider the function f: A → B defined by f(x) = 2x. This function is onto because for every b ∈ B, there exists an a ∈ A such that f(a) = b.
Into Function: A function f from A to B is into if there exists an element b ∈ B such that f(a) ≠ b for all a ∈ A. For example, consider the function f: A → B defined by f(x) = 2x. This function is not into because there is no element b ∈ B such that f(a) ≠ b for all a ∈ A.
Bijective Function: A function f from A to B is bijective if it is both one-to-one and onto. For example, consider the function f: A → B defined by f(x) = 2x. This function is bijective because it is both one-to-one and onto.

Key Definitions

Domain of a Relation: The set of all first elements of the ordered pairs in the relation. For example, if R = {(1, a), (2, b), (3, c)}, then the domain of R is {1, 2, 3}.
Range of a Relation: The set of all second elements of the ordered pairs in the relation. For example, if R = {(1, a), (2, b), (3, c)}, then the range of R is {a, b, c}.
Codomain of a Relation: The set B in the relation R from A to B. For example, if R = {(1, a), (2, b), (3, c)} from A to B, then the codomain of R is B = {a, b, c}.
Function: A relation that satisfies the conditions mentioned earlier. For example, if R = {(1, a), (2, b), (3, c)}, then R is a function.

Important Terms

Term	Meaning
Relation	A set of ordered pairs.
Function	A special type of relation where each element in the domain maps to exactly one element in the range.
Domain	The set of all first elements of the ordered pairs in the relation.
Range	The set of all second elements of the ordered pairs in the relation.
Codomain	The set B in the relation R from A to B.
One-to-One Function	A function that maps distinct elements of the domain to distinct elements of the range.
Onto Function	A function that maps every element of the domain to at least one element of the range.
Into Function	A function that maps at least one element of the domain to an element of the range.
Bijective Function	A function that is both one-to-one and onto.

Advanced Section: Deep-Dive Case Studies and Real-Life Applications

Case Study 1: Modeling Population Growth and Decline

Population growth and decline can be modeled using functions. For example, consider a population of bacteria that grows at a rate of 20% per hour. The population at time t (in hours) can be modeled using the function P(t) = P0 * (1.2)^t, where P0 is the initial population.

Case Study 2: Representing the Relationship between Variables in Economics and Finance

Functions can be used to represent the relationship between variables in economics and finance. For example, consider the demand function for a product, which represents the relationship between the price of the product and the quantity demanded. The demand function can be modeled using a function such as Q(p) = 100 - 2p.

Case Study 3: Describing the Behavior of Physical Systems

Functions can be used to describe the behavior of physical systems. For example, consider the motion of an object under the influence of gravity. The position of the object at time t (in seconds) can be modeled using the function x(t) = x0 + v0t - (1/2)gt^2, where x0 is the initial position, v0 is the initial velocity, and g is the acceleration due to gravity.

Advanced Section: Step-by-Step Problem Solving Strategies & Detailed Proofs

Step-by-Step Problem Solving Strategy 1: Proving a Function is One-to-One

To prove that a function f is one-to-one, we need to show that f(x) = f(y) implies x = y for all x, y ∈ A.

Assume that f(x) = f(y).
Use the definition of a function to conclude that (x, f(x)) and (y, f(y)) are in the relation R.
Use the definition of a one-to-one function to conclude that x = y.

Step-by-Step Problem Solving Strategy 2: Proving a Function is Onto

To prove that a function f is onto, we need to show that for every b ∈ B, there exists an a ∈ A such that f(a) = b.

Assume that b ∈ B.
Use the definition of a function to conclude that there exists an a ∈ A such that (a, b) is in the relation R.
Use the definition of an onto function to conclude that f(a) = b.

Advanced Section: Higher-Order Thinking Skills (HOTS) Questions

Let f: A → B be a function. Prove that if f is one-to-one, then it is also onto.
Let R be a relation from A to B. Prove that if R is onto, then it is also one-to-one.
Let f: A → B be a function. Prove that if f is bijective, then it is also onto.
Let R be a relation from A to B. Prove that if R is one-to-one, then it is also onto.

Advanced Section: Previous Year Questions (PYQs) with solutions

Let f: A → B be a function. Prove that if f is one-to-one, then it is also onto.

Solution: Assume that f is one-to-one. Let b ∈ B. Since f is one-to-one, there exists a unique a ∈ A such that f(a) = b. Therefore, f is onto.

Let R be a relation from A to B. Prove that if R is onto, then it is also one-to-one.

Solution: Assume that R is onto. Let a, b ∈ A be such that f(a) = f(b). Since R is onto, there exists a c ∈ A such that f(c) = a. Therefore, f(c) = f(b), and hence a = b. Therefore, R is one-to-one.

NCERT Textbook Questions & Detailed Answers

Question 1: Let f: A → B be a function. Prove that if f is one-to-one, then it is also onto.

Solution: Assume that f is one-to-one. Let b ∈ B. Since f is one-to-one, there exists a unique a ∈ A such that f(a) = b. Therefore, f is onto.

Question 2: Let R be a relation from A to B. Prove that if R is onto, then it is also one-to-one.

Solution: Assume that R is onto. Let a, b ∈ A be such that f(a) = f(b). Since R is onto, there exists a c ∈ A such that f(c) = a. Therefore, f(c) = f(b), and hence

Relations and Functions

Relations and Functions