Pith. sign in

REVIEW 3 major objections 5 minor 28 references

Reflexive polytopes and the Picard ranks of Gorenstein toric Fano varieties

T0 review · 3 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For every polar pair of reflexive polytopes, the Picard ranks of the two toric Fano varieties sum to at most min{|F(P)|,|V(P)|} − d + 1, and equality forces a simple-simplicial pair.

desk verdict New bound on Picard rank sums for polar pairs; the proof has two fixable gaps and the computational evidence is real. read the letter →

arxiv 2507.15406 v2 pith:E5BWTLUN submitted 2025-07-21 math.AG math.CO

Zhuang He This is my paper · ORCID
classification math.AGmath.CO MSC 14M2552B2014J45
keywords reflexivepolytopesGorensteintoricFanovarietiesPicardrankpolarpairsaffinedependencesfacetcomplexitysimplicialsimple
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper establishes Theorem 1.1: for any polar pair (P,Q) of reflexive polytopes of dimension d ≥ 3, the associated Gorenstein toric Fano varieties X and Y satisfy ρ_X + ρ_Y ≤ min{|F(P)|, |V(P)|} − d + 1. The bound is achieved exactly when one member of the pair is simplicial, in which case the other member is simple and its variety has Picard rank 1. This generalizes Eikelberg's affine-dependence description of toric Picard groups to non-Q-factorial varieties and is, the author notes, the first result of this kind for sums over a polar pair. The proof introduces a combinatorial invariant, the facet complexity of a reflexive polytope, and shows it controls the Picard rank from above.

What carries the argument

The central object is the facet complexity ρ'(P), defined as the minimum over all orderings of the facets of a sum of per-facet costs: a facet costs 0 if its vertices that already appeared in earlier facets span the whole facet hyperplane, 1 if they span a codimension-one affine subspace, and ∞ otherwise. The proof shows ρ_X ≤ ρ' by passing through Eikelberg's space of affine dependences AD(Σ), the subspace of relations among scaled ray generators that vanish on all Q-Cartier divisors: the quotient H_Q/AD(Σ) has dimension ρ_X + d, and each facet added to a sequence can raise the spanned subspace by at most its cost, giving a flag whose total growth is ρ'. For the polar pair, the author runs two adjacent sequences in parallel — an adjacent vertex sequence of P and the dual adjacent facet sequence of Q — and charges the contributions of a newly added vertex and of the facets added around it to the same step, so that the sum of the two complexities is controlled by |F(P)| − d + 1.

What would settle it

Compute ρ_X and ρ_Y for all 473,800,776 four-dimensional reflexive polytopes and check whether any polar pair exceeds min{|F(P)|, |V(P)|} − 3; a single such pair would disprove Theorem 1.1, while inspecting the constructed sequences on any pair would directly test whether the two unproved adjacency claims hold.

Watch

Extended reading notes

Core claim

The central claim is that a polar pair of reflexive polytopes cannot have two large Picard-rank varieties at once: the sum of the two ranks is capped by the smaller of the two side counts minus d plus 1. Concretely, with P and Q polar and X=X_P, Y=Y_Q, the theorem states ρ_X + ρ_Y ≤ min{|F(P)|, |V(P)|} − d + 1. Equality forces P or Q to be simplicial; since simpliciality is polar to simplicity, the simple member of the pair then has Picard rank 1 while the simplicial member has the full Q-factorial rank |V| − d. Thus the extremal pairs are exactly the simple-simplicial ones, and the result recovers Eikelberg's earlier statement that the toric variety of a simple reflexive polytope has Picard rank 1.

Load-bearing premise

The inequality proof rests on two adjacency assertions made without proof: that the final vertex of the extended adjacent sequence in Lemma 4.3 satisfies the paper's condition (X), and that in the k_i > 0 case of Theorem 4.1 the last facet added at each step is adjacent to two earlier facets containing the current vertex.

Editorial extensions

If this is right

  • For dimension d ≥ 3, every Gorenstein toric Fano variety X and its polar Y obey ρ_X + ρ_Y ≤ min{|F(P)|, |V(P)|} − d + 1, so a large Picard rank on one side forces a small one on the other.
  • Equality occurs precisely for simple-simplicial polar pairs; in that case the simple polytope's variety has Picard rank 1, recovering Eikelberg's result for simple reflexive polytopes.
  • The facet complexity of any reflexive polytope is finite, satisfies ρ_X ≤ ρ' ≤ |F(P)| − 1, and can be computed by the paper's recursive algorithm; in dimension 3 it differs from the Picard rank for exactly 23 of the 4,319 reflexive polytopes, and whether gaps occur in higher dimensions is left open.
  • The difference ε = min{|F(P)|, |V(P)|} − d + 1 − ρ_X − ρ_Y is nonnegative, zero exactly for simple-simplicial pairs, and in dimension 3 ranges from 0 to 9, with the maximum attained by a unique self-dual polytope with 13 vertices and facets.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The two-sequence charging argument is essentially graph-theoretic, so one could try to sharpen ρ' by measuring per-step costs in the dual graph of the polytope, possibly yielding better bounds in dimensions where the 3-dimensional classification is unavailable.
  • If the unproved adjacency assertion in Lemma 4.3 fails for some polytope, the inequality may still be true, but the counting argument would need a different charging scheme; a computer search over 4-dimensional reflexive polytopes could isolate where the asserted condition breaks.
  • The dimension-3 data suggest the gap ρ' − ρ is sparse (23 of 4,319 polytopes); checking the 473,800,776 four-dimensional reflexive polytopes would show whether the gap becomes more common in higher dimensions and whether ε has a larger maximum than 9.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proves an upper bound for the sum of the Picard ranks of the two Gorenstein toric Fano varieties associated to a polar pair (P,Q) of reflexive polytopes of dimension d≥3: rho_X + rho_Y ≤ min{|F(P)|,|V(P)|} − d + 1, with equality if and only if P or Q is simplicial, in which case the simple member has Picard rank 1. The proof introduces a new combinatorial invariant, the facet complexity rho'(P), shows that rho_X ≤ rho'(P) ≤ |F(P)|−1 using Eikelberg's space of affine dependences, and then constructs two adjacent facet/vertex sequences on a polar pair to control rho'(P)+rho'(Q). The paper also gives an algorithm for rho' and reports computational data in dimension 3.

Significance. If the proof is completed, Theorem 1.1 is a genuinely new general statement for non-Q-factorial Gorenstein toric Fano varieties, going beyond the simplicial/simple cases treated by Casagrande and Eikelberg. The facet complexity is a natural and useful quantity, and Theorem 3.17 is cleanly derived from published results without fitted parameters. The paper includes reproducible Macaulay2 code and explicit dimension-3 checks, which are valuable. The main proof has three local gaps in Section 4, all of which appear repairable; once repaired, the result should be of interest to the toric geometry and log Fano communities.

major comments (3)
  1. [§4, Lemma 4.3] In the induction step, after extending the adjacent sequence L_H to L_G, the text states 'Since the last vertex in L_G satisfies the condition (X)' without proof. This assertion is load-bearing: it supplies the '-1' in the count (e0+1−e'−1), and the resulting bound e0+1−d feeds Lemma 4.2 and hence Theorem 4.1. Lemma 3.13(4) only guarantees that the final vertex has a previous neighbor; it does not control condition (X). The assertion is in fact true and can be justified as follows: for the final vertex v, choose a previous neighbor v_j; since the intersection of all facets of G containing v is {v}, some facet F contains v but not v_j; because v is the last vertex, F contains another previous vertex v_k, giving the required k. Please include this argument or an equivalent one in the proof.
  2. [§4, proof of Theorem 4.1, case k_i>0] The sentence 'The last one G_{i,k_i} contributes by 0, because when d≥3, G_{i,k_i} is adjacent to two other facets containing v_i, which have been added to L' is asserted without proof. The order of L_i supplied by Lemma 3.13(3) only ensures that each added facet is adjacent to some earlier facet, not that the last one is adjacent to two earlier facets containing v_i. This property is essential for the bound 'the total contribution is at most k_i', which is used to obtain the final estimate |F(P)|−d+1. The gap can be repaired by adding a graph-theoretic lemma: for d≥3, the adjacency graph of the facets containing a fixed vertex is 2-connected, and given a nonempty set of already added facets in that graph, the remaining facets can be ordered so that each new facet has an earlier neighbor and the last one has two earlier neighbors. Please state and prove such a lemma explicitly.
  3. [§4, proof of Theorem 4.1, equality case] The construction of the adjacent sequence T* = (F0,...,Fi=H,...,Fm) with initial segment over F_y is not justified by the cited Lemma 3.13(2). Applying Lemma 3.13(2) to the facet H yields an adjacent sequence of facets of H, but adjacency of two facets tau, tau' of H does not imply adjacency of the corresponding facets F_tau, F_tau' of Q: the two facets may meet only in a vertex. For instance, in a square antiprism, the two side facets adjacent to a square face H along two consecutive edges of H not containing a vertex are not adjacent, so the asserted adjacent sequence over F_y can fail to exist. The argument can be repaired by applying Lemma 3.13(2) to Q with vertex y and F the set of facets containing y, obtaining an adjacent sequence over all facets of Q not containing y; H is adjacent to at least one such facet (a facet F_sigma with sigma a facet of H missing y), so H can be appended and the rest of T* filled in via Lemma 3.13(3). With this repair, all facets before H still do not contain y, so the facet of P dual to y is not added to L until step i, and the contradiction goes through. Please replace the current step with this argument.
minor comments (5)
  1. [§3.2] In Definition 3.11(2) there is a duplicated phrase 'for each for each', and in the paragraph before Definition 3.12 the sequence L is said to be 'over V(P)' although it is a sequence of facets; it should read 'over F(P)'.
  2. [Example 3.21] The text says that the 23 exceptional polytopes have PALP ids listed in the sentence, but the list contains only 22 entries. Please check the list and the count.
  3. [§4, equality case] The symbol F_y is used both for a set of facets of Q adjacent to H and not containing y and, later, for 'the facet F_y dual to y', which is a facet of P. Rename the latter (for example, G_y) to avoid confusion.
  4. [§4.1 and elsewhere] There are several typos: 'We first discussion' should be 'We first discuss'; Lemma 3.8 has 'only only if'; Algorithm 3.1 begins with 'F unction'. These should be corrected.
  5. [Theorem 4.1] In the chain ρ_X+ρ_Y ≤ ρ_L+ρ_T* ≤ ... , the first inequality is obtained by applying Theorem 3.17 separately as ρ_X≤ρ_L and ρ_Y≤ρ_T*. Adding this one-line clarification would improve readability.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the main bound is a self-contained combinatorial derivation from Eikelberg's external affine-dependence theory and Brøndsted's polytope graph theorems, with a new combinatorial invariant defined independently of the Picard rank.

full rationale

The derivation chain is self-contained and non-circular. Theorem 3.17 bounds the actual Picard rank rho_X by the newly defined facet complexity rho' via Eikelberg's independently published description of Pic(X) as H_Q/AD(Sigma) (an external result, not a self-citation), and rho' is defined purely combinatorially in Definition 3.12 as a minimum over facet permutations of affine-dimension counts, with no reference to rho_X; the two quantities demonstrably differ (Example 3.21 lists 23 reflexive 3-polytopes with rho < rho'), so rho' is not a renamed Picard rank. Theorem 4.1 then bounds rho_L + rho_T* for a pair of dual adjacent sequences by |F(P)| - d + 1 using Lemmas 4.2-4.4, which are elementary polytope-geometry statements, and the equality case is argued separately via Lemma 4.4 and the Lower Bound Theorem. No parameter is fitted, no target quantity is inserted into a definition, and the load-bearing citations (Eikelberg, Brondsted, Casagrande) are external works that do not contain Theorem 1.1. The issue flagged in the reader's take - Lemma 4.3's unproved assertion that the final vertex of L_G satisfies condition (X), and Theorem 4.1's assertion that G_{i,k_i} is adjacent to two earlier facets containing v_i - is a genuine gap in justification but not circularity: the assertion is a combinatorial fact that can be justified from the facet-intersection argument, and nowhere does the paper assume the conclusion rho_X + rho_Y <= min{|F(P)|,|V(P)|} - d + 1 to prove itself. The proof of Theorem 4.1 therefore reduces to external first-principles polytope theory plus a new invariant that is not loaded with the target bound. Score 0.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

No parameters are fitted and the proof is purely combinatorial over fixed polytopes. The new objects, facet complexity and facet sequences, are definitions rather than physical postulates. The main external inputs are Eikelberg's theorem, Brondsted's connectivity theorem, and standard toric and polytope facts.

assumptions (4)
  • standard math Eikelberg's theorem describing Pic(X) via spaces of affine dependences, used in Theorem 3.4 and Corollary 3.5.
    The paper relies on the affine-dependence description of the Picard group as an external theorem from Eikelberg 1992.
  • standard math Brondsted's theorem that the graph of vertices of a polytope remains connected after deleting any subset of vertices of a facet, used in Lemma 3.13.
    This connectivity fact is the basis for constructing adjacent facet and vertex sequences.
  • domain assumption Batyrev's correspondence between reflexive polytopes and Gorenstein toric Fano varieties via spanning fans.
    This sets the geometric setting: every reflexive polytope gives a Gorenstein toric Fano variety, and polar pairs give mirror-style pairs.
  • standard math Standard face lattice facts for convex polytopes, such as a (d-2)-face being contained in exactly two facets.
    These facts are used implicitly when translating facet adjacency, duality, and the vertex-figure arguments in Lemmas 4.2, 4.3, and 4.4.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Reflexive polytopes and the Picard ranks of Gorenstein toric Fano varieties." pith.science (2026). https://pith.science/paper/E5BWTLUN

@misc{pith2026250715406,
  author       = {Pith},
  title        = {Pith review of: Reflexive polytopes and the Picard ranks of Gorenstein toric Fano varieties},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/E5BWTLUN}},
  note         = {Machine review of arXiv:2507.15406}
}
abstract

We prove that the sum of the Picard ranks of a polar pair of Gorenstein toric Fano varieties of dimension $d\geq 3$ is at most the minimum of the number of facets and vertices of the corresponding pair of reflexive polytopes minus $(d-1)$. This is a generalization of Eikelberg's theory of affine dependences describing the Picard groups of toric varieties. The upper bound is achieved if and only if the polar pair is a simple-simplicial pair.

Figures

Figures reproduced from arXiv: 2507.15406 by the authors.

Figure 1
Figure 1. The facet complexity of the reflexive polytope of PALP id 4309. Left: facet labels. Top: 0; front: 1, 2, 7, 8 (left to right, then top to bottom); left: 5; right: 6; back: 3, 4, 9, 10; bottom: 11. Top right: the sequence L1 with ρL1 = 5; bottom right: L2 with ρL2 = 2. Blue facets are those with (*) and ai = 1. Remark 3.16. If Q is the polar of P, then the Picard rank of a projective toric variety XQ also equals to t… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

28 extracted references · 26 canonical work pages

  1. [1]

    A proof of the lower bound conjecture for convex polytopes

    David Barnette. A proof of the lower bound conjecture for convex polytopes. Pacific journal of mathematics , 46(2):349--354, 1973

    work page 1973

  2. [2]

    Victor V. Batyrev. Dual polyhedra and mirror symmetry for C alabi-Yau hypersurfaces in toric varieties . J. Alg. Geom. , 3:493--545, 1994

    work page 1994

  3. [3]

    Victor V. Batyrev. On the classification of toric F ano 4-folds. Journal of Mathematical Sciences , 94(1):1021--1050, Mar 1999

    work page 1999

  4. [4]

    Sur une conjecture de M ukai

    Laurent Bonavero, Cinzia Casagrande, Olivier Debarre, and St \'e phane Druel. Sur une conjecture de M ukai. Commentarii Mathematici Helvetici , 78(3):601--626, Jul 2003

    work page 2003

  5. [5]

    Polyhedra: convex polyhedra

    Ren \'e Birkner and Lars Kastner. Polyhedra: convex polyhedra. Version 1.10 . A Macaulay2 package available at https://github.com/Macaulay2/M2/tree/master/M2/Macaulay2/packages

    work page

  6. [6]

    Polyhedra: a package for computations with convex polyhedral objects

    Ren \'e Birkner and Lars Kastner. Polyhedra: a package for computations with convex polyhedral objects . The Journal of Software for Algebra and Geometry: Macaulay2 , 1, 2009

    work page 2009

  7. [7]

    Convex Polytopes

    Arne Br ndsted. Convex Polytopes . Springer New York, New York, NY, 1983

    work page 1983

  8. [8]

    The number of vertices of a F ano polytope

    Cinzia Casagrande. The number of vertices of a F ano polytope. Annales de l'Institut Fourier , 56(1):121--130, 2006

    work page 2006

Show all 28 references
  1. [9]

    Cox, John B

    David A. Cox, John B. Little, and Henry K. Schenck. Toric varieties , volume 124 of Graduate Studies in Mathematics . American Mathematical Society, 2011

    2011

  2. [10]

    Toric F ano varieties , pages 93--132

    Olivier Debarre. Toric F ano varieties , pages 93--132. Bolyai Society Mathematical Studies 12. Springer, 2001

    2001

  3. [11]

    The P icard group of a compact toric variety

    Markus Eikelberg. The P icard group of a compact toric variety. Results in Mathematics , 22:509--527, 1992

    1992

  4. [12]

    P icard groups of compact toric varieties and combinatorial classes of fans

    Markus Eikelberg. P icard groups of compact toric varieties and combinatorial classes of fans. Results in Mathematics , 23:251--293, 1993

    1993

  5. [13]

    Combinatorial Convexity and Algebraic Geometry

    Günter Ewald. Combinatorial Convexity and Algebraic Geometry . Graduate Texts in Mathematics. Springer New York, 2012

    2012

  6. [14]

    The generalized M ukai conjecture for toric log F ano pairs

    Kento Fujita. The generalized M ukai conjecture for toric log F ano pairs. European Journal of Mathematics , (5):858--871, 2019

    2019

  7. [15]

    Grayson and Michael E

    Daniel R. Grayson and Michael E. Stillman. Macaulay2, a software system for research in algebraic geometry. Available at http://www2.macaulay2.com

  8. [16]

    Graded ring database

    Alexander Mieczyslaw Kasprzyk. Graded ring database. Available at https://grdb.co.uk

  9. [17]

    Canonical toric F ano threefolds

    Alexander Mieczyslaw Kasprzyk. Canonical toric F ano threefolds. Canadian Journal of Mathematics , 62(6):1293--1309, 2010

    2010

  10. [18]

    On the classification of reflexive polyhedra

    Maximilian Kreuzer and Harald Skarke. On the classification of reflexive polyhedra. Communications in Mathematical Physics , 185(2):495--508, May 1997

    1997

  11. [19]

    Classification of reflexive polyhedra in three-dimensions

    Maximilian Kreuzer and Harald Skarke. Classification of reflexive polyhedra in three-dimensions. Adv. Theor. Math. Phys. , (2):853--871, 1998

    1998

  12. [20]

    Complete classification of reflexive polyhedra in four dimensions

    Maximilian Kreuzer and Harald Skarke. Complete classification of reflexive polyhedra in four dimensions. Adv. Theor. Math. Phys. , (4):1209--1231, 2000

    2000

  13. [21]

    Reflexive polyhedra, weights and toric C alabi-yau fibrations

    Maximilian Kreuzer and Harald Skarke. Reflexive polyhedra, weights and toric C alabi-yau fibrations. Reviews in Mathematical Physics , 14(04):343--374, 2002

    2002

  14. [22]

    PALP : A package for analysing lattice polytopes with applications to toric geometry

    Maximilian Kreuzer and Harald Skarke. PALP : A package for analysing lattice polytopes with applications to toric geometry. Computer Physics Communications , 157(1):87--106, 2004

    2004

  15. [23]

    Gorenstein toric F ano varieties

    Benjamin Nill. Gorenstein toric F ano varieties . PhD thesis, Universit\" a t T\" u bingen, 2005

    2005

  16. [24]

    Gorenstein toric F ano varieties

    Benjamin Nill. Gorenstein toric F ano varieties. Manuscripta mathematica , 116(2):183--210, Feb 2005

    2005

  17. [25]

    Toward the classification of higher-dimensional toric F ano varieties

    Hiroshi Sato. Toward the classification of higher-dimensional toric F ano varieties . Tohoku Mathematical Journal , 52(3):383 -- 413, 2000

    2000

  18. [26]

    Gregory G. Smith. NormalToricVarieties: routines for working with normal toric varieties and related objects. Version 1.9 . A Macaulay2 package available at https://github.com/Macaulay2/M2/tree/master/M2/Macaulay2/packages

  19. [27]

    S ageMath, the S age M athematics S oftware S ystem ( V ersion 10.6) , 2025

    The Sage Developers . S ageMath, the S age M athematics S oftware S ystem ( V ersion 10.6) , 2025. https://www.sagemath.org

    2025

  20. [28]

    Voskresenskiĭ and Alexander A

    Valentin E. Voskresenskiĭ and Alexander A. Klyachko. Toroidal F ano varieties and root systems. Mathematics of the USSR-Izvestiya , 24(2):221, apr 1985

    1985

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.