Hey everyone, While I was looking at http://trac.sagemath.org/sage_trac/ticket/13556, I noticed what I believe to be a greater underlying problem with sage in that infinite sequences are not handled (gracefully). In particular, sage tries to construct infinite sequences/lists/tuples when given an infinite iterable set `L` (ex. `QQ` or `(1..)` or `Partitions()`) {{{ sage: list(L) sage: tuple(L) sage: Sequence(L) }}} I doubt we could do anything about `list` or `tuple` since they are python built-ins, but what about `Sequence`? My first thought is to raise a `ValueError` if we give it an infinite list, and I think we need a method for the ellipsis iterator which checks if it is finite.
I also noted that `FreeModule` does not support infinite dimensions by (naively) calling `FreeModule(QQ, oo)`. However I believe we can still work in infinite dimensions by working in `CombinatorialFreeModule(QQ, ZZ)`. In either case, this may only be suitable if we consider it as a direct sum (and implementing using the sparse free modules)... Thoughts? Best, Travis -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To post to this group, send email to sage-devel@googlegroups.com. To unsubscribe from this group, send email to sage-devel+unsubscr...@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en.
