Ask Your Question

# Revision history [back]

The word irreducible gets used a lot in mathematics. For elliptic curves over finite fields the implementation is just "irreducible as a scheme". Since elliptic curves are irreducible by definition the implementation could just be

def is_irreducible(self):
return True


There are no steps involved.

For elliptic curves over QQ is_irreducible(p) is still a legacy test of whether the galois representation on the p-torsion is irreducible (but read the documentation about where this is moved). Once this deprecation has been resolved, the removal of the special is_irreducible would expose the scheme theoretic routine on elliptic curves over QQ as well.