On May 6, 9:18 am, Nils Bruin <nbr...@sfu.ca> wrote: > A basic implementation would be to insist that W=W1=W2 and then > compute M1+M2 = (V1+V2)/W and M1.intersect(M2) = V1.intersect(V2)/W . > This seems to work with naively created submodules (coming from > kernels and images of morphisms, for instance), but will definitely > fail/give unintended answers for "optimised" representations.
This is exactly what I did for finite groups at #9773, since I only considered subgroups (submodules) being created "directly" from a subgroup method via generators. The submodule creation then automatically enforces your W=W1=W2 condition (via a check a cursory check on the "ambient" group of each subgroup). I'll be interested to hear if you get something more general working. Rob -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
