Showing that every element in G can be written a certain way

  • Context: Undergrad 
  • Thread starter Thread starter Mr Davis 97
  • Start date Start date
  • Tags Tags
    Element
Click For Summary
SUMMARY

The discussion centers on proving that a finite group G with an automorphism σ, which has no nontrivial fixed points and satisfies σ² = identity, is abelian. The key insight is that every element in G can be expressed as x⁻¹σ(x) for some x in G. The injectivity of the function f(x) = x⁻¹σ(x) is crucial, as it implies surjectivity due to the finiteness of G, ensuring that every element can be uniquely represented in this form. The proof leverages the properties of σ being a homomorphism and its behavior under inversion.

PREREQUISITES
  • Understanding of group theory concepts, specifically finite groups and automorphisms.
  • Familiarity with the properties of injective and surjective functions.
  • Knowledge of the implications of an automorphism having only the identity as a fixed point.
  • Basic experience with proof techniques in abstract algebra.
NEXT STEPS
  • Study the properties of automorphisms in group theory, focusing on their implications for group structure.
  • Learn about injective and surjective functions in the context of finite sets.
  • Explore examples of abelian groups and the conditions under which groups are abelian.
  • Investigate advanced proof techniques in abstract algebra, particularly those involving homomorphisms and inverses.
USEFUL FOR

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

Mr Davis 97
Messages
1,461
Reaction score
44
Let G be a finite group which possesses an automorphism ##\sigma## that has no nontrivial fixed points and ##\sigma ^2## is the identity map. Prove that ##G## is abelian.

So there's a hint, and it tells me first to established that every element in ##G## can be written as ##x^{-1} \sigma (x)## for some ##x \in G##. I have two questions. Why does showing that ##f(x) x^{-1} \sigma (x)## is injective prove the hint, and how could I ever approach this problem without knowing the hint?
 
Physics news on Phys.org
If ##f\, : \,x \mapsto x^{-1}\sigma(x)## is injective, then it is also surjective, because ##G## is finite, hence every element can uniquely be written in this form. For injectivity use the fact, that ##\sigma ## has only one fixed point.

How to find the trick is a difficult question. It's usually a mixture of experience, practice, fantasy, and sometimes methodology. I like to say: first list all what is given. Also a backwards approach can help: Write down the statement which has to be proven and see if there are sufficient conditions, from which it will follow. Then try to prove such a condition. This method is often the first step in very complex proofs.

For the above we had used that ##\sigma ## is a homomorphism, has only ##e## as fixed point, and that ##G## is finite. So somehow we need to use the fact, that ##\sigma^2= 1##. This means ##\sigma = \sigma^{-1}## so inverses might play a role. From your own experience you already know, that inversion together with automorphism implies commutativity, so to consider elements ##x^{-1}\sigma (x)## isn't far fetched. This is only one way, but to gather all given facts in the first place is always a good start. Unfortunately a rarely used habit, if I think about all the empty places under section 2 of our homework template. In real life one probably tries a lot of ideas and among the scribbling will turn up the solution. The expressions which can help aren't too many in this example.
 
  • Like
Likes   Reactions: Mr Davis 97

Similar threads

  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 26 ·
Replies
26
Views
1K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
48
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K