Order of Automorphism and Abelian Groups

  • Thread starter Thread starter RVP91
  • Start date Start date
  • Tags Tags
    Groups
AI Thread Summary
If the order of the automorphism group |Aut H| equals 1, then H must be an Abelian group. The argument hinges on the fact that if H is not Abelian, there exist non-identity automorphisms, leading to |Aut H| being greater than one. Specifically, the inner automorphism defined by A(x) = (h^-1)xh would not be the identity if H is non-Abelian. Consequently, if every inner automorphism is the identity, it follows that elements of H commute, confirming that H is Abelian. Thus, the proof demonstrates that |Aut H| = 1 is a definitive condition for H being Abelian.
RVP91
Messages
50
Reaction score
0
If |Aut H| = 1 then how can I show H is Abelian? I've shown a mapping is an element of Aut H previously but didn't think that would help.

I have been looking through properties and theorems linked to Abelian groups but so far have had no luck finding anything that would help.

The closest I have is that it may have something to do with "any subgroup of an Abelian group is normal"

My line of argument was if |Aut G|=1 then Inn G = Aut G and so since Inn G is normal then G is normal?

However something tells me this is incorrect.

Thanks in advance for any help
 
Mathematics news on Phys.org
Here is my revised argument.
To show |Aut H| = 1 implies H is Abelian, we can show H is not Abelian implies |Aut H| does not equal 1.
If H is not Abelian then, we know firstly the identity map is always an automorphism of H. Furthermore we know that the mapping A: H ---> H given by A(x) = (h^-1)xh (where h,(h^-1),x are in H and h and (h^-1) are fixed). This tells us that we have |Aut H| does not equal to one. If H had been Abelian then A(x) = (h^-1)xh = (h^-1)x = x and this is just the identity map again.
 
Your proof works, but try showing the result directly, i.e. without using contradiction.

Here's an even shorter proof. We know G/Z(G) \cong \text{Inn}(G) \subseteq \text{Aut}(G). So if |Aut(G)|=1, then |G/Z(G)| = 1, implying Z(G)=G.
 
along the same lines:

if |Aut(G)| = 1, then every inner automorphism is the identity.

this means that for every x and g in G:

gxg^-1 = x, so

gx = xg.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Back
Top