← LibrarySimplicity Criteria for Differential Polynomial Rings | KEVOS®Project Delivery · Project ManagementLesson 143/189← PrevNext →
ArticlePublished 8 Aug 202624 min readBy Kevin Jogin
Skip to content

Engineering Mathematics Advanced Structure theory

Simplicity of Differential Polynomial Rings

Over a -algebra k carrying a derivation δ, the differential polynomial ring k[x;δ] is simple exactly when two independent obstructions vanish: k has no proper nonzero δ-stable ideal, and δ is not inner.

Page ID
KEVOS-ENG-MATH-NCR-0025
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(3.15)–(3.16), §3 (pp. 44–47)
Reviewed
2026-08-08
Version
1.0.0

Executive Summary

The differential polynomial ring R=k[x;δ] is the smallest ring in which the elements of k live alongside a formal operator x obeying the Leibniz rule xa=ax+δ(a). Whether R is simple is decided by two conditions on the pair (k,δ), and Lam's (3.15) shows that over a -algebra these two are also sufficient.

Each condition rules out one visible family of ideals. If k carries a proper nonzero δ-stable ideal 𝔄, then 𝔄R is a proper nonzero ideal of R. If δ=adc is inner, the change of variable t=xc makes t central and R=k[t] an ordinary polynomial ring, which is never simple.

The content of the theorem is that nothing else can go wrong. The proof is a minimal-degree argument: from an ideal I0,R one extracts a monic element of least degree n, and the commutator bggb produces the identity nδ(b)=bddb, which exhibits δ as inner once n is invertible. That inversion is the only use of the -algebra hypothesis, and it is not removable.

2Obstructions to simplicity
kStanding hypothesis
nδ(b)=bddbKey identity
neverArtinian

Overview

Let k be a ring and δ:kk an additive map with δ(ab)=δ(a)b+aδ(b). The differential polynomial ring k[x;δ] has as elements the left polynomials iaixi with aik, added coefficientwise and multiplied by the single rule

xa=ax+δ(a)(ak),
(1.7)

Iterating gives xna=i=0n(ni)δni(a)xi; in particular the coefficient of xn1 is nδ(a).

Setting δ=0 recovers the ordinary polynomial ring k[x]; the construction is one of the two basic Ore extensions, the other being the twisted ring k[x;σ] treated on the page for Skew Polynomial Rings: Hilbert's Twist. Both are covered by the general Ore extension k[x;σ,δ].

The question this page answers is when R=k[x;δ] has no two-sided ideals other than 0 and R. It matters because R is a natural source of simple non-artinian rings: it is a domain whenever k is, it is noetherian whenever k is, and its simplicity cannot come from a chain condition.

Two special cases are worth memorising. If k is a field of characteristic 0 and δ0, both conditions hold automatically, so k[x;δ] is simple. If k is commutative, every inner derivation is zero, so the second condition reduces to δ0 — and then the whole burden falls on δ-simplicity.

Learning Objectives

  • Write down the multiplication rule of k[x;δ] and the expansion of xna.
  • Define δ-ideal, δ-simple and inner derivation, and state (3.15) with its -algebra hypothesis.
  • Prove that δ inner implies k[x;δ]=k[t] with t=xc central.
  • Prove that a proper nonzero δ-ideal 𝔄 gives the proper nonzero ideal 𝔄R.
  • Carry out the minimal-degree argument that yields nδ(b)=bddb and conclude that δ is inner.
  • Exhibit a characteristic p pair (k,δ) satisfying both conditions with k[x;δ] not simple.

Definitions

DefinitionDerivation and inner derivation

A derivation on a ring k is an additive map δ:kk with δ(ab)=δ(a)b+aδ(b) for all a,bk. For ck the map adc(b)=cbbc is a derivation; derivations of this form are called inner. A derivation that is not of this form is non-inner or outer.

Note δ(1)=0 for every derivation, and adc=adc exactly when ccZ(k).

Definitionδ-ideal and δ-simplicity

A two-sided ideal 𝔄k is a **δ-ideal** if δ(𝔄)𝔄. The ring k is **δ-simple** if k0 and its only δ-ideals are 0 and k.

δ-simplicity is strictly weaker than simplicity: [y] with δ=d/dy is δ-simple but has plenty of ideals, none of which is stable under differentiation.

k[x;δ]
Left polynomials aixi, aik, with xa=ax+δ(a). Free as a left k-module on 1,x,x2,.
degf
The largest i with ai0, for f=aixi0. Degrees add when k is a domain, since (axm)(bxn)=abxm+n+lower.
adc
The inner derivation bcbbc determined by ck.
kδ
The ring of constants {ak:δ(a)=0}, a subring of k containing 1.
𝔄R
For a δ-ideal 𝔄, the set of polynomials all of whose coefficients lie in 𝔄; a two-sided ideal of R=k[x;δ].

Rings have an identity, k need not be commutative, and polynomials are always written with coefficients on the left. A Q-algebra means a ring containing a copy of the rationals in its centre, so every nonzero integer is a central unit.

Core Concepts

Obstruction one: stable ideals of the base

Suppose 𝔄 is an ideal of k with δ(𝔄)𝔄. Put 𝔄R={aixi:ai𝔄}. Left multiplication keeps the coefficients inside 𝔄 because baxi=(ba)xi and xaxi=axi+1+δ(a)xi, and both ba and δ(a) lie in 𝔄. Right multiplication does too, using the expansion of xib and the fact that 𝔄 absorbs on the right. So 𝔄R is a two-sided ideal, proper and nonzero whenever 𝔄 is.

Obstruction two: inner derivations

If δ=adc, set t=xc. Then for every ak

ta=(xc)a=ax+δ(a)ca=ax+(caac)ca=axac=at,

so t is central in R and R=k[t] is an honest polynomial ring over k in a central variable. Then tR is a nonzero proper two-sided ideal — nonzero because t0, proper because a nonzero element of tR has zero constant term, so 1tR.

Why a minimal-degree argument must work

R is filtered by degree and the associated graded ring is k[x¯] with x¯ central: the commutator of two elements has degree strictly less than the sum of their degrees. So commutators reduce degree, and any ideal is closed under them. An ideal that survives repeated commutation must contain elements of degree 0, that is elements of k — and δ-simplicity then pushes it up to the unit ideal.

The two commutators that matter are [x,f]=xffx, which multiplies the leading coefficient by δ, and [b,f]=bffb for bk, which produces the correction term nδ(b) in degree n1. The first shows the leading-coefficient set is a δ-ideal; the second is where δ becomes inner.

xffx=δ(an)xn+(lower),bggb=(bddbnδ(b))xn1+(lower),
(C.1)

Here f=anxn+ is arbitrary and g=xn+dxn1+ is monic.

Key Results

Theorem(3.15)Simplicity criterion

Let k be a -algebra and let δ be a derivation on k. Then R=k[x;δ] is a simple ring if and only if k is δ-simple and δ is not an inner derivation on k.

Proof

Necessity, by contraposition. Suppose first that δ=adc is inner. Putting t=xc gives ta=at for all ak, as computed above, so t is central and R=k[t]. The ideal tR is nonzero and proper, so R is not simple.

Now suppose 𝔄 is a δ-ideal of k with 0𝔄k. Then 𝔄R, the set of polynomials with all coefficients in 𝔄, is a two-sided ideal of R: it absorbs left multiplication because x(axi)=axi+1+δ(a)xi and δ(𝔄)𝔄, and it absorbs right multiplication because expanding xib produces only coefficients of the form δj(b) multiplied on the left by elements of 𝔄. It is nonzero and does not contain 1, so again R is not simple.

Sufficiency. Assume k is δ-simple and suppose, for contradiction, that R has an ideal I with 0IR. We derive that δ is inner.

Let n be the least degree of a nonzero element of I, and let 𝔄k consist of 0 together with the leading coefficients of the degree-n elements of I. Then 𝔄 is an ideal of k: if f=axn+I and bk, then bfI has leading coefficient ba, and fbI has leading coefficient ab because xnb=bxn+; sums are handled by noting that a cancellation of leading terms leaves an element of I of degree <n, which must be 0.

𝔄 is a δ-ideal: for f=axn+I we have xffxI, and since x(axn)=axn+1+δ(a)xn while fx contributes axn+1, the difference has degree at most n with coefficient δ(a) in degree n. Hence δ(a)𝔄.

By δ-simplicity and 𝔄0 we get 𝔄=k, so 1𝔄: there is a monic g=xn+dxn1+I. If n=0 then g=1I and I=R, contrary to hypothesis; so n1.

Now take any bk. From xnb=bxn+nδ(b)xn1+(lower) we obtain

bggb=(bddbnδ(b))xn1+(lower terms).

This element lies in I and has degree at most n1<n, so it is 0 by minimality of n. Comparing the coefficient of xn1 gives nδ(b)=bddb for every bk.

Since k is a -algebra and n1, the integer n is a central unit. Writing c=d/n we get δ(b)=b(d/n)(d/n)b=cbbc for all b, so δ=adc is inner. This is the required contradiction, and R is simple.

Corollary(3.16)Amitsur

Let k be any simple ring of characteristic 0 and let δ be a non-inner derivation on k. Then R=k[x;δ] is a simple ring which is not left artinian.

Proof

The centre Z(k) of a simple ring is a field. Since chark=0, that field contains , so k is a -algebra. A simple ring has only the ideals 0 and k, both of which are δ-stable, so k is δ-simple. Theorem (3.15) now applies and R is simple.

For non-artinianness, note that right multiplication by x involves no twisting: (ajxj)xi+1=ajxj+i+1. Hence every nonzero element of Rxi+1 has zero coefficients in all degrees i, while xi has coefficient 1 in degree i. Therefore xiRxi+1 and

RxRx2Rx3

is a strictly descending chain of left ideals, so R fails the DCC.

CorollaryFields of characteristic zero

Let k be a field of characteristic 0 and δ0 a derivation on k. Then k[x;δ] is a simple, non-artinian, left and right noetherian domain.

Indeed k has no proper nonzero ideals, hence is δ-simple; k is commutative, so its only inner derivation is 0δ; and k[x;δ] is a domain because degrees add over a field. The noetherian claim is the Ore-extension form of the Hilbert Basis Theorem.

CounterexampleThe -algebra hypothesis cannot be dropped

Let p be a prime, k=𝔽p(y) and δ=d/dy. Then k is a field, hence δ-simple, and δ0 is non-inner because k is commutative. Yet R=k[x;δ] is not simple.

The reason is that δp=0 on 𝔽p(y): it is again a derivation, and it kills y because p consecutive integers have a product divisible by p. Substituting into xpa=i(pi)δpi(a)xi=axp+δp(a) gives xpa=axp for all ak. So xp is central, and Rxp is a nonzero proper ideal.

Proof Techniques and Method

How these proofs work, and which move to reuse.

Three reusable techniques, all visible in the proof of (3.15) and all reappearing in the skew Laurent analogue (3.18).

Move 1

Minimal degree plus leading coefficients

Given an ideal I0, take the least degree n and collect leading coefficients into 𝔄k. This turns an ideal of R into an ideal of k, where the hypothesis on (k,δ) can bite.

Move 2

Commutators lower the degree

[x,f] and [b,f] both drop degree because the associated graded ring is commutative. An ideal closed under them and containing something of minimal degree n is forced into relations among its coefficients.

Move 3

Normalise to monic, then read off a relation

Once 𝔄=k one may assume the minimal-degree element is monic. The coefficient of xn1 in bggb then yields an equation valid for all b, and that equation is exactly the statement that δ is inner.

The pattern generalises: in every Ore extension, simplicity is decided by which ideals of the base survive the twisting data, plus a non-degeneracy condition saying the twisting is not a change of variables away from being trivial. For δ that condition is non-inner; for an automorphism σ it is infinite inner order.

Worked Example

The rational differential operator algebra (y)[x;ddy]

Take k=(y), the field of rational functions in one variable, and δ=d/dy. Then k is a field of characteristic 0 and δ0, so by the corollary above R=k[x;δ] is a simple noetherian domain that is not artinian. Its elements are the linear differential operators iai(y)i with rational-function coefficients.

It is instructive to verify simplicity by hand rather than by citing (3.15). The basic relation is

xyyx=δ(y)=1,
(E.1)

So already the two-sided ideal generated by x contains 1 and is everything.

More systematically, for f=inaixi with aik one computes, using xiy=yxi+ixi1 and the commutativity of k,

fyyf=iniaixi1,
(E.2)

Bracketing with y differentiates a polynomial formally with respect to x.

Let I0 be an ideal and take 0fI of degree n with leading coefficient an0. Applying (E.2) n times leaves n!anI, which is nonzero because chark=0 and k is a field. A nonzero element of k is a unit, so I=R.

A concrete run

Take f=y2x3+yI. Then bracketing with y three times gives 3y2x2, then 6y2x, then 6y2; and 6y2 is a unit in (y), so I=R after three brackets.

A base ring where the construction always fails

Let k=M2(). It is simple, so δ-simple for any δ. But every derivation of a matrix algebra over a field is inner: the Hochschild cohomology H1 of a separable algebra vanishes. So for every derivation δ of M2() there is c with δ=adc, and M2()[x;δ]M2()[t]M2([t]) is never simple. Simplicity of k is nowhere near sufficient.

Process and Workflow

Is R=k[x;δ] simple?

δ is innerNo. Put t=xc; then t is central, R=k[t] and tR is a proper nonzero ideal. Applies in every characteristic.
k has a proper nonzero δ-idealNo. The polynomials with coefficients in that ideal form a proper nonzero two-sided ideal of R. Applies in every characteristic.
Neither obstruction, and kYes, by (3.15); and R is automatically not artinian, since RxRx2.
Neither obstruction, but chark=p>0Undecided by (3.15), and often false. Check whether some power of δ vanishes or is inner: if δp=0 then xp is central and R is not simple.
Identify the base dataFix k and δ, and confirm δ really is a derivation on all of k, not just on a subring.
Test for innernessSolve δ(b)=cbbc for a single c. For commutative k this reduces to δ=0; for a central simple algebra it always has a solution.
Test δ-simplicityTake a nonzero ideal 𝔄, pick an element of least degree or least complexity, and differentiate. If differentiation forces 𝔄 to contain a unit, k is δ-simple.
Check the characteristic(3.15) is stated for -algebras. In characteristic p, look for a central element such as xp before concluding anything.
Record what simplicity does not giveR is never artinian and its simplicity says nothing about noetherianness, which must be imported from k separately.

Comparison and Classification

Simplicity of k[x;δ] across base rings
kδδ-simple?Inner?k[x;δ] simple?
0yesyesno — this is [x]
[y]d/dyyesnoyes — this is the Weyl algebra A1()
(y)d/dyyesnoyes
[y]yd/dyno — (y) is stablenono
M2()anyyesyes, alwaysno
𝔽p(y)d/dyyesnono — xp is central
𝔽p[y]d/dyno — (yp) is stablenono
The two Ore extensions side by side
k[x;δ]k[x,x1;σ]
Twisting dataderivationautomorphism
Commutation rulexa=ax+δ(a)xa=σ(a)x
Base conditionk is δ-simplek is σ-simple
Non-degeneracy conditionδ not innerσ of infinite inner order
Characteristic hypothesisk requirednone required
x invertiblenoyes
Reference(3.15)(3.18)

The two Ore extensions side by side

The parallel is close but not perfect, and the asymmetry in the characteristic row is the interesting part: the Laurent criterion (3.18) needs no hypothesis on chark, because its final step divides by nothing.

Relationship Map

Simplicity of R sits between conditions on (k,δ) and conclusions about R as a ring.

k simple, chark=0k is a -algebra and δ-simpleplus δ non-innerk[x;δ] simplek[x;δ] not artinian
Ore extensions k[x;σ,δ]the general construction
Differential polynomial rings k[x;δ]σ=id
k a -algebra(3.15) applies
k δ-simple, δ non-innersimple non-artinian rings
k=k0[y], δ=d/dythe Weyl algebra A1(k0)
  • R=k[x;δ] simple — what follows and what does not
    • always follows
      • R is not left or right artinian
      • radR=0 and R is prime and primitive
      • Z(R) is a field, contained in kδ
    • follows only with extra hypotheses on k
      • R is a domain — needs k a domain
      • R is left and right noetherian — needs k noetherian
      • R is a principal left ideal domain — needs k a division ring
    • never follows
      • RMn(D) for a division ring D
      • R has a minimal left ideal
      • R is finite-dimensional over its centre

Applications and Industry Use

Applications here means where this structure is used — inside mathematics and in the engineering and computing disciplines that consume it.

Symbolic computation

Algebras of differential operators

(y)[x;d/dy] is the working ring of computer algebra for linear ODEs. Factoring operators, computing symbolic solutions and applying the Beke–Schlesinger algorithm all take place inside it; Maple's DEtools and Singular's Plural implement its arithmetic.

D-modules

Holonomic systems

Modules over differential operator algebras encode systems of linear PDEs. Simplicity of the operator ring is why such modules have no nontrivial two-sided obstructions and why localisation behaves; it underlies creative telescoping and automatic identity proving.

Control theory

Linear time-varying systems

A time-varying linear system is a module over a differential operator ring with function coefficients. Controllability and observability become module-theoretic properties, and the ring-theoretic hypotheses of this page are what make the dictionary work.

Source of examples

Simple noetherian domains

(3.16) is the standard machine for producing simple rings that are not artinian. Almost every counterexample in the structure theory of noncommutative noetherian rings starts life as some k[x;δ].

Lie theory

Enveloping algebras

The enveloping algebra of a solvable Lie algebra is an iterated Ore extension, and simplicity criteria of this type identify which primitive quotients are simple — the starting point for Dixmier's classification of primitive ideals.

Quantum mechanics

Canonical commutation relations

The relation xyyx=1 is the Heisenberg relation. Simplicity of the resulting algebra is the algebraic reason it admits no finite-dimensional representation, which forces the use of unbounded operators on Hilbert space.

The honest summary: this is a manufacturing criterion. Its value is that it converts a hard question about a large noncommutative ring into two small checks on the base ring and its derivation.

Design Considerations

Design considerations here means the choices made when modelling a problem with these algebraic structures.

  • Polynomial or Laurent? If the operator you are modelling is invertible — a shift, a rotation — use the skew Laurent ring; if it is a genuine derivative, it is not invertible and k[x;δ] is correct. This choice changes which criterion applies.
  • How large to make the base. Enlarging k from [y] to (y) makes δ-simplicity trivial and turns the result into a principal ideal domain, at the price of losing the graded structure and the finite-rank filtration. Choose [y] when you need the Bernstein filtration, (y) when you need division.
  • Left or right coefficients. Writing aixi with coefficients on the left fixes the sign conventions in every computation that follows. The right-coefficient convention gives ax=xaδ(a) and silently negates δ.
  • Characteristic. If your application lives in characteristic p — coding theory, cryptography — do not import simplicity results from characteristic 0. The correct statement there involves the p-th power operator and Azumaya-type descriptions, not simplicity.

Standards and Notation

Standards here covers notation, symbol and markup standards, and reference implementations, rather than material or design codes.

Preferred notationk[x;δ] (Lam, Goodearl–Warfield)
Common variantsk[x;1,δ], kx;δ, R[;δ] in the D-module literature
General Ore extensionk[x;σ,δ] with xa=σ(a)x+δ(a)
Derivation symbolδ in ring theory; or D in differential algebra
Constantskδ, sometimes Ck or Const(k)
MarkupPresentation MathML per ISO/IEC 40314; symbol conventions per ISO 80000-2
ImplementationsSingular:Plural nc_algebra, Sage OreAlgebra, Macaulay2 Dmodules, Maple Ore_algebra

Computational Notes

Computational notes cover algorithms, cost and library behaviour rather than manufacturing process.

  • Arithmetic in k[x;δ] costs a factor of deg more than commutative polynomial arithmetic: multiplying xm past a coefficient expands into m+1 terms via the binomial formula, so a naive product of two degree-n operators costs O(n3) coefficient operations rather than O(n2).
  • Left and right division algorithms exist whenever k is a division ring, which makes k[x;δ] a left and right euclidean domain. This is the computational backbone of operator factorisation.
  • Non-commutative Gröbner bases (Buchberger's algorithm adapted to G-algebras) terminate for k[x;δ] over a field and are implemented in Singular:Plural and Macaulay2. They compute syzygies and elimination ideals for D-module algorithms.
  • Testing δ-simplicity is not decidable in general. For k a finitely generated commutative algebra over a field it reduces to a computation with differential ideals, which is effective but doubly exponential in the worst case.
  • Testing innerness of δ on a finite-dimensional algebra is linear algebra: solve δ(bj)=cbjbjc for the unknown c across a basis. The cost is one linear system of size O(m2) for dimk=m.

Failure Modes and Common Mistakes

  • Do not expect simplicity to give any chain condition. k[x;δ] is never artinian, and noetherianness must be inherited from k.
  • Do not confuse the δ-ideal condition δ(𝔄)𝔄 with 𝔄 being generated by constants. The ideal (y) of [y] is not δ-stable for d/dy, but (y) is δ-stable for δ=yd/dy.
  • Do not assume Z(R)=kδZ(k) without checking. Central elements of R may involve x — precisely what happens in characteristic p, where xp is central.
  • Do not read (3.16) as requiring k to be commutative. Amitsur's corollary is most useful when k is a noncommutative simple ring admitting an outer derivation.

Quick Reference

Constructionk[x;δ] with xa=ax+δ(a)
Expansionxna=i=0n(ni)δni(a)xi
Criterion (3.15)k: simple δ-simple and δ non-inner
Obstruction Aδ=adc gives t=xc central and R=k[t]
Obstruction Bδ-ideal 𝔄 gives the ideal 𝔄R
Key identitynδ(b)=bddb from bggb=0
Amitsur (3.16)k simple, chark=0, δ outer R simple non-artinian
NeverR artinian; RxRx2
Characteristic pδp=0xp central not simple
Checklist for applying (3.15)
CheckWhat to verifyIf it fails
-algebraevery nonzero integer is a central unit of kthe theorem does not apply; look for central xp
δ-simplicityno ideal 𝔄 with 0𝔄k and δ(𝔄)𝔄𝔄R is a proper nonzero ideal
Non-innernessno ck with δ=adcR=k[xc], never simple
Domaink is a domainR has zero-divisors but may still be simple
Noetheriank is left or right noetherianR need not be noetherian

Frequently Asked Questions

Why does the theorem need k rather than just characteristic 0?

The proof divides by the integer n, the minimal degree in the ideal, so n must be invertible in k and central. Characteristic 0 alone says n10, which is weaker. In practice the gap rarely bites: Amitsur's (3.16) shows that for k simple of characteristic 0 the centre is a field containing , so k is automatically a -algebra.

Is δ-simplicity of k implied by simplicity of k[x;δ]?

Yes, and that direction needs no hypothesis on the characteristic. If 𝔄 is a δ-ideal with 0𝔄k, the polynomials with all coefficients in 𝔄 form a proper nonzero two-sided ideal of R. So the necessity half of (3.15) holds for arbitrary rings k.

What replaces the criterion in characteristic p?

There is no clean simplicity criterion, because simplicity usually fails. The right framework is different: for k a field of characteristic p with a nonzero derivation, k[x;δ] is a free module of rank p over the central subring generated by xp and the constants, and the object of study becomes an Azumaya algebra over that centre rather than a simple ring.

Does simplicity of k[x;δ] tell me anything about its one-sided ideals?

Almost nothing, and this is the usual disappointment. k[x;δ] always has the strictly descending chain RxRx2, so it is never artinian; it has no minimal left ideals; and its left ideal theory is as rich as that of k allows. When k is a division ring, R is a principal left and right ideal domain, which is the best case.

How is this related to the Weyl algebra?

The Weyl algebra A1(k0) is the case k=k0[y], δ=d/dy. The extra work needed there is showing that k0[y] is δ-simple even though it is not simple, which is a short minimal-degree argument in its own right. The page on the Weyl algebra carries it out.

Can δ be non-inner but become inner after enlarging k?

Yes, and this is the usual way non-innerness is destroyed. Passing from [y] to a larger ring in which the operator y acquires an inverse-like partner can make δ inner. Innerness is not preserved by ring extensions in either direction, so it must be checked over the exact base you intend to use.

References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §3, results (3.15)–(3.16) (pp. 44–45).
  2. S. A. Amitsur, “Derivations in simple rings”, Proceedings of the London Mathematical Society (3) 7 (1957), 87–112.
  3. K. R. Goodearl and R. B. Warfield, Jr., An Introduction to Noncommutative Noetherian Rings, 2nd edition, London Mathematical Society Student Texts 61, Cambridge University Press, 2004, Chapters 1–2.
  4. J. C. McConnell and J. C. Robson, Noncommutative Noetherian Rings, revised edition, Graduate Studies in Mathematics 30, American Mathematical Society, 2001, Chapter 1.
  5. N. Jacobson, “Abstract derivation and Lie algebras”, Transactions of the American Mathematical Society 42 (1937), 206–224.
  6. O. Ore, “Theory of non-commutative polynomials”, Annals of Mathematics 34 (1933), 480–508.

AI Suggested Questions

  • Prove the expansion xna=i(ni)δni(a)xi by induction and identify where commutativity is not used.
  • Determine the centre of k[x;δ] when k is a field of characteristic p and δ0.
  • Give a -algebra k that is δ-simple for some δ but has infinitely many ideals.
  • State and prove the analogue of (3.15) for the general Ore extension k[x;σ,δ].
  • Which simple rings of characteristic 0 admit an outer derivation? Compare the commutative and central simple cases.
  • Show that k[x;δ] is a principal left ideal domain when k is a division ring, and identify the euclidean function.
  • How does the failure of (3.15) in characteristic p relate to the Azumaya structure of differential operator rings?
Page
KEVOS-ENG-MATH-NCR-0025
Path
Engineering / Mathematics
Template
kevos-knowledge-article-v2
KEVOS® Knowledge Library — reviewed 2026-08-08

Continue learning

Algebraic and Geometric Multiplicities of Eigenvalues | KEVOS® MathematicsArticle · Project ManagementAmitsur’s Theorem on the Radical of a Polynomial Ring | KEVOS®Article · Project ManagementAmitsur’s Theorem on the Radical of an Algebra of Small Dimension | KEVOS®Article · Project ManagementArchetypes: Reference Catalogue of Worked Systems | KEVOS® MathematicsArticle · Project Management