Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let $S = \{a_{1}, a_{2}, ... a_{n} \}$ be a nonempty subset of $G$, which is a finite group. Also let $S$ be closed under multiplication. If $a_{i} \in S$, then we consider the distinct elements $a_{i}a_{1},...,a_{i}a_{n} \in S$. Because each product is distinct, $a_{i}a_{1} \neq a_{i}a_{k}$. But since I do not know $S$ is a subgroup yet, I cannot assume $S$ contains an inverse element for every $a_{i} \in S$. My question is can I assume $a_{1} \neq a_{k}$ even though I do not know that $a_{i}^{-1} \in S$?

share|improve this question
    
Yes, since the inverses still exist in G. –  Joe Aug 17 '11 at 16:42
    
The answer to the question you should have asked has been given by @Matt. You want to show that for any $i$, $j$, $k$, if $a_ia_j=a_ia_k$, then $a_j=a_k$. In other words, you want to prove that for fixed $i$, the objects $a_ib$, where $b$ ranges over $S$, are distinct. –  André Nicolas Aug 17 '11 at 16:51

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.