Automorphism of order 2 fixing just identity. Prove that G is abelian.

  • Context: MHB 
  • Thread starter Thread starter caffeinemachine
  • Start date Start date
  • Tags Tags
    Identity
Click For Summary
SUMMARY

The discussion centers on proving that a finite group \( G \) is abelian under the conditions that \( T \) is an automorphism of order 2, fixing only the identity element. It is established that \( T^2 = I \) and that the cycle representation of \( T \) consists of \( (n-1)/2 \) disjoint transpositions, indicating that \( n \) is odd. The injectivity of the function \( f(g) = g^{-1}T(g) \) is also a key point in the proof, leading to the conclusion that \( G \) must be abelian.

PREREQUISITES
  • Understanding of group theory concepts, particularly automorphisms.
  • Familiarity with the properties of finite groups and their order.
  • Knowledge of permutation representations and cycle notation.
  • Basic understanding of injective and bijective functions.
NEXT STEPS
  • Study the properties of automorphisms in group theory.
  • Learn about the implications of group order and parity in finite groups.
  • Explore the concept of injective functions and their role in group homomorphisms.
  • Investigate the relationship between transpositions and group structure.
USEFUL FOR

This discussion is beneficial for mathematicians, particularly those specializing in abstract algebra, group theorists, and students seeking to deepen their understanding of automorphisms and their implications on group properties.

caffeinemachine
Gold Member
MHB
Messages
799
Reaction score
15
Let $G$ be a finite group, $T$ an automorphism of $G$ with the property that $T(x)=x$ if and only if $x=e$. Suppose further that $T^2=I$, that is, $T(T(x))=x$ for all $x\in G$. Show that $G$ is abelian.

I approached this problem using the permutation representation afforded by $T$ on $G$. Its easy to deduce that the cycle representation of the permutation of $G$ caused by $T$ has $(n-1)/2$ disjoint transpositions, where $n=|G|$. We know, from this, that $n$ is odd but so what? I am not able to exploit the homomorphism property of $T$.
 
Physics news on Phys.org
hint: (i don't want to spoil your fun because this is a beautiful theorem)

define $f:G \to G$ by:

$f(g) = g^{-1}T(g)$

show $f$ is injective (and thus bijective).

now...what is $T\circ f(g)$?
 

Similar threads

Replies
8
Views
5K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
981
  • · Replies 0 ·
Replies
0
Views
929
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 20 ·
Replies
20
Views
4K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K