Scribd
Upload
14 views109 pages

Doubt Clearing Session With Anno

Uploaded by

Programming Pirates
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
14 views109 pages

Doubt Clearing Session With Anno

Uploaded by

Programming Pirates
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/ 109
Doubt Clearing Session Course on Discrete Mathematics for GA Vig Sanehit Jain + Lesson 12 + Sept Conversion of POSET into a Hasse Diagram * If we want to study Partial order relation further then it will be better to convert it into more convenient notation so that it can be studied easily. * This graphical representation is called Hasse Diagram * In order theory, a Hasse diagram is a type of mathematical diagram used to represent a finite partially ordered set, in the form of a drawing of its transitive reduction. * The diagrams are named after Helmut Hasse (1898-1979) Steps to convert partial order relation into hasse diagram 1- Draw a vertex for each element in the Set 2- If (a, b) € R then draw an edge from a to b 3- Remove all Reflexive and Transitive edges 4- Remove the direction of edges and arrange them in the increasing order of heights. Q Consider a Partial order relation and convert it into hasse diagram? R = {(1,1), (1,2), (1,4), (1,8), (2,2), (2,4), (2,8), (4,4), (4,8), (8,8)} Q Consider a Partial order relation and convert it into hasse diagram? R= {(1,1), (1,2), (1,3), (1,6), (2,2), (2,6), (3,3), (3,6), (6,6)} Break Q Study the following hasse diagram and find which of the following are valid? (4) & (8) (9) (10) Conclusion * We can not have a horizontal edge in a hasse diagram * We can not have a reflexive and transitive edge in Hasse Diagram QLet X = {2,3,6,12,24}, Let < be the partial order defined by X < Y if x divides y. Number of edges as in the Hasse diagram of (X, <) is. (GATE- 1996) (1 Marks) a (a)3 (b) 4 (9 (d) None of the above Break Elements of a Poset 1. Maximal Element: - An element is said to be maximal if it is not related to any other element in the Partial order relation. imal Element: - An element is said to be minimal if no other element is related to it in the Partial order relation. Minimal cS Least Maximal Greatest Minimal Least Maximal Greatest Minimal Least Maximal Greatest Least Maximal Greatest Minimal Least Maximal Greatest ~e Minimal cd, 4,4 $ Least Maximal whee Greatest $ * Every hasse diagram will have at least one Maximal and Minimal element(one or more). Break Greatest Element: - An element is said to be Maximum/Greatest if it is not related to any other element but every element is related to it in Partial order relation. Or if a hasse diagram has only one Maximal element then it will also be Maximum/Greatest element. Least Element: - An element is said to be Minimum/Least if no other element is related to it but it is related to every element Partial order relation. Or if a hasse diagram has only one Minimal element then it will also be Minimum/Least element. Minimal Least Maximal Greatest Minimal Least Maximal Greatest inimal Least Maximal Greatest Minimal ane Greatest Minimal Least Maximal Greatest Minimal Gebisll Least Maximal ig he Greatest . Every hasse diagram will have at most one Greatest and Least element(zero or one) (T/F + . Every Greatest element is also Maximal (T/F)_ ~ . Every Least element is also Minimal (T/F) . If there is only one Maximal element then it is called Greatest ~~ (1/F) . If there is only one Minimal element then itis calfed Least (1/F) Break * Upper Bound: - Upper bound of a subset B with respect to set A, will contain all those element to which all the elements of B is related. * Lower Bound: - lower bound of a subset B with respect to A, will contain all those elements which are related to every element of B. TT ie PbS igh. Bound Thy Lower Bound ~ ad Elements | 8 = {d, e} CEs) Upper > Bound Lower Bound Vee | abs aAws Elements | 8 ={d, e} io] Upper Bound + dde Lower Bound a,b Qa Elements | 8 Ee Lower Bound Break Least er Bou Join / Supremum / V Least value in the upper bound Greatest Lower Bound /(GLB)/ Meet ee —— Ve ——— Greatest value in the lower bound Exe Upper Bound tig h, fh Least Upper Bound Lower Bound Greatest Lower Bound Least Upper Bound Lower Bound Greatest Lower Bound {a,b,c} Se Ses) Upper Bound Least Upper Bound Lower Bound Greatest Lower Bound {a,b,c} rs ary Upper Bound Least Upper Bound Lower Bound Greatest Lower Bound Pern) {ta a € CER {fh Q Consider the Poset (J SBA.45), /). Which of the following is correct for the given Poset? (NET-JUNE-2019) a) There exist a greatest element and a least element— ‘> b) There exist a greatest element but not a least element 24 Me - 247457 c) There exist a least element but not a greatest element — 7 Mn 3 we does not exist a greatest element and a least element- sé 1». oe | | s Break Join Semi Lattice :- A hasse diagram/Partial order relation is called Join Semi Lattice if for every elements their exists a Join. Meet Semi Lattice :- A hasse diagram/Partial order relation is called Meet Semi Lattice if for every elements their exists a Meet. Lattice :- A hasse diagram/Partial order relation is called Lattice if their exist a Join and Meet for every pair of element. OA hasse diagram/Partial order relation is called Lattice if it is both Join Semi__ Lattice and Meet Semi a) — _— Break Break Q Consider the set X={a, b, c, d, e} under partial ordering R={(a, a), (a, b), (a, c), (a, d), (a, e), (b, b), (b, c), (b, e), (c, c), (c, e), (d, d), (d, e), (e, e)}. The Hasse diagram of the partial order (X, R) is shown below. The minimum number of ordered pairs that need to be added to R to make (X, R) a lattice is (GATE-2017) (1 Marks) e ec d b QA partially ordered set is said to be a lattice if every two elements in the set have (NET-Dec-2010) a) a unique least upper bound b) a unique greatest lower bound c) both (A) and (B) d) none of the above Q Consider the following Hasse diagrams Which all of the above represent a lattice? (GATE-2008) (2 Marks) (A) (i) and (iv) only (B) (ii) and (iii) only (C) (iii) only (D) (i), (ii) and (iv) only Q the inclusion of which of the following set into S = {{1,2}, {1,2,3}, {1,3,5}, {12,4}, {1,2,3,4,5}} is necessary and sufficient to make Sa complete lattice under the partial order defined by set containment? (GATE-2004) (2 Marks) a) {1} b) {1}, {2,3} c) {1}, {1,3} d) {1}, {1,3}, {1,2,3,4}, {1,2,3,5} Break +O ae +l -A -—2- —) Boolean algebra * Unbounded Lattice :- If a lattice has infinite of elements then it is called Unbounded Lattice. * Bounded Lattice :- If a lattice has finite number of elements then it is called Bounded lattice, there will be upper and lower bound in lattice. * Complement of an element in a Lattice :- If two elements a and a‘, are complement of each other, then the following equations must always holds good. a V a‘ = Upper bound of lattice a A a‘ = Lower bound of lattice * Distributive Lattice :- A lattice is said to be distributed lattice. if for every element their exist at most one completemt(zero or one). * Complement Lattice :- A Lattice is said to be Complement lattice. if for every element their exist at least one complement(one or more). * Boolean Algebra :- A Lattice is said to be Boolean Algebra, if for every element their exist exactly one complement. Or if a lattice is both complemented and distributed then it is called Boolean Algebra. Break Break Q The following is the Hasse diagram of the Poset [{a, b, c, d, e}, <] The Poset is (GATE-2005) (1 Marks) (A) not a lattice (B) a lattice but not a distributive lattice (C) a distributive lattice but not a Boolean algebra (D) a Boolean algebra a Q The complement(s) of the element ‘a’ in the lattice shown in below figure is (are) (GATE-1988) (2 Marks) I Q Find which of the following is a lattice and Boolean Algebra? (1)[D yo /] (2) (012, /] (3) [Dso, /] (4) [Dys, /] (5) [Dea, /\ (6) [Dsy, 1 (7) [Dou /I (8) [Dao /] Q Find which of the following is a lattice and Boolean Algebra? (1) [{1,2,3,4,6,9}, /] (2) [{2,3,4,6,12}, /] (3) [{2,2,3,5,30}, /] (4) [{1,2,3,6,9,18}, /] (5) [{2,3,4,9,12,18}, /] (6) [R, <=] (7) [P(A), S], A = {1,2,3} Q Consider the following hasse diagram, find which of the following is true? a) it is a lattice b) subset {a, b,c, d} is a lattice c) subset {b, c, d, e} is a lattice d) subset {a, b, c, e} is a lattice Q Consider the following hasse diagram, find which of the following is true? a) subset {a, b, c, g}is a lattice b) subset {a, b, f, g} is a lattice c) subset {a, d, e, g}is a lattice d) subset {a, c, e, g} is a lattice Break Q Suppose L = {p, q, 1, s, t}is a lattice represented by the following Hasse diagram: For any x, y € L, not necessarily distinct, x V y and x Ay are join and meet of x, y respectively. Let L3 = {(x, y, 2): x, y, z € L} be the set of all ordered triplets of the elements of L. Let P, be the probability that an element (x, y, z) € Lichosen equiprobably satisfies x V (y A z) = (x Vy) A (x Vz). Then (GATE-2015) (2 Marks) (A) Pr=0 (B) Pr=1 (C)O

You might also like