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

Normally ordered q-wedges form a basis for every finite wedge length

Statement

For every N≥1 the normally ordered wedges {um1∧⋯∧umN:m1>m2>⋯>mN} of The finite q-wedge space and the normal-ordering relations form a Q(q)-basis of WN and an A=Z[q,q−1]-basis of the Laurent lattice WA. The straightening algorithm terminates with a well-founded profile: the total index sum and the ambient index interval are preserved, secondary pairs become strictly more balanced in the sorted dominance profile, and a leading adjacent swap decreases the inversion count; in particular no bound by the initial inversion count alone is used. The local A0-chart L0:=A0W0, where A0=Q[q](q) and W0 is the separate Z[q]-span of the normal wedges, is a crystal basis: for each color i, on the occupied set of a normal tuple the disjoint pairs (ui+ke,ui+ke+1) behave as two-vertex highest-weight 1 strings, empty and doubly occupied pairs are frozen, and a shift of an index by one either stays ordered or collides to zero; hence the residues of the ordered wedges are stable under the normalized string operators and give a crystal of the integrable affine wedge module. The image of the full Z[q]-tensor lattice need not equal W0, and negative powers of q in the straightening are not asserted to be triangular at q=0.

Facts & Assumptions

Given: The finite wedge quotient, all normally ordered wedges and the charts WA,W0 of the Statement.

[F1]

The complete three-case straightening follows from the original Laurent divided-difference action and terminates with Laurent coefficients and fixed ambient interval and total sum (The finite q-wedge space and the normal-ordering relations).

[F2]

The contract of The q-antisymmetrizer splits the tensor power and its kernel is the sum of the Hecke kernels gives AN2=CNAN, CN≠0, ker⁡AN=∑iker⁡(Si+1) and the quotient identification WN≅im⁡AN. On the quotient Si=Q=q2.

[F3]

The actual residue matrix and divided difference specialize at q=1 to Si=−Pi, with Pi the factor flip; the divided-difference term vanishes. Consequently AN specializes to ∑w(−1)ℓ(w)Pw, the signed ordinary antisymmetrizer.

[F4]

The vector rules are Eium=δm≡i+1um−1, Fium=δm≡ium+1, and Kium=qδm≡i−δm≡i+1um; the fixed coproduct is ΔEi=Ei⊗Ki−1+1⊗Ei and ΔFi=Fi⊗1+Ki⊗Fi (The vector representation has a perfect crystal of level one and a lower global basis).

[F5]

Over the local ring A0=Q[q](q), the tensor product of two divided-basis simple rank-one strings has a basis of divided highest-weight strings whose residues permute the tensor-basis residues; the normalized operators preserve its lattice and induce the crystal tensor rule and partial inverses (Rank-one tensor strings and their crystal limit rule).

Proof

technique · the finite dominance and signed specialization proof establishes the field and Laurent bases; the rank-one cube calculation and local-ring tensor-string rule establish the complete localized crystal claim
1.1F1givenalgebra

Spanning and termination. For any finite tensor combination choose a finite interval containing its indices. In each word the total sum stays fixed under [F1]. Among the finite set of words in this interval of that sum, order first the sorted decreasing prefix-sum list and then the increasing-pair inversion count. Each secondary balanced pair strictly decreases the former, while a leading adjacent swap decreases the latter and leaves the former fixed. The multiset can change in a secondary branch. Thus every branch terminates, either at zero from repeated adjacent indices or at a strictly decreasing tuple. The relations have coefficients in A, proving field spanning and Laurent spanning.

2.1F2F3step 1.1givenalgebra

Field independence. For finitely many distinct normal tuples Ik, let tIk be their raw tensors. Each ANtIk is a finite Laurent-polynomial combination of raw tensors, regular at q=1. Select the finite union of all their supports as rows. At q=1, [F3] gives signed antisymmetrizations. The strictly decreasing raw row tIj occurs with coefficient 1 in column j and coefficient 0 in the other columns: distinct decreasing tuples have distinct index multisets. Therefore the square minor on these rows specializes to the identity determinant 1 and is nonzero in Q(q). If ∑kckuIk=0, [F2] gives ∑kckANtIk=0, so that nonzero minor forces every ck=0. This proves field independence and, with step 1.1, a field basis for every N.

3.1step 1.1step 2.1givenalgebra

Laurent freeness. Step 1.1 supplies Laurent spanning. Any finite A-linear relation is also a field-linear relation and is zero coefficientwise by step 2.1. Thus the map from the direct sum of one copy of A for each normal tuple to WA is both surjective and injective, proving precisely the claimed Laurent basis. No implication from torsionfreeness over a nonprincipal ring is used. The separate positive span is free over Z[q] by the same independence.

3.2F1F4step 2.1algebra

The exact rank-one cube. Fix a color i. The integer pairs (i+ke,i+ke+1) are disjoint for every e≥2. An empty pair is inert; a doubly occupied pair is inert because applying Ei or Fi makes a repeated adjacent index, whose wedge is zero. Its net Ki-weight is zero. A singly occupied pair is a copy of the highest-weight-one rank-one module. Changing a free bit shifts an index by one and keeps the word decreasing; the only possible obstruction is an already occupied partner, the frozen double-pair case. Hence each block of fixed pair occupancies is, in decreasing pair order, exactly a tensor product of these free rank-one modules. More explicitly, Fi on a free high bit has coefficient q∑s<tϵs and Ei on a free low bit has coefficient q−∑s>tϵs, where ϵs=1 for a high bit and −1 for a low bit and the sums are over earlier or later free pairs. Frozen pairs contribute zero. Thus the tensor cube identification is an equality of module actions.

4.1F5step 3.2step 2.1algebra

Local crystal stability on every cube. Apply [F5] inductively to a cube with r free pairs. For r=0,1 its divided-string basis is its ordinary basis. If the first r−1 factors have been written as a direct sum of simple divided strings with an A0-basis whose residues permute the product basis, tensor each string with the final highest-weight-one factor. The finite calculation of [F5] produces a divided-string basis of each such tensor summand whose residues again permute its product residues. Its transition determinant is a unit of A0, so the lattice remains exactly the A0-span of the cube words, and the normalized operators act on these divided strings, preserve this lattice and permute its residues or send them to zero, with partial inverses. Induction proves these assertions for every finite cube. Step 3.2 identifies this lattice with the corresponding block of L0; the block bases are subsets of the normal basis, and their direct sum covers every tuple. Consequently both normalized operators preserve L0 and give the claimed crystal on its normal residues for every color.

5.1F2step 2.1step 3.2step 4.1givenalgebra

The weight and integrability conditions. A normal wedge is a weight vector, since its raw tensor is one and the kernel is quantum-group stable by [F2]; thus the free local span decomposes by weights. It generates WN by step 2.1. For fixed color every tuple lies in the finite cube of step 3.2, a tensor product of finite rank-one modules; hence Ei,Fi are locally nilpotent on all finite linear combinations. Together with the operator stability, residue basis and partial inverses of step 4.1, this proves that L0 with the normal residues is a crystal basis of the integrable affine wedge module.

6.1step 1.1step 2.1step 3.1step 3.2step 4.1step 5.1∎

Conclusion. The normal wedges give the field and Laurent bases and the finite dominance termination profile; the exact rank-one cube action establishes the crystal basis on the separate local chart L0=A0W0. The image of the positive tensor lattice is not identified with W0 or L0, and no triangularity of negative straightening powers at zero has been used.

Remarks

The necessary ring correction has a concrete two-bit witness: for e=3,i=1,N=2, set h=u4∧u1, x=u5∧u1, y=u4∧u2, z=u5∧u2. Then F1h=x+qy, F1(2)h=z, and s=x−q−1y has E1s=F1s=0. The unique string decomposition is x=(1+q2)−1F1h+q2(1+q2)−1s, giving f~1x=(1+q2)−1z. This lies in L0 but not in the polynomial span W0; field independence proves the latter assertion. Thus the literal previous polynomial-lattice claim could not be retained.

Depends on

Used by

Dependency tree · two levels

16 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