We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 39ebbe4 commit 4c3674dCopy full SHA for 4c3674d
src/sage/rings/polynomial/multi_polynomial_ideal.py
@@ -4965,6 +4965,15 @@ def reduce(self, f):
4965
4966
Requires computation of a Groebner basis, which can be a
4967
very expensive operation.
4968
+
4969
+ TESTS:
4970
4971
+ Check for :issue:`38560`::
4972
4973
+ sage: I.reduce(1)
4974
+ 1
4975
+ sage: I.reduce(pi.n()) # unfortunate side effect
4976
+ 245850922/78256779
4977
"""
4978
try:
4979
strat = self._groebner_strategy()
@@ -4973,7 +4982,7 @@ def reduce(self, f):
4982
pass
4983
4984
gb = self.groebner_basis()
- return f.reduce(gb)
4985
+ return self.ring()(f).reduce(gb)
4986
4987
def _contains_(self, f):
4988
r"""
0 commit comments