Let $G$ be a semigroup. Then $G$ is a group if for all $a,b\in G$, the equations $ax=b$ and $ya=b$ have solutions in $G$.
This is the proposition 1.4 of hungerford algebra textbook. Can you give me a hint?
Let $G$ be a semigroup. Then $G$ is a group if for all $a,b\in G$, the equations $ax=b$ and $ya=b$ have solutions in $G$.
This is the proposition 1.4 of hungerford algebra textbook. Can you give me a hint?
Copyright © 2021 JogjaFile Inc.
To find a neutral element, consider $a=b$. Name your neutral element $e$. For left/right inverses, consider $ax=e$ and $yb = e$.
Added : Suppose you want to show uniqueness of the neutral element. First of all, show that a solution to $xa = a$ is also a solution to $ay = a$. Let $x$ and $y$ be two such solutions.
The equation $za = x$ has a solution, so $$ xy = (za)y = z(ay) = za = x. $$ Similarly, the equation $aw = y$ has a solution, so $$ xy = x(aw) = (xa)w = aw = y. $$ It follows that $x=y$. In particular, if $y$ is a solution to $ay = a$, then all the solutions to $xa = a$ are equal to $y$, so there is a unique solution to $xa = a$. Similarly there is a unique solution to $ay = a$, so there is a unique neutral element for $a$. Call this element $e_a$.
Should I give more hints? The idea is to keep playing so that you accumulate enough properties to get your group. I don't have the whole proof in my head, but as soon as you'll have enough properties to have a group, you can clean the mess and make a clean proof out of it.
I add the rest of the proof here. Hover your mouse over if it you want to see.
Hope that helps,