When does $(a,b)=(gcd(a,b))$ hold?











up vote
0
down vote

favorite












I had a look here to understand why $K[X,Y]$ is not a PID. So one of the conclusions was that $(x,y) neq (1) = gcd(x,y)$, but I thought that $(a,b)=gcd(a,b)$ was always true so obviously I was wrong. But when exactly does this relation hold then, if $ a,b in R$ and $R$ is a ring?










share|cite|improve this question




















  • 2




    It holds iff $gcdleft(a,bright)$ is expressible as an $R$-linear combination of $a$ and $b$. It certainly holds when $R$ is a Euclidean domain, then, as the Euclidean algorithm furnishes you with such an expression. I know this is not an answer to your question, but I hope it helps towards finding one.
    – Sam Streeter
    Nov 19 at 11:53










  • For an application of this property, see math.stackexchange.com/questions/597543
    – Watson
    Nov 19 at 13:30















up vote
0
down vote

favorite












I had a look here to understand why $K[X,Y]$ is not a PID. So one of the conclusions was that $(x,y) neq (1) = gcd(x,y)$, but I thought that $(a,b)=gcd(a,b)$ was always true so obviously I was wrong. But when exactly does this relation hold then, if $ a,b in R$ and $R$ is a ring?










share|cite|improve this question




















  • 2




    It holds iff $gcdleft(a,bright)$ is expressible as an $R$-linear combination of $a$ and $b$. It certainly holds when $R$ is a Euclidean domain, then, as the Euclidean algorithm furnishes you with such an expression. I know this is not an answer to your question, but I hope it helps towards finding one.
    – Sam Streeter
    Nov 19 at 11:53










  • For an application of this property, see math.stackexchange.com/questions/597543
    – Watson
    Nov 19 at 13:30













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I had a look here to understand why $K[X,Y]$ is not a PID. So one of the conclusions was that $(x,y) neq (1) = gcd(x,y)$, but I thought that $(a,b)=gcd(a,b)$ was always true so obviously I was wrong. But when exactly does this relation hold then, if $ a,b in R$ and $R$ is a ring?










share|cite|improve this question















I had a look here to understand why $K[X,Y]$ is not a PID. So one of the conclusions was that $(x,y) neq (1) = gcd(x,y)$, but I thought that $(a,b)=gcd(a,b)$ was always true so obviously I was wrong. But when exactly does this relation hold then, if $ a,b in R$ and $R$ is a ring?







ring-theory ideals greatest-common-divisor principal-ideal-domains






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 19 at 13:22









amWhy

191k27223437




191k27223437










asked Nov 19 at 11:45









roi_saumon

31117




31117








  • 2




    It holds iff $gcdleft(a,bright)$ is expressible as an $R$-linear combination of $a$ and $b$. It certainly holds when $R$ is a Euclidean domain, then, as the Euclidean algorithm furnishes you with such an expression. I know this is not an answer to your question, but I hope it helps towards finding one.
    – Sam Streeter
    Nov 19 at 11:53










  • For an application of this property, see math.stackexchange.com/questions/597543
    – Watson
    Nov 19 at 13:30














  • 2




    It holds iff $gcdleft(a,bright)$ is expressible as an $R$-linear combination of $a$ and $b$. It certainly holds when $R$ is a Euclidean domain, then, as the Euclidean algorithm furnishes you with such an expression. I know this is not an answer to your question, but I hope it helps towards finding one.
    – Sam Streeter
    Nov 19 at 11:53










  • For an application of this property, see math.stackexchange.com/questions/597543
    – Watson
    Nov 19 at 13:30








2




2




It holds iff $gcdleft(a,bright)$ is expressible as an $R$-linear combination of $a$ and $b$. It certainly holds when $R$ is a Euclidean domain, then, as the Euclidean algorithm furnishes you with such an expression. I know this is not an answer to your question, but I hope it helps towards finding one.
– Sam Streeter
Nov 19 at 11:53




It holds iff $gcdleft(a,bright)$ is expressible as an $R$-linear combination of $a$ and $b$. It certainly holds when $R$ is a Euclidean domain, then, as the Euclidean algorithm furnishes you with such an expression. I know this is not an answer to your question, but I hope it helps towards finding one.
– Sam Streeter
Nov 19 at 11:53












For an application of this property, see math.stackexchange.com/questions/597543
– Watson
Nov 19 at 13:30




For an application of this property, see math.stackexchange.com/questions/597543
– Watson
Nov 19 at 13:30










1 Answer
1






active

oldest

votes

















up vote
7
down vote



accepted










For commutative rings $R$, it holds if and only if $gcd(a,b) = alpha a + beta b$ for some $alpha,beta in R$. For if $gcd(a,b) = alpha a + beta b$ then clearly $(gcd(a,b)) subseteq (a,b)$, and on the other hand anything in $(a,b)$ has the form $ra + sb$ which is a multiple of $gcd(a,b)$ so lies in $(gcd(a,b))$.



Conversely if $(gcd(a,b)) = (a,b)$ then $gcd(a,b) in (a,b)$, so $gcd(a,b) = alpha a + beta b$ for some $alpha,beta in R$.



Every two elementa $a,b$ having a GCD which can be expressed as a linear combination of $a,b$ is equivalent to $R$ being a Bézout domain






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: 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%2f3004825%2fwhen-does-a-b-gcda-b-hold%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








    up vote
    7
    down vote



    accepted










    For commutative rings $R$, it holds if and only if $gcd(a,b) = alpha a + beta b$ for some $alpha,beta in R$. For if $gcd(a,b) = alpha a + beta b$ then clearly $(gcd(a,b)) subseteq (a,b)$, and on the other hand anything in $(a,b)$ has the form $ra + sb$ which is a multiple of $gcd(a,b)$ so lies in $(gcd(a,b))$.



    Conversely if $(gcd(a,b)) = (a,b)$ then $gcd(a,b) in (a,b)$, so $gcd(a,b) = alpha a + beta b$ for some $alpha,beta in R$.



    Every two elementa $a,b$ having a GCD which can be expressed as a linear combination of $a,b$ is equivalent to $R$ being a Bézout domain






    share|cite|improve this answer



























      up vote
      7
      down vote



      accepted










      For commutative rings $R$, it holds if and only if $gcd(a,b) = alpha a + beta b$ for some $alpha,beta in R$. For if $gcd(a,b) = alpha a + beta b$ then clearly $(gcd(a,b)) subseteq (a,b)$, and on the other hand anything in $(a,b)$ has the form $ra + sb$ which is a multiple of $gcd(a,b)$ so lies in $(gcd(a,b))$.



      Conversely if $(gcd(a,b)) = (a,b)$ then $gcd(a,b) in (a,b)$, so $gcd(a,b) = alpha a + beta b$ for some $alpha,beta in R$.



      Every two elementa $a,b$ having a GCD which can be expressed as a linear combination of $a,b$ is equivalent to $R$ being a Bézout domain






      share|cite|improve this answer

























        up vote
        7
        down vote



        accepted







        up vote
        7
        down vote



        accepted






        For commutative rings $R$, it holds if and only if $gcd(a,b) = alpha a + beta b$ for some $alpha,beta in R$. For if $gcd(a,b) = alpha a + beta b$ then clearly $(gcd(a,b)) subseteq (a,b)$, and on the other hand anything in $(a,b)$ has the form $ra + sb$ which is a multiple of $gcd(a,b)$ so lies in $(gcd(a,b))$.



        Conversely if $(gcd(a,b)) = (a,b)$ then $gcd(a,b) in (a,b)$, so $gcd(a,b) = alpha a + beta b$ for some $alpha,beta in R$.



        Every two elementa $a,b$ having a GCD which can be expressed as a linear combination of $a,b$ is equivalent to $R$ being a Bézout domain






        share|cite|improve this answer














        For commutative rings $R$, it holds if and only if $gcd(a,b) = alpha a + beta b$ for some $alpha,beta in R$. For if $gcd(a,b) = alpha a + beta b$ then clearly $(gcd(a,b)) subseteq (a,b)$, and on the other hand anything in $(a,b)$ has the form $ra + sb$ which is a multiple of $gcd(a,b)$ so lies in $(gcd(a,b))$.



        Conversely if $(gcd(a,b)) = (a,b)$ then $gcd(a,b) in (a,b)$, so $gcd(a,b) = alpha a + beta b$ for some $alpha,beta in R$.



        Every two elementa $a,b$ having a GCD which can be expressed as a linear combination of $a,b$ is equivalent to $R$ being a Bézout domain







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Nov 19 at 12:22

























        answered Nov 19 at 11:52









        Matthew Towers

        7,23422244




        7,23422244






























             

            draft saved


            draft discarded



















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004825%2fwhen-does-a-b-gcda-b-hold%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

            Plaza Victoria

            Puebla de Zaragoza

            Musa