0% found this document useful (0 votes)
31 views

DMS_2_RELATION FUNCTION

The document provides an overview of set theory, defining sets as well-defined collections of elements and introducing various notations for representing sets. It discusses concepts such as subsets, power sets, and operations like union, intersection, and complement, along with principles like inclusion-exclusion. Additionally, it touches on relations, properties of binary relations, and specific types of relations such as reflexive, symmetric, and transitive.
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
0% found this document useful (0 votes)
31 views

DMS_2_RELATION FUNCTION

The document provides an overview of set theory, defining sets as well-defined collections of elements and introducing various notations for representing sets. It discusses concepts such as subsets, power sets, and operations like union, intersection, and complement, along with principles like inclusion-exclusion. Additionally, it touches on relations, properties of binary relations, and specific types of relations such as reflexive, symmetric, and transitive.
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/ 32
EE EEEEEEEEIESES'S!SCSZ ee UNIT- Tl @ SET THEORY z Basic Conceple of set Mheovyy t— A sek is ang well = defined collection of object called the elements (AD members of He Seb. A collection of well-defined objectt is called a seb. Each of the objeclF th He set fs called a membey of an element of Ke seb. : Ex: Books, Cities, numbers, animals ete, | Elemenlk eof a Set are Usually dencted by Lowey - case Lelteys ishile sets ave denoted by capital Letters EX: Natuvel Numbers N= t a | the owels 0 =fa.e,t,o,u } Formaltzelon of selfs t- —theve ave bio wap by tolich fe Sets Can be clesevibed 1 Roskey Notation .- Roster Notation is a complete les of all He elementi of the Set. gx Be feebOeBi tet } 2. Sek- Builder Notation 2- Tt ts used he Yottey meloq is tmngosst ble - Ex: B= i xf 2erx240, and a Sein | the vertical bay /) fe vead as such thet. Symbod Meaning € | Belongs wt for all A Theve_€xis& Scanned with CamScanner RE Sul sek y- ‘ = cre 4 €very element fra sel A is also element of a sek B® then A tS called Subset of g- Bk is denoted by A SB null sek fe a Subset of every sek and every Note : the supcet of iksel& - Sek te & te qc and ACA: re Rafe HS wehbe 3 57h, cehsg then CEA and CSB propey Subset t- 1G A is a subsek of B and ‘Bis of & fe a mre gubsek of A A ts called @ propery subset then ik is Aenoted by ace re A is subset of & then DW ts called a supey set of A and WE is demokd by BOA Nok: we at ffevent sets are equal %& A=G is ana only if AcB and BCA: Ty pes ae sek t= he eam pneu) Seb tm the sek with no elements ts called ne Le “in empty sek (ov) Null sek - A null set fe? denate by hs athe null sek fs % Sub Sek of Every sek um eA set is acseb wilh Ze counkatle sek & Fs ae subset of the Seb A counkable wee the Same eavatnanhly as, Seme e of naturel Numbers > ex: R72 a[x is a naterel member } = R tsminfimik seb fafa Ts a Even number bekween ty? and bo 3 A= A ts a finthe set Scanned with CamScanner ® — the tin Coun kaki Lety of 3 uncountable sek ¢ asek fs closely velaled + TK cardinal Number a set is uncountable @ it cardinal number fs larger tkan that of the natural numbers ye. Universal cel t- In mang ctsensstons all the alg woe tomsidaved ‘te he! Swbsed of one particulay sek. this sek fs called the Universal set for hak discussion: the Universal seé is denoted by BW OP Vv 5. power sek te the Sek of all Subsets of a See ix et ee ic called The power sek of A- and te ts demoted bg plAd- zen hee elawants: th then p(Ar has 2% elements. wee ee we dete = a fou bse dry tush 103 Auris f ‘¢ Equivalent sets t— Two sel? ave Said te be Equivalent ee ee ig there (S * one — one Covve spondence between He elements of the Ewe cels - . ex: TF iy okie eye HY pe lxiPit fs then A and a agit equivalent sets - “+ prsjoin® sels t- Two cots ave satd te be disjein& wo 2 tp they have wo Clement TH Commer ex. 4 ashe eb PF jews Me A and ‘e’ = ne= > ave dts joint sets. Here ANB = Union ef to heli 2 the onion of two sek ‘A’ and 'e) is the Sek those elements ave all of the elements th por in &" oy" in bel”. ThE Onion of sets Kons Scanned with CamScanner ts clenotd ky AUB is vead as “A Unien 'B ex: Leb A= {23,4} B= 43,4,5,6,75 Aue = {1,2,3,6,5,6,7 3 Trley section of two sels :— the inberse chon of hu wwtt “Ko wed “a te We: sake thee element? are all of tke elements common ts both WK and ‘Bp the inkey section of the sefS of A’ and ‘Bis clenoted by ANG is yead as A intey section RB” px: tek me {hed 4 3 8 =4a,4 5, 6,7 } anes 13,435 piffevence of Sels I> TH A and B ave subse of the Compliment of & th A is the Sek of all element fh A which are not In A. one fe ts denoted by A-® aces fxfaen ana x god- ao Ex: 2 ae {ue 4.55 pee he 3.43 pews fumes cave = 18S Complement of cek t-te pe few Universal set ee an a e called the Comple - sek A then BOA mE nang he A ; 4b ts denoted by A’! ment of & and pea ee gxfagad- i ex: lee pond party GiB. Fo y wees Pe en wTevrtrssey $< Bo Heese 3,5, 71708 corse phe BO BF fu Scanned with CamScanner @ which Tr clusion - Exclusion principle s— The inctaston- Exclusion pytnezple fe a Countin technique P gq 4 generalizes the familtar methed of obtaining the number ef element in the Union of Ewo Singh seta - Sym bok cally expressed as nOaus) = nad tn (Bs) — nCAns)- theve nays number of element th A n@®) = namber of elemenk th B A’ and (8 nC AUB) = nos of elements both ndanB) = no: of elementi fn Rand & WitE Common. seh A,B,C We have Fer any Keni te nCaAuBYc) = NA+ NA +N —nCane) —nCanc) _n Cenc) + nCansnc) 4 the no of malkematics students at a college Ex: Fin one of He Languages Telugu, Winds kating at lewk and English atven the following date 6s Study Telrsue ao Study Telugu ancl Hind? Gs Study Winds 2s Study Telugu and Ensttsh Yr study “English, 1s study Hindi ahd Engish - & Study all three Lan quages- seki Given w(t) = 65, ncays 45, neo = +E nora) = 20, n(aneye2zs, NCHNE)=I5, nitn tne) = 8 dnclusten — Exclusten principle By (Ce) _n(tnn) =n(rne) —n(nne) nO tuhVe) = nity a nGaan an (Tanne) = GS4bSH URW 2O- IE AB = 10d 4° Scanned with CamScanner Cartesian produck 3 aw Oe deveck pre cluck of cela and & the Set of all ord bes by ARB: ex: bee Aas 2ed fp Bef, sp Ren R. * he st AX B= fae? GS), @) BXA = JG GW 4.2 AxB = BxXA Laws of sek Weory 37 pemination laws: AU LM - cardesian proctuct ba s Leb us Consider two sely A ey pal (a,b) there a€A and is called the procduck of A ond B and i denote iS) 6.4) G9} G12) 13), 13) F lads: AUPE A and ANMAA = ond and-4 Telem potent laws 1 pRpUA=A ond ANKaA Com plementatisn Lat : Commutative Laws 1: cain a AUB = BUA ond ang: BNA Associative Laws: pau(BUC) =(AUBIUC fe Disty? bulive laua: n(ancd=(Cans) ac an(auc) = @ng) yu (ANC) au(anc) =@us)atauc) \ Demovgan's bewst caua)'= alng cans)! = alo! absorption Laws: Au(ang) =A and An(AUB)=A Complement laws: ' aual= and ANA = G. Scanned with CamScanner Ex! pAeve hab aun ne = (Aum) MALE) . @® Let ‘a! fe an avbidvarg tlemenk of autenc) Proofs ees aw € AU(B AC) & EA (or) KE (ANY ey ER (x€B and XEC) > (KER oy xEB) and (xEA ry XEC ) = xe AUR) and xe(AU oD ger xe@ ve) Naud) enee au (nt) = @uB) n(auc), Ex. pheve thak (ane) = ad ‘ Prof: Lek *%e (ANB) eo * é ane we ~( XEA ond KERB) iy ei Cx] 108) key ACKER) oF ~(xes) \ 1 = xd A oF x¢Bb eyieh oy LEB is xedue \ baci Hane CAMB) = AUB. (AanB) Vand by using men bey Ex: prove Trak an(Buc) = ship table peceale le [eve | anioue jane [ane |@nsyuiana | ede oy Scanned with CamScanner Relakions t- Any sek of ovdey paiys defines « neers ae binary yelation. ancl it Ts avbi kyary association of Clements wilhin a Sek oy With elementz ef amelhry Seb. mathematically tek A and & are ang Ewe sek oA ye dation Sram A HB is a Subseb of AXG pz jaws ond B=has Ex: = axB =e {@.4) ein Any subset of AX® js called relation _ ie (aa) €AXG (o,a) #8 a velotion Note: 1+ (abd ER tren We Say “a ts velated 4 L” ana ie can be Hriltin ob “arb” (ev) R(a,») 2. @mer ER tren we say "9 ts not velated Bb" and i ean be uritten aS “a KE" ovdeved pay t= TF ak & and bEB ten He ovdered pair et a is He Set {es fabs} of the pair fay} ond Con si Skiing fe singiebon feb sapire tarda, shy) Gi dn Yee ovdey pot (a,b), the element ‘a’ is called the first tot ts called Phe Second element. element and “bh stab) and (4 jh) ave tie ordeved pairs Hen Cae 2 (LED HF one ed Bae, fe rca, b>) and (6,9) ave Ewo oi ffement ovdered pairs (a,b) = Chi” a. The bile objects fh an ordered pairs do nok have uw (@,4) fs a Well- defined ovdeyed by pe dastincl- aly . Scanned with CamScanner © Ex: bel Asdry2} , Badge h | c= [3,43 then find AK BKC sok: ners, Set es “ mee (1 8D <: xe SO} ul a 6 3 O19) =3 GS ola 4 > (read V2 aoxce LEY 2<—— 3 =3 ag KS 3 7 <4 2 Gass z a Ts 2914) Ss, - Gay Cad Domain ond Range ea “the demain © of the of elements the Range pomath CR) a. Range (®) cen oF aaj ii23s ‘ and Renee Sai Given A= Re AX B= Given Relation Raf) pomain R= R = Ranse fa velation of valabions <- R fs He Sek of oll Ctyst ordered pair which ‘@ is the Seb of Se belongs Te Rand dond elament z= Jacn/ cep fey some beB ft 2 ql veB/ oan iy Some ae} - Be fake 5 be Jae WO) 21h), 3,095 | ind damiats Gof TF §i,2.3f pBeforbec § hae db? Oe) 12,92.) G10 BV Gib» The Seb Of yrs s The ser of fare, bS Qo, 8,9 § fivsk elements fn R Second elements fh R Scanned with CamScanner propey Hes of Binary Relations 1 I. Universal yelation t= A velation Reon a Ske A is Univeycal ff A= AXA™ 12434 tien AXA =f Gv a & Gre ex: If A @1), G1) GB Bw} fs the Universal velation on A 2. void veletion t— A velatien Rona Set A is void vyelation 16 RE tke null sek. ex. oe Bais 4 Sh then R=jarb> lef fs a null seb ae ram yelalien t= A Yelatten Ron ase A Is Bden tly yelation 7F RYO arfacag ond ie fe dencted by Tat Be: TE Aah 2d} then Rf (1d @2) GB) F ye Inverse velation t— TF 'R’ is any velalton frem a sete the inverse of Rg ts demoted Py at g JG] yea, xen, ayer 5 ex: 24 wah2i3,5h , B= 36, 8,10} then Ra}Q.0) (2,8), Gro) (2,6) Gio Nos =} G.r) Bir) (lor) (e3),Clo,sy f &. Reflexive velation t- A velation on a seb A ic Foy Every AeA & TE @,arER, WxEa ye flextve TE aka re Raed y then R=f0 2) Gud 2.2, sf EX: "ge fs called weflextve velatton. olkeywite Tk te called Seve Flexive . ext Re {Gd 29, @3) GW Ff. a Scanned with CamScanner We velabion i- te (ba) ER eshen ever (ab) ER 6+ symme kvic a ralateos’ 9 a 20k HE is called symune bie Bho all ayb@ A> Anti syrame Evie veletion:- Rt an ante squmebri 4. th theye existe ib) and (ba) €R then a=b- ge. Transitive velalion t- A velation R on = sek A is wajlive Fe aREAES a Rb and bRe then aRC- dvansitive i€ whenever & G,b) tbe) © B then (a,c) €R- me ae RE Wetinny oF R=Say O13) (24) ,(3,0 03,3) (4,3) $0 Then find if velation is yeflexive syn metyic and transitive. Sof: me fons Wis? (242,217,972) F RUS@PR S47 SF i Re flexrve (BO G13), G3), G12) 44) F eR AGN) v trig to neuf G2? 1G. f are 8) eat? B89), C49 GOT G3) Qy4) Ruf 3,040] iy TWanst kive in aa ws Cast), nd.) 32, 439,00) F Re ‘ we ' apes owner exe 26 Be ‘iakehl 3 and R= (WN) 0122 213), (3.29 429 ~ (Hid) Y then tyes Wl dtrecked JVaph- ca g =f pyre CHVC8 2,00 | “ 9 Gt 8 uO) Scanned with CamScanner Mahix ve pre sentation of velations +— ee NN Lek A and & ave both finite Sebs and ‘Risa welakion from At B- then R may be vepresented af a dnadvix called the velation matric of R- Tt is densked by Mrpo finite sel Containing ‘wi and “n’ elements respectively Mp = [mas TV nen is defined by mi ~{e i€ (ay, ba) EK it Gi, by ER ex: Wee aast23,4 J and R=[Giy/ xo4 3 Find Ma: sd. Given Bahn 2,34 F R= f Gn (4.3) G2? BIG Ca) F The corresponding veleHen matrix for the R are seven 1 . 2 2 ‘foo oe © Me = ® 1000 3} 110 0 af tr to hey. exr th tee fend. 4) aetiwed by R= 0,1) (2) G3) aed C403), C412) 410, G29, G09 F Rind the matrix and aAtrecled ove ph of velation R- set, The matrix of yelation R fs a 4X4 mMabixn as tia t if. coo orvected avaph is Mr®l ore Q Q | 1 1 o W @) \ 2| 0 \ { 4 a4 Ll Scanned with CamScanner Equivalence yelations A ts called symme bee Let A> then ae i ay Sarame We ay Transt ex: (2,3) 032) ye wy iil re . . y t— A velabion R fh a seb @ an €quivelence velakion f€ ik fs veflextve and bransibive. a,b,c ave aybibvarg elements of Some Seb . by denoles ‘a’ fs Equivalent Re Flexive : ate tek Re qiven Re flexive bive fork anb then bam xh dud. aay Poe Gea Bate uae) wal g =f, Git Crd iH) 212d io 3 preve thal ‘R’ fS an Equivalence. a afr CH) CHntd G8) Cr) (213) (3,2) (3.3) f fe Pag ag a AER 1) 12) 3?. ‘gts ve Flexive ye cu $ xER ARK > Symmeryic 1m Fev ong agg EB ae Ga) G8 ies awa 2 and « pea ym & R . d 2 ue avr? ney > yr = (R fs Sgmmetvic aRran su kive t= Poy any K,Gi2ZEA waa G.q) and (ay xRY and Hence Me ~velation 2 ER tren GD ER Rt XQ ‘el is transitive. Hoh We Ate RS an Cquivalence Relation. a U4) 99) f (ay3), i292 G2? (3,29 (413) 33 etc..- Scanned with CamScanner ee ee ee congruence Relakbion :— an Congrwence velation exam ple is of equivalence yelation . Lee ‘a and “b ave ang tie integers and “y’ be a Fixed positive integer then ‘a and ‘by’ aye Satd te be Congruent treelulo “y? i Mathematically ik “<’ devices a= b (mod y) (a-b) - Ex: $3 213 Cmoas) since 3-13 = 10 is Ayyt sible by S gx: prove That the relation CongYuence wedule wm" covey fe Sek of postbtve integers fs an Sol: Lee x, GY EN 1% Equivelence velation gy (mod m) ts divisible Thand oly TE 4 by ‘wm’ - jy be x04? en then xn =0-m OF Wy tek *E xex( mod m) for all xen 4 Cmodm) > then x-g fs divisible by ‘mv te > —(%-4) = G7 XS alse Atvi st ble by “! & g=Ex (med m) the yelation = is ity Let Sym metvic x=y (modm) and st (nod m) te (x-q) and (Y-2)y ave aivisible by ‘mm! Mors (xaypaly-2) is atvisible by Sw! tHe t& atvt sible by ‘wy > x= 2 Cmod m) Hence athe relation Equivalence is transitive mB relation Scanned with CamScanner ek 'R denole a velation on the set order paire®) Ex; ob of posi tive integers Such that (19) RG) igh vegu shes tkat & 1S an equivalence relation sol; Let X14, 4 and ¥ be positive integers Given (ig) RW) ey EVE YH since xY 4% is true for all posi tive, integers a Og) BR G0g) athe veation R is ye f lexi ve- Quy A mvs yt a yarrv 2 uy ave > MHwrRerg) iy Lek CG) athe yelation ‘R'is sgmme ty ic - ily ve erg and 'n are positive integers Lek (eg) RV? and (iv) ROD a eee and one 3 avun= yoy™ ay xunegm by canelling OW 2 x4) Rm? > othe velation RS transitive. athe velation 'R fs equtvalence yelatton . Hence ex. Nfs the Set of Natwral numbers the velation ‘rR’ 7S o b> R ©,4) atde= btc- prove thal actined wy Car R fs en equivalence velation. sol: Let a,b, ¢ amd ‘dA be natuyel num keys - @iven (aro) RC) wey aed a bt v (aby R (ah) 4 ath =eto Ris ye flextve Scanned with CamScanner ty cay RED FB atd = PFS > byes ard dta 3 (A) Rash) =) ¢tb = ‘pi ie symmetyrie WW) Gyby R Cid? and ©,d) & (mind ay ards bre and cans at ca at dt Orn = p+¢t+arm (arb) atin) ay Aatne bem A ‘eh fs transitive mene “RS SH equivalence velation - Compatibi ke & yelation t- A Relation plinn is Said tj be & Compaki bile § yelation Fe Te fs ve Flexive and seymmerric- so all equivalence velaHens are compat — tele tg velations and Th is Some mes denoted by ag. of velations t= bee ‘pi be @ elation fom Compost Lien ‘s) be & yelation Frem Y & zZ -Tthen avelation xy and ee called a Composite yelabien of RK ana ‘S whee ROS = 4 (x29) «ex 2% hen wer “ey wilh (xg) © R and wes 3 ex: Lek wah? Gi 2) F and §S =¢ 2), Gis), Gi) 13d 3 Find Ros and SOR: cle Give RE Sain GWG y ~ ge Orr @srk 30 (eS Ros -Fus G2) ,@) j sok = fr?) Hae (ub clenvlg Res + Sok. Scanned with CamScanner ordering i & binary xelation Rk top @ parkial is called a paytial oveler relation (er) x partial evdering thy iff & Fs ye Flexive , antisymmetric AO “estan SEEINE ie 1. apa Fovall EP 2. aRb and bRA => a=b 3 arRb and BRO =y ARC Ex: shows That the yelation “greater than ov equal t 4 ordeving on the sek of integers. and tke yelation f.ia partial sek of all integers se: Lek 2) be the ogee" ) stee C2 for Every inte ger a, Me velabien (2) FS spe flexi ve wy tek ta end bbe Ong Awe integers Let ah and BRe azb and 62% = a=b athe relation “p" ws anki sgmmebri¢ vip Lek a,b and ‘cl be mY Ihyee th tegers pet ob and BRO = azb end b20- 9 azc wine velation ts transitive: ence The welatien “2° is partial ordering on He nek we iwhegerE (1,2) tf 9 pesel- poset ( partially ordered cel) i- A set p kosethey Seay ere RT TES aa with @ porttal ov deving Ri ois called io partial ordered eek ov posek = athe velation & is often denoted by the symbol ‘2’ tren the ordered pair Cp.) fs Called poset - Scanned with CamScanner Hasse dtagrams t-— A parkial ordey £ on a sek P can be vepreSented by means of a diagram Kroon AS Hasse cfagram of (Pp, 4)- Te veprecented by a small circle oy dot ty Each clement iy the civele fov xep i drawn belory the Circle for yer ie xey ond a ne fs dvawn between X% andy ie y covers wy TE LY bub ry does nok cover'x’ then x and y ave nek Connected divectly by a Single line. at patito § and & be the relation Less than Ex* oe Ea te? then the Hasse diagram "SS. 4rawn below s Sol: ‘ = a - \ oveley seb - Te is totally wer. yale His f2,3.6) '21 2% 26% and te relation ¢ be Sneh that * S49 ie x divicles y- Pacts the Hasse diagram of (%)% Se: a “4 ie je fs nok a total ordey set. 6 Lv 3 Ex: pra The Hasse ciagram For te vrelation Ren A= furs, aes b those valation mabrtx siven below P ye oo oa YW Ma = ov ytd oo Vt 0 a Scanned with CamScanner Sot: R= } 1,0. 33, C14), 05), 0212), C213) C8) C218), G,3),03,4) 6,99, CHW ls J. ¢ s Hesse cdtagram for Mp |S ‘ 2 Ex: A partiel order RK on the set A=$2,3,45 oS vepre— sented by the Following cttgvaph. drais the Hasse ckagvamn for Ro ~ Sef; By fxamining the diven aigvaph we find that R= Fay C6 13),G8, Gi C2), (3,39, CHD J, 4 a Watse agvem ‘is 2 7 1 Ex: Dra the Hame Bagram fov the partial oydeving & on tre poley set pis) wheve = faybic } Sot: @rven S- fab} pear = § 4, bh es Ast fares thes facdfabck | je ibicf BS > 8 yepre senting the positive divisors oF ¢ » ame ctragvem fs fobs XS Ex: pra the Heme eagyam jal [2 Bi 123.4 67, BSE 3b mae we a a fae eeagram is 4 4 = 3 Scanned with CamScanner Pameaeinls: z— bet X and y be any sso. Sl5 a velakjon ae y' fs celled a funcHon Tf for Every mex there fs a Unique element yey gach that ogy e f ee tek X= LSE ye EP VTE ond Ff) EW Gro} en SEP, Fev, F@=¥ clearly “fA femetion fem xy | x Domain and Yange of a funchon t- of eee SE Ron Bese ee ae fr xay fsa Ffunchon then ‘x’ iS called Hie pornain of “4 and the seb ‘y' is called the Codomain of f. the yanoe of # ' clefined as the set of all images Under e ye ab ts demoted by FO = $04] for some xin x ,foor4q $ cx: TE the funchon fl is defined by farechi on tke se ferro et Sind the Yange of ‘f'. » eat Given Foo= X41 = eats =8 fos otl=} FG=4H=S Cn = & ~ , 7a cute) 2 Roys ttle2, coe © the vange of Fo = Eun de Types of funchions i— wom ee 1 tne -Hivone anette C Injection) = A mapping fixoy Se ace: ae ape SS ig calles one-te-one If atckincl elements of *x’ ave mapped ints dtstineh clementz of y £ 4 (qef IP = g CF) 2 (Fog) OO = (fof) = £(F@) = Wy wy) 96 9@) = g(x- ty (909) (x) = (3%) (FehI OO = eCh@) = £03% ¥) _ h(g@) = ae as hCxta) = 5) @) = nC Fan) = O42) “ aoe 5 (@eh) - £0 a(Be)) -fOG* bh 04) = (Fe 5° en ce me R=) > Scanned with CamScanner este) and. Geu= 24-3 Key @ ext TE f= find the Compost tien of ty FoF fog iii, Sof Sol: Tayerce Fanchions i a function f2 x9¥ said bible of ib inverse function #1 is also Functor fe ‘x’. be Inver lke vange of F rem ap f@-y then 22 £108) ee bel ts tO* be given by ¢ y.= He vO ge ca Let xy, 2 &® anch [Rat Fane 4%) Ty neaete? 7 ape 2 NE gts one-one wy 2a Fe then Youre? 7 an YtR > te fare pt te ont - 4 Fle ‘nwerttble ant give aera. gx F% Rok fs defined by Lays atth Rie exit “skate that fs anveret ble ana find the inverse of ie set ‘p's caver Ht ble and £00 = ob a ond cans ere s— bet ‘x’ be @ veal umber.) vs called [27. fe Least integer that fe nok leas than 2’ cthe certing of % fs denoted by -3 ,fre] > (-2] =-2 ex: fai] * 3, [8] | then the greatest aykeger that does «called tie “Floor of x” inkeg a she plooy of ® te denoted by bd - | Scanned with CamScanner SS ee a ex [swjes iejee,bed-s fan chon t- 4* teaersive function isa Re cy sive I a funerion thich t de Fined jn beyms of aw jéself£ . we can also define functtons veurysively - fe ve ULy sive definition has two gorks - 1 pe fenttion of the smallest argument fe F(a) ov £0) 2. pedi nt bien of fc). giver fo-n, J @-» €6t sis defined functon- An example of a vemrsively P 4 Ex: 4o=3, foe 2F(t3- then fOs 2FOHS = 2@+3 279 fee 2FOt3 = BEF H A Leys 2F@tF2 = 2avt+2= 4S FM) = a Fa) F3 = ACS) +FR are cabtadate the valsed of the Following recursively Ex: defined function Fei and fo-n F@-1) sot: Given Fe =! and F(ny =n f(n- = fae fo) = il =! ee a fay = 8 FO-* zeae tw = yi t@ = &OF MH ene ye cuy sive. defenibian oF The da choyi al ahs is Ke function , $= Ry ex: Fel, fayet and £0)= FO-9+ Sincis eA! Pep On; Sore FOH+ ant x: & a Fe fn = FO-D FR Scanned with CamScanner © Lif GF E% Hen Fee £O-4, Ht EX! Consider the fallewing vecursive function Th x anb=a Next ameme thak anb =e, Bub TE is oly possible ee aeb , thar & anb=a Fy atb. Finally ach Fy anbse and anb-as? o£ b ence ath & anb =a: cumbaly on prove that aSb & avb=b.- t bet (hyd), be a lettece then bec of{st 24 é avb £ ay By above Theovem adh (=> aAb=a & avb=b mig we have t shod teat bec > arb s anc ec 2 Wh We e Shall Shoig that (nb) A (anc) = arb 3 (arb) A(aAo) = ar(bna) ac = anl arb) Ac | eeorrte teres) |@ara) A (AY san&ar) 7 » sanb TE bec ten arb & AAC. stmikar ly We Can phove Heat af bee then avboave. — Scanned with CamScanner = Some special Lettices 1— See, ARE eee wD @ (6 pi shyt bubive Laliices f— A Letttce (CL av) is arse butive TF tke -folloes ing xdes Elon al ‘ctentity hells for wll x, Foard = fh L. wa cgve) = (eA) Vv (xAz) and av Cyne) = (rv) ACV 2) ex: shed that the elle ssing simple Buk me To a nok arctyi bukive ¥ 1 y i L a « . : < o ° € Sati yD athe dcamond Lattece nok dxstyt bulive a bake mos an (hve) = (ais anceve) # &r v = ant = eovo=e b)Y (anc) (ano ts also nok clisti bubive By The pentagen Lalttce oy these tRyee Elements ~ ap loved = ant) =e a (anb) v (and = avo zo Ex: consi dey the poset (4, 2) ites, Lhiaasi3e} wail porto! ordeved welation < t deft ned at fF xandy eb Be xLY means X divides gy’ Then cheis lKat posek {3 Latte ce gay stnee GEE CHD BNE lew City) = Lua Cm = ey = Bed Coy) Scanned with CamScanner NolS we can conskyuck the operation table T and 1 foy GLE and LUB vespectively and the tagyam is shown fn Fig Table w8] if | ls | 34 vf a{ > [ested viele | 2 2el3¢ 2 |3[3e{3 Be | 58 gs |s|30|30/5 [3° 3¢ | 30 ao |so| Sol Se) puttve teltece legs test Lov Agstyt Hasse 30 AwAMe ER, HEF zee then an (yy =) = anBved = 24% Bo = Gan) Vv A>) = @as)v GAS) sig wey 2 since LHS + ans Hence batirce qs not a aestyt brtive beattrce - e wounded beltcee f eel eystern (L, nr) 2 a Leask element ‘o' in Hee Laltsce fe hy fell xe PALE % and ow | =f ay fe all «eb | and | | | XRO= O and xXVO=X the element Land tke element ‘oo is ealled the Cor) bettem of L- TE theye Exile a greatest element ‘yxy called the ULppev bound (or) top of Lowey bound Scanned with CamScanner sw botnded Lattice is ah algebrele gs complementid Lallkce tg Latter Ghia) wenn ee ery ‘ gatd te Complemented taltsce TE, Every element & tn the Lattice hak a Complement. (ov) A bounded Lattice with qrvestast element ‘I and Least element 'e’ then fev tke elements @pb EL element “El ts complement of a if avb=l and aAb=o. Ex: Lalti ce shai tr Fig (@) ,),() ave complemented — ' Latte ces ~s) GLB (ayb) = aAkb =o LupCab) = ave=t Hence Tt fs complemented bLakbice by GiB fib) = arb = gta (cB) = cada Lup Cab) = avb=l tua(cib) = evbst So beth ‘Wand ‘eave Com plement of “L Hence {e Complem ented Lett ce + 5 qin(at)= *ncee, gieCaib) = anb=e Lup Ca,b)= avbel , lua lac) savesl- Se beth ‘brand ‘' ave Complements of & Hence TE TS complemented tate ce be Modulay belle t- a modulay Lattree tha Late that Satis fren the Kollowing Self ctual Conde bien. mv @Ab) = va) Kb Scanned with CamScanner © OE¢& $< Ex: Gra Atstrbutive ballee (L,£), arb = anc Mat ba and avb save tmyly Sols Given arb ant and avb=avc New be Pe Aavbd Labsovpbien Lau = bAlave) Cu avbrave = (ona) v (bao) = nb) VY © = Canc) Vv (ERO) an b= AAC (cna) Vv Enb) = ca lave) ce Alay 6) bee Lo BY absoy pbion a Ex: Sw w» acstribative Lettrce TE an element has o Complement then thi Complement fs Ontque- got, | Suppose Tak on element’ a had tivo complement ‘yiand ‘es then avb aAnb=6 ane ant =6 We have b= bal pray) . Saves) = (bray VERO = ov (bno) " (anc) Vv (bao) (avb)d nC " Vac yw Buk y BY. Every arctrtbwhive Leliice fs — ay ee ites My SD bea aAtstyibulive Lattice tf a&e Fr aveac s&s . 1S = ok av(baod * (avb) A (ave) = (VEDAS ° 1 Hence EVETY Ar stvebulive talttee Is modulay. Scanned with CamScanner ’

You might also like