OctoInformBeta

OpenAI preprint, September 2026 · §6. Reciprocity and the simultaneous induction · §6

A nonnegative comparison (6.1) to (6.3): The scaled stalk characters on [u,b][u,b] satisfy cˆ(t)≤R̃′(t−1−t)cˆ(t−1)\hat c(t)\le\tilde R'(t^{-1}-t)\,\hat c(t^{-1}) entrywise for 0<t<10<t<1, with R̃′\tilde R' read through ι\iota

Free terminal kernels bound stalk characters through normalized R-polynomials.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Let (W,S)(W,S) and (W′,S′)(W',S') be Coxeter systems of finite rank, u≤bu\le b in WW, and ι:[u,b]→[u′,b′]\iota:[u,b]\to[u',b'] an order isomorphism onto a Bruhat interval of W′W'. Fix the moment-graph sheaf B(b)B(b) on the Bruhat graph of [1,b][1,b], a boundary sheaf in the sense defined below, with free stalks BxB^x; the graded ranks cxc_x of the stalks are the stalk characters. The question is how the stalk characters on [u,b][u,b], read at a real tt with 0<t<10<t<1, are bounded by the same characters read at t−1t^{-1}, with the normalized R-polynomials R̃ι(x),ι(y)′\tilde R'_{\iota(x),\iota(y)} of the image interval as coefficients. The tools are the kernels cut out in the stalks by some of the upward edge conditions, their Hilbert series, and an order on the edges of [u,b][u,b] carried back along ι\iota from a reflection order of W′W'.

Edges, Roots and Schedules

The Bruhat graph of [u,b][u,b] has the elements of [u,b][u,b] as vertices, and as edges the pairs e:x→ye:x\to y of elements of [u,b][u,b] with yx−1yx^{-1} a reflection and ℓ(x)<ℓ(y)\ell(x)<\ell(y), where ℓ\ell is the length function of (W,S)(W,S), all such pairs and not only the covers.✦ The element xx is the source of ee✦, yy its target✦, and the reflection yx−1yx^{-1} its label✦. The upward edges at xx are the edges with source xx, and UxU_x is the set of all of them.✦

The Bruhat order on WW is the strong order: the reflexive transitive closure of the relation x→yx\to y for y=txy=tx with tt a reflection and ℓ(x)<ℓ(y)\ell(x)<\ell(y).✦ The interval [u,b][u,b] is the set of x∈Wx\in W with u≤x≤bu\le x\le b.✦

Write S={si:i∈I}S=\{s_i:i\in I\} for the generators of WW and mijm_{ij} for the entries of the Coxeter matrix of (W,S)(W,S). Let αi\alpha_i, i∈Ii\in I, be the coordinate vectors of ℝI\mathbb R^I and (,)(\ ,\ ) the Tits form, with (αi,αj)=−2cos⁡(π/mij)(\alpha_i,\alpha_j)=-2\cos(\pi/m_{ij}). Roots are the real roots w(αi)w(\alpha_i) of the Tits representation of WW on ℝI\mathbb R^I, in which sis_i acts by v↦v−(αi,v)αiv\mapsto v-(\alpha_i,v)\,\alpha_i. A root is positive when its coordinates are nonnegative, its height ht(γ)\mathrm{ht}(\gamma) is the sum of its coordinates, and the positive root αr\alpha_r of a reflection rr is the positive root w(αi)w(\alpha_i) with r=wsiw−1r=ws_iw^{-1}. The root αe\alpha_e of an edge is the positive root of its label.✦

The extended realization is V=ℝI×K*V=\mathbb R^I\times K^*, with KK the radical of the Tits form, and AA is the real polynomial ring in the NN coordinates of a chosen basis of VV, graded with every variable in degree one; A+A_+ is the ideal generated by its homogeneous elements of positive degree. A root γ\gamma, placed in VV as (γ,0)(\gamma,0), is a linear form in AA, and αe\alpha_e is the label of the edge ee in AA.

The geometric functional of a Coxeter system of finite rank is a fixed linear functional ff on ℝI\mathbb R^I whose slope f(γ)/ht(γ)f(\gamma)/\mathrm{ht}(\gamma) takes distinct values on distinct positive roots γ\gamma.✦ For a positive root γ\gamma, sγs_\gamma denotes the reflection of WW whose positive root is γ\gamma.✦ For x∈Wx\in W and a positive root γ\gamma, a half root of γ\gamma at xx is a positive root β≠γ\beta\ne\gamma such that sγ(β)s_\gamma(\beta) is negative, neither β\beta nor its partner β′=−sγ(β)\beta'=-s_\gamma(\beta) is made negative by x−1x^{-1}, and the slope of β\beta is smaller than that of β′\beta'.✦ For a plane PP through γ\gamma, mPm_P is the number of half roots β\beta with ℝγ+ℝβ=P\mathbb R\gamma+\mathbb R\beta=P✦, and βP\beta_P is a positive root chosen with ℝγ+ℝβP=P\mathbb R\gamma+\mathbb R\beta_P=P✦. The edge factor of an edge e:x→ye:x\to y is the product of linear forms πe=∏P:mP≠0βPmP∈A,\pi_e=\prod_{P:\,m_P\ne0}\beta_P^{\,m_P}\in A,(1)✦ taken for γ=αe\gamma=\alpha_e at the source xx.

An edge e:x→ye:x\to y of [u,b][u,b] is carried by ι\iota to the edge ι(x)→ι(y)\iota(x)\to\iota(y) of the Bruhat graph of W′W'.✦ The transported schedule (e1,…,em)(e_1,\dots,e_m) lists the edges of [u,b][u,b] in decreasing order for the reflection order of W′W' carried back along ι\iota: an edge is placed by the slope of the root of its image, for the geometric functional of (W′,S′)(W',S'), larger slopes first.✦ The chronological schedule is the reversed list (em,…,e1)(e_m,\dots,e_1).✦

For a set ZZ, elements x,yx,y of ZZ and a weight TT in a commutative semiring CC, let ExyE_{xy} be the matrix unit with entry one at (x,y)(x,y) and zero elsewhere; the elementary transfer 1+TExy1+TE_{xy} acts on vectors v∈CZv\in C^Z by ((1+TExy)v)z=vz+δz,xTvy.\bigl((1+TE_{xy})\,v\bigr)_z=v_z+\delta_{z,x}\,T\,v_y .(2)✦

The dispatch of a list p=(e1,…,em)p=(e_1,\dots,e_m) of edges of [u,b][u,b] with weight TT is the product Πp(T)=(1+TEe1)(1+TEe2)⋯(1+TEem),\Pi_p(T)=(1+TE_{e_1})(1+TE_{e_2})\cdots(1+TE_{e_m}),(3)✦ with Ee=ExyE_e=E_{xy} for e:x→ye:x\to y, so that the last edge acts first; Πι(T)\Pi_\iota(T) is the dispatch of the transported schedule.

Kazhdan-Lusztig and R-polynomials

For x,y∈Wx,y\in W, the length difference is d(x,y)=ℓ(y)−ℓ(x)d(x,y)=\ell(y)-\ell(x), a natural number when x≤yx\le y.✦

The normalized R-polynomials come from the Hecke algebra of (W′,S′)(W',S') over ℤ[q]\mathbb Z[q] with parameter a=−qa=-q. The Hecke algebra of (W′,S′)(W',S') over ℤ[q]\mathbb Z[q] acts on the free ℤ[q]\mathbb Z[q]-module with basis (Hw)w∈W′(H_w)_{w\in W'}, the generator HsH_s, s∈S′s\in S', sending HwH_w to Hsw+aHwH_{sw}+aH_w when ℓ(sw)<ℓ(w)\ell(sw)<\ell(w) and to HswH_{sw} otherwise, so that Hs2=1+aHsH_s^2=1+aH_s; Hs−1H_s^{-1} is the operator Hs−aH_s-a. For w∈W′w\in W' with a chosen reduced expression w=s1⋯skw=s_1\cdots s_k, HwH_w is the operator Hs1⋯HskH_{s_1}\cdots H_{s_k}, and the bar image of HyH_y is Hy¯=Hy−1−1H1\overline{H_y}=H_{y^{-1}}^{-1}H_1. The normalized R-polynomial R̃x,y′∈ℤ[q]\tilde R'_{x,y}\in\mathbb Z[q] of (W′,S′)(W',S') is the coefficient of HxH_x in Hy¯\overline{H_y}.

The Kazhdan-Lusztig polynomials Px,yP_{x,y} of (W,S)(W,S) are the second family of a pair (R,P)(R,P) of families in ℤ[q]\mathbb Z[q], indexed by W×WW\times W, that satisfies the normalization conditions: Rx,x=Px,x=1R_{x,x}=P_{x,x}=1; Rx,y=Px,y=0R_{x,y}=P_{x,y}=0 unless x≤yx\le y; for s∈Ss\in S with ℓ(sy)<ℓ(y)\ell(sy)<\ell(y), Rx,y=Rsx,syR_{x,y}=R_{sx,sy} if ℓ(sx)<ℓ(x)\ell(sx)<\ell(x) and Rx,y=(q−1)Rx,sy+qRsx,syR_{x,y}=(q-1)R_{x,sy}+qR_{sx,sy} otherwise; 2deg⁡Px,y<d(x,y)2\deg P_{x,y}<d(x,y) when x<yx<y; and qd(x,y)Px,y(q−1)=∑z∈[x,y]Rx,zPz,yq^{d(x,y)}P_{x,y}(q^{-1})=\sum_{z\in[x,y]}R_{x,z}P_{z,y} when x≤yx\le y.

Sheaves, Kernels and Hilbert Series

A graded sheaf BB on the Bruhat graph of [u,b][u,b] assigns to each vertex xx a finitely generated graded AA-module Bx=⨁nBnxB^x=\bigoplus_nB^x_n, zero in negative degrees, its stalk; to each edge e:x→ye:x\to y such a module BeB^e, its edge module; and to ee two degree-preserving AA-linear restrictions ρx,e:Bx→Be\rho_{x,e}:B^x\to B^e and ρy,e:By→Be\rho_{y,e}:B^y\to B^e.✦ A global section is a family (mx)(m_x) of elements mx∈Bxm_x\in B^x with ρx,e(mx)=ρy,e(my)\rho_{x,e}(m_x)=\rho_{y,e}(m_y) for every edge e:x→ye:x\to y.✦

A boundary sheaf with top vertex bb is a graded sheaf BB with free stalks and with Bb=AB^b=A that satisfies four conditions: for every edge e:x→ye:x\to y, ρy,e\rho_{y,e} is onto with kernel αeBy\alpha_eB^y, so that Be=By/αeByB^e=B^y/\alpha_eB^y; every family compatible along the edges inside a set Ω\Omega of vertices that contains the target of each edge whose source it contains agrees on Ω\Omega with a global section (edge flabbiness); every element of every stalk is the value of a global section; and for x≠bx\ne b the kernel of Bx→⨁e∈UxBeB^x\to\bigoplus_{e\in U_x}B^e lies in A+BxA_+B^x (kernel minimality).✦

The restriction of B(b)B(b) to [u,b][u,b] is the pullback of B(b)B(b) along the inclusion of [u,b][u,b] into [1,b][1,b]: the boundary sheaf on the Bruhat graph of [u,b][u,b] with the same stalks and edge modules at the same elements and edges. The stalk character cx∈ℤ[q]c_x\in\mathbb Z[q] at x∈[1,b]x\in[1,b] is the graded rank of the stalk of B(b)B(b): cx=∑iqdic_x=\sum_iq^{d_i} for a basis of BxB^x over AA of homogeneous elements of degrees did_i.✦ The scaled stalk characters and the scaled Kazhdan-Lusztig polynomials are the vectors indexed by [u,b][u,b] with entries cˆx(t)=tℓ(x)−ℓ(b)cx(t2),Pˆx(t)=tℓ(x)−ℓ(b)Px,b(t2).\hat c_x(t)=t^{\ell(x)-\ell(b)}\,c_x(t^2),\qquad \hat P_x(t)=t^{\ell(x)-\ell(b)}\,P_{x,b}(t^2).(4)

In a graded sheaf BB, the upward kernel of a set FF of upward edges at xx is the AA-submodule Lx(F)={m∈Bx:ρx,e(m)=0 for all e∈F}L_x(F)=\{m\in B^x:\rho_{x,e}(m)=0\text{ for all }e\in F\} of BxB^x.✦ For an edge e:x→ye:x\to y, a set FF of upward edges at xx and a set HH of upward edges at yy, the lower image ρx,e(Lx(F))\rho_{x,e}(L_x(F)) and the upper image ρy,e(Ly(H))\rho_{y,e}(L_y(H)) are submodules of BeB^e. The Hilbert series of Lx(F)L_x(F) at a real qq is Hilb(Lx(F);q)=∑n∈ℤdim⁡ℝ(Lx(F)∩Bnx)qn\mathrm{Hilb}(L_x(F);q)=\sum_{n\in\mathbb Z}\dim_{\mathbb R}(L_x(F)\cap B^x_n)\,q^n✦, and its normalized form is the real number hx(F;t)=(1−t2)Ntℓ(x)−ℓ(b)Hilb(Lx(F);t2).h_x(F;t)=(1-t^2)^N\,t^{\ell(x)-\ell(b)}\,\mathrm{Hilb}\bigl(L_x(F);t^2\bigr).(5)✦

The schedule state of a list pp of edges of [u,b][u,b] is the vector Dp(t)D^p(t) indexed by [u,b][u,b] with Dxp(t)=hx(Fp(x);t)D^p_x(t)=h_x(F_p(x);t), where Fp(x)F_p(x) is the set of upward edges at xx that occur in pp.✦ For the empty list, Dx⌀(t)=hx(⌀;t)D^\varnothing_x(t)=h_x(\varnothing;t) measures the whole stalk; for the chronological schedule, which contains every edge, Dxch(t)=hx(Ux;t)D^{\mathrm{ch}}_x(t)=h_x(U_x;t).

A duality pairing on the module Γ\Gamma of global sections of B(b)B(b) over [1,b][1,b] is an AA-linear isomorphism m↦⟨m,⋅⟩m\mapsto\langle m,\cdot\rangle of Γ\Gamma onto its AA-dual such that, for every vertex xx, the cut at xx, sending mm to the section equal to αmx\alpha m_x at xx and to zero elsewhere, with α\alpha the product of all edge labels, is self-adjoint for ⟨,⟩\langle\ ,\ \rangle.✦ A duality pairing ⟨,⟩\langle\ ,\ \rangle has degree −ℓ(b)-\ell(b) when ⟨m,n⟩∈Ai+j−ℓ(b)\langle m,n\rangle\in A_{i+j-\ell(b)} for every mm homogeneous of degree ii and every nn homogeneous of degree jj.

The Claim

Theorem 1. Let 0<t<10<t<1.

(a) Let MM be a finitely generated graded module over a polynomial ring in finitely many variables over a field kk, with homogeneous pieces MnM_n. For 0<q<10<q<1 its Hilbert series converges: ∑n∈ℤdim⁡kMnqn<∞.\sum_{n\in\mathbb Z}\dim_kM_n\,q^n<\infty .(6)✦

(b) Let BB be a boundary sheaf with top vertex bb on the Bruhat graph of [u,b][u,b], let e:x→ye:x\to y be an edge, FF a set of upward edges at xx and HH a set of upward edges at yy, and suppose that the lower image of Lx(F)L_x(F) lies in the edge factor (1) times the upper image of Ly(H)L_y(H): ρx,e(Lx(F))⊆πeρy,e(Ly(H))\rho_{x,e}(L_x(F))\subseteq\pi_e\,\rho_{y,e}(L_y(H)). Then the normalized Hilbert series (5) satisfy hx(F;t)≤hx(F∪{e};t)+(t−1−t)hy(H;t).h_x(F;t)\le h_x(F\cup\{e\};t)+(t^{-1}-t)\,h_y(H;t).(7)✦

(c) Let ZZ be a set, T≥0T\ge0 a real number, (xk,yk)k≥0(x_k,y_k)_{k\ge0} a sequence of pairs of elements of ZZ, and D0,…,DnD_0,\dots,D_n vectors in ℝZ\mathbb R^Z with Dk+1≤(1+TExkyk)DkD_{k+1}\le(1+TE_{x_ky_k})D_k entrywise for every k<nk<n, the transfers being those of (2). Then DnD_n lies below the ideal state, the vector obtained from D0D_0 by the same transfers taken with equality: Dn≤(1+TExn−1yn−1)⋯(1+TEx0y0)D0.D_n\le(1+TE_{x_{n-1}y_{n-1}})\cdots(1+TE_{x_0y_0})\,D_0 .(8)✦

(d) Let BB be the restriction of B(b)B(b) to [u,b][u,b], and suppose that for every edge e:x→ye:x\to y of [u,b][u,b] the terminal kernel Ly(Fe)L_y(F_e) at its target is a free AA-module, FeF_e being the set of upward edges at yy that come after ee in the chronological schedule. Then the schedule states of the empty list and of the chronological schedule satisfy, entrywise and with the dispatch (3), D⌀(t)≤Πι(t−1−t)Dch(t).D^\varnothing(t)\le\Pi_\iota(t^{-1}-t)\,D^{\mathrm{ch}}(t).(9)✦

(e) Let CC be a commutative semiring, T∈CT\in C and v∈C[u,b]v\in C^{[u,b]}, with the integer coefficients of R̃′\tilde R' read in CC. Then for every x∈[u,b]x\in[u,b], (Πι(T)v)x=∑y∈[u,b]R̃ι(x),ι(y)′(T)vy.\bigl(\Pi_\iota(T)\,v\bigr)_x=\sum_{y\in[u,b]}\tilde R'_{\iota(x),\iota(y)}(T)\,v_y .(10)✦

(f) Under the freeness hypothesis of (d), the scaled stalk characters (4) satisfy, entrywise, cˆ(t)≤Πι(t−1−t)cˆ(t−1).\hat c(t)\le\Pi_\iota(t^{-1}-t)\,\hat c(t^{-1}).(11)✦

(g) Suppose, besides the freeness hypothesis of (d), that cx=Px,bc_x=P_{x,b} for every x∈[1,b]x\in[1,b] and that the global sections of B(b)B(b) carry a duality pairing of degree −ℓ(b)-\ell(b). Then the scaled Kazhdan-Lusztig polynomials satisfy, entrywise, Pˆ(t)≤Πι(t−1−t)Pˆ(t−1).\hat P(t)\le\Pi_\iota(t^{-1}-t)\,\hat P(t^{-1}).(12)✦

In the paper, the result reads: with Dx=q−d(x,b)/2(1−q)NHilb(Lx(Hx);q)D_x=q^{-d(x,b)/2}(1-q)^N\,\mathrm{Hilb}(L_x(H_x);q) for a set HxH_x of upward edges at xx, which is hx(Hx;t)h_x(H_x;t) at q=t2q=t^2, and with the edges processed in schedule order, each step raises DxD_x by at most TDyT D_y, where T=q−1/2−q1/2T=q^{-1/2}-q^{1/2}; the product of the matrices 1+TExy1+TE_{xy} counts decreasing paths, so that the vector pp of Kazhdan-Lusztig polynomials satisfies p(q)≤R̃′(T)p(q−1)p(q)\le\tilde R'(T)\,p(q^{-1}) entrywise.

What Is Checked

The claim is stated over the Bruhat graph of [u,b][u,b] with all its reflection edges and their root labels αe\alpha_e in AA; over boundary sheaves on that graph and the fixed sheaf B(b)B(b), restricted from [1,b][1,b], with its stalk characters cxc_x; over the upward kernels Lx(F)L_x(F), their Hilbert series and the normalized series hx(F;t)h_x(F;t); over the edge factors πe\pi_e built from half roots; over the transported schedule, ordered by the geometric functional of (W′,S′)(W',S'), with its dispatch Πι\Pi_\iota; over the normalized R-polynomials of (W′,S′)(W',S') read from the bar involution of its Hecke algebra; and, in (12), over the Kazhdan-Lusztig polynomials of the normalization conditions and a duality pairing on the global sections of B(b)B(b).

About these constructions the library proves that a boundary sheaf with top vertex bb exists on the Bruhat graph of every interval [u,b][u,b]✦, that the inclusion of [u,b][u,b] into [1,b][1,b] is injective on vertices✦ and lifts every edge of [1,b][1,b] leaving the image of a vertex✦, and that the pullback of a boundary sheaf along such a map is again a boundary sheaf.✦ It proves that the label of every edge is a reflection✦, that r↦αrr\mapsto\alpha_r is a bijection from the reflections onto the positive roots✦, that the reflections v↦v−(αi,v)αiv\mapsto v-(\alpha_i,v)\,\alpha_i satisfy the Coxeter relations✦, that a geometric functional exists✦, and that a positive root has finitely many half roots at every x∈Wx\in W.✦ It proves as well that Hs−aH_s-a is a two-sided inverse of HsH_s, that a free, finitely generated graded module over a polynomial ring, zero in negative degrees, has a basis of homogeneous elements✦, and that α\alpha times the value of a global section at one vertex, extended by zero, is again a global section.✦ It proves also that, in a graded sheaf satisfying the quotient condition, each edge label annihilates its edge module, so that the product of all the edge labels annihilates every edge module, and that the global sections of a graded sheaf are closed under taking homogeneous components. It proves, moreover, that the Bruhat order is reflexive and that the identity lies below every element of WW, that (αi,αi)=2(\alpha_i,\alpha_i)=2 for the Tits form, and that the homogeneous part of AA of every negative degree is zero.