Knowee
Questions
Features
Study Tools

Let R and S be relations on {a, b, c, d}, whereR = {(a, b), (a, d), (b, c), (c, c), (d, a)}andS = {(a, c), (b, d), (d, a)}.Then,| R o S | + | (S o R)^(-1) | =

Question

Let R and S be relations on {a, b, c, d}, where

R = {(a, b), (a, d), (b, c), (c, c), (d, a)}
and
S = {(a, c), (b, d), (d, a)}.
Then,
| R o S | + | (S o R)^(-1) | =

🧐 Not the exact question you are looking for?Go ask a question

Solution

First, let's understand the operations involved in the question.

  1. RoS (R composition S) is a relation from S to R such that for any elements x, y, z, if (x, y) is in S and (y, z) is in R, then (x, z) is in RoS.

  2. (SoR)^-1 is the inverse of the relation SoR. If (x, y) is in SoR, then (y, x) is in (SoR)^-1.

Now, let's calculate RoS and (SoR)^-1.

RoS = {(x, z) | there exists a y such that (x, y) is in S and (y, z) is in R} = {(a, b), (a, d), (b, c), (d, a)}

|RoS| = 4

SoR = {(x, z) | there exists a y such that (x, y) is in R and (y, z) is in S} = {(b, d), (d, c), (a, a)}

(SoR)^-1 = {(d, b), (c, d), (a, a)}

|(SoR)^-1| = 3

Therefore, |RoS| + |(SoR)^-1| = 4 + 3 = 7.

This problem has been solved

Similar Questions

We consider the relation 𝑅={(𝑎,𝑎),(𝑎,𝑏),(𝑎,𝑐),(𝑎,𝑑),(𝑎,𝑒),(𝑏,𝑐),(𝑏,𝑒),(𝑑,𝑎),(𝑒,𝑐)}.Is 𝑅 transitive? Justify briefly

Let A = {4,5,6} , B = {a,y,c,w}and R = {(4,c), (4,y), (5,a),(5,c), (5,w)} is a relation from A to B.Then we can write :

The set R = {(a, l), (2, b), (c,3)} is a relation from A = {a, b, c, d} to B = {1, 2, 3}. Group startsTrue or FalseTrue, unselectedFalse, unselected

Consider a relation R=(M, N, O, P, Q) with the dependencies: {M,N ->O; O,P->Q ; P, Q-> N}. The key for relation R is :a.M, N, Ob.M, N, Pc.N, O, Pd.M, N

A={1,2,3,4}, THEN R={(1,2),(1,3),(3,3),(3,1)} IS A __________ ans. NON SYMMETRIC RELATION ANTI SYMMETRIC RELATION REFLEXIVE RELATION TRANSITIVE RELATION

1/1

Upgrade your grade with Knowee

Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.