Skip to content
This repository has been archived by the owner on Jan 30, 2023. It is now read-only.

Commit

Permalink
fix doctest failures
Browse files Browse the repository at this point in the history
  • Loading branch information
yyyyx4 committed Oct 17, 2022
1 parent 230019e commit be6aedc
Show file tree
Hide file tree
Showing 2 changed files with 17 additions and 5 deletions.
6 changes: 1 addition & 5 deletions src/sage/schemes/elliptic_curves/hom_scalar.py
Original file line number Diff line number Diff line change
Expand Up @@ -307,12 +307,8 @@ def _richcmp_(self, other, op):
TESTS::
sage: from sage.schemes.elliptic_curves.weierstrass_morphism import negation_morphism
sage: from sage.schemes.elliptic_curves.hom_composite import EllipticCurveHom_composite
doctest:warning ...
sage: neg = negation_morphism(E)
sage: neg_psi = EllipticCurveHom_composite.from_factors([psi,neg])
sage: psi_neg = EllipticCurveHom_composite.from_factors([neg,psi])
sage: phi == neg_psi == psi_neg == -psi
sage: phi == neg*psi == psi*neg == -psi
True
"""
if isinstance(other, EllipticCurveHom_scalar):
Expand Down
16 changes: 16 additions & 0 deletions src/sage/schemes/elliptic_curves/hom_velusqrt.py
Original file line number Diff line number Diff line change
Expand Up @@ -1365,6 +1365,22 @@ def scaling_factor(self):
"""
return self._pre_iso.scaling_factor() * self._post_iso.scaling_factor()

def is_separable(self):
r"""
Determine whether or not this isogeny is separable.
Since :class:`EllipticCurveHom_velusqrt` only implements
separable isogenies, this method always returns ``True``.
EXAMPLES::
sage: E = EllipticCurve(GF(17), [0,0,0,3,0])
sage: phi = E.isogeny(E((1,2)), algorithm='velusqrt')
sage: phi.is_separable()
True
"""
return True


def _random_example_for_testing():
r"""
Expand Down

0 comments on commit be6aedc

Please sign in to comment.