Proof of Aut(G): ϕ(Z(G))= Z(G)

  • Thread starter Thread starter mykayla10
  • Start date Start date
  • Tags Tags
    Abstract Proofs
Click For Summary
SUMMARY

The discussion focuses on proving that for every automorphism ϕ in Aut(G), the center of the group Z(G) is invariant under ϕ, specifically that ϕ(Z(G)) = Z(G). Participants emphasize the need to show that if g is in Z(G), then ϕ(g) must also commute with every element h in G. The proof involves demonstrating that ϕ(g) is in Z(G) by leveraging the properties of automorphisms and the definition of Z(G) as the set of elements that commute with all elements in G.

PREREQUISITES
  • Understanding of group theory, specifically the concepts of automorphisms and centers of groups.
  • Familiarity with the notation and properties of Z(G) as defined in group theory.
  • Knowledge of the properties of homomorphisms and their implications in group structures.
  • Ability to manipulate and prove statements involving elements and their images under group mappings.
NEXT STEPS
  • Study the properties of group automorphisms in detail, focusing on their effects on group structure.
  • Learn about the implications of the center of a group in relation to its automorphisms.
  • Explore examples of groups and their centers to solidify understanding of Z(G) and its properties.
  • Investigate related theorems in group theory that discuss the behavior of subgroups under automorphisms.
USEFUL FOR

Mathematicians, particularly those specializing in abstract algebra, students studying group theory, and anyone interested in the properties of automorphisms and their effects on group centers.

mykayla10
Messages
7
Reaction score
0

Homework Statement


For every ϕ in Aut(G), ϕ(Z(G))= Z(G).


Homework Equations


Z(G):={g in G| gh=hg for all h in G}


The Attempt at a Solution


I haven't made too much progress on this one. I know that if I let g be an element of Z(G) that I need to prove that For every ϕ(g) is also and element of Z(G), which means I need to prove that for every h in G ϕ(g)h=hϕ(g). I just do not know where to go from there. I also do not even know where to begin in proving that Z(G) is an element of ϕ(Z(G)) so that I can completely prove the equality.
 
Physics news on Phys.org
You know that phi is an automorphism. Which means that there is an element j of G such that phi(j)=h. Can you use that to prove phi(g)h=hphi(g)?
 
mykayla10 said:

Homework Statement


For every ϕ in Aut(G), ϕ(Z(G))= Z(G).


Homework Equations


Z(G):={g in G| gh=hg for all h in G}


The Attempt at a Solution


I haven't made too much progress on this one. I know that if I let g be an element of Z(G) that I need to prove that For every ϕ(g) is also and element of Z(G), which means I need to prove that for every h in G ϕ(g)h=hϕ(g). I just do not know where to go from there.

Do you mean: I need to prove that [tex]\phi(Z(G)) \subseteq Z(G)[/tex]?
That involves proving for each [tex]x \in G[/tex], [tex]x \in \phi(Z(G))[/tex] implies [tex]x \in Z(G)[/tex].
Let [tex]x \in \phi(Z(G))[/tex] Then there exists a [tex]g \in Z(G)[/tex] such that [tex]x = \phi(g)[/tex] because [tex]x[/tex] is in the image of [tex]Z(G)[/tex] under the mapping [tex]\phi[/tex]. (Now you have your [tex]\phi(g)[/tex] to work with.)

Then do the part involving [tex]h[/tex].

Since [tex]\phi[/tex] s an automorphism, there exists an element [tex]r[/tex] such that [tex]\phi^{-1}(h) = r[/tex]. Show [tex]gr = rg[/tex]. Then look at [tex]\phi(rg) = \phi(gr)[/tex]

I also do not even know where to begin in proving that Z(G) is an element of ϕ(Z(G)) so that I can completely prove the equality.

You mean "is a subset".

Let [tex]g \in Z(G)[/tex]. Look at [tex]x = \phi^{-1}(g)[/tex] Show [tex]x[/tex] commutes with all elements [tex]r \in G[/tex] That proves that [tex]g[/tex] is the image of an element in [tex]Z(G)[/tex] , so [tex]g \in \phi(Z(G))[/tex]
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
3
Views
2K
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K