Assignment-2

Indranil Chakrabarty August 13, 2012

1) Suppose relation R on S is symmetric and transitive. Find whether it is reexive or not? Explain. 2) A binary relation, R, on a set, A, is irreexive i NOT(aRa) for all a A. Prove that if a binary relation on a set is transitive and irreexive, then it is strict partial order. 3) How many binary relations are there on the set {0, 1}? How many are there that are transitive?, . . . asymmetric?, . . . reexive?, . . . irreexive?, . . . 4) (out of the box) Prove that log4 9 is irrational. Your proof should be clear and well-organized, and should explicitly indicate where particular properties of primes are assumed. 5) If S has height hS and width wS , and T has height hT and width wT , what upper and lower bounds can you put on the height and width of S T ? Can you show that your upper and lower bounds are achieved by some choices of S and T ? 6) Lets take S = {1, 2, 3} as our underlying set and consider the poset (2S , ), that is, the poset consisting of the subsets of S under the partial order . Draw the Hasse diagram