Show that ϕa ∈ Inn(g) is an automorphism of G.

Any help on this, I'm kinda lost.

Printable View

- April 1st 2012, 05:36 PMJohngalt13Proof involving automophism
Show that ϕa ∈ Inn(g) is an automorphism of G.

Any help on this, I'm kinda lost. - April 1st 2012, 06:49 PMDevenoRe: Proof involving automophism
what is an automorphism of G?

1. it is a homomorphism from G to G

2. it is bijective

so we have to check conditions (1) and (2) above.

to prove (1), we need to show that for all x,y in G.

but can you continue?

to prove (2), we have to show 2 things as well:

2.a. is injective

2.b. is surjective

to prove (2.a) it suffices to show that . so suppose .

this means that , so , so what can we say about x? (what is the unique element of G such that ax = a?).

to prove (2.b) for any y in G, we need to find some x in G with . how about ?

*******

alternately, to show is bijective, we could exhibit a (two-sided) inverse. what is the logical candidate for ?

(maybe ? can you prove this ?) - April 1st 2012, 07:11 PMJohngalt13Re: Proof involving automophism
Thanks!

I think I got it, I'm a little lost on how to handle the step where you go from ϕa(xy)=a(xy)a^-1 though still

If ϕ is given an operation I get it, but how do you know what to do when you don't really know what the mapping is?

Thanks - April 1st 2012, 08:58 PMDevenoRe: Proof involving automophism
by definition the inner automorphism of G induced by an element a of G, is conjugation by a:

, for all x in G.

since xy is an element of G, is xy conjugated by a: .

in other words there are two groups at play here:

one group is G, whose elements are just elements of the set G.

the other group is Aut(G) whose elements are functions (special functions, that preserve the multiplication of G, and are bijective).

in G, we multiply. in Aut(G), we compose functions.

now, for any element g in G, there is an element in Aut(G), called the inner automorphism induced by G.

and, in fact, the mapping is a homomorphism itself of G into Aut(G).

the image of the homomorphism is a subgroup of Aut(G), called the group of inner automorphisms of G, or Inn(G).

the thing is, this usually ISN'T an isomorphism, because two different elements of G might give the same automorphism.

let's look at an example:

suppose where .

let's compute the different automorphisms .

first of all, it's clear that for all .

this is a special automorphism, the identity automorphism, which is the identity of Inn(G) (and of Aut(G), as well).

you may take my word for it (or verify it yourself) that commutes with all of .

so , so even though .

next, let's look at .

(duh!)

so is the identity on .

(so for example, ).

i will leave it to you to prove that .

next we look at :

(easy)

i will state without proof that , and that you can compute by composing and .

it follows that .

in fact (you can verify the details yourself, it's good practice for you): . - April 2nd 2012, 06:10 PMJohngalt13Re: Proof involving automophism
Thanks a lot! That was incredibly helpful