Idempotents and cyclic codes The Next CEO of Stack OverflowBinary codes behaving differently from other codes?Are cyclic codes good?Cyclic linear codes and idempotentsDescribe all the cyclic codes of length $7$.Codes and CodewordsGenerator polynomial of the sum of cyclic codesHow many cyclic codes are there containing $g(x)$?Idempotents and number of proper cyclic codesIdempotents of binary cyclic codesWhat are dual codes and the codewords denoted by these dual codes in terms of trace?

Why was Sir Cadogan fired?

How can I separate the number from the unit in argument?

Creating a script with console commands

Incomplete cube

Is a linearly independent set whose span is dense a Schauder basis?

Would a grinding machine be a simple and workable propulsion system for an interplanetary spacecraft?

Is it a bad idea to plug the other end of ESD strap to wall ground?

How to show a landlord what we have in savings?

Can I cast Thunderwave and be at the center of its bottom face, but not be affected by it?

Is the 21st century's idea of "freedom of speech" based on precedent?

What did the word "leisure" mean in late 18th Century usage?

Does Germany produce more waste than the US?

Another proof that dividing by 0 does not exist -- is it right?

Shortening a title without changing its meaning

Is it possible to make a 9x9 table fit within the default margins?

Traveling with my 5 year old daughter (as the father) without the mother from Germany to Mexico

Small nick on power cord from an electric alarm clock, and copper wiring exposed but intact

Is it okay to majorly distort historical facts while writing a fiction story?

How seriously should I take size and weight limits of hand luggage?

Mathematica command that allows it to read my intentions

Can you teleport closer to a creature you are Frightened of?

Why do we say “un seul M” and not “une seule M” even though M is a “consonne”?

Calculate the Mean mean of two numbers

Read/write a pipe-delimited file line by line with some simple text manipulation



Idempotents and cyclic codes



The Next CEO of Stack OverflowBinary codes behaving differently from other codes?Are cyclic codes good?Cyclic linear codes and idempotentsDescribe all the cyclic codes of length $7$.Codes and CodewordsGenerator polynomial of the sum of cyclic codesHow many cyclic codes are there containing $g(x)$?Idempotents and number of proper cyclic codesIdempotents of binary cyclic codesWhat are dual codes and the codewords denoted by these dual codes in terms of trace?










1












$begingroup$


Let $C_1 = langle e_1(x) rangle$, $C_2 = langle e_2(x) rangle$ cyclic codes, where $e_1(x)$ and $e_2(x)$ are idempotents.



I know what cyclic codes and idempotents are, but why can one deduce the following: $C_1 subset C_2 Leftrightarrow e_1(x) e_2(x) = e_1(x)$?










share|cite|improve this question











$endgroup$
















    1












    $begingroup$


    Let $C_1 = langle e_1(x) rangle$, $C_2 = langle e_2(x) rangle$ cyclic codes, where $e_1(x)$ and $e_2(x)$ are idempotents.



    I know what cyclic codes and idempotents are, but why can one deduce the following: $C_1 subset C_2 Leftrightarrow e_1(x) e_2(x) = e_1(x)$?










    share|cite|improve this question











    $endgroup$














      1












      1








      1





      $begingroup$


      Let $C_1 = langle e_1(x) rangle$, $C_2 = langle e_2(x) rangle$ cyclic codes, where $e_1(x)$ and $e_2(x)$ are idempotents.



      I know what cyclic codes and idempotents are, but why can one deduce the following: $C_1 subset C_2 Leftrightarrow e_1(x) e_2(x) = e_1(x)$?










      share|cite|improve this question











      $endgroup$




      Let $C_1 = langle e_1(x) rangle$, $C_2 = langle e_2(x) rangle$ cyclic codes, where $e_1(x)$ and $e_2(x)$ are idempotents.



      I know what cyclic codes and idempotents are, but why can one deduce the following: $C_1 subset C_2 Leftrightarrow e_1(x) e_2(x) = e_1(x)$?







      abstract-algebra coding-theory






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 28 at 11:38









      Siddharth Bhat

      3,1821918




      3,1821918










      asked Mar 28 at 11:22









      JohnDJohnD

      338112




      338112




















          2 Answers
          2






          active

          oldest

          votes


















          1












          $begingroup$

          If $C_1 subset C_2$, then note that $e_1 in C_1 in C_2$. Hence $e_1 e_2 = e_2 e_1 = e_1$ because $e_1$ is an idempotent for $C_1$, and we can interpret $e_2$ as an element of $C_1$



          For the other direction, if $e_1 e_2 = e_1$, then let $x in C_1$. Now, $x = e_1 x = e_1 e_2 x = e_2 (e_1 x) = e_2 x$. Hence, $x = e_2 x$, and therefore $x in C_2$.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            Thanks for this really fast answer! What about $C_1 cap C_2 = <e_1(x) e_2(x)> $ ? Why does this hold true?
            $endgroup$
            – JohnD
            Mar 28 at 11:48










          • $begingroup$
            This is from the properties of ideals. If $I = langle x rangle$, $J = langle y rangle$, then $I cap J = langle lcm(x, y) rangle$ in a principal ideal domain. You need to do some work to show that $lcm(e_1, e_2) = e_1e_2$ but that's the idea
            $endgroup$
            – Siddharth Bhat
            Mar 28 at 11:55



















          1












          $begingroup$

          I believe you are talking about an idempotent $e=e(x)in F[x]/(x^n-1)$. The fact you are speaking of is actually true for idempotents in any commutative ring with identity.



          Suppose $e,f$ are two idempotents in a commutative ring $R$.



          Then it is elementary to show that $(e)cap (1-e)=0$ and $(f)cap (1-f)=0$.



          Now if $(e)subseteq (f)$, then $e-ef=e(1-f)in (f)cap (1-f)=0$. Therefore $e=ef$.



          In the other direction, suppose $e=ef$: then clearly $ein (f)$ and $(e)subseteq (f)$.






          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%2f3165758%2fidempotents-and-cyclic-codes%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









            1












            $begingroup$

            If $C_1 subset C_2$, then note that $e_1 in C_1 in C_2$. Hence $e_1 e_2 = e_2 e_1 = e_1$ because $e_1$ is an idempotent for $C_1$, and we can interpret $e_2$ as an element of $C_1$



            For the other direction, if $e_1 e_2 = e_1$, then let $x in C_1$. Now, $x = e_1 x = e_1 e_2 x = e_2 (e_1 x) = e_2 x$. Hence, $x = e_2 x$, and therefore $x in C_2$.






            share|cite|improve this answer









            $endgroup$












            • $begingroup$
              Thanks for this really fast answer! What about $C_1 cap C_2 = <e_1(x) e_2(x)> $ ? Why does this hold true?
              $endgroup$
              – JohnD
              Mar 28 at 11:48










            • $begingroup$
              This is from the properties of ideals. If $I = langle x rangle$, $J = langle y rangle$, then $I cap J = langle lcm(x, y) rangle$ in a principal ideal domain. You need to do some work to show that $lcm(e_1, e_2) = e_1e_2$ but that's the idea
              $endgroup$
              – Siddharth Bhat
              Mar 28 at 11:55
















            1












            $begingroup$

            If $C_1 subset C_2$, then note that $e_1 in C_1 in C_2$. Hence $e_1 e_2 = e_2 e_1 = e_1$ because $e_1$ is an idempotent for $C_1$, and we can interpret $e_2$ as an element of $C_1$



            For the other direction, if $e_1 e_2 = e_1$, then let $x in C_1$. Now, $x = e_1 x = e_1 e_2 x = e_2 (e_1 x) = e_2 x$. Hence, $x = e_2 x$, and therefore $x in C_2$.






            share|cite|improve this answer









            $endgroup$












            • $begingroup$
              Thanks for this really fast answer! What about $C_1 cap C_2 = <e_1(x) e_2(x)> $ ? Why does this hold true?
              $endgroup$
              – JohnD
              Mar 28 at 11:48










            • $begingroup$
              This is from the properties of ideals. If $I = langle x rangle$, $J = langle y rangle$, then $I cap J = langle lcm(x, y) rangle$ in a principal ideal domain. You need to do some work to show that $lcm(e_1, e_2) = e_1e_2$ but that's the idea
              $endgroup$
              – Siddharth Bhat
              Mar 28 at 11:55














            1












            1








            1





            $begingroup$

            If $C_1 subset C_2$, then note that $e_1 in C_1 in C_2$. Hence $e_1 e_2 = e_2 e_1 = e_1$ because $e_1$ is an idempotent for $C_1$, and we can interpret $e_2$ as an element of $C_1$



            For the other direction, if $e_1 e_2 = e_1$, then let $x in C_1$. Now, $x = e_1 x = e_1 e_2 x = e_2 (e_1 x) = e_2 x$. Hence, $x = e_2 x$, and therefore $x in C_2$.






            share|cite|improve this answer









            $endgroup$



            If $C_1 subset C_2$, then note that $e_1 in C_1 in C_2$. Hence $e_1 e_2 = e_2 e_1 = e_1$ because $e_1$ is an idempotent for $C_1$, and we can interpret $e_2$ as an element of $C_1$



            For the other direction, if $e_1 e_2 = e_1$, then let $x in C_1$. Now, $x = e_1 x = e_1 e_2 x = e_2 (e_1 x) = e_2 x$. Hence, $x = e_2 x$, and therefore $x in C_2$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Mar 28 at 11:33









            Siddharth BhatSiddharth Bhat

            3,1821918




            3,1821918











            • $begingroup$
              Thanks for this really fast answer! What about $C_1 cap C_2 = <e_1(x) e_2(x)> $ ? Why does this hold true?
              $endgroup$
              – JohnD
              Mar 28 at 11:48










            • $begingroup$
              This is from the properties of ideals. If $I = langle x rangle$, $J = langle y rangle$, then $I cap J = langle lcm(x, y) rangle$ in a principal ideal domain. You need to do some work to show that $lcm(e_1, e_2) = e_1e_2$ but that's the idea
              $endgroup$
              – Siddharth Bhat
              Mar 28 at 11:55

















            • $begingroup$
              Thanks for this really fast answer! What about $C_1 cap C_2 = <e_1(x) e_2(x)> $ ? Why does this hold true?
              $endgroup$
              – JohnD
              Mar 28 at 11:48










            • $begingroup$
              This is from the properties of ideals. If $I = langle x rangle$, $J = langle y rangle$, then $I cap J = langle lcm(x, y) rangle$ in a principal ideal domain. You need to do some work to show that $lcm(e_1, e_2) = e_1e_2$ but that's the idea
              $endgroup$
              – Siddharth Bhat
              Mar 28 at 11:55
















            $begingroup$
            Thanks for this really fast answer! What about $C_1 cap C_2 = <e_1(x) e_2(x)> $ ? Why does this hold true?
            $endgroup$
            – JohnD
            Mar 28 at 11:48




            $begingroup$
            Thanks for this really fast answer! What about $C_1 cap C_2 = <e_1(x) e_2(x)> $ ? Why does this hold true?
            $endgroup$
            – JohnD
            Mar 28 at 11:48












            $begingroup$
            This is from the properties of ideals. If $I = langle x rangle$, $J = langle y rangle$, then $I cap J = langle lcm(x, y) rangle$ in a principal ideal domain. You need to do some work to show that $lcm(e_1, e_2) = e_1e_2$ but that's the idea
            $endgroup$
            – Siddharth Bhat
            Mar 28 at 11:55





            $begingroup$
            This is from the properties of ideals. If $I = langle x rangle$, $J = langle y rangle$, then $I cap J = langle lcm(x, y) rangle$ in a principal ideal domain. You need to do some work to show that $lcm(e_1, e_2) = e_1e_2$ but that's the idea
            $endgroup$
            – Siddharth Bhat
            Mar 28 at 11:55












            1












            $begingroup$

            I believe you are talking about an idempotent $e=e(x)in F[x]/(x^n-1)$. The fact you are speaking of is actually true for idempotents in any commutative ring with identity.



            Suppose $e,f$ are two idempotents in a commutative ring $R$.



            Then it is elementary to show that $(e)cap (1-e)=0$ and $(f)cap (1-f)=0$.



            Now if $(e)subseteq (f)$, then $e-ef=e(1-f)in (f)cap (1-f)=0$. Therefore $e=ef$.



            In the other direction, suppose $e=ef$: then clearly $ein (f)$ and $(e)subseteq (f)$.






            share|cite|improve this answer









            $endgroup$

















              1












              $begingroup$

              I believe you are talking about an idempotent $e=e(x)in F[x]/(x^n-1)$. The fact you are speaking of is actually true for idempotents in any commutative ring with identity.



              Suppose $e,f$ are two idempotents in a commutative ring $R$.



              Then it is elementary to show that $(e)cap (1-e)=0$ and $(f)cap (1-f)=0$.



              Now if $(e)subseteq (f)$, then $e-ef=e(1-f)in (f)cap (1-f)=0$. Therefore $e=ef$.



              In the other direction, suppose $e=ef$: then clearly $ein (f)$ and $(e)subseteq (f)$.






              share|cite|improve this answer









              $endgroup$















                1












                1








                1





                $begingroup$

                I believe you are talking about an idempotent $e=e(x)in F[x]/(x^n-1)$. The fact you are speaking of is actually true for idempotents in any commutative ring with identity.



                Suppose $e,f$ are two idempotents in a commutative ring $R$.



                Then it is elementary to show that $(e)cap (1-e)=0$ and $(f)cap (1-f)=0$.



                Now if $(e)subseteq (f)$, then $e-ef=e(1-f)in (f)cap (1-f)=0$. Therefore $e=ef$.



                In the other direction, suppose $e=ef$: then clearly $ein (f)$ and $(e)subseteq (f)$.






                share|cite|improve this answer









                $endgroup$



                I believe you are talking about an idempotent $e=e(x)in F[x]/(x^n-1)$. The fact you are speaking of is actually true for idempotents in any commutative ring with identity.



                Suppose $e,f$ are two idempotents in a commutative ring $R$.



                Then it is elementary to show that $(e)cap (1-e)=0$ and $(f)cap (1-f)=0$.



                Now if $(e)subseteq (f)$, then $e-ef=e(1-f)in (f)cap (1-f)=0$. Therefore $e=ef$.



                In the other direction, suppose $e=ef$: then clearly $ein (f)$ and $(e)subseteq (f)$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Mar 28 at 15:03









                rschwiebrschwieb

                107k12103252




                107k12103252



























                    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%2f3165758%2fidempotents-and-cyclic-codes%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

                    Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

                    Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

                    Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ