Pith. sign in

REVIEW 2 major objections 4 minor 33 references

The many faces of a logarithmic scheme

T0 review · 2 major / 4 minor · reviewed 2026-08-11 · deepseek-v4-flash

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

Pith's one-line read This paper proves that every coherent logarithmic scheme decomposes canonically into fine logarithmic subschemes, its fine faces, which jointly cover the scheme.

desk verdict A new and useful decomposition of coherent log schemes into fine pieces, with real algorithmic content, but the main construction has an unproved canonicality claim and the Buchberger algorithm's notation is internally inconsistent. read the letter →

arxiv 2412.12078 v1 pith:AGPTFKPW submitted 2024-12-16 math.AG

Thibault Poiret , Dhruv Ranganathan This is my paper · ORCID
classification math.AG MSC 14A2114M2514N3513P10
keywords coherentlogarithmicschemesfinefacesstructuresintegralizationmonoidalGröbnerbasesbinomialtropicalgeometrytoricfiberproducts
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

Logarithmic structures track monomial functions on a scheme, and the most useful such structures are the fine ones. But fineness is not preserved by fiber products and other limits, so many natural schemes only carry a coherent logarithmic structure. This paper shows that every coherent logarithmic scheme is covered by a finite collection of fine logarithmic subschemes, called its fine faces, each mapping into the original scheme by a closed immersion and with the integralization appearing as one of the faces. If true, this lets tropical geometry, normally confined to fine and saturated log schemes, be applied to the broader coherent setting by working face by face. The paper also conjectures that Alexeev's compactified moduli space of polarized abelian varieties carries such a coherent structure, with maximal fine faces matching the components of its normalization.

What carries the argument

The central object is the fine face of a coherent logarithmic scheme, defined through faces of the charting monoid: for a chart X → Spec ℤ[Q], a face R of Q (a submonoid closed under taking summands) gives a closed subscheme Spec ℤ[R] ↪ Spec ℤ[Q], which pulls back to X. The key identity is Lemma 3.7: a prime ideal in a pointed monoid has complement a face, and Spec(ℤ[P]/(p)) = Spec ℤ[R], so prime ideals of the charting monoid cut out exactly the log schemes charted by finer monoids. The algorithms of Section 5 use monoidal Gröbner bases and rewriting rules to compute prime ideals, integralizations via localization, and saturations via lattice-point enumeration in cones, making the face decomposition effective from a monoid presentation.

What would settle it

Take a coherent logarithmic scheme with two different global charts and compare the collections of connected components obtained by pulling back Spec(ℤ[Q]/(p)) for all prime ideals p; if the two collections of integralized closed subschemes differ for some scheme, the canonicality asserted in Theorem A is false.

Watch

Extended reading notes

Core claim

The central claim is Theorem A: for every coherent logarithmic scheme X, there is a canonically defined collection of fine logarithmic schemes F, the fine faces, whose underlying schemes admit jointly surjective closed immersions F ↪ X, and one of these faces is the integralization of X. The construction is chart-based: a chart X → Spec ℤ[Q] by a finitely generated monoid Q gives, for each prime ideal p of Q, a closed subscheme Spec(ℤ[Q]/(p)) which by Lemma 3.7 equals Spec ℤ[R] where R is the complementary face of Q; pulling this back to X, taking connected components, and integralizing produces the fine faces. The collection is asserted to be independent of the chosen chart and to descend étale-locally. The paper also proves Theorem B, that these faces can be computed by monoidal Buchberger-style algorithms from presentations of the charting monoids, and Theorem C, that the extended cone complex of an fs face of a fiber product of fs log schemes is a face of the fiber product of the extended cone complexes, so the faces are visible tropically.

Load-bearing premise

The load-bearing premise is that the collection of fine faces is independent of the chosen chart and descends uniquely to a sheaf; if two different charts produced different connected components, Theorem A would fail.

Editorial extensions

If this is right

  • Tropical geometry, normally restricted to fine and saturated log schemes, becomes applicable to arbitrary coherent log schemes by working on each fine face.
  • For scheme-theoretic fiber products of toric varieties, the fine faces are exactly the normalizations of the irreducible components, which are toric, so the combinatorial description via extended tropicalization computes the full fiber product.
  • In logarithmic Gromov–Witten theory, non-fine points of the non-fs fiber product correspond to genuinely new maps, such as the example with constraint λ = μ, explaining why naive generalizations of degeneration formulas fail and how the fine faces capture the missing complexity.
  • The monoidal Gröbner basis algorithms of Section 5 compute fine faces and their integralizations from explicit charting monoids, making the decomposition effective in moduli contexts where tropical geometry supplies the charts.

Reading between the lines

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

  • If the chart-independence of the fine faces is made fully rigorous, every coherent log scheme would carry a canonical stratification by fine log schemes, potentially allowing moduli stacks of coherent log schemes to be studied by gluing fine charts.
  • The paper's analogy between coherent log schemes and binomial schemes suggests that enumerative invariants of non-fine targets could be computed by summing contributions from fine faces, provided virtual classes behave well under the closed immersions.
  • The saturation algorithm's exponential worst-case behavior, noted as analogous to the shortest vector problem, hints that computing fine faces is intrinsically hard in general, so structural or tropical shortcuts may be necessary for practical large-scale examples.
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

2 major / 4 minor

Summary. The paper introduces a decomposition of a coherent logarithmic scheme X into a canonical collection of fine logarithmic subschemes, called fine faces, which are defined locally via prime ideals of charting monoids and then integralized. Theorem A asserts that the underlying schemes of these fine faces admit jointly surjective closed immersions into X. The construction is motivated by scheme-theoretic fiber products of toric varieties, where the fine faces recover the normalized components of the fiber product, and by logarithmic Gromov–Witten theory, where non-fine fiber products arise naturally. Section 5 provides algorithms, based on monoidal Gröbner bases and saturation, to compute the faces and their integralizations (Theorem B), and a formal statement about extended cone complexes of fs faces (Theorem C).

Significance. If the construction is made fully rigorous, the paper gives a useful new tool: a way to decompose arbitrary coherent log schemes into fine pieces, thereby allowing tropical and toric techniques to be imported into settings that are only coherent. The algorithms in Section 5 are concrete and potentially valuable for computations in logarithmic enumerative geometry. The main structural proof of Proposition 3.16 is clear assuming the face construction is well-defined, and the examples (toric fiber products, Chow quotients, double ramification cycles) illustrate genuine applications. The paper's central claims are not derived from the authors' prior work and the overall strategy is original.

major comments (2)
  1. [§3.2, Construction 3.11] The definition of the set of faces rests on two unproved assertions: (i) that the connected components of the subschemes Z_p 'do not depend on the choice of chart'; and (ii) that the étale presheaf F^pre_T on a strict étale cover T→X 'extends uniquely to a sheaf' F^pre_X on X_ét. These assertions are load-bearing for Theorem A, for Definition 3.15, and for Proposition 3.16, which assumes both chart-independence and descent when reducing to a global chart. The example of a log point with characteristic N charted by Q=N or by Q=N^2 shows that different charts can yield different prime ideals and different individual closed subschemes, so the claimed invariance is not formal. The paper should provide a proof of chart independence (for example, by comparing two charts via a common refined chart and showing that the resulting collections of connected components, with their induced log structures, are canonically identified) and a proof of étale descent for F^pre. Without these, the phrase 'the set of fine faces' is not well-defined and Theorem A is conditional.
  2. [§1 (Notation) and §5.3, Algorithm 5.14] There is an internal notation inconsistency that affects the correctness of the main algorithm. The conventions state: 'we denote by a∨b the coordinatewise-minimum (min(a_i,b_i))_{i∈I} and by a∧b the coordinatewise-maximum.' However, Algorithm 5.14 defines the S-relation as (b_i + a_i∨a_j - a_i, b_j + a_i∨a_j - a_j) and the proof of that algorithm uses a_i∨a_j as the coordinatewise maximum (the least common multiple of the initial terms). With ∨ defined as coordinatewise minimum, the expression a_i∨a_j - a_i can have negative coordinates, so the relation is not a monoidal relation in F×F and the algorithm as literally written is not well-defined. The proof of Theorem B depends on this algorithm. The notation should be fixed (for instance, by defining ∨ as coordinatewise maximum and ∧ as coordinatewise minimum, or by writing max(a_i,a_j) explicitly throughout Section 5).
minor comments (4)
  1. [§3.1, Definition 3.5] The 'Observe' following Definition 3.5 asserts that for F = P\I ∪ {∞} the natural map F → P/I is an isomorphism, but this is false for general ideals I that do not contain ∞. For example, P = N∪{∞} and I = {1,2,...} gives F = {0,∞}, while P/I has an additional absorbing element. The statement is true when I is replaced by I∪{∞} for a prime ideal I, which is the case used in Lemma 3.7; the general claim should be removed or corrected.
  2. [§4, Theorem C] Theorem C is stated as a 'formal consequence' of the construction but no proof is supplied. Since it is announced as a theorem, the authors should either provide a proof or explicitly demote it to a conjecture or a remark with a justification sketch.
  3. [§5.6, Step (2)] The 'semi-open hypercube ∏_{1≤j≤n}[0,1[v_j' is not a hypercube unless the v_j form an orthogonal basis; it is a fundamental parallelepiped. The terminology should be adjusted for clarity.
  4. [Throughout] There are numerous typographical errors, e.g., 'particulary' and 'particicularly' (p. 2), 'poarlized' (p. 3), 'varities' (p. 3), 'T echniques' (p. 1), and several missing/extra spaces in the bibliography. A careful proofreading pass is needed.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the fine-face construction and Theorems A–C are derived from standard monoid/log-geometry lemmas, with self-citations playing only motivational or illustrative roles.

full rationale

The central construction (Construction 3.11) defines faces using prime ideals and faces of charting monoids, then uses Lemma 3.7 and Noetherianity to obtain closed subschemes with fine log structures; Proposition 3.16 proves joint surjectivity by taking the smallest face containing a point. These arguments do not call upon the theorem being proved. The clause 'One of the fine faces is the integralization of X' is a direct consequence of Definition 3.15 together with the face associated to the empty prime ideal, but this is a harmless explicit consequence rather than a hidden assumption of the conclusion. Theorem B is an algorithmic statement: its correctness is proved via the monoidal Buchberger procedure (Lemma 5.10, Proposition 5.13, Algorithm 5.14), not by assuming the existence of fine faces. Theorem C is explicitly described as a formal consequence of extended cone complexes and is not used to prove Theorem A. Self-citations such as [BNR24], [NR22], [MR24], and [Ran22] appear in motivation, examples, and contextual remarks; Example 4.17 is 'based on one from [NR22]', but it is illustrative rather than load-bearing for any of Theorems A, B, or C. The main proof gap is in Construction 3.11, where the connected components are asserted 'not [to] depend on the choice of chart' and the presheaf F^pre_T is asserted to 'extend uniquely to a sheaf F^pre_X'; no detailed proof is given. This is a genuine correctness risk: if those assertions were false, the set of fine faces would not be well-defined. However, this is an internal gap, not circularity: the construction does not define fine faces in terms of the theorem's conclusion, and no load-bearing self-citation or imported uniqueness theorem forces the result. No fitted parameter is renamed as a prediction. Accordingly, the paper is self-contained relative to standard logarithmic geometry and binomial-scheme techniques, and I find no significant circularity.

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

The paper introduces no numerical free parameters and no speculative entities; it relies on standard theorems from logarithmic geometry, binomial ideals, and lattice reduction. The main burden is the chart-independence of the face construction, which is asserted rather than proven in detail.

assumptions (4)
  • standard math Local existence of charts for log schemes and log morphisms: stalks of characteristic sheaves chart étale neighborhoods.
    Used in Lemma 2.12 and Construction 3.11 to reduce to global charts; standard consequence of Kato's theory [Kat89].
  • standard math Noetherianity of monoid ideals in N^n, used to prove termination of the monoidal Buchberger algorithm.
    Lemma 5.11 proves it via Noetherianity of Z[x_1,...,x_n]; relies on the Hilbert basis theorem.
  • standard math Term-elimination properties of binomial ideals from [ES96], such as Corollary 1.7 used in Proposition 5.20.
    Cited theorem used to relate localization and integralization of monoids.
  • standard math Correctness of LLL lattice reduction for finding all lattice points in a semi-open hypercube (Section 5.6).
    Used in the saturation algorithm; the paper cites [LLL82] but gives no proof that the probing procedure enumerates Λ_0.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The many faces of a logarithmic scheme." pith.science (2026). https://pith.science/paper/AGPTFKPW

@misc{pith2026241212078,
  author       = {Pith},
  title        = {Pith review of: The many faces of a logarithmic scheme},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AGPTFKPW}},
  note         = {Machine review of arXiv:2412.12078}
}
abstract

A standard assumption in the study of logarithmic structures is "fineness", but this assumption is not preserved by intersections, fiber products, and more general limits. We explain how a coherent logarithmic scheme $X$ has a natural decomposition into "fine faces" -- a collection of fine logarithmic subschemes. This allows for importation of the techniques of tropical geometry into the study of more general logarithmic schemes. We explain the relevance of the construction in enumerative geometry and moduli via a range of examples. Techniques developed in the study of binomial schemes lead to effective algorithms for computing the fine faces.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

33 extracted references · 26 canonical work pages

  1. [1]

    Stable logarithmic maps to D eligne- F altings pairs II

    Dan Abramovich and Qile Chen. Stable logarithmic maps to D eligne- F altings pairs II . Asian J. Math. , 18(3):465--488, 2014

    2014

  2. [2]

    Punctured logarithmic maps

    Dan Abramovich, Qile Chen, Mark Gross, and Bernd Siebert. Punctured logarithmic maps. arXiv:2009.07720 , 2020

    arXiv 2009

  3. [3]

    The tropicalization of the moduli space of curves

    Dan Abramovich, Lucia Caporaso, and Sam Payne. The tropicalization of the moduli space of curves. Ann. Sci. \'Ec. Norm. Sup\'er. (4) , 48(4):765--809, 2015

    work page 2015

  4. [4]

    Complete moduli in the presence of semiabelian group action

    Valery Alexeev. Complete moduli in the presence of semiabelian group action. Ann. of Math. (2) , 155(3):611--708, 2002

    work page 2002

  5. [5]

    The complexity of the shortest vector problem

    Huck Bennett. The complexity of the shortest vector problem. SIGACT News , 54(1):37--61, mar 2023

    work page 2023

  6. [6]

    Gromov-Witten theory via roots and logarithms

    Luca Battistella, Navid Nabijou, and Dhruv Ranganathan. Gromov-Witten theory via roots and logarithms . Geom. Top. , 28:3309--3355, 2024

    work page 2024

  7. [7]

    A moduli stack of tropical curves

    Renzo Cavalieri, Melody Chan, Martin Ulirsch, and Jonathan Wise. A moduli stack of tropical curves. Forum Math. Sigma , 8:e23, 2020

    work page 2020

  8. [8]

    Stable logarithmic maps to D eligne- F altings pairs I

    Qile Chen. Stable logarithmic maps to D eligne- F altings pairs I . Ann. of Math. (2) , 180(2):455--521, 2014

    work page 2014

Show all 33 references
  1. [9]

    Binomial ideals

    David Eisenbud and Bernd Sturmfels. Binomial ideals . Duke Mathematical Journal , 84(1):1 -- 45, 1996

    1996

  2. [10]

    Commutative Semigroup Rings

    Robert Gilmer. Commutative Semigroup Rings . Chicago Lectures in Mathematics, Univ. Chicago Press, 1984

    1984

  3. [11]

    Analytische Stellenalgebren

    Hans Grauert and Reinhold Remmert. Analytische Stellenalgebren. Grundl. 176. Springer Verlag, 1971

    1971

  4. [12]

    Coherent Analytic Sheaves

    Hans Grauert and Reinhold Remmert. Coherent Analytic Sheaves. Grundl. 265. Springer Verlag, 1984

    1984

  5. [13]

    Logarithmic G romov- W itten invariants

    Mark Gross and Bernd Siebert. Logarithmic G romov- W itten invariants. J. Amer. Math. Soc. , 26(2):451--510, 2013

    2013

  6. [14]

    Compactification of the moduli space of hyperplane arrangements

    Paul Hacking, Sean Keel, and Jenia Tevelev. Compactification of the moduli space of hyperplane arrangements. J. Algebraic Geom. , 15(4):657--680, 2006

    2006

  7. [15]

    Clutching and gluing in tropical and logarithmic geometry

    Alana Huszar, Steffen Marcus, and Martin Ulirsch. Clutching and gluing in tropical and logarithmic geometry. J. Pure Appl. Algebra , 223(5):2036--2061, 2019

    2019

  8. [16]

    Extending the double ramification cycle by resolving the A bel- J acobi map

    David Holmes. Extending the double ramification cycle by resolving the A bel- J acobi map. J. Inst. Math. Jussieu , 20(1):331--359, 2021

    2021

  9. [17]

    An algorithm for computing the integral closure

    Theo De Jong. An algorithm for computing the integral closure. J. Symb. Comput. , 26(3):273--277, 1998

    1998

  10. [18]

    Logarithmic structures of F ontaine- I llusie

    Kazuya Kato. Logarithmic structures of F ontaine- I llusie. In Algebraic analysis, geometry, and number theory ( B altimore, MD , 1988) , pages 191--224. Johns Hopkins Univ. Press, Baltimore, MD, 1989

    1988

  11. [19]

    Quotients of toric varieties

    Mikhail M Kapranov, Bernd Sturmfels, and Andrei V Zelevinsky. Quotients of toric varieties. Math. Ann. , 290:643--655, 1991

    1991

  12. [20]

    A degeneration formula of GW -invariants

    Jun Li. A degeneration formula of GW -invariants. J. Differential Geom. , 60(2):199--293, 2002

    2002

  13. [21]

    Factoring polynomials with rational coefficients

    Arjen K Lenstra, Hendrik Willem Lenstra, and L \'a szl \'o Lov \'a sz. Factoring polynomials with rational coefficients. Mathematische annalen , 261:515--534, 1982

    1982

  14. [22]

    Universal stacky semistable reduction

    Sam Molcho. Universal stacky semistable reduction. Israel J. Math. , 242(1):55--82, 2021

    2021

  15. [23]

    A topological view of G romov- W itten theory

    Davesh Maulik and Rahul Pandharipande. A topological view of G romov- W itten theory. Topology , 45(5):887--918, 2006

    2006

  16. [24]

    Logarithmic enumerative geometry for curves and sheaves

    Davesh Maulik and Dhruv Ranganathan. Logarithmic enumerative geometry for curves and sheaves. arXiv:2311.14150 , 2023

    2023 arXiv

  17. [25]

    A case study of intersections on blowups of the moduli of curves

    Samouil Molcho and Dhruv Ranganathan. A case study of intersections on blowups of the moduli of curves. Algebra Number Theory , 18(10):1767--1816, 2024

    2024

  18. [26]

    Logarithmic compactification of the A bel- J acobi section

    Steffen Marcus and Jonathan Wise. Logarithmic compactification of the A bel- J acobi section. Proc. Lond. Math. Soc. (3) , 121(5):1207--1250, 2020

    2020

  19. [27]

    The logarithmic picard group and its tropicalization

    Samouil Molcho and Jonathan Wise. The logarithmic picard group and its tropicalization. Compositio Mathematica , 158(7):1477--1562, 2022

    2022

  20. [28]

    Gromov- W itten theory with maximal contacts

    Navid Nabijou and Dhruv Ranganathan. Gromov- W itten theory with maximal contacts. Forum Math. Sigma , 10:Paper No. e5, 34, 2022

    2022

  21. [29]

    Lectures on logarithmic algebraic geometry

    Arthur Ogus. Lectures on logarithmic algebraic geometry . Cambridge University Press, 2018

    2018

  22. [30]

    Martin C. Olsson. Compactifying moduli spaces for abelian varieties , volume 1958 of Lecture Notes in Mathematics . Springer-Verlag, Berlin, 2008

    1958

  23. [31]

    Analytification is the limit of all tropicalizations

    Sam Payne. Analytification is the limit of all tropicalizations. Math. Res. Lett. 16 , 3:543--556, 2009

    2009

  24. [32]

    Logarithmic G romov- W itten theory with expansions

    Dhruv Ranganathan. Logarithmic G romov- W itten theory with expansions. Algebr. Geom. , 9(6):714--761, 2022

    2022

  25. [33]

    Another NP -complete partition problem and the complexity of computing short vectors in a lattice

    Peter van Emde-Boas. Another NP -complete partition problem and the complexity of computing short vectors in a lattice . Report. Department of Mathematics. University of Amsterdam. Department, Univ., 1981

    1981

Pith tools

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