Showing that a map from factor group to another set bijective

  • Thread starter Thread starter demonelite123
  • Start date Start date
  • Tags Tags
    Group Map Set
demonelite123
Messages
216
Reaction score
0
Let G have a transitive left action on a set X and set H = G_x to be the stabilizer of any point x. Show that the map defined by f: G/H \rightarrow X where f(gH) = gx is well defined, one to one, and onto.

i think i know how to show well defined. letting g1 H = g2 H, if i multiply on the right both sides with x, then since H is the stabilizer of x, Hx = x so i get g1 x = g2 x which is what i wanted. i am having some trouble though on showing that this function is one to one and onto most likely because i am still getting acquainted with the ideas of factor groups and cosets.

So for one to one i want to show that if g1 x = g2 x then g1 H = g2 H. what i did was x = g_1^{-1}g_2 x which implies that g_1^{-1}g_2 \in H and this shows g_1 H = g_2 H.

For onto i tried saying that given any gx in X, you can then find gH in G/H which maps to it. but I'm not sure if this is valid or not. when proving onto do i need to start with an arbitrary x in X? or do i start with some gx in X?
 
Physics news on Phys.org
demonelite123 said:
Let G have a transitive left action on a set X and set H = G_x to be the stabilizer of any point x. Show that the map defined by f: G/H \rightarrow X where f(gH) = gx is well defined, one to one, and onto.

i think i know how to show well defined. letting g1 H = g2 H, if i multiply on the right both sides with x, then since H is the stabilizer of x, Hx = x so i get g1 x = g2 x which is what i wanted. i am having some trouble though on showing that this function is one to one and onto most likely because i am still getting acquainted with the ideas of factor groups and cosets.

g_1 H = g_2 H \implies g_2^{-1}g_1 H = H \implies g_2^{-1}g_1 \in H \implies g_2^{-1}g_1 \cdot x=x \implies g_1 \cdot x = g_2 \cdot x \implies f(g_1 H) = f(g_2 H).

So for one to one i want to show that if g1 x = g2 x then g1 H = g2 H. what i did was x = g_1^{-1}g_2 x which implies that g_1^{-1}g_2 \in H and this shows g_1 H = g_2 H.

This is OK.

For onto i tried saying that given any gx in X, you can then find gH in G/H which maps to it. but I'm not sure if this is valid or not. when proving onto do i need to start with an arbitrary x in X? or do i start with some gx in X?

You need to start with an arbitrary y in X. Since G is transitive there exist g\in G such that g \cdot x = y. So y = f(gH) i.e. f is onto.
 
thanks for clearing that up for me! and sorry for the late reply.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
13
Views
579
Replies
19
Views
2K
Replies
2
Views
2K
Replies
3
Views
445
Replies
8
Views
3K
Replies
2
Views
2K
Replies
18
Views
2K
Replies
7
Views
4K
Replies
10
Views
2K
Back
Top