Sheaf homology of hyperplane arrangements, Boolean covers and exterior powers

We compute the sheaf homology of the intersection lattice of a hyperplane arrangement with coefficients in the graded exterior sheaf Λ∙F\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varLambda ^\bullet F$$\end{document} of the natural sheaf F. This builds on the results of our previous paper Everitt and Turner (Adv Math 402:Paper No. 108354, 2022. https://doi.org/10.1016/j.aim.2022.108354) where this homology was computed for Λ1F=F\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varLambda ^1F=F$$\end{document}, itself a generalisation of an old result of Lusztig. The computational machinery we develop in this paper is quite different though: sheaf homology is lifted to what we call Boolean covers, where we instead compute homology cellularly. A number of tools are given for the cellular homology of these Boolean covers, including a deletion–restriction long exact sequence.


Introduction
The combinatorics of a hyperplane arrangement is encapsulated by its intersection lattice.The homology of this lattice, with constant coefficients, was first determined in [Fol66,Bjö82], with Quillen [Qui78] showing that it has the homotopy type of a wedge of spheres.Interest in homology may be revived though by taking coefficients in a more interesting local system, that is to say, in a sheaf on the lattice.The resulting sheaf homology H * (L \ 0; F), where L is the intersection lattice of a hyperplane arrangement and F is some interesting (naturally occuring) sheaf, then becomes worthy of investigation.
Intersection lattices of hyperplanes arrangements come equipped with a canonical sheaf as the elements of the lattice are vector spaces.We call this the natural sheaf, and in [ET22] we showed that the reduced sheaf homology is trivial in all degrees, except the top one, whose dimension is related to the β-invariant of the arrangement, i.e. the derivative of the characteristic polynomial of L evaluated at 1 -see [Zas87].This generalises, to an arbitrary arrangement, an old result of Lusztig [Lus74] where he considers the arrangement of all hyperplanes in a vector space over a finite field.There are various other sheaves that can be put on an intersection lattice -see [OT92] -but they turn out to be what Yuzvinsky [Yuz91] calls local sheaves, and so the homology vanishes for general reasons.The natural sheaf is not local.
In this paper our principal object of interest is the sheaf homology of L with coefficients in the graded sheaf Λ • F, where F is the natural sheaf and Λ j F is the j-th exterior power of F. We concentrate first on the case where the arrangement is essential, meaning that the intersection of all the hyperplanes is trivial.Our result here is: Theorem 9. Let L be the intersection lattice of an essential hyperplane arrangement in a space V. Let F be the natural sheaf on L and Λ j F be the j-th exterior power of F. If rk(L) ≥ 2 then H i (L \ 0; Λ j F) is trivial unless: Brent Everitt: Department of Mathematics, University of York, York YO10 5DD, United Kingdom.e-mail: brent.everitt@york.ac.uk.Paul Turner: Section de mathématiques, Université de Genève, 7-9 Rue du Conseil-Général, CH-1205, Geneva, Switzerland.e-mail: paul.turner@unige.ch.arXiv:1908.04500v2[math.AT] 8 Aug 2022 -either 0 < i < rk(L) − 1 and i + j = rk(L) − 1, in which case -or, i = 0 and or j = rk(L) − 1, in which case dim H 0 (L \ 0; -or, i = 0 and j < rk(L) − 1, in which case dim H 0 (L \ 0; Λ j F) = rk(L) j where χ ( j) L (t) is the j-th derivative of the characteristic polynomial of L.
The case j = 1 reproduces the main result of [ET22], and the appearance there of the βinvariant of the arrangement is expanded to the appearance of higher derivatives of the characteristic polynomial that are related to the dimensions of the higher exterior powers.The graded Euler characteristic of this (bi-graded) homology is (see Corollary 5) The homology H * (L \ 0; Λ • F) can thus be interpreted as a categorification of the characteristic polynomial of the hyperplane arrangement, although we do not pursue this point of view.We extend the results above to non-essential arrangements in Theorem 11.
Our main computational tool is given by what we call Boolean covers.These are Boolean lattices that keep track of all the expressions of elements as joins of atoms.As lattices they are particularly amenable to having their homology computed cellularly -a philosophy that we adopted in [ET15].We then make the connection betwen this cellular homology of Boolean covers and the sheaf homology of the lattices being covered.This is a two step process.Writing L for the Boolean cover of L, a number of spectral sequence arguments establish: Theorem 3. Let L be a graded atomic lattice with sheaf F and let f : L → L be its Boolean cover.Then H * (L \ 0; F) H * ( L \ 0; F).
This result also appears in [Lus74, §1.2].The second step is: If L is an intersection lattice, then for a hyperplane a the deletion L a and restriction L a are lattices of "smaller" arrangements -see §1.1.The characteristic polynomial of L satisfies a deletion-restriction relation in terms of L a and L a , and our main technical tool is a lift of this to the setting of the cellular homology of Boolean covers.
Theorem 7. Let L be a geometric lattice equipped with a sheaf F and let f : L → L be its Boolean cover.Then for any atom a ∈ L there is a long exact sequence This allows us to prove the analogue of Theorem 9 for the cellular homology of Boolean covers: Theorem 8. Let L be the intersection lattice of an essential hyperplane arrangement in a space V, let F be the natural sheaf on L and Λ j F be the j-th exterior power of F. If rk(L) ≥ 2 and L → L is the Boolean cover of L, then where χ L (t) is the j-th derivative of the characteristic polynomial of L. Indeed this is proved first, and Theorem 9 is a corollary.It is extended to non-essential sheaves in Theorem 10.
The theorems above, indeed all the results of this paper, hold for lattices in a range of generalities.The broadest class -for example in Theorem 3 -are the graded atomic lattices.The proof of the long exact sequence in Theorem 7 requires the restriction L a to also be graded atomic; to ensure this we restrict to the smaller class of geometric lattices.Specific computations of homology, such as Theorems 8 and 9, are done for the natural sheaf on the further restricted class of arrangement lattices.Finally, for our cellular calculations we restrict yet further to the Boolean lattices, although this is purely for conciseness and convenience -an analogous result to Theorem 4 holds for the class of cellular posets; see [ET15,Theorem 2].
Working with the Boolean cover takes us quite close to the perspective of Dansco and Licata [DL15].Motivated by Khovanov homology-style constructions, they make a number of decorated hypercubes (some using exterior powers) which give rise to homologies which categorify the characteristic polynomial, among other things, of a hyperplane arrangement.Our cellular homology of the Boolean cover is very much of this type, but in fact the resulting decorated hypercube is not one they consider.They initiate some computations of the homology for their examples and it would be interesting to see further (or full) computations.The techniques we develop for Boolean covers may be of some use in this regard.
The structure of the paper is as follows.In §1 we discuss the basics of lattices, arrangements and sheaves.We recall the necessary background on hyperplane arrangements and their intersection lattices, sheaves on lattices, and characteristic polynomials.We also introduce Boolean covers.In §2 we move to homology, first discussing sheaf homology and its basic properties and calculating the Euler characteristic in the example of interest.We then discuss a Leray-Serre type spectral sequence needed to make the connection between a lattice and its Boolean cover.In §3 we introduce the cellular homology of a Boolean lattice with coefficients in a sheaf.We show that cellular homology computes sheaf homology and give a number of technical results about cellular homology, of which the most important is the deletion-restriction long exact sequence.§4 studies the main example of the homology of an arrangement lattice with coefficients in the exterior powers of the natural sheaf.After a brief discussion of graded Euler characteristics, we state and prove our main results first for essential arrangements and then in the non-essential case.

Lattices, arrangements and sheaves
This section summarises the basics of posets, lattices and sheaves.§1.1 presents basic poset notions and terminology along with the examples that preoccupy this paper: the intersection lattices of hyperplane arrangements.§1.2 gives basic sheaf notions and constructions and the principal examples: the natural sheaf of a hyperplane arrangement and its exterior powers.§1.3 recalls the characteristic polynomial and finally §1.4 introduces a key tool in the computation of sheaf homology: the Boolean cover of a graded atomic lattice.

Posets, lattices and arrangements
Let P = (P, ≤) be a finite graded poset with rank function rk : P → Z (see [Sta12,Chapter 3] for this and other basic poset terminology in this section).A minimum is an element 0 ∈ P with 0 ≤ x for all x ∈ P and a maximum is an element 1 ∈ P with x ≤ 1 for all x ∈ P. We assume rk(0) = 0.The atoms of P are the elements of rank 1.A poset map f : Q → P is a set map such that f x ≤ f y ∈ P if x ≤ y ∈ Q.
A subset K ⊂ P is upper convex if x ∈ K and x ≤ y implies y ∈ K.If x ≤ y, the interval [x, y] consists of those z ∈ P such that x ≤ z ≤ y; if x ∈ P the interval P ≥x consists of those z ∈ P such that z ≥ x; one defines P ≤x , P >x and P <x similarly.
A lattice is a poset equipped with a join ∨ and a meet ∧.A finite lattice has a minimum 0, equal to the meet of all its elements, and a maximum 1, equal to the join.A graded lattice is atomic if every element can be expressed (not necessarily uniquely) as a join of atoms, with the convention that the empty join is the minimum 0. The rank rk(L) of a graded lattice L is rk(L) := rk(1).
If A is a finite set then the Boolean lattice B = B(A) consists of the subsets of A ordered by inclusion.The result is a graded atomic lattice with rk(x) = |x|, join x ∨ y = x ∪ y, meet x ∧ y = x ∩ y, minimum 0 = ∅, maximum 1 = A and atoms A. Any element has a unique expression as a join of atoms.
This paper is about arrangement lattices.If V is a finite dimensional vector space over a field k, then an arrangement in V is a finite set A = {a i } of linear hyperplanes, i.e. codimension one subspaces.The corresponding arrangement lattice L = L(A) has elements all possible intersections of hyperplanes in A -with the empty intersection taken to be V -and ordered by reverse inclusion.Then L is a graded atomic lattice with atoms the hyperplanes A, rank function rk(x) = codim x, minimum 0 = V, maximum 1 = a∈A a, x ∨ y = x ∩ y, and x ∧ y = z where the intersection on the right is indexed by the set {z ∈ L : x ∪ y ⊆ z}.Moreover, L is geometric, in that the rank function satisfies rk(x ∨ y) + rk(x ∧ y) ≤ rk(x) + rk(y).An arrangement is essential when a∈A a is the trivial subspace, or equivalently, rk(L) = dim V.The arrangement lattices on at most three hyperplanes are shown in Figure 1.The first three are Boolean -realised by arrangements of coordinate hyperplanes with respect to a basis in 1, 2 or 3-dimensionsand the last is a braid arrangement (see for instance [Sta07]) combinatorially isomorphic to the partition lattice Π(3) of a set of size 3.If a ∈ A is a hyperplane of an arrangement in V, then the deletion arrangement in V has hyperplanes A \ {a}.Its intersection lattice L a consists of the elements of L that can be expressed as a join of the atoms A \ {a}.The restriction arrangement in a has hyperplanes the subspaces a ∩ b for b ∈ A \ {a}.Its intersection lattice L a is the interval L ≥a = {x ∈ L : x ≥ a}.
In any graded atomic lattice, a set S ⊂ A of atoms is independent if T < S for all proper subsets T of S , and dependent otherwise.An atom a in a dependent set of atoms S with the property that S \ {a} = S is called a dependent atom.A schematic of L, L a and L a , when a is dependent, is shown in Figure 2. It is well known (see for instance [Bir79,EF13]) that the only graded atomic lattices without dependent atoms are the Booleans.Moreover, in a geometric lattice L we have rk( S ) ≤ |S|, and S is independent if and only if rk( S ) = |S|.

Sheaves on lattices
A sheaf on a poset P is a contravariant functor F : P → R Mod to the category of R-modules, where R is a commutative ring with 1, and P is interpreted as a category in the usual way (having a unique morphism x → y whenever x ≤ y).A morphism of sheaves is a natural transformation of functors κ : F → G and an isomorphism is a natural isomorphism.We write F y x for the structure map of the sheaf given by F(x ≤ y) : F(y) → F(x).
For example, if M ∈ R Mod is fixed, then the constant sheaf ∆M has ∆M(x) = M for every x ∈ P and (∆M) Many sheaf constructions can be done locally, or "pointwise".For example, the direct sum If Z : R Mod → R Mod is a functor then we write ZF for the sheaf arising from the composite Z • F : P → R Mod → R Mod.For example, if F is a sheaf and j ≥ 0, we have the exterior powers Λ j F of F, and hence the graded sheaf: It is easy to check that Λ j ∆M = ∆Λ j M, and that the standard module result: carries straight through to sheaves of modules.

The characteristic polynomial
Recall that if k is a field and L is a lattice then the Möbius function We generalise to when there is a sheaf F on L. The characteristic polynomial of the pair (L, F), denoted χ (L,F) (t), is defined by

Boolean covers
Let L be a graded atomic lattice with atoms A and let B = B(A) be the Boolean lattice on A. There is a canonical lattice map f : B → L given by f : B a i → L a i and we refer to the pair (B, f ) as the Boolean cover of L. We usually write L, instead of B, for the Boolean cover of L. If F is a sheaf on L, then there is an induced sheaf F on the Boolean cover defined at x ∈ L by F(x) = F( f x) and with structure maps To simplify the notation we will drop the tilde, writing1 F for F.
For a Boolean lattice B we have Thus, the characteristic polynomial for (B, F) is given by

Homology
In §2.1 we recall the basics of the homology of posets with coefficients in a sheaf and in §2.2 we discuss the (graded) Euler characteristic of the resulting homology.§2.3 gives some spectral sequences that will prove useful in the next section where we compare (sheaf) homology with the cellular homology defined in §3.

Sheaf homology
For a fixed poset P let lim − − → P be the colimit functor from sheaves on P to R Mod, and let lim − − → be the left derived functors, or higher colimits.The homology H * (P; F) of P with coefficients in the sheaf F are these higher colimits evaluated at the sheaf F. The homology can be computed using a chain complex S * (P; F) whose group of n-chains is where the direct sum is over the totally ordered chains σ = x n ≤ • • • ≤ x 0 in P. For such a chain σ and s ∈ F(x 0 ) we write s σ for the element of S n that has value s in the component indexed by σ and value 0 in all other components.The differential d : S n (P; F) → S n−1 (P; F) is then given by where as usual We have (see [GZ67, Appendix II]) The following are some well-known properties of homology.
Lemma 1. 1.If ∆M is a constant sheaf then H * (P; ∆M) H * (|P|, M), the ordinary simplicial homology of the order complex |P|, which is the geometrical realisation of the simplicial complex whose vertices are elements of P and n-simplicies are chains σ = x n ≤ • • • ≤ x 0 .2. If P has a minimum or maximum, and ∆M is a constant sheaf, then H 0 (P; ∆M) = M and H i (P; ∆M) vanishes for i > 0. 3.If P has a minimum 0, and F is any sheaf, then H 0 (P; F) = F(0) and H i (P; F) vanishes for i > 0.
Let T * (P; F) be the chain complex whose n-chains are T n (P; F) = σ F(x 0 ), the sum is over the non-degenerate chains σ = x n < • • • < x 0 , and with differential given by the formula (1).Then T * (P; F) is a sub-complex of S * homotopy equivalent to it (see for example [ET22, 2.1]).We will interchange between the S * and T * complexes as convenience dictates.
If F • is a graded sheaf then H * (P; F • ) = j H * (P; F j ) has the structure of a bi-graded vector space.

Euler characteristics
As usual, the Euler characteristic of homology is defined to be If V • is an graded vector space then its graded dimension is dim q V • = k dim V k q k , and if F • is a graded sheaf then the graded Euler characteristic of the homology H * (P; F • ) is given by Proof.Let x ∈ L and define ch n (x) to be the set of (strict) n-chains in L \ 0 of the form Recall that the Euler characteristic is the same as the alternating sum of the dimensions of the chain groups in a complex computing the homology, so The dimension of T n (L \ 0; F) can calculated as The value of the Möbius function µ L (0, x) may be expressed as Corollary 1. Writing χ (L,F) (t) for the derivative of the characteristic polynomial Proof.From the definition of the characteristic polynomial we have This then gives

Some spectral sequences
There is a Leray-Serre style spectral sequence associated to a poset map.The following is an adaptation of [GZ67, Appendix II, Theorem 3.6] -see also [ET22,§2.3].Let f : P → Q be a poset map and let F be a sheaf on P. For each q ≥ 0 define a sheaf Theorem 1 (Leray-Serre).There is a spectral sequence We are interested in a special case of this spectral sequence which we now describe.Let P be a poset equipped with sheaf F and let P = α∈K P α be a covering of P by upper convex subposets.We define a poset N, the nerve of the covering, that mimics the simplicial complex nerve of a covering of a space.If X is a non-empty subset of the indexing set K, let Then N is the sub-poset of the Boolean lattice B(K) consisting of those X for which P X ∅.
For each q ≥ 0, define a sheaf H q on N by and with structure map H q (X ⊂ Y) : H q (P Y ; F) → H q (P X ; F) induced by the inclusion P Y → P X .
Theorem 2. Given the set-up of the previous paragraph, there is a spectral sequence E 2 p,q = H p (N; H q ) ⇒ H p+q (P; F).
Proof.Define a map f : P → N by f (x) = {α ∈ K : x ∈ P α }.Let x ≤ y in P and suppose that α ∈ f (x), hence x ∈ P α .As P α is upper convex we have y ∈ P α too, hence α ∈ f (y).Thus f (x) ⊆ f (y) in N, and f is a poset map.We now claim that for X ∈ N, the fiber f −1 N ≥X is the subposet P X in (2).It then follows that the fiber sheaves H fib * of f are the H * above, and hence the result after applying Theorem 1.To see the claim, we have x ∈ P X if and only if x ∈ P α for all α ∈ X; this in turn happens if and only if X ⊆ f (x), or equivalently, x ∈ f −1 N ≥X .
Lusztig [Lus74, §1.2] gives a simplicial complex version of this result which he describes as "well known", although the reader might struggle to find a reference.

Passing to the Boolean cover
The spectral sequence of a covering from the previous section (Theorem 2) allows us to pass from a lattice L to its Boolean cover L when computing homology.The following result can be found in [Lus74, §1.2].
Theorem 3. Let L be a graded atomic lattice with sheaf F and let f : L → L be its Boolean cover.Then H * (L \ 0; F) H * ( L \ 0; F).
Proof.We cover L \ 0 and apply the spectral sequence of Theorem 2. If A is the set of atoms of L, then L \ 0 = a∈A L ≥a , is a covering by upper convex sets.If X ⊆ A then as L ≥x ∩ L ≥y = L ≥x∨y .Thus L X ∅ for all non-empty X ⊆ A, and the nerve poset N is just the Boolean lattice minus its minimum, i.e.N = B(A) \ 0 = L \ 0. The sheaf H q is given by Thus H q is the trivial sheaf when q > 0 and H 0 = F.The E 2 -page of the sequence of Theorem 2 is thus zero except for the q = 0 line, where E 2 p,0 = H p ( L \ 0; F).This gives the desired isomorphism H * (L \ 0; F) H * ( L \ 0; F).

Cellular homology
The ordinary singular homology of a space can be computed cellularly.In [ET15] we define a cellular cohomology that computes, for a large class of posets, the cohomology of a poset with coefficients in a sheaf.In this section we recall the basics we need (for homology rather than cohomology), restricting ourselves to the setting of Boolean lattices, and then reprove a theorem of Lusztig relating the homology of a lattice equipped with a sheaf to the cellular homology of the Boolean cover.§ §3.3-3.4 contain technical results that give a useful splitting theorem in §3.5.This leads to the first main theorem of the paper, the deletion-restriction long exact sequence for cellular homology -Theorem 7 of §3.6.

Basics
Let B = B(A) be the Boolean lattice on the finite set A and let F be a sheaf on B. Pick an ordering on A and write A = {a 1 , a 2 , . . ., a n }.An element x ∈ B is a subset of A, say x = {a i 1 , . . ., a i k }, which we write as x = a i 1 . . .a i k assuming that i m < i n for m < n.If y = a i 1 . . .a i j . . .a i k for some j then define ε x y := (−1) j−1 .The cellular chain complex C * (B; F) has k-chains where the direct sum is over the subsets x of size k.The differential , where the sum is over the pairs y < x with y of size k − 1 and x of size k, and with d x y = ε x y F x y .If z is a subset of size k − 2 with z < x and y 1 , y 2 are the two subsets of size k − 1 with z < y 1 , y 2 < x, then ε It follows that d 2 = 0 and C * (B; F) is a chain complex.Call H cell * (B; F) the cellular homology of B with coefficients in F. Up to isomorphism this construction is independent of the order chosen on A and of the sign assignment used (any collection of ε x y satisfying (3) will do).

Sheaf = Cellular
For a Boolean lattice we now have two kinds of homology -sheaf and cellular -and we now show these are isomorphic.The proof of the following is adapted from [ET15, Theorem 2] Theorem 4. If B is a Boolean lattice and F is a sheaf on B then The proof filters the complex S * (L; F) so that the standard spectral sequence has E 1 -page with single non-zero row the cellular chain complex C * (L; F).
Proof.Write L = B \ 0 and filter the complex S * (L; F) by defining F p S * = S * (L p ; F), where L p = {x ∈ L : rk L (x) ≤ p}, the elements whose rank in L is at most p.The E 0 -page of the standard spectral sequence of a filtration is then a quotient complex that we denote by S * (L p , L p−1 ; F).The E 1 -page is E 1 pq = H p+q (L p , L p−1 ; F).Analysing this homology a little further, the arguments of [ET15, §2] can be adapted to show Here, as we have the constant sheaf ∆F(x), the homology H * (L <x ; ∆F(x)) is just the ordinary reduced singular homology of the order complex of L <x .
The poset L <x is isomorphic to a Boolean lattice of rank rk L (x) minus its minimum and maximum.This, in turn, may be identified with the poset of sub-simplices of the boundary of a standard rk L (x)-simplex.Thus, the order complex |L <x | is a (rk(x) − 1)-sphere and It follows that H i (L p , L p−1 ; F) = 0 when i p, so the E 1 -page is trivial except along the q = 0 line, where is the module of cellular p-chains.The differential H p−1 (L p−1 , L p−2 ; F) ← H p (L p , L p−1 ; F) coincides with the cellular differential C p−1 ← C p , and thus H * (L; F) H cell * (L; F).
As a corollary to Theorems 3 and 4 we obtain a result of Lusztig [Lus74, Chapter 1], who proves that the homology of a lattice with coefficients in a sheaf is isomorphic to the cellular homology of the Boolean cover equipped with the induced sheaf: Corollary 2 (Lusztig).Let L be a graded atomic lattice with sheaf F and let L → L be its Boolean cover.Then, H * (L \ 0; F) H cell * ( L \ 0; F),

Short exact sequences for cellular homology
There are two short exact sequences of cellular chain complexes that will prove useful.
The sequence induced by a sub-Boolean.Let B = B(A) be the Boolean lattice on the set A and let x ∈ B. As x is a subset of A we can consider the Boolean B(x) -consisting of the subsets of x ordered by inclusion -and this is naturally a sub-poset of B with minimum 0 and maximum x.
If F is a sheaf on B, then (up to choice of signage in constructing the differential) the cellular complex C * (B(x); F) is a subcomplex of C * (B; F).Moreover, the quotient complex can be easily described: it is a "cellular like" complex of B \ B(x).Specifically, let , where y has one more element than w, but where now both w, y x.If z x has size k − 1 and z ≤ y, then the y 1 , y 2 of size k with z < y 1 , y 2 < y are also such that y 1 , y 2 x.It follows from (3) that d 2 = 0. Write C * (B \ B(x); F) for the resulting complex.
There is then a short exact sequence of cellular complexes We saw in Lemma 1 that a minimum needs to be removed for sheaf homology to be meaningful.Corollary 2 above transfers this requirement to the Boolean cover.Nevertheless, it will turn out to be more convenient to leave the miniumum in when performing calculations with Boolean covers.This section marries the two points of view.
Proposition 3. Let B be a Boolean lattice and let F be a sheaf on B. Then H cell i (B \ 0; F) H cell i+1 (B; F) for i > 0, and in low degrees there is an exact sequence Proof.If we take x = 0 in the sequence induced by a sub-Boolean in §3.3 we get a short exact sequence 0 → C * (0; The result follows immediately from the associated long exact sequence. Putting this together with Corollary 2, we get the sheaf homology H * (L \ 0; F) in terms of the cellular homology H cell * ( L; F): Proof.For i > 0 apply Corollary 2 and Proposition 3.For degree zero, consider the low degree short exact sequence of Proposition 3: Now use Corollary 2 to replace H cell 0 ( L\0; F) by H 0 (L\0; F) and recall that for an exact sequence the alternating sum of dimensions is zero.Corollary 4. Let χ (L,F) (t) be the derivative of the characteristic polynomial of the pair (L, F).
Then the Euler characteristic of the cellular homology of the Boolean cover is Proof.From the above and Corollary 1 we have

Splitting Booleans
An atom a splits a Boolean B into the deletion B a and the resriction B a , both of which are themselves Booleans of rank rk(B) − 1. Proposition 5 and Theorem 5 below describe two situations where such a splitting can give useful information about the homology of B itself.

Doubling:
Let F be a sheaf on B for which there is an atom a ∈ A such that for all x ∈ B a the structure map is the identity.The restrictions of F to B a and B a are consequently exactly the same sheaf and so we call (B; F) a double (see Figure 3).
Proposition 5. Let (B, F) be a double.Then C * (B; F) is acyclic, i.e.H cell i (B; F) = 0 for all i.Proof.Taking x = A \ {a} in (4), gives the short exact sequence from which there results a long exact sequence the signs in the definition of the differential of cellular homology required a choice of ordering on A. By reordering if necessary we may place a in first position.It follows that the signs ε x∨a x are equal to 1 for all x ∈ B a and consequently the connecting homomorphism δ is the map in homology induced by the identity map id : C * (B a ; F) → C * (B a ; F).Thus, δ is an isomorphism and the result follows.
Decomposing: A small generalisation of the doubling idea gives a very useful recursive procedure for computing cellular homology.We will use it for example in §4.2 in the computation of H * (L \ 0; Λ • F).Let F be a sheaf for which there is an atom a ∈ A such that for all x ∈ B a the structure map is injective.We will call such a sheaf decomposable.
Let F a denote the restriction of F to B a and F a the restriction to B a .Since B a = B a we may also equip B a with the sheaf F a : for x ∈ B a set F a (x) = F(x ∨ a) and for x ≤ y define which is injective by condition (7), and we will denote the quotient sheaf by F a /F a .
Theorem 5. Let B be Boolean and F a decomposable sheaf on B. Then Proof.There is a short exact sequence of sheaves on B: The structure maps between the elements of B a and B a in the leftmost sheaf G are all the identity; the middle sheaf is just F; the rightmost sheaf is trivial on B a and the quotient sheaf F a /F a on B a .By (5) we have a short exact sequence of cellular chain complexes with resulting long exact sequence: • after identifying the cellular homology of the rightmost sheaf with H cell i (B a ; F a /F a ).But (B; G) is a double (6), and so the result follows from Proposition 5.

The deletion-restriction long exact sequence
Let L be a geometric lattice and let f : L → L be its Boolean cover.We will write B = L.If a is an atom of L then the Boolean cover L a of the deletion L a can be identified with the sub-Boolean B a of L. Under this identification F a on L a is the restriction of F (on B) to B a .Consequently, we just write F for the sheaf on L a induced by a sheaf F on L, and The Boolean cover L a of the restriction L a is not, however, the sub-Boolean B a of B: the rank of the cover is in general less than that of the sub-Boolean.Nevertheless, they have the same cellular homology.If L a → L a is the Boolean cover of the restriction we also just write F for the sheaf induced on L a by the restriction of F to L a .Theorem 6.Let L, L and a ∈ L be as above.Then, for all i, Proof.Write B = B a = ( L) a .Let A be the set of atoms of L and let A a = A \ {a} be the atoms of L a .The set of atoms of the restriction L a is A a = {b ∨ L a : b ∈ A a }.The atoms of the sub-Boolean B are the elements b ∨ B a where b ∈ A a .Note that these are all distinct.
If the elements b ∨ L a for b ∈ A a are all are distinct (in L itself), then the Boolean cover L a is precisely the sub-Boolean B, and the result follows.
Otherwise, there exist distinct atoms s = a ∨ B b and s = a ∨ B b of B that are mapped by f to the same atom a ∨ L b = a ∨ L b of L a .As usual let B s and B s denote the deletion and restriction of B with respect to the atom s.We claim that, for all i, To prove this we will show that . This is an atom of B s and we may consider the deletion (B s ) α and the restriction (B s ) α .Note that α and s are mapped by f to the same element of L a : Let y ∈ (B s ) α .There is a corresponding element y = y ∨ B α in (B s ) α .We may write y = x ∨ B s for some x ∈ B s and since s Applying f , while recaling that f α = f s, gives It follows from the definition of the induced sheaf on the Boolean cover that the map F y y is the identity.This shows that B s is a double with respect to the atom α.
To finish the proof of (9), we use Proposition 5 and the long exact sequence resulting from 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, giving the required result.
The previous result allows us to relate the cellular homology of the Boolean cover of a lattice with the homology of the Boolean covers of the restriction and deletion.
Theorem 7 (Deletion-Restriction Long Exact Sequence).Let L be a geometric lattice equipped with a sheaf F and let f : L → L be its Boolean cover.Then for any atom a ∈ L there is a long exact sequence

Sheaves on hyperplane arrangements
We return to the arrangement lattices of §1.1, the natural sheaf and its exterior powers from §1.2.In §4.1 we discuss graded Euler characteristics and their computation in terms of characteristic polynomials.§4.2 gives a complete calculation of the homology of an essential hyperplane arrangement with coefficients in the exterior natural sheaf.§4.3 extends this to the non-essential case.
Throughout, V is a finite dimensional vector space over a field k (initially arbitrary, then restricted to a subfield of C in §4.3);A is an arrangement in V and L = L(A) is the intersection lattice; F is the natural sheaf associated to A.

Graded Euler characteristics
For F the natural sheaf on the arrangement lattice L we have the exterior sheaf Λ • F. The graded Euler characteristic of the cellular homology of L with coefficients in Λ • F turns out to be very close to the characteristic polynomial of the arrangement lattice L. Proposition 6.The graded Euler chracteristic χ q H cell * ( L; Λ • F) = χ L (1 + q).Proof.This is a straight-forward calculation (recalling that dim F(x) = dim x): where we have used Corollary 4 at the second equality.
From this, another application of Corollary 4 gives the graded Euler characteristic for the sheaf homology:

The exterior sheaf on an essential arrangement
We focus first on essential arrangements -those for which the intersection of all hyperplanes is trivial.
Theorem 8. Let L be the intersection lattice of an essential hyperplane arrangement in a space V, let F be the natural sheaf on L and Λ j F be the j-th exterior power of F. If rk(L) ≥ 2 and L → L is the Boolean cover of L, then H cell i ( L; Λ j F) is trivial unless 0 ≤ i < rk(L) and i + j = rk(L) = dim V, in which case: where χ  The proof of Theorem 8 when L itself is Boolean.We prove the result where L itself is Boolean (and hence L = L) separately from the general case.The characteristic polynomial is given by and we require: Proposition 7. Let L be a Boolean intersection lattice of an essential hyperplane arrangement in a space V, let F be the natural sheaf on L and Λ j F be the j-th exterior power of F. If rk(L) ≥ 1 then 1 if i = 0 and j = rk(L) 0 else.
Proof.The proof is an induction on the rank of L. The case where rk(L) = 1 (and so we have a single hyperplane the trivial space in a 1-dimensional V) can be verified by brute force.Otherwise, for rk(L) ≥ 2, there is a basis Z = {v 1 , . . ., v n } for V such that L is the lattice of subsets of Z ordered via reverse inclusion, with the subset corresponding to x ∈ L giving a basis for F(x).If a ∈ A is a hyperplane with basis {v 1 , . . ., vi , . . ., v n }, then for x ∈ L a the space F(x ∨ a) has basis some subset {u 1 , . . ., u m } of Z \ {v i } and F(x) has basis {v i , u 1 , . . ., u m }.
A basis vector u i 1 ∧ • • • ∧ u i j of Λ j F(x) may or may not contain the element v i , leading to a decomposition Writing G = Λ j F for j ≥ 1 (and similarly G a and G a ) the structure maps are the obvious inclusions, so G is decomposable in the sense of §3.5.Moreover, the isomorphism (10) leads to an isomorphism of sheaves (some care is needed in checking what happens when j is close to dim x, as some of the spaces become 0).Theorem 5 thus gives with F a the natural sheaf of the essential arrangement A a on L a L a (both are Boolean of one smaller rank than L).Hence, by induction dim Suppose now that L is not Boolean.We argue by induction on the number |A| of hyperplanes.Throughout, if j > rk(L) = dim V then the sheaf Λ j F = 0; we thus need only consider j in the range 0 ≤ j ≤ rk(L) = dim V.When |A| = 1 or 2, the intersection lattice L(A) is Boolean of rank |A|, and so these cases have been handled already.
The base case |A| = 3.We saw in §1.1 that the only non-Boolean L on three hyperplanes is realised by a braid arrangement, and with L isomorphic to the partition lattice Π(3).When essential, the arrangement lives in a 2-dimensional V with basis {v 1 , v 2 } and consists of the lines spanned by v 1 , v 2 and −v 1 − v 2 .
The characteristic polynomial (see [Sta12,§3.10.4]) is χ L (t) = (t − 1)(t − 2) and Theorem 8 states: 1 if i = 0 0 else.To prove this, each case is treated separately.For j = 0 the sheaf is constant Λ 0 F = ∆k and so the induced sheaf on the Boolean cover is also constant and by applying Theorem 5 we have For j = 1, we have the natural sheaf and the induced sheaf on the Boolean cover L has constant value F(1) on all the elements of ranks 2 and 3. Two applications of Theorem 5 give the required result.For j = 2, the sheaf Λ 2 F is trivial except at 0 ∈ L where it is 1-dimensional with basis v 1 ∧ v 2 , once again in happy agreement with Theorem 8.
The vanishing degrees in the general case |A| > 3. We may assume that L is non-Boolean and so, by the results of §1.1, it has a dependent atom a ∈ A.
The deletion L a is then an essential arrangement lattice having |A| − 1 hyperplanes and rk(L a ) = rk(L), by the dependence of a.The sheaf F a , which is just F restricted to L a , is the natural sheaf of this arrangement, and the restriction of Λ j F to L a is just Λ j F a .The restriction L a is an essential arrangement lattice having at most |A| − 1 hyperplanes and rk(L a ) = rk(L) − 1.The sheaf F a is the natural sheaf of this arrangement and Λ j F a is the restriction of Λ j F to L a .

The exterior sheaf for a non-essential arrangement
In this section we assume our field to be a sub-field of C and so we may assume that the vector space V comes equipped with an inner product −, − .Let L be the intersection lattice of a hyperplane arrangement in a space V with U = a∈A a.Let F be the natural sheaf on L.
For a subspace B ⊂ V such that U ⊂ B ⊂ V we define the orthogonal complement of U in B to be U ⊥B = {b ∈ B | b, u = 0, for all u ∈ U}.
Note that U ⊥B is a subspace of B and B = U ⊕ U ⊥B .(This last condition may fail in finite characteristic.)Moreover, if U ⊂ B ⊂ B ⊂ V, there is an inclusion ι : U ⊥B ⊂ U ⊥B and with respect to the decompositions B = U ⊕U ⊥B and B = U ⊕U ⊥B the inclusion B ⊂ B decomposes as 1 ⊕ ι.
We define a sheaf F ⊥ on L as follows.For x ∈ L we set F ⊥ (x) = U ⊥F(x) .If x ≤ y then the structure map F ⊥ (x ≤ y) is the inclusion F ⊥ (y) = U ⊥F(y) ⊂ U ⊥F(x) = F ⊥ (x) induced by the inclusion F(y) ⊂ F(x).
We have: Lemma 2. There is a direct sum decomposition of sheaves F = ∆U ⊕ F ⊥ .
By definition F ⊥ is a sub-sheaf of F on L, but it is also the natural sheaf of an essential hyperplane arrangement in U ⊥V .There is one hyperplane U ⊥H for each hyperplane H of the original arrangement and courtesy of the relation U ⊥(B∩C) = U ⊥B ∩ U ⊥C we see that the lattice of this new arrangement is again L. The natural sheaf on the new arrangement is precisely F ⊥ , seen immediately from the definition of F ⊥ .We refer to F ⊥ as the essentialisation of F.
We will continue to write χ L (t) for the characteristic polynomial of L equipped with the natural sheaf F, that is to say, χ L (t) = µ L (0, x)t dim x .Writing χ (L,F ⊥ ) (t) for the characteristic polynomial of the essentialisation we easily see χ L (t) = t dim U χ (L,F ⊥ ) (t).
Let Λ j F be the j-th exterior power of F (the natural sheaf).Theorem 10 below gives the cellular homology H cell i ( L; Λ j F) and the support in the (i, j)-plane is illustrated in Figure 5.
Theorem 10.Let L be the intersection lattice of a hyperplane arrangement in a space V with U = a∈A a.Let F be the natural sheaf on L and Λ j F be the j-th exterior power of F. If rk(L) ≥ 2 and L → L is the Boolean cover of L, then H cell i ( L; Λ j F) is trivial unless 0 ≤ i < rk(L) and rk(L) ≤ i + j ≤ dim V, in which case: χ (rk(L)−i) (L,F ⊥ ) (1).
with χ (k) (L,F ⊥ ) (t) the k-th derivative of the characteristic polynomial of the essentialisation of L.
Proof.The decomposition F = ∆U ⊕ F ⊥ allows us to write i+ j=dim V i+ j=rk(L) Fig. 5. Support of H cell i ( L; Λ j F) in the (i, j)-plane, with the dimension of the red square given by Theorem 10.
Applying, Corollary 3 gives Recalling that we are working in characteristic zero, the universal coefficient theorem tells us that H cell * ( L; ∆Λ s U ⊗ Λ t F ⊥ ) Λ s U ⊗ H cell * ( L; Λ t F ⊥ ) and we have dim The dimension on the right can be computed from Theorem 8 because F ⊥ is essential: we have that dim H cell i ( L; Λ t F ⊥ ) = 0 unless t = rk(L) − i, in which case dim(H cell i ( L; Λ rk(L)−i F ⊥ ) = (−1) i (rk(L) − i)! χ (rk(L)−i) (L,F ⊥ ) (1).
Since s + t = j we have s = i + j − rk(L) which means given i, j the values of s and t must be taken to be t = rk(L) − i and s = i + j − rk(L) and so we get dim What remains is to find the values of i and j for which this computation is valid.The conditions are (i) 0 ≤ i < rk(L) (in order to be able to apply Theorem 8), (ii) s ≤ dim U (otherwise Λ s U is trivial) and (iii) t ≤ j (since s + t = j in the sum above).Condition (i) is seen in the statement of the theorem; since dim U = dim V − rk(L), condition (ii) implies i + j ≤ dim V; condition (iii) implies rk(L) ≤ i + j.So conditions (ii) and (iii) together give the other condition in the statement of the theorem, namely rk(L) ≤ i + j ≤ dim V.

Fig. 2 .
Fig. 2. The decomposition of L into the deletion L a and restriction L a for a dependent atom a.
the direct sum over the subsets y of size k + 1 such that y x.Define d : C k → C k−1 as before: d = w<y d y w which is again a Boolean lattice.The sequence induced by a short exact sequence of sheaves.Let F and G be sheaves on the Boolean B = B(A) and κ = {κ y } : G → F a map of sheaves.Then there is an induced map κ * : C * (B; G) → C * (B; F) defined by κ * : s y → κ y (s y ) where s y ∈ C k (B; G) has value s ∈ F(y) in the coordinate indexed by the k-subset y, and value 0 elsewhere.Then κ * is a chain map and moreover, the cellular chain complex C * (B; -) is an exact functor from the category of sheaves on B to the category of chain complexes.Thus, a short exact sequence of sheaves 0 → G → F → H → 0 induces a short exact sequence of cellular complexes 0 → C * (B; G) → C * (B; F) → C * (B; H) → 0. (5) Corollary 3. Let F and G be sheaves on the Boolean lattice B. Then, H cell * (B; F ⊕ G) H cell * (B; F) ⊕ H cell * (B; G) 3.4.Fiddling with 0
are the atoms of L then we can use the short exact sequence (4), induced by a sub-Boolean with x = A \ {a}, to get a short exact sequence0 → C * (B a ; F) → C * ( L; F) → C * −1 (B a ; F) → 0where, as above, B = L.The result follows by applying Theorem 6 and (8) to the resulting long exact sequence.

L
(t) is the j-th derivative of the characteristic polynomial of L. The support of H cell i ( L; Λ j F) is shown in Figure4.The remainder of the section is devoted to the proof of Theorem 8, which is broken down into several subparts:

Fig. 4 .
Fig.4.Support of H cell i ( L; Λ j F) for L essential in the (i, j)-plane, with the dimension of the red square given in Theorem 8.