2024-11-03

843: For Group and Subgroup, Conjugation for Subgroup by Group Element Is 'Groups Homomorphisms' Isomorphism

<The previous article in this series | The table of contents of this series | The next article in this series>

description/proof of that for group and subgroup, conjugation for subgroup by group element is 'groups homomorphisms' isomorphism

Topics


About: group

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that for any group and its any subgroup, the conjugation for the subgroup by any group element is a 'groups homomorphisms' isomorphism.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Structured Description


Here is the rules of Structured Description.

Entities:
G: { the groups }
G: { the subgroups of G}
g: G
fg: :GgGg1, = the conjugation for G by g
//

Statements:
fg{ the 'groups - homomorphisms' isomorphisms }
//


2: Note


Compare with the proposition that for any group, the conjugation by any element is a 'groups - homomorphisms' isomorphism, which is about the conjugation for the whole group, while this proposition is about the conjugation for a subgroup. This proposition is naturally expected from that proposition, but let us prove it for sure.


3: Proof


Whole Strategy: Step 1: see that gGg1 is a group; Step 2: see that fg is a groups homomorphism; Step 3: see that fg is bijective; Step 4: conclude the proposition.

Step 1:

gGg1 is indeed a group, because it is a conjugate subgroup of subgroup by element: see Note for the definition of conjugate subgroup of subgroup by element.

Step 2:

Let us see that fg is a group homomorphism.

For each g1,g2G, fg(g1g2)=gg1g2g1=gg1g1gg2g1=fg(g1)fg(g2).

fg is a group homomorphism, by the proposition that any map between any groups that maps the product of any 2 elements to the product of the images of the elements is a group homomorphism.

Step 3:

Let us see that fg is bijective.

Let g1,g2G be any such that g1g2. Let us suppose that fg(g1)=fg(g2). gg1g1=gg2g1, g1=g1gg1g1g=g1gg2g1g=g2, a contradiction. So, fg(g1)fg(g2). So, fg is injective.

fg is surjective, because the codomain is determined to be the range.

Step 4:

fg is a 'groups - homomorphisms' isomorphism, by the proposition that any bijective group homomorphism is a 'groups - homomorphisms' isomorphism.


References


<The previous article in this series | The table of contents of this series | The next article in this series>