🔢 mathematics

On the minimal dimension of maximal commutative subalgebras of $M_6(k)$

This paper proves that every maximal commutative subalgebra of the $6 \times 6$ matrix algebra $M_6(k)$ over an algebraically closed field must have a dimension of at least 6.

Original authors: Małgorzata Nowak-Kępczyk

Published 2026-04-28

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Małgorzata Nowak-Kępczyk

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

The Mystery of the "Perfectly Balanced" Matrix Club

Imagine you are organizing a very exclusive club. The rules of this club are strict: no two members can be "too similar" in how they influence each other. In mathematics, we call this a Maximal Commutative Subalgebra.

Think of the members as "operators" (matrices) that act on a space. "Commutative" means that if Member A acts on a person, and then Member B acts, it’s the exact same result as if Member B acted first and then Member A. They are perfectly in sync. "Maximal" means the club is full—you can't add a single new person without breaking that perfect harmony.

The Big Question: How small can the club be?

For a long time, mathematicians have been playing a game of "How small can we make this club?"

If you have a space of size $n$ (let's say $n=6$ ), you would naturally assume that to keep the club "maximal" and "in sync," you need at least 6 members. It feels like a rule of nature: to control a 6-dimensional world, you need 6 distinct, harmonious tools.

However, in 1961, a mathematician named Courter discovered a loophole. He showed that once the world gets big enough (specifically $n=14$ ), you can actually have a "maximal" club that is surprisingly tiny—only 13 members! It’s like finding a tiny group of people who, through some strange magic, perfectly control a massive skyscraper.

The mystery was: At what point does this "magic" start happening? Does it happen at $n=7$ ? $n=10$ ? Or is the "6-member rule" still safe?

The Paper’s Mission: The Case of the Number 6

The author, Małgorzata Nowak-Kępczyk, decided to zoom in on the number 6. She wanted to prove that in a 6-dimensional world, the "6-member rule" still holds. She wanted to show that you cannot have a maximal club with only 5 members.

How she did it: The "Imposter" Test

To prove this, she used a strategy that sounds like a detective investigation.

If you claim to have a "Maximal Club" of only 5 members in a 6-dimensional world, she tries to prove you are lying. She does this by looking for "Imposters." An imposter is a 6th member who could join the club without breaking the harmony. If she can find even one imposter, then your club wasn't "Maximal" (because a maximal club must be full).

She went through every possible way a 5-member club could be structured. She categorized them like different types of social circles:

The "Monogenic" Circle: A group where everyone follows one single leader.
The "Local" Circles: Groups with complex, layered hierarchies (which she called "Hilbert-Samuel types").

For every single type of 5-member group she could imagine, she used heavy-duty math to show: "Wait! I just found a way to add a 6th person to this group without breaking the rules!"

The Result: The Rule Holds

By systematically checking every possible 5-member structure, she proved that none of them are actually maximal. They all have "room for more."

Therefore, in a 6-dimensional world, if your club is truly maximal and perfectly in sync, it must have at least 6 members.

The Takeaway

This paper is a "boundary marker." It tells us that the "weird math magic" where small clubs can control big worlds doesn't start at 6. It’s not even at 7. By proving that the "6-member rule" is safe, she has narrowed down the search area for where the real mystery begins. She has cleared the path for the next generation of mathematicians to hunt for the true threshold of mathematical chaos.

Technical Summary: On the minimal dimension of maximal commutative subalgebras of $M_6(k)$

Author: Małgorzata Nowak-Kępczyk
Subject Area: Linear Algebra, Matrix Theory, Ring Theory (MSC 15A30, 15A27, etc.)

1. The Problem

The paper addresses a fundamental question in the theory of matrix algebras: What is the minimum possible dimension of a maximal commutative subalgebra $A$ of the algebra of $n \times n$ matrices $M_n(k)$ over an algebraically closed field $k$ ?

A commutative subalgebra is "maximal" if it is its own centralizer in $M_n(k)$ . While it is known that for $n \geq 14$ , there exist maximal commutative subalgebras with $\dim A < n$ (a result by Courter), the behavior for smaller $n$ is more rigid. Specifically, the paper investigates whether the inequality $\dim A \geq n$ holds for the case $n = 6$ .

2. Methodology

The author employs a structural classification approach centered on local commutative algebras. Since any commutative subalgebra can be decomposed into a direct sum of local algebras, the problem of finding a minimal dimension can be reduced to analyzing the faithful representations of local algebras.

The methodology follows these steps:

Classification: The author utilizes the known classification of local commutative algebras of dimension 5. There are exactly nine isomorphism classes, categorized by their Hilbert–Samuel type (which describes the dimensions of the successive quotients of the radical $J$ ).
Module Analysis: For each algebra $A = k \cdot 1 \oplus J$ , the author considers a faithful $A$ -module $V = k^6$ .
Centralizer Estimation: The core technique is to prove that for any such algebra of dimension 5, the dimension of its centralizer (the algebra of $A$ -endomorphisms, $\text{End}_A(V)$ ) is strictly greater than the dimension of $A$ itself.
Endomorphism Construction: The author uses a specific lemma: if a subspace $L \subseteq V$ is annihilated by the radical ($JL = 0$), then any linear map from the quotient $V/JV$ to $L$ induces an $A$ -endomorphism. This allows for the systematic construction of large subspaces within $\text{End}_A(V)$ .

3. Key Contributions and Results

The primary result is Theorem 1: Every maximal commutative subalgebra $A \subset M_6(k)$ satisfies $\dim A \geq 6$ .

To prove this, the author systematically eliminates the possibility of a dimension 5 maximal commutative subalgebra by analyzing the nine classes of 5-dimensional local algebras:

Type (1, 4) [ $J^2=0$ ]: Proved via the embedding $\text{Hom}_k(V/JV, JV) \hookrightarrow \text{End}_A(V)$ , showing $\dim \text{End}_A(V) \geq 6$ .
Type (1, 3, 1): Uses a normal form for the action of the radical to show $\dim \text{End}_A(V) \geq 6$ (or $\geq 8$ in specific filtration cases).
Type (1, 2, 1, 1): Uses the existence of a non-zero third power of the radical ( $J^3 \neq 0$ ) to construct endomorphisms, yielding $\dim \text{End}_A(V) \geq 6$ .
Type (1, 2, 2) and (1, 3, 1): Detailed block-matrix computations and socle analysis are used to show the centralizer dimension exceeds 5.
Class 16 (Specific case): A highly detailed computational appendix proves that for a specific complex structure, the endomorphism dimension is at least 9.

4. Significance

Closing the Gap: The paper confirms that the "Courter phenomenon" (where $\dim A < n$ ) does not occur at $n=6$ . This provides empirical evidence that the threshold for this phenomenon is higher than previously explored.
Methodological Boundary: The author highlights that $n=6$ is a "rigid test case." While the case-by-case classification works for $n=6$ (because there are only finitely many 5-dimensional local algebras), the method cannot be directly extended to $n \geq 7$ because the number of isomorphism classes of local algebras becomes infinite.
Theoretical Insight: The work demonstrates that the minimal dimension of maximal commutative subalgebras is sensitive to the specific nilpotent structure of the radical, necessitating a move from general bounds (like Laffey's) to structural classification in low dimensions.