OctoInformBeta

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

Polynomial equality: For an order isomorphism ι:[u,b]→[u′,b′]\iota:[u,b]\to[u',b'] that preserves R̃\tilde R and PP on the proper rows, the polynomials being R̃u,b\tilde R_{u,b} and Pu,bP_{u,b}

Two-sided bounds force equal polynomials in the bottom row.

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, with simple reflections sis_i indexed by II and I′I', and let ι:[u,b]→[u′,b′]\iota:[u,b]\to[u',b'] be an order isomorphism of Bruhat intervals; primed symbols belong to (W′,S′)(W',S'). Combinatorial invariance predicts R̃u,b=R̃u′,b′′\tilde R_{u,b}=\tilde R'_{u',b'} and Pu,b=Pu′,b′′P_{u,b}=P'_{u',b'}, where R̃\tilde R and PP are the normalized R-polynomials and the Kazhdan-Lusztig polynomials of the two systems, defined below. The item takes the polynomials to agree under ι\iota on the proper rows, the entries R̃u,z\tilde R_{u,z} with z≠bz\ne b and the entries Py,bP_{y,b} with y≠uy\ne u, and concerns the entry at (u,b)(u,b) itself. There the two sides are compared as real numbers, in both directions, as functions of t=q1/2t=q^{1/2} with 0<t<10<t<1, through T=t−1−tT=t^{-1}-t.

Bruhat Graphs and Transfer Products

The Bruhat graph of [u,b][u,b] has the elements of [u,b][u,b] as vertices and an edge e:x→ye:x\to y for every upward step between two of them, that is, a step x→txx\to tx with tt a reflection that raises the length, covers or not; xx is its source, yy its target, t=yx−1t=yx^{-1} its label, and x<yx<y.✦

The Tits form on ℝI\mathbb R^I of (W,S)(W,S) is the bilinear form with ⟨αi,αj⟩=−2cos⁡(π/mij)\langle\alpha_i,\alpha_j\rangle=-2\cos(\pi/m_{ij}) on the coordinate vectors αi\alpha_i, the simple roots, where mijm_{ij} is the order of sisjs_is_j and π/mij\pi/m_{ij} is read as 00 when mij=∞m_{ij}=\infty; the group WW acts on ℝI\mathbb R^I with sis_i acting as the reflection v↦v−⟨αi,v⟩αiv\mapsto v-\langle\alpha_i,v\rangle\alpha_i✦. A positive root of (W,S)(W,S) is a vector w(αi)w(\alpha_i), w∈Ww\in W, with nonnegative coordinates.✦ The positive root αt\alpha_t of a reflection tt is the positive root w(αi)w(\alpha_i) with t=wsiw−1t=ws_iw^{-1}✦, and t↦αtt\mapsto\alpha_t is a bijection from the reflections of WW onto its positive roots✦.

The Bruhat order on WW is the strong Bruhat order: with ℓ\ell the length function of (W,S)(W,S), x≤yx\le y when yy is reached from xx by a chain of edges of the Bruhat graph, that is, by steps x→txx\to tx with tt a reflection and ℓ(x)<ℓ(tx)\ell(x)<\ell(tx).✦

The edges of [u,b][u,b] are ordered through ι\iota. Fix a linear functional ff on ℝI′\mathbb R^{I'} whose slope f(α)/ht(α)f(\alpha)/\mathrm{ht}(\alpha) takes distinct values on distinct positive roots α\alpha of (W′,S′)(W',S'), where ht(α)=∑iαi\mathrm{ht}(\alpha)=\sum_i\alpha_i is the height.✦ An edge e:x→ye:x\to y of [u,b][u,b] has as transported edge the edge ι(x)→ι(y)\iota(x)\to\iota(y) of the Bruhat graph of (W′,S′)(W',S')✦, and as score the slope of the positive root of that edge’s label✦. The transported schedule of ι\iota lists the NN edges of [u,b][u,b] in decreasing order of score, and its reverse e1,…,eNe_1,\dots,e_N, in increasing order, is the chronological schedule✦.

For TT in a field and a vector v=(vx)x∈[u,b]v=(v_x)_{x\in[u,b]} over it, the transfer along an edge x→yx\to y adds TvyTv_y to vxv_x, which is multiplication by the matrix 1+TEx,y1+TE_{x,y}, where Ex,yE_{x,y} is the matrix with entry 11 at (x,y)(x,y) and 00 elsewhere. The transfer product Dι(T)D_\iota(T) of ι\iota is the matrix of the composite of the transfers along the edges of the chronological schedule, e1e_1 first, and the same construction for ι−1\iota^{-1}, with the two systems interchanged, gives Dι−1(T)D_{\iota^{-1}}(T): Dι(T)=(1+TEeN)(1+TEeN−1)⋯(1+TEe1),Ee=Ex,yfore:x→y.D_\iota(T)=(1+TE_{e_N})(1+TE_{e_{N-1}})\cdots(1+TE_{e_1}),\qquad E_e=E_{x,y}\ \text{for}\ e:x\to y.(1)

Hecke Algebra and Kazhdan-Lusztig Polynomials

Let CC be a commutative ring and a∈Ca\in C. For a simple reflection ss, the operator HsH_s on the free CC-module with basis (Hw)w∈W(H_w)_{w\in W} is the CC-linear map that sends HwH_w to Hsw+aHwH_{sw}+aH_w if ℓ(sw)<ℓ(w)\ell(sw)<\ell(w) and to HswH_{sw} otherwise✦; its inverse is Hs−1=Hs−aH_s^{-1}=H_s-a✦, and Hs2=1+aHsH_s^2=1+aH_s. For w∈Ww\in W with a chosen reduced expression w=s1⋯skw=s_1\cdots s_k, HwH_w is also the invertible operator Hs1⋯HskH_{s_1}\cdots H_{s_k}✦, and the bar image of the basis vector HwH_w is Hw¯=Hw−1−1H1\overline{H_w}=H_{w^{-1}}^{-1}H_1✦. The normalized R-polynomial R̃x,y∈ℤ[q]\tilde R_{x,y}\in\mathbb Z[q] is the coefficient of HxH_x in Hy¯\overline{H_y} for C=ℤ[q]C=\mathbb Z[q] and a=−qa=-q, where Hs2=1−qHsH_s^2=1-qH_s.✦

Write d(x,y)=ℓ(y)−ℓ(x)d(x,y)=\ell(y)-\ell(x). The R-polynomials Rx,yR_{x,y} and the Kazhdan-Lusztig polynomials Px,yP_{x,y} of (W,S)(W,S) are the pair of families of polynomials in ℤ[q]\mathbb Z[q], indexed by W×WW\times W, that satisfy 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; 2deg⁡Px,y<d(x,y)2\deg P_{x,y}<d(x,y) for x<yx<y; for a simple reflection ss 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; and, for x≤yx\le y, qd(x,y)Px,y(q−1)=∑z∈[x,y]Rx,zPz,y.q^{d(x,y)}P_{x,y}(q^{-1})=\sum_{z\in[x,y]}R_{x,z}P_{z,y}.(2)

For tt in a field and x∈[u,b]x\in[u,b], the scaled Kazhdan-Lusztig polynomial px(t)p_x(t), and for f∈ℤ[q]f\in\mathbb Z[q], a real number tt and an integer d≥0d\ge0, the scaled polynomial sdf(t)s_d f(t), are px(t)=tℓ(x)−ℓ(b)Px,b(t2),sdf(t)=t−df(t2);p_x(t)=t^{\ell(x)-\ell(b)}P_{x,b}(t^2),\qquad s_d f(t)=t^{-d}f(t^2);(3) p(t)p(t) is the vector (px(t))x∈[u,b](p_x(t))_{x\in[u,b]}, and p′(t)p'(t) the same vector for [u′,b′][u',b'].

Boundary Sheaves

The extended realization is V=ℝI×(ker⁡⟨,⟩)*V=\mathbb R^I\times(\ker\langle\,,\rangle)^*, and AA is the real polynomial ring on a chosen basis of VV✦, graded with every variable in degree one✦; A+A_+ is the ideal generated by the homogeneous elements of positive degree✦. A graded AA-module is a finitely generated AA-module M=⨁n∈ℤMnM=\bigoplus_{n\in\mathbb Z}M_n with AmMn⊆Mm+nA_mM_n\subseteq M_{m+n} and Mn=0M_n=0 for n<0n<0✦; its morphisms are the AA-linear maps that preserve degrees✦. The free graded module ⨁iA(−di)\bigoplus_iA(-d_i), for finitely many di≥0d_i\ge0, is the module of tuples (vi)(v_i) over AA whose part of degree nn consists of the tuples with vi∈An−div_i\in A_{n-d_i}✦; a single di=0d_i=0 gives AA itself✦. The graded character of a free graded AA-module MM is ∑iqdi∈ℤ[q]\sum_iq^{d_i}\in\mathbb Z[q], for a basis of MM of homogeneous elements of degrees di≥0d_i\ge0.✦

The moment graph of [u,b][u,b] is its Bruhat graph with each edge e:x→ye:x\to y labelled by the linear form αe∈A\alpha_e\in A given by (αt,0)∈V(\alpha_t,0)\in V, t=yx−1t=yx^{-1}.✦ A graded sheaf ℱ\mathcal F on it assigns a graded module ℱx\mathcal F^x to each vertex xx, a graded module ℱe\mathcal F^e to each edge e:x→ye:x\to y, and morphisms ρx,e:ℱx→ℱe\rho_{x,e}:\mathcal F^x\to\mathcal F^e and ρy,e:ℱy→ℱe\rho_{y,e}:\mathcal F^y\to\mathcal F^e✦; a global section is a family (fx)(f_x) with fx∈ℱxf_x\in\mathcal F^x and ρx,efx=ρy,efy\rho_{x,e}f_x=\rho_{y,e}f_y on every edge.✦ A boundary sheaf ℱ\mathcal F on a moment graph, with top vertex bb, is a graded sheaf with free stalks such that, on every edge e:x→ye:x\to y, the map ρy,e\rho_{y,e} is surjective with kernel αeℱy\alpha_e\mathcal F^y; every family compatible on the edges inside a set of vertices closed upward along edges agrees on that set with a global section; every element of a stalk is the value of a global section; ℱb=A\mathcal F^b=A; and for x≠bx\ne b the kernel of ℱx→∏eℱe\mathcal F^x\to\prod_e\mathcal F^e, over the edges ee leaving xx, lies in A+ℱxA_+\mathcal F^x.✦

The sheaf ℬ(b)\mathcal B(b) is a fixed boundary sheaf with top vertex bb on the moment graph of [1,b][1,b].✦ The restriction ℬ\mathcal B of ℬ(b)\mathcal B(b) to [u,b][u,b] is the pullback of ℬ(b)\mathcal B(b) along the inclusion of the moment graph of [u,b][u,b] into that of [1,b][1,b], with the stalks and edge modules of ℬ(b)\mathcal B(b). For a vertex xx and a set FF of edges leaving xx, Lx(F)L_x(F) is the kernel of ℬx→∏e∈Fℬe\mathcal B^x\to\prod_{e\in F}\mathcal B^e, v↦(ρx,ev)e∈Fv\mapsto(\rho_{x,e}v)_{e\in F}.✦ The stalk character cxc_x is the graded character of ℬ(b)x\mathcal B(b)^x✦, and the scaled stalk character is c̃x(t)=tℓ(x)−ℓ(b)cx(t2),\tilde c_x(t)=t^{\ell(x)-\ell(b)}c_x(t^2),(4)✦ with c̃(t)\tilde c(t) the vector (c̃x(t))x∈[u,b](\tilde c_x(t))_{x\in[u,b]}.

For v≤bv\le b, an order isomorphism κ\kappa from [v,b][v,b] onto a Bruhat interval of (W′,S′)(W',S') has free upward suffix modules if, for every final segment QQ of its chronological schedule and every x∈[v,b]x\in[v,b], the module Lx(Qx)L_x(Q_x) of the restriction of ℬ(b)\mathcal B(b) to [v,b][v,b] is free over AA, where QxQ_x is the set of edges of QQ leaving xx.✦ For y∈[u,b]y\in[u,b], the order isomorphism ιy:[y,b]→[ι(y),b′]\iota_y:[y,b]\to[\iota(y),b'] is the restriction of ι\iota.✦

The Claim

Theorem 1. Let ι:[u,b]→[u′,b′]\iota:[u,b]\to[u',b'] be an order isomorphism of Bruhat intervals of Coxeter systems (W,S)(W,S) and (W′,S′)(W',S') of finite rank, and write T=t−1−tT=t^{-1}-t. In (a) to (c), suppose that R̃u,z=R̃u′,ι(z)′\tilde R_{u,z}=\tilde R'_{u',\iota(z)} for every z∈[u,b]z\in[u,b] other than bb.

  • If 0<t<10<t<1 and the scaled stalk characters (4) satisfy c̃x(t)≤(Dι(T)c̃(t−1))x\tilde c_x(t)\le\bigl(D_\iota(T)\,\tilde c(t^{-1})\bigr)_x for every x∈[u,b]x\in[u,b], with DιD_\iota the transfer product (1), then R̃u,b(T)≤R̃u′,b′′(T).\tilde R_{u,b}(T)\le\tilde R'_{u',b'}(T).(5)✦

  • If, for every edge ee of [u,b][u,b] with target yy, the module Ly(Fe)L_y(F_e) is free over AA, where FeF_e is the set of edges leaving yy that come after ee in the chronological schedule of ι\iota, then for every 0<t<10<t<1 R̃u,b(T)≤R̃u′,b′′(T).\tilde R_{u,b}(T)\le\tilde R'_{u',b'}(T).(6)✦

  • If ιy\iota_y has free upward suffix modules for every y∈[u,b]y\in[u,b] other than uu, and likewise, with ℬ′(b′)\mathcal B'(b') in place of ℬ(b)\mathcal B(b), the restriction of ι−1\iota^{-1} to [y′,b′][y',b'] for every y′∈[u′,b′]y'\in[u',b'] other than u′u', then R̃u,b=R̃u′,b′′.\tilde R_{u,b}=\tilde R'_{u',b'}.(7)✦

  • Two polynomials f,g∈ℤ[q]f,g\in\mathbb Z[q] with f(t−1−t)=g(t−1−t)for every real0<t<1f(t^{-1}-t)=g(t^{-1}-t)\quad\text{for every real}\ 0<t<1(8)✦ are equal.

  • If u≠bu\ne b, Py,b=Pι(y),b′′P_{y,b}=P'_{\iota(y),b'} for every y∈[u,b]y\in[u,b] other than uu, and, for every 0<t<10<t<1, the scaled polynomials (3) satisfy pu(t)≤(Dι(T)p(t−1))up_u(t)\le\bigl(D_\iota(T)\,p(t^{-1})\bigr)_u and pu′′(t)≤(Dι−1(T)p′(t−1))u′p'_{u'}(t)\le\bigl(D_{\iota^{-1}}(T)\,p'(t^{-1})\bigr)_{u'}, then Pu,b=Pu′,b′′.P_{u,b}=P'_{u',b'}.(9)✦

  • For every field CC and every nonzero t∈Ct\in C, p(t)=Dι(T)p(t−1).p(t)=D_\iota(T)\,p(t^{-1}).(10)✦

  • Let d≥0d\ge0 be an integer and f,g∈ℤ[q]f,g\in\mathbb Z[q] with 2deg⁡f<d2\deg f<d and 2deg⁡g<d2\deg g<d. If sdf(t)−sdg(t)=sdf(t−1)−sdg(t−1)for every real0<t<1,s_d f(t)-s_d g(t)=s_d f(t^{-1})-s_d g(t^{-1})\quad\text{for every real}\ 0<t<1,(11)✦ then f=gf=g.

  • Let d≥0d\ge0 be an integer and f∈ℝ[q]f\in\mathbb R[q] with 2deg⁡f<d2\deg f<d. If f(q)=qdf(q−1)for every real0<q<1,f(q)=q^df(q^{-1})\quad\text{for every real}\ 0<q<1,(12)✦ then f=0f=0.

In the paper, the result reads: subtracting the exact reciprocity p′=R̃′(T)p′(q−1)p'=\tilde R'(T)\,p'(q^{-1}) from the comparison in row uu gives Δ(q)≤Δ(q−1)\Delta(q)\le\Delta(q^{-1}) for Δ=pu−pu′\Delta=p_u-p'_u, interchanging the two systems gives equality, and the degree bound forces Δ=0\Delta=0, where pp and p′p' are the scaled Kazhdan-Lusztig vectors, R̃′(T)\tilde R'(T) is the matrix of the values R̃x,z′(T)\tilde R'_{x,z}(T), and T=t−1−tT=t^{-1}-t.

What Is Checked

The claims are stated over the order isomorphism ι\iota and its transfer product Dι(T)D_\iota(T) along the chronological schedule, the normalized R-polynomials from the bar involution, the Kazhdan-Lusztig polynomials fixed by the normalization conditions with their scaled values px(t)p_x(t), and the boundary sheaf ℬ(b)\mathcal B(b) with its stalk characters and the kernels Lx(F)L_x(F) of its restrictions.

About these constructions, the library proves that a boundary sheaf with top vertex bb exists on the moment graph of every interval [u,b][u,b]✦, and that the pullback of a boundary sheaf along a map of ordered graphs that is injective on vertices and lifts every edge leaving the image of a vertex to an edge leaving that vertex is again a boundary sheaf, with top vertex any vertex sent to the top vertex of the original; the inclusion of [u,b][u,b] into [1,b][1,b] is such a map. It proves that the label yx−1yx^{-1} of every edge is a reflection✦, and that Hs(Hs−a)=(Hs−a)Hs=1H_s(H_s-a)=(H_s-a)H_s=1. A free graded AA-module has a basis of homogeneous elements of nonnegative degrees✦, and a linear functional with distinct slopes on the positive roots exists✦. The reflections v↦v−⟨αi,v⟩αiv\mapsto v-\langle\alpha_i,v\rangle\alpha_i satisfy the Coxeter relations of (W,S)(W,S).✦