Proving Cosets of Subgroups in Nonabelian Finite Groups

  • Thread starter Thread starter nbruneel
  • Start date Start date
  • Tags Tags
    Cosets
nbruneel
Messages
3
Reaction score
0
Hi,

This is not a homework question. I am a trying to prove a result for myself, and the question is can I always find, in a nonabelian finite group G, and some fixed proper subgroup S < G, two distinct elements, which we shall call x and y, outside of S, such that the cosets Sx = Sx^{-1}, and Sy = Sy^-1. That is, can we always find elements x, y outside of S such that x and its inverse x^{-1} both belong to some coset of S, while y and y^{-1} belong to a different, disjoint coset of S.

Nici.
 
Physics news on Phys.org
Consider Z/6 with S= {0,2,4}. S1(=S5) & S3 are not disjoint.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top