Is this proof okay? It just seemed too simple
---------------
Prop: If a group G satisfies ab=ca => b=c, then the group is Abelian.
Pf: Assuming ab=ca, then b=c. Thus we can substitute b in for c, and we get: ab=ba. Thus G is Abelian.
---------------
Also, I am supposed to find as many ways to prove \(\displaystyle (a^{-1})^{-1} = a\) as possible.
I found only two..
1:
\(\displaystyle (a^{-1})^{-1}a^{-1} = e = aa^{-1} \text{ by inverse property} \\ \text{thus, } (a^{-1})^{-1} = a \text{ by RHS cancelation.}\)
2:
\(\displaystyle (a^{-1})^{-1}a^{-1} = e = a^{-1}(a^{-1})^{-1}\\ \text{ since } a^{-1} \text{ is the inverse of both } a \text{ and } (a^{-1})^{-1} \\ \text{ then } a \text{ must be equal to } (a^{-1})^{-1} \text{ by the uniqueness of the inverse.}\)
Thanks,
-Daon
---------------
Prop: If a group G satisfies ab=ca => b=c, then the group is Abelian.
Pf: Assuming ab=ca, then b=c. Thus we can substitute b in for c, and we get: ab=ba. Thus G is Abelian.
---------------
Also, I am supposed to find as many ways to prove \(\displaystyle (a^{-1})^{-1} = a\) as possible.
I found only two..
1:
\(\displaystyle (a^{-1})^{-1}a^{-1} = e = aa^{-1} \text{ by inverse property} \\ \text{thus, } (a^{-1})^{-1} = a \text{ by RHS cancelation.}\)
2:
\(\displaystyle (a^{-1})^{-1}a^{-1} = e = a^{-1}(a^{-1})^{-1}\\ \text{ since } a^{-1} \text{ is the inverse of both } a \text{ and } (a^{-1})^{-1} \\ \text{ then } a \text{ must be equal to } (a^{-1})^{-1} \text{ by the uniqueness of the inverse.}\)
Thanks,
-Daon