I'm studying groups diving into the fantastic Artin's Algebra book. Actually, he's presenting the S3 group using the matrix representation of 2 permutations:
$x = (1 3 2)$ and $y = (1 2)$
Actually, he correctly claims the whole group can be generated by these ones, like this (prop. 1.17):
$\{1,x,x^2,y,xy,x^2y\}$
To get the above items, we can use the following rules between generators (prop. 1.18):
$x^3=1, y^2=1, yx = x^2y$
From the text, the author suggests these rules can be verified directly. The 1st and 2nd ones are straightforward, but I was trying to have a small demo about the 3rd one, i.e. $yx = x^2y$. Actually, I guess the author means directly suggesting to replace directly the x and y by the related permutations, and see the lhs and rhs actually match as expected. However, I was struggling trying to demonstrate that rule using other axioms. The most I got, is a different way of expressing the rhs, i.e.:
$x^3 = 1 \implies x^2 = x^{-1} \implies x^2y = x^{-1}y$
After a bit of time, I realized this is probably not possible, since those 3 rules must be taken together as axioms as a whole, without getting one of the other two ones.
In the same paragraph, Artin is claiming any possible pattern of xy can be finally expressed as $x^ny^m$, but in this case the original $x^2y$ is already in that form.
Am I correct in my analysis? I mean: is there a way, using pattern reduction by the rule 1) and 2), to desume the third rule $x^2y$ without direct permutation replacement?
Thanks for the help in advance