CBSE Class 12 Maths Revision Notes Chapter 1

Class 12 Mathematics Chapter 1 Notes

Mathematics is regarded to be one of the most demanding subjects for students of all classes. The students of higher classes face difficulty preparing for their examinations since high-level Mathematics concepts are introduced. The Class 12 Mathematics Chapter 1 notes- Relations and Functions is an important chapter and defines different concepts along with their graphs. 

Extramarks provide one of the best academic notes to help students ace their examinations. These notes are prepared by a team of experts as per the latest guidelines issued by the CBSE board. With all the important formulae and definitions, the notes act as a helping guide for students. They aid in quick revision on the days before the exam. 

Students may visit the Extramarks web portal to get all the latest news and information about the CBSE examinations, paper patterns, marking schemes and more. Students may also get access to various academic study materials such as Class 12 Mathematics Chapter 1 notes for free.

Key Topics Covered In Class 12 Mathematics Chapter 1 Notes

The key topics covered under class 12 Mathematics chapter 1 notes include the following.

Relation:

Definition: Relation is the connection between two or more sets of values. If (a,b)R, then a R b means a is related to b under R. 

For example: if A = {9, 16, 25} and B = {5, 4, 3, -3, -4, -5} then set A is related to set B under R, where R = {(x,y), x=y2 / x A and y B}

Types of Relations:

The types of relation mentioned in class 12 Mathematics chapter 1 notes are

  • Empty Relation

The relation R in any set A is said to be empty if no element in A is related to any element of the same set, i.e., R = φ A × A

Consider set A= {2, 3, 5} and R= {(x,y), x + y > 9}, then R is an empty relation or void relation. 

  • Universal Relation

The relation R in any set A is said to be universal if every element in A is related to every element of the same set, R = A × A

For set A= {2, 3, 5} and R= {(x,y), x + y > 0}, then R is a universal relation. 

NOTE: Both Empty and Universal Relations are sometimes called trivial relations. 

  • Reflexive Relation

The relation R in any set A is said to be reflexive; if every element in A is related to itself, i.e., (a, a) ∈ R for every a ∈ A, then a R a is Reflexive. 

  • Symmetric Relation

A relation R in a set A is said to be symmetric if the elements in R can be swapped.

R is symmetric relation if (a, b) ∈ R (b, a) ∈ R, i.e., aRb = bRa a, b, c A. 

If S={a, b, c} then relation R6={(a, b), (b, a), (c, c)}

  • Transitive Relation

A relation R in a set A is said to be transitive if (a, b) ∈ R and (b, c) ∈ R (a, c) ∈ R, which means that if (a,b) belongs to R and (b,c) belongs to R then (a,c) will also belong to R a, b, c R. 

  • Equivalence Relation

If relation R is reflexive, symmetric and transitive, then it is said to be an equivalence relation. 

Notation:  a b. 

If R={(x, y)/ len (x) = len (y)}

Then R is reflexive: len (a) =len (a)

R is symmetric: len (a)=len (b) and len (b)=len (a)

R is transitive: len (a) = len (b) and len (b) = len (c) then len (a) = len (c)

Therefore, R is an Equivalence Relation.

Equivalence Classes:

Notation: {a} or [a]

Let A be a non-empty set. a ∈ A 

An equivalence class is the set of all the points that are in relation to a set A under R.  

Functions:

A Function f is a special kind of relation. Let f be the function from set A to set B, i.e., f: A B if every element in A is associated or is mapped with only one element in B. 

Set A is called the domain, and Set B is called the Co-domain of the function f. 

The range is defined as the set of all possible values of function f.

For example: if x3is a function, all values of x are the domain, and the values of x3 are the range.

Types of Function:

Types of function under class 12 Mathematics chapter 1 notes include

  • One-One or Injective function: 

Function f is injective if each element of set A is mapped to the distinct element of set B.

Mathematically, f: X → Y is an one-one or injective function, if f(x1) = f(x2) ⇒ x1 = x2x1 , x2 ∈ X.

For example: f(x)=3x is a one-one function. 

  • Onto or Surjective Function:

Function f is said to be Onto if at least one element in the domain is mapped to every element in the codomain. It means for a surjective function, the range, codomain, and the image are equal.

Mathematically, f: X → Y is onto or surjective function if for the given y ∈ Y, ∃ x ∈ X such that f(x) = y.

For example: f(x)=x-2 is a surjective function.

  • Bijective Function: 

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

Mathematically, f: X → Y is one-one and onto or bijective, if f is one-one and onto.

For example: f(x)=3x is a one-one and onto function.

Composition of a Function:

Notation: fog or  gof

If Function f: A → B and g: B → C, then the composition of function gof: A → C is given as gof(x) = g(f(x)) for all X in set A

NOTE: fog is used to represent f(g(x))

The function gof is the set of all values of x in the domain of f, where f(x) is in the domain of g. 

Properties:

Let f: X → Y, g: Y → Z and h: X → Z, then the functions show the following properties:

  1. Associativity: f(gh)=(fg)h
  2. If functions f and g are injective, then gof is also injective
  3. If functions f and g are surjective, then gof is also surjective

Invertible Function:

A function is said to be invertible if f: X → Y then ∃ g: Y → X such that gof = Ix and fog = Iy

Here g is known as the inverse of f. It is denoted by f-1

Condition- If the function f: X → Y is bijective (one-one and onto), then it is said to be invertible. 

Therefore, let f: X → Y be a bijective function and f(x) =y, then f-1: X → Y defined as f-1(y)=x, is known as the invertible function of f and is always unique. 

Binary Operation

Notation: *

A binary operation is used to associate two elements of a set. They are mathematical operations (addition, subtraction, multiplication and division) performed between two elements of a set. 

If S is a non-empty set, let * be the binary operation on  S, then a*b  is defined for every element belonging to the set S, i.e. for all a,b ∈ S. 

We can say that * is a function such that *(x): A × A → A

Example: let there be two real numbers a,b ∈ R then a+b ∈ R. 

Properties of Binary Operations:

The properties of binary operations include 

1. Commutative property: 

The binary operation *: A × A → A is commutative on set A, i.e., for all a, b ∈ A a*b = b*a

2. Associative property

The binary operation  *: A × A → A is associative on set A, i.e., for all x, y, z ∈ A x*(y*z) = (x*y)*z

3. Existence of Identity

For the binary operation *: A × A → A, there exists an element e such that a*e = e*a= a for all a, b ∈ A, where e is the identity element of Set A

4. Existence of inverse

For the binary operation *: A × A → A, there exists an element b such that a*b = b*a= a for all a, b ∈ A, where b is the inverse of a denoted by a-1

Theorems: 

  1. Prove the associativity of the composition of a function. i.e., if f: X → Y, g: Y → Z and h: X → Z, then

show that fo(goh) =(fog)o

  1. Prove that two invertible functions f: X → Y, g: Y → Z, then (gof)-1= f-1o g-1

Students may refer to these Class 12 Mathematics Chapter 1 notes while preparing for their examination, as they include all concepts that are a part of the syllabus.

Class 12 Mathematics Chapter 1 Notes: Exercises & Answer Solutions

Chapter 1 Mathematics class 12 notes begin with basic notations and definitions of Relations and Functions. To understand this chapter easily, students need to revise the concepts learnt in Class 11. Students will know about different types of relations, function and their properties, such as associativity, commutativity, the existence of identity and inverse element, etc. 

To help students understand this chapter better, Extramarks provides detailed Class 12 Mathematics Chapter 1 notes. It includes all the important definitions, formulae, theorems and properties of this chapter. With the help of the CBSE solutions, students can solve and understand questions using step-by-step and well-explained answers. These Class 12 Mathematics Chapter 1 notes will allow students to retain their learning and reduce simple mistakes. 

For quick revision, refer to the Extramarks Exercises & Answer Solutions and MCQ questions under the CBSE sample papers of this chapter from the links below.

Extramarks, an online learning platform, focuses on providing students with a wonderful learning experience. To attain high scores, students are advised to refer to the CBSE revision notes and CBSE previous year question papers and practice as many CBSE extra questions as possible. 

NCERT Exemplar Class 12 Mathematics

With the help of the NCERT Exemplar, students can gain an in-depth knowledge and develop a strong foundation in Mathematics. Students can use the Class 12 Mathematics Chapter 1 notes, NCERT Exemplar and other NCERT books to perform well in the exams and pursue their dreams. NCERT Exemplar includes many practice questions of all difficulty levels, which will help in developing analytical and problem-solving abilities. Using the NCERT Exemplar and Class 12 Mathematics Chapter 1 notes, students will learn several tips, tricks and shortcut methods to tackle any question in the examination quickly.

Key Features of Class 12 Mathematics Chapter 1 notes

The key features of Class 12 Mathematics Chapter 1 notes provided by Extramarks are

  • These notes are prepared by the subject elites at Extramarks. 
  • The notes follow the CBSE syllabus and are based on the latest guidelines issued by the board.
  • The class 12 Mathematics chapter 1 notes offer the student a wide variety of questions to practice to get acquainted with the concepts in the Class 12 Mathematics Chapter 1. 
  • Studying with the help of notes will help to build confidence and reduce exam stress and anxiety.
  • It helps to develop advanced skills and prepares the students for the CBSE Class 10 board exams as well as the competitive examinations like JEE. 
  • The class 12 chapter 1 Mathematics notes help to develop time management skills in students and reduce the chances of making simple mistakes. 

For more guidance on CBSE exams, keep visiting Extramarks. Students are provided with the latest news on the CBSE paper pattern, marking system and important preparation tips. Students can also access the Class 12 Mathematics Chapter 1 notes for free.

Q.1 If f: [1, 2, 3] [a, b, c] and g: [a, b, c] [apple, ball, cat] defined as f(1) = a, f(2) = b, f(3) = c, g(a) = apple, g(b) = ball and g(c) = cat. Show that f, g and gof are invertible. Find out f -1, g-1 and (gof)-1 and show that (gof)-1 = f -1og-1.

Ans

By definition, f and gare bijective functions.Let f1:a,b,c1,2,3and g1:apple,ball,cata,b,cbe defined as f1a=1,f1b=2,f1c=3g1apple=a,g1ball=b,g1cat=cf1of=I123fof1=Ia,b,cand g1=Ia,b,cgog1=Iapple,ball,catNow, gof: 1,2,3apple,ball,catis given bygof1=apple,gof2=ball,gof3=cat.We can definegof1apple,ball,cat1,2,3bygof1apple=1gof1ball=2gof1cat=3We can see that gof1ogof=I1,2,3andgofogof1=Iapple,ball,catThus, f, g and gof are invertible.Now,f1og1apple=f1g1apple=f1a=1=gof1applef1og1ball=f1g1ball=f1b=2=gof1ballf1og1cat=f1g1cat=f1c=3=gof1catHence, gof1=f1og1

Q.2

Define a binary operation * on the set 0,1,2,3,4,5as a*b =a+bif a+b<6a+b6if a+b6Show that 0 is the identify for this operation and each element of the set is invertible with 6 a being the inverse of a.

Ans

Define a binary operation * on the set 0,1,2,3,4,5as a*b =a+bif a+b<6a+b6if a+b6Show that 0 is the identify for this operation and each element of the set is invertible with 6 a being the inverse of a.ie is the identify element if a * e = e * a = aa * o = a + o = ao * a = o + a = a a * o = o * aHence, 0 is the identify of the operation.iib is the inverse of a ifa * b = b * a = aNow, a * 6a=a+6a6=06a*a=6a+a6=0Hence, each element of the given set is invertible with 6a being the inverse of a.

Q.3 Let * be the binary operation on the set Q of rational numbers which is defined as follows

(i) a * b = a – b
(ii) a * b = a2 + b2
(iii)
a * b = a + ab
Find which of the binary operations are commutative and which are associative.

Ans

(i) Here a * b = a – b
Now b *a = b – a, but a – b ≠ b – a
⇒ a * b ≠ b * a
⇒ * is not commutative

a*(b*c) = a*(b – c) = a – (b – c) = a – b + c
(a*b)*c = (a – b)*c = (a – b) – c
Thus, a*(b*c) ≠ (a * b)*c
⇒ * is not associative

(ii) Here a*b = a2 + b2
b*a = b2 + a2 = a2 + b2
a*b = b*a
⇒ * is commutative

a*(b*c) = a*(b2 + c2) = a2 + (b2 + c2)2
(a*b)*c = (a2 + b2)*c = (a2 + b2)2 + c2
Thus, a*(b*c) ≠ (a*b)*c
⇒ * is not associative

(iii) Here a * b = a + ab
Now b *a = b + ba
⇒ a * b ≠ b * a
⇒ * is not commutative

a*(b*c) = a*(b +bc) = a + a(b + bc) = a + ab + abc
(a*b)*c = (a + ab)*c = a + ab + (a + ab)c = a + ab + ac + abc
Thus, a*(b*c) ≠ (a * b)*c
⇒ * is not associative

Q.4

If fx=4x+36x4,show that fofx = x1 x23.What is the inverse of f ?

Ans

Here, fx=4x+36x4, x 23a fof x= ffx=f 4x+36x4= 44x+36x4364x+36x44 =44x+3+36x46x464x+3+46x46x4 =44x+3+36x464x+346x4 =16x+12+18x1224x+1824x+16=34x34 =x bPutfx=yy=4x+36x4y 6x4=4x+3 6xy4y=4x+3 6xy4x=4y+3 x6y4=4y+3 x=4y+36y4

Q.5 Consider the binary operation ∧ on the set {1, 2, 3, 4, 5} defined by a b = min{a, b}. Write the composition table of the operation .

Ans

Operation table on the set {1, 2, 3, 4, 5} is as follows.

1 2 3 4 5
1 1 1 1 1 1
2 1 2 2 2 2
3 1 2 3 3 3
4 1 2 3 4 4
5 1 2 3 4 5

Q.6 Let the * binary operation on N be defined by a*b = HCF of a and b. Is * commutative? Is * associative? Does there exist identity for this operation on N?

Ans

Here a*b = HCF of a and b.

(a) We know HCF of a, b = HCF of b, a

a*b = b*a

Hence, * is commutative.

(b) a*(b*c) = a*(HCF of b, c)

= HCF of a and HCF of b, c

= HCF of a, b and c

Now (a*b)*c = (HCF of a, b)*c

= HCF of a, b and HCF of c

= HCF of a, b and c

a*(b*c) = (a*b)*c

Hence, * is associative.

(c) 1*a = a*1 = HCF of a and 1

i.e., 1*a = a*1 = 1
1 ≠ a

∴ There does not exist any identity for this operation

Q.7 Let f: NR be a function defined as f(x) = 4x2 + 12x + 15. Show that f: NS where, S is the range of f(x) is invertible. Find the inverse of f.

Ans

fis invertible iff:NSis a bijection.fis oneone: For anyx,yNfx =f(y) 4x2+ 12x+ 15 = 4y2+ 12y+ 15 4x2+ 12x= 4y2+ 12y 4x2 y2 +12x y = 0 x2 y2 + 3 x y = 0 x yx + y + 3 x y = 0 xyx+y+ 3 = 0[x+y+ 30 for anyx,yN] xy= 0 x=ySo,f: NSis oneone.Obviouslyf: NSis onto.Hencef: NSis invertible.Letf1denote the inverse off. Then,fof1x =xfor allxS ff1x =xfor allxS 4f1x2+12f1x +15=xfor allxS 4f1x2+12f1x + 15 =0f1x=12±1441615x8=3±x62f1x=3+x62f1xN,f1x>0

Q.8

Let A = {1,0,1,2}, B = {4,2,0,2} and f, g: A B be function defined by f(x)=x2x,x A and g(x)= 2|x12|1,x A.Are f and g equal? Justify your answer.

Ans

At x = -1, f(x)=12+1=2g(x)=2|112|1        =2×321=2At x = 0f(0)=0g(0)=2|12|1=2×121=0At x =1f(1)=121=0g(1)=2|112|1=2×121=0At x = 2f(2)=222 = 2g(2)=2|212|1=31=2 f(a)=g(a)for all a Af and g are equal functions.

Q.9 Let f, g and h be functions from R →R. Then show that
(i) (f + g)oh = foh + goh
(ii) (f.g)oh = (foh).(goh)


Ans

Here f: R →R, g: R →R, h: R →R(i) ((f + g)oh)(x) = (f + g)[h(x)]
= f[h(x)] + g[h(x)]
= foh(x) + goh(x)
⇒ (f + g)oh = foh + goh

(ii) ((f.g)oh)(x) = (f.g)[h(x)]
= f[h(x)].g[h(x)]
=(foh)(x).(goh)(x)
⇒ (f.g)oh = (foh).(goh)

Q.10

Let A = R – {3} and B =R – {1}. Consider the functionf: A B defined by f (x)=x2x3.  Is f one-one onto ?Justify your answer.

Ans

f: A B where A = R{3}and B =R{1}. f is defined byf(x)= x2x3.(a)f(x1)=x12x13 f(x2)=x22x23             f(x1)=f(x2)           x12x13=x22x23(x12)(x23)=(x22)(x13)x1x23x12x2+6=x1x22x13x2+6            3x12x2=2x13x2                        x1=x2 f is oneone(b)Let y = x2x3xy3y=x2or xy x = 3y2or x(y1)=3y2         x=3y2y1For every value of y B except y =1 there is a preimage,      x=3y2y1fis ontoThis f is oneone and onto.

Q.11

Show that the functionf: R given by f(x)=1    ifx>00    ifx=  01  ifx<0is neither oneone nor onto.

Ans

(a) f(1) = f(2) = 1

1 and 2 have the same images.

⇒ f(x1) = f(x2) = 1 for x > 0
But x1x2

Similarly -1 and -2 have the same images.

Hence f is not one-one.

(b) Except -1, 0, 1 no other element of co-domain of f has any pre-image in its domain.

f is not onto.

Q.12 Check the injectivity and surjectivity of the following:
(i) f: N → N given by f(x) = x2

(ii) f: R → R given by f(x) = x2

Ans

(i) f: N → N given by f(x) = x2
(a) f(x1) = f(x2) ⇒ x12 = x22 x1 = x2

f is one – one, i.e., it is injective

(b) There are many such elements belonging to co-domain that have no pre-image in their domain N e.g. 3 ∈ co domain N. But there is no pre- image in domain of f.

f is not onto, i.e., not surjective.

(ii) f: R R given by f(x) = x2
(a) f is not one – one because f(-1) = f (1) = 1
-1 and 1 have the same image
f is not injective.
(b) -2 ∈ co domain R of f. But √-2 does not belong to domain R of f.
f is not onto, i.e., f is not surjective.

Q.13 Show that the Relation R on the set A = {x ∈ Z : 0 ≤ x 12}, given by R = {(a, b) : |a – b| is a multiple of 4} is an equivalence relation.

Ans

R = {(a, b) : |a – b| is a multiple of 4}, where a, b ∈ A ={x Z : 0 ≤ x ≤ 12} = {0, 1, 2, …, 12}.

Reflexivity: For any a ∈ A, |a – a| = 0, which is a multiple of 4.

⇒ (a, a) ∈ R, for all a ∈ A.

So, R is reflexive.

Symmetry: Let (a, b) ∈ R. Then,

(a, b) ∈ R

⇒ |a – b| is a multiple of 4
⇒ |a – b| = 4k for some k ∈ N
⇒ |b – a| = 4k for some k ∈ N
⇒ (b, a) ∈ R

So, R is symmetric.

Transitive: Let (a, b) ∈ R and (b, c) ∈ R. Then,
⇒ |a – b| is a multiple of 4 and |b – c| is a multiple of 4
⇒ |a – b| = 4k and |b – c| = 4m for some k, m ∈ N
⇒ a – b = ± 4k and b – c = ± 4m
⇒ a – c = ± 4k ± 4m
⇒ a – c is a multiple of 4
⇒ |a – c| is a multiple of 4
⇒ (a, c) ∈ R

So, R is transitive.

Hence, R is an equivalence relation.

Q.14 Determine whether the following relation is reflexive, symmetric and transitive: Relation R on the set N of all natural numbers is defined as
R = {(x, y): y = x + 5 and x < 4}


Ans

R = {(x, y): y = x + 5 and x < 4}
R = {(1, 6), (2, 7), (3, 8)}

Reflexivity: (1, 1), (2, 2) etc. are not in R. So, R is not reflexive.

Symmetry: (1, 6) ∈ R but (6, 1) ∉ R. So, R is not symmetric.

Transitivity: Since (1, 6) ∈ R and there is no ordered pair in R which has 6 as the first element. Same is the case for (2, 7) and (3, 8). So, R is not transitive.

Q.15 Show that 1/x is the inverse of x ≠ 0 for the multiplication operation on R.

Ans

We know that x X (1/x) = 1 (Identity for ‘x’). So, 1/x is the multiplicative inverse of x.

Q.16 Let f = {(3, 1), (2, 3), (1, 2)}, find f -1 if f is one-one and onto.

Ans f is invertible. So, f -1 = {(1, 3), (3, 2), (2, 1)}.

Q.17

If a function is defined as f(x) =  xx1, x1, thenfind of f(x)

Ans

If a function is defined as f(x) =  xx1, x1, thenfind of f(x) f(x)=xx1fof(x)=xx1xx11                  =xx1xx+1x1                =xx11x1Now, fof (x)=xfofof(x)=xx1[same as given function]on repeating the above step, we get fofofof(x)=x.

Q.18 A relation R in a set A is called …, if no element of A is elated to any element of A.

AnsEmpty Relation

Q.19 A relation R in a set A is called …, if each element of A is elated to every element of A.

AnsUniversal Relation

Q.20 Name the relation R in a set A satisfying the condition (a, a) ∈ R, for every a ∈ A.

Ans

The relation R is reflexive.

Q.21 Name the relation R in a set A satisfying the condition (a1, a2) ∈ R ⇒ (a2, a1) ∈ R for all (a1, a2) ∈ A.

Ans

The relation R is symmetric.

Q.22 R is a relation in a set {1, 2, 4} given by R = {(1, 1), (2, 2), (4, 4)}. State whether R is reflexive or symmetric.

Ans

R is reflexive. [ (a, a) ε R, for every a ε {1, 2, 4}]

Q.23 Let f: R R; f(x) = sinx and g: R R; g(x) = x2, find fog and gof.

AnsClearly, fog and gof both exist.
Now, (gof)(x) = g(f(x)) = g(sinx) = (sinx)2 = sin2x.
And, (fog)(x) = f(g(x)) = f(x2) = sinx2.

Q.24 If f is one-one and onto, then what is f -1o f ?

Ans

f -1of = If

Q.25 Let * be a binary operation on set Q of rational numbers as follows:

a*b = (a-b)2 . Is this operation commutative?

Ans

a*b = (a-b)2
b*a = (b-a)2
(a-b)2 = (b-a)2
Therefore, a*b = b*a
So, the given operation is commutative.

Q.26

If f (x) = x+8 and g (x) =  x-8,  x  R, find fog(8)

Ans

f(x) = x+8,g(x)=x8  fog(x)=f[g(x)]  fog(x)=f(x8)  fog(x)=(x8)+8  fog(x)=x  fog(8)=8

Q.27

If f (x) = x2+3 and g (x) =  xx+2,  x  R, find gof(2)

Ans

f (x) = x2+ 3,  g (x) =  xx+2 gof (x)=g[f(x)]               =g[x2+3]               =x2+3(x2+3)+2gof(x)=x2+3x2+3+2gof(x)=x2+3x2+5gof(2)=4+34+5=79

Q.28 Let * be a binary operation defined by a*b=2a+b+ab+1. Find 3*5.

Ans

Given that

a*b = 2a+b+ab+1

⇒ 3*5 = 2×3+5+3×5+1

= 6+5+15+1

= 27

Q.29

If a function is defined as f (x)= xx1;  x 1, thenfind fof (x).

Ans

 f(x)=xx1 fof (x) = xx1xx11                = xx1xx+1x1                = xx11x1= x    fof (x)=x

Q.30

If a function is defined as f (x)= x1+x2, thenfind fof (x).

Ans

 f(x)=x1+x2 fof (x) = x1+x21+(x1+x2)2                = x1+x21+x21+x2                = x1+x21+2x21+x2                =x1+x2×1+x21+x2                =x1+2x2

Q.31 Let A = {1, 2, 3, 8}, B = {4, 5, 6} and let f = {(1, 4), (2, 5), (3, 6)} be defined from A to B. Show that f is not a function from A to B.

AnsSince there is no image in set B for every element of set A (that is, element 8 of set A has no image in set B), therefore, f is not a function from set A to set B.

Q.32 Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function from A to B. Show that f is one-one.

Ans

Since every element of set A has only one image in set B, that is 1→ 4, 2→ 5, 3→ 6, therefore, f is one-one function.

Q.33 Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 4), (3, 6)} be a function from A to B. Show that f is many one.

Ans

Since elements 1 and 2 have same image 4 in set B, (1→ 4, 2→ 4, 3→ 6 ), therefore, f is many one function.

Q.34 Let A = {1, 2}, B = {4, 5, 6} and let f = {(1, 4), (2, 5), (2, 6)} be a function from A to B. Show that f is not a function.

Ans

Since every element of set A has no unique image in set B, that is, element 2 has two images 5 and 6 in set B (1→ 4, 2→ 5, 2→ 6), therefore, f is not a function.

Q.35 If Set A has 2 elements and Set B has 3 elements, find the number of relations defined from Set A to Set B.

Ans

Since number of elements in set A = 2

Number of elements in set B = 3

∴ Number of elements in set (AXB) = 23=6

The number of all possible subsets of Set (AXB) = 26

⇒ The number of relations defined from Set A to Set B is 26 = 64.

Q.36

Show that the function f:R R defined by f(x) = 2x13,x R is one-one and on to function. Also, find the inverse of the function f.

Ans

Let x1,x2 R such that f(x1)= f(x2).   f(x1)= f(x2)2x113=2x1132x11=2x21      2x1=2x1         x1=x2  f is one-one.Again, y = 2x132x1=3y     2x=3y+1       x=3y+12Now, f(x)= f(3y+12) x, y  R                = 2(3y+12)13                =3y3                =3y3                =y f is onto function.Since f is one-one and onto function, therefore, f is invertible.Again, y = 2x13  2x1=3y      2x=3y+1           x=3y+12 f1(y)=3y+12[ f(x)=yx=f1(y)] f1(x)=3x+12[Replacing y by x]

Q.37

Find the domain of the function f(x)=36x2.

Ans

We know that all values of x for which function is defined is called domain. f(x) = 36x2For function to be defined36x20 x2360x262 0(x6)(x+6)0 x 6 and x 6 6 x 6 x [6,6]Hence, domain of the given function is [6,6].

Q.38

Find the domain of the function f(x)=x27x+10.

Ans

We know that all values of x for which functionis defined is called domain.f(x) = x27x+10For function to be defined,x27x+100(x2)(x5)0(x2)0 and (x5)0 x 2 and x 5 x 5 ... (1) Also (x2) 0 and (x5)0 x 2 and x 5 x 2 . (2)From (1) and (2) we get,< × 2 and 5 × Hence, domain of the given function is(,2][5,).

Q.39

Find the domain of the functionf(x) = x36x2+11x6.

Ans

We know that all values of x for which function is defined is called domain. for function to be definedx36x2+11x – 6 . (1)Let P (x)=x36x2+11x6Now for getting its factor, put x = 1, 1, 0 .(1)36(1)2+11(1)6= 1 6 +116=12120Hence, (x1) is one of the factors of P (x).Now on dividing P (x) by (x1), we getP(x)=(x1)(x25x+6)P(x)=(x1)(x2)(x3)

The expression is +ve in the interval[1,2] and [3,+].Hence, the domain of the given function is [1,2] [3,+].

Q.40

Show that the function f:R R defined by f(x) = 5x+23,x R is one-one and on to function. Also find the inverse of the function f.

Ans

Let x1,x2  R such that f (x1)= f (x2). f (x1)= f(x2)5x1+23=5x2+235fx1+2=5fx2+25fx1=5fx2x1=x2 f is one-oneAgain, y =fx+235x+2=3y      5x=3y2   x = 3y25 Now, f(x)=f (3y25) x, y  R             =5(3y25)+23                =3y2+23                =3y3                =y f is onto function.Since f is one-one and onto function. therefore. it is invertible.Again, y = 5x+235x+2=3y5x=3y2       x=3y25 f1(y)=3y25[ f(x)=y x = f1(y)] f1(x)=3x25

Q.41

Find the range of the function f (x)= x2+2x2+1  x R.

Ans

Let y = x2+2x2+1× Ryx2+y=x2+2(y1)x2=2yx2=(2y)y1 x = (2y)y1.…….    (1)Since x20So, (2y)y10(y2)y10Now, using number line, we get

 1 y  2but from (1) we get, y 1 1< y 2 y (1,2)Range of the given function is (1,2).

Q.42

Show that the function f: [1,1] R defined by f (x) = xx+2  is one-one. Find the inverseof the function f.

Ans

Let x1,x2[1,1] such that f(x1)= f(x2).      f (x1)= f (x2)x1x1+2=x2x2+2x1x2+2x1x2+2x2  2x1=2x2    x1=x2  f is one-oneAgain, y = xx+2yx+2y=x2y=xxyx(1y)=2yx = 2y1y.…..(1)f(x)= f (2y1y)       =2y1y2y1y+2       =2y2y+22y       =2y2       =y      f (x)=y[so, f(x) is on to] x = f1(y)Using this (1) become f1(y)=2y1y f1(x)=2x1x[Replacing y by x]

Q.43

Let f: R R be defined as f (x) = 11×-9. Find the function g:R such that gof = fog IR.

Ans

We have, gof =IR gof (x)= IR(x) for all × R g [f(x)]=x for all × R [IR(x)=x]g (11×9)=x for all × R [f(x)=11x9]g(y)=xWhere y = 11x -9 11x = y+9x = y+911g(y)=xg(y)=y+911g(x)=x+911Thus, g:R R defined by g(x)=x+911 is the required function.

Q.44

Let f : R R be defined as f (x) = ax+b.Show that f (x) is one-one. Also find the functiong:R R such that gof = fog I.

Ans

Let x1, x2 R such that f (x1) = f (x2).f (x1)=f(x2) ax12 ax1 = ax2 x1 = x2 f is oneone.We have, gof = IR gof(x)=IR (x) for all × R g[f(x)]=x for all x R [IR (x)=x] g(ax+b)= x for all x R [ f(x) = ax+b] g(y)=x Where y = ax+b ax = yb x = yba .….. (1) g(y) = x g(y)=ybausing (1) g(x) = xbaThus, g:R R defined by g (x)=xbais the required function.

Q.45 Consider the binary operation ∧ on the set {1, 2, 3, 4, 5} defined by a∧b = min {a, b}. Write the operation table of the operation ∧.

Ans

Since a*b = min {a, b}

⇒1*1 = min {1,1} = 1

⇒ 1*2 = min {1,2} = 1

⇒ 1*3 = min {1,3} = 1

⇒ 1*4 = min {1,4} = 1

⇒ 1*5 = min {1,5} = 1

⇒ 2*1 = min {2,1} = 1

⇒ 2*2 = min {2,2} = 2

⇒ 2*3 = min {2,3} = 2

⇒ 2*4 = min {2,4} = 2

⇒ 2*5 = min {2,5} = 2

⇒3*1 = min {3,1} = 1

⇒3*2 = min {3,2} = 2

⇒3*3 = min {3,3} = 3

⇒3*4 = min {3,4} = 3

⇒3*5 = min {3,5} = 3

⇒ 4*1 = min {4,1} = 1

⇒ 4*2 = min {4,2} = 2

⇒ 4*3 = min {4,3} = 3

⇒ 4*4 = min {4,4} = 4

⇒ 4*5 = min {4,5} = 4

⇒ 5*1 = min {5,1} = 1

⇒ 5*2 = min {5,2} = 2

⇒ 5*3 = min {5,3} = 3

⇒ 5*4 = min {5,4} = 4

⇒ 5*5 = min {5,5} = 5

Thus, operation table of operation (*) calculated above is

* 1 2 3 4 5
1 1 1 1 1 1
2 1 2 2 2 2
3 1 2 3 3 3
4 1 2 3 4 4
5 1 2 3 4 5

Q.46 Consider the binary operation * on the set {1, 2, 3, 4, 5} given by the following multiplication table. Using this table compute

* 1 2 3 4 5
1 1 1 1 1 1
2 1 2 1 2 1
3 1 1 3 1 1
4 1 2 1 4 1
5 1 1 1 1 5

(i) (3*4)*5.
(ii) 3*(4*5).
(iii) (2*3)*(4*5).
(iv) if * is commutative.

Ans

We have
(i) (3*4)*5 = 1*5 [Since, 3*4=1] =1
(ii) 3*(4*5) = 3*1 [Since, 4*5=1] =1
(iii) (2*3)*(4*5) = 1*1 [∴2*3=1 and 4*5=1] =1
(iv) Since (2*5)=1 and (5*2)=1
⇒(2*5) = (5*2)
⇒ Operation * is commutative.

Q.47 Show that addition, subtraction and multiplication are binary operations on R, but division is not a binary operation on R. Further, show that division is a binary operation on the set R of non-zero real numbers.

Ans

+: R × R R is given by (a,b)a+bIf2 R, 3 R then 2+3 = 5 ROperation ‘+’ is binary operation on R : R × R R is given by (a,b)abIf 2 R, 3 R then 23 = 1 R Operation ‘ is binary operation on R× : R × R R is given by (a,b) abIf2 R, O R then 2 × 0 = 0 R Operation ‘ב is binary operation on R÷ : R × R R is given by (a,b) abIf 2 R, 0 R then 20= R Operation ‘÷‘ is not a binary operation on R÷ : R × R is given by (a,b) ab, where R is the set ofnon-zero real numbers (given). If 2 R, R then 23R. Operation ‘÷‘ is a binary operation on R.

Q.48

If a function is defined as f (x) = x1+x2, then find fofofofof(x).

Ans

f(x) = x1+x2fof(x)=x1+x21+x1+x2 = x1+x21+x21+x2                =x1+x21+2x21+x2 = x1+x2x1+x21+2x2              =x1+2x2              =x1+x2Now, fofof (x)=x1+x21+x21+2x2                      =x1+2x21+2x2+x21+2x2=x1+2x21+3x21+2x2                      =x1+x2x1+2x21+3x2                      =x1+3x2on observing, we getfor fof there is 2, fofof there is 3, fofofof there will be 4and therefore, fofofofof (x)= x1+5x2

Q.49

Let : A B and g:B A be two functions such that fog = IB.Then, show that f is a surjection and g is an injection.

Ans

f is surjection: we have to prove here that every element in Bhas its pre – image in A.Let b be an arbitrary element of B.Since, g:B A. Therefore, g(b)ALetg(b)=aNow,f(a)=f(g(b))   [a=g(b)]     f(a)=fog(b)     f(a)=IB(b)       [fog=IB]     f(a)=bThus, b B there exists a A such that f(a)= b.So, f is a surjection.g is an injection : let x1, x2 be any two elements of B thatg (x1) = g(x2).Then, g(x1)= g(x2) f(g(x1))= f(g(x2)) fog(x1)= fog(x2)          IB(x1)=IB(x2)  x1 = x2Thus, g(x1)=g(x2)x1=x2 x1, x2,B.So, g is an injection.

Q.50

If f, g:RR are defined respectively by f x = x2+3x+1,gx= 2x3, findifogiigofiiifofivgog.

Ans

Since the range of f = doamin of g and range of g = domain of f,therefore, fog, gof, gog and fof exists.iFor any x R, we havefog x=fgx=f2x3=2x32+32x3+1=4x26x+1Therefore,fog:RRisdefined by fogx=4x26x+1forallxR.iiFor any xR,we havegofx=gfx=gx2+3x+1=2x2+3x+13=2x2+6x1Therefore,gof : R R is defined by gofx=2x2+6x1for all x R.iiFor any x R1we havegofx=gfx=gx2+3x+1=2x2+3x+13=2x2+6x1Therefore,gof : RR is defined by gofx=2x2+6x1 for all x R.iii For any x R, we havefofx=ffx =fx2+3x+1 =x2+3x+12+3x2+3x+1+1 =x4+9x2+1+6x3+6x+2x2+3x2+9x+3+1 =x4+6x3+14x2+15x+5Therefore,fof: RR is defined byfofx=x4+6x3+14x2+15x+5for all x R.iv for any x R, we havegogx  =ggx= g2x3= 22x33= 4x9Therefore,gog:RR is defined by gogx=4x9 for all x R.

Q.51

Let A = R – {3} and B = R – {1}.  Consider the finction f:A Bdefined by f(x)=x2x3.  Is f one – one and onto?Justify your answer.

Ans

f : AB where A = R – {3}  and B = R – {1}, f is defined by f(x)=x2x3.(a) f(x1)=x12x13;         f(x2)=x22x23          f (x1)= f(x2)       x12x13=x22x23(x12)(x23)=(x22)(x13)x1x23x12x2+6=x1x22x13x2+63x12x2=2x13x2              x1=x2  f is one-one.(b) y  B=R-{1}. Then, y1The function f is onto if there exists x A such that       f(x)=y     x2x3= y x2 = y (x3)x2=yx3yxyx=23yx(1y)=23y      x=23y1y A      [y 1]Thus, for any y  B, there exists 23y1y  A such thatf (23y1y)=23y1y223y1y3=23y2(1y)1y23y(1y)1y=23y2+2y23y3+3y=y1 f (23y1y)=y f is onto. Hence, function f is one-one and onto.

Q.52

ThreerelationsR1, R2,R3are defined on set A = a,b,casfollows:iR1=a,a,a,b,a,c,b,b,b,c,c,ac,b,c,ciiR2=a,b,b,a,a,cc,aiiiR3=a,b,b,c,c,aFind whether each of the relations R1,R2,R3arereflexive,symmetric and transitive.

Ans

iReflexive: Clearly, a,a,b,b,c,cR1.So, R1is reflexive on A.Symmetric: We observe that a,bR1but b,aR1.So, R1 is not symmetric on A.Transitive: We find that b,c R1and c,aR1butb,aR1.So, R1 is not transitive on A.iiReflexive: Clearly, a,a,b.b,c,cR2.So,R2is not a reflexive on A.Symmetric: We find that the ordered pairs obtained by interchangingthe components of ordered pairs in R2 are also in R2.So, R2is a symmetric relation on A.Transitive: We find that a,bR2andb,aR2.So,R2 is not transitive on A.iiiReflexive: Since none of a,a,b,b,c,cis an element of R3.So, R3is not a reflexive relation on A.Symmetric: We observe that b,cR3but c,bR3.So, R3 is not symmetric on A.Transitive:We find that a,bR3andb,cR3buta,cR3.So, R3 is not transitive on A.

Q.53

Show that f: [01,1] Range f, given by f(x) = xx+2  is one-one.Find the inverse of the function f.

Ans

f: [01,1]Range is given as f(x) = xx+2.       Let f(x)=f(y).xx+2=yy+2xy+2x=xy+2y        2x=2y          x=yf is a oneone function.It is clear that f:[1,1]Range f is onto.f : [1,1]Range f is oneone and onto and therefore,the inverse of the functionf : [1,1]Range f exists.Let g : Range f [1,1]be the inverse of f.Let y be an arbitrary element of range f.Since f : [1,1] Range f is onto, we have:                    y = f(x)for some x [1,1]                 y = xx+2xy +2y = xx(1y)= 2y           x = 2y1y,y1  Now, let us define g : Range f [1,1]as    g(y)=2y1y,y1Now, (gof)(x)=g(f(x))=g(xx+2)                       =2(xx+2)1xx+2=2xx+2x                       =2x2  =x(fog)(y)=f(g(y))=f(2y1y)              =(2y1y2y1y+2)=2y2y+22y               =2y2=ygof=I[1,1]andfog=IRangeff1=gf1(y)=2y1y,y1

Q.54

Consider f : {1,2,3}{a, b, c} given by f(1)=a, f(2)= band f(3)= c. Find f1 and show that (f1)1= f.

Ans

Function f: {1,2,3}{a, b, c} is given by f(1)=a, f(2)= b, f(3)= c.If(1)= a, f(2)=b, f(3)= cIf we define g : {a, b, c}{1,2,3} as g(a)=1,g(b)=2, g(c)=3,then we have :(fog)(a)= f(g(a))= f(1) a(fog)(b)= f(g(b))= f(2)b(fog)(c)= f(g(c))= f(3)cAnd(gof)(1)=g(f(1))= g(a)1(gof)(2)=g(f(2))= g(a)2(gof)(3)=g(f(3))= g(a)3 gof = Ix and fog = Iy, where x = {1,2,3} and y = {a, b, c}Thus , the inverse of exists and f1=g. f-1:{a,b,c}{1, 2, 3} is given by,f1(a)=1, f1(b)=2, f1(c)=3Let us now find the inverse of f1i.e., find the inverse of g.If we define h : {1,2,3}{a, b, c} ash(1)=a, h(2)= b, h(3)= c, then we have :(goh)(1)=g(h(1))= g(a)1(goh)(2)=g(h(2))= g(b)2(goh)(3)=g(h(3))= g(c)3and (hog)(a)=h(g(a))=h(1) a(hog)(b)=h(g(b))=h(2)b(hog)(c)=h(g(c))=h(3)c goh = Ix and hog = Iy, where x = {1,2,3}and y = {a, b, c}.Thus, the inverse of g exists and g1= h (f1)=h.It can be noted that h = f.Hence, (f1)1 = f.

Q.55 Let A = {2, 3, 4}, B = {5, 6, 7, 9} and let f = {(1, 4), (3, 6), (4, 7)} be a function from A to B, then function is ______________.

Ans

Since, every element of set A has only one image in set B i.e., 2→5, 3→6 and 4→7. Therefore, f is one-one function.

Please register to view this section

FAQs (Frequently Asked Questions)

1. How does Extramarks help me in my Mathematics exam preparation?

Extramarks, an online learning platform, provides informative and detailed notes that students must use to prepare for their exams. The  Class 12 Mathematics Chapter 1 notes are prepared by subject matter experts in an easy language and stepwise manner. The chapter’s important questions and key points are included in these CBSE Solutions. Students can quickly glance through important formulas, properties, theorems and derivations with some examples. The class 12 Mathematics notes Chapter 1 through all chapters will be students’ helping guide in the preparation. Visit Extramarks and make learning fun!

2. Is Chapter 1- Relations and Functions difficult?

No. The first chapter of Mathematics Class 12 is quite easy. There are several problems bifurcated into four exercises that help students gain a deeper understanding and ace the chapter. The answers to these exercise problems are available on the Extramarks platform. Students must also include the Class 12 Mathematics Chapter 1 notes in their preparation for a better understanding