Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 q-antisymmetrizer splits the tensor power and its kernel is the sum of the Hecke kernels

Statement

Let k=Q(q), Q=q2, and let MN=Vaff⊗N carry the action of The affine Hecke algebra and its commuting action on tensor powers of the vector representation. Put AN=∑w∈SNSw and CN=∑w∈SNQl(w)=∏r=1N(1+Q+⋯+Qr−1)≠0. Then:

(i) ANSi=SiAN=QAN and AN2=CNAN. The operator PN=CN−1AN is a k-linear idempotent commuting with the quantum-group action.

(ii) ker⁡AN=∑i=1N−1ker⁡(Si+1), a sum of k-subspaces, and MN=ker⁡AN⊕im⁡AN. The map [x]↦ANx identifies MN/ker⁡AN with im⁡AN as quantum-group modules; AN acts there by CN, and every Si acts there by Q.

(iii) On two factors put x=Y1, y=Y2, R=k[x±1,y±1] and B=k[x+y,(xy)±1], the symmetric Laurent subring. The complete partial q-symmetric kernel on the original Laurent-loop vector space is ker⁡(S+1)=⨁jB(vj⊗vj) ⊕ ⁣⨁j<k(Bhjk+Bhjk′), where, writing ajk=vj⊗vk and bjk=vk⊗vj, hjk=ajk+q−1bjk,hjk′=xbjk+q−1yajk. Equivalently, it is the k-span of (S−Q)(ul⊗um) for all integers l,m. This kernel is stable under the quantum-group action and symmetric Laurent multiplication; arbitrary Laurent multiplication need not preserve it. Its quotient satisfies the full local straightening relations: repeated entries vanish, and for l<m, writing m−l=ae+b with a≥0 and 0≤b<e, ul∧um={−um∧ul,b=0,−q−1um∧ul,a=0, b>0,−q−1um∧ul−ul+ae∧um−ae−q−1um−ae∧ul+ae,a>0, b>0. The remaining unordered pair in the third case has strictly smaller gap, so repetition terminates. At q=1, Si specializes to the negative flip, AN to ∑w(−1)l(w)w, and CN to N!; the kernel and quotient are the ordinary local symmetric relations and exterior power.

Facts & Assumptions

Given: The generic field k=Q(q), Q=q2, the affine tensor action, and the reduced-word operators Sw and AN above.

[F1]

The operators satisfy Si2=(Q−1)Si+Q, the braid relations and distant commutativity; they commute with the quantum-group action (The affine Hecke algebra and its commuting action on tensor powers of the vector representation).

[F2]

On residues, S(ajk)=−qbjk and S(bjk)=−qajk+(Q−1)bjk for j<k, and S(vj⊗vj)=−vj⊗vj. For every Laurent polynomial f, S(fw)=s(f)S(w)+(1−Q)y(f−s(f))/(x−y) w, where s exchanges x,y (The affine Hecke algebra and its commuting action on tensor powers of the vector representation).

[F3]

The index convention is um=zpvj for m=j−pe, with 1≤j≤e and p∈Z; Yi multiplies the indicated slot by z (The level-zero vector representation, its affinization and the level-one crystal energy).

Proof

technique · pair Coxeter lengths, telescope products modulo the local kernels, and compute the complete two-factor kernel over the symmetric Laurent subring before deriving the three straightening cases
1.1F1givenalgebra

If l(wsi)=l(w)+1, the reduced-word definition gives SwSi=Swsi. If l(wsi)=l(w)−1, put u=wsi, so Sw=SuSi and the quadratic relation gives SwSi=QSu+(Q−1)Sw. Thus each paired term satisfies (Su+Susi)Si=Q(Su+Susi) for l(usi)=l(u)+1. Summing the disjoint pairs gives ANSi=QAN; left pairing gives SiAN=QAN. Hence ANSw=Ql(w)AN and AN2=CNAN. Inserting the largest letter into a permutation in each of its N positions gives ∑w∈SNQl(w)=(1+Q+⋯+QN−1)∑u∈SN−1Ql(u), proving the product formula by induction. It is nonzero in k.

1.2F1F2F3algebra

For N=2, the quadratic identity gives im⁡(S−Q)⊆ker⁡(S+1), and on that kernel S−Q=−(1+Q)I, so equality holds. The original two-factor space is the direct sum of the R-blocks R(vj⊗vj) and Rajk⊕Rbjk for j<k. They are preserved by S. Every symmetric f commutes with S by [F2]. The ring R equals B+Bx: indeed y=(x+y)−x, x2=(x+y)x−xy, x−1=y/(xy) and y−1=x/(xy) reduce every Laurent monomial to this form. The sum is direct, since applying s to f+gx=0 with f,g∈B and subtracting gives g(x−y)=0, hence g=f=0. This also identifies B as the symmetric Laurent subring. Consequently it suffices to compute S−Q on w,xw in each residue block; no localization of the tensor space is taken.

2.1step 1.1F1algebra

Put J=∑iker⁡(Si+1). If (Si+1)v=0, then (Q+1)ANv=AN(Si+1)v=0, so J⊆ker⁡AN. Also (Si+1)(Si−Q)=0, so (Si−Q)v∈J for every v. For any operator word T1⋯Td with each Tr a simple Si, the exact telescoping identity T1⋯Td−QdI=∑r=1dQr−1(Tr−QI)Tr+1⋯Td shows that (Sw−Ql(w)I)v∈J: each summand has its leftmost factor Si−Q and hence its image in a local kernel. Thus (AN−CNI)v∈J. If ANv=0, this gives CNv∈J, and CN≠0 gives v∈J. Therefore ker⁡AN=J.

2.2step 1.2F1F2F3algebra

Write dj=vj⊗vj, h=hjk and h′=hjk′. Formula [F2] gives (S−Q)dj=−(Q+1)dj and (S−Q)xdj=−Q(x+y)dj. For j<k, it gives (S−Q)ajk=−Qh, (S−Q)bjk=−qh, (S−Q)xbjk=−Qh′, and (S−Q)xajk=−Q((x+y)h−q−1h′). By step 1.2 these images generate the entire kernel over B, proving the displayed formula. The alternative (S−Q) basis description follows from the same image equality and [F3]. Quantum-group stability follows from [F1], and symmetric-loop stability from [F2]. In particular the correct base vector is ajk+q−1bjk; the vector ajk−qbjk instead has eigenvalue Q.

3.1step 1.1step 2.1F1algebra

Since AN2=CNAN, PN=CN−1AN is idempotent. Every v decomposes as (v−PNv)+PNv, and an element in both its kernel and image is zero. Its kernel and image are those of AN, giving the direct sum. The map [v]↦ANv is well defined, injective and onto its image; it commutes with the quantum-group action by [F1]. On that image AN acts by CN and every Si acts by Q by step 1.1. Equivalently, (Si−Q)v∈J=ker⁡AN implies that each Si induces scalar Q on the quotient.

3.2step 2.2F2F3algebra

Equal indices have ul⊗ul=(xy)pdj∈ker⁡(S+1), for l=j−pe. If l<m have equal residue, write l=j−pe, m=j−re. Their symmetric pair is (xpyr+xryp)dj∈Bdj, giving ordinary antisymmetry for b=0. For distinct residues write l=j−pe, m=k−re and t=xy. If j<k, then a=p−r≥0 and b=k−j; the relation for a=0 is trhjk, and for a>0 its four tensor terms are exactly tr(xa+ya)hjk. If j>k, use akj=vk⊗vj, bkj=vj⊗vk; now a=p−r−1≥0 and b=e+k−j. The relation for a=0 is trhkj′, and for a>0 its four terms are exactly tr(xa+ya)hkj′. All these vectors lie in the complete kernel of step 2.2, proving precisely the three displayed cases. Moreover B is spanned over k by tr and tr(xa+ya) with r∈Z, a≥1: pair each Laurent monomial with its swap and factor their common smaller power. Thus these relations span the entire kernel described in step 2.2, including its diagonal blocks, and give the full quotient presentation. For a>0,b>0, (l+ae,m−ae)=(m−b,l+b) is decreasing and both entries lie strictly between l,m; the reverse pair has positive gap ae−b=(a−1)e+(e−b)<ae+b=m−l, so repeated application terminates.

4.1step 1.1step 2.1step 3.1step 2.2step 3.2F2algebra∎

At q=1, formula [F2] loses its divided-difference correction and sends f(vj⊗vk) to −s(f)(vk⊗vj), so Si is the negative flip on the entire Laurent-loop tensor space. Accordingly Sw=(−1)l(w)w, AN is the signed antisymmetrizer, CN=N!, and the preceding paired-length and kernel arguments remain valid over Q since N! and 2 are nonzero. The local kernel is now the ordinary symmetric two-factor space, giving the usual exterior quotient. This proves every asserted kernel, splitting and straightening claim on the original tensor space.

Remarks

All generic arguments are over Q(q). The integral lattice and crystal charts require their separate coefficient rings; no torsion-freeness over a Laurent ring or residue of its quotient by q is asserted here.

Depends on

Used by

Dependency tree · two levels

7 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