🔢 mathematics

The comaximal graph of a finite-dimensional Lie algebra

This paper introduces the comaximal graph $\Gamma(L)$ of a finite-dimensional Lie algebra, establishing its general structural properties, classifying the graph for all Lie algebras of dimension at most three over finite fields, and determining key invariants for $\mathfrak{sl}_2(\mathbb{F}_q)$ to demonstrate its connectivity and non-planarity.

Original authors: David A. Towers, Yesneri Zuleta, Ismael Gutierrez

Published 2026-05-12

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: David A. Towers, Yesneri Zuleta, Ismael Gutierrez

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 collection of building blocks. In the world of mathematics, these blocks are called Lie algebras. They are special types of structures used to describe symmetry and motion, but for this paper, think of them simply as a box of rules for how smaller pieces (sub-algebras) can fit together.

The authors of this paper, David A. Towers, Yesneri Zuleta, and Ismael Gutierrez, decided to turn these mathematical structures into a social network. They created a game called the Comaximal Graph.

Here is how the game works, explained in everyday terms:

1. The Players (The Vertices)

Imagine every possible "team" you can form inside your box of rules, as long as the team isn't empty and isn't the whole box itself.

The Players: Every single one of these teams is a "vertex" (a dot) on our graph.
The Rule: A team can be any size, from a single person to almost the whole group.

2. The Handshake (The Edges)

Now, we draw a line (an edge) between two teams if they can shake hands to form the whole group.

The Condition: If Team A and Team B join forces, do they create the entire original box of rules?
The Connection: If Yes, they are connected (adjacent). If No (meaning they are stuck in a smaller corner of the box), they are not connected.

The paper asks: What does this social network look like? Is everyone friends with everyone? Are there lonely people? How far apart are two people who don't know each other?

3. The Main Findings: A Tour of the Neighborhoods

The authors looked at boxes of different sizes (dimensions) and found that the "social network" changes dramatically depending on the internal rules of the box.

The Empty Room (1-Dimensional)

If your box only has one rule, there are no teams to form (other than the whole thing or nothing).

Result: The graph is empty. No dots, no lines. It's a ghost town.

The Small Party (2-Dimensional)

If your box has two rules, every possible team is just a single person.

Result: Everyone shakes hands with everyone else. It's a Complete Graph (a perfect circle where everyone is friends with everyone). No one is left out.

The Complex Party (3-Dimensional)

This is where things get spicy. The authors broke down 3D boxes into different "neighborhoods" based on how the rules interact:

The Abelian Neighborhood (The "No-Conflict" Zone):
Here, the rules don't fight each other.
- The Vibe: Small teams (lines) never shake hands with other small teams because they can't make the whole group together. But big teams (planes) are very friendly with everyone.
- The Graph: It looks like a starburst. The big teams are the center, connected to everything. The small teams are isolated from each other but connected to the big teams.
The Heisenberg Neighborhood (The "Secretive" Zone):
This is a specific type of box where one rule is the "boss" (the center).
- The Vibe: The boss rule is so powerful that it isolates itself. It doesn't shake hands with anyone.
- The Graph: There is one lonely dot (the boss) in the middle of the room. Everyone else forms a complex web where small teams are friends unless they belong to the same specific "clique" (plane).
The Solvable Neighborhoods (The "Structured" Zones):
Here, the rules are a mix of order and chaos.
- The Vibe: Depending on how the rules twist, some teams become "isolated" (lonely) because they are trapped inside a specific sub-group, while others form tight cliques.
- The Graph: Sometimes you get a "complete multipartite" graph, which is like a party where you can only talk to people from other tables, never your own.

The Star of the Show: $sl_2(F_q)$ (The "Perfect" Box)

The authors spent the most time on a specific, famous 3D box called $sl_2$ . This is a "perfect" box where the rules are so strong they generate the whole group on their own.

The Structure: The graph here is incredibly rich.
- The "Nonsplit" Stars: There is a special group of teams (nonsplit semisimple lines) that are so powerful they are friends with everyone. They are the "popular kids" who know everyone in school.
- The "Borel" Clubs: There are specific clubs (Borel subalgebras) that are all friends with each other, forming a tight-knit circle.
- The "Split" and "Nilpotent" Teams: These are friends with many, but not everyone. They have to check if they are in the same club before shaking hands.

4. The "Cool Facts" About the Graph

For this specific "Perfect Box" ( $sl_2$ ), the authors calculated some impressive stats:

Connected: You can get from any team to any other team by walking through friends. No one is truly stranded.
Diameter 2: If you want to send a message from one team to another, it will take at most two steps (Team A $\to$ Popular Star $\to$ Team B).
Non-Planar: If you tried to draw this graph on a piece of paper without any lines crossing, you couldn't do it. It's too tangled (mathematically, it contains a "K5" shape).
The Center: The "center" of this social network (the most connected, influential people) are the nonsplit semisimple lines. They are the hubs that connect the entire graph.

Summary

The paper takes a complex algebraic concept (Lie algebras) and maps it onto a social network. It shows that:

Structure dictates friendship: The internal rules of the algebra determine who is friends with whom.
Isolation is possible: Some teams are so trapped in their own sub-groups that they can never help form the whole group (isolated vertices).
Complexity grows with size: As the algebra gets more complex (like the $sl_2$ case), the graph becomes a highly connected, intricate web with a clear hierarchy of "popular" and "isolated" members.

The authors didn't just draw pretty pictures; they proved exactly how many friends each team has, how far apart the loneliest teams are, and how many colors you'd need to color the graph so no friends share the same color. It's a deep dive into the geometry of mathematical friendship.

Technical Summary: The Comaximal Graph of a Finite-Dimensional Lie Algebra

Problem Statement
This paper introduces and investigates the comaximal graph $\Gamma(L)$ associated with a finite-dimensional Lie algebra $L$ over a field $F$ . While previous research has successfully encoded algebraic information into combinatorial forms via commuting graphs, non-commuting graphs, and subspace sum graphs (notably by A. Das for vector spaces), this work addresses a gap in the systematic study of graphs derived specifically from the subalgebra structure of Lie algebras. The central problem is to define a graph where vertices represent nontrivial proper Lie subalgebras and adjacency is determined by the condition that the subalgebras generate the entire algebra $L$ (i.e., $\langle A, B \rangle = L$ ). The authors aim to establish general structural properties of $\Gamma(L)$ and provide a complete classification for Lie algebras of dimension at most three over finite fields $\mathbb{F}_q$ .

Methodology
The study employs a combination of Lie algebra theory and algebraic graph theory.

Definitions and General Properties: The authors define $\Gamma(L)$ formally and utilize standard graph invariants (degree sequence, clique number, chromatic number, domination number, diameter, radius, planarity). They relate graph-theoretic properties to Lie-theoretic concepts, specifically the Frattini subalgebra $F(L)$ , derived algebras $L'$ , and the action of the adjoint operator $\text{ad}_x$ .
Structural Characterization: The paper establishes criteria for isolated vertices (linked to containment in $F(L)$ ) and completeness (linked to $\mu$ -algebras, where all proper subalgebras are one-dimensional).
Classification by Dimension: The core of the methodology involves a case-by-case analysis of Lie algebras over finite fields $\mathbb{F}_q$ $F_{q}$ :
- Dimensions 1 and 2: Trivial or complete graph cases.
- Dimension 3: The analysis is split based on the dimension of the derived algebra $L'$ and the nature of the adjoint action. The authors decompose the algebra as $L = \langle x \rangle \ltimes V$ and analyze the Jordan type of the operator $T = \text{ad}_x|_V$ .
- Specific Cases: The study covers abelian algebras, the Heisenberg algebra (nilpotent), solvable non-nilpotent algebras (distinguished by the number of eigenlines of $T$ ), and perfect algebras (specifically $sl_2(\mathbb{F}_q)$ and $su_2(\mathbb{F}_q)$ ).
Explicit Computation: For the simple Lie algebra $sl_2(\mathbb{F}_q)$ , the authors explicitly compute the degree sequence, clique number, chromatic number, domination number, diameter, and radius, and determine the graph's planarity.

Key Contributions and Results

General Structural Properties:
- Isolated Vertices: A vertex in $\Gamma(L)$ is isolated if and only if it is contained in the Frattini subalgebra $F(L)$ . Consequently, if $F(L) = 0$ , the graph has no isolated vertices.
- Completeness: $\Gamma(L)$ is a complete graph if and only if every proper subalgebra of $L$ is one-dimensional (i.e., $L$ is a $\mu$ -algebra). The paper characterizes such algebras over perfect fields of characteristic 0 or $p > 3$ as either having dimension $\leq 2$ or being three-dimensional simple algebras where $\sqrt{F} \not\subseteq F$ .
- Connectivity: The induced subgraph $\Gamma(L) \setminus F(L)$ is connected with a diameter of at most 3.
Classification for $\dim(L) \leq 3$ :
- Abelian Case ( $\dim L' = 0$ ): The graph consists of a complete subgraph on the set of planes and an independent set on the set of lines, with specific adjacency rules between lines and planes.
- Heisenberg Algebra ( $\dim L' = 1$ , nilpotent): The center $Z$ is an isolated vertex. The remaining lines form a complete multipartite graph, and the planes form a complete graph.
- Solvable Non-Nilpotent ( $\dim L' = 1$ ): The structure depends on the derived algebra not being central. The graph exhibits no isolated vertices arising from centrality, and the number of planes differs from the abelian and Heisenberg cases.
- Solvable Non-Nilpotent ( $\dim L' = 2$ ): The structure is governed by the Jordan type of $\text{ad}_x$ . The paper distinguishes four subcases based on the characteristic equation of the adjoint operator, detailing the number of planes and the resulting degree sequences.
- Perfect Case ( $\dim L' = 3$ ): The paper identifies $L \cong sl_2(\mathbb{F}_q)$ (split) or $L \cong su_2(\mathbb{F}_q)$ (non-split). For $su_2(\mathbb{F}_q)$ , the graph is complete. For $sl_2(\mathbb{F}_q)$ , the graph is non-regular and exhibits a rich structure based on the classification of lines into nilpotent, split semisimple, and nonsplit semisimple types.
Detailed Analysis of $sl_2(\mathbb{F}_q)$ :
- Invariants: The authors determine that $\Gamma(sl_2(\mathbb{F}_q))$ is connected, has girth 3, and diameter 2. The domination number is 1, and the radius is 1, with the center consisting of all nonsplit semisimple lines.
- Clique and Chromatic Number: The clique number is $\omega(\Gamma) = \frac{q^2+q+2}{2}$ , formed by the union of all nonsplit semisimple lines and all Borel subalgebras. The chromatic number equals the clique number.
- Planarity: The graph is proven to be non-planar for $q \geq 3$ due to the existence of a large clique containing a $K_5$ subdivision.
- Degree Sequence: The graph is not regular for $q \geq 3$ . The degrees vary based on the type of line: nonsplit semisimple lines have the highest degree, followed by Borel subalgebras and nilpotent lines, with split semisimple lines having the lowest degree among non-isolated vertices.

Significance
The paper claims to initiate a systematic study of the comaximal graph for finite-dimensional Lie algebras, extending the combinatorial approach from vector spaces and group/ring theory to Lie algebras. By focusing on finite fields, the authors provide a setting where the number of subalgebras is finite and explicitly computable, allowing for precise descriptions of graph invariants. The work highlights that the structure of $\Gamma(L)$ is not merely a function of dimension but is deeply sensitive to the internal Lie structure (e.g., derived algebra dimension, nilpotency, and the action of $\text{ad}_x$ ). The classification of low-dimensional cases and the detailed invariants for $sl_2(\mathbb{F}_q)$ serve as a foundational framework for future investigations into the interplay between Lie algebra geometry and graph theory.