On Fri, May 31, 2013 at 03:20:48PM -0400, Mark Shimozono wrote:
> Ooh, I can see implementation issues.
> They center around evaluating an inverse morphism.
Yup, there certainly is no generic way of computing inverse morphisms.
Only in certain categories is this guaranteed to be computable /
effic
Nicolas,
> > Does sage have a functorial Aut construction,
> > which yields the group of automorphisms of some object in a category?
>
> Not yet; it just has End.
Ooh, I can see implementation issues.
They center around evaluating an inverse morphism.
Say f:A--->A is an automorphism of an infin
