How to prove the group is generated by $a, b$ is cyclic group, where $a^2=1, b^3=1 $ and $a,b \in \mathbb{C}$?
I guess the order of group $<a,b>$ is 6, and the elements are $0, ab, b^2, a, b, ab^2$. Is it right?
How to prove the group is generated by $a, b$ is cyclic group, where $a^2=1, b^3=1 $ and $a,b \in \mathbb{C}$?
I guess the order of group $<a,b>$ is 6, and the elements are $0, ab, b^2, a, b, ab^2$. Is it right?
This statement is not true without further constraints on the group. There is a group that is generated by two elements $a,b$, and that satisfies $a^2=1$ and $b^3=1$, but which is not a cyclic group. It is known as the free product $\mathbb{Z} / 2 \mathbb{Z} * Z / 3 \mathbb{Z}$ of the cyclic group $\mathbb{Z} / 2 \mathbb{Z}$ of order $2$ with the cyclic group $Z / 3 \mathbb{Z}$ of order $3$. This group is not even finite and is not abelian. In some sense this is the "free-est" or "most universal" group that is generated by two elements $a,b$ and that satisfies $a^2=1$ and $b^3=1$.
If your group multiplication law is multiplication in $\mathbb C$ then the group is abelian (since multiplicaiton in $\mathbb C$ is commutative). This is all we need to show the group is cyclic.
If $a=1$, then the group is generated by $b$ only, so it is trivially cyclic; similarly if $b=1$, the group is generated by $a$ only so trivially cyclic. (Thanks to arugula for pointing out the need to consider this case.) Thus we assume $a \neq 1$ and $b \neq 1$.
In this case, the $6$ elements you list are indeed the only elements in the group, so to show the group is cyclic, you can demonstrate an element of order $6$. Clearly $0$ has order $1$, $a$ has order $2$, and $b$ and $b^2$ have order $3$. What about $ab$? $$(ab)^2 = a^2b^2 = b^2$$ and $$(ab)^3 = a^3b^3 = a$$ Neither of these is the identity, so the order of $ab$ is not $1$, $2$, or $3$. Since the order must divide the order of the group ($6$), it must be $6$. (Note that $ab^2$ is also an element of order $6$ -- similar reasoning would work.)