Set of all inner automorphisms is a normal subgroup












2












$begingroup$


In order to prove this, I first proved that the set of all automorphisms from a group $G$ to $G$ form a group under composition:
The identity homorphism is an automorphism because sends $x$ from $G$ to $x$ from $G$:



$phi_e(x) = x in G$



The inverse of an homomorphism exists:



well...



The associativity works because composition of functions is always associative.



Closure property:



$$phicircgamma(a+b) = phi(gamma(a+b)) = phi(gamma(a)+gamma(b)) = phi(gamma(a)) + phi(gamma(a)) = phicircgamma(a)+phicircgamma(b)$$



So, an Inner automorphism is defined as a function $f$ such that



$f(x) = a^{-1}xa$



for a fixed element $a$ from $G$.



I'm supposed to prove that the set of all these automorphisms form a normal subgroup of $G$, that is:



$$gfg^{-1}in N$$ for all $g$



where $N$ is the set of all inner automorphisms of $G$, and $g$ is an automorphism of $G$.




UPDATE:



Ok, so what I learned from this is that



we have a group $Aut(G)$ made of all the automorphisms of $G$, and we
want to show that the subgroup of $Aut(G)$ made of all the inner
automorphisms, is normal. That is, given an inner automorphism
$phi_a(x) = a^{-1}xa$ for a fixed $a$ in $G$ and $xin G$.



So, we need to show that, given $g$ as an automorphism from $Aut(G)$
and $phi_a$ an inner automorphism from the subgroup $N$ of inner
automorphisms, we must have:



$$g^{-1}phi_ag in N$$



for all $g$



Am I rigth?











share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    For clarity, instead of $f$, let $varphi_a$ denote the inner automorphism $varphi_a(x)=a^{-1}xa$. Then show $gvarphi_a g^{-1}=varphi_{g(a)}$, hence $gvarphi_a g^{-1}$ is inner.
    $endgroup$
    – Ben West
    Aug 22 '15 at 22:04








  • 4




    $begingroup$
    It's a normal subgroup of $operatorname{Aut}G$, not of $G$.
    $endgroup$
    – Bernard
    Aug 22 '15 at 22:11






  • 2




    $begingroup$
    Your title is deceptive. The question is about inner automorphisms from a group to itself, not to another group. In fact, one only uses the terminology "automorphisms" when talking about isomorphisms from an object to itself.
    $endgroup$
    – Lee Mosher
    Aug 22 '15 at 22:33










  • $begingroup$
    $g(a^{-1}xa)g^{-1} = ga^{-1}xag^{-1} = (ag^{-1})^{-1}x(ga^{-1})^1$ but I don't think this help. Can I argue that $ag^{-1}$ is in $G$?
    $endgroup$
    – Guerlando OCs
    Aug 22 '15 at 23:43






  • 1




    $begingroup$
    @GuerlandoOCs No, $g$ is an automorphism of $G$, not an element of $G$, so $$gvarphi_ag^{-1}(x)=gvarphi_a(g^{-1}(x))=g(a^{-1}g^{-1}(x)a)=g(a^{-1})g(g^{-1}(x))g(a)=g(a)^{-1}xg(a)=varphi_{g(a)}(x).$$
    $endgroup$
    – Ben West
    Aug 23 '15 at 0:03


















2












$begingroup$


In order to prove this, I first proved that the set of all automorphisms from a group $G$ to $G$ form a group under composition:
The identity homorphism is an automorphism because sends $x$ from $G$ to $x$ from $G$:



$phi_e(x) = x in G$



The inverse of an homomorphism exists:



well...



The associativity works because composition of functions is always associative.



Closure property:



$$phicircgamma(a+b) = phi(gamma(a+b)) = phi(gamma(a)+gamma(b)) = phi(gamma(a)) + phi(gamma(a)) = phicircgamma(a)+phicircgamma(b)$$



So, an Inner automorphism is defined as a function $f$ such that



$f(x) = a^{-1}xa$



for a fixed element $a$ from $G$.



I'm supposed to prove that the set of all these automorphisms form a normal subgroup of $G$, that is:



$$gfg^{-1}in N$$ for all $g$



where $N$ is the set of all inner automorphisms of $G$, and $g$ is an automorphism of $G$.




UPDATE:



Ok, so what I learned from this is that



we have a group $Aut(G)$ made of all the automorphisms of $G$, and we
want to show that the subgroup of $Aut(G)$ made of all the inner
automorphisms, is normal. That is, given an inner automorphism
$phi_a(x) = a^{-1}xa$ for a fixed $a$ in $G$ and $xin G$.



So, we need to show that, given $g$ as an automorphism from $Aut(G)$
and $phi_a$ an inner automorphism from the subgroup $N$ of inner
automorphisms, we must have:



$$g^{-1}phi_ag in N$$



for all $g$



Am I rigth?











share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    For clarity, instead of $f$, let $varphi_a$ denote the inner automorphism $varphi_a(x)=a^{-1}xa$. Then show $gvarphi_a g^{-1}=varphi_{g(a)}$, hence $gvarphi_a g^{-1}$ is inner.
    $endgroup$
    – Ben West
    Aug 22 '15 at 22:04








  • 4




    $begingroup$
    It's a normal subgroup of $operatorname{Aut}G$, not of $G$.
    $endgroup$
    – Bernard
    Aug 22 '15 at 22:11






  • 2




    $begingroup$
    Your title is deceptive. The question is about inner automorphisms from a group to itself, not to another group. In fact, one only uses the terminology "automorphisms" when talking about isomorphisms from an object to itself.
    $endgroup$
    – Lee Mosher
    Aug 22 '15 at 22:33










  • $begingroup$
    $g(a^{-1}xa)g^{-1} = ga^{-1}xag^{-1} = (ag^{-1})^{-1}x(ga^{-1})^1$ but I don't think this help. Can I argue that $ag^{-1}$ is in $G$?
    $endgroup$
    – Guerlando OCs
    Aug 22 '15 at 23:43






  • 1




    $begingroup$
    @GuerlandoOCs No, $g$ is an automorphism of $G$, not an element of $G$, so $$gvarphi_ag^{-1}(x)=gvarphi_a(g^{-1}(x))=g(a^{-1}g^{-1}(x)a)=g(a^{-1})g(g^{-1}(x))g(a)=g(a)^{-1}xg(a)=varphi_{g(a)}(x).$$
    $endgroup$
    – Ben West
    Aug 23 '15 at 0:03
















2












2








2





$begingroup$


In order to prove this, I first proved that the set of all automorphisms from a group $G$ to $G$ form a group under composition:
The identity homorphism is an automorphism because sends $x$ from $G$ to $x$ from $G$:



$phi_e(x) = x in G$



The inverse of an homomorphism exists:



well...



The associativity works because composition of functions is always associative.



Closure property:



$$phicircgamma(a+b) = phi(gamma(a+b)) = phi(gamma(a)+gamma(b)) = phi(gamma(a)) + phi(gamma(a)) = phicircgamma(a)+phicircgamma(b)$$



So, an Inner automorphism is defined as a function $f$ such that



$f(x) = a^{-1}xa$



for a fixed element $a$ from $G$.



I'm supposed to prove that the set of all these automorphisms form a normal subgroup of $G$, that is:



$$gfg^{-1}in N$$ for all $g$



where $N$ is the set of all inner automorphisms of $G$, and $g$ is an automorphism of $G$.




UPDATE:



Ok, so what I learned from this is that



we have a group $Aut(G)$ made of all the automorphisms of $G$, and we
want to show that the subgroup of $Aut(G)$ made of all the inner
automorphisms, is normal. That is, given an inner automorphism
$phi_a(x) = a^{-1}xa$ for a fixed $a$ in $G$ and $xin G$.



So, we need to show that, given $g$ as an automorphism from $Aut(G)$
and $phi_a$ an inner automorphism from the subgroup $N$ of inner
automorphisms, we must have:



$$g^{-1}phi_ag in N$$



for all $g$



Am I rigth?











share|cite|improve this question











$endgroup$




In order to prove this, I first proved that the set of all automorphisms from a group $G$ to $G$ form a group under composition:
The identity homorphism is an automorphism because sends $x$ from $G$ to $x$ from $G$:



$phi_e(x) = x in G$



The inverse of an homomorphism exists:



well...



The associativity works because composition of functions is always associative.



Closure property:



$$phicircgamma(a+b) = phi(gamma(a+b)) = phi(gamma(a)+gamma(b)) = phi(gamma(a)) + phi(gamma(a)) = phicircgamma(a)+phicircgamma(b)$$



So, an Inner automorphism is defined as a function $f$ such that



$f(x) = a^{-1}xa$



for a fixed element $a$ from $G$.



I'm supposed to prove that the set of all these automorphisms form a normal subgroup of $G$, that is:



$$gfg^{-1}in N$$ for all $g$



where $N$ is the set of all inner automorphisms of $G$, and $g$ is an automorphism of $G$.




UPDATE:



Ok, so what I learned from this is that



we have a group $Aut(G)$ made of all the automorphisms of $G$, and we
want to show that the subgroup of $Aut(G)$ made of all the inner
automorphisms, is normal. That is, given an inner automorphism
$phi_a(x) = a^{-1}xa$ for a fixed $a$ in $G$ and $xin G$.



So, we need to show that, given $g$ as an automorphism from $Aut(G)$
and $phi_a$ an inner automorphism from the subgroup $N$ of inner
automorphisms, we must have:



$$g^{-1}phi_ag in N$$



for all $g$



Am I rigth?








abstract-algebra group-theory finite-groups






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 23 '15 at 0:17







Guerlando OCs

















asked Aug 22 '15 at 21:58









Guerlando OCsGuerlando OCs

13621654




13621654








  • 3




    $begingroup$
    For clarity, instead of $f$, let $varphi_a$ denote the inner automorphism $varphi_a(x)=a^{-1}xa$. Then show $gvarphi_a g^{-1}=varphi_{g(a)}$, hence $gvarphi_a g^{-1}$ is inner.
    $endgroup$
    – Ben West
    Aug 22 '15 at 22:04








  • 4




    $begingroup$
    It's a normal subgroup of $operatorname{Aut}G$, not of $G$.
    $endgroup$
    – Bernard
    Aug 22 '15 at 22:11






  • 2




    $begingroup$
    Your title is deceptive. The question is about inner automorphisms from a group to itself, not to another group. In fact, one only uses the terminology "automorphisms" when talking about isomorphisms from an object to itself.
    $endgroup$
    – Lee Mosher
    Aug 22 '15 at 22:33










  • $begingroup$
    $g(a^{-1}xa)g^{-1} = ga^{-1}xag^{-1} = (ag^{-1})^{-1}x(ga^{-1})^1$ but I don't think this help. Can I argue that $ag^{-1}$ is in $G$?
    $endgroup$
    – Guerlando OCs
    Aug 22 '15 at 23:43






  • 1




    $begingroup$
    @GuerlandoOCs No, $g$ is an automorphism of $G$, not an element of $G$, so $$gvarphi_ag^{-1}(x)=gvarphi_a(g^{-1}(x))=g(a^{-1}g^{-1}(x)a)=g(a^{-1})g(g^{-1}(x))g(a)=g(a)^{-1}xg(a)=varphi_{g(a)}(x).$$
    $endgroup$
    – Ben West
    Aug 23 '15 at 0:03
















  • 3




    $begingroup$
    For clarity, instead of $f$, let $varphi_a$ denote the inner automorphism $varphi_a(x)=a^{-1}xa$. Then show $gvarphi_a g^{-1}=varphi_{g(a)}$, hence $gvarphi_a g^{-1}$ is inner.
    $endgroup$
    – Ben West
    Aug 22 '15 at 22:04








  • 4




    $begingroup$
    It's a normal subgroup of $operatorname{Aut}G$, not of $G$.
    $endgroup$
    – Bernard
    Aug 22 '15 at 22:11






  • 2




    $begingroup$
    Your title is deceptive. The question is about inner automorphisms from a group to itself, not to another group. In fact, one only uses the terminology "automorphisms" when talking about isomorphisms from an object to itself.
    $endgroup$
    – Lee Mosher
    Aug 22 '15 at 22:33










  • $begingroup$
    $g(a^{-1}xa)g^{-1} = ga^{-1}xag^{-1} = (ag^{-1})^{-1}x(ga^{-1})^1$ but I don't think this help. Can I argue that $ag^{-1}$ is in $G$?
    $endgroup$
    – Guerlando OCs
    Aug 22 '15 at 23:43






  • 1




    $begingroup$
    @GuerlandoOCs No, $g$ is an automorphism of $G$, not an element of $G$, so $$gvarphi_ag^{-1}(x)=gvarphi_a(g^{-1}(x))=g(a^{-1}g^{-1}(x)a)=g(a^{-1})g(g^{-1}(x))g(a)=g(a)^{-1}xg(a)=varphi_{g(a)}(x).$$
    $endgroup$
    – Ben West
    Aug 23 '15 at 0:03










3




3




$begingroup$
For clarity, instead of $f$, let $varphi_a$ denote the inner automorphism $varphi_a(x)=a^{-1}xa$. Then show $gvarphi_a g^{-1}=varphi_{g(a)}$, hence $gvarphi_a g^{-1}$ is inner.
$endgroup$
– Ben West
Aug 22 '15 at 22:04






$begingroup$
For clarity, instead of $f$, let $varphi_a$ denote the inner automorphism $varphi_a(x)=a^{-1}xa$. Then show $gvarphi_a g^{-1}=varphi_{g(a)}$, hence $gvarphi_a g^{-1}$ is inner.
$endgroup$
– Ben West
Aug 22 '15 at 22:04






4




4




$begingroup$
It's a normal subgroup of $operatorname{Aut}G$, not of $G$.
$endgroup$
– Bernard
Aug 22 '15 at 22:11




$begingroup$
It's a normal subgroup of $operatorname{Aut}G$, not of $G$.
$endgroup$
– Bernard
Aug 22 '15 at 22:11




2




2




$begingroup$
Your title is deceptive. The question is about inner automorphisms from a group to itself, not to another group. In fact, one only uses the terminology "automorphisms" when talking about isomorphisms from an object to itself.
$endgroup$
– Lee Mosher
Aug 22 '15 at 22:33




$begingroup$
Your title is deceptive. The question is about inner automorphisms from a group to itself, not to another group. In fact, one only uses the terminology "automorphisms" when talking about isomorphisms from an object to itself.
$endgroup$
– Lee Mosher
Aug 22 '15 at 22:33












$begingroup$
$g(a^{-1}xa)g^{-1} = ga^{-1}xag^{-1} = (ag^{-1})^{-1}x(ga^{-1})^1$ but I don't think this help. Can I argue that $ag^{-1}$ is in $G$?
$endgroup$
– Guerlando OCs
Aug 22 '15 at 23:43




$begingroup$
$g(a^{-1}xa)g^{-1} = ga^{-1}xag^{-1} = (ag^{-1})^{-1}x(ga^{-1})^1$ but I don't think this help. Can I argue that $ag^{-1}$ is in $G$?
$endgroup$
– Guerlando OCs
Aug 22 '15 at 23:43




1




1




$begingroup$
@GuerlandoOCs No, $g$ is an automorphism of $G$, not an element of $G$, so $$gvarphi_ag^{-1}(x)=gvarphi_a(g^{-1}(x))=g(a^{-1}g^{-1}(x)a)=g(a^{-1})g(g^{-1}(x))g(a)=g(a)^{-1}xg(a)=varphi_{g(a)}(x).$$
$endgroup$
– Ben West
Aug 23 '15 at 0:03






$begingroup$
@GuerlandoOCs No, $g$ is an automorphism of $G$, not an element of $G$, so $$gvarphi_ag^{-1}(x)=gvarphi_a(g^{-1}(x))=g(a^{-1}g^{-1}(x)a)=g(a^{-1})g(g^{-1}(x))g(a)=g(a)^{-1}xg(a)=varphi_{g(a)}(x).$$
$endgroup$
– Ben West
Aug 23 '15 at 0:03












2 Answers
2






active

oldest

votes


















0












$begingroup$

To prove "$mathrm{Inn}(G)$ is a normal subgroup of $mathrm{Aut}(G)$", you need to prove "for each $phi_ain mathrm{Inn}(G)$ and $theta in mathrm{Aut}(G)$, we have $theta circ phi_a circ theta^{-1} in mathrm{Inn}(G)$". To verify this, simply evaluate $(theta circ phi_a circ theta^{-1})(x)$ and use some properties that $theta$ and $phi_a$ are known to have.






share|cite|improve this answer









$endgroup$





















    -1












    $begingroup$

    First, you used additive notation for the group operation, but we needn't suppose that the group $G$ is abelian, the result holds in the general case.



    Second, group automorphisms $Aut(G)$ is a different group from $G$ itself (so, inner automorphisms do not form a subgroup in $G$...).



    The set/class of all inner automorphisms $Inn(G)$ form a normal subgroup in $Aut(G)$, not in $G$ itself!



    Conjugation operation, you called it $f(x)$, more precisely $f_a(x)$ or $x^a$, is a group homomorphism $Grightarrow Aut(G)$ (not necessarily isomorphism or even mono- or epi-).
    And the whole image of a group homomorphism is always a normal subgroup in the codomain (the proof is a bit verbose).



    In this case the whole image of the conjugation operation is exactly the set of all inner automorphisms (forming a subgroup in $Aut(G)$).



    $$ f: Grightarrow Aut(G) $$



    $$ f_a(x) := a^{-1}xa $$



    $$ f_G = Inn(G) $$



    $$ Inn(G) triangleleft Aut(G) $$



    So we can indeed always speak about outer automorphisms $Out(G)$ of a group $G$, which is possibly trivial, because $Inn(G)$ exhaust the whole $Aut(G)$ (all automorphisms are inner), or, conversely, equal (isomorphic) to $Aut(G)$, because $Inn(G)$ is trivial (in case of abelian groups).






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      PS: Actually, we should use pairing (carrier, oepration(s)) to denote groups without ambiguity, but we assume, as always, that the carrier and the algebraic structure are denoted by the same symbol.
      $endgroup$
      – Andrew Miloradovsky
      Aug 23 '15 at 0:03










    • $begingroup$
      Also, $Inn(G)$ is isomorphic to $G/Z(G)$, quotient group to the kernel of the conjugation homomorphism. Maybe you meant this.
      $endgroup$
      – Andrew Miloradovsky
      Aug 23 '15 at 0:08












    • $begingroup$
      Also, it is considerably a bad idea to denote $Inn(G)$ by $N$, because just N suggests that it is a subgroup of G, but it isn't.
      $endgroup$
      – Andrew Miloradovsky
      Aug 23 '15 at 0:24












    • $begingroup$
      And also, to prove this result you don't have to do it directly by definition of normality (that it contains also all the conjugate elements). Because you must have strict distinction which elements are from $G$ and which are from $Aut(G)$. For example, your $g$, performing conjugation in $Aut(G)$ is also an automorphism (not necessarily inner), but not and element of $G$.
      $endgroup$
      – Andrew Miloradovsky
      Aug 23 '15 at 0:26












    • $begingroup$
      You write "And the whole image of a group homomorphism is always a normal subgroup in the codomain". This is false. Take, as a counterexample, any non-normal subgroup $H le G$ and consider the inclusion map $H to G$ given simply by $i(h) = h$.
      $endgroup$
      – Clay Thomas
      Jun 27 '18 at 13:59













    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%2f1406315%2fset-of-all-inner-automorphisms-is-a-normal-subgroup%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









    0












    $begingroup$

    To prove "$mathrm{Inn}(G)$ is a normal subgroup of $mathrm{Aut}(G)$", you need to prove "for each $phi_ain mathrm{Inn}(G)$ and $theta in mathrm{Aut}(G)$, we have $theta circ phi_a circ theta^{-1} in mathrm{Inn}(G)$". To verify this, simply evaluate $(theta circ phi_a circ theta^{-1})(x)$ and use some properties that $theta$ and $phi_a$ are known to have.






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      To prove "$mathrm{Inn}(G)$ is a normal subgroup of $mathrm{Aut}(G)$", you need to prove "for each $phi_ain mathrm{Inn}(G)$ and $theta in mathrm{Aut}(G)$, we have $theta circ phi_a circ theta^{-1} in mathrm{Inn}(G)$". To verify this, simply evaluate $(theta circ phi_a circ theta^{-1})(x)$ and use some properties that $theta$ and $phi_a$ are known to have.






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        To prove "$mathrm{Inn}(G)$ is a normal subgroup of $mathrm{Aut}(G)$", you need to prove "for each $phi_ain mathrm{Inn}(G)$ and $theta in mathrm{Aut}(G)$, we have $theta circ phi_a circ theta^{-1} in mathrm{Inn}(G)$". To verify this, simply evaluate $(theta circ phi_a circ theta^{-1})(x)$ and use some properties that $theta$ and $phi_a$ are known to have.






        share|cite|improve this answer









        $endgroup$



        To prove "$mathrm{Inn}(G)$ is a normal subgroup of $mathrm{Aut}(G)$", you need to prove "for each $phi_ain mathrm{Inn}(G)$ and $theta in mathrm{Aut}(G)$, we have $theta circ phi_a circ theta^{-1} in mathrm{Inn}(G)$". To verify this, simply evaluate $(theta circ phi_a circ theta^{-1})(x)$ and use some properties that $theta$ and $phi_a$ are known to have.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jun 27 '18 at 14:05









        Clay ThomasClay Thomas

        1406




        1406























            -1












            $begingroup$

            First, you used additive notation for the group operation, but we needn't suppose that the group $G$ is abelian, the result holds in the general case.



            Second, group automorphisms $Aut(G)$ is a different group from $G$ itself (so, inner automorphisms do not form a subgroup in $G$...).



            The set/class of all inner automorphisms $Inn(G)$ form a normal subgroup in $Aut(G)$, not in $G$ itself!



            Conjugation operation, you called it $f(x)$, more precisely $f_a(x)$ or $x^a$, is a group homomorphism $Grightarrow Aut(G)$ (not necessarily isomorphism or even mono- or epi-).
            And the whole image of a group homomorphism is always a normal subgroup in the codomain (the proof is a bit verbose).



            In this case the whole image of the conjugation operation is exactly the set of all inner automorphisms (forming a subgroup in $Aut(G)$).



            $$ f: Grightarrow Aut(G) $$



            $$ f_a(x) := a^{-1}xa $$



            $$ f_G = Inn(G) $$



            $$ Inn(G) triangleleft Aut(G) $$



            So we can indeed always speak about outer automorphisms $Out(G)$ of a group $G$, which is possibly trivial, because $Inn(G)$ exhaust the whole $Aut(G)$ (all automorphisms are inner), or, conversely, equal (isomorphic) to $Aut(G)$, because $Inn(G)$ is trivial (in case of abelian groups).






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              PS: Actually, we should use pairing (carrier, oepration(s)) to denote groups without ambiguity, but we assume, as always, that the carrier and the algebraic structure are denoted by the same symbol.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:03










            • $begingroup$
              Also, $Inn(G)$ is isomorphic to $G/Z(G)$, quotient group to the kernel of the conjugation homomorphism. Maybe you meant this.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:08












            • $begingroup$
              Also, it is considerably a bad idea to denote $Inn(G)$ by $N$, because just N suggests that it is a subgroup of G, but it isn't.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:24












            • $begingroup$
              And also, to prove this result you don't have to do it directly by definition of normality (that it contains also all the conjugate elements). Because you must have strict distinction which elements are from $G$ and which are from $Aut(G)$. For example, your $g$, performing conjugation in $Aut(G)$ is also an automorphism (not necessarily inner), but not and element of $G$.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:26












            • $begingroup$
              You write "And the whole image of a group homomorphism is always a normal subgroup in the codomain". This is false. Take, as a counterexample, any non-normal subgroup $H le G$ and consider the inclusion map $H to G$ given simply by $i(h) = h$.
              $endgroup$
              – Clay Thomas
              Jun 27 '18 at 13:59


















            -1












            $begingroup$

            First, you used additive notation for the group operation, but we needn't suppose that the group $G$ is abelian, the result holds in the general case.



            Second, group automorphisms $Aut(G)$ is a different group from $G$ itself (so, inner automorphisms do not form a subgroup in $G$...).



            The set/class of all inner automorphisms $Inn(G)$ form a normal subgroup in $Aut(G)$, not in $G$ itself!



            Conjugation operation, you called it $f(x)$, more precisely $f_a(x)$ or $x^a$, is a group homomorphism $Grightarrow Aut(G)$ (not necessarily isomorphism or even mono- or epi-).
            And the whole image of a group homomorphism is always a normal subgroup in the codomain (the proof is a bit verbose).



            In this case the whole image of the conjugation operation is exactly the set of all inner automorphisms (forming a subgroup in $Aut(G)$).



            $$ f: Grightarrow Aut(G) $$



            $$ f_a(x) := a^{-1}xa $$



            $$ f_G = Inn(G) $$



            $$ Inn(G) triangleleft Aut(G) $$



            So we can indeed always speak about outer automorphisms $Out(G)$ of a group $G$, which is possibly trivial, because $Inn(G)$ exhaust the whole $Aut(G)$ (all automorphisms are inner), or, conversely, equal (isomorphic) to $Aut(G)$, because $Inn(G)$ is trivial (in case of abelian groups).






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              PS: Actually, we should use pairing (carrier, oepration(s)) to denote groups without ambiguity, but we assume, as always, that the carrier and the algebraic structure are denoted by the same symbol.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:03










            • $begingroup$
              Also, $Inn(G)$ is isomorphic to $G/Z(G)$, quotient group to the kernel of the conjugation homomorphism. Maybe you meant this.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:08












            • $begingroup$
              Also, it is considerably a bad idea to denote $Inn(G)$ by $N$, because just N suggests that it is a subgroup of G, but it isn't.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:24












            • $begingroup$
              And also, to prove this result you don't have to do it directly by definition of normality (that it contains also all the conjugate elements). Because you must have strict distinction which elements are from $G$ and which are from $Aut(G)$. For example, your $g$, performing conjugation in $Aut(G)$ is also an automorphism (not necessarily inner), but not and element of $G$.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:26












            • $begingroup$
              You write "And the whole image of a group homomorphism is always a normal subgroup in the codomain". This is false. Take, as a counterexample, any non-normal subgroup $H le G$ and consider the inclusion map $H to G$ given simply by $i(h) = h$.
              $endgroup$
              – Clay Thomas
              Jun 27 '18 at 13:59
















            -1












            -1








            -1





            $begingroup$

            First, you used additive notation for the group operation, but we needn't suppose that the group $G$ is abelian, the result holds in the general case.



            Second, group automorphisms $Aut(G)$ is a different group from $G$ itself (so, inner automorphisms do not form a subgroup in $G$...).



            The set/class of all inner automorphisms $Inn(G)$ form a normal subgroup in $Aut(G)$, not in $G$ itself!



            Conjugation operation, you called it $f(x)$, more precisely $f_a(x)$ or $x^a$, is a group homomorphism $Grightarrow Aut(G)$ (not necessarily isomorphism or even mono- or epi-).
            And the whole image of a group homomorphism is always a normal subgroup in the codomain (the proof is a bit verbose).



            In this case the whole image of the conjugation operation is exactly the set of all inner automorphisms (forming a subgroup in $Aut(G)$).



            $$ f: Grightarrow Aut(G) $$



            $$ f_a(x) := a^{-1}xa $$



            $$ f_G = Inn(G) $$



            $$ Inn(G) triangleleft Aut(G) $$



            So we can indeed always speak about outer automorphisms $Out(G)$ of a group $G$, which is possibly trivial, because $Inn(G)$ exhaust the whole $Aut(G)$ (all automorphisms are inner), or, conversely, equal (isomorphic) to $Aut(G)$, because $Inn(G)$ is trivial (in case of abelian groups).






            share|cite|improve this answer









            $endgroup$



            First, you used additive notation for the group operation, but we needn't suppose that the group $G$ is abelian, the result holds in the general case.



            Second, group automorphisms $Aut(G)$ is a different group from $G$ itself (so, inner automorphisms do not form a subgroup in $G$...).



            The set/class of all inner automorphisms $Inn(G)$ form a normal subgroup in $Aut(G)$, not in $G$ itself!



            Conjugation operation, you called it $f(x)$, more precisely $f_a(x)$ or $x^a$, is a group homomorphism $Grightarrow Aut(G)$ (not necessarily isomorphism or even mono- or epi-).
            And the whole image of a group homomorphism is always a normal subgroup in the codomain (the proof is a bit verbose).



            In this case the whole image of the conjugation operation is exactly the set of all inner automorphisms (forming a subgroup in $Aut(G)$).



            $$ f: Grightarrow Aut(G) $$



            $$ f_a(x) := a^{-1}xa $$



            $$ f_G = Inn(G) $$



            $$ Inn(G) triangleleft Aut(G) $$



            So we can indeed always speak about outer automorphisms $Out(G)$ of a group $G$, which is possibly trivial, because $Inn(G)$ exhaust the whole $Aut(G)$ (all automorphisms are inner), or, conversely, equal (isomorphic) to $Aut(G)$, because $Inn(G)$ is trivial (in case of abelian groups).







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Aug 22 '15 at 23:55









            Andrew MiloradovskyAndrew Miloradovsky

            37418




            37418












            • $begingroup$
              PS: Actually, we should use pairing (carrier, oepration(s)) to denote groups without ambiguity, but we assume, as always, that the carrier and the algebraic structure are denoted by the same symbol.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:03










            • $begingroup$
              Also, $Inn(G)$ is isomorphic to $G/Z(G)$, quotient group to the kernel of the conjugation homomorphism. Maybe you meant this.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:08












            • $begingroup$
              Also, it is considerably a bad idea to denote $Inn(G)$ by $N$, because just N suggests that it is a subgroup of G, but it isn't.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:24












            • $begingroup$
              And also, to prove this result you don't have to do it directly by definition of normality (that it contains also all the conjugate elements). Because you must have strict distinction which elements are from $G$ and which are from $Aut(G)$. For example, your $g$, performing conjugation in $Aut(G)$ is also an automorphism (not necessarily inner), but not and element of $G$.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:26












            • $begingroup$
              You write "And the whole image of a group homomorphism is always a normal subgroup in the codomain". This is false. Take, as a counterexample, any non-normal subgroup $H le G$ and consider the inclusion map $H to G$ given simply by $i(h) = h$.
              $endgroup$
              – Clay Thomas
              Jun 27 '18 at 13:59




















            • $begingroup$
              PS: Actually, we should use pairing (carrier, oepration(s)) to denote groups without ambiguity, but we assume, as always, that the carrier and the algebraic structure are denoted by the same symbol.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:03










            • $begingroup$
              Also, $Inn(G)$ is isomorphic to $G/Z(G)$, quotient group to the kernel of the conjugation homomorphism. Maybe you meant this.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:08












            • $begingroup$
              Also, it is considerably a bad idea to denote $Inn(G)$ by $N$, because just N suggests that it is a subgroup of G, but it isn't.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:24












            • $begingroup$
              And also, to prove this result you don't have to do it directly by definition of normality (that it contains also all the conjugate elements). Because you must have strict distinction which elements are from $G$ and which are from $Aut(G)$. For example, your $g$, performing conjugation in $Aut(G)$ is also an automorphism (not necessarily inner), but not and element of $G$.
              $endgroup$
              – Andrew Miloradovsky
              Aug 23 '15 at 0:26












            • $begingroup$
              You write "And the whole image of a group homomorphism is always a normal subgroup in the codomain". This is false. Take, as a counterexample, any non-normal subgroup $H le G$ and consider the inclusion map $H to G$ given simply by $i(h) = h$.
              $endgroup$
              – Clay Thomas
              Jun 27 '18 at 13:59


















            $begingroup$
            PS: Actually, we should use pairing (carrier, oepration(s)) to denote groups without ambiguity, but we assume, as always, that the carrier and the algebraic structure are denoted by the same symbol.
            $endgroup$
            – Andrew Miloradovsky
            Aug 23 '15 at 0:03




            $begingroup$
            PS: Actually, we should use pairing (carrier, oepration(s)) to denote groups without ambiguity, but we assume, as always, that the carrier and the algebraic structure are denoted by the same symbol.
            $endgroup$
            – Andrew Miloradovsky
            Aug 23 '15 at 0:03












            $begingroup$
            Also, $Inn(G)$ is isomorphic to $G/Z(G)$, quotient group to the kernel of the conjugation homomorphism. Maybe you meant this.
            $endgroup$
            – Andrew Miloradovsky
            Aug 23 '15 at 0:08






            $begingroup$
            Also, $Inn(G)$ is isomorphic to $G/Z(G)$, quotient group to the kernel of the conjugation homomorphism. Maybe you meant this.
            $endgroup$
            – Andrew Miloradovsky
            Aug 23 '15 at 0:08














            $begingroup$
            Also, it is considerably a bad idea to denote $Inn(G)$ by $N$, because just N suggests that it is a subgroup of G, but it isn't.
            $endgroup$
            – Andrew Miloradovsky
            Aug 23 '15 at 0:24






            $begingroup$
            Also, it is considerably a bad idea to denote $Inn(G)$ by $N$, because just N suggests that it is a subgroup of G, but it isn't.
            $endgroup$
            – Andrew Miloradovsky
            Aug 23 '15 at 0:24














            $begingroup$
            And also, to prove this result you don't have to do it directly by definition of normality (that it contains also all the conjugate elements). Because you must have strict distinction which elements are from $G$ and which are from $Aut(G)$. For example, your $g$, performing conjugation in $Aut(G)$ is also an automorphism (not necessarily inner), but not and element of $G$.
            $endgroup$
            – Andrew Miloradovsky
            Aug 23 '15 at 0:26






            $begingroup$
            And also, to prove this result you don't have to do it directly by definition of normality (that it contains also all the conjugate elements). Because you must have strict distinction which elements are from $G$ and which are from $Aut(G)$. For example, your $g$, performing conjugation in $Aut(G)$ is also an automorphism (not necessarily inner), but not and element of $G$.
            $endgroup$
            – Andrew Miloradovsky
            Aug 23 '15 at 0:26














            $begingroup$
            You write "And the whole image of a group homomorphism is always a normal subgroup in the codomain". This is false. Take, as a counterexample, any non-normal subgroup $H le G$ and consider the inclusion map $H to G$ given simply by $i(h) = h$.
            $endgroup$
            – Clay Thomas
            Jun 27 '18 at 13:59






            $begingroup$
            You write "And the whole image of a group homomorphism is always a normal subgroup in the codomain". This is false. Take, as a counterexample, any non-normal subgroup $H le G$ and consider the inclusion map $H to G$ given simply by $i(h) = h$.
            $endgroup$
            – Clay Thomas
            Jun 27 '18 at 13:59




















            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%2f1406315%2fset-of-all-inner-automorphisms-is-a-normal-subgroup%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

            MongoDB - Not Authorized To Execute Command

            How to fix TextFormField cause rebuild widget in Flutter

            in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith