SearcharxivSearch

arXiv · 2410.13183

Graded Imbeddings in Finite Dimensional Simple Graded Algebras

Abstract

Let $\mathbb{F}$ be a field and $\mathsf{G}$ a group. This work is inspired in the following problem: "{\it given a division (simple) $\mathsf{G}$-graded $\mathbb{F}$-algebra, is there any other division (simple) $\mathsf{G}$-graded $\mathbb{F}$-algebra such that the former can be $\mathsf{G}$-imbedded in the latter?}". In this work, we answer this question affirmatively for $\mathbb{F}$ algebraically closed, $\mathsf{G}$ finite abelian, and associative algebras of finite dimension. To prove this, we apply concepts and properties of Group Cohomology. We show $\mathcal{H}^2(H, \mathbb{F}^*)=\mathsf{res}^\mathsf{G}_H \left(\mathcal{H}^2(\mathsf{G}, \mathbb{F}^*)\right)$, where $H$ is a subgroup of $\mathsf{G}$ and $\mathsf{res}^\mathsf{G}_H$ is the restriction homomorphism. Posteriorly, we prove that, given any $H_1,H_2\leq\mathsf{G}$ and $\sigma_i\in\mathcal{Z}^2(H_i,\mathbb{F}^*)$, $i=1,2$, are equivalent: i) $\mathbb{F}^{\sigma_1}[H_1] \stackrel{\mathsf{G}}{\hookrightarrow} \mathbb{F}^{\sigma_2}[H_2]$; ii) $H_1\leq H_2$ and $[\sigma_1]=[\sigma_2]_{H_1}$; iii) $\mathsf{T}^{\mathsf{G}}(\mathbb{F}^{\sigma_2}[H_2])\subseteq \mathsf{T}^{\mathsf{G}}(\mathbb{F}^{\sigma_1}[H_1])$, where $\mathsf{T}^{\mathsf{G}}(\mathbb{F}^{\sigma_i}[H_i])$ is the $\mathsf{G}$T-ideal of graded identities of $\mathbb{F}^{\sigma_i}[H_i]$. Furthermore, we prove that, given $\mathfrak{A}$ and $\mathfrak{B}$ two finite dimensional simple $\mathsf{G}$-graded $\mathbb{F}$-algebras, if $\mathbb{F}$ is algebraically closed, $\mathsf{char}(\mathbb{F}) = 0$ or $\mathsf{char} (\mathbb{F})$ is coprime with the order of each finite subgroup of $\mathsf{G}$, and any subgroup of $\mathsf{G}$ is normal, then $\mathsf{T}^{\mathsf{G}}(\mathfrak{A})\subseteq \mathsf{T}^{\mathsf{G}}(\mathfrak{B})$ iff $\mathfrak{B} \stackrel{\mathsf{G}}{\hookrightarrow} \mathfrak{A}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Antonio de França. 2024-10-17. Graded Imbeddings in Finite Dimensional Simple Graded Algebras. https://arxiv.org/abs/2410.13183

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

KEEP EXPLORING

Related papers

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

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

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