Prove that if relation $SR$ is symmetric, then $SR = RS$.
$begingroup$
Let $R$ and $S$ be equivalence relations on set $A$.
Prove that if relation $SR$ is symmetric, then $SR = RS$.
$R$ and $S$ are equivalence relations on set $A$, so $Rsubseteq Atimes A$ and $Ssubseteq Atimes A$. In order to be equivalence relations, they need to meet these three conditions:
- be reflexive: $ain A : aRa$ (analogically for $S$)
- be symmetric: $a,bin A : aRb rightarrow bRa$
- be transitive: $a,b,cin A : (aRb wedge bRc)rightarrow aRc$
I do not really know where to start, I was thinking about it the following way:
Composition of relations $S$ and $R$ can be written as $SRsubseteq Atimes A$, as both relations are on set $A$. If relations $S$ and $R$
are equivalence relations, then their composition should also be an
equivalence relation.
but I am not sure whether it is correct and I also get stuck there. It is kind of problematic, as I need a formal proof to it.
elementary-set-theory
$endgroup$
add a comment |
$begingroup$
Let $R$ and $S$ be equivalence relations on set $A$.
Prove that if relation $SR$ is symmetric, then $SR = RS$.
$R$ and $S$ are equivalence relations on set $A$, so $Rsubseteq Atimes A$ and $Ssubseteq Atimes A$. In order to be equivalence relations, they need to meet these three conditions:
- be reflexive: $ain A : aRa$ (analogically for $S$)
- be symmetric: $a,bin A : aRb rightarrow bRa$
- be transitive: $a,b,cin A : (aRb wedge bRc)rightarrow aRc$
I do not really know where to start, I was thinking about it the following way:
Composition of relations $S$ and $R$ can be written as $SRsubseteq Atimes A$, as both relations are on set $A$. If relations $S$ and $R$
are equivalence relations, then their composition should also be an
equivalence relation.
but I am not sure whether it is correct and I also get stuck there. It is kind of problematic, as I need a formal proof to it.
elementary-set-theory
$endgroup$
$begingroup$
My gut instinct would be to use the definition of relation composition, suppose we have $(x,y) in SR$, and then work through the definition and use symmetry to show $(x,y) in RS$ (or, equivalently, $(y,x)$ - not sure which would be more convenient). That would imply the equivalence of the two relations since it would show all elements of $SR$ are shared by $RS$.
$endgroup$
– Eevee Trainer
Dec 13 '18 at 6:08
$begingroup$
How are you defining $SR$? What order of composition?
$endgroup$
– Andrew Li
Dec 13 '18 at 6:21
$begingroup$
If $Psubseteq Atimes B$ and $Qsubseteq Btimes C$, then $PQsubseteq Atimes C$.
$endgroup$
– whiskeyo
Dec 13 '18 at 6:35
add a comment |
$begingroup$
Let $R$ and $S$ be equivalence relations on set $A$.
Prove that if relation $SR$ is symmetric, then $SR = RS$.
$R$ and $S$ are equivalence relations on set $A$, so $Rsubseteq Atimes A$ and $Ssubseteq Atimes A$. In order to be equivalence relations, they need to meet these three conditions:
- be reflexive: $ain A : aRa$ (analogically for $S$)
- be symmetric: $a,bin A : aRb rightarrow bRa$
- be transitive: $a,b,cin A : (aRb wedge bRc)rightarrow aRc$
I do not really know where to start, I was thinking about it the following way:
Composition of relations $S$ and $R$ can be written as $SRsubseteq Atimes A$, as both relations are on set $A$. If relations $S$ and $R$
are equivalence relations, then their composition should also be an
equivalence relation.
but I am not sure whether it is correct and I also get stuck there. It is kind of problematic, as I need a formal proof to it.
elementary-set-theory
$endgroup$
Let $R$ and $S$ be equivalence relations on set $A$.
Prove that if relation $SR$ is symmetric, then $SR = RS$.
$R$ and $S$ are equivalence relations on set $A$, so $Rsubseteq Atimes A$ and $Ssubseteq Atimes A$. In order to be equivalence relations, they need to meet these three conditions:
- be reflexive: $ain A : aRa$ (analogically for $S$)
- be symmetric: $a,bin A : aRb rightarrow bRa$
- be transitive: $a,b,cin A : (aRb wedge bRc)rightarrow aRc$
I do not really know where to start, I was thinking about it the following way:
Composition of relations $S$ and $R$ can be written as $SRsubseteq Atimes A$, as both relations are on set $A$. If relations $S$ and $R$
are equivalence relations, then their composition should also be an
equivalence relation.
but I am not sure whether it is correct and I also get stuck there. It is kind of problematic, as I need a formal proof to it.
elementary-set-theory
elementary-set-theory
edited Dec 13 '18 at 6:15
whiskeyo
asked Dec 13 '18 at 5:47
whiskeyowhiskeyo
1368
1368
$begingroup$
My gut instinct would be to use the definition of relation composition, suppose we have $(x,y) in SR$, and then work through the definition and use symmetry to show $(x,y) in RS$ (or, equivalently, $(y,x)$ - not sure which would be more convenient). That would imply the equivalence of the two relations since it would show all elements of $SR$ are shared by $RS$.
$endgroup$
– Eevee Trainer
Dec 13 '18 at 6:08
$begingroup$
How are you defining $SR$? What order of composition?
$endgroup$
– Andrew Li
Dec 13 '18 at 6:21
$begingroup$
If $Psubseteq Atimes B$ and $Qsubseteq Btimes C$, then $PQsubseteq Atimes C$.
$endgroup$
– whiskeyo
Dec 13 '18 at 6:35
add a comment |
$begingroup$
My gut instinct would be to use the definition of relation composition, suppose we have $(x,y) in SR$, and then work through the definition and use symmetry to show $(x,y) in RS$ (or, equivalently, $(y,x)$ - not sure which would be more convenient). That would imply the equivalence of the two relations since it would show all elements of $SR$ are shared by $RS$.
$endgroup$
– Eevee Trainer
Dec 13 '18 at 6:08
$begingroup$
How are you defining $SR$? What order of composition?
$endgroup$
– Andrew Li
Dec 13 '18 at 6:21
$begingroup$
If $Psubseteq Atimes B$ and $Qsubseteq Btimes C$, then $PQsubseteq Atimes C$.
$endgroup$
– whiskeyo
Dec 13 '18 at 6:35
$begingroup$
My gut instinct would be to use the definition of relation composition, suppose we have $(x,y) in SR$, and then work through the definition and use symmetry to show $(x,y) in RS$ (or, equivalently, $(y,x)$ - not sure which would be more convenient). That would imply the equivalence of the two relations since it would show all elements of $SR$ are shared by $RS$.
$endgroup$
– Eevee Trainer
Dec 13 '18 at 6:08
$begingroup$
My gut instinct would be to use the definition of relation composition, suppose we have $(x,y) in SR$, and then work through the definition and use symmetry to show $(x,y) in RS$ (or, equivalently, $(y,x)$ - not sure which would be more convenient). That would imply the equivalence of the two relations since it would show all elements of $SR$ are shared by $RS$.
$endgroup$
– Eevee Trainer
Dec 13 '18 at 6:08
$begingroup$
How are you defining $SR$? What order of composition?
$endgroup$
– Andrew Li
Dec 13 '18 at 6:21
$begingroup$
How are you defining $SR$? What order of composition?
$endgroup$
– Andrew Li
Dec 13 '18 at 6:21
$begingroup$
If $Psubseteq Atimes B$ and $Qsubseteq Btimes C$, then $PQsubseteq Atimes C$.
$endgroup$
– whiskeyo
Dec 13 '18 at 6:35
$begingroup$
If $Psubseteq Atimes B$ and $Qsubseteq Btimes C$, then $PQsubseteq Atimes C$.
$endgroup$
– whiskeyo
Dec 13 '18 at 6:35
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
If $SR$ is symmetric then $xSRyiff ySRx$.
We have to show $xSRyiff xRSy$.
So it suffices to show $xRSyiff ySRx$.
So we need to show:
$exists z(xRzSy)iffexists z(ySzRx)$.
But both of $R$ and $S$ are symmetric, so we can use the same $z$ in both cases. $Box$
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3037648%2fprove-that-if-relation-sr-is-symmetric-then-sr-rs%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
If $SR$ is symmetric then $xSRyiff ySRx$.
We have to show $xSRyiff xRSy$.
So it suffices to show $xRSyiff ySRx$.
So we need to show:
$exists z(xRzSy)iffexists z(ySzRx)$.
But both of $R$ and $S$ are symmetric, so we can use the same $z$ in both cases. $Box$
$endgroup$
add a comment |
$begingroup$
If $SR$ is symmetric then $xSRyiff ySRx$.
We have to show $xSRyiff xRSy$.
So it suffices to show $xRSyiff ySRx$.
So we need to show:
$exists z(xRzSy)iffexists z(ySzRx)$.
But both of $R$ and $S$ are symmetric, so we can use the same $z$ in both cases. $Box$
$endgroup$
add a comment |
$begingroup$
If $SR$ is symmetric then $xSRyiff ySRx$.
We have to show $xSRyiff xRSy$.
So it suffices to show $xRSyiff ySRx$.
So we need to show:
$exists z(xRzSy)iffexists z(ySzRx)$.
But both of $R$ and $S$ are symmetric, so we can use the same $z$ in both cases. $Box$
$endgroup$
If $SR$ is symmetric then $xSRyiff ySRx$.
We have to show $xSRyiff xRSy$.
So it suffices to show $xRSyiff ySRx$.
So we need to show:
$exists z(xRzSy)iffexists z(ySzRx)$.
But both of $R$ and $S$ are symmetric, so we can use the same $z$ in both cases. $Box$
answered Dec 13 '18 at 6:24
Bjørn Kjos-HanssenBjørn Kjos-Hanssen
2,086918
2,086918
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3037648%2fprove-that-if-relation-sr-is-symmetric-then-sr-rs%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
My gut instinct would be to use the definition of relation composition, suppose we have $(x,y) in SR$, and then work through the definition and use symmetry to show $(x,y) in RS$ (or, equivalently, $(y,x)$ - not sure which would be more convenient). That would imply the equivalence of the two relations since it would show all elements of $SR$ are shared by $RS$.
$endgroup$
– Eevee Trainer
Dec 13 '18 at 6:08
$begingroup$
How are you defining $SR$? What order of composition?
$endgroup$
– Andrew Li
Dec 13 '18 at 6:21
$begingroup$
If $Psubseteq Atimes B$ and $Qsubseteq Btimes C$, then $PQsubseteq Atimes C$.
$endgroup$
– whiskeyo
Dec 13 '18 at 6:35