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 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 : 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- forms, namely the relation (5.8), its all-distant special case (5.9) and the Zamolodchikov relation (5.10). Consequently descends to a graded -linear monoidal functor where has the objects of but total graded morphisms from The type-A Soergel category . Thus a degree- diagram is sent to a map of ordinary degree , equivalently a degree-zero map . After adjoining finite sums and shifts on the diagrammatic side and taking degree-zero morphisms, this gives a monoidal functor to , and hence, by degree-zero idempotent completion, to a monoidal functor ; the functor is normalised so that it is the identity on objects up to the given identification and the unit of is sent to .
Facts & Assumptions
Given: The type-A diagrammatic category with its generators, degrees and relations and the candidate functor (The type-A diagrammatic Soergel category and its candidate bimodule functor), the polynomial ring with , and the Bott–Samelson bimodules .
is generated by dots of degree , trivalent vertices of degree , -valent vertices of degree and polynomial boxes of degree , 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 the two-color vertices are the -valent vertex for distant colors and the -valent vertex for adjacent colors (The type-A diagrammatic Soergel category and its candidate bimodule functor).
is free over with basis : every has a unique expression with , , , and is -bilinear with for (The standard type-A reflection realization and its polynomial ring).
with left action , right action , the graded left module structure , and the -linear Demazure operator with for (The Soergel bimodule of a simple reflection).
The rank-one calculus: is free of rank two on each side, the degree-zero maps of the two exact sequences and make into a Frobenius extension , and the cup and cap elements generate the rank-one sub-bimodules used by the four generating maps (The Soergel bimodule of a simple reflection, Frobenius biadjunction for the type-A Soergel generators).
For distant colors the interchange map of Distant Soergel generators commute is a degree-zero bimodule isomorphism that sends -tensors to -tensors and is its own inverse up to the evident transposition.
For adjacent colors the two inclusions and projections of the common summand of and exist, are degree zero and satisfy the idempotent relations displayed in Rank-two type-A Soergel bimodule decompositions.
Imported generator check (Elias–Williamson, Definition 5.12 with Claim 5.13; the dihedral relations were checked by Libedinsky and the rank-three relations and for in Elias–Khovanov, §5.1): for the balanced type- realization over the assignment of the source — dots and trivalent vertices sent to the four structure maps of the Frobenius extension , the unit dot to , and the -valent vertex to the unique degree-zero map preserving the -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 and , the case of general being parallel to the published cases. The library's images are these same maps: because , and the -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
Reduction to generators: every relation of 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 -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.
Polynomial relations: a box labelled is sent to multiplication by in its region, and a box may be moved across a strand of color precisely at the cost of the balanced-tensor relation of ; since every decomposes uniquely as with by [F2], and the dot on a strand of color is sent to the element in the appropriate slot, the two polynomial relations listed in [F1] hold with and as in [F2]; the identities are checked on -tensors, where they reduce to the decomposition .
One-colour relations: the dot and trivalent morphisms of one colour are the structure maps of the Frobenius extension , namely the trace , the element , and the two balanced multiplications; by [F4] the compositions of these maps in 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 ; the value concerns a different composite and does not prove the needle relation.
Distant two-color relations: on distant colors the image of the -valent vertex is the interchange isomorphism of [F5], which is degree zero, sends -tensors to -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 -tensors.
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 and . 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 with , and the six-valent vertex is the source-normalized Libedinsky map of [F7], whose common summand is identified by [F6].
Conclusion: by steps 1.2–1.5 the images of the generators respect every defining relation of , so 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 -linear monoidal functor . For shifted objects, a degree-zero diagrammatic map is an unshifted map of degree , and its evaluated bimodule map has that same degree, hence is degree zero from to . Extend by matrices to finite sums and restrict to these degree-zero maps. This is a functor to the categorical of the statement. It extends to degree-zero idempotents by sending to the image of the evaluated idempotent, so extends to ; the unit of is the empty word, sent to , and the normalisation is the one displayed in [F1] and [F7]. ∎
Depends on
- The type-A diagrammatic Soergel category and its candidate bimodule functor
- Rank-two type-A Soergel bimodule decompositions
- Frobenius biadjunction for the type-A Soergel generators
- Distant Soergel generators commute
- The Soergel bimodule $B_i$ of a simple reflection
- The standard type-A reflection realization and its polynomial ring
- The type-A Soergel category $\mathrm{SBim}_n$
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
- Elias–Khovanov, Diagrammatics for Soergel Categories, §5.1 with Definition 3.8 and Claim 5.1, PDF pp. 27–33, 49–55 (standard reference, not scraped)
- Elias–Williamson, Soergel Calculus, §5.1, PDF pp. 37–40 (standard reference, not scraped)