Is there a function such that $f(xyz)=f(x)f(y)f(z)$, for any $x,y,zin G$ but $f$ is not an endomorphism?Can you always find a surjective endomorphism of groups such that it is not injective?If $G$ is a finite group, then $operatornameordS(a)=operatornameord(G)/operatornameOrd(C(a))$Elementary Properties of cyclic groupsFinite order of an element $f(g)$ of a homomorphism $f$Is there any group $G$ with $ord(G)=20$ so that $varphi:Grightarrow mathbbZ_15$ is epimorphism?For which finite groups $G$ and $H$ does only one homomorphism $Grightarrow H$ exist?Is there any finite group G such that G has no subgroup of order $d_1$, $d_2$ but have a subgroup of order $d_1 d_2$Prove that $G$ is abelian if there exists $min mathbbN$, so that $f(x)=x^m$, $f in Aut(G)$The number of idempotent endomorphisms of a finite groupExistence of a group morphism between an arbitrary group and an abelian group.

Vocabulary for giving just numbers, not a full answer

Recommendation letter by significant other if you worked with them professionally?

Virginia employer terminated employee and wants signing bonus returned

An alternative proof of an application of Hahn-Banach

Conservation of Mass and Energy

How does NOW work?

Accountant/ lawyer will not return my call

Word for a person who has no opinion about whether god exists

Are there historical instances of the capital of a colonising country being temporarily or permanently shifted to one of its colonies?

Database Backup for data and log files

How are showroom/display vehicles prepared?

What do you call someone who likes to pick fights?

UART pins to unpowered MCU?

Is "history" a male-biased word ("his+story")?

Are babies of evil humanoid species inherently evil?

meaning and function of 幸 in "则幸分我一杯羹"

What wound would be of little consequence to a biped but terrible for a quadruped?

What's the "normal" opposite of flautando?

Hotkey (or other quick way) to insert a keyframe for only one component of a vector-valued property?

Coax or bifilar choke

When traveling to Europe from North America, do I need to purchase a different power strip?

How to detect if C code (which needs 'extern C') is compiled in C++

Accepted offer letter, position changed

finite abelian groups tensor product.



Is there a function such that $f(xyz)=f(x)f(y)f(z)$, for any $x,y,zin G$ but $f$ is not an endomorphism?


Can you always find a surjective endomorphism of groups such that it is not injective?If $G$ is a finite group, then $operatornameordS(a)=operatornameord(G)/operatornameOrd(C(a))$Elementary Properties of cyclic groupsFinite order of an element $f(g)$ of a homomorphism $f$Is there any group $G$ with $ord(G)=20$ so that $varphi:Grightarrow mathbbZ_15$ is epimorphism?For which finite groups $G$ and $H$ does only one homomorphism $Grightarrow H$ exist?Is there any finite group G such that G has no subgroup of order $d_1$, $d_2$ but have a subgroup of order $d_1 d_2$Prove that $G$ is abelian if there exists $min mathbbN$, so that $f(x)=x^m$, $f in Aut(G)$The number of idempotent endomorphisms of a finite groupExistence of a group morphism between an arbitrary group and an abelian group.













1












$begingroup$



I am required to show that, for a $ninmathbbN$ and $(G,cdot)$ a finite group of order $n$, if $n$ is even there is a function $f:G rightarrow G$ such that $f(xyz)=f(x)f(y)f(z)$, for any $x,y,zin G$ but $f$ is not an endomorphism. Is this true for $n$ odd?




I chose $DeclareMathOperatorordordf(x)=ord(x)$, but I am unsure that $ord(xy)=ord(x)ord(y)$ for any $x,yin G$.



At least I obtained that it is not a morphism if it respects that property, because indeed as for $e=a^kla^pha^-1$, where $(k,p)=1$ and $kl+ph=1$, $f(e)=f(a^kla^pha^-1)=-klph$, which is false if $f$ is a morphism.










share|cite|improve this question









New contributor




user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$











  • $begingroup$
    What have you tried? It's false for $n=1$, and most likely you've tried some small values such as $n=2,3$: what did you get? And write "every" instead of "a" which is unclear as it may mean "some". Next, $f(x)=mathrmord(x)$ is not a self-map of $G$, but is a map from $G$ to $mathbfN$.
    $endgroup$
    – YCor
    2 days ago











  • $begingroup$
    Your proposed function doesn’t work because in general, the order of a product is not the product of their orders. For a simple counterexample, consider the case in which $x=y^-1$, where $xy=e$.
    $endgroup$
    – Arturo Magidin
    2 days ago










  • $begingroup$
    First of all, $ord$ is not a function from $mathbb G$ into $mathbb G$.
    $endgroup$
    – enedil
    2 days ago















1












$begingroup$



I am required to show that, for a $ninmathbbN$ and $(G,cdot)$ a finite group of order $n$, if $n$ is even there is a function $f:G rightarrow G$ such that $f(xyz)=f(x)f(y)f(z)$, for any $x,y,zin G$ but $f$ is not an endomorphism. Is this true for $n$ odd?




I chose $DeclareMathOperatorordordf(x)=ord(x)$, but I am unsure that $ord(xy)=ord(x)ord(y)$ for any $x,yin G$.



At least I obtained that it is not a morphism if it respects that property, because indeed as for $e=a^kla^pha^-1$, where $(k,p)=1$ and $kl+ph=1$, $f(e)=f(a^kla^pha^-1)=-klph$, which is false if $f$ is a morphism.










share|cite|improve this question









New contributor




user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$











  • $begingroup$
    What have you tried? It's false for $n=1$, and most likely you've tried some small values such as $n=2,3$: what did you get? And write "every" instead of "a" which is unclear as it may mean "some". Next, $f(x)=mathrmord(x)$ is not a self-map of $G$, but is a map from $G$ to $mathbfN$.
    $endgroup$
    – YCor
    2 days ago











  • $begingroup$
    Your proposed function doesn’t work because in general, the order of a product is not the product of their orders. For a simple counterexample, consider the case in which $x=y^-1$, where $xy=e$.
    $endgroup$
    – Arturo Magidin
    2 days ago










  • $begingroup$
    First of all, $ord$ is not a function from $mathbb G$ into $mathbb G$.
    $endgroup$
    – enedil
    2 days ago













1












1








1





$begingroup$



I am required to show that, for a $ninmathbbN$ and $(G,cdot)$ a finite group of order $n$, if $n$ is even there is a function $f:G rightarrow G$ such that $f(xyz)=f(x)f(y)f(z)$, for any $x,y,zin G$ but $f$ is not an endomorphism. Is this true for $n$ odd?




I chose $DeclareMathOperatorordordf(x)=ord(x)$, but I am unsure that $ord(xy)=ord(x)ord(y)$ for any $x,yin G$.



At least I obtained that it is not a morphism if it respects that property, because indeed as for $e=a^kla^pha^-1$, where $(k,p)=1$ and $kl+ph=1$, $f(e)=f(a^kla^pha^-1)=-klph$, which is false if $f$ is a morphism.










share|cite|improve this question









New contributor




user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$





I am required to show that, for a $ninmathbbN$ and $(G,cdot)$ a finite group of order $n$, if $n$ is even there is a function $f:G rightarrow G$ such that $f(xyz)=f(x)f(y)f(z)$, for any $x,y,zin G$ but $f$ is not an endomorphism. Is this true for $n$ odd?




I chose $DeclareMathOperatorordordf(x)=ord(x)$, but I am unsure that $ord(xy)=ord(x)ord(y)$ for any $x,yin G$.



At least I obtained that it is not a morphism if it respects that property, because indeed as for $e=a^kla^pha^-1$, where $(k,p)=1$ and $kl+ph=1$, $f(e)=f(a^kla^pha^-1)=-klph$, which is false if $f$ is a morphism.







abstract-algebra group-theory finite-groups






share|cite|improve this question









New contributor




user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited 2 days ago









egreg

184k1486205




184k1486205






New contributor




user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 2 days ago









user651754user651754

454




454




New contributor




user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






user651754 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











  • $begingroup$
    What have you tried? It's false for $n=1$, and most likely you've tried some small values such as $n=2,3$: what did you get? And write "every" instead of "a" which is unclear as it may mean "some". Next, $f(x)=mathrmord(x)$ is not a self-map of $G$, but is a map from $G$ to $mathbfN$.
    $endgroup$
    – YCor
    2 days ago











  • $begingroup$
    Your proposed function doesn’t work because in general, the order of a product is not the product of their orders. For a simple counterexample, consider the case in which $x=y^-1$, where $xy=e$.
    $endgroup$
    – Arturo Magidin
    2 days ago










  • $begingroup$
    First of all, $ord$ is not a function from $mathbb G$ into $mathbb G$.
    $endgroup$
    – enedil
    2 days ago
















  • $begingroup$
    What have you tried? It's false for $n=1$, and most likely you've tried some small values such as $n=2,3$: what did you get? And write "every" instead of "a" which is unclear as it may mean "some". Next, $f(x)=mathrmord(x)$ is not a self-map of $G$, but is a map from $G$ to $mathbfN$.
    $endgroup$
    – YCor
    2 days ago











  • $begingroup$
    Your proposed function doesn’t work because in general, the order of a product is not the product of their orders. For a simple counterexample, consider the case in which $x=y^-1$, where $xy=e$.
    $endgroup$
    – Arturo Magidin
    2 days ago










  • $begingroup$
    First of all, $ord$ is not a function from $mathbb G$ into $mathbb G$.
    $endgroup$
    – enedil
    2 days ago















$begingroup$
What have you tried? It's false for $n=1$, and most likely you've tried some small values such as $n=2,3$: what did you get? And write "every" instead of "a" which is unclear as it may mean "some". Next, $f(x)=mathrmord(x)$ is not a self-map of $G$, but is a map from $G$ to $mathbfN$.
$endgroup$
– YCor
2 days ago





$begingroup$
What have you tried? It's false for $n=1$, and most likely you've tried some small values such as $n=2,3$: what did you get? And write "every" instead of "a" which is unclear as it may mean "some". Next, $f(x)=mathrmord(x)$ is not a self-map of $G$, but is a map from $G$ to $mathbfN$.
$endgroup$
– YCor
2 days ago













$begingroup$
Your proposed function doesn’t work because in general, the order of a product is not the product of their orders. For a simple counterexample, consider the case in which $x=y^-1$, where $xy=e$.
$endgroup$
– Arturo Magidin
2 days ago




$begingroup$
Your proposed function doesn’t work because in general, the order of a product is not the product of their orders. For a simple counterexample, consider the case in which $x=y^-1$, where $xy=e$.
$endgroup$
– Arturo Magidin
2 days ago












$begingroup$
First of all, $ord$ is not a function from $mathbb G$ into $mathbb G$.
$endgroup$
– enedil
2 days ago




$begingroup$
First of all, $ord$ is not a function from $mathbb G$ into $mathbb G$.
$endgroup$
– enedil
2 days ago










1 Answer
1






active

oldest

votes


















4












$begingroup$

First of all note that $f(e)=f(e)^3$ and so $f(e)^2=e$. This gives us a hint about $f(e)$.



So if $n$ is even then pick $gin G$ such that $g^2=e$, $gneq e$ (which exists by Cauchy's theorem) and define $f(x)=g$, i.e. the constant function at $g$. Obviously $f(xyz)=f(x)f(y)f(z)$ regardless of what $x,y,z$ are. But since $gneq e$ then $f$ is not a group homomorphism.



Now if $n$ is odd then the condition $f(e)^2=e$ implies that $f(e)=e$. And therefore for any $x,y$ we have



$$f(xy)=f(exy)=f(e)f(x)f(y)=f(x)f(y)$$



and so $f$ is a group homomorphism.




but I am unsure that $ord(xy)=ord(x)ord(y)$ for any $x,yin G$.




If $G$ is non-trivial then that never holds for all $x,y$. Consider $xneq e$ and $y=x^-1$. You can also easily check that $ord$ does not satisfy the original condition as well, i.e. consider $ord(exx^-1)$.



Also talking about $ord$ does not make sense to begin with since the codomain of $ord$ is $mathbbN$, it's not even a group. Not to mention that domain and codomain are different although that assumption is unnecessary.






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
    );



    );






    user651754 is a new contributor. Be nice, and check out our Code of Conduct.









    draft saved

    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3141546%2fis-there-a-function-such-that-fxyz-fxfyfz-for-any-x-y-z-in-g-but-f%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









    4












    $begingroup$

    First of all note that $f(e)=f(e)^3$ and so $f(e)^2=e$. This gives us a hint about $f(e)$.



    So if $n$ is even then pick $gin G$ such that $g^2=e$, $gneq e$ (which exists by Cauchy's theorem) and define $f(x)=g$, i.e. the constant function at $g$. Obviously $f(xyz)=f(x)f(y)f(z)$ regardless of what $x,y,z$ are. But since $gneq e$ then $f$ is not a group homomorphism.



    Now if $n$ is odd then the condition $f(e)^2=e$ implies that $f(e)=e$. And therefore for any $x,y$ we have



    $$f(xy)=f(exy)=f(e)f(x)f(y)=f(x)f(y)$$



    and so $f$ is a group homomorphism.




    but I am unsure that $ord(xy)=ord(x)ord(y)$ for any $x,yin G$.




    If $G$ is non-trivial then that never holds for all $x,y$. Consider $xneq e$ and $y=x^-1$. You can also easily check that $ord$ does not satisfy the original condition as well, i.e. consider $ord(exx^-1)$.



    Also talking about $ord$ does not make sense to begin with since the codomain of $ord$ is $mathbbN$, it's not even a group. Not to mention that domain and codomain are different although that assumption is unnecessary.






    share|cite|improve this answer











    $endgroup$

















      4












      $begingroup$

      First of all note that $f(e)=f(e)^3$ and so $f(e)^2=e$. This gives us a hint about $f(e)$.



      So if $n$ is even then pick $gin G$ such that $g^2=e$, $gneq e$ (which exists by Cauchy's theorem) and define $f(x)=g$, i.e. the constant function at $g$. Obviously $f(xyz)=f(x)f(y)f(z)$ regardless of what $x,y,z$ are. But since $gneq e$ then $f$ is not a group homomorphism.



      Now if $n$ is odd then the condition $f(e)^2=e$ implies that $f(e)=e$. And therefore for any $x,y$ we have



      $$f(xy)=f(exy)=f(e)f(x)f(y)=f(x)f(y)$$



      and so $f$ is a group homomorphism.




      but I am unsure that $ord(xy)=ord(x)ord(y)$ for any $x,yin G$.




      If $G$ is non-trivial then that never holds for all $x,y$. Consider $xneq e$ and $y=x^-1$. You can also easily check that $ord$ does not satisfy the original condition as well, i.e. consider $ord(exx^-1)$.



      Also talking about $ord$ does not make sense to begin with since the codomain of $ord$ is $mathbbN$, it's not even a group. Not to mention that domain and codomain are different although that assumption is unnecessary.






      share|cite|improve this answer











      $endgroup$















        4












        4








        4





        $begingroup$

        First of all note that $f(e)=f(e)^3$ and so $f(e)^2=e$. This gives us a hint about $f(e)$.



        So if $n$ is even then pick $gin G$ such that $g^2=e$, $gneq e$ (which exists by Cauchy's theorem) and define $f(x)=g$, i.e. the constant function at $g$. Obviously $f(xyz)=f(x)f(y)f(z)$ regardless of what $x,y,z$ are. But since $gneq e$ then $f$ is not a group homomorphism.



        Now if $n$ is odd then the condition $f(e)^2=e$ implies that $f(e)=e$. And therefore for any $x,y$ we have



        $$f(xy)=f(exy)=f(e)f(x)f(y)=f(x)f(y)$$



        and so $f$ is a group homomorphism.




        but I am unsure that $ord(xy)=ord(x)ord(y)$ for any $x,yin G$.




        If $G$ is non-trivial then that never holds for all $x,y$. Consider $xneq e$ and $y=x^-1$. You can also easily check that $ord$ does not satisfy the original condition as well, i.e. consider $ord(exx^-1)$.



        Also talking about $ord$ does not make sense to begin with since the codomain of $ord$ is $mathbbN$, it's not even a group. Not to mention that domain and codomain are different although that assumption is unnecessary.






        share|cite|improve this answer











        $endgroup$



        First of all note that $f(e)=f(e)^3$ and so $f(e)^2=e$. This gives us a hint about $f(e)$.



        So if $n$ is even then pick $gin G$ such that $g^2=e$, $gneq e$ (which exists by Cauchy's theorem) and define $f(x)=g$, i.e. the constant function at $g$. Obviously $f(xyz)=f(x)f(y)f(z)$ regardless of what $x,y,z$ are. But since $gneq e$ then $f$ is not a group homomorphism.



        Now if $n$ is odd then the condition $f(e)^2=e$ implies that $f(e)=e$. And therefore for any $x,y$ we have



        $$f(xy)=f(exy)=f(e)f(x)f(y)=f(x)f(y)$$



        and so $f$ is a group homomorphism.




        but I am unsure that $ord(xy)=ord(x)ord(y)$ for any $x,yin G$.




        If $G$ is non-trivial then that never holds for all $x,y$. Consider $xneq e$ and $y=x^-1$. You can also easily check that $ord$ does not satisfy the original condition as well, i.e. consider $ord(exx^-1)$.



        Also talking about $ord$ does not make sense to begin with since the codomain of $ord$ is $mathbbN$, it's not even a group. Not to mention that domain and codomain are different although that assumption is unnecessary.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited yesterday









        J. W. Tanner

        3,0981320




        3,0981320










        answered 2 days ago









        freakishfreakish

        12.7k1631




        12.7k1631




















            user651754 is a new contributor. Be nice, and check out our Code of Conduct.









            draft saved

            draft discarded


















            user651754 is a new contributor. Be nice, and check out our Code of Conduct.












            user651754 is a new contributor. Be nice, and check out our Code of Conduct.











            user651754 is a new contributor. Be nice, and check out our Code of Conduct.














            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%2f3141546%2fis-there-a-function-such-that-fxyz-fxfyfz-for-any-x-y-z-in-g-but-f%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

            Moe incest case Sentencing See also References Navigation menu"'Australian Josef Fritzl' fathered four children by daughter""Small town recoils in horror at 'Australian Fritzl' incest case""Victorian rape allegations echo Fritzl case - Just In (Australian Broadcasting Corporation)""Incest father jailed for 22 years""'Australian Fritzl' sentenced to 22 years in prison for abusing daughter for three decades""RSJ v The Queen"

            Who is our nearest planetary neighbor, on average?Santa Claus flies to the South PoleSeven Spheres of Unequal Mass, a weighing problem with a twistDescribe a large integerFast Mental Calculation of $7.5^7$Math in Space (without the help of celebrities)Find the value of $bigstar$: Puzzle 8 - InequalityWho drinks beer while running anyway?A Crucial DeliveryRanking And AverageHow long will my money last at roulette?

            Daza language Contents Vocabulary Phonology References External links Navigation menudaza1242Daza"Dazaga"eeee178086576