Yes, those are certainly interesting issues. So far, I have taken the route
of making a general algorithm and letting Sage handle the specific
constructions. I assume that the underlying construction will throw the
appropriate error when a calculation fails or is not implemented.
Your specific
> Note that the integers (which should probably be treated as a special
> case)
> does have sufficient general ideal theory code available:
>
> sage: I = ZZ.ideal(2)
> sage: I = ZZ.ideal(2)
> sage: ZZ.ideal(1) == I + J
> True
>
> but the p-adics apparently do not:
>
> sage: ZZp = pAdicRing(2)
> sag
Hi,
Let me just comment on two related issues:
1. Rational maps are indeed interesting in geometry and the question
of whether
a given rational map is (i.e. extends to) a morphism is a hard
question. In some
situations one might want to consider two categories. For instance,
do you assert
that
