Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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.

Standard graph bimodules, support filtrations and characters

Definition

Graphs and supports. Keep k=Q, R=Q[x1,…,xn] with deg⁡xi=2, and the affine scheme V=Akn=Spec⁡R, whose k-points are V(k)=kn. Use the place-permuting action of Sn from The standard type-A reflection realization and its polynomial ring. For w∈Sn let Gr(w):=Graph⁡(w:V→V)⊆V×kV,Gr(w)(k)={(wλ,λ):λ∈kn},Gr(A):=⋃w∈AGr(w)  (A⊆Sn), so that V×kV=Spec⁡(R⊗kR) and Gr(w) is the graph of the map λ↦wλ. A graded (R,R)-bimodule M is the same thing as a graded module over R⊗kR, and the support of m∈M is the zero set supp⁡(m):=V(Ann⁡(m))⊆V×V of its annihilator ideal in R⊗kR. For A⊆Sn put ΓAM:={m∈M:supp⁡(m)⊆Gr(A)}, a graded sub-bimodule of M. Since Gr(A) is closed with radical ideal I(Gr(A))=⋂w∈AI(Gr(w)) (an intersection of prime ideals, since each Gr(w) is a linear subspace of V×V complementing the second factor), an element m lies in ΓAM exactly when I(Gr(A))Nm=0 for some N≥0: this is the Nullstellensatz together with the Noetherianity of R⊗kR. The ideal itself need not annihilate such an element — in (R⊗kR)/I(Gr(e))2 the class of 1 is supported on Gr(e) but is not killed by I(Gr(e)) — which is why the criterion is stated with a power of the ideal. For i∈Z we write Γ≥iM:=Γ{x:ℓ(x)≥i}M,Γ≤iM:=Γ{x:ℓ(x)≤i}M, using the length function of Type-A reduced words and the Coxeter presentation, while for y∈Sn the y-indexed symbols denote the Bruhat principal-set cutoffs of Soergel's Notation 6.1, Γ≤yM:=Γ{x: x≤y}M,Γ<yM:=Γ{x: x<y}M,Γ≥yM:=Γ{x: x≥y}M,Γ>yM:=Γ{x: x>y}M, with ΓyM:=Γ{y}M the elements concentrated on the single graph Gr(y) and Γ≠yM:=ΓSn∖{y}M the elements concentrated off Gr(y). The integer-indexed symbols of the previous display are the length cutoffs used to define the flags below, and they must not be confused with the element-indexed Bruhat cutoffs: for y=s1 in S4 the submodule Γ≤1M contains Gr(s3) while Γ≤yM=Γ{e,s1}M does not, and the two cutoffs agree at the extremes, Γ≤w0=Γ≤ℓ(w0)=M and Γ<e=Γ≤−1=0. So ΓyM:=M/Γ≠yM is Soergel's y-layer quotient; following Soergel's Notation 6.1 we write the two y-layer quotients with an underline, Γ‾≤yM:=Γ≤yM/Γ<yM,Γ‾≥yM:=Γ≥yM/Γ>yM, so that Γ‾≤yM is the quotient of the lower support submodule by Γ<yM and Γ‾≥yM the quotient of the upper support submodule by the part supported strictly above Gr(y).

Standard bimodules. For w∈Sn let Rw be the graded (R,R)-bimodule which equals R as a graded k-vector space and has f⋅x=fx,x⋅g=w(g) x(f,g,x∈R), where w(g)(λ):=g(w−1λ); Rw is generated by the element 1 of degree 0. Write (k) for the external shift M(k):=M{−k} of Associative graded algebras, bimodules, and internal shifts, so that M(k)d=Md+k; this is the shift convention of the type-A sources, and it is the one in which Bi=R⊗RsiR(1) of The Soergel bimodule Bi of a simple reflection has 1⊗1 of degree −1. Put Δw(d):=Rw(d−ℓ(w)),∇w(d):=Rw(d+ℓ(w))(d∈Z), so that Δw(d) is the standard bimodule Rw with its generator in degree ℓ(w)−d, and ∇w(d) is Rw with its generator in degree −ℓ(w)−d. Thus Δw(0)=Rw{ℓ(w)}, ∇w(0)=Rw{−ℓ(w)} and Δe(d)=∇e(d)=R(d) is generated in degree −d; in particular Δe(0)=∇e(0)=Re=R.

For graded free R-modules in this type-A page, a homogeneous free generator of degree a contributes va to graded rank. This is the v↦v−1 transform of Soergel's rank convention in his Notation 5.2; all rank formulas below use this convention.

Support filtrations. A Δ-flag of a graded R-bimodule M is a finite chain 0=M0⊆M1⊆⋯⊆Mk=M of graded sub-bimodules which refines the length filtration M=Γ≥0M⊇Γ≥1M⊇⋯⊇Γ≥ℓ(w0)+1M=0 of M (here Γ≥0M=M for every bimodule supported on Gr(Sn)=⋃wGr(w), which all bimodules of this page are, and Γ≥iM=0 for i>ℓ(w0) because no graph Gr(x) with ℓ(x)>i remains) and whose successive quotients are standard bimodules Mj/Mj−1≅Rxj{aj}. We require each length layer to be a finite direct sum of shifted graph bimodules of that length, as in Soergel's Definition 5.4. Thus the quotients carry a numbering with ℓ(x1)≥⋯≥ℓ(xk) and each Rxj{aj} is one graph, so that M has a "support flag" in the sense of Soergel's FΔ. A ∇-flag has the same direct-sum condition on its length layers, with the reverse length filtration Γ≤iM and ℓ(x1)≤⋯≤ℓ(xk). The refinement condition is a condition on supports, not an ordering of incomparable quotients of equal length; only the lengths are ordered. For i=ℓ(x) the graded multiplicity is (M:Δx(d)):=multiplicity of Δx(d) in Γ≥iM/Γ≥i+1M, and, for a ∇-flag, (M:∇x(d)) is the multiplicity of ∇x(d) in Γ≤iM/Γ≤i−1M; a priori both symbols refer to a chosen compatible enumeration (the next items on this page prove that they do not depend on it). With Tx the Hecke basis of The standard basis of the type-A Hecke algebra and its multiplication rule and T~x:=vℓ(x)Tx, the character sums attached to a flag are hΔ(M):=∑x,d(M:Δx(d)) vd T~x,h∇(M):=∑x,d(M:∇x(d)) v−d T~x, and they are used only through the items that prove these sums intrinsic.

Small n. For n≤1 there is a single element e and every object is a finite direct sum of shifts ⨁jR(dj). Its one-graph flags have these summands as quotients, so hΔ=∑jvdjT~e and h∇=∑jv−djT~e; in particular both characters send the unit R to 1.

Remark

(a) Maps between standard bimodules. For v,w∈Sn and a,b∈Z, Hom⁡R-R(Rv(a),Rw(b))≅{R(b−a),v=w,0,v≠w, where R(c) denotes the free graded R-module on one generator of degree −c. Indeed a bimodule map is determined by φ(1)=h∈R, and f⋅1⋅g↦f h w(g) must equal v(g) f h; since R is a domain this forces v(g)h=w(g)h for all g, hence h=0 or v=w. The generator 1 of Rv(a) has degree −a and maps to h, which has degree deg⁡h−b as an element of Rw(b), so the homogeneous map φh has degree deg⁡h+a−b and Hom⁡(Rv(a),Rw(b))≅R(b−a) in the case v=w.

(b) Composition. The R-balanced assignment Rw⊗RRv⟶Rwv,a⊗b⟼a w(b), where w(b)(λ)=b(w−1λ) and the product is taken in R, is a well-defined degree-zero isomorphism of graded (R,R)-bimodules. It is well defined because for f∈R the relation (a⋅f)⊗b=a⊗(fb) reads w(f)a⊗b=a⊗fb and maps to w(f) a w(b)=a w(f)w(b) on both sides; it is left R-linear, and it respects the right actions because w(bh)=w(b)w(h) for h∈R. It sends the 1-tensor 1⊗1 of degree 0 to 1 and is therefore surjective, and both sides are free of rank one as left R-modules, so it is an isomorphism. In particular Rw⊗RRv≅Rwv (and Rw⊗RRv≅Rw only when v=e), while tensoring with w=e shows that the assignment is compatible with the unit. The single assignment 1⊗1↦1 does extend uniquely to a bimodule map, and the map it extends to is exactly the twisted one above; what fails is the untwisted formula a⊗b↦ab, which is not balanced when w≠e: the equality (1⋅f)⊗1=1⊗f in Rw⊗RRv would map to w(f) on the left and f on the right, and these differ for a polynomial moved by w.

(c) The rank-one calculus. Let s=si, Rs=Rsi, α=αi, δ:=α/2, and Bs=R⊗RsR(1) with the images u:=1⊗1 of degree −1 and w0:=1⊗δ of degree 1 (The Soergel bimodule Bi of a simple reflection); these two elements form a graded left R-basis of Bs, and every g∈R has a unique decomposition g=g++δg− with g±∈Rs, given by g+=12(g+s(g)). The right action on the basis is u⋅g=g+u+g−w0,w0⋅g=δ2g−u+g+w0, as follows from 1⊗g=1⊗(g++δg−)=g+u+g−w0 and δg=δg++δ2g− with δ2=α2/4∈Rs. Hence (δu+w0)⋅g=g (δu+w0),(δu−w0)⋅g=s(g)(δu−w0), so R(δu+w0)≅R(−1) and R(δu−w0)≅Rs(−1) are sub-bimodules of Bs, generated in degree 1. Moreover for f,h∈R one has (fu+hw0)↦f+hδ under f⊗g↦fg and (fu+hw0)↦f−hδ under f⊗g↦fs(g), because 1⊗g=g+u+g−w0 and s(g)=g+−δg−; both maps are surjective, their kernels are the two displayed sub-bimodules, and all four maps of 0→R(−1)→  1↦δu+w0  Bs→  f⊗g↦fs(g)  Rs(1)→0, 0→Rs(−1)→  1↦δu−w0  Bs→  f⊗g↦fg  R(1)→0 are degree zero: sources and targets are generated in degree whose shifts match the degree-1 elements δu±w0∈Bs. Finally the two quotients are the image of u, a free rank-one R-module with right action u⋅g≡gu modulo δu−w0 and u⋅g≡s(g)u modulo δu+w0 respectively, that is R(1) and Rs(1).

(d) Imported statements of Soergel, recorded for the later items. The later items of this page cite the following results of Soergel's Kazhdan–Lusztig-Polynome und unzerlegbare Bimoduln through this definition; we record their content here, in the notation fixed above, so that every later citation has a textual anchor in this item. Let B be Soergel's category of special bimodules (Definition 5.11). The concrete criterion of Lemma 5.13 is that B∈B precisely when B⊕C≅D for finite sums C,D of shifted Bott–Samelson products. It does not say that B itself is such a sum. Let add⁡B be the category of direct summands of special bimodules (Bemerkung 6.12). Since every special bimodule is a summand of such a D, and every word is special, this is exactly the idempotent completion defining SBimn.

  1. Closure under tensoring with a generator. (Proposition 5.7(1) and Proposition 5.9(1).) If M∈FΔ then R⊗RsM∈FΔ, and if M∈F∇ then R⊗RsM∈F∇; in both cases the quotients of the resulting flag are again standard bimodules, indexed by the quotients of the flag of M. Moreover (the proofs of the same two propositions) the multiplicities of the new flag are given, for ℓ(x)>ℓ(sx), by the recursions (Bs⊗RM:Δx(d))=(M:Δx(d+1))+(M:Δsx(d)),(Bs⊗RM:Δsx(d))=(M:Δx(d))+(M:Δsx(d−1)), and dually (Bs⊗RM:∇x(d))=(M:∇x(d−1))+(M:∇sx(d)),(Bs⊗RM:∇sx(d))=(M:∇x(d))+(M:∇sx(d+1)). In Notation 5.6 the source uses the shifted reflection functor θs=R[1]⊗Rs(−)=Bs⊗R−, with [1]=(1)={−1}. Read in the other direction, the two recursions say that a flag quotient of M with graph y and index e produces the two quotients with graphs sy and y of Bs⊗RM: the quotient with graph sy carries the same index e, while the index of the quotient with graph y changes by −1 in the Δ-chart when ℓ(y)>ℓ(sy) and by +1 when ℓ(sy)>ℓ(y), the two signs being exchanged in the ∇-chart. The two pairs match the two Hecke expansions of (T~s+v)hΔ(M) and (T~s+v)h∇(M) in the basis {T~x}, which is the source's own interpretation of the recursions.

  2. Stability of the flag categories. (Bemerkung 5.5.) The layers Γ≥iM/Γ≥i+1M are additive in M, so FΔ is stable under finite direct sums and, by the graded Krull–Schmidt theorem, under direct summands as well; the same holds for F∇ with the filtration Γ≤i.

  3. Localization at a reflection. (Notation 6.9 and Lemma 6.10.) For a reflection t let R(t) be the localization of R at the homogeneous functions that do not vanish identically on the reflection hyperplane Vt. For every special bimodule B its localization B⊗RR(t) is a direct summand of a finite direct sum of graded shifts of Ry⊗RR(t) and Ry,yt⊗RR(t), for y<yt. Here Ry,yt:=(R⊗kR)/(I(Gr(y))∩I(Gr(yt))) is the coordinate bimodule of the union of the two graphs. The two-graph module generally does not split into its two graph modules over R(t): their common reflection equation has not been inverted. After additionally inverting that equation, the two graphs separate and the two-graph piece splits.

  4. Sections have graph support, and the four layers. (Bemerkung 6.2.) Let a graded bimodule carry a finite filtration by sub-bimodules whose successive quotients are single graphs Gr(x). For any section m, filter its cyclic (R⊗kR)-submodule C=(R⊗kR)m by intersecting with the given filtration. Each successive quotient of this induced filtration embeds in a single-graph module. Every nonzero submodule of a single-graph module has that same support, since its coordinate ring is the domain R; a zero quotient has empty support. Support is the union of the supports of the successive quotients in a finite filtration, so supp⁡(m)=supp⁡(C) is a union of graphs Gr(x) with x∈Sn. Consequently ΓyB∩Γ≠yB=0, so the evident maps ΓyB→Γ‾≤yB and Γ‾≥yB→ΓyB (the second is the composite of the quotient map onto Γ≥yB/Γ>yB with the inclusion of that quotient in B/Γ≠yB, which is defined because Γ>yB⊆Γ≠yB) are injective, and ΓyB=Γ≤yB∩Γ≥yB. Moreover right multiplication by a nonzero p∈R does not change supports, (ΓAB)p=ΓA(Bp), so the localizations below may be formed layer by layer.

  5. Top-layer localization. (Notation 6.5 and Satz 6.6, extended in Lemma 6.13.) For y∈Sn put py:=∏t: yt<yct, the product over the finitely many reflections t=(a b) with a<b, using the fixed hyperplane equations ct=xa−xb of The standard type-A reflection realization and its polynomial ring. For B∈B the natural morphisms induce isomorphisms ΓyB→(Γ‾≤yB)py and Γ‾≥yB→(ΓyB)py, where ΓyB=B/Γ≠yB is the y-layer quotient of Notation 6.1; the first paragraph of the proof of Lemma 6.13 observes that the isomorphism ΓyN≅(Γ‾≤yN)py of Satz 6.6 holds for all N∈add⁡B as well, and the same holds for the second isomorphism, so both are available for every N∈add⁡B.

  6. Hom formula for the additive closure. (Theorem 5.15, Lemma 6.13 and Satz 6.14(4).) For M∈FΔ and N∈add⁡B, and likewise for M∈add⁡B and N∈F∇, the graded module Hom⁡R-R(M,N) is free with rk⁡Hom⁡R-R(M,N)=∑x,d,e(M:Δx(d))(N:∇x(e))vd−e, and add⁡B=B by Satz 6.14(4), where B has the stable-sum meaning just specified. For the first step of Lemma 6.13, use item 5 and item 7: the canonical lower layer of N is ⨁μ∇y(μ)⊕(N:∇y(μ)), and its submodule obtained by multiplication by py is ΓyN. Since deg⁡py=2ℓ(y), its graded rank in our convention is ∑μ(N:∇y(μ))vℓ(y)−μ. Item 8 identifies this with Hom⁡(Ry,N); replacing Ry by Δy=Ry(−ℓ(y)) subtracts ℓ(y) from map degrees, giving ∑μ(N:∇y(μ))v−μ, as required. In general one takes x of maximal length with (M:Δx(d))≠0 for some d; then ΓxM↪M↠coker⁡ is a short exact sequence with both outer terms in FΔ and (M:Δy(d))=(ΓxM:Δy(d))+(coker⁡:Δy(d)), and Theorem 5.15 forces the sequence Hom⁡(coker⁡,N)↪Hom⁡(M,N)↠Hom⁡(ΓxM,N) to be exact for every N∈B; being additive in N, it stays exact for every N∈add⁡B, which closes the induction over the length of a Δ-flag of M. The second case is analogous, using the dual maximality argument over a ∇-flag of N.

  7. Bruhat-refining enumerations. (Lemma 6.3 and its proof.) Let B∈F∇ and let y0,y1,… be an enumeration of Sn in which Bruhat-larger elements have larger index; put C(k)={y0,…,yk} and yk=y. Then the evident map Γ≤yB/Γ<yB→ΓC(k)B/ΓC(k−1)B is an isomorphism, both sides are finite direct sums of objects of the form ∇y(μ), and ∇y(μ) occurs in this quotient exactly (B:∇y(μ)) times as a direct summand; the analogous statement holds for FΔ after reversing the enumeration and replacing the lower layer by Γ≥yB/Γ>yB: for a descending Bruhat enumeration z0,z1,…, C′(k)={z0,…,zk} and zk=y, this upper layer maps isomorphically to ΓC′(k)B/ΓC′(k−1)B and is a direct sum of Δy(μ) with multiplicities (B:Δy(μ)). The proof compares two such enumerations through the finitely many steps that swap two adjacent incomparable elements: incomparable elements differ by no reflection, so by the extension-vanishing input there is no Ext1 between the corresponding subquotients, and the two filtrations have the same subquotients up to order.

  8. Freeness over the invariant ring of a graph. (Proposition 6.4.) For B∈B and y∈Sn the graded modules Γ‾≤yB, Γ‾≥yB, ΓyB and ΓyB are free graded right R-modules on which the action of R⊗kR factors through the graph ring Ry; in particular evaluation at the generator gives an isomorphism Hom⁡R-R(Ry,B)≅ΓyB, and B⊗RRx∈FΔ for every x∈Sn.

(e) Opposite bimodules. For a graded (R,R)-bimodule M let Mop be the graded (R,R)-bimodule with the same underlying graded k-module and operations r⋅opm⋅ops=s m r; since R is commutative this is again a graded (R,R)-bimodule, and the following four remarks are used by the later support-filtration items.

  1. The flip m⊗n↦n⊗m is a well-defined degree-zero bijection (M⊗RN)op→Nop⊗RMop, because mr⊗n=m⊗rn maps to n⊗mr=(n⋅opr)⊗m=rn⊗m in Nop⊗RMop.
  2. Rxop≅Rx−1 through m↦x−1(m), and Bsop≅Bs through the flip f⊗g↦g⊗f; both are degree-zero isomorphisms of graded (R,R)-bimodules.
  3. Write τ for the flip of the two factors of V×V. A nonzero element m of a standard bimodule has support exactly the single graph of its standard, since the annihilator of the generator of Rw is the prime ideal I(Gr(w)); for the same reason Ann⁡Mop(m)=σ(Ann⁡M(m)) under the flip σ(f⊗g)=g⊗f, so supp⁡Mop(m)=τ(supp⁡M(m)). Since τ(Gr(x))=Gr(x−1) and ℓ(x−1)=ℓ(x), the length filtrations satisfy Γ≥i(Mop)=Γ≥iM and Γ≤i(Mop)=Γ≤iM as k-submodules.
  4. Consequently a Δ-flag of M with quotients Rxj{aj} is a Δ-flag of Mop with quotients Rxj−1{aj} in the same order, and a ∇-flag of M is a ∇-flag of Mop in the same order: the graph index inverts, the length is unchanged by item 3, and the refined length filtration is preserved by the opposite functor, so this functor preserves each of the two flag categories, M∈FΔ  ⟺  Mop∈FΔ and M∈F∇  ⟺  Mop∈F∇.

Depends on

Used by

Dependency tree · two levels

20 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