Shhowing a map is well defined and bijective

  • Thread starter Thread starter bjogae
  • Start date Start date
  • Tags Tags
    Map
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
2 replies · 5K views
bjogae
Messages
20
Reaction score
0

Homework Statement



The group [tex]G[/tex] acts transitively from the left on the set [tex]X[/tex]. Let [tex]G_x[/tex] be the little group of the element [tex]x \epsilon X[/tex]. Show that the map [tex]i:G/G_x[/tex], [tex]i(gG_x)=gx[/tex] is well defined and bijective.

Homework Equations



transitive action:for any two x, y in X there exists a g in G such that g·x = y

The Attempt at a Solution



Transitive action shows that [tex]x \epsilon X[/tex], [tex]g \epsilon G[/tex] [tex]->[/tex] [tex]g·x \epsilon X[/tex]. This shows that the mapping is a surjection. Now how do i show that it's an injection? And obviously the bijection thing shows that the function is well defined, right? Even the injection would suffice for this?
 
Last edited:
Physics news on Phys.org
And obviously the bijection thing shows that the function is well defined, right? Even the injection would suffice for this?
No. In your proof of injectiveness you will assume that i is a function, but before you have shown that it's well-defined we only know that it's a relation. Of course I can't use the example you gave as it's a function and bijective, but there do exists bijective relations that are not functions. Consider for instance f(0) = 0, f(0) = 1 defined from [itex]\{0\}[/itex] to [itex]\{0,1\}[/itex]. As a relation f is both injective since only one element map to 0 and only one element map to 1, and it's surjective since there is an element that map to 0 and an element that map to 1, but it's not a function.

To show that it's well-defined you suppose [itex]gG_x = hG_x[/itex] and then show gx=hx, but this is clear since gx=hx iff [itex]h^{-1}gx=x[/itex] iff [itex]h^{-1}g \in G_x[/itex] iff [itex]h^{-1}gG_x = G_x[/itex] iff [itex]gG_x=hG_x[/itex]. This also shows injectiveness since we have bi-implications all the way so if gx =hx, then [itex]gG_x = hG_x[/itex]. So in this case you could do injectiveness and that i is well-defined together, but this is not true in general.

Transitive action shows that [tex]x \epsilon X[/tex], [tex]g \epsilon G[/tex] [tex]->[/tex] [tex]g·x \epsilon X[/tex]. This shows that the mapping is a surjection.
You may have the right idea (as this resembles the right way), but as written this is flawed (and you use the symbol x for two distinct objects which can be confusing). You first consider an arbitrary element [itex]y \in X[/itex] and then you want to show that there exists some [itex]gG_x \in G/G_x[/itex] which the property [itex]i(gG_x)=y[/itex]. Since the action is transitive we can find an element [itex]g \in G[/itex] such that [itex]gx = y[/itex]. [Stating that [itex]gx \in X[/itex] doesn't really give us any information or use transitivity since that is true for all group actions.] Now [itex]i(gG_x) = gx = y[/itex] so i is surjective.


As a small aside: when you type math into LaTeX, then use \in instead of \epsilon for inclusion and use \to to make the arrow.