Matrix identities involving multiplication and transposition. (Q2428723)

It is known due to the powerful results of \textit{A. R. Kemer} [Algebra Logic 26, No. 5, 362-397 (1987); translation from Algebra Logika 26, No. 5, 597-641 (1987; Zbl 0646.16013); Ideals of identities of associative algebras. Translations of Mathematical Monographs 87. Providence: AMS (1991; Zbl 0732.16001)] that the identities involving both multiplication and addition of matrices of arbitrary size over a finite field or a field of characteristic 0 have a finite identity basis. In contrast, multiplicative identities for matrices over a finite field admit no finite basis. This fact was proved in the mid-1980s by the third author [\textit{M. V. Volkov}, Math. Notes 45, No. 3, 187-194 (1989); translation from Mat. Zametki 45, No. 3, 12-23 (1989; Zbl 0692.20048)] and \textit{M. V. Sapir} [Math. USSR, Izv. 30, No. 2, 295-314 (1988); translation from Izv. Akad. Nauk SSSR, Ser. Mat. 51, No. 2, 319-340 (1987; Zbl 0646.20047)]. It is worth to note that the methods used in these papers were very different. The main results of the present paper the authors have summarized as follows. None of the following sets of matrix identities admits a finite identity basis: 1) the identities for \(n\times n\)-matrices over a finite field involving multiplication and usual transposition; 2) the identities for \(2n\times 2n\)-matrices over a finite field involving multiplication and symplectic transposition; 3) the identities for \(2\times 2\)-matrices over the field of complex numbers involving either multiplication and Moore-Penrose inversion or multiplication, Moore-Penrose inversion and Hermitian conjugation; 4) the identities for Boolean \(n\times n\)-matrices involving multiplication and transposition. For proving these results the authors adapt the methods of the above-mentioned papers by Volkov and Sapir.