A characterization stating that a finite set of polynomials is a Gröbner basis (for a fixed monomial order) if and only if every S-polynomial of every pair of elements of the set reduces to zero modulo that set.

Principle

Compatibility of leading terms is equivalent to vanishing of S-polynomial remainders: if all pairwise cancellations produce no new remainder, the leading-term ideal is generated and the set is a Gröbner basis.

Demonstration

Given G = {g1, g2, g3}, compute S(g1,g2), S(g1,g3), S(g2,g3) and reduce each modulo G; if each remainder is 0, then Buchberger's criterion asserts G is a Gröbner basis for the ideal ⟨G⟩.

Misapplication

Checking only a subset of pairs without justification, or applying the criterion with reductions computed under a different monomial order, can lead to false conclusions about being a Gröbner basis.

Consequence

Provides a finite termination and correctness test for algorithms: when the criterion holds no further polynomials need to be added and normal forms are unique, enabling algorithmic ideal manipulation.

Reversal

If some S-polynomial reduces to a nonzero remainder, the set is not a Gröbner basis and must be extended by that remainder (or an equivalent element) to resolve the discrepancy.

Boundary

Relies on a fixed admissible monomial order and on the commutative polynomial-ring context; for modules, noncommutative settings or specialized criteria (chain, product, signature) provide refinements or alternatives.

Semantic Tension

Related to but distinct from supplementary criteria (chain/product/signature) that reduce the number of S-pairs to check; tension arises between completeness of Buchberger's criterion and practical pair-selection heuristics.

Synthesis

Buchberger's criterion reduces the global property 'is a Gröbner basis' to a finite set of local checks: every pairwise S-polynomial must vanish upon reduction, and failure pinpoints missing generators to extend the basis.