Transitive Relations: Special caseVery Simple RelationsTransitive Relations on a setWhy is ${(1,2),(3,4)}$ a...
What is the use of FullForm in Mathematica?
Seized engine due to being run without oil
Are there any space probes or landers which regained communication after being lost?
Does the mana ability restriction of Pithing Needle refer to the cost or the effect of an activated ability?
How to create a list of dictionaries from a dictionary with lists of different lengths
Sol Ⅲ = Earth: What is the origin of this planetary naming scheme?
Will replacing a fake visa with a different fake visa cause me problems when applying for a legal study permit?
How can "life" insurance prevent the cheapening of death?
Where does the expression "triple-A" comes from?
Do any aircraft carry boats?
How to split a string by the third .(dot) delimiter
2.5 year old daughter refuses to take medicine
How to circle together certain entries of a matrix?
How should we understand "unobscured by flying friends" in this context?
"Not enough RAM " error in PIC16F877a
Does the word “uzi” need to be capitalized?
What is negative current?
How do I preserve the line ordering for two "equal" strings while sorting and ignoring the case?
Is there a star over my head?
Gas pipes - why does gas burn "outwards?"
For how long could UK opposition parties prevent new elections?
Could the government trigger by-elections to regain a majority?
How do I politely hint customers to leave my store, without pretending to need leave store myself?
I see your BIDMAS and raise you a BADMIS
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
11 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 10 hours ago
Taroccoesbrocco
7,2198 gold badges18 silver badges43 bronze badges
7,2198 gold badges18 silver badges43 bronze badges
asked 11 hours ago
Ram KeswaniRam Keswani
5185 silver badges16 bronze badges
5185 silver badges16 bronze badges
$begingroup$
It is transitive.
$endgroup$
– Berci
11 hours ago
add a comment |
$begingroup$
It is transitive.
$endgroup$
– Berci
11 hours ago
$begingroup$
It is transitive.
$endgroup$
– Berci
11 hours ago
$begingroup$
It is transitive.
$endgroup$
– Berci
11 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 rm{R} y land yrm{R} z )$ $implies$ $xrm{R}z $.
Let P= $( x rm{R} y land yrm{R} z )$ , Q= $xrm{R}z$
Suppose we have $ xrm{R}y$, so its value is true, the truth value of $ yrm{R}z$ 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 11 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 11 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 rm{R} y land yrm{R} z )$ $implies$ $xrm{R}z $.
Let P= $( x rm{R} y land yrm{R} z )$ , Q= $xrm{R}z$
Suppose we have $ xrm{R}y$, so its value is true, the truth value of $ yrm{R}z$ 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 rm{R} y land yrm{R} z )$ $implies$ $xrm{R}z $.
Let P= $( x rm{R} y land yrm{R} z )$ , Q= $xrm{R}z$
Suppose we have $ xrm{R}y$, so its value is true, the truth value of $ yrm{R}z$ 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 rm{R} y land yrm{R} z )$ $implies$ $xrm{R}z $.
Let P= $( x rm{R} y land yrm{R} z )$ , Q= $xrm{R}z$
Suppose we have $ xrm{R}y$, so its value is true, the truth value of $ yrm{R}z$ 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 rm{R} y land yrm{R} z )$ $implies$ $xrm{R}z $.
Let P= $( x rm{R} y land yrm{R} z )$ , Q= $xrm{R}z$
Suppose we have $ xrm{R}y$, so its value is true, the truth value of $ yrm{R}z$ 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 10 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
11 hours ago