Question #234561
Let X = {1,2,3,4,5,6,7} and R = {x,y/x–y is divisible by 3} in x. Show that R is an equivalence relation.
b) Let A = {1,2,3,4} and let R = {(1,1), (1,2),(2,1),(2,2),(3,4),(4,3), (3,3), (4,4)} be an equivalence relation on R. Determine A/R.
c) Draw the Hasse diagram of lattices, (L1,<) and (L2,<) where L1 = {1, 2, 3, 4, 6, 12} and
L2 = {2, 3, 6, 12, 24} and a < b if and only if a divides b.
1
Expert's answer
2021-09-13T17:20:21-0400

a) Let X={1,2,3,4,5,6,7}X = \{1,2,3,4,5,6,7\} and R={(x,y)xy is divisible by 3}R = \{(x,y)|x-y\text{ is divisible by }3\} in XX. Let us show that RR is an equivalence relation. Since xx=0x-x=0 is divisible by 3 for any xXx\in X, we conclude that (x,x)R(x,x)\in R for any xXx\in X, and hence RR is a reflexive relation. If x,yXx,y\in X and (x,y)R,(x,y)\in R, then xyx-y is divisible by 3. It follows that yx=(xy)y-x=-(x-y) is also divisible by 3, and hence (y,x)R.(y,x)\in R.

We conclude that the relation RR is symmetric. If x,y,zXx,y,z\in X and (x,y)R, (y,z)R,(x,y)\in R,\ (y,z)\in R, then xyx-y is divisible by 3 and yzy-z is divisible by 3. It follows that xz=(xy)+(yz)x-z=(x-y)+(y-z) is also divisible by 3, and hence (x,z)R.(x,z)\in R. We conclude that the relation RR is transitive. Consequently, RR is an equivalence relation.


b) Let A={1,2,3,4}A = \{1,2,3,4\} and let R={(1,1),(1,2),(2,1),(2,2),(3,4),(4,3),(3,3),(4,4)}R = \{(1,1), (1,2),(2,1),(2,2),(3,4),(4,3), (3,3), (4,4)\} be an equivalence relation on RR. Let us determine A/RA/R. Taking into account that [a]={xA  (x,a)R}[a]=\{x\in A\ |\ (x,a)\in R\} and hence [1]={1,2}=[2], [3]={3,4}=[4],[1]=\{1,2\}=[2],\ [3]=\{3,4\}=[4], we conclude that A/R={[a]  aA}={[1],[3]}.A/R=\{[a]\ |\ a\in A\}=\{[1],[3]\}.


c) Let us draw the Hasse diagram of lattices, (L1,<)(L_1,<) and (L2,<)(L_2,<) where L1={1,2,3,4,6,12}L_1 = \{1, 2, 3, 4, 6, 12\} and L2={2,3,6,12,24}L_2 = \{2, 3, 6, 12, 24\} 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 x<yx<y  in the poset, then the point corresponding to xx appears lower in the drawing than the point corresponding to yy.

2. The line segment between the points corresponding to any two elements  xx and  yy of the poset is included in the drawing iff  xx covers yy  or  yy  covers xx.


In our case, x<yx<y if and only if xy.x|y. Therefore, the Hasse diagrams are the following:











Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

Reddy mounika
08.09.21, 06:29

Please upload Answers

LATEST TUTORIALS
APPROVED BY CLIENTS