David Harvey wrote: > On Oct 29, 2006, at 12:08 AM, David Joyner wrote: > > >>>> 2. Let F1 subset F2 be two finite fields of order q, >>>> x1 in F1, x2 in F2. Consider the sum x2+x1+x2. The sum >>>> x2+(x1+x2) makes sense but the sum (x2+x1)+x2 >>>> does not (assuming that there is no coercion F2->F1). >>>> >>>> >>> I'm not sure what you mean by "F1 subset F2 be two finite fields of >>> order q". >>> >>> >> Sorry, that was a copy+paste error: "order q" should be "order q, q^r >> (reps.)" >> > > > I think they both make sense. > > For (x1+x2), it would coerce x1 into F2 and add in F2. Then for x2+(x1 > +x2) it would add in F2. > > For (x2+x1) it would coerce x1 into F2 and add in F2. Then for (x2+x1) > +x2) it would add in F2. >
I guess I misunderstood. I thought x2+x1 would fail since there is no F2->F1. Are these coercions canonical? Sometimes field embeddings depend on on choosing a root of a polynomial. Can this be done consistently? > I don't see what the difference is. > > David > > > > > > --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
