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 polynomial differential representation and positive-characteristic nonfaithfulness
Statement
Let be any field and . Multiplication by and partial differentiation define a unital left -module structure on . If , this representation is not faithful: is a nonzero element of that acts by zero.
Facts & Assumptions
Given: A field , an integer , and the polynomial ring .
The polynomial ring as finitely supported coefficient families on monomials: polynomial elements are finite -linear combinations of distinct monomials .
Polynomial Weyl algebra and its central parameter: , where has basis and is generated by the same-type commutators and .
Polynomial Weyl algebra presentation and normal-ordered basis: the monomials form a basis of .
Universal property of the tensor algebra: a linear assignment from the generators to a unital associative algebra extends to a unital algebra homomorphism from the 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.
Unital left and right modules over a ring; unqualified module means left module: a unital algebra homomorphism into endomorphisms defines a unital left module action by evaluation.
The ideal generated by a subset and principal ideals: the ideal generated by a set is contained in every two-sided ideal containing that set.
Verification
On a monomial define , and define when and when ; extend both maps -linearly using [F1].
The commute because multiplication in the polynomial ring commutes; for distinct , the commute because applying the two exponent-lowering maps multiplies by in either order, and commutes with itself. For each , applying to gives : when the coefficient difference is , and when the two terms agree. Hence the generator assignments satisfy [F2].
Pointwise addition and scalar multiplication and composition make a unital associative -algebra: composition is associative, the identity map is its unit, and -bilinearity follows by evaluating on polynomials. Send each generator to . By [F4] this linear assignment extends to a unital algebra map from . Step 2.1 shows that it kills every defining relator in [F2]. Its kernel is a two-sided ideal because it is an algebra homomorphism, so it contains their generated ideal by [F7]. By [F5] it factors through the quotient ; write for this factor, which is -linear because the quotient map is surjective. Evaluation gives a unital left module by [F6]. If , then for every monomial, : it vanishes when , and otherwise its coefficient is a product of consecutive integers, hence divisible by . Thus .
By [F3], is a nonzero normal-ordered basis monomial in , while step 3.1 shows that the representation sends it to zero. Therefore the representation is nonfaithful in positive characteristic.
Depends on
- Polynomial Weyl algebra and its central parameter
- Polynomial Weyl algebra presentation and normal-ordered basis
- The polynomial ring $R[x_i:i\in I]$ as finitely supported coefficient families on monomials
- Universal property of the tensor algebra
- A ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring
- Unital left and right modules over a ring; unqualified module means left module
- The ideal generated by a subset and principal ideals
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
27 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, §2.1.1 (standard reference, not scraped)
- Pavel Etingof, Lectures on Calogero-Moser Systems, Lecture 8 (standard reference, not scraped)