Axiom believes axiom Complex PF 5 has Field
Type: Booleanbut this is not true, as Waldek observed: axiom (2 + %i)::COMPLEX PF 5 *(2 - %i)
Type: Complex(PrimeField?(5))In fact, we find in gaussian.spad: if R has Field then -- this is a lie; we must know that Field -- x**2+1 is irreducible in R Waldek suggested: when creating I think that's better than nothing. Maybe Axiom should issue a warning when it cannot determine whether is irreducible? Is it really hard to check? Martin `F` of characteristic greater than two, seems to be irreducible if and only if the size of the field is congruent three modulo four. A colleague of mine said that good algorithms should exist for most interesting fields, and can probably be found in von zur Ganthen.
However, in SPAD we currently cannot use that knowledge: conditions for exports must be of the form Martin |

Remarks--kratt6, Sat, 19 May 2007 08:28:49 -0500 reply