gh-36103: upgrade msolve to 0.5.0, update interface
    
- upgrade msolve to 0.5.0
- add support for Gröbner bases over ℚ to the msolve interface

Fixes #36055.
    
URL: #36103
Reported by: Marc Mezzarobba
Reviewer(s): Matthias Köppe

Author: Release Manager

build/pkgs/msolve/checksums.ini

@@ -1,5 +1,5 @@
 tarball=msolve-VERSION.tar.gz
-sha1=db99898afd03c2491d7d2190b89cea9ff0c41313
-md5=4ff5909d27f164aad9f7bdff633c037d
-cksum=507678049
+sha1=bfd1d4f2e5dc0eb321592b3add6665a9d3eadf8c
+md5=33a16c21ea8dea9e796d40f1dfd52fa9
+cksum=117017965
 upstream_url=https://github.com/algebraic-solving/msolve/releases/download/vVERSION/msolve-VERSION.tar.gz

build/pkgs/msolve/package-version.txt

@@ -1 +1 @@
-0.4.9
+0.5.0

src/sage/rings/polynomial/msolve.py

@@ -64,7 +64,7 @@ def _run_msolve(ideal, options):
 
     return msolve_out.stdout
 
-def groebner_basis_degrevlex(ideal):
+def groebner_basis_degrevlex(ideal, proof=True):
     r"""
     Compute a degrevlex Gröbner basis using msolve
 
@@ -85,25 +85,27 @@ def groebner_basis_degrevlex(ideal):
         [c^4 + 38*c^3 - 6*c^2 - 6*c, 30*c^3 + 32*c^2 + b - 14*c,
         a + 2*b + 2*c - 1]
 
-    TESTS::
-
-        sage: R.<foo, bar> = PolynomialRing(GF(536870909), 2)
-        sage: I = Ideal([ foo^2 - 1, bar^2 - 1 ])
-        sage: I.groebner_basis(algorithm='msolve') # optional - msolve
-        [bar^2 - 1, foo^2 - 1]
+    Gröbner bases over the rationals require `proof=False`::
 
         sage: R.<x, y> = PolynomialRing(QQ, 2)
         sage: I = Ideal([ x*y - 1, (x-2)^2 + (y-1)^2 - 1])
         sage: I.groebner_basis(algorithm='msolve') # optional - msolve
         Traceback (most recent call last):
         ...
-        NotImplementedError: unsupported base field: Rational Field
+        ValueError: msolve relies on heuristics; please use proof=False
+        sage: I.groebner_basis(algorithm='msolve', proof=False) # optional - msolve
+        [x*y - 1, x^2 + y^2 - 4*x - 2*y + 4, y^3 - 2*y^2 + x + 4*y - 4]
+
+    TESTS::
+
+        sage: R.<foo, bar> = PolynomialRing(GF(536870909), 2)
+        sage: I = Ideal([ foo^2 - 1, bar^2 - 1 ])
+        sage: I.groebner_basis(algorithm='msolve') # optional - msolve
+        [bar^2 - 1, foo^2 - 1]
     """
 
-    base = ideal.base_ring()
-    if not (isinstance(base, FiniteField) and base.is_prime_field() and
-            base.characteristic() < 2**31):
-        raise NotImplementedError(f"unsupported base field: {base}")
+    if ideal.base_ring() is QQ and sage.structure.proof.proof.get_flag(proof, "polynomial"):
+            raise ValueError("msolve relies on heuristics; please use proof=False")
 
     drlpolring = ideal.ring().change_ring(order='degrevlex')
     msolve_out = _run_msolve(ideal, ["-g", "2"])

src/sage/rings/polynomial/multi_polynomial_ideal.py

@@ -4272,8 +4272,7 @@ def groebner_basis(self, algorithm='', deg_bound=None, mult_bound=None, prot=Fal
             Macaulay2's ``GroebnerBasis`` command with the strategy "MGB" (if available)
 
         ``'msolve'``
-            `optional package msolve <../spkg/msolve.html>`_ (degrevlex order,
-            prime fields)
+            `optional package msolve <../spkg/msolve.html>`_ (degrevlex order)
 
         ``'magma:GroebnerBasis'``
             Magma's ``Groebnerbasis`` command (if available)