Transitive Relations: Special caseVery Simple RelationsTransitive Relations on a setWhy is $(1,2),(3,4)$ a transitive relation?How can you elegantly show that the relation is transitive?Partial Order relation conditions (transitive)Are mathematical relations intrinsically transitive?How to find the greatest and minimal element in the set of all transitive relations over $1,2,3,4$?Definition of a transitive relation.
How accurate is the new appraisal system?
I see your BIDMAS and raise you a BADMIS
Is there any detail about ambulances in Star Wars?
Is there a basic list of ways in which a low-level Rogue can get advantage for sneak attack?
Guitar beginner - What does this card show?
How do I always enable compiler warnings?
Should I use my toaster oven for slow roasting?
What are the advantages and disadvantages of Preprints.org compared with arXiv?
Calculate time difference between two dates
Random point on a sphere
Why does F + F' = 1?
Expected value until a success?
Is there a standard terminology for female equivalents of terms such as 'Kingdom' and if so, what are the most common terms?
How can I fix a framing mistake so I can drywall?
Why is the the worst case for this function O(n^2)?
Are Democrats more likely to believe Astrology is a science?
Can a magnet rip protons from a nucleus?
Wrathful Smite, and the term 'Creature'
Was Robin Hood's point of view ethically sound?
RP Automatic Updates
Is English tonal for some words, like "permit"?
Character theory and Quantum Chemistry
How can "life" insurance prevent the cheapening of death?
What is the use of FullForm in Mathematica?
Transitive Relations: Special case
Very Simple RelationsTransitive Relations on a setWhy is $(1,2),(3,4)$ a transitive relation?How can you elegantly show that the relation is transitive?Partial Order relation conditions (transitive)Are mathematical relations intrinsically transitive?How to find the greatest and minimal element in the set of all transitive relations over $1,2,3,4$?Definition of a transitive relation.
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
Suppose I have a set $A = 1,2,3,4$ and I define a relation $R$ on $A$ as $R = (1,2),(3,4)$. Is this relation transitive or not?
My book says a relation is transitive if $(x,y) in R$ and $(y,z) in R$ implies $(x,z) in R$ for all $x,y,z in R$. I cannot conclude what that means for the example above.
So is a relation called transitive or not when there are no ordered pairs like $(x,y),(y,z)$ that belong to $R$?
discrete-mathematics elementary-set-theory relations
$endgroup$
add a comment |
$begingroup$
Suppose I have a set $A = 1,2,3,4$ and I define a relation $R$ on $A$ as $R = (1,2),(3,4)$. Is this relation transitive or not?
My book says a relation is transitive if $(x,y) in R$ and $(y,z) in R$ implies $(x,z) in R$ for all $x,y,z in R$. I cannot conclude what that means for the example above.
So is a relation called transitive or not when there are no ordered pairs like $(x,y),(y,z)$ that belong to $R$?
discrete-mathematics elementary-set-theory relations
$endgroup$
$begingroup$
It is transitive.
$endgroup$
– Berci
8 hours ago
add a comment |
$begingroup$
Suppose I have a set $A = 1,2,3,4$ and I define a relation $R$ on $A$ as $R = (1,2),(3,4)$. Is this relation transitive or not?
My book says a relation is transitive if $(x,y) in R$ and $(y,z) in R$ implies $(x,z) in R$ for all $x,y,z in R$. I cannot conclude what that means for the example above.
So is a relation called transitive or not when there are no ordered pairs like $(x,y),(y,z)$ that belong to $R$?
discrete-mathematics elementary-set-theory relations
$endgroup$
Suppose I have a set $A = 1,2,3,4$ and I define a relation $R$ on $A$ as $R = (1,2),(3,4)$. Is this relation transitive or not?
My book says a relation is transitive if $(x,y) in R$ and $(y,z) in R$ implies $(x,z) in R$ for all $x,y,z in R$. I cannot conclude what that means for the example above.
So is a relation called transitive or not when there are no ordered pairs like $(x,y),(y,z)$ that belong to $R$?
discrete-mathematics elementary-set-theory relations
discrete-mathematics elementary-set-theory relations
edited 7 hours ago
Taroccoesbrocco
7,2198 gold badges18 silver badges43 bronze badges
7,2198 gold badges18 silver badges43 bronze badges
asked 8 hours ago
Ram KeswaniRam Keswani
5135 silver badges16 bronze badges
5135 silver badges16 bronze badges
$begingroup$
It is transitive.
$endgroup$
– Berci
8 hours ago
add a comment |
$begingroup$
It is transitive.
$endgroup$
– Berci
8 hours ago
$begingroup$
It is transitive.
$endgroup$
– Berci
8 hours ago
$begingroup$
It is transitive.
$endgroup$
– Berci
8 hours ago
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Sure, the binary relation $R = (1,2), (3,4)$ on the set $A = 1,2,3,4$ is transitive.
Indeed, the transitive property is vacuously true for the relation $R$: since there are no $x,y,z$ in $A$ such that $(x,y) in R$ and $(y,z) in R$, there is nothing to check.
$endgroup$
add a comment |
$begingroup$
Yes, your relation is indeed transitive. The nonexistence of any triples $x,y,z$ such that $(x,y),(y,z)$ are both in your relation does not matter. Being transitive merely says that if such a triple existed then you must also have $(x,z)$ in the relation.
Reworded, a relation is transitive iff for any "directed path" (if they even exist in the first place) you can take from one element to another you can also get there by using a single step instead. Since all of your directed paths are of length $1$ anyways, there is nothing more to check.
$endgroup$
add a comment |
$begingroup$
Or one can determine the truth value of the proposition : $forall x,y,z in X : ( x rmR y land yrmR z )$ $implies$ $xrmRz $.
Let P= $( x rmR y land yrmR z )$ , Q= $xrmRz$
Suppose we have $ xrmRy$, so its value is true, the truth value of $ yrmRz$ is always false. So the truth value of $P$ is false, based on the truth value table of $land$.
On the other hand, the truth value of $Q$ is false, so the truth value of $Pimplies Q$ will be true, based on the truth value of $ implies$.It means the definition holds, so the transitive property of the relation is satisfied.
$endgroup$
add a comment |
Your Answer
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/4.0/"u003ecc by-sa 4.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%2f3349764%2ftransitive-relations-special-case%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Sure, the binary relation $R = (1,2), (3,4)$ on the set $A = 1,2,3,4$ is transitive.
Indeed, the transitive property is vacuously true for the relation $R$: since there are no $x,y,z$ in $A$ such that $(x,y) in R$ and $(y,z) in R$, there is nothing to check.
$endgroup$
add a comment |
$begingroup$
Sure, the binary relation $R = (1,2), (3,4)$ on the set $A = 1,2,3,4$ is transitive.
Indeed, the transitive property is vacuously true for the relation $R$: since there are no $x,y,z$ in $A$ such that $(x,y) in R$ and $(y,z) in R$, there is nothing to check.
$endgroup$
add a comment |
$begingroup$
Sure, the binary relation $R = (1,2), (3,4)$ on the set $A = 1,2,3,4$ is transitive.
Indeed, the transitive property is vacuously true for the relation $R$: since there are no $x,y,z$ in $A$ such that $(x,y) in R$ and $(y,z) in R$, there is nothing to check.
$endgroup$
Sure, the binary relation $R = (1,2), (3,4)$ on the set $A = 1,2,3,4$ is transitive.
Indeed, the transitive property is vacuously true for the relation $R$: since there are no $x,y,z$ in $A$ such that $(x,y) in R$ and $(y,z) in R$, there is nothing to check.
answered 8 hours ago
TaroccoesbroccoTaroccoesbrocco
7,2198 gold badges18 silver badges43 bronze badges
7,2198 gold badges18 silver badges43 bronze badges
add a comment |
add a comment |
$begingroup$
Yes, your relation is indeed transitive. The nonexistence of any triples $x,y,z$ such that $(x,y),(y,z)$ are both in your relation does not matter. Being transitive merely says that if such a triple existed then you must also have $(x,z)$ in the relation.
Reworded, a relation is transitive iff for any "directed path" (if they even exist in the first place) you can take from one element to another you can also get there by using a single step instead. Since all of your directed paths are of length $1$ anyways, there is nothing more to check.
$endgroup$
add a comment |
$begingroup$
Yes, your relation is indeed transitive. The nonexistence of any triples $x,y,z$ such that $(x,y),(y,z)$ are both in your relation does not matter. Being transitive merely says that if such a triple existed then you must also have $(x,z)$ in the relation.
Reworded, a relation is transitive iff for any "directed path" (if they even exist in the first place) you can take from one element to another you can also get there by using a single step instead. Since all of your directed paths are of length $1$ anyways, there is nothing more to check.
$endgroup$
add a comment |
$begingroup$
Yes, your relation is indeed transitive. The nonexistence of any triples $x,y,z$ such that $(x,y),(y,z)$ are both in your relation does not matter. Being transitive merely says that if such a triple existed then you must also have $(x,z)$ in the relation.
Reworded, a relation is transitive iff for any "directed path" (if they even exist in the first place) you can take from one element to another you can also get there by using a single step instead. Since all of your directed paths are of length $1$ anyways, there is nothing more to check.
$endgroup$
Yes, your relation is indeed transitive. The nonexistence of any triples $x,y,z$ such that $(x,y),(y,z)$ are both in your relation does not matter. Being transitive merely says that if such a triple existed then you must also have $(x,z)$ in the relation.
Reworded, a relation is transitive iff for any "directed path" (if they even exist in the first place) you can take from one element to another you can also get there by using a single step instead. Since all of your directed paths are of length $1$ anyways, there is nothing more to check.
answered 8 hours ago
JMoravitzJMoravitz
53.7k4 gold badges43 silver badges93 bronze badges
53.7k4 gold badges43 silver badges93 bronze badges
add a comment |
add a comment |
$begingroup$
Or one can determine the truth value of the proposition : $forall x,y,z in X : ( x rmR y land yrmR z )$ $implies$ $xrmRz $.
Let P= $( x rmR y land yrmR z )$ , Q= $xrmRz$
Suppose we have $ xrmRy$, so its value is true, the truth value of $ yrmRz$ is always false. So the truth value of $P$ is false, based on the truth value table of $land$.
On the other hand, the truth value of $Q$ is false, so the truth value of $Pimplies Q$ will be true, based on the truth value of $ implies$.It means the definition holds, so the transitive property of the relation is satisfied.
$endgroup$
add a comment |
$begingroup$
Or one can determine the truth value of the proposition : $forall x,y,z in X : ( x rmR y land yrmR z )$ $implies$ $xrmRz $.
Let P= $( x rmR y land yrmR z )$ , Q= $xrmRz$
Suppose we have $ xrmRy$, so its value is true, the truth value of $ yrmRz$ is always false. So the truth value of $P$ is false, based on the truth value table of $land$.
On the other hand, the truth value of $Q$ is false, so the truth value of $Pimplies Q$ will be true, based on the truth value of $ implies$.It means the definition holds, so the transitive property of the relation is satisfied.
$endgroup$
add a comment |
$begingroup$
Or one can determine the truth value of the proposition : $forall x,y,z in X : ( x rmR y land yrmR z )$ $implies$ $xrmRz $.
Let P= $( x rmR y land yrmR z )$ , Q= $xrmRz$
Suppose we have $ xrmRy$, so its value is true, the truth value of $ yrmRz$ is always false. So the truth value of $P$ is false, based on the truth value table of $land$.
On the other hand, the truth value of $Q$ is false, so the truth value of $Pimplies Q$ will be true, based on the truth value of $ implies$.It means the definition holds, so the transitive property of the relation is satisfied.
$endgroup$
Or one can determine the truth value of the proposition : $forall x,y,z in X : ( x rmR y land yrmR z )$ $implies$ $xrmRz $.
Let P= $( x rmR y land yrmR z )$ , Q= $xrmRz$
Suppose we have $ xrmRy$, so its value is true, the truth value of $ yrmRz$ is always false. So the truth value of $P$ is false, based on the truth value table of $land$.
On the other hand, the truth value of $Q$ is false, so the truth value of $Pimplies Q$ will be true, based on the truth value of $ implies$.It means the definition holds, so the transitive property of the relation is satisfied.
answered 7 hours ago
Maryam AjorlouMaryam Ajorlou
165 bronze badges
165 bronze badges
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%2f3349764%2ftransitive-relations-special-case%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$
It is transitive.
$endgroup$
– Berci
8 hours ago