The set of ring automorphisms is an abstract group under composition

catcherintherye
Messages
47
Reaction score
0

Homework Statement



Aut(R) denotes the set of ring automorphisms of a ring R Show formally that Aut(R) is a group under composition.

Homework Equations





The Attempt at a Solution



I Have a very similar question to which I have the solution viz


Aut(G) denotes the set of group automorphisms of a Group G, show that Aut(G) is a group under composition.


Proof Let a,b: G -> G be automorphisms

then a\circ b: G \rightarrow g is also an auto

(a\circ b)(xy) = a(b(xy))=a(b(x)b(y))= a(b(x))a(b(y))
=(a\circ b)(x)(a\circ b)(y)

so a\circb is a homomorphism

it is also bijective since a,b are bijective

\circ: aut(G)\times aut(G) \rightarrow aut(G)
is automatically associative (because comp of mappings is associative)

As identity in Aut(G) take Id_g:G \rightarrow G
finally inverses

Let a: G --> G be an auto

then a^-1:G -->G is atleast a mapping and bijective

need only show

a^-1(xy) = a^-1(x)a^-1(y)

let x,y \in G

choose c,d \in G : a(c)=x, a(d)=y

a^-1(xy) = a^-1(a(c)a(d))=a^-1(a(cd)) = cd= a^-1(x)a^-1(y)

q.e.d



...the proof for rings is essentially the same right? The only thing that concerns me is the last part(above) since we used the fact that every element has it's inverse in a group but we don't have that in a ring...:confused:
 
Last edited:
Physics news on Phys.org
Where have you used that fact?
 
ok so i haven't and these two proofs are essentially the same?
 
You did use a-1 where a is automorphism. You say you know
Aut(G) denotes the set of group homomorphisms of a Group G, show that Aut(G) is a group under composition.

Are you sure of that definition of Aut(G)? Homomorphism, in general, do not have inverses.
 
no I've made a mistake it's supposed to be the group of isomorphisms
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Replies
3
Views
2K
Replies
6
Views
2K
Replies
2
Views
2K
Replies
8
Views
2K
Replies
1
Views
2K
Replies
24
Views
5K
Replies
3
Views
2K
Back
Top