I couldn't find the words to summarize my question perfectly in the title so I will clarify my question here.(adsbygoogle = window.adsbygoogle || []).push({});

Say we have a group G in which every element can be written in the form [itex]g_1^{e_1} g_2^{e_2}...g_n^{e_n}, 0 ≤ e_i < |g_i| [/itex].

Suppose that there exists a different set [itex] g_1', g_2', ..., g_n' [/itex] that generates G in the same way: [itex]g = g_1'^{e'_1} g_2'^{e'_2}...g_n'^{e'_n}, 0 ≤ e'_i ≤ |g'_i| [/itex] where [itex] |g'_i| = |g_i| [/itex]. (As a concrete example, think of Dn, in which every element can be written as [itex]s^i r^j, 0 ≤ i < 2, 0 ≤ j < n [/itex] and r can be any rotation of order n, and s can be any reflection).

Then suppose [itex] \phi: G → G [/itex] is an automorphism. Then [itex] \phi [/itex] is completely determined by its effect on the generators of G. But are we guaranteed that switching [itex]g_i, g'_i[/itex] always guarantees an automorphism, and that all values of [itex]\phi [/itex] for the generators are independent?

For example, in Dn, can I define [itex]\phi(r)[/itex] to be any rotation with order n, and define [itex]\phi(s)[/itex] to be any reflection? Does the choice of [itex]\phi(s)[/itex] depend on [itex]\phi(r)[/itex]?

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Does every permutation of group generators imply an automorphism?

Loading...

Similar Threads - Does every permutation | Date |
---|---|

B Why does a matrix diagonalise in this case? | Nov 21, 2017 |

B Why does every subfield of Complex number have a copy of Q? | Jun 11, 2017 |

I Does this theorem need that Ker{F}=0? | May 1, 2017 |

I What does this symbol mean?? | Oct 27, 2016 |

**Physics Forums - The Fusion of Science and Community**