INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES
WARSZAWA 1998
ON THE EULER CHARACTERISTIC OF FIBRES OF REAL POLYNOMIAL MAPS
A D A M P A R U S I ´ N S K I
Departement de Math´ ematiques, Universit´ e d’Angers 2, bd. Lavoisier, 49045 Angers Cedex 01, France
E-mail: parus@tonton.univ-angers.fr
Z B I G N I E W S Z A F R A N I E C Institute of Mathematics, University of Gda´ nsk
Wita Stwosza 57, 80-952 Gda´ nsk, Poland E-mail: szafran@ksinet.univ.gda.pl
Abstract. Let Y be a real algebraic subset of R
mand F : Y → R
nbe a polynomial map. We show that there exist real polynomial functions g
1, . . . , g
son R
nsuch that the Euler characteristic of fibres of F is the sum of signs of g
i.
The purpose of this paper is to give a new, self-contained and elementary proof of the following result.
Theorem. Let Y be a real algebraic subset of R
mand F : Y → R
nbe a polyno- mial map. Then there exist real polynomials g
1(y), . . . , g
s(y) on R
nsuch that the Euler characteristic of fibres of F is the sum of signs of g
i, that is
χ(F
−1(y)) = sgn g
1(y) + . . . + sgn g
s(y).
Our proof is based on a classical and elementary result expressing the number of real roots of a real polynomial of one variable as the signature of an associated quadratic form known already to Hermite [He1, He2] and Sylvester [Syl], see also [B], [BW], [BCR, p. 97].
In the proof we use a modern generalized version of this result presented in [PRS] (note that we need only a one variable case of [PRS], that is precisely [BR, Proposition p. 18]).
Our original proof of the theorem [PS] used different means such as the theory of lo- cal topological degree of polynomial mappings, Gr¨ obner bases and the Eisenbud-Levine Theorem and was not so explicit as the one presented below.
1991 Mathematics Subject Classification: Primary 14P05, 14P25.
Received by the editors: January 23, 1997; in the revised form: November 15, 1997.
The paper is in final form and no version of it will be published elsewhere.
[175]
The paper is organized as follows. In Section 1 we prepare the algebraic part of the proof. In particular we recall Hermite and Sylvester’s theorem. In Section 2 we present ba- sic properties of Euler characteristic of semialgebraic sets and a useful formalism of Euler integral of constructible functions. The proof of the theorem for F proper is presented in Section 3. This case is particularly simple and the proof is obtained by an effective elimination procedure. In Section 4 we complete the proof in general (non-proper) case.
The main theorem of the paper was inspired by the first preprint version of [CK]. For its applications see [MP] and [PS].
1. Preliminaries I. Let W be an irreducible real algebraic subset of R
n, let A denote the ring of real polynomials on W , and K—the field of fractions of A.
Let X be a real indeterminate. Take h
1, . . . , h
k∈ K[X] and denote by I the ideal in K[X] generated by h
1, . . . , h
k. We assume that at least one of h
iis nonzero. The ring K[X] is a principal ideals domain, and h = g.c.d.(h
1, . . . , h
k) is a generator of I. One may find polynomials H
1, . . . , H
k, P
1, . . . , P
k∈ K[X] such that
h = H
1h
1+ . . . + H
kh
k, h
i= P
ih.
Set d = deg h. Then Q = K[X]/I is a K-algebra and d = dim
KQ. The monomials 1, X, . . . , X
d−1form a basis in Q. In particular, if d = 0, then I = K[X] and Q = {0}.
For any f ∈ K[X] there are unique q, r ∈ K[X] such that f = qh + r and deg r < d.
Thus r = a
0+ a
1X + . . . + a
d−1X
d−1. Put r
i(f ) = a
i∈ K. This way r
i(f ) is the i-th coordinate of f in Q.
Any f ∈ Q defines a K-linear endomorphism A
f: Q → Q by multiplication A
f(p) = f p. Let Tr(f ) ∈ K be the trace of A
f. Clearly
Tr(f ) = r
0(f ) + r
1(f X) + . . . + r
d−1(f X
d−1).
The trace map Tr : Q → K is K-linear.
Fix g ∈ K[X]. Define a symmetric bilinear form Θ
g: Q×Q → K by Θ
g(a, b) = Tr(gab).
For 0 ≤ i, j ≤ d − 1 put T
ij= r
0(gX
i+j) + . . . + r
d−1(gX
i+j+d−1) ∈ K, so that the matrix of Θ
gis [T
ij].
Recall that K is the field of fractions of the polynomial ring A of an irreducible real algebraic set W ⊂ R
n. There exists a proper algebraic subset Σ ⊂ W such that the numerators and the denominators of all non-trivial elements of K, which have appeared above, do not vanish on W \ Σ. Given f ∈ K[X], f = a
dX
d+ . . . + a
0, a
i∈ K. For w ∈ W we denote by f
wthe evaluation of f at w, that is, f
w= a
d(w)X
d+ . . . + a
0(w). Such f
wis well-defined provided all a
i(w) exist. Fix w ∈ W \ Σ. Then deg h
w= d and h
wis the greatest common divisor of h
1w, . . . , h
kw. Let I
wdenote the ideal generated by h
1w, . . . , h
kw. Hence I
w= (h
w), Q
w= R[X]/I
wis an R-algebra, dim
RQ
w= d, and 1, X, . . . , X
d−1form a basis in Q
w.
Given g ∈ K[X]. In the same way as above we define the trace map Tr
w: Q
w→ R, and the symmetric bilinear form Θ
gw: Q
w× Q
w→ R, given by Θ
gw(a, b) = Tr(g
wab).
Then the evaluation [T
wij] = [T
ij(w)] is the matrix of Θ
gw.
Let V
w= {x ∈ R | h
1(w, x) = . . . = h
k(w, x) = 0} = {x ∈ R | h
w(x) = 0}. If
w ∈ W \ Σ then I
w6= {0} and V
wis finite. Set
(1) A
w= X
x∈Vw
sgn g(w, x).
If g = 1 then A
wis just the number of real roots of h
w(x). The following result follows from [He1, He2] and [Syl], see [BR, Proposition p. 18] and [PRS, Theorem 2.1].
Proposition 1. For w ∈ W \ Σ
A
w= signature Θ
gw= signature[T
wij].
Now we apply the lemma of Descartes in order to describe the way A
wdepends on w.
Lemma 2. Let f (x) = a
dx
d+ a
d−1x
d−1+ . . . + a
0be a real polynomial and assume that all roots of f (x) are real. Let p
+(resp. p
−) denote the number of positive (resp.
negative) roots of f counted with multiplicities. Let Λ denote the set of all pairs (r, s) with 0 ≤ r < s ≤ n such that a
r6= 0, a
s6= 0, and a
i= 0 for r < i < s. Define Λ
0= {(r, s) ∈ Λ | r + s is odd }. Then
p
+− p
−= − X
(r,s)∈Λ0
sgn (a
ra
s).
P r o o f. We say that the pair of real numbers (a, b) changes sign if ab < 0. If this is the case then (1 − sgn ab)/2 = 1, if ab > 0 then (1 − sgn ab)/2 = 0.
By Descartes’ lemma (see [MS, Theorem 6, p. 232], or [BR, Proposition 1.1.10, p. 14]), p
+equals the number of sign changes in the sequence of non-zero coefficients of f (x), that is
p
+= X
(r,s)∈Λ
(1 − sgn(a
ra
s))/2.
According to the same fact, p
−equals the number of sign changes in the sequence of non-zero coefficients of f (−x), i.e.
p
−= X
(r,s)∈Λ
1 − (−1)
r+ssgn(a
ra
s)/2.
Hence p
+− p
−= − P
(r,s)∈Λ0
sgn a
ra
sas required.
Corollary 3. There exist polynomials ϕ
1, . . . , ϕ
t∈ A and a proper algebraic subset Σ ⊂ W such that for every w ∈ W \ Σ
A
w=
t
X
i=1
sgn ϕ
i(w).
P r o o f. Let T (λ) = T
dλ
d+ . . . + T
0, where T
i∈ K, be the characteristic polynomial of [T
ij]. Define Λ
0in the same way as above. In particular T
rT
s∈ K \ {0} for each (r, s) ∈ Λ
0. Then the evaluation T
w(λ) = T
d(w)λ
d+ . . . + T
0(w) is the characteristic polynomial of [T
wij]. We enlarge Σ so that T
r(w)T
s(w) 6= 0 for w ∈ W \ Σ and (r, s) ∈ Λ
0. Then by Lemma 2
(2) signature Θ
gw= signature[T
wij] = − X
(r,s)∈Λ0
sgn T
r(w)T
s(w)
as required.
2. Preliminaries II. In this section we recall the construction and some basic prop- erties of the Euler integral of a constructible function, see e.g. [MP] for more information.
An integer-valued function ϕ : R
n→ Z is called constructible if it admits a presenta- tion as a finite sum
(3) ϕ = X
m
i1
Xi,
where for each i, X
iis a closed semialgebraic subset of R
n, 1
Xiis the characteristic function of X
i, and m
i’s are integers. The presentation (3) is not unique. If the support of ϕ is compact, then we may choose all X
icompact. Then the Euler integral of ϕ is defined as
Z
ϕ = X
m
iχ(X
i).
For R > 0 let Ψ
nRdenote the characteristic function of the ball B
Rcentred at the origin and of radius R. For any constructible ϕ, the product ϕΨ
nRhas compact support, and we define the Euler integral of ϕ as
Z ϕ =
Z
ϕΨ
nR, for R 0.
This definition makes sense because of the following
Lemma 4. Let X ⊂ R
nbe semialgebraic. Then if R > 0 is large enough, X ∩ B
Ris a deformation retract of X.
P r o o f. Let ρ : X → R denote the distance to the origin. By topological triviality of semialgebraic mappings [BCR, Thm. 9.3.1], there is a finite subset {y
1, . . . , y
p} ⊂ R such that
ρ : X \ ρ
−1({y
1, . . . , y
p}) → R \ {y
1, . . . , y
p}
is a locally trivial fibration. In particular, R > max{|y
1|, . . . , |y
p|} satisfies the statement of the lemma.
Corollary 5. If X ⊂ R
nis closed semialgebraic then R 1
X= χ(X).
P r o o f. If R is large enough then X ∩ B
Ris a deformation retract of X. Hence R 1
X= R 1
XΨ
nR= χ(X ∩ B
R) = χ(X), as required.
Lemma 6. Let f (x) = a
dx
d+. . .+a
0, a
d6= 0, be a polynomial. Then ϕ(x) = sgn f (x) is a constructible function. For 2 ≤ k ≤ d define V
k= {x ∈ R | f (x) = . . . = f
(k−1)(x) = 0}
and put Z
k= P
x∈Vk
sgn f
(k)(x). Then
∫ ϕ = sgn a
d− (Z
2+ Z
4+ . . . + Z
d), for d even;
−(Z
2+ Z
4+ . . . + Z
d−1), for d odd.
P r o o f. Clearly sgn f (x) is constructible. Let x
1< . . . < x
pbe the real roots of f . Take R > 0 such that −R < x
1and x
p< R. Put x
0= −R and x
p+1= R. For 0 ≤ i ≤ p + 1, let k(i) = min{j ≥ 0 | f
(j)(x
i) 6= 0}, and S
i= sgn f
(k(i))(x
i).
The sign of f on (x
i, x
i+1) is constant and equals S
i= (−1)
k(i+1)S
i+1. We have ϕψ
R1=
p
X
i=0
1
2 S
i+ (−1)
k(i+1)S
i+11
[xi,xi+1]−
p
X
i=1
(−1)
k(i)+ 1S
i1
{xi}.
Hence Z
ϕ = 1
2 (S
0+ S
p+1) −
p
X
i=1
1
2 (−1)
k(i)+ 1S
i= 1
2 (S
0+ S
p+1) − (Z
2+ Z
4+ . . .).
If d is even then
12(S
0+ S
p+1) = sgn a
d. If d is odd then
12(S
0+ S
p+1) = 0. This ends the proof of Lemma 6.
Proposition 7. Let W be an irreducible real algebraic subset of R
nand A denote the ring of real polynomials on W . Let f ∈ A[X]. Then there exist a finite family of polynomials ψ
i∈ A and a proper algebraic subset Σ ⊂ W such that for every w ∈ W \ Σ
Z
R
sgn f (w, · ) = X
sgn ψ
i(w).
P r o o f. Let f = a
rx
r+ . . . + a
0, where a
i∈ A. We may suppose a
r6= 0 in A. Then for w ∈ W \ a
−1r(0), R
R
sgn f (w, · ) is calculated in Lemma 6.
For each 1 ≤ k ≤ r, we apply the construction of Section 1 to the ideal I = (h
1, . . . , h
k) generated by h
1= f, . . . , h
k= ∂
k−1f /∂X
k−1and g = ∂
kf /∂X
k. Then, by Proposition 1 and Corollary 3, each of Z
kof Lemma 6 is a finite sum of signs of polynomials in w as required. This shows the proposition.
Proposition 8. Let W be a real algebraic set and A denote the ring of polynomials on W . Let f ∈ A[X]. Then there exists a finite family of polynomials γ
i∈ A such that for every w ∈ W
(4)
Z
R
sgn f (w, · ) = X
i
sgn γ
i(w).
P r o o f. The proof is by induction on dim W and the number of irreducible compo- nents of W .
If W is irreducible then, by Proposition 7, we may find a finite family of polynomials γ
k0∈ A satisfying (4) in the complement of the proper algebraic subset Σ of W . By the inductive assumption there exists a finite family of polynomials γ
j00on Σ satisfying (4) on Σ. We consider γ
j00as the restriction of polynomials on W . Let P ∈ A be any non- negative polynomial such that P
−1(0) = Σ. Then
sgn P γ
0k= sgn γ
k0, on W \ Σ;
0, on Σ.
Similarly
sgn γ
j00− sgn P γ
j00= 0, on W \ Σ;
sgn γ
j00, on Σ, and hence the family {P γ
k0, γ
00j, −P γ
j00} satisfies the statement.
Suppose W
0⊂ W is an irreducible component of W and let W
00be the union of the other components. Let γ
k0(resp. γ
j00) be the family satisfying (4) on W
0(resp. W
00).
Let P ∈ A be any non-negative polynomial such that P
−1(0) = W
0. Then, by the same
argument as above, the family {P γ
k0, γ
j00, −P γ
j00} satisfies the statement. This ends the
proof.
3. Proof of Theorem (proper case). Suppose F : Y → R
nis proper. Replacing Y by the graph of F we may assume that Y ⊂ R
n× R
mand F is induced by the projection on the first factor.
The proof is by induction on m (we do not assume n to be fixed). Suppose m = 1 and Y is the zero set of a non-negative polynomial function f (y, x). We apply Proposition 8 to W = R
nand A = R[y]. Note that, since F is proper, F
−1(y) has to be finite and χ(F
−1(y)) = 1 − R
R
sgn f (y, · ). Hence the result follows from Proposition 8.
Inductive step. Let p : Y → R
n× R
1denote the projection. By the inductive hypoth- esis we may assume that there exists a finite family of polynomials f
i(y, x
1) such that for each (y, x
1) ∈ R
n× R
(5) χ(p
−1((y, x
1))) = X
i
sgn f
i. Define ϕ(y, x
1) = χ(p
−1((y, x
1)). We claim that
(6)
Z
R
ϕ(y, · ) = χ(F
−1(y)).
Indeed, this follows from a “Fubini-type” formula for the Euler integral, (7)
Z
{y}×R
ϕ(y, · ) = Z
{y}×R
p
∗1
Y= Z
F−1(y)
1
Y= χ(F
−1(y)), see, e.g., [V], [MP, A.4.2]. Then, by (5) and (6)
χ(F
−1(y)) = X
i
Z
R
sgn f
i(y, · ), and the theorem again follows from Proposition 8.
4. Proof of Theorem (general case). The proof presented in the previous sections does not work in general since the “Fubini type” formula (7) fails for non-proper maps.
To complete the proof in the general case we use the projective compactification and the link at infinity. We shall also need the following corollary of the theorem.
Proposition 9. Let Y ⊂ R
mbe algebraic and F : Y → R×R
nbe a proper polynomial map. Then there exists a finite family of polynomials γ
i(y), where y ∈ R
n, such that
lim
t→0+
χ(F
−1(t, y)) = X
sgn γ
i(y).
P r o o f. The proposition follows easily from the theorem and the following lemma.
Lemma 10. Let W be real algebraic and g(t, w) be a polynomial on R × W . Then there exists a finite family of polynomials γ
i(w) on W such that
(9) lim
t→0+