Deciding degree-four-identities for alternative rings by rewriting (Q4225072)

The author attempts to list ``rewriting'' rules which enable a computer to prove identities. The basic question is to decide whether or not two polynomials \(u\) and \(v\) in a nonassociative algebra are equal. One applies the routine to \(u-v\) and sees if the computer returns zero. The paper lists the rewrite identities which work for low dimensions in alternative, left alternative, and strictly left alternative rings. The author provides examples where the reductions fail for higher degree polynomials. He compares his techniques with other computer identity systems. An advantage of the rewrite rules procedure is that it does not automatically exclude certain characteristics. It has the disadvantage that the number of rules tends to grow so rapidly that at even the degree six level, the memory of the machine is surpassed. For the entire collection see [Zbl 0897.00036].