Abstract Algebra: Automorphisms

In summary: So, in summary, an automorphism of a group maps generators to generators in order to preserve the group structure. If a homomorphism does not map a generator of the domain group to a generator of the codomain group, then it can be considered a proper subgroup and therefore not a set of generators. Additionally, the homomorphism must be surjective in order for the generators to be preserved. However, if the kernel is non-trivial, a generator may be mapped to the identity, in which case the set of generators may not be considered minimal.
  • #1
nateHI
146
4
I have a question about Automorphisms. Please check the following statement for validity...

An automorphism of a group should map generators to generators. Suppose it didn't, well then the group structure wouldn't be preserved and since automorphisms are homomorphisms this would be a contradiction.

If this is valid is there an example of a homomorphism (not an automorphism) of groups, say ##\phi:G\to H## that doesn't map a generator of ##G## to a generator of ##H##?
 
Physics news on Phys.org
  • #2
Isnt the constant map to the identity a homomorphism? Or do you mean for non-constant maps?

EDIT: Actually, the identity does generate the subgroup Im(G).
 
Last edited:
  • #3
An automorphism of a group with a generating set will map the generating set to a generating set, but not necessarily the same one. For a concrete example, we could map the free abelian group G on two symbols [itex]\{x,y\}[/itex] to itself by mapping [itex]x\mapsto x-y[/itex] and [itex]y\mapsto 2y-x[/itex].

More generally, homomorphisms [itex]G\rightarrow H[/itex] don't have any choice other than to map generators of G to the generators of the image in H. [itex]\mathbb{Z}[/itex] makes a good example since it only has one generator. If I'm looking at any morphism [itex]\mathbb{Z}\rightarrow G[/itex], I need only define [itex]\varphi(1)[/itex]. As then, [tex]\varphi(n) = \varphi(\underbrace{1+1+\ldots +1}_\text{n}) = \underbrace{\varphi(1)+\varphi(1)+\ldots \varphi(1)}_\text{n} \in G[/tex] So [itex]\varphi(1)[/itex] generates [itex]\textrm{Im}(\varphi)\leq G[/itex]. This works similarly for any other group with a generating set, since every element will break down into combinations of those in the generating set. The only caveat is that its possible to map generators to the identity of the codomain group.. in which case it's not much of a generator anymore.
 
  • #4
OK, thank you both for your reply. It's a little more clear now.
 
  • #5
Like Fire Garden said, this is the defining ( Universal) property of free "objects".
 
  • #6
nateHI said:
I have a question about Automorphisms. Please check the following statement for validity...

An automorphism of a group should map generators to generators. Suppose it didn't, well then the group structure wouldn't be preserved and since automorphisms are homomorphisms this would be a contradiction.

If this is valid is there an example of a homomorphism (not an automorphism) of groups, say ##\phi:G\to H## that doesn't map a generator of ##G## to a generator of ##H##?

Map any proper subgroup of a group to itself by the inclusion homomorphism. Then any set of generators of the subgroup can not be a set of generators of the group.

More generally the homomorphism must be surjective.

However, if the kernel is non-trivial then a generator may be mapped to the identity. In this case one might ask whether a set that contains the identity is really a set of generators. Certainly if you take set of generators to mean a minimal set i.e. a set that can not be made smaller and still generate the group, then a set containing the identity is not a set of generators.
 

1. What is an automorphism in abstract algebra?

An automorphism in abstract algebra is a function that maps a set onto itself while preserving the algebraic structure. In other words, it is a bijective function that preserves the operations, such as addition and multiplication, of the set.

2. What is an example of an automorphism?

A simple example of an automorphism is the identity function, where the input is the same as the output. In abstract algebra, this function is written as id(x) = x. This function is bijective and preserves the algebraic structure.

3. How are automorphisms used in abstract algebra?

Automorphisms are used in abstract algebra to study the properties of a mathematical structure. They help to identify symmetries and patterns within the structure and can provide insights into its properties and behaviors.

4. What is the difference between an inner and outer automorphism?

An inner automorphism is a function that is defined within a structure and maps elements of the structure onto each other. An outer automorphism, on the other hand, is a function that maps the entire structure onto itself, but may not be defined within the structure itself.

5. Can every mathematical structure have an automorphism?

No, not every mathematical structure has an automorphism. A structure must have certain properties, such as being closed under the operations, in order to have an automorphism. Additionally, some structures may have limited or trivial automorphisms.

Similar threads

  • Linear and Abstract Algebra
Replies
2
Views
1K
  • Linear and Abstract Algebra
Replies
5
Views
2K
  • Linear and Abstract Algebra
Replies
19
Views
3K
  • Linear and Abstract Algebra
Replies
5
Views
2K
Replies
0
Views
307
  • Linear and Abstract Algebra
Replies
2
Views
1K
  • Linear and Abstract Algebra
Replies
4
Views
2K
  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
6
Views
2K
  • Linear and Abstract Algebra
Replies
2
Views
2K
Back
Top