Scribd
Upload
62 views

Relations and Functions XII

The document provides an overview of relations and functions in mathematics. It defines key concepts such as relations, domain and range, types of relations including reflexive, symmetric and transitive relations, and types of functions including one-to-one, onto, bijective, and many-to-one functions. It also discusses identity functions and counting the number of possible functions between two sets. The class assignment includes short, long and homework questions analyzing different relations and functions based on these concepts.

Uploaded by

Kushal
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
62 views

Relations and Functions XII

The document provides an overview of relations and functions in mathematics. It defines key concepts such as relations, domain and range, types of relations including reflexive, symmetric and transitive relations, and types of functions including one-to-one, onto, bijective, and many-to-one functions. It also discusses identity functions and counting the number of possible functions between two sets. The class assignment includes short, long and homework questions analyzing different relations and functions based on these concepts.

Uploaded by

Kushal
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/ 12

Class XII: Mathematics

Chapter 1: Relations and Functions

Basic Concepts:
1. Relation: If A and B are two non – empty set, then a relation R
from set A to set B is the subset of A x B. i.e.,
R: A  B  R  A x B
If (x, y) ∈ R, then we write x R y (read as x is related to y) and if (x,

y)  R, then we write (read as x is not R related to y).


2. Domain and Range of a Relation: If R is any relation from set
A to set B then,
Domain of R is the set of all first coordinates of elements of R and
it is denoted by Dom(R).
Range of R is the set of all second coordinates of R and it is denoted
by Range (R).
Some Standard Types of Relations:
Let A be a non – empty set. Then, a relation R on set A is said to be
(i)Reflexive: If (x, x) ∈ R for each element x ∈ A, i.e., if xRx for
each element x ∈ A.
(ii) Symmetric: If (x, y) ∈ R  (y, x) ∈ R for all x, y ∈ A, i.e., if
xRy  yRx for all x, y ∈ A
(iii) Transitive: If (x, y) ∈ R and (y, z) ∈ R  (x, z) ∈ R for all x,
y, z ∈ A, i.e., if xRy and yRz  xRz.
3. Equivalence Relation: Any relation R on a set A is said to be
an equivalence relation if R is reflexive, symmetric and transitive.
4. Function: Let X and Y be two non – empty sets. Then, a rule f
which associates to each element x ∈ X, a unique element, denoted
by f(x) or Y, is called a function from X to Y and written as f: X 
Y where, f(x) is called image of x and x is called the pre – image of
f(x) and set Y is called the Co – domain of f and f(x) = {f(x) : x ∈
X} is called the range of f.
5. Types of Function:
(i) One – one function (injective function): A function f: X  Y is
defined to be one – one if the image of distinct element of X under
rule f are distinct, i.e., for every x1, x2 ∈ X, f(x1) = f(x2) implies that
x1 = x2.
(ii) Onto function (Surjective infection): A function f: X  Y is
said to be onto function if each element of Y is the image of some
element of x i.e., for every y ∈ Y there exists some x ∈ X such that
y = f(x). Thus f is onto if range of f = co – domain of f.
(iii) One – one onto function (Bijective function): A function f: X
 Y is said to be one – one onto, if f is both one – one and onto.
(iv) Many – one function: A function f: X  Y is said to be a many
– one function if two or more elements of set X have the same image
in Y.
6. Identity Function: Let R be the set of real numbers. A function
I: R  R such that I (x) = x  x ∈ R is called identify function.
Obviously, identity function associates each real number to itself.
7. Number of Functions: If X and Y are two finite sets having m
and n elements respectively then the number of functions from X to
Y is nm.
Class Assignment:
➢ Very Short Answer Type Questions:

1. Determine whether each of the following relations are reflexive,


symmetric and transitive:
(i) Relation R in the set A = {1, 2, 3, ..., 13, 14} defined as R =
{(x, y) : 3x – y = 0}

(ii) Relation R in the set N of natural numbers defined as R = {(x,


y) : y = x + 5 and x < 4}
2. Show that the relation R in R defined as R = {(a, b) : a ≤ b}, is
reflexive .
3. Give an example of a relation which is symmetric but neither
reflexive nor transitive. (HOTS)
4. Check the injectivity and subjectivity of the functions f : N → N
given by f (x) = x2
5. Show that the number of equivalence relation in the set {1, 2, 3}
containing (1, 2) and (2, 1) is two. (HOTS)
6. Find the number of all onto functions from the set {1, 2, 3, ... , n}
to itself. (HOTS)
➢ Short Answer Type Questions:

1. Determine whether each of the following relations are reflexive,


symmetric and transitive:
(i) Relation R in the set A = {1, 2, 3, ..., 13, 14} defined as R = {(x,
y) : 2x – y = 0}
(ii) Relation R in the set N of natural numbers defined as R = {(x,
y) : x + y = 6 }

2. Show that the relation R in the set R of real numbers, defined as R


= {(a, b) : a ≤ b2} is neither reflexive nor symmetric nor transitive.
3.Show that the function f: N → N, given by f(x) = 2x, is one-one
but not onto.
4.Show that the relation R in the set {1, 2, 3} given by R = {(1, 2),
(2, 1)} is symmetric but neither reflexive nor transitive.
5.Check the injectivity and subjectivity of the following functions:
(i) f : N → N given by f (x) = x6
(ii) f : Z→ Z given by f(x) = x4
(iii) f : R → R given by f (x) = x3
6.In each of the following cases, state whether the function is one-
one, onto or bijective. Justify your answer.
(i) f : R → R defined by f (x) = 3 – 4x
(ii) f : R → R defined by f (x) = 1 + x2
➢ Long Answer Type Questions:
1. Show that the relation R in the set A = {1, 2, 3, 4, 5} given by R =
{(a, b) : |a – b| is even}, is an equivalence relation. Show that all
the elements of {1, 3, 5} are related to each other and all the
elements of {2, 4} are related to each other. But no element of {1,
3, 5} is related to any element of {2, 4}.
2. Given a non-empty set X, consider P(X) which is the set of all
subsets of X. Define the relation R in P(X) as follows: For subsets
A, B in P(X), ARB if and only if A  B. Is R an equivalence
relation on P(X)? Justify your answer.
3. Show that each of the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12},
given by:
(i) R = {(a, b) : |a – b| is a multiple of 4}
(ii) R = {(a, b) : a = b}
is an equivalence relation. Find the set of all elements related to 1
in each case.

II Home assignment:
1. Find the number of all one-one functions from set A = {1, 2, 3} to
itself.
a. Show that the Modulus Function f : R → R, given by:
f (x) = | x |, is neither one-one nor onto, where | x | is x, if x is
positive or 0 and | x | is – x, if x is negative.
2.Consider f : R → R given by f(x) = 4x + 3. Show that f is a
bijective function.
3. Let R be a relation defined as R = { (x,y) : x and y study in the
same class}. Show that R is an equivalence relation.
4. Let L be the set of all the lines in a plane and R be the relation in
L defined by R = (L1 , L2 ) : L1 L2  . Show that R is an equivalence
relation.

Extra Questions for self-practice:


1.If n(A) = n(B) = 3, Then how many bijective functions from A to
B can be formed?

2.Is f : N → N given by f(x) = x2 is one-one? Give reason.


3.If f : R → A, given by f(x) = x2 – 2x + 2 is onto function, find set A.

4.If f : A → B is bijective function such that n (A) = 10, then n (B) = ?

5.If n(A) = 5, then write the number of one-one functions from A to


A.

6. R = {(a, b) : a, b  N and a divides b}. Is R reflexive? Give reason?

7. Is f : R → R, given by f(x) = |x – 1| is one-one? Give reason?

8. f : R → B given by f(x) = sin x is onto function, then write set B.

9.Let N be the set of all natural numbers and R be the relation


in N x N defined by (a, b) R (c, d) if ad = bc. Show that R is
an equivalence relation.

You might also like