Pass on!
I've been struggling with a problem for a while (belong while) now. It doesn't seem like it has a straight forward solution or an objection to the way I set it up. A group is a set that is endowed with a binary operation and that follows the following rules.
- a x b belongs to G.
- a x( b x c ) = (a x b) x c.
- There exists 0 | a x 0 = 0 x a = a.
- For every a, there exists a_1 | a x a_1 = a_1 x a = 0. βIn any case, there is no rules that the operation "x" has to follow. The meaning of "x" in the context of "a x b" and that of "c x d" can be different. Keeping this in mind, can an element in a "group" have way more than just one inverse element?
Note: ( a, b, c, d belong to the group G. "x" is the binary operation ).