Sets ¢ Aset is a collection of well-defined distinct objects. Every object of a set is called its “element”. y a capital letter and its elements are denoted by small [@,€, 6.0.4} isa set of vowels ¢ For example, ¢ As can be noted, the name of the set" is written in capital, while the elements ."o",and “wv” are written in small, 4", itis written as ae A, and is read as “a inside the set, "a", © Since “a” is an clement of the set belongs to 4°, or “a is a member of A”. © Also, since “/” is not an clement of the set “4 ey itis written as b¢ a, and is read as “b docs not belong to A™Roster Form or Braces Form ¢ In this form, a list of the elements of a set is made, and then this list is put inside curly braces © For examp! (a, ¢, f, 0.4¢}, This is a set represented in Roster or Braces form, Following are some other examples: 1, B={2, 4,6, 8.10} is a set of all even numbers from 2 to 10, both inclusive. 2. C= pgr, pra. grp. gp. qprorpq| is a set of all possible arrangements of the alphabets p.g,and r. 3. D={1.3.5, 7,9} isa set of all odd numbers before 10. 4. B={1. 2} isa set of roots of the equation x —3x42= 0.Roster Form or Braces Form Notes — 1, The order in which the elements are written in a set makes no difference. Therefore, fa, e. 1,0, u} and fe, a, 1,0, 0) denote the same set 2. The repetition of an element has no effect. Therefore, {1, 2,3, 2} 1s the same set asDescription of a Set A set is generally described in either of the following two forms: 1, Roster Form or Braces Form 2. Set-Builder Form or Algebraic Form or Rule Method or Property MethodSet-Builder Form or Algebraic Form or Rule Method or Property Method © In this form, the sct of all even numbers from 2 to 10, both inclusive, is written as: x = 2m and m being an integer lying tn the interval 0 < mm < 6} das “Bis a set of x, such that, x = 2e and or being an integer lying in the interval 0 < m < 6". The colon” Instead of the colon, sometimes “| is also used. Therefore. the set can also be written, as: Be fx |x Inand ar being an integer Lying in the interval 0 < m < 6} “is read as “such that”, s read as “such that”. It is read exactly as we discussed above. Here,Empty Set or Null Set or Void Set ¢ Asset which doesn’t have any clement is known as an Empty Sct, or a Null Set, ora Void Set. © Itis denoted by the Greek letter 6 ¢ This letter is pronounced as phi. In Roster Form, 6 1s represented as |}. ¢ A set which has at least one clement is called a Non-EEmpty set © Therefore, the set f= {0} isa Non-Empty set as it contains one clement, Lc. 0. Note —"9", "(0)" and “0" are all different ¢ is asct with no clement at all e@ {0} ts aset with the clement © (is just a number.Finite Set A set is said to be a Finite Set if its elements can be counted. For example, 1. The set of vowels [A Haha u} | is a finite set as it has countable number of elements, i.c. 5. 2. The set of all odd numbers from 0 to 12) B= 41.3.5, 7.9.11) | ts a finite set as it has countable number of elements, i.c. 6.Cardinal Number of a Finite Set Cardinal Number of a Finite Set refers to the number of distinct clements of a finite set. For example, wv . Consider the set of letters of the word "ALLOY": C= | A. . Consider the set of all the vowels: A= {a, ¢, 4.0. 0}. The cardinal number of this 5. set is $, as it has $ clements. It is represented as n( A) . Consider the set of all odd numbers from 0 to 12: B= {1 3,5, 7,9, 11}. The cardinal number of this set is 6, as it has 6 elements, It is represented as n( B)= 6. LOWY). the letter “Lis present twice, itll be counted only once, and therefore, the cardinal number of this set is 4, It is represented as a(C) = 4. c sven thoughInfinite Set Obviously, a set whose elements can’t be counted is called an Infinite Set. For example, the set of natural numbers {1. 2, 3.4.5, ...) is an infinite set.Equivalent Sets Two sets A, and B are said to be Equivalent if their Cardinal Numbers are equal, i.¢., (A) = n(B). For example, the sets A {1 » 4} and B- §5, 6,7, 8} are equivalent sets as nA) = (B) = 4. Clearly, all equal sets are equivalent but all equivalent sets are not equal,Equal Sets No rocket science here, if two sets have exactly the same elements, they are said to be Equal Sets. For example. the sets A= {1, 2.3.4) and B {[Link]} are equal sets.| Symbols at a Glance Description Symbol _ Meaning < Subset If A is a subset of &, it means that the set 4 contains either | some, or all clements of the set B c Proper IPA is a subset of Band 4 + Bas said to be a proper subset Subset of B. a Superset, If fis a subset of B, it means that B is a superset of A. Z Not a Ifis nota subset of B, itis written as A cB. SubsetSubsets . Let A and 8 be two sets. © Ifevery clement of 4 is an clement of B, then -f ts called a subset of B. For example, if 4 = (1, 2.3, 4, 3} and # = {1, 2.3, 4, 5, 6, 7.8, 9}, then every element of 4 is an element of 8. and hence of is said to be a subset of 8. ACB. very set is a subset of itself and an empty set is a subset of every set. It is write! Obviously, A subset 4 of a set 8 is called a proper subset if A 2B. If A isa proper subset of B, itis written as A cB If 4 isa subset of B, it means that B is the superset of A and it is written as BD A. If A is not a subset of 8, itis written as A & B. onPower Set Consider a set A = {1, 2, 3}. Following are i {1, 3}, {2, 3}, {}. A set containing all the Therefore, P(A)={{1, 2. 3}. {1}, {2}. {3}. {1 2}. {1.3}. {2.3}. {1}, (2), {3}, (1. 2}, called the Power Set.Points to Remember 1. Every set is a subset of itself. 2. The empty set is a subset of every set. 3. Total number of subsets of a finite set containing 7 clements is 2”. 4. The set containing all the subsets of a particular set is called the power set.Universal Set ¢ In any discussion, there's alwa under consideration. ¢ This set is known as the Universal Set. It is denoted by U or S. ¢ For example, let there be the following sets: 4 = (1.2.3). 8 = {[Link]}. and C [Link]}. @ The universal set will be U = 1,2, [Link], 7! sa set which contains the clements of all the seIntersection of Sets ¢ IfA and B are two sets, the intersection of these two sets will be a set containing th elements which are present in both the sets, [tis written as 4. B. ¢ For example. if A = {[Link]}. and B= 42. 3.4.5}. then AO B= $2.3).Difference of Sets © [fA and Bare wo sets, A ~ B will be a set containing the clements of the set A which do not belong to B. e For example, if A = {2. [Link], 7), and B= {3,5. 7.9. 11, 13}, then A - B= £2, 4,6}: and B- A= (9, 11,13}.Compliment of a Set © Let (/ be a universal set and 4 be another sct Obviously, 4 will be a subset of ¢/ The compliment of 1s wniten as 4’ or and 1s determined hy (ot e Forexample. iff) = {£.[Link].6. 78.910) 4 § 13,5, and B~ {2.4.6}. then, A 1 f= ([Link], 9,10) and #6 AH 135,78, 9, 10)De-Morgan’s Law I. ab A' OB’ 2.(A 0B) = AUB’What are Venn Diagrams? © The sets and their operations can be represented pictorially through what are called Venn Diagrams. © In Venn Diagrams, a rectangle represents the universal set and all the individual sets are represented by circles. © Following is the representation of a universal set and a set 4 tVenn Diagrams Venn Diagrams are used to solve word problems which involve: 1. Two sets, but the requirement is neither of the union of those sets, nor of the intersection of those sets: or 2. Three cis.Union of Sets The shaded portion in the following figure represents union of sets:Intersection of Sets The shaded portion in the following figure represents intersection of sets: vu ¥ )Compliment of a Set The shaded portion in the following figure represents AYDisjoint Sets Following figure represents disjoint sets:Difference of Sets The shaded portion in the following figure represents 1 — B: v The shaded portion in the following figure represents Bf:Product Sets/Cartesian Product of Sets © Itis pretty simple — it’s like multiplying (x + +=) and (a+). « Forexample, let 4= {1.2.3}, and B= {4.5} Ax B={(1. 4). (1.5). (2.4).(2. 5). (3.4). © Then A» B= {(1 4). (1.5). 4.4 SP. (BAL © The individual clements of the set 1» Bie. (1.4), (1.5)... are called ordered pairs.Page 7.8 — Ilustration Let 4 = {1,23}. B= {4.5}. find dA» &, fay C1, 4). (1. 8). (2, 4902. Sp. 0. 4. GS} (bb) f04, 1), (1S), (2, 402, SS} fc) (0. 4). (8. 1002, 4902. 5), 8 4 GS (d) NonePage 7.8 — Example 2 Let P= {1,3,6) and O= {3,5}. find P= OQ. (a) {C1 3). (1. 5). (3. 3). (5. 8). (6. 3. (6, 5! (b) {C1 3). 1, 5,03, 3), 3, Sh (6, 55, {ep {C1 3). Ch. 5). 3. 3. C3. Sh (6, FG, SY (d) NonePage 7.8 — Example | If A x B= 4(3, 2). (3, 4), (5. 2). (5, 4). find 4 and B (a) A= 43,5}: B= 42.4) (bya (2.4). B= B.S) (Ae FB [2) (d) NonePage 7.9 — IMustration 1 If the number of clements in set ? is 3 and the number of clements in set Q is 2, then find the number of elements in the set P * Q. (a) 5 (b) 6 (ep (d) NoneRelations Consider the following persons: Salman Khan, Ranbir Kapoor, Ajun Kapoor. Karishma Kapoor, Jahnvi Kapoor, Khushi Kapoor, Arpita Khan, Kareena Kapoor. Now, let's create two sets — Set f consisting of all the male members, and Set B consisting of all the female members. a= {Salman Khan, Ranbir Kapoor, Arjun Kapoor} B= {Karishma Kapoor, Jahnvi Kapoor, Khushi Kapoor. Arpita Khan, Kareena Kapoor} Now, we know that Salman is the brother of Arpita, Ranbir is the brother of Karishma and Kareena; and Arun ts the brother of Jahnvi and Khushi.Relations © If we denote “is the brother of" with the letter &, then the above can be represented as: Salman R Arpita, Ranbir & Karishma, Ranbir & Kareena, Arjun R Jahavi, Aqua R Khushi. © Now, instead of writing & between every brother and sister, let's create a set R with ordered pairs. We'll arrive at the following: e R= (Salman, Arpita), (Ranbir, Karishma), (Ranbir, Kareena), (Agua, Jahnvi), (Arjun, Khushi);Relations ¢ Following is a visual representation of the above: /—+Arpita \ _t—*Kanshma | } Kareena eJahnvi Ap tKhushiRelations © Also, A * B= (Salman, Arpita), (Salman, Karishma), (Salman, Kareena), (Salman, Jahnvi), (Salman, Khushi), (Ranbir, Arpita), (Ranbir, Karishma), (Ranbir, Kareena), (Ranbir, Jahnvi), (Ranbir, Khushi), (Arjun, Arpita), (Arjun, Karishma), (Arjun, Kareena), (Arjun, Jahnvi), (Arjun, Khushi); And, R= {(Salman, Arpita), (Ranbir, Karishma), (Ranbir, Kareena), (Arjun, Jahnvi), (Arjun, Khushi)} Clearly & isa subset of A * B. Therefor a relation from set A to set B is denoted by one or more ordered pairs, where the first clement of every ordered pair belongs to set 4 and the second element of pvery ordered pair belongs to set B.Relations We know that ordered pairs arise when two sets are multiplied Since a relation between two sets is “one or more ordered pairs”, it implics that a relation between the sets 4 and B is basically a subset of the product of both the sets. For example, let A = {1.2.3} and B= {a,b,c}. then, 1x Be \(la). (lb). (Le). (2.4), (2.6). (2c). (8a). (2.4). (Re)] Now, R= {(1.5).(2.¢).(1.@),(3.a)} isa relation from 1 to B since R is a subset of A» B. From the above discussion, one thing is clear that a set & isa relation from set A to set B only if R ts a subset of A = B.Question If A={a.b.c.d}. B={p.g.r.s}.then is R, © {(a. p).(b.r).(c. s)} a relation from A to B? (a) Yes (b) No (ce) Can’t Say (d) NoneTotal Number of Relations e Let 4 and B be two non-empty finite sets consisting of m and n clements respectively. © Then A B consists of mn ordered pairs, So, total number of subsets of A * Bis 27° © Since cach subset of A * # defines a relation from -1 10 8, so total number of relations from A Bis 27 © For example, lett {12,3} and B Aw BH 2°* = 4,096. {[Link]}, then the number of relations fromQuestion If A={a,b.c,d}. B={[Link].r.s}.thenis R, © {(a. p).(g.a).(b.s). (8. 6)} a relation from A to B? (a) Yes (b) No (c) Can't Say (d) NoneQuestion If A={a,b,c.d\, B={p.q.r.s}. then is Ry = {(a. p).(a.g).(d. p).(c.r).(b.r)} a relation from 4 to B? (a) Yes (b) No (c) Can't Say (d) NoneDomain and Range of a Relation © Domain is the set of all the first clements of the ordered pairs in a relation; and Range is the set of all the second elements of the ordered pairs in a relation. © Forcxample, if A = (1, 3,5, 7) and B= {2.4.6 8. 10}, and let R = {(1. 8), (3, 6), (5. 2). (1. 4)} be a relation from 4 to B. then Domain ts {1, 3, 5} and Range is {8 6, 2, 4}. © Domain and Range are written as Dom (R) = [1. 3, $} and Range (R) = [8.6 2, 4} respectively, ‘Page 7.16 — Illustration 1 For the relation R = (1.2). (1. 4). (3. 2), (3. 4)}, find the Domain and | (a) Dom(R) = {1.3}: Range(R)={2.4} (by Dom( R) = (1, 4}; Range( R)= (c) Dom(R)= {1.3}: Range(R)= {2.3} (d) NonePage 7.16 — Ilustration 2 Fora relation , the Dom (R) = {1,3} and Range ~ {2, 4}, Identify the relation, (a) “Is more than” (b) “Is less than™ (c) “Is equal to” (d) NonePage 7.16 — Mustration 4 Let A = {1, 2,3} and R = Rr". (a) Dom(R* (b) Dom(R* (c) Dom(R* (d) None Jo. )-2: yt 2.1}: Range (R')={ 31; Range (R 1.3}; Range (R') m tL. 2). 2. 2)... yr {. Find the Domain and Range ofInverse Relation An example of an inverse relation is given below Consider the set. = {1, 2. nd the relation R= {(1, 2). (2,2), 3. 1). GB, 2)}- Here, Dom (X) © §1.2. 3}, and Range (R) = 12, 1} Now the inverse of this relation (R ') © 42. 1).(2. 2), 1. 3), 2.38 Therefore, to make an inverse relation, simply interchange the position of elements in all the ordered pairs. Now, here, Dom (2 ') > (2, Fe and Range (R ') > 1.2.3} From the above discussion, it can be concluded that Dom (A) > Range (R '); and Range (R) ~ Dom (8 ')Identity Relation If every clement in a set is related only to tself. such a relation is Known as an identity relation. For example, let 4 = (1, 2.3}. and R= (1.1). (2.2). (3.39). Now, & is an identity relation because every clement of the set 4 ts related only to. itself. Mathematically. 1 can be represented as: Arelation & on the set 4 isan identity relation if'and only if R= |(a.a)sae A}.Page 7.16 — IMustration 3 Consider the relation R = {(1. 1). (2, 2). (3, 3)} onset A= | }. This relation is: (a) Identity Relation — (b) Reflexive Relation — (¢) Transitive Relation — (d) NoneReflexive Relation A reflexive relation is very similar to identity relation with only one difference, i.e. in addition to there being all the clements related to themselves, there may also be some other clements present in the re! For example. let f© (1.2. 3}. and R= fC 1) (2.2), 3.3), 2. (2, 3 Now, & is a reflexive relation because in addition to all the elements being related ation, to themselves, some clements are related to some other elements as well The only condition is that both the clements of the ordered pairs should belong to the same set 4. Mathematically, it can be represented as: Arrelation & on the set 4 is a reflexive relation if (@.a)c R forall aeTransitive Relation © Consider the following example: Salman Khan is the brother of Arbaz Khan, and Arbaz Khan ts the brother of Sohail Khan; so, obviously, Salman Khan is the brother of Sohail Khan, right! © This is called transitive relation © So. inarelation Rif (a,b) © Rand (b,c) © R, and therefore, (a, c) also belongs to R, such a relation is Known as a transitive relation © Mathematically, it can be represented as: A relation Ro oon the set dois a symmetne relation if (a.b)eR and (bc)eR>(acleR.Methodology for Solving Questions Questions in exams ask you to determine whether a relation is a reflexive, sy a transitive relation. You need to follow the following methodolo; mmietric or © First step is to always assume that the relation IS a reflexive. symmetric or a transitive relation, based on what the question ts asking inst the tion © Thereafter, you need to check whether there exists anything which got definition of reflexive, symmetric, or a transitive relation, so as to make the rel NOT reflexive, symmetric, or transitive,Symmetric Relation © Consider the following example: Ayushman Khurana is the brother of Aparshakti Khurana, and therefore, obviously, Aparshakti Khurana ts the brother of Ayushman Khurana. © Such a relation is known as a symmetric relation © So, ina relation R. if (a,b) € R, and therefore, (b, a) also belongs to R, such a relation is known as a symmetne relation © Mathematically, it can be represented as: Are ation & on the set dis a symmetnie relation if (a. b)e R > (b.a)eR.Page 7.16 — IIlustration 5 (i) Let A= {1.2.3}. then Ry = (1, 1). (2, 2), 3, 3). 2) (a) Only Reflexive (b) Reflexive & Symmetric (c) Reflexive & Transitive (d) EquivalenceDifference between Identity and Reflexive Relations © Anidentity relation is always a reflexive relation but a reflexive relation may or may not be an identity relation. © Consider the set 4 = {3, 4, 5}. Now, if the rel. then B is ¢ itself. ¢@ Itis also a reflexive relation because every element of the set 4 is related to itself. > ). (4.4), (8.5). (3. S). 14. 5). This relation is a reflexive relation because of the following nwo properties: o Every element of set -f iy related to itself, and ion set R= 4(3, 3). (4, 4). (5. 5D}, jonas every clement of the set 4 ts related only to led the identity re! ow, consider the relation R= {(3. o Some other clements are also there, all belonging to the set 4. However, this is not an identity relation bec: use i contains other clements as well,Page 7.16 — Iustration 5 (ii) Let A= {1.2.3}. then Ry = [(1. 1), (2,2), (1. 23,2, 2} (a) Only Symmetric (b) Reflexive & Symmetric (c) Reflexive & Transitive (d) Symmetne & TransitivePage 7.16 — Mustration 5 (iii) Let A= 1,2, 3}, then Rs = ((1, 1), (2, 2), (3, 3), C1. 2), (2, 1), (2. 3,3. 29) (a) Only Symmetric (b) Reflexive & Symmetric (c) Reflexive & Transitive (d) Symmetric & TransitiveIntroduction © Consider the following linear equation in two variables © Now, you may easily find out the value of y for any value of x. For example, forx= ly s2* 14355 forx=2.y=2*2+3=7 forx = 3, = 2*3+3=9, and so on.. © Here, in this equation “y= 2x +3", y is nothing but a function of x. In terms of functions, it is written as: f(x) = 2x43 © Ifwe consider a set. d= $1, 2,3) "ys 2x43", it'll be the set R > {(1. 5). (2.7) ¢ anda set B= {$. 7.9, 10} and prepare a relatio 9.We can sce from the above discussion that for any value of x, there is always unique value of y. . . This is the basic definition of function. ¢ A function is a relation, wherein, for every value of 5 In other words, a relation is said to be a function when both the there is a unique value of y. following condition are satisfied: © All the values of set f have an image in set 8, and © All the values of set f have a single image in set B Consider the following diagrams:& a aA a8 = & it AROS h© The pictorial representation is given below: A B © The values 5, 7, and 9 are known as the images, and the values 1, 2, and 3 are known as the pre-images of the function f(x).e Now this sct R is known as a © The pictorial representation is given below: A function B which represented as:J, isnota function from -f to B because the first condition, i.c. “All the values of set A should have an image in set B” is not satisfied. This is so. because the value “ in set f does not have any image in set #. J, is not a function from A to B be use the second condition. ie. “All the values of set 4 should have a single image in set 8B” is not satisfied. This is so, because the valu in set A has two images in set B. Le and J, isa function from 4 to B because both the conditions are satisfied. Please note that it doesn’t matter that the elements * image “6” in set B. All that matters is that the element "2" has only one ima “band the element "3 image for both the clements 1s the same. ve the same AC, "Ut doesnt matter that the “Sas well as “3° from set f also has only one image. 1c. J, isa function from A to B because both the conditions are satisfied.Note ~ A function from set 4 to set B is also known as “mapping” from set 4 to set B, and is represented as f: A B.Page 7.10 — Example Let N be the set of all natural numbers; then is the nile f: NN: f(x)=2x¥xeN a function? (a) Yes (b) No (c) Can't Say (d) NonePage 7.10 — Illustration (ii) Let ¥= {[Link]} and Y= {1.2.3}, Isthe relation {(1, 2). (1, 3), (2. 3)} a function from Xwy? (a) Yes (b) No (c) Can't Say (d) NoneDomain, Co-Domain, and Range of a Function © Let f: 48, then set 4 is known as the Domain of the function, set # is known as the Co-Domain of the function and the sct of all the image clements is known as. the Range of the function. © For example, consider a set f= (1, 2.3}, andaset B- {5,7,9. 10). © The set for the function f(x) = 2x +3 would be / © |(L.S).(2.7).(3. 9). © Now, Dom( f) = {1.2.3}: Co= Dom( f)~ }S. 7.9.10}; Rangel f) = {8.7.9}Page 7.9 — Ilustration 2 Led {1, 2,3, 4) and B= ¢1, 4. 9, 16, 25}. Consider the rule f(x) domain and range of the function. (a) (b) (c) (d) Domain = (1. Domain © [1. Domain © {[Link]}; Range 3.4); Range 4}; Range None 11.4.9, 16} 11,4, 9, 16, 25} {1.4.94Various Types of Functions Following are the various types of functions: Nu=— a te tee nm - One-One Function . Many-One Function _ Onto or Sunective Functions Into Functions . Byeetion Function Identity Function . Constant Function . Equal Functions 9. Composite Functions 10. Inverse of a FunctionOne-One Function Let there be two non-empty sets — A and &. A function fis said to be a one-one function from set to set B if different elements of set f have different images in set #. Following is the diagrammatic representation of a one-one function, For example, let A $4, 5.6). 8 (9, 10,11, 12). Let sf (4, 9), (5, 10), (6, 12)}. Here, Sis. a one-one function as different elements in set f have different images in set B, One-one functions are also known as injective functions.Page 7.10 — Mlustration (i) Let A = {1, 2,3} and B= {2.4.6}. Consider f: A > B: (x)= 2x. Is this a one-one function? (a) Yes (b) No (c) Can't Say (d) NoneMany-One Function Let there be Wvo non-empty sets ~ A and B. A function fis said to be a many-one function from set -f to set B if two or more distinct clements of sect 4 have the same image in set B. Following is the diagrammatic representation of a many-one function. . B~ $16. 25}. Consider the nile f(x) = 37°. Now, 16: £(S) (S)' = 28. Therefore f 4-4, 16), (4, 16), For example, let 4 ~ }-4. 4 S(-A)=(-AY = 16: (4) (4)Onto or Surjective Functions Let there be two non-empty sets — 4 and B. A function f ts said to be an onto function from set A to set B if every clement in set B has at least one pre-image in set 4. For example, let 4 = (6,7, 8), B= (9. 10}. and let f= ((6. 9). (7, 10). (8. 10)}. Here, since every clement of # has at least one pre-image in set 4, fis an onto function.Into Functions Let there be two non-empty sets — 4 and B. A function / is said to be an into function from set A to set B if one or more elements in set B do not have even a single pre-image in set A.Page 7.11 — Illustration 2 Let A = {2, 3, 5,7}, B= {0, 1,3. 5, 7}. Then, the function {: 4 B: f(x)=x-2 is: (a) Onto (b) Into (c) Can"t Say (d) NonePage 7.11 — Illustration 1 Let N be the set of all natural numbers and £ be the set of all even natural numbers. Then, the function {NV > E: f(x) =2x¥x EN is: (a) Onto (b) Into (c) Can‘t Say (d) NoneBijection Function A function which is one-one and onto is known as a Bijective Function. A bijective function is also known as one-to-one correspondenceIdentity Function Let A be a non-empty set. An identity function ts defined as follows: PiADA:f(x)=xVxEA Therefore, it is a one-to-one onto function with domain 4 and range 4 An identity function is denoted by the letter /. If you think about it, it is exactly like an identity relation.Constant Function Let there be two non-empty sets — A and B. A function /is said to be a constant function from set A to set B if every clement in set A has the same image clement in set B. For example, let A = {1, 2.3}, B= {5.7.9}. Let f:A— B: f(x)=5 forall xe A. Here, S(l)=5: £(2)=5: £(3)=S. Therefore, f= {(1, 5), (2, 5), (3. 5)}. Clearly, all the elements of A have the same image in set 8. Therefore, this is a constant function. Note — The range set of a constant function is a singleton set.Page 7.12 — Illustration Let A = {1, 2,3}, B= {5, 7, 9}. Then, the function f: A> B: f(x)=S forall xe A is: (a) One-one (b) Onto (c) Constant function (d) NoneEqual Functions Let there be two functions fand g. They will be said to be equal to cach other when both the following conditions are satisfied: 1. Both fand g have the same domain, and 2. £ (x)= g(x) for all the values of x.Equal Functions For example, let A = {1, 2}, B = (3, 6}; f:A>B:f(x)=x°+2 and g:4—B:g(x)=3x. Then, obviously, f and g have the same domain. Also, S(I)=P +2=3; £(2)=2? +2=6, and, g(1)=3x1=3; g(2)=3x2=6. Therefore, we find that f(1)=g(1), and f(2)=g(2). Since both the conditions of equality of two functions are satisfied, f = g.Composite Functions Till now, we've studied functions such as f(x) =x +1, or {(x)=x° +2, or (x)= 2x, and so on. In all such functions, we simply had to put the value of x to find the value of the function. For example, find the value of the function f(x)=x+1 for x=3. You would simply put the value of x as “3”, and solve it as follows: {(3)=3+1=4. Easy! Now, consider the following: Let there be a function f(x) =x +1, and another function g(x) =2x +2. Find the value of £(g(x)) for x=3. Confused’ calculate {(g(3)). Therefore, instead of putting the value of xas "3" in f(x) =x +1, we t's pretty simple actually! The question wants us to simply have to put the value of x as “g(3)" in f(x) =x +1. For this, first we'll calculateInverse of a Function Let there be two non-empty sets — A and B. Let there be a one-one onto function JS: A— B. The inverse of this function ( f~') is given as f |: B > A, Following diagram will make it clear: M As can be seen clearly from the above diagram, the function / is a one-one onto function from set A to set B. It maps | from set A to c of set B, and the function f' maps ¢ fromset B back to | of set A. Similarly, the function f maps 2 from set A to a of set B, and the function /~' maps a from set B back to 2 of set A. Similarly, the function f maps 3 from set A to d of set B, and the function f' maps d from set B back to 3 of set A. Similarly, the function f maps 4 from set A to b of set B, and the function f' maps 6 from set B back to 4 of set 4. Technically speaking, if (x sand f(y)=x, then f' (x)= Notes — 1. A function is invertible only if it is one-one onto. 2. If f is one-one onto, then f ‘is also one-one onto.From now on, follow the following steps to find out the inverse of any function. the form of an eq) in} place of f(x uestion, it would, | For example, in this question, the equation would be y Step 2— | Rearrange the terms so that x comes on the LHS. In this be x=2, | 2 _ Step 3— Substitute / '(.x) in place of x, and x in place of y. In this question, it would be f'(x) =~. This is your answer