Opened 10 years ago
Closed 9 years ago
#8800 closed defect (fixed)
Doctest coverage of categories - numerous coercion fixes
Reported by: | SimonKing | Owned by: | Simon King |
---|---|---|---|
Priority: | major | Milestone: | sage-4.7 |
Component: | categories | Keywords: | categories doctests |
Cc: | Merged in: | sage-4.7.alpha1 | |
Authors: | Simon King | Reviewers: | Luis Felipe Tabera Alonso |
Report Upstream: | N/A | Work issues: | |
Branch: | Commit: | ||
Dependencies: | Stopgaps: |
Description (last modified by )
According to William, the doctest coverage of categories is too low:
action.pyx: 0% (0 of 31) functor.pyx: 17% (3 of 17) map.pyx: 27% (10 of 37) morphism.pyx: 20% (5 of 24) pushout.py: 24% (19 of 77)
The original purpose of this ticket was to provide full doctest coverage for functor.pyx
and pushout.py
. The doctest coverage of both files is now 100%.
However, the attempt to create meaningful doctests uncovered many bugs in various parts of Sage, and also motivated the implementation of coercion for various algebraic structures for which this has not been done before.
This a-posteriori ticket description lists the bugs killed and the features added by the patch, which should apply (with a little fuzz) after the patch from #8807. For more details on the bugs, see the comments below.
- Bug: Creating
ForgetfulFunctor
fails.
Was:
sage: abgrps = CommutativeAdditiveGroups() sage: ForgetfulFunctor(abgrps, abgrps) --------------------------------------------------------------------------- TypeError Traceback (most recent call last) /home/king/SAGE/patches/doku/english/<ipython console> in <module>() /home/king/SAGE/sage-4.3.1/local/lib/python2.6/site-packages/sage/categories/functor.so in sage.categories.functor.ForgetfulFunctor (sage/categories/functor.c:2083)() TypeError: IdentityFunctor() takes exactly one argument (2 given)
Now:
sage: abgrps = CommutativeAdditiveGroups() sage: ForgetfulFunctor(abgrps, abgrps) The identity functor on Category of commutative additive groups
- Bug: Applying
ForgetfulFunctor
returnsNone
.
Was:
sage: fields = Fields() sage: rings = Rings() sage: F = ForgetfulFunctor(fields,rings) sage: F(QQ)
Now:
sage: fields = Fields() sage: rings = Rings() sage: F = ForgetfulFunctor(fields,rings) sage: F(QQ) Rational Field
- Bug: Applying a functor does not complain if the argument is not contained in the domain.
Was:
sage: fields = Fields() sage: rings = Rings() sage: F = ForgetfulFunctor(fields,rings) # Yields None, see previous bug sage: F(ZZ['x','y'])
Now:
sage: fields = Fields() sage: rings = Rings() sage: F = ForgetfulFunctor(fields,rings) sage: F(ZZ['x','y']) Traceback (most recent call last): ... TypeError: x (=Multivariate Polynomial Ring in x, y over Integer Ring) is not in Category of fields
- Bug: Comparing identity functor with any functor only checks domain and codomain
Was:
sage: F = QQ['x'].construction()[0] sage: F Poly[x] sage: F == IdentityFunctor(Rings()) False sage: IdentityFunctor(Rings()) == F True
Now:
sage: F = QQ['x'].construction()[0] sage: F Poly[x] sage: F == IdentityFunctor(Rings()) False sage: IdentityFunctor(Rings()) == F False
- Bug: Comparing identity functor with anything that is not a functor produces an error
Was:
sage: IdentityFunctor(Rings()) == QQ Traceback (most recent call last): ... AttributeError: 'RationalField_with_category' object has no attribute 'domain'
Now:
sage: IdentityFunctor(Rings()) == QQ False
- Bug: The matrix functor is ill defined; moreover, ill-definedness does not result in an error.
Was:
sage: F = MatrixSpace(ZZ,2,3).construction()[0] sage: F(RR) in F.codomain() False # The codomain is wrong for non-square matrices! sage: F.codomain() Category of rings
Now:
sage: F = MatrixSpace(ZZ,2,3).construction()[0] sage: F.codomain() Category of commutative additive groups sage: F(RR) in F.codomain() True sage: F = MatrixSpace(ZZ,2,2).construction()[0] sage: F.codomain() Category of rings sage: F(RR) in F.codomain() True
- Bug: Wrong domain for
VectorFunctor
; and again, functors don't test if the domain is appropriate
Was:
sage: F = FreeModule(ZZ,3).construction()[0] sage: F VectorFunctor sage: F.domain() Category of objects sage: F.codomain() Category of objects sage: Set([1,2,3]) in F.domain() True sage: F(Set([1,2,3])) Traceback (most recent call last): ... AttributeError: 'Set_object_enumerated' object has no attribute 'is_commutative'
Now:
sage: F = FreeModule(ZZ,3).construction()[0] sage: F VectorFunctor sage: F.domain() Category of commutative rings sage: Set([1,2,3]) in F.domain() False sage: F(Set([1,2,3])) Traceback (most recent call last): ... TypeError: x (={1, 2, 3}) is not in Category of commutative rings
- Bug:
BlackBoxConstructionFunctor
is completely unusable
BlackBoxConstructionFunctor
should be a class, but is defined as a function. Moreover, the given init method is not using the init method of ConstructionFunctor
. And the cmp method would raise an error if the second argument has no attribute .box
.
The following did not work at all:
sage: from sage.categories.pushout import BlackBoxConstructionFunctor sage: FG = BlackBoxConstructionFunctor(gap) sage: FS = BlackBoxConstructionFunctor(singular) sage: FG BlackBoxConstructionFunctor sage: FG(ZZ) Integers sage: FG(ZZ).parent() Gap sage: FS(QQ['t']) // characteristic : 0 // number of vars : 1 // block 1 : ordering lp // : names t // block 2 : ordering C sage: FG == FS False sage: FG == loads(dumps(FG)) True
- Nitpicking: The
LocalizationFunctor
is nowhere used (yet)
Hence, I removed it.
- Bug / New Feature: Make completion and and fraction field construction functors commute.
The result of them not commuting is the following coercion bug.
Was:
sage: R1.<x> = Zp(5)[] sage: R2 = Qp(5) sage: R2(1)+x Traceback (most recent call last): ... TypeError: unsupported operand parent(s) for '+': '5-adic Field with capped relative precision 20' and 'Univariate Polynomial Ring in x over 5-adic Ring with capped relative precision 20'
Now:
sage: R1.<x> = Zp(5)[] sage: R2 = Qp(5) sage: R2(1)+x (1 + O(5^20))*x + (1 + O(5^20))
- New feature: Make the completion functor work on some objects that do not provide a completion method.
The idea is to use that the completion functor may commute with the construction of the given argument. That may safe the day.
Was:
sage: P.<x> = ZZ[] sage: C = P.completion(x).construction()[0] sage: R = FractionField(P) sage: hasattr(R,'completion') False sage: C(R) Traceback (most recent call last): ... AttributeError: 'FractionField_generic' object has no attribute 'completion'
Now:
sage: P.<x> = ZZ[] sage: C = P.completion(x).construction()[0] sage: R = FractionField(P) sage: hasattr(R,'completion') False sage: C(R) Fraction Field of Power Series Ring in x over Integer Ring
- Bug / new feature: Coercion for free modules, taking into account a user-defined inner product
Was:
sage: P.<t> = ZZ[] sage: M1 = FreeModule(P,3) sage: M2 = QQ^3 sage: M2([1,1/2,1/3]) + M1([t,t^2+t,3]) # This is ok (t + 1, t^2 + t + 1/2, 10/3) sage: M3 = FreeModule(P,3, inner_product_matrix = Matrix(3,3,range(9))) sage: M2([1,1/2,1/3]) + M3([t,t^2+t,3]) # This is ok (t + 1, t^2 + t + 1/2, 10/3) # The user defined inner product matrix is lost! Bug sage: parent(M2([1,1/2,1/3]) + M3([t,t^2+t,3])).inner_product_matrix() [1 0 0] [0 1 0] [0 0 1]
Now:
sage: parent(M2([1,1/2,1/3]) + M3([t,t^2+t,3])).inner_product_matrix() [0 1 2] [3 4 5] [6 7 8]
However, the real problem is that modules are not part of the coercion model. I tried to implement it, but that turned out to be a can of worms. So, I suggest to deal with it on a different ticket. Here is one bug that isn't removed, yet:
sage: M4 = FreeModule(P,3, inner_product_matrix = Matrix(3,3,[1,1,1,0,1,1,0,0,1])) sage: M3([t,1,t^2]) + M4([t,t^2+t,3]) # This should result in an error (2*t, t^2 + t + 1, t^2 + 3)Note that there should be no coercion between
M3
andM4
, since they have different user-defined inner product matrices.
- Bug / new feature: Quotient rings of univariate polynomial rings do not have a construction method.
Was:
sage: P.<x> = QQ[] sage: Q1 = P.quo([(x^2+1)^2*(x^2-3)]) sage: Q2 = P.quo([(x^2+1)^2*(x^5+3)]) sage: from sage.categories.pushout import pushout sage: pushout(Q1,Q2) Traceback (most recent call last): ... CoercionException: No common base
Now:
sage: P.<x> = QQ[] sage: Q1 = P.quo([(x^2+1)^2*(x^2-3)]) sage: Q2 = P.quo([(x^2+1)^2*(x^5+3)]) sage: from sage.categories.pushout import pushout sage: pushout(Q1,Q2) Univariate Quotient Polynomial Ring in xbar over Rational Field with modulus x^4 + 2*x^2 + 1
- Insufficient coercion of quotient rings, if one modulus divides the other
Was:
sage: P5.<x> = GF(5)[] sage: Q = P5.quo([(x^2+1)^2]) sage: P.<x> = ZZ[] sage: Q1 = P.quo([(x^2+1)^2*(x^2-3)]) sage: Q2 = P.quo([(x^2+1)^2*(x^5+3)]) sage: Q.has_coerce_map_from(Q1) False
Now: There is a coercion from
Q1
toQ
.
- Coercion of
GF(p)
versusIntegers(p)
I am not sure if this is really a bug.
Was:
sage: from sage.categories.pushout import pushout sage: pushout(GF(5), Integers(5)) Ring of integers modulo 5
Now
sage: from sage.categories.pushout import pushout sage: pushout(GF(5), Integers(5)) Finite Field of size 5
- Bug / new feature: Construction for QQbar was missing.
Now:
sage: QQbar.construction() (AlgebraicClosureFunctor, Rational Field)
- Bug / new feature: Construction for number fields is missing.
This became a rather complicated topic, including "coercions for embedded versus non-embedded number fields and coercion for an order from a coercion from the ambient field", "pushout for number fields", "comparison of fractional ideals", "identity of residue fields". See three discussions on sage-algebra and sage-nt
Coercion
Important for the discussion is: What will we do with embeddings?
Currently, the embedding of two number fields is used to construct a coercion (compatible with the embedding). Of course, the given embedding is also used as a coerce map.
It was discussed to additionally have a "forgetful" coercion from an embedded to a non-embedded number field.
It turned out that with bidirectional and forgetful coercions together, one can construct examples in which the coercions do not form a commutative diagram. Hence, we do not introduce forgetful coercions here.
However, some improvement of the existing implementation was needed.
Was:
sage: K.<r4> = NumberField(x^4-2) sage: L1.<r2_1> = NumberField(x^2-2, embedding = r4**2) sage: L2.<r2_2> = NumberField(x^2-2, embedding = -r4**2) sage: r2_1+r2_2 # indirect doctest ERROR: An unexpected error occurred while tokenizing input The following traceback may be corrupted or invalid The error message is: ('EOF in multi-line statement', (1109, 0)) ERROR: An unexpected error occurred while tokenizing input The following traceback may be corrupted or invalid The error message is: ('EOF in multi-line statement', (1109, 0)) ... sage: K.has_coerce_map_from(L1.maximal_order()) False # that's the wrong direction. sage: L1.has_coerce_map_from(K.maximal_order()) True
Now:
sage: K.<r4> = NumberField(x^4-2) sage: L1.<r2_1> = NumberField(x^2-2, embedding = r4**2) sage: L2.<r2_2> = NumberField(x^2-2, embedding = -r4**2) sage: r2_1+r2_2 # indirect doctest 0 sage: (r2_1+r2_2).parent() is L1 True sage: (r2_2+r2_1).parent() is L2 True sage: K.has_coerce_map_from(L1.maximal_order()) True sage: L1.has_coerce_map_from(K.maximal_order()) False
Pushout
Was:
sage: P.<x> = QQ[] sage: L.<b> = NumberField(x^8-x^4+1, embedding=CDF.0) sage: M1.<c1> = NumberField(x^2+x+1, embedding=b^4-1) sage: M2.<c2> = NumberField(x^2+1, embedding=-b^6) sage: M1.coerce_map_from(M2) sage: M2.coerce_map_from(M1) sage: c1+c2; parent(c1+c2) #indirect doctest Traceback (most recent call last): ... TypeError: unsupported operand parent(s) for '+': 'Number Field in c1 with defining polynomial x^2 + x + 1' and 'Number Field in c2 with defining polynomial x^2 + 1' sage: from sage.categories.pushout import pushout sage: pushout(M1['x'],M2['x']) Traceback (most recent call last): ... CoercionException: No common base
Now: Note that we will only have a pushout if the codomains of the embeddings are number fields. Hence, in the second example, we won't use
CDF
as a pushout.sage: P.<x> = QQ[] sage: L.<b> = NumberField(x^8-x^4+1, embedding=CDF.0) sage: M1.<c1> = NumberField(x^2+x+1, embedding=b^4-1) sage: M2.<c2> = NumberField(x^2+1, embedding=-b^6) sage: M1.coerce_map_from(M2) sage: M2.coerce_map_from(M1) sage: c1+c2; parent(c1+c2) #indirect doctest -b^6 + b^4 - 1 Number Field in b with defining polynomial x^8 - x^4 + 1 sage: from sage.categories.pushout import pushout sage: pushout(M1['x'],M2['x']) Univariate Polynomial Ring in x over Number Field in b with defining polynomial x^8 - x^4 + 1 sage: K.<a> = NumberField(x^3-2, embedding=CDF(1/2*I*2^(1/3)*sqrt(3) - 1/2*2^(1/3))) sage: L.<b> = NumberField(x^6-2, embedding=1.1) sage: L.coerce_map_from(K) sage: K.coerce_map_from(L) sage: pushout(K,L) Traceback (most recent call last): ... CoercionException: ('Ambiguous Base Extension', Number Field in a with defining polynomial x^3 - 2, Number Field in b with defining polynomial x^6 - 2)
Comparison of fractional ideals / identity of Residue Fields
Fractional ideals have a
__cmp__
method that only took into account the Hermite normal form. Originally, the comparison of fractional ideals by "==" and by "cmp" yields different results. Since "==" of fractional ideals is used for caching residue fields, but "cmp" was used for comparing residue fields, the residue fields did not provide unique parents.
Was:
sage: L.<b> = NumberField(x^8-x^4+1) sage: F_2 = L.fractional_ideal(b^2-1) sage: F_4 = L.fractional_ideal(b^4-1) sage: F_2==F_4 True sage: K.<r4> = NumberField(x^4-2) sage: L.<r4> = NumberField(x^4-2, embedding=CDF.0) sage: FK = K.fractional_ideal(K.0) sage: FL = L.fractional_ideal(L.0) sage: FK != FL True sage: RL = ResidueField(FL) sage: RK = ResidueField(FK) sage: RK is RL False sage: RK == RL True
Now:
sage: L.<b> = NumberField(x^8-x^4+1) sage: F_2 = L.fractional_ideal(b^2-1) sage: F_4 = L.fractional_ideal(b^4-1) sage: F_2==F_4 True sage: K.<r4> = NumberField(x^4-2) sage: L.<r4> = NumberField(x^4-2, embedding=CDF.0) sage: FK = K.fractional_ideal(K.0) sage: FL = L.fractional_ideal(L.0) sage: FK != FL True sage: RL = ResidueField(FL) sage: RK = ResidueField(FK) sage: RK is RL False sage: RK == RL False
Since
RL
is defined with the embedded fieldL
, not with the unembeddedK
, there is no coercion from the order ofK
toRL
. However, conversion works (this used to fail!):
sage: OK = K.maximal_order() sage: RL.has_coerce_map_from(OK) False sage: RL(OK.1) 0
Note that I also had to change some arithmetic stuff in the
_tate
method of elliptic curves: The old implementation relied on the assumption that fractional ideals in an embedded field and in a non-embedded field can't be equal. This assumption should still hold (since we do not introduce forgetful coercion), but I think it is OK to keep the change in _tate.
Apply:
Attachments (3)
Change History (93)
comment:1 Changed 10 years ago by
- Description modified (diff)
comment:2 follow-up: ↓ 3 Changed 10 years ago by
comment:3 in reply to: ↑ 2 Changed 10 years ago by
Replying to SimonKing:
Shouldn't the following raise an error, since the argument is not contained in the domain? Instead, it returns
None
.
And this is because the generic call
method of
Functor
has no return value! That's clearly a bug.
comment:4 Changed 10 years ago by
Next bug:
sage: F = QQ['x'].construction()[0] sage: F Poly[x] sage: F == IdentityFunctor(Rings()) False sage: IdentityFunctor(Rings()) == F True
This is since the cmp method of IdentityFunctor_generic
only checks whether domain and codomain coincide, but doesn't check the type of the functor.
Even worse, comparison it may raise an error - how unpythonic!
sage: IdentityFunctor(Rings()) == QQ --------------------------------------------------------------------------- AttributeError Traceback (most recent call last) /home/king/SAGE/patches/doku/english/<ipython console> in <module>() /home/king/SAGE/sage-4.3.1/local/lib/python2.6/site-packages/sage/categories/functor.so in sage.categories.functor.ForgetfulFunctor_generic.__cmp__ (sage/categories/functor.c:1429)() /home/king/SAGE/sage-4.3.1/local/lib/python2.6/site-packages/sage/structure/parent.so in sage.structure.parent.Parent.__getattr__ (sage/structure/parent.c:5064)() /home/king/SAGE/sage-4.3.1/local/lib/python2.6/site-packages/sage/structure/parent.so in sage.structure.parent.getattr_from_other_class (sage/structure/parent.c:2738)() /home/king/SAGE/sage-4.3.1/local/lib/python2.6/site-packages/sage/structure/parent.so in sage.structure.parent.raise_attribute_error (sage/structure/parent.c:2610)() AttributeError: 'RationalField_with_category' object has no attribute 'domain'
comment:5 Changed 10 years ago by
I think the call method of the class Functor is not cleanly implemented.
It seems intended that the user does not implement the call method. Instead s/he should implement _apply_functor, which is supposed to return an object in the functor's codomain.
Before using _apply_functor, the default call method tests whether the argument belongs to the domain. If this is not the case, it coerces the argument into the domain. I don't think that this is always wanted. E.g., the forgetful functor from fields to rings, when applied to the integer ring, currently returns the rational field (so, the forgetful functor adds structure), since the default call method first coerces the integer ring into the category of fields (which is done by the fraction field construction functor).
I suggest to introduce a method _coerce_into_domain. By default, it returns its argument without change. If the user wants coercion into the domain (e.g. Integer Ring --> Rational Field), then s/he must implement it here.
The default call method should first apply _coerce_into_domain, check whether the result is in the domain (raise an error if this is not the case), then use _apply_functor, and check whether the result is in the codomain (and raise an error otherwise). And of course it should return the result (which was forgotten!).
Thoughts?
comment:6 Changed 10 years ago by
comment:7 Changed 10 years ago by
I think it would be better to base this ticket on #8807, since I believe that #8807 should be merged soon anyway.
Continuing with the doc tests, I think I found another bug, namely in the merge
method of the Quotient construction functor:
sage: Q15,R = (ZZ.quo(15*ZZ)).construction() sage: Q15 QuotientFunctor sage: Q35,R = (ZZ.quo(35*ZZ)).construction() sage: Q35 QuotientFunctor sage: Q15.merge(Q35) is None True sage: from sage.categories.pushout import pushout sage: pushout(ZZ.quo(15*ZZ),ZZ.quo(35*ZZ)) --------------------------------------------------------------------------- CoercionException Traceback (most recent call last) /home/SimonKing/<ipython console> in <module>() /usr/local/sage/local/lib/python2.6/site-packages/sage/categories/pushout.pyc in pushout(R, S) 1099 else: 1100 # Otherwise, we cannot proceed. -> 1101 raise CoercionException, ("Ambiguous Base Extension", R, S) 1102 1103 return all(Z) CoercionException: ('Ambiguous Base Extension', Ring of integers modulo 15, Ring of integers modulo 35)
The reason is that internally Q35.I + Q15.I
is tried, but this raises an error. It works with
Q35.I.gcd(Q15.I)
, though. If I do this (in a patch that I will hopefully post in a few days, one gets (as one should, if I am not mistaken)
sage: pushout(ZZ.quo(15*ZZ),ZZ.quo(35*ZZ)) Ring of integers modulo 5
comment:8 Changed 10 years ago by
Another bug that I plan to remove:
sage: F = MatrixSpace(ZZ,2,3).construction()[0] sage: F(RR) in F.codomain() False
The problem is that the codomain of F
is supposed to be the category of rings, even for non-square matrices. I'll change it to the following:
sage: MatrixSpace(ZZ,2,3).construction()[0].codomain() Category of commutative additive groups sage: MatrixSpace(ZZ,2,2).construction()[0].codomain() Category of rings
I'd actually like to have the category of modules (rather than of additive groups), but this would require a ring over which the module is defined (and which the functor obviously can't know).
comment:9 Changed 10 years ago by
The next one:
sage: F = FreeModule(ZZ,3).construction()[0] sage: F VectorFunctor sage: F.domain() Category of objects sage: F.codomain() Category of objects sage: Set([1,2,3]) in F.domain() True sage: F(Set([1,2,3])) Traceback (most recent call last): ... AttributeError: 'Set_object_enumerated' object has no attribute 'is_commutative'
Since the functor calls the FreeModule?
constructor, and since this constructor expects a commutative ring, the Vector functor should go from the category of commutative rings to the category of commutative additive groups (since the category of modules requires naming a base ring).
comment:10 Changed 10 years ago by
Next bug:
BlackBoxConstructionFunctor?
should be a class, but is defined as a function. Moreover, the given init method is not using the init method of
ConstructionFunctor?
. And the cmp method would raise an error if the second argument has no attribute
.box
.
comment:11 follow-up: ↓ 12 Changed 10 years ago by
Merging AlgebraicClosureFunctor?
with anything else always yields the
AlgebraicClosureFunctor?
. I doubt that this was intended. There should be a merging with an
AlgebraicExtensionFunctor?
, though.
comment:12 in reply to: ↑ 11 Changed 10 years ago by
Replying to SimonKing:
... There should be a merging with an
AlgebraicExtensionFunctor?
, though.
... which is nowhere used, though. I think the method construction
for number fields should be defined.
comment:13 Changed 10 years ago by
sage: P.<x> = QQ[] sage: CC.extension(x^3+x^2+1,'a') Univariate Quotient Polynomial Ring in a over Complex Field with 53 bits of precision with modulus a^3 + a^2 + 1.00000000000000 sage: CDF.extension(x^3+x^2+1,'a') Univariate Quotient Polynomial Ring in a over Complex Double Field with modulus a^3 + a^2 + 1.0 sage: QQbar.extension(x^3+x^2+1,'a') Univariate Quotient Polynomial Ring in a over Algebraic Field with modulus a^3 + a^2 + 1
Aren't the three above fields algebraically complete? So, I guess the extension
method should be modified to take this into account.
comment:14 follow-ups: ↓ 15 ↓ 17 Changed 10 years ago by
Concerning algebraic extension of algebraically complete fields: sage-devel expressed the opinion that it is better to do the construction (namely quotient of a univariate polynomial ring) in any case. So, I leave it as it is.
Here is another problem:
sage: R1.<x> = Zp(5)[] sage: R2 = Qp(5) sage: R2(1)+x --------------------------------------------------------------------------- TypeError Traceback (most recent call last) /home/SimonKing/<ipython console> in <module>() /usr/local/sage/local/lib/python2.6/site-packages/sage/structure/element.so in sage.structure.element.RingElement.__add__ (sage/structure/element.c:10830)() /usr/local/sage/local/lib/python2.6/site-packages/sage/structure/coerce.so in sage.structure.coerce.CoercionModel_cache_maps.bin_op (sage/structure/coerce.c:6966)() TypeError: unsupported operand parent(s) for '+': '5-adic Field with capped relative precision 20' and 'Univariate Polynomial Ring in x over 5-adic Ring with capped relative precision 20'
The reason is
sage: from sage.categories.pushout import pushout sage: pushout(R1,R2) --------------------------------------------------------------------------- CoercionException Traceback (most recent call last) /home/SimonKing/<ipython console> in <module>() /usr/local/sage/local/lib/python2.6/site-packages/sage/categories/pushout.pyc in pushout(R, S) 1109 # make sense, and in this case simply want to return that a pushout 1110 # couldn't be found. -> 1111 raise CoercionException(ex) 1112 1113 CoercionException: 'pAdicFieldCappedRelative' object has no attribute 'completion'
Rather than implementing a completion of p-adic fields, I suggest to give the construction functors of fraction fields and of completions the same rank. This would already suffice (together with the existing merge method of the completion functor) so that one has
sage: R1.<x> = Zp(5)[] sage: R2 = Qp(5) sage: R2(1) + x (1 + O(5^20))*x + (1 + O(5^20))
Note that there is an additional problem, namely that there is no coercion from a p-adic field of high precision to a p-adic field of lower precision. I hope sage-devel will answer whether this issue is worth a separate ticket.
comment:15 in reply to: ↑ 14 Changed 10 years ago by
PS:
Replying to SimonKing:
Rather than implementing a completion of p-adic fields, I suggest to give the construction functors of fraction fields and of completions the same rank...
... since they commute anyway. I guess it wouldn't harm to implement the commutes
method as well.
I now consider the Localization functor. It uses the method "localize", but:
sage: search_def('localize') sage: search_src('localize') categories/pushout.py:1294: return R.localize(t) libs/singular/option.pyx:367: This object localizes changes to options.
In other words, there is no class that has a localize method. So, I guess it is safe to comment the Localization functor out.
comment:16 Changed 10 years ago by
Wow, I count 7 bugs in the comments above! What a testament for the need for writing good doctests (and to how careful you are!)
comment:17 in reply to: ↑ 14 Changed 10 years ago by
Replying to SimonKing:
Note that there is an additional problem, namely that there is no coercion from a p-adic field of high precision to a p-adic field of lower precision. I hope sage-devel will answer whether this issue is worth a separate ticket.
Sage-devel (more precisely Robert Bradshaw) wrote that the meaning of "precision" is different for completion at Infinity and at finite primes, and it makes sense that sometimes the precision is non-decreasing and sometimes non-increasing under coercion.
So, I guess I have to modify the merge method of the Completion funtor, rather than the _coerce_map_from method of p-adic rings.
comment:18 follow-up: ↓ 19 Changed 10 years ago by
I noticed the following:
sage: P.<x> = ZZ[] sage: C = P.completion(x).construction()[0] sage: R = FractionField(P) sage: hasattr(R,'completion') False sage: C(R) Traceback (most recent call last): ... AttributeError: 'FractionField_generic' object has no attribute 'completion'
This is since the completion functor simply tries to call the completion method of its argument. However, one can use that the fraction field construction functor and the completion functor commute.
So, I first try to apply a completion method of the argument, R. If it fails with an AttributeError? or NotImplementedError?, I look at R's construction (F,R1). If F merges with completion, then I apply the result of merging to R1. Otherwise, if the completion commutes with F, I try to first apply the completion to R1 and then apply F to the result, and obtain:
sage: C(R) Fraction Field of Power Series Ring in x over Integer Ring
Note that this would not be the first place where merging and commutation of construction functors is used outside the pushout
function. The other place is the construction of infinite polynomial rings, which I wrote as well. Indeed I believe that construction functors should be used more intensely...
comment:19 in reply to: ↑ 18 Changed 10 years ago by
Replying to SimonKing:
...
sage: C(R) Fraction Field of Power Series Ring in x over Integer Ring
I believe that the fraction field of a power series ring over a base ring B
should be identical with the Laurent series ring over the fraction field of
B
. This is implemented in ticket #8972.
I am tempted to say "let's wait until #8972 is refereed", because the doc tests I am constructing here will depend on whether #8972 gets merged or not.
What is the policy in those cases? Should I simply continue the work on the doc tests and care about #8972 later?
comment:20 follow-up: ↓ 21 Changed 10 years ago by
Currently, the construction functors for free modules and for matrix spaces have the same rank, but they do not commute and do not merge. Hence, the following goes boom:
sage: from sage.categories.pushout import pushout sage: pushout(QQ^3,MatrixSpace(QQ,3)) --------------------------------------------------------------------------- CoercionException Traceback (most recent call last) ... CoercionException: ('Ambiguous Base Extension', Vector space of dimension 3 over Rational Field, Full MatrixSpace of 3 by 3 dense matrices over Rational Field)
I think this pushout should exist. But what should result?
MatrixSpace?(QQ,3)^{3}
resp.
FreeModule?(MatrixSpace?(QQ,3),3)
. This is currently not possible, since
MatrixSpace_generic
has no attribute
is_commutative
.
MatrixSpace?(QQ^{3},3)
makes no sense, as
QQ^{3}
is no ring.
MatrixSpace?(QQ,27)
makes not much sense, as I don't see coercion maps.
So, probably it is solution number 1, which at least requires to implement an is_commutative
method, resp. to first test for the presence of such method in
FreeModule?
. I think I'll go for it.
comment:21 in reply to: ↑ 20 Changed 10 years ago by
Replying to SimonKing:
So, probably it is solution number 1, which at least requires to implement an
is_commutative
method, resp. to first test for the presence of such method in
FreeModule?
. I think I'll go for it.
Oops, this is nonsense. The FreeModule?
constructor expects a commutative ring. So, solution 1. is no solution. I will change the constructor so that it is first tested whether the
is_commutative
method exists, so that the error message is clearer, but apart from that, it is OK that the pushout does not exist.
comment:22 follow-up: ↓ 23 Changed 10 years ago by
I believe that free modules of the same rank but with different inner product matrix should not allow coercion. Hence, I think the following is a bug:
sage: P.<t> = ZZ[] sage: M1 = FreeModule(P,3) sage: M2 = QQ^3 sage: M2([1,1/2,1/3]) + M1([t,t^2+t,3]) # This is ok (t + 1, t^2 + t + 1/2, 10/3) sage: M3 = FreeModule(P,3, inner_product_matrix = Matrix(3,3,range(9))) sage: M2([1,1/2,1/3]) + M3([t,t^2+t,3]) # This should result in an error (t + 1, t^2 + t + 1/2, 10/3)
This inappropriate coercion can be avoided by modifying the merge method of the construction functors, so that the inner product matrices are used for comparison as well.
But I acknowledge that other people might think that a coercion should exist. Perhaps I shall ask on sage-algebra...
comment:23 in reply to: ↑ 22 Changed 10 years ago by
Replying to SimonKing:
... But I acknowledge that other people might think that a coercion should exist. Perhaps I shall ask on sage-algebra...
sage-algebra (John Cremona and William Stein) answered that the inner product is an important structure if and only if it is explicitly defined by the user. Hence, in the above example with M2
and
M3
, no error should be raised, since
M2
has no user-defined inner product. But if
M2
was explicitly be provided with the standard inner product, then an error should be raised.
That's easy to implement: The construction()
method of the modules returns a
VectorFunctor?
, and this one carries the inner product matrix (if provided by the user) or None. And two
VectorFunctor?
s carrying different inner product matrices will not be merged.
comment:24 Changed 10 years ago by
Next issue: Quotient rings of univariate polynomial rings did not have a construction method. I am implementing it, so that one has:
sage: P.<t>=ZZ[] sage: Q = P.quo(5+t^2) sage: F,R = Q.construction() sage: F(R) == Q True sage: P.<t> = GF(3)[] sage: Q = P.quo([2+t^2]) sage: F,R = Q.construction() sage: F(R) == Q True
comment:25 Changed 10 years ago by
I am now almost finished with the doc tests for pushout.py.
The soon-to-be-submitted patch is already quite big, and comprises various bug fixes. I suggest that this ticket will mainly be about pushout.py, and the other files will be done on a separate ticket.
Here are three more bugs. Number one:
sage: sage: P.<x> = QQ[] sage: P.<x> = QQ[] sage: Q1 = P.quo([(x^2+1)^2*(x^2-3)]) sage: Q2 = P.quo([(x^2+1)^2*(x^5+3)]) sage: from sage.categories.pushout import pushout sage: pushout(Q1,Q2) --------------------------------------------------------------------------- CoercionException Traceback (most recent call last) /home/king/SAGE/work/invarianten/<ipython console> in <module>() /home/king/SAGE/sage-4.3.1/local/lib/python2.6/site-packages/sage/categories/pushout.pyc in pushout(R, S) 1037 1038 else: -> 1039 raise CoercionException, "No common base" 1040 1041 # Rc is a list of functors from Z to R and Sc is a list of functors from Z to S CoercionException: No common base
This I can fix. The problem is that the quotient rings have no proper construction()
method.
Number 2, continuing the above example:
sage: Q = P.quo([(x^2+1)^2]) sage: Q.has_coerce_map_from(Q1) False sage: Q.has_coerce_map_from(Q2) False
This is wrong since the modulus of Q divides the modulus of Q1 and Q2. Actually Q is supposed to be the pushout of Q1 and Q2.
Number three:
sage: Q(Q1.gen()) ERROR: An unexpected error occurred while tokenizing input The following traceback may be corrupted or invalid The error message is: ('EOF in multi-line statement', (932, 0)) ... TypeError: Unable to coerce xbar (<class 'sage.rings.polynomial.polynomial_quotient_ring_element.PolynomialQuotientRingElement'>) to Rational
But I guess these last two errors should be on a different ticket.
comment:26 Changed 10 years ago by
- Status changed from new to needs_review
- The patch is to be applied after the patches from #8807.
- It raises the doctest coverage of sage.categories.functor and sage.categories.pushout to 100% and occasionally adds doc tests in other places.
- It fixes numerous bugs related with coercion, as indicated in the posts above.
Constructing doc tests for pushout.py and functor.pyx revealed many bugs, so that I needed to change
sage/structure/parent.pyx sage/rings/ring.pyx sage/rings/rational_field.py sage/rings/quotient_ring.py sage/rings/qqbar.py sage/rings/polynomial/polynomial_quotient_ring.py sage/rings/number_field/number_field.py sage/modules/free_module.py sage/categories/pushout.py sage/categories/functor.pyx
The doc tests for all these files still pass.
I think it would make no sense to put more on this ticket. The work on doc tests in map.pyx, morphism.pyx and action.pyx will be moved to a different ticket.
comment:27 follow-up: ↓ 28 Changed 10 years ago by
Wow, this is looking very good!
MatrixFunctor?.init, is there not a module category that could be used in place of CommutativeAdditiveGroups
? I guess if tbe basering is unknown then that's more difficult.
Missing periods on VectorFunctor.__cmp__
and VectorFunctor.merge
. I agree with the logic for that merge function.
That's all I've seen so far (and I've read most of the patch.) You've fixed a lot of bugs too. Pending doctests passing, I'd say this is ready for a positive review.
comment:28 in reply to: ↑ 27 ; follow-up: ↓ 29 Changed 10 years ago by
Hi Robert!
Replying to robertwb:
MatrixFunctor?.init, is there not a module category that could be used in place of
CommutativeAdditiveGroups
? I guess if tbe basering is unknown then that's more difficult.
Yes, Modules()
requires a base ring. There is currently no category of modules, but only a category of R-modules for any ring R. This is why I used CommutativeAdditiveGroups()
in several cases.
Missing periods on
VectorFunctor.__cmp__
andVectorFunctor.merge
.
Missing where? In the doc string?
Concerning positive review, note that technically this ticket depends on #8807, which has no review yet.
Best regards, Simon
comment:29 in reply to: ↑ 28 ; follow-up: ↓ 30 Changed 10 years ago by
Replying to SimonKing:
Hi Robert!
Replying to robertwb:
MatrixFunctor?.init, is there not a module category that could be used in place of
CommutativeAdditiveGroups
? I guess if tbe basering is unknown then that's more difficult.Yes,
Modules()
requires a base ring. There is currently no category of modules, but only a category of R-modules for any ring R. This is why I usedCommutativeAdditiveGroups()
in several cases.
Hmm... does it make sense to have a category of Modules (over any basering)?
Missing periods on
VectorFunctor.__cmp__
andVectorFunctor.merge
.Missing where? In the doc string?
Yes, there were a couple of sentences without ending periods. Nothing major.
Concerning positive review, note that technically this ticket depends on #8807, which has no review yet.
Yep. I started to look at that one too, and will review it if no one beats me too it when I have another spare moment (maybe the upcoming Sage days, depending on how good of shape my thesis is in by then).
comment:30 in reply to: ↑ 29 Changed 10 years ago by
Replying to robertwb:
... Hmm... does it make sense to have a category of Modules (over any basering)?
The axioms of categories say that there must be the identity morphism for any object, and that composition of functors must be associative. It is not required that there is a morphism (e.g., the null-homomorphism) between any two objects. So, I guess a category of modules is just fine.
Cheers, Simon
comment:31 Changed 10 years ago by
There was a change needed in the patch from #8807. So, I had to rebase the ticket here. I just did!
I did not yet have the time to run make ptestall
, but will start it right now.
comment:32 follow-up: ↓ 33 Changed 9 years ago by
- Status changed from needs_review to needs_work
The patch here does not apply cleanly after the one at #8807 (on 4.6.rc0).
comment:33 in reply to: ↑ 32 Changed 9 years ago by
comment:34 Changed 9 years ago by
I just uploaded a new version of my patch. It does apply after the patch from #8807 (with some fuzz), but now various doctests fail.
At least in one case, the reason is that some matrices still have a custom __mul__
method were they should have a _mul_
(single underscore) and _act_on_
method. I expect that it will be addressed on a different ticket.
So, it needs work, but feel free to experiment with the new patch...
comment:35 Changed 9 years ago by
- Description modified (diff)
- Summary changed from Doctest coverage of categories to Doctest coverage of categories - numerous coercion fixes
comment:36 Changed 9 years ago by
- Status changed from needs_work to needs_review
Now, as the patch is updated, it is again ready for review. See the new ticket description for an account of what the patch does.
comment:37 follow-up: ↓ 39 Changed 9 years ago by
- Status changed from needs_review to needs_work
There is quite a lot of work here. Thanks!
Could you please coordinate this patch with #10318? That ticket already has a positive review, is related to #8807 and is incompatible with #8800.
I have not read the code yet, but about problem 17. In which I participated partially I am not sure to like the solution.
sage: K.<r4> = NumberField(x^4-2) sage: L1.<r2_1> = NumberField(x^2-2, embedding = r4**2) sage: L2.<r2_2> = NumberField(x^2-2, embedding = -r4**2) sage: r2_1+r2_2 # indirect doctest 0 sage: (r2_1+r2_2).parent() is L1 True sage: (r2_2+r2_1).parent() is L2 True
Now I realise that there was some dicussion in sage-nt. Are there more examples in which the parent depends on the order of operands? I understand that this happen only where the parents are canonically isomorphic.
comment:38 Changed 9 years ago by
I should have read the threads before posting. I see that the bahaviour with different parents was already present in Sage for fields with embedding to CDF. So I have nothing to say about this.
comment:39 in reply to: ↑ 37 ; follow-up: ↓ 40 Changed 9 years ago by
- Work issues set to Compatibility with #10318
comment:40 in reply to: ↑ 39 ; follow-up: ↓ 41 Changed 9 years ago by
Replying to SimonKing:
Replying to lftabera:
Could you please coordinate this patch with #10318? That ticket already has a positive review, is related to #8807 and is incompatible with #8800.
OK, I'll try. I'm putting it into the "work issues" field.
I'm sorry that it was my trivial patch (spelling correction) which cased this. A simple search-and-replace will be all that is required to make this patch apply after #10318.
comment:41 in reply to: ↑ 40 Changed 9 years ago by
- Status changed from needs_work to needs_review
- Work issues Compatibility with #10318 deleted
Replying to cremona:
I'm sorry that it was my trivial patch (spelling correction) which cased this. A simple search-and-replace will be all that is required to make this patch apply after #10318.
Yes, it seems that it was really to solve by a simple search-and-replace. The patch should now apply after #8807 and #10318. So, back to "needs review".
Best regards,
Simon
comment:42 follow-up: ↓ 43 Changed 9 years ago by
Could one of you please test on 32 bit? I had to change the doc test of selmer_group: With my patch, I get on 64-bit the same output that was previously only expected on 32-bit. So, I could imagine that the expected output on 32-bit needs to be changed as well.
Cheers,
Simon
comment:43 in reply to: ↑ 42 Changed 9 years ago by
Replying to SimonKing:
Could one of you please test on 32 bit? I had to change the doc test of selmer_group: With my patch, I get on 64-bit the same output that was previously only expected on 32-bit. So, I could imagine that the expected output on 32-bit needs to be changed as well.
OK, will do -- it will on top of 4.6.1.alpha2 since I don't yet have a 32-bit build of alpha3.
Cheers,
Simon
comment:44 Changed 9 years ago by
comment:45 follow-up: ↓ 46 Changed 9 years ago by
Test failures:
sage -t "sage/groups/perm_gps/permgroup.py" ********************************************************************** File "/home/john/sage-4.6.1.alpha2/devel/sage-main/sage/groups/perm_gps/permgroup.py", line 1114: sage: G.random_element() Expected: (2,3)(4,5) Got: (1,2)(4,5) ********************************************************************** 1 items had failures: 1 of 4 in __main__.example_34 ***Test Failed*** 1 failures. For whitespace errors, see the file /home/john/.sage//tmp/.doctest_permgroup.py [7.8 s] ---------------------------------------------------------------------- The following tests failed: sage -t "sage/groups/perm_gps/permgroup.py" Total time for all tests: 7.9 seconds john@John-laptop%sage -t "sage/rings/number_field/number_field.py" sage -t "sage/rings/number_field/number_field.py" Exception RuntimeError: 'maximum recursion depth exceeded in __subclasscheck__' in <type 'exceptions.TypeError'> ignored Exception RuntimeError: 'maximum recursion depth exceeded in __subclasscheck__' in <type 'exceptions.TypeError'> ignored Exception RuntimeError: 'maximum recursion depth exceeded while calling a Python object' in <type 'exceptions.GeneratorExit'> ignored Exception RuntimeError: 'maximum recursion depth exceeded while calling a Python object' in <type 'exceptions.GeneratorExit'> ignored Exception GeneratorExit in <generator object <genexpr> at 0xc094e64> ignored Exception RuntimeError: 'maximum recursion depth exceeded in __subclasscheck__' in <type 'exceptions.TypeError'> ignored Exception RuntimeError: 'maximum recursion depth exceeded in __subclasscheck__' in <type 'exceptions.TypeError'> ignored Exception RuntimeError: 'maximum recursion depth exceeded while calling a Python object' in <type 'exceptions.GeneratorExit'> ignored Exception RuntimeError: 'maximum recursion depth exceeded while calling a Python object' in <type 'exceptions.GeneratorExit'> ignored Exception GeneratorExit in <generator object <genexpr> at 0xc094d74> ignored Exception RuntimeError: 'maximum recursion depth exceeded while calling a Python object' in <type 'exceptions.TypeError'> ignored Exception RuntimeError: 'maximum recursion depth exceeded while calling a Python object' in <type 'exceptions.TypeError'> ignored ********************************************************************** File "/home/john/sage-4.6.1.alpha2/devel/sage-main/sage/rings/number_field/number_field.py", line 2960: sage: K.selmer_group([K.ideal(2, -a+1), K.ideal(3, a+1), K.ideal(a)], 3) Expected: [2, a + 1, a] Got: [2, a + 1, -a] ********************************************************************** 1 items had failures: 1 of 12 in __main__.example_62 ***Test Failed*** 1 failures. For whitespace errors, see the file /home/john/.sage//tmp/.doctest_number_field.py [82.3 s] ---------------------------------------------------------------------- The following tests failed: sage -t "sage/rings/number_field/number_field.py"
comment:46 in reply to: ↑ 45 Changed 9 years ago by
Hi John!
Is that 32 or 64 bit? Because:
Replying to cremona:
sage -t "sage/groups/perm_gps/permgroup.py" File "/home/john/sage-4.6.1.alpha2/devel/sage-main/sage/groups/perm_gps/permgroup.py", line 1114:
sage: G.random_element()
Expected:
(2,3)(4,5)
Got:
(1,2)(4,5)
I changed the expected element. (1,2)(4,5) was originally expected, but I obtain (2,3)(4,5) on my machine (after applying the patch).
File "/home/john/sage-4.6.1.alpha2/devel/sage-main/sage/rings/number_field/number_field.py", line 2960:
sage: K.selmer_group([K.ideal(2, -a+1), K.ideal(3, a+1), K.ideal(a)], 3)
Expected:
[2, a + 1, a]
Got:
[2, a + 1, -a]
This one I also changed. [2, a + 1, -a] was originally expected with 64-bit. But after applying the patch, I got [2, a + 1, a], which was originally expected with 32-bit.
Strange. What can one do to get a reproducible result?
comment:47 follow-up: ↓ 48 Changed 9 years ago by
I got the same error in permgroup.py in both 32 and 64 bits. I got the permutation (1,2)(4,5) in two different machines with 4.6 + patches from this ticket.
We can investigate further what is going on, but I do not like this kind of tests against random_element. Even if we use the same seed. Is there a policy to deal with random_element methods?
What about something like?
sage: a= G.random_element() sage: a in G True sage: a.parent() is G True sage: a**6 ()
About the errors in number_field all tests passes in 64 bits but I get the same errors as John in 32 bits. Concerning selmer group. Are both results right or only one of them?
comment:48 in reply to: ↑ 47 Changed 9 years ago by
Replying to lftabera:
I got the same error in permgroup.py in both 32 and 64 bits. I got the permutation (1,2)(4,5) in two different machines with 4.6 + patches from this ticket.
Really strange.
We can investigate further what is going on, but I do not like this kind of tests against random_element. Even if we use the same seed.
Well, we do use the same seed. So, it has to be reproducible.
What about something like?
sage: a= G.random_element() sage: a in G True sage: a.parent() is G True sage: a**6 ()
I guess there is currently a related discussion at sage-devel
About the errors in number_field all tests passes in 64 bits but I get the same errors as John in 32 bits. Concerning selmer group. Are both results right or only one of them?
Both are right. The method is supposed to return a generating set. And that is the case for both answers. And in the original version, the expected answer did depend on 32- versus 64-bit.
Best regards,
Simon
comment:49 follow-up: ↓ 50 Changed 9 years ago by
My tests were on 32-bit 4.6.1.alpha2.
In the Selmer group test both results are correct. It is very common for pari output to be different on 32- and 64-bit, and that the underlying this computation. The output numbers are generating a group which is abstractly (Z/3Z)3, so there is no unique generating set; and (worse) the elements themselves are representatives of cosets of K*/(K*)3.
comment:50 in reply to: ↑ 49 Changed 9 years ago by
Hi John!
Replying to cremona:
My tests were on 32-bit 4.6.1.alpha2.
OK, that means that the results on 32-bit and on 64-bit are switched: I get on 64-bit the result that was previously expected on 32-bit, and you get on 32-bit the result that was previously expected on 64-bit. Or am I confusing things?
comment:51 follow-up: ↓ 52 Changed 9 years ago by
It is surely possible that there are other differences between alpha2 and alpha3, so perhaps I should test again when I have built alpha3. I just started that. (This is a different machine -- my desktop at work -- than the one I tested alpha2 on, which was my laptop at home).
comment:52 in reply to: ↑ 51 Changed 9 years ago by
Replying to cremona:
It is surely possible that there are other differences between alpha2 and alpha3, so perhaps I should test again when I have built alpha3. I just started that. (This is a different machine -- my desktop at work -- than the one I tested alpha2 on, which was my laptop at home).
Even more confusing...
By the way, I tested based on sage-4.6, so, no alpha version.
comment:53 follow-up: ↓ 54 Changed 9 years ago by
- Status changed from needs_review to needs_work
I just tested on a different 32-bit machine on which I have just built 4.6.1.alpha3 (and all tests passed): Same failure as before for sage/groups/perm_gps/permgroup.py, and for sage/groups/perm_gps/permgroup.py
The second one of these is the more worrying in that it goes into an infinite recursion.
comment:54 in reply to: ↑ 53 Changed 9 years ago by
Hi John,
Replying to cremona:
I just tested on a different 32-bit machine on which I have just built 4.6.1.alpha3 (and all tests passed): Same failure as before for sage/groups/perm_gps/permgroup.py, and for sage/groups/perm_gps/permgroup.py
The second one of these is the more worrying in that it goes into an infinite recursion.
I wonder if the recursion comes from the testing framework. Once, I observed such recursion in a test, but I could not reproduce it in an interactive session. In addition, I got a return value different from the expected - and when I changed the expected value in the test, the recursion disappeared as well.
Could you change the expected 32-bit value in the test of selmer_group to the value that you get in an interactive session, and then try sage -t "sage/rings/number_field/number_field.py"
again?
Cheers,
Simon
comment:55 follow-up: ↓ 56 Changed 9 years ago by
OK, I tried that. Now all tests pass. The relevant lines now look like
sage: K.selmer_group([K.ideal(2, -a+1), K.ideal(3, a+1), K.ideal(a)], 3) [2, a + 1, -a] # 32-bit [2, a + 1, a] # 64-bit
while before the two expected outputs were the same despite the separation into 32 and 64 bit cases. Was this just a typo?
There is still no explanation for why, when the expected and actual output differed, there was that infinite recursion.
comment:56 in reply to: ↑ 55 ; follow-up: ↓ 57 Changed 9 years ago by
Replying to cremona:
while before the two expected outputs were the same despite the separation into 32 and 64 bit cases. Was this just a typo?
No. I simply have no 32-bit machine and couldn't test it. That's why I asked that some of you please test on 32-bit.
There is still no explanation for why, when the expected and actual output differed, there was that infinite recursion.
Yes. But it seems to me that it is located in the doctest framework.
So, unless you find more issues, I will post another patch that changes the expected value in case of 32-bit.
Cheers,
Simon
comment:57 in reply to: ↑ 56 Changed 9 years ago by
So, unless you find more issues, I will post another patch that changes the expected value in case of 32-bit.
Go for it!
comment:58 follow-ups: ↓ 59 ↓ 61 Changed 9 years ago by
I confirm that changing the doctest makes all doctest pass.
However, with the coercion of embedded and non embedded number fields, now addition is not associative.
sage: K1.<r1>=NumberField(x^2-2) sage: K2.<r2>=NumberField(x^2-2, embedding=1) sage: K3.<r3>=NumberField(x^2-2, embedding=-1) sage: (r1+r2)+r3 3*r1 sage: r1+(r2+r3) r1
r1+r2 is ambiguous. So either this operation should raise an error or it should add an embedding to K1 compatible with K2. But as far as I understand the coercion model the latter is not possible.
comment:59 in reply to: ↑ 58 Changed 9 years ago by
Replying to lftabera:
I confirm that changing the doctest makes all doctest pass.
Good!
However, with the coercion of embedded and non embedded number fields, now addition is not associative.
sage: K1.<r1>=NumberField(x^2-2) sage: K2.<r2>=NumberField(x^2-2, embedding=1) sage: K3.<r3>=NumberField(x^2-2, embedding=-1) sage: (r1+r2)+r3 3*r1 sage: r1+(r2+r3) r1r1+r2 is ambiguous. So either this operation should raise an error or it should add an embedding to K1 compatible with K2. But as far as I understand the coercion model the latter is not possible.
I disagree: It should not raise an error. This is a side-effect of Sage's coercion model. We (see discussion on sage-nt) do want a forgetful coercion from K2 to K1 and from K3 to K1; and we want a coercion between two embedded number fields induced by the embedding.
Hence, we have a coercion between K2 and K3 sending r3
to -r2
. Therefore r2+r3
is K2.zero()
, thus, r1+(r2+r3)==r1
. On the other hand, r1+r2
is 2*r1
, since the coercion from K2 to K1 sends r2
to r1
; and similarly r3
is sent to r1
, hence (r1+r2)+r3==3*r1
.
But I suggest to discuss on sage-algebra whether people are really happy with that consequence of a forgetful coercion.
comment:60 Changed 9 years ago by
- Work issues set to change 32-bit test; remove forgetful coercion
comment:61 in reply to: ↑ 58 Changed 9 years ago by
Replying to lftabera:
However, with the coercion of embedded and non embedded number fields, now addition is not associative.
As you (? I guess luisfe == lftabera
) pointed out at sage-algebra, the actual problem is not the non-associativity of the addition (after all, we have different algebraic structures involved, so, there is no reason to expect that it can be globally extended to something that is associative).
You convinced me that the actual problem is the fact that the coercions in your example do not form a commuting triangle: Coercion from K3
to K2
followed by forgetful coercion from K2
to K1
is not the same as the forgetful coercion from K3
to K1
.
Hence, I have to modify the _coerce_map_from_
of number fields and probably also the merge method of AlgebraicExtensionFunctor
.
comment:62 Changed 9 years ago by
- Description modified (diff)
comment:63 Changed 9 years ago by
- Status changed from needs_work to needs_review
- Work issues change 32-bit test; remove forgetful coercion deleted
I removed the "forgetful coercions" and changed the documentation and the ticket description accordingly.
I modified the 32-bit expected value of selmer_group according to your findings (but please test if it really works 32-bit; I only tested 64-bit).
I modified the annoying random_element test in permgroup.py as Luis suggested.
Hence, I think it is ready for review again!
comment:64 Changed 9 years ago by
comment:65 follow-up: ↓ 66 Changed 9 years ago by
I confirm that the new patch applies to 32-bits linux and long doctest passes. I have not read the code yet.
comment:66 in reply to: ↑ 65 Changed 9 years ago by
Replying to lftabera:
I confirm that the new patch applies to 32-bits linux and long doctest passes. I have not read the code yet.
Could the doctests be repeated, please? I just did it on my machine, based on sage-4.6.1.alpha3
, and again the problem is the doctest for selmer_group
. Recall that in the original patch I had to switch the expected values for 32- and 64-bit. And now, with sage-4.6.1.alpha3
, I get again the value that was originally expected without the patch.
Therefore I'll replace the patch again, in a few minutes. Please test!
comment:67 Changed 9 years ago by
I really don't see what the patchbot was complaining about. The old patch did apply to sage-4.6.2.alpha0
with just a little fuzz.
Anyway, I refreshed it. The dependencies of the ticket are already merged in sage-4.6.2.alpha0
, so, it should now apply cleanly.
Please, try to review it! I really think that fixing so many bugs and providing full doctest coverage of a large chunk of the coercion machinery is worth the effort.
comment:68 follow-up: ↓ 69 Changed 9 years ago by
- Status changed from needs_review to needs_work
Hi Simon,
I am reading the code, it is a long patch but looks good, thanks for the work done.
I have a question about functor AlgebraicExtensionFunctor? and ZZ. According to the documentation:
When applying a number field constructor to the ring of integers, the maximal order in the number field is returned::
Why is this chosen instead of ZZ[x]/polynomial?
Actually, the code does not follow the documentation except for CyclotomicField?:
sage: N = NumberField(x^2 - 5, 'a') sage: F, R = N.construction() sage: F(ZZ).gens() [1, a] sage: F(ZZ).is_maximal() False sage: N.maximal_order().gens() [1/2*a + 1/2, a]
I add a patch that contains some small improvements (in my opinion). A couple of small tests and some style. Plase consider merging some of these changes. For example, in the code you usually write:
return
instead of
return None
Both are correct but, unless there are other reasons I am unaware, the second looks more readable to me (just an opinion).
I have not yet finish to review the whole patch, so you may consider waiting untill I am done. I have to compile the documentation and check that the list of bugs you have solved appears in the TESTS of the patch.
comment:69 in reply to: ↑ 68 Changed 9 years ago by
Hi Luis,
First of all, thank you for looking at the patch and finding so many typos.
Replying to lftabera:
I have a question about functor AlgebraicExtensionFunctor? and ZZ. According to the documentation:
When applying a number field constructor to the ring of integers, the maximal order in the number field is returned::
Why is this chosen instead of ZZ[x]/polynomial?
That is how currently extensions of ZZ
behave:
sage: ZZ.extension(x^2+3*x+1,names=['y']) Order in Number Field in y with defining polynomial x^2 + 3*x + 1
So, it wasn't my idea; the construction functor is merely mimicking what the extension
method of ZZ
was doing anyway.
Actually, the code does not follow the documentation except for CyclotomicField?:
sage: N = NumberField(x^2 - 5, 'a') sage: F, R = N.construction() sage: F(ZZ).gens() [1, a] sage: F(ZZ).is_maximal() False sage: N.maximal_order().gens() [1/2*a + 1/2, a]
Again, this is what ZZ.extension
currently does:
sage: ZZ.extension(x^2 - 5, 'a').is_maximal() False
But I don't understand why that contradicts the documentation? Is it since I wrote "Note that the construction functor of a number field returns the order of that field"? The order?
Perhaps I should better write "Note that the construction functor of a number field applied to the integers returns an order of that field, similar to the behaviour of ZZ.extension
"?
I add a patch that contains some small improvements (in my opinion). A couple of small tests and some style. Plase consider merging some of these changes.
I agree with all changes that you suggest in your "some_ideas" patch - so, once you're done, please promote it to a referee patch!
Best regards,
Simon
comment:70 follow-up: ↓ 71 Changed 9 years ago by
Ok, current behaviur is what I would expect. But then there is a typo in AlgebraicExtensionFunctor?.init which is where the documentation claims that returs the maximal order. Lines 2223 and 2224 of your patch:
+ When applying a number field constructor to the ring of integers, + the maximal order in the number field is returned::
comment:71 in reply to: ↑ 70 ; follow-up: ↓ 72 Changed 9 years ago by
Replying to lftabera:
Ok, current behaviur is what I would expect. But then there is a typo in AlgebraicExtensionFunctor?.init which is where the documentation claims that returs the maximal order. Lines 2223 and 2224 of your patch:
Thanks! That ought to change, then. I only found the other place, where I wrote "the order" rather than "an order".
comment:72 in reply to: ↑ 71 Changed 9 years ago by
- Status changed from needs_work to needs_review
Dear Luis,
Replying to SimonKing:
Replying to lftabera:
Ok, current behaviur is what I would expect. But then there is a typo in AlgebraicExtensionFunctor?.init which is where the documentation claims that returs the maximal order. Lines 2223 and 2224 of your patch:
Thanks! That ought to change, then. I only found the other place, where I wrote "the order" rather than "an order".
This is now fixed.
I change the ticket status into "needs review" again, since I believe the other typos can be fixed with your reviewer patch.
comment:73 follow-up: ↓ 74 Changed 9 years ago by
- Status changed from needs_review to needs_info
Simon,
What is the reason for the following change?
diff -r f71dd979f978 -r 7097db76160e sage/rings/rational_field.py --- a/sage/rings/rational_field.py Fri Dec 10 14:50:18 2010 +0100 +++ b/sage/rings/rational_field.py Wed Jul 21 14:25:41 2010 +0100 @@ -253,7 +253,7 @@ import integer_ring return FractionField(), integer_ring.ZZ - def completion(self, p, prec, extras = {}): + def completion(self, p, prec, extras):
In the completion method of the RationalField?. I think it is an error to eliminate the default extras = {}. It is not a mandatory argument neither for Qp not for create_RealField and the user has no idea of what to put there (QQ.completion has no documentation, which is a bug, but not for this ticket)
Luis
comment:74 in reply to: ↑ 73 Changed 9 years ago by
Hi Luis,
Replying to lftabera:
What is the reason for the following change?
...
In the completion method of the RationalField?. I think it is an error to eliminate the default extras = {}.
I have not the faintest idea why I did that change. Probably it was by accident. I'll try to revert that change and see if tests still pass.
Cheers, Simon
comment:75 Changed 9 years ago by
Apply 8800_functor_pushout_doc_and_fixes.patch some_ideas.patch
(For the patchbot, if that's necessary)
comment:76 Changed 9 years ago by
- Status changed from needs_info to needs_review
I reverted the obscure "extras" issue. That was no problem.
I had to change two doctests that used the ".transpose()" method for vectors, which is now deprecated. With the new patch applied to sage-4.6.2.alpha4, the long doctests pass on my machine.
Presumably, your "some_ideas.patch" will become a reviewer patch, thus I told the patchbot to apply it.
Best regards,
Simon
comment:77 Changed 9 years ago by
FWIW, the doctest failure reported by the patchbot comes from the fact that the vector method ".column()" seems to be a feature only introduced in 4.6.2.alpha2, replacing the now deprecated ".transpose()".
comment:78 Changed 9 years ago by
- Milestone changed from sage-4.6.2 to sage-4.7
- Status changed from needs_review to needs_work
The documentation of pushout is not built in the reference manual. I have added pushout.py to categories.rst, but I get warnings and errors in the html and pdf built that I do not know how to solve.
comment:79 Changed 9 years ago by
I just updated my patch, also merging your some_ideas.patch. The documentation seemed to build without problems (which required some editing). I am afraid I will probably be unable to see the documentation for the next ten days, as I will not be in my office.
But then I made a big mistake: I also included an autogenerated file into the repository, namely doc/en/reference/sage/categories/pushout.rst. When I noticed it and tried to hg delete
it, apparently I managed to kill the entire documentation. I don't know whether I will recover from that stroke, because even sage -docbuild reference html
did not help.
But perhaps you will be able to (1) see whether the documentation of sage.categories.pushout looks nice and (2) correct my patch?
Apply 8800_functor_pushout_doc_and_fixes.patch
comment:80 Changed 9 years ago by
- Status changed from needs_work to needs_review
I think I solved the trouble with the reference manual. The new patch includes the some_ideas patch. So, only one patch needs to be applied.
With the patch, the references for sage.categories.pushout build, and no warning or error is raised. But I am currently not able to watch the result (this will take more than one week). So, I ask the reviewer to have a look on it.
To be on the safe side, I am now running doc tests (at least, sage -tp 4 doc/en
passes). But I think I can revert it to "needs review".
comment:81 Changed 9 years ago by
Apply 8800_functor_pushout_doc_and_fixes.patch
(for the patchbot)
comment:82 Changed 9 years ago by
All long tests pass if one applies the patch to sage-4.6.2.alpha4. The patchbot uses sage-4.6.1, that's why it finds two errors.
Changed 9 years ago by
comment:83 follow-up: ↓ 84 Changed 9 years ago by
- Description modified (diff)
- Reviewers set to Luis Felipe Tabera Alonso
I have tested with sage-4.6.1.rc0 the documentation builds and looks good. The bugs have been corrected and the patch introduces some very nice features. Good work. Positive review to Simon's patch.
However, I have added a referee patch with some minor changes in the documentation. I have eliminated some latex code that, in my opinion, made the documentation harder to read.
Simon, could you look at my patch? If you feel it is ok, put a positive review.
comment:84 in reply to: ↑ 83 Changed 9 years ago by
- Status changed from needs_review to positive_review
Replying to lftabera:
However, I have added a referee patch with some minor changes in the documentation. I have eliminated some latex code that, in my opinion, made the documentation harder to read.
Simon, could you look at my patch? If you feel it is ok, put a positive review.
I have read the referee patch, and it seems fine. So, I guess it is a positive review then. Finally!
Thank you,
Simon
comment:85 Changed 9 years ago by
- Status changed from positive_review to needs_work
- Work issues set to rebase
Changed 9 years ago by
Full doctest coverage for sage.categories.functor and sage.categories.pushout. Various coercion bug fixes.
comment:86 Changed 9 years ago by
- Status changed from needs_work to needs_review
- Work issues rebase deleted
comment:87 Changed 9 years ago by
comment:88 Changed 9 years ago by
- Description modified (diff)
comment:89 Changed 9 years ago by
- Status changed from needs_review to positive_review
I have absolutely no idea what the patchbot is complaining about! Its shortlog states
2011-03-08 06:20:58 -0800 None 2011-03-08 06:21:05 -0800 7 seconds
which means???
Anyway. All long tests both in sage/
and in doc/
pass. So, if nobody objects, I return to the old positive review.
comment:90 Changed 9 years ago by
- Merged in set to sage-4.7.alpha1
- Resolution set to fixed
- Status changed from positive_review to closed
Shouldn't the following raise an error, since the argument is not contained in the domain? Instead, it returns
None
.