From 61d7745b0717d67ec90ff4d35e7258004db08349 Mon Sep 17 00:00:00 2001
From: Matthias Koeppe <mkoeppe@math.ucdavis.edu>
Date: Fri, 16 Feb 2024 23:06:34 -0800
Subject: [PATCH] src/sage/rings/polynomial: Link to spkg page by label

---
 src/sage/rings/polynomial/msolve.py                 | 2 +-
 src/sage/rings/polynomial/multi_polynomial_ideal.py | 8 ++++----
 2 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/src/sage/rings/polynomial/msolve.py b/src/sage/rings/polynomial/msolve.py
index 1905d0a8a57..47775f9bd8c 100644
--- a/src/sage/rings/polynomial/msolve.py
+++ b/src/sage/rings/polynomial/msolve.py
@@ -8,7 +8,7 @@
 This module provide implementations of some operations on polynomial ideals
 based on msolve.
 
-Note that the `optional package msolve <../../../../spkg/msolve.html>`_ must be installed.
+Note that the :ref:`optional package msolve <spkg_msolve>` must be installed.
 
 .. SEEALSO::
 
diff --git a/src/sage/rings/polynomial/multi_polynomial_ideal.py b/src/sage/rings/polynomial/multi_polynomial_ideal.py
index 8f10f30add7..2b828fba51b 100644
--- a/src/sage/rings/polynomial/multi_polynomial_ideal.py
+++ b/src/sage/rings/polynomial/multi_polynomial_ideal.py
@@ -2594,7 +2594,7 @@ def variety(self, ring=None, *, algorithm="triangular_decomposition", proof=True
              {y: 0.3611030805286474?, x: 2.769292354238632?},
              {y: 1, x: 1}]
 
-        We can also use the `optional package msolve <../../../../spkg/msolve.html>`_
+        We can also use the :ref:`optional package msolve <spkg_msolve>`
         to compute the variety.
         See :mod:`~sage.rings.polynomial.msolve` for more information. ::
 
@@ -2676,7 +2676,7 @@ def variety(self, ring=None, *, algorithm="triangular_decomposition", proof=True
           on a toy implementation otherwise.
 
         - With ``algorithm`` = ``"msolve"``, uses the
-          `optional package msolve <../../../../spkg/msolve.html>`_.
+          :ref:`optional package msolve <spkg_msolve>`.
           Note that msolve uses heuristics and therefore
           requires setting the ``proof`` flag to ``False``. See
           :mod:`~sage.rings.polynomial.msolve` for more information.
@@ -4287,7 +4287,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)
+            :ref:`optional package msolve <spkg_msolve>` (degrevlex order)
 
         ``'magma:GroebnerBasis'``
             Magma's ``Groebnerbasis`` command (if available)
@@ -4415,7 +4415,7 @@ def groebner_basis(self, algorithm='', deg_bound=None, mult_bound=None, prot=Fal
              b*c - 19*c^2 + 10*b + 40*c, a + 2*b + 2*c - 1]
 
         Over prime fields of small characteristic, we can also use the
-        `optional package msolve <../../../../spkg/msolve.html>`_::
+        :ref:`optional package msolve <spkg_msolve>`::
 
             sage: R.<a,b,c> = PolynomialRing(GF(101), 3)
             sage: I = sage.rings.ideal.Katsura(R,3)  # regenerate to prevent caching