nata
- 2
- 0
Homework Statement
Let G be a nonempty finite set with an associative binary operation such that:
for all a,b,c in G
ab = ac => b = c
ba = ca => b = c
(left and right cancellation)
Prove that G is a group.
2. The attempt at a solution
Let a \in G, the set <a> = {a^k : k \in N} is a finite closed subset of G. So, \exists(k_1, k_2)\inN, such that:
a^{k_1}=a^{k_2} using the cancellation property I found that a=a.a^{k_2-k_1}.
So,
a^{k_2-k_1} is the identity but the problem is in this reasoning every cyclic subgroup will generate a different identity. And the identity is supposed to be unique. I don't know how to proceed now, any help would be appreciate it.
Thanks is advance,
NAta