Alphabeta Math
LemmaStatement: 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 relations hold for Soergel bimodules

Statement

For the type-A realization the assignment F of The type-A diagrammatic Soergel category and its candidate bimodule functor, which sends a word to the corresponding Bott–Samelson bimodule and the generating vertices, boxes and dots to the displayed bimodule maps, respects every defining relation of D: the polynomial relations, the one-colour Frobenius relations, the distant two-colour relations, the adjacent two-colour Jones–Wenzl relations in both parities, and the three-colour relations in their three type-A forms, namely the A1×I2(m) relation (5.8), its all-distant special case (5.9) and the A3 Zamolodchikov relation (5.10). Consequently F descends to a graded Q-linear monoidal functor D⟶BSBim∙,i‾↦Bi1⊗R⋯⊗RBir, where BSBim∙ has the objects of BSBim but total graded morphisms Hom⁡∙(M,N)=⨁dHom⁡0(M,N(d)) from The type-A Soergel category SBimn. Thus a degree-d diagram is sent to a map of ordinary degree d, equivalently a degree-zero map M→N(d). After adjoining finite sums and shifts on the diagrammatic side and taking degree-zero morphisms, this gives a monoidal functor to BSBim, and hence, by degree-zero idempotent completion, to a monoidal functor Kar⁡(D)→SBimn; the functor is normalised so that it is the identity on objects up to the given identification and the unit of D is sent to R.

Facts & Assumptions

Given: The type-A diagrammatic category D with its generators, degrees and relations and the candidate functor F (The type-A diagrammatic Soergel category and its candidate bimodule functor), the polynomial ring R with deg⁡xi=2, and the Bott–Samelson bimodules Bi‾.

[F1]

D is generated by dots of degree +1, trivalent vertices of degree −1, 2mst-valent vertices of degree 0 and polynomial boxes of degree deg⁡f, and its relations are the polynomial relations (5.1)–(5.2), the one-color relations (5.3)–(5.5), the two-color relations of §§5.2–5.3 and the three-color relations of §§5.4–5.5 of the sources; in type A the two-color vertices are the 4-valent vertex for distant colors and the 6-valent vertex for adjacent colors (The type-A diagrammatic Soergel category and its candidate bimodule functor).

[F2]

R is free over Rs with basis {1,αs}: every f∈R has a unique expression f=f++αsf− with f±∈Rs, f+=12(f+s(f)), f−=12∂s(f), and ∂s is Rs-bilinear with ∂s(αsh)=2h for h∈Rs (The standard type-A reflection realization and its polynomial ring).

[F3]

Bs=R⊗RsR(1) with left action r′(r⊗r′′)=r′r⊗r′′, right action (r⊗r′′)r′=r⊗r′′r′, the graded left module structure Bs≅R(−1)⊕R(1), and ∂s the Rs-linear Demazure operator with ∂s(αsh)=2h for h∈Rs (The Soergel bimodule Bi of a simple reflection).

[F4]

The rank-one calculus: Bs is free of rank two on each side, the degree-zero maps of the two exact sequences 0→R(−1)→Bs→Rs(1)→0 and 0→Rs(−1)→Bs→R(1)→0 make Bs into a Frobenius extension R/Rs, and the cup and cap elements generate the rank-one sub-bimodules R(δu±w0) used by the four generating maps (The Soergel bimodule Bi of a simple reflection, Frobenius biadjunction for the type-A Soergel generators).

[F5]

For distant colors ∣i−j∣>1 the interchange map Bi⊗RBj→Bj⊗RBi of Distant Soergel generators commute is a degree-zero bimodule isomorphism that sends 1-tensors to 1-tensors and is its own inverse up to the evident transposition.

[F6]

For adjacent colors the two inclusions and projections of the common summand Bi,i+1,i of BiBi+1Bi and Bi+1BiBi+1 exist, are degree zero and satisfy the idempotent relations displayed in Rank-two type-A Soergel bimodule decompositions.

[F7]

Imported generator check (Elias–Williamson, Definition 5.12 with Claim 5.13; the dihedral relations were checked by Libedinsky and the rank-three relations A3 and A1×I2(m) for m=2,3 in Elias–Khovanov, §5.1): for the balanced type-A realization over k=Q the assignment of the source — dots and trivalent vertices sent to the four structure maps of the Frobenius extension R/Rs, the unit dot to 1↦Δs=12(αs⊗1+1⊗αs), and the 2m-valent vertex to the unique degree-zero map preserving the 1-tensor (the fixed Libedinsky map) — is a well-defined functor, that is, every defining relation of the presentation holds for these images. The proof of Claim 5.13 reduces the polynomial relations to the balanced tensor calculus, checks relations supported on a subset of colours in the corresponding subcategory, cites the dihedral checks, and reduces the rest to the rank-three relations A3 and A1×I2(m), the case of general m being parallel to the published m=2,3 cases. The library's images are these same maps: 12(αs⊗1+1⊗αs)=Δs because 12∈Q, and the 6-valent vertex uses the fixed source map from The type-A diagrammatic Soergel category and its candidate bimodule functor. The two rank-two decompositions verify the requisite common summand but by themselves would leave a scalar undetermined (The type-A diagrammatic Soergel category and its candidate bimodule functor, Rank-two type-A Soergel bimodule decompositions).

Proof

1.1

Reduction to generators: every relation of D equates two composites of generating morphisms with the same bottom and top words, so it is a relation between two graded bimodule maps of the same degree; a bimodule map out of a Bott–Samelson bimodule is determined by its values on an R-bimodule generating set, and the sets used in [F7] are generating sets, so it suffices to evaluate both sides of each relation on those generators.

F1F7
1.2

Polynomial relations: a box labelled f is sent to multiplication by f in its region, and a box may be moved across a strand of color s precisely at the cost of the balanced-tensor relation of Bs=R⊗RsR(1); since every f decomposes uniquely as f++αsf− with f±∈Rs by [F2], and the dot on a strand of color s is sent to the element αs in the appropriate slot, the two polynomial relations listed in [F1] hold with deg⁡αs=2 and ∂s as in [F2]; the identities are checked on 1-tensors, where they reduce to the decomposition f=f++αsf−.

F1F2F3
1.3

One-colour relations: the dot and trivalent morphisms of one colour are the structure maps of the Frobenius extension R/Rs, namely the trace ∂s, the element Δs, and the two balanced multiplications; by [F4] the compositions of these maps in Bs satisfy the unit and counit identities of a Frobenius algebra, and the remaining one-colour relation, the vanishing of the needle (a loop attached to a strand at a trivalent vertex), is covered by the imported generator check [F7]. In the Frobenius evaluation its closed loop contributes ∂s(1)=0; the value ∂s(αs)=2≠0 concerns a different composite and does not prove the needle relation.

F2F3F4F7
1.4

Distant two-color relations: on distant colors the image of the 4-valent vertex is the interchange isomorphism of [F5], which is degree zero, sends 1-tensors to 1-tensors and squares to the identity after the evident transposition; since the two strands are colored by distinct commuting simple reflections, polynomials slide across them exactly as in the balanced tensor product of [F1], so the distant interchange relations hold on 1-tensors.

F1F5
1.5

Adjacent and three-colour relations, and the relations on mixed words: the remaining relations are the two-colour Jones–Wenzl relations for adjacent colours, in the two parities of the source, and the three-colour relations A1×I2(m) and A3. These are exactly the relations covered by the imported generator check [F7]: the adjacent case is the pair of decompositions of [F6], which supplies the source's resolution of the two triple products, and the three-colour cases are the rank-three checks of the source. No rescaling is involved, because the library's declared images of the generators are the balanced source images: the second dot is 1↦Δs=12(αs⊗1+1⊗αs) with 12∈Q, and the six-valent vertex is the source-normalized Libedinsky map of [F7], whose common summand is identified by [F6].

F6F7
2.1

Conclusion: by steps 1.2–1.5 the images of the generators respect every defining relation of D, so F is well defined on hom spaces; it preserves degree by the degree dictionary of [F1] and composition and juxtaposition by construction, so it is a graded Q-linear monoidal functor D→BSBim∙. For shifted objects, a degree-zero diagrammatic map X(a)→Y(b) is an unshifted map of degree b−a, and its evaluated bimodule map has that same degree, hence is degree zero from BX(a) to BY(b). Extend by matrices to finite sums and restrict to these degree-zero maps. This is a functor to the categorical BSBim of the statement. It extends to degree-zero idempotents by sending (M,e) to the image of the evaluated idempotent, so F extends to Kar⁡(D)→SBimn; the unit of D is the empty word, sent to R, and the normalisation is the one displayed in [F1] and [F7]. ∎

F1F7step 1.2step 1.3step 1.4step 1.5

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