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 loop filtration on the type-A finite W-algebra has associated graded U(g^e)
Statement
Equip with the loop (good) filtration induced by the pyramid grading of The type-A nilpotent pyramid, good grading and Whittaker character, and likewise for the shifted Yangian of The shifted Yangian and the pyramid generators of the type-A finite W-algebra. Then the associated graded algebra is canonically isomorphic to the enveloping algebra , viewed as a graded algebra via the restriction of the pyramid grading, and the isomorphism sends the leading symbol of the generator to , where the are the centralizer basis of the pyramid. In particular is a filtered deformation of , the loop filtration is separated, and the ordered monomials in the generators , , form a basis of .
This filtration is not the Kazhdan filtration: the Kazhdan filtration has associated graded the commutative Slodowy-slice algebra , while here is noncommutative in general.
Facts & Assumptions
Given: The pyramid , the finite W-algebra with its generators and loop filtration, and the centralizer basis , .
The ordered monomials in the finite -modes form a PBW basis of , and the loop degree of is (Ordered monomial PBW basis for the shifted Yangian, The shifted Yangian and the pyramid generators of the type-A finite W-algebra).
The leading symbol of in the loop filtration is ; the elements with form a basis of the centralizer and have brackets computed by expanding their sums in the ambient matrix-unit commutator (The shifted Yangian and the pyramid generators of the type-A finite W-algebra, The type-A nilpotent pyramid, good grading and Whittaker character).
Ordered monomials in a basis of a finite-dimensional Lie algebra form a PBW basis of its enveloping algebra (PBW gives an ordered monomial basis for the enveloping algebra); the associated graded of a filtered algebra is computed from the leading symbols of a filtered basis (Associated graded algebra of a filtered algebra).
The Kazhdan filtration of the Gan-Ginzburg construction has associated graded the commutative coordinate ring of the Slodowy slice, not the enveloping algebra of (Ordered monomial PBW basis for the shifted Yangian).
Proof
Given: The PBW basis and leading-symbol data of [F1]-[F2].
Actual ambient leading term. Give a matrix unit its good degree . In the explicit signed path formula a term of canonical degree with matrix-unit factors has good degree at most ; a diagonal scalar replacement only lowers that degree. Therefore only single-factor terms contribute in good degree . Those terms sum to over , , , namely . Products introduced by Gauss factorization or its inverse have at least two factors and have smaller good degree. Thus the leading homogeneous component of in the actual graded algebra is exactly . This proves the leading-symbol claim using the path degrees rather than a claim that Gauss inversion alone supplies its sign.
Independence in the ambient enveloping algebra. The elements form a homogeneous basis of the actual Lie subalgebra . Extend that finite basis to a homogeneous basis of , with an order extending the prescribed order of the centralizer basis. Enveloping PBW implies that the ordered monomials in the are linearly independent in , and that the natural homomorphism is injective. Their products and brackets are the actual ambient products and brackets, including all boundary terms of the centralizer strings. No projection of a current bracket with an arbitrary out-of-range convention is needed.
Strictness of the loop basis. The finite monomials form a vector-space basis of by [F1]. For a monomial with total loop degree , step 1.1 says that its degree- homogeneous component in is, up to the product of its displayed signs, the corresponding PBW monomial in . In any nonzero finite linear combination of monomials, take the largest total loop degree . The degree- homogeneous component is nonzero by step 1.2, even when degree-zero generators occur. Thus that combination belongs to and not to . Consequently the intersection filtration in the Statement is exactly the span of monomials of total loop degree at most , and their degree- symbols form a basis of its associated graded. This verifies symbol independence directly, rather than inferring it from independence of filtered elements.
The graded algebra isomorphism. For any subalgebra of a nonnegatively graded algebra with its intersection filtration, taking highest homogeneous components embeds its associated graded into that graded algebra: if a representative's component of degree is zero it already lies in filtration , and multiplication agrees with multiplication of homogeneous components. Apply this to . Step 2.1 identifies its image with the span of the ordered monomials in , which is precisely the embedded algebra from step 1.2. Hence , and the identification sends the symbol of to as asserted.
Filtration and the second graded algebra. Each generator has finite nonnegative good degree, and each element is a finite sum of monomials, so the loop filtration is exhaustive and bounded below with . The actual homogeneous decomposition in and step 2.1 give separatedness. The finite basis is already established in [F1], and step 3.1 establishes its filtered deformation property. Independently, the Kazhdan filtration uses positive weights on and has associated graded by [F4]; in the doubled convention its weights are twice these. That graded algebra is commutative, whereas is noncommutative whenever is nonabelian. These are the two claimed filtrations and their respective graded algebras.
Remarks
-
The index shift is part of the statement: the generator with loop degree is , and its symbol is . The coefficient index of the source series is , and no additional rescaling is applied.
-
The affine-Yangian proof notes expand the coefficient bookkeeping of steps 1.1-1.2 (Gauss inversion signs and the finite range); the finite-W matrix proof contains the tensor-model check of the same symbol assignment.
Depends on
- Ordered monomial PBW basis for the shifted Yangian
- The shifted Yangian and the pyramid generators of the type-A finite W-algebra
- The type-A finite W-algebra and the Whittaker category
- The type-A nilpotent pyramid, good grading and Whittaker character
- PBW gives an ordered monomial basis for the enveloping algebra
- Associated graded algebra of a filtered algebra
- Classical complex matrix Lie algebras
Used by
- The deformed tensor space for the type-A finite W-algebra Definition
- The degenerate cyclotomic Hecke algebra Definition
- The Whittaker functor from the relevant parabolic category-O summand Definition
- The finite W and degenerate cyclotomic Hecke actions satisfy a double centralizer Theorem
Cited to discharge well-definedness by The shifted Yangian and the pyramid generators of the type-A finite W-algebra.
Dependency tree · two levels
24 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
- Jonathan Brundan and Alexander Kleshchev, Schur-Weyl duality for higher levels, Selecta Math. (N.S.) 14 (2008) 1-57 (complete 50-page arXiv article) (standard reference, not scraped)
- Jonathan Brundan, Simon M. Goodwin and Alexander Kleshchev, Highest weight theory for finite W-algebras, Int. Math. Res. Not. 2008, no. 15 (complete 38-page arXiv article) (standard reference, not scraped)