#7580: bugs in infinite polynomial ring
-----------------------+----------------------------------------------------
Reporter: was | Owner: SimonKing
Type: defect | Status: needs_review
Priority: major | Milestone: sage-4.3.1
Component: algebra | Keywords: infinite polynomial ring coercion
Work_issues: | Author: Simon King
Upstream: N/A | Reviewer:
Merged: |
-----------------------+----------------------------------------------------
Comment(by cremona):
Here is an example (in unpatched 4.3.1.alpha1) which fails
{{{
sage: R.<a> = InfinitePolynomialRing(QQ)
sage: S.<x> = R[]
(boom)
or
sage: PolynomialRing(R,'x')
(boom)
}}}
Basically, the PolynomialRing constructor gets called with base_ring==R,
and in that it tries to check if base_ring.is_field(proof = False).
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7580#comment:24>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.