Is SR an Equivalence Relation When SR=RS?

Click For Summary

Homework Help Overview

The discussion revolves around proving that the composition of two equivalence relations, R and S, results in another equivalence relation when the condition SR = RS is met. The subject area is primarily focused on relations in set theory and properties of equivalence relations.

Discussion Character

  • Conceptual clarification, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • The original poster attempts to clarify the definitions and implications of the notation SR and RS, questioning how to properly define these compositions. Some participants suggest that the original poster should not use specific sets for the relations, emphasizing the need for a general proof instead.

Discussion Status

Participants are exploring the definitions and properties of equivalence relations, with some providing guidance on the necessary properties (reflexive, symmetric, transitive) that need to be shown for the composition to be an equivalence relation. There is an ongoing clarification about the notation and the implications of SR = RS.

Contextual Notes

There is a noted lack of clarity regarding the notation used for the relations and the definitions provided in the textbook. Participants are questioning the assumptions made about the relations and their compositions.

estra
Messages
11
Reaction score
0

Homework Statement



Prove that when R and S are equivalence relations, then SR is
equivalance relation when SR=RS.

Homework Equations





The Attempt at a Solution



I want to know what sets should i take for the relations ?
is it ok when i take R a a subset of X x Y and S as a subset of Y
and Z or should i take it some other way?
then SR is a subset of X x Z ? am i moving right?

also when tring to solve this problem I found that x has to be equal
to y when SR = RS..


Thank you!
 
Physics news on Phys.org
You shouldn't take any sets for the relation! an "example" is not a proof and if you choose any specific set, you have only an example. It makes no sense to say "R a a subset of X x Y and S as a subset of Y and Z" when a "relation" has to be a subset of some X x X.

A relation is, by definition, a subset of XxX (where X is any set) such that

1) (x,x) is in the subset (reflexive property)
2) If (x, y) is in the subset then so is (y,x) (symmetric property)
3) If (x, y) and (y, z) are in the subset then so is (x, z) (transitive property)

You are given that R and S are subsets of X x X for some set X and you want to perove that SR is also when SR= RS. It would help a lot if you would first say what "RS" and "SR" mean when S and R are subsets of X x X.
 
But who do you what "RS" and "SR" mean when S and R are subsets of X x X

I can only think that way
S ∘ R = { (x, z) | there exists y ∈ Y, such that (x, y) ∈ R and (y, z) ∈ S }.
 
YOU were the one who used the notation "SR= RS"! I have no idea what you mean by it. In your second line, you appear to have used a character that does not show up on my reader. Please define "SR" and "RS".
 
ok sorry about that.
Lets say it again.

Prove that, when S and R are equivalence relations in the set X, then RS is an equivalence relation in the set X when SR=RS.

I think that on the second part we have to show that the composition of equivalence relations is commutative.. (when for any two equivalence relations S and R on an object X there is a equality SR=RS..)
But I'm not sure how to define SR and RS.

Sorry about the mess..

Thank you again
 
If you don't know what it means, how can you expect to do any proofs about it? I do not recognize the notation myself: check your textbook.
 
well that is how it is asked in my textbook. and i was told to prove that. there is no more information about that there...
 
you finally used the phrase "composition of equivalence relations". Where did you get that?

Are you saying that if xRy and ySz, then xRSz? In other words, if (x,y) is in the relation R and (y,z) is in the relation S then (x, z) is in the relation RS.

To prove something is a relation, you have to show the three properties hold:
1) reflexive. If x is in X, then xRx and xSx because they are reflexive. Does that show that xRSx?

2) symmetric. If (x,y) is in R, then (y,x) is also. If (x,y) is in S, then (y,x) is also. You need to use that (and RS= SR) to show that "if (x,y) is in RS, the (y,x) is also".

3) transitive. If (x,y) and (y,z) are both in R, then so is (x,z). If (x,y) and (y,z) are both in S, then so is (x, z). You need to use that to show "if (x,y) and (y,z) are both in RS, then (x,z) is also".
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 7 ·
Replies
7
Views
1K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
1
Views
1K
Replies
20
Views
4K
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K