Skip to main content

Formalization of Dubé’s Degree Bounds for Gröbner Bases in Isabelle/HOL

  • Conference paper
  • First Online:
Intelligent Computer Mathematics (CICM 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11617))

Included in the following conference series:

  • 472 Accesses

Abstract

We present an Isabelle/HOL formalization of certain upper bounds on the degrees of Gröbner bases in multivariate polynomial rings over fields, due to Dubé. These bounds are not only of theoretical interest, but can also be used for computing Gröbner bases by row-reducing Macaulay matrices.

The formalization covers the whole theory developed by Dubé for obtaining the bounds, building upon an extensive existing library of multivariate polynomials and Gröbner bases in Isabelle/HOL. To the best of our knowledge, this is the first thorough formalization of degree bounds for Gröbner bases in any proof assistant.

The research was funded by the Austrian Science Fund (FWF): P 29498-N31.

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 EPUB and 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

Notes

  1. 1.

    http://isabelle.in.tum.de/repos/isabelle.

  2. 2.

    http://devel.isa-afp.org/.

  3. 3.

    Reduced Gröbner bases are unique for every admissible order relation, but different orders may yield different reduced Gröbner bases for the same ideal.

  4. 4.

    \(\texttt {poly\_deg}~0\) is defined to be 0.

  5. 5.

    Of course, splits_wrt is defined for lists ps, qs instead of sets P, Q, but informally it is easier to think of sets.

  6. 6.

    Although asymptotically \(\mathrm {Dube}_{n,d}\) also has to grow double exponentially in n, as shown in [10].

References

  1. Adams, W.W., Loustaunau, P.: An Introduction to Gröbner Bases, Graduate Studies in Mathematics, vol. 3. AMS, Providence (1994)

    MATH  Google Scholar 

  2. Aschenbrenner, M., Leykin, A.: Degree bounds for Gröbner bases in algebras of solvable type. J. Pure Appl. Algebra 213, 1578–1605 (2009). https://doi.org/10.1016/j.jpaa.2008.11.022

    Article  MathSciNet  MATH  Google Scholar 

  3. Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. Ph.D. thesis, Mathematisches Institut, Universität Innsbruck, Austria (1965). English translation in J. Symb. Comput. 41(3–4), 475–511 (2006)

    Google Scholar 

  4. Dubé, T.W.: The structure of polynomial ideals and Gröbner bases. SIAM J. Comput. 19(4), 750–773 (1990). https://doi.org/10.1137/0219053

    Article  MathSciNet  MATH  Google Scholar 

  5. Haftmann, F.: Code Generation from Isabelle/HOL Theories. http://isabelle.in.tum.de/dist/Isabelle2018/doc/codegen.pdf. Part of the Isabelle documentation

  6. Immler, F., Maletzky, A.: Gröbner Bases Theory. Archive of Formal Proofs (2016). http://isa-afp.org/entries/Groebner_Bases.html. Formal proof development

  7. Maletzky, A.: Gröbner bases and Macaulay matrices in Isabelle/HOL. Technical report, RISC, Johannes Kepler University Linz, Austria (2018). http://www.risc.jku.at/publications/download/risc_5814/Paper.pdf

  8. Maletzky, A.: Isabelle/HOL formalization of advanced Gröbner bases material (2019). https://github.com/amaletzk/Isabelle-Groebner/

  9. Maletzky, A., Immler, F.: Gröbner bases of modules and Faugère’s \(F_4\) algorithm in Isabelle/HOL. In: Rabe, F., Farmer, W.M., Passmore, G.O., Youssef, A. (eds.) CICM 2018. LNCS (LNAI), vol. 11006, pp. 178–193. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96812-4_16

    Chapter  Google Scholar 

  10. Mayr, E.W., Meyer, A.R.: The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math. 46(3), 305–329 (1982). https://doi.org/10.1016/0001-8708(82)90048-2

    Article  MathSciNet  MATH  Google Scholar 

  11. Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45949-9

    Book  MATH  Google Scholar 

  12. Sternagel, C., Thiemann, R., Maletzky, A., Immler, F.: Executable multivariate polynomials. Archive of Formal Proofs (2010). http://isa-afp.org/entries/Polynomials.html. Formal proof development

  13. Wenzel, M.: The Isabelle/ISAR Reference Manual (2018). https://isabelle.in.tum.de/dist/Isabelle2018/doc/isar-ref.pdf. Part of the Isabelle documentation

  14. Wiesinger-Widi, M.: Gröbner bases and generalized sylvester matrices. Ph.D. thesis, RISC, Johannes Kepler University Linz, Austria (2015). http://epub.jku.at/obvulihs/content/titleinfo/776913

Download references

Acknowledgments

I thank the anonymous referees for their valuable comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander Maletzky .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Maletzky, A. (2019). Formalization of Dubé’s Degree Bounds for Gröbner Bases in Isabelle/HOL. In: Kaliszyk, C., Brady, E., Kohlhase, A., Sacerdoti Coen, C. (eds) Intelligent Computer Mathematics. CICM 2019. Lecture Notes in Computer Science(), vol 11617. Springer, Cham. https://doi.org/10.1007/978-3-030-23250-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-23250-4_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-23249-8

  • Online ISBN: 978-3-030-23250-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics