#13788: FiniteSetMaps Map Comparison
--------------------------------+-------------------------------------------
Reporter: startakovsky | Owner: tbd
Type: defect | Status: needs_review
Priority: major | Milestone: sage-duplicate/invalid/wontfix
Component: algebra | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
--------------------------------+-------------------------------------------
Changes (by tscrim):
* status: new => needs_review
* type: PLEASE CHANGE => defect
* component: PLEASE CHANGE => algebra
* milestone: sage-5.9 => sage-duplicate/invalid/wontfix
Comment:
I believe this would be better asked on sage-devel since it is a question
rather than a bug or feature request.
Nevertheless, the biggest problem as I see it is how do you compare
infinite enumerated sets, much less uncountable ones. Additionally you can
encode additional information into the (co)domain which the function
reflects. For example, if I define a map from `f: [0, 1, 2] -> [0, 1, 2]`,
there's no way to tell what kind of map do I want, a set map, or perhaps a
field homomorphism (although I think this is encoded more in the class of
the morphism)? Furthermore, by using the base objects rather than generic
sets, equality comparisons can be done significantly faster (ex. take Z
mod 1000, you only need to know the class and n rather than having to do a
set comparison [which is at least O(n)]).
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13788#comment:2>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
