Math 2.0

Algebraic geometry Tropical geometry Theorem

Bernstein–Kushnirenko theorem

Builds on Algebraic torusNewton polytope

Statement

Let n≥1n \ge 1 and let f1,…,fnf_1, \dots, f_n be Laurent polynomials in ℂ[x1±1,…,xn±1]\C[x_1^{\pm 1}, \dots, x_n^{\pm 1}]. For each ii, let Pi⊂ℝnP_i \subset \R^n be the Newton polytope of fif_i. It is the convex hull of the exponents of the monomials of fif_i with nonzero coefficient. Let MV⁡(P1,…,Pn)\operatorname{MV}(P_1, \dots, P_n) be the mixed volume, the coefficient of λ1λ2⋯λn\lambda_1 \lambda_2 \cdots \lambda_n in the polynomial vol⁡n(λ1P1+⋯+λnPn)\operatorname{vol}_n(\lambda_1 P_1 + \cdots + \lambda_n P_n) in λ1,…,λn≥0\lambda_1, \dots, \lambda_n \ge 0. Then:

  1. The number of isolated common zeros of f1,…,fnf_1, \dots, f_n in the algebraic torus (ℂ∗)n(\C^*)^n, counted with multiplicity, is at most MV⁡(P1,…,Pn)\operatorname{MV}(P_1, \dots, P_n).
  2. Fix the supports and take generic coefficients. Then all common zeros in (ℂ∗)n(\C^*)^n are simple, and their number equals MV⁡(P1,…,Pn)\operatorname{MV}(P_1, \dots, P_n).
  3. (Kushnirenko) In particular, if P1=⋯=Pn=PP_1 = \cdots = P_n = P, the generic number of common zeros in (ℂ∗)n(\C^*)^n is n!vol⁡n(P)n! \operatorname{vol}_n(P).

Remarks

Bernstein's proof deforms the system along a curve and studies the solutions as Puiseux series; the leading exponents of these series are governed by the faces of the Newton polytopes. Bernstein also gave an explicit sufficient condition on the coefficients, stated with initial forms. Suppose that, for every nonzero w∈ℝnw \in \R^n, the initial forms of f1,…,fnf_1, \dots, f_n in direction ww have no common zero in (ℂ∗)n(\C^*)^n. Then all common zeros in (ℂ∗)n(\C^*)^n are isolated, and their number with multiplicity equals MV⁡(P1,…,Pn)\operatorname{MV}(P_1, \dots, P_n). Take n=1n = 1 and f=a0+a1x+⋯+adxdf = a_0 + a_1 x + \cdots + a_d x^d with a0ad≠0a_0 a_d \ne 0. The Newton polytope is [0,d][0, d], of length dd, and the theorem says ff has dd roots in ℂ∗\C^* counted with multiplicity. For two bilinear equations a+bx+cy+dxy=0a + bx + cy + dxy = 0 and a′+b′x+c′y+d′xy=0a' + b'x + c'y + d'xy = 0, both polytopes are the unit square, so the generic number of solutions in (ℂ∗)2(\C^*)^2 is 2!⋅1=22! \cdot 1 = 2. Let fif_i be a generic dense polynomial of degree did_i, so that PiP_i is did_i times the standard simplex. Then the mixed volume is d1d2⋯dnd_1 d_2 \cdots d_n, and the bound agrees with Bézout's theorem. For sparse systems the mixed volume can be much smaller than the Bézout number, which is why the theorem is useful. The count concerns only zeros in the torus: zeros with some coordinate equal to 00 are not counted.

Going deeper

For a student

The theorem is the sparse refinement of Bézout's theorem: it sees which monomials actually occur. It is central in toric geometry, where the mixed volume becomes an intersection number of divisors on a toric variety attached to the polytopes. In tropical geometry, the same count appears as the number of intersection points of tropical hypersurfaces, counted with lattice multiplicities. In numerical algebraic geometry, polyhedral homotopy methods start from the mixed volume to track exactly the generic number of solutions. Computing the mixed volume uses mixed subdivisions of the Minkowski sum P1+⋯+PnP_1 + \cdots + P_n.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Algebraic torus concept
  2. Newton polytope concept
  3. Bernstein–Kushnirenko theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Bernstein–Kushnirenko_theorem
About this page
TagVP32769PVR
URIm2://VP32769PVR
Kindstatement, theorem
WritingW0 stub
MSC14M25, 52A39, 14T90
StatusThis copy of the site has no build data. Run m2 status VP32769PVR.
AboutNewton polytope, Algebraic torus
UsesAlgebraic torus, Newton polytope
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.