In ring theory, a branch of mathematics, a ringR is a polynomial identity ring if there is, for some N > 0, an element P ≠ 0 of the free algebra, Z⟨X1, X2, ..., XN⟩, over the ring of integers in N variables X1, X2, ..., XN such that
Strictly the Xi here are "non-commuting indeterminates", and so "polynomial identity" is a slight abuse of language, since "polynomial" here stands for what is usually called a "non-commutative polynomial". The abbreviation PI-ring is common. More generally, the free algebra over any ring S may be used, and gives the concept of PI-algebra.
If the degree of the polynomial P is defined in the usual way, the polynomial P is called monic if at least one of its terms of highest degree has coefficient equal to 1.
Every commutative ring is a PI-ring, satisfying the polynomial identity XY − YX = 0. Therefore, PI-rings are usually taken as close generalizations of commutative rings. If the ring has characteristicp different from zero then it satisfies the polynomial identity pX = 0. To exclude such examples, sometimes it is defined that PI-rings must satisfy a monic polynomial identity.[1]
Examples
For example, if R is a commutative ring it is a PI-ring: this is true with
The ring of 2 × 2 matrices over a commutative ring satisfies the Hall identity
This identity was used by M. Hall (1943), but was found earlier by Wagner (1937).
A major role is played in the theory by the standard identitysN, of length N, which generalises the example given for commutative rings (N = 2). It derives from the Leibniz formula for determinants
by replacing each product in the summand by the product of the Xi in the order given by the permutation σ. In other words each of the N ! orders is summed, and the coefficient is 1 or −1 according to the signature.
The m × mmatrix ring over any commutative ring satisfies a standard identity: the Amitsur–Levitzki theorem states that it satisfies s2m. The degree of this identity is optimal since the matrix ring can not satisfy any monic polynomial of degree less than 2m.
This ring does not satisfy sN for any N and therefore can not be embedded in any matrix ring. In fact sN(e1,e2,...,eN) = N ! e1e2...eN ≠ 0. On the other hand it is a PI-ring since it satisfies [[x, y], z] := xyz − yxz − zxy + zyx = 0. It is enough to check this for monomials in the ei's. Now, a monomial of even degree commutes with every element. Therefore if either x or y is a monomial of even degree [x, y] := xy − yx = 0. If both are of odd degree then [x, y] = xy − yx = 2xy has even degree and therefore commutes with z, i.e. [[x, y], z] = 0.
A direct product of PI-rings, satisfying the same identity, is a PI-ring.
It can always be assumed that the identity that the PI-ring satisfies is multilinear.
If a ring is finitely generated by n elements as a module over its center then it satisfies every alternating multilinear polynomial of degree larger than n. In particular it satisfies sN for N > n and therefore it is a PI-ring.
If R and S are PI-rings then their tensor product over the integers, , is also a PI-ring.
If R is a PI-ring, then so is the ring of n × n matrices with coefficients in R.
If R is a PI-ring and K is a subring of its center such that R is integral overK then the going up and going down properties for prime ideals of R and K are satisfied. Also the lying over property (If p is a prime ideal of K then there is a prime ideal P of R such that is minimal over ) and the incomparability property (If P and Q are prime ideals of R and then ) are satisfied.
The set of identities a PI-ring satisfies
If F := Z⟨X1, X2, ..., XN⟩ is the free algebra in N variables and R is a PI-ring satisfying the polynomial P in N variables, then P is in the kernel of any homomorphism
Given a PI-ring, R, the set of all polynomial identities it satisfies is an ideal but even more it is a T-ideal. Conversely, if I is a T-ideal of F then F/I is a PI-ring satisfying all identities in I. It is assumed that I contains monic polynomials when PI-rings are required to satisfy monic polynomial identities.
Kanel-Belov, Alexei; Rowen, Louis Halle (2005). Computational aspects of polynomial identities. Research Notes in Mathematics. Vol. 9. Wellesley, MA: A K Peters. ISBN1-56881-163-2. Zbl1076.16018.