![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
ABSTRACT
A system of polynomial identities is called finitely based if it is equivalent to some finite system of polynomial identities. Every system of polynomial identities in associative algebras over a field of characteristic 0 is finitely based: this is a celebrated result of Kemer. The first non-finitely based systems of polynomial identities in associative algebras over a field of a prime characteristic have been constructed recently by Belov, Grishin and Shchigolev. These systems of identities are relatively complicated. In the present paper we construct a simpler example of such a system and give a simple self-contained proof of the fact that the system is non-finitely based.
ACKNOWLEDGMENT
The first author is supported by NSERC, Canada.