When is a line diagram not lattice?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite












A line Diagram



Can anyone please explain why the line diagram above is not a lattice as per the definition of lattice? The relation is $leq$ and the element above is less or equal to the element below. The explanation given was that s,t has no supremum and p,t does not have a smallest element in the set of all its upper bounds. Only problem is I have not studied any set theory or relations beyond high school. Can somebody explain it to intuitively while sticking to the standard mathematical definitions, it would help me a lot?







share|cite|improve this question


























    up vote
    0
    down vote

    favorite












    A line Diagram



    Can anyone please explain why the line diagram above is not a lattice as per the definition of lattice? The relation is $leq$ and the element above is less or equal to the element below. The explanation given was that s,t has no supremum and p,t does not have a smallest element in the set of all its upper bounds. Only problem is I have not studied any set theory or relations beyond high school. Can somebody explain it to intuitively while sticking to the standard mathematical definitions, it would help me a lot?







    share|cite|improve this question
























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      A line Diagram



      Can anyone please explain why the line diagram above is not a lattice as per the definition of lattice? The relation is $leq$ and the element above is less or equal to the element below. The explanation given was that s,t has no supremum and p,t does not have a smallest element in the set of all its upper bounds. Only problem is I have not studied any set theory or relations beyond high school. Can somebody explain it to intuitively while sticking to the standard mathematical definitions, it would help me a lot?







      share|cite|improve this question














      A line Diagram



      Can anyone please explain why the line diagram above is not a lattice as per the definition of lattice? The relation is $leq$ and the element above is less or equal to the element below. The explanation given was that s,t has no supremum and p,t does not have a smallest element in the set of all its upper bounds. Only problem is I have not studied any set theory or relations beyond high school. Can somebody explain it to intuitively while sticking to the standard mathematical definitions, it would help me a lot?









      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Aug 17 at 2:44









      spaceisdarkgreen

      28k21548




      28k21548










      asked Aug 17 at 2:09









      Loukit Khemka

      133




      133




















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          3
          down vote



          accepted










          In a lattice, every pair of elements has a supremum and an infimum. Let's show that $t$ and $s$ have no supremum, so that this is not a lattice.



          Another perhaps more suggestive term for supremum is least upper bound. An upper bound for a pair of elements is any element that is greater than or equal to both of them. From the diagram, we see that $pge t,$ and $pge s,$ so $p$ is an upper bound for $s$ and $t.$ Similarly, $q$ and $1$ are also upper bounds for $s$ and $t$ because they are both greater than $s$ and greater than $t.$



          (On the other hand, $s$ is not an upper bound for $s,t$ because, while we have $sge s,$ it is not the case that $sge t$. Similarly, $t$ and $0$ are not upper bounds.)



          So we have the upper bounds $p,q,$ and $1.$ A supremum (if it exists) is the least upper bound. Least means it is less than or equal to all of the others. So we need to check $p,q,$ and $1$ and see if any of them is less than or equal to all the others.



          Clearly $1$ is not... it is greater than both $p$ and $q,$ so $1$ is not the supremum of $s,t.$ How about $p$? We have $ple 1$ and $ple p,$ but we don't have $ple q.$ So $p$ is not the least. The situation with $q$ is completely symmetrical, so it is not the least either.



          And that's it, we've checked all possibilities and did not find any least upper bound. Thus $s,t$ has no least upper bound and this poset is not a lattice.






          share|cite|improve this answer




















            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',
            convertImagesToLinks: true,
            noModals: false,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            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%2f2885330%2fwhen-is-a-line-diagram-not-lattice%23new-answer', 'question_page');

            );

            Post as a guest






























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes








            up vote
            3
            down vote



            accepted










            In a lattice, every pair of elements has a supremum and an infimum. Let's show that $t$ and $s$ have no supremum, so that this is not a lattice.



            Another perhaps more suggestive term for supremum is least upper bound. An upper bound for a pair of elements is any element that is greater than or equal to both of them. From the diagram, we see that $pge t,$ and $pge s,$ so $p$ is an upper bound for $s$ and $t.$ Similarly, $q$ and $1$ are also upper bounds for $s$ and $t$ because they are both greater than $s$ and greater than $t.$



            (On the other hand, $s$ is not an upper bound for $s,t$ because, while we have $sge s,$ it is not the case that $sge t$. Similarly, $t$ and $0$ are not upper bounds.)



            So we have the upper bounds $p,q,$ and $1.$ A supremum (if it exists) is the least upper bound. Least means it is less than or equal to all of the others. So we need to check $p,q,$ and $1$ and see if any of them is less than or equal to all the others.



            Clearly $1$ is not... it is greater than both $p$ and $q,$ so $1$ is not the supremum of $s,t.$ How about $p$? We have $ple 1$ and $ple p,$ but we don't have $ple q.$ So $p$ is not the least. The situation with $q$ is completely symmetrical, so it is not the least either.



            And that's it, we've checked all possibilities and did not find any least upper bound. Thus $s,t$ has no least upper bound and this poset is not a lattice.






            share|cite|improve this answer
























              up vote
              3
              down vote



              accepted










              In a lattice, every pair of elements has a supremum and an infimum. Let's show that $t$ and $s$ have no supremum, so that this is not a lattice.



              Another perhaps more suggestive term for supremum is least upper bound. An upper bound for a pair of elements is any element that is greater than or equal to both of them. From the diagram, we see that $pge t,$ and $pge s,$ so $p$ is an upper bound for $s$ and $t.$ Similarly, $q$ and $1$ are also upper bounds for $s$ and $t$ because they are both greater than $s$ and greater than $t.$



              (On the other hand, $s$ is not an upper bound for $s,t$ because, while we have $sge s,$ it is not the case that $sge t$. Similarly, $t$ and $0$ are not upper bounds.)



              So we have the upper bounds $p,q,$ and $1.$ A supremum (if it exists) is the least upper bound. Least means it is less than or equal to all of the others. So we need to check $p,q,$ and $1$ and see if any of them is less than or equal to all the others.



              Clearly $1$ is not... it is greater than both $p$ and $q,$ so $1$ is not the supremum of $s,t.$ How about $p$? We have $ple 1$ and $ple p,$ but we don't have $ple q.$ So $p$ is not the least. The situation with $q$ is completely symmetrical, so it is not the least either.



              And that's it, we've checked all possibilities and did not find any least upper bound. Thus $s,t$ has no least upper bound and this poset is not a lattice.






              share|cite|improve this answer






















                up vote
                3
                down vote



                accepted







                up vote
                3
                down vote



                accepted






                In a lattice, every pair of elements has a supremum and an infimum. Let's show that $t$ and $s$ have no supremum, so that this is not a lattice.



                Another perhaps more suggestive term for supremum is least upper bound. An upper bound for a pair of elements is any element that is greater than or equal to both of them. From the diagram, we see that $pge t,$ and $pge s,$ so $p$ is an upper bound for $s$ and $t.$ Similarly, $q$ and $1$ are also upper bounds for $s$ and $t$ because they are both greater than $s$ and greater than $t.$



                (On the other hand, $s$ is not an upper bound for $s,t$ because, while we have $sge s,$ it is not the case that $sge t$. Similarly, $t$ and $0$ are not upper bounds.)



                So we have the upper bounds $p,q,$ and $1.$ A supremum (if it exists) is the least upper bound. Least means it is less than or equal to all of the others. So we need to check $p,q,$ and $1$ and see if any of them is less than or equal to all the others.



                Clearly $1$ is not... it is greater than both $p$ and $q,$ so $1$ is not the supremum of $s,t.$ How about $p$? We have $ple 1$ and $ple p,$ but we don't have $ple q.$ So $p$ is not the least. The situation with $q$ is completely symmetrical, so it is not the least either.



                And that's it, we've checked all possibilities and did not find any least upper bound. Thus $s,t$ has no least upper bound and this poset is not a lattice.






                share|cite|improve this answer












                In a lattice, every pair of elements has a supremum and an infimum. Let's show that $t$ and $s$ have no supremum, so that this is not a lattice.



                Another perhaps more suggestive term for supremum is least upper bound. An upper bound for a pair of elements is any element that is greater than or equal to both of them. From the diagram, we see that $pge t,$ and $pge s,$ so $p$ is an upper bound for $s$ and $t.$ Similarly, $q$ and $1$ are also upper bounds for $s$ and $t$ because they are both greater than $s$ and greater than $t.$



                (On the other hand, $s$ is not an upper bound for $s,t$ because, while we have $sge s,$ it is not the case that $sge t$. Similarly, $t$ and $0$ are not upper bounds.)



                So we have the upper bounds $p,q,$ and $1.$ A supremum (if it exists) is the least upper bound. Least means it is less than or equal to all of the others. So we need to check $p,q,$ and $1$ and see if any of them is less than or equal to all the others.



                Clearly $1$ is not... it is greater than both $p$ and $q,$ so $1$ is not the supremum of $s,t.$ How about $p$? We have $ple 1$ and $ple p,$ but we don't have $ple q.$ So $p$ is not the least. The situation with $q$ is completely symmetrical, so it is not the least either.



                And that's it, we've checked all possibilities and did not find any least upper bound. Thus $s,t$ has no least upper bound and this poset is not a lattice.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Aug 17 at 2:57









                spaceisdarkgreen

                28k21548




                28k21548






















                     

                    draft saved


                    draft discarded


























                     


                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2885330%2fwhen-is-a-line-diagram-not-lattice%23new-answer', 'question_page');

                    );

                    Post as a guest













































































                    這個網誌中的熱門文章

                    Is there any way to eliminate the singular point to solve this integral by hand or by approximations?

                    Why am i infinitely getting the same tweet with the Twitter Search API?

                    Carbon dioxide