Number of homomorphisms between $S_3$ and $Z_4=C_4$Number of homomorphisims from $C_5times C_4times C_4$ onto...

Why does a car's steering wheel get lighter with increasing speed

Generating a list with duplicate entries

When Central Limit Theorem breaks down

Will the concrete slab in a partially heated shed conduct a lot of heat to the unconditioned area?

What is Tony Stark injecting into himself in Iron Man 3?

How does a sound wave propagate?

Ultrafilters as a double dual

Is it a Cyclops number? "Nobody" knows!

Is there a logarithm base for which the logarithm becomes an identity function?

What is the orbit and expected lifetime of Crew Dragon trunk?

What is better: yes / no radio, or simple checkbox?

Did Amazon pay $0 in taxes last year?

Help! My Character is too much for her story!

How do you make a gun that shoots melee weapons and/or swords?

Can I challenge the interviewer to give me a proper technical feedback?

How to write a chaotic neutral protagonist and prevent my readers from thinking they are evil?

In Diabelli's "Duet in D" for piano, what are these brackets on chords that look like vertical slurs?

Was this cameo in Captain Marvel computer generated?

Why do we say 'Pairwise Disjoint', rather than 'Disjoint'?

I've given my players a lot of magic items. Is it reasonable for me to give them harder encounters?

How would an energy-based "projectile" blow up a spaceship?

The (Easy) Road to Code

Rationale to prefer local variables over instance variables?

Short story about cities being connected by a conveyor belt



Number of homomorphisms between $S_3$ and $Z_4=C_4$


Number of homomorphisims from $C_5times C_4times C_4$ onto $C_{10}$Finding all homomorphisms between $S_3$ and $mathbb Z_8$Group Homomorphism Questions (my attempts shown)How many homomorphisms $Psi : S_3 rightarrow S_3$ exist?Number of homomorphisms in group theoryHomomorphism Between Non-Abelian Group and Abelian GroupHow many homomorphism from $S_3$ to $S_4$?The number of homomorphisms from $S_5$ to $A_6$Finding number of homomorphisms from $mathbb{Z} to S_3$Homomorphisms of $S_3$













2












$begingroup$


These questions are pretty standard, this is the first time I'm trying one on my own, I would like to check my progress:




Using the First Isomorphism Theorem and Lagrange’s Theorem, find all the homomorphisms from $ S_3 to C_4 $.




My Answer: there are 2, argumentation:



In order to determine all homomorphisms, it is wise to determine the possible sizes of the kernel and the image of such homomorphisms. We know that $|S_3|=3!=6$. Furthermore, for any group homomorphism $f: G to G'$, corollary 5, enables us to write:
$$ |G|=|text{im}(f)|times| ker(f)|$$
$$ |S_3|=6=|text{im}(f)|times| ker(f)|$$
The product of kernel and image can only be 6, this is a good restriction. We will now use the first isomorphism theorem, which tells us:
$$ker(f) triangleleft S_3 $$
$$text{im}(f) leq C_4 $$
Hence the kernel and image are always subgroups, respectively of our orginal group and of the group that is mapped to. We can therefore use Lagrange's theorem, which states that the order of a subgroup must always divide the order of the group. Since $|S_3|=6$ and $|C_4|=4$, this tells us that the possible candidates are:
$$ ker(f)=1, 2, 3, 6 $$
$$ text{im}(f)=1,2 , 4 $$
We already knew that the product of these two cardinalities/orders had to be $6$. The only possible products that lead to this are for $3 cdot 2 =6$ and $6 cdot 1 =6$, so $(|ker(f)|, |text{im}(f)|) in {(3,2),(6,1)}$.



The trivial homomorphism that sends every single element of $S_3$ to the identity element in $C_4$ is always a group homomorphism. So, whenever $|text{Im}(f)|=1$ and $ker(f)=6$ we have that:
for $ein C_4$ and $forall x in S_3$ the trivial homomorphism $f: S_3 to C_4$ is defined by:
$$ f(x)=e$$
The other option is that $|text{im}(f)|=2$ (and kernel of order 3). Since the image is a subgroup by the isomorphism theorem, and by corollary 3, the order of any element in the group needs to divide the order of the group. Thus we can only have elements of order $2$ or $1$ (identity) in the image. We represent $C_4 = {e, c, c^2, c^3}$, with generator $c$. We realise that the only element of order $2$ is $c^2$:
$$text{im}(f) = langle c^2 rangle = {e, c^2} $$
We also know that the kernel of this homomorphism needs to be of order $3$. Again, the kernel is a subgroup, so the order of the elemens need to divide the order of the group. Elements in the kernel must have orders $1$ or $3$. We know the identity element must always be in the kernel. We first list all elements of $S_3$ and determine the orders so we can decide what can be in the kernel:
$$ S_3 = {e, ( 1 2 3), ( 1 3 2), ( 1 2), ( 2 3), ( 1 3) } $$
We notice that the identity is of order 1, and the two "cycles" $( 1 2 3), ( 1 3 2)$ are of order 3, they fit the description. We then define the homomorphism $f: S_3 to C_4$ that maps:
$$e, ( 1 2 3), ( 1 3 2) to e'in C_4 $$
$$ ( 1 2), ( 2 3), ( 1 3) to c^2 in C_4$$



Conclusion: There are 2 homomorphismsm the one above and the trivial homomorphism.










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    Or $(1,2,3)in S_3$ is of order $3$, which is coprome to the order of $C_4$, hence $(1,2,3)mapsto e$ for all homomoprhism $S_3to C_4$. Therefore, each such homomorphism factors over $S_3/langle (1,2,3)ranglecong C_2$. Clearly, there are exactly twho homomorphisms $C_2to C_4$ (the non-trivial element must map to an element of order $1$ or $2$)
    $endgroup$
    – Hagen von Eitzen
    yesterday


















2












$begingroup$


These questions are pretty standard, this is the first time I'm trying one on my own, I would like to check my progress:




Using the First Isomorphism Theorem and Lagrange’s Theorem, find all the homomorphisms from $ S_3 to C_4 $.




My Answer: there are 2, argumentation:



In order to determine all homomorphisms, it is wise to determine the possible sizes of the kernel and the image of such homomorphisms. We know that $|S_3|=3!=6$. Furthermore, for any group homomorphism $f: G to G'$, corollary 5, enables us to write:
$$ |G|=|text{im}(f)|times| ker(f)|$$
$$ |S_3|=6=|text{im}(f)|times| ker(f)|$$
The product of kernel and image can only be 6, this is a good restriction. We will now use the first isomorphism theorem, which tells us:
$$ker(f) triangleleft S_3 $$
$$text{im}(f) leq C_4 $$
Hence the kernel and image are always subgroups, respectively of our orginal group and of the group that is mapped to. We can therefore use Lagrange's theorem, which states that the order of a subgroup must always divide the order of the group. Since $|S_3|=6$ and $|C_4|=4$, this tells us that the possible candidates are:
$$ ker(f)=1, 2, 3, 6 $$
$$ text{im}(f)=1,2 , 4 $$
We already knew that the product of these two cardinalities/orders had to be $6$. The only possible products that lead to this are for $3 cdot 2 =6$ and $6 cdot 1 =6$, so $(|ker(f)|, |text{im}(f)|) in {(3,2),(6,1)}$.



The trivial homomorphism that sends every single element of $S_3$ to the identity element in $C_4$ is always a group homomorphism. So, whenever $|text{Im}(f)|=1$ and $ker(f)=6$ we have that:
for $ein C_4$ and $forall x in S_3$ the trivial homomorphism $f: S_3 to C_4$ is defined by:
$$ f(x)=e$$
The other option is that $|text{im}(f)|=2$ (and kernel of order 3). Since the image is a subgroup by the isomorphism theorem, and by corollary 3, the order of any element in the group needs to divide the order of the group. Thus we can only have elements of order $2$ or $1$ (identity) in the image. We represent $C_4 = {e, c, c^2, c^3}$, with generator $c$. We realise that the only element of order $2$ is $c^2$:
$$text{im}(f) = langle c^2 rangle = {e, c^2} $$
We also know that the kernel of this homomorphism needs to be of order $3$. Again, the kernel is a subgroup, so the order of the elemens need to divide the order of the group. Elements in the kernel must have orders $1$ or $3$. We know the identity element must always be in the kernel. We first list all elements of $S_3$ and determine the orders so we can decide what can be in the kernel:
$$ S_3 = {e, ( 1 2 3), ( 1 3 2), ( 1 2), ( 2 3), ( 1 3) } $$
We notice that the identity is of order 1, and the two "cycles" $( 1 2 3), ( 1 3 2)$ are of order 3, they fit the description. We then define the homomorphism $f: S_3 to C_4$ that maps:
$$e, ( 1 2 3), ( 1 3 2) to e'in C_4 $$
$$ ( 1 2), ( 2 3), ( 1 3) to c^2 in C_4$$



Conclusion: There are 2 homomorphismsm the one above and the trivial homomorphism.










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    Or $(1,2,3)in S_3$ is of order $3$, which is coprome to the order of $C_4$, hence $(1,2,3)mapsto e$ for all homomoprhism $S_3to C_4$. Therefore, each such homomorphism factors over $S_3/langle (1,2,3)ranglecong C_2$. Clearly, there are exactly twho homomorphisms $C_2to C_4$ (the non-trivial element must map to an element of order $1$ or $2$)
    $endgroup$
    – Hagen von Eitzen
    yesterday
















2












2








2





$begingroup$


These questions are pretty standard, this is the first time I'm trying one on my own, I would like to check my progress:




Using the First Isomorphism Theorem and Lagrange’s Theorem, find all the homomorphisms from $ S_3 to C_4 $.




My Answer: there are 2, argumentation:



In order to determine all homomorphisms, it is wise to determine the possible sizes of the kernel and the image of such homomorphisms. We know that $|S_3|=3!=6$. Furthermore, for any group homomorphism $f: G to G'$, corollary 5, enables us to write:
$$ |G|=|text{im}(f)|times| ker(f)|$$
$$ |S_3|=6=|text{im}(f)|times| ker(f)|$$
The product of kernel and image can only be 6, this is a good restriction. We will now use the first isomorphism theorem, which tells us:
$$ker(f) triangleleft S_3 $$
$$text{im}(f) leq C_4 $$
Hence the kernel and image are always subgroups, respectively of our orginal group and of the group that is mapped to. We can therefore use Lagrange's theorem, which states that the order of a subgroup must always divide the order of the group. Since $|S_3|=6$ and $|C_4|=4$, this tells us that the possible candidates are:
$$ ker(f)=1, 2, 3, 6 $$
$$ text{im}(f)=1,2 , 4 $$
We already knew that the product of these two cardinalities/orders had to be $6$. The only possible products that lead to this are for $3 cdot 2 =6$ and $6 cdot 1 =6$, so $(|ker(f)|, |text{im}(f)|) in {(3,2),(6,1)}$.



The trivial homomorphism that sends every single element of $S_3$ to the identity element in $C_4$ is always a group homomorphism. So, whenever $|text{Im}(f)|=1$ and $ker(f)=6$ we have that:
for $ein C_4$ and $forall x in S_3$ the trivial homomorphism $f: S_3 to C_4$ is defined by:
$$ f(x)=e$$
The other option is that $|text{im}(f)|=2$ (and kernel of order 3). Since the image is a subgroup by the isomorphism theorem, and by corollary 3, the order of any element in the group needs to divide the order of the group. Thus we can only have elements of order $2$ or $1$ (identity) in the image. We represent $C_4 = {e, c, c^2, c^3}$, with generator $c$. We realise that the only element of order $2$ is $c^2$:
$$text{im}(f) = langle c^2 rangle = {e, c^2} $$
We also know that the kernel of this homomorphism needs to be of order $3$. Again, the kernel is a subgroup, so the order of the elemens need to divide the order of the group. Elements in the kernel must have orders $1$ or $3$. We know the identity element must always be in the kernel. We first list all elements of $S_3$ and determine the orders so we can decide what can be in the kernel:
$$ S_3 = {e, ( 1 2 3), ( 1 3 2), ( 1 2), ( 2 3), ( 1 3) } $$
We notice that the identity is of order 1, and the two "cycles" $( 1 2 3), ( 1 3 2)$ are of order 3, they fit the description. We then define the homomorphism $f: S_3 to C_4$ that maps:
$$e, ( 1 2 3), ( 1 3 2) to e'in C_4 $$
$$ ( 1 2), ( 2 3), ( 1 3) to c^2 in C_4$$



Conclusion: There are 2 homomorphismsm the one above and the trivial homomorphism.










share|cite|improve this question









$endgroup$




These questions are pretty standard, this is the first time I'm trying one on my own, I would like to check my progress:




Using the First Isomorphism Theorem and Lagrange’s Theorem, find all the homomorphisms from $ S_3 to C_4 $.




My Answer: there are 2, argumentation:



In order to determine all homomorphisms, it is wise to determine the possible sizes of the kernel and the image of such homomorphisms. We know that $|S_3|=3!=6$. Furthermore, for any group homomorphism $f: G to G'$, corollary 5, enables us to write:
$$ |G|=|text{im}(f)|times| ker(f)|$$
$$ |S_3|=6=|text{im}(f)|times| ker(f)|$$
The product of kernel and image can only be 6, this is a good restriction. We will now use the first isomorphism theorem, which tells us:
$$ker(f) triangleleft S_3 $$
$$text{im}(f) leq C_4 $$
Hence the kernel and image are always subgroups, respectively of our orginal group and of the group that is mapped to. We can therefore use Lagrange's theorem, which states that the order of a subgroup must always divide the order of the group. Since $|S_3|=6$ and $|C_4|=4$, this tells us that the possible candidates are:
$$ ker(f)=1, 2, 3, 6 $$
$$ text{im}(f)=1,2 , 4 $$
We already knew that the product of these two cardinalities/orders had to be $6$. The only possible products that lead to this are for $3 cdot 2 =6$ and $6 cdot 1 =6$, so $(|ker(f)|, |text{im}(f)|) in {(3,2),(6,1)}$.



The trivial homomorphism that sends every single element of $S_3$ to the identity element in $C_4$ is always a group homomorphism. So, whenever $|text{Im}(f)|=1$ and $ker(f)=6$ we have that:
for $ein C_4$ and $forall x in S_3$ the trivial homomorphism $f: S_3 to C_4$ is defined by:
$$ f(x)=e$$
The other option is that $|text{im}(f)|=2$ (and kernel of order 3). Since the image is a subgroup by the isomorphism theorem, and by corollary 3, the order of any element in the group needs to divide the order of the group. Thus we can only have elements of order $2$ or $1$ (identity) in the image. We represent $C_4 = {e, c, c^2, c^3}$, with generator $c$. We realise that the only element of order $2$ is $c^2$:
$$text{im}(f) = langle c^2 rangle = {e, c^2} $$
We also know that the kernel of this homomorphism needs to be of order $3$. Again, the kernel is a subgroup, so the order of the elemens need to divide the order of the group. Elements in the kernel must have orders $1$ or $3$. We know the identity element must always be in the kernel. We first list all elements of $S_3$ and determine the orders so we can decide what can be in the kernel:
$$ S_3 = {e, ( 1 2 3), ( 1 3 2), ( 1 2), ( 2 3), ( 1 3) } $$
We notice that the identity is of order 1, and the two "cycles" $( 1 2 3), ( 1 3 2)$ are of order 3, they fit the description. We then define the homomorphism $f: S_3 to C_4$ that maps:
$$e, ( 1 2 3), ( 1 3 2) to e'in C_4 $$
$$ ( 1 2), ( 2 3), ( 1 3) to c^2 in C_4$$



Conclusion: There are 2 homomorphismsm the one above and the trivial homomorphism.







abstract-algebra proof-verification group-homomorphism






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked yesterday









Wesley StrikWesley Strik

2,142424




2,142424








  • 1




    $begingroup$
    Or $(1,2,3)in S_3$ is of order $3$, which is coprome to the order of $C_4$, hence $(1,2,3)mapsto e$ for all homomoprhism $S_3to C_4$. Therefore, each such homomorphism factors over $S_3/langle (1,2,3)ranglecong C_2$. Clearly, there are exactly twho homomorphisms $C_2to C_4$ (the non-trivial element must map to an element of order $1$ or $2$)
    $endgroup$
    – Hagen von Eitzen
    yesterday
















  • 1




    $begingroup$
    Or $(1,2,3)in S_3$ is of order $3$, which is coprome to the order of $C_4$, hence $(1,2,3)mapsto e$ for all homomoprhism $S_3to C_4$. Therefore, each such homomorphism factors over $S_3/langle (1,2,3)ranglecong C_2$. Clearly, there are exactly twho homomorphisms $C_2to C_4$ (the non-trivial element must map to an element of order $1$ or $2$)
    $endgroup$
    – Hagen von Eitzen
    yesterday










1




1




$begingroup$
Or $(1,2,3)in S_3$ is of order $3$, which is coprome to the order of $C_4$, hence $(1,2,3)mapsto e$ for all homomoprhism $S_3to C_4$. Therefore, each such homomorphism factors over $S_3/langle (1,2,3)ranglecong C_2$. Clearly, there are exactly twho homomorphisms $C_2to C_4$ (the non-trivial element must map to an element of order $1$ or $2$)
$endgroup$
– Hagen von Eitzen
yesterday






$begingroup$
Or $(1,2,3)in S_3$ is of order $3$, which is coprome to the order of $C_4$, hence $(1,2,3)mapsto e$ for all homomoprhism $S_3to C_4$. Therefore, each such homomorphism factors over $S_3/langle (1,2,3)ranglecong C_2$. Clearly, there are exactly twho homomorphisms $C_2to C_4$ (the non-trivial element must map to an element of order $1$ or $2$)
$endgroup$
– Hagen von Eitzen
yesterday












2 Answers
2






active

oldest

votes


















3












$begingroup$

Towards the end your proof is a bit roundabout, but it is entirely valid, except perhaps for one point:



At the very end you define a map $f: S_3 longrightarrow C_4$, but you do not verify that it is in fact a homomorphism. At this point, you have only shown that if there exists a homomorphism $f$ with $|ker(f)|=3$ and $|operatorname{im}(f)|=2$, then this must be it.



As for the proof being roundabout towards the end; once you have determined that
$$(|ker(f)|, |text{im}(f)|) in {(3,2),(6,1)},$$
you could finish the argument more clearly by distinguishing two cases;




  1. Prove that if $|ker(f)|=6$ then $f$ is the trivial homomorphism.

  2. Prove that if $|ker(f)|=3$ then $f$ is the sign homomorphism.


Then you can conclude that there are precisely two homomorphisms from $S_3$ to $C_4$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Yes it behaves a whole lot like the sign homomorphism, thank you for verifying.
    $endgroup$
    – Wesley Strik
    10 hours ago



















3












$begingroup$

Servaes has already given an effective critique, and one that I can't improve upon, but let me point out a more efficient way to solve this using some observations that are useful in other problems of this form.



First, since the target $C_4$ is abelian, for any $g, h in S_3$ and any homomorphism $phi: S_3 to C_4$ we have $phi(ghg^{-1}h^{-1}) = 0$, so $phi$ factors through a homomorphism $widetildephi : S_3 / [S_3, S_3] to C_4$, i.e., if $pi : S_3 to S_3 / [S_3, S_3]$ denotes the canonical quotient map, there is a homomorphism $widetildephi$ such that $phi = widetildephi circ pi$. Here $[S_3, S_3]$ is the commutator subgroup of $S_3$, namely the subgroup generated by all elements of the form $g h g^{-1} h^{-1}$. In particular any element is an even permutation so $[S_3, S_3] leq A_3 cong C_3$. On the other hand, since $S_3$ is not abelian, $[S_3, S_3]$ is not trivial, so $S_3 / [S_3, S_3] cong C_2$ and the kernel of $pi: S_3 to S_3 / [S_3, S_3]$ is precisely the subgroup $A_3$ of even permutations.



So, to find all the homomorphisms $S_3 to C_4$ it suffices to find the homomorphisms $widetildephi : S_3 / [S_3, S_3] cong C_2 to C_4$ and then compose them with $pi$.



Now, $S_3 / [S_3, S_3] cong C_2$ is generated by a single element, $a$, of order $2$, so $e = widetildephi(e) = widetildephi(a^2) = widetildephi(a)^2$. Thus, $widetildephi(a)$ has order $1$ or $2$.




  • If it has order $1$, then $widetildephi$ is trivial homomorphism and hence so is $phi = pi circ widetildephi$.

  • If it has order $2$, then since the only element of $C_4 = langle e, b, b^2, b^3 rangle$ of order $2$ is $b^2$, $widetildephi(a) = b^2$, and one can check directly that this together with $widetildephi(e) = e$ does define a homomorphism, and hence so is $phi = pi circ widetildephi$. Using our above description of $ker pi$, we see that $phi$ is the map that sends even permutations to $e$ and odd permutations to $b^2$.






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%2f3139357%2fnumber-of-homomorphisms-between-s-3-and-z-4-c-4%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









    3












    $begingroup$

    Towards the end your proof is a bit roundabout, but it is entirely valid, except perhaps for one point:



    At the very end you define a map $f: S_3 longrightarrow C_4$, but you do not verify that it is in fact a homomorphism. At this point, you have only shown that if there exists a homomorphism $f$ with $|ker(f)|=3$ and $|operatorname{im}(f)|=2$, then this must be it.



    As for the proof being roundabout towards the end; once you have determined that
    $$(|ker(f)|, |text{im}(f)|) in {(3,2),(6,1)},$$
    you could finish the argument more clearly by distinguishing two cases;




    1. Prove that if $|ker(f)|=6$ then $f$ is the trivial homomorphism.

    2. Prove that if $|ker(f)|=3$ then $f$ is the sign homomorphism.


    Then you can conclude that there are precisely two homomorphisms from $S_3$ to $C_4$.






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      Yes it behaves a whole lot like the sign homomorphism, thank you for verifying.
      $endgroup$
      – Wesley Strik
      10 hours ago
















    3












    $begingroup$

    Towards the end your proof is a bit roundabout, but it is entirely valid, except perhaps for one point:



    At the very end you define a map $f: S_3 longrightarrow C_4$, but you do not verify that it is in fact a homomorphism. At this point, you have only shown that if there exists a homomorphism $f$ with $|ker(f)|=3$ and $|operatorname{im}(f)|=2$, then this must be it.



    As for the proof being roundabout towards the end; once you have determined that
    $$(|ker(f)|, |text{im}(f)|) in {(3,2),(6,1)},$$
    you could finish the argument more clearly by distinguishing two cases;




    1. Prove that if $|ker(f)|=6$ then $f$ is the trivial homomorphism.

    2. Prove that if $|ker(f)|=3$ then $f$ is the sign homomorphism.


    Then you can conclude that there are precisely two homomorphisms from $S_3$ to $C_4$.






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      Yes it behaves a whole lot like the sign homomorphism, thank you for verifying.
      $endgroup$
      – Wesley Strik
      10 hours ago














    3












    3








    3





    $begingroup$

    Towards the end your proof is a bit roundabout, but it is entirely valid, except perhaps for one point:



    At the very end you define a map $f: S_3 longrightarrow C_4$, but you do not verify that it is in fact a homomorphism. At this point, you have only shown that if there exists a homomorphism $f$ with $|ker(f)|=3$ and $|operatorname{im}(f)|=2$, then this must be it.



    As for the proof being roundabout towards the end; once you have determined that
    $$(|ker(f)|, |text{im}(f)|) in {(3,2),(6,1)},$$
    you could finish the argument more clearly by distinguishing two cases;




    1. Prove that if $|ker(f)|=6$ then $f$ is the trivial homomorphism.

    2. Prove that if $|ker(f)|=3$ then $f$ is the sign homomorphism.


    Then you can conclude that there are precisely two homomorphisms from $S_3$ to $C_4$.






    share|cite|improve this answer











    $endgroup$



    Towards the end your proof is a bit roundabout, but it is entirely valid, except perhaps for one point:



    At the very end you define a map $f: S_3 longrightarrow C_4$, but you do not verify that it is in fact a homomorphism. At this point, you have only shown that if there exists a homomorphism $f$ with $|ker(f)|=3$ and $|operatorname{im}(f)|=2$, then this must be it.



    As for the proof being roundabout towards the end; once you have determined that
    $$(|ker(f)|, |text{im}(f)|) in {(3,2),(6,1)},$$
    you could finish the argument more clearly by distinguishing two cases;




    1. Prove that if $|ker(f)|=6$ then $f$ is the trivial homomorphism.

    2. Prove that if $|ker(f)|=3$ then $f$ is the sign homomorphism.


    Then you can conclude that there are precisely two homomorphisms from $S_3$ to $C_4$.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited yesterday

























    answered yesterday









    ServaesServaes

    27.5k34098




    27.5k34098












    • $begingroup$
      Yes it behaves a whole lot like the sign homomorphism, thank you for verifying.
      $endgroup$
      – Wesley Strik
      10 hours ago


















    • $begingroup$
      Yes it behaves a whole lot like the sign homomorphism, thank you for verifying.
      $endgroup$
      – Wesley Strik
      10 hours ago
















    $begingroup$
    Yes it behaves a whole lot like the sign homomorphism, thank you for verifying.
    $endgroup$
    – Wesley Strik
    10 hours ago




    $begingroup$
    Yes it behaves a whole lot like the sign homomorphism, thank you for verifying.
    $endgroup$
    – Wesley Strik
    10 hours ago











    3












    $begingroup$

    Servaes has already given an effective critique, and one that I can't improve upon, but let me point out a more efficient way to solve this using some observations that are useful in other problems of this form.



    First, since the target $C_4$ is abelian, for any $g, h in S_3$ and any homomorphism $phi: S_3 to C_4$ we have $phi(ghg^{-1}h^{-1}) = 0$, so $phi$ factors through a homomorphism $widetildephi : S_3 / [S_3, S_3] to C_4$, i.e., if $pi : S_3 to S_3 / [S_3, S_3]$ denotes the canonical quotient map, there is a homomorphism $widetildephi$ such that $phi = widetildephi circ pi$. Here $[S_3, S_3]$ is the commutator subgroup of $S_3$, namely the subgroup generated by all elements of the form $g h g^{-1} h^{-1}$. In particular any element is an even permutation so $[S_3, S_3] leq A_3 cong C_3$. On the other hand, since $S_3$ is not abelian, $[S_3, S_3]$ is not trivial, so $S_3 / [S_3, S_3] cong C_2$ and the kernel of $pi: S_3 to S_3 / [S_3, S_3]$ is precisely the subgroup $A_3$ of even permutations.



    So, to find all the homomorphisms $S_3 to C_4$ it suffices to find the homomorphisms $widetildephi : S_3 / [S_3, S_3] cong C_2 to C_4$ and then compose them with $pi$.



    Now, $S_3 / [S_3, S_3] cong C_2$ is generated by a single element, $a$, of order $2$, so $e = widetildephi(e) = widetildephi(a^2) = widetildephi(a)^2$. Thus, $widetildephi(a)$ has order $1$ or $2$.




    • If it has order $1$, then $widetildephi$ is trivial homomorphism and hence so is $phi = pi circ widetildephi$.

    • If it has order $2$, then since the only element of $C_4 = langle e, b, b^2, b^3 rangle$ of order $2$ is $b^2$, $widetildephi(a) = b^2$, and one can check directly that this together with $widetildephi(e) = e$ does define a homomorphism, and hence so is $phi = pi circ widetildephi$. Using our above description of $ker pi$, we see that $phi$ is the map that sends even permutations to $e$ and odd permutations to $b^2$.






    share|cite|improve this answer











    $endgroup$


















      3












      $begingroup$

      Servaes has already given an effective critique, and one that I can't improve upon, but let me point out a more efficient way to solve this using some observations that are useful in other problems of this form.



      First, since the target $C_4$ is abelian, for any $g, h in S_3$ and any homomorphism $phi: S_3 to C_4$ we have $phi(ghg^{-1}h^{-1}) = 0$, so $phi$ factors through a homomorphism $widetildephi : S_3 / [S_3, S_3] to C_4$, i.e., if $pi : S_3 to S_3 / [S_3, S_3]$ denotes the canonical quotient map, there is a homomorphism $widetildephi$ such that $phi = widetildephi circ pi$. Here $[S_3, S_3]$ is the commutator subgroup of $S_3$, namely the subgroup generated by all elements of the form $g h g^{-1} h^{-1}$. In particular any element is an even permutation so $[S_3, S_3] leq A_3 cong C_3$. On the other hand, since $S_3$ is not abelian, $[S_3, S_3]$ is not trivial, so $S_3 / [S_3, S_3] cong C_2$ and the kernel of $pi: S_3 to S_3 / [S_3, S_3]$ is precisely the subgroup $A_3$ of even permutations.



      So, to find all the homomorphisms $S_3 to C_4$ it suffices to find the homomorphisms $widetildephi : S_3 / [S_3, S_3] cong C_2 to C_4$ and then compose them with $pi$.



      Now, $S_3 / [S_3, S_3] cong C_2$ is generated by a single element, $a$, of order $2$, so $e = widetildephi(e) = widetildephi(a^2) = widetildephi(a)^2$. Thus, $widetildephi(a)$ has order $1$ or $2$.




      • If it has order $1$, then $widetildephi$ is trivial homomorphism and hence so is $phi = pi circ widetildephi$.

      • If it has order $2$, then since the only element of $C_4 = langle e, b, b^2, b^3 rangle$ of order $2$ is $b^2$, $widetildephi(a) = b^2$, and one can check directly that this together with $widetildephi(e) = e$ does define a homomorphism, and hence so is $phi = pi circ widetildephi$. Using our above description of $ker pi$, we see that $phi$ is the map that sends even permutations to $e$ and odd permutations to $b^2$.






      share|cite|improve this answer











      $endgroup$
















        3












        3








        3





        $begingroup$

        Servaes has already given an effective critique, and one that I can't improve upon, but let me point out a more efficient way to solve this using some observations that are useful in other problems of this form.



        First, since the target $C_4$ is abelian, for any $g, h in S_3$ and any homomorphism $phi: S_3 to C_4$ we have $phi(ghg^{-1}h^{-1}) = 0$, so $phi$ factors through a homomorphism $widetildephi : S_3 / [S_3, S_3] to C_4$, i.e., if $pi : S_3 to S_3 / [S_3, S_3]$ denotes the canonical quotient map, there is a homomorphism $widetildephi$ such that $phi = widetildephi circ pi$. Here $[S_3, S_3]$ is the commutator subgroup of $S_3$, namely the subgroup generated by all elements of the form $g h g^{-1} h^{-1}$. In particular any element is an even permutation so $[S_3, S_3] leq A_3 cong C_3$. On the other hand, since $S_3$ is not abelian, $[S_3, S_3]$ is not trivial, so $S_3 / [S_3, S_3] cong C_2$ and the kernel of $pi: S_3 to S_3 / [S_3, S_3]$ is precisely the subgroup $A_3$ of even permutations.



        So, to find all the homomorphisms $S_3 to C_4$ it suffices to find the homomorphisms $widetildephi : S_3 / [S_3, S_3] cong C_2 to C_4$ and then compose them with $pi$.



        Now, $S_3 / [S_3, S_3] cong C_2$ is generated by a single element, $a$, of order $2$, so $e = widetildephi(e) = widetildephi(a^2) = widetildephi(a)^2$. Thus, $widetildephi(a)$ has order $1$ or $2$.




        • If it has order $1$, then $widetildephi$ is trivial homomorphism and hence so is $phi = pi circ widetildephi$.

        • If it has order $2$, then since the only element of $C_4 = langle e, b, b^2, b^3 rangle$ of order $2$ is $b^2$, $widetildephi(a) = b^2$, and one can check directly that this together with $widetildephi(e) = e$ does define a homomorphism, and hence so is $phi = pi circ widetildephi$. Using our above description of $ker pi$, we see that $phi$ is the map that sends even permutations to $e$ and odd permutations to $b^2$.






        share|cite|improve this answer











        $endgroup$



        Servaes has already given an effective critique, and one that I can't improve upon, but let me point out a more efficient way to solve this using some observations that are useful in other problems of this form.



        First, since the target $C_4$ is abelian, for any $g, h in S_3$ and any homomorphism $phi: S_3 to C_4$ we have $phi(ghg^{-1}h^{-1}) = 0$, so $phi$ factors through a homomorphism $widetildephi : S_3 / [S_3, S_3] to C_4$, i.e., if $pi : S_3 to S_3 / [S_3, S_3]$ denotes the canonical quotient map, there is a homomorphism $widetildephi$ such that $phi = widetildephi circ pi$. Here $[S_3, S_3]$ is the commutator subgroup of $S_3$, namely the subgroup generated by all elements of the form $g h g^{-1} h^{-1}$. In particular any element is an even permutation so $[S_3, S_3] leq A_3 cong C_3$. On the other hand, since $S_3$ is not abelian, $[S_3, S_3]$ is not trivial, so $S_3 / [S_3, S_3] cong C_2$ and the kernel of $pi: S_3 to S_3 / [S_3, S_3]$ is precisely the subgroup $A_3$ of even permutations.



        So, to find all the homomorphisms $S_3 to C_4$ it suffices to find the homomorphisms $widetildephi : S_3 / [S_3, S_3] cong C_2 to C_4$ and then compose them with $pi$.



        Now, $S_3 / [S_3, S_3] cong C_2$ is generated by a single element, $a$, of order $2$, so $e = widetildephi(e) = widetildephi(a^2) = widetildephi(a)^2$. Thus, $widetildephi(a)$ has order $1$ or $2$.




        • If it has order $1$, then $widetildephi$ is trivial homomorphism and hence so is $phi = pi circ widetildephi$.

        • If it has order $2$, then since the only element of $C_4 = langle e, b, b^2, b^3 rangle$ of order $2$ is $b^2$, $widetildephi(a) = b^2$, and one can check directly that this together with $widetildephi(e) = e$ does define a homomorphism, and hence so is $phi = pi circ widetildephi$. Using our above description of $ker pi$, we see that $phi$ is the map that sends even permutations to $e$ and odd permutations to $b^2$.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited yesterday

























        answered yesterday









        TravisTravis

        62.6k767149




        62.6k767149






























            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%2f3139357%2fnumber-of-homomorphisms-between-s-3-and-z-4-c-4%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

            Nidaros erkebispedøme

            Birsay

            Was Woodrow Wilson really a Liberal?Was World War I a war of liberals against authoritarians?Founding Fathers...