Alphabeta Math
DefinitionDefinition: 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.

The finite q-wedge space and the normal-ordering relations

Definition

For N≥1 let Vaff⊗N carry the affine Hecke action and put WN:=Vaff⊗N/ker⁡AN, where AN=∑w∈SNSw; write um1∧⋯∧umN for the image of the pure tensor, and let ∧ denote this product. Call an index tuple normal (or normally ordered) if m1>m2>⋯>mN, and set WA:=∑normal IZ[q,q−1] uI, W0:=⨁normal IZ[q] uI, where uI is the image of the corresponding ordered wedge.

For l<m write m−l=ae+b with a≥0, 0≤b<e (so a=⌊(m−l)/e⌋ and b is the residue difference). The normal-ordering relations are:

ul∧ul=0;ul∧um=−um∧ul(b=0);ul∧um=−q−1um∧ul(a=0, b>0);

ul∧um=−q−1um∧ul−ul+ae∧um−ae−q−1um−ae∧ul+ae(a>0, b>0),

where the last line is to be read as a relation in WN and is applied recursively to its two remaining unordered pairs; each recursion step strictly decreases the gap of the unordered pair it rewrites and keeps every index between l and m, so the procedure terminates. The energy normal order is the equivalent formulation through the opposite-channel energy: um1∧um2 is rewritten toward decreasing indices by Hop(um1⊗um2)>0  ⟺  m1>m2 of The level-zero vector representation, its affinization and the level-one crystal energy.

Facts & Assumptions

Given: The quotient and charts in the Definition, with the stated affine Hecke Laurent action.

[F1]

The contract of The q-antisymmetrizer splits the tensor power and its kernel is the sum of the Hecke kernels gives ker⁡AN=∑iker⁡(Si+1) and ANSi=QAN, where Q=q2; therefore each Si induces the scalar Q on WN. The kernel is stable under the quantum group action.

[F2]

The residue operator and its exact Laurent extension are those of The affine Hecke algebra and its commuting action on tensor powers of the vector representation: S(fw)=s(f)S(w)+(1−Q)Y2(f−s(f))/(Y1−Y2)w.

[F3]

Each um=Ypvj with m=j−pe, 1≤j≤e, and Y is invertible; the opposite energy is positive exactly for decreasing indices (The level-zero vector representation, its affinization and the level-one crystal energy).

Verification

technique · calculate the actual Laurent two-factor kernel vectors and their symmetric-loop multiples, then use finite dominance followed by inversions for termination
1.1F1F2F3givenalgebra

Symmetric Laurent multiplication preserves ker⁡(S+1). If g=s(g), [F2] gives S(gx)=gS(x), since the divided difference of g is zero; this applies also to negative common loop shifts (Y1Y2)r. On a diagonal dj=vj⊗vj one has S(dj)=−dj. For j<k, set w=vj⊗vk and w′=vk⊗vj; substitution gives S(w+q−1w′)=−(w+q−1w′). For j>k the divided differences of Y1,Y2 give S(Y1w)=−qY2w′ and S(Y2w′)=−qY1w+(Q−1)Y2w′, so Y1w+q−1Y2w′ is a −1 eigenvector. These calculations take place in the original Laurent tensor space. Their images vanish in every adjacent pair of slots by [F1].

2.1step 1.1F1F3algebra

Diagonal and equal-residue relations. A repeated-index tensor is (Y1Y2)pdj and hence vanishes. If l<m have the same residue, write l=j−(r+a)e, m=j−re with a>0. The symmetric multiple (Y1Y2)r(Y1a+Y2a)dj is in ker⁡(S+1) by step 1.1; its image is ul∧um+um∧ul, giving the equal-residue relation. No individual nonsymmetric loop multiplier of a kernel vector has been assumed to preserve the kernel.

2.2step 1.1F1F2F3algebra

Distinct residues without wrapping. Write l=j−pe, m=k−re with j<k. Then m−l=(p−r)e+(k−j)=ae+b, so p=r+a and b=k−j. If a=0, the symmetric common shift (Y1Y2)r(w+q−1w′) gives ul∧um=−q−1um∧ul. If a>0, multiply the same kernel vector by the symmetric Laurent polynomial (Y1Y2)r(Y1a+Y2a). The four resulting images are, with coefficients 1,q−1,1,q−1, respectively (l,m), (m−ae,l+ae), (l+ae,m−ae), (m,l). Their sum is zero, which is precisely the fourth displayed relation.

3.1step 1.1step 2.1step 2.2F1F2F3algebra

Distinct residues across the representative boundary. If j>k, the same expressions have p−r=a+1 and b=e+k−j. The wrapped base kernel vector of step 1.1 is h=Y1w+q−1Y2w′. For a=0, its common shift (Y1Y2)rh gives the third displayed relation. For a>0, its symmetric multiple (Y1Y2)r(Y1a+Y2a)h has images (l,m), (m,l), (l+ae,m−ae) and (m−ae,l+ae) with coefficients 1,q−1,1,q−1. Thus it gives the same fourth relation in this case also. Together with step 2.1 this exhausts all residue and Laurent-exponent configurations.

4.1step 2.1step 2.2step 3.1givenalgebra

Pair recursion and whole-word termination. In the mixed case the correction indices are m−b and l+b, strictly between l and m, with gap ae−b<ae+b; the first correction pair is already decreasing, and the reverse pair can be rewritten recursively. For a word of length N, fix its original interval [L,U] and total sum T. Every branch stays among the finitely many integer tuples in [L,U]N of sum T. Sort a tuple decreasingly and list its first N−1 prefix sums. Balancing a pair of extremes strictly decreases this list in lexicographic order: the sums of the largest r coordinates cannot increase, and at least one decreases since the sorted multisets differ. A leading adjacent swap preserves this list and decreases by one the number of pairs of positions whose indices are increasing. Hence the lexicographic pair consisting of prefix-sum list and inversion count strictly decreases along each nonzero branch. Its range is finite, so rewriting terminates. Equal adjacent indices vanish; a terminal nonzero word is strictly decreasing.

5.1step 4.1F1F3givenalgebra∎

Charts and energy. All coefficients in the displayed relations belong to A=Z[q,q−1]. Step 4.1 therefore expresses every Laurent tensor-lattice image in the A-span of the normal wedges; conversely each normal wedge is such an image. These two lattices equal WA. For independence, take finitely many distinct normal tuples I1,…,It and their raw tensors tIk. By [F2], the Laurent Hecke action is regular at q=1, where its residue formula gives Si=−Pi with Pi the factor flip and its divided-difference term vanishes. Thus AN specializes to the signed antisymmetrizer. The coefficient matrix of ANtIk on the decreasing raw rows tIj specializes to the identity: a different normal tuple has a different multiset, and only the identity permutation contributes to its own decreasing row. This minor is nonzero over Q(q). A relation ∑kckuIk=0 in the quotient implies ∑kckANtIk=0 by its definition, so the minor forces every ck=0. Consequently the positive chart is the internal direct sum W0=⨁IZ[q]uI as asserted. Since q is a unit on WA, WA/qWA=0. The energy criterion is exactly [F3] and concerns the opposite channel. These computations establish every displayed relation and chart assertion in the Definition, using the kernel contract in [F1].

Depends on

Used by

Dependency tree · two levels

14 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