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 let carry the affine Hecke action and put , where ; write for the image of the pure tensor, and let denote this product. Call an index tuple normal (or normally ordered) if , and set , , where is the image of the corresponding ordered wedge.
For write with , (so and is the residue difference). The normal-ordering relations are:
where the last line is to be read as a relation in 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 and , so the procedure terminates. The energy normal order is the equivalent formulation through the opposite-channel energy: is rewritten toward decreasing indices by 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.
The contract of The q-antisymmetrizer splits the tensor power and its kernel is the sum of the Hecke kernels gives and , where ; therefore each induces the scalar on . The kernel is stable under the quantum group action.
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: .
Each with , , and 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
Symmetric Laurent multiplication preserves . If , [F2] gives , since the divided difference of is zero; this applies also to negative common loop shifts . On a diagonal one has . For , set and ; substitution gives . For the divided differences of give and , so is a eigenvector. These calculations take place in the original Laurent tensor space. Their images vanish in every adjacent pair of slots by [F1].
Diagonal and equal-residue relations. A repeated-index tensor is and hence vanishes. If have the same residue, write , with . The symmetric multiple is in by step 1.1; its image is , giving the equal-residue relation. No individual nonsymmetric loop multiplier of a kernel vector has been assumed to preserve the kernel.
Distinct residues without wrapping. Write , with . Then , so and . If , the symmetric common shift gives . If , multiply the same kernel vector by the symmetric Laurent polynomial . The four resulting images are, with coefficients , respectively , , , . Their sum is zero, which is precisely the fourth displayed relation.
Distinct residues across the representative boundary. If , the same expressions have and . The wrapped base kernel vector of step 1.1 is . For , its common shift gives the third displayed relation. For , its symmetric multiple has images , , and with coefficients . Thus it gives the same fourth relation in this case also. Together with step 2.1 this exhausts all residue and Laurent-exponent configurations.
Pair recursion and whole-word termination. In the mixed case the correction indices are and , strictly between and , with gap ; the first correction pair is already decreasing, and the reverse pair can be rewritten recursively. For a word of length , fix its original interval and total sum . Every branch stays among the finitely many integer tuples in of sum . Sort a tuple decreasingly and list its first prefix sums. Balancing a pair of extremes strictly decreases this list in lexicographic order: the sums of the largest 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.
Charts and energy. All coefficients in the displayed relations belong to . Step 4.1 therefore expresses every Laurent tensor-lattice image in the -span of the normal wedges; conversely each normal wedge is such an image. These two lattices equal . For independence, take finitely many distinct normal tuples and their raw tensors . By [F2], the Laurent Hecke action is regular at , where its residue formula gives with the factor flip and its divided-difference term vanishes. Thus specializes to the signed antisymmetrizer. The coefficient matrix of on the decreasing raw rows 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 . A relation in the quotient implies by its definition, so the minor forces every . Consequently the positive chart is the internal direct sum as asserted. Since is a unit on , . 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
- The q-antisymmetrizer splits the tensor power and its kernel is the sum of the Hecke kernels
- The vector representation has a perfect crystal of level one and a lower global basis
- The level-zero vector representation, its affinization and the level-one crystal energy
- The affine Hecke algebra and its commuting action on tensor powers of the vector representation
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
- Bernard Leclerc, Fock space representations (author-hosted complete 38-page treatment) (standard reference, not scraped)
- Masaki Kashiwara, Tetsuji Miwa and Eugene Stern, Decomposition of q-deformed Fock spaces, arXiv:q-alg/9508006 (standard reference, not scraped)
- Kashiwara-Miwa-Petersen-Yung, Perfect crystals and q-deformed Fock spaces (standard reference, not scraped)