The classification of some polynomial maps with

arXiv:1710.04210v1 [math.AG] 11 Oct 2017

nilpotent Jacobians

Dan Yan
Key Laboratory of HPCSIP,
College of Mathematics and Computer Science,
Hunan Normal University, Changsha 410081, China
E-mail: yan-dan-hi@163.com

Abstract

In the paper, we classify all polynomial maps of the form H = (H1 (x1 , x2 , . . . ,
xn ), H2 (x1 , x2 ), , Hn (x1 , x2 )) with JH nilpotent.

Keywords. Jacobian Conjecture, Nilpotent Jacobian matrix, Polynomial maps

MSC(2010). Primary 14E05; Secondary 14A05;14R15

1 Introduction
Throughout this paper, we will write K for algebraically closed field with charac-
teristic zero and K[x] = K[x1 , x2 , . . . , xn ] for the polynomial algebra over K with
n indeterminates. Let F = (F1 , F2 , . . . , Fn ) : Kn Kn be a polynomial map,
Fi
that is, Fi K[x] for all 1 i n. Let JF = ( x j
)nn be the Jacobian matrix
of F .
The Jacobian Conjecture (JC) raised by O.H. Keller in 1939 in [12] states
that a polynomial map F : Kn Kn is invertible if the Jacobian determinant
det JF is a nonzero constant. This conjecture has been attacked by many people
from various research fields, but it is still open, even for n 2. Only the case
n = 1 is obvious. For more information about the wonderful 70-year history, see
[1], [8], and the references therein.

The author is supported by the Natural Science Foundation of Hunan Province (Grant
No.2016JJ3085), the National Natural Science Foundation of China (Grant No.11601146) and
the Construct Program of the Key Discipline in Hunan Province.
 In 1980, S.S.S.Wang ([13]) showed that the JC holds for all polynomial maps
of degree 2 in all dimensions (up to an affine transformation). The most powerful
result is the reduction to degree 3, due to H.Bass, E.Connell and D.Wright ([1])
in 1982 and A.Yagzhev ([15]) in 1980, which asserts that the JC is true if the JC
holds for all polynomial maps x + H, where H is homogeneous of degree 3. Thus,
many authors study these maps and led to pose the following problem.

(Homogeneous) dependence problem. Let H = (H1 , . . . , Hn ) K[x] be a (ho-

mogeneous) polynomial map of degree d such that JH is nilpotent and H(0) = 0.
Whether H1 , . . . , Hn are linearly dependent over K?

The answer to the above problem is affirmative if rankJH 1 ([1]). In partic-

ular, this implies that the dependence problem has an affirmative answer in the
case n = 2. D. Wright give an affirmative answer when H is homogeneous of de-
gree 3 in the case n = 3 ([14]) and the case n = 4 is solved by Hubbers in [11]. M.
de Bondt and A. van den Essen give an affirmative answer to the above problem
in the case that H is homogeneous and n = 3 ([6]). A. van den Essen found the
first counterexample in dimension three for the dependence problem ([9]). M. de
Bondt give a negative answer to the homogeneous dependence problem for d 3.
In particular, he constructed counterexamples to the problem for all dimensions
n 5 ([2]). In [7], M. Chamberland and A. van den Essen classify all polynomial
maps of the form H = (u(x, y), v(x, y, z), h(u(x, y), v(x, y, z))) with JH being
nilpotent. In particular, they show that all maps of this form with H(0) = 0, JH
nilpotent and H1 , H2 , H3 linearly independent has the same form as the counterex-
ample that gave by A. van den Essen in [9] (up to a linear coordinate change). We
classify all polynomial maps of the form H = (u(x, y), v(x, y, z), h(x, y, z)) in the
case that JH is nilpotent and degz v 3, (degy u(x, y), degy h(x, y, z)) = 1 ([17])
and classify all polynomial maps of the form H = (u(x, y), v(x, y, z), h(x, y)) in
the case that JH is nilpotent and (degy u(x, y), degy h(x, y)) 3 or degy u(x, y)
or degy h(x, y) is a prime number ([18],[19]).

In section 2, we classify all polynomial maps of the form H = (u(x, y), v(x, y, z),
h(x, y)) in the case that JH is nilpotent and H(0) = 0. As an application, we
get the structure of the polynomial maps in dimension two with nilpotent Jaco-
bians. Then, in section 3, we first classify all polynomial maps of the form H =
(H1 (x1 , x2 , . . . , xn ), H2 (x1 , x2 ), , Hn (x1 , x2 )) in the case that JH is nilpotent,
the components of H are linearly independent and H(0) = 0. Then we classify all
polynomial maps of the form H = (H1 (x1 , x2 , . . . , xn ), H2 (x1 , x2 ), , Hn (x1 , x2 ))
with JH nilpotent. The main results in the paper are Theorem 2.5, Proposition
Q 2P
3.1 and Theorem 3.3. We define that Qxi = x i
, Pxi xj = xi x j
and degy f is the
highest degree of y in f .
2 Polynomial maps of the form H = (u(x, y), v(x,
y, z), h(x, y))
In the section, we classify all polynomial maps of the form H = (u(x, y), v(x, y, z),
h(x, y)) in the case that JH is nilpotent and H(0) = 0.

Lemma 2.1. Let Q K[x, y] be a polynomial. Then

(1) Suppose that Q(x, y) = Qr (x)y r + Qr1 (x)y r1 + + Q1 (x)y + Q0 (x) with
Qr (x) 6= 0. If Qy |Qx or Qy |Q + c for some c K and Qr (x), Q + c are coprime,
then Q is a polynomial of y + a(x) for some a(x) K[x].
(2) Suppose that Q(x, y) = qt (y)xt + qt1 (y)xt1 + + q1 (y)x + q0 (y) with
qt (y) 6= 0. If Qx |Qy or Qx |Q + d for some d K and qt (y), Q + d are coprime,
then Q is a polynomial of x + b(y) for some b(y) K[y].

Proof. (1) Since Qy = rQr (x)y r1 + (r 1)Qr1 (x)y r2 + + Q1 (x), Qx =

Qr (x)y r + Qr1 (x)y r1 + + Q1 (x)y + Q0 (x), so we have degy Qx degy Qy + 1.
We always view that the polynomials are in K[x][y] with coefficients in K[x] when
comparing the coefficients of y i .
Case I If Qy |Qx , then we have

Qx = (c1 (x)y + c0 (x))Qy (2.1)

for c0 (x), c1 (x) K[x]. That is, Qr (x)y r + Qr1 (x)y r1 + + Q1 (x)y + Q0 (x) =
(c1 (x)y + c0 (x))(rQr (x)y r1 + (r 1)Qr1 (x)y r2 + + Q1 (x)) (2.2)
r
Comparing the coefficients of y of the above equation, we have that

Qr (x) = rc1 (x)Qr (x) (2.3)

Since Qr (x) 6= 0, so we have Qr (x) K and c1 (x) = 0 by comparing the degree

of x of equation (2.3). Let Qr := Qr (x). Then equation (2.2) has the following
form:

Qr1 (x)y r1 + + Q1 (x)y + Q0 (x) = c0 (x)(rQr y r1 + + Q1 (x)).

Comparing the coefficients of y r1 of the above equation, we have that c0 (x) =

Qr1 (x) (x)
rQr
. Then let x = x, y = y+ Qr1
rQr
, it follows from equation (2.1) that Qx = 0.
(x) (x)
That is, Q(x, y) K[y + Qr1
rQr
]. Let a(x) = Qr1
rQr
. Then the conclusion follows.
Case II If Qy |Q + c, then Q + c = (d1 (x)y + d0 (x))Qy . That is,

Qr (x)y r + +Q1 (x)y+Q0 (x)+c = (d1 (x)y+d0 (x))(rQr (x)y r1+ +Q1 (x)) (2.4)
1
Comparing the coefficients of y r and y r1 of equation (2.4), we have that d1 (x) = r
r1 (x)
and d0 (x) = Q
r 2 Qr (x)
. Then equation (2.4) has the following form:

1 Qr1(x)
Qr (x)y r + +Q1 (x)y+Q0 (x)+c = ( y+ 2 )(rQr (x)y r1 + +Q1 (x)) (2.5)
 Qri (x) r!
Claim: Qi (x) = Cri rriQr1
ri1
(x)
for 1 i r 2, Cri = i!(ri)! .
r
r2
Comparing the coefficients of y of equation (2.5), we have the following equa-
tion:
Q2 (x)
Qr2 (x) = Crr2 2r1 .
r Qr (x)
Qrk1 (x)
Suppose Qk+1 (x) = Crk+1 rrk1
r1
Qrk2 (x)
. Then comparing the coefficients of y k of
r
equation (2.5), we have the following equation:

1 Qr1 (x)
Qk (x) = kQk (x) + 2 (k + 1)Qk+1 (x).
r r Qr (x)

That is,
rk
Qr1 (x)
Qk (x) = Crk .
r rk Qrrk1(x)
Qri (x)
Thus, we have that Qi (x) = Cri rri Qr1
ri1
(x)
for 1 i r 2. Then equation (2.5)
r
has the following form:

Qr1 (x)
Q0 (x) + c = Q1 (x) .
r 2 Qr (x)

That is,
Qrr1 (x)
Q0 (x) = c.
r r Qrr1 (x)
Qr1 (x) r1 Qrr1 (x)
Thus, we have Q(x, y) = Qr (x)(y r + Qr (x)
y ++ r r Qrr (x)
) c = Qr (x)(y +
Qr1 (x) r
rQr (x)
) c. Clearly, Qr (x)|Q + c. Since Qr (x), Q + c are coprime, we have that
r1 (x) r1 (x)
Qr (x) K . Therefore, we have Q K[y + QrQ r (x)
]. Let a(x) = QrQ r (x)
. Then the
conclusion follows.
(2) We always view that the polynomials are in K[y][x] with coefficients in
K[y] when comparing the coefficients of xi . By following the arguments of (1),
the conclusion follows.

Remark 2.2. Lemma 2.1(1) is a generalization of Lemma 2.1 in [19].

Lemma 2.3. Let q K[x, y] be a polynomial and w(x, y) K[q] is a polynomial

of q.
(1) If there exist l1 , l2 N such that qy |w l1 qxl2 and p(x) qy for any p(x)
K[x]/K, then qy |qx . In particular, if there exist l1 , l2 N such that qy |w l1 qxl2 and
there exists a coefficient of y i0 in q which is a non-zero constant with i0 1, then
qy |qx .
(2) If there exist k1 , k2 N such that qx |w k1 qyk2 and Q(y) qx for any Q(y)
K[y]/K, then qx |qy . In particular, if there exist k1 , k2 N such that qx |w k1 qyk2
and there exists a coefficient of xj0 in q which is a non-zero constant with j0 1,
then qx |qy .
Proof. (1) Let
qy = f1s1 f2s2 ftst (2.6)
where f1 , , ft are different irreducible polynomials with degree no less than 1.
Since qy |w l1 qxl2 , so we have

f0 f1 fk |w (2.7)

and
fk+1 ft |qx (2.8)
after suitable changing the position of fi and fj , where k {0, 1, . . . , t} and
f0 = 1, ft+1 = 1. Since w is a polynomial of q, so, by the Fundamental Theorem
of Algebra, we have

w(q) = c0 (q + c1 )(q + c2 ) (q + cl ) (2.9)

with c0 K , c1 , . . . , cl K. It follows from (2.7) and (2.9) that fj |q + cij for

1 j k. That is,
(1)
q + cij = fj Mj (x, y) (2.10)
(1)
for some Mj (x, y) K[x, y]. It follows from equations (2.6) and (2.10) that
(1) (1)
qy = fjy Mj (x, y) + fj Mjy (x, y) = f1s1 f2s2 ftst .

That is,
(1) s 1 (1)
fjy Mj (x, y) = fj (f1s1 fj j ftst Mjy (x, y)).
If fjy = 0, then fj K[x]/K and fj |qy . This is a contradiction! Thus, we have
(1)
fjy 6= 0 for 1 j k. Since fj is irreducible, so we have fj |Mj (x, y). Thus, we
(1) (2) (2)
have Mj (x, y) = fj Mj (x, y) for some Mj (x, y) K[x, y]. That is,
(2)
q + cij = fj2 Mj (x, y).

We can do step by step until

s +1 (sj +1)
q + cij = fj j Mj (x, y) (2.11)
(sj +1)
for 1 j k, Mj (x, y) K[x, y]. It follows from (2.8) that

qx = fr Nr(1) (x, y) (2.12)

(1)
for k + 1 r t, Nr (x, y) K[x, y]. It follows from equations (2.12) and (2.6)
that

qxy = fry N (1) (x, y) + fr N (1) (x, y) = f s1 1 f sr 1 f st 1 L(x, y),

where L(x, y) = s1 f1x f2 ft + s2 f1 f2x ft + + st f1 ft1 ftx . That is,

fry Nr(1) (x, y) = fr (f1s1 1 frsr 2 ftst 1 L(x, y) Nry

(1)
).

If fry = 0, then fr K[x]/K and fr |qy . This is a contradiction! Thus, we have

(1) (1)
fry 6= 0. Since fr is irreducible, so we have fr |Nr (x, y). That is, Nr (x, y) =
(2) (2) (2)
fr Nr (x, y) for some Nr (x, y) K[x, y]. Thus, we have qx = fr2 Nr (x, y).
We can do step by step until

qx = frsr Nr(sr ) (x, y) (2.13)

for k + 1 i t. Combining equations (2.11) and (2.13), we have

qx = fisi Li (x, y)
(s +1) (s +1)
for 1 i t, where Li (x, y) = (si + 1)Mi i (x, y)fix + fi Mix i (x, y) for
(s )
1 i k, Li (x, y) = Ni i (x, y) for k + 1 i t. Since f1 , , ft are irreducible,
s
so fisi , fj j are coprime for i 6= j. Thus, we have qx = f1s1 ftst L(x, y) for some
L(x, y) K[x, y]. That is,
qx = qy L(x, y).
Thus, we have qy |qx . If there exists a coefficient of y i0 in q is a non-zero constant
with i0 1, then p(x) qy for any p(x) K[x]/K because the coefficient of y i01
in qy is a non-zero constant. Then the conclusion follows.
(2) Let qx = g11 gm
m
, where g1 , , gm are different irreducible polynomi-
als with degree no less than 1. Then we have the conclusions by following the
arguments of (1).

Remark 2.4. In Lemma 2.3, we mean that the coefficients are in K[x] when
mentioning the coefficients of y i0 and the coefficients are in K[y] when mentioning
the coefficients of xj0

Theorem 2.5. Let H = (u(x, y), v(x, y, z), h(x, y)) be a polynomial map with
H(0) = 0. Assume that the components of H are linearly independent over K. If
JH is nilpotent, then u = g(ay + b(x)), v = v1 z a1 b (x)g(ay + b(x)) v1 l2 x,
h = c0 u2 + l2 u, where b(x) = v1 c0 ax2 + l1 x + l2 , v1 , c0 , a K , l1 , l2 , l2 K,
g(t) K[t] and g(0) = 0, deg g(t) 1.

Proof. Let v = vd z d + vd1 z d1 + + v1 z + v0 with vi K[x, y] for 0 i n.

Since JH is nilpotent, so it follows from Lemma 3.2 in [18] that d = 1 and
v1 K . That is, v = v1 z + v0 with v1 K . Since JH is nilpotent, so we have
the following equations:



ux + v0y = 0 (2.14)

ux v0y v0x uy v1 hy = 0 (2.15)



v (u h u h ) = 0
1 x y y x (2.16)
It follows from equation (2.14) that

ux = v0y (2.17)

It follows from Lemma 3.1 in [18] and equation (2.16) that there exists a polyno-
mial q(x, y) K[x, y] such that

u = u(q), h = h(q) K[q] (2.18)

Substituting equations (2.17) and (2.18) to equation (2.15), we have the following
equation:
qy [u (q)v0x + v1 h (q)] = (u (q))2 qx2 (2.19)
If degy q = 0, then it is easy to check that u, v, h are linearly dependent. This
is a contradiction!
If degy q 1, then it follows from equation (2.19) that qy |(u(q))2 qx2 . Let
h(x, y) = hn (x)y n + + h1 (x)y + h0 (x) with hi (x) K[x], 1 i n, hn (x) 6= 0.
It follows from Lemma 3.4 in [18] that hn (x) K . Let q(x, y) = qm (x)y m +
+ q1 (x)y + q0 (x) with qm (x) 6= 0, qj (x) K[x], 0 j m. It follows from
equation (2.18) that h = h(q) = hn (x)y n + + h1 (x)y + h0 (x). Thus, we have
qm (x) K . Since u (q) is a polynomial of q, so it follows from Lemma 2.3(1) that
qy |qx . Then it follows from Lemma 2.1(1) that q is a polynomial of y + a(x) for
some a(x) K[x]. Thus, it follows from equation (2.18) that u, h K[y + a(x)].
Then the conclusion follows from the proof of Theorem 2.8 in [17].

Remark 2.6. We can remove the restrictions on the degree of y of u(x, y), h(x, y),
h(x, y, v), h(x, y, z), u(x, y, z), v(x, y, z) in all the Theorems, Corollaries in [17],
[18], [19].

Corollary 2.7. Let H = (u(x, y, z), v(x, y), h(x, y)) be a polynomial map with
H(0) = 0. Assume that the components of H are linearly independent over K. If
JH is nilpotent, then u = u1 z a1 b (y)g(ax + b(y)) u1 l2 y, v = g(ax + b(y)),
h = c0 v 2 + l2 v, where b(y) = u1 c0 ay 2 + l1 y + l2 , u1 , c0 , a K , l1 , l2 , l2 K,
g(t) K[t] and g(0) = 0, deg g(t) 1.

Proof. Let
0 1 0

1 0 0 .
M =
0 0 1
Then M 1 HM = (v(y, x), u(y, x, z), h(y, x)). Since JH is nilpotent, so we have
that J(M 1 HM) = M 1 JHM is nilpotent. It follows from Theorem 2.5 that
v(y, x) = g(ay + b(x)), u(y, x, z) = u1 z a1 b (x)g(ay + b(x)) u1 l2 x, h(y, x) =
c0 v 2 (y, x) + l2 v(y, x), where b(x) = v1 c0 ax2 + l1 x + l2 , v1 , c0 , a K , l1 , l2 , l2 K,
g(t) K[t] and g(0) = 0, deg g(t) 1. Then the conclusion follows.
Remark 2.8. It follows from Corollary 2.7 that u, v, h are linearly dependent in
the case that H = (u(x, y, z), v(h(x, y)), h(x, y)) and JH is nilpotent, H(0) = 0,
which is the Theorem 2.1 in [18].

Lemma 2.9. Let H = (H1 , H2 ) K[x1 , x2 , . . . , xn ] be a polynomial map. If

Jx1 ,x2 H is nilpotent, then the coefficients of the highest degree of xi in H1 , H2 are
in K[x3 , . . . , xn ] for i = 1, 2.

Proof. Since Jx1 ,x2 H is nilpotent, so we have

H1x + H2x = 0 (2.20)
1 2

H
1x1 H2x2 H1x2 H2x1 = 0 (2.21)

It follows from equation (2.20) that H1x1 = H2x2 . Thus, there exists P
K[x1 , . . . , xn ] such that H1 = Px2 , H2 = Px1 . It follows from equation (2.21)
that Px21 x2 + Px1 x1 Px2 x2 = 0. That is,

Px21 x2 = Px1 x1 Px2 x2 (2.22)

We first show that the coefficients of the highest degree of x1 in H1 , H2 are

in K[x3 , . . . , xn ]. Let P (x1 , . . . , xn ) = Pl (x2 , . . . , xn )xl1 + + P1 (x2 , . . . , xn )x1 +
P0 (x2 , . . . , xn ) with Pl 6= 0. It follows from equation (2.22) that (lPlx2 xl1 1 ++
2 l2 l
P1x2 ) = (l(l 1)Pl x1 + + 2P2 )(Plx2 x2 x1 + + P1x2 x2 x1 + P0x2 x2 ) (2.23)
We view that the coefficients are in K[x2 , . . . , xn ] when comparing the coefficients
of xi1 for 1 i 2l 2. Comparing the coefficients of x2l2 1 of equation (2.23),
we have
(lPlx2 )2 = l(l 1)Pl Plx2 x2 (2.24)
(k) (1) (0)
Let Pl (x2 , . . . , xn ) = Pl (x3 , . . . , xn )xk2 + +Pl (x3 , . . . , xn )x2 +Pl (x3 , . . . , xn )
with k 1. We view that the coefficients are in K[x3 , . . . , xn ] when comparing
the coefficients of xj2 for 1 j 2k 2. Comparing the coefficients of x22k2 of
equation (2.24), we have that
(k) (k) (k)
l2 (kPl )2 = l(l 1)k(k 1)Pl Pl .

That is, l2 k = l(l 1)(k 1).

If l = 0, then H1 = Px2 = P0x2 K[x2 , . . . , xn ], H2 = Px1 = 0. Thus, the
conclusion follows.
If l 6= 0, then we have that lk = (l1)(k1). This is impossible. Thus, we have k =
(0)
0. That is, Pl (x2 , . . . , xn ) = Pl (x3 , . . . , xn ) K[x3 , . . . , xn ]. Therefore, we have
H2 = Px1 = (lPl xl1 l1
1 + + P1 ), H1 = Px2 = P(l1)x2 x1 + + P1x2 x1 + P0x2 .
We can assume that t is the maximal integer such that Ptx2 6= 0, 0 t l 1.
Thus, we have that H1 = Ptx2 xt1 +P(t1)x2 xt1 1 + +P1x2 x1 +P0x2 . It follows from
equation (2.23) that (tPtx2 x + +P1x2 ) = (l(l1)Pl xl2 + +2P2 )(Ptx2 x2 xt +
t1 2
 + P1x2 x2 x1 + P0x2 x2 ) (2.25)
Since t 1 l 2, so comparing the coefficients of xl+t2
1 of equation (2.25), we
have the following equation

l(l 1)Pl Ptx2 x2 = 0.

Since Pl 6= 0, so we have Ptx2 x2 = 0 or l = 1. That is, Ptx2 K[x3 , . . . , xn ] or

H1 = P0x2 . Thus, the coefficients of the highest degree of x1 in H1 , H2 are in
K[x3 , . . . , xn ].
Let P (x1 , . . . , xn ) = Pm (x1 , x3 , . . . , xn )xm
2 + + P1 (x1 , x3 , . . . , xn )x2 + P0 (x1 ,
x3 , . . . , xn ). Following the same arguments as the above case, we have that the
highest degree of x2 in H1 , H2 are in K[x3 , . . . , xn ].

Corollary 2.10. Let H = (H1 , H2 ) K[x1 , x2 ] be a polynomial map. If JH is

nilpotent, then the coefficients of the highest degree of xj in H1 , H2 are in K for
j = 1, 2. In particular, If Hixj 6= 0, then the coefficient of the highest degree of xj
in Hi are in K for i, j = 1, 2.

Remark 2.11. In Lemma 2.9, we mean that the coefficients are in K[x2 , . . . , xn ]
when mentioning the coefficients of xi10 and the coefficients are in K[x1 , x3 , . . . , xn ]
when mentioning the coefficients of xj20 .

Corollary 2.12. Let H = (H1 , H2 ) K[x1 , x2 ] be a polynomial map with H(0) =

0 and f = x1 +H1 , g = x2 +H2 . If JH is nilpotent, then f = x1 H2 , g = x2 +H2 ,
where H2 = H2 (x1 + x2 ) K[x1 + x2 ], K or f = x1 + H1 (x2 ), g = x2 with
H1 (x2 ) K[x2 ].

Proof. Since JH is nilpotent, so we have the following equations:

H1x + H2x = 0 (2.26)
1 2

H
1x1 H2x2 H1x2 H2x1 = 0 (2.27)

It follows from equation (2.27) and Lemma 3.1 in [18] that there exists q
K[x1 , x2 ] such that H1 , H2 K[q]. Thus, it follows from equation (2.26) that
H1q qx1 + H2q qx2 = 0. That is,

H1q qx1 = H2q qx2 (2.28)

If qx1 = 0, then H1x1 = 0 = H2x1 . It follows from equation (2.26) that H2x2 = 0.
Since H(0) = 0, so we have f = x1 + H1 (x2 ), g = x2 with H1 (x2 ) K[x2 ].
If qx1 6= 0, then it follows from equation (2.28) that qx1 |H2q qx2 . It follows from
Corollary 2.10 that the coefficients of the highest degree of x1 in H1 , H2 are non-
zero constants. Since H1 , H2 K[q], so the coefficients of the highest degree of
x1 in q is a non-zero constant. Since H2q K[q], so it follows from Lemma 2.3(2)
that qx1 |qx2 . It follows from Lemma 2.1(2) that q K[x1 + b(x2 )] for some b(x2 )
K[x2 ]. That is, H1 , H2 K[x1 + b(x2 )]. Let = x1 + b(x2 ). Then we can assume
that H1 = an n + an1 n1 + + a1 + a0 , H2 = bm m + bm1 m1 + + b1 + b0
with ai , bj K, 0 i n, 0 j m. It follows from equation (2.26) that

nan n1 + + a1 + b (x2 )(mbm m1 + + b1 ) = 0 (2.29)

Thus, we have n = m by comparing the degree of x1 of equation (2.29). We view

that the polynomials are in K[x2 ][x1 ] with coefficients in K[x2 ] when comparing
the coefficients of the degree of x1 . Comparing the coefficients of x1n1 of equation
(2.29), we have the following equation:

nan = mbm b (x2 ).

Thus, we have b (x2 ) = (mbm )1 nan K. Therefore, we have b(x2 ) = x2 + 0 ,

where , 0 K. Then H1 , H2 K[x1 + x2 + 0 ]. That is, H1 , H2 K[x1 + x2 ]
and deg H1 = deg H2 . It follows from equation (2.26) that H1 + H2 = 0. That
is, H1 = H2 . Thus, we have H1 = H2 + c for some c K. Since H(0) = 0,
so we have c = 0. Then the conclusion follows.

Remark 2.13. Corollary 2.12 is also a conclusion of Theorem 7.2.25 in [8].

3 Polynomial maps of the form H = (H1(x1, x2, . . . ,

xn), H2(x1, x2), . . . , Hn(x1, x2))
In this section, we first classify all polynomial maps of the form H = (H1 (x1 , x2 ,
. . . , xn ), H2 (x1 , x2 ), . . . , Hn (x1 , x2 )) in the case that JH is nilpotent, the compo-
nents of H are linearly independent and H(0) = 0. Then we classify all polyno-
mial maps of the form H = (H1 (x1 , x2 , . . . , xn ), H2 (x1 , x2 ), . . . , Hn (x1 , x2 )) with
JH nilpotent.

Proposition 3.1. Let H = (H1 (x1 , x2 , . . . , xn ), H2 (x1 , x2 ), . . . , Hn (x1 , x2 )) be a

polynomial map over K[x] with H(0) = 0. Assume that the components of H
are linearly independent. If JH is nilpotent, then H = (H11 (1 x3 + 2 x4 + +
n2 xn ) a1 b (x2 )g(ax1 + b(x2 )) H11 l2 x2 , g(ax1 + b(x2 )), H3 (x1 , x2 ), . . . , Hn (x1 ,
x2 )), where 1 H3 + 2 H4 + + n2 Hn = c0 H22 + l2 H2 , b(x2 ) = H11 c0 ax22 +
l1 x2 + l2 , H11 , c0 , a K , l1 , l2 , l2 K, g(t) K[t] and g(0) = 0, deg g(t) 1,
1 , . . . , n2 K.

Proof. Since JH is nilpotent, so we have the following equations:

H1x1 + H2x2 = 0 (3.1)

H1x1 H2x2 H1x2 H2x1 H1x3 H3x1 H1xn Hnx1 = 0 (3.2)



H (H H H H ) + + H (H H H H ) = 0 (3.3)
1x 2x 3x 2x 3x 1x 2x nx 2x nx
Let H1 (x1 , x2 , . . . , xn ) = H1n (x1 , x2 )P (n) (x3 , . . . , xn ) + H1(n1) (x1 , x2 )P (n1) (x3 ,
. . . , xn ) + + H11 (x1 , x2 )P (1) (x3 , . . . , xn ) + H10 (x1 , x2 ), where H1n (x1 , x2 ) 6= 0
and P (j) is homogeneous of degree j of x3 , . . . , xn . It follows from equation (3.1)
that
H1nx1 = H1(n1)x1 = = H11x1 = 0 (3.4)
and
H10x1 + H2x2 = 0 (3.5)
It follows from equations (3.2) and (3.4) that H10x1 H2x2 (H1nx2 P (n) +H1(n1)x2 P (n1)
(n) (n1) (1)
+ + H11x2 P (1) + H10x2 )H2x1 (H1n Px3 + H1(n1) Px3 + + H11 Px3 )H3x1
(n) (n1) (1)
(H1n Pxn + H1(n1) Pxn + + H11 Pxn )Hnx1 = 0 (3.6)
We always view that the polynomials are in K[x1 , x2 ][x3 , . . . , xn ] with coefficients
in K[x1 , x2 ] when comparing the coefficients of xi33 xinn . Comparing the coeffi-
cients of P (n) of equation (3.6), we have the following equation:

H1nx2 H2x1 = 0 (3.7)

Thus, we have H2x1 = 0 or H1nx2 = 0.

If H2x1 = 0, then it follows from equation (3.6) that

P (i) H3x + P (i) H4x + + P (i) Hnx = 0 (3.8)
x3 1 x4 1 xn 1

H
10x1 H2x2 H11 (Px(i)
3
H3x1 + Px(i)
4
H4x1 + + Px(i)
n
Hnx1 ) = 0 (3.9)
for 2 i n.
If H1i = 0, then H1 doesnt contain the term P (i) (x3 , . . . , xn ). Thus, equation
(3.8) doesnt exist in the case H1i = 0. It follows from equation (3.3) that
(n) (n1) (1) (n) (n1)
H2x2 [(H1n Px3 + H1(n1) Px3 + + H11 Px3 )H3x1 + (H1n Px4 + H1(n1) Px4 +
(1) (n) (n1) (1)
+ H11 Px4 )H4x1 + + (H1n Pxn + H1(n1) Pxn + + H11 Pxn )Hnx1 ] = 0
(3.10)
It follows from equation (3.10) that

H2x2 (Px(j)
3
H3x1 + Px(j)
4
H4x1 + + Px(j)
n
Hnx1 ) = 0
(j) (j) (j)
for 1 j n. That is, H2x2 = 0 or Px3 H3x1 + Px4 H4x1 + + Pxn Hnx1 = 0 for
1 j n.
(j) (j) (j)
If Px3 H3x1 + Px4 H4x1 + + Pxn Hnx1 = 0 for 1 j n, then it follows from
equations (3.5) and (3.9) that

H10x1 = H2x2 = 0.

Since H(0) = 0, so we have H2 = 0. Thus, H1 , . . . , Hn are linearly dependent.

This is a contradiction! Therefore, we have H2x1 6= 0.
It follows from equation (3.7) that H1nx2 = 0. That is, H1n K . It follows
from equation (3.6) that

H1(n1)x H2x1 P (n1) H1n H3x1 P (n) H1n Hnx1 P (n) = 0 (3.11)
It follows from equation (3.3) that
(n) (n1) (1) (n)
(H1n Px3 +H1(n1) (x2 )Px3 + +H11 (x2 )Px3 )(H2x1 H3x2 H2x2 H3x1 )+(H1n Px4 +
(n1) (1) (n)
H1(n1) (x2 )Px4 + + H11 (x2 )Px4 )(H2x1 H4x2 H2x2 H4x1 ) + + (H1n Pxn +
(n1) (1)
H1(n1) (x2 )Pxn + + H11 (x2 )Pxn )(H2x1 Hnx2 H2x2 Hnx1 ) = 0 (3.12)
It follows from equation (3.12) that

(H2x1 H3x2 H2x2 H3x1 )Px(j)

3
+ + (H2x1 Hnx2 H2x2 Hnx1 )Px(j)
n
=0 (3.13)

for 1 j n. If H1i = 0, then H1 doesnt contain the term P (i) (x3 , . . . , xn ). Thus,
equation (3.13) doesnt exist in the case H1i = 0. Since P (j) 6= 0 for 1 j n,
(n) (n) (n)
so at least one of Px3 , Px4 , . . . , Pxn is non-zero. Comparing the coefficients of
xj33 xjnn with j3 + + jn = n 1 of equation (3.11), we have the following
equation:

H1(n1)x2 H2x1 e H1n (e1 H3x1 + e2 H4x1 + + en2 Hnx1 ) = 0,

where e, e1 , . . . , en2 K and at least one of e1 , . . . , en2 is non-zero. That is,

e
e1 H3x1 + e2 H4x1 + + en2 Hnx1 = H1(n1)x2 H2x1 (3.14)
H1n
If n 2, then we have

e1 H3 + e2 H4 + + en2 Hn = eH1(n1)x2 H2 + g(x2 ) (3.15)

by integrating with respect to x1 of equation (3.14), where g(x2 ) K[x2 ], e =

e
H1n
K. It follows from equation (3.15) that

e1 H3x2 +e2 H4x2 + +en2 Hnx2 = eH1(n1)x2 x2 H2 +eH1(n1)x2 H2x2 +g (x2 ) (3.16)

Comparing the coefficients of xj33 xjnn of equation (3.13)(j = m), we have the
following equation:

H2x1 (e1 H3x2 +e2 H4x2 + +en2 Hnx2 ) = H2x2 (e1 H3x1 +e2 H4x1 + +en2 Hnx1 ) (3.17)

Substituting equation (3.14) to equation (3.17), we have the following equation:

e1 H3x2 + e2 H4x2 + + en2 Hnx2 = eH1(n1)x2 H2x2 (3.18)

Substituting equation (3.18) to equation (3.16), we have eH1(n1)x2 x2 = 0 and

g (x2 ) = 0. That is, H1(n1)x2 , g(x2 ) K or e = 0 and g(x2 ) K. Since H(0) = 0,
so we have g(x2 ) = 0. Then it follows from equation (3.15) that

eH1(n1)x2 H2 + e1 H3 + e2 H4 + + en2 Hn = 0.

That is, H2 , . . . , Hn are linearly dependent. This is a contradiction. Thus, we have

n 1.
 If n = 0, then it is easy to compute that H1 = a2 g(a1 x1 + a2 x2 ), H2 =
a1 g(a1 x1 +a2 x2 ), Hk = Hk (x1 , x2 ) for 3 k n, a1 , a2 K. Thus, H1 , H2 , . . . , Hn
are linearly dependent. This is a contradiction! Therefore, we have n = 1. Con-
sequently, we have H1 (x1 , x2 , . . . , xn ) = H11 (x1 , x2 )P (1) (x3 , . . . , xn ) + H10 (x1 , x2 ).
It follows from equation (3.6) that
H11x2 = 0 (3.19)
and
H10x1 H2x2 H10x2 H2x1 H11 (Px(1)
3
H3x1 + + Px(1)
n
Hnx1 ) = 0 (3.20)
It follows from equations (3.4), (3.5), (3.19), (3.20), (3.3) that

H10x1 + H2x2 = 0 (3.21)

H10x1 H2x2 H10x2 H2x1 H11 (Px(1)

3
H3x1 + + Px(1)
n
Hnx1 ) = 0 (3.22)

H [H (P (1) H + + P (1) H ) H (P (1) H + + P (1) H

11 2x1 x3 3x2 xn nx2 2x2 x3 3x1 xn nx1 )] = 0 (3.23)

(1) (1) (1)
where H11 K . Let 1 = Px3 , 2 = Px4 , . . . , n2 = Pxn K, H = (H11 z +
H10 (x1 , x2 ), H2 , 1 H3 +2 H4 + +n2 Hn ), where z = 1 x3 +2 x4 + +n2 xn .
It follows from equations (3.21), (3.22), (3.23) that Jx1 ,x2 ,z H is nilpotent. Then
it follows from Corollary 2.7 that


H1 = H11 (1 x3 + 2 x4 + + n2 xn ) a1 b (x2 )g(ax1 + b(x2 )) H11 l2 x2






H2 = g(ax1 + b(x2 ))

H3 = H3 (x1 , x2 )


..
.






Hn = Hn (x1 , x2 )

where 1 H3 + 2 H4 + + n2 Hn = c0 H22 + l2 H2 , b(x2 ) = H11 c0 a x22 + l1 x2 + l2 ,

H11 , c0 , a K , l1 , l2 , l2 K, g(t) K[t], 1 , 2 , . . . , n2 K and g(0) = 0,
deg g(t) 1.
Corollary 3.2. Let F = x + H be a polynomial map over K[x1 , . . . , xn ], where
H = (H1 (x1 , . . . , xn ), H2 (x1 , x2 ), . . . , Hn (x1 , x2 )) and H is homogeneous, Hk (x1 ,
x2 ) K[x1 , x2 ] for 2 k n. If det JF = 1, then the components of H are
linearly dependent.
Proof. Since det JF = 1 and H is homogeneous, so JH is nilpotent. Then the
conclusion follows from Proposition 3.1.

Next, we classify all polynomial maps of the form H = (H1 (x1 , x2 , . . . , xn ),

H2 (x1 , x2 ), . . . , Hn (x1 , x2 )) with JH nilpotent. In the proof of Theorem 3.3, we di-
vide two parts according to the degree of x3 , . . . , xn of H1 . Part I: degx3 ,...,xn H1 =
0; Part II: degx3 ,...,xn H1 1. In the second part, we divide two cases according
to whether H2x1 = 0. We have three subcases in the case that H2x1 6= 0.
Theorem 3.3. Let H = (H1 (x1 , x2 , . . . , xn ), H2 (x1 , x2 ), . . . , Hn (x1 , x2 )) be a poly-
nomial map over K[x] with H(0) = 0. If JH is nilpotent, then there exists
T GLn (K) such that T HT 1 has one of the following forms:
(i) T HT 1 = (H1 (x2 , x3 , . . . , xn ), 0, H3 (x2 ), . . . , Hn (x2 )), where H1 K[x2 , x3 ,
. . . , xn ], Hi K[x2 ] for 3 i n.
(ii) T HT 1 = (H1 (x2 , xk+3 , . . . , xn ), 0, H3(x1 , x2 ), . . . , Hn (x1 , x2 )), where Hl+2
d1l
d
H3 dd2l H4 ddkl Hk+2 = glk (x2 ) K[x2 ], H1 K[x2 , xk+3 , . . . , xn ],
xl+2 = xl+2 dd1l x3 dd2l x4 ddkl xk+2 for k + 1 l n 2, 1 k n 2,
Hi K[x1 , x2 ] for 3 i n, dd1l , dd2l , . . . , ddkl K.
(iii) T HT 1 = (L1 (xk+2 , . . . , xn )+L2 (xk+3 , . . . , xn )+H11 (1 x3 +2 x4 + +
n2 xn )a1 b (x2 )g(ax1 +b(x2 ))H11 l2 x2 , g(ax1 +b(x2 )), H3 (x1 , x2 ), . . . , Hn (x1 , x2 )),
where H+1 DD1 H2 DD2 H3 DDk Hk+1 = 0 for k + 1 n 1,
D
1 k n 1, k = k or k 1, H+1 DD1 H3 DD2 H4 Dk Hk+2 = 0
for k + 2 n 1, 1 H3 + 2 H4 + + n2 Hn = c0 H22 + l2 H2 , b(x2 ) =
H11 c0 ax22 + l1 x2 + l2 , H11 , c0 , a K , l1 , l2 , l2 , 1 , . . . , n2 K. g(t) K[t]
and g(0) = 0, deg g(t) 1, x+1 = x+1 DD1 x2 DD2 x3 DDk xk+1 , x+1 =
D
n ],
x+1 DD1 x3 DD2 x4 Dk xk+2 , L1 K[xk+2 , . . . , xn ], L2 K[xk+3 , . . . , x
D1 Dk D1 Dk
Hi K[x1 , x2 ] for 3 i n, D , . . . , D , D , . . . , D K.
(iv) T HT 1 = (L1 (xk+2 , . . . , xn ) + L2 (xk+3 , . . . , xn ) + H11 (1 x3 + 2 x4 + +
n2 xn x2 ) a2 P (a1 x1 + a2 x2 ), a1 P (a1 x1 + a2 x2 ), H3 (x1 , x2 ), . . . , Hn (x1 , x2 )),
where H+1 DD1 H2 DD2 H3 DDk Hk+1 = 0 for k+1 n1, 1 k n
D
1, k = k or k 1, H+1 DD1 H3 DD2 H4 Dk Hk+2 = 0 for k +2 n1,
H11 (1 H3 + +n2 Hn H2) = 0, H11 , , a1 , a2 , 1 , . . . , n2 K. P (t) K[t]
and P (0) = 0, deg P (t) 1, x+1 = x+1 DD1 x2 DD2 x3 DDk xk+1 , x+1 =
D
n ],
x+1 DD1 x3 DD2 x4 Dk xk+2 , L1 K[xk+2 , . . . , xn ], L2 K[xk+3 , . . . , x
D
Hi K[x1 , x2 ] for 3 i n, DD1 , . . . , DDk , DD1 , . . . , Dk K.
In particular, F = x + H is invertible.
Remark 3.4. If L1 = 0, then the equation H+1 DD1 H2 DD2 H3 DDk Hk+1 =
0 disappears for k + 1 n 1, 1 k n 1 in (iii), (iv) of Theorem 3.3. If
D
L2 = 0, then the equation H+1 DD1 H3 DD2 H4 Dk Hk+2 = 0 disappears
for k + 2 n 1, k = k or k 1 in (iii), (iv) of Theorem 3.3.
Proof. Since JH is nilpotent, so we have the following equations:



H1x1 + H2x2 = 0 (3.1)

H1x1 H2x2 H1x2 H2x1 H1x3 H3x1 H1xn Hnx1 = 0 (3.2)



H (H H H H ) + + H (H H H
1x3 2x1 3x2 2x2 3x1 1xn 2x1 nx2 2x2 Hnx1 ) = 0 (3.3)

Let H1 (x1 , x2 , . . . , xn ) = H1n (x1 , x2 )P (n) (x3 , . . . , xn ) + H1(n1) (x1 , x2 )P (n1) (x3 ,
. . . , xn ) + + H11 (x1 , x2 )P (1) (x3 , . . . , xn ) + H10 (x1 , x2 ), where H1n (x1 , x2 ) 6= 0
and P (j) is homogeneous of degree j of x3 , . . . , xn for 1 j n.
 (I) If n = 0, then H1 (x1 , x2 , . . . , xn ) = H10 (x1 , x2 ) K[x1 , x2 ]. It follows from
equations (3.1), (3.2), (3.3) that

H1x + H2x = 0
1 2

H
1x1 H2x2 H1x2 H2x1 = 0

That is, Jx1 ,x2 (H1 , H2 ) is nilpotent. It follows from Corollary 2.12 or Theorem
7.2.25 in [8] that H1 = a2 P (a1 x1 + a2 x2 ), H2 = a1 P (a1 x1 + a2 x2 ), where a1 , a2
K, P (t) K[t]. Consequently, we have


H1 = a2 P (a1 x1 + a2 x2 )






H2 = a1 P (a1 x1 + a2 x2 )

H3 = H3 (x1 , x2 )


..
.






Hn = Hn (x1 , x2 )

where P (t) K[t], a1 , a2 K.

(II) If n 1, then it follows from equation (3.1) that

H1nx1 = H1(n1)x1 = = H11x1 = 0 (3.4)

and
H10x1 + H2x2 = 0 (3.5)
It follows from equations (3.2) and (3.4) that H10x1 H2x2 (H1nx2 P (n) +H1(n1)x2 P (n1)
(n) (n1) (1)
+ + H11x2 P (1) + H10x2 )H2x1 (H1n Px3 + H1(n1) Px3 + + H11 Px3 )H3x1
(n) (n1) (1)
(H1n Pxn + H1(n1) Pxn + + H11 Pxn )Hnx1 = 0 (3.6)
We always view that the polynomials are in K[x1 , x2 ][x3 , . . . , xn ] with coefficients
in K[x1 , x2 ] when comparing the coefficients of xi33 xinn . Comparing the coeffi-
cients of P (n) of equation (3.6), we have the following equation:

H1nx2 H2x1 = 0 (3.7)

Thus, we have H2x1 = 0 or H1nx2 = 0.

(i) If H2x1 = 0, then it follows from equation (3.6) that

P (i) H3x + P (i) H4x + + P (i) Hnx = 0 (3.8)
x3 1 x4 1 xn 1

H
10x1 H2x2 H11 (Px(i)
3
H3x1 + Px(i)
4
H4x1 + + Px(i)
n
Hnx1 ) = 0 (3.9)

for 2 i n.
If H1i = 0, then H1 doesnt contain the term P (i) (x3 , . . . , xn ). Thus, equation
(3.8) doesnt exist in the case H1i = 0. It follows from equation (3.3) that
(n) (n1) (1) (n) (n1)
H2x2 [(H1n Px3 + H1(n1) Px3 + + H11 Px3 )H3x1 + (H1n Px4 + H1(n1) Px4 +
(1) (n) (n1) (1)
+ H11 Px4 )H4x1 + + (H1n Pxn + H1(n1) Pxn + + H11 Pxn )Hnx1 ] = 0
(3.10)
It follows from equation (3.10) that

H2x2 (Px(j)
3
H3x1 + Px(j)
4
H4x1 + + Px(j)
n
Hnx1 ) = 0
(j) (j) (j)
for 1 j n. That is, H2x2 = 0 or Px3 H3x1 + Px4 H4x1 + + Pxn Hnx1 = 0 for
1 j n.
(j) (j) (j)
If Px3 H3x1 + Px4 H4x1 + + Pxn Hnx1 = 0 for 1 j n, then it follows from
equations (3.5) and (3.9) that

H10x1 = H2x2 = 0.

If H2x2 = 0, then it follows from equation (3.5) that H10x1 = 0.

Since H(0) = 0, so we have H2 = 0. Then it follows from equations (3.8), (3.9)
that
Px(j)
3
H3x1 + Px(j)
4
H4x1 + + Px(j)
n
Hnx1 = 0 (3.24)
for 1 j n.
If H3x1 = H4x1 = = Hnx1 = 0, then Hi = Hi (x2 ) K[x2 ] for 3 i n.
Consequently, we have

H1 = H1 (x2 , x3 , . . . , xn )







H2 = 0

H3 = H3 (x2 )


..
.






Hn = Hn (x2 )

where H1 K[x2 , x3 , . . . , xn ], Hi K[x2 ] for 3 i n.

If there exists at least one of H3x1 , . . . , Hnx1 that is non-zero, then we can
assume that m is the minimal integer such that H(s+2)x1 = H(s+2)m +H(s+2)(m1) +
+ H(s+2)1 for 1 s n 2 and

H3t : H4t : : Hnt = t1 : t2 : : t(n2) (3.25)

for ts K, 1 t m, 1 s n 2. Let

12 1(n2)
11
22 2(n2)
21
A= . = (ts )m(n2) .

.. .. .. ..
. . .

m1 m2 m(n2)
It is easy to see that m 1. Suppose rank(A) = k.
(1) Without loss of generality, we can assume that H3t 6= 0 for 1 t m
(If H3t0 = 0 for some t0 {1, 2, . . . , m}, then we can replace H3 by a linear
(j)
combination of H3 , . . . , Hn ). It follows from equation (3.24) that H31 (11 Px3 +
(j) (j) (j) (j) (j)
12 Px4 + + 1(n2) Pxn ) + H32 (21 Px3 + 22 Px4 + + 2(n2) Pxn ) + +
(j) (j) (j)
H3m (m1 Px3 + m2 Px4 + + m(n2) Pxn ) = 0. Since m is the minimal integer
that satisfies the conditions, so H31 , . . . , H3m are linearly independent. Thus, we
have the following equations:


11 Px(j)3
+ 12 Px(j)
4
+ + 1(n2) Px(j)
n
=0


21 Px(j) + 22 Px(j) + + 2(n2) Px(j) = 0


3 4 n

.
..




m1 Px(j) + m2 Px(j) + + m(n2) Px(j)

=0

3 4 n

(j)
for 1 j n. If k n 2, then it follows from the above equations that Px3 =
(j) (j)
Px4 = = Pxn = 0 for 1 j n. That is, H1x3 = H1x4 = = H1xn = 0.
Thus, we have n = 0. It reduces to (I).
(2) If 1 k n 3, then without loss of generality, we can assume that
d = | |kk 6= 0. Since rank(A) = k, so it follows from the arguments of (i)(1)
that equation (3.24) is equivalent to the following equations


11 Px(j)
3
+ 12 Px(j)
4
+ + 1(n2) Px(j)
n
=0


21 Px(j) + 22 Px(j) + + 2(n2) Px(j) = 0


3 4 n

.
..




k1 Px(j) + k2 Px(j) + + k(n2) Px(j)

=0

3 4 n

(j) (j)
(j) d1 (j) d2 (j)
for 1 j n. By Cramers rule, we have that Px3 = d
, Px 4 = d
,. . . ,Pxk+2 =
(j)
dk
d
, where
 
(j) (j)
11 1(k+1) Pxk+3 ++ 1(n2) Pxn 1(t+1) 1k 
 

(j) (j)
 
(j)
 21 2(k+1) Pxk+3 ++ 2(n2) Pxn 2(t+1) 2k 
dt = 

.. .. .. .. .. .. 

 . . . . . . 
(j) (j)
k1 k(k+1) Pxk+3 + + k(n2) Pxn k(t+1) kk 
 


for 1 t k, 1 j n. Let
 
 11 1l 1(t+1) 1k
 

 
 21 2l
2(t+1) 2k 
dtl =  .
 
 .. . .
. . .. .
.. . .. .. 
 . 

 k1 kl k(t+1) kk
 

for 1 t k, k + 1 l n 2. Then
dt(k+1) (j) dt(k+2) (j) dt(n2) (j)
Px(j) = ( Pxk+3 + Pxk+4 + + Px n ) (3.26)
t+2
d d d
for 1 t k, 1 j n. Let x1 = x1 , x2 = x2 , x3 = x3 ,. . . , xk+2 = xk+2 ,
xl+2 = xl+2 dd1l x3 dd2l x4 ddkl xk+2 for k + 1 l n 2. It follows from
equation (3.26) that P (j) K[xk+3 , . . . , xn ] for 1 j n. Since at least one of
t1 , t2 , . . . , t(n2) is non-zero, so without loss of generality, we can assume that
t1 6= 0 for 1 t m. Then it follows from equation (3.25) that

t
H(+2)t = H3t (3.27)
t1
for 2 n, 1 t m. Thus, we have

d1l dkl tl d1l d2l t2 dkl tk

H(l+2)t H3t H(k+2)t = ( )H3t
d d t1 d t1 d t1 d
1
= (tl d t1 d1l tk dkl )H3t
t1 d
 

 tl t1 t2 tk 
 
 1l 11 12 1k 
1 
= 2l 21 22 2k  H3t

t1 d 

.. .. .. .. .. 

 . . . . . 
 
 kl kl k2 kk 

for 1 t m, k + 1 l n 2.
If 1 t k, then  
 t2 tk 
 tl t1
 
 1l 11 12 1k 

 2l 21 22 2k  = 0
 
 . .. .. .. .. 
 .. . . . . 

 
 kl kl k2 kk 

for k + 1 l n 2.
If k + 1 t m, then
   
 t2 tk   11 12 1k 1l 
 tl t1
   
 1l 11 12 1k   21 22 2k 2l 
.. .. .. . 

..
 2l 21 22 2k  =  . . . . .. 
  
 . .. .. .. ..   
 .. . . . .   kl k2 kk kl 

   
 kl kl k2 kk   t1 t2 tk tl 
for k + 1 l n 2, which is a (k + 1) (k + 1)-subdeterminant of A. Since
rank(A) = k, so we have
 
 t1 t2 tk 
 tl
 
 1l 11 12 1k 

 2l 21 22 2k  = 0
 
 . .. .. .. .. 
 .. . . . . 

 
 kl kl k2 kk 

for k + 1 l n 2. Thus, we have

d1l dkl
H(l+2)t H3t H(k+2)t = 0
d d
for 1 t m, k + 1 l n 2. Then we have
d1l dkl
H(l+2)x1 H3x1 H(k+2)x1 = 0 (3.28)
d d
for k + 1 l n 2. Thus, we have
d1l dkl
Hl+2 H3 Hk+2 = glk (x2 )
d d
by integrating with respect to x1 of equation (3.28), where glk (x2 ) K[x2 ],
k + 1 l n 2. Consequently, we have


H1 = H1 (x2 , xk+3, . . . , xn )






H2 = 0

H3 = H3 (x1 , x2 )


..
.






Hn = Hn (x1 , x2 )

where Hl+2 dd1l H3 dd2l H4 ddkl Hk+2 = glk (x2 ) K[x2 ], H1 K[x2 , xk+3 ,
. . . , xn ], xl+2 = xl+2 dd1l x3 dd2l x4 ddkl xk+2 for k+1 l n2, 1 k n3.

(ii) If H2x1 6= 0, then H1nx2 = 0. It follows from equation (3.4) that H1nx1 = 0.
That is, H1n K . It follows from equation (3.6) that


H1(n1)x2 H2x1 P (n1) H1n (Px(n)
3
H3x1 + + Px(n)
n
Hnx1 ) = 0 (1 )


H1(n2)x2 H2x1 P (n2) H1(n1) (Px(n1) H3x1 + + Px(n1)




3 n
Hnx1 ) = 0 (2 )
.. ..

. .


H11x2 H2x1 P (1) H12 (Px(2) H3x1 + + Px(2)

Hnx1 ) = 0 (n1 )



3 n


H10x H2x H10x H2x H11 (P (1) H3x + + P (1) Hnx ) = 0 (n )

It follows from equation (3.3) that
(n) (n1) (1) (n)
(H1n Px3 + H1(n1) )Px3 + + H11 Px3 )(H2x1 H3x2 H2x2 H3x1 ) + (H1n Px4 +
(n1) (1) (n) (n1)
H1(n1) )Px4 + +H11 Px4 )(H2x1 H4x2 H2x2 H4x1 )+ +(H1n Pxn +H1(n1) )Pxn
(1)
+ + H11 Pxn )(H2x1 Hnx2 H2x2 Hnx1 ) = 0 (3.29)
It follows from equation (3.29) that

(H2x1 H3x2 H2x2 H3x1 )Px(j)

3
+ + (H2x1 Hnx2 H2x2 Hnx1 )Px(j)
n
=0 (3.30)

for 1 j n. Without loss of generality, we can assume that H1i 6= 0 in the

following arguments for 2 i n. It follows from equation (1 ) to (n1 ) that

H1(i1)x2 (i1)
Px(i) H3x1 + Px(i) H4x1 + + Px(i) Hnx1 = P H2x1 (3.31)
3 4 n
H1i

for 2 i n. Then we have the following equation

H1(i1)x2 (i1)
Px(i) H3 + Px(i) H4 + + Px(i) Hn = P H2 + gi (x2 ) (3.32)
3 4 n
H1i

by integrating with respect to x1 of equation (3.31), where gi (x2 ) K[x2 ]. It

follows from equation (3.32) that

H1(i1)x2 (i1) H1(i1)x2 (i1)

Px(i) H3x2 + +Px(i) Hnx2 = P H2x2 +( )P H2 +gi (x2 ) (3.33)
3 n
H1i H1i

for 2 i n. Substituting equation (3.31) to equation (3.30), we have the

following equations

H1(i1)x2 (i1)
Px(i) H3x2 + + Px(i) Hnx2 = P H2x2 (3.34)
3 n
H1i
H1(i1)x2
Substituting equation (3.34) to equation (3.33), we have ( H1i
) = 0 and
H1(i1)x2
gi (x2 ) = 0. That is, H1i
K and gi (x2 ) K. Since H(0) = 0, so it follows
from equation (3.32) that gi (x2 ) = 0 for 2 i n. It follows from equations
(3.5), (n ), (3.30), (3.32) that



H10x1 + H2x2 = 0 (3.5)

H10x1 H2x2 H10x2 H2x1 H11 (Px(1) H3x1 + + Px(1)

Hnx1 ) = 0 (n )


3 n

H2x1 (H3x2 Px(1)
3
+ + Hnx2 Px(1)
n
) = H2x2 (H3x1 Px(1)
3
+ + Hnx1 Px(1)
n
) (3.35)

H1(i1)x2 (i1)


Px(i) H3 + Px(i) H4 + + Px(i)

Hn = P H2 (3.36)
3 4 n
H1i
H H1(i1)x2
where 1(i1)x
H1i
2
K, 2 i n. Let ci = H1i
for 2 i n. Then equation
(3.36) has the following form:

ci H2 P (i1) + H3 P (i) + + Hn P (i) = 0 (3.37)

for 2 i n. Let r be the minimal integer such that Hi = Hir +Hi(r1) + +Hi1
for 2 i n and

H2 : H3 : : Hn = 1 : 2 : : (n1) (3.38)

for K, 1 r, 1 n 1. Let

1(n1)
11 12
21 22 2(n1)
B= . = ( )r(n1) .

.. .. .. ..
. . .

r1 r2 r(n1)
r(n1)

Since H2x1 6= 0, so we have r 1. Suppose that rank(B) = k and

c 1(n1)
i 11 12
c
i 21 22 2(n1)
Bi = . .

.. .. .. ..
. . .

ci r1 r2 r(n1)
r(n1)

for 2 i n. It is easy to see that rank(Bi ) = rank(B) in the case ci 6= 0 for

2 i n and rank(B)1 rank(Bi ) rank(B) in the case ci = 0 for 2 i n.

(a) Suppose that c2 c3 cn 6= 0. Then rank(Bi ) = rank(B) = k for 2 i n.

(a.1) If k n 1, then it follows from equation (3.37) and the arguments of
(i)(1) that


ci 11 P (i1) + 12 Px(i)
3
+ 13 Px(i)
4
+ + 1(n1) Px(i)
n
=0


ci 21 P (i1) + 22 Px(i) + 23 Px(i) + + 2(n1) Px(i) = 0


3 4 n

.
..




ci r1 P (i1) + r2 Px(i) + r3 Px(i) + + r(n1) Px(i)

=0

3 4 n

for 2 i n. Since rank(Bi ) = rank(B) = k, so it follows from the above

(i) (i) (i)
equations that Px3 = Px4 = = Pxn = 0 for 2 i n and P (1) = 0. That is,
H1x3 = H1x4 = = H1xn = 0. Thus, we have n = 0. It reduces to (I).
(a.2) If 1 k n 2, then H2 6= 0 because H2x1 6= 0. Thus, at least one
of 11 , 21 , . . . , r1 is non-zero. Since rank(Bi ) = rank(B) = k for 2 i n, so
we can assume that a non-zero k k-subdeterminant of Bi contains the column
(ci 11 , ci 21 , . . . , ci k1 )T in Bi for 2 i n. Without loss of generality, we can
assume that  
 ci 11 12 1k 
 
 
 ci 21 22 2k 
..  := ci D 6= 0.
 
 . .. ..
 .. . . . 

 ci k1 k2 kk 
 
where D = | |kk , 2 i n. It follows from the arguments of (i)(1) that
equation (3.37) is equivalent to the following equations


ci 11 P (i1) + 12 Px(i)
3
+ 13 Px(i)
4
+ + 1(n1) Px(i)
n
=0


ci 21 P (i1) + 22 Px(i) + 23 Px(i) + + 2(n1) Px(i) = 0


3 4 n

..



.

ci k1P (i1) + k2 Px(i) + k3 Px(i) + + k(n1) Px(i)

=0

3 4 n

(i) (i)
D1 (i) D2
for 2 i n. By Cramers rule, we have that P (i1) = ci D
, Px 3 = D
, ...,
(i)
(i) Dk
Pxk+1 = D
for 2 i n, where
 
(i) (i)
 11 1(k+1) Pxk+2 + + 1(n1) Pxn 1(+1) 1k
 

(i) (i)
 
 21
2(k+1) Pxk+2 + + 2(n1) Pxn 2(+1) 2k 
(i)
D =  .
 
 .. .. .. .. .. .. 
 . . . . . 

(i) (i)
 k1 k(k+1) Pxk+2 + + k(n1) Pxn k(+1) kk
 


for 1 k, 2 i n. Let
 
 11 1 1(+1) 1k
 

 
 21 2
2(+1) 2k

D =  .
 
 .. . .. .
.. .. .. .. 
 . . . 

 k1 k k(+1) kk
 


for 1 k, k + 1 n 1. Then
D1(k+1) (i) D1(k+2) (i) D1(n1) (i)
P (i1) = ( Pxk+2 + Pxk+3 + + Px n ) (3.39)
ci D ci D ci D
and
D(k+1) D(k+2) D(n1)
Px(i) = ( Px(i) + Px(i) ++ Px(i) ) (3.40)
+1 D k+2
D k+3
D n

for 2 k, 2 i n. Let x1 = x1 , x2 = x2 , x3 = x3 ,. . . , xk+1 = xk+1 ,

x+1 = x+1 DD2 x3 DD3 x4 DDk xk+1 for k + 1 n 1. It follows from
equation (3.40) that P (i) K[xk+2 , . . . , xn ] for 2 i n. It follows from equation
(3.39) that P (1) K[xk+2 , . . . , xn ]. Since at least one of 1 , 2 , . . . , (n1) is
non-zero, so without loss of generality, we can assume that 1 6= 0 for 1 r.
Then it follows from equation (3.38) that

H(+1) = H2
1

for 2 n 1, 1 r. Thus, we have

 D1 Dk D1 D2 2 Dk k
H(+1) H2 H(k+1) = ( )H2
D D 1 D 1 D 1 D
1
= ( D 1 D1 k Dk )H2
1 D
 

 1 2 k 
 
 1 11 12 1k 
1 
= 2 21 22 2k  H2

1 D 

.. .. .. .. .. 

 . . . . . 
 
 k k1 k2 kk 

for 1 r, k + 1 n 1.
If 1 k, then  

 1 2 k 
 
 1 11 12 1k 

 2 21 22 2k  = 0
 
 . .. .. .. .. 
 .. . . . . 

 
 k k1 k2 kk 

for k + 1 n 1.
If k + 1 r, then
   

 1 2 k   11 12 1k 1 
   
 1 11 12 1k   21 22 2k 2 
.. .. .. .. 

 2 21 22 2k  =  ..
. . . . . 
  
 . .. .. .. ..   
 .. . . . .   k1 k2 kk k 

   
 k k1 k2 kk   1 2 k 

for k + 1 n 1, which is a (k + 1) (k + 1)-subdeterminant of B. Since

rank(B) = k, so we have
 
 1 2 k 

 
 1 11 12 1k 

 2 21 22 2k  = 0
 
 . .. .. .. .. 
 .. . . . . 

 
 k k1 k2 kk 

for k + 1 n 1. Thus, we have H(+1) DD1 H2 DDk H(k+1) = 0 for

1 r, k + 1 n 1. Then we have
D1 Dk
H+1 H2 Hk+1 = 0 (3.41)
for k+1 n1. Let x1 = x1 , x2 = x2 , . . . , xk+1 = xk+1 , x+1 = x+1 DD1 x2
D2
D 3
x DDk xk+1 for k + 1 n 1. Since H1 K[x1 , x2 , xk+2 , . . . , xn ] =
K[x1 , x2 , xk+2 , . . . , xn ], so we have H1x3 = = H1xk+1 = 0. It follows from
equations (3.1), (3.2), (3.41)(See Appendix (1) for exact computation) that

H1x + H2x = 0
1 2

H
1x1 H2x2 H1x2 H2x1 = 0

Let H = (H1 , H2 ). The above equations implies that Jx1 ,x2 H is nilpotent. It fol-
lows from Theorem 7.2.25 in [8] that H1 = a2 P (a1 x1 +a2 x2 )+d1 (xk+2 , xk+3 , . . . ,
xn ), H2 = a1 P (a1 x1 + a2 x2 ), where P (t) K[t], d1 (xk+2 , xk+3 , . . . , xn ) K[xk+2 ,
xk+3 , . . . , xn ] and a1 , a2 K. Consequently, we have


H1 = a2 P (a1 x1 + a2 x2 ) + d1 (xk+2 , xk+3 , . . . , xn )






H2 = a1 P (a1 x1 + a2 x2 )

H3 = H3 (x1 , x2 )


..
.






Hn = Hn (x1 , x2 )

where P (t) K[t], d1 (xk+2 , xk+3 , . . . , xn ) K[xk+2 , xk+3 , . . . , xn ] and a1 , a2 K.

H+1 DD1 H2 DD2 H3 DDk Hk+1 = 0, x+1 = x+1 DD1 x2 DD2 x3
Dk
D
xk+1 for k + 1 n 1, 1 k n 2.

(b) If there exists at least one of c2 , . . . , cn is zero and c2 6= 0, then without

loss of generality, we can assume that c3 = = cj0 = 0, cj0 +1 cn 6= 0 for
3 j0 n. Thus, it follows from equation (3.37) and the arguments of (i)(1)
that

12 Px(i31 ) + 13 Px(i41 ) + + 1(n1) Px(in1 ) = 0


P (i1 ) + P (i1 ) + + P (i1 ) = 0


22 x3 23 x4 2(n1) xn
..



. (B1)

r2 Px(i31 ) + r3 Px(i41 ) + + r(n1) Px(in1 ) = 0

for 3 i1 j0 and


ci2 11 P (i2 1) + 12 Px(i32 ) + 13 Px(i42 ) + + 1(n1) Px(in2 ) = 0


ci2 21 P (i2 1) + 22 Px(i2 ) + 23 Px(i2 ) + + 2(n1) Px(i2 ) = 0


3 4 n

.
..



(B2)

ci2 r1 P (i2 1) + r2Px(i32 ) + r3 Px(i42 ) + + r(n1) Px(in2 ) = 0

for i2 = 2, j0 + 1, . . . , n
 (i)
(b.1) If k n 1, then it follows from equations (B1) and (B2) that Px3 =
(i) (i)
Px4 = = Pxn = 0 for 2 i n and P (1) = 0. That is, H1x3 = H1x4 = =
H1xn = 0. Thus, we have n = 0. It reduces to (I).
(b.2) If 1 k n 2, then let rank(B) = k, where

1(n1)
12 13
22 23
2(n1)
B = . .

.. .. .. ..
. . .

r2 r3 r(n1)

Then k = k or k 1. Without loss of generality, we can assume that

 
 12 13 1(k+1)
 

 

 22 23 2(k+1)

D :=  .  6= 0.

 .. .. .. ..
 . . . 

 k2 k3 k(k+1)
 


Thus, equations (B1) is equivalent to the following equations

12 Px(i31 ) + 13 Px(i41 ) + + 1(n1) Px(in1 ) = 0


P (i1 ) + P (i1 ) + + P (i1 ) = 0


22 x3 23 x4 2(n1) xn
..



. (B3)

k2 Px(i31 ) + k3 Px(i41 ) + + k(n1) Px(in1 ) = 0

(i )
for 3 i1 j0 . It follows from equations (B3) and Cramers rule that Px31 =
(i ) (i1 ) (i )
D1 1 (i ) D (i ) Dk 1
D
, Px41 = D 2 1
, . . . , Pxk+2 = D
for 3 i1 j0 , where
 
(i1 ) (i )
 12 1(k+2) Pxk+3 ++ 1(n1) Pxn1 1(+2) 1(k+1)
 

(i1 ) (i )
 
(i1 )

 22 2(k+2) Pxk+3 ++ 2(n1) Pxn1 2(+2) 2(k+1) 
D =  .

 .. .. .. .. .. .. 
 . . . . . 

1 (i ) (i )
 k2 k(k+2) Pxk+3 + + k(n1) Pxn1 k(+2) k(k+1)
 


for 1 k, 3 i1 j0 . Let
 
 12 1 1(+2) 1(k+1)
 

 

 22 2 2(+2) 2(k+1)

D =  .

 .. .. .. .. .. .. 
 . . . . . 

 k2 k k(+2) k(k+1)
 


for 1 k, k + 2 n 1. Then we have

D(k+2) D(k+3) D(n1)
Px(i1 ) = ( Px(ik1 ) + Px(ik1 ) + + Px(in1 ) ) (3.42)
for 1 k, 3 i1 j0 . Let x1 = x1 , x2 = x2 , x3 = x3 ,. . . , xk+2 = xk+2 ,
D
x+1 = x+1 DD1 x3 DD2 x4 Dk xk+2 for k + 2 n 1. It follows from
equation (3.42) that P (i1 ) K[xk+3 , . . . , xn ] for 3 i1 j0 . Since at least one
of 1 , 2 , . . . , (n1) is non-zero, so without loss of generality, we can assume
that 1 6= 0 for 1 r. Then it follows from equation (3.38) that

H(+1) = H2
1

for 2 n 1, 1 r. Thus, we have

D1 D D1 2 D2 3 Dk (k+1)
H(+1) H3 k H(k+2) = ( )H2
D D 1 D1 1 D 1 D

1
= ( D 2 D1 (k+1) Dk )H2
1 D
 

 2 3 (k+1) 
 
 1 12 13 1(k+1) 
1 
= 2 22 23 2(k+1)  H2

1 D 

.. .. .. .. .. 

 . . . . . 

 
 k k2 k3 k(k+1) 

for 1 r, k + 2 n 1.
If 1 k, then
 

 2 3 (k+1) 
 

 1 12 13 1(k+1) 
2 22 23 2(k+1)  = 0
 

 .. .. .. .. .. 

 . . . . . 

 
 k k2 k3 k(k+1) 

for k + 2 n 1.
If k + 1 r, then
   

 2 3 (k+1)   12 13 1(k+1) 1 
   
 1 12 13 1(k+1)   22 23 2(k+1) 2 
.. .. .. .. 

2 22 23 2(k+1)  =  ..
.
  
 . . . . 
 .. .. .. .. ..   

 . . . . .  
  k2 k3 k(k+1) k 
   
 k k2 k3 k(k+1)   2 3 (k+1) 

for k + 1 n 1, which is a (k + 1) (k + 1)-subdeterminant of B. Since

rank(B) = k, so we have
 
 2 3 (k+1) 

 
 1 12 13 1(k+1) 

 2 22 23 2(k+1)  = 0.
 
 . .. .. .. .. 
 .. . . . . 
 
 
 k k2 k3 k(k+1) 

D1 Dk
Thus, we have H(+1) D
H3 D
H(k+2) = 0 for 1 r, k + 2
n 1. That is,
D1 D
H+1 H3 k Hk+2 = 0 (3.43)
D D
H
for k +2 n1. Since ci = 1(i1)x H1i
2
for 2 i n, so we have H1(i1 1)x2 = 0
for 3 i1 j0 . That is, H12 , H13 , . . . , H1(j0 1) K. Let

H1 = H1 H1(j0 1) P (j0 1) H13 P (3) (3.44)

Since H2x1 6= 0, so it is clear that H2 6= 0. Thus, at least one of 11 , 21 , . . . , r1

is non-zero. Since rank(Bi2 ) = rank(B) = k for i2 = 2, j0 + 1, . . . , n, so we
can assume that a non-zero k k-subdeterminant of Bi2 contains the column
(ci 11 , ci 21 , . . . , ci k1 )T for i2 = 2, j0 + 1, . . . , n. Without loss of generality, we
can assume that  
 ci2 11 12 1k 
 
 
 c 
 2 i 21 22 2k
..  := ci2 D 6= 0.

 . .. ..
 .. . . . 

 ci2 k1 k2 kk 
 

where D = |beta
|kk , i2 = 2, j0 + 1, . . . , n. It follows from equations (B2)
(i2 ) (i2 ) (i )
D (i ) D (i ) Dk 2
and Cramers rule that P (i2 1) = ci1 D , Px32 = D 2
, 2
. . . , Pxk+1 = D
for
2
i2 = 2, j0 + 1, . . . , n, where
 
(i2 ) (i )
 11 1(k+1) Pxk+2 + + 1(n1) Pxn2 1(+1) 1k 
 
(i2 ) (i2 )
 
 21
(i2 ) 2(k+1) Pxk+2 + + 2(n1) Pxn 2(+1) 2k 
D =  .

 .. .. .. .. .. .. 
 . . . . . 
 k1 k(k+1) Pxk+2 + + k(n1) Px(in2 )
(i2 )
k(+1) kk 
 

for 1 k, i2 = 2, j0 + 1, . . . , n. Let
 
 11 1 1(+1) 1k
 

 
 21 2
2(+1) 2k

D =  .
 
 .. . .. .
.. .. .. .. 
 . . . 

 k1 k k(+1) kk
 

for 1 k, k + 1 n 1. Then

D1(k+1) (i2 ) D1(k+2) (i2 ) D1(n1) (i2 )

P (i2 1) = ( Pxk+2 + Pxk+3 + + Px n ) (3.45)
ci D ci D ci D
and
D(k+1) D(k+2) D(n1)
Px(i+1
2)
= ( Px(ik+2
2)
+ Px(ik+3
2)
++ Px(in2 ) ) (3.46)
D D D

for 2 k, i2 = 2, j0 +1, . . . , n. Let x1 = x1 , x2 = x2 , x3 = x3 ,. . . , xk+1 = xk+1 ,

x+1 = x+1 DD2 x3 DD3 x4 DDk xk+1 for k + 1 n 1. It follows from
equations (3.45), (3.46) that P (i2 1) K[xk+2 , . . . , xn ] and P (i2 ) K[xk+2 , . . . , xn ]
for i2 = 2, j0 + 1, . . . , n. That is, P (1) , P (2) , P (j0) , . . . , P (n) K[xk+2 , . . . , xn ]. Since
at least one of 1 , 2 , . . . , (n1) is non-zero, so without loss of generality, we
can assume that 1 6= 0 for 1 r. Then it follows from equation (3.38) that

H(+1) = H2
1

for 2 n 1, 1 r. Thus, we have

D1 Dk D1 D2 2 Dk k
H(+1) H2 H(k+1) = ( )H2
D D 1 D 1 D 1 D

1
= ( D 1 D1 k Dk )H2
1 D
 

 1 2 k 
 
 1 11 12 1k 
1 
= 2 21 22 2k  H2

1 D 

.. .. .. .. .. 

 . . . . . 
 
 k k1 k2 kk 

for 1 r, k + 1 n 1. Then it follows from the arguments of (a.2)

that  

 1 2 k 
 
 1 11 12 1k 

 2 21 22 2k  = 0
 
 . .. .. .. .. 
 .. . . . . 

 
 k k1 k2 kk 

for 1 r, k + 1 n 1. That is,

D1 Dk
H+1 H2 Hk+1 = 0 (3.41)
for k+1 n1. Let x1 = x1 , x2 = x2 , . . . , xk+1 = xk+1 , x+1 = x+1 DD1 x2
D2
D 3
x DDk xk+1 for k + 1 n 1. It follows from equation (3.44) that
H1 K[x1 , x2 , xk+2 , . . . , xn ] = K[x1 , x2 , xk+2 , . . . , xn ], so we have H1x3 = =
H1xk+1 = 0. It follows from equation (3.44) that H1x1 = H1x1 , H1x2 = H1x2 and
H1 = H1 + H , where H =H (j0 1)
+ +H13 P (3) K[xk+3 , x
k+4 , . . . , xn ].
1 1 1(j0 1) P

Thus, we have H = = H = 0. Then it follows from equations (3.1),
1x3 1xk+2
(3.2), (3.41), (3.43)(See Appendix (2) for exact computation) that

H1x + H2x = 0
1 2

H
1x1 H2x2 H1x2 H2x1 = 0

Let H = (H1 , H2 ). The above equations implies that Jx1 ,x2 H is nilpotent. It fol-
lows from Theorem 7.2.25 in [8] that H1 = a2 P (a1 x1 +a2 x2 )+d1 (xk+2 , xk+3 , . . . ,
xn ), H2 = a1 P (a1 x1 + a2 x2 ), where P (t) K[t], d1 (xk+2 , xk+3 , . . . , xn ) K[xk+2 ,
. Then we have
xk+3 , . . . , xn ] and a1 , a2 K. Let d2 (xk+3 , . . . , xn ) = H 1

H1 = a2 P (a1 x1 + a2 x2 ) + d1 (xk+2 , xk+3 , . . . , xn ) + d2 (xk+3 , . . . , xn )






H2 = a1 P (a1 x1 + a2 x2 )

H3 = H3 (x1 , x2 )


..
.






Hn = Hn (x1 , x2 )

where P (t) K[t], d1 (xk+2 , xk+3 , . . . , xn ) K[xk+2 , xk+3 , . . . , xn ], d2 (xk+3 , . . . , x

n )
D
K[xk+3 , . . . , xn ] and a1 , a2 K. H+1 D H2 D H3 Dk Hk+1 = 0,
D 1 D 2

x+1 = x+1 DD1 x2 DD2 x3 DDk xk+1 for k + 1 n 1, H+1

D D
D1
D
H3 Dk Hk+2 = 0, x+1 = x+1 DD1 x3 DD2 x4 Dk xk+2 for
k + 2 n 1, 1 k n 2 and k = k or k 1.

(c) If there exists at least one of c2 , . . . , cn is zero and c2 = 0, then without loss
of generality, we can assume c2 = = ci0 = 0, ci0 +1 cn 6= 0 for 2 i0 n.
Thus, it follows from equation (3.37) and the arguments of (i)(1) that

12 Px(j31 ) + 13 Px(j41 ) + + 1(n1) Px(jn1 ) = 0


22 Px(j1 ) + 23 Px(j1 ) + + 2(n1) Px(j1 ) = 0


3 4 n

.
..



(C1)

r2 P (j1 ) + r3 P (j1 ) + + r(n1) P (j1 ) = 0


for 2 j1 i0 and


cj2 11 P (j2 1) + 12 Px(j32 ) + 13 Px(j42 ) + + 1(n1) Px(jn2 ) = 0


cj2 21 P (j2 1) + 22 Px(j2 ) + 23 Px(j2 ) + + 2(n1) Px(j2 ) = 0


3 4 n

..



. (C2)

cj2 r1 P (j2 1) + r2 Px(j32 ) + r3 Px(j42 ) + + r(n1) Px(jn2 ) = 0

for i0 + 1 j2 n
(c.0) Since c2 = 0, so we have H11x2 = 0. It follows from equation (3.4) that
H11 K. It follows from equations (3.5), (n ), (3.35) that



H10x1 + H2x2 = 0

H10x1 H2x2 H10x2 H2x1 H11 (Px(1)
3
H3x1 + + Px(1)
n
Hnx1 ) = 0


H (P (1) H + + P (1) H ) = H (P (1) H + + P (1) H

2x1 x3 3x2 xn nx2 2x2 x3 3x1 xn nx1 )

(1) (1) (1)

If H11 K , then let 1 = Px3 , 2 = Px4 , . . . , n2 = Pxn , H = (H11 z +
H10 (x1 , x2 ), H2 , 1 H3 + 2 H4 + + n2 Hn ), where z := 1 x3 + 2 x4 + +
n2 xn = P (1) (x3 , . . . , xn ). It is easy to see that 1 , 2 , . . . , n2 K. The above
equations imply that Jx1 ,x2 ,z H is nilpotent. Then it follows from Corollary 2.7
that


H1 H1n P (n) H12 P (2) = H11 z a1 b (x2 )g(ax1 + b(x2 )) H11 l2 x2






H2 = g(ax1 + b(x2 ))

H3 = H3 (x1 , x2 )


..
.






Hn = Hn (x1 , x2 )

where 1 H3 + 2 H4 + + n2 Hn = c0 H22 + l2 H2 , b(x2 ) = H11 c0 ax22 + l1 x2 + l2 ,

H11 , c0 , a K , l1 , l2 , l2 K, 1 , 2 , . . . , n2 K, g(t) K[t], and g(0) = 0,
deg g(t) 1.
or the components of H are linearly dependent. If the components of H are
linearly dependent, then H2 , 1 H3 + 2 H4 + + n2 Hn are linearly dependent
because H11 6= 0. Thus, we have 1 H3 + 2 H4 + + n2 Hn = H2 for some
K because H2 6= 0. Then we have H = (H11 z + H10 (x1 , x2 ), H2 , H2). Since
Jx1 ,x2 ,z H is nilpotent, so we have the following equations:

H10x + H2x = 0
1 2

H
10x1 H2x2 (H10x2 + H11 )H2x1 = 0
Let H10 = H10 + H11 x2 . Then the above equations imply that

H10x + H2x = 0
1 2

H
10x1 H2x2 H10x2 H2x1 = 0
That is, Jx1 ,x2 (H10 , H2 ) is nilpotent. It follows from Corollary 2.12 or Theorem
7.2.25 in [8] that H10 = a2 P (a1 x1 + a2 x2 ), H2 = a1 P (a1 x1 + a2 x2 ), where
a1 , a2 K, P (t) K[t]. Thus, we have H = (a2 P (a1 x1 + a2 x2 ) + H11 (z
x2 ), a1 P (a1 x1 + a2 x2 ), a1 P (a1 x1 + a2 x2 )), where , a11 , a2 K and P (t) K[t].
Thus, we have

H1 H1n P (n) H12 P (2) = H11 (z x2 ) a2 P (a1 x1 + a2 x2 )






H2 = a1 P (a1 x1 + a2 x2 )

H3 = H3 (x1 , x2 )


..
.






Hn = Hn (x1 , x2 )

where z := 1 x3 + 2 x4 + + n2 xn , 1 H3 + 2 H4 + + n2 Hn H2 = 0,
H11 K , , a1, a2 , 1 , 2 , . . . , n2 K, P (t) K[t].
If H11 = 0, then it follows from equations (3.5), (n ) that

H10x + H2x = 0
1 2

H
10x1 H2x2 H10x2 H2x1 = 0

Let H = (H , H ). Then the above equations imply that J

10 2 x1 ,x2 H is nilpotent.
It follows from Corollary 2.12 or Theorem 7.2.25 in [8] that H10 = a2 P (a1 x1 +
a2 x2 ), H2 = a1 P (a1 x1 + a2 x2 ), where a1 , a2 K, P (t) K[t].
(i)
(c.1) If k n 1, then it follows from equations (C1) and (C2) that Px3 =
(i) (i)
Px4 = = Pxn = 0 for 2 i n. That is, P (2) = P (3) = = P n = 0. It
follows from (c.0) that

H1 = H11 z a1 b (x2 )g(ax1 + b(x2 )) H11 l2 x2






H2 = g(ax1 + b(x2 ))

H3 = H3 (x1 , x2 )


..
.






Hn = Hn (x1 , x2 )

where z := 1 x3 + 2 x4 + + n2 xn , 1 H3 + 2 H4 + + n2 Hn = c0 H22 + l2 H2 ,
b(x2 ) = H11 c0 ax22 + l1 x2 + l2 , H11 , c0 , a K , l1 , l2 , l2 K, 1 , 2 , . . . , n2 K,
g(t) K[t], and g(0) = 0, deg g(t) 1.
or


H1 = H11 (z x2 ) a2 P (a1 x1 + a2 x2 )






H2 = a1 P (a1 x1 + a2 x2 )

H3 = H3 (x1 , x2 )


..
.






Hn = Hn (x1 , x2 )

where z := 1 x3 +2 x4 + +n2 xn , H11 (1 H3 +2 H4 + +n2 Hn H2 ) = 0,

H11 , , a1 , a2 , 1 , 2 , . . . , n2 K, P (t) K[t].
(c.2) If 1 k n 2, then we can follow the arguments of (b.2) that
P (j1 )
K[xk+3 , xk+4 , . . . , xn ] for 2 j1 i0 and

D1 D
H+1 H3 k Hk+2 = 0 (3.43)
D D
for k + 2 n 1, where k, x k+3 , x
k+4 , . . . , xn are defined as in (b.2).
P (j2 1) , P (j2 ) K[xk+2 , . . . , xn ] for i0 + 1 j2 n. That is, P (i0 ) , . . . , P (n)
K[xk+2 , . . . , xn ] and

D1 D2 Dk
H+1 H2 H3 Hk+1 = 0 (3.41)
D D D
for k + 1 n 1, where xk+2 , . . . , xn are defined as in (b.2). Let

L1 (x2 , xk+2 , . . . , xn ) = H1n P (n) + H1(n1) (x2 )P (n1) + + H1i0 (x2 )P (i0 ) (3.47)
H
Since ci = 1(i1)x
H1i
2
for 2 i n, so we have H1(j1 1)x2 = 0 for 2 j1 i0 .
That is, H11 , H12 , . . . , H1(i0 1) K. Let

L2 (xk+3 , xk+4 , . . . , xn ) = H1(i0 1) P (i0 1) + H1(i0 2) P (i0 2) + + H12 P (2) (3.48)

Then it follows from (c.0) that

H1 = L1 (x2 , xk+2 , . . . , xn ) + L2 (xk+3 , . . . , xn ) + H11 z a1 b (x2 )g(ax1 + b(x2 ))

H11 l2 x2

H2 = g(ax1 + b(x2 ))

H3 = H3 (x1 , x2 )

..
.

= Hn (x1 , x2 )
n

where z := 1 x3 + 2 x4 + + n2 xn , H+1 DD1 H2 DD2 H3 DDk Hk+1 = 0,

x+1 = x+1 DD2 x3 DD3 x4 DDk xk+1 for k + 1 n 1, H+1 DD1 H3
D D
k Hk+2 = 0, x+1 = x+1 D1 x3 D2 x4 k xk+2 for k+2 n1,
1 k n 2 and k = k or k 1, 1 H3 + 2 H4 + + n2 Hn = c0 H22 + l2 H2 ,
b(x2 ) = H11 c0 ax22 + l1 x2 + l2 , H11 , c0 , a K , l1 , l2 , l2 K, 1 , 2 , . . . , n2 K,
g(t) K[t], and g(0) = 0, deg g(t) 1.
or

n ) + H11 (z x2 ) a2 P (a1 x1 + a2 x2 )
H1 = L1 (x2 , xk+2 , . . . , xn ) + L2 (xk+3 , . . . , x

H2 = a1 P (a1 x1 + a2 x2 )

H3 = H3 (x1 , x2 )

..
.

Hn = Hn (x1 , x2 )

where z := 1 x3 + 2 x4 + + n2 xn , H+1 DD1 H2 DD2 H3 DDk Hk+1 = 0,

x+1 = x+1 DD2 x3 DD3 x4 DDk xk+1 for k + 1 n 1, H+1 DD1 H3
D D
Dk Hk+2 = 0, x+1 = x+1 DD1 x3 DD2 x4 Dk xk+2 for k+2 n1,
1 k n 2 and k = k or k 1, H11 (1 H3 + 2 H4 + + n2 Hn H2 ) = 0,
H11 , , a1 , a2 , 1 , 2 , . . . , n2 K, P (t) K[t].
As for the above two cases, it follows from equations (3.2), (3.41), (3.43)(See
Appendix (3) for exact computation) that

D1(k+1) D1(k+2) D1(n1)

H2x1 (L1x2 + L1xk+2 + L1xk+3 + + L1xn ) = 0
D D D
Since H2x1 6= 0, so we have

D1(k+1) D1(k+2) D1(n1)

L1x2 + L1xk+2 + L1xk+3 + + L1xn = 0 (3.49)
D D D
Let x1 = x1 , x2 = x2 ,. . . , xk+1 = xk+1 , x+1 = x+1 DD1 x2 DD2 x3
Dk
D
xk+1 for k + 1 n 1. Then it follows from equation (3.47) that
L1 (x2 , xk+2 , . . . , xn ) K[x2 , xk+2 , . . . , xn ] = K[x2 , xk+2 , . . . , xn ]. It follows from
equation (3.49) that L1x2 = 0. That is, L1 K[xk+2 , . . . , xn ]. Consequently, we
have

H1 = L1 (xk+2 , . . . , xn ) + L2 (xk+3 , . . . , xn ) + H11 z a1 b (x2 )g(ax1 + b(x2 ))

H11 l2 x2

H2 = g(ax1 + b(x2 ))

H3 = H3 (x1 , x2 )

..
.

= Hn (x1 , x2 )
n

where z := 1 x3 + 2 x4 + + n2 xn , H+1 DD1 H2 DD2 H3 DDk Hk+1 = 0,

x+1 = x+1 D1 x2 D2 x3 Dk xk+1 for k + 1 n 1, H+1 D1 H3
 D D
Dk Hk+2 = 0, x+1 = x+1 DD1 x3 DD2 x4 Dk xk+2 for k+2 n1,
1 k n 2 and k = k or k 1, 1 H3 + 2 H4 + + n2 Hn = c0 H22 + l2 H2 ,
b(x2 ) = H11 c0 ax22 + l1 x2 + l2 , H11 , c0 , a K , l1 , l2 , l2 K, 1 , 2 , . . . , n2 K,
g(t) K[t], and g(0) = 0, deg g(t) 1.
or

n ) + H11 (z x2 ) a2 P (a1 x1 + a2 x2 )
H1 = L1 (xk+2 , . . . , xn ) + L2 (xk+3 , . . . , x

H2 = a1 P (a1 x1 + a2 x2 )

H3 = H3 (x1 , x2 )

..
.

Hn = Hn (x1 , x2 )

where z := 1 x3 + 2 x4 + + n2 xn , H+1 DD1 H2 DD2 H3 DDk Hk+1 = 0,

x+1 = x+1 DD1 x2 DD2 x3 DDk xk+1 for k + 1 n 1, H+1 DD1 H3
D D
Dk Hk+2 = 0, x+1 = x+1 DD1 x3 DD2 x4 Dk xk+2 for k+2 n1,
1 k n 2 and k = k or k 1, H11 (1 H3 + 2 H4 + + n2 Hn H2 ) = 0,
H11 , , a1 , a2 , 1 , 2 , . . . , n2 K, P (t) K[t].

Corollary 3.5. If we replace H by H = (H1 (x1 , x2 ), H2 (x1 , . . . , xn ), . . . , Hn (x1 ,

x2 )) in Theorem 3.3, then we have the same conclusion as in Theorem 3.3.

Proof. Let

0 1 0 0


1 0 0 0
T = 0 0 1 0

.. .. .. . . ..

. . . . .

0 0 0 1

Then T H T 1 = (H2 (x2 , x1 , . . . , xn ), H1 (x2 , x1 ), H3 (x2 , x1 ), . . . , Hn (x2 , x1 )). Since

J H is nilpotent, so we have that J(T H T 1 ) is nilpotent. It follows from Theorem
3.3 that there exists T1 GLn (K) such that T1 T H T 1 T11 is one of the forms of
Theorem 3.3. Let T = T1 T GLn (K). Then the conclusion follows.

Corollary 3.6. Let F = x + H be a polynomial map over K[x1 , . . . , xn ], where

H = (H1 (x1 , . . . , xn ), H2 (x1 , x2 ), . . . , Hn (x1 , x2 )) and H is homogeneous, Hk (x1 ,
x2 ) K[x1 , x2 ] for 2 k n. If det JF = 1, then F is invertible.

Proof. Since det JF = 1 and H is homogeneous, so JH is nilpotent. Then the

conclusion follows from Theorem 3.3.
4 Appendix

(1) Since H+1 DD1 H2 DD2 H3 DDk Hk+1 = 0, x1 = x1 , . . . , xk+1 = xk+1 ,

x+1 = x+1 DD1 x2 DD2 x3 DDk xk+1 for k + 1 n 1, so it follows
from equations (3.1), (3.2) (in Theorem 3.2) that H1x1 + H2x2 = 0 and
0 = H1x1 H2x2 H1x2 H2x1 H1x3 H3x1 H1xn Hnx1
D D D
= H1x1 H2x2 (H1x2 1(k+1)
D
H1xk+2 1(k+2)
D
H1xk+3 1(n1)
D
H1xn )H2x1
D2(k+1) D2(k+2) D2(n1)
( D H1xk+2 D H1xk+3 D H1xn )H3x1
..
.
D D Dk(n1)
( k(k+1)
D
H1xk+2 k(k+2)
D
H1xk+3 D
H1xn )H(k+1)x1
D1(k+1) D2(k+1) Dk(k+1)
H1xk+2 ( D H2x1 + D H3x1 + + D
H(k+1)x1 )
..
.
D D2(n1) Dk(n1)
H1xn ( 1(n1)
D
H2x1 + D
H3x1 ++ D
H(k+1)x1 )
= H1x1 H2x2 H1x2 H2x1

(2) Since H+1 DD1 H2 DD2 H3 DDk Hk+1 = 0, x1 = x1 , . . . , xk+1 =

xk+1 , x+1 = x+1 DD1 x2 DD2 x3 DDk xk+1 for k + 1 n 1,
D
H+1 DD1 H3 DD2 H4 Dk Hk+2 = 0, x1 = x1 , . . . , xk+2 = xk+2 , x+1 =
D
x+1 DD1 x3 DD2 x4 Dk xk+2 for k + 2 n 1, H1 = H1 + H , where
1

H1 K[x1 , x2 , xk+2 , . . . , xn ], H1 K[xk+3 , xk+4 , . . . , xn ], H1x3 = = H1xk+1 =
= = H
0, H
1x1 1xk+2 = 0, so it follows from equations (3.1), (3.2)(in Theorem
3.2) that H1x1 + H2x2 = 0 and
H1x1 + H2x2 = 0 and
0 = H1x1 H2x2 H1x2 H2x1 H1x3 H3x1 H1xn Hnx1
= H1x1 H2x2 H1x2 H2x1 (H1x3 + H )H (H + H )H
1x3 3x1 1xn 1xn nx1

= (H1x1 H2x2 H1x2 H2x1 H1xn Hnx1 ) (H1x3 H3x1 + + H1xn Hnx1 )
D D D
= H1x1 H2x2 (H1x2 1(k+1) D
H1xk+2 1(k+2)D
H1xk+3 1(n1)D
H1xn )H2x1
D2(k+1) D2(k+2) D2(n1)
( D H1xk+2 D H1xk+3 D H1xn )H3x1
..
.
D D Dk(n1)
( k(k+1)
D
H1xk+2 k(k+2)
D
H1xk+3 D
H1xn )H(k+1)x1
D1(k+1) D2(k+1) Dk(k+1)
H1xk+2 ( D H2x1 + D H3x1 + + D
H(k+1)x1 )
..
.
D D D
H1xn ( 1(n1)
D
H2x1 + 2(n1)
D
H3x1 + + k(n1)
D
H(k+1)x1 )

= H1x1 H2x2 H1x2 H2x1 (H1x3 H3x1 + + H1xn Hnx1 )
= H H H H ( 1(k+2) H
D D1(k+3) H D1(n1) H n )H3x
1
1x1 2x2 1x2 2x1 D 1xk+3 D 1xk+4 D 1x
D2(k+2) D2(k+3) D )H
( D H1xk+3 D H1xk+4 2(n1)
D
H 1xn 4x1
..
.
Dk(k+2) D Dk(n1) H )H
( D H1xk+3 k(Dk+3) H 1xk+4 D 1xn 1
(k+2)x
(
H
D 1( k+2)
H +
D 2( k+2)
H ++
D k( k+2)
H )
1x 3x 4x
(k+2)x
 ..
.
D1(n1)
H1xn ( D H3x1 +
D2(n1)
H4x1 ++
Dk(n1)
H(k+2)x1 )
D D
= H1x1 H2x2 H1x2 H2x1

(3) Since H+1 DD1 H2 DD2 H3 DDk Hk+1 = 0, x1 = x1 , . . . , xk+1 = xk+1 ,

x+1 = x+1 DD2 x3 DDk xk+1 for k + 1 n 1, H+1 DD1 H3
D
D2
D
H4 Dk Hk+2 = 0, x1 = x1 , . . . , xk+2 = xk+2 , x+1 = x+1 DD1 x3
D2 D
D 4
x Dk xk+2 for k + 2 n 1,
(i) H1 = L1 + L2 + H11 (1 x3 + 2 x4 + + n2 xn ) a1 b (x2 )g(ax1 + b(x2 ))
H11 l2 x2 , H2 = g(ax1 + b(x2 )), where L1 K[xk+2 , . . . , xn ], L2 K[xk+3 , . . . , xn ],
1 H3 + 2 H4 + + n2 Hn = c0 H22 + l2 H2 , b(x2 ) = H11 c0 ax22 + l1 x2 + l2 ,
L1x3 = L1x4 = = L1xk+1 = 0, L2x1 = = L2xk+2 = 0
or
(ii) H1 = L1 + L2 + H11 (1 x3 + 2 x4 + + n2 xn x2 ) a2 P (a1 x1 + a2 x2 ),
H2 = a1 P (a1 x1 + a2 x2 ), where L1 K[xk+2 , . . . , xn ], L2 K[xk+3 , . . . , xn ],
H11 (1 H3 + 2 H4 + + n2 Hn H2 ) = 0, L1x3 = L1x4 = = L1xk+1 = 0,
L2x1 = = L2xk+2 = 0,
so it follows from equation (3.2)(in Theorem 3.2) that
As for (i):
0 = H1x1 H2x2 H1x2 H2x1 H1x3 H3x1 H1xn Hnx1
= (L1x2 + H11 l2 + 2H11 c0 g)H2x1 (L1x3 H3x1 + + L1xn Hnx1 ) (L2x3 H3x1 +
+ L2xn Hnx1 ) H11 (1 H3x1 + + n2 Hnx1 )
D D D
= L1x2 H2x1 H3x1 ( 2(k+1) D
L1xk+2 2(k+2)
D
L1xk+3 2(n1)
D
L1xn )
D3(k+1) D3(k+2) D3(n1)
H4x1 ( D L1xk+2 D L1xk+3 D L1xn )
..
.
D D D
H(k+1)x1 ( k(k+1)
D
L1xk+2 k(k+2)
D
L1xk+3 k(n1)
D
L1xn )
D1(k+1) D2(k+1) Dk(k+1)
L1xk+2 ( D H2x1 + D H3x1 + + D H(k+1)x1 )
..
.
D D D
L1xn ( 1(n1)
D
H2x1 + 2(n1)
D
H3x1 + + k(n1)
D
H(k+1)x1 )
D1(k+1) D1(k+2) D1(n1)
= H2x1 (L1x2 + D L1xk+2 + D L1xk+3 + + D L1xn ) (L2x3 H3x1 +
+ L2xn Hnx1 )
D D D
= H2x1 (L1x2 + 1(k+1)
D
L1xk+2 + 1(k+2)
D
L1xk+3 + + 1(n1)
D
L1xn )
D1(k+2) D1(k+3) D1(n1)
H3x1 ( D
L2xk+3 D
L2xk+4 D
L2xn )
..
.
Dk(k+2) Dk(k+3) Dk(n1)
H(k+2)x1 ( D L2xk+3 D
L2xk+4 D
L2xn )
D1(k+2) D2(k+2) Dk(k+2)
L2xk+3 ( D
H3x1 + D
H4x1 ++ D
H(k+2)x1 )
..
.
D D D
L2xn ( 1(n1)
D
H3x1 + 2(n1)
D
H4x1 + + k(n1)
D
H(k+2)x1 )
D1(k+1) D1(k+2) D
= H2x1 (L1x2 + D L1xk+2 + D L1xk+3 + + 1(n1) D
L1xn )
As for (ii):
0 = H1x1 H2x2 H1x2 H2x1 H1x3 H3x1 H1xn Hnx1
= (L1x2 + H11 )H2x1 (L1x3 H3x1 + + L1xn Hnx1 ) (L2x3 H3x1 +
+ L2xn Hnx1 ) H11 (1 H3x1 + + n2 Hnx1 )
D D D
= L1x2 H2x1 H3x1 ( 2(k+1)D
L1xk+2 2(k+2)
D
L1xk+3 2(n1)
D
L1xn )
D3(k+1) D3(k+2) D3(n1)
H4x1 ( D L1xk+2 D L1xk+3 D L1xn )
..
.
D D D
H(k+1)x1 ( k(k+1)
D
L1xk+2 k(k+2)
D
L1xk+3 k(n1)
D
L1xn )
D1(k+1) D2(k+1) Dk(k+1)
L1xk+2 ( D H2x1 + D H3x1 + + D H(k+1)x1 )
..
.
D D D
L1xn ( 1(n1)
D
H2x1 + 2(n1)
D
H3x1 + + k(n1)
D
H(k+1)x1 )
D1(k+1) D1(k+2) D1(n1)
= H2x1 (L1x2 + D L1xk+2 + D L1xk+3 + + D L1xn ) (L2x3 H3x1 +
+ L2xn Hnx1 )
D D D
= H2x1 (L1x2 + 1(k+1)
D
L1xk+2 + 1(k+2)
D
L1xk+3 + + 1(n1)
D
L1xn )
D1(k+2) D1(k+3) D1(n1)
H3x1 ( D
L2xk+3 D
L2xk+4 D
L2xn )
..
.
Dk(k+2) Dk(k+3) Dk(n1)
H(k+2)x1 ( D L2xk+3 D
L2xk+4 D
L2xn )
D1(k+2) D2(k+2) Dk(k+2)
L2xk+3 ( D
H3x1 + D
H4x1 ++ D
H(k+2)x1 )
..
.
D D D
L2xn ( 1(n1)
D
H3x1 + 2(n1)
D
H4x1 + + k(n1)
D
H(k+2)x1 )
D1(k+1) D1(k+2) D
= H2x1 (L1x2 + D L1xk+2 + D L1xk+3 + + 1(n1) D
L1xn )

References
[1] H. Bass, E. Connell and D. Wright, The Jacobian Conjecture: Reduction
of Degree and Formal Expansion of the Inverse, Bulletin of the American
Mathematical Society, 7 (1982), 287-330.

[2] M. de Bondt, Quasi-translations and counterexamples to the homogeneous

dependence problem, Proceedings of the American Mathematical Society 134
(2006) 2849-2856.

[3] M. de Bondt, Homogeneous Keller maps, Ph.D. thesis, Radboud University,

Nijmegen 2009.

[4] M.de Bondt, the strong nilpotency index of a matrix, arXiv:1203.6615.

1
[5] M.de Bondt, Computation of Keller maps over fields with 6
,
arXiv:1609.09753.
 [6] M. de Bondt and A. van den Essen, The Jacobian conjecture: linear trian-
gularization for homogeneous polynomial maps in dimension three, Report
0413, University of Nijmegen, The Netherlands, 2004.

[7] Marc Chamberland and Arno van den Essen, Nilpotent Jacobian in dimen-
sion three, Journal of Pure and Applied Algebra 205 (2006) 146-155.

[8] A. van den Essen, Polynomial Automophisms and the Jacobian Conjecture,
Vol. 190 in Progress in Mathematics Birkhauser Basel, 2000.

[9] A. van den Essen, Nilpotent Jacobian matrices with independent rows, Report
9603, University of Nijmegen, The Netherlands, 1996.

[10] A. van den Essen and E. Hubbers, Polynomial maps with strongly nilpo-
tent Jacobian matrix and the Jacobian Conjecture, Linear Algebra and its
Applications, 247(1996), 121-132.

[11] E. Hubbers, The Jacobian conjecture: cubic homogeneous maps in dimension

four, Masters Thesis, University of Nijmegen, The Netherlands, 1994.

[12] O.H. Keller, Ganze Cremona-transformationen Monatschr., Math. Phys.,

47 (1939) pp. 229-306.

[13] S.S.S.Wang, A Jacobian criterion for separability, Jour. of Algebra, 65

(1980), 453-494.

[14] D. Wright, The Jacobian conjecture: linear triangularization for cubics in

dimension three, Linear and Multilinear Algebra 34(1993) 85-97.

[15] A.V.Yagzhev, On Kellers problem, Siberian Math. Journal, 21 (1980), 747-

754.

[16] Dan Yan, Michiel de Bondt, Some Remarks On the Jacobian Conjecture and
Druzkowski mappings, Journal of Algebra (2013),pp. 267-275.

[17] Dan Yan, Guoping Tang, Polynomial maps with nilpotent Jacobians in di-
mension three, Linear Algebra and its Applications, 489 (2016), 298-323.

[18] Dan Yan, Polynomial maps with nilpotent Jacobians in dimension three I,
arXiv:1710.02800.
http://arxiv.org/abs/1710.02800

[19] Dan Yan, Polynomial maps with nilpotent Jacobians in dimension three II,
arXiv:1710.02802.
http://arxiv.org/abs/1710.02802