Constructing polynomial systems with many positive solutions using tropical geometry

The number of positive solutions of a system of two polynomials in two variables defined in the field of real numbers with a total of five distinct monomials cannot exceed 15. All previously known examples have at most 5 positive solutions. Tropical geometry is a powerful tool to construct polynomial systems with many positive solutions. The classical combinatorial patchworking method arises when the tropical hypersurfaces intersect transversally. In this paper, we prove that a system as above constructed using this method has at most 6 positive solutions. We also show that this bound is sharp. Moreover, using non-transversal intersections of tropical curves, we construct a system as above having 7 positive solutions.


Introduction and statement of the main results
The support of a system of (Laurent) polynomials is the set of points w ∈ Z n corresponding to monomials x w = x w 1 1 · · · x w n n appearing in that system with non-zero coefficient. Consider a system (1.1) f 1 (x 1 , . . . , x n ) = · · · = f n (x 1 , . . . , x n ) = 0, of polynomials defined in R[x ±1 1 , . . . , x ±1 n ] and supported on a set W ⊂ Z n . Such real polynomial systems appear frequently in pure and applied mathematics (c.f. [BR90,GH02,Byr89,DRRS07]), and in many cases we are interested in studying their real solutions. It is a classical problem in algebraic geometry to count such solutions, and this turns out to be a difficult task especially when dealing with polynomials of high degree or high number of monomials. We often restrict the problem to find an upper bound on the number of real solutions to a given system (1.1). One could apply Bézout's Theorem using the degrees of the polynomials, or Bernstein-Kouchnirenko's results [Ber75,Kus75] using the volumes of their Newton polytopes ∆(f i ). However, since these classical methods also hold true for solutions in the torus (C * ) n , one rarely obtains a precise estimation. A natural question then arises is whether there exists an upper bound on the number of real solutions to a given system (1.1) that depends only on the number of points in its support W.
Assume that we have |W| = n + k + 1 for some positive integer k, and that all the solutions of (1.1) in (C * ) n are non-degenerate (i.e. the Jacobian matrix evaluated at each such solution has full rank). This implies that such a system has a finite number of solutions. An important breakthrough due to Khovanskii [Kho91] was proving that the maximal number of non-degenerate positive solutions (i.e. contained in the positive orthant of R n ) of (1.1) is bounded above by 2 ( n+k 2 ) (n + 1) n+k .
The positive solutions of (1.1) are indeed of great interest since giving an upper bound N |W| on their number that depends on the values n, k ≥ 1, one deduces the upper bound 2 n N |W| on the number of real non-degenerate solutions to (1.1). Khovanskii's bound is far from being sharp since it comes as a consequence of an even bigger result involving solutions in (R >0 ) n of polynomial functions in logarithms of the coordinates and monomials. Nevertheless, it is the first upper bound that is independent of the degrees and the Newton polytopes for systems (1.1) and an arbitrary number n.
In [BS07], F. Bihan and F. Sottile significantly reduced Khovanskii's bound by showing that there are fewer than (1.2) e 2 + 3 4 2 ( k 2 ) n k non-degenerate positive solutions to (1.1). This new bound is asymptotically sharp in the sense that for a fixed k and big enough n, there exist systems (1.1) having O(n k ) positive solutions. However the bound (1.2) is not sharp for systems with special structure (e.g. with prescribed number of monomials in each equation). On the other hand, sharp upper bounds on the number of positive solutions are already known in some special cases. For example, Descartes' rule of sign states that the univariate polynomial obtained from (1.1) when supposing n = 1 has the maximum of k + 1 positive solutions (counted with multiplicities). Also, F. Bihan proved in [Bih07] that if k = 1, then n + 1 is a sharp upper bound on the number of positive solutions to (1.1).
One of the first cases where the sharp upper bound on the number of non-degenerate positive solutions is not known is the case of a bivariate polynomial system of two equations having five distinct points in its support. It was also proven in [BS07] that a sharp bound to such a system (of type n = k = 2 for short) is not greater than 15. On the other hand, the best constructions had only 5 non-degenerate positive solutions. The first such published example, made by B. Haas [Haa02], is a construction consisting of two real bivariate trinomials. Other examples of such systems having 5 positive solutions were later constructed in [DRRS07]. The authors in the latter paper also showed that such systems are rare in the following sense. They study the discriminant variety of coefficients spaces of polynomial systems composed of two bivariate trinomials with fixed exponent vectors, and show that the chambers (connected components of the complement) containing systems with the maximal number of positive solutions are small.
In this paper, we consider real systems of type n = k = 2 in their full generality (i.e. not only the case of two trinomials). The motivation behind this paper is to adopt some of the tools developed in tropical geometry in order to construct real polynomial systems of type n = k = 2 that give more than five positive solutions. Tropical geometry is a new domain in mathematics that is situated at the junction of fields such as toric geometry, complex or real geometry, and combinatorics [Mik06,MR05,MS15]. It turns out that Sturmfels' Theorem [Stu94] can be reformulated in the context of tropical geometry (see [Mik04,Rul01]). This makes the latter an effective tool to construct polynomial systems with prescribed support and many positive solutions. The principal idea is to consider a family of polynomial systems . . , 5}. We then associate to P 1,t and P 2,t tropical curves T 1 , T 2 ⊂ R 2 (see Subsection 2.1). These are piecewise-linear combinatorial objects that keep track of much of the information about the (parametrized) solutions of (1.3). Assume first that the associated tropical curves intersect transversally in a finite set of points S (i.e. the cardinality of S does not change after perturbations). Then, Sturmfels' generalization of Viro's Theorem (see Theorem 3.4) states that there exists a bijection between the positive solutions to the real system obtained from (1.3) by taking t small enough, and a subset S + ⊆ S of positive tropical transversal points (c.f. Definition 3.2). Therefore, similarly to the famous Viro's combinatorial patchworking (c.f. Theorem 3.1), the construction of real polynomial systems with many positive solutions becomes a combinatorial problem. If the system (1.3) is of type n = k = 2, then the number of transversal intersection points of T 1 and T 2 is bounded from above by 6. It was previously unknown whether this upper bound can be attained. We prove that this bound is sharp and can be realized by positive transversal intersection points.
Proposition 1.1. There exist two plane tropical curves T 1 and T 2 defined by equations containing a total of five monomials and which have six positive transversal intersection points.
Due to Theorem 3.4, the construction made for proving the latter result also gives a construction of a real polynomial system of type n = k = 2 that has six positive solutions. Furthermore it is clear from Theorem 3.5 that one cannot hope to improve the result in Proposition 1.1 when restricting to polynomial systems of type n = k = 2 with tropical curves intersecting transversally.
Consequently, in order to obtain a better construction, we consider real parametrized polynomial systems (1.3) of type n = k = 2 whose tropical curves T 1 and T 2 intersect in a non-empty set that does not consist of transversal points. A consequence of an important result due to Kapranov [Kap00] is that the set T 1 ∩ T 2 contains the tropicalizations of the solutions of (1.3). For each linear piece ξ of a connected component of T 1 ∩ T 2 , we associate a real reduced polynomial system extracted from (1.3) (see Definition 4.2) and prove that it encodes all positive solutions (α 1 (t), α 2 (t)) of (1.3) which tropicalize in ξ (by positive, we mean that the first-order terms of α 1 (t) and α 2 (t) have positive coefficients). If ξ is of dimension zero, then results in [Kat09,Rab12,OP13] and [BLdM12] show that ξ lifts to solutions to (1.3), and then such non-degenerate solutions (α 1 (t), α 2 (t)) which are positive can be estimated by computing the real reduced system of (1.3) with respect to ξ (see Proposition 4.4). If ξ has dimension 1, then a method was developed in [EH16] to compute the positive solutions that tropicalize in the relative interior of ξ. The latter methods for non-transversal linear pieces of dimension 0 and 1 are sufficient to construct a real polynomial system of type n = k = 2 having more than six positive solutions. Namely, we prove our main result.
Theorem 1.2. There exists a real polynomial system of type n = k = 2 that has seven solutions in (R >0 ) 2 .
The strategy behind the construction of a system satisfying Theorem 1.2 goes as follows. First, we show that to any system (1.3) of type n = k = 2, one can associate a normalized system, which is easier to deal with, that has the same number of non-degenerate positive solutions as (1.3). A case-by-case analysis was made in [EH16] to identify the few classes of candidates of normalized systems that have more than six positive solutions. The construction described in the present paper is based on one such candidate. This paper is organized as follows. We introduce in Section 2 some basic notions of tropical geometry. In Section 3, we give a description of the tropical reformulation of Viro's Patchworking Theorem and its generalization followed by the proof of Proposition 1.1. Finally, Section 4 is devoted to the proof of Theorem 1.2 .
Acknowledgements: I am very grateful to Frédéric Bihan for fruitful discussions and guidance. I also would like to thank Pierre-Jean Spaenlehauer for computations that approximated the real positive solutions to the real system that was constructed to prove Theorem 1.2.

A brief introduction to tropical geometry
We state in this section some of the well-known facts about tropical geometry, much of the exposition and notations in this section are taken from [BLdM12,BB13,Ren15]. For more information about the topic, the reader may refer to [MS15,IMS09] for example.
Definition 2.1. A polyhedral subdivision of a convex polytope ∆ ⊂ R n is a set of convex polytopes {∆ i } i∈I such that • ∪ i∈I ∆ i = ∆, and • if i, j ∈ I, then if the intersection ∆ i ∩ ∆ j is non-empty, it is a common face of the polytope ∆ i and the polytope ∆ j .
Definition 2.2. Let ∆ be a convex polytope in R n and let τ denote a polyhedral subdivision of ∆ consisting of convex polytopes. We say that τ is regular if there exists a continuous, convex, piecewise-linear function ϕ : ∆ → R which is affine linear on every simplex of τ .
Let ∆ be an integer convex polytope in R n and let φ : ∆ ∩ Z n → R be a function. We denote by∆(φ) the convex hull of the graph of φ, i.e., Then the polyhedral subdivision of ∆, induced by projecting the union of the lower faces of ∆(φ) onto the first n coordinates, is regular. We will shortly describe φ using the polynomials that we will be working with.
2.1. Tropical polynomials and hypersurfaces. A locally convergent generalized Puiseux series is a formal series of the form where R ⊂ R is a well-ordered set, all α r ∈ C, and the series is convergent for t > 0 small enough. We denote by K the set of all locally convergent generalized Puiseux series. It is naturally a field of characteristic 0, which turns out to be algebraically closed.
Notation 2.3. Let coef(a(t)) denote the coefficient of the first term of a(t) following the increasing order of the exponents of t. We extend coef to a map Coef : K n → R n by taking coef coordinate-wise, i.e. Coef(a 1 (t), . . . , a n (t)) = (coef(a 1 (t)), . . . , coef(a n (t))) An element a(t) = r∈R α r t r of K is said to be real if α r ∈ R for all r, and positive if a(t) is real and coef(a(t)) > 0. Denote by RK (resp. RK >0 ) the subfield of K composed of real (resp. positive) series. Since elements of K are convergent for t > 0 small enough, an algebraic variety over K (resp. RK) can be seen as a one-parametric family of algebraic varieties over C (resp. R). The field K has a natural non-archimedian valuation defined as follows: val : The valuation extends naturally to a map Val : K n → (R∪{−∞}) n by evaluating val coordinatewise, i.e. Val(z 1 , . . . , z n ) = (val(z 1 ), . . . , val(z n )). We shall often use the notation val and Val when the context is a tropical polynomial or a tropical hypersurface. On the other hand, define ord := − val, with ord(0) = +∞, and use it as a notation when the context is an element in RK n or a polynomial in RK[z ±1 1 , . . . , z ±1 2 ]. Convention 2.4. For any s ∈ K, we have coef(s) = 0 ⇔ s = 0 and ord(s) = +∞ ⇔ s = 0 Consider a polynomial with W a finite subset of Z n and all c w are non-zero.
endowed with a weight function which we will define later. There are other equivalent definitions of a tropical hypersurface. Namely, define Its Legendre transform is a piecewise-linear convex function where , : R n × R n → R is the standard eucledian product. The set of points x ∈ R n at which L(ν) is not differentiable is called the corner locus of L(ν). We have the fundamental Theorem of Kapranov [Kap00].
A multivariate tropical polynomial is a polynomial in R[x 1 , . . . , x n ], where the addition and multiplication are the tropical ones. Hence, a tropical polynomial is given by a maximum of finitely many affine functions whose linear parts have integer coefficients and constant parts are real numbers. The tropicalization of the polynomial f is a tropical polynomial This tropical polynomial coincides with the piecewise-linear convex function L(ν) defined above. Therefore, Theorem 2.5 asserts that V trop f is the corner locus of f trop . Conversely, the corner locus of any tropical polynomial is a tropical hypersurface.
its associated tropical polynomial is and the corresponding tropical hypersurface is shown in Figure 1 on the left.
is independent of x, and denote by ∆ ξ the convex hull of this set. All together the polyhedra ∆ ξ form a subdivision τ of ∆(f ) called the dual subdivision, and the cell ∆ ξ is called the dual of ξ. Both subdivisions τ and Ξ are dual in the following sense. There is a one-to-one correspondence between Ξ and τ , which reverses the inclusion relations, and such that if ∆ ξ ∈ τ corresponds to ξ ∈ Ξ then (2) the cell ξ and the polytope ∆ ξ span orthogonal real affine spaces, and (3) the cell ξ is unbounded if and only if ∆ ξ lies on a proper face of ∆(f ).
Note that τ coincides with the regular subdivision of Definition 2.2. Indeed, let∆(f ) ⊂ R n ×R be the convex hull of the points (w, ν(w)) with w ∈ W and ν(w) = ord(c w ). Definê Then, the the domains of linearity ofν form the dual subdivision τ . Consider a facet (face of dimension n − 1) ξ of V trop f , then dim ∆ ξ = 1 and we define the weight of ξ by w(ξ) := Card(∆ ξ ∩ Z n ) − 1. Tropical varieties satisfy the so-called balancing condition. Since in this paper, we only work with tropical curves in R 2 , we give here this property only for this case. We refer to [Mik06] for the general case. Let T ⊂ R n be a tropical curve, and let v be a vertex of T . Let ξ 1 , . . . , ξ l be the edges of T adjacent to v. Since T is a rational graph, each edge ξ i has a primitive integer direction. If in addition we ask that the orientation of ξ i defined by this vector points away from v, then this primitive integer vector is unique. Let us denote by u v,i this vector.
Proposition 2.6 (Balancing condition). For any vertex v, one has 1 , . . . , z ±1 n ]. For i = 1, . . . , r, let ∆ i ⊂ R n (resp. T i ⊂ R n ) denote the Newton polytope (resp. tropical curve) associated to f i . Recall that each tropical curve T i defines a piecewise linear polyhedral subdivision Ξ i of R n which is dual to a convex polyhedral subdivision τ i of ∆ i . The union of these tropical hypersurfaces defines a piecewise-linear polyhedral subdivision Ξ of R n . Any non-empty cell of Ξ can be written as ξ = ξ 1 ∩ · · · ∩ ξ r with ξ i ∈ Ξ i for i = 1, . . . , r. We require that ξ does not lie in the boundary of any ξ i , thus any cell ξ ∈ Ξ can be uniquely written in this way. Denote by τ the mixed subdivision of the Minkowski sum ∆ = ∆ 1 + · · · + ∆ r induced by the tropical polynomials f 1 , . . . , f r . Recall that any polytope σ ∈ τ comes with a privileged representation σ = σ 1 + · · · + σ r with σ i ∈ τ i for i = 1, . . . , r. The above duality-correspondence applied to the (tropical) product of the tropical polynomials gives rise to the following well-known fact (see [BB13] for instance).
Proposition 2.7. There is a one-to-one duality correspondence between Ξ and τ , which reverses the inclusion relations, and such that if σ ∈ τ corresponds to ξ ∈ Ξ, then where each σ i is the polytope dual to ξ i .
(2) dim ξ + dim σ = n, (3) the cell ξ and the polytope σ span orthonogonal real affine spaces, (4) the cell ξ is unbounded if and only if σ lies on a proper face of ∆.
and it is non transversal if the previous equality does not hold.

First construction: Transversal case
Since this paper concerns algebraic sets of dimension zero contained in (R >0 ) n , the exposition in this section will only restrict to that orthant of R n .
3.1. Generalized Viro theorem and tropical reformulation. Following the description of B. Sturmfels [Stu94], we recall now Viro's Theorem for hypersurfaces. Let W ⊂ Z n be a finite set of lattice points, and denote by ∆ the convex hull of W. Assume that dim ∆ = n and let ϕ : W → Z be any function inducing a regular triangulation τ ϕ of the integer convex polytope ∆ (see Definition 2.2). Fix non-zero real numbers c w , w ∈ W. For each positive real number t, we consider a Laurent polynomial Let Bar(τ ϕ ) denote the first barycentric subdivision of the regular triangulation τ ϕ . Each maximal cell µ of Bar(τ ϕ ) is incident to a unique point w ∈ W. We define the sign of a maximal cell µ to be the sign of the associated real number c w . The sign of any lower dimensional cell λ ∈ Bar(τ ϕ ) is defined as follows: Let Z + (τ ϕ , f ) denote the subcomplex of Bar(τ ϕ ) consisting of all cells λ with sign(λ) = 0, and let V + (f t ) denote the zero set of f t in the positive orthant of R n . Denote by Int(∆) the relative interior of ∆.
Naturally, a signed version of Theorem 3.1 holds in each of the 2 n orthants where ∈ {+, −} n . In fact, O. Viro proves a more general version of Theorem 3.1, in which he defines a set that is homeomorphic to the zero set V (f t ) ⊂ R n (not only the positive zero set V + (f t )) by means of gluing the zero sets of f t contained in all other orthants of R n .
We now reformulate Theorem 3.1 using tropical geometry. We consider g := f t as a polynomial defined over the field of real generalized locally convergent Puiseux series, where each coefficient c w t ϕ(w) ∈ RK * of g has only one term. Therefore coef(c w t ϕ(w) ) = c w , val(c w t ϕ(w) ) = −ϕ(w), and we associate to g a tropical hypersurface V trop g as defined in Subsection 2.1. Recall that V trop g induces a subdivision Ξ g of R n that is dual to τ ϕ . The tropical hypersurface V trop g is homeomorphic to the barycentric subdivision Bar(τ ϕ ). Indeed, τ ϕ is a triangulation, and thus Bar(τ ϕ ) becomes dual to τ ϕ in the sense of the duality described in Subsection 2.2.
We define for each n-cell ξ ∈ Ξ g , dual to a 0-face (vertex) w of the triangulation τ ϕ , a sign (w) ∈ {+, −}, to be equal to the sign of c w . The following is a Corollary of Mikhalkin [Mik04] and Rullgard [Rul01] results, where they completely describe the topology of V (f t ) using amoebas. Figure 2. The positive part of the tropical hypersurface associated to −t + z 1 − tz 2 1 − z 1 z 2 + z 2 + tz 2 2 is represented as the union of the solid segments and solid half-rays. Theorem 3.3 (Mikhalkin, Rullgard). For sufficiently small t > 0, there exists a homeomorphism (R >0 ) n → R n sending the zero set V + (f t ) ⊂ (R >0 ) n to V trop g,+ ⊂ R n . B. Sturmfels generalized Viro's method for complete intersections in [Stu94]. We give now a tropical reformulation of one of the main Theorems of [Stu94].

Tropical transversal intersection points for bivariate polynomials.
For the rest of this section, we assume that the system appearing in (3.2) has two equations in two variables (i.e. n = r = 2), and that the tropical curves V trop g 1 and V trop g 2 intersect transversally. Then the intersection set V trop g 1 ,+ ∩V trop g 2 ,+ is a (possibly empty) set of points in R 2 . Each point of V trop g 1 ,+ ∩V trop is expressed in a unique way as a transversal intersection ξ 1,+ ∩ ξ 2,+ , where for i = 1, 2, the cell ξ i,+ ⊂ V trop g i ,+ is a positive cell. In this section, we use Theorem 3.4 to prove Proposition 1.1. F. Bihan [Bih14] gave an upper bound on |V trop g 1 ∩ V trop g 2 | (and thus on |V trop g 1 ,+ ∩ V trop g 2 ,+ |) for a bivariate system (3.2) in two equations. Namely, given two finite sets W 1 and W 2 in R 2 , and for any non-empty I ⊂ {1, 2}, write W I for the set of points i∈I w i over all w i ∈ W i with i ∈ I. The associated discrete mixed volume of W 1 and W 2 is defined as where the sum is taken over all subsets I of {1, 2} including the empty set with the convention that |W ∅ | = 1. Denote by W i the support of g 1 for i = 1, 2. Recall that the tropical curves associated to g 1 , g 2 intersect transversally.
Theorem 3.5 (Bihan). The number |V trop g 1 ∩ V trop g 2 | is less or equal to the discrete mixed volume D(W 1 , W 2 ).
When |W| = 4, then the bound of Theorem 3.5 is 3 and is sharp (see [Bih07]). However, we do not know if the discrete mixed volume bound is sharp for any polynomial system with 2 equations in 2 variables satisfying that the associated tropical curves intersect transversally.
Lemma 3.6. The discrete mixed volume D(W 1 , W 2 ) does not exceed six.
We finish this section by proving Proposition 1.1.
As explained before, Theorem 3.2 shows that for a positive t small enough, the system (3.6) becomes a real bivariate polynomial system of type n = k = 2 having 6 positive solutions.

Second construction: non-transversal case
Following the notation of Subsection 2.3 for the case of two tropical curves in R 2 , we classify the types of mixed cells ξ of T 1 ∩ T 2 at which the two tropical curves T 1 and T 2 intersect nontransversally. Let • ξ denote the relative interior of such a linear piece ξ. Note that ξ = • ξ if ξ is a point. Consider now one linear piece ξ := ξ 1 ∩ ξ 2 that is a result of the intersection, where ξ 1 and ξ 2 are cells of T 1 and T 2 , and assume that it is non-transversal. We distinguish three types for such ξ.
-A cell ξ is of type (II) if one of the cells ξ 1 , or ξ 2 is a vertex, and the other cell is an edge.
-A cell ξ is of type (III) if ξ 1 and ξ 2 are vertices of the corresponding tropical curves. 4.1. Reduced systems. Recall that for an element a(t) ∈ K * , we denote by coef(a(t)) the non-zero coefficient corresponding to the term of a(t) with the smallest exponent of t.
Definition 4.1. Let f = w∈∆(f )∩Z 2 c w z w be a polynomial in K[z ±1 1 , z ±1 2 ] with c w ∈ K * , and let ξ denote a cell of V trop where W is the support of f .
We extend this definition to the following. Consider a system 2 ] defined as above. Assume that the intersection set T 1 ∩ T 2 of the tropical curves T 1 and T 2 is non-empty, and consider a mixed cell ξ ∈ T 1 ∩ T 2 . As explained in Subsection 2.3, the mixed cell ξ is written as ξ 1 ∩ ξ 2 for some unique ξ 1 ∈ T 1 and ξ 2 ∈ T 2 .
Definition 4.2. The reduced system of (4.1) with respect to ξ is the system where f i|ξ i is the reduced polynomial of f i with respect to ξ i for i = 1, 2.
Let W 1 and W 2 denote the supports of f 1 and f 2 respectively, and write The following result generalizes to the case of a polynomial system defined on the same field with n equations in n variables.

Normalized systems.
Recall that a polynomial system is said to be of type n = k = 2 if it is supported on a set of five distinct points in Z 2 and consists of two equations in two variables. In what follows, we consider a system of type n = k = 2 defined on the field of real generalized locally convergent Puiseux series.
Definition 4.5. A highly non-degenerate system is a system consisting of two polynomials in two variables, and satisfying that no three points of its support belong to a line.
Lemma 4.6. Given any highly non-degenerate system of polynomials in RK[z ±1 1 , z ±1 2 ] of type n = k = 2, one can associate to it a highly non-degenerate system (4.4) a 0 z w 0 + a 1 z w 1 + a 2 z w 2 + a 3 t α z w 3 = 0, , that has the same number of non-degenerate positive solutions, where all a i and b j are in RK * and verify ord(a i ) = ord(b j ) = 0, all w i are in Z 2 and both α, β are real numbers.
Proof. Using linear combinations, any system of type n = k = 2 can be reduced to a system (4.5) c 0 t α 0 zw 0 + c 1 t α 1 zw 1 + c 2 t α 2 zw 2 + c 3 t α 3 zw 3 = 0, d 0 t β 0 zw 0 + d 1 t β 1 zw 1 + d 2 t β 2 zw 2 + d 4 t β 4 zw 4 = 0 that has the same number of non-degenerate positive solutions, where all c i and d j are in ∈ RK * and verify ord(c i ) = ord(d j ) = 0, allw i are in Z 2 and all exponents of t are real numbers. Assume first that α i − α 1 = β i − β 1 for i = 0, 2. By symmetry, the different possibilities of strict inequalities can be reduced to only two cases.
Consider a system (4.4) satisfying all the hypotheses of Lemma 4.6. Since we are interested in its non-degenerate positive solutions, we may assume that w 0 = (0, 0). Moreover, without loss of generality, we may assume that a 1 = b 1 = 1. For the simplicity of further computations, we make the following change of coordinates. Let m 1 be the greatest common divisor of the coordinates of w 1 . Setting y 1 = z w 1 m 1 and choosing any basis of Z 2 with first vector 1 m 1 · w 1 , we get a monomial change of coordinates (z 1 , z 2 ) → (y 1 , y 2 ) of (RK * ) 2 such that z w 1 = y m 1 1 and z w 2 = y m 2 1 y n 2 2 . Replacing y 2 by y −1 2 if necessary, we assume that n 2 > 0. Indeed, n 2 = 0, since by assumption the support of (4.4) is highly non-degenerate. With respect to these new coordinates, we obtain the system (4.9) a 0 + y m 1 1 + a 2 y m 2 1 y n 2 2 + a 3 t α y m 3 1 y n 3 2 = 0, b 0 + y m 1 1 + b 2 y m 2 1 y n 2 2 + b 4 t β y m 4 1 y n 4 2 = 0, that has the same number of non-degenerate positive solutions as (4.9). In what follows, we will work on a normalized system of the form (4.9), i.e. a highly non-degenerate system (4.9) that satisfies the hypothesis of Lemma 4.6. We will state two results, the proof of which are contained in [EH16], that are important for the construction. A normal fan of a 2-dimensional convex polytope in R 2 is the complete fan with apex at the origin, and 1-dimensional cones directed by the outward normal vectors of the 1-faces of this polytope. Recall that (0, 0), (m 1 , 0) and (m 2 , n 2 ) do not belong to a line (since (4.9) is highly non-degenerate) and denote by ∆ the triangle with vertices (0, 0), (m 1 , 0) and (m 2 , n 2 ). Let E ⊂ R 2 denote the normal fan of ∆. The fan E together with ∆ are represented in Figure 6. The 1-dimensional cones of E are L 0 = {λ(0, −m 1 )| λ ≥ 0}, L 1 = {λ(n 2 , m 1 − m 2 )| λ ≥ 0} and L 2 = {λ(−n 2 , m 2 )| λ ≥ 0}. Let C 0 (resp. C 1 , C 2 ) denote the 2-dimensional cone generated by the two vectors (0, −m 1 ) and (−n 2 , m 2 ) (resp. (0, −m 1 ) and (n 2 , m 1 − m 2 ), (n 2 , m 1 − m 2 ) and (−n 2 , m 2 )), see Figure 6. In what follows, for i = 0, 1, 2, let • C i denote the relative interior of C i and • L i denote the relative interior of L i . Finally, denote by T 1 (resp. T 2 ) the tropical curve associated to the first (resp. second) equation of (4.9).    In what follows, we construct a system (4.9) having seven positive solutions. Theorem 1.16 of [EH16] implies that if α = β or α = β < 0, then (4.9) has at most six positive solutions. Therefore, assume henceforth that α = β > 0. It is easy to deduce from equations appearing in (4.9) that, since α, β ≥ 0, the tropical curves T 1 and T 2 intersect non-transversally at a point v 0 of type (III) that is the origin of E. In order to study the positive solutions of (4.9) with valuation v 0 , we first consider the system (4.10) a 0 + y m 1 1 + a 2 y m 2 1 y n 2 2 + a 3 t α y m 3 1 y n 3 2 = 0, Since the second equation of (4.10) is obtained by substracting the first equation of (4.9) from its second one, this system has the same number of non-degenerate positive solutions as (4.9). The case-by-case study done in [EH16] shows that we can hope to obtain a system (4.9) having seven positive solutions if we have (4.11) coef(a i ) = coef(b i ) for i = 0, 2, and α = β = γ 2 < γ 0 .
One possible disposition of the seven solutions is the following (see Figure 8).
• The common vertex v 0 is the valuation of five positive solutions, • the 2-cone C 2 of E contains a transversal intersection p, and • the 1-cone L 0 of E contains the valuation q of one positive solution.
Such a system has at most five positive solutions. Indeed, since this is a system of two trinomials in two variables (see [LRW03]). Without loss of generality, we may assume that coef(a 0 ), coef(a 3 ) < 0, and doing a suitable monomial change of coordinates followed by a multiplication of each equation of (4.12) by a constant, we assume in addition that coef(a 0 ) = coef(a 3 ) = − coef(a 2 ) = −1. Therefore, the reduced system of (4.10) with respect to {v 0 } is now Assume that the open 1-cone • L 0 of E contains the valuation of one (which is the maximum possible for this case) positive solution of (4.9). Then both n 3 and n 4 are positive. Therefore, since α > 0, both T 1 and T 2 do not have a vertex in L 0 (see Figure 8 for example). Assume furthermore that T 1 and T 2 do not intersect non-transversally at a point of type (III) belonging to the relative interior of a 1-cone of E.
We start our construction by finding a system (4.13) that has five positive solutions. Since systems of two trinomials in two variables having five positive solutions are hard to generate (c.f. [DRRS07]), we will borrow one from the literature and base our construction upon it.
First, we define a univariate function f such that for some constant c, the equation f = c has the same number of solutions in ]0, 1[ as that of positive solutions of (4.13). We write the first equation of (4.13) as y 2 = x k (1 − x) l , where x := y m 1 1 , k = −m 2 /(m 1 n 2 ) and l = 1/n 2 . It is clear that y 1 , y 2 > 0 ⇔ x ∈ I 0 :=]0, 1[. Since we are looking for solutions of (4.13) with non-zero coordinates, we divide its second equation by y m 2 1 y n 2 2 . Plugging y 1 and y 2 in the second equation of 4.13, we get where k i = m i n 2 − m 2 n i m 1 n 2 and l i = n i − n 2 n 2 for i = 3, 4. The number of positive solutions of (4.13) is equal to the number of solutions of (4.14) in I 0 . Therefore we want to compute values of coef(c 2 ), coef(b 4 ) and (m i , n i ) for i = 1, 2, 3, 4 such that f (x) = − coef(c 2 ) has five solutions in I 0 , where f (x) := x k 3 (1 − x) l 3 + coef(b 4 ) · x k 2 (1 − x) l 2 . (4.15) Note that the function f has no poles in I 0 , thus by Rolle's theorem we have {x ∈ I 0 |f (x) = 1} ≤ {x ∈ I 0 |f (x) = 0} + 1. The derivative f is expressed as x k 4 −k 3 (1 − x) l 4 −l 3 ρ 4 (x) ρ 3 (x) .
All these restrictions impose that there exists a transversal intersection point of T 1 and T 2 in C 2 (see Figure 8 for example). Moreover, since coef(b 4 ) < 0 (see (4.18)), coef(a 3 ) = −1 (from (4.13)) and coef(a 0 ) = coef(b 0 ) = −1, Proposition 4.8 shows that the intersection point p is the valuation of a positive solution of (4.9). The constant coef(c 0 ) should be a negative number so that (4.9) has a positive solution with valuation in L 0 . This constant can take any negative value, and for computational reasons we choose it to be −0.36008.