TOPICS
Search

Coordinate Polynomial


A coordinate polynomial in k[x_1,...,x_n] is a polynomial f that can be completed to a polynomial coordinate system. There must be f_2,...,f_n such that

 k[x_1,...,x_n]=k[f,f_2,...,f_n]

as a polynomial ring. Equivalently, a k-algebra automorphism sends f to x_1. For example, x_1+x_2^2 is a coordinate polynomial, completed by x_2,...,x_n.

Every fiber of a coordinate polynomial is affine (n-1)-space and an ambient polynomial automorphism takes it to a coordinate hyperplane. Having one fiber isomorphic to affine space does not itself exhibit such an automorphism. The Abhyankar-Sathaye conjecture asks whether that quotient condition is sufficient. The stable coordinate conjecture instead tests coordinates after adjoining independent variables.


See also

Abhyankar-Sathaye Conjecture, Affine Space, Automorphism, Polynomial Ring, Stable Coordinate Conjecture

Explore with Wolfram|Alpha

References

Gupta, N. "The Zariski Cancellation Problem and Related Problems in Affine Algebraic Geometry." In Proc. International Congress of Mathematicians 2022, Vol. 3: Sections 1-4 (Ed. D. Beliaev and S. Smirnov). Berlin, Germany: EMS Press, pp. 1578-1598, 2023. https://doi.org/10.4171/ICM2022/151.Makar-Limanov, L.; van Rossum, P.; Shpilrain, V.; and Yu, J.-T. "The Stable Equivalence and Cancellation Problems." Comment. Math. Helv. 79, 341-349, 2004. https://doi.org/10.1007/s00014-003-0796-3.

Cite this as:

Weisstein, Eric W. "Coordinate Polynomial." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CoordinatePolynomial.html

Subject classifications