🔢 mathematics

On the multiplicities of the central cocharacter of algebras with polynomial identities

This paper investigates the cocharacter, central cocharacter, and proper central cocharacter sequences of various PI-algebras over a field of characteristic zero, culminating in a complete classification of all algebras whose sequences of colengths and central colengths are bounded by a constant.

Original authors: Wesley Quaresma Cota, Thais Silva do Nascimento

Published 2026-01-15

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Wesley Quaresma Cota, Thais Silva do Nascimento

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you have a giant, infinite library of mathematical sentences (polynomials). Some of these sentences are "true" for a specific algebra (a type of math structure), meaning they always equal zero no matter how you plug in numbers. Others are "true" but only if the result lands in a very special, quiet corner of the algebra called the "center."

This paper is like a massive census conducted by mathematicians Wesley Quaresma Cota and Thais Silva do Nascimento. They are trying to organize and classify these algebras based on how "complicated" their true sentences are.

Here is the breakdown of their work using simple analogies:

1. The Library and the "Fingerprint"

Think of an algebra as a unique building. To understand the building, you don't just look at the bricks; you look at the rules that govern how the bricks fit together.

Polynomial Identities: These are the rules that make the building collapse if you try to break them (they equal zero).
Central Polynomials: These are special rules that, when followed, don't break the building but instead produce a "peaceful" result that sits in the center of the structure.

The authors are interested in counting how many unique ways these rules can be written as the sentences get longer and longer. They call this count the colength.

The Analogy: Imagine you are counting how many different Lego structures you can build using exactly $n$ bricks. If the number of structures stays small and manageable as you add more bricks, the building is "simple." If the number explodes, the building is "chaotic."

2. The Goal: Sorting the "Simple" Buildings

The paper focuses on algebras where this count (the colength) stays small and bounded.

Previous Work: Earlier researchers had already sorted out the buildings where the count stayed below 4.
This Paper's Mission: The authors wanted to go further. They asked: "What do all the buildings look like if their complexity count stays below 7?"

3. The Method: The "Zoo" of Algebras

To solve this, the authors created a "zoo" of specific, well-known mathematical structures (like upper triangular matrices or Grassmann algebras). They calculated the exact complexity count for each of these "animals."

They found that some animals are very simple (count = 2), some are medium (count = 5), and some are complex (count = 7 or higher).
They discovered that if you mix two simple animals together, the complexity usually adds up.

4. The Big Discovery: The Classification

The main result is a complete list. The authors proved that any algebra with a complexity count of 6 or less must be built from a specific, short list of "building blocks."

If you find an algebra that is "simple enough" (count $\le$ 6), it is mathematically equivalent to one of these combinations:

A simple, boring block (like a nilpotent algebra).
A block with a "center" (like a commutative algebra).
Specific combinations of the "animals" they studied earlier (like $A_1$ , $A_4$ , or $G_4$ ).

They also did a similar, but slightly different, sort for the "central" rules (the peaceful results). They found that if the "central complexity" is very low (2 or less), the algebra must be built from an even shorter, more restricted list of blocks.

5. Why It Matters (In Their Words)

The paper doesn't claim to fix bridges or cure diseases. Instead, it solves a puzzle in pure mathematics.

The Puzzle: "How many different types of 'simple' algebras exist?"
The Answer: "There is a finite, known list. If you find a new one that is simple, it's just a remix of the ones we already know."

Summary

Think of the authors as taxonomists (biologists who classify animals). They didn't just count the animals; they figured out that every animal in the "Simple Complexity" category is actually a hybrid of a few specific, known species. They mapped out the entire family tree for algebras that aren't too chaotic, providing a complete "ID card" for every member of this group.

Technical Summary: On the Multiplicities of the Central Cocharacter of Algebras with Polynomial Identities

Problem Statement
The paper addresses the classification of associative algebras over a field of characteristic zero based on their sequences of colengths and central colengths. While the theory of polynomial identities (PI-theory) has extensively studied codimension sequences ( $c_n(A)$ ), which measure the dimension of multilinear polynomials modulo identities, this work focuses on the finer structural invariants: the colength ( $l_n(A)$ ), central colength ( $l^z_n(A)$ ), and proper central colength ( $l^\delta_n(A)$ ).

These sequences count the number of irreducible components (multiplicities) in the decomposition of the spaces of multilinear polynomials, central polynomials, and proper central polynomials, respectively, under the action of the symmetric group $S_n$ . The central problem is to classify varieties of algebras where these sequences are bounded by a constant. Previous work had classified varieties with colength bounded by 4; this paper extends the classification to varieties with colength bounded by 7 and central colength bounded by 2.

Methodology
The authors employ a combination of representation theory, the structure theory of finite-dimensional algebras, and the theory of T-ideals and T-spaces.

Representation Theory of $S_n$ and $GL_m$ : The paper utilizes the decomposition of the spaces $P_n(A)$ , $P^z_n(A)$ , and $\Delta_n(A)$ into irreducible $S_n$ -modules indexed by partitions $\lambda \vdash n$ . The multiplicities $m_\lambda$ , $m^z_\lambda$ , and $m^\delta_\lambda$ are computed using the correspondence between $S_n$ -characters and characters of the general linear group $GL_m$ (Proposition 3.1).
Highest Weight Vectors: To determine non-zero multiplicities, the authors construct specific highest weight vectors $f_{T_\lambda}$ associated with Young tableaux and test whether they belong to the T-ideal or T-space of the algebra (Proposition 3.2).
Structure of Finite-Dimensional Algebras: The classification relies heavily on the decomposition of algebras of the form $A = F + J(A)$ , where $J(A)$ is the Jacobson radical. The radical is decomposed into subspaces $J_{10}, J_{01}, J_{00}, J_{11}$ based on their interaction with the identity element.
Variety Containment and Exclusion: The core of the methodology involves proving that if a variety $\text{var}(A)$ does not contain specific "critical" algebras (such as $G_4, A_7, A_9$ , etc.), then $A$ must be PI-equivalent to a direct sum of simpler algebras. This is achieved by analyzing the vanishing of specific products of radical components (e.g., $J_{10}J_{00} = \{0\}$ ) which forces the algebra to satisfy certain identities.

Key Contributions and Results

Explicit Computation of Invariants: The paper provides explicit descriptions of the cocharacter, central cocharacter, and proper central cocharacter sequences, along with their corresponding colengths, for a wide range of specific algebras. These include:
- Subalgebras of upper triangular matrices ( $UT_m$ ) such as $A_1, A_2, A_4, \dots, A_{10}$ and their duals.
- Grassmann algebras and their subalgebras ( $G, G_{2k}, G_4$ ).
- Direct sums of these algebras (e.g., $G_4 \oplus A_1$ , $A_4 \oplus A_2$ ).
- The paper establishes the exact values of $l_n(A)$ , $l^z_n(A)$ , and $l^\delta_n(A)$ for these algebras for sufficiently large $n$ .
Classification of Bounded Colength Varieties (Theorem 4.11):
The authors establish a complete classification, up to PI-equivalence, of all algebras whose colength sequence $l_n(A)$ is bounded by 6. The result states that if an algebra $A$ does not contain any algebra from a specific set $I$ (which includes $A_7, A_8, A_9, A_{10}, G_6$ , and various direct sums), then $A$ is PI-equivalent to a direct sum of a nilpotent algebra and one of a finite list of specific algebras (e.g., $N, C \oplus N, A_1 \oplus N, G_4 \oplus N$ , etc.).
- Corollary 4.13: Extends this to characterize algebras with colength exactly 7.
Classification of Bounded Central Colength Varieties (Theorem 5.6):
The paper classifies varieties where the central colength sequence $l^z_n(A)$ is bounded by 2. It proves that if an algebra $A$ avoids a specific set $R$ (containing $A_1 \oplus A^*_1, A_4, G_4 \oplus A_1$ , etc.), then $A$ is PI-equivalent to a direct sum of a nilpotent algebra and one of a restricted set of algebras (e.g., $N, C \oplus N, A_1 \oplus N, G_4 \oplus N$ ).
Relationship between Growth and Colength:
The work reinforces the connection between polynomial growth of codimensions and the boundedness of colength sequences, extending this relationship to central and proper central contexts.

Significance and Claims
The paper claims to extend the existing literature on the classification of PI-varieties. While previous results (specifically in [7, 18]) had classified varieties with colength bounded by 4, this work pushes the boundary to 7. The authors emphasize that moving beyond the subvarieties of $var(UT_2)$ (which covers colengths up to 4) reveals a significantly higher level of complexity, requiring the study of algebras outside this variety to understand higher colengths.

Furthermore, the paper provides the first explicit classification of varieties based on central colength sequences bounded by a constant (specifically 2). The authors note that while a classification based on proper central colengths ( $l^\delta_n$ ) seems difficult due to the existence of algebras with zero proper central colength (like block triangular matrices with $k>1$ ), the central colength sequence offers a viable and rich avenue for classification.

The results are presented as a complete characterization of the structural form of algebras satisfying these boundedness conditions, providing a definitive list of PI-equivalence classes for these specific growth constraints.