Why is this Relation R (graph) not transitive?

Question

Let the arrow graph of R be the following:

If we get the ordered pairs we have that

R = { (a,a), (a,b), (a,c), (b,b), (b,a), (b,c), (c,a), (c,b), (d,d) }

If we analyze this:

*Reflexive - NOT TRUE. Because there aren't x = x for every ordered pair in the set

*Symmetric - TRUE. Because for every (x,y) there is a (y,x)

Question: Transitive?

My professor said that this was not transitive. I am wondering why.

With the pairs we can see that for every (x,y) -> (y,z) there is indeed a (x,z) pair.

Could you please tell me why this is NOT TRANSITIVE?

Thank you!

Answer 1

$R$ does not contain $(c,c)$ and this while $cRa\wedge aRc$. This contradicts that $R$ is transitive.

---

In general a relation $S$ is transitive if $uSv\wedge vSw$ implies that $uSw$.

Answer 2

Hint: Look at $(c,a)$ and $(a,c)$.

Answer 3

You say:

With the pairs we can see that for every $(x,y)\to (y,z)$ there is indeed a $(x,z)$ pair.

Are you sure? What about $c,a,b$?