How to prove that for any nonempty set $A$, there exists a maximal partial order $lambda$ with the axiom of...












1












$begingroup$


The ``maximal partial order'' means for any partial order $alphainmathscr{B}(A)$, $lambdasubseteqalpha$ implies $lambda=alpha$.



It is obvious if we apply the well-ordering theorem or Zorn's lemma. Since the equivalence among well-ordering theorem, Zorn's lemma and the axiom of choice, we can give a proof directly from the axiom of choice, I mean, not a pretended proof( to prove Zorn's lemma first and then use the lemma).



Could any one help me?










share|cite|improve this question









$endgroup$

















    1












    $begingroup$


    The ``maximal partial order'' means for any partial order $alphainmathscr{B}(A)$, $lambdasubseteqalpha$ implies $lambda=alpha$.



    It is obvious if we apply the well-ordering theorem or Zorn's lemma. Since the equivalence among well-ordering theorem, Zorn's lemma and the axiom of choice, we can give a proof directly from the axiom of choice, I mean, not a pretended proof( to prove Zorn's lemma first and then use the lemma).



    Could any one help me?










    share|cite|improve this question









    $endgroup$















      1












      1








      1


      1



      $begingroup$


      The ``maximal partial order'' means for any partial order $alphainmathscr{B}(A)$, $lambdasubseteqalpha$ implies $lambda=alpha$.



      It is obvious if we apply the well-ordering theorem or Zorn's lemma. Since the equivalence among well-ordering theorem, Zorn's lemma and the axiom of choice, we can give a proof directly from the axiom of choice, I mean, not a pretended proof( to prove Zorn's lemma first and then use the lemma).



      Could any one help me?










      share|cite|improve this question









      $endgroup$




      The ``maximal partial order'' means for any partial order $alphainmathscr{B}(A)$, $lambdasubseteqalpha$ implies $lambda=alpha$.



      It is obvious if we apply the well-ordering theorem or Zorn's lemma. Since the equivalence among well-ordering theorem, Zorn's lemma and the axiom of choice, we can give a proof directly from the axiom of choice, I mean, not a pretended proof( to prove Zorn's lemma first and then use the lemma).



      Could any one help me?







      order-theory






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 21 at 6:36









      闫嘉琦闫嘉琦

      648112




      648112






















          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          Apply Zorn's lemma to the collection $mathcal{C}$ of partial orders in $A$. Here $mathcal{C}$ is ordered by $subseteq$.






          share|cite|improve this answer









          $endgroup$













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


            }
            });














            draft saved

            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3081568%2fhow-to-prove-that-for-any-nonempty-set-a-there-exists-a-maximal-partial-order%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









            0












            $begingroup$

            Apply Zorn's lemma to the collection $mathcal{C}$ of partial orders in $A$. Here $mathcal{C}$ is ordered by $subseteq$.






            share|cite|improve this answer









            $endgroup$


















              0












              $begingroup$

              Apply Zorn's lemma to the collection $mathcal{C}$ of partial orders in $A$. Here $mathcal{C}$ is ordered by $subseteq$.






              share|cite|improve this answer









              $endgroup$
















                0












                0








                0





                $begingroup$

                Apply Zorn's lemma to the collection $mathcal{C}$ of partial orders in $A$. Here $mathcal{C}$ is ordered by $subseteq$.






                share|cite|improve this answer









                $endgroup$



                Apply Zorn's lemma to the collection $mathcal{C}$ of partial orders in $A$. Here $mathcal{C}$ is ordered by $subseteq$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Jan 30 at 19:52









                Alberto TakaseAlberto Takase

                2,310719




                2,310719






























                    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%2f3081568%2fhow-to-prove-that-for-any-nonempty-set-a-there-exists-a-maximal-partial-order%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

                    android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

                    SQL update select statement

                    'app-layout' is not a known element: how to share Component with different Modules