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.
Polynomial Weyl algebra presentation and normal-ordered basis
Statement
Let be any field, , and . Let and be as in Finite-dimensional Heisenberg Lie algebra and Polynomial Weyl algebra and its central parameter. Since is central, define the quotient .
Then the assignment
identifies the polynomial Weyl algebra with the central quotient
The normal-ordered elements
form a -basis of for every characteristic. Equivalently, in the presentation of Polynomial Weyl algebra and its central parameter, the relations rewrite to these unique normal forms. If , scaling gives ; if , the defining generators commute.
Facts & Assumptions
Given: A field , an integer , the Heisenberg Lie algebra , its enveloping algebra, and the polynomial Weyl algebra as defined above.
Finite-dimensional Heisenberg Lie algebra: has ordered basis , with and central.
The Heisenberg bracket satisfies the Lie algebra axioms: the bracket in [F1] is alternating and satisfies Jacobi, so the enveloping-algebra definition applies.
Universal enveloping algebra: , where is generated by .
Poincaré–Birkhoff–Witt theorem: for a supplied ordered basis of a Lie algebra, its weakly increasing monomials form a basis of the universal enveloping algebra.
Polynomial Weyl algebra and its central parameter: is the tensor-algebra quotient by , , and .
Tensor algebra of a vector space: multiplication in the tensor algebra is concatenation of tensors and the empty tensor is the unit.
The ideal generated by a subset and principal ideals: the ideal generated by the relators is the intersection of the two-sided ideals containing them, so it contains every finite sum of their left and right multiples.
The quotient ring with : quotient elements are additive cosets, with multiplication induced by multiplication in the ring.
Universal property of the tensor algebra: a linear map from a vector space to a unital associative -algebra extends uniquely to a unital -algebra homomorphism from its tensor algebra.
A ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring: a ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring.
Proof
Order the basis of as . By [F4], the elements form a -basis of . In particular, the powers are linearly independent; let denote their polynomial subalgebra. Since is central by [F1], grouping this basis by gives the direct-sum decomposition as a free -module.
Send , , and in . By [F1] and [F5], this linear assignment preserves the bracket on every basis pair, hence on all pairs by bilinearity. By [F9] it extends to a unital algebra map . The defining relators of in [F3] map to zero. The map's kernel is a two-sided ideal because it is an algebra homomorphism, so it contains their generated ideal by [F7], and [F10] factors the map through . This induced algebra map sends to zero; its kernel is two-sided and contains the ideal generated by that central element by [F7], so a second application of [F10] gives . The factor maps remain -linear because the quotient maps are surjective.
Orient the relations of [F5] by and when , and . For each word use the lexicographic measure (word length, number of inversions for ). Each swapped word has one fewer inversion, and each scalar correction has smaller length; hence every reduction terminates.
By step 1.1, is free as a -module on . Since is central, the ideal is the direct sum of . For , the identity for shows that is divisible by . The evaluation map , is surjective because it fixes constants, and the displayed identity shows its kernel is exactly ; hence . Therefore the classes of form a basis of .
The overlapping mixed reductions are with and with . For , reducing the left pair gives , while reducing the right pair gives ; these final expressions agree. For , reducing the left pair gives , while reducing the right pair gives ; these final expressions also agree. For a strictly decreasing same-type triple, both routes and reach the same sorted word; the same calculation holds for 's. Repeated indices remove the corresponding swap, and disjoint reductions commute by distributivity. Thus every local ambiguity joins.
By step 2.1, the central quotient has the normal basis just described. In , the images of satisfy , and the same-type commutators vanish. Send the basis generators of to these images; [F9] extends this linear assignment to a unital algebra map . It kills the relators in [F5]. Its kernel is a two-sided ideal, so it contains their generated ideal by [F7], and [F10] factors it uniquely through the quotient to . This factor map is -linear because the quotient map is surjective.
Induct on the decreasing measure from step 1.3. If two reduction sequences first choose different redexes, step 2.2 joins those first reductions; every word in the joining expressions has smaller measure, so the induction hypothesis gives it a unique final reduction. Thus every word has one normal form. Because each defining relation is a permitted reduction in any left-right word context, confluence makes the normal-form map kill every such context and hence the whole ideal from [F5]. Each reduction also changes a word by an element of , so every class is represented by its normal form. Therefore the quotient is spanned by normal words, and any linear relation among normal words in the quotient is fixed by the normal-form map while also lying in its kernel, so all its coefficients are zero.
The composites and fix every generator and the unit of their respective algebras. Those generators generate each quotient, so the composites are identity maps and are inverse isomorphisms. The basis from step 3.2 therefore transfers to .
If , the assignments , preserve the relations from to ; the inverse rescales by . If , [F5] makes every pair of generators commute. Thus the parameter branches and normal basis stated in the theorem hold.
Quotient diagram
The square records the maps used in steps 1.2, 3.1, and 4.1. The left vertical map sends , , and ; the top and bottom maps are the quotient maps from the tensor-algebra presentations; the right vertical map is the isomorphism proved above. The proof is the algebraic argument in the numbered steps, not the picture.
No axiom of choice is used: the Heisenberg basis is finite and explicitly ordered, and all reductions and index sums are finite.
Depends on
- Finite-dimensional Heisenberg Lie algebra
- The Heisenberg bracket satisfies the Lie algebra axioms
- Polynomial Weyl algebra and its central parameter
- Universal enveloping algebra
- Tensor algebra of a vector space
- The ideal generated by a subset and principal ideals
- The quotient ring $R/I$ with $(r+I)(s+I)=rs+I$
- Poincaré–Birkhoff–Witt theorem
- Universal property of the tensor algebra
- A ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring
Used by
- The polynomial differential representation and positive-characteristic nonfaithfulness Example
- Algebraic Weyl modules and exponentiated representations are different objects Remark
Cited to discharge well-definedness by Polynomial Weyl algebra and its central parameter.
Dependency tree · two levels
29 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
- François Dumas, Noncommutative Invariants, §§1.3.1, 2.1.1, and 3.2.1 (standard reference, not scraped)
- Pavel Etingof, Lectures on Calogero-Moser Systems, Lecture 8 (standard reference, not scraped)