---
title: Asymptotic Hecke Category
url: https://www.emergentmind.com/topics/asymptotic-hecke-category
type: topic
---

# Asymptotic Hecke Category

The asymptotic Hecke category is the cellwise monoidal truncation of the Hecke category associated with a two-sided Kazhdan–Lusztig cell. In Lusztig’s framework, it is designed so that its Grothendieck ring recovers the corresponding summand \(J_c\) of the asymptotic Hecke algebra, while its categorical center captures character-sheaf-type phenomena. In the Soergel-bimodule realization, this category is obtained by discarding lower two-sided cells and retaining only the \(a(c)\)-controlled leading piece of convolution; for finite cells it is a multifusion category, and in the Weyl-group case its center is identified with unipotent character sheaves supported on the same cell [2307.07276].

## 1. Cellwise truncation and basic construction

Let \(H_W\) be the equal-parameter Hecke algebra over \(A=\mathbb Z[v^{\pm1}]\) with Kazhdan–Lusztig basis \(\{b_w\}_{w\in W}\), and write
\[
b_xb_y=\sum_{z\in W} h_{x,y,z}\,b_z.
\]
The \(a\)-function is
\[
a(z)=\min\{n\mid v^n h_{x,y,z}\in \mathbb Z[v]\text{ for all }x,y\},
\]
and the leading coefficients
\[
\gamma_{x,y,z^{-1}}:=h_{x,y,z}v^{a(z)}(0)
\]
define the asymptotic Hecke algebra
\[
J=\bigoplus_{w\in W}\mathbb Z j_w,\qquad
j_xj_y=\sum_{z\in W}\gamma_{x,y,z^{-1}}\,j_z.
\]
For a two-sided cell \(c\), one has \(J=\bigoplus_c J_c\), where \(J_c\) is spanned by \(\{j_x\mid x\in c\}\) [2307.07276].

In the Hecke category \(\mathcal H_W\) of Soergel bimodules, the asymptotic Hecke category attached to a two-sided cell \(c\) of \(a\)-value \(i=a(c)\) is constructed by first quotienting by the tensor ideal \(\mathcal I^c\) generated by lower cells, then restricting to the full graded additive subcategory generated by indecomposables \(B_x\) with \(x\in c\), and finally defining the truncated monoidal product by
\[
B_x\star B_y:=H^{-i}(B_xB_y).
\]
This produces a monoidal category \(\mathcal H_W^c\) categorifying \(J_c\) [2307.07276].

A complementary computational formulation starts with a two-sided cell \(\mathcal J\) of Lusztig \(a\)-value \(a\). One first kills lower cells, then uses the fact that in \(B_xB_y\) only summands \(B_z(k)\) with \(-a\le k\le a\) can occur for \(x,y,z\in\mathcal J\), defines the new tensor product by taking the degree-\(a\) summand and shifting by \((-a)\), and finally restricts to degree-zero morphisms. The resulting category is semisimple monoidal and is again called the asymptotic Hecke category; its objects are denoted \(A_w\) when descended from \(B_w\) [2507.10061].

## 2. Decategorification, based rings, and geometric meaning

The decisive decategorification statement is
\[
K(\mathcal H_W^c)\cong J_c,\qquad [B_x]\mapsto j_x.
\]
For finite cells, \(\mathcal H_W^c\) is a multifusion category, and its unit is the direct sum over the Duflo involutions in the cell,
\[
\mathds 1_{\mathcal H_W^c}=\bigoplus_{d\in D\cap c} B_d.
\]
Thus the asymptotic Hecke category is not an auxiliary enhancement of \(J_c\); it is its monoidal categorification in the precise sense encoded by the KL cell \(c\) [2307.07276].

A useful variant of notation writes the basis of \(J\) as \(\{t_w\}\) rather than \(\{j_w\}\). In the affine setting relevant to \(p\)-adic groups, \(J\) decomposes by two-sided cells, equivalently by unipotent conjugacy classes \(u\) of the dual group, and one has
\[
J_u \cong K_G(Y_u\times Y_u^{\mathrm{opp}})
\]
for a finite centrally extended \(G\)-set \(Y_u\), with convolution product on the \(K\)-theory side. This furnishes a geometric shadow of the asymptotic category: each cell summand of the asymptotic algebra appears as the Grothendieck ring of a convolution-theoretic category of equivariant coherent sheaves [2312.11092].

This relationship clarifies the role of the asymptotic Hecke category within Hecke-theoretic categorification. The ordinary Hecke category categorifies the full Hecke algebra, whereas the asymptotic Hecke category categorifies a cell summand of the leading-term algebra \(J\). A plausible implication is that cellwise truncation is the categorical mechanism that separates genuine asymptotic data from the unreduced monoidal structure.

## 3. Center, \(H\)-reduction, and character-sheaf interpretation

For a multifusion category \(\mathcal C\), the Drinfeld center \(\mathcal Z(\mathcal C)\) is the natural receptacle for character-sheaf-type structures. In the Weyl-group case, Lusztig showed geometrically that the center of the asymptotic Hecke category attached to a two-sided cell \(c\) is equivalent to the category \(U_G^c\) of unipotent character sheaves supported on that cell:
\[
U_G^c \simeq \mathcal Z(\mathcal H_G^c).
\]
This makes the center of the asymptotic Hecke category the categorical counterpart of unipotent character theory in the given cell [2307.07276].

A central structural simplification is \(H\)-reduction. If the unit of \(\mathcal H_W^c\) decomposes according to Duflo involutions, the component fusion categories are indexed by diagonal \(H\)-cells \(h=c_i^L\cap c_i^R\). Writing
\[
\mathcal H_W^h:=B_{d_i}\otimes \mathcal H_W^c\otimes B_{d_i},
\]
one has
\[
\mathcal Z(\mathcal H_W^h)\simeq \mathcal Z(\mathcal H_W^c).
\]
Thus the center of the full asymptotic Hecke category is already determined by any diagonal \(H\)-cell component. This reduction is the key technical device in explicit calculations of centers and modular data [2307.07276].

In finite Weyl-group situations, non-exceptional cells admit tensor equivalences
\[
\mathcal H_W^c \simeq \operatorname{Coh}_{G_c}(X_c\times X_c),
\]
and then \(H\)-reduction identifies the center with a finite-group-theoretic modular category. For exceptional cells in \(E_7\) and \(E_8\), the asymptotic category instead takes the form
\[
\operatorname{Vec}^\omega(\mathbb Z/2\mathbb Z)\boxtimes \operatorname{Coh}(Y'\times Y').
\]
These descriptions explain why Fourier matrices of Lusztig–Malle–Broué type can appear as normalized \(S\)-matrices of centers [2307.07276].

The non-crystallographic case makes this especially explicit. For dihedral groups, the asymptotic Hecke category of the middle cell is reduced to
\[
\mathcal H_W^h \simeq \mathrm{Ad}(\mathcal C_n),
\]
where \(\mathcal C_n\) is the type \(A_n\) Verlinde category, and the resulting \(S\)-matrices agree with Lusztig’s dihedral Fourier matrices. In \(H_3\) and \(H_4\), many cells are similarly identified with small known fusion categories such as \(\mathrm{Vec}\), Fibonacci-type categories, or \(\mathrm{Vec}^\omega(\mathbb Z/2)\), but the \(H_4\) cell of \(a\)-value \(6\) remains unresolved; if the conjectural picture is correct, its center should have \(74\) simple objects [2307.07276].

## 4. Idempotents, top \(a\)-degree summands, and categorical dimensions

The asymptotic tensor product is defined by extracting the top \(a\)-degree contribution inside ordinary Hecke-category tensor products. The subtle point is that this degree-\(a\) submodule is canonically a subobject but not canonically a direct summand. The computational program therefore hinges on constructing explicit projections onto these top summands, using the relative Hodge theory of Elias–Williamson and multiplication by \(\rho^a\) [2507.10061].

This leads to a detailed idempotent technology. For a reduced expression \(\underline w\), the Bott–Samelson object \(B_{\underline w}\) contains the indecomposable \(B_w\) as its top summand. A top idempotent is a primitive idempotent with image \(B_w\), and a clasp idempotent is a top idempotent satisfying orthogonality to lower terms. The coefficients appearing in recursive formulas for these idempotents are inverses of local intersection forms. For recursible triples \((x,i,y,j)\), these local intersection forms satisfy a recursion involving Demazure operators and admit closed expressions in terms of two-colored quantum numbers [2507.10061].

The same machinery computes categorical dimensions in asymptotic Hecke categories. For a diagonal \(H\)-cell \(\mathcal H\subset \mathcal J\) with Duflo involution \(d\), one defines scalars \(\mu_x\) and \(\lambda_x\) from compositions of the form
\[
D(\incl)\circ M_{\rho^a}\circ \incl
\]
modulo lower cells, and then
\[
\dim(A_x)=\mu_x/\lambda_x.
\]
If \(x\) is weak-right-above \(d\), \(\mu_x\) reduces to a partial trace computation, and for parabolic cells one has the further simplification
\[
\lambda_d(f)=\partial_d(f),
\]
so dimensions become computable via Demazure operators applied to explicit partial traces [2507.10061].

These formulas are not merely local numerics. For finite Coxeter groups, asymptotic Hecke categories classify simple transitive \(2\)-representations of the Hecke category, and categorical \(H\)-reduction always holds: the category attached to a diagonal \(H\)-cell is \(2\)-Morita equivalent to the category attached to the full two-sided cell. The computational technology of idempotents, local intersection forms, and partial traces is therefore a structural tool for identifying the monoidal categories themselves, not only their decategorifications [2507.10061].

## 5. Extensions, analogues, and broader frameworks

A direct generalization beyond Coxeter groups appears for the complex reflection groups \(G(M,M,N)\). There the proposed asymptotic category is denoted \(a_M^N\). It is defined as a monoidal additive \(\mathbb C\)-linear matrix category built from the root-of-unity \(\mathfrak{sl}_N\) fusion category \(Rep^\circ\): its indecomposable objects are matrices \((X_{ij})\) with \(X_{ij}\) simple in \(Rep^\circ\) of color \(i-j\in \mathbb Z/N\mathbb Z\), morphisms are entrywise, and tensor product is matrix multiplication. Its rank is
\[
\mathrm{rk}\,a_M^N = N\binom{M-1}{N-1},
\]
and its center is modular, with \(S\)- and \(T\)-matrices related to Malle’s Fourier matrices for \(G(M,M,N)\). A larger Morita equivalent category \(A_M^N\) is also constructed, and its Grothendieck ring is identified with the asymptotic algebra of a Calogero–Moser cell [2409.01005].

This complex-reflection-group construction is not a literal Soergel-cell quotient. It is instead a matrix-category analogue whose degree-zero behavior plays the role of a cellwise asymptotic truncation. That difference is substantive: the classical asymptotic Hecke category is cell-theoretic inside a Coxeter Hecke category, whereas the \(G(M,M,N)\) version is an analogue built from \(\mathfrak{sl}_N\) fusion data. Still, the persistence of KL-type bases, cells, modular centers, and Fourier matrices indicates that the asymptotic-Hecke pattern extends beyond Weyl and Coxeter groups [2409.01005].

Two further structural directions are suggestive. First, the affine Hecke category can be reconstructed as a monoidal colimit of finite-type parahoric Hecke subcategories,
\[
D(I\backslash LG/I)\simeq \operatorname*{colim}_{J\subset I,\ J\ \mathrm{finite\ type}} D(I\backslash P_J/I),
\]
in the \(\infty\)-category of monoidal DG categories. This suggests that an affine asymptotic Hecke category, if formulated by cellwise or asymptotic truncation, may be approachable through compatible finite-type approximations [2009.10998].

Second, monodromic Hecke categories now admit algebraic, diagrammatic, and parity-sheaf categorifications of a monodromic Hecke algebroid, together with object-adapted cellular structures, lower-term ideals, and endoscopic reduction to ordinary Hecke categories of endoscopic Coxeter groups. This suggests a route to monodromic asymptotic Hecke categories by reducing blockwise to ordinary asymptotic categories and then regluing through endoscopic data [2604.15582].

## 6. Distinction from trace decategorification and related Hecke-categorical invariants

The asymptotic Hecke category should not be confused with the trace decategorification of the full Hecke category. For the diagrammatic Hecke category \(\mathcal D=\mathcal D(W,S,\mathfrak h)\), the trace is
\[
\operatorname{Tr}(\mathcal D)=\left(\bigoplus_X \operatorname{End}_{\mathcal D}(X)\right)\Big/\langle fg-gf\rangle,
\]
and one has
\[
\operatorname{Tr}(\mathcal D)\cong \mathbf H\otimes_\mathbb Z \Bbbk,
\qquad
\operatorname{Tr}(\mathcal D^*)\cong \mathbb Z[W]\ltimes R.
\]
Thus the trace of the full Hecke category recovers the ordinary Hecke algebra, or in the all-degree version a crossed product with the polynomial ring, but not Lusztig’s asymptotic algebra \(J\) and not a cellwise asymptotic quotient [1504.05267].

This distinction matters conceptually. The word “cell” in the theory of strictly object-adapted cellular categories refers to cellular bases and factorization through distinguished objects; it is not the same notion as Kazhdan–Lusztig left, right, or two-sided cells. In particular, the trace computation for the full Hecke category is controlled by cellular factorization and identities of indecomposables, whereas the asymptotic Hecke category is controlled by two-sided-cell truncation and the top \(a\)-degree part of tensor products [1504.05267].

A plausible conclusion is that asymptotic information is not an automatic decategorified invariant of the full Hecke category. It emerges only after imposing cellwise structure—by quotienting lower cells, extracting the top \(a\)-degree piece, and passing to the monoidal category supported on a fixed two-sided cell. In that sense, the asymptotic Hecke category is not another decategorification of the Hecke category; it is a cell-localized recategorification of Lusztig’s leading-term algebra.

Source: https://www.emergentmind.com/topics/asymptotic-hecke-category