Math Help - some statements on composition of relations

For two binary relations R, S on a set X, we define their composition:



I have proven two statements on this and am not sure about the third one. They're related so I'll post them all.

1. If R and S are commuting transitive relations on X, then their composition is also transitive.

Proof. Let and for some Then there exist such that



Then we have and since we also have . There must therefore exist such that



But then, from the transitivity of R and S, we get



which means that

2. If R, S are preorders and their composition is transitive, then they must commute.

Proof. Let and Then there is such that



Let's take



Then, since R and S are reflexive, we have



(as we had in the previous proof). Therefore and and by transitivity But and so we are done.

3. If If R, S are transitive and their composition is transitive, then they must commute.

I believe this one is false, because the above argument fails to work for it, but that's no proof. I can't think of a way of refuting this statement other than by looking at random examples and hoping for the best. Could you suggest something more systematic? I would also find it very kind if someone would tell me about any embarrassing mistakes I made in my proofs.

Originally Posted by ymar

For two binary relations R, S on a set X, we define their composition:

Are you very sure that you given the same definition as you text/author?
There a few authors who do use that definition.

However, most use the following:

i.e. reading right to left as in function composition.

Originally Posted by Plato

Are you very sure that you given the same definition as you text/author?
There a few authors who do use that definition.

However, most use the following:

i.e. reading right to left as in function composition.

These statements aren't from any book. It's what I've been thinking about. Yes, definitions vary but my knowledge of the concept comes from semigroup theory where my definition prevails (together with writing xf instead of f(x)).

as far as i can see, your proofs for 1) and 2) are correct, but i see no reason to introduce "a" and "c" in the proof for 2).

by the reflexiveness of R and S, you have xRx and ySy, and so xRSb and bRSy, thus xRSy.

i am undecided about 3.

Originally Posted by Deveno

as far as i can see, your proofs for 1) and 2) are correct, but i see no reason to introduce "a" and "c" in the proof for 2).

by the reflexiveness of R and S, you have xRx and ySy, and so xRSb and bRSy, thus xRSy.

i am undecided about 3.

You're right. I introduced them only to show how the second proof is similar to the first. This is how I came up with it -- by "inverting" (please don't make me think what I mean by this) the first one.