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.

The type-A diagrammatic Soergel category and its candidate bimodule functor

Definition

Soergel graphs. Fix n≥2 and the type-A realization of The standard type-A reflection realization and its polynomial ring, so the colors are the simple reflections s1,…,sn−1, with mst=3 for ∣s−t∣=1 and mst=2 for ∣s−t∣>1. A Soergel graph is an isotopy class of decorated graphs embedded in the planar strip R×[0,1], as in Elias–Williamson, Definition 5.1: edges are colored by simple reflections and may meet the bottom boundary R×{0} and the top boundary R×{1} in colored boundary points; the decorations are boxes labelled by homogeneous elements f∈R, and the vertices are of three types, with the degrees of Elias–Williamson, Definition 5.1:

  1. univalent vertices (dots), degree +1;
  2. trivalent vertices, all three adjoining edges of one color, degree −1;
  3. 2mst-valent vertices, the adjoining edges alternating between two colors s≠t with mst<∞, degree 0; in type A this is a 4-valent vertex when ∣s−t∣>1 and a 6-valent vertex when ∣s−t∣=1.

The degree of a graph is the sum of the degrees of its vertices and boxes; a graph with bottom boundary (i1,…,ir) and top boundary (j1,…,js) has boundary dots of those colors and is read from bottom to top. Composing graphs by vertical juxtaposition and tensoring them by horizontal juxtaposition is the usual pasting of boundary graphs.

The category D. Let D (also written Dn) denote the Q-linear monoidal category of Elias–Williamson, Definition 5.2, in this type-A case: objects are the words i‾=(i1,…,ir) in the alphabet {1,…,n−1} — we also write Bi‾ for the object, in the notation of The Bott–Samelson bimodule of a word — with monoidal structure given by concatenation and with the empty word as unit; the hom space Hom⁡D(i‾,j‾) is the free Q-module on the Soergel graphs with bottom boundary i‾ and top boundary j‾, graded by graph degree and with degree-zero composites, modulo the homogeneous relations of the source, which in type A are:

  1. the polynomial relations (5.1) and (5.2) of Elias–Williamson §5.1, which slide boxes labelled by f∈R across strands at the cost of the appropriate action of the Coxeter group and the Demazure operator, with the root labelling the dot on a strand of color s;
  2. the one-color relations (5.3)–(5.5) of Elias–Williamson §5.1: the Frobenius relations among dots and trivalent vertices of a single color and the needle relation (5.5): a one-color loop attached at a trivalent vertex to a single strand is zero;
  3. the two-color relations of Elias–Williamson §§5.2–5.3, in the two parities; for distant colors (mst=2) the 4-valent vertex is an interchange isomorphism, and for adjacent colors (mst=3) the 6-valent vertex satisfies the Jones–Wenzl relations, including the two ways of reading the relation that resolve the two triple products BiBi+1Bi≅Bi,i+1,i⊕Bi and Bi+1BiBi+1≅Bi,i+1,i⊕Bi+1 of Rank-two type-A Soergel bimodule decompositions;
  4. the three-color relations of Elias–Williamson §§5.4–5.5, which in type A are: the A1×I2(m) relation (5.8) for a triple of colours consisting of two adjacent colours together with a third colour distant from both; its special case (5.9) for three pairwise distant colours; and the A3 Zamolodchikov relation (5.10) on three consecutive colours. The B3 and H3 relations (5.11)–(5.12) of the source are not part of the type-A presentation, and Elias–Williamson's Definition 5.2 lists all of (5.8), (5.9) and (5.10) before the definition is complete.

For type A the same presentation is enumerated, with all generators, degrees and local relations, in Elias–Khovanov, Definition 3.8 and §3.4 (relations (3.1)–(3.37)); the indexing there is Sn+1 with colors {1,…,n} and polynomial ring in n+1 variables of degree 2, and its internal shift is translated to the library by M{−1}=M(1), as on this page. The Karoubi envelope Kar⁡(D) is the idempotent completion of the additive graded closure of D, using degree-zero idempotents and morphisms there.

The candidate bimodule functor. Let F:D→R-Bim be the assignment that sends a word i‾ to the Bott–Samelson bimodule Bi1⊗R⋯⊗RBir of The Bott–Samelson bimodule of a word and a graph to a bimodule map by the following images on the generating vertices, all of which are the maps displayed in Elias–Williamson, p. 5, written here in the library's shifts and with αs and ∂s(f)=(f−sf)/αs:

  1. the degree-+1 dot Bs→R ↦ the map f⊗g↦fg;
  2. the degree-+1 dot R→Bs ↦ the map 1↦12(αs⊗1+1⊗αs);
  3. the degree-−1 trivalent vertices ↦ the maps 1⊗g⊗1↦∂sg⊗1 and 1⊗1↦1⊗1⊗1;
  4. a box labelled by homogeneous f∈R ↦ multiplication by f in the region of the tensor product where the box lies, that is, the R-bimodule structure of the corresponding Bott–Samelson bimodule;
  5. a 4-valent vertex of two distant colors ↦ the interchange isomorphism Bi⊗RBj→Bj⊗RBi of Distant Soergel generators commute;
  6. a 6-valent vertex of two adjacent colors ↦ the unique degree-zero bimodule map between the two alternating reduced-word products that sends their 1-tensor to the 1-tensor, as specified for a 2m-valent vertex in Elias–Williamson §§5.2–5.3 (and given explicitly by Libedinsky). It factors through the common summand Bi,i+1,i of the two triple products in Rank-two type-A Soergel bimodule decompositions; the existence of that summand alone does not specify the map's scalar.

Status. The assignment F is a candidate: this item defines its values on generators only, and no functoriality is asserted here. That the values respect the relations, so that F is a graded monoidal functor, is the content of the next item on this page; the functor is not asserted to be an equivalence before the double-leaves items.

Remark

(a) Degree bookkeeping. The degrees above are the degrees of the Elias–Williamson graphs, in which a polynomial box labelled by f has degree deg⁡f with deg⁡xi=2, a dot has degree +1 and a trivalent vertex has degree −1. Because the library's bimodules carry the shift convention M(1)=M{−1} of The Soergel bimodule Bi of a simple reflection, in which 1⊗1∈Bs has degree −1, a graph of degree d is sent to a bimodule map of degree d: for example the degree-+1 dot Bs→R sends the degree-−1 element 1⊗1 to the degree-0 element 1∈R; the degree-−1 splitting vertex 1⊗1↦1⊗1⊗1 sends the degree-−1 element 1⊗1∈Bs to the degree-−2 element 1⊗1⊗1∈BsBs; and the degree-−1 merging vertex 1⊗g⊗1↦∂sg⊗1 sends the degree-0 element 1⊗αs⊗1 to 2(1⊗1) of degree −1. The element 1⊗1⊗1 is not a witness for the merging vertex: it has degree −2 and ∂s(1)=0, so this instance of the merge is the zero map. Scalars: the sources fix the normalisation δ=αs/2 and send the second dot to 1↦12(αs⊗1+1⊗αs)=δ⊗1+1⊗δ, which is Elias–Williamson's image 1↦Δs of Definition 5.12 in the balanced type-A case, where Δs=12(αs⊗1+1⊗αs) because 12 exists in k=Q. The unscaled element Zs=αs⊗1+1⊗αs=2Δs used in Rank-two type-A Soergel bimodule decompositions and in the rank-two example is not the image of this dot: it differs from it by the invertible scalar 2, and the rank-two splitting maps built from Zs differ from the fixed diagrammatic generators by that factor, so the relation checks and the six-valent generator are not invariant under this rescaling without adjustment. When the balanced realization of The standard type-A reflection realization and its polynomial ring is used, the translation is by the alternating signs εs,εt with εsεt=−1: the insertion maps rescale as μta,α=εtμta,β and the contractions as κsα=εsκsβ, the zig-zag composite changes sign, and the idempotent and the summand it defines do not. Throughout this item the normalisation used is the displayed one, 1↦12(αs⊗1+1⊗αs).

(b) Small n. For n=2 there is one color, no pair of distinct colors, and so no 4-valent or 6-valent vertices; D2 is generated by the one-color graphs, and the rank-one square relation of The rank-one Soergel bimodule square splits is the corresponding idempotent decomposition. For n≤1 there are no colors at all. The word category D has only the empty word, with End⁡(∅)=R; its additive graded and Karoubi closures also contain sums, shifts and their summands. No vertex, and in particular no 2m-valent vertex, is used.

(c) What is not claimed. Nothing here asserts that the relations of the sources list every relation valid in BSBim, nor that F descends to D, nor that D has finite-dimensional hom spaces. Those are separate items of this page, proved from the sources quoted there.

(d) Imported statements of the sources, recorded for the later items. The later items of this page cite the following results of Elias–Williamson and Elias–Khovanov through this definition; we record their content here, in the notation fixed above, so that every later citation has a textual anchor in this item. Write LLx‾,y‾ for a set consisting of one fixed choice of double leaf LL‾y‾,f∘LLx‾,e, the light leaf from x‾ followed by the flipped light leaf towards y‾, so that the composite is a morphism x‾→y‾ for each pair of subexpressions e,f of x‾,y‾ expressing a common element w. Fix one reduced word w‾ for each such w, shared by both light leaves in each composite; their common intermediate object is that word, not the permutation itself. Let Iw for the two-sided ideal spanned by double leaves factoring through elements y≱w in Bruhat order (Elias–Williamson, §6.4). Thus D≥w=D/Iw retains the cells indexed by y≥w; for maps into a reduced-word object Bw‾, this amounts to quotienting by terms indexed by y<w.

  1. Double leaves. (Elias–Williamson, Theorem 6.11 with Proposition 6.12 and Corollary 6.13.) The set LLx‾,y‾ forms a free R-basis for Hom⁡(Bx‾,By‾) in D; the light leaves LLx‾,e with e expressing the identity form a free R-basis for Hom⁡(Bx‾,1) in D; and hom spaces in D are free graded R-modules. This is proved from two inputs: by Elias–Williamson, Proposition 6.9, after localization the space of maps is a direct sum of terms indexed by pairs of subsequences carrying a partial order with respect to which the double-leaf maps are upper triangular with an invertible diagonal, so the double leaves are linearly independent over the fraction field; and by the result of item 3 below they span.
  2. Construction of light leaves. (Elias–Williamson, Construction 6.1 with Figure 2.) For every pair (x‾,e) expressing w and every k≤ℓ(x‾), the truncated light leaf on the first k letters is obtained from the truncated light leaf on the first k−1 letters by a rex move β when the k-th letter is a down step, followed by exactly one of four local moves: the dot U0 of degree +1, the identity U1 of degree 0, the merging trivalent vertex D0 of degree −1, and the cap D1 of degree 0. The degree of the morphism LLx‾,e is +1 for each U0 and −1 for each D0, and hence agrees with the defect d(e)=#U0−#D0 of the subexpression.
  3. Basis modulo lower terms. (Elias–Williamson, §7, Proposition 7.6, with the maxwidth induction of §7: for arbitrary x‾ and a reduced word w‾ for w, the maps LLx‾,e, one for each subexpression e of x‾ expressing w, form a basis for Hom⁡(Bx‾,Bw‾)/Iw under the action of R on the left.) Linear independence is already known by localization, so it is enough to show that these maps span; the proof represents the identity of a word as a negative-positive decomposition, factors an arbitrary morphism through a reduced word, and pushes the lower terms through by induction on the maximum width of a graph, using only the relations of D. Consequently every morphism between Bott–Samelson objects lies in the span of the double leaves modulo the ideal of strictly lower terms.
  4. Krull–Schmidt. (Elias–Williamson, Lemma 6.24.) If k is a complete local ring then the category Kar⁡(D) is Krull–Schmidt.
  5. Classification of indecomposables. (Elias–Williamson, Theorem 6.25.) Assume that k is a complete local ring; then for all w∈W there exists a unique summand Bw of Bw‾ which is not isomorphic to the shift of a summand of Bv‾ for any reduced expression v‾ for v<w; the object Bw does not depend on the reduced expression w‾ up to isomorphism; every indecomposable object of Kar⁡(D) is isomorphic to a shift of Bw for some w∈W; hence the passage to isomorphism classes up to shift is a bijection from W onto the indecomposable objects of Kar⁡(D) up to shifts and isomorphism.
  6. Relation checks for the bimodule functor. (Elias–Khovanov, §5.1 with Definition 3.8 and Claim 5.1.) Each of the finitely many relations (3.1)–(3.37) of the type-A presentation holds for the images of the generating morphisms in Soergel bimodules, and the verification is finite; by Claim 5.1 a Bott–Samelson bimodule i‾ of length d with m distinct colours is generated as an R-bimodule by any set of 2d−m linearly independent tensors that is in bijection with the power set of the set X of repeated-colour pairs and realises each pair by a linear factor inside that pair, so the two-color and three-color relations may be checked on 2d−m generators.
  7. The diagrammatic character. (Elias–Williamson, §6.5: Definition 6.23 with equations (6.3) and (6.4), and Corollaries 6.26 and 6.27.) For w∈Sn let D≥w:=D/Iw be the quotient retaining the Bruhat cells y≥w as just defined. For a reduced word w‾ for w the images of Bw‾ in D≥w are canonically isomorphic and End⁡D≥w(Bw‾)=R; by imported result 1 above the module Hom⁡D≥w(Bx‾,Bw‾) is free with basis the light leaves LLx‾,e, e a subexpression of x‾ expressing w, so that in the Hecke algebra of The type-A Hecke algebra in Soergel normalization Hx‾=∑w∈Sngrk⁡Hom⁡D≥w(Bx‾,Bw‾) T~w, where Hx‾ denotes the product of the Hxa along x‾, the right-hand coefficients are expanded in the standard normalized basis {T~x=vℓ(x)Tx} of The standard basis of the type-A Hecke algebra and its multiplication rule (Elias–Williamson's basis element Hw), and grk⁡ the graded rank. Since k=Q is a local ring, direct summands of free graded R-modules are graded free by Nakayama's lemma, so the diagrammatic character ch:[Kar⁡(D)]⟶Hn,B↦∑w∈Sngrk⁡Hom⁡Kar⁡(D≥w)(B,Bw) T~w, is a well-defined homomorphism of Z[v±1]-modules with ch(v[B])=ch(B(1))=v ch(B); it satisfies ch(Bx‾By‾)=ch(Bx‾)ch(By‾) for words x‾,y‾ and ch(Bs)=Hs for every simple reflection s, hence is multiplicative on the classes of Bott–Samelson objects. Moreover ch is an isomorphism of Z[v±1]-algebras: the classes [Bx‾] span the split Grothendieck group, the classes [Bw] of the distinguished indecomposable summands of reduced-word objects are a basis, and ch(Bw)=T~w+∑y<wgy,wT~y with gw,w=1 and the sum over the strictly lower elements y<w of the Bruhat order, so triangularity with unit diagonal in the standard basis {T~y} makes ch a bijection. A reduced-word object itself may have lower summands, as Bsts≅Bw0⊕Bs in rank two. Finally the assignment Hs↦[Bs] defines a homomorphism Hn→[Kar⁡(D)].
  8. The light-leaf basis of the hom space to the unit. (Libedinsky, Sur la catégorie des bimodules de Soergel, arXiv:0707.3603, §§4.4–4.6 and Théorème 5.1, with its proof in §5.) For a reflection-faithful representation over a field of characteristic different from two, put θs=R⊗RsR, so the library's Bs=θs(1). From R=Rs⊕xsRs, §4.4 defines Rs-linear coefficient operators Ps,Is,Is′ on R (these are not R-bimodule endomorphisms) and the bimodule maps ms,is0,is1 on the unshifted tensor products. Sections 4.5–4.6 fix braid paths and recursively construct leaves by the four up/down rules. Théorème 5.1 states that the leaves Ar′ ending at R form an R-basis of Hom⁡R-R(θs1⋯θsr,R). Its proof evaluates these leaves on the normal tensor basis, obtains a triangular matrix with diagonal entries one, and compares finite-dimensional graded pieces using Corollary 4.2 and Lemma 5.6. In ordinary map-degree notation a leaf using h contractions has degree −2h on the unshifted source and degree r−2h on Bs1⋯Bsr=(θs1⋯θsr)(r). Thus the unshifted Hecke count is ∑a∈Ar′q−deg⁡(a)/2=pr1, where ∏j(1+Tsj)=∑wprwTw and q=v−2. The minus sign is necessary with ordinary map degrees: for the word ss the degrees are 0,−2 and p21=1+q. The printed positive sign in Definition 5.4 and the degree-increase wording in Lemma 5.6 are inconsistent with the explicit contraction of degree −2 and the computation on p. 19; they are not adopted here. This source uses its own braid-map normalization; the evaluated Elias–Williamson leaves are handled separately by result 11.
  9. Adjunction and double leaves. (Elias–Williamson, Remark 6.10 and §6.7, especially Remark 6.29.) Vertical flipping and rotating a light leaf give different constructions; no entrywise identification of a vertically flipped double leaf with a bent unit-target light leaf is asserted. Cups and caps make each generating strand self-biadjoint by planar isotopy. Evaluation sends these cups and caps to the degree-zero Frobenius coevaluation and evaluation of the bimodule Bs. Consequently bending boundary strands commutes with evaluation. An isomorphism on Hom spaces to the unit therefore implies an isomorphism on Hom spaces between words. The image of a diagrammatic double-leaf basis is then a basis under this isomorphism, independently of the basis obtained by bending light leaves.
  10. The defect expansion of a product of generators. (Elias–Williamson, §2.4, Lemma 2.10 with Corollary 2.11, in the normalization Hs=vTs+v, T~w=vℓ(w)Tw of The type-A Hecke algebra in Soergel normalization.) A subexpression of a word x‾=(x1,…,xm) is a 01-sequence e, with Bruhat stroll x0=e, xk=xk−1s if the letter is kept and xk=xk−1 otherwise; each index carries a token U0, U1, D0 or D1 according to whether the letter is kept and whether the stroll moved up or down, and the defect is d(e)=#U0−#D0. Then Hx1⋯Hxm=∑evd(e) T~we, the sum over all subexpressions e of x‾, where we is the element expressed by e. Equivalently, for a Bott–Samelson bimodule Bx‾ the Δ-multiplicity of the standard bimodule Δw(d) is the number of subexpressions of x‾ expressing w with defect d, (Bx‾:Δw(d))=#{e:we=w, d(e)=d}.
  11. Localised independence of the evaluated light leaves. (Elias–Williamson, §6.7, Remark 6.29, read together with the localisation argument of the proof of Corollary 6.8 of the same section.) Fix an expression x‾ and a reduced word w‾ for an element w∈Sn, and let LLx‾,w‾ consist of one light leaf LLx‾,e:Bx‾→Bw‾ for each subexpression e of x‾ expressing w, chosen once and for all, so that each F(LLx‾,e) is a composition of the images of dots, trivalent vertices and 2mst-valent vertices. Then the images F(LLx‾,e) are linearly independent over R as elements of Hom⁡BSBim(Bx‾,Bw‾): the same localisation argument as in the proof of Corollary 6.8, carried out in the localised category of Soergel bimodules, exhibits the images of the light leaves as upper triangular with invertible diagonal, and localisation is injective on hom spaces. Comparing the degrees of the light leaves (the defects of result 2 above) with the graded dimension of Hom⁡(Bx‾,R) then shows that the images of the light leaves LLx‾,e with e expressing the identity span Hom⁡(Bx‾,R) as a graded R-module.

Depends on

Used by

Dependency tree · two levels

16 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