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.
Rational Garnir annihilator lines present the specified Specht generator
Statement
Fix the level-one type-A integer KLR presentation, charge , and finite quantum characteristic . Let be any characteristic-zero field in the specified Hecke regime, let be the specified partition, and let be the LEFT graded Murphy cell Specht module with its specified initial cyclic generator . Then there is a finite-dimensional graded module for the rational KLR algebra, with a specified homogeneous cyclic vector , and a graded generator-preserving isomorphism . The rational module is explicitly presented by the initial weight, dot and horizontal crossing relations, together with one homogeneous rational relation for each Garnir belt. Each of these relations is the unique vector with Garnir coefficient in the kernel of a finite matrix with integer entries, obtained from crossing operators in the integer row permutation module. It therefore depends only on the integer presentation, not on a choice of or of a root of unity.
If the specified normalized simple head is nonzero and absolutely simple, this construction, combined with the local cyclic-head descent lemma, defines its initial-generator image line over up to scalar. The orbit of that image under the finite integer cyclotomic algebra is a lattice of rank .
Facts & Assumptions
The PBW (monomial) basis theorem for KLR algebras gives the affine KLR PBW basis. Dot slides remove one crossing from correction terms, quadratic moves remove two, and three-term braid corrections remove three. Preferred reduced expressions differ by terms with strictly fewer crossings.
The type-A cyclotomic specialization of the QG-KLR algebras fixes the integer coefficients and the source BK/BKW crossing convention . This proof uses that convention directly; it does not identify KMR's reversed-orientation crossing with it.
The graded Specht module has a homogeneous tableau basis supplies the LEFT Murphy cell Specht module's homogeneous standard basis and triangularity: for every tableau , is a combination of standard with in strong Bruhat order. Idempotents and grading restrict this expansion to the vector's weight and degree.
The specified initial vector has weight , all dots kill it, and a crossing kills it when its two successive entries occupy the same initial row. These are the initial-generator relations in the reviewed BKW construction, not conditions imposed on an arbitrary vector in a simple.
An integer cyclic presentation descends the simple-head generator line proves characteristic-zero radical base change by the regular trace pairing, hence descends a rational cyclic module's normalized simple head and its specified generator image, and proves the lattice rank.
The integral form of the cyclotomic Hecke-KLR block gives the finite free integer cyclotomic algebra used in step 12.1. The local PBW straightening used before that quotient is integral: its monic moves have integer coefficients, and independence follows by rational scalar extension of the supplied PBW basis.
Proof
Given: The stated level-one integer presentation, the specified LEFT cell module and its initial generator, and F1–F5. No Axiom of Choice is used.
Put in the residue formulas below. Work first in the affine content algebra before the cyclotomic quotient. For each row of , the successive residue segment has a one-dimensional integral module on which its word idempotent is and its dots and internal crossings are . The KLR relations hold: successive colours are distinct, their quadratic at zero dots is , and a possible three-strand repeated-endpoint pattern occurs only for , where its double-edge braid correction also vanishes at zero dots. Induce the tensor product of these segment modules, and shift its generator to degree , where is row reading. Denote the result by .
Fix a Garnir node with . Its belt consists of the row- suffix beginning at column and row- prefix ending at column . The entries in these nodes in form one consecutive interval : the suffix ends at the last position of row , immediately followed by the prefix at the beginning of row . Let agree with outside the belt and fill first, then , increasingly with . It is row-strict and nonstandard. This is the nonstandard belt filling used for the rational-kernel presentation; it is distinct from the maximal STANDARD Garnir tableau in The domination order on tableaux, Garnir tableaux and bricks.
Let be the Young row subgroup. Choose reduced expressions compatible with the unique decomposition , with a minimal representative for and , and . F1 then makes the inducing bimodule free over the row algebra on the minimal-representative words. Tensoring the one-dimensional row modules shows that has the integral basis indexed by all row-strict tableaux . Its cyclic presentation is exactly the initial weight, dot and horizontal-crossing relations. In particular all generator-action matrices on this finite basis have integer entries. Put ; scalar extension gives . By F4, there is a surjective graded map carrying exactly to .
Among ALL row-strict tableaux agreeing with outside this belt, is the only nonstandard one. For columns , the upper entry is an unchanged number less than , hence less than every changed lower entry. For columns , the lower entry, if present, is unchanged and greater than , hence greater than every changed upper entry. Comparisons with the row above or the row below have the same strict bounds, and every other column comparison is unchanged. Thus only column can fail. It fails precisely when the first upper-belt entry exceeds the last lower-belt entry. Since each of the two rows is increasing, this is equivalent to every upper-belt entry exceeding every lower-belt entry, and hence to the unique filling .
On , the residue word is one successive-residue segment. Along the residues increase by ; its final node has residue . The first node of , , has residue , and the rest again increase by . Consequently for every , including . This distinctness, rather than any braid normalization, is essential.
Crossing straightening gives a filtration useful below: a word with at most crossings applied to is a combination of with . Move dots right, reduce nonreduced words by quadratic and Coxeter moves, compare reduced words, and split off the right row subgroup as in step 2.1. Positive dot powers kill ; a nontrivial row factor ends in an internal crossing and also kills . Every correction has fewer crossings. In particular if is row-strict and , then plus terms of strictly smaller crossing length, with leading coefficient exactly . If is not row-strict, its possible leading term is killed by the right row factor and only shorter terms remain.
Let and let be the span of those integral basis vectors for which agrees with outside the belt, has weight , and has homogeneous degree . It includes . The use of the entire weight-degree slice avoids any brick-classification assumption. Write .
The vector is a combination of images of standard basis vectors in . Indeed F3 gives standard with . The permutation belongs to the parabolic subgroup generated by , since it permutes only . Every Bruhat-smaller permutation belongs to this same subgroup: choose a reduced word for in these generators, and use the defining subword characterization of strong Bruhat order. Hence agrees with outside the belt. Weight idempotents discard different words, and homogeneity discards different degrees, leaving exactly the standard vectors in the slice of step 3.2. By step 2.2, every other vector of the slice is standard; by F3 its image is part of the standard Specht basis and is linearly independent. Therefore is precisely one-dimensional, including the case where the image of is zero.
For every , the image in is spanned by standard row-strict belt tableaux. To see the support assertion, choose reduced words for all belt permutations using only . Straightening a crossing supported in this interval never introduces a crossing outside it; factoring a right row permutation also uses only this interval. Thus every resulting row-strict basis tableau agrees outside the belt. The image has fixed weight , which differs from by step 2.3. Its support cannot include the sole nonstandard belt tableau . Hence the entire image has standard support by step 2.2, and is injective on its span by F3.
If , then . The injectivity in step 4.2 implies in for every inside-belt crossing. Thus this one-dimensional Specht-kernel line lies in .
The coefficient map is injective on . Suppose a nonzero has that coefficient zero. Choose a tableau with nonzero coefficient in whose crossing length is maximal. It is standard by step 2.2. Record membership in or for the successive numbers as a binary word. Unless this word is all then all , it has an adjacent occurrence ; that excluded word is exactly . Choose such an occurrence at . Swapping them preserves row strictness because they lie in different rows and are consecutive numbers; it increases permutation length by , because is in the earlier row. Its weight becomes , so it cannot be and is also standard by step 2.2. By step 3.1, the coefficient of in at length is precisely the nonzero coefficient of in . A lower-length input cannot reach length ; a different equal-length input has a different possible leading tableau because is injective; and its correction terms have smaller length. Therefore , contradicting .
Consequently , while step 5.1 gives a nonzero line inside it. Thus . Define using the same intersection of crossing kernels over . These are kernels of a single finite stacked matrix with integer entries on the explicitly selected integral row-strict bases. Row reduction over commutes with extension to , so . It follows that is one-dimensional and has a unique rational vector with coefficient on . Its scalar extension is exactly the Specht-kernel vector with that normalization. This is an explicit rational linear-system construction of the relation, not an assumption that a chosen vector belongs to a rational form.
Every other row-strict belt tableau has strictly smaller crossing length than . Outside the belt there are no inversions involving belt entries because the belt interval is consecutive in row reading and its values form . Inside, inversions are exactly upper/lower pairs with the upper entry larger. The tableau has all such inversions, whereas every other filling loses at least one. Hence with rational , and it is homogeneous of degree by its definition in the slice.
Put . We prove standard spanning locally. For any nonstandard row-strict , choose a vertical inversion at . All entries in its upper suffix exceed all entries in its lower prefix . Its Garnir factor therefore satisfies with and : reordering the contiguous belt's one-line list from to removes precisely its cross inversions, while preserving within-part and outside comparisons. Reduced-word straightening and the relation replace by words with fewer than crossings, by step 8.1. The filtration of step 3.1 expresses these as row-strict vectors of strictly smaller length. Induction proves that standard vectors span the quotient.
Scalar extension of the rational quotient presentation gives . Every lies in by step 7.1, so induces a surjection preserving the generator and grading. The source is spanned by the standard vectors by step 9.1, and their images are the linearly independent standard Specht basis by F3. Hence this map is an isomorphism. In particular the rational module is finite-dimensional, has its standard basis, and its generator maps exactly to .
The rational module factors through the cyclotomic quotient. Each specified cyclotomic relation acts as zero after extension to , because the module in step 10.1 is the specified cyclotomic Hecke cell Specht module. The matrix of that action on the rational standard basis has rational entries; faithful field extension forces it to be zero already over . Denote this rational cyclotomic module by , with generator the class of . This identifies the required rational initial cyclic generator, not merely the unpointed module's isomorphism class.
If an integer cyclic quotient is desired for F5, take the saturated generator annihilator in the finite integer cyclotomic algebra of The integral form of the cyclotomic Hecke-KLR block. It is a homogeneous left ideal, and identifies with the integral orbit . Its rational span is the entire rational module by cyclicity, so with the specified generator. Clearing denominators in each is also possible, but no unsaturated integer quotient or integral Specht-freeness theorem is needed.
Apply F5 to this pointed rational form and the supplied absolutely simple normalized head. Its radical-basechange proof gives a rational normalized head with the image of ; absolute Schur makes every quotient map to the fixed head differ only by a scalar. Its integral-algebra orbit is finitely generated and torsion-free, with rational span that head, so its rank is exactly the head's -dimension. This establishes the precise requested initial-generator line and lattice statement over arbitrary characteristic-zero . No three-brick identity, unproved R-matrix formula, arbitrary-vector rational form, or change of the specified generator enters the argument.
Depends on
- The PBW (monomial) basis theorem for KLR algebras
- The type-A cyclotomic specialization of the QG-KLR algebras
- The graded Specht module has a homogeneous tableau basis
- The graded Specht module by homogeneous standard tableaux
- The domination order on tableaux, Garnir tableaux and bricks
- An integer cyclic presentation descends the simple-head generator line
- The integral form of the cyclotomic Hecke-KLR block
Used by
Dependency tree · two levels
43 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
- Brundan–Kleshchev–Wang, Graded Specht modules, arXiv0901.0218v3 (standard reference, not scraped)
- Kleshchev–Mathas–Ram, Universal graded Specht modules for cyclotomic Hecke algebras, arXiv1102.3519v1 (standard reference, not scraped)