Next: Hensel Lifting Up: Symbolic Newton Iteration Previous: Linear Newton Iteration

Let R be a commutative ring R with units. Let p R and R[y]. We are concerned with solving the equation

 (g)  =  0. (109)

The following Proposition 15 states that Relation (111) computes better and better approximations of solutions of Relation (109) that is, approximations modulo higher and higher powers of p. W.r.t. Theorem 12 this proposition offers a significant improvement: the accuracy doubles at each step, leading to the so-called Quadratic Symbolic Newton Iteration.

Proposition 15   Let R[y] and let g, h R be such that

 (g)   0 modp (110)

Assume that (g) is invertible modulo p and let denote by (g)-1 its inverse. Consider an element h R such that

 h   g - (g) (g)-1modp2 (111)

Then the following assertions hold
1. (h  0 modp2
2. h   g modp
3. (h) is invertible modulo p

Proof. Since (g) is invertible modulo p then (g) is invertible modulo p2. (This is easy to check: Exercise!) Hence Relation 111 makes sense. In fact, Algorithm 6 computes (g)-1modp2 given (g)-1modp.

Since p divides p2, the following congruence holds

 h   g - (g) (g)-1modp (112)

Since (g  0 modp, this leads to

 h   g modp (113)

and we have proved the second claim. Let us prove the first one. Using the Taylor expansion of at h and the fact that p2 divides (h - g)2 we obtain

 (h) (g) + (g)(h - g)modp2 (g) - (g)(g) (g)-1modp2 0 modp2
(114)

proving the first claim. Finally, observe that h   g modp implies (h  (g)modp. Indeed is a polynomial in R[x]. Therefore, (h) is invertible modulo p, since (g) is invertible modulo p, by hypothesis.

Remark 21   Intuitively, Proposition 15 says that if g is a good approximation of a zero of then h is a better approximation, at least twice as accurate.

Remark 22   Proposition 15 leads to an algorithm provided that we can
• check whether (g) is invertible modulo p and
• compute its inverse modulo p in case.
Then for computing the inverse of (h) modulo p the idea is to apply the algorithm to itself! That is, to the particular case of

 (g)  =  1/g - f (115)

This leads to Algorithm 8. Finally recall that for a prime element p in an Euclidean domain R, the computation of (g)-1 modulo p can be done by the Extended Euclidean Algorithm.

Algorithm 8

Theorem 14   Algorithm 8 is correct.

Proof. Let gr   gr-1 - (gr-1)sr-1modp2r. Then we have

 g   gr modp (116)

In other words gr is a solution of higher precision. Then proving the theorem turns into proving the invariants for i = 0 ... r
1. gi   g0modp,
2. (gi  0 modp2i,
3. if i < r then si (gi  1 modp2i.
The case i = 0 is clear and we assume that i > 0 holds. Then by induction hypothesis p2i-1 divides (gi-1) and si-1 - (gi-1)-1. Then p2i divides their product, that is

 (gi-1)si-1   (gi-1)(gi-1)-1 modp2i. (117)

Now we calculate

 gi gi-1 - (gi-1)si-1 modp2i gi-1 - (gi-1)(gi-1)-1 modp2i
(118)

Now applying Proposition 15 with g = gi-1, h = gi and m = p2i-1 we obtain the first two invariants. In addition, this leads to

 gi   gi-1 modp2i-1 (119)

for i < r. This implies

 (gi)-1   (gi-1)-1   si-1 modp2i-1 (120)

Now, si is obtained by one Newton step for inversion (see Algorithm 6). Therefore the third invariant follows.

Next: Hensel Lifting Up: Symbolic Newton Iteration Previous: Linear Newton Iteration
Marc Moreno Maza
2004-04-27