What about How to Prove Aut(G) is a Group?

[vsage]

This should probably be posted in the math forums but I guess it would fall under here because it's a HW question due late tomorrow.

If G is a group, prove that Aut(G) and Inn(G) are groups, where Aut(G) is the set of automorphisms of G and Inn(G) is the set of inner automorphisms of G

For now I'm not concerned with proving Inn(G) is a group so I'm only going to post my attempt at a proof that Aut(G) is a group. Please critique it to death because my professor is very meticulous, ie if I label a variable i that represents the last character in a finite set as opposed to n I will get marked off because i classically represents an arbitrary element in that set:

Let Aut(G) = {\phi_1 , \phi_2 ... \phi_n} where \phi_i is an automorphism for 1<=i<=n

Aut(G) is a group iff:
1. {\phi_i}^{-1} \in Aut(G)
2. \exists an identity \phi_e
3. \phi_i (\phi_j \phi_k) = (\phi_i \phi_j) \phi_k for \phi_i , \phi_j , \phi_k \in Aut(G)

(Aside: I have access to a theorem that says if \phi_i is an isomorphism, so is {\phi_i}^{-1})

1. By property 3 of Thm. 6.3, if \phi_i is an isomorphism G\rightarrow G&#039;, {\phi_i}^{-1} is an isomorphism G&#039; \rightarrow G. Since G&#039; = G for an automorphism, {\phi_i}^{-1} \in Aut(G)

2. There exists an identity \phi_e \in Aut(G):
Let \alpha_e : G \rightarrow G : x \rightarrow x. \alpha_e is obviously 1-1. Since for a, b \in G \alpha_e(a)\alpha_e(b) = (a)(b) = (ab) = \alpha_e(ab), \alpha_e preserves function composition and therefore is isomorphic. Because \alpha_e transforms G \rightarrow G, it is an automorphism so \alpha_e \in Aut(G).
- Since \forall x \in G, \phi_i\alpha_e(x) = \phi_i(\alpha_e(x)) = \phi_i(x) and \alpha_e\phi_i(x) = \alpha_e(\phi_i(x)) = \phi_i(x) for 1<=i<=n, \alpha_e = \phi_e

3. The function composition operation is itself associative, so associativity holds in Aut(G)

Thus Aut(G) is a group satisfying the 3 properties above

-Is it fixable? What do I need to change? I'm really trying to learn this.

 

[Hurkyl]

You seem to be assuming G is a group of functions, with group operation composition, and that Aut(G) is finite. Was that intentional?


You might want this notation for a function: I think it's clearer, and more standard:

<br /> \alpha_e : G \rightarrow G : x \rightarrow x<br />


Don't you need to prove that the identity element is both a left and a right identity?


Why did you appeal to the associativity of G?

 

[vsage]

Alright I'm looking at what you said, and I guess I screwed up the wording of the question a little so I'll edit it to be verbatim out of the book. I corrected the definition of \alpha_e. It doesn't specify what G is, but how would the argument change if G is just a bunch of random numbers? Also, is it safe to just remove the constraint n from the set to make it infinite or is that not right? As for the third line, I am writing that in now because I accidentally assumed the group was Abelian.

The fourth line has me a little stumped though. How should I approach proving associativity then? I did sort of just get lazy at the end and blurt out 3.

Edit: I changed 3. a little because it didn't seem to make sense to bring up the fact that associativity holds between elements of G when I was talking about compositions of functions in Aut(G). Is it any less wrong?

 

[Hurkyl]

It doesn't specify what G is, but how would the argument change if G is just a bunch of random numbers?

It changes because you must speak of the "group operation" instead of "function composition". That's it, though.



Your way of saying something is in Aut(G) is somewhat awkward... why not say things like:

If \pi, \phi, \theta \in \mathrm{Aut}(G), then \pi (\phi \theta) = (\pi \phi) \theta?