Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Cyclotomic Hecke intertwiners and local power series

Statement

Let HαΛ be a central content sector (possibly zero) as in Central content sectors of the cyclotomic Hecke algebra, with the residue tuples i=(i1,…,id) contained in a fixed index set Iα.

  1. Set yr:=∑i∈Iα(xr−ir)e(i) in the degenerate case and yr:=∑i∈Iα(1−q−irXr)e(i) in the nondegenerate case (1≤r≤d). Then y1,…,yd are commuting nilpotent elements of HαΛ; consequently every rational expression displayed below, expanded as a power series in the nilpotent y's, is a finite and well-defined element of HαΛ.
  2. The power series pr(i):={1,ir=ir+1,(ir−ir+1+yr−yr+1)−1,ir≠ir+1 (degenerate case), respectively Pr(i):={1,ir=ir+1,(1−q)(1−yr(i)yr+1(i)−1)−1,ir≠ir+1,yr(i):=qir(1−yr) (nondegenerate case), satisfy (3.23)–(3.25) respectively (4.24)–(4.26), (4.28)–(4.30) and (4.32); and the intertwining elements φr:=∑i(sr+pr(i))e(i),Φr:=∑i(Tr+Pr(i))e(i) satisfy all identities (3.14)–(3.20) of the source's Lemma 3.1, respectively (4.14)–(4.20) of its Lemma 4.1.
  3. There exist invertible power series qr(i)∈F[ ⁣[yr,yr+1] ⁣] (respectively Qr(i)) satisfying (3.27)–(3.29), respectively (4.33)–(4.35); the explicit candidates (3.30) respectively (4.36) do, and for them the identity (3.43) respectively (4.44) holds.

Facts & Assumptions

Given: The cyclotomic Hecke algebra HΛ=HdΛ of Affine and cyclotomic type-A Hecke algebras with its central content sectors HαΛ and projectors e(i) (Central content sectors of the cyclotomic Hecke algebra), and the notation of the Statement.

[F1]

On the summand e(i) the polynomial generator has the single generalized residue ir: in the degenerate branch xr−ir is nilpotent on e(i), and in the nondegenerate branch q−irXr−1 is nilpotent on e(i); the yr are commuting sums of these, hence commuting nilpotents (Central content sectors of the cyclotomic Hecke algebra).

[F2]

The divided-difference convention is ∂r(f)=(srf−f)/(yr−yr+1), and on equal colours ir=ir+1 the intertwiners reduce to φr=sr+1 respectively Φr=Tr+1 (Affine and cyclotomic type-A Hecke algebras).

Proof

technique · direct

Given: The data of the Statement and the facts above.

1.1F1algebra

Finite evaluation. On each projector e(i) the dots are commuting nilpotents by [F1]. If yrnr=0, every monomial of total degree greater than ∑r(nr−1) vanishes. Thus formal series have finite evaluation, and c+f with c≠0 and f of positive degree has inverse c−1∑k≥0(−f/c)k. Unequal-colour spectral differences have nonzero scalar constant; equal-colour dot differences will only be used as formal divided differences, never inverted in the cyclotomic algebra.

1.2F2algebra

A faithful formal calculation convention. Temporarily take independent dots u1,…,ud and a separate copy of their fraction field for each colour word. Let Sr swap both positions and their dots; write multiplication on the right of Sr. For spectral variables A,B, put p^=(A−B)−1 in DG and P^=(1−q)B/(B−A) in NG, even on equal colours. The affine Hecke operator is Hr=Sr(1−p^)−p^ in DG and Hr=Sr(1−P^)−P^ in NG. For precision the formal calculation algebra has coefficients ⨁iF[ ⁣[u1,…,ud] ⁣]e(i) and the affine generators, with spectral word-sliding: an unequal-colour intertwiner moves e(i) to e(sri) and permutes coefficients, while on equal colours the affine mixed relation gives its divided-difference correction. These relations follow in a sector by the CRT projectors and the mixed presentation: multiply the unequal spectral difference by the intertwiner and use its unit inverse; on equal colours use H+1. This calculation is faithful before any cyclotomic quotient: move coefficients right by these mixed and word-sliding relations and reduce crossing words by the Coxeter relations to span the finitely many Hwe(i); in their crossed-product expansions the coefficient at a reduced permutation w is a product of nonzero rational functions and every proper subword has smaller length. A maximal-length coefficient therefore proves independence, also for formal series coefficients after clearing their finitely many difference denominators. Consequently an identity between regular formal expressions can be checked in this rational model and then evaluated at nilpotent dots. This is a calculation in the affine presentation, not an assumption that its cyclotomic quotient acts faithfully.

2.1step 1.1algebra

Explicit normalization. Write u=yr,v=yr+1, p=(ir−ir+1+u−v)−1 on unequal DG colours, and A=qir(1−u),B=qir+1(1−v) on NG colours. In the order equal, unrelated, forward arrow, backward arrow, double edge, choose qr(i) to be 1+v−u, 1−p, (1−p2)/(v−u), 1, (1−p)/(v−u), respectively, and choose Qr(i) to be 1−q+qv−u, (A−qB)/(A−B), (A−qB)/(A−B)2, qir, qir/(A−B), respectively. These are the actual five branches, including e=2. For DG forward colours ir−ir+1=−1, so 1−p2=(v−u)(2−u+v)/(1−u+v)2; on the double edge the field has characteristic two and 1−p=(v−u)/(1+u−v). Thus the forward quotient has constant 2≠0 unless the pair is a double edge, which uses the separate constant 1 branch. Unrelated pairs have ir−ir+1≠0,±1, so 1−p has nonzero constant. In NG the unequal A−B is a unit; A−qB has nonzero constant except for a backward arrow, whose coefficient is prescribed separately. Hence all five coefficients are units; the equal coefficient has constant 1 in DG and 1−q≠0 in NG.

2.2step 1.2algebra

The full affine coefficient check. In left-coefficient notation HAB=aABS+bAB, use (h,t)=(1,0) in DG and (q,q−1) in NG, where bAB=−(A−B)−1 or (1−q)B/(A−B), respectively, and aAB=h−bAB. Direct common-denominator multiplication gives bAB+bBA=t, aABaBA=h+tbAB−bAB2, and bABbBC=bAC(bAB+bBC−t). The mixed relations follow by multiplying A,B on either side; the first two identities give H2=tH+h. For three positions, expansion of either braid word has coefficients, in the order 1,S1,S2,S1S2,S2S1,S1S2S1, equal to bAC(h+bABbBC), aABbBCbAC, aBCbABbAC, aABaACbBC, aBCaACbAB, aABaACaBC. For example the first expansion's constant is bAB2bBC+aABaBAbAC, which reduces to the displayed constant using the three scalar identities. The S1 coefficient reduces from aAB(bACbBA+bABbBC) in the same way. Thus this six-coefficient check establishes braid for all spectral triples, including any coincidence of colour labels; spectral variables remain independent at this stage. Disjoint positions commute.

3.1step 2.1algebra

Pair products and interchange. Denote the chosen normalizer by Nij(u,v), the piecewise scalar by p in DG or P=(1−q)B/(B−A) in NG, and put Kij(u,v)=1,v−u,u−v,(v−u)(u−v) in the four unequal-colour cases. Substitution gives pij+pji(v,u)=0 in DG and Pij+Pji(v,u)=1−q in NG. Also Nij(u,v)Nji(v,u)Kij(u,v)=1−pij2 in DG and (1−Pij)(q+Pij) in NG. For the latter equality, its right side is (B−qA)(A−qB)/((B−A)(A−B)); forward and backward pairs use B−qA=qir+1(u−v) and A−qB=qir(v−u), respectively, and a double edge uses both. These substitutions prove each branch of the pair-product identities without division by a nonunit. Each coefficient depends only on its ordered two colours and their two dots. Therefore swapping a third position gives the same coefficient of the same ordered pair, proving the three-position interchange identities for p,P,N. In particular no square root is chosen.

4.1step 3.1step 2.2algebra

The intertwiners. On unequal colours φ=S(1−p) and Φ=S(1−P), since the scalar term cancels. Hence they permute the word and the two spectral variables, their squares are the pair products in step 3.1, and they commute at distant positions. On equal colours they are H+1; their squares are 2φ and (1+q)Φ. The equal-colour mixed correction is 1+B−A in DG and qB−A in NG, obtained by multiplying the operator H+1 by B and subtracting A(H+1). The braid defect is zero unless the outer colours coincide. For all equal colours, expanding (H1+1)(H2+1)(H1+1) minus its reversed word gives h(φ1−φ2) in DG and q(Φ1−Φ2) in NG (here h=1 in DG). For outer equal, middle unequal, write CAB=1−p^AB or 1−P^AB, and FAB=CABCBA. The middle equal-colour intertwiner contributes either its permutation term or its scalar term CAC. The former gives equal longest-permutation coefficients in the two words; the latter gives identity coefficients FABCAC and FBCCAC. Their difference is therefore CAC(FAB−FBC). In DG put p1=1/(A−B),p2=1/(B−C) and use p1+p2=(A−C)p1p2; then this difference is (p1−p2)(p1p2−p1−p2). In NG, substituting CAC=(A−qC)/(A−C) and FAB=(A−qB)(B−qA)/(−(A−B)2) cancels the factor A−C and gives (1−q)2(AC−B2)(AB−qBC)/((A−B)2(B−C)2). Adjacent-equal and distinct-colour patterns have no remaining identity term; their permutation coefficients cancel by the scalar identities of step 2.2. These are precisely the intertwiner identities named in the Statement.

5.1step 3.1step 4.1algebra

A local crossing calculation that will also serve both relation maps. Put Drf=(Srf−f)/(ur−ur+1); every inverse dot difference in an operator formula acts by multiplication on the left unless explicitly included in a right coefficient. On equal colours, H+1=(S+1)(−N/(u−v)), since 1−p^=−N/(u−v) in DG and 1−P^=−N/(u−v) in NG; thus (H+1)N−1=D. On unequal colours set cij(u,v)=(1−p)/Nij or (1−P)/Nij, so the normalized crossing is Srcij and cij(u,v)cji(v,u)=Kij(u,v) by step 3.1. For a formal coefficient f, direct subtraction gives Df=(Sf)D+(Sf−f)/(u−v) and D2=0; unequal crossings simply permute coefficients. These formulas prove the dot-sliding and quadratic relations and the compatibility ψr2Nr(i)SrNr(sri)=1−pr(i)2 or (1−Pr(i))(q+Pr(i)) on unequal colours; on equal colours both sides of the original compatibility identity are zero.

6.1step 5.1algebra

Every braid colour pattern. Write u,v,w for the three dots, W=S1S2S1, and c=cik. If all colours are distinct, both crossing braid words have right coefficient cij(u,v)cik(u,w)cjk(v,w) at W. For (i,i,k) both are (W−S1S2)c(u,w)c(v,w)/(v−w); the coefficient product is symmetric in u,v, so moving it through D1 adds no divided-difference correction. For (i,k,k) both are (W−S2S1)c(u,v)c(u,w)/(u−v), by the same calculation with the product symmetric in v,w. In these two formulas the denominator multiplies on the left and the coefficient product multiplies on the right. For (i,j,i) the longest-permutation terms cancel by the ordered-pair interchange of step 3.1; the remaining identity coefficients in ψ1ψ2ψ1 and ψ2ψ1ψ2 are −Kij(u,v)/(u−w) and −Kij(w,v)/(u−w). Thus their difference is (Kij(w,v)−Kij(u,v))/(u−w), equal to 0,1,−1,u+w−2v for unrelated, forward, backward, double-edge pairs. Finally all equal colours give D1D2D1=D2D1D2=−(1−S1−S2+S1S2+S2S1−W)/((u−v)(u−w)(v−w)). Each displayed quotient is a formal divided difference; the resulting braid correction is polynomial, including characteristic two. This proves all five cases locally.

7.1step 1.1step 3.1step 4.1step 6.1∎

Regular identities and conclusion. The rational calculations above express every intertwiner, normalization, dot-sliding, quadratic and braid identity as an identity of regular formal expressions in the affine generators. Faithfulness in step 1.2 licenses clearing the temporary differences, and step 1.1 licenses finite evaluation in the sector. The candidate normalizers and their products give all stated identities, retaining yr=1−q−iryr(i) in NG. Therefore all three assertions of the Statement hold over the original field, with no algebraic closure or choice principle.

Remarks

The temporary difference inverses occur only in the faithful formal calculation. They are not evaluated in a cyclotomic quotient; only the regular identities and the unit normalizers are evaluated there.

Depends on

Used by

Dependency tree · two levels

9 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