Pith. sign in

REVIEW 2 major objections 3 minor 2 cited by

Arrangements and Likelihood

T0 review · 2 major / 3 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read For every hypersurface arrangement, the likelihood ideal equals the Rees ideal of a module of logarithmic derivations.

desk verdict A good idea with a false main theorem: the likelihood ideal is not always prime, so Theorem 1.1 needs a corrected hypothesis. read the letter →

arxiv 2411.09508 v2 pith:PLTYRXNG submitted 2024-11-14 math.AC math.COmath.STstat.TH

Thomas Kahle , Lukas Kühne , Leonie Mühlherr , Bernd Sturmfels , Maximilian Wiesmann This is my paper · ORCID
classification math.ACmath.COmath.STstat.TH MSC 13A3013N1552C3562R01
keywords likelihoodcorrespondenceReesalgebralogarithmicderivationsmodulegentlearrangementsgraphicmaximumdegreescatteringequations
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

This paper builds a bridge from the classical theory of hypersurface arrangements to likelihood geometry. Its central claim is that for any arrangement $\mathcal{A}$ of hypersurfaces in $\mathbb{P}^{n-1}$, the ideal $I(\mathcal{A})$ of the likelihood correspondence is the Rees ideal of a module $M(\mathcal{A})$ built from logarithmic derivations; equivalently, $R[s]/I(\mathcal{A})$ is the Rees algebra of $M(\mathcal{A})$. If that is right, the usually troublesome step of clearing denominators in the likelihood equations is handled automatically by the module of derivations, and the maximum likelihood degree can be read off from the multidegree of the correspondence. The paper introduces gentle arrangements, for which the likelihood ideal is simply the pre-likelihood ideal generated by evaluating derivations on the log-likelihood; tame linear arrangements are gentle, while the octahedron gives the smallest non-gentle graphic arrangement. The identification is used to compute likelihood degrees in parametric statistical models, toric models, and scattering equations.

What carries the argument

Central machinery is the matrix $Q = [\operatorname{diag}(f_i), \operatorname{Jac}(F)]$ of size $m \times (m+n)$ together with the graded modules it defines: the Jacobian syzygy module $S(\mathcal{A})$, the log-derivation module $D_{\log}(\mathcal{A})$, and the likelihood module $M(\mathcal{A}) = \operatorname{coker}(A)$. The Rees algebra of a module, the quotient of its symmetric algebra by its $R$-torsion, is the object that records the polynomial relations among the module's generators after localization. The paper proves that this Rees algebra is the coordinate ring of the likelihood correspondence, so the ideal of the correspondence is the saturation $I(\mathcal{A}) = (I_0(\mathcal{A}) : p^\infty)$ of the pre-likelihood ideal. Gentleness of $\mathcal{A}$ means the symmetric algebra is already torsion-free, making the saturation step unnecessary.

What would settle it

Take the octahedron arrangement of Example 5.1 and compute the saturation $I_0(\mathcal{A}) : (x_1-x_2)^\infty$ and, from the same matrix $A$, the kernel of the map $R[s] \to \mathcal{R}(M(\mathcal{A}))$. The theorem predicts both equal the prime likelihood ideal with the extra degree-$(3,3)$ generator reported in the paper; any difference between the two ideals, in generators or in multidegree, would falsify Theorem 1.1.

Watch

Extended reading notes

Core claim

The paper's central discovery is Theorem 1.1: for any arrangement $\mathcal{A}$ of hypersurfaces, the quotient $R[s]/I(\mathcal{A})$ is the Rees algebra of the likelihood module $M(\mathcal{A})$, and therefore the likelihood ideal $I(\mathcal{A})$ equals the Rees ideal of $M(\mathcal{A})$. The likelihood module is $\operatorname{coker}(A)$, where the columns of $\binom{A}{B}$ generate the kernel of the matrix $Q$ whose rows are $(f_i, \partial f_i/\partial x_1,\dots,\partial f_i/\partial x_n)$; its first syzygy module is the module of logarithmic derivations $D_{\log}(\mathcal{A})$. The pre-likelihood ideal $I_0(\mathcal{A}) = \langle (s_1,\dots,s_m) A \rangle$ presents the symmetric algebra of $M(\mathcal{A})$, and the likelihood ideal is its saturation at an element $p$ for which $M(\mathcal{A})[p^{-1}]$ is free. An arrangement is gentle when no saturation is needed, that is, when $I_0(\mathcal{A})$ is already prime and hence equal to $I(\mathcal{A})$; in that case the likelihood ideal is generated by the evaluations of logarithmic derivations on the log-likelihood, as stated in Theorem 2.11. In the hyperplane case tame arrangements are gentle, and the octahedron arrangement is the unique smallest non-gentle graphic arrangement.

Load-bearing premise

The argument requires the likelihood ideal to have a single irreducible component, and the supplied proof of that fact cites the Rees algebra being a domain, which is the content of Theorem 1.1 itself; without an independent primeness proof the saturation step is unsupported.

Editorial extensions

If this is right

  • For gentle arrangements, the likelihood ideal is generated by the evaluations $\theta(\ell_\mathcal{A})$ of logarithmic derivations, so the maximum likelihood degree is computable from the pre-likelihood ideal without saturation; for free gentle arrangements it equals the product of the positive column degrees of $A$.
  • Every tame linear arrangement is gentle, so for hyperplane arrangements gentleness is common; in particular all line arrangements in $\mathbb{P}^2$ are gentle.
  • The octahedron is the unique smallest non-gentle graphic arrangement, and any graph containing the octahedron as an induced subgraph is not gentle; the paper conjectures a contraction-based characterization of gentle graphic arrangements.
  • The identification converts several concrete models into arrangements with explicit likelihood ideals: the two-coin model has ML degree 24, the binary independence model has ML degree 1, the no-three-way interaction model has ML degree 3, and the braid arrangement attached to $M_{0,n}$ has ML degree $(n-3)!$.

Reading between the lines

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

  • Editorial inference: the saturation step that separates $I_0(\mathcal{A})$ from $I(\mathcal{A})$ can be read as deleting spurious critical points supported on the singular locus of the parametrization; a testable prediction is that saturating only at the Jacobian ideal of $F$ already produces $I(\mathcal{A})$ whenever the parametrization is generically finite.
  • Editorial inference: because gentleness depends on the chosen presentation of $M(\mathcal{A})$, the same statistical model can be gentle in one parametrization and non-gentle in another, as with the independence model in Examples 3.5 and 3.6; this suggests asking whether every model admits a gentle parametrization and whether a minimal gentle degree over parametrizations is a computable invariant.
  • Editorial inference: Theorem 1.1 implies non-gentleness is exactly the $R$-torsion of $\operatorname{Sym}(M(\mathcal{A}))$; if so, depth tests on the Fitting ideals of $M(\mathcal{A})$ can certify gentleness before any saturation is attempted, which would make a search for non-gentle arrangements beyond the octahedron feasible for much larger graphs.
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 / 3 minor

Summary. The paper proposes a new algebraic framework for the likelihood correspondence of an arrangement of hypersurfaces. It defines a likelihood module M(A) via the kernel of a matrix containing the polynomials and their partial derivatives, constructs the pre-likelihood ideal I0(A) and the Rees ideal of M(A), and claims (Theorem 1.1) that the Rees ideal equals the likelihood ideal I(A) of the likelihood correspondence. The notion of a 'gentle' arrangement is introduced to describe when I0(A) = I(A). The paper also studies the relationship between gentleness, freeness, and tameness, gives a combinatorial description for graphic arrangements, and provides Macaulay2 code. However, the central theorem is false as stated, and the proof of a key proposition is circular.

Significance. If correct, the main theorem would give a powerful and computable description of likelihood correspondences via modules of logarithmic derivations, and would unify hyperplane and nonlinear arrangements. The paper contains several concrete and reproducible computations, a new concept (gentleness) with intriguing conjectures, and interesting connections to scattering equations and toric models. Nevertheless, the central claim fails for a simple explicit arrangement, so the foundational results as stated cannot be accepted. The computational and combinatorial parts may still be valuable, but the main theorem and its proof require substantial revision.

major comments (2)
  1. [§2, Lemma 2.4 and Theorem 1.1] The assertion that I(A) is prime is false. Consider the arrangement in P^2 given by f1 = x^2+2y^2, f2 = 2x^2+y^2, f3 = x^2+3y^2, f4 = z. For x ≠ 0 the critical equations have the unique solution s = [5f1 : -f2 : -3f3 : 0]. The Zariski closure of this graph intersects the hyperplane {x=0} in a 1-dimensional set, namely ({x=0} × [10:-1:-9:0]) ∪ ({[0:0:1]} × L), where L = {s1+s2+s3=0, s4=0}. On the other hand, every point of E = {x=0} × L satisfies the defining conditions of L_A: for y,z ≠ 0 one has ∂ℓ/∂x = 0 identically, ∂ℓ/∂y = 2(s1+s2+s3)/y = 0, ∂ℓ/∂z = s4/z = 0, all f_i are nonzero, and F(x) is a smooth point of the image (a linear space). Since E has dimension 2 and the generic component meets {x=0} in a 1-dimensional set, E is an additional irreducible component of L_A. Hence L_A is reducible and I(A) is not prime. As the Rees algebra of M(A) is a domain, R[s]/I(A) cannot equal the Rees algebra, contradicting Theorem 1.1. The flaw in Lemma 2.4 is that F(x) ∈ X_reg does not imply that the Jacobian dF has maximal rank; here the rank drops on {x=0} while F(x) is still smooth.
  2. [§2, Proposition 2.9] The proof of Proposition 2.9 is circular. It states: 'The likelihood ideal I(A) is always prime, since the Rees algebra is a domain whenever R is.' The Rees algebra being a domain implies that the Rees ideal I' (the kernel in (3)) is prime; the equality I(A) = I' is precisely the content of Theorem 1.1, which is what Proposition 2.9 is being used to prove. Moreover, the saturation formula I(A) = (I0(A) : p^∞) fails in the counterexample of the previous comment: the maximal minors of the Jacobian are multiples of xy, so the element p from Remark 2.10 contains x, and saturating at p removes the genuine component {x=0} × L of L_A. Thus Proposition 2.9 is false as stated.
minor comments (3)
  1. [Example 3.5] The notation s_+ is used in the displayed decomposition of the pre-likelihood ideal but is never defined; it should be introduced as s_+ = s1+s2+s3+s4.
  2. [Example 5.1] The text 'Computing P = I0 : f reveals the second minimal prime' refers to an additional generator f of degree (3,3) with 3092 terms, but f is not explicitly defined at that point; please state its construction or refer clearly to the earlier computation.
  3. [Proof of Lemma 2.2] In item 3, the phrase 'the homological degree is shifted by one' is not fully explained; a sentence clarifying that the same matrix A serves as the first map in the resolution of coker(A) and as the presentation of im(A) would improve readability.

Circularity Check

1 steps flagged · score 4.0 of 10

Local circularity in Proposition 2.9: primality of the likelihood ideal is inferred from the Rees-algebra domain property, which is exactly the identification Theorem 1.1 is meant to establish; the alternative geometric proof in Lemma 2.4 is asserted rather than proved.

  1. other [Section 2, Proposition 2.9 (proof); relied on in Proof of Theorem 1.1]
    "The likelihood ideal I(A) is always prime, since the Rees algebra is a domain whenever R is. Thus, if I0(A) is not prime, then it is not the likelihood ideal and the arrangement A is not gentle."

    At this point Theorem 1.1 has not yet been proved, and the equality of I(A) with the Rees ideal of M(A) is precisely the statement of Theorem 1.1. The domainness of the Rees algebra is an independent module-theoretic fact, but it implies primality of the likelihood ideal only after that identification is made. The proof of Theorem 1.1 then invokes Proposition 2.9 and begins 'Let I be the prime likelihood ideal', so the logical chain would be circular unless Lemma 2.4 supplies an independent proof of primality. Lemma 2.4, however, asserts without proof that the maximal-rank locus makes LA a vector bundle and that the closure is unchanged by replacing F(x) in Xreg with maximal Jacobian rank (Remark 2.10), so the circularity is not repaired by a fully established independent argument.

full rationale

The paper is largely self-contained and does not fit parameters to a target result. Likelihood ideals are computed for concrete arrangements and checked against independent ML-degree benchmarks (coin model ML degree 24 versus implicit 12 with factor two; toric ML degrees 25 and 3), so there is no fitted-input-called-prediction pattern. The Rees-algebra and module constructions are developed independently of the likelihood correspondence, and Theorem 2.11's evaluation map is a genuine structural statement rather than a renaming. The one real circular step is in Proposition 2.9: the proof derives primality of I(A) from domainness of the Rees algebra of M(A), but identifying I(A) with that Rees algebra is exactly Theorem 1.1. The proof of Theorem 1.1 uses Proposition 2.9 and assumes I prime, so without Lemma 2.4 the chain is circular. Lemma 2.4 offers a non-circular geometric route, but it is asserted rather than proved: maximal rank on a dense open set does not by itself control the rank on the boundary of the likelihood locus, and the replacement of F(x) in Xreg by Jacobian maximal rank in Remark 2.10 is not justified in the text. This is a local proof-structure flaw, not a reduction of the central claim to its input. The self-citation [25] for separator-based derivations in Theorem 5.8 supports computations in Section 5 but is not load-bearing for Theorem 1.1, so it does not raise the score further.

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

The central claim rests on standard commutative algebra and cited arrangement theory; there are no fitted parameters, no ad hoc constants, and no new entities. The main unproven inputs are external theorems (Saito, Huh, Stanley-Edelman-Reiner) and the paper's own Macaulay2 computations.

assumptions (6)
  • standard math The Rees algebra R(M) of a finitely generated module M over a domain R is a domain, and the Rees algebra construction commutes with localization.
    Used in Definition 2.5 and Proposition 2.9 to identify the likelihood ideal with the Rees ideal via saturation.
  • standard math Generic freeness: for a finitely generated module M over a polynomial ring R, there exists nonzero p in R such that M[p^{-1}] is a free R[p^{-1}]-module.
    Used in Proposition 2.9 and Remark 2.10 to guarantee the saturation computation I(A) = I0 : p^infinity.
  • domain assumption For hyperplane arrangements, localization at X satisfies D(A)_P = D(A_X)_P, cited to Orlik-Terao Example 4.123.
    Used in the proof of Proposition 5.4 to show gentleness is preserved under localization; not machine-checked.
  • standard math Saito's theorem: the derivations theta_k = sum x_i^k d/dx_i form a basis of D(A(K_n)).
    Used in Example 5.7 and Theorem 5.8 for graphic arrangements; cited to [27].
  • standard math Stanley-Edelman-Reiner: a graphic arrangement A(G) is free iff G is chordal.
    Background for Section 5, cited to [1].
  • standard math Huh's theorem: the ML degree of a very affine variety equals the signed Euler characteristic.
    Used in the toric model discussion in Section 3 to connect ML degrees; cited to [19].

how reviews work

0 comments
Cite this review

Pith. "Pith review of Arrangements and Likelihood." pith.science (2026). https://pith.science/paper/PLTYRXNG

@misc{pith2026241109508,
  author       = {Pith},
  title        = {Pith review of: Arrangements and Likelihood},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PLTYRXNG}},
  note         = {Machine review of arXiv:2411.09508}
}
read the original abstract

We develop novel tools for computing the likelihood correspondence of an arrangement of hypersurfaces in a projective space. This uses the module of logarithmic derivations. This object is well-studied in the linear case, when the hypersurfaces are hyperplanes. We here focus on nonlinear scenarios and their applications in statistics and physics.

Figures

Figures reproduced from arXiv: 2411.09508 by the authors.

Figure 1
Figure 1. The octahedron and its edge graph. Example 5.1 is uniquely minimal among non-gentle arrangements. Theorem 5.2. Consider the graphic arrangements for all graphs G with n ≤ 6 vertices. With the exception of the octahedron graph, all of these arrangements are gentle. Proof. We prove this by exhaustive computation using our tools described in Section 6. Except for A(Goct), all graphic arrangements of graphs G on fewer t… view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Tame arrangements

    math.AG 2025-04 conditional novelty 7.0 of 10

    The paper establishes foundational criteria, including addition theorems and Ziegler-Yoshinaga type results, for deciding when hyperplane arrangements are tame.

  2. On the Jacobian syzygies for generic toric models

    math.AG 2025-07 accept novelty 6.0 of 10

    For a normal crossing arrangement of the n+1 coordinate hyperplanes and a generic smooth hypersurface of degree e, the Jacobian algebra has a Koszul-type minimal resolution with exponents all equal to e+1.

Reference graph

Works this paper leans on

31 extracted references · 28 canonical work pages · cited by 2 Pith papers

  1. [1]

    T. Abe, L. K¨ uhne, P. M¨ ucksch and L. M¨ uhlherr:Projective dimension of weakly chordal graphic arrangements, Algebraic Combinatorics 8 (2025) no. 1, pp. 157-174

    work page 2025

  2. [2]

    Am´ endola, N

    C. Am´ endola, N. Bliss, I. Burke, C.R. Gibbons, M. Helmer, S. Ho¸ sten, E.D. Nash, J.I. Rodriguez and D. Smolkin: The maximum likelihood degree of toric varieties , Journal of Symbolic Computation 92 (2019) 222–242

    work page 2019

  3. [3]

    d’Antonio and E

    G. d’Antonio and E. Delucchi: Minimality of toric arrangements , Journal of the Euro- pean Mathematical Society 17 (2015) 483–521

    work page 2015

  4. [4]

    Barnhill, J

    D. Barnhill, J. Cobb and M. Faust: Likelihood correspondence of statistical models , arXiv:2312.08501

    arXiv

  5. [5]

    Cachazo, N

    F. Cachazo, N. Early, A. Guevara, and S. Mizera: Scattering equations: from projective spaces to tropical Grassmannians, J. High Energy Phys. 06 (2019) 039

    work page 2019

  6. [6]

    Cachazo, S

    F. Cachazo, S. He, and E. Y. Yuan: Scattering equations and Kawai-Lewellen-Tye orthogonality, Phys. Rev. D 90 (2014) 065001

    work page 2014

  7. [7]

    Catanese, S

    F. Catanese, S. Ho¸ sten, A. Khetan and B. Sturmfels: The maximum likelihood degree , American Journal of Mathematics 128 (2006) 671–697

    work page 2006

  8. [8]

    Cohen, G

    D. Cohen, G. Denham, M. Falk and A. Varchenko: Critical points and resonance of hyperplane arrangements, Canadian Journal of Mathematics 63 (2011) 1038–1057

    work page 2011

Show all 31 references
  1. [9]

    Denham, M

    G. Denham, M. Garrousian and M. Schulze: A geometric deletion-restriction formula , Advances in Mathematics 230 (2012) 1979–1994

    2012

  2. [10]

    Denham and M

    G. Denham and M. Schulze: Complexes, duality and Chern classes of logarithmic forms along hyperplane arrangements, Advanced Studies in Pure Mathematics, Vol. 99 (2009)

    2009

  3. [11]

    Dupont: The Orlik–Solomon model for hypersurface arrangements , Annales de l’institut Fourier 65 (2015) 2507–2545

    C. Dupont: The Orlik–Solomon model for hypersurface arrangements , Annales de l’institut Fourier 65 (2015) 2507–2545

    2015

  4. [12]

    Early, A

    N. Early, A. Pfister and B. Sturmfels: Minimal kinematics on M0,n, Moduli, to appear, arXiv:2402.03065

    arXiv

  5. [13]

    Edelman and V

    P. Edelman and V. Reiner: A counterexample to Orlik’s conjecture , Proceedings of the American Mathematical Society 118 (1993) 927–929

    1993

  6. [14]

    Eisenbud: Commutative algebra: with a view toward algebraic geometry , Graduate Texts in Mathematics, Vol

    D. Eisenbud: Commutative algebra: with a view toward algebraic geometry , Graduate Texts in Mathematics, Vol. 150, Springer, New York, 2013

    2013

  7. [15]

    Eisenbud, C

    D. Eisenbud, C. Huneke and B. Ulrich: What is the Rees algebra of a module? , Pro- ceedings of the American Mathematical Society 131 (2003) 701–708

    2003

  8. [16]

    Eisenbud, A

    D. Eisenbud, A. Taylor, S. Popescu and M.E. Stillman: The ReesAlgebra package in Macaulay2, Journal of Software for Algebra and Geometry 8 (2018) 49–60

    2018

  9. [17]

    Grayson and M

    D. Grayson and M. Stillman: Macaulay2, a software system for research in algebraic geometry, available at www.math.uiuc.edu/Macaulay2/

  10. [18]

    Ho¸ sten, A

    S. Ho¸ sten, A. Khetan and B. Sturmfels: Solving the likelihood equations , Foundations of Computational Mathematics 5 (2005) 389–407

    2005

  11. [19]

    Huh: The maximum likelihood degree of a very affine variety , Compositio Mathemat- ica, 149 (2013) 1245–1266

    J. Huh: The maximum likelihood degree of a very affine variety , Compositio Mathemat- ica, 149 (2013) 1245–1266. 20

    2013

  12. [20]

    Huh and B

    J. Huh and B. Sturmfels: Likelihood geometry, in Combinatorial Algebraic Geometry , Lecture Notes in Mathematics 2108 (2014), Springer, 63–117

    2014

  13. [21]

    Huneke: On the symmetric algebra of a module , J

    C. Huneke: On the symmetric algebra of a module , J. Algebra 69 (1981) 113–119

    1981

  14. [22]

    K¨ uhne:The universality of the resonance arrangement and its Betti numbers , Com- binatorica 43 (2023) 277–298

    L. K¨ uhne:The universality of the resonance arrangement and its Betti numbers , Com- binatorica 43 (2023) 277–298

    2023

  15. [23]

    Lam: Moduli spaces in positive geometry , Le Matematiche 80 (2025) 17–101

    T. Lam: Moduli spaces in positive geometry , Le Matematiche 80 (2025) 17–101

    2025

  16. [24]

    Miller and B

    E. Miller and B. Sturmfels: Combinatorial commutative algebra , Graduate Texts in Mathematics, Vol. 227, Springer, New York, 2004

    2004

  17. [25]

    M¨ uhlherr:Separator-based derivations of graphic arrangements, arXiv:2504.19893

    L. M¨ uhlherr:Separator-based derivations of graphic arrangements, arXiv:2504.19893

    arXiv

  18. [26]

    Orlik and H

    P. Orlik and H. Terao: Arrangements of hyperplanes, Grundlehren der mathematischen Wissenschaften, Vol. 300, Springer, Berlin, 1992

    1992

  19. [27]

    Saito: Theory of logarithmic differential forms and logarithmic vector fields , Journal of the Faculty of Science, University of Tokyo, Section IA Math

    K. Saito: Theory of logarithmic differential forms and logarithmic vector fields , Journal of the Faculty of Science, University of Tokyo, Section IA Math. 27 (1980) 265–291

    1980

  20. [28]

    Simis, B

    A. Simis, B. Ulrich and W.V. Vasconcelos: Rees algebras of modules, Proceedings of the London Mathematical Society 87 (2003) 610–646

    2003

  21. [29]

    Simis and W.V

    A. Simis and W.V. Vasconcelos: On the dimension and integrality of symmetric algebras, Mathematische Zeitschrift 177 (1981) 341–358

    1981

  22. [30]

    Sturmfels and S

    B. Sturmfels and S. Telen: Likelihood equations and scattering amplitudes , Algebraic Statistics 12 (2021) 167–186

    2021

  23. [31]

    Terao: Arrangements of hyperplanes and their freeness

    H. Terao: Arrangements of hyperplanes and their freeness. I , Journal of the Faculty of Science, University of Tokyo, Section IA Math. 27 (1980) 293–312. Authors’ addresses: Thomas Kahle, OvGU Magdeburg, Germany,thomas.kahle@ovgu.de Lukas K¨ uhne, Universit¨ at Bielefeld, Germ...

    1980

Pith tools

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