Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-27
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Split Grothendieck rings of the type-A Soergel categories

Definition

Setting. Fix n≥2 and the two graded additive monoidal categories of this page: the type-A Soergel category SBimn, the idempotent completion of the category of Bott–Samelson bimodules (The type-A Soergel category SBimn), and the Karoubi envelope Kar⁡(D) of the type-A diagrammatic category D (The type-A diagrammatic Soergel category and its candidate bimodule functor). Both are graded: an object X has a shift X(1)=X{−1}, and both are monoidal with unit the one-object bimodule R respectively the empty word. Both are additive in the sense of Additive category.

The split Grothendieck group. For such a category C choose a small skeleton, that is, a set sk⁡(C) of representative objects meeting every isomorphism class exactly once — for SBimn one may take the graded direct summands of finite direct sums of shifts of Bott–Samelson bimodules with a fixed underlying set of words, and for Kar⁡(D) the idempotents in finite direct sums of shifts of words, so that the representatives form a set rather than a proper class. Define K0split(C):=(⨁X∈sk⁡(C)Z[X])/ ⟨[X]−[X′]−[X′′] : X≅X′⊕X′′ in C⟩, the free abelian group on the isomorphism classes of representative objects modulo the relations [X]=[X′]+[X′′] whenever X is isomorphic to a direct sum of X′ and X′′.

Ring structure. For representatives X,Y the tensor product X⊗Y is again an object of C, whose isomorphism class is represented by a unique element of the skeleton; the assignment (X,Y)↦X⊗Y is additive in each variable up to isomorphism, so [X][Y]:=[X⊗Y] descends to a well-defined bilinear product on K0split(C), with the unit 1:=[1] the class of the monoidal unit R (respectively the empty word). Associativity and unitality of the tensor product make K0split(C) a ring; it is not commutative in general, and K0split(SBimn) is not commutative for n≥3, since the classes of two adjacent one-color products do not commute. The grading shift is an additive autoequivalence commuting with the tensor product, so setting v[X]:=[X(1)]=[X{−1}] equips K0split(C) with the structure of a Z[v,v−1]-algebra, with v−1[X]=[X(−1)]=[X{1}].

The two charts. For the bimodule category the classes are those of the Bott–Samelson products, [Bi1⊗R⋯⊗RBir], and for every object X the shift rule is [X{k}]=v−k[X]; for the diagrammatic category the class of a word is [Bi‾], with the same shift rule. The standard bimodules Rx, Δx(d) and ∇x(d) with x≠e are not objects of SBimn — they occur only as the successive quotients of the support flags of its objects — so this definition attaches no object class to them; the Hecke algebra's basis elements indexed by x are written Tx,T~x,Hx, as in The type-A Hecke algebra in Soergel normalization. Under the dictionary of The type-A diagrammatic Soergel category and its candidate bimodule functor the two rings are compared by sending [Bi‾] to [Bi1⊗R⋯⊗RBir]; the comparison is an isomorphism only after the equivalence of the two categories is proved later on this page.

Remark

(a) Local scope. This definition supplies only the split rings of the two categories used on this page, on explicitly chosen small skeletons; it makes no claim about general Grothendieck groups, Cartan pairings, or the Grothendieck groups of arbitrary additive or abelian categories, which belong to the general homological-algebra track. The only group-theoretic input is that a set of representatives exists, and the only ring-theoretic input is bifunctoriality and additivity of ⊗, both of which hold for the two categories named here.

(b) The relation with the internal shift. In the library convention M{r}d=Md−r the internal shift by r moves every generator degree up by r, so [X{r}]=v−r[X]: the element v of the Laurent ring is the class of the shift that lowers degrees, which is the Elias–Williamson shift (1) and the shift appearing in Bi=R⊗RsiR(1). The one-color square Bi⊗RBi≅Bi(1)⊕Bi(−1) of The rank-one Soergel bimodule square splits therefore reads [Bi]2=(v+v−1)[Bi].

(c) Products of generators. The product rule gives [Bi‾]=[Bi1]⋯[Bir], and for ∣i−j∣>1 the interchange isomorphism of Distant Soergel generators commute gives [Bi][Bj]=[Bj][Bi] in K0split. No generation statement is made here: the skeleton of SBimn also contains idempotent summands of words, and in a split Grothendieck ring the defining relations give only [X]=[Y]−[Z] for Y≅X⊕Z, so the class of such a summand is not in general determined by the classes of the ambient words. Generation by the classes of the Bi together with v±1 is therefore established later on this page, from the character isomorphism, and is not an input to it.

(d) Small and empty cases. For n≤1 there are no simple reflections, so the only word is the empty one and every object of SBimn is a finite direct sum of shifts of the unit R, whence K0split=Z[v,v−1]⋅[R]; for n=2 the only words are powers of s1, the one-color square exhibits each B1⊗k with k≥1 as a finite direct sum of shifts of B1, and [R] is the unit. In every case the empty-direct-sum relation [0]=0 is the case X≅X⊕0 of the defining relations, and no choice principle is used: each skeleton is a set of concrete objects, and Z[X] is the free group on that set.

Depends on

Used by

Dependency tree · two levels

17 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources