{"id":"6e1b5fe7-667c-4c01-a40e-f6bd480c7ef9","arxiv_id":"1908.04500","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For an essential hyperplane arrangement, the sheaf homology of its intersection lattice with coefficients in the exterior powers of the natural sheaf is concentrated on one diagonal, with dimensions given by derivatives of the characteristic polynomial at 1.","lead":"This paper computes the homology of the intersection lattice of a hyperplane arrangement when the coefficient sheaf is built from exterior powers of the natural sheaf. The result expresses the homology dimensions as derivatives of the characteristic polynomial, and introduces Boolean covers and a deletion-restriction long exact sequence as the main tools.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 6's 'repeat this process' deletion step is asserted, not proved; the deletion-restriction sequence and the induction for Theorems 8–9 depend on it, so the main computation is conditional on filling this gap.","rationale":"The reader's weakest assumption identifies the same step, and my reading of the surrounding arguments found no further substantive gap. In particular, the deletion-restriction long exact sequence has the index pattern needed for the vanishing step of Theorem 8: the two neighboring groups vanish exactly when i+j is not equal to the rank, so the Euler-characteristic computation then determines the single remaining group dimensionally. The Boolean base case and the |A|=3 base case are sketched but consistent with direct computation. Thus the single real obstacle to the central claim is the unproved iterated deletion in Theorem 6. Because Theorem 7 is the main technical tool and the induction for Theorem 8 relies on it, the verdict should remain conditional: accept once the deletion sequence is either proved by a formal induction or verified by an explicit computation. No change from the reader's conditional verdict is needed.","tokens_in":18702,"tokens_out":29294,"duration_ms":302230,"concrete_test":"Reprove Theorem 6 by induction on the number of atoms of B_a, or computationally test it on small non-Boolean essential arrangements. For a concrete check, implement the cellular chain complexes for the rank-2 braid arrangement and for a rank-3 arrangement with four hyperplanes containing a dependent atom, and compute H_cell_*(B_a;F) both directly and via the Boolean-cover lattice ~L^a. Test different orders of deleting duplicate atoms within each f-fiber; if all orders give isomorphic homology matching ~L^a, the iterated step holds in these cases. Analytically, rewrite the 'repeat this process' paragraph as an explicit induction: for the current Boolean B' and a remaining duplicate pair t,t', verify that the interval [t∨t',1] in the restriction is a double, without importing (9) as a black box. If the induction goes through, the gap is formal only.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"In Section 3.6, Theorem 6 identifies the cellular homology of the sub-Boolean B_a with that of the Boolean cover ~L^a of the restriction. When the map from atoms of B_a to atoms of L^a is not injective, the proof picks two atoms s,s' in one fiber, shows that the restriction B^s is a double, and concludes from Proposition 5 and the sequence 0→C_*(B_s)→C_*(B)→C_{*-1}(B^s)→0 that H_cell(B) ≅ H_cell(B_s). It then states: 'We may now repeat this process by taking a sequence of deletions of B until we arrive at ~L^a. Courtesy of (9), the homology remains unchanged at each step.' This is the load-bearing step. The repeat is not a formal induction: one must verify that, after deleting s, the same double condition can be established for the remaining duplicate atoms inside B_s, and that the sheaf on the final Boolean lattice on representatives is isomorphic to the sheaf on ~L^a. If that verification fails, equation (9) does not iterate, the identification of H_cell(B^a) with H_cell(~L^a) in Theorem 7 breaks, and the vanishing half of the proof of Theorem 8 loses its inductive engine. The paper gives no detail for this iteration, so Theorem 9 rests on an unproved reduction.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper computes the sheaf homology of the intersection lattice L of a hyperplane arrangement with coefficients in the graded exterior sheaf Λ^•F of the natural sheaf F. The main technical contribution is a machinery of Boolean covers: for a graded atomic lattice L, the Boolean cover ~L is the Boolean lattice on the atoms of L, and the paper shows that the sheaf homology H_*(L\\0;F) is isomorphic to a cellular homology H_cell_*(~L;F) (Theorems 3 and 4, plus Corollary 2). The core new tool is a deletion-restriction long exact sequence for cellular homology of Boolean covers (Theorem 7), obtained from a short exact sequence of cellular chain complexes and an identification, proved in Theorem 6, of the cellular homology of a sub-Boolean with that of the Boolean cover of the restriction. This sequence is then used in an induction on the number of hyperplanes to prove Theorem 8, which gives the complete cellular homology of ~L with exterior-power coefficients for essential arrangements; Theorem 9 converts this to the desired sheaf homology. Theorems 10 and 11 extend the computation to non-essential arrangements by an essentialisation argument.","tokens_in":18973,"tokens_out":14056,"duration_ms":141361,"significance":"If the main results are correct, the paper provides an explicit, closed-form description of the full bi-graded sheaf homology of arrangement lattices with exterior-power coefficients, a genuine extension of the j=1 result of the authors' earlier paper and of Lusztig's theorem. The dimension formulas are expressed directly in terms of derivatives of the characteristic polynomial, so the paper gives a concrete categorification of χ_L(1+q) in the sense of graded Euler characteristics. The paper also introduces a useful set of tools — Boolean covers, cellular homology of Boolean lattices, splitting/doubling lemmas, and the deletion-restriction long exact sequence — that are likely to be of independent interest. The exposition is generally clear, the Euler-characteristic computations are parameter-free, and the claimed formulas are precise and falsifiable. The main concern is a gap in the proof of Theorem 6, on which the deletion-restriction sequence and the entire induction rest.","major_comments":[{"comment":"The reduction 'We may now repeat this process by taking a sequence of deletions of B until we arrive at ~L^a' is asserted rather than proved. The proof establishes that a single deletion of an atom s identified with another atom s' under the Boolean-cover map does not change cellular homology, by showing that the corresponding restriction sub-Boolean is a double and applying Proposition 5 together with the short exact sequence of chain complexes. To iterate this, one must verify that after deleting s, the remaining atoms of B_s that are identified in pairs under the map to L^a still satisfy the same double condition with respect to the appropriate new atom α = u∨u', and that the sheaf on the final Boolean lattice obtained by choosing one representative from each fiber is isomorphic to the induced sheaf on the Boolean cover of L^a. This is a formal induction on the number of surplus atoms; it is not supplied. Since Theorem 7 (the deletion-restriction long exact sequence) and hence the inductive proof of Theorems 8 and 9 depend on this identification, the main computation is conditional on filling this gap. Please add the missing induction, or give an alternative direct argument that the iterated deletions preserve cellular homology and terminate at ~L^a.","section":"Section 3.6, proof of Theorem 6"}],"minor_comments":[{"comment":"The base case |A|=3 is not fully demonstrated: for j=1 the proof says only 'Two applications of Theorem 5 give the required result', and for j=2 the verification is a single sentence. Since this case anchors the induction on |A|, please include the explicit chain-level computation or a small table of the cellular chain groups for the braid arrangement.","section":"Section 4.2, proof of Theorem 8, base case |A|=3"},{"comment":"The notation for deletion and restriction sub-Booleans is easy to confuse: in the proof of Theorem 6 the same symbol B_s appears to be used for both the deletion (the sub-Boolean not containing s) and the restriction (the interval [s,1]) in different sentences. Please use distinct, consistently defined symbols such as B_s^del and B_s^res, or define them explicitly at the start of the proof.","section":"Section 3.6"},{"comment":"The title reads 'The graded Euler chracteristic' — 'chracteristic' should be 'characteristic'.","section":"Proposition 6"},{"comment":"In the statement of Theorem 9 (and the abstract), the phrase 'or, i = 0 and or j = rkL− 1' contains a repeated 'or'; please correct to 'or i = 0 and j = rkL− 1'.","section":"Abstract and Theorem 9"},{"comment":"In the proof of Theorem 10, the phrase 'we have that dim H_cell_i(~L; Λ^tF⊥) = 0 unless t = rkL− i' is stated for F⊥ as an essential sheaf; it may help the reader to remind them that Theorem 8 applies because the essentialisation has the same arrangement lattice L with rank rkL and is essential in U⊥V.","section":"Section 4.3"}],"recommendation":"major_revision","confidential_remarks":"The paper's central formulas are plausible and the missing induction in Theorem 6 appears to be fillable, so I recommend major revision rather than rejection. The authors should be asked to provide the formal induction for the iterated deletions, and to expand the small base-case computation. The paper relies on the companion manuscript [ET] (arXiv:1902.00399) for some prior results; if that paper is not yet published, the editor may wish to confirm it is available to readers."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper gives the full sheaf homology of arrangement intersection lattices with coefficients in the exterior powers of the natural sheaf, with dimensions expressed as derivatives of the characteristic polynomial. That is a genuine extension of the authors' earlier j=1 result and of Lusztig's classical computation, and the Boolean-cover machinery plus the deletion-restriction long exact sequence are useful tools beyond this example. The main proof is a plausible induction: after proving vanishing, an Euler-characteristic calculation forces the nonzero dimensions. The graded Euler characteristic identity is clean, and there is no obvious circularity; the characteristic polynomial is an input, not a fitted parameter.\n\nThe soft spots are real but, I think, presentation-level. The proof of Theorem 6 contains a reduction that is asserted rather than demonstrated: once you delete one atom in a fiber of the Boolean-cover map, the text says 'repeat this process' without a formal induction showing that the double condition survives with respect to the remaining duplicate atoms. On top of that, the notation in that proof is confusing—I am fairly sure it should be the restriction B^s (the interval above s) that is shown to be a double, not the deletion B_s, and the typo makes the argument hard to follow. The base case |A|=3 is handled by a short case check rather than a detailed computation, which is acceptable but leaves some work to the reader. There are also minor typos.\n\nNone of this looks fatal. The gap in Theorem 6 can be filled: after deleting a duplicate atom, the remaining Boolean lattice is still a Boolean cover of the restriction, and the same argument applies to any remaining pair of duplicate atoms. But the paper as written does not say that, and the referee should ask for it.\n\nThe paper is for arrangement theorists, combinatorial topologists, and anyone interested in categorified characteristic polynomials. It deserves a serious referee; I would send it out, with the expectation of minor revisions. If the authors tighten the deletion argument and fix the notation, the result is solid.\n\nMy bottom line: send to peer review.","headline":"A solid computation of exterior-power sheaf homology for arrangement lattices, with a fixable gap in the deletion-restriction proof that a referee should ask to be filled.","tokens_in":19497,"tokens_out":13391,"would_cite":true,"duration_ms":132777,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E45","52C35","55N30"],"pacs":[],"model":"deepseek-v4-flash","headline":"For an essential hyperplane arrangement, the sheaf homology with coefficients in any exterior power of the natural sheaf is supported only on the diagonal i+j = rk L − 1, with dimensions given by derivatives of the characteristic…","keywords":["sheaf homology","hyperplane arrangements","intersection lattice","Boolean cover","exterior powers","characteristic polynomial","cellular homology","deletion-restriction"],"falsifier":"For the essential rank-2 braid arrangement (three lines through the origin in the plane), the paper predicts dim H_cell_1(~L;$Λ^{1}$F) = 1 and dim H_cell_0(~L;$Λ^{2}$F) = 1, with all other cellular homology groups zero. Writing down the cellular complex of the Boolean cover on three atoms and direct computation of the exterior-power coefficient maps would confirm or refute the theorem in this case.","tokens_in":18485,"feed_emoji":"📐","tokens_out":6743,"duration_ms":66800,"temperature":0.7,"pith_summary":"This paper computes the full sheaf homology of the intersection lattice of a hyperplane arrangement when the coefficient sheaf is any exterior power of the natural sheaf. The result is that the bi-graded homology H_i(L\\setminus 0;\\Lambda^j F) vanishes except on the diagonal i+j = \\operatorname{rk}L-1, plus a few low-degree exceptions, and on that diagonal its dimension is a derivative of the characteristic polynomial. This turns the coefficients of the characteristic polynomial into homology groups, a categorification the paper notes but does not pursue. The argument avoids the lattice itself and works on a Boolean cover, where the homology becomes cellular and is governed by a deletion–restriction long exact sequence.","feed_headline":"Characteristic polynomial derivatives count exterior-power homology","feed_subtitle":"Intersection-lattice homology with any exterior-power coefficient collapses to one diagonal fixed by the polynomial's higher derivatives.","key_machinery":"The Boolean cover of L is the lattice of all subsets of the atoms of L, with the canonical map sending a subset to its join in L; sheaf homology of L is isomorphic to sheaf homology of this cover, and on Boolean lattices sheaf homology is isomorphic to a cellular homology computed from the rank filtration. The paper's main technical tool is a deletion–restriction long exact sequence for this cellular homology, which mirrors the classical deletion–restriction relation for characteristic polynomials and drives the induction. Also essential is a splitting theorem showing that the exterior-power sheaf Λ^jF on the Boolean cover of an essential arrangement is decomposable, so its cellular homology can be reduced to that of a restriction lattice.","core_discovery":"The central discovery is that for an essential hyperplane arrangement with intersection lattice L, the sheaf homology groups H_i(L\\setminus 0;\\Lambda^j F) are supported exactly where i+j = \\operatorname{rk}L - 1 (with specified H_0 exceptions), and in that range\n$$\n\\dim H_i(L\\setminus 0;\\Lambda^j F) = \\frac{(-1)^{i+1}}{j!}\\$chi_L^{{(j)}}$(1),\n$$\nwhere $\\chi_L^{(j)}$ is the $j$-th derivative of the characteristic polynomial. The proof first establishes the analogous statement for the cellular homology of the Boolean cover, using induction and a newly derived deletion–restriction long exact sequence, then transfers the result back to sheaf homology. For non-essential arrangements, the same machinery yields explicit formulas in terms of the essentialisation of the natural sheaf and the dimension of the common intersection of all hyperplanes.","pith_inferences":["A natural extension not pursued in the paper is to study the multiplicative structure: the exterior-algebra product on Λ^\\bullet F likely gives H_*(L\\setminus 0;\\Lambda^\\bullet F) the structure of a module over an exterior algebra, which could distinguish arrangements that share the same characteristic polynomial.","The deletion–restriction long exact sequence for Boolean covers is a general machine that could apply to other coefficient sheaves such as symmetric powers or tensor powers, where diagonal support may fail but the recursion would still constrain the answer.","The proofs work over a field, so an immediate testable extension is to compute integral homology with exterior-power coefficients; the explicit cellular complex of the Boolean cover could reveal torsion not visible in the field computations."],"forward_implications":["The bi-graded homology H_*(L\\setminus 0;\\Lambda^\\bullet F) is completely determined by the characteristic polynomial and its derivatives, so no other invariants of the arrangement enter.","The graded Euler characteristic identity χ_q H_*(L\\setminus 0;\\Lambda^\\bullet F) = -χ_L(1+q) + (1+q)^{\\dim V} recovers the characteristic polynomial from the homology, making the homology a categorification of χ_L.","For non-essential arrangements, the homology is described through the essentialisation of the natural sheaf: the support lies in the strip rk L ≤ i+j ≤ dim V, with explicit binomial coefficients involving the dimension of the common intersection.","The j=1 case reproduces the previously known natural-sheaf homology, so the result contains and extends the earlier computation as a special case.","The cellular homology of the Boolean cover is computed first and has a single non-zero diagonal i+j = rk L = dim V, which shifts to the diagonal i+j = rk L - 1 for sheaf homology."],"supporting_citations":[{"why":"Supplies the j=1 case (natural sheaf) that this paper extends, along with the deletion–restriction framework for sheaf homology of geometric lattices.","marker":"[ET]"},{"why":"Provides the cellular homology machinery for posets with local coefficients that Theorem 4 adapts to Boolean lattices.","marker":"[ET15]"},{"why":"States the isomorphism between lattice sheaf homology and the cellular homology of the Boolean cover, which the paper generalizes and reproves.","marker":"[Lus74]"},{"why":"Gives the Leray–Serre spectral sequence for poset maps used to pass from a lattice to its Boolean cover.","marker":"[GZ67]"},{"why":"Provides the Möbius-function identity relating the lattice's Möbius values to the Boolean cover, used in Proposition 1.","marker":"[OT92]"},{"why":"Supplies the standard poset and lattice tools: Möbius inversion, Boolean Möbius values, and the characteristic polynomial of the braid arrangement used in the base case.","marker":"[Sta12]"}],"fun_headline_variants":["Exterior-power homology: characteristic polynomial derivatives decide","Boolean covers compute arrangement sheaf homology cellularly","Deletion-restriction exact sequence: key to exterior-power homology","Sheaf homology of arrangements collapses to a single diagonal","Exterior-power sheaf homology: a derivative formula and a new tool"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The induction assumes that deleting atoms one at a time in the Boolean cover, after identified atoms have been collapsed, does not change the cellular homology; the paper asserts this reduction rather than proving each deletion step in detail.","fun_headline_variants_meta":{"raw":{"variants":["Exterior-power homology: characteristic polynomial derivatives decide","Boolean covers compute arrangement sheaf homology cellularly","Deletion-restriction exact sequence: key to exterior-power homology","Sheaf homology of arrangements collapses to a single diagonal","Exterior-power sheaf homology: a derivative formula and a new tool"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000955,"raw_usage":{"total_tokens":4011,"prompt_tokens":823,"completion_tokens":3188,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":439,"completion_tokens_details":{"reasoning_tokens":3108}},"tokens_in":439,"tokens_out":3188,"duration_ms":24716,"temperature":1.0,"reasoning_tokens":3108,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:41:43.303658+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For the essential rank-2 braid arrangement (three lines through the origin in the plane), the paper predicts dim H_cell_1(~L;$Λ^{1}$F) = 1 and dim H_cell_0(~L;$Λ^{2}$F) = 1, with all other cellular homology groups zero. Writing down the cellular complex of the Boolean cover on three atoms and direct computation of the exterior-power coefficient maps would confirm or refute the theorem in this case.","supporting_citations":[],"review_version":1}