If + is associative, prove that +' is associative












2












$begingroup$


I'm doing some self-study of elliptic curves and I'm having some difficulty with a problem. Here is the statement:




Let $S$ be a set with a composition law $ast$ which has the following two properties



i) $P ast Q = Q ast P$ for all $P,Q in S$



ii) $P ast (P ast Q) = Q$ for all $P,Q in S$.



We define $+'$ to be $P +' Q = mathcal{O}' ast (P ast Q)$ where $mathcal{O}' in S$. Assume that $+$ is associative. Prove that $+'$ is associative.




I have earlier proven a result that says that if $+$ is associative then



$R ast (mathcal{O} ast (P ast Q)) = P ast (mathcal{O} ast (Q ast R))$ for all $P,Q,R in S$ and $mathcal{O} in S$ is fixed.



Note that $+$ is defined similarly by $P + Q = mathcal{O} ast (P ast Q)$.



I know I need to stem my proof from this previous result but picking a specific $P,Q,R in S$ which cancels out $mathcal{O}$ and replaces it with $mathcal{O}'$ but I'm lost as to how to do this.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    You defined what $+'$ is, but not what $+$ is.
    $endgroup$
    – Lord Shark the Unknown
    Feb 1 at 3:04










  • $begingroup$
    Thanks for the catch @LordSharktheUnknown !
    $endgroup$
    – enigma
    Feb 1 at 3:06


















2












$begingroup$


I'm doing some self-study of elliptic curves and I'm having some difficulty with a problem. Here is the statement:




Let $S$ be a set with a composition law $ast$ which has the following two properties



i) $P ast Q = Q ast P$ for all $P,Q in S$



ii) $P ast (P ast Q) = Q$ for all $P,Q in S$.



We define $+'$ to be $P +' Q = mathcal{O}' ast (P ast Q)$ where $mathcal{O}' in S$. Assume that $+$ is associative. Prove that $+'$ is associative.




I have earlier proven a result that says that if $+$ is associative then



$R ast (mathcal{O} ast (P ast Q)) = P ast (mathcal{O} ast (Q ast R))$ for all $P,Q,R in S$ and $mathcal{O} in S$ is fixed.



Note that $+$ is defined similarly by $P + Q = mathcal{O} ast (P ast Q)$.



I know I need to stem my proof from this previous result but picking a specific $P,Q,R in S$ which cancels out $mathcal{O}$ and replaces it with $mathcal{O}'$ but I'm lost as to how to do this.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    You defined what $+'$ is, but not what $+$ is.
    $endgroup$
    – Lord Shark the Unknown
    Feb 1 at 3:04










  • $begingroup$
    Thanks for the catch @LordSharktheUnknown !
    $endgroup$
    – enigma
    Feb 1 at 3:06
















2












2








2


1



$begingroup$


I'm doing some self-study of elliptic curves and I'm having some difficulty with a problem. Here is the statement:




Let $S$ be a set with a composition law $ast$ which has the following two properties



i) $P ast Q = Q ast P$ for all $P,Q in S$



ii) $P ast (P ast Q) = Q$ for all $P,Q in S$.



We define $+'$ to be $P +' Q = mathcal{O}' ast (P ast Q)$ where $mathcal{O}' in S$. Assume that $+$ is associative. Prove that $+'$ is associative.




I have earlier proven a result that says that if $+$ is associative then



$R ast (mathcal{O} ast (P ast Q)) = P ast (mathcal{O} ast (Q ast R))$ for all $P,Q,R in S$ and $mathcal{O} in S$ is fixed.



Note that $+$ is defined similarly by $P + Q = mathcal{O} ast (P ast Q)$.



I know I need to stem my proof from this previous result but picking a specific $P,Q,R in S$ which cancels out $mathcal{O}$ and replaces it with $mathcal{O}'$ but I'm lost as to how to do this.










share|cite|improve this question











$endgroup$




I'm doing some self-study of elliptic curves and I'm having some difficulty with a problem. Here is the statement:




Let $S$ be a set with a composition law $ast$ which has the following two properties



i) $P ast Q = Q ast P$ for all $P,Q in S$



ii) $P ast (P ast Q) = Q$ for all $P,Q in S$.



We define $+'$ to be $P +' Q = mathcal{O}' ast (P ast Q)$ where $mathcal{O}' in S$. Assume that $+$ is associative. Prove that $+'$ is associative.




I have earlier proven a result that says that if $+$ is associative then



$R ast (mathcal{O} ast (P ast Q)) = P ast (mathcal{O} ast (Q ast R))$ for all $P,Q,R in S$ and $mathcal{O} in S$ is fixed.



Note that $+$ is defined similarly by $P + Q = mathcal{O} ast (P ast Q)$.



I know I need to stem my proof from this previous result but picking a specific $P,Q,R in S$ which cancels out $mathcal{O}$ and replaces it with $mathcal{O}'$ but I'm lost as to how to do this.







abstract-algebra






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Feb 1 at 5:28









Brandon Carter

7,31822538




7,31822538










asked Feb 1 at 3:02









enigmaenigma

353




353








  • 1




    $begingroup$
    You defined what $+'$ is, but not what $+$ is.
    $endgroup$
    – Lord Shark the Unknown
    Feb 1 at 3:04










  • $begingroup$
    Thanks for the catch @LordSharktheUnknown !
    $endgroup$
    – enigma
    Feb 1 at 3:06
















  • 1




    $begingroup$
    You defined what $+'$ is, but not what $+$ is.
    $endgroup$
    – Lord Shark the Unknown
    Feb 1 at 3:04










  • $begingroup$
    Thanks for the catch @LordSharktheUnknown !
    $endgroup$
    – enigma
    Feb 1 at 3:06










1




1




$begingroup$
You defined what $+'$ is, but not what $+$ is.
$endgroup$
– Lord Shark the Unknown
Feb 1 at 3:04




$begingroup$
You defined what $+'$ is, but not what $+$ is.
$endgroup$
– Lord Shark the Unknown
Feb 1 at 3:04












$begingroup$
Thanks for the catch @LordSharktheUnknown !
$endgroup$
– enigma
Feb 1 at 3:06






$begingroup$
Thanks for the catch @LordSharktheUnknown !
$endgroup$
– enigma
Feb 1 at 3:06












1 Answer
1






active

oldest

votes


















1












$begingroup$

Okay here goes nothing:



If we assume $+$ to be associative, then we have $R*(O*(Q*P)) = P*(O*(Q*R))$. So means we can swap elements provided there is an $O$ in the correct position.



On the LHS, $R*(O*(Q*P)) = R*(O*(O*(O*(P*Q))) = O*(O*(O*(R*(P*Q)))) = O*(R*(P*Q))$



Here I used (ii) and the associativity of $O$.



Then multiply by $O$ to get $(R*(P*Q))$. Then multiply by $O'$ to get $O'*(R*(P*Q))$. Effectively replacing $O$ by $O'$.



Repeat the steps above to swap $R$ and $O'$ again: $O'*(R*(P*Q)) = O'*(O*(O*(R*(P*Q)))) = R*(O*(O*(O'*(P*Q))) = R*(O'*(Q*P))$



We can do the same steps on the RHS while preserving inequality.



So we get $R*(O'*(Q*P)) = P*(O'*(Q*R))$






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%2f3095751%2fif-is-associative-prove-that-is-associative%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









    1












    $begingroup$

    Okay here goes nothing:



    If we assume $+$ to be associative, then we have $R*(O*(Q*P)) = P*(O*(Q*R))$. So means we can swap elements provided there is an $O$ in the correct position.



    On the LHS, $R*(O*(Q*P)) = R*(O*(O*(O*(P*Q))) = O*(O*(O*(R*(P*Q)))) = O*(R*(P*Q))$



    Here I used (ii) and the associativity of $O$.



    Then multiply by $O$ to get $(R*(P*Q))$. Then multiply by $O'$ to get $O'*(R*(P*Q))$. Effectively replacing $O$ by $O'$.



    Repeat the steps above to swap $R$ and $O'$ again: $O'*(R*(P*Q)) = O'*(O*(O*(R*(P*Q)))) = R*(O*(O*(O'*(P*Q))) = R*(O'*(Q*P))$



    We can do the same steps on the RHS while preserving inequality.



    So we get $R*(O'*(Q*P)) = P*(O'*(Q*R))$






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      Okay here goes nothing:



      If we assume $+$ to be associative, then we have $R*(O*(Q*P)) = P*(O*(Q*R))$. So means we can swap elements provided there is an $O$ in the correct position.



      On the LHS, $R*(O*(Q*P)) = R*(O*(O*(O*(P*Q))) = O*(O*(O*(R*(P*Q)))) = O*(R*(P*Q))$



      Here I used (ii) and the associativity of $O$.



      Then multiply by $O$ to get $(R*(P*Q))$. Then multiply by $O'$ to get $O'*(R*(P*Q))$. Effectively replacing $O$ by $O'$.



      Repeat the steps above to swap $R$ and $O'$ again: $O'*(R*(P*Q)) = O'*(O*(O*(R*(P*Q)))) = R*(O*(O*(O'*(P*Q))) = R*(O'*(Q*P))$



      We can do the same steps on the RHS while preserving inequality.



      So we get $R*(O'*(Q*P)) = P*(O'*(Q*R))$






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        Okay here goes nothing:



        If we assume $+$ to be associative, then we have $R*(O*(Q*P)) = P*(O*(Q*R))$. So means we can swap elements provided there is an $O$ in the correct position.



        On the LHS, $R*(O*(Q*P)) = R*(O*(O*(O*(P*Q))) = O*(O*(O*(R*(P*Q)))) = O*(R*(P*Q))$



        Here I used (ii) and the associativity of $O$.



        Then multiply by $O$ to get $(R*(P*Q))$. Then multiply by $O'$ to get $O'*(R*(P*Q))$. Effectively replacing $O$ by $O'$.



        Repeat the steps above to swap $R$ and $O'$ again: $O'*(R*(P*Q)) = O'*(O*(O*(R*(P*Q)))) = R*(O*(O*(O'*(P*Q))) = R*(O'*(Q*P))$



        We can do the same steps on the RHS while preserving inequality.



        So we get $R*(O'*(Q*P)) = P*(O'*(Q*R))$






        share|cite|improve this answer









        $endgroup$



        Okay here goes nothing:



        If we assume $+$ to be associative, then we have $R*(O*(Q*P)) = P*(O*(Q*R))$. So means we can swap elements provided there is an $O$ in the correct position.



        On the LHS, $R*(O*(Q*P)) = R*(O*(O*(O*(P*Q))) = O*(O*(O*(R*(P*Q)))) = O*(R*(P*Q))$



        Here I used (ii) and the associativity of $O$.



        Then multiply by $O$ to get $(R*(P*Q))$. Then multiply by $O'$ to get $O'*(R*(P*Q))$. Effectively replacing $O$ by $O'$.



        Repeat the steps above to swap $R$ and $O'$ again: $O'*(R*(P*Q)) = O'*(O*(O*(R*(P*Q)))) = R*(O*(O*(O'*(P*Q))) = R*(O'*(Q*P))$



        We can do the same steps on the RHS while preserving inequality.



        So we get $R*(O'*(Q*P)) = P*(O'*(Q*R))$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Feb 5 at 6:14









        eatfoodeatfood

        3318




        3318






























            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%2f3095751%2fif-is-associative-prove-that-is-associative%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

            The term 'EXEC' is not recognized as the name of a cmdlet Powershell

            NPM command prompt closes immediately [closed]

            Error binding properties and functions in emscripten