Summer Discrete
Summer Discrete
Delhi
CO Mapping
Objective: The main objective of this Tutorial sheet is to gain the knowledge about poset,
minimal element, maximal element, lattice, boolean algebra.
a){1, 2, 3, 4, 5, 6, 7, 8} b){1, 2, 3, 5, 7, 11, 13} c){1, 2, 3, 6, 12, 24, 36, 48} d){1, 2, 4, 8, 16, 32, 64}.
Also find maximal elements, minimal elements, least element and greatest element if exist.
Is it linearly ordered/ totally ordered set. Moreover, which of the Hasse diagram represent
a lattice.
2. Answer these questions for the poset
({{1}, {2}, {4}, {1, 2}, {1, 4}, {2, 4}, {3, 4}, {1, 3, 4}, {2, 3, 4}}, ⊆).
a) Find the maximal elements. b) Find the minimal elements.
c) Is there a greatest element? d) Is there a least element?
e) Find all upper bounds of {{2}, {4}}.
f) Find the least upper bound of {{2}, {4}}, if it exists.
g) Find all lower bounds of {{1, 3, 4}, {2, 3, 4}}.
h) Find the greatest lower bound of {{1, 3, 4}, {2, 3, 4}}, if it exists.
3. Give two examples of non distributive lattice.
4. Give an example of a lattice which is modular but not distributive.
5. Find the complement of each elements of D42 .
6. Show that D6 and P (S), where S = {1, 2} are isomorphic as a lattice?
7. Define sublattice and give an example of a sublattice.
8. Is Dn is a sublattice of the lattice Z+ under the relation of divisibility?
1
9. Prove that if L be a bounded distributive lattice such that complement of an element exist
then it is unique.
10. Draw the Hasse diagram and which of the following lattice is/are bounded lattice,
distributive lattice, modular lattice, complemented lattice and boolean algebra
a) D20 b) D210 c) D40 d) D75 e) D60 , f )D30 g) D646 .
where Dn be the set of all positive divisor of n.
11. Use the Euclidean algorithm to find
17. Prove or disprove that if a|bc, where a, b, and c are positive integers and a ̸= 0, then a|b or
a|c.