A difficulty in understanding a proof of well definedness of an action












1














The proof that an action is well defined is given in the following picture:



enter image description here



But I did not understand it because I know that to prove that an action is well defined I have to show that:



$$ bar{k_{1}} = bar{k_{2}} Rightarrow bar{k_{1}}.a = bar{k_{1}}.a Rightarrow k_{1}a = k_{2}a $$



So how is this applied in the proof given in the picture, could anyone explain this for me?



Thanks!










share|cite|improve this question
























  • The proof is confusing because it uses the same notation $overline k$ for an element of $mathbf Z_n$ and for a specific representitive thereof in $mathbf Z$.
    – Hagen von Eitzen
    Oct 25 '17 at 11:50
















1














The proof that an action is well defined is given in the following picture:



enter image description here



But I did not understand it because I know that to prove that an action is well defined I have to show that:



$$ bar{k_{1}} = bar{k_{2}} Rightarrow bar{k_{1}}.a = bar{k_{1}}.a Rightarrow k_{1}a = k_{2}a $$



So how is this applied in the proof given in the picture, could anyone explain this for me?



Thanks!










share|cite|improve this question
























  • The proof is confusing because it uses the same notation $overline k$ for an element of $mathbf Z_n$ and for a specific representitive thereof in $mathbf Z$.
    – Hagen von Eitzen
    Oct 25 '17 at 11:50














1












1








1







The proof that an action is well defined is given in the following picture:



enter image description here



But I did not understand it because I know that to prove that an action is well defined I have to show that:



$$ bar{k_{1}} = bar{k_{2}} Rightarrow bar{k_{1}}.a = bar{k_{1}}.a Rightarrow k_{1}a = k_{2}a $$



So how is this applied in the proof given in the picture, could anyone explain this for me?



Thanks!










share|cite|improve this question















The proof that an action is well defined is given in the following picture:



enter image description here



But I did not understand it because I know that to prove that an action is well defined I have to show that:



$$ bar{k_{1}} = bar{k_{2}} Rightarrow bar{k_{1}}.a = bar{k_{1}}.a Rightarrow k_{1}a = k_{2}a $$



So how is this applied in the proof given in the picture, could anyone explain this for me?



Thanks!







abstract-algebra modules






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Oct 25 '17 at 11:47









Jean Marie

28.9k41949




28.9k41949










asked Oct 25 '17 at 11:42







user426277



















  • The proof is confusing because it uses the same notation $overline k$ for an element of $mathbf Z_n$ and for a specific representitive thereof in $mathbf Z$.
    – Hagen von Eitzen
    Oct 25 '17 at 11:50


















  • The proof is confusing because it uses the same notation $overline k$ for an element of $mathbf Z_n$ and for a specific representitive thereof in $mathbf Z$.
    – Hagen von Eitzen
    Oct 25 '17 at 11:50
















The proof is confusing because it uses the same notation $overline k$ for an element of $mathbf Z_n$ and for a specific representitive thereof in $mathbf Z$.
– Hagen von Eitzen
Oct 25 '17 at 11:50




The proof is confusing because it uses the same notation $overline k$ for an element of $mathbf Z_n$ and for a specific representitive thereof in $mathbf Z$.
– Hagen von Eitzen
Oct 25 '17 at 11:50










3 Answers
3






active

oldest

votes


















1














You are right, and this is what they prove they show that



$$ka = (nm_k + overline k)a = m_k(na)+overline k a = overline k a$$Hence,



In particular, this means that if $k_1,k_2inmathbb{Z}$ are such that $overline k_1 = overline k_2$ then $k_1a=k_2a$.



Why? Let $l=overline k_1 = overline k_2$ then



write $k_1 = n m_1 + l$ and $k_2 = nm_2+l$ and apply the same computation we have
$$k_1a = (nm_1+l)a =m_1 (na) + la = la$$
$$k_2 a = (nm_2+l)a = m_2(na) + la = la$$






share|cite|improve this answer





























    1














    The way that you have framed the proof that a function is well-defined is not the only way to do so. This proof is also a bit confusing in that the author uses $bar k$ to represent a specific element of $mathbf Z$ rather than the associated equivalence class. Perhaps you will find this proof more accessible if we frame it in your terms:



    Suppose that $k_1,k_2$ are such that $bar k_1 = bar k_2$ (i.e. they are in the same equivalence class in $mathbf Z_n$). As such, both numbers have the same remainder $r$ when divided by $n$. That is, we can write
    $$
    k_1 = nm_1 + r\
    k_2 = nm_2 + r
    $$
    for some fixed $r$ with $0 leq r < n$ (this $r$ plays the role of what the author calls $bar k$).



    We now have
    $$
    k_1a = (nm_1 + r)a = m_1(na) + ra = ra\
    k_2a = (nm_2 + r)a = m_2(na) + ra = ra
    $$
    So, we have deduced that if $bar k_1 = bar k_2$, then $k_1 a = k_2 a$, as desired.





    If we want to get a bit closer to the author's idea in this proof, note that we can define the function by $k a = r_ka$, where $k = nm_k + r_k$ for some $0 leq r_k < n$. Noting that each equivalence class has a canonical representative $0 leq r < n$, we can say that our proof above was equivalent to showing that for every $r$: $bar k = bar r$ implies that $r = r_k$, which implies that $ka = ra$.






    share|cite|improve this answer































      1














      Well-defined in this context means "independent of representative".



      If you write $overline{k}$ for a member of $mathbb{Z}_n$ you have to realise that $k$ is not unique, but if we take $k+n$ then (in $mathbb{Z}_n$) $overline{k+n} = overline{k}$, as two numbers that are a multiple of $n$ apart are equivalent modulo $n$. To get an operation like scalar multiplication we need a function from $mathbb{Z}_n times A to A$, so if we can write the same element of $mathbb{Z}_n$ in two ways that give the same element, we need to check that the image is still the same regardless. As the formula is now defined it explicitly depends on the representative of a class.



      So if we define $overline{k}a = ka$ for $a in A$ we need to check that $ka$ and $(k+n)a$ become the same element of $A$. In this case we get that this holds as $(k+n)a = ka + na = ka$ as $na=0$, so multiplying by multiples of $n$ just creates $0$.. This is what is done in the second paragraph of the proof.






      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',
        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%2f2489041%2fa-difficulty-in-understanding-a-proof-of-well-definedness-of-an-action%23new-answer', 'question_page');
        }
        );

        Post as a guest















        Required, but never shown
























        3 Answers
        3






        active

        oldest

        votes








        3 Answers
        3






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes









        1














        You are right, and this is what they prove they show that



        $$ka = (nm_k + overline k)a = m_k(na)+overline k a = overline k a$$Hence,



        In particular, this means that if $k_1,k_2inmathbb{Z}$ are such that $overline k_1 = overline k_2$ then $k_1a=k_2a$.



        Why? Let $l=overline k_1 = overline k_2$ then



        write $k_1 = n m_1 + l$ and $k_2 = nm_2+l$ and apply the same computation we have
        $$k_1a = (nm_1+l)a =m_1 (na) + la = la$$
        $$k_2 a = (nm_2+l)a = m_2(na) + la = la$$






        share|cite|improve this answer


























          1














          You are right, and this is what they prove they show that



          $$ka = (nm_k + overline k)a = m_k(na)+overline k a = overline k a$$Hence,



          In particular, this means that if $k_1,k_2inmathbb{Z}$ are such that $overline k_1 = overline k_2$ then $k_1a=k_2a$.



          Why? Let $l=overline k_1 = overline k_2$ then



          write $k_1 = n m_1 + l$ and $k_2 = nm_2+l$ and apply the same computation we have
          $$k_1a = (nm_1+l)a =m_1 (na) + la = la$$
          $$k_2 a = (nm_2+l)a = m_2(na) + la = la$$






          share|cite|improve this answer
























            1












            1








            1






            You are right, and this is what they prove they show that



            $$ka = (nm_k + overline k)a = m_k(na)+overline k a = overline k a$$Hence,



            In particular, this means that if $k_1,k_2inmathbb{Z}$ are such that $overline k_1 = overline k_2$ then $k_1a=k_2a$.



            Why? Let $l=overline k_1 = overline k_2$ then



            write $k_1 = n m_1 + l$ and $k_2 = nm_2+l$ and apply the same computation we have
            $$k_1a = (nm_1+l)a =m_1 (na) + la = la$$
            $$k_2 a = (nm_2+l)a = m_2(na) + la = la$$






            share|cite|improve this answer












            You are right, and this is what they prove they show that



            $$ka = (nm_k + overline k)a = m_k(na)+overline k a = overline k a$$Hence,



            In particular, this means that if $k_1,k_2inmathbb{Z}$ are such that $overline k_1 = overline k_2$ then $k_1a=k_2a$.



            Why? Let $l=overline k_1 = overline k_2$ then



            write $k_1 = n m_1 + l$ and $k_2 = nm_2+l$ and apply the same computation we have
            $$k_1a = (nm_1+l)a =m_1 (na) + la = la$$
            $$k_2 a = (nm_2+l)a = m_2(na) + la = la$$







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Oct 25 '17 at 11:50









            YankoYanko

            6,469727




            6,469727























                1














                The way that you have framed the proof that a function is well-defined is not the only way to do so. This proof is also a bit confusing in that the author uses $bar k$ to represent a specific element of $mathbf Z$ rather than the associated equivalence class. Perhaps you will find this proof more accessible if we frame it in your terms:



                Suppose that $k_1,k_2$ are such that $bar k_1 = bar k_2$ (i.e. they are in the same equivalence class in $mathbf Z_n$). As such, both numbers have the same remainder $r$ when divided by $n$. That is, we can write
                $$
                k_1 = nm_1 + r\
                k_2 = nm_2 + r
                $$
                for some fixed $r$ with $0 leq r < n$ (this $r$ plays the role of what the author calls $bar k$).



                We now have
                $$
                k_1a = (nm_1 + r)a = m_1(na) + ra = ra\
                k_2a = (nm_2 + r)a = m_2(na) + ra = ra
                $$
                So, we have deduced that if $bar k_1 = bar k_2$, then $k_1 a = k_2 a$, as desired.





                If we want to get a bit closer to the author's idea in this proof, note that we can define the function by $k a = r_ka$, where $k = nm_k + r_k$ for some $0 leq r_k < n$. Noting that each equivalence class has a canonical representative $0 leq r < n$, we can say that our proof above was equivalent to showing that for every $r$: $bar k = bar r$ implies that $r = r_k$, which implies that $ka = ra$.






                share|cite|improve this answer




























                  1














                  The way that you have framed the proof that a function is well-defined is not the only way to do so. This proof is also a bit confusing in that the author uses $bar k$ to represent a specific element of $mathbf Z$ rather than the associated equivalence class. Perhaps you will find this proof more accessible if we frame it in your terms:



                  Suppose that $k_1,k_2$ are such that $bar k_1 = bar k_2$ (i.e. they are in the same equivalence class in $mathbf Z_n$). As such, both numbers have the same remainder $r$ when divided by $n$. That is, we can write
                  $$
                  k_1 = nm_1 + r\
                  k_2 = nm_2 + r
                  $$
                  for some fixed $r$ with $0 leq r < n$ (this $r$ plays the role of what the author calls $bar k$).



                  We now have
                  $$
                  k_1a = (nm_1 + r)a = m_1(na) + ra = ra\
                  k_2a = (nm_2 + r)a = m_2(na) + ra = ra
                  $$
                  So, we have deduced that if $bar k_1 = bar k_2$, then $k_1 a = k_2 a$, as desired.





                  If we want to get a bit closer to the author's idea in this proof, note that we can define the function by $k a = r_ka$, where $k = nm_k + r_k$ for some $0 leq r_k < n$. Noting that each equivalence class has a canonical representative $0 leq r < n$, we can say that our proof above was equivalent to showing that for every $r$: $bar k = bar r$ implies that $r = r_k$, which implies that $ka = ra$.






                  share|cite|improve this answer


























                    1












                    1








                    1






                    The way that you have framed the proof that a function is well-defined is not the only way to do so. This proof is also a bit confusing in that the author uses $bar k$ to represent a specific element of $mathbf Z$ rather than the associated equivalence class. Perhaps you will find this proof more accessible if we frame it in your terms:



                    Suppose that $k_1,k_2$ are such that $bar k_1 = bar k_2$ (i.e. they are in the same equivalence class in $mathbf Z_n$). As such, both numbers have the same remainder $r$ when divided by $n$. That is, we can write
                    $$
                    k_1 = nm_1 + r\
                    k_2 = nm_2 + r
                    $$
                    for some fixed $r$ with $0 leq r < n$ (this $r$ plays the role of what the author calls $bar k$).



                    We now have
                    $$
                    k_1a = (nm_1 + r)a = m_1(na) + ra = ra\
                    k_2a = (nm_2 + r)a = m_2(na) + ra = ra
                    $$
                    So, we have deduced that if $bar k_1 = bar k_2$, then $k_1 a = k_2 a$, as desired.





                    If we want to get a bit closer to the author's idea in this proof, note that we can define the function by $k a = r_ka$, where $k = nm_k + r_k$ for some $0 leq r_k < n$. Noting that each equivalence class has a canonical representative $0 leq r < n$, we can say that our proof above was equivalent to showing that for every $r$: $bar k = bar r$ implies that $r = r_k$, which implies that $ka = ra$.






                    share|cite|improve this answer














                    The way that you have framed the proof that a function is well-defined is not the only way to do so. This proof is also a bit confusing in that the author uses $bar k$ to represent a specific element of $mathbf Z$ rather than the associated equivalence class. Perhaps you will find this proof more accessible if we frame it in your terms:



                    Suppose that $k_1,k_2$ are such that $bar k_1 = bar k_2$ (i.e. they are in the same equivalence class in $mathbf Z_n$). As such, both numbers have the same remainder $r$ when divided by $n$. That is, we can write
                    $$
                    k_1 = nm_1 + r\
                    k_2 = nm_2 + r
                    $$
                    for some fixed $r$ with $0 leq r < n$ (this $r$ plays the role of what the author calls $bar k$).



                    We now have
                    $$
                    k_1a = (nm_1 + r)a = m_1(na) + ra = ra\
                    k_2a = (nm_2 + r)a = m_2(na) + ra = ra
                    $$
                    So, we have deduced that if $bar k_1 = bar k_2$, then $k_1 a = k_2 a$, as desired.





                    If we want to get a bit closer to the author's idea in this proof, note that we can define the function by $k a = r_ka$, where $k = nm_k + r_k$ for some $0 leq r_k < n$. Noting that each equivalence class has a canonical representative $0 leq r < n$, we can say that our proof above was equivalent to showing that for every $r$: $bar k = bar r$ implies that $r = r_k$, which implies that $ka = ra$.







                    share|cite|improve this answer














                    share|cite|improve this answer



                    share|cite|improve this answer








                    edited Oct 25 '17 at 12:06

























                    answered Oct 25 '17 at 11:59









                    OmnomnomnomOmnomnomnom

                    127k788176




                    127k788176























                        1














                        Well-defined in this context means "independent of representative".



                        If you write $overline{k}$ for a member of $mathbb{Z}_n$ you have to realise that $k$ is not unique, but if we take $k+n$ then (in $mathbb{Z}_n$) $overline{k+n} = overline{k}$, as two numbers that are a multiple of $n$ apart are equivalent modulo $n$. To get an operation like scalar multiplication we need a function from $mathbb{Z}_n times A to A$, so if we can write the same element of $mathbb{Z}_n$ in two ways that give the same element, we need to check that the image is still the same regardless. As the formula is now defined it explicitly depends on the representative of a class.



                        So if we define $overline{k}a = ka$ for $a in A$ we need to check that $ka$ and $(k+n)a$ become the same element of $A$. In this case we get that this holds as $(k+n)a = ka + na = ka$ as $na=0$, so multiplying by multiples of $n$ just creates $0$.. This is what is done in the second paragraph of the proof.






                        share|cite|improve this answer




























                          1














                          Well-defined in this context means "independent of representative".



                          If you write $overline{k}$ for a member of $mathbb{Z}_n$ you have to realise that $k$ is not unique, but if we take $k+n$ then (in $mathbb{Z}_n$) $overline{k+n} = overline{k}$, as two numbers that are a multiple of $n$ apart are equivalent modulo $n$. To get an operation like scalar multiplication we need a function from $mathbb{Z}_n times A to A$, so if we can write the same element of $mathbb{Z}_n$ in two ways that give the same element, we need to check that the image is still the same regardless. As the formula is now defined it explicitly depends on the representative of a class.



                          So if we define $overline{k}a = ka$ for $a in A$ we need to check that $ka$ and $(k+n)a$ become the same element of $A$. In this case we get that this holds as $(k+n)a = ka + na = ka$ as $na=0$, so multiplying by multiples of $n$ just creates $0$.. This is what is done in the second paragraph of the proof.






                          share|cite|improve this answer


























                            1












                            1








                            1






                            Well-defined in this context means "independent of representative".



                            If you write $overline{k}$ for a member of $mathbb{Z}_n$ you have to realise that $k$ is not unique, but if we take $k+n$ then (in $mathbb{Z}_n$) $overline{k+n} = overline{k}$, as two numbers that are a multiple of $n$ apart are equivalent modulo $n$. To get an operation like scalar multiplication we need a function from $mathbb{Z}_n times A to A$, so if we can write the same element of $mathbb{Z}_n$ in two ways that give the same element, we need to check that the image is still the same regardless. As the formula is now defined it explicitly depends on the representative of a class.



                            So if we define $overline{k}a = ka$ for $a in A$ we need to check that $ka$ and $(k+n)a$ become the same element of $A$. In this case we get that this holds as $(k+n)a = ka + na = ka$ as $na=0$, so multiplying by multiples of $n$ just creates $0$.. This is what is done in the second paragraph of the proof.






                            share|cite|improve this answer














                            Well-defined in this context means "independent of representative".



                            If you write $overline{k}$ for a member of $mathbb{Z}_n$ you have to realise that $k$ is not unique, but if we take $k+n$ then (in $mathbb{Z}_n$) $overline{k+n} = overline{k}$, as two numbers that are a multiple of $n$ apart are equivalent modulo $n$. To get an operation like scalar multiplication we need a function from $mathbb{Z}_n times A to A$, so if we can write the same element of $mathbb{Z}_n$ in two ways that give the same element, we need to check that the image is still the same regardless. As the formula is now defined it explicitly depends on the representative of a class.



                            So if we define $overline{k}a = ka$ for $a in A$ we need to check that $ka$ and $(k+n)a$ become the same element of $A$. In this case we get that this holds as $(k+n)a = ka + na = ka$ as $na=0$, so multiplying by multiples of $n$ just creates $0$.. This is what is done in the second paragraph of the proof.







                            share|cite|improve this answer














                            share|cite|improve this answer



                            share|cite|improve this answer








                            edited Jan 5 at 18:47

























                            answered Oct 25 '17 at 11:56









                            Henno BrandsmaHenno Brandsma

                            105k347114




                            105k347114






























                                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.





                                Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                                Please pay close attention to the following guidance:


                                • 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.


                                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%2f2489041%2fa-difficulty-in-understanding-a-proof-of-well-definedness-of-an-action%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?