A linear algebra characterization of the semisimplicity and the simplicity of arbitrary algebras
Antonio J. Calderon Martin

TL;DR
This paper provides a linear algebra-based characterization of when an arbitrary algebra is semisimple or simple, using properties like zero annihilator and specific types of division linear bases.
Contribution
It introduces new criteria based on linear algebra for determining semisimplicity and simplicity of any algebra, regardless of dimension or base field.
Findings
An algebra is semisimple iff it has zero annihilator and a semi-division linear basis.
An algebra is simple iff it has zero annihilator and an i-division linear basis.
Provides a characterization applicable to algebras of any dimension and base field.
Abstract
We show that an arbitrary algebra , (of arbitrary dimension, over an arbitrary base field and any identity is not suppose for the product), is semisimple if and only if it has zero annihilator and admits a semi-division linear basis. We also show that is simple if and only if it has zero annihilator and admits an -division linear basis.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Advanced Algebra and Logic · Rings, Modules, and Algebras
