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;








4












$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$?










share|cite|improve this question











$endgroup$













  • $begingroup$
    It is transitive.
    $endgroup$
    – Berci
    8 hours ago

















4












$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$?










share|cite|improve this question











$endgroup$













  • $begingroup$
    It is transitive.
    $endgroup$
    – Berci
    8 hours ago













4












4








4





$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$?










share|cite|improve this question











$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






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








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
















  • $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










3 Answers
3






active

oldest

votes


















4














$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.






share|cite|improve this answer









$endgroup$






















    2














    $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.






    share|cite|improve this answer









    $endgroup$






















      1














      $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.






      share|cite|improve this answer









      $endgroup$

















        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
        );



        );














        draft saved

        draft discarded
















        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









        4














        $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.






        share|cite|improve this answer









        $endgroup$



















          4














          $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.






          share|cite|improve this answer









          $endgroup$

















            4














            4










            4







            $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.






            share|cite|improve this answer









            $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.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered 8 hours ago









            TaroccoesbroccoTaroccoesbrocco

            7,2198 gold badges18 silver badges43 bronze badges




            7,2198 gold badges18 silver badges43 bronze badges


























                2














                $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.






                share|cite|improve this answer









                $endgroup$



















                  2














                  $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.






                  share|cite|improve this answer









                  $endgroup$

















                    2














                    2










                    2







                    $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.






                    share|cite|improve this answer









                    $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.







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered 8 hours ago









                    JMoravitzJMoravitz

                    53.7k4 gold badges43 silver badges93 bronze badges




                    53.7k4 gold badges43 silver badges93 bronze badges
























                        1














                        $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.






                        share|cite|improve this answer









                        $endgroup$



















                          1














                          $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.






                          share|cite|improve this answer









                          $endgroup$

















                            1














                            1










                            1







                            $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.






                            share|cite|improve this answer









                            $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.







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered 7 hours ago









                            Maryam AjorlouMaryam Ajorlou

                            165 bronze badges




                            165 bronze badges































                                draft saved

                                draft discarded















































                                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.




                                draft saved


                                draft discarded














                                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





















































                                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







                                Popular posts from this blog

                                Invision Community Contents History See also References External links Navigation menuProprietaryinvisioncommunity.comIPS Community ForumsIPS Community Forumsthis blog entry"License Changes, IP.Board 3.4, and the Future""Interview -- Matt Mecham of Ibforums""CEO Invision Power Board, Matt Mecham Is a Liar, Thief!"IPB License Explanation 1.3, 1.3.1, 2.0, and 2.1ArchivedSecurity Fixes, Updates And Enhancements For IPB 1.3.1Archived"New Demo Accounts - Invision Power Services"the original"New Default Skin"the original"Invision Power Board 3.0.0 and Applications Released"the original"Archived copy"the original"Perpetual licenses being done away with""Release Notes - Invision Power Services""Introducing: IPS Community Suite 4!"Invision Community Release Notes

                                Canceling a color specificationRandomly assigning color to Graphics3D objects?Default color for Filling in Mathematica 9Coloring specific elements of sets with a prime modified order in an array plotHow to pick a color differing significantly from the colors already in a given color list?Detection of the text colorColor numbers based on their valueCan color schemes for use with ColorData include opacity specification?My dynamic color schemes

                                Ласкавець круглолистий Зміст Опис | Поширення | Галерея | Примітки | Посилання | Навігаційне меню58171138361-22960890446Bupleurum rotundifoliumEuro+Med PlantbasePlants of the World Online — Kew ScienceGermplasm Resources Information Network (GRIN)Ласкавецькн. VI : Літери Ком — Левиправивши або дописавши її