This paper provides a complete characterization of when the Newton number remains monotonic for surface singularities, solving Arnold's problem from 1982 by relating Newton polyhedra and their associated invariants.
Contribution
It introduces a simple condition based on Newton polyhedra that characterizes the equality of Newton numbers for surface singularities, addressing Arnold's longstanding problem.
Findings
01
Characterization of Newton number equality in terms of Newton polyhedra
02
Complete solution to Arnold's problem for surface singularities
03
Conditions for monotonicity of the Newton number
Abstract
According to the Kouchnirenko theorem, for a generic (precisely non-degenerate in the Kouchnirenko sense) isolated singularity f its Milnor number μ(f) is equal to the Newton number ν(Γ+(f)) of a combinatorial object associated to f, the Newton polyhedron Γ+(f). We give a simple condition characterising, in terms of Γ+(f) and Γ+(g), the equality ν(Γ+(f))=ν(Γ+(g)), for any surface singularities f and g satisfying Γ+(f)⊂Γ+(g). This is a complete solution to an Arnold's problem (1982-16) in this case.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Arnold’s problem on monotonicity of the Newton number for surface singularities
Szymon Brzostowski
,
Tadeusz Krasiński
and
Justyna Walewska
Wydział Matematyki i Informatyki, Uniwersytet Łódzki, Banacha 22, 90-238 Łódź, Poland
According to the Kouchnirenko Theorem,
for a generic (precisely non-degenerate in the Kouchnirenko sense) isolated singularity f its
Milnor number μ(f) is equal to the Newton number ν(Γ+(f)) of a combinatorial object associated to f, the
Newton polyhedron Γ+(f). We give a simple condition characterising,
in terms of Γ+(f) and Γ+(g), the equality ν(Γ+(f))=ν(Γ+(g)), for any
surface singularities f and g satisfying Γ+(f)⊂Γ+(g). This is a complete solution to an Arnold’s problem (1982-16) in this
case.
Key words and phrases:
Milnor number, non-degenerate singularity, Newton
polyhedron, Arnold’s problem
2010 Mathematics Subject Classification:
14B07, 32S30
1. Introduction
Let f:(\mathbbmCn,0)→(\mathbbmC,0) be an
isolated singularity (that is f possesses an isolated critical
point at 0∈\mathbbmCn), in the sequel: a singularity, in
short. The Milnor number μ(f) (see [9]) of a generic f can be expressed,
as proved by Kouchnirenko [7], using a combinatorial object associated to f,
the Newton polyhedron Γ+(f)⊂\mathbbmR⩾0n. More precisely, under an appropriate non-degeneracy condition imposed on
f, it holds μ(f)=ν(Γ+(f)), where ν(Γ+(f)) is the Newton
number of Γ+(f). For Γ+(f)convenient (which means that the Newton polyhedron contains a point on each coordinate axis) the latter number is equal to
[TABLE]
where Vn is the n-dimensional volume of the (usually non-convex)
polyhedron ‘under’ Γ+(f), Vn−1 is the sum of (n−1)-dimensional volumes of the polyhedra ‘under’ Γ+(f) on all
hyperplanes {xi=0}, Vn−2 is the sum of (n−2)-dimensional
volumes of the polyhedra ‘under’ Γ+(f) on all hyperplanes {xi=xj=0}, and so on.
In his acclaimed list of problems, V. I. Arnold posed the following
([1, 1982-16]):
‘Consider a Newton polyhedron Δ in \mathbbmRn and the number
μ(Δ)=n!V−Σ(n−1)!Vi+Σ(n−2)!Vij−⋯, where V is the volume under Δ, Vi is the volume under
Δ on the hyperplane xi=0, Vij is the volume under
Δ on the hyperplane xi=xj=0, and so on.
Then μ(Δ) grows (non strictly
monotonically) as Δ grows (whenever Δ remains coconvex
and integer?). There is no elementary proof even for n=2.’
(here, Arnold’s terminology slightly differs from ours: Δ should
be understood as \mathbbmR⩾0n\leavevmode∖\leavevmodeΓ+(f) for a singularity
f, and then μ(Δ)=ν(Γ+(f))). In the comments to the problem,
S. K. Lando wrote that the monotonicity of μ(Δ) follows from the
semi-continuity of the spectrum of a singularity, proved independently by
A. N. Varchenko [13] and by J. Steenbrink [12], and that he himself had given an
elementary proof for n=2 (unpublished). Such a proof (for n=2) was eventually
published by A. Lenarcik [8]. In the case of an arbitrary n, other
proofs were offered by M. Furuya [4],
J. Gwoździewicz [6] and C. Bivià-Ausina [3].
In the present paper we essentially complete the solution of the
problem for surface singularities, i.e. for n=3. More specifically, we
prove not only the monotonicity property of the Newton number, but also we
give a simple geometrical condition characterising the situations in which
this monotonicity is strict. We may describe this condition in the following
intuitive way (for the precise statement see Theorem 1): for any f,g:(\mathbbmC3,0)→(\mathbbmC,0) such that Γ+(f)⊂Γ+(g) one has ν(Γ+(f))=ν(Γ+(g)) if,
and only if, Γ+(f) and Γ+(g) differ by (possibly several)
pyramids with bases in the coordinate planes and heights equal to 1. The
proof we propose is purely geometrical and elementary. We believe that a
similar result should be valid in the n-dimensional case, but, if one simply
tries to mimic the proof offered here, the amount of new combinatorial
complications seems to increase enormously. We also expect that our result (and
its potential multidimensional generalization) will have interesting
applications in many aspects of effective singularity theory, e.g.:
computation of the Łojasiewicz exponent, jumps of the Milnor numbers in
deformations of singularities, searching for tropisms of "partial" gradient ideals
(∂z1∂f,…,∂zi∂f,…,∂zn∂f)On of an
isolated singularity f, etc.
Similar problem characterizing f for which μ(f) is minimal (and equal to ν(Γ+(f))) among all singularities with the same Newton polyhedron Γ+(f) is given in the recent paper by P. Mondal [10].
2. Polyhedra
According to the standard definitions (see e.g. M. Berger [2]), a convex
n-polyhedron in \mathbbmRn is an intersection of a finite family of
closed half-spaces of \mathbbmRn, having non-empty interior. An
n-polyhedron in \mathbbmRn is a union of finitely many convex
n-polyhedra in \mathbbmRn. Let k⩽n; a k-polyhedron
in \mathbbmRn is a finite union of k-polyhedra in k-dimensional
affine subspaces of \mathbbmRn. A compact connected k-polyhedron in
\mathbbmRn is called a k-polytope in \mathbbmRn.
For convenience, we introduce the following notations. Let \mathbbmP,\mathbbmQ⊂\mathbbmRn be two k-polyhedra. The polyhedral
difference (p-difference) of \mathbbmP and \mathbbmQ is the
closure of their set-theoretical difference, in symbols
[TABLE]
One can check that \mathbbmP−\mathbbmQ is also a k-polyhedron in
\mathbbmRn, or an empty set. We say that \mathbbmP and \mathbbmQ
are relatively disjoint, if their relative interiors are disjoint (in
appropriate k-dimensional affine subspaces). In particular, two
n-polyhedra in \mathbbmRn are relatively disjoint if their interiors
are disjoint.
We define the Newton polyhedra in an abstract way without any relation to singularities. A subset Γ+⊂\mathbbmR⩾0n is said to be a Newton polyhedron when
there exists a subset A⊂\mathbbmN0n such that
[TABLE]
For such an A we will write Γ+=Γ+(A). In the sequel we will
assume that are no superfluous points in A, implying A is precisely
the set of all the vertices of Γ+.
Remark 1**.**
In the context of singularity theory, we take A=suppf, where f=∑\mathbbmi∈\mathbbmN0na\mathbbmiz\mathbbmi
around [math] and suppf:={\mathbbmi∈\mathbbmN0n:a\mathbbmi=0}.
A Newton polyhedron Γ+ is called convenient if Γ+ intersects all coordinate axes of
\mathbbmRn. Since \mathbbmN0n is a lattice in
\mathbbmR⩾0n, the boundary of a convenient polyhedron
Γ+ is a finite union of convex (n−1)-polytopes (compact
facets) and a finite union of convex unbounded (n−1)-polyhedra
(unbounded facets) lying in coordinate hyperplanes. By Γ we
will denote the set of these compact facets, and sometimes – depending on the
context – also their set-theoretic union. The closure of the complement of
Γ+ in \mathbbmR⩾0n will be denoted by Γ−,
i.e.
[TABLE]
It is an n-polytope in \mathbbmRn provided Γ−=∅. Hence, Γ− has finite
n-volume. Similarly, for any ∅=I⊂{1,…,n}, Γ− restricted to the coordinate hyperplane
\mathbbmR⩾0I:={(x1,…,xn)∈\mathbbmR⩾0n:xi=0 for i∈I}, that is Γ−I:=Γ−∩\mathbbmR⩾0I, has finite (#I)-volume. Consequently, we may define the Newton
number ν(Γ+) of convenient Γ+ by the formula
[TABLE]
where Vi denotes the sum of i-volumes of Γ−I, for all
∅=I⊂{1,…,n} satisfying #I=i. Note that V0=1 if Γ−=∅ and V0=0 if Γ−=∅. Hence ν(R⩾0n)=0. Clearly,
we may also extend the domain of this definition to any n-polytope
\mathbbmP in \mathbbmRn; thus ν(\mathbbmP) makes sense. Then
for any Newton polyhedron Γ+ we have ν(Γ+)=ν(Γ−). We will use both notations interchangeably.
The following notions will be useful in our proof. Let B be a compact (n−1)-polyhedron in an (n−1)-dimensional hyperplane H⊂\mathbbmRn and Q∈\mathbbmRn∖H. A pyramid \mathbbmP(B,Q) with apex
Q and base B is by definition the cone, cone(B,Q), with
vertex Q and base B.
By ([2, 12.2.2, p. 13]), the n-volume of \mathbbmP(B,Q) can be computed using the elementary formula
[TABLE]
Finally, if P0,…,Pk∈\mathbbmRn are linearly independent points, then
by Δ(P0,…,Pk) we denote the k-simplex with vertices
P0,…,Pk.
3. The main Theorem
Let Γ+, Γ+ be two convenient Newton polyhedra such
that Γ+Γ+. Then
[TABLE]
for some points P1,…,Pk lying under Γ+, i.e. Pi∈\mathbbmN0n∖Γ+. In such situation Γ+
will also be denoted by Γ++{P1,…,Pk} or Γ+P1,…,Pk. Clearly, Γ++{P1,…,Pk}=(Γ++{P1,…,Pk−1})+Pk and hence ν(Γ++{P1,…,Pk})=ν((Γ++{P1,…,Pk−1})+Pk). Since
moreover
[TABLE]
it suffices to consider the monotonicity of the Newton number
for polyhedra defined by sets which differ in one point only, i.e. for Newton
polyhedra Γ+ and Γ+P, for some P∈\mathbbmN0n∖Γ+.
Theorem 1**.**
Let Γ+ be a convenient Newton polyhedron in
\mathbbmR⩾03 and let a lattice point P lie under
Γ+ i.e. P∈\mathbbmN03∖Γ+. Then
(1)
ν(Γ+P)⩽ν(Γ+),
2. (2)
ν(Γ+P)=ν(Γ+)* if, and only if,
there exists a coordinate plane H such that P∈H and Γ+P−Γ+ is a pyramid with base (Γ+P−Γ+)∩H and of
height equal to 1.*
Remark 2**.**
We believe that the same theorem is true, mutatis mutandis, in the
n-dimensional case. In the simpler case n=2, the theorem is well-known
([6], [8] or [5]).
Remark 3**.**
In the particular case when Γ+P−Γ+ is a 3-dimensional simplex item 2 follows from Lemma (2.2) in [11].
Example 1**.**
Let us illustrate the second item of the theorem with some figures. Let P
lying under Γ+ be such that ν(Γ+P)=ν(Γ+). Up
to permutation of the variables, we have the following, essentially
different, possible locations for P:
(1)
P* lies in the plane {z=0} and not on axes (Figure 2(a)),*
2. (2)
P* lies in the plane {z=0} and on the axis Ox
(Figure 2(b)).*
Remark 4**.**
Item 2 of Theorem 1 can be
equivalently stated as follows:
2’.
ν(Γ+P)<ν(Γ+)* if, and only if, one of the
following two conditions is satisfied:*
(a)
P* lies in the interior of Γ− i.e. P∈Int(Γ−),*
2. (b)
for each coordinate plane H such that P∈H the p-difference
Γ+P−Γ+ is either a pyramid with base (Γ+P−Γ+)∩H and of height greater or equal to 2, or an
n-polytope with at least two vertices outside of H.
Example 2**.**
The (weaker) requirement that the p-difference Γ+P−Γ+ should lie
in ‘a wall’ of thickness 1 around a coordinate plane is not sufficient for
the equality ν(Γ+P)=ν(Γ+). In fact, if Γ+ is
the Newton polyhedron of the surface singularity f(x,y,z):=x6+2y6+z(x2+y2)+z4 and P=(3,2,0), then:
(1)
ν(Γ+)=15, ν(Γ+P)=13,
2. (2)
Γ+P−Γ+* is a 3-polytope with ‘base’ (Γ+P−Γ+)∩Oxy and of height 1, but it is not a pyramid; it
has two vertices above Oxy.*
4. Proof of the Theorem
Let Γ+ be a convenient Newton polyhedron in \mathbbmR⩾03. Let P∈\mathbbmN03∖Γ+ denote a lattice point under Γ+.
Item 1 of the theorem will be proved in the course of the proof of
item 2, because we will in fact show that the negation of the
combinatorial condition in item 2 implies the strict inequality ν(Γ+P)<ν(Γ+).
We first prove that the combinatorial condition in item 2 implies the equality ν(Γ+)=ν(Γ+P). Without loss of generality we may assume that, having fixed coordinates (x,y,z) in \mathbbmR3, we
have: H={z=0}, P∈H and Γ+P−Γ+ is a pyramid
with base (Γ+P−Γ+)∩H and of height equal to 1. We must
show that ν(Γ+P)=ν(Γ+). Since Γ+P−Γ+=Γ−−Γ−P, but the latter is a p-difference of two polytopes, we
prefer to reason in terms of Γ− and Γ−P instead.
We have three possibilities:
1.P does not lie on any axis, that is P∈Ox and P∈Oy. Then the polytopes Γ− and Γ−P are identical on
Ox, Oy, Oz, Oxz and Oyz.
Denoting by W the p-difference polygon of Γ− and Γ−P in
Oxy, we have by (1)
[TABLE]
2.P lies on Ox or Oy and P=0. Up to renaming of the
variables, we may assume that P∈Ox. Hence and by the assumption that Γ+ is convenient the apex of the pyramid must lie in the plane Oxz. Denoting W:=(Γ−−Γ−P)∩Oxy and L:=(Γ−−Γ−P)∩Ox, we have
[TABLE]
3.P=0. Then Γ−P=∅. By the assumption that Γ+ is convenient the apex of the pyramid must be (0,0,1). Hence, if we denote by Lx, Ly, Lz, Wxy, Wxz, Wyz the intersections of Γ− with coordinate axes and plane, respectively, then
[TABLE]
Let us pass to the proof of the inverse implication in item 2 of the
theorem. Assume to the contrary, that the combinatorial condition in item
2 does not hold. Consider possible cases:
1.P does not lie in any coordinate plane. Then the p-difference
Γ−−Γ−P is an 3-polytope, disjoint from all the coordinate planes.
Hence,
[TABLE]
2.P lies in a coordinate plane, but not on any axis.
Without loss of generality, we may assume that P∈Oxy\(Ox∪Oy). Then the p-difference 3-polytope Γ−−Γ−P is disjoint from the planes Oxz and Oyz, but
W:=(Γ−−Γ−P)∩Oxy=∅ (Figure 3(a)).
According to Remark 4, we should examine the following
possibilities:
a)Γ−−Γ−P is a pyramid with base W and
of height h⩾2. We have
[TABLE]
b) There are at least two vertices of Γ−−Γ−P lying above Oxy. Denote them by Q1,…,Qr,
where r⩾2. W itself is a polygon in Oxy of the shape
depicted in Figure 3(a).
Naturally, W is a union of relatively disjoint triangles W1,…,Wk, k⩾1, with one common vertex P. Let us enumerate all the
other vertices of W according to their increasing y-coordinate and
denote them by R1,…,Rk+1; then we may put W1=Δ(R1,R2,P), W2=Δ(R2,R3,P), …, Wk=Δ(Rk,Rk+1,P) (see Figure 3(b)).
We claim that each Wi is the base of a pyramid \mathbbmPi with apex
in {Q1,…,Qr} such that \mathbbmPi⊂(Γ−−Γ−P) and, moreover, all the \mathbbmPi are pairwise relatively
disjoint. In fact, each side RiRi+1 is an edge of a 2-dimensional
facet of Γ, say Fi(i=1,…,k). Clearly, the facets Fi
are pairwise relatively disjoint and their vertices above Oxy are
among Q1,…,Qr. The pyramids \mathbbmP(Fi,P)(i=1,…,k) are also pairwise relatively disjoint and lie in Γ−−Γ−P. Moreover, the pyramids are all convex, Fi being convex.
For every Fi choose arbitrarily Qji such that Qji is a
vertex of Fi(i=1,…,k). Define new pyramids \mathbbmPi:=\mathbbmP(Wi,Qji). Since Wi is a facet of \mathbbmP(Fi,P), we have
\mathbbmPi⊂\mathbbmP(Fi,P) and so \mathbbmPi are
pairwise relatively disjoint and lie in Γ−−Γ−P(i=1,…,k), as desired.
Let hi be the height of \mathbbmPi. Clearly, hi⩾1(i=1,…,k). Moreover, the union ⋃1⩽i⩽k\mathbbmPi is not equal to Γ−−Γ−P because any
edge joining a pair of vertices from Q1,…,Qr (such edges always
exist) does not belong to any of the pyramids \mathbbmP1,…,\mathbbmPk, but such an edge is an edge of the 3-polytope Γ−−Γ−P. Consequently, V:=(Γ−−Γ−P)−⋃1⩽i⩽k\mathbbmPi is a non-empty compact 3-polyhedron. We have
[TABLE]
3.P lies on an axis and P=0. For definiteness, let P∈Ox. Then the
p-difference 3-polytope Γ−−Γ−P is disjoint from the plane
Oyz and from the axes Oy, Oz. Similarly as in 2(b)
we divide the polygons W:=(Γ−−Γ−P)∩Oxy and W:=(Γ−−Γ−P)∩Oxz into triangles W1,…,Wk, k⩾1, and W1,…,Wk, k⩾1, respectively, all of them having P as the (only) common vertex.
We also arrange them such that Wi=Δ(Ri,Ri+1,P) (resp. Wj=Δ(Rj,Rj+1,P)), where the points R1,…,Rk+1 (resp. R1,…,Rk+1) are
enumerated according to their increasing y- (resp. z-) coordinates (see
Figure 4). Observe that, in particular, R1=R1.
Claim**.**
W1,…,Wk* and W1,…,Wk are bases of some
3-pyramids \mathbbmP1,…,\mathbbmPk and
\mathbbmP1,…,\mathbbmPk,
respectively, all of which are pairwise relatively disjoint, possibly except
for the pair \mathbbmP1 and \mathbbmP1, lie in Γ−−Γ−P and whose vertices are taken from the set of vertices of
Γ+. Moreover, if \mathbbmP1 and \mathbbmP1 are not
relatively disjoint, then the triangle Δ(R1,R2,R2) is a facet of
Γ and \mathbbmP1=\mathbbmP1=Δ(R1,R2,R2,P).*
Proof of Claim.
The segments R1R2, R2R3,
… are edges of uniquely determined facets, say F1,…,Fk, of
Γ. Clearly, F1,…,Fk are pairwise relatively disjoint.
Similarly, R1R2, R2R3, …
are edges of uniquely determined facets, say F1,…,Fk, of Γ. It may happen that some Fi are equal
to some Fj (see Figure 5(a)).
Removing the duplicated facets from the sequence F1,…,Fk,F1,…,Fk, we obtain a new sequence
\mathbbmF1,…,\mathbbmFl of pairwise relatively disjoint
facets of Γ (Figure 5(b)) having the following properties:
•
each side RiRi+1(i=1,…,k) is an edge of a unique
\mathbbmFs and, similarly, each side RjRj+1(j=1,…,k) is an edge of a unique
\mathbbmFs, s,s∈{1,…,l},
•
each \mathbbmFs(s=1,…,l) has either one or at most
two of its edges among R1R2, …,RkRk+1, R1R2, …, RkRk+1.
Upon renaming the \mathbbmFs, we may assume that \mathbbmF1 has
R1R2 as one of its edges. For each s∈{1,…,l} we build
the 3-pyramid \mathbbmP(\mathbbmFs,P). These pyramids are
convex, pairwise relatively disjoint, lie in Γ−−Γ−P and each of
them has either one or at most two of its edges among R1R2, …,RkRk+1, R1R2, …, RkRk+1. Hence, each \mathbbmP(\mathbbmFs,P)(s=1,…,l) has either one or at most two of its facets among W1,
…,Wk, W1, …, Wk. In order to
prove the claim, we only need to build the \mathbbmP1,…,\mathbbmPk, \mathbbmP1,…,\mathbbmPk as appropriately chosen pyramids hiding
inside the larger \mathbbmP(\mathbbmFs,P)(s=1,…,l).
Fix s0∈{1,…,l}. If \mathbbmP(\mathbbmFs0,P) has only one facet among W1,
…,Wk, W1, …, Wk, then we
simply consider a pyramid whose base is equal to this facet and whose apex
is chosen as any other vertex of \mathbbmFs0; such pyramid is then
contained in \mathbbmP(\mathbbmFs0,P).
If \mathbbmP(\mathbbmFs0,P) has two facets among W1, …,Wk, W1, …, Wk, then, by our
construction, one of them is equal to some Wp, where p∈{1,…,k}, and the other one is equal to some Wq, where q∈{1,…,k}. Excluding s0=1, we notice that there exist two
relatively disjoint pyramids contained in \mathbbmP(\mathbbmFs0,P): one has its base equal to Wp, the other one has base Wq,
and both of them have their apices appropriately chosen from
\mathbbmFs0. This follows from the fact that if s0⩾2,
then the facet \mathbbmFs0 has at least four vertices (see Figure 5(b)),
Rp, Rp+1, Rq,Rq+1, which allows us to construct relatively disjoint pyramids \mathbbmPp:=Δ(P,Rp,Rp+1,Rq) of base Wp and \mathbbmPq:=Δ(P,Rq,Rq+1,Rp+1) of base Wq, both of them contained inside the pyramid \mathbbmP(\mathbbmFs0,P) (see Figure 6).
Now, let us treat the case s0=1 and \mathbbmF1 has two of its
facets among W1, …,Wk, W1, …,
Wk. According to our earlier arrangements, one of these
facets is equal to W1 and the other one has to be equal to W1.
If \mathbbmF1 is not equal to the triangle Δ(R1,R2,R2), i.e. \mathbbmF1 has a fourth vertex, say Q, we may
take \mathbbmP1:=\mathbbmP(W1,Q), \mathbbmP1:=\mathbbmP(W1,Q). These pyramids are relatively
disjoint and lie in \mathbbmP(\mathbbmF1,P). Such choice of
pyramids is impossible if \mathbbmF1=Δ(R1,R2,R2),
hence in this case we simply put \mathbbmP1=\mathbbmP1:=Δ(R1,R2,R2,P)=\mathbbmP(W1,R2)=\mathbbmP(W1,R2).
Since each W1,…,Wk, W1,…,Wk
is a facet of some \mathbbmP(\mathbbmFs,P), where s∈{1,…,l}, we have constructed pyramids \mathbbmP1,…,\mathbbmPk,\mathbbmP1,…,\mathbbmPk with all the required
properties.
◊
Denote by hi and hj the heights of \mathbbmPi and
\mathbbmPj, respectively. They are positive integers. Take the p-difference V:=(Γ−−Γ−P)−⋃1⩽i⩽k\mathbbmPi−⋃1⩽j⩽k\mathbbmPj. Then V is either empty or it is a compact 3-polyhedron. Let L:=R1P=(Γ−−Γ−P)∩Ox, that is L be the
p-difference (Γ−−Γ−P) on the axis Ox.
According to the above claim, we have two possibilities to consider:
a)\mathbbmP1=\mathbbmP1. Using
formula (1), we compute
[TABLE]
This gives the required inequality. Notice that in this case we actually do not use the assumption that
Γ−−Γ−P is not a pyramid of height one.
b)\mathbbmP1=\mathbbmP1=Δ(R1,R2,R2,P) and Δ(R1,R2,R2) is a face of
Γ. We have
[TABLE]
Since W1=\mathbbmP(L,R2), W1=\mathbbmP(L,R2) are two perpendicular facets of Δ(R1,R2,R2,P), we can continue the above equality
[TABLE]
This shows that, whatever the situation, it holds ν(Γ+)−ν(Γ+P)⩾0 in this case. Moreover, ν(Γ+)−ν(Γ+P)>0 if, and only if, one of the following three conditions is
satisfied:
(i)
V=∅,
2. (ii)
there exists hi, i∈{2,…,k} or hj, j∈{2,…,k} greater or equal to 2,
3. (iii)
both h1 and h1 are greater or equal to
2.
Hence, the proof of the theorem will be finished once we show that the
assumption ‘Γ−−Γ−P is not a pyramid of height one’ implies
at least one of these conditions.
To this end assume that (iii) is not satisfied i.e. h1=1 or
h1=1, say h1=1 (see Figure 7).
Since \mathbbmP1=\mathbbmP(W1,R2) is a pyramid with
base W1 contained in a coordinate plane and of height 1, our assumption
implies that Γ−−Γ−P=\mathbbmP1. Hence, there exists
a facet F∈Γ of Γ−−Γ−P sharing the edge
R2R2 in common with the facet \mathbbmF1=Δ(R1,R2,R2).
If F has some vertex Q outside of Oxy∪Oxz (see Figure 8), then
(i) holds because F is not entirely covered by the pyramids \mathbbmP2,…,\mathbbmPk,\mathbbmP2,…,\mathbbmPk (see explanations below) which implies F−⋃2⩽i⩽k\mathbbmPi−⋃2⩽j⩽k\mathbbmPj lies in the boundary of (Γ−−Γ−P)−⋃1⩽i⩽k\mathbbmPi−⋃1⩽j⩽k\mathbbmPj i.e. in the boundary of V. Hence V=∅ i.e. (i) holds.
To see F is not entirely covered by the pyramids \mathbbmP2,…,\mathbbmPk,\mathbbmP2,…,\mathbbmPk we consider the three possible cases:
1.F has no edges in Oxy∪Oxz. Then F is not equal to any F2,…,Fk,F2,…,Fk considered it the proof of Claim. Hence by construction of \mathbbmP2,…,\mathbbmPk,\mathbbmP2,…,\mathbbmPk the facet F is not covered by them. Precisely F−⋃2⩽i⩽k\mathbbmPi−⋃2⩽j⩽k\mathbbmPj=F.
2.F has only one edge in Oxy∪Oxz. Then F is equal either to F2 or to F2. Since in this case F has at least 4 vertices the pyramid either \mathbbmP2 or \mathbbmP2, inscribed in \mathbbmP(F,P) according to our construction of \mathbbmP1,…,\mathbbmPk,\mathbbmP1,…,\mathbbmPk, does not cover entirely F (notice \mathbbmP2 and \mathbbmP2 has only triangles as facets). Consequently F−\mathbbmP2 or F−\mathbbmP2 is not empty.
3.F has two edges in Oxy∪Oxz, necessarily one in Oxy and one in Oxz. Then F=\mathbbmFi for some i∈{2,…,l}. Since in this case F has at least 5 vertices and two pyramids \mathbbmPi′ and \mathbbmPj (for some i′∈{2,…,k} and j∈{2,…,k}), inscribed in \mathbbmP(\mathbbmFi,P), have triangles as facets then F−\mathbbmPi′−\mathbbmPj is not empty.
If all the vertices of F belong to Oxy∪Oxz, then
there are only three possible scenarios:
(⋆)
F is a convex quadrilateral; then apart from R2 and
R2, it has only two further vertices, necessarily R3 and
R3 (see Figure 9(a)).
(⋆⋆)
F is a triangle with the third vertex lying in
Oxy; this vertex is necessarily R3 (see Figure 9(b)).
(⋆⋆⋆)
F is a triangle with the third vertex lying
in Oxz; this vertex is necessarily R3 (see Figure 9(c)).
In case (⋆) our construction of \mathbbmPi,
\mathbbmPj shows that either \mathbbmP2 or
\mathbbmP2 has its height greater than or equal to 2. Hence,
(ii) is satisfied.
In case (⋆⋆) we are in a position to repeat the above
construction of F, this time for the edge R3R2 instead of
R2R2, which leads to some new facet F′. To this facet F′
also applies the same case analysis as the one previously performed for
F.
In case (⋆⋆⋆) we have two options: the first one h1⩾2; then our construction of \mathbbmP2 shows that we must have
h2=h1⩾2 so we get condition (ii).
If, however, h1=1, we are in the position to repeat the above
construction of F, this time for the edge R2R3 instead of
R2R2, which leads to some new facet F′. To this facet F′
also applies the same case analysis as the one previously performed for F.
We see that, after finitely many steps, we either find a facet F∈Γ of Γ−−Γ−P with one of its vertices outside of
Oxy∪Oxz (then V=∅ and then (i)
holds), or we discover that (ii) holds.
4.P=0. Then Γ−P=∅ and consequently ν(Γ+)−ν(Γ+P)=ν(Γ−)−ν(Γ−P)=ν(Γ−). By assumption Γ− is not a pyramid of base in a coordinate plane and height 1. Hence Γ+ intersects axes at points with coordinates greater or equal to 2. Take auxiliary point P=(1,0,0) on axis Ox liying under Γ+. Then Γ−−Γ−P is also not a pyramid of height 1. Hence by 3ν(Γ+)−ν(Γ+P)>0. Since Γ−P is a pyramid of height 1 then ν(Γ−P)=0. But Γ−=(Γ−−Γ−P)∪Γ−P and of course ν((Γ−−Γ−P)∪Γ−P)=ν(Γ−−Γ−P)+ν(Γ−P). Hence ν(Γ−)=ν(Γ−−Γ−P)=ν(Γ−)−ν(Γ−P)=ν(Γ+)−ν(Γ+P)>0. This ends the proof.
Corollary**.**
Let Γ+ be a convenient Newton polyhedron in R⩾03. Then ν(Γ+)⩾0. Moreover, ν(Γ+)=0 if and only if Γ+=R⩾03 or Γ+ intersects one of axes at the point with coordinate equal to 1.
Remark 5**.**
The last corollary was proved by M. Furuya [4], Corollary 2.4, in n-dimensional case.
Bibliography13
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] V. I. Arnold. Arnold’s problems . Springer-Verlag, Berlin; PHASIS, Moscow, 2004. Translated and revised edition of the 2000 Russian original, With a preface by V. Philippov, A. Yakivchik and M. Peters.
2[2] M. Berger. Geometry II . Universitext. Springer-Verlag, Berlin, 1987. Translated from the French by M. Cole and S. Levy.
3[3] C. Bivià-Ausina. Local łojasiewicz exponents, Milnor numbers and mixed multiplicities of ideals. Math. Z. , 262(2):389–409, 2009.
4[4] M. Furuya. Lower bound of Newton number. Tokyo J. Math. , 27(1):177–186, 2004.
5[5] G.-M. Greuel and H. D. Nguyen. Some remarks on the planar Kouchnirenko’s theorem. Rev. Mat. Complut. , 25(2):557–579, 2012.
6[6] J. Gwoździewicz. Note on the Newton number. Univ. Iagel. Acta Math. , (46):31–33, 2008.
7[7] A. G. Kouchnirenko. Polyèdres de Newton et nombres de Milnor. Invent. Math. , 32(1):1–31, 1976.
8[8] A. Lenarcik. On the Jacobian Newton polygon of plane curve singularities. Manuscripta Math. , 125(3):309–324, 2008.