Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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) Structural proofs. The definition fixes graph bimodules, canonical support flags and character conventions. The following items supply their structural results locally: Bott–Samelson bimodules carry delta and nabla support filtrations proves generator closure and both flag recursions; Special Bott–Samelson Hom formula before reflection localization proves the two flagged Bott–Samelson Hom cases; Type-A top support layers are controlled by reflection localization proves the four-layer freeness, reflection-localized image equalities and right splitting; and The type-A Soergel Hom formula extends the flagged Hom calculation to arbitrary Soergel summands. These links locate proofs rather than adding imported theorems to this definition's assumptions.

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