$rho$ antisym., irreflexive, $rho ^t$ its transitive closure. Prove or disprove: $rho ^t$ reflexive...
Let $rho$ be an antisymmetric, irreflexive relation, and $rho ^t$ its transitive closure.
Prove or disprove: $rho ^t$ is reflexive $Rightarrow$ $rho ^t$ is symmetric.
I tried to prove that $rho ^t$ is symmetric by proving that if $(x,y)in rho ^t$, than $(x,y)in rho ^t$, but whatever I do, I just can't prove that this is true.
Also, I tried to find an example for where the statement isn't true, but
whenever I try to make a relation that is antisymmetric and irreflexive and I find its transitive closure which is reflexive, I get that $rho ^t$ is symmetric which makes me think that the statement is correct.
Thanks in advance!
relations
add a comment |
Let $rho$ be an antisymmetric, irreflexive relation, and $rho ^t$ its transitive closure.
Prove or disprove: $rho ^t$ is reflexive $Rightarrow$ $rho ^t$ is symmetric.
I tried to prove that $rho ^t$ is symmetric by proving that if $(x,y)in rho ^t$, than $(x,y)in rho ^t$, but whatever I do, I just can't prove that this is true.
Also, I tried to find an example for where the statement isn't true, but
whenever I try to make a relation that is antisymmetric and irreflexive and I find its transitive closure which is reflexive, I get that $rho ^t$ is symmetric which makes me think that the statement is correct.
Thanks in advance!
relations
add a comment |
Let $rho$ be an antisymmetric, irreflexive relation, and $rho ^t$ its transitive closure.
Prove or disprove: $rho ^t$ is reflexive $Rightarrow$ $rho ^t$ is symmetric.
I tried to prove that $rho ^t$ is symmetric by proving that if $(x,y)in rho ^t$, than $(x,y)in rho ^t$, but whatever I do, I just can't prove that this is true.
Also, I tried to find an example for where the statement isn't true, but
whenever I try to make a relation that is antisymmetric and irreflexive and I find its transitive closure which is reflexive, I get that $rho ^t$ is symmetric which makes me think that the statement is correct.
Thanks in advance!
relations
Let $rho$ be an antisymmetric, irreflexive relation, and $rho ^t$ its transitive closure.
Prove or disprove: $rho ^t$ is reflexive $Rightarrow$ $rho ^t$ is symmetric.
I tried to prove that $rho ^t$ is symmetric by proving that if $(x,y)in rho ^t$, than $(x,y)in rho ^t$, but whatever I do, I just can't prove that this is true.
Also, I tried to find an example for where the statement isn't true, but
whenever I try to make a relation that is antisymmetric and irreflexive and I find its transitive closure which is reflexive, I get that $rho ^t$ is symmetric which makes me think that the statement is correct.
Thanks in advance!
relations
relations
edited Nov 22 '18 at 10:55
Asaf Karagila♦
302k32427757
302k32427757
asked Nov 21 '18 at 22:59
mathbbandstuffmathbbandstuff
278111
278111
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
The statement is false. Here is a counterexample : take two disjoint length-three cycles $x_1 rho x_2 rho x_3 rho x_1$ and $y_1 rho y_2 rho y_3 rho y_1$, and add just one more edge $x_1 rho y_1$.
The resulting $rho^t$ is reflexive (because every element is in some cycle) but not symmetric (look at what happens on $x_1$ and $y_1$).
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%2f3008500%2frho-antisym-irreflexive-rho-t-its-transitive-closure-prove-or-disprov%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
The statement is false. Here is a counterexample : take two disjoint length-three cycles $x_1 rho x_2 rho x_3 rho x_1$ and $y_1 rho y_2 rho y_3 rho y_1$, and add just one more edge $x_1 rho y_1$.
The resulting $rho^t$ is reflexive (because every element is in some cycle) but not symmetric (look at what happens on $x_1$ and $y_1$).
add a comment |
The statement is false. Here is a counterexample : take two disjoint length-three cycles $x_1 rho x_2 rho x_3 rho x_1$ and $y_1 rho y_2 rho y_3 rho y_1$, and add just one more edge $x_1 rho y_1$.
The resulting $rho^t$ is reflexive (because every element is in some cycle) but not symmetric (look at what happens on $x_1$ and $y_1$).
add a comment |
The statement is false. Here is a counterexample : take two disjoint length-three cycles $x_1 rho x_2 rho x_3 rho x_1$ and $y_1 rho y_2 rho y_3 rho y_1$, and add just one more edge $x_1 rho y_1$.
The resulting $rho^t$ is reflexive (because every element is in some cycle) but not symmetric (look at what happens on $x_1$ and $y_1$).
The statement is false. Here is a counterexample : take two disjoint length-three cycles $x_1 rho x_2 rho x_3 rho x_1$ and $y_1 rho y_2 rho y_3 rho y_1$, and add just one more edge $x_1 rho y_1$.
The resulting $rho^t$ is reflexive (because every element is in some cycle) but not symmetric (look at what happens on $x_1$ and $y_1$).
answered Nov 22 '18 at 11:06
Ewan DelanoyEwan Delanoy
41.4k442104
41.4k442104
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3008500%2frho-antisym-irreflexive-rho-t-its-transitive-closure-prove-or-disprov%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