Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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 and bimodule Soergel categories are equivalent

Statement

Let n≥2 and k=Q, let D=Dn be the type-A diagrammatic Soergel category over Q with Karoubi envelope Kar⁡(D) (The type-A diagrammatic Soergel category and its candidate bimodule functor), and let SBimn be the type-A Soergel category of The type-A Soergel category SBimn. Let F:D→BSBim∙ be the graded monoidal word functor of The type-A diagrammatic relations hold for Soergel bimodules and let Kar⁡(F):Kar⁡(D)→SBimn be its extension after adjoining finite sums and shifts, restricting to degree-zero maps, and taking idempotent completions. Then:

  1. Kar⁡(F) is faithful and full: for all words x‾,y‾ the map Hom⁡D(x‾,y‾)⟶Hom⁡R-R(Bx‾,By‾),g⟼F(g), is an isomorphism of graded left R-modules, and the restriction of Kar⁡(F) to every hom space of Kar⁡(D) is a bijection;
  2. Kar⁡(F) is essentially surjective: every object of SBimn is isomorphic to the image of an object of Kar⁡(D) under Kar⁡(F);
  3. Kar⁡(F) is a graded monoidal functor, so that Kar⁡(F) is an equivalence of graded monoidal categories.

For n≤1 both categories are generated under finite sums, shifts and summands by R up to the fixed identification and F is that identification, so the conclusion holds there as well.

Facts & Assumptions

Given: The standard type-A realization over k=Q with n≥2, the diagrammatic category D of words with its Karoubi envelope Kar⁡(D), the bimodule category SBimn, the word functor F:D→BSBim∙ and its degree-zero additive and Karoubi extension Kar⁡(F).

[F1]

F respects every defining relation of D, hence descends to a graded Q-linear monoidal functor D→BSBim∙, i‾↦Bi1⊗R⋯⊗RBir. After adjoining finite sums and shifts and restricting to degree-zero maps, it extends by degree-zero idempotent completion to a graded monoidal functor Kar⁡(D)→SBimn; the extension is additive and carries a finite direct sum of shifts of words to the corresponding direct sum of shifts of Bott–Samelson bimodules (The type-A diagrammatic relations hold for Soergel bimodules, The type-A diagrammatic Soergel category and its candidate bimodule functor).

[F2]

Double leaves: the double leaves LL‾y‾,f∘LLx‾,e, one for each pair of subexpressions e,f of x‾,y‾ expressing a common element w∈Sn and using the same fixed reduced target word w‾, form a homogeneous free left R-basis of the graded left R-module Hom⁡D(x‾,y‾), of degrees d(e)+d(f) (Double leaves form graded R-bases of type-A diagrammatic Hom spaces).

[F3]

Evaluated double leaves: the evaluated double leaves F(LL‾y‾,f∘LLx‾,e) form a homogeneous free left R-basis of Hom⁡R-R(Bx‾,By‾) with the same indexing by pairs of subexpressions expressing a common element and the same degrees d(e)+d(f) (Evaluated double leaves form bases of type-A Soergel bimodule homs).

[F4]

SBimn is the idempotent completion Kar⁡(BSBimn) of the category of Bott–Samelson bimodules: its objects are pairs (M,e) with M a finite direct sum of shifted Bott–Samelson products and e a degree-zero idempotent, its morphisms (M,e)→(N,f) are the maps u with fu=u=ue, and the tensor product is (M,e)⊗R(N,f)=(M⊗RN,e⊗f), so every object is a finite direct sum of shifts of summands of Bott–Samelson products (The type-A Soergel category SBimn); the Karoubi envelope of a preadditive category has the same description of objects, morphisms and composition (The idempotent completion of a preadditive category).

[F5]

The standard type-A realization over Q with n≥2 satisfies the hypotheses of the Soergel-calculus results imported by [F1]–[F3]: k=Q is a field, every finite dihedral integer 2mst is invertible in k, and the realization is faithful, reflection faithful, balanced and Demazure-surjective (The standard type-A reflection realization and its polynomial ring).

[F6]

Idempotent completion of hom sets: a morphism u:(M,e)→(N,f) of the idempotent completion satisfies fu=u=ue, so each hom set is a subgroup of the ambient hom group of the ambient category, and a functor that is an isomorphism on the ambient hom groups restricts to a bijection on these subgroups (The idempotent completion of a preadditive category).

Proof

1.1

Hypotheses and the functor: by [F5] the type-A realization over Q with n≥2 satisfies exactly the standing hypotheses of the imported results, so the functor statement [F1] and the two basis statements [F2] and [F3] apply in the stated form; by [F1] F is a graded Q-linear monoidal word functor to total graded Hom with i‾↦Bi‾ and ∅↦R. Its finite-sum and shifted extension restricts to degree-zero morphisms before idempotent completion, yielding Kar⁡(F):Kar⁡(D)→Kar⁡(BSBim)=SBimn, given on objects by (M,e)↦(FM,Fe) and on morphisms by u↦Fu; the degree-zero idempotent Fe is well defined because F preserves degrees, composition and identities.

F1F4F5
1.2

Bijection on the homs of D: fix words x‾,y‾; by [F2] the double leaves are a homogeneous free left R-basis of Hom⁡D(x‾,y‾) and by [F3] their images under F are a homogeneous free left R-basis of Hom⁡R-R(Bx‾,By‾) with the same indexing and the same degrees, so the Q-linear map g↦F(g) takes a basis to a basis of free graded R-modules of the same graded rank and is therefore an isomorphism of graded left R-modules. For finite sums of shifted words, Hom maps are matrices of shifted word-Hom entries, and [F3] gives the same matrix basis after evaluation; thus the isomorphism extends to total graded Hom for these sums and restricts to a bijection on its degree-zero part.

F2F3
1.3

Monoidal and graded structure: by [F1] F is a graded monoidal functor, so F(X⊗Y)≅FX⊗FY compatibly with the associativity and unit constraints, F(∅)=R is the unit, and F(X{k})=(FX){k}; the tensor product and shifts on the idempotent completions are (M,e)⊗(N,f)=(M⊗N,e⊗f) and (M,e){k}=(M{k},e{k}) by [F4], and F(e⊗f)=Fe⊗Ff because F is monoidal; hence Kar⁡(F) is monoidal and preserves the shifts, and it preserves degrees of morphisms by [F1].

F1F4
2.1

Faithful on the Karoubi envelope: let (M,e) and (N,f) be objects of Kar⁡(D) and let u:(M,e)→(N,f) be a degree-zero morphism, so that fu=u=ue by [F6]; applying F gives F(f)F(u)=F(u)=F(u)F(e), so Fu is a categorical morphism (FM,Fe)→(FN,Ff) and Kar⁡(F) on this hom set is the restriction of the degree-zero bijection of step 1.2 to these subgroups; a restriction of an injective map is injective, so Kar⁡(F) is faithful.

F1F6step 1.2
3.1

Full on the Karoubi envelope: let v:(FM,Fe)→(FN,Ff) be a degree-zero morphism of SBimn, so that v=F(f) v F(e) by [F4]; by the degree-zero surjectivity in step 1.2 there is a degree-zero u∈Hom⁡D(M,N) with F(u)=v, and then F(fue)=F(f)F(u)F(e)=v=F(u); since F is injective on degree-zero Hom⁡D(M,N) by step 1.2, fue=u, so u is a morphism (M,e)→(N,f) of Kar⁡(D) with Kar⁡(F)(u)=v. Hence Kar⁡(F) is full.

F1F4step 1.2step 2.1
3.2

Essential surjectivity: let (M,e) be an object of SBimn; by [F4] M is a finite direct sum of shifts of Bott–Samelson products, so M=F(X) for the corresponding finite direct sum X of shifts of words in the additive closure of D, by the additivity and shift preservation of the extension in [F1]; the degree-zero idempotent e∈End⁡(M) has a degree-zero preimage e~∈End⁡D(X) under the bijection of step 1.2, and e~ is idempotent because F(e~2)=F(e~)2=e2=e=F(e~) and F is faithful by step 2.1; therefore (M,e)=(FX,Fe~)=Kar⁡(F)(X,e~) and Kar⁡(F) is essentially surjective.

F1F4step 1.2step 2.1
4.1

Conclusion: steps 2.1, 3.1, 3.2 and 1.3 show that Kar⁡(F) is faithful, full, essentially surjective and a graded monoidal functor, hence an equivalence of graded monoidal categories; the realization hypotheses used are exactly those recalled in [F5], and for n≤1 both sides are generated under finite sums, shifts and summands by R, with End⁡∙(R)=R and categorical End⁡0(R)=Q, and F is the identity on this generator, so the conclusion holds in that case too. ∎

F5step 2.1step 3.1step 3.2step 1.3

Remark

(a) What is imported and what is proved here. Both bases are imported: the diagrammatic double-leaf basis of [F2] (Elias–Williamson, Theorem 6.11 with Proposition 6.12 and Corollary 6.13) and its evaluated counterpart of [F3] (the evaluated double-leaf theorem Evaluated double leaves form bases of type-A Soergel bimodule homs, whose proof transports the unit-target basis through the adjunction principle recorded as imported result 9 of The type-A diagrammatic Soergel category and its candidate bimodule functor). The work of this item is the passage to the idempotent completions, where full faithfulness is inherited from the bijection on the ambient hom groups and essential surjectivity uses that every object of SBimn is a summand of a finite sum of shifted Bott–Samelson products.

(b) The role of the realization hypotheses. The hypotheses listed in [F5] are the Soergel-realization hypotheses under which the sources prove the calculus and its basis theorems; they are recorded here rather than silently assumed, and the case n≤1, where there are no colours, is separated out because the sources assume n≥2.

(c) Choice. No choice principle is used: the light leaves and path morphisms are fixed once and for all, the subexpression index sets are finite, and the passage to idempotents lifts the finitely many idempotents of the chosen objects one at a time.

Depends on

Used by

Dependency tree · two levels

19 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