Maths I Problem Set 1

These problems are given for practice and short tests from this will be taken
in the coming week tutorials starting on Monday, 31-08-2015

1.

A relation which is irreexive and transitive is antisymmetric and strict partial order.
Prove or disprove:

2. Let R and S be two equivalence relations on a non empty set A. Prove

or disprove: (a) R S is an quivalence relation on A. (b) R S is an
equivalence relation on A.
3. Give an example of a relation which is none of the following (a) reexive
(b) symmetric (c) antisymmetric (d) transitive. Justify your answer.
4. Give an example of three sets W, X and Y such that W X and X Y
but W / Y .
5. State and explain Russell's

Paradox

6. Let A be a set with |A| = n, and let R be an equivalence relation on A

with |R| = r. Why is r n always even?
7. For points (a, b), (c, d) R2 dene (a, b)R(c, d) to mean that a2 + b2 =
c2 + d2 . (a) Prove that R is an equivalence relation on R2 . (b) List all
elements in the set {(x, y) R2 |(x, y)R(0, 0)}. (c) List equivalence classes.
8. A relation R is said to be a circular relation if aRb and bRc implies that
cRa. Prove or disprove that R is reexive and circular i it is an equivalence relation.
9. Show that every nite poset can be partitioned into k chains where k is
the largest number of elements in an antichain in the poset.
10. How many relations are there on a set with n elements that are (a) Symmteric (b) Antisymmetric (c) Asymmetric (d) Irreexive (e) Reexive and
Symmetric.
11. Show that if x and y are elemnts of a lattice L, then x y = y i x y = x.
12.

I: Let R be the set of all real numbers and R is a relation on R

given by aRb if f a b Q (set of all rational numbers).
II: A = {1, 3, 5, 30, 45, 60} and aRb if f a divides b.
Given:

III: P =Power set of {a, b, c, d}. for any A, B P ARB if f A B .

For each of the above relations prove or disprove R is:
(a) symmetric, antisymmetric, reexive and transitive
(b) an equivalence relation, if so then list the equivalence classes.
(c) a Poset, if so then specify the maximal, minimal, greatest and least
elements
(d) a Total order set
(e) a Lattice
(f) a Distributed Lattice.
(g) Draw Hasse diagram, for which it is possible and then nd the totally
ordered relation using topological sorting