OctoInformBeta

OpenAI preprint, September 2026 · §5. Comparison of edge images

Proposition 5.2: For the edges FF, GG later than ee, the image of Lx(F)L_x(F) lies in f̃e\tilde f_e times that of a free Ly(G)L_y(G)

A free upper kernel bounds the lower edge image.

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

Fix a Coxeter system (W,S)(W,S) with simple reflections indexed by II, an element b∈Wb\in W, and the moment-graph sheaf B=B(b)B=B(b) on the Bruhat graph of [1,b][1,b]. Along an edge e:x→ye\colon x\to y both stalks BxB^x and ByB^y restrict to the edge module BeB^e, and the restrictions carry the kernels Lx(F)L_x(F) and Ly(G)L_y(G), for sets FF and GG of upward edges at xx and at yy, to two submodules of BeB^e. The question is how these two images compare when FF and GG are the edges that come after ee in a reflection order carried over from a Bruhat interval [u′,b′][u',b'] of a second Coxeter system (W′,S′)(W',S') through an order isomorphism ι:[u,b]→[u′,b′]\iota\colon[u,b]\to[u',b'], where u≤bu\le b in WW, and what kind of module the image of Ly(G)L_y(G) is.

Here VV is the extended realization of (W,S)(W,S), the real vector space in which roots are placed as pairs with second component 00, and AA is the real polynomial ring on a chosen basis of VV, graded with every variable in degree one. The library answers both for BB on [1,b][1,b] and for its restriction to [u,b][u,b].

Sheaves on the Moment Graph

For u≤bu\le b, the Bruhat moment graph of [u,b][u,b] is the ordered graph whose vertices are the elements of [u,b][u,b] and whose edges are all the edges x→yx\to y of the Bruhat graph with both ends in [u,b][u,b], covers or not✦; the upward edges at xx are those with source xx.✦ The edge e:x→ye\colon x\to y is labelled by the linear form αe∈A\alpha_e\in A of the positive root αt\alpha_t of its reflection t=yx−1t=yx^{-1}, the unique root of tt with nonnegative coordinates in the Tits space ℝI\mathbb{R}^I, the real vector space on the simple roots on which WW acts through its geometric representation: this root is placed as (αt,0)(\alpha_t,0) in the extended realization VV of (W,S)(W,S) and read as a degree-one element of the symmetric algebra S(V)S(V), which the chosen basis identifies with AA.✦ The edge ring of ee is A/(αe)A/(\alpha_e).✦

A graded sheaf on the moment graph assigns to each vertex xx a graded AA-module BxB^x, its stalk, and to each edge e:x→ye\colon x\to y a graded AA-module BeB^e, its edge module, with degree-preserving AA-linear maps res⁡x,e:Bx→Be\operatorname{res}_{x,e}\colon B^x\to B^e and res⁡y,e:By→Be\operatorname{res}_{y,e}\colon B^y\to B^e✦; a graded AA-module here is finitely generated and zero in negative degrees✦. A global section is a family (sz)(s_z) of elements of the stalks with res⁡x,e(sx)=res⁡y,e(sy)\operatorname{res}_{x,e}(s_x)=\operatorname{res}_{y,e}(s_y) for every edge e:x→ye\colon x\to y.✦

A graded sheaf BB is edge flabby if every family (sz)z∈U(s_z)_{z\in U} with sz∈Bzs_z\in B^z that is compatible along the edges inside a set UU of vertices closed under going up an edge agrees on UU with a global section of BB.✦ A graded sheaf BB is kernel minimal at a vertex xx if the kernel of Bx→⨁eBeB^x\to\bigoplus_eB^e over the upward edges ee at xx lies in A+BxA_+B^x, where A+A_+ is the ideal of AA generated by the homogeneous elements of positive degree.✦

A boundary sheaf BB with top vertex bb on a moment graph is a graded sheaf BB with free stalks and Bb=AB^b=A such that every element of every stalk is the value of a global section, BB is edge flabby and kernel minimal at every vertex x≠bx\ne b, and for every edge e:x→ye\colon x\to y the map res⁡y,e\operatorname{res}_{y,e} is onto with kernel αeBy\alpha_eB^y: Be=By/αeBy.B^e=B^y/\alpha_eB^y.(1)✦

The sheaf B=B(b)B=B(b) is a boundary sheaf with top vertex bb on the moment graph of [1,b][1,b], chosen once and for all.✦ The restriction of BB to [u,b][u,b], again written BB, is the pullback of BB along the inclusion of the moment graph of [u,b][u,b] into that of [1,b][1,b], the map of ordered graphs keeping each vertex and each edge; it has the same stalks, edge modules and restriction maps, and is a boundary sheaf with top vertex bb on the moment graph of [u,b][u,b].✦

For a vertex xx and a set FF of upward edges at xx, the upward kernel of BB is the submodule Lx(F)={v∈Bx:res⁡x,e(v)=0 for every e∈F}L_x(F)=\{\,v\in B^x:\operatorname{res}_{x,e}(v)=0\text{ for every }e\in F\,\}(2) of BxB^x. For an edge e:x→ye\colon x\to y, a set FF of upward edges at xx and a set GG of upward edges at yy, the lower image is res⁡x,eLx(F)\operatorname{res}_{x,e}L_x(F)✦ and the upper image is res⁡y,eLy(G)\operatorname{res}_{y,e}L_y(G)✦.

Later Edges

For an edge e:x→ye\colon x\to y of the Bruhat graph with x,y∈[u,b]x,y\in[u,b], the transported edge ι(x)→ι(y)\iota(x)\to\iota(y) is an edge of the Bruhat graph of (W′,S′)(W',S')✦, and γe\gamma_e is its positive root.

For a Coxeter system with simple reflections indexed by II, the library fixes a linear functional λ\lambda on ℝI\mathbb{R}^I whose ratio to the height ht\operatorname{ht}, the sum of the coordinates, takes distinct values on distinct positive roots. The geometric slope of a positive root γ\gamma is sl⁡(γ)=λ(γ)/ht⁡(γ),\operatorname{sl}(\gamma)=\lambda(\gamma)/\operatorname{ht}(\gamma),(3)✦ and λ′\lambda' and sl⁡′\operatorname{sl}' are the functional and the slope of (W′,S′)(W',S'). For a positive root γ\gamma of (W′,S′)(W',S'), the later edges ℒ(γ)\mathcal{L}(\gamma) are the edges z→z′z\to z' of the moment graph of [1,b][1,b] with u≤zu\le z whose transported root has larger slope, sl⁡′(γz→z′)>sl⁡′(γ)\operatorname{sl}'(\gamma_{z\to z'})>\operatorname{sl}'(\gamma).✦

The transported schedule lists the edges of the moment graph of [u,b][u,b] in decreasing order of the lexicographic score of γe\gamma_e, the pair formed by λ′(γe/ht⁡(γe))\lambda'(\gamma_e/\operatorname{ht}(\gamma_e)) and sl⁡′(γe)\operatorname{sl}'(\gamma_e).✦ The chronological schedule of the edges of the moment graph of [u,b][u,b] is the transported schedule read in reverse; it is increasing in the reflection order of (W′,S′)(W',S') carried over through ι\iota.✦ For a list qq of edges and a vertex zz, Fq(z)F_q(z) is the set of upward edges at zz that occur in qq.✦

The Edge Factor

The geometric representation of WW on the Tits space ℝI\mathbb{R}^I is given by the Tits form, ⟨αi,αj⟩=−2cos⁡(π/mij)\langle\alpha_i,\alpha_j\rangle=-2\cos(\pi/m_{ij}) on the simple roots✦. A positive root is a real root w(αi)w(\alpha_i) with nonnegative coordinates✦, and sαs_\alpha is the reflection of the positive root α\alpha✦. An element xx inverts a positive root β\beta when x−1(β)x^{-1}(\beta) is a negative root.✦

Fix x∈Wx\in W and a positive root α\alpha. The partner of a positive root β\beta is the positive root β′\beta' of the reflection sαsβsαs_\alpha s_\beta s_\alpha.✦ A half root of α\alpha at xx is a positive root β≠α\beta\ne\alpha such that sα(β)s_\alpha(\beta) is a negative root, xx inverts neither β\beta nor β′\beta', and sl⁡(β)<sl⁡(β′)\operatorname{sl}(\beta)<\operatorname{sl}(\beta').✦ The plane weight kD(x,α)k_D(x,\alpha) of a plane D⊆ℝID\subseteq\mathbb{R}^I is the number of half roots β\beta of α\alpha at xx with ℝα+ℝβ=D\mathbb{R}\alpha+\mathbb{R}\beta=D.✦ For each plane DD with kD(x,α)≠0k_D(x,\alpha)\neq0, the reduced root form β‾D\bar\beta_D is the image in the edge coefficient ring S(V)/(α)S(V)/(\alpha) of a chosen positive root βD\beta_D with ℝα+ℝβD=D\mathbb{R}\alpha+\mathbb{R}\beta_D=D.✦

The edge factor of α\alpha at xx is the element fx,α=∏kD(x,α)≠0β‾DkD(x,α)f_{x,\alpha}=\prod_{k_D(x,\alpha)\neq0}\bar\beta_D^{\,k_D(x,\alpha)}(4)✦ of S(V)/(α)S(V)/(\alpha), and its degree is the number δx,α=∑kD(x,α)≠0kD(x,α).\delta_{x,\alpha}=\sum_{k_D(x,\alpha)\neq0}k_D(x,\alpha).(5)✦ The lift f̃x,α∈A\tilde f_{x,\alpha}\in A of fx,αf_{x,\alpha} is the product, over the planes DD with kD(x,α)≠0k_D(x,\alpha)\neq0, of the powers βDkD(x,α)\beta_D^{k_D(x,\alpha)}, taken in AA with each βD\beta_D read as a linear form. For an edge e:x→ye\colon x\to y with positive root αe\alpha_e, write fe=fx,αef_e=f_{x,\alpha_e} and f̃e=f̃x,αe\tilde f_e=\tilde f_{x,\alpha_e}, and for a submodule J⊆BeJ\subseteq B^e write f̃eJ\tilde f_eJ for its image under multiplication by f̃e\tilde f_e, an AA-linear endomorphism of BeB^e.✦

The Claim

Theorem 1. Let ι:[u,b]→[u′,b′]\iota\colon[u,b]\to[u',b'] be an order isomorphism and B=B(b)B=B(b).

  1. Let e:x→ye\colon x\to y be an edge of the moment graph of [1,b][1,b] with u≤xu\le x, and let FF and GG be the sets of upward edges at xx and at yy that lie in ℒ(γe)\mathcal{L}(\gamma_e). If Ly(G)L_y(G) is a free AA-module, then in BeB^e res⁡x,eLx(F)⊆f̃eres⁡y,eLy(G).\operatorname{res}_{x,e}L_x(F)\subseteq\tilde f_e\,\operatorname{res}_{y,e}L_y(G).(6)✦

  2. With BB restricted to [u,b][u,b], let e:x→ye\colon x\to y be an edge of the moment graph of [u,b][u,b] and qq a list of edges such that ee followed by qq is a final segment of the chronological schedule. If Ly(Fq(y))L_y(F_q(y)) is a free AA-module, then in BeB^e res⁡x,eLx(Fq(x))⊆f̃eres⁡y,eLy(Fq(y)).\operatorname{res}_{x,e}L_x(F_q(x))\subseteq \tilde f_e\,\operatorname{res}_{y,e}L_y(F_q(y)).(7)✦

  3. Let B′B' be a boundary sheaf with top vertex bb on the moment graph of [u,b][u,b], e:x→ye\colon x\to y an edge of that graph and GG a set of upward edges at yy. If the upward kernel Ly(G)L_y(G) of B′B' is a free AA-module, then its upper image res⁡y,eLy(G)is a free module over the edge ring A/(αe).\operatorname{res}_{y,e}L_y(G)\ \text{is a free module over the edge ring }A/(\alpha_e).(8)✦

  4. Let RR be a commutative ring, h:N1→N2h\colon N_1\to N_2 an RR-linear map and a∈Ra\in R an element acting injectively on N2N_2. If ker⁡h\ker h is a free RR-module, then the image of the map induced by the inclusion of ker⁡h\ker h in N1N_1, im⁡(ker⁡h/aker⁡h→N1/aN1),is a free R/(a)-module.\operatorname{im}\bigl(\ker h/a\ker h\to N_1/aN_1\bigr),\ \text{is a free } R/(a)\text{-module}.(9)✦

In the paper, the result reads: for an edge e:x→ye\colon x\to y, with FF and GG the upward edges at xx and at yy strictly later than ee in the transported schedule, C=A/(αe)C=A/(\alpha_e), I=res⁡x,eLx(F)I=\operatorname{res}_{x,e}L_x(F) and J=res⁡y,eLy(G)J=\operatorname{res}_{y,e}L_y(G), if Ly(G)L_y(G) is graded free then there is a nonzero homogeneous fe∈Cf_e\in C with I⊆feJI\subseteq f_eJ and deg⁡fe=(d(x,y)−1)/2\deg f_e=(d(x,y)-1)/2, where d(x,y)=ℓ(y)−ℓ(x)d(x,y)=\ell(y)-\ell(x) is the difference of the lengths of yy and xx, and JJ, hence feJf_eJ, is graded free over CC.

What Is Checked

The claims are stated over the boundary sheaf B(b)B(b) on the moment graph of [1,b][1,b] and its restriction to [u,b][u,b], the upward kernels (2) with their lower and upper images in the edge modules, the later edges ℒ(γe)\mathcal{L}(\gamma_e) and the chronological schedule carried over through ι\iota, and the edge factor (4), built from half roots and plane weights, with its lift f̃e\tilde f_e and its degree (5).

Beside the claims, the library proves that the moment graph of every interval [u,b][u,b] carries a boundary sheaf with top vertex bb✦, and that αe\alpha_e kills every edge module BeB^e✦, which is thereby a module over the edge ring A/(αe)A/(\alpha_e) compatible with its structure over AA✦. It proves that the inclusion of [u,b][u,b] into [1,b][1,b] is injective on vertices✦ and that every upward edge of [1,b][1,b] at a vertex of [u,b][u,b] comes from an edge of [u,b][u,b]✦. It proves as well that every edge label yx−1yx^{-1} is a reflection and that α\alpha has only finitely many half roots at xx✦, and that a functional λ\lambda as in (3) exists✦. It proves also that the geometric simple reflections on the Tits space satisfy the Coxeter relations, so that they define the action of WW there, and that the Tits form takes the value 22 on every simple root. It proves as well that every AA-submodule of a module over A/(αe)A/(\alpha_e) compatible with its structure over AA is a submodule over A/(αe)A/(\alpha_e) with the same elements. It proves that the identity lies below every element in Bruhat order and that Bruhat order is reflexive, so that [u,b]⊆[1,b][u,b]\subseteq[1,b] and b∈[u,b]b\in[u,b] whenever u≤bu\le b.