{"id":"b3128f9d-c393-4a39-b897-5d58c1bc979e","arxiv_id":"2506.15370","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"For any finite set of unit normals positively spanning R^n, the cone-volume set C_cv(U) is a path-connected semialgebraic set, and it equals the scaled matroid base polytope only for centrally symmetric parallelepipeds.","lead":"This paper proves that the set of all cone-volume vectors of polytopes with fixed normal directions is a path-connected semialgebraic set in any dimension, extending a planar result. It also connects this set to the matroid base polytope of the normals, giving a new geometric view of the discrete logarithmic Minkowski problem.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 3.1's full-dimensional type-cone stratification with polynomial facet volumes is the least secure input to Theorem 1.3; if McMullen/Schneider do not deliver simple polytopes on cone interiors, semialgebraicity is unsupported.","rationale":"Among the central argument's inputs, Lemma 3.1 is the one that is imported rather than demonstrated, and Theorem 1.3 collapses if it fails. I therefore agree with the reader's weakest_assumption. The rest of the proof is coherent: Lemma 3.2 correctly converts the graph of the cone-volume map into a finite union of closures of semialgebraic sets, and the reverse inclusion is justified by Lemma 2.12's continuity. The misstated Proposition 3.6 is real—closures are necessary—but it is not used essentially for the semialgebraicity theorem; Section 4's formula uses Π(cl W(U)). Proposition 2.10's path-connectedness proof and Theorem 2.11 are independent and do not influence Theorem 1.3. Since the main issue is a standard but under-verified stratification, not an identified counterexample, the reader's CONDITIONAL verdict remains appropriate; I would not upgrade or downgrade it.","tokens_in":19093,"tokens_out":27640,"duration_ms":306146,"concrete_test":"Use the eight normals U=(±1,±1,±1)/√3 in R^3 (octahedron normals). Compute the finitely many hyperplanes separating McMullen type cones in b-space and enumerate all full-dimensional chambers. For each chamber choose a generic b and check symbolically that P(U,b) is simple and that vol(P(U,b)) and every facet volume are polynomials in b of degrees 3 and 2, respectively; also verify that the non-simple equal-support octahedron belongs only to lower-dimensional cone boundaries. If any full-dimensional chamber yields a non-simple polytope or a non-polynomial volume, the stratification premise behind Theorem 1.3 fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central implication Theorem 1.3 is a clean projection argument once Lemma 3.1 is granted: the sets W_k(U) in (3.2) are semialgebraic, Lemma 3.2 identifies the graph of the cone-volume map (with the volume-1 constraint) with ∪_k cl W_k(U), and Tarski-Seidenberg applies. The genuinely load-bearing assumption is Lemma 3.1: R^m_{\\ge0} is to be subdivided into finitely many full-dimensional polyhedral cones A_k(U) such that on every interior all polytopes P(U,b) are strongly isomorphic, simple and n-dimensional, and volume/facet volumes are polynomials in b of degree at most n. The text imports this from McMullen's representation theorem and Schneider [24, Lemma 5.1.3] without proving the full-dimensionality/simplicity clause. The equal-support regular octahedron shows why the clause is not automatic: four facets meet at each vertex, so it is non-simple, and it must lie on a lower-dimensional boundary of the decomposition rather than inside a maximal cone. If some full-dimensional chamber contained a non-simple polytope, or if the volume were merely semialgebraic on the chamber, the polynomial equations defining W_k would fail and Theorem 1.3 would not follow. A secondary, separate error is Proposition 3.6, whose equality needs closures: boundary points such as simplex vertices are in Ccv(U) but not in Π(W_k(U)). This error does not affect Theorem 1.3, and Section 4 in fact uses the closure version.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies, for a fixed matrix U in U(n,m) of outer unit normals, the cone-volume set C_cv(U) of all cone-volume vectors of volume-one polytopes P(U,b)={x: U^T x <= b}, b>=0. It defines a subspace concentration polytope P_scc(U), shows that a discrete measure satisfies the subspace concentration condition exactly when its weight vector lies in relint P_scc(U), and proves structural results about C_cv(U): it is path-connected (Proposition 2.10), it decomposes according to irreducible matroid components (Proposition 2.7), and it coincides with P_scc(U) only in the centrally symmetric parallelepiped case (Theorem 2.11). The main result is Theorem 1.3, asserting that C_cv(U) is a semialgebraic set. The proof constructs finitely many type-cones A_k(U) on whose interiors the polytopes are simple and strongly isomorphic and on which volume and facet volumes are polynomial (Lemma 3.1); it then defines semialgebraic sets W_k(U), proves that the graph of the volume-normalized cone-volume map is the union of their closures (Lemma 3.2), and applies the Tarski-Seidenberg projection theorem. An additional section gives explicit polynomial descriptions for planar polygons, and a final section discusses non-uniqueness of right-hand sides giving the same cone-volume vector.","tokens_in":19413,"tokens_out":17524,"duration_ms":191985,"significance":"If Theorem 1.3 is correct, it is a substantial step for the discrete logarithmic Minkowski problem: it replaces an open existence question with the study of a semialgebraic subset of the simplex, and the path-connectedness result provides qualitative information that was previously known only in the plane or for special polytopes. The proof is a clean direct construction from the definition of C_cv(U), using Tarski-Seidenberg rather than any fitting or assumed target result; the paper also gives a degree bound for the polynomial description and connects the subspace concentration conditions to matroid base polytopes, which is a useful geometric reformulation. The main caveat is that the central stratification Lemma 3.1 is imported from the literature in a compressed form, and one later proposition (Proposition 3.6) is false as stated, although it is not needed for the main theorem.","major_comments":[{"comment":"Lemma 3.1 is the load-bearing input to Theorem 1.3, but its proof is only a citation to McMullen's representation theorem together with Schneider's Lemma 5.1.3. The clause that the type-cones A_k(U) can be chosen as m-dimensional cones with simple polytopes on their interiors is not automatic and needs a precise justification: a non-simple polytope such as a regular octahedron with its eight facet-normal directions shows that non-simplicity is a codimension-at-least-one condition, and one must explain why such polytopes lie only on boundaries of the maximal cones rather than in their interiors. Please state the exact theorem from [21] being used and give the argument that the maximal cones have simple interiors; without this, the polynomial equations defining W_k(U) are not established and Theorem 1.3 is unsupported.","section":"§3, Lemma 3.1"},{"comment":"Proposition 3.6 as stated is false: C_cv(U) is not equal to the union over k in I(U) of Pi(W_k(U)) without taking closures. For a simplex U in general position, C_cv(U)=conv{e_1,...,e_{n+1}} contains the vertices e_i, but for the unique k in I(U) every vector in Pi(W_k(U)) has all coordinates strictly positive, because b lies in the interior of the type-cone and all facet volumes are positive. The proof itself only shows that (gamma(U,b),b) lies in cl W_k(U), which does not imply membership in Pi(W_k(U)). Since Section 4 correctly uses the closure version, this error does not affect Theorem 1.3, but the proposition and its proof need to be corrected.","section":"§3, Proposition 3.6"}],"minor_comments":[{"comment":"In the direct-sum formula (2.10), both summands are written as P(S,b_S); the second factor should be P(\\bar S,b_{\\bar S}) with \\bar S=U\\setminus S.","section":"§2, proof of Proposition 2.7"},{"comment":"The text refers to \"Corollary 3.6\" when the intended reference is Proposition 3.6; please fix the cross-reference.","section":"§4"},{"comment":"There are several typos, including \"genreral\", \"diemnsions\", \"uniquness\", and \"Tothisendlet\"; a careful proofreading pass is needed.","section":"Throughout"},{"comment":"Equation (3.1) contains a double equals sign (\"==\"); it should be a single equality.","section":"§3, proof of Lemma 3.1"},{"comment":"The vector (0,0,1,1,) contains a stray comma and should be (0,0,1,1)^T.","section":"§2, Example 2.6"},{"comment":"The computation with MomentPolynomialOpt.jl is presented as an approximate numerical solution; please indicate whether a rigorous certificate of finiteness was obtained or explicitly label the finding as numerical evidence.","section":"§5, Example 5.3"}],"recommendation":"major_revision","confidential_remarks":"The central result appears to be sound, and the two main problems are localized: Lemma 3.1 needs a fuller proof or exact reference for the simplicity/full-dimensionality clause, and Proposition 3.6 is false as stated but is not used in the main theorem. Both are fixable within the scope of the paper, so I recommend major revision rather than rejection. The paper is appropriate for math.MG."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"You should know this paper delivers what it claims: C_cv(U) is semialgebraic in arbitrary dimension, and it is also path-connected. The matroid-polytope description of the subspace concentration set is a nice conceptual step, and the characterization of the equality case (parallelepipeds only) is clean. This is a solid contribution to the discrete logarithmic Minkowski problem.\n\nThe proof of Theorem 1.3 is a coherent projection argument once Lemma 3.1 is granted: finite type-cone decomposition, polynomial volume formulas, then Tarski–Seidenberg. The one concrete error is Proposition 3.6, where the equality should involve closures of the W_k(U). As stated it fails on boundary points, e.g., simplex vertices, which are in C_cv(U) but not in any Π(W_k(U)). The proof itself establishes the closure version, and Section 4 uses the closure form, so this is a minor, easily corrected misstatement that does not infect the main result.\n\nI also checked the stress-test worry about Lemma 3.1, that McMullen/Schneider might not guarantee full-dimensional chambers whose interiors are simple. The worry does not land. For fixed U, non-simplicity of P(U,b) means some vertex has more than n active inequalities, which forces linear equalities among the entries of b; that cannot happen on an open set. So the interiors of the full-dimensional type cones are simple, and vertices depend linearly on b, making facet volumes polynomial. The lemma is correct, though the proof is terse and a referee might ask for a sentence justifying full-dimensionality.\n\nThe path-connectedness proof leans on Henk–Linke's theorem, which is cited; that is fine. The paper is honest about what is conjecture (5.2) and what is proven. The examples are helpful, including the trapezoid computations. Minor typos aside, the writing is clear.\n\nBottom line: this is a real structural result, with a small presentational flaw but no load-bearing gap. Convex geometers working on the logarithmic Minkowski problem should read it, and it deserves formal peer review.","headline":"Semialgebraicity of cone-volume sets is a genuine advance and the proof essentially works; a small missing-closure error in Proposition 3.6 is easy to fix.","tokens_in":19961,"tokens_out":5525,"would_cite":true,"duration_ms":60884,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["52A20","52B11","52B40","14P10"],"pacs":[],"model":"deepseek-v4-flash","headline":"For any fixed matrix of facet normals, the cone-volume set of a polytope family is path-connected and semialgebraic.","keywords":["cone-volume measure","logarithmic Minkowski problem","semialgebraic set","subspace concentration condition","matroid base polytope","type-cone","polytope","path-connectedness"],"falsifier":"For a small $U$ (for example the five-vector pentagon of Example 5.3), eliminate the $b$-variables from the polynomial equations defining $W_k(U)$ with a quantifier-elimination routine; if the resulting projection has a boundary that is not a finite union of sets defined by polynomial equations, then $C_{\\rm cv}(U)$ is not semialgebraic and Theorem 1.3 is false.","tokens_in":18869,"feed_emoji":"📐","tokens_out":11060,"duration_ms":96362,"temperature":0.7,"pith_summary":"The paper studies the cone-volume set $C_{\\rm cv}(U)$, the collection of all normalized cone-volume vectors of polytopes $P(U,b)=\\{x\\in\\mathbb{R}^n: U^{\\intercal}x\\le b\\}$ with a fixed matrix $U$ of facet normals. It proves that for every $U\\in U(n,m)$, this set is path-connected and semialgebraic, meaning it can be described by finitely many polynomial inequalities. That matters because the discrete logarithmic Minkowski problem asks exactly which vectors can arise as cone-volume measures; knowing the answer set is semialgebraic turns existence into a finite system of polynomial conditions. The same framework represents the subspace concentration condition geometrically as a polytope $P_{\\rm scc}(U)$, which is up to scaling the matroid base polytope of $U$.","feed_headline":"Cone-volume sets obey polynomial inequalities","feed_subtitle":"For fixed facet directions, the attainable cone-volume measures are path-connected and polynomial-defined.","key_machinery":"The carrying object is the type-cone subdivision of $\\mathbb{R}^m_{\\ge 0}$ together with the sets $W_k(U)$ defined by the polynomial equations $\\gamma_i=f_{k,i}(b)b_i/n$ and $v_k(b)=1$. On each type-cone, the volume and facet volumes of $P(U,b)$ are polynomials in $b$ of degree at most $n$, so $W_k(U)$ is semialgebraic; the semialgebraic projection property turns the union of their closures into $C_{\\rm cv}(U)$. The subspace concentration polytope $P_{\\rm scc}(U)$, a scaled matroid base polytope, supplies the geometric comparison set whose relative interior is contained in $C_{\\rm cv}(U)$.","core_discovery":"On the paper's own terms, the central discovery is Theorem 1.3 combined with Proposition 2.10: for any $U\\in U(n,m)$, the cone-volume set $C_{\\rm cv}(U)$ is a semialgebraic set and is path-connected. The proof partitions the parameter space $b\\in\\mathbb{R}^m_{\\ge 0}$ into finitely many type-cones; on each cone, the polytope volume and facet volumes vary polynomially in $b$, so the pairs (cone-volume vector, $b$) form a semialgebraic set $W_k(U)$, and projecting these sets to the cone-volume coordinate gives $C_{\\rm cv}(U)$. The paper also characterizes when $C_{\\rm cv}(U)$ coincides with the subspace concentration polytope $P_{\\rm scc}(U)$: this happens exactly for centrally symmetric $U$ with $m=2n$, that is, for parallelepipeds.","pith_inferences":["Because semialgebraic sets are closed under quantifier elimination, the polynomial data defining $W_k(U)$ can in principle be converted algorithmically into explicit polynomial inequalities for $C_{\\rm cv}(U)$; the paper's degree bound says this is finite, though for large $m$ it will be impractical.","The equality characterization suggests a natural numerical probe: for non-parallelepiped $U$, measure the Hausdorff distance between $C_{\\rm cv}(U)$ and $P_{\\rm scc}(U)$ for small $n,m$ to quantify how much of the cone-volume set is missed by the subspace concentration condition.","Conjecture 5.2, that $\\dim^*(S(U,\\gamma))=d-1$, implies that for irreducible $U$ the right-hand side realizing a fixed strictly positive cone-volume vector is finite; testing this on the pentagon example and other small irreducible systems would either support or refute the conjecture.","The matroid-base-polytope description of $P_{\\rm scc}(U)$ means the subspace concentration condition can be checked through matroid flats and separators; known matroid algorithms for base-polytope membership could make verification of the condition practical for large $m$."],"forward_implications":["For every $U$, $C_{\\rm cv}(U)$ is path-connected and semialgebraic, so the discrete logarithmic Minkowski existence problem for fixed $U$ reduces to checking membership in a semialgebraic subset of the standard simplex.","The degree bound of Corollary 3.4 places an explicit ceiling on the number and degree of the polynomial inequalities needed to describe $C_{\\rm cv}(U)$.","For all non-parallelepiped $U$, the subspace concentration condition is necessary but not sufficient; the sets $C_{\\rm cv}(U)$ and $P_{\\rm scc}(U)$ fail to coincide even though the relative interior of $P_{\\rm scc}(U)$ lies inside $C_{\\rm cv}(U)$.","The decomposition $C_{\\rm cv}(U)=\\bigoplus_j (\\mathrm{rg}(S_j)/n)C_{\\rm cv}(S_j)$ over irreducible components yields dimension $m-d$ and explains how cone-volume sets of smaller systems combine."],"supporting_citations":[{"why":"introduces the discrete logarithmic Minkowski problem and the subspace concentration condition, and supplies the symmetric-case equality reformulated here.","marker":"[9]"},{"why":"provides the inclusion of the relative interior of the subspace concentration polytope into the cone-volume set, used for dimension and comparison.","marker":"[10]"},{"why":"supplies the representation theorem that splits the parameter space into finitely many type-cones with fixed combinatorial type.","marker":"[21]"},{"why":"gives the support-number formulas proving facet volumes are polynomial on each type-cone, and the existence theorem for polytopes with given facet volumes.","marker":"[24]"},{"why":"provides the cone-volume framework and the fact that centroid-centered polytope cone-volume vectors lie in the relative interior of the subspace concentration polytope, carrying the path-connectedness proof.","marker":"[15]"},{"why":"establishes the planar semialgebraic case and supplies the edge-length formula used in the polygon description.","marker":"[25]"},{"why":"gives the general-position result that the cone-volume set fills the relative interior of the simplex, used as benchmark and example.","marker":"[27]"},{"why":"supplies the explicit trapezoid cone-volume description used to show non-convexity, boundary points, and non-closedness.","marker":"[22]"}],"fun_headline_variants":["Cone-volume sets are semialgebraic and path-connected","Polytope cone-volumes form semialgebraic sets","Path-connected polynomial inequalities for cone-volumes","Cone-volume vectors define semialgebraic sets","Connecting cone-volumes to polynomial geometry"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof depends on Lemma 3.1's claim that the parameter space of right-hand sides splits into finitely many cones on which polytope volume and facet volumes are polynomial in the right-hand side; if that finite polynomial stratification fails, the semialgebraic conclusion is not established.","fun_headline_variants_meta":{"raw":{"variants":["Cone-volume sets are semialgebraic and path-connected","Polytope cone-volumes form semialgebraic sets","Path-connected polynomial inequalities for cone-volumes","Cone-volume vectors define semialgebraic sets","Connecting cone-volumes to polynomial geometry"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000199,"raw_usage":{"total_tokens":1354,"prompt_tokens":913,"completion_tokens":441,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":529,"completion_tokens_details":{"reasoning_tokens":365}},"tokens_in":529,"tokens_out":441,"duration_ms":4624,"temperature":1.0,"reasoning_tokens":365,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T19:37:39.578540+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For a small $U$ (for example the five-vector pentagon of Example 5.3), eliminate the $b$-variables from the polynomial equations defining $W_k(U)$ with a quantifier-elimination routine; if the resulting projection has a boundary that is not a finite union of sets defined by polynomial equations, then $C_{\\rm cv}(U)$ is not semialgebraic and Theorem 1.3 is false.","supporting_citations":[{"cited_title":"The logarithmic Minkowski problem for non-symmetricmeasures","cited_arxiv_id":null,"evidence_quote":"provides the inclusion of the relative interior of the subspace concentration polytope into the cone-volume set, used for dimension and comparison."},{"cited_title":"Cone-volume measures of polytopes","cited_arxiv_id":null,"evidence_quote":"provides the cone-volume framework and the fact that centroid-centered polytope cone-volume vectors lie in the relative interior of the subspace concentration polytope, carrying the path-connectedness proof."},{"cited_title":"ThelogarithmicMinkowskiproblemforpolytopes","cited_arxiv_id":null,"evidence_quote":"gives the general-position result that the cone-volume set fills the relative interior of the simplex, used as benchmark and example."},{"cited_title":"Subspace Concentration of Geometric Measures","cited_arxiv_id":null,"evidence_quote":"supplies the explicit trapezoid cone-volume description used to show non-convexity, boundary points, and non-closedness."}],"review_version":2}