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.

Evaluated double leaves form bases of type-A Soergel bimodule homs

Statement

Let n≥2 over k=Q and let x‾=(x1,…,xp) and y‾=(y1,…,yq) be two words in simple reflections, with Bott–Samelson bimodules Bx‾ and By‾ in BSBim (The Bott–Samelson bimodule of a word, The type-A Soergel category SBimn). Fix once and for all the light leaves of the diagrammatic category D (The type-A diagrammatic Soergel category and its candidate bimodule functor) and let F:D→BSBim∙ be the graded monoidal functor of The type-A diagrammatic relations hold for Soergel bimodules. Write LL‾y‾,f for the vertical flip of LLy‾,f. Then the evaluated double leaves F(LL‾y‾,f∘LLx‾,e)  ∈  Hom⁡R-R(Bx‾,By‾), one for each pair (e,f) of subexpressions of x‾,y‾ expressing the same element w∈Sn, form a homogeneous free left R-basis of Hom⁡R-R(Bx‾,By‾), with the same indexing and the same degrees d(e)+d(f) as the diagrammatic double leaves of Double leaves form graded R-bases of type-A diagrammatic Hom spaces. In particular the total graded Hom module for this pair of word objects has graded rank ∑w∑e,f: we=wf=wvd(e)+d(f). Here and throughout this item Hom⁡R-R means the total graded module Hom⁡∙, not just its degree-zero part. For arbitrary objects M=⨁aBx‾a(ra) and N=⨁bBy‾b(sb) of BSBim, the matrix entries of these bases give a homogeneous free basis of Hom⁡∙(M,N), with graded rank ∑a,bvra−sb∑w∑e,f: we=wf=wvd(e)+d(f), where the inner sum uses subexpressions of x‾a,y‾b. The categorical morphism space is its degree-zero part.

Facts & Assumptions

Given: Words x‾,y‾, the word u‾=x‾rev⁡(y‾), and the graded monoidal evaluation functor F:D→BSBim∙.

[F1]

The fixed double leaves form a homogeneous free left R-basis of Hom⁡D(x‾,y‾), of degrees d(e)+d(f), and the light leaves to the empty word form such a basis when the target is the unit (Double leaves form graded R-bases of type-A diagrammatic Hom spaces). Common intermediate reduced words are fixed as in that theorem.

[F2]

The images of these unit-target light leaves are a homogeneous free left R-basis of Hom⁡R-R(Bu‾,R) (Light leaf maps form bases of type-A Soergel homs to the unit).

[F3]

The degree-zero Frobenius evaluation and coevaluation make Bs self-dual and satisfy both triangle identities (Frobenius biadjunction for the type-A Soergel generators). The diagrammatic cup and cap satisfy the same identities by isotopy, and evaluation sends them to these bimodule maps: the cap is multiplication after the merge, (a⊗b)⊗(c⊗d)↦a∂s(bc)d, and the cup is the split after the dot, 1↦δs⊗1⊗1+1⊗1⊗δs (The type-A diagrammatic Soergel category and its candidate bimodule functor, The type-A diagrammatic relations hold for Soergel bimodules).

Proof

1.1

Unit evaluation is an isomorphism: [F1] gives a basis of Hom⁡D(u‾,∅), and [F2] says its evaluated images form a basis of Hom⁡R-R(Bu‾,R). Evaluation is left R-linear because a polynomial in the leftmost region acts by left multiplication on the output. Thus the map Eu‾,∅ on these Hom spaces is an isomorphism of graded left R-modules.

F1F2
1.2

Right bending: write X=x‾, Y=y‾ and Y∗=rev⁡(y‾). The cups and caps of [F3], nested in reverse order, give εY:Y⊗Y∗→1 and ηY:1→Y∗⊗Y. In either category the maps β(f)=εY∘(f⊗id⁡Y∗),β−1(g)=(g⊗id⁡Y)∘(id⁡X⊗ηY) are inverse degree-zero bijections between Hom⁡(X,Y) and Hom⁡(X⊗Y∗,1) by the two triangle identities. They are left R-linear: bending takes place on the right and leaves the leftmost polynomial region fixed; the same assertion for bimodules follows from left linearity of the evaluation map.

F3
2.1

Compatibility: because F preserves composition, tensor products and the specified cups and caps, the two bending maps satisfy βbim∘Ex‾,y‾=Eu‾,∅∘βD. Both bending maps are isomorphisms by step 1.2 and the unit evaluation map is an isomorphism by step 1.1. Hence Ex‾,y‾=βbim−1Eu‾,∅βD is an isomorphism of graded left R-modules. This conclusion uses no identification of the bending of an individual double leaf with an individual unit-target light leaf.

F3step 1.1step 1.2
3.1

The double leaves of [F1] are a homogeneous basis of the source of Ex‾,y‾, so their images are a homogeneous basis of its target by step 2.1. A graded functor preserves their degrees d(e)+d(f). There are finitely many indexing pairs, since each word has finitely many subexpressions. Thus the graded rank is exactly ∑w∑e,f: we=wf=wvd(e)+d(f), for this pair of words.

F1step 2.1
4.1

For finite direct sums a bimodule map is uniquely a matrix of maps between the summands. A degree-d map Bx‾a→By‾b has degree d+ra−sb when viewed from Bx‾a(ra) to By‾b(sb), because these shifts lower element degrees by ra and sb. Thus the individual evaluated bases, placed in one matrix entry at a time, form a free homogeneous basis of the total Hom module, with the displayed sum of shifted ranks. Empty sums give the zero module and rank zero; for M=R⊕R, N=R there are two degree-zero basis entries and rank two. Taking degree zero recovers categorical morphisms, without asserting they form an R-submodule. ∎

givenstep 3.1

Remark

The proof transfers the evaluation isomorphism through adjunction, rather than identifying two different leaf constructions. Elias–Williamson Remark 6.10 explicitly distinguishes vertical flips from rotations; §6.7 and Remark 6.29 use adjunction to pass from the unit-target calculation to arbitrary Hom spaces. If either word is empty the same bending identities apply, and if both are empty evaluation sends the empty diagram to id⁡R, giving R≅Hom⁡R-R(R,R). Only finite words and finitely many fixed leaves occur; no choice principle is needed.

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