Ticket #1183 (closed defect: fixed)
[with patch, with positive review] Residue fields are broken
| Reported by: | roed | Owned by: | was |
|---|---|---|---|
| Priority: | major | Milestone: | sage-2.9 |
| Component: | number theory | Keywords: | |
| Cc: | Author(s): | ||
| Report Upstream: | Reviewer(s): | ||
| Merged in: | Work issues: |
Description
The current implementation of residue fields for number fields is broken. It just takes the defining polynomial for the number field, factors it over Z/pZ, picks one factor and creates an extension using that factor. This breaks because elements of the ring of integers, when expressed in terms of the power basis of the number field can have denominators divisible by p.
The solution is to create a p-maximal order and do some linear algebra to come up with a map that doesn't break on denominators divisible by p. Pari's nfinit has a way to give it a partial factorization of the discriminant that will produce a p-maximal order.
If you want to implement this, talk to William Stein or David Roe for more details.

