{"id":"2510573c-5031-4b17-89d5-105a34945187","arxiv_id":"2505.24352","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Polynomial-gauge and polynomial-radial star bodies are dense, admit O(1/degree) approximation with optimal constants, and yield algorithms for slice and width computations.","lead":"This paper introduces polystar bodies, star-shaped sets whose shape is described by polynomials, and proves they can approximate any reasonable star-shaped body with a provable error bound. This gives a new computational route to geometric questions such as finding the largest flat slice through a 3D object.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The radial Lipschitz bound in Theorem 1.1(3) is not established as printed: the proof divides by sup γ^2 instead of (inf γ)^2, so the claimed constant κ=R^2/r needs a corrected derivation.","rationale":"I agree with the reader's conditional verdict. The paper's central contributions—density of polystar bodies, the O(κ/d) distance estimates, the asymptotic optimality in Theorem 1.2, and the computational pipeline—do not appear to hinge on the exact constant R^2/r in Theorem 1.1(3). The existence of a finite Lipschitz constant for ρ follows from the equivalence of Lipschitz continuity of γ and ρ on compact starbodies together with Proposition 2.2, so the flaw is local and fixable. However, the erroneous division by sup γ^2 instead of (inf γ)^2 is a genuine mathematical error in a stated theorem, and the theorem's abundance claim is load-bearing for the paper's narrative that Lipschitz starbodies are plentiful with explicitly known constants. Since the proof as printed does not establish the claimed bound, the appropriate disposition is conditional acceptance pending a corrected derivation. I do not see a deeper structural problem with the main theorems or the numerical methodology, provided the code repository is verified.","tokens_in":22919,"tokens_out":1625,"duration_ms":21647,"concrete_test":"Re-derive the radial Lipschitz bound under the stated assumptions L⊆B_R(0), starshaped with respect to B_r(0). Check the two candidate constants: (a) κ=(sup ρ)^2/r=R^2/r and (b) κ=(inf ρ)^{-2}/r. Test the family L=B_R(0) with R>1: it is starshaped with respect to B_r(0) for r≤R, and its radial function is the constant R. The displayed proof algebra would need to produce a valid Lipschitz constant for this constant function; any claimed constant depending on inf ρ must be checked against this example. If the authors supply a corrected derivation that yields R^2/r as a valid (possibly non-sharp) constant, the concern is resolved.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Theorem 1.1(3) claims κ=R^2/r is a valid Lipschitz constant for the radial function when L⊆B_R(0) is starshaped with respect to B_r(0). The displayed derivation is |ρ(y)−ρ(x)| ≤ |γ(y)−γ(x)| / sup_z |γ(z)|^2, then equates sup γ^2 with 1/(inf ρ^2). This is algebraically backwards: sup γ = 1/inf ρ, so the correct denominator is (inf γ)^2 = 1/(sup ρ)^2. Since ρ≤R, the printed bound would give κ=m/r with m=inf ρ^2, not R^2/r. The claimed R^2/r may be recoverable by writing |ρ(y)−ρ(x)| = |γ(y)−γ(x)|/(γ(x)γ(y)) and using ρ=1/γ, but as written the proof has a genuine inequality-direction error at a load-bearing step. This affects the 'abundance of Lipschitz starbodies' part of Theorem 1.1: the existence of some finite Lipschitz constant for ρ follows from Proposition 2.2 and compactness, but the explicit constant R^2/r asserted in the theorem is not proven by the text.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces polystar bodies, defined as starbodies whose gauge or radial function agrees with a polynomial on the unit sphere, and develops a theory of polynomial approximation for starshaped geometry. The main results are: density of polygauge and polyradial bodies among continuous starbodies; quantitative uniform approximation of Lipschitz gauge/radial functions by degree-d polystar bodies with error O(kappa/d), based on spherical convolution with nonnegative Gegenbauer filters; a Kolmogorov-width lower bound showing this rate is asymptotically optimal; constructive quadrature-based algorithms for computing such approximations from black-box evaluations; and numerical demonstrations for intersection bodies, largest-volume slices, and widths of several three-dimensional bodies.","tokens_in":23119,"tokens_out":15855,"duration_ms":206120,"significance":"If the results hold, polystar bodies provide a computational model class for starshaped geometry that is both dense and optimally accurate in a worst-case sense. The paper's strengths are the constructive nature of the approximation theorem with explicit constants obtained from Gegenbauer root bounds, the absence of fitted parameters in the error estimates, and the numerical validation against independently known exact values such as the cube's largest slice direction and the octahedron's width. The algorithms require only black-box evaluations and quadrature, and the sum-of-squares structure in Theorem 4.6 is attractive for subsequent optimization. These contributions are substantial, and the main ideas are sound and publishable after the errors identified below are corrected.","major_comments":[{"comment":"The inequality displayed in the proof, |rho(y)-rho(x)| <= |gamma(y)-gamma(x)| / sup_z |gamma(z)|^2, is written in the wrong direction: since gamma(x)gamma(y) can be much smaller than sup gamma^2, dividing by the supremum gives a lower bound rather than an upper bound. The proof as printed therefore yields the constant m/r with m = inf rho^2, which is not generally a valid Lipschitz constant for rho, and it does not establish the theorem's stated constant R^2/r. The claim R^2/r is nevertheless true and can be proved by the corrected estimate |rho(y)-rho(x)| = |gamma(y)-gamma(x)|/(gamma(x)gamma(y)) <= (1/(inf gamma)^2)|gamma(y)-gamma(x)| <= R^2 * (1/r) d(x,y), using rho <= R. This step is load-bearing for the abundance-of-Lipschitz-starbodies assertion and must be repaired.","section":"3.3, proof of Theorem 1.1(3)"},{"comment":"The statement defines beta = min(dim(W) - 1/(n-1), 2/kappa), which is not dimensionally meaningful and does not match the proof. The proof requires beta to satisfy N beta^{n-1} < 1 with N = dim W, and also beta < 2/kappa so that delta = beta/2 satisfies the positivity condition in Lemma 3.5. The intended definition is evidently beta = min(c_N N^{-1/(n-1)}, c_kappa/kappa) up to absolute constants from the volume argument. The later dimensional passage of the proof, including the corrupted expression 'beta < N - 1/n+1', also needs a clean restatement. As printed, the lower bound kappa beta/2 depends on an ill-defined quantity, so the theorem cannot be checked in its current form.","section":"3.4, Theorem 1.2"},{"comment":"The zonal expansions in Algorithm 2 are summed only over j = 1, ..., d, and in Algorithm 3 only over even j starting at j = 2. In both cases the j = 0 harmonic component is omitted. For a generic positive gauge or radial function the zeroth component is nonzero, and omitting it introduces an O(1) error that does not vanish with d; this invalidates the stated uniform approximation guarantee in Algorithm 2 and the intersection-body approximation formula in Algorithm 3. The fix is to include the j = 0 term (with the corresponding Radon-transform multiplier in Algorithm 3) or to compute and add the constant component separately.","section":"4.2, Algorithm 2; 5.1, Algorithm 3"}],"minor_comments":[{"comment":"The sentence 'The body L1 (resp. L2) is convex if and only if its polar body is convex' is false as stated, because the polar of any set is convex by definition. The intended equivalence is between convexity of L and the function p (resp. 1/q) being a support function; the polar-body sentence should be removed or reformulated.","section":"2.2, Proposition 2.7(2)"},{"comment":"The text says 'using the fact that L1 is polyradial' in the argument about L1; this should say 'polygauge'.","section":"2.2, proof of Proposition 2.7(1)"},{"comment":"Algorithm 1 says the quadrature rule is 'exact in degrees d+m and 2d'; this should read 'exact in degree max(d+m, 2d)', matching Proposition 4.3.","section":"4.1, Algorithm 1"},{"comment":"The proof of Theorem 1.2 switches notation from f_tau to rho_{L*} midway; since f_tau is used as a gauge function, the notation should be made consistent.","section":"3.4, Lemma 3.5 and Theorem 1.2 proof"},{"comment":"The claim that every positive function on S^{n-1} is the gauge/radial function of some starbody requires the function to be continuous (or at least measurable with suitable boundedness) for the resulting set to be compact with interior containing the origin; this regularity condition should be stated.","section":"2.1"}],"recommendation":"major_revision","confidential_remarks":"The paper fits the scope of the journal and the core approximation framework is promising. The main theorem's proof error, the garbled statement of Theorem 1.2, and the missing constant term in the algorithms are all fixable locally, but together they require a careful revision. The numerical examples are presented as illustrations rather than certified computations; the authors may wish to state explicitly that the maximizations in Section 5 rely on heuristic global optimization."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague, read this one if you care about starbodies, polynomial optimization, or geometric tomography. The paper introduces polystar bodies—starbodies whose gauge or radial function is a polynomial on the sphere—and proves they are uniformly dense in the space of starbodies with continuous gauge/radial functions. The distance estimates give an O(kappa/d) uniform approximation rate for Lipschitz starbodies, and the Kolmogorov-width lower bound shows this rate is asymptotically best possible among all linear subspaces of that dimension. That combination is genuinely new. The convolution machinery (Newman-Shapiro, Ragozin) is prior, but the deployment here—plus the explicit constants and the quadrature algorithms built on Funk-Hecke—makes this a practical construct, not just an existence theorem.\n\nThe central argument holds up. No parameters are fitted to make the theorems come out; the constants come from known root bounds. The numerical examples are checked against exact values (cube slice, octahedron width) and the computed digits match. That's responsible.\n\nTwo soft spots, both local. First, in Theorem 1.1(3), the proof that the radial function has Lipschitz constant R^2/r writes |gamma(y)-gamma(x)| / sup gamma^2, and calls that an upper bound for |rho(y)-rho(x)|. That inequality goes the wrong way: the denominator should be (inf gamma)^2 = (1/sup rho)^2. The claimed constant R^2/r is recoverable with a one-line fix, and the existence of some Lipschitz constant for rho follows anyway from Proposition 2.2 plus compactness, so the theorem doesn't collapse. But as printed, the explicit constant is not proven.\n\nSecond, Theorem 1.2's statement has a malformed beta—looks like a typesetting slip rather than a conceptual error; the proof's volume argument is standard, but the statement needs a clean rewrite. A serious referee should also ask for a pinned, runnable code release; the GitHub link is unversioned and the examples rely on Mathematica heuristics, which limits reproducibility.\n\nBottom line: this paper is for researchers working at the intersection of convex geometry and polynomial optimization. It deserves a serious referee, and after a revision fixing those typos and hardening the code release, it should be accepted. I'd recommend sending it out.","headline":"A solid new framework for approximating starshaped sets with polynomials; two fixable typos in the proof details shouldn't sink a paper that otherwise contributes a real tool.","tokens_in":23685,"tokens_out":3733,"would_cite":true,"duration_ms":44421,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["41A10","41A46","52A30"],"pacs":[],"model":"deepseek-v4-flash","headline":"Polystar bodies are uniformly dense in continuous starbodies, and their degree-d approximations attain the optimal worst-case error rate.","keywords":["polystar bodies","starshaped sets","gauge function","radial function","spherical polynomial approximation","Gegenbauer polynomials","Kolmogorov width","intersection bodies"],"falsifier":"Run Algorithm 2 on the cube's radial function $\\rho(x)=\\min_i 1/|x_i|$ in dimension 3 (known Lipschitz constant $\\kappa=1$) for degrees $d=10,20,40,80$ and compare the measured sup error against the bound $(\\pi/\\sqrt{2})\\sqrt{1-\\lambda_{d/2+1}}$; if the error is not bounded by this expression asymptotically, or if it decays slower than $C/d$ for all large $d$, then Theorem 1.1(2)'s error estimate or its constant is wrong.","tokens_in":22670,"feed_emoji":"⭐","tokens_out":17534,"duration_ms":183870,"temperature":0.7,"pith_summary":"This paper introduces polystar bodies, compact star-shaped sets whose gauge or radial function is the restriction of a polynomial to the unit sphere. It proves that polystar bodies are uniformly dense in all starbodies with continuous gauge or radial function, and that when the target function is Lipschitz with constant $\\kappa$, a degree-$2k$ polystar approximation exists with uniform error at most $(\\pi/\\sqrt{2})\\sqrt{1-\\lambda_{k+1}}\\,\\kappa$, which decays as $\\pi(n-2)\\kappa/(\\sqrt{2}\\,d)$ as $d\\to\\infty$. A second theorem shows this $O(\\kappa/d)$ rate cannot be improved by any finite-dimensional function space of the same dimension as degree-$d$ polynomials, so the construction is asymptotically optimal. The paper also develops a quadrature-based algorithm that builds such approximations from black-box evaluations using polynomially many points, and shows the resulting functions are sums of squares on the sphere, enabling computations of intersection bodies, largest-volume slices, and widths.","feed_headline":"Polystar bodies uniformly approximate every Lipschitz starbody","feed_subtitle":"Degree-d polynomial gauge or radial functions give uniform error O(κ/d), a rate no same-size subspace can beat.","key_machinery":"The load-bearing object is the spherical convolution operator $T_u(f)(x)=\\int_{S^{n-1}} u(\\langle x,y\\rangle) f(y)\\,d\\mu(y)$ with a nonnegative univariate polynomial filter $u$. For the approximation theorem the filter is $u_{2k}(t)=c\\bigl(C_{k+1}^{(\\alpha)}(t)/(t-\\lambda_{k+1})\\bigr)^2$, whose defining property is $T_{u_{2k}}(\\langle x,\\cdot\\rangle)(x)=\\lambda_{k+1}$, the largest root of the Gegenbauer polynomial of degree $k+1$; this identity converts the bound on squared geodesic distance into the explicit error constant. The same operator preserves support functions, which makes the polygauge approximation of a convex body convex. On the algorithmic side, the Funk–Hecke formula decomposes $T_u$ into a scaling of each spherical-harmonic component, and an exact quadrature rule approximates each component from finitely many evaluations. The opposite direction is carried by a Kolmogorov-width argument: a packing of $2^{N+1}$ tent-like Lipschitz functions on the sphere forces any $N$-dimensional subspace to have worst-case error at least $\\kappa\\beta/2$.","core_discovery":"The central discovery is that the two functions defining any reasonably regular starbody—gauge and radial—can be replaced, uniformly and at the optimal asymptotic rate, by polynomials on the sphere without losing geometric information. The approximating bodies, called polystar bodies, are produced by a spherical convolution operator whose filter is a nonnegative univariate polynomial $u_{2k}(t)=c\\bigl(C_{k+1}^{(\\alpha)}(t)/(t-\\lambda_{k+1})\\bigr)^2$, where $\\lambda_{k+1}$ is the largest root of the Gegenbauer polynomial of degree $k+1$ and $\\alpha=(n-2)/2$. The filter is chosen so the convolution's first moment is exactly $\\lambda_{k+1}$, converting a Cauchy–Schwarz estimate on geodesic distance into the explicit error bound. Optimality is stated through a Kolmogorov-width lower bound: any subspace $W$ containing the constants has worst-case error at least $\\kappa\\beta/2$ over the class of $\\kappa$-Lipschitz positive functions, where $\\beta=\\min\\bigl((\\dim W-1)/(n-1),\\,2/\\kappa\\bigr)$, yielding a $C_0\\kappa/d$ lower bound for polynomials of degree $d$. Computationally, an exact quadrature rule together with the Funk–Hecke formula turns the convolution into a finite sum, and nonnegativity of the filter makes the output a sum of squares in the coordinate ring of the sphere.","pith_inferences":["Algorithm 1 is a general recipe for uniform polynomial approximation of any black-box Lipschitz function on the sphere, independent of starbodies; it could be reused for spherical designs, quadrature construction, or other sphere-constrained optimization tasks.","The node count of the proposed quadrature rules grows like $(k+1)^{n-1}$, so the polynomial-time statement is for fixed dimension; extending the method to the slicing-conjecture regime $n\\ge 5$ will require sparse or adaptive quadrature.","The paper separates approximation error from optimization error: after a polystar approximation is built, the remaining cost is maximizing a polynomial on the sphere, where sum-of-squares hierarchies converge at $O(1/\\ell)$ or $O(1/\\ell^2)$; for high degrees this optimization step, not approximation, is likely the practical bottleneck.","Because the convolution filter is nonnegative, the output is a sum of squares, so the same geometric approximation pipeline could be adapted to certify positivity of gauge/radial-like functions on spheres, not just to represent them."],"forward_implications":["Density: every starbody with continuous gauge or radial function can be uniformly approximated by polystar bodies, so the class is rich enough to model all continuous star-shaped geometry.","Rate: for Lipschitz starbodies a degree-$d=2k$ polystar approximation exists with sup error at most $(\\pi/\\sqrt{2})\\sqrt{1-\\lambda_{k+1}}\\,\\kappa \\sim \\pi(n-2)\\kappa/(\\sqrt{2}\\,d)$, and the paper gives geometric sufficient conditions: starshapedness around a ball of radius $r$ inside $B_R(0)$ yields $\\kappa=1/r$ for the gauge and $\\kappa=R^2/r$ for the radial function.","Optimality: no finite-dimensional subspace of dimension equal to that of degree-$d$ polynomials achieves an asymptotically smaller worst-case error on the class of $\\kappa$-Lipschitz functions, so the polynomial model is dimension-optimal.","Computability: the approximating polynomial can be constructed from black-box evaluations of the gauge/radial function using quadrature rules with polynomially many nodes, and the result is a sum of squares on the sphere, making subsequent maximization semidefinite-representable.","Geometry preservation: the intersection body of a polyradial body is polyradial, and polygauge approximations of convex bodies are convex, so the method transfers algebraic structure to geometric invariants like largest-volume slices and widths."],"supporting_citations":[{"why":"Supplies the polynomial-convolution approximation theorem for Lipschitz functions on spheres that is the paper's main technical tool.","marker":"[NS64]"},{"why":"Extends the convolution-based approximation method to spheres, providing the rate framework that Theorem 3.1 refines.","marker":"[Rag71]"},{"why":"Provides the bound on the largest Gegenbauer root $1-\\lambda_{k+1}\\sim(n-2)^2/d^2$ used for the explicit constant in Theorem 1.1(2).","marker":"[DJ12]"},{"why":"Contributes the volume-argument technique for Kolmogorov-width lower bounds used in Theorem 1.2.","marker":"[Lor60]"},{"why":"Shows the convolution operator preserves support functions, yielding convexity of polygauge approximations in Theorem 1.1(4).","marker":"[Kid06]"},{"why":"Supplies the algorithm for computing Gaussian quadrature nodes and weights used by Algorithms 1–3.","marker":"[GW69]"},{"why":"Provides the sum-of-squares hierarchy convergence on spheres that motivates the convolution-filter approach and benchmarks the optimization step.","marker":"[FF21]"},{"why":"Gives explicit intersection bodies of polytopes, used to validate the numerical largest-slice outputs in the examples.","marker":"[BBMS22]"}],"fun_headline_variants":["Polystar bodies achieve Kolmogorov-optimal approximation","Dense polystar bodies attain optimal uniform error","Polynomial radial functions give tractable polystar bodies","Optimal starbody approximation via spherical convolution","Polystar bodies: uniform approximation at optimal rate"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The $O(\\kappa/d)$ guarantee requires the gauge or radial function to have a known finite Lipschitz constant $\\kappa$, which the paper tries to derive from the assumption that the body is starshaped with respect to a whole ball; for the radial function that derivation as printed divides by the sup of $\\gamma^2$ instead of the inf, so the stated $R^2/r$ constant is not established by the displayed argument.","fun_headline_variants_meta":{"raw":{"variants":["Polystar bodies achieve Kolmogorov-optimal approximation","Dense polystar bodies attain optimal uniform error","Polynomial radial functions give tractable polystar bodies","Optimal starbody approximation via spherical convolution","Polystar bodies: uniform approximation at optimal rate"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001233,"raw_usage":{"total_tokens":5047,"prompt_tokens":909,"completion_tokens":4138,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":525,"completion_tokens_details":{"reasoning_tokens":4043}},"tokens_in":525,"tokens_out":4138,"duration_ms":36733,"temperature":1.0,"reasoning_tokens":4043,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T12:25:25.973271+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run Algorithm 2 on the cube's radial function $\\rho(x)=\\min_i 1/|x_i|$ in dimension 3 (known Lipschitz constant $\\kappa=1$) for degrees $d=10,20,40,80$ and compare the measured sup error against the bound $(\\pi/\\sqrt{2})\\sqrt{1-\\lambda_{d/2+1}}$; if the error is not bounded by this expression asymptotically, or if it decays slower than $C/d$ for all large $d$, then Theorem 1.1(2)'s error estimate or its constant is wrong.","supporting_citations":[],"review_version":1}