OctoInformBeta

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

Equality forces all edge images (6.6) to (6.8): At 0<t<10<t<1, an endpoint equality of schedule states turns each inclusion I⊆feJI\subseteq f_eJ into equality, and R̃\tilde R-invariance under ι\iota gives that equality

Endpoint equality forces every edge image to its bound.

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

Take a Coxeter system (W,S)(W,S) of finite rank, elements u≤bu\le b of WW, and a moment-graph sheaf ℬ\mathcal B of Braden-MacPherson type on the Bruhat graph of [u,b][u,b], with top vertex bb. At a vertex xx, the elements of the stalk ℬx\mathcal B^x whose restrictions to a chosen set of upward edges vanish form a kernel. On an edge e:x→ye\colon x\to y, a kernel at xx and a kernel at yy have images II and JJ in the edge module ℬe\mathcal B^e, and the local comparison is between II and feJf_eJ, where fef_e is a product of linear forms determined by xx and the root of ee.

The global comparison runs on Hilbert series read at q=t2q=t^2, 0<t<10<t<1. Listing the edges in a schedule and releasing their conditions one at a time leads from the Hilbert series of the kernels cut out by all upward edges, a vector on [u,b][u,b], to that of the stalks, and this passage is set against the product along the schedule of the elementary transfers 1+(t−1−t)Ex,y1+(t^{-1}-t)E_{x,y}, which add t−1−tt^{-1}-t times the entry at yy to the entry at xx of a vector. The schedule of interest comes from an order isomorphism ι:[u,b]→[u′,b′]\iota\colon[u,b]\to[u',b'] onto a Bruhat interval of a second Coxeter system (W′,S′)(W',S'), which carries a reflection order of (W′,S′)(W',S') to the edges of [u,b][u,b]. The item asks what the equality of the two endpoints of the schedule, the endpoint equality, forces at each edge, and whether an isomorphism ι\iota preserving the normalized R-polynomials produces that equality.

Hilbert Series and Elementary Transfers

Let N=⨁n∈ℤNnN=\bigoplus_{n\in\mathbb Z}N_n be a graded vector space over a field KK, with every NnN_n finite-dimensional. A subspace ZZ of NN is homogeneous if it contains the homogeneous components of each of its elements. The Hilbert series of a subspace YY of NN at a real number qq is H(Y;q)=∑n∈ℤdim⁡K(Y∩Nn)qn,H(Y;q)=\sum_{n\in\mathbb Z}\dim_K(Y\cap N_n)\,q^n,(1)✦ and the defect series of YY in a subspace ZZ of NN is Δ(Y,Z;q)=∑n∈ℤdim⁡K((Z∩Nn)/(Y∩Z∩Nn))qn.\Delta(Y,Z;q)=\sum_{n\in\mathbb Z}\dim_K\bigl((Z\cap N_n)/(Y\cap Z\cap N_n)\bigr)\,q^n.(2)

Let XX be a set and TT a real number; real vectors on XX are compared entrywise. For points xx and yy of XX, the elementary transfer 1+TEx,y1+TE_{x,y} is the linear map on real vectors vv on XX given by ((1+TEx,y)v)(z)={v(x)+Tv(y),z=x,v(z),z≠x.\bigl((1+TE_{x,y})v\bigr)(z)= \begin{cases} v(x)+T\,v(y), & z=x,\\ v(z), & z\ne x. \end{cases}(3)✦ For an edge ee from xx to yy of a directed graph on XX, write Me=1+TEx,yM_e=1+TE_{x,y}.✦ For a list p=(e1,…,em)p=(e_1,\dots,e_m) of edges, p>k=(ek+1,…,em)p_{>k}=(e_{k+1},\dots,e_m) is the list without its first kk edges, so that p>0=pp_{>0}=p and p>m=⌀p_{>m}=\varnothing, and the transfer product of pp is Mem⋯Me1M_{e_m}\cdots M_{e_1}, the first edge acting first.

The Sheaf and Its Kernels

The extended realization VV of (W,S)(W,S) is the product of the Tits space ℝS\mathbb R^S with the dual of the radical of the Tits form, the form with ⟨αs,αs′⟩=−2cos⁡(π/mss′)\langle\alpha_s,\alpha_{s'}\rangle=-2\cos(\pi/m_{ss'}) on the simple roots, where mss′m_{ss'} is the order of ss′ss' in WW.✦ The ring AA is the real polynomial ring in the coordinates of a chosen basis of VV✦, graded with every variable in degree one✦; rr is its number of variables, and A+A_+ is its ideal generated by the homogeneous elements of positive degree.✦

The Bruhat graph of [u,b]={x:u≤x≤b}[u,b]=\{x: u\le x\le b\}, for the strong Bruhat order, has an edge e:x→ye\colon x\to y for every pair of elements of [u,b][u,b] with y=txy=tx for a reflection tt and ℓ(x)<ℓ(y)\ell(x)<\ell(y), covers or not.✦ An edge e:x→ye\colon x\to y is called upward at xx and downward at yy. The edge is labelled by t=yx−1t=yx^{-1}, and its root αe∈ℝS\alpha_e\in\mathbb R^S is the positive root of tt: the root w(αs)w(\alpha_s) with nonnegative coordinates for which t=wsw−1t=wsw^{-1}, with WW acting on ℝS\mathbb R^S through the Tits form. Placed in VV as (αe,0)(\alpha_e,0), it is a linear form αe∈A\alpha_e\in A.✦

A graded sheaf on the Bruhat graph assigns to each vertex xx a stalk ℬx\mathcal B^x and to each edge ee an edge module ℬe\mathcal B^e, finitely generated graded AA-modules that vanish in negative degrees, and to each edge e:x→ye\colon x\to y two degree-preserving AA-linear restrictions ρx,e:ℬx→ℬe\rho_{x,e}\colon\mathcal B^x\to\mathcal B^e and ρy,e:ℬy→ℬe\rho_{y,e}\colon\mathcal B^y\to\mathcal B^e.✦ A global section is a choice of vx∈ℬxv_x\in\mathcal B^x at every vertex with ρx,e(vx)=ρy,e(vy)\rho_{x,e}(v_x)=\rho_{y,e}(v_y) on every edge.✦ A boundary sheaf with top vertex bb is a graded sheaf with free stalks in which each ρy,e\rho_{y,e} is surjective with kernel αeℬy\alpha_e\mathcal B^y; any choice of stalk elements on a set of vertices that contains the upper end of every edge whose lower end it contains, compatible on the edges inside that set, agrees there with a global section; every stalk element is the value of a global section; ℬb=A\mathcal B^b=A; and at every x≠bx\ne b the kernel of ℬx→⨁eℬe\mathcal B^x\to\bigoplus_e\mathcal B^e, over the upward edges ee at xx, lies in A+ℬxA_+\mathcal B^x.✦ The sheaf ℬ(b)\mathcal B(b) is a chosen boundary sheaf on the Bruhat graph of [1,b][1,b] with top vertex bb✦, and its restriction to [u,b][u,b] is its pullback along the inclusion of the Bruhat graph of [u,b][u,b] into that of [1,b][1,b], the boundary sheaf on [u,b][u,b] with top vertex bb and the same stalks.✦

For a vertex xx and a set FF of upward edges at xx, the kernel Lx(F)L_x(F) is the submodule of ℬx\mathcal B^x of the elements vv with ρx,e(v)=0\rho_{x,e}(v)=0 for every e∈Fe\in F, and its Hilbert series H(Lx(F);q)H(L_x(F);q) is taken in the grading of ℬx\mathcal B^x over ℝ\mathbb R.✦ For a list pp of edges, Fp(x)F_p(x) is the set of upward edges at xx that occur in pp.✦ For real tt, the schedule state of pp is the real vector on [u,b][u,b] whose entry at xx is the normalized Hilbert series of Lx(Fp(x))L_x(F_p(x)): Σt(p)x=(1−t2)rtℓ(x)−ℓ(b)H(Lx(Fp(x));t2).\Sigma_t(p)_x=(1-t^2)^r\,t^{\ell(x)-\ell(b)}\,H\bigl(L_x(F_p(x));t^2\bigr).(4)✦

For an edge e:x→ye\colon x\to y, the lower image of a set FF of upward edges at xx is ρx,e(Lx(F))\rho_{x,e}(L_x(F))✦ and the upper image of a set F′F' of upward edges at yy is ρy,e(Ly(F′))\rho_{y,e}(L_y(F'))✦, both AA-submodules of ℬe\mathcal B^e. For a list pp of edges, write Ie(p)=ρx,e(Lx(Fp(x))),Je(p)=ρy,e(Ly(Fp(y))).I_e(p)=\rho_{x,e}\bigl(L_x(F_p(x))\bigr),\qquad J_e(p)=\rho_{y,e}\bigl(L_y(F_p(y))\bigr).(5)

Edge Factors, Schedules and R-polynomials

The height ht(β)\mathrm{ht}(\beta) of β∈ℝS\beta\in\mathbb R^S is the sum of its coordinates✦, and the geometric functional φ\varphi of (W,S)(W,S) is a fixed linear functional on ℝS\mathbb R^S whose slope φ(β)/ht(β)\varphi(\beta)/\mathrm{ht}(\beta) takes distinct values on distinct positive roots.✦ For x∈Wx\in W and a positive root α\alpha with reflection sαs_\alpha, a half root of α\alpha at xx is a positive root β≠α\beta\ne\alpha such that sα(β)s_\alpha(\beta) is negative, neither β\beta nor its partner β′\beta', the positive root of sαsβsαs_\alpha s_\beta s_\alpha, is sent to a negative root by x−1x^{-1}, and the slope of β\beta is smaller than that of β′\beta'.✦ The weight wPw_P of a plane P⊆ℝSP\subseteq\mathbb R^S is the number of half roots β\beta of α\alpha at xx with ℝα+ℝβ=P\mathbb R\alpha+\mathbb R\beta=P✦, and for wP>0w_P>0, αP\alpha_P is a chosen positive root with ℝα+ℝαP=P\mathbb R\alpha+\mathbb R\alpha_P=P.✦ The edge factor of an edge e:x→ye\colon x\to y is the element of AA fe=∏P:wP>0αPwP(α=αe),f_e=\prod_{P:\,w_P>0}\alpha_P^{\,w_P}\qquad(\alpha=\alpha_e),(6)✦ each αP\alpha_P read as a linear form, and feJf_eJ is the image of a submodule JJ of ℬe\mathcal B^e under multiplication by fef_e.✦

The second Coxeter system (W′,S′)(W',S') of ι\iota has finite rank and a geometric functional φ′\varphi'. The transported edge of an edge e:x→ye\colon x\to y of [u,b][u,b] is the Bruhat graph edge ι(x)→ι(y)\iota(x)\to\iota(y) of (W′,S′)(W',S'), with root αe′\alpha'_e.✦ The chronological schedule pι=(e1,…,em)p_\iota=(e_1,\dots,e_m) of ι\iota lists the edges of the Bruhat graph of [u,b][u,b] in increasing order of the reflection order of (W′,S′)(W',S') carried over along ι\iota, which ranks ee by the pair (φ′(αe′/ht(αe′)),φ′(αe′)/ht(αe′))\bigl(\varphi'(\alpha'_e/\mathrm{ht}(\alpha'_e)),\,\varphi'(\alpha'_e)/\mathrm{ht}(\alpha'_e)\bigr) in lexicographic order.✦

Let (Hw)w∈W(H_w)_{w\in W} be the basis of a free ℤ[q]\mathbb Z[q]-module on which, for s∈Ss\in S, the operator HsH_s sends HwH_w to Hsw−qHwH_{sw}-qH_w if ℓ(sw)<ℓ(w)\ell(sw)<\ell(w) and to HswH_{sw} otherwise, so that Hs2=1−qHsH_s^2=1-qH_s and Hs−1=Hs+qH_s^{-1}=H_s+q✦, and HwH_w is the product of the HsH_s along a chosen reduced expression of ww.✦ For x,z∈Wx,z\in W, the normalized R-polynomial R̃x,z∈ℤ[q]\tilde R_{x,z}\in\mathbb Z[q] is the coefficient of HxH_x in Hz¯=Hz−1−1H1\overline{H_z}=H_{z^{-1}}^{-1}H_1.✦ The operators HsH_s are the generators of the Hecke algebra of (W,S)(W,S) with parameter −q-q, and Hz¯\overline{H_z} is the bar image of the basis vector HzH_z. The polynomials R̃′\tilde R' of (W′,S′)(W',S') are formed in the same way.

The Claim

Theorem 1.

  1. Let XX be a set, T≥0T\ge 0, and (xk,yk)(x_k,y_k), 1≤k≤n1\le k\le n, pairs of points of XX with xk≠ykx_k\ne y_k; put Mk=1+TExk,ykM_k=1+TE_{x_k,y_k}. If real vectors D0,…,DnD_0,\dots,D_n on XX satisfy Dk≤MkDk−1D_k\le M_kD_{k-1} for 1≤k≤n1\le k\le n and Dn=Mn⋯M1D0D_n=M_n\cdots M_1D_0, then Dk=MkDk−1(1≤k≤n).D_k=M_kD_{k-1}\qquad(1\le k\le n).(7)✦

  2. Let T≥0T\ge 0 and let p=(e1,…,em)p=(e_1,\dots,e_m) be a list of edges of a directed graph on a set XX, none of them a loop. If real vectors D(p>k)D(p_{>k}) on XX, 0≤k≤m0\le k\le m, satisfy D(p>k)≤MekD(p>k−1)D(p_{>k})\le M_{e_k}D(p_{>k-1}) for 1≤k≤m1\le k\le m and D(⌀)=Mem⋯Me1D(p)D(\varnothing)=M_{e_m}\cdots M_{e_1}D(p), then D(p>k)=MekD(p>k−1)(1≤k≤m).D(p_{>k})=M_{e_k}D(p_{>k-1})\qquad(1\le k\le m).(8)✦

  3. Let Y⊊ZY\subsetneq Z be subspaces of a graded vector space NN over a field KK with finite-dimensional homogeneous parts, ZZ homogeneous, and let q>0q>0 be a real number at which the Hilbert series H(Z;q)H(Z;q) converges. Then Δ(Y,Z;q)>0.\Delta(Y,Z;q)>0.(9)✦

  4. Let ℬ\mathcal B be a boundary sheaf with top vertex bb on the Bruhat graph of [u,b][u,b], let p=(e1,…,em)p=(e_1,\dots,e_m) be a list of its edges, and let 0<t<10<t<1 and T=t−1−tT=t^{-1}-t. If Iek(p>k)⊆fekJek(p>k)I_{e_k}(p_{>k})\subseteq f_{e_k}J_{e_k}(p_{>k}) for 1≤k≤m1\le k\le m and the schedule states satisfy Σt(⌀)=Mem⋯Me1Σt(p)\Sigma_t(\varnothing)=M_{e_m}\cdots M_{e_1}\Sigma_t(p), then Iek(p>k)=fekJek(p>k)(1≤k≤m).I_{e_k}(p_{>k})=f_{e_k}J_{e_k}(p_{>k})\qquad(1\le k\le m).(10)✦

  5. Let ι:[u,b]→[u′,b′]\iota\colon[u,b]\to[u',b'] be an order isomorphism with R̃x,z=R̃ι(x),ι(z)′\tilde R_{x,z}=\tilde R'_{\iota(x),\iota(z)} for all x,z∈[u,b]x,z\in[u,b], let ℬ\mathcal B be the restriction of ℬ(b)\mathcal B(b) to [u,b][u,b], and let pι=(e1,…,em)p_\iota=(e_1,\dots,e_m) be the chronological schedule of ι\iota. Then for every 0<t<10<t<1, with T=t−1−tT=t^{-1}-t, Σt(⌀)=Mem⋯Me1Σt(pι).\Sigma_t(\varnothing)=M_{e_m}\cdots M_{e_1}\Sigma_t(p_\iota).(11)✦

In the paper, the result reads: endpoint equality makes every deficit δk=MkDk−1−Dk\delta_k=M_kD_{k-1}-D_k vanish, and a nonzero graded module has positive Hilbert series at 0<q<10<q<1, so I=feJI=f_eJ at every edge.

What Is Checked

Claims (7) and (8) are stated over real vectors on a set and the elementary transfers (3), claim (9) over the Hilbert series (1) and defect series (2) of a graded vector space, and claims (10) and (11) over the boundary sheaves on the Bruhat graph of [u,b][u,b], the restriction of ℬ(b)\mathcal B(b), the schedule state (4), the edge images (5), the edge factors (6), the chronological schedule pιp_\iota and the normalized R-polynomials of (W,S)(W,S) and (W′,S′)(W',S').

About these constructions the library proves that for u≤bu\le b the Bruhat graph of [u,b][u,b] carries a boundary sheaf with top vertex bb, so that ℬ(b)\mathcal B(b) exists.✦ The inclusion of the Bruhat graph of [u,b][u,b] into that of [1,b][1,b] is injective on vertices✦ and lifts every edge of [1,b][1,b] leaving a vertex of [u,b][u,b]✦, and along such a map a boundary sheaf pulls back to a boundary sheaf, which makes the restriction of ℬ(b)\mathcal B(b) one.✦ The label yx−1yx^{-1} of every edge is a reflection✦, and reflections correspond bijectively to positive roots.✦ A positive root has only finitely many half roots at each xx✦, and a linear functional on ℝS\mathbb R^S whose slope is injective on positive roots exists.✦ An order isomorphism of Bruhat intervals carries Bruhat graph edges exactly to Bruhat graph edges.