2024-09-01

753: For Group Action, Induced Map with Fixed Group Element Is Bijection

<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 action, induced map with fixed group element is bijection

Topics


About: group
About: set

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 action, the induced map with any fixed group element is a bijection.

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 }
S: { the sets }
f: :G×SS, { the group actions }
gG
fg: :SS,sf(g,s)
//

Statements:
fg{ the bijections }
//


2: Natural Language Description


For any group, G, any set, S, any group action, f:G×SS, and any element, gG, fg:SS,sf(g,s) is a bijection.


3: Proof


Whole Strategy: Step 1: choose each s1,s2S such that s1s2, suppose that fg(s1)=fg(s2), and find a contradiction; Step 2: choose each sS and see that fg(f(g1,s))=s.

Step 1:

Let us see that fg is an injection.

Let s1,s2S be any such that s1s2.

Let us suppose that fg(s1)=fg(s2).

gs1=gs2. s1=1s1=(g1g)s1=g1(gs1)=g1(gs2)=(g1g)s2=1s2=s2, a contradiction.

So, fg(s1)fg(s2), and fg is an injection.

Step 2:

Let sS be any.

fg(g1s)=g(g1s)=(gg1)s=1s=s.

So, fg is a surjection.


References


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