Pith. sign in

REVIEW 3 major objections 5 minor 1 cited by

Tame arrangements

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

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

Pith's one-line read Under local freeness, a rank-five-or-higher arrangement is tame exactly when its Ziegler restriction is tame; the paper also defines a combinatorial class.

desk verdict Abe's tame-arrangement paper delivers a usable addition-deletion and restriction toolkit for tameness, but the whole edifice rests on an imported multiarrangement surjection theorem; worth refereeing carefully. read the letter →

arxiv 2504.14902 v1 pith:V6TY6T32 submitted 2025-04-21 math.AG math.AC

Takuro Abe This is my paper · ORCID
classification math.AGmath.AC MSC 14N2032S2213D0252C35
keywords tamearrangementshyperplanelogarithmicp-formsmultiarrangementsZieglerrestrictionaddition-deletiontheoremprojectivedimensioninductivetameness
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

Tame arrangements are hyperplane arrangements whose logarithmic $p$-forms have bounded projective dimension, a property that is generic and underpins work on Milnor fibers, D-modules, Bernstein-Sato polynomials, and likelihood geometry. The paper makes tameness checkable: it proves an addition theorem (adding a hyperplane preserves tameness under local freeness), a restriction theorem (tameness passes to the Ziegler restriction), and the converse in rank at least five: if the Ziegler restriction to a hyperplane is tame and the arrangement is locally free along that hyperplane, then the arrangement is tame. It also introduces inductively tame arrangements and proves their tameness is determined by the intersection lattice. The takeaway is that in rank at least five, tameness can be certified from data in one dimension lower, in the same spirit that freeness is certified by the classical freeness criterion.

What carries the argument

The central objects are the modules $\Omega^p(A,m)$ of logarithmic $p$-forms of a multiarrangement, where a multiarrangement is a hyperplane arrangement with positive integer multiplicities on its hyperplanes. Tameness is the uniform bound $\mathrm{pd}_S\Omega^p(A,m) \le p$. The proofs run through two exact sequences: the Euler sequence, relating $\Omega^p(A,m)$, $\Omega^p(A,m-\delta_H)$, and the restriction $\Omega^p(A^H,m^*)$, and the dual C-sequence. The load-bearing mechanism is Theorem 2.20, the projective dimensional surjection theorem: under local freeness along $H$ and $\mathrm{pd}_S\Omega^p(A,m)<\ell-2$, the Euler restriction map $i^p_H$ is surjective. That surjectivity is what makes the sequences right-exact and lets the paper turn them into Ext bounds that drive induction on $p$.

What would settle it

Look for a rank-five (or higher) arrangement $A$ and hyperplane $H$ such that $A$ is locally free along $H$, the Ziegler restriction $(A^H,m_H)$ is tame, and $\mathrm{pd}_S\Omega^1(A) \ge 2$. Theorem 1.10(2) forbids this configuration, so an explicit computation of $\mathrm{pd}_S\Omega^1(A)$ for such a candidate would settle whether the central claim is right.

Watch

Extended reading notes

Core claim

The central discovery is that tameness is governed by one hyperplane and its Ziegler restriction. Theorem 1.10(2) states that for $\ell \ge 5$, if $H \in A$, the Ziegler restriction $(A^H,m_H)$ is tame, and $A$ is locally free along $H$, then $A$ is tame. With Theorem 1.9 in the reverse direction, local freeness along $H$ makes tameness of $A$ equivalent to tameness of $(A^H,m_H)$, and both equivalent to $\mathrm{pd}_S\Omega^1(A) \le 1$. Alongside this, the addition theorem (Theorem 1.5) gives an inductive way to build tame arrangements one hyperplane at a time, and Theorem 5.3 produces a class of inductively tame arrangements for which tameness is combinatorial. The author's claim is that tameness, like freeness, is an inductive property that can be checked largely from lower-dimensional restrictions.

Load-bearing premise

The load-bearing premise is the surjectivity of the Euler restriction map whenever the logarithmic module is locally free along $H$ and has projective dimension below $\ell-2$; all the addition and restriction proofs reduce to this map being onto, so a single failure of surjectivity in the ranges used would break the inductions.

Editorial extensions

If this is right

  • If $A'$ is tame and both $A'$ and $A'\cup\{H\}$ are locally free along $H$, then the enlarged arrangement and its restriction to $H$ are tame (Theorem 1.5).
  • In rank $\ell \ge 5$, under local freeness along $H$, tameness of $A$, the bound $\mathrm{pd}_S\Omega^1(A) \le 1$, and tameness of the Ziegler restriction are equivalent (Corollary 1.11).
  • Every tame arrangement that is locally free along $H$ has a tame Ziegler restriction, so the characteristic-polynomial coefficient inequalities of Theorem 4.2 apply without further checking (Corollary 4.3).
  • There is a class of inductively tame arrangements whose tameness is a combinatorial property of the intersection lattice (Theorem 5.3).
  • The theorems produce non-free tame arrangements, including ones that are not locally free, such as deformations of generic arrangements (Examples 1.7 and 1.12).

Reading between the lines

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

  • The paper leaves implicit that Theorem 1.10 suggests a recursive tameness certificate: peel off hyperplanes one at a time, maintaining local freeness, until the remaining arrangement lies in rank at most three, where tameness is automatic.
  • A natural extension is to scan existing rank-five or higher arrangement data for locally free hyperplanes and compare tameness of arrangements with tameness of their Ziegler restrictions, testing Corollary 1.11 computationally.
  • If the surjectivity theorem behind the inductions admits weaker hypotheses, the same arguments should yield full deletion theorems for tameness, completing an addition-deletion theory parallel to the one known for free arrangements.
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 develops inductive and restriction criteria for tame hyperplane arrangements and multiarrangements. The main results are an addition theorem (Theorem 1.5), a restriction theorem for tameness (Theorem 1.8), Ziegler- and Yoshinaga-type criteria (Theorems 1.9 and 1.10), and a class of inductively tame arrangements whose tameness is claimed to be combinatorial (Section 5). The arguments are built on the Euler and C-sequences for logarithmic p-forms and on a projective-dimensional surjection theorem (Theorem 2.20) quoted from the author's earlier work.

Significance. If the results are correct, this is a substantial contribution: it supplies the first general inductive tools for tameness, parallel to Terao's addition-deletion theory for freeness, and it makes tameness checkable by passing to a multiarrangement in one lower dimension. The paper also gives concrete non-free tame examples and a framework for combinatorially determined tameness, which is of immediate interest for applications to Milnor fibers, master functions, and Bernstein-Sato polynomials. The C-sequence formalism for multiarrangements and the use of the Mustaţă-Schenck and Yoshinaga criteria are well chosen, and the overall strategy is coherent. However, several load-bearing steps depend on an imported multiarrangement theorem whose stated scope is not verified in this manuscript, and two proof gaps need repair before the central claims can be considered established.

major comments (3)
  1. [§2, Theorem 2.20; §3, Theorems 3.1, 3.3–3.5] Theorem 2.20 is imported verbatim from [3] and is the sole mechanism that makes the Euler and C-sequences right-exact; every induction in Section 3 invokes it. The version needed here is explicitly a multiarrangement statement, for arbitrary multiplicity m and for m−δ_H, whereas the cited paper concerns B-sequences of ordinary hyperplane arrangements. Please either give a full proof of Theorem 2.20 or provide the exact statement and location in [3] that covers the multiarrangement case. Without this, the addition theorems and hence several of the main results are not established by the present text.
  2. [§4, proof of Theorem 1.10(2), near the use of Theorem 4.8] The assertion that local freeness along H implies that Ω^1(A) is non-free at only finitely many points is not justified and is false in the generality needed. Reflexivity only forces the non-free locus to have codimension at least three, and local freeness along H is compatible with a one-dimensional non-free component that meets H only at the origin; such a component gives infinitely many non-free points. The proof can be repaired: one only needs H^1(E(k))=0 for all sufficiently negative k, which holds for any coherent sheaf by Serre vanishing, and the already-proved surjectivity H^1(E(k−1))→H^1(E(k)) propagates this vanishing to all k. As written, however, the argument has a gap.
  3. [§5, Theorem 5.4 and its proof] The proof of Theorem 5.4 invokes Theorem 1.5 after obtaining only local surjectivity of the Euler and C-sequences from Proposition 2.25, but Theorem 1.5 requires A and A′ to be locally free along H. A generic hyperplane H will meet every positive-dimensional flat of A′, including non-free flats, so A need not be locally free along H merely because H is generic. If the intended argument is that local surjectivity replaces local freeness in the induction of Theorem 3.1, that argument is not supplied. As written, the proof does not establish the combinatorial tameness claim.
minor comments (5)
  1. [§3, proof of Theorem 3.1] The induction range phrase "up to k ≤ p − 1 < ℓ− 4, 0 < p− 1" appears to contain a typo: for the final step p=ℓ−3 one needs the induction hypothesis for p−1=ℓ−4, so the strict inequality should be p−1 < ℓ−3 or simply p−1 ≤ ℓ−4. Please clarify the induction statement.
  2. [§4, proof of Theorem 1.9] The sentence "By Lemma 2.24, it suffices to show that pd_{\bar S} Ω^p(A^H,m_H) ≤ p + 1" should refer to pd_S Ω^p(A^H,m_H) ≤ p+1, since Lemma 2.24 is then used to convert this to the desired bound pd_{\bar S} ≤ p.
  3. [§1, Example 1.12] The notation in Example 1.12 is inconsistent: the text says "B is no more generic, but we can show that B is generic," then refers to the Ziegler restriction of B but concludes tameness of A. The local-freeness argument and the final conclusion appear to concern B, and the reference to Theorem 3.3 should likely be to Theorem 3.2. Please correct the notation.
  4. [§5, Definition 5.2(2)] In condition (2) of Definition 5.2, the expression "A\{H}" should presumably be "A\{L}" in both occurrences, to match the hyperplane L introduced there.
  5. [§4, proof of Theorem 1.10(2)] The text cites "Proposition 2.23" where the statement used is Lemma 2.23; please correct the cross-reference.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular reasoning: the central additions and restrictions for tameness are proved from prior surjectivity and projective-dimension results whose hypotheses do not include tameness.

full rationale

The paper's main results are Theorems 1.5, 1.6, 1.8, 1.9, and 1.10. Their proofs do not assume tameness of the arrangement being constructed. The key external input is Theorem 2.20, the projective dimensional surjection theorem cited from the author's earlier paper [3]. That theorem asserts surjectivity of Euler restriction and residue maps under hypotheses of the form pd_S Ω^p(A,m) < ℓ−2 together with local freeness along H. It says nothing about tameness, so it is a genuinely independent input rather than a disguised form of the desired conclusion. In the proofs of Theorems 3.1, 3.3, 3.4, and 3.5, Theorem 2.20 is used only to obtain right exactness of Euler or C-sequences; the subsequent Ext-long exact sequence arguments then derive the needed projective-dimension bounds. For example, in Theorem 3.1 the induction proves simultaneously that i^p is surjective, pd_S Ω^p(A,m) ≤ p, and pd_S Ω^p(A^H,m^*) ≤ p+1, starting from the known tameness of (A,m−δ_H). No step in that induction presupposes the tameness of (A,m). Theorem 1.10(2) similarly proves pd_S Ω^1(A) ≤ 1 from the tameness of the Ziegler restriction and local freeness, then applies the Mustaţă–Schenck theorem (Theorem 4.4) whose assumptions are local freeness and pd_S Ω^1 ≤ 1, not tameness of A. The skeptical concern that the multiarrangement version of Theorem 2.20 may not be fully proved in [3] is a check on the scope of an external black box, not a circularity of the derivation: the present paper is internally conditional on that cited theorem, and the cited theorem does not contain the paper's conclusion. No fitted parameter is renamed as a prediction, no result is defined in terms of itself, and no uniqueness claim is imported to forbid alternatives. Accordingly, the circularity score is 0.

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

The central theorems are proven from standard commutative algebra and from prior results in arrangement theory, including Ziegler's restriction theorem, Yoshinaga's freeness criterion and vanishing theorem, Mustata-Schenck's results on wedge products, and the author's own projective dimensional surjection theorem. These prior results are independent of tameness itself, so no circularity is introduced. There are no fitted parameters; the paper is a pure mathematical derivation.

assumptions (6)
  • domain assumption Theorem 2.20 (projective dimensional surjection theorem, Abe [3])
    Ensures surjectivity of Euler and residue restriction maps under local freeness and pd < ℓ-2. Used in proofs of Theorems 3.1, 3.3, 3.4, 3.5; load-bearing for right-exactness of C-sequences and Euler sequences.
  • domain assumption Theorem 2.18 (Ziegler's restriction theorem, Ziegler [32])
    Shows Ziegler restrictions of locally free arrangements are locally free, and gives the Ziegler exact sequence. Used in Theorems 1.9 and 1.10.
  • domain assumption Proposition 4.6 (Lebelt and Mustata-Schenck, [21],[22])
    For a locally free S-graded module M with pd M = 1, pd wedge^p M = p. Used in Theorem 4.4.
  • domain assumption Theorem 4.8 (Yoshinaga's vanishing theorem, [30])
    Gives H^1 vanishing for reflexive sheaves locally free off finitely many points. Used in the proof of Theorem 1.10(2).
  • domain assumption Proposition 2.22 (Eisenbud's Gamma_* criterion, [18])
    Identifies modules with global sections of associated sheaves when depth >= 2. Used to pass from sheaf surjectivity to module exact sequences.
  • standard math Standard commutative algebra: Auslander-Buchsbaum formula, Nakayama's lemma, reflexivity of logarithmic p-forms (Theorem 2.4)
    Used throughout for projective dimension computations and for reducing tameness to the middle range 1 <= p <= ell-3.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Tame arrangements." pith.science (2026). https://pith.science/paper/V6TY6T32

@misc{pith2026250414902,
  author       = {Pith},
  title        = {Pith review of: Tame arrangements},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/V6TY6T32}},
  note         = {Machine review of arXiv:2504.14902}
}
read the original abstract

Tame arrangements were informally introduced by Orlik and Terao for the study of Milnor fibers of hyperplane arrangements. After that, tame arrangements have been applied to a lot of researches on arrangements including freeness, master functions and critical varieties, Solomon-Terao algebras, D-modules, Bernstein-Sato polynomials and likelihood geometry. Though arrangements are generically tame, the research on tame arrangements themselves have been only few. In this article we establish foundations for the research of tame arrangements. Namely, we prove the addition theorem for tame arrangements, Ziegler-Yoshinaga type results for tameness and combinatorially determined tameness.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Solomon-Terao polynomials and Castelnouvo-Mumford regularity of hyperplane arrangements

    math.AG 2025-09 conditional novelty 7.0 of 10

    For tame hyperplane arrangements, the Solomon-Terao polynomial is monic of degree equal to the number of hyperplanes, settling Conjecture 1.6.

Reference graph

Works this paper leans on

32 extracted references · 30 canonical work pages · cited by 1 Pith paper

  1. [3]

    Abe, Addition-deletion theorems for the Solomon-Terao poly- nomials and B-sequences of hyperplane arrangements

    T. Abe, Addition-deletion theorems for the Solomon-Terao poly- nomials and B-sequences of hyperplane arrangements. Math. Z. 306 (2024), Paper no. 25. 18 pp

    work page 2024

  2. [1]

    Abe, Characteristic polynomials, η-complexes, and freeness of tame arrangements

    T. Abe, Characteristic polynomials, η-complexes, and freeness of tame arrangements. Michigan Math. J . 62 (2013), no. 1, 117–130

    work page 2013

  3. [2]

    Abe, Addition-deletion theorem for free hyperplane arrange - ments and combinatorics

    T. Abe, Addition-deletion theorem for free hyperplane arrange - ments and combinatorics. J. Algebra 610 (2022), 1–17

    work page 2022

  4. [4]

    Abe and G

    T. Abe and G. Denham, Deletion-restriction for logarithmic forms on multiarrangements. arXiv:2203.04816 (2022)

    arXiv 2022

  5. [5]

    On Ziegler's conjectures for logarithmic derivations of arrangements

    T. Abe and G. Denham, On Ziegler’s conjectures for logarithmic derivations of arrangements. arXiv:2307.08173 (2023). 22

    work page Pith review arXiv 2023

  6. [6]

    T. Abe, T. Maeno, S. Murai and Y. Numata, Solomon-Terao alge- bra for hyperplane arrangements. J. Math. Soc. Japan 71 (2019), no. 4, 1027–1047

    work page 2019

  7. [7]

    T. Abe, H. Terao and M. Wakefield, The characteristic polynomial of a multiarrangement. Adv. in Math. , 215 (2007), 825–838

    work page 2007

  8. [8]

    T. Abe, H. Terao and M. Wakefield, The Euler multiplicity and addition-deletion theorems for multiarrangements. J. London Math. Soc ., 77 (2008), no. 2, 335–348

    work page 2008

Show all 32 references
  1. [9]

    Abe and M

    T. Abe and M. Yoshinaga, Free arrangements and coefficients of characteristic polynomials. Math. Z., 275 (2013), Issue 3, 911-919

    2013

  2. [10]

    Bath, A note on Bernstein-Sato varieties for tame divisors a nd arrangements

    D. Bath, A note on Bernstein-Sato varieties for tame divisors a nd arrangements. Michigan Math. J . 73 (2023), no. 4, 751–779

    2023

  3. [11]

    Bath, Bernstein-Sato varieties and annihilation of powers Trans

    D. Bath, Bernstein-Sato varieties and annihilation of powers Trans. Amer. Math. Soc . 373 (2020), no. 12, 8543-–8582

    2020

  4. [12]

    Cohen, G

    D. Cohen, G. Denham, M. Falk, and A. Varchenko, Vanishing products of one-forms and critical points of master functions. Ar- rangements of hyperplanes—Sapporo 2009 , 75–107. Adv. Stud. Pure Math., 62 Mathematical Society of Japan, Tokyo, 2012

    2009

  5. [13]

    Denham, M

    G. Denham, M. Garrousian, M. Schulze, A geometric deletion- restriction formula. Adv. Math. 230 (2012), no. 4-6, 1979–1994

    2012

  6. [14]

    Denham and M

    G. Denham and M. Schulze, Complexes, duality and Chern classes of logarithmic forms along hyperplane arrangements. Arrange- ments of hyperplanes—Sapporo 2009, 27-–57, Adv. Stud. Pure Math., 62, Math. Soc. Japan, Tokyo, 2012

    2009

  7. [15]

    Denham, H

    G. Denham, H. Schenck, M. Schulze, M. Wakefield, and U. Walther, Local cohomology of logarithmic forms. Ann. Inst. Fourier 63 (2013), no.3, 1177–1203

    2013

  8. [16]

    Denham and A

    G. Denham and A. Steiner, Geometry of logarithmic derivations o f hyperplane arrangements. Contemp. Math ., 790 American Math- ematical Society, [Providence], RI, 2023, 59–77

    2023

  9. [17]

    P. H. Edelman and V. Reiner, A counterexample to Orlik’s con- jecture. Proc. Amer. Math. Soc ., 118 (1993), 927–929. 23

    1993

  10. [18]

    Eisenbud, The geometry of syzygies

    D. Eisenbud, The geometry of syzygies . A second course in com- mutative algebra and algebraic geometry Grad. Texts in Math., 229 Springer-Verlag, New York, 2005. xvi+243 pp

    2005

  11. [19]

    Kahle, L

    T. Kahle, L. K¨ uhne, L. M¨ uhlherr, B. Sturmfels and M. Wiesmann, Arrangements and Likelihood. arXiv:2411.09508 (2024)

    2024 arXiv

  12. [20]

    Kung and H

    J. Kung and H. Schenck, Derivation modules of orthogonal dua ls of hyperplane arrangements. J. Algebraic Combin . 24 (2006), no. 3, 253–262

    2006

  13. [21]

    Lebelt, Freie aufl¨ osungen ¨ ausser potenzen, Manscripta Math

    K. Lebelt, Freie aufl¨ osungen ¨ ausser potenzen, Manscripta Math. 21 (1977), 341–355

    1977

  14. [22]

    Mustat ¸˘ a and H

    M. Mustat ¸˘ a and H. Schenck, The module of logarithmic p-forms of a locally free arrangement. J. Algebra 241 (2) (2001), 699–719

    2001

  15. [23]

    Orlik and H

    P. Orlik and H. Terao, Arrangements of hyperplanes. Grundlehren der Mathematischen Wissenschaften, 300. Springer-Verlag, Berlin, 1992

    1992

  16. [24]

    Orlik and H

    P. Orlik and H. Terao, Arrangements and Milnor fibers. Math. Ann. 301 (1995), no. 2, 211–235

    1995

  17. [25]

    Rose and H

    L. Rose and H. Terao, A free resolution of the module of logarith - mic forms of a generic arrangement. J. Algebra 136 (1991), Issue 2, 376–400

    1991

  18. [26]

    Schulze, Freeness and multirestriction of hyperplane arran ge- ments

    M. Schulze, Freeness and multirestriction of hyperplane arran ge- ments. Compos. Math. 148 (2012), no. 3, 799–806

    2012

  19. [27]

    Solomon and H

    L. Solomon and H. Terao, A formula for the characteristic poly- nomial of an arrangement. Adv. Math. 64 (1987), 305–325

    1987

  20. [28]

    Terao, Arrangements of hyperplanes and their freeness I , II

    H. Terao, Arrangements of hyperplanes and their freeness I , II. J. Fac. Sci. Univ. Tokyo 27 (1980), 293–320

    1980

  21. [29]

    Walther, The Jacobian module, the Milnor fiber, and the D- module generated by f s

    U. Walther, The Jacobian module, the Milnor fiber, and the D- module generated by f s. Invent. Math. 207 (2017), no.3, 1239– 1287

    2017

  22. [30]

    Yoshinaga, Characterization of a free arrangement and co n- jecture of Edelman and Reiner

    M. Yoshinaga, Characterization of a free arrangement and co n- jecture of Edelman and Reiner. Invent. Math. 157 (2004), no. 2, 449–454. 24

    2004

  23. [31]

    Yoshinaga, On the freeness of 3-arrangements

    M. Yoshinaga, On the freeness of 3-arrangements. Bull. London Math. Soc. 37 (2005), no. 1, 126–134

    2005

  24. [32]

    G. M. Ziegler, Multiarrangements of hyperplanes and their free - ness. Singularities Contemp. Math., 90, Amer. Math. Soc., Prov- idence, RI, 1989. 25

    1989

Pith tools

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