{"id":"0489012c-ef6f-4933-b03a-a90bdc59c25b","arxiv_id":"2504.14902","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper establishes foundational criteria, including addition theorems and Ziegler-Yoshinaga type results, for deciding when hyperplane arrangements are tame.","lead":"This paper proves new 'addition-deletion' theorems that let mathematicians build and recognize tame hyperplane arrangements, which are a class of geometric objects with well-behaved differential forms. The results give practical criteria for tameness that connect to free arrangements and to combinatorial data, with applications in algebra, geometry, and statistical likelihood theory.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Most load-bearing assumption is the multiarrangement version of the cited surjection theorem (Thm 2.20); the addition theorems in §3 collapse if that theorem does not cover arbitrary m.","rationale":"Reader's verdict is CONDITIONAL with moderate confidence, and I agree with that assessment. The central addition theorems are logically coherent once Theorem 2.20 is granted; the induction in Theorem 3.1 is intricate but the Ext computations are valid, the dependence on Theorem 2.20 is explicitly stated, and the problematic 'finite nonfree locus' assertion in the proof of Theorem 1.10 is actually defensible: local freeness along H forces every nonfree flat of codimension at most ℓ−2 to lie in H, and hence the nonfree locus outside H consists of at most finitely many points. The remaining issues are typos and terse statements (the induction-range phrase, Example 1.12, the Proposition/Lemma numbering). Thus no critical internal error was found. The one load-bearing risk is external: Theorem 2.20 is quoted rather than proved, and the paper's §3 uses it for multiarrangements. If that theorem in [3] has narrower scope, the addition theorems lose their support. This matches the reader's weakest-assumption identification. Verdict unchanged.","tokens_in":15693,"tokens_out":32288,"duration_ms":284670,"concrete_test":"Retrieve [3, Theorem 3.2] and check three points: (i) does the theorem cover multiarrangements (A,m) with arbitrary positive multiplicities, including the case m−δ_H; (ii) is the hypothesis exactly pd_S Ω^p(A,m) < ℓ−2 (not, say, pd_S Ω^p(A,m−δ_H) or a strict inequality that fails at p=ℓ−3); (iii) is 'locally free along H' defined as freeness of (A_X,m_X) for all nonzero X∈L(A^H). If all three hold, the concern is settled. If [3] treats only m≡1, the multiarrangement versions in §3 need a proof or a restriction before Theorems 1.5–1.8 can be accepted as stated.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Load-bearing concern: Theorem 2.20 is imported verbatim from [3] and is not proved in this paper. It is the map that makes the Euler and C-sequences right-exact, and every step of the induction in Theorem 3.1 (as well as Theorems 3.3, 3.4 and 3.5) invokes it. The version stated here is explicitly multiarrangement-theoretic: it allows arbitrary multiplicity m and also multiplicity m−δ_H, and it requires local freeness along H together with pd_S Ω^p(A,m) < ℓ−2. The cited source [3] is on B-sequences of Solomon-Terao polynomials; if its Theorem 3.2 was proved only for ordinary (m≡1) arrangements, or with a different pd hypothesis, then the multiarrangement addition theorem is not actually established by the present text. I have not found an internal inconsistency in the proofs conditional on Theorem 2.20; in the uses made here the hypotheses are satisfied (p≤ℓ−3 gives pd≤p<ℓ−2). The concern is therefore about the scope of the external black box, not about the internal logic.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","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.","tokens_in":15930,"tokens_out":27595,"duration_ms":243738,"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":[{"comment":"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.","section":"§2, Theorem 2.20; §3, Theorems 3.1, 3.3–3.5"},{"comment":"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.","section":"§4, proof of Theorem 1.10(2), near the use of Theorem 4.8"},{"comment":"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.","section":"§5, Theorem 5.4 and its proof"}],"minor_comments":[{"comment":"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.","section":"§3, proof of Theorem 3.1"},{"comment":"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.","section":"§4, proof of Theorem 1.9"},{"comment":"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.","section":"§1, Example 1.12"},{"comment":"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.","section":"§5, Definition 5.2(2)"},{"comment":"The text cites \"Proposition 2.23\" where the statement used is Lemma 2.23; please correct the cross-reference.","section":"§4, proof of Theorem 1.10(2)"}],"recommendation":"major_revision","confidential_remarks":"The paper is likely correct in substance, but the verification of the multiarrangement version of Theorem 2.20 in [3] is essential, and the proof gaps in Theorem 1.10(2) and Theorem 5.4 should be repaired with explicit arguments. A careful revision is feasible; no fundamental internal contradiction was found."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Takuro Abe has written the paper that the tame-arrangement community has been missing: an addition-deletion and restriction toolkit for tameness, mirroring Terao's theory for free arrangements. Theorems 1.5, 1.6, 1.8, the Ziegler-Yoshinaga criteria 1.9–1.11, and the inductively tame class in Section 5 are new and genuinely useful. If correct, tameness becomes checkable in many non-free examples, and applications to D-modules and likelihood geometry get easier.\n\nThe proofs are mostly standard homological algebra, and I found no circularity. The reliance on the author's Theorem 2.20 (projective dimensional surjection theorem, imported from his Math. Z. paper) is heavy: it is what makes the Euler and C-sequences right-exact, and every induction in Section 3 uses it. The version stated here is explicitly multiarrangement-theoretic. The stress-test worry is that the cited source might only prove the ordinary (m ≡ 1) case. I cannot resolve that from the arXiv text alone; it needs a referee to check [3]. If Theorem 2.20 holds as stated, the paper is essentially correct.\n\nSoft spots: the proof of Theorem 3.1 has a mangled induction range ('p−1 < ℓ−4' should be something like ℓ−3), and there are typos in examples (the 'B is no more generic... B is generic' sentence in Example 1.12, and 7z appears twice in Example 5.5). Remark 4.7 honestly admits a limitation on Ω^{ℓ−1} for multiarrangements, which is fine but should be highlighted.\n\nBottom line: this deserves a serious referee. The main results are new, the internal logic is coherent, and the only real risk is the scope of the external black box. I'd send it out and ask the referee to verify Theorem 2.20.","headline":"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.","tokens_in":16460,"tokens_out":2001,"would_cite":true,"duration_ms":17011,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["14N20","32S22","13D02","52C35"],"pacs":[],"model":"deepseek-v4-flash","headline":"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.","keywords":["tame arrangements","hyperplane arrangements","logarithmic p-forms","multiarrangements","Ziegler restriction","addition-deletion theorem","projective dimension","inductive tameness"],"falsifier":"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.","tokens_in":15497,"feed_emoji":"📐","tokens_out":13616,"duration_ms":107708,"temperature":0.7,"pith_summary":"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.","feed_headline":"One hyperplane slice can certify tameness in rank five and up","feed_subtitle":"The paper proves tameness follows from a tame lower-dimensional restriction, plus local freeness, and gives a combinatorial class.","key_machinery":"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$.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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)."],"supporting_citations":[{"why":"supplies the projective dimensional surjection theorem (Theorem 2.20) that makes the Euler and C-sequences right-exact in every induction.","marker":"[3]"},{"why":"provides the locally free arrangement theorem used to show that projective dimension one forces tameness and underpins Theorem 4.4.","marker":"[22]"},{"why":"introduces the Ziegler restriction and the freeness theorem for restrictions of free arrangements (Theorem 2.18).","marker":"[32]"},{"why":"is the freeness criterion that Theorem 1.10 generalizes and also supplies the vanishing result used in the proof.","marker":"[30]"},{"why":"introduced tame arrangements and the Milnor-fiber motivation on which the whole theory rests.","marker":"[24]"},{"why":"gives the explicit resolution showing generic arrangements are tame, the base case for several inductive constructions.","marker":"[25]"},{"why":"provides the characteristic-polynomial inequality that Corollary 4.3 applies once tameness of the Ziegler restriction is known.","marker":"[1]"},{"why":"supplies standard reflexivity and projective-dimension bounds for logarithmic modules used throughout the arguments.","marker":"[23]"}],"fun_headline_variants":["A tame slice plus local freeness certifies tameness in rank five","One hyperplane decides tameness in rank five and up","Tameness equals tame restriction for locally free arrangements","Inductive tameness: build arrangements one hyperplane at a time"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["A tame slice plus local freeness certifies tameness in rank five","One hyperplane decides tameness in rank five and up","Tameness equals tame restriction for locally free arrangements","Inductive tameness: build arrangements one hyperplane at a time"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000212,"raw_usage":{"total_tokens":1369,"prompt_tokens":846,"completion_tokens":523,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":462,"completion_tokens_details":{"reasoning_tokens":453}},"tokens_in":462,"tokens_out":523,"duration_ms":5120,"temperature":1.0,"reasoning_tokens":453,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T11:39:06.461147+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[{"cited_title":"Abe, Addition-deletion theorems for the Solomon-Terao poly- nomials and B-sequences of hyperplane arrangements","cited_arxiv_id":null,"evidence_quote":"supplies the projective dimensional surjection theorem (Theorem 2.20) that makes the Euler and C-sequences right-exact in every induction."},{"cited_title":"Mustat ¸˘ a and H","cited_arxiv_id":null,"evidence_quote":"provides the locally free arrangement theorem used to show that projective dimension one forces tameness and underpins Theorem 4.4."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"introduces the Ziegler restriction and the freeness theorem for restrictions of free arrangements (Theorem 2.18)."},{"cited_title":"Yoshinaga, Characterization of a free arrangement and co n- jecture of Edelman and Reiner","cited_arxiv_id":null,"evidence_quote":"is the freeness criterion that Theorem 1.10 generalizes and also supplies the vanishing result used in the proof."},{"cited_title":"Orlik and H","cited_arxiv_id":null,"evidence_quote":"introduced tame arrangements and the Milnor-fiber motivation on which the whole theory rests."},{"cited_title":"Rose and H","cited_arxiv_id":null,"evidence_quote":"gives the explicit resolution showing generic arrangements are tame, the base case for several inductive constructions."},{"cited_title":"Abe, Characteristic polynomials, η-complexes, and freeness of tame arrangements","cited_arxiv_id":null,"evidence_quote":"provides the characteristic-polynomial inequality that Corollary 4.3 applies once tameness of the Ziegler restriction is known."},{"cited_title":"Orlik and H","cited_arxiv_id":null,"evidence_quote":"supplies standard reflexivity and projective-dimension bounds for logarithmic modules used throughout the arguments."}],"review_version":1}