Proof that $ 1_A cup s cdot s cdot s $ is equivalence relation
$begingroup$
I have problem with this task:
Proof that $$ 1_A cup s cdot s cdot s $$ is equivalence relation
where $r subset A times A$ and $r$ is a relation such that
$$ forall_{x,y,z} r(x,y) wedge r(x,z) rightarrow r(y,z) $$ and
$$ s = r cup r^{-1} $$
Reflexivity results directly from the definition and symmetry results from the symmetry of the relationship $s$. This part was not difficult for me, but I am trying to show that this relation is transitive and I have no idea how to show that...
proof-writing relations equivalence-relations
$endgroup$
add a comment |
$begingroup$
I have problem with this task:
Proof that $$ 1_A cup s cdot s cdot s $$ is equivalence relation
where $r subset A times A$ and $r$ is a relation such that
$$ forall_{x,y,z} r(x,y) wedge r(x,z) rightarrow r(y,z) $$ and
$$ s = r cup r^{-1} $$
Reflexivity results directly from the definition and symmetry results from the symmetry of the relationship $s$. This part was not difficult for me, but I am trying to show that this relation is transitive and I have no idea how to show that...
proof-writing relations equivalence-relations
$endgroup$
$begingroup$
What is maneuverability?
$endgroup$
– William Elliot
Jan 20 at 0:10
$begingroup$
reflexivity @WilliamElliot
$endgroup$
– VirtualUser
Jan 20 at 0:38
add a comment |
$begingroup$
I have problem with this task:
Proof that $$ 1_A cup s cdot s cdot s $$ is equivalence relation
where $r subset A times A$ and $r$ is a relation such that
$$ forall_{x,y,z} r(x,y) wedge r(x,z) rightarrow r(y,z) $$ and
$$ s = r cup r^{-1} $$
Reflexivity results directly from the definition and symmetry results from the symmetry of the relationship $s$. This part was not difficult for me, but I am trying to show that this relation is transitive and I have no idea how to show that...
proof-writing relations equivalence-relations
$endgroup$
I have problem with this task:
Proof that $$ 1_A cup s cdot s cdot s $$ is equivalence relation
where $r subset A times A$ and $r$ is a relation such that
$$ forall_{x,y,z} r(x,y) wedge r(x,z) rightarrow r(y,z) $$ and
$$ s = r cup r^{-1} $$
Reflexivity results directly from the definition and symmetry results from the symmetry of the relationship $s$. This part was not difficult for me, but I am trying to show that this relation is transitive and I have no idea how to show that...
proof-writing relations equivalence-relations
proof-writing relations equivalence-relations
edited Jan 21 at 22:32
VirtualUser
asked Jan 19 at 19:01
VirtualUserVirtualUser
865114
865114
$begingroup$
What is maneuverability?
$endgroup$
– William Elliot
Jan 20 at 0:10
$begingroup$
reflexivity @WilliamElliot
$endgroup$
– VirtualUser
Jan 20 at 0:38
add a comment |
$begingroup$
What is maneuverability?
$endgroup$
– William Elliot
Jan 20 at 0:10
$begingroup$
reflexivity @WilliamElliot
$endgroup$
– VirtualUser
Jan 20 at 0:38
$begingroup$
What is maneuverability?
$endgroup$
– William Elliot
Jan 20 at 0:10
$begingroup$
What is maneuverability?
$endgroup$
– William Elliot
Jan 20 at 0:10
$begingroup$
reflexivity @WilliamElliot
$endgroup$
– VirtualUser
Jan 20 at 0:38
$begingroup$
reflexivity @WilliamElliot
$endgroup$
– VirtualUser
Jan 20 at 0:38
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Let R be a reflexive, symmetrical relation with six elements in a chain: xRa, aRb, bRz, zRc, cRd, dRz.
Thus R = S and $1_A$ $cup$ S•S•S is not transitive
where A = { x,a,b,y,c,d,z }
$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%2f3079691%2fproof-that-1-a-cup-s-cdot-s-cdot-s-is-equivalence-relation%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$
Let R be a reflexive, symmetrical relation with six elements in a chain: xRa, aRb, bRz, zRc, cRd, dRz.
Thus R = S and $1_A$ $cup$ S•S•S is not transitive
where A = { x,a,b,y,c,d,z }
$endgroup$
add a comment |
$begingroup$
Let R be a reflexive, symmetrical relation with six elements in a chain: xRa, aRb, bRz, zRc, cRd, dRz.
Thus R = S and $1_A$ $cup$ S•S•S is not transitive
where A = { x,a,b,y,c,d,z }
$endgroup$
add a comment |
$begingroup$
Let R be a reflexive, symmetrical relation with six elements in a chain: xRa, aRb, bRz, zRc, cRd, dRz.
Thus R = S and $1_A$ $cup$ S•S•S is not transitive
where A = { x,a,b,y,c,d,z }
$endgroup$
Let R be a reflexive, symmetrical relation with six elements in a chain: xRa, aRb, bRz, zRc, cRd, dRz.
Thus R = S and $1_A$ $cup$ S•S•S is not transitive
where A = { x,a,b,y,c,d,z }
edited Jan 23 at 22:42
answered Jan 22 at 22:21
William ElliotWilliam Elliot
8,1622720
8,1622720
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%2f3079691%2fproof-that-1-a-cup-s-cdot-s-cdot-s-is-equivalence-relation%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$
What is maneuverability?
$endgroup$
– William Elliot
Jan 20 at 0:10
$begingroup$
reflexivity @WilliamElliot
$endgroup$
– VirtualUser
Jan 20 at 0:38