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 standard type-A reflection realization and its polynomial ring
Definition
The ring and its grading. Fix and , and let be the polynomial ring in commuting indeterminates (Polynomial rings in finitely many commuting indeterminates by iteration). Grade it by : is the -span of the monomials of total degree when is even, and when is odd. Thus is a nonnegatively graded commutative -algebra with , and every element of is a finite sum of homogeneous elements.
The reflection representation. Put , so , and let act on by place permutations, extended to a -algebra automorphism of ; on polynomial functions this is the substitution This is a left action: , and the substitution formula is the same statement read on functions, since for all is the substitution by the tuple ; the linear extension of to is an automorphism because it merely permutes indeterminates. By Reduced adjacent-transposition words have well-defined positive lifts, is generated by the adjacent transpositions .
Two normalizations of the simple roots. Equip with the symmetric bilinear form and use it to identify with .
(a) Coordinate roots. For put and , with Then is the place permutation of and on the basis: exchanges and and fixes the remaining . We write for the root system , for the roots with , and for the positive roots of the rank-two parabolic subsystem generated by . With this choice the published length criterion of Finite Weyl strong exchange and deletion applies verbatim: if and only if in the positive system . We call the length normalization of the realization.
(b) Balanced roots. Put for and so that the Cartan matrix of the realization is adjacent pairings are and distant pairings are . Because , the reflection coincides with the transposition computed in (a); hence the two choices of simple roots define the same reflection representation, the same reflecting hyperplanes, the same invariant rings and the same root system as a set of elements of . We call the balanced normalization; it is the one attached to the diagrammatic calculus of The type-A diagrammatic Soergel category and its candidate bimodule functor. The two normalizations are related by the dictionary and every identity below is read in the normalization displayed in it; in particular the descent criterion in the balanced labeling reads if and only if .
Invariants and the Demazure operator. Let denote the subring of -invariants and, in the balanced normalization, define so that with ; the kernel and the surjectivity below are the same for both operators, and the algebraic items of this page may use either. This is well defined and lands in : is free over with basis , because is invertible in and every polynomial can be written uniquely as with and ; the two summands are independent over since is not a zero divisor. Hence forces the -part of to be , so for and The factor is the one displayed: applying to with returns , so is -linear and surjective onto (and the same operator annihilates , so its kernel is exactly ).
The stated properties of the realization. For this data:
- it is faithful: if fixes every element of then for all , so for all and ;
- it is reflection faithful: every reflection of is a transposition , and its fixed space on is the hyperplane ; distinct transpositions have distinct fixed hyperplanes, since the hyperplane determines the unordered pair ;
- it satisfies Demazure surjectivity (Elias–Williamson, Assumption 3.7): is a nonzero functional on , hence surjective onto , evaluation at is surjective on , and is surjective onto because for with ;
- it is balanced in the sense of Elias–Williamson, Definition 3.6. Recall from Definition 3.5 that the two-colored quantum numbers are determined by , , , together with the recursions and . Fix and put , . If then and , so the technical condition (3.3) reads and . If then and ; the recursion at gives and likewise , so (3.3) holds, while . Thus for every pair , which is balancedness, and the technical condition (3.3) also holds throughout. This is the hypothesis under which Elias–Williamson §§5.1–5.3 present the diagrammatic category with the simple relation families used on this page, and it is why the balanced normalization (b), rather than the coordinate roots of (a), carries the diagrammatic data. Every finite dihedral integer is or here, hence invertible in , and so is .
Remark on the length normalization. In the coordinate-root normalization (a) the same realization has adjacent Cartan entries , so for adjacent : that normalization is odd-unbalanced, and Elias–Williamson's balanced presentation does not apply to it as written. Since the reflections, the invariant rings, the root hyperplanes and the bimodules of this page depend only on the reflection representation and not on which linear forms represent the simple roots, the page uses the coordinate roots (a) for the length-theoretic and rank-two algebraic statements, where the published length criterion is stated in that notation, and the balanced roots (b) for the diagrammatic statements of Elias–Williamson §§5–7.
Small . For or , take (with when ). The group is trivial and there are no simple reflections. The empty-word bimodule is ; the additive graded Bott–Samelson category consists of finite direct sums of shifts of , with degree-zero bimodule maps. Its Soergel category is its idempotent completion. In particular it contains the zero object, all shifts and all scalar maps; . Statements involving a simple reflection have no instances in these cases.
Shift dictionary. Following Elias–Williamson we write for the graded shift with . In the library convention for graded modules and their internal shifts, in which the shift has , this is the internal shift , and for all . This dictionary is used without further comment in every shifted formula on this page.
Depends on
Used by
- Standard graph bimodules, support filtrations and characters Definition
- The rank-two longest type-A Soergel bimodule Definition
- The Soergel bimodule Bᵢ of a simple reflection Definition
- The type-A diagrammatic Soergel category and its candidate bimodule functor Definition
- The rank-one Soergel category Example
- The type A₂ rank-two Soergel decomposition Example
- Distant Soergel generators commute Lemma
- Frobenius biadjunction for the type-A Soergel generators Lemma
- Soergel generators and Bott–Samelson products are finite free on both sides Lemma
- The rank-one Soergel bimodule square splits Lemma
- The standard basis of the type-A Hecke algebra and its multiplication rule Lemma
- The type-A diagrammatic relations hold for Soergel bimodules Lemma
- Type-A graph-bimodule extension vanishing Lemma
- Indecomposable type-A diagrammatic Soergel objects are indexed by permutations and shifts Theorem
- Rank-two type-A Soergel bimodule decompositions Theorem
- The type-A diagrammatic and bimodule Soergel categories are equivalent Theorem
Dependency tree · two levels
10 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–Williamson, Soergel Calculus, §§3, 5–7 (standard reference, not scraped)
- Libedinsky, Gentle Introduction to Soergel Bimodules I, §§2–5 (standard reference, not scraped)