Papers
Topics
Authors
Recent
Search
2000 character limit reached

On infinite dimensional algebras with regular gradings

Published 27 Oct 2025 in math.RA | (2510.23869v1)

Abstract: Let $G$ be a finite abelian group and let $K$ be an algebraically closed field of characteristic 0. We consider associative unital algebras $A$ over $K$ graded by $G$, that is $A=\oplus_{g\in G} A_g$, where the vector subspaces $A_g$ satisfy $A_gA_h\subseteq A_{g+h}$ for every $g$, $h\in G$. Such a $G$-grading is called regular whenever for every $n$-tuple $(g_1,\ldots,g_n)\in Gn$ there exist homogeneous elements $a_i\in A_{g_i}$ such that $a_1\cdots a_n\ne 0$ in $A$; furthermore, for every $g$, $h\in G$ and every $a_g\in A_g$, $a_h\in A_h$ one has $a_ga_h=\beta(g,h)a_ha_g$ for some $\beta(g,h)\in K*$. Here $\beta(g,h)$ depends only on the choice of $g$ and $h$ but not on the elements $a_g$ and $a_h$. It is immediate that $\beta$ is a bicharacter on $G$. The regular decomposition above is minimal if for every $g\in G$ with $\beta(g,h)=\beta(g,k)$ one has $h=k$. In this paper we prove that if $G=\mathbb{Z}_2$ then every $G$-graded regular algebra whose regular decomposition is minimal, contains a copy of the infinite dimensional Grassmann algebra. By applying this result we are able to describe the generating algebras of the variety of $\mathbb{Z}_2$-graded algebras defined by the Grassmann algebra. Furthermore we describe the finitely generated subalgebras of a $\mathbb{Z}_2$-graded regular algebra having a minimal regular decomposition.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.