![Slide52.JPG](https://d1avenlh0i1xmr.cloudfront.net/f1d0cc48-998c-42a7-866f-dd2d5241db62/slide52.jpg)
![Slide53.JPG](https://d1avenlh0i1xmr.cloudfront.net/cdf84e3e-a9ed-4d94-8f0c-c88ba232324b/slide53.jpg)
![Slide54.JPG](https://d1avenlh0i1xmr.cloudfront.net/48d864ac-f4ce-47b7-9e24-a11fe659a984/slide54.jpg)
Examples
Last updated at April 16, 2024 by Teachoo
Example 19 Let R be a relation on the set A of ordered pairs of positive integers defined by (x, y) R (u, v) if and only if xv = yu. Show that R is an equivalence relation. If (x, y) R (u, v) , then xv = yu Check Reflexive If (x, y) R (x, y), then xy = yx Since, xy = yx Hence , R is reflexive. Check symmetric If (x, y) R (u, v) , then xv = yu Now, If (u, v) R (x, y) , then uy = vx Since, xv = yu, vx = uy ∴ uy = vx So, if (x, y) R (u, v) , then (u, v) R (x, y) So, R is symmetric. If (x, y) R (u, v) , then xv = yu If (u, v) R (a, b) , then ub = va u = 𝑣𝑎/𝑏 We need to prove that (x, y) R (a, b) , i.e. xb = ya Check transitive Putting (2) in (1) xv = yu xv = y(𝑣𝑎/𝑏) xvb = yva xb = ya Hence (x, y) R (a, b) So, if (x, y) R (u, v) & (u, v) R (a, b) , then (x, y) R (a, b) Thus R is transitive. Thus, R is an equivalence relation.