# abstract algebra Anonymous

An automorphism is an isomorphism between a group and itself. The identity function (x -> x) is always an isomorphism, which we consider trivial. Use Sage to construct a nontrivial automorphism of the cyclic group of order 12. Check that the mapping is both onto and one-to-one by computing the image and kernel and performing the proper tests on these subgroups. Now construct all of the possible automorphisms of the cyclic group of order 12.

edit retag close merge delete

Sort by » oldest newest most voted There are (at least) three ways to define a cyclic of order 12 in Sage:

sage: C12 = groups.permutation.Cyclic(12)
sage: G12 = AbelianGroup()
sage: H12 = AdditiveAbelianGroup()


Now evaluate C12.gens() (for example): how many generators does this group have? Any homomorphism is determined by where the generators go. So what are the possible endomorphisms (= homomorphisms from the group to itself) of this group? Can you figure out which of them are actually automorphisms?

more