##
Gale and Koszul duality, together at last *July 14, 2008*

*Posted by Ben Webster in category O, combinatorics, hyperplanes, mathematical physics, papers, the arXiv.*

trackback

trackback

So, in past posts, I’ve attempted to explain a bit about Gale duality and about Koszul duality, so now I feel like I should try to explain what they have to do with each other, since I (and some other people) just posted a preprint called “Gale duality and Koszul duality” to the arXiv.

The short version is this: we describe a way of getting a category (or equivalently, an algebra) from a linear program (or as we call it, a polarized hyperplane arrangement).

Before describing the construction of this category, let me tell you some of the properties that make it appealing.

**Theorem.** * is **Koszul **(that is, it can be given a grading for which the induced grading on the Ext-algebra of the simples matches the homological grading). *

In fact, this category satisfies a somewhat stronger property: it is standard Koszul (as defined by Ágoston, Dlab^{ }and Lukács. Those of you with Springer access can get the paper here). In short, the category has a special set of objects called “standard modules” (which you should think of as analogous to Verma modules) which make it a “highest weight category,” such that these modules are sent by Koszul duality to a set of standards for the Koszul dual.

Of course, whenever confronted with a Koszul category, we immediately ask ourselves what its Koszul dual is. In our case, there is a rather nice answer.

**Theorem.** *The Koszul dual to is , the category associated to the Gale dual of .*

Now, part of the data of a linear program is an “objective function” (which we’ll denote by ) and of bounds for the contraints (which will be encoded by a vector ). Stripping these way, we end up with a vector arrangement, simply a choice of a set of vectors in a vector space, which will specify the constraints.

**Theorem.** *If two linear programs have same underlying vector arrangment, the categories may not be equivalent, but they will be* derived *equivalent, that is, their bounded derived categories will be equivalent.*

Interestingly, these equivalences are far from being canonical. In the course of their construction, one actually obtains a large group of auto-equivalences acting on the derived category of , which we conjecture to include the fundamental group of the space of generic choices of objective function.

While we hope to present some more motivated definitions in the future, let’s start with an explicit presentation of our algebra, just so we can see it’s nothing scary.

Remember that a linear program consists of a real vector space , a collection of n linear functions , and a choice a pair of vectors .

The dual of a program replaces with its perpendicular under dot product in , and .

We consider a sign vectors . We let and .

We call **bounded **if for each , we have .

We call **feasible **if the set is non-empty.

As we discussed, the duality theorem for linear programming implies that a sign vector is feasible for one program if and only if it is bounded for the dual. In particular, the set of sign vectors which are bounded and feasible for and for coincide. We will call this set , and it will index the simple modules of our algebra.

Now, consider the quiver whose vertices are the set of feasible sign vectors for , with an edge connecting any two vectors which differ in a single place. More visually, one can think of the vertices as attached to the chambers , and the edges as connecting chambers adjacent across a single hyperplane. We consider the path algebra of this quiver tensored with the algebra of polynomial functions on , . Let be the “lazy path” of length 0, which stays at , and if and are feasible sign vectors which only differ in the *i*th place is the path of length of two which begins at , changes the *i*th coordinate (i.e. crosses the *i*th hyperplane) to and goes back to . The algebra of interest to us, which we will denote , is a finite dimensional quotient of this path algebra, by the relations

- any two paths from to of minimal length (i.e. one where the length is the same as the number of coordinates where the vectors differ) are equal.
- for each and each hyperplane adjacent to , we have , where is considered as an polynomial on .
- for each unbounded , we have , i.e. any path passing through that vertex is 0.

The reader may wonder why we included the infeasible vertices at all, if we were going to just declare them to be 0; the answer is that we want relations of the first two types involving unbounded vertices. Similarly, the inclusion of the factor of is unnecessary as long as the generate this algebra, but it simplifies the writing of the second type of relations.

The category is, by definition, the category of finite-dimensional representations of .

By doing some clever combinatorics, one can prove that for Gale dual arrangements, these algebras are quadratic dual, and thus once one proves they are Koszul, they’ll be known to be Koszul dual.

Proving that these algebras are Koszul, and proving the derived equivalences is a slightly longer story, which I don’t think there’s time for that in a blog post. You can read all about it in the paper.

Next time, I’ll try to show how these categories actually come from geometry. While the paper linked above uses relatively little geometry, hypertoric varieties were in the forefront of our minds the whole time we were writing this paper, and they make it clear why anyone would ever have written down these algebras.

## Comments

Sorry comments are closed for this entry

Ben, I’m confused. You write:

“[C]onsider the quiver whose vertices are the set of feasible sign vectors for ,”

but later you say

“for each infeasible , we have .”

I am guessing that, in the second clause, you want to say unbounded, not infeasible?

Uh, yes, that’s right. Good catch. Fixed.