KEMBAR78
Unit 1-Set Theory | PDF
Scribd
Upload
35 views58 pages

Unit 1-Set Theory

Set Theory

Uploaded by

shivamm3914
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
35 views58 pages

Unit 1-Set Theory

Set Theory

Uploaded by

shivamm3914
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 58
UNIT-4_ (set0 palit ond fanillog ‘) Set A Sct dS Well - defined Collection of objecls Te object 24 A altel etemects og members of the Ad B Wwell-clefincd” pean that we should able to delernine if a Geen element Contained nthe et or vol: Capital leHos A, Bc ws wed ty dendle SEU ano Lower Gse lets aybc--- to dense elemerile of the ded ey ihhe fh2,3-- | 9p set of Nalual wumber Refresentation of sels z Usually a set & Represeded uh ter ie I Roster fem flabular form) 2 Bullen frm |. Roster form In Rosler nblation ali Aue elemwts of + an Attled- Tf Pomible, seperileg y Commas Aud enclosed tutthin baacu CE ob Tue at of Bea eget fe Az foil} 1 The gel of alt Votwels Li rhe alpha bet Ue facets 3 Jur fet of Pow bue friacr lew than 5d fiz Ur) WS 19 o Eublder foern In Buti Nolalion , use define the elemedy Of Ane set Ape ging 4 Property hak - Lhe: 4p Tue Ab Ae fx: rhe Postiae inieger nok exceedig 195 DH Ut bane as A= Fuaea-- 49s “Ties of Sats Universal sets Tur Set whith Cofarns all Abe objels Unde (orstduatin t Glad tue lncversal det auf olercted a U alt Null Set CEm| se) nh det which Contain TO thal a4 0 AE Called dla Mall sf ov Sempty set and d oY fe “4 w nef yet b deal] 2 Atty oy wt OM pe fa gex 2 tUIBOO) = / — Mf LS. = ‘ De Morgan's |, ‘ = AO(BUC), by Ban's law at ; by Commutative |; = = (BUC)OA, by ‘aw Ant (CUB)OA, by Commutative law =RS. slocbraies 9.5 WA Band Care sets, prove algebraically that 4 ip, Example 2- C) * Arp =X BAX ye Aand ye (BO O)} ° x (BAC) = {%, = = {(x, yl A and (ye B and ye C)} = {(x, yx A and y € B) and (x € A and ye oO} = {(x, yl(x, y) € A x Band (x, y) € AxC} = {(x, yx, y) € (AX B) (Ax O)} =(A x B) (Ax C) Example 2.6 If A, B, Cand D are sets, prove algebraically that (4 > p © D)=(Ax C) (Bx D). Give an example to support this result, (4.9 B) x (CO D)= ((x, yx € (A A B) and y € (CO D)} = ((x, yl € A and x € B) and (y € C and yeD) {(x, ya € A and y € C) and (v € Band ye Dj (Cx, yl, y) © (A x C) and (x, y) € (Bx D)} = {(x, yl, y) € (A x C) 0 (Bx D)} =(AX OC) (Bx D) pe a are ere errr ee ee i eereerri ieee tte ete it toot Set Theory 61 Example Let A= (1,2, 31, B= (2,3, 4], C= (5, 6,7) and D= {6, 7, 8} Then AOB= (2,3) and Ce \ D = (6,7) (A B)X(C OD) = (2, 6), 2, 7), B, 6), 8.7) Now Ax C= {CL 5), 6) 1,7) 2, 5), (2, 6), (2, 7), (3, 5), (3, 6), (3, 7)) BX D= (02,6), (2, 7), (2, 8) (3, 0), (3, 7), (3, 8), 4, 6), (4. 7). 4 89) (Ax 00 BX D) = (2.6), 2.7), B, 6), B Hence (1.0 B)X (CD) = (AX C) (BX D) Example 2.7 Use Venn diagram to prove that ® is an associative operation, viz., (A @ B) ® C= A @(B®C) Instead of shading or hatching the regions in the Venn diagram, let us label the various regions as follows: Set A consists of the points in the regions labeled 1, 2, 3, 4; set B consists of the points in the region labeled 2, 3, region labeled 3. 4. 6, 7 Now AGB 6; set. C consists of the points in the AU B)-(AMB) = (Ry. Ry, Ry Ryy Rs. Ry) — (Roy Ry). where R, represents the region labeled i RyRy Re. Ry} (A ® B) ® C= (Ry Ry Ry Ryu Roy Ro} ~ (Ry. Ry) Ry, Ry Ryy Ry) (Roy Ry, Ry, Rg, Roy Ry) ~ (Ry, Ro) (Ro. Ry, Rs, Ro} (Ry, Ry, Ry Ry, Rss Ry) ~ (Roy Ry) = (Ry. Ry, Rs Ry) Hence (A ® B)® C= A @ (B® C) Example 2.8 Use Venn diagram to prove that (A ® B) x C=(Ax C) ® (BC), where A, B, C are sets. Using the same assumptions about A, B, and C and the Fig. 2.11 in the Example (8), we have A ® B= (Rj, Ry, Rs, Ry)- Now 62 Discrete Mathematics (A ® BY C= (Ry Ry Roy Ru) % (Roy Ray Roy Ry) = {R) x Ry RX Ray os Ro % Ry} Ax C= (Ry. Ry, Ry Ry) X (Ry Rye Roy Rol = (RX Ry, R, x Ryo Ry * Ry} Bx C= (Re Ry Rs. Ry} * (Ry Ry. Roy Ro} It is easily verified that (A ® B)X C=(AXC)@(BXO) = ((R, x R)), (Ry * Ry), (Rs RY) (Ry * R)) where i=3,4,6,7 : Example 2.9 Simplily the following sets, using set identities ay AU BUANBO Cc) ib) ANB VLIBOK(C AD VICO D))| (a) AU BUANBO C) = (ANB) VIAN B)O CI, by De Morgan's law = [(AAB) VIAN BIO [ANB ¥ Cl. by distributive law =U ABU C, by inverse law = AB VU C, by identity law = AUB VU ©, by De Morgan’s law (b) (AA BU[BAUCAD UIC D))| = (AA BYU [BA (CO (DU D)}), by distributive law AQB)U[BA(CO UI, by inverse law (A0 B) UI[BO Cl, by identity law (BOA) U(BO ©), by commutative law =BO(AL ©), by distributive law Hence AW (DET errr me Example 2.12 Find the sets A and B, if (ay A-B= {13728 A= (2, 6,8} and AO B= {4,9} (by) A-B={1.2,4),8 A= {7,8} and AU B= (1, 2,4, 5, 7.8, 9) (a) From the Venn diagram, it is clear that A= {(1,3,4,7,9 II) and B= (2.4, 6,89) sass | \ (1.3.7.11) ((4.9)) (2.6.8) (1,2,4) {{5,9}} (7, 8) ae A NL Fig. 2.12 Fig. 2.13 z From the Venn diagram, it is clear that os A= {1, 2,4, 5, 9}s an B= (5,7, 8, 9} ) ee Rokhen of acer Seok oe a empty vet eee Oh Wares. tte cotlec tion 4 OO ACH ve = ALOR = for by ay Wag 4 collection of Aig joint non aoe S 4 calles a Parthion of Ss. sip : M6 t6 a partion op Sf Aiea = VAL wepresents union of subeets aoe a Oat aa 5 ae = tie} - At A=Li3, sy, An={2.4,6.8}-43=17-93 ‘The . =. ; 2 pane Hen AL Ag Agand Aq form Some Aafi2.3.4.66} nea ={24) 2 oe A= fi. 3.55 Ag= teen ae Herfore Ay & Ag i not a partition th the Union Of Subsets. Relaliéy Het A and Bae fase ro empty SG then 0 = 5 A XB re snag Atlalien fom At 6 4% subset of AX RCAXB ane no telen aR, @ pelalin fern Ate B 1 we Ue die ’ Whee aen, bep, pcad sp as “ad Aelated by Yay A lb) PR sre UB denoted by oF c 2 Fy A= $i 345, B= UH8) 4 RS chefiaed such dua “Lay Abeey Then R $98, 5} = Reet) RIR)= 6,8 ylo4 =D (e1) Poofertita of Reliliont Reflerive s— A Aclalion Ro NK aka v a@en <4 xf RK & Aue Selalon om A = 4h, a 34 defiued “y (0, He rh ash whe aber Teen Re SUI) 042), 1,3), (2), wary 3} Now RM Acflertve since tach element of AL Related to ctaelf ee batd te be Aaflerive Symmebics— A Aelelien R on gel A 4 Sat te bE by mmabic Neaks Then pRa fe 1h (a,b)CR Teen (b,4) abo ER. Bh 7h Ath 4 85, Be fsat e ghy If arb=3 Then Re J (1,2, (ef Noo RG Synmubfe Anlésymmebies—— pulalitn R on bel AG said to be Cee tokenever (4b) 8 (b/4) ER but aFb Then ~G=b AF Tue Relalin R= PHIM} B le eae A Relaliin Ron bee A fay te be Panitve i whenever aky apo Then ahe th If ACB & BCC Mn FEC laikiin Rom set AB Gled a Equivalents Reléliin Reldline— A i‘ Rib hele, Synmebsic fire 7 Tromi'tive 2 — Sey Quy?) A= by1818, 49, Bo Paha af fod a®y i) az A) Rem (ay) 2 Oleledsy OY RF Uyoy, 60) (4/1), (900, (3,1 (322, MH) yD uP) 3 f (yo) on) R = fy, 2) , te) ae) nt ° ° Qus® Du Aeltaliiy Ron set A = 64444, 55 dyiaed leg ee Aull (abER, 16 3 cuvidw ab Ais} Aue €lermerts of R eRl frad tre clema ¢ Raugt of rer! CO) Yisp Ate Ltemerits Of — Complement} of & Sclulin ) cp Alan =P UrI) (1,200,900 US) (21% 8L%)3) 214) 8S) £.31)(3, 23,3) (3,43), UD (442). 4/9 Uy I), 45), 051, (52015, 3154) (5,5) f Mu (ab) ER 1h 3 dtutdy (a-b) ° 2 ap oe LODUsG), 2 8 DAB DY IG, VS I © RELI) ly DP PHUSPNGD (LY, CH), (215), (5 9} 01) Parmade Of R= $143,453 = Rauge of RL Range of Ref 173 S4 — Qomaks OR cp Ri = CAKMRR = fA DU, 9), GD. 6 (4/4) B29 40 5) (e284 DMD, (SUS H(G 4B Example 2.1 List the ordered pairs in the relation R from A = (0, 1, 2, 3, 4} to B= (0, 1, 2, 3} where (a, b) € R if and only if (i) a= b, (ii) a+ b = 4, (iii) a > b, (iv) alb (viz., a divides b), (v) ged(a, b) = 1 and (vi) lem (a, b) = 2. (i) Since a € A and b € B and a R b when a = b, R = {(0, 0), Cl, 1), (2. 2), (3, 3)}. (ii) Since a R b if and only if a+ b = 4, R = {(, 3), (2, 2), (3. 1). (4, 0)). (iii) Since. a R b, if and only if a> b, R = {((1, 0), (2, 0), (2. 1). (3.0), (3.1), (3, 2), (4, 0), (4, 1), (4, 2). (4, 3))}. ea Rb, if and only if alb, R (1, 0), (1). CL, 2), CL, 3), (2 ), (3,0), 3), 4 OY Note O i. indeterminate and so 0 does not divide 0. 0 (vy) Since a R >, if and only tecd(a, by= IR {(0, 1), 1,9), CL, 1), 1,3). 2... 2.3.8 DG », (4,1, (4, 3} R= (1,2) (2, 1). 2. 2) > (vi) Since a Rb, if and only i fem (a,b) = 2 \ Example 2.2 The relalio R on the set A = (1, 2. 3, 4, 5} is defined 1 ; the rule (u,b) € Ry if 3 divides a= b. (i) List the elements of Rand R | (ii) Find the domain and range of R. iii) Find the domain and range of R!. (iv) List the elements of the complement of R The Cartesian product A x A consists of {( 1,1), G2), 3), C1, 4) (5), 2. Ds s ceey (2,5), 8, De 3, 2) oo, 8,5). ADS 4,2 4. : é . (5, 5)} (i) Since (a, b) € R. if 3 divides (a — b), R= {(1, I). (LF), 2, 2), 2.5), (3, 3), (4, 1), (4, 4). (5, 2), (5, SF R™ (the inverse of R) = {(1, 1), (4, 1), (2, 2), (5, 2), (3, 3), CL, 4), (4, 4), (2.5), (5, 5)} We note that R! = R (ii) Domain of R = Range of R = {1, 2, 3, 4, 5} (iii) Domain of R' = Range of R™ = {1, 2. 3. 4,5} (iv) R’ (the complement of R) = the elements of A x A, that are not in R = {(, 2), CL, 3), (1, 5), (2, 1, (2, 3), (2, 4), GB, D, (3, 2), G, 4), GB, 5), (4, 2), (4, 3), (4, 5), (5, 1), (5, 3), (5, 4) Example 2.3 If R= {(1, 2), (2, 4), (3, 3)} and S = {(1, 3), (2, 4), (4, 2)). find (i) RUS, (ii) ROS, (ili) R- S, (iv) S~ R, (v) R® S. Also verity that dom (RU S) = dom(R) U dom (5) and range (RO S) c range (R) 4 range (S) (i) RUS ={(1, 2), (1, 3), (2.4), 8, 3) (4, 2)) Peet (ii) RO (2, 4)} (iii) R- $= ((1, 2), 3, 3)} (iv) S~R = {(1, 3), (4, 2)} (vy) R®S=(RUS)-(RAS) = {(1, 2). (1, 3), (3, 3), (4, 2)} dom (R) = (1, 2, 3}; dom (S) = {1, 2, 4} Now dom (R) U dom (S) = {1, 2, 3, 4} = domain (R Range (R) = {2, 3, 4}; Range (5) = Ba My Range (R 4 S) = (4) : Clearly {4} & {2, 3,4} m (2, 3, 4 ie., Range (R 7 S) ¢ Range (R) A Range (5). 3.46 5 t toketh. Lhe Adalim Ro om ave set ef all qe 4 Acforca, 3 muuehtc , aulis groneettc aud fe Pts : makive isk @Ry 4f tr) afb (N) azo Soulin CF) a Ref lexiua $ aka h afa bono Pwe : % Rar nok Repl rme Sgeamechie ¢ . R aby 9 afb A bfa ) bea R&S Symracbc Bausitiuee — ak, & pRe te afb bbfE TH dow not imply That afc RB nol Preusifive CM abzo Rep lr'va aka 7 aa7o . 3&7 whieh & Tul RE Reflexive Sy muahic aks 4 abzo 2a bax 2 bRa 7. ka Syprmnchtc “Pras tue pee ah apke 9 ab7e ebc7vo und (40) & 6, “2 bat (3-3) PR fae £3) SO ° £, Rh not pensibt s“4 = 4 ) Exa ooh WD (3), 02, 2d, 2, 4). 02, 1), 3, 8) of all integer is referee nt Determine whether the relation Kon ine las ako" sigs only it, * Symmetric AMtYMMettic and/or transitive yotae Oe oO (i) ab Oi ab Livy a is a multiple (Mod 7), (vi) ig bbe 1. (vii) wowinart © ‘aaa’ is not rnc Hence B is not reflexive *H#bombsa. + Rix yinmetric Ris not transit a * band b # ¢ does n necessarily unply that a ¢ Hence R is symmetric onty () a 20. (iii) (iv) (v) (vi) ~ Ris reflenive ab 20 = ba 20. +. Ris symmetric : Consider (2, 0) and (0, 3), that belong to R. But 2. OL Ris not transitive 3) € Ras 20-3) < R is reflexive, symmetric and not transitive 2 UV need not be true, since a may be zero. ab> “a + R is not reflexive l>ba2>1 «. Ris symmetric ab > 1 and be > 1 = all of a,b,c >Oor<0 If all of a, b, © > 0, least a = least b = least ¢ = | ac21 If all of a, b, ¢ <0, greatest a = greatest b = greatest ¢ = 1 ac 2 1. Hence R is transitive. R is symmetric and transitive. : a is a multiple of a. ©. R is reflexive. If a is a multiple of b, b is not a multiple of a in general. But if a is a multiple of b and b is a multiple of a, then a= b. R is antisymmetric. When a is a multiple of b and b is a multiple of c, then a is a multiple of c -. Ris transitive. Thus R is reflexive, antisymmetric and transitive, (a~ a) isa multiple of 7 +. Ris reflexive. When (a— b) is a multiple of 7, (b — a) is also a multiple of 7... R is symmetric. When (a - b) and (b — c) are multiples of 7, (a — b) + (b also a multiple of 7. -. Ris transitive, Hence R is reflexive, symmetric and transitive, la-al #1. «. Ris not reflexive la-bl => Ib-al=1. . Ris symmetric. la-bl=1 > a-b=1 or-| lb-cl=1 => b-c=lor-l —c) =(a-c)is (I) 9) ysa-c=#20r0 2) gives a= ¢ = #208 were _cl=2or0 del is symmetric only 7° is not true for all integers. wi R is nol reflexive =p and b a fora=b=0or] Ris antisymmetric and be cm does not simply a= ¢? R is not transitive Hence R is antisymmetric only iy a2 a?’ is not true for all integers w R is not reflexive. g>b and b> @ imply that a = b antisymmetric Ris trai Hence R is antisymmetric and transitive. example 2.7 Which of the following relations on {0, 1, 2, 3} are equivalence relations? Find the properties of an equivalence relation that the others lack. (a) Ry = (0, 0), C.D), 2, 2), GB, 3)} = {(0, 0), (, 2), (2, 0), (2, 2), (2, 3), (3, 2), 3, 3) (0, 0), (1, 1), CL, 2), (2, (3, 3)} , = {(0, 0), A, 1), CL, 3), 2, 2), (2, 3), (3, 1), 3, 2), GB, 3)} (e) Rs = {(0, 0), (0, 1), ©, 2), (1, 0), (, 1, CL, 2), (2, 0), (2, 2), 3, 39) (a) R, is reflexive, symmetric and transitive. R, is an equivalence relation. (b) R, is reflexive R, is symmetric, but not transitive, since (3, 2) and (2, 0) € R;, but (3, 0) €R, R, is not an equivalence relation. (c) Rj is reflexive, symmetric and transitive. -. R3 is an equivalence relation. (d) Ry is reflexive and symmetric, but not transitive, since (1, 3) and (3. 2) € R,, but (1, 2) ¢ Ry. +. Ry is not an equivalence relation. (€) Rs is reflexive, but not symmetric since (1, 2) € R, but (2. NeR. Also Ry is not transitive, since (2, 0) and (0, 1) € R- but (2, 1) € R. R; is not an equivalence relation. Dub Zp OR 49 te felalumn ou Lue sey Of Ole a a At (Yb) (GER wheuever ad- be, Sumo RAs au eptulvateaue Aclalow >t (04) racy pm ab 2 ba : Rb Ag onus tn rr K CQb)S Cyd) ? ad-=be > da—ch ch- 44 ad . R Cod (ays ) Ay wawaclice (ui) (as) Reed) 5 ad bO 0 L ao (qakce fy 4 ef = dt x > (aghol) = cbf) Ae) 3 af =be (ab) Raf) RD an ey ucbolunte jelaleon a LooyShall \tosrthm 8 Lud 8 u Lworshall Afowithm. find AU ‘Trantitus Closure Of tee Rotation R (4,4), C4 ), oe —o - 1,10), C8, 6), (6)8) JEN ™ ) SS see Wo = Me = J Compul Wy (1) Tranager all (gran Wo 7 r- CW Lo Glebe G ror + (lo ' ae . ner Mark en 4 dv te ee Of (4,4), (Y)]0) F wo th 2b wv not are | a 4 7 CA by = 4, a b]o , lo Ro Ore le Ceo | =~ TZ ComputsWa jy Tpausfor all t= tm) Lecatin qo" oa (np ’ : Ree Mok enly 4 so “Le loti (68) el92 J nly 4b 1 ‘ we Wo =< Y fp oe! fis | | Bjoerwoy biol 2 “& Compute Ww : corp oo t cn) Trausfer ale 18 from Uy 4 Wes no eutenes rly. & (rm) bo (ateu of We xe Cun u * » > kyr lo Mark enh tw, - 4 fest flor ¢ yg] Ooo] 0000 Jo Jt th [Ye fotateen (6/10) Y. Compute Cr) % alle ae pm tus fo Wg. (1 powatetn op non ey 4 a # - FL whan Yok WES oe Ff P t ape df? 4 [aie ttee Pry we Aue to a f & Anette fe [A Our O02 (ne Mt (mye Fl C Lee oo 244 > bAy- aa > a M4 a f Gemeente r Sri ye Ae axl ao aya Por for omy Yr) FEA of Bw outs f ar pune ble (Np dem (ft) Rouge f) = Lak rA2} hang) ce pzer: “Aly eee fry yo DE : art Saeco eae aL age ars 7 ts ae Mi A ices | fin) is la nl Comm : Com — Of fuels tf TP APB and P BIC Thee (ne ei oyd G “ua new fendi from A Wc i Gt A Glem by Get)r= Giseop vixen ROP B fe Elke Gehan A=$12,3}, Be fbf t c= pus} Ce fF AsB oefuned BE f= a, 1=% 403 b tg BIe aefrud by gq ae 2, grr m0 = vata! yoru) = glfWje glo=4 ava. 90 f (2) ie Flpfoa)e gla 6 c PHB FU BD)= wT Ae PF ROR EF RAR tefl frie x49 ¥ VER & P= ae V TER Toon dof (x) = GLP) eg pera) 2 nares x Hery t fegon = f[ 90) F009) = wg. eae f ppwe PrutyeF , Ppl 3 Gpretiatine Laws) poprtys Comportecn of fuckin 44 nayreralius , Wes, 1h Pi AWB, geBvc & RF. Cad we furdiin tury Re gr f)- Cheghf te Aa f:AFB g: Bac THM Bet: Ave dime gefr are tA CID THM he (ped) AD oj yce BCD Phen (hig): BD gma (hig):Bod aud fA 7B Tun (ha yf yy Act KEN, YEB, EC > \P be te : f if) frat yo 10, genx Hy tr) ~ (9 Pe- g lfore gla)-x rb ype? RIGA MO = Al flint) @ 2 (byte) = (1-9) tt) = Algts) kus opus ay kip af Big fe purus ts), Bel 99) ant KAY fonctions fiAsh a aA aA av cbfinsed bg A= F Cydy, 3), C43, (2 YB and Be Ly CA, 9, HY Sy ys find fd aed fof qnd oD) y they © nut Youwe= fama frye (eyo = farms Jot (Yoaiy = (I) = fo=9 Yep = F (at) = JIVET geyisy= gQuy= diye] Nath Yang (d= § 121,013 donate (us ts3 Vr F dom (3) Hone Jol io not asfihed: Ayan vente) = (20 ag f dmb (yh $x] Hone fief vo net clypinel: ange (9) =) ¢ deyn tye [23 45) Hane: 929 vo lytnn! New ea = afawle = BOE Hine oy = wy Or, (4, U4, yw) % 44 62 Ct de} and Y de Jane Ahi FS ave Qin bg fel Cy, Cy, C4), ED chy, wy ) VI d= Cu, (yo, (60 L=f Cu CU ty), O99, wp) ay verify Joy = DoF yu bat A ou net ov Enplrs why fat) fave wer Oo Pint Tr aud 5 q ) a Show dhak (for? 9 ly ta >) (rayne flow) = LVEF efor s fla) =disy=3 erty = play = B and g : B > Care functions, then gef: A Cisan injection, surjection or bijection according as f and g are injections, surjections or bijections. Proof (i) Let ay, a, € A. 4 Then (g * f\(a)) = (ge fay = gifla)}= sla} = fla) = flay) (-- g is injective) =>a,= is injective) “8 © fis injective, (ii) Letce C. Since g is onto, there is an element b € B such that c = g(b)- Since fis onto, there is an element a ¢ A such that b = f(a). Now (g ® f)(a) = g{f(a)} = g(b) = This means that g ¢ f: A > C is onto. iii) From (i) and (ii), it follows that g ¢ f is bijective when f and g are bijective. _— wel a ce : Tver of a fuuekon, 2 7 Caled Ale inverse 7f Fi ADB aud 9g rA tue tua fumelion. 7 Ane furlisu 7 oe Ty aad ie Ip A Jer zen, Yee te (Pf )ee) = % 0) f, f : oa ) os et 1D c= () a Aloo fra l¥)=Igly) > fley)-¥ -@ Fr D'@) we see trop sf yofoo Tun * 9g) & UWele Versa . DBOA ds Galted Tre faved of : me Lnverr Of f te g talauoled by f AhAOB yo} Th. The Inverse of a funilion f, 17 emisle , Langue * A Let ge be taverns of f pe THe Drveae of Aft, uy Yaepd Th The Mee b isetail - PAB tO be, nine (wz, for ft & be FA buete ous aud oto Fo trop be Qtsture That PAIB on daverteble, Gud wr teerty Sho That fe pue_pne ote: fet PAB be mvert? bie. yuen 7 a funcken g:8- A 4d Gre I fa) Gy “amd t'9-Ip dat &, ge ae DO io tt fits) = fez) gl Fta)) =f [fta)) [Bn g:BOA} bs sputs) 4 defla) = grt lar) 16) i) > Lyla) =Ip (a) [fm() ty o Se fens) 2 & a4, tr) 0 f 2 pu-me (17) Jet BEB Them g(Ben (o% - Noo beIgthd= 779 lb) fin) 3h =f 9 tb) ~ rN ‘ MMO Conn to eu LEB fo {f1yu)) f dite gies “¢ a 4 cue 4t flames ' “a a) onto Convert, te aude That f 2) oue—one orto Ewe sholt Shoo © that f Paverhble (le Pet epee e luge) Property ves Band g: B > Care invertible functions, then g ¢ f A — C is also eee invertible and (g¢ fY'=f'* 8 viz., the inverse of the composition of two functions is equal te the composition | of the inverses of the functions in the reverse order. Proof . Since f; A» B and g : B > C are invertible, they are bijective. Hence, (g # f): A > C is also bijective (by an earlier property) g ¢ fis also invertible. viz., (g ¢ fy! : C > A exists Since g!: C > Band f-': BA, f' © g!: CA can be formed. Thus, both (g ¢ f)"! and f~! ¢ g”! are functions from C to A. Now for any a€ A, let b= f(a) and c = g(b) . (g © f)(a) = gff(a)} = gb) =e ‘ (gefy\o=a By the assumption (1), a= f~1(b) and b = g"\(c) fc Fee hOaf gO} =f'@=a From (2) and (3), it follows that (ge fyt= fre gt since f-, g and (g © f)"! are bijective. Q) @) -

You might also like