zbMATH — the first resource for mathematics

Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence. (English) Zbl 0681.68052
Let \(X_ 1,...,X_ n\), \(T_ 1,...,T_ m\) be indeterminates over the field k and let \(g,f_ 1,...,f_ m\in k[X_ 1,...,X_ n]\). An algorithm involving Gröbner bases is given which will determine if \(g\in k[f_ 1,...,f_ m]\), and if so will produce \(P\in k[T_ 1,...,T_ m]\) such that \(g=P(f_ 1,...,f_ m)\). Thus for a k-algebra homomorphism \(\omega\) : \(B\to k[X_ 1,...,X_ n]\), where B is a finitely generated k-algebra, the algorithm will determine if \(\omega\) is onto, and if so it will produce a right inverse of \(\omega\). To explain the algorithm further choose a term ordering on the monomials of \(k[X_ 1,...,X_ n\), \(T_ 1,...,T_ m]\) such that each \(X_ i\) is larger than any monomial in \(k[T_ 1,...,T_ m]\). Let J be the ideal of \(k[X_ 1,...,X_ n\), \(T_ 1,...,T_ m]\) generated by \(\{f_ 1-T_ 1,...,f_ m-X_ m\}\), and let G be a Gröbner basis for J. Then for \(g\in k[X_ 1,...,X_ n]\) we may reduce g over G until reduction terminates, say with \(h\in k[X_ 1,...,X_ n\), \(T_ 1,...,T_ m]\). Then \(g\in k[X_ 1,....,X_ n]\) if and only if \(h\in k[T_ 1,...,T_ m]\) and in this case \(g=h(f_ 1,...,f_ m)\). Some related results given are tests for when \(k[f_ 1,...,f_ m]=k[X_ 1,...,X_ n]\) and when \(k(f_ 1,...,f_ m)=k(X_ 1,...,X_ n)\).
Reviewer: D.E.Rush

68W30 Symbolic computation and algebraic computation
13B25 Polynomials over commutative rings
Gröbner bases
Full Text: DOI
[1] Buchberger, B., An algorithm for finding a basis for the residue class ring of a zero-dimensional polynomial ideal, () · Zbl 1158.01306
[2] Buchberger, B., An algorithmic criterion for the solvability of algebraic systems of equations, Aequationes mathematicae, 4/3, 374-383, (1970)
[3] Buchberger, B.; Buchberger, B., A theoretical basis for the reduction of polynomials to canonical forms, ACM sigsam bull., ACM sigsam bull., 10/4, 19-24, (1976)
[4] Buchberger, B., A criterion for detecting unnecessary reductions in the construction of Gröbner bases, (), 3-21 · Zbl 0417.68029
[5] Buchberger, B., A critical-pair/completion algorithm for finitely generated ideals in rings. decision problems and complexity, (), 137
[6] Buchberger, B., Gröbner bases: an algorithmic method in polynomial ideal theory, (), 184-232 · Zbl 0587.13009
[7] Gianni, P.; Trager, B.; Zacharias, G., Gröbner bases and primary decomposition of polynomial ideals, (1986), Preprint
[8] Shannon, D.; Sweedler, M., Using Gröbner bases to determine the algebraic or transcendental nature of field extensions within the field of rational functions, (1987), In preparation
[9] Spear, D., A constructive approach to commutative ring theory, (), 369-376
[10] Sweedler, M., Ideal bases and valuation rings, (1986), Preprint
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.