Consider the algebra homomorphism $\phi:\mathbb{Q}[x^{\pm 1},y^{\pm 1},z^{\pm 1}] \rightarrow \mathbb{Q}$ defined by $\phi(x)=\phi(y)=\phi(z)=1$, where $\mathbb{Q}[x^{\pm 1},y^{\pm 1},z^{\pm 1}]$ denotes the ring of Laurent polynomials in $x,y,z$. I would like to compute the kernel of $\phi$. My guess is that it is the ideal $I$ generated by $x^{\pm 1}-1,y^{\pm 1}-1,z^{\pm 1}-1$. Clearly $I\subset \ker(\phi)$, however to prove the reverse inclusion I would need some way to write an arbitrary Laurent polynomial as a linear combination of the $x^{\pm 1}-1,y^{\pm 1}-1,z^{\pm 1}-1$ plus a remainder. Ultimately, I'm trying to show that remainder is 0.
I would like to know if such a division algorithm exists for Laurent polynomials. I know there is a multivariable division algorithm in the ring $\mathbb{Q}[x,y,z]$. Does this algorithm extend?
I don't know if there is such a division algorithm. There probably is, but you can also reduce this to finding an ideal in an ordinary polynomial ring. Namely, $$\mathbb Q[x_1,x_2,y_1, y_2,z_1,z_2]$$ The map $x_i, y_i, z_i\mapsto 1$ factors through $x_1x_2\mapsto 1$, $y_1y_2\mapsto 1$, $z_1z_2\mapsto 1$, and this middle map gives you the Laurent polynomial ring. You can use this to easily prove your conjecture, since the ideal in this larger ring is obvious.