Skip to main content

Canonical Bases: Relations with Standard Bases, Finiteness Conditions and Application to Tame Automorphisms

  • Chapter
Effective Methods in Algebraic Geometry

Part of the book series: Progress in Mathematics ((PM,volume 94))

Abstract

Canonical bases for k-subalgeras of k[x 1, …, x n ] are analogs of standard bases for ideals. They form a set of generators, which allows to answer the membership problem by a reduction process. Unfortunately, they may be infinite even for finitely generated subalgeras. We redefine canonical bases, and for that we recall some properties of monoids, k-algebras of monoids and “binomial” ideals, which play an essential role in our presentation and the implementation we made in the IBM computer algebra system Scratchpad II. We complete the already known relations between standard bases and canonical bases by generalizing the notion of standard bases for ideals of any k-subalgebra admitting a finite canonical basis. We also have a way of finding a set of generators of the ideal of relations between elements of a canonical basis, which is a standard basis for some ordering.

We then turn to finiteness conditions, and investigate the case of integrally closed subalgebras. We show that if some integral extension B of a subalgebra A admits a finite canonical basis, we have an algorithm to solve the membership problem for A, by computing the generalized standard basis of a B-ideal. We conjecture that any integrally closed subalgebra admits a finite canonical basis, and provide partial results.

There is a simple case, but of special interest, where the complexity of computing a canonical basis is known: the case where k[f 1, …, f n ] = k[x 1, …, x n ]. We show that the canonical bases procedure give more information than previously known methods and may provide a tool for the tame generators conjecture.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Bass, E. H. Connell and D. Wright, The Jacobian Conjecture-Reduction of Degree and Formal Expansion of the Inverse, Bull. of the A.M.S. 7 (1982), 287–331.

    Article  MathSciNet  MATH  Google Scholar 

  2. B. Buchberger, Groebner bases: An algorithmic method in polynomial ideal theory, in “Multidimensional Systems Theory,” N.K. Bose (ed.), Reidel, 1985, pp. 184–232.

    Google Scholar 

  3. P. Conti and C. Traverso, Computing the conductor of an integral extension, Discr. Appl. Math, (to appear). Proceedings AAECC, 1989

    Google Scholar 

  4. A. van den Essen, A Criterion to Decide if a Polynomial Map is Invertible and to Compute the Inverse, Cath. Univ. Nijmegen, rep. 8653, 1986, Communications in Algebra (to appear).

    Google Scholar 

  5. M. Giusti, On the Castelnuovo regularity for curves, in “Proc. of ISSAC 1989, Portland,” ACM press, pp. 250–253.

    Google Scholar 

  6. M. Janet, Systèmes d’équations aux dérivées partielles, J. de Math., 8e série, tome III (1920).

    Google Scholar 

  7. J.-P. Jouanolou, Monoïdes, publ. IRMA 297/P-162, Strasbourg, 1984.

    Google Scholar 

  8. H. W. E. Jung, Ueber ganze birationale Transformationen der Ebene, J. Reine Agew. Math. 184 (1942).

    Google Scholar 

  9. G. Huet, An algorith to generate the basis of solutions to homogeneous linear diophantine equations, Information Processing letters 7, (1978), 144–147.

    Article  MathSciNet  MATH  Google Scholar 

  10. D. Kapur and K. Madlener, A Completion Procedure for Computing a Canonical Basis of a k-Subalgebra, in “Computers and Mathematics,” E. Kaltofen and S. M. Watt editors, Springer, 1989.

    Google Scholar 

  11. W. van der Kulk, On polynomial rings in two variables, Nieuw Arch. Wiskunde 1 (1953), 33–41.

    MathSciNet  MATH  Google Scholar 

  12. D. Lazard, Résolution des systèmes d’équations algébriques, Theoretical Computer Science 15 (1981), 77–110.

    Article  MathSciNet  MATH  Google Scholar 

  13. E. W. Mayr and A. Meyer, The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals, Advances in Math. 46 (1982), 305–329.

    Article  MathSciNet  MATH  Google Scholar 

  14. H. M. Moeller, A reduction strategy for the Taylor resolution, in “proceedings of EUROCAL’85,” Linz, 1985, LNCS, Springer.

    Google Scholar 

  15. F. Mora, Groebner Bases for Non-Commutative Polynomial Rings, in “Proceeding of AAECC 3,” Grenoble, 1985, Lecture notes in Comp. Science 229, Springer.

    Google Scholar 

  16. M. Nagata, On the automorphism group of k[x,y], Lect. Math. Kyoto University 1972.

    Google Scholar 

  17. F. Ollivier, Inversibility of Rational Mappings and Structural Indentifiability in Automatics, in “Proceedings of ISSAC 1989,” Portland, ACM press.

    Google Scholar 

  18. F. Ollivier, Inversibility of Rational Mappings and Structural Indentifiability in Control Theory, prépublication du Centre de Mathématiques de l’École Polytechnique, expanded version of the previous paper, presented at AAECC 7, Toulouse, 1989.

    Google Scholar 

  19. L. Robbiano, Terms ordering on the polynomial ring, in “Proc. of EUROCAL 1985,” LNCS, Springer, pp. 513–517.

    Google Scholar 

  20. L. Robbiano, On the Theory of Graded Structures, J. Symb. Comp. 2 (1986).

    Google Scholar 

  21. L. Robbiano and M. Sweedler, Subalgebra Bases, in “Proc. of the Salvador conference on Commutative Algebra,” Salvador, 1988, Springer LNM (to appear).

    Google Scholar 

  22. M. Sweedler, Ideals bases and valuation rings, preprint, 1986.

    Google Scholar 

  23. D. Shannon and M. Sweedler, Using Groebner bases to determine algebra membership, split surjective algebra homomorphisms and determine birational equivalence, J. Symb. Comp. 6 (1988), 267–273.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media New York

About this chapter

Cite this chapter

Ollivier, F. (1991). Canonical Bases: Relations with Standard Bases, Finiteness Conditions and Application to Tame Automorphisms. In: Mora, T., Traverso, C. (eds) Effective Methods in Algebraic Geometry. Progress in Mathematics, vol 94. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0441-1_25

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-0441-1_25

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-1-4612-6761-4

  • Online ISBN: 978-1-4612-0441-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics