In'dian Institute tof Technology

.. Sp:fi:iig Mid Semeste1: Examination-2012

. Subject Name: Mathm:natics .
/ Subject No: MA20013
No. of students: 57 Time: 2 hrs F.M. 30
Instructions: Answer ALL questions. The questions are of equal marks.
0 1
o. 1
(1) Let MR =
1 0 1 1
be the matrix of a relation R. Whether R reflex-
0 1 0 0
1 1 0 0
ive, irreflexive, symmetric, antisymmetric, asymmetric or transitive? Justify your .
answer.
(2) If Rand S are relations on a. set A then prove that (R n S)Z R
2
U S
2

' '
(3) LetS= {(x,y) E lR x lR: 0::;; x::;; 1,0::;; y::;; 1}. Define a relation Ron S by
(a, b) R (c, d) if and only if (i) (a, b) = (c, d) ot (ii) b ::._ d, a = 0 and c = 1 or
(iii} b = d, a = 1 and c = 0. Show that R is an equivalence relation on S and then
find the equivalence classes of (0.5, 0) and (0, 0.06).
(4) Let X = {1, 2, 3, 4} and S be the powerset of X. For the poset (S, (i) find
different chains of maximal length and ( ii) fiqd two different anti-chains of
maximal size.
(5) {2, 3, 6, 12, 18, 24} and R be the divisibility relation on A. Then (i) Draw
the digraph of (A, R) {ii) Draw the Hasse diagram of (A, R) (iii) Find all maximal
and minimal ele;mimts in (A, R).
(6) Prove' that in a bounded distributive lattice, the elements wh.ich have complement's
form a subla,ttice.
(7) State and prove the absorption property of the join and meet.operation in a lattice.
P.T.O
1
(8) Let R be a relation on a setS. Prove that (x,y) ERn if and only if there is a walk
of length n from x to y in the, digraph of R.
(9) Prov:e that any two equivalence classes of an equivalence relation are either iden-
tical or totally disjoint.
(10) Writ
1
e Warshall's algorithm and apply this to find the transitive closure of the
relation R = {(a, b), (b, a), (b, c), (c, d)} on S = {a, b, c, d}.
*****************THE END*****.***********
2