Scribd
Upload
120 views

MA2101 Engineering Mathematics-III (Common For CSE, CCE and IT) Assignment 1

This document contains an assignment on partial order relations and lattices. It includes 21 problems analyzing properties of sets and relations, drawing Hasse diagrams, determining if relations represent lattices, and other concepts involving order, divisibility, unions, intersections and more. The problems cover determining if sets are subsets of each other, drawing Hasse diagrams, finding maximal/minimal elements, and properties of divisibility relations on integers.

Uploaded by

bruh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
120 views

MA2101 Engineering Mathematics-III (Common For CSE, CCE and IT) Assignment 1

This document contains an assignment on partial order relations and lattices. It includes 21 problems analyzing properties of sets and relations, drawing Hasse diagrams, determining if relations represent lattices, and other concepts involving order, divisibility, unions, intersections and more. The problems cover determining if sets are subsets of each other, drawing Hasse diagrams, finding maximal/minimal elements, and properties of divisibility relations on integers.

Uploaded by

bruh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

MA2101 Engineering Mathematics-III (common for CSE, CCE and IT)

Assignment 1
(Partial Order Relations and Lattices

1. Determine whether each of the following statements is true or false


(a)    Ans: T
(b)   {} Ans: T
(c)    Ans: F
(d) {}  {} Ans: T
(e) {a, b}  {a, b, c, {a, b, c}} Ans: T
(f) {a, b}  {a, b, {{a, b}}} Ans: F
(g) {a, b}  {a, b, {{a, b}}} Ans: T
2. Determine the following sets
(a)   {} Ans: {}
(b)   {} Ans: 
(c) {}  {a, , {}} Ans: {a, , {}}
(d) {}  {a, , {}} Ans: {}
3. What can you say about the sets P and Q if
(a) P  Q = P Ans: P  Q
(b) P  Q = P Ans: Q  P
(c) P  Q = P Ans: Q = 
(d) P  Q = P  Q Ans: P = Q
4. If |A| = 5 and |B| = 10, find the maximum and minimum number of elements in A  B and
A  B. Ans: 10 ≤ |A  B| ≤ 15 and 0 ≤ |A  B| ≤ 5
5. Let Dn denote the set of natural numbers that divide n exactly. Write down the sets D60; D84
and D60  D84. Find the number m such that Dm = D60  D84. Is it true that for any natural
numbers r and s there is a natural number m such that Dm = Dr  Ds.
Ans: m = 12; Yes – gcd(r, s)
6. Let R be a binary relation on the set of all strings of 0s and 1s such that R = {(a, b)/ a and b
are strings that have the same number of 0s}. Is R reflexive? Symmetric? Antisymmetric?
Transitive? A partial ordering relation?
Ans: Yes, Yes, No, Yes, No
7. Let R be a binary relation on set of books such that (a, b) is in R, if a costs more and contains
fewer pages than book b. In general, is R is reflexive? Symmetric? Antisymmetric?
Transitive? Ans: No, No, Yes, Yes
8. Give an example of relation that is
a) both symmetric and antisymmetric
b) Neither symmetric nor antisymmetric
c) Reflexive and symmetric but not transitive
MA2101 Assignment 1 Unit-I

d) Reflexive and transitive but not symmetric


e) Symmetric and transitive but not reflexive
f) Partial ordering relation

9. Let A = {1, 2, 3, 4, 12}. Consider the partial order of divisibility on A. That is for a and
b  A, a ≤ b if and only if a|b. Draw the Hasse diagram of the poset (A, ≤). 12

4 3

Ans:
2

10. Let S = {a, b, c} and A = P(S). Draw the Hasse diagram of the poset A with the partial order
. {a, b, c}

{a, b} {a, c} {b, c}


Ans:

{a} {b} {c}

11. Write the ordered pairs in the relation determined by the Hasse diagram on the set
A = {1, 2, 3, 4}
4

3
1 2
Ans: {(1,1), (2, 2), (3, 3), (4, 4), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)}

12. Determine the Hasse diagram of the relation on A = {1, 2, 3, 4, 5} whose matrix is shown:
1 1 1 1 1 5
0 1 1 1 1
 
0 0 1 1 1 4
 
0 0 0 1 1
0 0 0 0 1 3
Ans

1
Page 2 of 4
MA2101 Assignment 1 Unit-I

13. Determine the matrix of the partial order whose Hasse diagram is given

2 3 4 5

1
1 1 1 1 1
0 1 0 0 0 

Ans: 0 0 1 0 0
 
0 0 0 1 0
0 0 0 0 1 

14. Answer the following questions for the poset ({3,5,9,15, 24, 45}, ) where the
relation  is defined by a  b iff a | b :
(a) Find the maximal elements.
(b) Find the minimal elements.
(c) Is there any greatest element?
(d) Is there any least element?
(e) Find all the upper bounds of {3,5} .
(f) Find the least upper bound (supremum) of {3,5} , if it exists.
(g) Find all the lower bounds of {15, 45} .
(h) Find the greatest lower bound (infimum) of {15, 45} if it exists.

15. Answer the following questions for the poset represented by the given
Hasse diagram:
(a) Find the maximal elements.
(b) Find the minimal elements.
(c) Is there any greatest element?
(d) Is there any least element?
(e) Find all the upper bounds of {a, b, c} .
(f) Find the least upper bound (supremum) of
{a, b, c} , if it exists.
(g) Find all the lower bounds of {f , g, h} .
(h) Find the greatest lower bound (infimum)
of {f , g, h} if it exists.

16. Determine whether the posets represented by the following Hasse diagrams
are lattices:
Page 3 of 4
MA2101 Assignment 1 Unit-I

17. If ℤ+ is the set of positive integers and D denotes the relation of division in ℤ+ such that for
any a, b  ℤ+, aDb  a divides b, show that (ℤ+, D) is a lattice.

18. Show that in a lattice with universal lower bound 0 and universal upper bound 1, 0 is the
unique complement of 1 and 1 is the unique complement of 0.

19. Show that the idempotent laws follows from the absorption laws.

20. Show that for a, b  ℤ+


(i) max{a, min(a, b)} = a min{a, max(a, b)} = a
(ii) lcm{a, gcd(a, b)} = a; gcd{a, lcm(a, b)} = a.
21. Determine whether the posets represented by the following Hasse diagrams are lattices:

Page 4 of 4

You might also like