Intersection of cosets from possibly distinct subgroups is either empty or a coset of the intersection...












3












$begingroup$



Let $G$ be a group and $H leq G, K leq G$.



The intersection of two left cosets (one from $H$ and the other from $K$) is either empty or a coset of
$Hcap K$




I'm having some trouble proving this in a good way.



We know that, if $G$ is a group and $H leq G, K leq G$ then $(Hcap K) leq G$.
Let us a consider $Hcap K$ and some coset $a(Hcap K)$ of $Hcap K$ for a arbitrary $ain G$



If $x in a(Hcap K) implies x =ab,$ for some $b in Hcap K implies x in aH$ and $x in aK implies x in aHcap aK $. But this is not what I want, right? Or can this implication be done the other way as well?



One thought is to split it up in to cases.




  1. $Hcap K = {e }$, where e is the identity.

  2. $H = K$ or $H subset K$ or $K subset H$ or $Hcap K neq {e }$.
    But I'm not sure if this would get me anywhere?


If I want to prove that the intersection must be empty I'm not sure where to start. I want to assume that some $xin G$ is contained in the intersection of two cosets and then perhaps derive that it must be empty.



Should I then take $x in aHcap aK $ or $x in aHcap bK $ where $a,b$ may or may not be distinct?



If I take $x in aHcap aK $ then $x = ah, hin H$ and $x = ak, kin K implies x = ah = ak implies h = k$. And I'm stuck.



If I take $x in aHcap bK $ then $x = ah, hin H$ and $x = bk, kin K implies x = ah = bk implies a^{-1}bk in H$ And I'm also stuck here.



Any hints on how to solve this?










share|cite|improve this question









$endgroup$












  • $begingroup$
    Ooooops. This is a duplicate of math.stackexchange.com/questions/270703/…
    $endgroup$
    – John Smith
    Feb 23 '14 at 18:12
















3












$begingroup$



Let $G$ be a group and $H leq G, K leq G$.



The intersection of two left cosets (one from $H$ and the other from $K$) is either empty or a coset of
$Hcap K$




I'm having some trouble proving this in a good way.



We know that, if $G$ is a group and $H leq G, K leq G$ then $(Hcap K) leq G$.
Let us a consider $Hcap K$ and some coset $a(Hcap K)$ of $Hcap K$ for a arbitrary $ain G$



If $x in a(Hcap K) implies x =ab,$ for some $b in Hcap K implies x in aH$ and $x in aK implies x in aHcap aK $. But this is not what I want, right? Or can this implication be done the other way as well?



One thought is to split it up in to cases.




  1. $Hcap K = {e }$, where e is the identity.

  2. $H = K$ or $H subset K$ or $K subset H$ or $Hcap K neq {e }$.
    But I'm not sure if this would get me anywhere?


If I want to prove that the intersection must be empty I'm not sure where to start. I want to assume that some $xin G$ is contained in the intersection of two cosets and then perhaps derive that it must be empty.



Should I then take $x in aHcap aK $ or $x in aHcap bK $ where $a,b$ may or may not be distinct?



If I take $x in aHcap aK $ then $x = ah, hin H$ and $x = ak, kin K implies x = ah = ak implies h = k$. And I'm stuck.



If I take $x in aHcap bK $ then $x = ah, hin H$ and $x = bk, kin K implies x = ah = bk implies a^{-1}bk in H$ And I'm also stuck here.



Any hints on how to solve this?










share|cite|improve this question









$endgroup$












  • $begingroup$
    Ooooops. This is a duplicate of math.stackexchange.com/questions/270703/…
    $endgroup$
    – John Smith
    Feb 23 '14 at 18:12














3












3








3





$begingroup$



Let $G$ be a group and $H leq G, K leq G$.



The intersection of two left cosets (one from $H$ and the other from $K$) is either empty or a coset of
$Hcap K$




I'm having some trouble proving this in a good way.



We know that, if $G$ is a group and $H leq G, K leq G$ then $(Hcap K) leq G$.
Let us a consider $Hcap K$ and some coset $a(Hcap K)$ of $Hcap K$ for a arbitrary $ain G$



If $x in a(Hcap K) implies x =ab,$ for some $b in Hcap K implies x in aH$ and $x in aK implies x in aHcap aK $. But this is not what I want, right? Or can this implication be done the other way as well?



One thought is to split it up in to cases.




  1. $Hcap K = {e }$, where e is the identity.

  2. $H = K$ or $H subset K$ or $K subset H$ or $Hcap K neq {e }$.
    But I'm not sure if this would get me anywhere?


If I want to prove that the intersection must be empty I'm not sure where to start. I want to assume that some $xin G$ is contained in the intersection of two cosets and then perhaps derive that it must be empty.



Should I then take $x in aHcap aK $ or $x in aHcap bK $ where $a,b$ may or may not be distinct?



If I take $x in aHcap aK $ then $x = ah, hin H$ and $x = ak, kin K implies x = ah = ak implies h = k$. And I'm stuck.



If I take $x in aHcap bK $ then $x = ah, hin H$ and $x = bk, kin K implies x = ah = bk implies a^{-1}bk in H$ And I'm also stuck here.



Any hints on how to solve this?










share|cite|improve this question









$endgroup$





Let $G$ be a group and $H leq G, K leq G$.



The intersection of two left cosets (one from $H$ and the other from $K$) is either empty or a coset of
$Hcap K$




I'm having some trouble proving this in a good way.



We know that, if $G$ is a group and $H leq G, K leq G$ then $(Hcap K) leq G$.
Let us a consider $Hcap K$ and some coset $a(Hcap K)$ of $Hcap K$ for a arbitrary $ain G$



If $x in a(Hcap K) implies x =ab,$ for some $b in Hcap K implies x in aH$ and $x in aK implies x in aHcap aK $. But this is not what I want, right? Or can this implication be done the other way as well?



One thought is to split it up in to cases.




  1. $Hcap K = {e }$, where e is the identity.

  2. $H = K$ or $H subset K$ or $K subset H$ or $Hcap K neq {e }$.
    But I'm not sure if this would get me anywhere?


If I want to prove that the intersection must be empty I'm not sure where to start. I want to assume that some $xin G$ is contained in the intersection of two cosets and then perhaps derive that it must be empty.



Should I then take $x in aHcap aK $ or $x in aHcap bK $ where $a,b$ may or may not be distinct?



If I take $x in aHcap aK $ then $x = ah, hin H$ and $x = ak, kin K implies x = ah = ak implies h = k$. And I'm stuck.



If I take $x in aHcap bK $ then $x = ah, hin H$ and $x = bk, kin K implies x = ah = bk implies a^{-1}bk in H$ And I'm also stuck here.



Any hints on how to solve this?







abstract-algebra group-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Feb 23 '14 at 12:25









John SmithJohn Smith

952826




952826












  • $begingroup$
    Ooooops. This is a duplicate of math.stackexchange.com/questions/270703/…
    $endgroup$
    – John Smith
    Feb 23 '14 at 18:12


















  • $begingroup$
    Ooooops. This is a duplicate of math.stackexchange.com/questions/270703/…
    $endgroup$
    – John Smith
    Feb 23 '14 at 18:12
















$begingroup$
Ooooops. This is a duplicate of math.stackexchange.com/questions/270703/…
$endgroup$
– John Smith
Feb 23 '14 at 18:12




$begingroup$
Ooooops. This is a duplicate of math.stackexchange.com/questions/270703/…
$endgroup$
– John Smith
Feb 23 '14 at 18:12










2 Answers
2






active

oldest

votes


















6












$begingroup$

$a$ and $b$ need not to be equal. You have to show that the intersection between a left coset $aH$ of $H$ and a left coset $bK$ of $K$ is a left coset of $H cap K$, that is $aH cap bK = c(H cap K)$ for some $c in G$.



As you hinted, suppose $aH cap bK neq emptyset$ and let $x in aH cap bK$. Then $x = ah = bk$ for some $h in H$, $k in K$ and $h = xa^{-1}$, $k = xb^{-1}$.



We shall now prove that $aH = xH$. Let $g in aH$, then $$g = ah' = xh^{-1}h' in xH$$



for some $h' in H$.



Conversely, if $g in xH$, then $$g = xh' = ahh' in aH$$ for some $h' in H$.



Similarly, we have $bK = xK$.



Hence (explain why!) $aH cap bK = xH cap xK = x(H cap K)$.






share|cite|improve this answer









$endgroup$





















    0












    $begingroup$

    dani_s's answer has a typo in the second paragraph. It should state $a=xh^{-1}, b=xk^{-1}$ instead ($h=xa^{-1}$ would be wrong without assuming abelian group).



    Also the middle section of the proof can be shortened:
    $$aH=xh^{-1}H=x(h^{-1}H)=xH quadtext{ since }h^{-1} in H$$
    and
    $$bK=xk^{-1}K=x(k^{-1}K)=xK quadtext{ since }k^{-1} in K.$$






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      This does not provide an answer to the question. Once you have sufficient reputation you will be able to comment on any post; instead, provide answers that don't require clarification from the asker. - From Review
      $endgroup$
      – idea
      Jan 20 at 11:33










    • $begingroup$
      That is your system's design problem, is it not?
      $endgroup$
      – Xiaohai Zhang
      Jan 21 at 0:40











    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%2f687065%2fintersection-of-cosets-from-possibly-distinct-subgroups-is-either-empty-or-a-cos%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    6












    $begingroup$

    $a$ and $b$ need not to be equal. You have to show that the intersection between a left coset $aH$ of $H$ and a left coset $bK$ of $K$ is a left coset of $H cap K$, that is $aH cap bK = c(H cap K)$ for some $c in G$.



    As you hinted, suppose $aH cap bK neq emptyset$ and let $x in aH cap bK$. Then $x = ah = bk$ for some $h in H$, $k in K$ and $h = xa^{-1}$, $k = xb^{-1}$.



    We shall now prove that $aH = xH$. Let $g in aH$, then $$g = ah' = xh^{-1}h' in xH$$



    for some $h' in H$.



    Conversely, if $g in xH$, then $$g = xh' = ahh' in aH$$ for some $h' in H$.



    Similarly, we have $bK = xK$.



    Hence (explain why!) $aH cap bK = xH cap xK = x(H cap K)$.






    share|cite|improve this answer









    $endgroup$


















      6












      $begingroup$

      $a$ and $b$ need not to be equal. You have to show that the intersection between a left coset $aH$ of $H$ and a left coset $bK$ of $K$ is a left coset of $H cap K$, that is $aH cap bK = c(H cap K)$ for some $c in G$.



      As you hinted, suppose $aH cap bK neq emptyset$ and let $x in aH cap bK$. Then $x = ah = bk$ for some $h in H$, $k in K$ and $h = xa^{-1}$, $k = xb^{-1}$.



      We shall now prove that $aH = xH$. Let $g in aH$, then $$g = ah' = xh^{-1}h' in xH$$



      for some $h' in H$.



      Conversely, if $g in xH$, then $$g = xh' = ahh' in aH$$ for some $h' in H$.



      Similarly, we have $bK = xK$.



      Hence (explain why!) $aH cap bK = xH cap xK = x(H cap K)$.






      share|cite|improve this answer









      $endgroup$
















        6












        6








        6





        $begingroup$

        $a$ and $b$ need not to be equal. You have to show that the intersection between a left coset $aH$ of $H$ and a left coset $bK$ of $K$ is a left coset of $H cap K$, that is $aH cap bK = c(H cap K)$ for some $c in G$.



        As you hinted, suppose $aH cap bK neq emptyset$ and let $x in aH cap bK$. Then $x = ah = bk$ for some $h in H$, $k in K$ and $h = xa^{-1}$, $k = xb^{-1}$.



        We shall now prove that $aH = xH$. Let $g in aH$, then $$g = ah' = xh^{-1}h' in xH$$



        for some $h' in H$.



        Conversely, if $g in xH$, then $$g = xh' = ahh' in aH$$ for some $h' in H$.



        Similarly, we have $bK = xK$.



        Hence (explain why!) $aH cap bK = xH cap xK = x(H cap K)$.






        share|cite|improve this answer









        $endgroup$



        $a$ and $b$ need not to be equal. You have to show that the intersection between a left coset $aH$ of $H$ and a left coset $bK$ of $K$ is a left coset of $H cap K$, that is $aH cap bK = c(H cap K)$ for some $c in G$.



        As you hinted, suppose $aH cap bK neq emptyset$ and let $x in aH cap bK$. Then $x = ah = bk$ for some $h in H$, $k in K$ and $h = xa^{-1}$, $k = xb^{-1}$.



        We shall now prove that $aH = xH$. Let $g in aH$, then $$g = ah' = xh^{-1}h' in xH$$



        for some $h' in H$.



        Conversely, if $g in xH$, then $$g = xh' = ahh' in aH$$ for some $h' in H$.



        Similarly, we have $bK = xK$.



        Hence (explain why!) $aH cap bK = xH cap xK = x(H cap K)$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Feb 23 '14 at 13:41









        dani_sdani_s

        1,434711




        1,434711























            0












            $begingroup$

            dani_s's answer has a typo in the second paragraph. It should state $a=xh^{-1}, b=xk^{-1}$ instead ($h=xa^{-1}$ would be wrong without assuming abelian group).



            Also the middle section of the proof can be shortened:
            $$aH=xh^{-1}H=x(h^{-1}H)=xH quadtext{ since }h^{-1} in H$$
            and
            $$bK=xk^{-1}K=x(k^{-1}K)=xK quadtext{ since }k^{-1} in K.$$






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              This does not provide an answer to the question. Once you have sufficient reputation you will be able to comment on any post; instead, provide answers that don't require clarification from the asker. - From Review
              $endgroup$
              – idea
              Jan 20 at 11:33










            • $begingroup$
              That is your system's design problem, is it not?
              $endgroup$
              – Xiaohai Zhang
              Jan 21 at 0:40
















            0












            $begingroup$

            dani_s's answer has a typo in the second paragraph. It should state $a=xh^{-1}, b=xk^{-1}$ instead ($h=xa^{-1}$ would be wrong without assuming abelian group).



            Also the middle section of the proof can be shortened:
            $$aH=xh^{-1}H=x(h^{-1}H)=xH quadtext{ since }h^{-1} in H$$
            and
            $$bK=xk^{-1}K=x(k^{-1}K)=xK quadtext{ since }k^{-1} in K.$$






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              This does not provide an answer to the question. Once you have sufficient reputation you will be able to comment on any post; instead, provide answers that don't require clarification from the asker. - From Review
              $endgroup$
              – idea
              Jan 20 at 11:33










            • $begingroup$
              That is your system's design problem, is it not?
              $endgroup$
              – Xiaohai Zhang
              Jan 21 at 0:40














            0












            0








            0





            $begingroup$

            dani_s's answer has a typo in the second paragraph. It should state $a=xh^{-1}, b=xk^{-1}$ instead ($h=xa^{-1}$ would be wrong without assuming abelian group).



            Also the middle section of the proof can be shortened:
            $$aH=xh^{-1}H=x(h^{-1}H)=xH quadtext{ since }h^{-1} in H$$
            and
            $$bK=xk^{-1}K=x(k^{-1}K)=xK quadtext{ since }k^{-1} in K.$$






            share|cite|improve this answer









            $endgroup$



            dani_s's answer has a typo in the second paragraph. It should state $a=xh^{-1}, b=xk^{-1}$ instead ($h=xa^{-1}$ would be wrong without assuming abelian group).



            Also the middle section of the proof can be shortened:
            $$aH=xh^{-1}H=x(h^{-1}H)=xH quadtext{ since }h^{-1} in H$$
            and
            $$bK=xk^{-1}K=x(k^{-1}K)=xK quadtext{ since }k^{-1} in K.$$







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Jan 20 at 9:56









            Xiaohai ZhangXiaohai Zhang

            212




            212












            • $begingroup$
              This does not provide an answer to the question. Once you have sufficient reputation you will be able to comment on any post; instead, provide answers that don't require clarification from the asker. - From Review
              $endgroup$
              – idea
              Jan 20 at 11:33










            • $begingroup$
              That is your system's design problem, is it not?
              $endgroup$
              – Xiaohai Zhang
              Jan 21 at 0:40


















            • $begingroup$
              This does not provide an answer to the question. Once you have sufficient reputation you will be able to comment on any post; instead, provide answers that don't require clarification from the asker. - From Review
              $endgroup$
              – idea
              Jan 20 at 11:33










            • $begingroup$
              That is your system's design problem, is it not?
              $endgroup$
              – Xiaohai Zhang
              Jan 21 at 0:40
















            $begingroup$
            This does not provide an answer to the question. Once you have sufficient reputation you will be able to comment on any post; instead, provide answers that don't require clarification from the asker. - From Review
            $endgroup$
            – idea
            Jan 20 at 11:33




            $begingroup$
            This does not provide an answer to the question. Once you have sufficient reputation you will be able to comment on any post; instead, provide answers that don't require clarification from the asker. - From Review
            $endgroup$
            – idea
            Jan 20 at 11:33












            $begingroup$
            That is your system's design problem, is it not?
            $endgroup$
            – Xiaohai Zhang
            Jan 21 at 0:40




            $begingroup$
            That is your system's design problem, is it not?
            $endgroup$
            – Xiaohai Zhang
            Jan 21 at 0:40


















            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%2f687065%2fintersection-of-cosets-from-possibly-distinct-subgroups-is-either-empty-or-a-cos%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

            Mario Kart Wii

            The Binding of Isaac: Rebirth/Afterbirth

            What does “Dominus providebit” mean?