Gabber–Joseph Conjecture: Ext Groups and R-Polynomials
- Gabber–Joseph Conjecture is a relationship in representation theory that equates Ext group dimensions between Verma modules in category O with coefficients of Kazhdan–Lusztig R-polynomials.
- It utilizes homological and geometric methods, including mixed Hodge theory and Bruhat graph combinatorics, to probe the structure of complex semisimple Lie algebras.
- Recent refinements confirm equality in second-highest Ext groups despite counterexamples at higher degrees, influencing categorical equivalences in representation theory.
The Gabber–Joseph Conjecture concerns the extension groups between Verma modules in the Bernstein–Gelfand–Gelfand (BGG) category associated to a complex semisimple Lie algebra, and asserts a precise relationship between the dimensions of these Ext groups and the coefficients of Kazhdan–Lusztig -polynomials. Initially stated as a broad equivalence, the conjecture was partially disproved, but key cases and refined forms continue to play a central role in the intersection of representation theory, algebraic geometry, and the combinatorics of Coxeter groups.
1. Formulation of the Gabber–Joseph Conjecture
For a complex semisimple Lie algebra with Borel subalgebra and Weyl group , the category contains Verma modules of highest weight , where and is a fixed integral dominant weight. For each , the relevant objects of study are the extension groups
for . The conjecture posited that these dimensions are given by the coefficients of Kazhdan–Lusztig -polynomials: where is the Kazhdan–Lusztig -polynomial and indicates the coefficient of (Abe, 2010).
A precise statement involves the length in and a grading shift:
2. Structural Background: Verma Modules and Kazhdan–Lusztig Polynomials
Verma modules are highest-weight modules built from via induction from the Borel . Homomorphisms between Verma modules are non-trivial precisely when their weights correspond in the Bruhat order: iff .
Kazhdan–Lusztig -polynomials for in a Coxeter system are defined recursively: \begin{align*} R_{x,x}(q) &= 1, \quad R_{y,x}(q) = 0\ \text{if}\ y\not\le x,\ R_{y,xs}(q) &= \begin{cases} R_{ys,x}(q), & \ell(ys)<\ell(y),\ q\,R_{ys,x}(q)+(q-1)\,R_{y,x}(q), & \ell(ys)>\ell(y), \end{cases} \end{align*} where and (Abe, 2010).
3. Counterexamples and Quantitative Refinements
Brian Boe demonstrated that the Gabber–Joseph conjecture fails for higher Ext groups in types and . For example, in type with and (in standard Coxeter notation), the relevant -polynomial gives
so ; however, the actual computation yields
Thus, the conjectured equality fails at (Abe, 2010).
Despite the failure in full generality, substantial inequalities and partial matches are available. Abe established that for first extensions, one has
with equality when (the longest Weyl group element). Here, is the image of a geometric map between certain Ext spaces designed to measure "how far" the actual Ext-dimension is from the -polynomial coefficient.
4. The Second-Highest Case and Combinatorial Invariance
Recent progress resolves the so-called "second-highest" case of the conjecture, relating to the coefficient of in . Specifically (Barkley et al., 12 Jan 2026): where ranges over pairs in with .
Central to the proof is the combinatorial characterization of as the "diamond-generating number" in the Bruhat graph of the interval , a statistic shown to be invariant under poset isomorphisms of Bruhat intervals.
Geometric identification is achieved via mixed Hodge theory and the topology of open Richardson varieties ; specifically,
and via known isomorphisms,
so gives precisely the dimension of (Barkley et al., 12 Jan 2026).
This establishes that these "second-highest" Ext group dimensions are combinatorial invariants of the Bruhat interval, mirroring the analogous property for -polynomial coefficients.
5. Homological and Geometric Techniques
The validation of the second-highest case employs a two-tiered approach:
- Combinatorial: Expressing as the minimal size of a "diamond-generating" set in the Bruhat graph of . This uses recurrence relations and supporting chain arguments within Bruhat 4-cycles (diamonds).
- Geometric: Mapping the task to the cohomology of open Richardson varieties via mixed Hodge theory, specifically exploiting vanishing properties of certain Deligne-split pieces and leveraging the Gysin sequence.
These methodologies illustrate a deep interplay among category homological algebra, Coxeter group combinatorics, and the geometry of Schubert and Richardson varieties (Barkley et al., 12 Jan 2026).
6. Representation-Theoretic and Categorical Consequences
The combinatorial invariance of imposes significant constraints on possible equivalences of blocks in category , since any equivalence must preserve the Bruhat interval structure and hence these Ext dimensions. Additionally, the result relates to invariance properties of Kazhdan–Lusztig -polynomial coefficients, extending reach beyond just Ext calculations (Barkley et al., 12 Jan 2026).
Geometrically, the first Betti number of open Richardson varieties, counted as generators of , is determined purely by the combinatorial structure of the Bruhat poset interval, illustrating the rigidity imposed by the conjecture in this dimensional regime.
7. Broader Context, Open Problems, and Related Conjectures
The Gabber–Joseph conjecture evokes a broad array of techniques and questions at the interface of representation theory, algebraic geometry, and combinatorics. Specific topics of ongoing investigation include:
- The precise behavior and combinatorial invariance of higher Ext groups and corresponding -polynomial coefficients beyond the second-highest case.
- Extensions to other settings such as singular blocks, different types of algebraic groups, or alternative highest weight categories.
- Analogous conjectures for class and Picard groups in singularity theory, where similar purity and torsion-freeness results (see Gabber’s conjecture for Picard groups) have deep implications for non-commutative and commutative resolutions (Dao, 2010).
Partial cases, such as Abe’s verification for first extensions under regularity assumptions and combinatorial characterizations for specific small Bruhat intervals, mark substantial progress, but a full generalization remains open except in the aforementioned special cases.
Summary Table: Status of the Gabber–Joseph Conjecture by Degree
| Ext Degree | Status | Key Reference |
|---|---|---|
| (Hom) | Always matches -polynomial | (Abe, 2010) |
| Match holds for regular weight, ; in general | (Abe, 2010, Carlin, 2015) | |
| (second-highest) | Proven equality, combinatorial invariant | (Barkley et al., 12 Jan 2026) |
| general | Counterexamples exist; no general equality | (Abe, 2010) |
The Gabber–Joseph conjecture, while refuted in its original breadth, continues to inform the ongoing dialogue between algebraic, combinatorial, and geometric representation theory, both via its failures and its precise successes.