Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0710.5568

Graded identities of matrix algebras and the universal graded algebra

Eli Aljadeff·Darrell Haile·Michael Natapov
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider fine G-gradings on M_n(C) (i.e. gradings of the matrix algebra over the complex numbers where each component is 1 dimensional). Groups which provide such a grading are known to be solvable. We consider the T-ideal of G-graded identities and show that it is generated by a special type of binomial identities which we call elementary. In particular we show that the ideal of graded identities is finitely generated as a T-ideal. Next, given such grading we construct a universal algebra U_{G,c} in two different ways: one by means of polynomial identities and the other one by means of a generic two-cocycle (this parallels the classical constructions in the non-graded case). We show that a suitable central localization of U_{G,c} is Azumaya over its center and moreover, its homomorphic images are precisely the G-graded forms of M_n(C). Finally, we consider the ring of central quotients Q(U_{G,c}) (this is an F-central simple algebra where F=Frac(Z) and Z is the center of of U_{G,c}). Using an earlier results of the authors (see E. Aljadeff, D. Haile and M. Natapov, Projective bases of division algebras and groups of central type, Israel J. Math.146 (2005) 317-335 and M. Natapov arXiv:0710.5468v1 [math.RA]) we show that this is a division algebra for a very explicit (and short) family of nilpotent groups. As a consequence, for groups G such that Q(U_{G,c}) is not a division algebra, one can find a non identity polynomial p(x_{i,g}) such that p(x_{i,g})^r is a graded identity for some integer r. We illustrate this phenomenon with a fine G-grading of M_6(C) where G is a semidirect product of S_3 and C_6.

Explore related subjects

math.RA

Keep this discovery

BibTeXRIS

Eli Aljadeff, Darrell Haile, Michael Natapov. 2007-10-30. Graded identities of matrix algebras and the universal graded algebra. https://arxiv.org/abs/0710.5568

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA↗
arXiv2026

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA↗
arXiv2026

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA↗