{"id":"18418e4f-35f6-4abe-bdc4-512efe749c6c","arxiv_id":"1908.05503","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A sparse polynomial system has a positive root whenever its exponent and coefficient matrices satisfy certain sign and combinatorial conditions derived from Gale duality and degree theory.","lead":"This paper proves new sign conditions on the coefficients and exponents of a sparse system of polynomial equations that guarantee at least one positive real solution. The result gives mathematicians and modelers of chemical reaction networks a new way to certify existence of positive steady states without solving the system.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 3.8 is stated for nonuniform C, but its proof reduces to the uniform case after an unproved extension; the main theorem's full generality is therefore not established as written.","rationale":"The paper's degree-theoretic Gale duality strategy is coherent, Lemma 3.4 is sound in the uniform case, and Example 3.10 includes a certified Singular computation of positive root counts. Theorems 4.6, 5.8, and the later results largely assume A and C are uniform, so those parts do not depend on the uncertain reduction. The single load-bearing gap is in Theorem 3.8 itself: it is the main result, it is stated for arbitrary full-rank C, and its proof explicitly narrows to uniform C after a compressed assertion about the reduced map \\bar g. Since condition (2) and the inward-vector conclusion are what connect the sign inequalities to existence of a solution, the missing nonuniform extension is essential. The concern is not that the theorem is false; it is that the proof as written does not cover the stated hypotheses. This supports a conditional verdict rather than rejection, and a focused re-derivation of Lemma 3.4 for \\bar g would settle the matter.","tokens_in":23277,"tokens_out":28033,"duration_ms":296692,"concrete_test":"Independently prove Lemma 3.4(1)-(2) and Corollary 3.5 for the reduced map \\bar g of (3.6)-(3.7) with arbitrary positive constants c_j, allowing proportional rows in D. Concretely: for each face F_L and each j, compute \\bar g_j on F_L from (3.7); verify that if the j-th column of \\bar B_{\\bar L} contains both signs then \\bar g_j = 0, if all entries are nonnegative with at least one positive then sign(\\bar g_j) = -1, and if all entries are nonpositive with at least one negative then sign(\\bar g_j) = +1, independently of c_j. Also verify that the zero-compatibility clause \\bar b_{rj} = 0 implies d_{ij} = 0 keeps the inward inner product positive. If any sign changes for some c_j > 0, construct a nonuniform C and a Gale dual B satisfying (1)-(2) whose Gale system has no solution in \\Delta_P.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"After equation (3.7), the proof partitions boundary indices into equivalence classes K_r of proportional Gale rows, defines \\bar B by sums (3.4), and asserts without proof that Lemma 3.4 and Corollary 3.5 remain valid for the reduced map \\bar g with constants c_j. Immediately afterward the text says 'we assume from now on that C is uniform.' Theorem 3.8, however, only assumes full rank, 0 in C^\\circ, and bounded full-dimensional \\Delta_P, so nonuniform C are included in the statement. The inward-vector argument then uses the uniform version of Lemma 3.4, in which \\bar I_C = I_C and \\bar b_{ij} = b_{ij}; no separate treatment of the reduced case is given. Thus condition (2) is not actually shown to force -g inward on all faces when C is nonuniform. If the unproved extension fails, the main theorem would hold only for uniform coefficient matrices, while the later applications mostly assume uniformity anyway; the nonuniform range of Theorem 3.8 is exactly the part left unsupported. The extension is probably repairable, since the positive constants c_j do not change signs, but that repair is not in the manuscript.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies sparse generalized polynomial systems (1.1) with exponent set A and coefficient matrix C, and gives sufficient conditions, based on Gale duality and degree theory, for the existence of at least one positive solution. The authors construct the polytope ΔP from a Gale dual of C, transform the original system into a Gale dual system on ΔP, and apply a Brouwer degree argument to an inward-pointing vector field. The main result, Theorem 3.8, states sign conditions on a Gale dual B of the exponent matrix and on the Gale configuration of C; Sections 4 and 5 provide more checkable sufficient conditions using mixed dominating matrices and geometric compatibility, and Section 6 relates these conditions to toric ideals and extends the search to real torus solutions.","tokens_in":23540,"tokens_out":7165,"duration_ms":70412,"significance":"If correct, the paper offers a new and fairly general mechanism for guaranteeing positive solutions of sparse polynomial systems, complementing injectivity- and Descartes-type results. The framework elegantly combines oriented matroid sign conditions with degree theory, and the connection to complete intersection lattice ideals in the integer case is natural and likely useful. The paper contains concrete worked examples verified with Singular, which is a strength. However, the main theorem as stated is broader than what the proof actually establishes, and this gap must be addressed before the result can be fully relied upon.","major_comments":[{"comment":"The proof does not handle nonuniform coefficient matrices C, although Theorem 3.8 is stated with that generality. Immediately after defining the reduced matrix \\bar B and the equivalent system (3.5)-(3.7), the text asserts without proof that 'the conclusions of Lemma 3.4 and Corollary 3.5 hold for the map \\bar g' and then says 'To simplify the notation, we assume from now on that C is uniform.' Lemma 3.4 and Corollary 3.5 are proven only under the assumption that C is uniform, and the proof of Lemma 3.4 explicitly uses uniformity to ensure that no two linear forms p_i are proportional. Since Theorem 3.8 only assumes that C has maximal rank, that 0∈C^∘, and that ΔP is full-dimensional and bounded, nonuniform C are included in the statement. The inward-vector argument on all faces of ΔP then relies on a sign computation that has not been established for the reduced map \\bar g with the positive constants c_j. This is a load-bearing gap: the theorem's full generality rests on an unproved extension. The authors should either prove the extension for the reduced map explicitly or restrict the statement of Theorem 3.8 to uniform C, at least until the nonuniform case is worked out.","section":"Proof of Theorem 3.8, after Eq. (3.7)"},{"comment":"The paper cites Propositions 4.3 and 4.4 from [11] and [10] and then states that 'clearly the proofs given in that paper also work for real matrices.' These propositions are used essentially in Theorem 4.6 and Lemma 4.7 (to establish linear independence of the constructed Gale columns and the existence of a positive vector in the left kernel), and the definitions there are transposed from rows to columns. The cited results may indeed extend to real matrices, but the manuscript should give the precise statements in the cited papers or a short proof sketch, so the reader does not have to reconstruct the transposition.","section":"Propositions 4.3 and 4.4"}],"minor_comments":[{"comment":"In the proof of Lemma 4.5, the sentence 'The matrix D∈ R^{n×k} obtained from \\tilde D by adding D0 as a first column vector' should read 'D∈ R^{n×(k+1)}', since \\tilde D is n×k and adding one column produces an n×(k+1) matrix.","section":"Proof of Lemma 4.5"},{"comment":"The sentence 'But note that when rk([A]_2) = d + 1, then 2d−rk([A]_2) = 1/2' should be typeset as an exponent, namely 2^{d−rk([A]_2)} = 1/2, to avoid confusion with the linear expression.","section":"Section 6.2, after Theorem 6.10"},{"comment":"In Example 3.9, the phrase 'Then, there exists a vector δ∈ R^2 such that ⟨Pi,δ⟩ > 0' should specify that the vector δ is chosen from the nonempty open cone dual to the P_i, since the existence of such δ is equivalent to the strict convexity of the positive cone generated by the P_i, which follows from 0∈C^∘.","section":"Example 3.9"}],"recommendation":"major_revision","confidential_remarks":"The main issue is the unproved extension in the proof of Theorem 3.8 from uniform to nonuniform C. The rest of the paper is coherent and well grounded in existing literature; the examples are verified with Singular. The authors should be given the opportunity to repair this gap, either by supplying the missing proof or by adjusting the theorem statement. The paper seems well within the scope of the journal, and the connection to toric ideals is a nice addition."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the paper does something new and mostly does it well. It gives the first general sign conditions on the support and coefficients of a sparse system that guarantee at least one positive root, using Gale duality together with degree theory. The main engine is Theorem 3.8, and the later sections translate its hypotheses into more checkable conditions. I think this deserves peer review, but the statement of Theorem 3.8 is wider than its proof.\n\nWhat is actually new: Theorem 3.8 and the corollaries that follow from it (Theorems 4.6, 5.8, 6.10) are not in the existing literature. The circuit case k=1 recovers the known Descartes-type parity condition, but for general configurations the sign conditions are new. The authors are also honest that their conditions are sufficient and not necessary: Example 3.9 makes this explicit, and Example 3.10 shows the condition does not imply uniqueness. That honesty is worth respecting.\n\nWhere the paper is solid: the central machinery is mostly coherent. Lemma 4.2 is correct, and Theorem 4.6 follows from it together with Lemma 4.5, given the mixed-dominating matrix framework from Fischer-Shapiro. The Singular computation in Example 3.10 is real evidence and it is presented in a responsible way: for c=1/2 the system has 3 positive roots and for c=8/7 it has 1, which is exactly the behavior you would expect if the sufficient condition is not forcing uniqueness. No circularity problem: the new theorems build on earlier Gale-duality and degree-theory tools, but they are not derived from the results they cite as prior bounds.\n\nSoft spots: the first and main one is in the proof of Theorem 3.8. After reducing proportional rows of D into equivalence classes and defining the reduced map, the text says it is 'not difficult to see' that Lemma 3.4 and Corollary 3.5 extend, and then immediately says 'we assume from now on that C is uniform.' But Theorem 3.8 is stated for all full-rank C with 0 in C^deg and bounded full-dimensional Delta_P; nonuniform C are explicitly included. The inward-vector argument as written works for the uniform case only. I think the extension is probably repairable, because the positive constants c_j do not change signs, but that repair is not in the manuscript. The practical damage is limited because most applications afterward (Theorems 4.6, 5.8, 6.10) assume uniformity anyway, but the theorem as stated overclaims.\n\nSecond minor issue: Propositions 4.3 and 4.4 are asserted to extend from integer to real matrices because the proofs in the cited papers 'clearly' carry over. I did not find a counterexample and I believe it is true, but it is an unverified assertion in the text.\n\nWho is this for: people working in fewnomial theory, Gale duality for sparse systems, or positive steady states in chemical reaction networks. It is a serious contribution with a fixable gap, and it deserves a serious referee rather than a desk rejection. My recommendation: send it to peer review, with the referee asked to focus on the nonuniform step in Theorem 3.8; the authors should either prove the extension or restrict the theorem to uniform C.","headline":"New sufficient sign conditions for positive roots of sparse systems, mostly well-supported but Theorem 3.8 overclaims: the proof handles only uniform C, so the nonuniform case needs either a repaired argument or a restricted statement.","tokens_in":24065,"tokens_out":2166,"would_cite":true,"duration_ms":23982,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["14P10","14M25","52B40"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper establishes sign conditions on the exponents and coefficients of a sparse polynomial system that guarantee the existence of at least one positive real solution, via Gale duality and degree theory.","keywords":["sparse polynomial system","positive solution","Gale duality","degree theory","dominating matrix","sign conditions","oriented matroid","lattice ideal"],"falsifier":"Take the configuration and coefficient matrix of Example 3.10 but replace one column of $C$ by a positive multiple of another, breaking uniformity while keeping $0\\in C^\\circ$; compute a Gale dual $D$, form the reduced Gale map $\\bar g$ with the constants $c_j$, and check on the face where the two proportional rows vanish whether the conclusion of Lemma 3.4 still holds. If any component of $\\bar g$ has the opposite sign, or if $\\bar g$ has a boundary zero while condition (2) holds, the stated generality of Theorem 3.8 fails.","tokens_in":23110,"feed_emoji":"🧮","tokens_out":8160,"duration_ms":76495,"temperature":0.7,"pith_summary":"The paper asks when a system of $d$ generalized polynomials in $d$ variables has at least one positive solution, and answers with sign conditions that can be checked from the exponents and coefficients alone. The key move is Gale duality: instead of solving the original system, one studies an equivalent system of equations on a bounded polytope $\\Delta_P$ built from a Gale dual of the coefficient matrix. The main theorem (Theorem 3.8) says that if certain submatrices of a Gale dual $B$ of the exponent matrix are not weakly mixed, and if boundary sign inequalities involving $B$ and a Gale dual $D$ of $C$ hold with at least one strict product and zero compatibility, then the Gale map points inward on the whole boundary, so degree theory forces a zero, hence a positive solution of the original system. A cleaner sufficient criterion (Theorem 4.6) states that when both matrices are uniform, it is enough that $A$ admit a dominating Gale dual $B$ and that each column of $B$ have a sign pattern realizable in $\\ker C$. In the integer-exponent case the dominance condition is related to complete-intersection lattice ideals, and the same machinery yields existence of real nonzero solutions.","feed_headline":"Gale-dual sign conditions force positive solutions","feed_subtitle":"A new theorem checks signs on a dual polytope to certify a positive solution.","key_machinery":"The load-bearing object is the Gale dual pair: a matrix $B\\in\\mathbb{R}^{n\\times k}$ whose columns span $\\ker A$, and a matrix $D\\in\\mathbb{R}^{n\\times(k+1)}$ whose rows $P_i$ span the kernel of $C$. These convert the original system into the Gale dual system $\\prod_i \\langle P_i,y\\rangle^{b_{ij}}=1$, $j=1,\\dots,k$, whose solutions in $\\Delta_P$ are in bijection with positive solutions of the original system (Theorem 2.5). The sign of the resulting Gale map on each face of $\\Delta_P$ is controlled by Lemma 3.4, and Theorem 3.1, a Brouwer degree theorem for inward-pointing vector fields, turns the sign conditions into a forced zero. Thus the machinery replaces root finding with a combinatorial sign check on boundary indices.","core_discovery":"The central claim is that the existence question for a sparse system $f_i(x)=\\sum_j c_{ij}x^{a_j}=0$ can be decided by sign data on a pair of Gale dual matrices. Let $A$ be the matrix with columns $(1,a_j)$, let $B$ be a Gale dual of $A$, and let $D$ be a Gale dual of $C$ chosen so that the polytope $\\Delta_P=\\{y_0=1,\\langle P_i,y\\rangle>0\\}$ is bounded. After passing to the Gale dual system, the sign of every component of the Gale map $g=(g_1,\\dots,g_k)$ on each face of $\\Delta_P$ is determined by the signs of the entries of $B$ and $D$. Theorem 3.8 asserts that when, for every face $L$, the reduced submatrix $\\overline{B}_{\\overline{L}}$ is not weakly mixed, and when for each boundary index $i$ the products $\\overline{b}_{rj}d_{ij}$ are all nonnegative, with at least one positive product and zero compatibility, the map $-g$ points strictly inward along the entire boundary of $\\Delta_P$. Brouwer degree then gives a zero of $g$ in $\\Delta_P$, which by the Gale-duality bijection is a positive solution of the original system.","pith_inferences":["The sign conditions in Theorem 3.8 depend only on the oriented matroids of $A$ and $C$, i.e. on the signs of maximal minors, so they are decidable by inspecting sign patterns rather than by numerical solving; the paper does not package this as an algorithm.","The degree argument carries a multiplicity consequence the paper does not state in its main theorem: under the hypotheses of Theorem 3.8, if the zero in $\\Delta_P$ is nondegenerate and its Jacobian has sign $(-1)^{k+1}$, then there are at least three zeros, hence at least three positive solutions, by the last statement of Theorem 3.1.","The $I$-compatibility criterion (Theorem 5.8) suggests a recursive verification procedure: check the subconfigurations indexed by $I$, then test only that the remaining points lie in the convex hulls of $(d+1)$-subsets of $I$.","In the integer setting, the same boundary-sign machinery could be applied cone by cone to the real-torus formulation of Section 6, effectively giving a 'real version' of Theorem 3.8; the paper states the counting result but does not formulate such a separate real theorem."],"forward_implications":["When $A$ and $C$ are uniform and $A$ has a dominating Gale dual $B$ whose columns realize sign patterns from $\\ker C$, the system has at least one positive solution (Theorem 4.6).","In the circuit case $k=1$, the condition in Theorem 3.8 is equivalent to $n_A(C)$ being odd, so the sufficient condition can guarantee more than mere existence: it implies an odd number of positive roots (Example 3.9).","If $A$ and $C$ are $I$-compatible for some subset $I$, with uniform matrices $A,C,\\overline{C}$ and $0\\in C^\\circ$, then $n_A(C)>0$ (Theorem 5.8).","For integer exponent sets, existence of a mixed dominating Gale dual is equivalent to the associated lattice ideal being a complete intersection; combined with the sign condition this gives positive roots (Corollary 6.2).","The same Gale-duality framework yields a count of real nonzero solutions in terms of solutions of the Gale dual system away from the hyperplane arrangement, and the count is even when $\\operatorname{rk}([A]_2)\\le d$ (Theorem 6.10)."],"supporting_citations":[{"why":"Establishes the Gale-duality bijection between positive solutions of the sparse system and solutions of the Gale dual system, the bridge used throughout.","marker":"[4]"},{"why":"Supplies the degree-theory theorem (an inward-pointing vector field forces a zero) used in the proof of Theorem 3.8.","marker":"[6]"},{"why":"Provides the same inward-vector degree argument in a reaction-network setting, cited as the source of the version of Brouwer degree used.","marker":"[7]"},{"why":"Defines dominating and mixed matrices and proves their relation to complete-intersection lattice ideals, powering the notion of a dominating Gale dual.","marker":"[11]"},{"why":"Gives the characterization of matrices admitting mixed dominating Gale duals and the positive kernel vector result used in the proof of Theorem 4.6.","marker":"[10]"},{"why":"Supplies the Descartes-type sign variation bound and parity statement for circuit systems, identifying the circuit case of Theorem 3.8 with oddness of $n_A(C)$.","marker":"[2]"},{"why":"Provides the decomposition of kernel vectors into nonnegative sums of conformal circuits used in Lemma 4.7.","marker":"[17]"},{"why":"Relates non-Cohen-Macaulay lattice ideals to Gale diagrams intersecting all four quadrants, enabling the $k=2$ result in Proposition 6.4.","marker":"[16]"}],"fun_headline_variants":["Sign conditions on Gale duals force positive roots","Guaranteed positive solutions via Gale dual sign checks","Sparse systems: dual polytope signs ensure a positive root","Test Gale dual signs to certify a positive solution"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The main theorem is stated for all coefficient matrices $C$ of maximal rank, but the proof, after merging proportional rows of the Gale dual $D$ into equivalence classes, says it is 'not difficult to see' that the boundary-sign lemma survives and then declares 'we assume from now on that $C$ is uniform'; the full-strength theorem depends on that unverified reduction.","fun_headline_variants_meta":{"raw":{"variants":["Sign conditions on Gale duals force positive roots","Guaranteed positive solutions via Gale dual sign checks","Sparse systems: dual polytope signs ensure a positive root","Test Gale dual signs to certify a positive solution"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000629,"raw_usage":{"total_tokens":2861,"prompt_tokens":850,"completion_tokens":2011,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":466,"completion_tokens_details":{"reasoning_tokens":1947}},"tokens_in":466,"tokens_out":2011,"duration_ms":14339,"temperature":1.0,"reasoning_tokens":1947,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:13:12.045763+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take the configuration and coefficient matrix of Example 3.10 but replace one column of $C$ by a positive multiple of another, breaking uniformity while keeping $0\\in C^\\circ$; compute a Gale dual $D$, form the reduced Gale map $\\bar g$ with the constants $c_j$, and check on the face where the two proportional rows vanish whether the conclusion of Lemma 3.4 still holds. If any component of $\\bar g$ has the opposite sign, or if $\\bar g$ has a boundary zero while condition (2) holds, the stated generality of Theorem 3.8 fails.","supporting_citations":[{"cited_title":"Bihan and F","cited_arxiv_id":null,"evidence_quote":"Establishes the Gale-duality bijection between positive solutions of the sparse system and solutions of the Gale dual system, the bridge used throughout."},{"cited_title":"Conradi, E","cited_arxiv_id":null,"evidence_quote":"Supplies the degree-theory theorem (an inward-pointing vector field forces a zero) used in the proof of Theorem 3.8."},{"cited_title":"De Leenheer, D","cited_arxiv_id":null,"evidence_quote":"Provides the same inward-vector degree argument in a reaction-network setting, cited as the source of the version of Brouwer degree used."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines dominating and mixed matrices and proves their relation to complete-intersection lattice ideals, powering the notion of a dominating Gale dual."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the characterization of matrices admitting mixed dominating Gale duals and the positive kernel vector result used in the proof of Theorem 4.6."},{"cited_title":"Bihan and A","cited_arxiv_id":null,"evidence_quote":"Supplies the Descartes-type sign variation bound and parity statement for circuit systems, identifying the circuit case of Theorem 3.8 with oddness of $n_A(C)$."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the decomposition of kernel vectors into nonnegative sums of conformal circuits used in Lemma 4.7."},{"cited_title":"Peeva and B","cited_arxiv_id":null,"evidence_quote":"Relates non-Cohen-Macaulay lattice ideals to Gale diagrams intersecting all four quadrants, enabling the $k=2$ result in Proposition 6.4."}],"review_version":1}