a) Let and in . Let us show that is an equivalence relation. Since is divisible by 3 for any , we conclude that for any , and hence is a reflexive relation. If and then is divisible by 3. It follows that is also divisible by 3, and hence
We conclude that the relation is symmetric. If and then is divisible by 3 and is divisible by 3. It follows that is also divisible by 3, and hence We conclude that the relation is transitive. Consequently, is an equivalence relation.
b) Let and let be an equivalence relation on . Let us determine . Taking into account that and hence we conclude that
c) Let us draw the Hasse diagram of lattices, and where and and a < b if and only if a divides b.
Note that a Hasse diagram is a graphical rendering of a partially ordered set displayed via the cover relation of the partially ordered set with an implied upward orientation. A point is drawn for each element of the poset, and line segments are drawn between these points according to the following two rules:
1. If in the poset, then the point corresponding to appears lower in the drawing than the point corresponding to .
2. The line segment between the points corresponding to any two elements and of the poset is included in the drawing iff covers or covers .
In our case, if and only if Therefore, the Hasse diagrams are the following:
Comments
Please upload Answers