Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

The polynomial flag comparison has the prescribed second-mate inverse

Statement

Let p(u) be monic of degree N≥0 over a commutative ring D. Let Lr be the monic factor ring p=crbN−r, where cr is monic of degree r, and put Lr=0 for r<0 or r>N. Put Br=Lr[z]/bN−r(z)=Lr+1[z]/cr+1(z),h=N−2r. Use the native nil-Hecke crossing τ=(1−s)/(X−Y) of The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, dots of degree 2d, and the matrix idempotent convention of Nil-Hecke idempotents and divided-power KLR projectives. Induction is G(r)=Br{−2dr}⊗Lr−, basic restriction is the reversed Br−1 tensor functor, and normalized restriction at input r is H(r)=Br−1{−d(1+h)}⊗Lr−. The first adjunction uses the coefficient form τnew:Br→Lr+1 extracting zr; the second uses τold:Br→Lr extracting zN−r−1. Units are the trace-dual power-basis Casimirs. Write η:1→HG, ε:GH→1, η′:1→GH, ε′:HG→1 for these maps, at their indicated input weights.

Set P=GH, V=HG at input r. Define the actual native mates, rather than freely adjoined inverses, by T=(HGε)(HτGGH)(ηGH):P→V,S=(GHε′)(GτHHG)(η′HG):V→P, where τHH is the twofold first-adjunction mate of τGG. Put A(t)=thb(t−1)c(t−1),H(t)=A(t)−1,A0=H0=1. Coefficients with negative index are zero. For h≥0, let Ck=xkη and Rk=∑a+j=h−1−kAjε′xa(0≤k<h). Then the actual flag bimodule maps ρ=(−T,C):P⊕Dh→V and σ=(S,R):V→P⊕Dh satisfy −ST=1P,RkT=0,SCk=0,RkCℓ=δkℓ,−TS+∑kCkRk=1V. For h<0, set Ck−=xkη′ and Rk−=∑a+j=−h−1−kHjεxa(0≤k<−h). The maps ρ=(−T,R−):P→V⊕D−h and σ=(S,C−):V⊕D−h→P satisfy −TS=1V,TCk−=0,Rk−S=0,Rk−Cℓ−=δkℓ,−ST+∑kCk−Rk−=1P. Here Dh=⨁k<h1{d(1−h+2k)} and D−h=⨁k<−h1{d(1+h+2k)}. At h=0 both sums are empty.

These maps also give the two typed upward curls Lμ=(Hεμ′)(τHHG)(Hημ),Rμ=(εμH)(GτHH)(ημ′H), where Lμ has input μ and Rμ input μ−αi, with ⟨hi,μ⟩=h. Their formulas are Lμ=∑a+j=−hxaHj,Rμ=−∑a+j=hxaAj. All indices in these sums are nonnegative. Mating the two matrix-completeness equations gives the two opposite-crossing cancellation equations with literal-dot sum a+b+c=−2: the HG boundary uses Ab+h+1, and the GH boundary uses Hb−h+1. Single curls instead have literal-dot sum a+b=−1.

For a symmetrizable datum and distinguished color i, take a dominant integral framing λi≥0 and p(u)=ai(u)∏j≠i∏y∈YjQij(u,y)/tij,tij=[u−aij]Qij(u,y)∈D×. This realizes every r≥0, including both signs of h, with zero modules past N. Appending a color j root uses the quotient and multiplication by Qij, and the mixed mate pair constructed with the first unit/first cap and second unit/second cap has composites tij in both orders. This identifies the actual mixed mates in the distinguished-i flag model. Compatibility with adjunctions for a second distinguished color is a separate assembly question.

Under the nil-Hecke matrix equivalence the first cap is exactly τnew and the normalized relative second cap is exactly τold: the normalization is ε^r=(−1)N+1εr for the ordered-residue relative form defined in the proof. No formal diagram-model realization, categorical commutator, cyclotomic Frobenius theorem, or one-dimensional Hom hypothesis is a premise. Every assertion is an integral polynomial identity, hence survives arbitrary monic specialization. Grading is asserted only when the coefficients are homogeneous in their natural degrees.

Facts & Assumptions

Given: A monic polynomial p, the actual flag bimodules and coefficient adjunctions above, the native nil-Hecke crossing, and, for the mixed-color clauses, a weighted-homogeneous KLR datum and a dominant framing.

[F1]

In The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum, the native divided difference is (1−s)/(X−Y), and the source crossing is κ=−τ for every color pair; the dot and crossing degrees are those of The KLR grading and the diagrammatic multiplication.

[F2]

The Artin polynomial module, its perfect longest-divided-difference pairing and its matrix units are proved in the matrix calculation of Nil-Hecke idempotents and divided-power KLR projectives.

Proof

technique · constructive: evaluate the actual cups, crossings and caps on universal root paths, identify both diagonal matrices with polynomial interpolation and monic division, and descend their identities from the generic roots to integral flag bimodules
1.1F2constructalgebra

Work first over S=Z[p1,…,pN] with universal monic p. Its full splitting ring is Z[X1,…,XN], finite free over S on the successive monic Artin basis. The block-invariant ring Lr is a direct summand of this module: multiply by the staircase in each of the two blocks and apply the two longest divided differences; the resulting Lr-linear map fixes Lr by [F2]. Thus Lr is finite projective over S. The same argument with blocks of sizes r,1,N−r−1 applies to Br. Monic division gives its displayed free bases over Lr and Lr+1. Consequently P=Br−1⊗Lr−1Br−1 and V=Br⊗Lr+1Br, with their shifts restored later, are finite projective over S: choose a relative power basis in one tensor factor and use projectivity of the other. They inject into their generic-root scalar extensions. The coefficient pairings are perfect because their power-basis Gram matrices have unit antidiagonal and zero entries below it. For a monic f, their Casimir is Kf(X,Y)=(f(X)−f(Y))/(X−Y), since coefficient extraction in X gives τX(XaKf)=Ya. This proves both triangles by dual-basis contraction and defines all four maps integrally before any localization.

2.1step 1.1algebra

Localize the universal root ring at all root differences. Vertices are now indexed by subsets J of roots of size r. Put c(u)=∏w∈J(u−w) and b(u)=∏z∉J(u−z). A path in P removes w∈J and then adds a root; a path in V adds z∉J and then removes a root. Paths with different initial and final subsets are the single common swap path J→J−w+z. Paths with equal endpoints are the Pw and Vz components. The coefficient trace on a monic root extension is f↦∑ξf(ξ)/f0′(ξ); this is polynomial Lagrange interpolation followed by top-coefficient extraction. Therefore ηz=c(z), εz′=1/b′(z), ηw′=b(w) and εw=1/c′(w). Units and caps have zero components on swap paths because their source or target is the identity bimodule.

2.2step 1.1F2constructalgebra

We verify the claimed Morita normalization independently. Let Ir:Lr→S be the positive parabolic trace: over generic roots it is Ir(f)=∑∣J∣=rf(J)/∏w∈J,z∉J(w−z). This is an integral polynomial map: factor the full monic splitting-tower trace through the two block traces; equivalently apply the normalized parabolic longest divided difference. It is perfect. Indeed, on the block Artin basis the perfect full pairing is the direct sum of copies of the Ir pairing composed with the invertible block Gram matrix; its inverse shows each copy is invertible. The actual nil-Hecke quotient is this matrix algebra: in the power basis of the monic X1 extension, the first column of multiplication by the remainder of p modulo cr contains all remainder coefficients, and every matrix entry belongs to their ideal. Matrix units therefore identify the two-sided ideal (p(X1)) with that coefficient ideal. Monic division identifies its vanishing quotient with Lr. Put Vr for the resulting first-block Artin module, Mr=End⁡Lr(Vr)=NHr/(p(X1)) and tr=srIrTr⁡r,sr=(−1)r(N−r)+r(r−1)/2. The sign is also the ordered-residue sign: in (−1)r(N−r)Res⁡(ΔrX1r−1⋯Xr−1Tr⁡r(−)/∏ap(Xa)), group ordered tuples by subsets; their alternating determinant contributes Δr2, while the internal derivative factors contribute (−1)r(r−1)/2Δr2. Cancellation gives exactly tr, without 1/r!. Define the bilinear relative cap by trεr=tr+1 using the perfect tr pairing. The constant-vector matrix idempotent identifies the induction corner with Br and its dual corner with g↦[v↦τnew(gv)]; matrix evaluation is therefore precisely τnew. On the rank-one operator v↦fτnew(gv), its matrix trace is τnew(gf).

3.1step 2.1F1algebra

Compute the displayed mates on these path components, using the actual crossing (1−s)/(X−Y). On the equal-endpoint components the result is (−T)z,w=c(z)c′(w)(z−w),Sw,z=b(w)b′(z)(w−z). Here the first expression is the cup factor c(z), the no-switch divided-difference entry 1/(w−z) on the ordered additions (w,z) in T, and the first-cap factor 1/c′(w). For S, the twofold first mate reverses the addition path. Its no-switch coefficient on ordered removals (z,w) is 1/(w−z); its switch coefficient, evaluated on the output removal order (z,w), is 1/(z−w). To check this transposition, the composed first-cap weight on the additions (z,w) over a common subset K is 1/[cK(z)cK(w)(w−z)], and the exchanged order has its negative. Their ratio changes the sign of the off-diagonal transposed crossing and leaves the diagonal coefficient unchanged. Thus the second cup in S contributes b(w), its no-switch entry is 1/(w−z), and the second cap contributes 1/b′(z). This is a computation of the defined mate, not a definition of S by the inverse matrix. On a swap path J→J′=J−w+z, the first contraction in T instead has numerator cJ′(w)=(w−z)cJ−w(w) and denominator (w−z)cJ′(w)=(w−z)cJ−w(w), together with the native minus sign; thus T=−1. For the switched second contraction, the complementary factor at J′=J−w+z is bJ′(z)=(z−w)bJc−{z}(z); its second-cap denominator is bJ′(z)=bJc−{z}(z), and its switched upward crossing contributes 1/(z−w). Therefore S=1 on this path. One may check the transposition without notation for diagrams: replace each root delta-vector by its dual vector multiplied by the derivative of its monic root polynomial, apply (1−s)/(X−Y), and contract; the two derivative multipliers are exactly the four factors just displayed. Hence −ST=−TS=1 on every swap component.

4.1step 2.1step 3.1algebra

Write n=N−r=deg⁡b. On the equal-endpoint components U=−T sends values (fw) to the values at z∉J of the unique polynomial F(u) of degree <r with F(w)=fw, because its matrix is c(z)/(c′(w)(z−w)). Similarly S sends (gz) to the values at w∈J of the unique polynomial G(u) of degree <n with G(z)=gz. If h=n−r≥0, then SU=1. Monic division writes G=cq+v uniquely with deg⁡q<h, deg⁡v<r. Thus US is evaluation of v and Cq is evaluation of cq, proving US+CR=1 once the rows R extract the coefficients of q. To identify these rows, expand G(u)b(u)=∑zgzb′(z)(u−z),G(u)c(u)=uhA(u−1)G(u)b(u). The coefficient of uk in the polynomial part of the second expansion is precisely ∑a+j=h−1−kAj∑zgzza/b′(z), which is the prescribed Rk. Therefore RU=0, SC=0, RC=1 and US+CR=1, as well as SU=1. These prove all five positive-branch equations, including the prescribed inverse rather than an unspecified polynomial section. At h=0 monic division has no quotient, and U,S are mutually inverse.

5.1step 1.1step 3.1step 4.1algebra

If h<0, interchange c and b in the preceding division. Interpolate the P values by F of degree <r, and write F=bq+v with deg⁡q<−h, deg⁡v<n. Now US=1 on V, SU is evaluation of v on P, and C−q is evaluation of bq. Expanding F/b=u−hH(u−1)F/c identifies the coefficient rows of q with Rk− exactly. Hence UC−=0, R−S=0, R−C−=1 and SU+C−R−=1. With U=−T these are the five asserted negative-branch equations. This proof includes r=0, r=N and N=0 by empty interpolation sets; beyond the factor range every module is zero. All equations were identities between integral maps on the projective modules in step 1.1, so injection into the generic-root extension proves them over S. Base change gives them over every D; no root difference is inverted in the resulting maps.

6.1step 1.1step 3.1step 4.1step 5.1algebra

The single-curl contraction uses one crossing instead of the two in US or SU. On the reversed flag removing w, cup, the no-switch upward crossing and cap contract to −∑zc(z)/[b′(z)(w−z)], using the weights of step 2.1 and the upward crossing entries of step 3.1. This is the polynomial part of c(u)/b(u) evaluated at w: explicitly, subtracting ∑zc(z)/(b′(z)(u−z)) from c(u)/b(u) removes all its simple poles and leaves its monic-division quotient. On the reversed flag removing z at the adjacent input r+1, the other-handed contraction is ∑wb(w)/[c′(w)(z−w)]. Since b(z)=0, this is minus the polynomial part of b(u)/c(u) evaluated at z. Since c/b=u−hH(u−1) and b/c=uhA(u−1), these are the two stated finite sums. The first has degree −2dh at input μ; the second has degree 2dh at input μ−αi. The two-turn contractions are respectively d(1−h)+d(1−h)−2d and d(1+h)+d(1+h)−2d, verifying the input-weight distinction. At h=0 they give +1 and −1. Mating the completeness identities in steps 4.1-5.1 uses only the already proved triangles, and expands CkRk or Ck−Rk− as the finite triple convolution. In the first case a+j+c=h−1 and literal clockwise dots are b=−h−1+j, so a+b+c=−2; in the other case a+j+c=−h−1 and counterclockwise dots are b=h−1+j, with the same total. These are actual opposite-crossing boundary maps, with the bubble in outside region μ. The same conversion on the single-curl sums gives a+b=−1. Integral descent is as in step 5.1.

6.2step 1.1step 2.2algebra

For f∈Br, comparison of root denominators gives Irτold(f)=(−1)rIr+1τnew(f): the two denominators agree except for the r factors w−z versus z−w. Moreover sr+1/sr=(−1)N−r−1, hence (−1)N+1sr+1/sr=(−1)r. Testing the relative cap on the rank-one operators of step 2.2, also after multiplication by every element of Lr, now identifies ε^r=(−1)N+1εr with τold by perfection. The corresponding relative unit is its dual-power-basis Casimir, so the identification includes the unit and both triangles, not only a trace value on dots. All denominator comparisons are comparisons of already integral polynomial maps between projective modules, and descend exactly as in step 5.1.

7.1step 2.2step 6.2algebra

For the mixed clauses write p′=pq, q=Qij(u,y)/tij monic of degree A=−aij, and Ur=∏a=1rQij(Xa,y). Multiplication by Ur defines the matrix-quotient map from the old factor block to the new one; cancellation in the ordered-residue polynomial expression gives trp′(Urz)=(−1)rAtijrtrp(z). Testing the relative cap against Ura and using its bilinearity and the perfect old trace gives πrεrp′(Qij(Xr+1,y)lift⁡(z))=(−1)Atijεrp(z). The test also proves independence of the lift. The normalized caps of step 6.2 cancel (−1)A, because N changes to N+A. Thus the actual flag cap constant is tij. For r=0 this is simply top-coefficient extraction τpq(Qf)=tijτp(f); arbitrary polynomial reduction gives the same equality. Dual-basis contraction proves the companion cup equation.

8.1F1step 7.1algebra

More explicitly, fix the mixed boundaries GjHi and HiGj and source crossings κ=−τ. The handed pair is a=(HiGjε)(HiκijHi)(ηGjHi),b=(ε′GjHi)(HiκjiHi)(HiGjη′). The intermediate words are HiGiGjHi and HiGjGiHi. The quotient/switch gives a the canonical underlying flag identification; the multiplication-by-Q switch and the normalized coefficient cap in step 7.1 give b its scalar tij. Consequently ba=tij1GjHi and ab=tij1HiGj. Native crossings multiply both a,b by −1 and preserve these products. Thus the inverse mixed crossing is obtained by dividing its companion mate by tij. The same calculation for a separately distinguished color j gives tji for its own pair; identifying both partial actions inside a coherent full action is not a consequence of these two scalar tests alone. Dots commute with the quotient and multiplication maps. With i last, the downward shift sj(m)=−2djmj+∑ℓ>j(−bjℓ)mℓ gives both downward crossings degree −bij; the basic mixed flag identification has shift −bij, canceled by the input-weight change in Hi(m)=Eibasic(m){−di(1+hm)}. The normalized mixed maps are therefore degree zero.

9.1step 4.1step 5.1step 6.1step 6.2step 8.1discharge-construct: actual polynomial flag maps∎

The first unit and second cap have degree d(1−h), and the first cap and second unit degree d(1+h), by coefficient extraction of zr and zN−r−1 with the displayed shifts. Hence T,S have degree zero, Ck has degree d(1−h+2k) and Rk its negative, while Ck− has degree d(1+h+2k) and Rk− its negative. Steps 4.1-5.1 establish both actual matrix inverses, step 6.1 the typed curls and cancellations, and steps 2.2, 6.2, 7.1 and 8.1 the normalized cap transport and mixed orientations. Universal construction followed by base change includes every dominant framing, every permitted color and every weight in its factor range, with no characteristic restriction or choice principle. Nonhomogeneous monic specializations preserve the maps and equations as ungraded identities.

Depends on

Used by

Dependency tree · two levels

13 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