Buchberger's algorithm: Difference between revisions

Revision as of 10:06, 20 June 2022

Latest revision as of 10:05, 29 August 2025

(18 intermediate revisions by 14 users not shown)

Line 1:

{{Short description|Algorithm for computing Gröbner bases}}

In the theory of [[multivariate polynomial]]s, '''Buchberger's algorithm''' is a method offor transforming a given set of [[Ideal (ring theory)#Ideal generated by a set|generators]] for a polynomial [[ring ideal|ideal]]polynomials into a [[Gröbner basis]], withwhich respectis toanother someset [[monomialof order]].polynomials Itthat washave inventedthe bysame Austriancommon [[mathematician]]zeros [[Brunoand Buchberger]].are Onemore canconvenient viewfor itextracting asinformation aon generalizationthese ofcommon thezeros. [[EuclideanIt algorithm]]was forintroduced univariateby [[GreatestBruno common divisor|GCDBuchberger]] computationsimultaneously andwith ofthe [[Gaussiandefinition elimination]]of forGröbner [[linear system]]sbases.

The [[Euclidean algorithm]] for computing the polynomial [[greatest common divisor]] is a special case of Buchberger's algorithm restricted to polynomials of a single variable. [[Gaussian elimination]] of a [[system of linear equations]] is another special case where the degree of all polynomials equals one.

For other Gröbner basis algorithms, see {{slink|Gröbner basis#Algorithms and implementations}}.

== Algorithm ==

A crude version of this algorithm to find a basis for an ideal ''{{mvar|I''}} of a polynomial ring ''R'' proceeds as follows:

:'''Input''' A set of polynomials ''F'' that generates ''{{mvar|I''}}

:'''Output''' A [[Gröbner basis]] ''G'' for ''{{mvar|I''}}

:# ''G'' := ''F''

:# For every ''f_i'', ''f_j'' in ''G'', denote by ''g_i'' the leading term of ''f_i'' with respect to the given [[monomial ordering]], and by ''a_ij'' the [[least common multiple]] of ''g_i'' and ''g_j''.

:# Choose two polynomials in ''G'' and let {{math|1=''S''_''ij'' = ({{sfrac|''a''_''ij'' /| ''g''_{''{{var|i''}}})}} ''f''_{''{{var|i''}}} − ({{sfrac|''a''_''ij'' /| ''g''_''j'')}} ''f''_''j''}} ''(Note that theThe leading terms here will cancel by construction)''.

:# Reduce ''S''_''ij'', with the [[multivariate division algorithm]] relative to the set ''G'' until the result is not further reducible. If the result is non-zero, add it to ''G''.

:# Repeat steps 2-42–4 until all possible pairs are considered, including those involving the new polynomials added in step 4.

:# Output ''G''

The polynomial ''S''_''ij'' is commonly referred to as the ''S''-polynomial, where ''S'' refers to ''subtraction'' (Buchberger) or ''[[Syzygy (mathematics)|Syzygysyzygy]]'' (others). The pair of polynomials with which it is associated is commonly referred to as [[critical pair (logic)|critical pair]].

There are numerousmany ways to improve this algorithm beyond what has been stated above. For example, one could reduce all the new elements of ''F'' can be reduced relative to each other before adding them. If the leading terms of ''f_i'' and ''f_j'' share no variables in common, then ''S_ij'' will ''always'' reduce to 0 (if we useusing only {{mvar|f_i}} and {{mvar|f_j}} for reduction), so weit needn't calculatebe itcalculated at all.

The algorithm terminates because it is consistently increasing the size of the monomial ideal generated by the leading terms of our set ''F'', and [[Dickson's lemma]] (or the [[Hilbert basis theorem]]) guarantees that any such ascending chain must eventually become constant.

== Complexity ==

The [[time complexity|computational complexity]] of Buchberger's algorithm is very difficult to estimate, because of the number of choices that may dramatically change the computation time. Nevertheless, T. W. Dubé has proved<ref>{{cite journal|doi=10.1137/0219053|title=The Structure of Polynomial Ideals and Gröbner Bases|journal=SIAM Journal on Computing|volume=19|issue=4|pages=750750–773|year=1990|last1=Dubé|first1=Thomas W.}}</ref> that the degrees of the elements of a reduced Gröbner basis are always bounded by

:<math>2\left(\frac{d^2}{2} +d\right)^{2^{n-2}}</math>,

where {{math|''n''}} is the number of variables, and {{math|''d''}} the maximal [[total degree]] of the input polynomials. This allows, in theory, to use [[linear algebra]] over the [[vector space]] of the polynomials of degree bounded by this value, for getting an algorithm of complexity

<math>d^{2^{n+o(1)}}</math>.

On the other hand, there are examples<ref>{{cite journal|doi=10.1016/0001-8708(82)90048-2|doi-access=free|title=The complexity of the word problems for commutative semigroups and polynomial ideals|journal=[[Advances in Mathematics]]|volume=46|issue=3|pages=305305–329|year=1982|last1=Mayr|first1=Ernst W|last2=Meyer|first2=Albert R|hdl=1721.1/149010|hdl-access=free}}</ref> where the Gröbner basis contains elements of degree

:<math>d^{2^{\Omega(n)}}</math>,

and the above upper bound of complexity is optimal. Nevertheless, such examples are extremely rare.

Since its discovery, many variants of Buchberger's have been introduced to improve its efficiency. [[Faugère's F4 and F5 algorithms]] are presently the most efficient algorithms for computing Gröbner bases, and allow to compute routinely Gröbner bases consisting of several hundreds of polynomials, having each several hundreds of terms and coefficients of several hundreds of digits.

== Implementations ==

At least one implementation of Buchberger’s algorithm has been [[Formal proof|proved]] correct within the [[proof assistant]] Coq (renamed [[Rocq]]).<ref>{{cite journal |last1=Théry |first1=Laurent |title=A Machine-Checked Implementation of Buchberger's Algorithm |journal=Journal of Automated Reasoning |date=2001 |volume=26 |issue=2 |pages=107–137 |doi=10.1023/A:1026518331905}}</ref>

In the [[SymPy]] library for [[Python (programming language)|Python]], the (improved) Buchberger algorithm is implemented as <code>sympy.polys.polytools.groebner()</code>.<ref>{{cite web |title=Polynomials Manipulation Module Reference - SymPy 1.14.0 documentation |url=https://docs.sympy.org/latest/modules/polys/reference.html#sympy.polys.polytools.groebner |website=docs.sympy.org}}</ref>

== See also ==

* [[Knuth–Bendix completion algorithm]]

* [[Quine–McCluskey algorithm]] &ndash;– analogous algorithm for Boolean algebra

== References ==

{{reflistReflist}}

== Further reading ==

* {{cite journal

| last last1= Buchberger

| first first1= B.

| authorlink author1-link= Bruno Buchberger

|date=August 1976

| title = Theoretical Basis for the Reduction of Polynomials to Canonical Forms

| journal = ACM SIGSAM Bulletin

| volume = 10

| issue = 3

| pages = 19–29

| publisher = ACM

|date=August 1976

| doi = 10.1145/1088216.1088219

| mr = 0463136

|s2cid=15179417

}} <!-- Note: This citation data is from ACM; the citation at MathWorld has several errors. -->

* David Cox, John Little, and Donald O'Shea (1997). ''Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra'', Springer. {{ISBN|0-387-94680-2}}.

* Vladimir P. Gerdt, Yuri A. Blinkov (1998). ''Involutive Bases of Polynomial Ideals'', Mathematics and Computers in Simulation, 45:519ff

Line 60 ⟶ 70:

* {{springer|title=Buchberger algorithm|id=p/b110980}}

* [http://www.scholarpedia.org/article/Buchberger%27s_algorithm Buchberger's algorithm] on Scholarpedia

* {{MathWorld | urlname=BuchbergersAlgorithm | title=Buchberger's Algorithm}}

[[Category:Computer algebra]]